id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.00767 | Black Hole Space-time In Dark Matter Halo | For the first time, we obtain the analytical form of black hole space-time
metric in dark matter halo for the stationary situation. Using the relation
between the rotation velocity (in the equatorial plane) and the spherical
symmetric space-time metric coefficient, we obtain the space-time metric for
pure dark matter. By considering the dark matter halo in spherical symmetric
space-time as part of the energy-momentum tensors in the Einstein field
equation, we then obtain the spherical symmetric black hole solutions in dark
matter halo. Utilizing Newman-Jains method, we further generalize spherical
symmetric black holes to rotational black holes. As examples, we obtain the
space-time metric of black holes surrounded by Cold Dark Matter and Scalar
Field Dark Matter halos, respectively. Our main results regarding the
interaction between black hole and dark matter halo are as follows: (i) For
both dark matter models, the density profile always produces "cusp" phenomenon
in small scale in the relativity situation; (ii) Dark matter halo makes the
black hole horizon to increase but the ergosphere to decrease, while the
magnitude is small; (iii) Dark matter does not change the singularity of black
holes. These results are useful to study the interaction of black hole and dark
matter halo in stationary situation. Particularly, the "cusp" produced in the
$0\sim 1$ kpc scale would be observable in the Milky Way. Perspectives on
future work regarding the applications of our results in astrophysics are also
briefly discussed.
| gr-qc astro-ph.CO astro-ph.HE | for the first time we obtain the analytical form of black hole spacetime metric in dark matter halo for the stationary situation using the relation between the rotation velocity in the equatorial plane and the spherical symmetric spacetime metric coefficient we obtain the spacetime metric for pure dark matter by considering the dark matter halo in spherical symmetric spacetime as part of the energymomentum tensors in the einstein field equation we then obtain the spherical symmetric black hole solutions in dark matter halo utilizing newmanjains method we further generalize spherical symmetric black holes to rotational black holes as examples we obtain the spacetime metric of black holes surrounded by cold dark matter and scalar field dark matter halos respectively our main results regarding the interaction between black hole and dark matter halo are as follows i for both dark matter models the density profile always produces cusp phenomenon in small scale in the relativity situation ii dark matter halo makes the black hole horizon to increase but the ergosphere to decrease while the magnitude is small iii dark matter does not change the singularity of black holes these results are useful to study the interaction of black hole and dark matter halo in stationary situation particularly the cusp produced in the 0sim 1 kpc scale would be observable in the milky way perspectives on future work regarding the applications of our results in astrophysics are also briefly discussed | [['for', 'the', 'first', 'time', 'we', 'obtain', 'the', 'analytical', 'form', 'of', 'black', 'hole', 'spacetime', 'metric', 'in', 'dark', 'matter', 'halo', 'for', 'the', 'stationary', 'situation', 'using', 'the', 'relation', 'between', 'the', 'rotation', 'velocity', 'in', 'the', 'equatorial', 'plane', 'and', 'the', 'spherical', 'symmetric', 'spacetime', 'metric', 'coefficient', 'we', 'obtain', 'the', 'spacetime', 'metric', 'for', 'pure', 'dark', 'matter', 'by', 'considering', 'the', 'dark', 'matter', 'halo', 'in', 'spherical', 'symmetric', 'spacetime', 'as', 'part', 'of', 'the', 'energymomentum', 'tensors', 'in', 'the', 'einstein', 'field', 'equation', 'we', 'then', 'obtain', 'the', 'spherical', 'symmetric', 'black', 'hole', 'solutions', 'in', 'dark', 'matter', 'halo', 'utilizing', 'newmanjains', 'method', 'we', 'further', 'generalize', 'spherical', 'symmetric', 'black', 'holes', 'to', 'rotational', 'black', 'holes', 'as', 'examples', 'we', 'obtain', 'the', 'spacetime', 'metric', 'of', 'black', 'holes', 'surrounded', 'by', 'cold', 'dark', 'matter', 'and', 'scalar', 'field', 'dark', 'matter', 'halos', 'respectively', 'our', 'main', 'results', 'regarding', 'the', 'interaction', 'between', 'black', 'hole', 'and', 'dark', 'matter', 'halo', 'are', 'as', 'follows', 'i', 'for', 'both', 'dark', 'matter', 'models', 'the', 'density', 'profile', 'always', 'produces', 'cusp', 'phenomenon', 'in', 'small', 'scale', 'in', 'the', 'relativity', 'situation', 'ii', 'dark', 'matter', 'halo', 'makes', 'the', 'black', 'hole', 'horizon', 'to', 'increase', 'but', 'the', 'ergosphere', 'to', 'decrease', 'while', 'the', 'magnitude', 'is', 'small', 'iii', 'dark', 'matter', 'does', 'not', 'change', 'the', 'singularity', 'of', 'black', 'holes', 'these', 'results', 'are', 'useful', 'to', 'study', 'the', 'interaction', 'of', 'black', 'hole', 'and', 'dark', 'matter', 'halo', 'in', 'stationary', 'situation', 'particularly', 'the', 'cusp', 'produced', 'in', 'the', '0sim', '1', 'kpc', 'scale', 'would', 'be', 'observable', 'in', 'the', 'milky', 'way', 'perspectives', 'on', 'future', 'work', 'regarding', 'the', 'applications', 'of', 'our', 'results', 'in', 'astrophysics', 'are', 'also', 'briefly', 'discussed']] | [-0.13520846349179336, 0.11327501426289793, -0.11950452493715889, 0.1821479964790127, -0.128400776382017, -0.1006146239957729, -0.06617206624288599, 0.3158628521192394, -0.15287637017973804, -0.35734426777000355, 0.03147309241700477, -0.29464356632478816, -0.05665364653807338, 0.17615648098525744, -0.008765558080496227, 0.0009288500811716046, -0.06093546033263175, 0.024238481433897077, -0.0942472617769661, -0.2415349705867815, 0.40696556626068514, 0.06990798603399963, 0.20126347236123077, 0.004578010863840643, 0.07019580598283984, -0.029059286822686718, -0.02725049797131165, 0.013311500325091655, -0.18710387172558118, 0.022038692748468793, 0.21534420019782255, 0.12294225404156914, 0.15762897264035536, -0.4271153308576924, -0.23180985455853148, 0.13387850150151595, 0.1833108919181464, 0.1611512112028441, -0.1682429764137843, -0.3168091596780101, 0.0599509193156728, -0.25620202388111424, -0.19488064627229915, -0.013724455877132556, 0.045097913566528806, -0.02421343742249895, -0.16674068383283064, 0.20054324750799807, 0.05573622419553876, -0.1347576430782613, -0.126250383115515, -0.07012784662941385, -0.02887509244136544, 0.015469681380222304, 0.14547166906450462, 0.004485192872733192, 0.25587808652604116, -0.16547604215248854, -0.03575305459787087, 0.40592612428315583, -0.10311601784095986, -0.16607308590838457, 0.12988420743652412, -0.24811063287386725, -0.09882840386470033, 0.07511949436522958, 0.1520170614649915, 0.1506111828908953, -0.10063919474916996, 0.14367661593611575, -0.03458547426971218, 0.17197922926066042, 0.12235415755389926, 0.044221709676397346, 0.42635931900627755, 0.10584867535009666, 0.06305144740001373, 0.09099270333093885, -0.07751458215739436, -0.09945953311791589, -0.32223730959501196, -0.15423951681235704, -0.1554933554789578, 0.02856355191770605, -0.18180496139890998, -0.14102978784471107, 0.3027816403761333, 0.06582409121441941, 0.16359324755642232, 0.009127340542804842, 0.28854540241460996, 0.03805655492852807, -0.01768152196282513, 0.11573397091743123, 0.34315999938403, 0.1739410339669965, 0.1272458729819485, -0.21713585082543738, -0.075986907862522, 0.03807866010757926] |
1,803.00768 | Periodic Gibbs measures for the Potts-SOS model on a Cayley tree | In this paper for the Potts-SOS model on a Cayley tree under some conditions
the existence of at least one periodic (non translation-invariant) Gibbs
measure is proved.
| math-ph math.MP | in this paper for the pottssos model on a cayley tree under some conditions the existence of at least one periodic non translationinvariant gibbs measure is proved | [['in', 'this', 'paper', 'for', 'the', 'pottssos', 'model', 'on', 'a', 'cayley', 'tree', 'under', 'some', 'conditions', 'the', 'existence', 'of', 'at', 'least', 'one', 'periodic', 'non', 'translationinvariant', 'gibbs', 'measure', 'is', 'proved']] | [-0.14978234419742456, 0.16889638669538096, -0.13288118541598892, 0.09815628511401323, -0.005994928454478772, -0.1562784985245134, 0.03682277940410691, 0.3588202711051473, -0.2638912476026095, -0.16436573977653796, 0.16847832328550374, -0.26525154810112256, -0.1129643593986447, 0.16068012699878848, -0.06089256535499142, 0.06898739317861888, 0.09683173701453668, 0.15515709679143933, -0.03732561939754165, -0.2750918477630386, 0.3840739346969013, -0.002999407460895152, 0.2593902005599095, 0.09000310490507847, 0.14567129206485474, 0.002376488481576626, 0.039449512063024134, -0.015669187530875206, -0.18726869797907197, 0.02537978675144796, 0.181559366818804, 0.04379435340300775, 0.29381086505376375, -0.31537787422824365, -0.22548072426938093, 0.24363759801221582, 0.028123577411931295, 0.06662975660023782, -0.030317203164136466, -0.23783491924405098, 0.17069601851443833, -0.09110253777068394, -0.20347106012587363, -0.04366709628643898, -0.019030035473406315, -0.02233148129800191, -0.2806828455068171, 0.036842135819964685, 0.13595624131938586, 0.09987184985612448, -0.08977612057844034, -0.09462819123067535, 0.0003723410817866142, 0.015734542805988055, 0.0012269308118937681, 0.0041629052720963955, -0.01539375984038298, -0.04725603034827285, -0.11150893651378843, 0.36112322916205114, -0.08136406762955281, -0.27271472784475637, 0.23829214905317014, -0.13558093465578097, -0.2726451190403448, 0.1065215365961194, 0.13352419751194808, 0.13802522227454644, -0.22859688604680392, 0.13657172013504001, -0.11532107876757017, 0.06785247009247541, 0.1640430623307251, -0.02063626702874899, 0.15778056815123329, 0.16399386768730786, 0.23496075286171758, 0.18273438993268287, 0.0009444526199681255, -0.10562422298468076, -0.32756681897892403, -0.12011154669408615, -0.22525986316255653, 0.048735488385248646, -0.08485711840554498, -0.27737801500524467, 0.4389940488796968, 0.14525429897296888, 0.13509502419485495, 0.12707955576479435, 0.19641481366796562, 0.09868307504802942, -0.048821872274857014, 0.1061574258805754, 0.11692102980249239, 0.16079044326817474, -0.007638185320851894, -0.14801853520867342, 0.09379085223190486, 0.17255091541804946] |
1,803.00769 | Ground states for Potts model with a countable set of spin values on a
Cayley tree | We consider Potts model, with competing interactions and countable spin
values $\Phi=\{0,1,\dots \}$ on a Cayley tree of order three. We study periodic
ground states for this model.
| math-ph math.MP | we consider potts model with competing interactions and countable spin values phi01dots on a cayley tree of order three we study periodic ground states for this model | [['we', 'consider', 'potts', 'model', 'with', 'competing', 'interactions', 'and', 'countable', 'spin', 'values', 'phi01dots', 'on', 'a', 'cayley', 'tree', 'of', 'order', 'three', 'we', 'study', 'periodic', 'ground', 'states', 'for', 'this', 'model']] | [-0.19176131959718007, 0.23953122437859958, 0.04511833372481096, 0.10939468767117852, -0.05585287941189913, -0.1278109174185934, 0.07787243553544752, 0.4090636507249795, -0.2151684589110888, -0.24871121533215046, 0.09453676752029704, -0.35086383828176904, -0.11011000722646713, 0.06090077632688917, 0.10286179639828893, 0.041237204779463354, 0.06625353201077534, 0.09796227589966013, -0.03178341575683309, -0.21265833868752593, 0.3754915061335151, -0.11489991295652893, 0.26182520317916685, 0.03810296042893942, 0.11578407013215698, 0.07841815208443083, 0.10783856061215584, 0.009409941231402067, -0.23609111569105432, 0.07187528953699467, 0.188354323976315, -0.020727160189730618, 0.17567242309451103, -0.41494260857311577, -0.24533273548317644, 0.22727914595116788, 0.06207376138235514, 0.15531852368551952, 0.034809802170807064, -0.3061177699038616, 0.042654014917878576, -0.2565975563170818, -0.11599940276489808, -0.1205953499660469, -0.026479532440694478, -0.009170763991558207, -0.3056347822197355, 0.038238675870861, 0.10684879217296839, 0.0962435849942267, -0.1169411414481986, -0.14077382226689503, -0.015771828305262785, 0.08712688885414256, -0.005205694509920879, 0.003693437194809891, -0.016930779836212214, -0.10470835620071739, -0.25377084121394616, 0.38057429895091516, -0.09372403095207679, -0.22603290383883107, 0.2161892225356916, -0.14962497138633177, -0.2302410539884407, 0.047075629520874754, 0.212462418139554, 0.10680870439570683, -0.08617649116338445, 0.10493778032385027, -0.05763271157271587, 0.1561898888232043, -0.013202641804057818, -0.04710061429068446, 0.19777313422841522, 0.23354872308958036, 0.07520334891831645, 0.24714053515344858, -0.05291627489854223, -0.1821457898387542, -0.22668470814824104, -0.08126075877449833, -0.17556223559838074, 0.02992917815796458, -0.1147853438378661, -0.23074284396492517, 0.49702919367700815, 0.20310775749385357, 0.15373792133938807, 0.12813242001888844, 0.20241322703301334, 0.05673923762515187, -0.04664327243629556, 0.028037101043782268, 0.10268954990897328, 0.13856223330367357, -0.0830930451540133, -0.18007586620604762, 0.02189548541075335, 0.1527562294012079] |
1,803.0077 | Anomalous Critical Slowdown at a First Order Phase Transition in Single
Polymer Chains | Using Brownian Dynamics, we study the dynamical behavior of a polymer grafted
onto an adhesive surface close to the mechanically induced
adsorption-stretching transition. Even though the transition is first order,
(in the infinite chain length limit, the stretching degree of the chain jumps
discontinuously), the characteristic relaxation time is found to grow according
to a power law as the transition point is approached. We present a dynamic
effective interface model which reproduces these observations and provides an
excellent quantitaive description of the simulations data. The generic nature
of the theoretical model suggests that the unconventional mixing of features
that are characteristic for first-order transitions (a jump in an order
parameter) and features that are characteristic of critical points (anomalous
slowdown) may be a common phenomenon in force-driven phase transitions of
macromolecules.
| cond-mat.soft | using brownian dynamics we study the dynamical behavior of a polymer grafted onto an adhesive surface close to the mechanically induced adsorptionstretching transition even though the transition is first order in the infinite chain length limit the stretching degree of the chain jumps discontinuously the characteristic relaxation time is found to grow according to a power law as the transition point is approached we present a dynamic effective interface model which reproduces these observations and provides an excellent quantitaive description of the simulations data the generic nature of the theoretical model suggests that the unconventional mixing of features that are characteristic for firstorder transitions a jump in an order parameter and features that are characteristic of critical points anomalous slowdown may be a common phenomenon in forcedriven phase transitions of macromolecules | [['using', 'brownian', 'dynamics', 'we', 'study', 'the', 'dynamical', 'behavior', 'of', 'a', 'polymer', 'grafted', 'onto', 'an', 'adhesive', 'surface', 'close', 'to', 'the', 'mechanically', 'induced', 'adsorptionstretching', 'transition', 'even', 'though', 'the', 'transition', 'is', 'first', 'order', 'in', 'the', 'infinite', 'chain', 'length', 'limit', 'the', 'stretching', 'degree', 'of', 'the', 'chain', 'jumps', 'discontinuously', 'the', 'characteristic', 'relaxation', 'time', 'is', 'found', 'to', 'grow', 'according', 'to', 'a', 'power', 'law', 'as', 'the', 'transition', 'point', 'is', 'approached', 'we', 'present', 'a', 'dynamic', 'effective', 'interface', 'model', 'which', 'reproduces', 'these', 'observations', 'and', 'provides', 'an', 'excellent', 'quantitaive', 'description', 'of', 'the', 'simulations', 'data', 'the', 'generic', 'nature', 'of', 'the', 'theoretical', 'model', 'suggests', 'that', 'the', 'unconventional', 'mixing', 'of', 'features', 'that', 'are', 'characteristic', 'for', 'firstorder', 'transitions', 'a', 'jump', 'in', 'an', 'order', 'parameter', 'and', 'features', 'that', 'are', 'characteristic', 'of', 'critical', 'points', 'anomalous', 'slowdown', 'may', 'be', 'a', 'common', 'phenomenon', 'in', 'forcedriven', 'phase', 'transitions', 'of', 'macromolecules']] | [-0.17067597835331924, 0.1983300186056317, -0.12882896344711672, 0.041281882629282195, -0.040261138447148855, -0.1325375084853695, 0.04446159785274099, 0.35145176030955344, -0.29848491084624745, -0.2504826617217803, 0.07717718383705229, -0.2928381544978235, -0.16800390180315852, 0.148127299213652, 0.015393368477478277, 0.03145187090930724, -0.014504311674873727, 0.02240018646211125, -0.051200672740463256, -0.13735974234954793, 0.2643415313358455, 0.054302021391128455, 0.2810089958456251, 0.03671679775909225, 0.0758519718548023, -0.04738183436525423, 0.08835613263352204, 0.052620760881188125, -0.18752496885473058, 0.038209616780540974, 0.23934543632916644, -0.008605769956340046, 0.19829732715332693, -0.41272968569293966, -0.22923722598961618, 0.09050728333933467, 0.15230071691655403, 0.12625811301269244, -0.019936537839356783, -0.2422187355050976, 0.051900106803477966, -0.11121616553451573, -0.15803554380869708, -0.06734318621167841, 0.03188562922381846, 0.028520988758884428, -0.2450383857376296, 0.0919321328390285, 0.10991321757770606, 0.08072518470675447, -0.04420982201605342, -0.03570727080597665, -0.019710478762727836, 0.14306513906380725, 0.06482771144324351, 0.01790572503083494, 0.17621332903342077, -0.12009172179093656, -0.1016583365691436, 0.3903309872243987, -0.08396387603151965, -0.11490781959035712, 0.21665682438616604, -0.14947006703433832, -0.11356379029651482, 0.21123877011759337, 0.14361471637303747, 0.09045299994264046, -0.12053021148403081, 0.060444224281994585, 0.002145819914664409, 0.19334915824087387, 0.011576728689549275, -0.023480786992482437, 0.2285370477655715, 0.2127776705089581, 0.02685886173140864, 0.1794497980005216, -0.08630938205665858, -0.17470539307813773, -0.3083778541939434, -0.17059109169383382, -0.20260816635636164, 0.04733902039078548, -0.12640430655870985, -0.20336962704792214, 0.37512697548742674, 0.14684555424575466, 0.2545752350002701, 0.05639277525740683, 0.22240980730803553, 0.14510091561589447, 0.031295859005822, 0.03237496208500608, 0.21925114818790914, 0.11975075012386971, 0.06402442177356936, -0.2563629972445237, 0.10781922827785213, 0.05447226123818442] |
1,803.00771 | Modified midpoint integration rule for the trilinear element in large
deformation elasticity | In this paper we suggest two modified one-point Gauss integration rules for
the Q1 bi- or trilinear element. The modifications both stabilize the hourglass
modes of the one-point rule, and one of them is accurate also on severely
distorted elements. We investigate the performance of the integration rules for
the hexahedron element, and combine standard one-point integration of the
volumetric terms with the modified rules for the isochoric terms to handle near
incompressible situations.
| math.NA | in this paper we suggest two modified onepoint gauss integration rules for the q1 bi or trilinear element the modifications both stabilize the hourglass modes of the onepoint rule and one of them is accurate also on severely distorted elements we investigate the performance of the integration rules for the hexahedron element and combine standard onepoint integration of the volumetric terms with the modified rules for the isochoric terms to handle near incompressible situations | [['in', 'this', 'paper', 'we', 'suggest', 'two', 'modified', 'onepoint', 'gauss', 'integration', 'rules', 'for', 'the', 'q1', 'bi', 'or', 'trilinear', 'element', 'the', 'modifications', 'both', 'stabilize', 'the', 'hourglass', 'modes', 'of', 'the', 'onepoint', 'rule', 'and', 'one', 'of', 'them', 'is', 'accurate', 'also', 'on', 'severely', 'distorted', 'elements', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'integration', 'rules', 'for', 'the', 'hexahedron', 'element', 'and', 'combine', 'standard', 'onepoint', 'integration', 'of', 'the', 'volumetric', 'terms', 'with', 'the', 'modified', 'rules', 'for', 'the', 'isochoric', 'terms', 'to', 'handle', 'near', 'incompressible', 'situations']] | [-0.09223746240290033, 0.06183223393619866, -0.03829096519463771, 0.0960573486581042, -0.07878966060643261, -0.09769687885921952, 0.06246230491543994, 0.35122456356278947, -0.280491200527428, -0.1961247450923799, 0.12552949836803284, -0.26271752715488345, -0.1285234352737363, 0.17999715800711735, -0.028829512664595165, 0.04821237435916791, 0.05428858744483944, 0.011196835520299705, -0.13152447622977323, -0.24722740922525926, 0.3409505398138552, 0.02610493209716436, 0.29379860811388575, 0.029435730696580297, 0.10553648787223406, -0.014443776003915715, -0.057017438063347664, 0.021094552266436653, -0.12387720080142892, 0.15514110510766105, 0.17726052137142098, 0.04466481355169939, 0.1741097581295951, -0.44453647126116463, -0.19577725841726706, 0.08027677085703692, 0.13870266123794373, 0.06954874711211871, 0.007826909012274464, -0.2126727945114662, 0.09540068005043321, -0.19058997244448275, -0.16858432900059866, -0.12603880203253515, -0.03641942172072123, 0.036192367180577806, -0.3196097814125588, 0.08227121847252224, 0.06712575881062327, 0.02215227404156247, -0.03166829127616979, -0.1408948381557255, -0.0008552279512121065, 0.09179473570485071, 0.019224658806657267, -0.017494549307770824, 0.10640288427522457, -0.14208254950259486, -0.08522678773246102, 0.4135400362413477, -0.05285041329350222, -0.24945461010950543, 0.15512025225404147, -0.10882830248541527, -0.11470190935289941, 0.11034091388353624, 0.12893387701714765, 0.12549465867011128, -0.11491831988599654, 0.0924899923549084, 0.047072021287513546, 0.1277544768778859, 0.1046371142304427, 0.02149880577073074, 0.20589531562605723, 0.10125261430181814, 0.006694193639968698, 0.1557145294406124, -0.0978479941278803, -0.12762225784889952, -0.3242287690675742, -0.22107519593378497, -0.12543574833260798, -0.013888912174750018, -0.14088526131495568, -0.2387100345883015, 0.38264152442885413, 0.13593212686906997, 0.14476774903006437, 0.06943232705816627, 0.27875173952732535, 0.1310615996984337, 0.10649455905061316, 0.016618403694214853, 0.22808691694041733, 0.08456263978921531, 0.08136784139945097, -0.26126482728491157, 0.024602681495928886, 0.1484008318039815] |
1,803.00772 | Guiding neutral particles endowed with a magnetic moment by an
electromagnetic wave carrying orbital angular momentum. II. Quantum mechanics | The quantum mechanical states of the neutral particle endowed with a magnetic
moment in the combination of electromagnetic vortex field together with the
constant magnetic field are dealt with. It is shown that this system of fields
is capable to capture the particle in the perpendicular direction and guide it
along the propagating wave. The quantum evolution is subject to tunneling
processes, which can destroy the delicate trapping mechanism. The probability
of these processes show that it should be in principle possible to catch and
guide the particle for the time of several microseconds. This time can be
lengthened by the appropriate adjustments of the external magnetic field.
| quant-ph | the quantum mechanical states of the neutral particle endowed with a magnetic moment in the combination of electromagnetic vortex field together with the constant magnetic field are dealt with it is shown that this system of fields is capable to capture the particle in the perpendicular direction and guide it along the propagating wave the quantum evolution is subject to tunneling processes which can destroy the delicate trapping mechanism the probability of these processes show that it should be in principle possible to catch and guide the particle for the time of several microseconds this time can be lengthened by the appropriate adjustments of the external magnetic field | [['the', 'quantum', 'mechanical', 'states', 'of', 'the', 'neutral', 'particle', 'endowed', 'with', 'a', 'magnetic', 'moment', 'in', 'the', 'combination', 'of', 'electromagnetic', 'vortex', 'field', 'together', 'with', 'the', 'constant', 'magnetic', 'field', 'are', 'dealt', 'with', 'it', 'is', 'shown', 'that', 'this', 'system', 'of', 'fields', 'is', 'capable', 'to', 'capture', 'the', 'particle', 'in', 'the', 'perpendicular', 'direction', 'and', 'guide', 'it', 'along', 'the', 'propagating', 'wave', 'the', 'quantum', 'evolution', 'is', 'subject', 'to', 'tunneling', 'processes', 'which', 'can', 'destroy', 'the', 'delicate', 'trapping', 'mechanism', 'the', 'probability', 'of', 'these', 'processes', 'show', 'that', 'it', 'should', 'be', 'in', 'principle', 'possible', 'to', 'catch', 'and', 'guide', 'the', 'particle', 'for', 'the', 'time', 'of', 'several', 'microseconds', 'this', 'time', 'can', 'be', 'lengthened', 'by', 'the', 'appropriate', 'adjustments', 'of', 'the', 'external', 'magnetic', 'field']] | [-0.15294094093917887, 0.23000149791025454, -0.06080449008300935, 0.05781753694625675, -0.06846134936333531, -0.11129640557165085, -0.008413051894792632, 0.3892158171920865, -0.3092755699202556, -0.31957445478204777, 0.05124796070783675, -0.2203680908617874, -0.08205374764037077, 0.1917902097371148, 0.015276100020855665, 0.03266312538094267, 0.04202355142829388, 0.08497430272702197, 0.020205776167804963, -0.2164303232049052, 0.30751837964204176, 0.09587815795007541, 0.2567992254194838, 0.04553727568903317, 0.09924247705688079, 0.007001307971896259, 0.026008998095575307, 0.05408327470326589, -0.08503832721167041, 0.057763755592599476, 0.18419900974172546, 0.053795753777699754, 0.25245268021158324, -0.5081793888196073, -0.22915228443323737, 0.059530814124392, 0.12001316111828028, 0.14512362406067378, -0.05591441942508229, -0.2986702912625063, 0.05196077684457931, -0.0968247588844625, -0.17880743071523117, -0.07428208472966044, 0.008765470612733797, 0.07296989344198394, -0.2830113272217137, 0.03729484588149245, 0.07925274548081991, 0.011676654835119498, -0.0558623791180758, -0.015470025408797449, -0.009947976196633169, 0.09666007546345806, 0.10065563297959873, 0.10839879711986417, 0.16961585695389658, -0.13220799904040717, -0.12707262689299467, 0.3796757938926695, -0.05451816600355044, -0.20434150930614797, 0.1712741424260592, -0.1786343286210602, -0.04841170004241307, 0.16825258176929006, 0.13844689443983413, 0.10405412664705957, -0.14280318681374882, 0.0689663614083892, 0.010961199722697967, 0.12297778662846044, 0.04931617674366054, 0.043679081162230834, 0.27250522896819923, 0.1259193301062893, 0.06648144266499137, 0.11695566242431393, -0.10562198474589321, -0.12001198297420396, -0.29433414863888174, -0.20050357750625591, -0.17180856099110786, 0.05690850900457547, -0.05299278189219573, -0.1494312064592291, 0.3979920483133928, 0.18578739864406763, 0.16051731289432306, -0.040033964654732565, 0.27614112536388413, 0.15515347566084797, 0.10046500437763622, 0.029892659547773225, 0.2859301843542468, 0.16895184728222107, 0.11785070663662972, -0.26960613700578473, 0.06051344301172153, -0.010117260295104373] |
1,803.00773 | Optimality of 1-norm regularization among weighted 1-norms for sparse
recovery: a case study on how to find optimal regularizations | The 1-norm was proven to be a good convex regularizer for the recovery of
sparse vectors from under-determined linear measurements. It has been shown
that with an appropriate measurement operator, a number of measurements of the
order of the sparsity of the signal (up to log factors) is sufficient for
stable and robust recovery. More recently, it has been shown that such recovery
results can be generalized to more general low-dimensional model sets and
(convex) regularizers. These results lead to the following question: to recover
a given low-dimensional model set from linear measurements, what is the "best"
convex regularizer? To approach this problem, we propose a general framework to
define several notions of "best regularizer" with respect to a low-dimensional
model. We show in the minimal case of sparse recovery in dimension 3 that the
1-norm is optimal for these notions. However, generalization of such results to
the n-dimensional case seems out of reach. To tackle this problem, we propose
looser notions of best regularizer and show that the 1-norm is optimal among
weighted 1-norms for sparse recovery within this framework.
| cs.IT math.IT | the 1norm was proven to be a good convex regularizer for the recovery of sparse vectors from underdetermined linear measurements it has been shown that with an appropriate measurement operator a number of measurements of the order of the sparsity of the signal up to log factors is sufficient for stable and robust recovery more recently it has been shown that such recovery results can be generalized to more general lowdimensional model sets and convex regularizers these results lead to the following question to recover a given lowdimensional model set from linear measurements what is the best convex regularizer to approach this problem we propose a general framework to define several notions of best regularizer with respect to a lowdimensional model we show in the minimal case of sparse recovery in dimension 3 that the 1norm is optimal for these notions however generalization of such results to the ndimensional case seems out of reach to tackle this problem we propose looser notions of best regularizer and show that the 1norm is optimal among weighted 1norms for sparse recovery within this framework | [['the', '1norm', 'was', 'proven', 'to', 'be', 'a', 'good', 'convex', 'regularizer', 'for', 'the', 'recovery', 'of', 'sparse', 'vectors', 'from', 'underdetermined', 'linear', 'measurements', 'it', 'has', 'been', 'shown', 'that', 'with', 'an', 'appropriate', 'measurement', 'operator', 'a', 'number', 'of', 'measurements', 'of', 'the', 'order', 'of', 'the', 'sparsity', 'of', 'the', 'signal', 'up', 'to', 'log', 'factors', 'is', 'sufficient', 'for', 'stable', 'and', 'robust', 'recovery', 'more', 'recently', 'it', 'has', 'been', 'shown', 'that', 'such', 'recovery', 'results', 'can', 'be', 'generalized', 'to', 'more', 'general', 'lowdimensional', 'model', 'sets', 'and', 'convex', 'regularizers', 'these', 'results', 'lead', 'to', 'the', 'following', 'question', 'to', 'recover', 'a', 'given', 'lowdimensional', 'model', 'set', 'from', 'linear', 'measurements', 'what', 'is', 'the', 'best', 'convex', 'regularizer', 'to', 'approach', 'this', 'problem', 'we', 'propose', 'a', 'general', 'framework', 'to', 'define', 'several', 'notions', 'of', 'best', 'regularizer', 'with', 'respect', 'to', 'a', 'lowdimensional', 'model', 'we', 'show', 'in', 'the', 'minimal', 'case', 'of', 'sparse', 'recovery', 'in', 'dimension', '3', 'that', 'the', '1norm', 'is', 'optimal', 'for', 'these', 'notions', 'however', 'generalization', 'of', 'such', 'results', 'to', 'the', 'ndimensional', 'case', 'seems', 'out', 'of', 'reach', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'looser', 'notions', 'of', 'best', 'regularizer', 'and', 'show', 'that', 'the', '1norm', 'is', 'optimal', 'among', 'weighted', '1norms', 'for', 'sparse', 'recovery', 'within', 'this', 'framework']] | [-0.03630983950828926, 0.016571815441986677, -0.07442863474393056, 0.06704544511869447, -0.08816853364308676, -0.1489415080186316, 0.016246733985220394, 0.3879475507600647, -0.3428481419519004, -0.2826458722446761, 0.12131863466024193, -0.2642126391486575, -0.2167608097428456, 0.1781730655179773, -0.15240985878044738, 0.14052338214177224, 0.054826560670820375, 0.06110061331031223, -0.11583219341054145, -0.2962498005479574, 0.29249408754209677, 0.044481989593219216, 0.25752505011882426, 0.03531421608705487, 0.12255337091628463, -0.01400788970834886, 0.004865498138436427, 0.05792567302317669, -0.1098586434584124, 0.1569721459915551, 0.316906022057972, 0.19392967128272479, 0.31486152010555896, -0.38154574036598204, -0.21740610936346152, 0.17294018331190777, 0.08180343743491297, 0.11008055300400076, -0.010443060801965961, -0.24961524048768396, 0.1401617857905674, -0.11679015219108098, -0.07123387603270304, -0.14738201202643622, -0.03067633046561645, -0.043518776879257835, -0.376273367429773, 0.06622345143825643, 0.11026456085447636, -0.016768512496734427, -0.09661948846187443, -0.11834749133817644, 0.05559360255202692, 0.061913009804751104, 0.05222278355116335, 0.0678733107038877, 0.058961880458001464, -0.08470362171970515, -0.107058717085359, 0.37202156307951856, -0.03611917254424447, -0.2521269150608633, 0.1740123263004029, -0.12194163386916948, -0.14070342507782496, 0.09598797630104754, 0.20159260334007234, 0.12144549121666286, -0.15659847885059813, 0.06695070839907405, -0.12988361711613833, 0.1426727198685209, 0.038420451992553555, 0.04470341827319418, 0.10194632287602871, 0.17908157332696847, 0.1806170904620861, 0.15003359587345685, -0.05102174881742232, -0.05762168494467106, -0.2631450406120469, -0.10294110065119134, -0.20111223046745483, 0.017007651618526628, -0.11507684221829145, -0.1419654852151224, 0.37794808813163805, 0.14468822630587966, 0.2368240195947389, 0.09469224834659447, 0.2957911120087374, 0.11366025145374199, 0.05625291173734392, 0.09068793473868735, 0.23453201921139327, 0.15848930420147048, 0.009622026483217876, -0.17115300075577883, 0.08019200091107956, 0.06285375934870292] |
1,803.00774 | Competition in periodic media: III -- Existence \& stability of
segregated periodic coexistence states | In this paper we consider a system of parabolic reaction-diffusion equations
with strong competition and two related scalar reaction-diffusion equations. We
are mainly concerned with the case of periodic coefficients and periodic
solutions. We show that, for sufficiently large periods, these models have
stationary, non-constant, fully non-trivial and stable solutions. We compare
our results with already known results about the existence and non-existence of
such solutions. Finally, we provide ecological interpretations for these
results in terms of resistance against an invasion.
| math.AP | in this paper we consider a system of parabolic reactiondiffusion equations with strong competition and two related scalar reactiondiffusion equations we are mainly concerned with the case of periodic coefficients and periodic solutions we show that for sufficiently large periods these models have stationary nonconstant fully nontrivial and stable solutions we compare our results with already known results about the existence and nonexistence of such solutions finally we provide ecological interpretations for these results in terms of resistance against an invasion | [['in', 'this', 'paper', 'we', 'consider', 'a', 'system', 'of', 'parabolic', 'reactiondiffusion', 'equations', 'with', 'strong', 'competition', 'and', 'two', 'related', 'scalar', 'reactiondiffusion', 'equations', 'we', 'are', 'mainly', 'concerned', 'with', 'the', 'case', 'of', 'periodic', 'coefficients', 'and', 'periodic', 'solutions', 'we', 'show', 'that', 'for', 'sufficiently', 'large', 'periods', 'these', 'models', 'have', 'stationary', 'nonconstant', 'fully', 'nontrivial', 'and', 'stable', 'solutions', 'we', 'compare', 'our', 'results', 'with', 'already', 'known', 'results', 'about', 'the', 'existence', 'and', 'nonexistence', 'of', 'such', 'solutions', 'finally', 'we', 'provide', 'ecological', 'interpretations', 'for', 'these', 'results', 'in', 'terms', 'of', 'resistance', 'against', 'an', 'invasion']] | [-0.17180679198124527, 0.08043226360125656, -0.00949980747414592, 0.05095249264253832, -0.036179821116182904, -0.14622666881661173, -0.027360280790297245, 0.3286488004212762, -0.24079389095214415, -0.23377366283517562, 0.16179963747717807, -0.3139428874656679, -0.24025161335543718, 0.21486050028491904, -0.05763348272173769, 0.08746743182663197, 0.09643539910515149, -0.0017448417597341088, -0.021242586099600166, -0.261594939712481, 0.3918643265166377, -0.08667915830687609, 0.20644919169537815, 0.05995632396482023, 0.09821690829976658, -0.07347566279709156, -0.01922945943977224, 0.062128778983965335, -0.22822419448547643, 0.08452820675562561, 0.24506654213442228, 0.06435595599193927, 0.24429721392714132, -0.45982288743978667, -0.20209440181928653, 0.1211420471943846, 0.14014879930879415, 0.17262876257415355, -0.09662151552828742, -0.2843969191315319, 0.13781834503256338, -0.152811185479808, -0.21354925899225988, -0.11003660412942186, 0.005879662338828231, 0.13023314345053133, -0.25881189869337334, 0.1035284652420676, 0.08245728040734927, 0.06586396963232094, -0.20031006303098467, -0.09762478949944776, 0.0061711232310138, 0.09122505279855779, 0.11384004847589237, -0.07205272463069838, -0.02871886326322033, -0.14169383541979816, -0.14000275045961003, 0.3301011327378176, -0.13453125589840506, -0.2756580096428041, 0.28520976525535924, -0.1318437868648749, -0.1349362230192824, 0.0939894936127979, 0.19446947556104005, 0.14996016289992833, -0.13479643852024534, 0.055564881736458634, -0.07374710995807415, 0.15094348584750183, 0.0909707397280008, 0.01554556566371042, 0.14676753217986796, 0.1426002633654409, 0.09926689257212903, 0.12864404236955315, 0.009251890916745236, -0.15508252552446025, -0.3238572856572307, -0.10951338312876077, -0.05517221306577141, 0.08201124777810441, -0.09754258927667836, -0.20405135495749152, 0.4008285995101395, 0.15334587122233193, 0.1644498144943313, 0.09634960248468467, 0.20189231435802799, 0.15224745094253003, -0.04283323143551379, 0.07216968704237786, 0.22137388331171723, 0.12279417499738896, 0.10832825145270261, -0.20980487560370453, 0.0654126631417944, 0.04627399447799465] |
1,803.00775 | Higher derivative corrections to the entropic force from holography | The entropic force has been recently argued to be responsible for
dissociation of heavy quarkonia. In this paper, we analyze $R^2$ corrections
and $R^4$ corrections to the entropic force, respectively. It is shown that for
$R^2$ corrections, increasing $\lambda_{GB}$ (Gauss-Bonnet factor) leads to
increasing the entropic force. While for $R^4$ corrections, increasing
$\lambda$ ('t Hooft coupling) leads to decreasing the entropic force. Also, we
discuss how the entropic force changes with the shear viscosity to entropy
density ratio, $\eta/s$, at strong coupling.
| hep-th | the entropic force has been recently argued to be responsible for dissociation of heavy quarkonia in this paper we analyze r2 corrections and r4 corrections to the entropic force respectively it is shown that for r2 corrections increasing lambda_gb gaussbonnet factor leads to increasing the entropic force while for r4 corrections increasing lambda t hooft coupling leads to decreasing the entropic force also we discuss how the entropic force changes with the shear viscosity to entropy density ratio etas at strong coupling | [['the', 'entropic', 'force', 'has', 'been', 'recently', 'argued', 'to', 'be', 'responsible', 'for', 'dissociation', 'of', 'heavy', 'quarkonia', 'in', 'this', 'paper', 'we', 'analyze', 'r2', 'corrections', 'and', 'r4', 'corrections', 'to', 'the', 'entropic', 'force', 'respectively', 'it', 'is', 'shown', 'that', 'for', 'r2', 'corrections', 'increasing', 'lambda_gb', 'gaussbonnet', 'factor', 'leads', 'to', 'increasing', 'the', 'entropic', 'force', 'while', 'for', 'r4', 'corrections', 'increasing', 'lambda', 't', 'hooft', 'coupling', 'leads', 'to', 'decreasing', 'the', 'entropic', 'force', 'also', 'we', 'discuss', 'how', 'the', 'entropic', 'force', 'changes', 'with', 'the', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'at', 'strong', 'coupling']] | [-0.14698360719371634, 0.23861781227197953, -0.12177716554483263, 0.09140997801384912, -0.048294945256557406, -0.18639960272305803, -0.009609406681947137, 0.29107032559539486, -0.24920751971033653, -0.24388288206806996, -0.057986417769670215, -0.3451049956038776, -0.08914257508202843, 0.11571044508912941, -0.046515234700608546, 0.07433214429311635, -0.06436939568616586, 0.048837382885877315, -0.03201261651986165, -0.22385200535276586, 0.30769429054883557, 0.10348504429637659, 0.234875553446572, 0.2631549987226452, 0.044789015156466785, -0.06197986335126455, 0.031450861582259945, 0.12194458140832622, -0.24307078706633325, 0.0664215523284816, 0.17280290466619702, -0.04943001907739061, 0.22641147494815836, -0.377058956522222, -0.22147030127802636, 0.12704174482354486, 0.13534917509773883, 0.13760958593509093, -0.014678183977105996, -0.22472988755056045, 0.005533457233956675, -0.21496978236316908, -0.13137659517957306, -0.1560056394125085, 0.17849509574745487, -0.03319615369915349, -0.32966562803471233, 0.16160007480712232, 0.02292214761056551, -0.016404883027440163, -0.0475331003800398, -0.11201867387380178, -0.033418021851968835, 0.051151539494351646, 0.23026717736715133, 0.1711633565080375, 0.1909447823787426, -0.13777055870457666, -0.03509743962573206, 0.37407926813040565, -0.10523717234865194, -0.1764521618123825, 0.13836725551362444, -0.12417107750093792, -0.14193446878003094, 0.12441960730726218, 0.13544881292732386, 0.06323629778968852, -0.10818962122472685, 0.14174767802739174, 0.1063034307700014, 0.1699304578416958, 0.13500521319532177, 0.054074233616475106, 0.17508845463985714, 0.049280751059286115, 0.06398120057405676, 0.19467694816469192, -0.08471207910717078, -0.10914718686239566, -0.3301842996123724, -0.14224752609436286, -0.1325202854903892, 0.07392965956795507, -0.1830510993191061, -0.11845557982344805, 0.21313836838391315, 0.15934721304376315, 0.17403510109402193, 0.07964242756275869, 0.27165859804216136, 0.16648586437378715, 0.12954843303234112, 0.04511984365583375, 0.38388945212269704, 0.1791673220307907, 0.10518092928147625, -0.3485810951636423, 0.025703209378506717, 0.12388159975511726] |
1,803.00776 | Microhartree Precision in Density-Functional-Theory Calculations | To address ultimate precision in density-functional-theory calculations we
employ the full-potential linearized augmented planewave + local-orbital
(LAPW+lo) method and justify its usage as a benchmark method. LAPW+lo and two
completely unrelated numerical approaches, multi-resolution analysis (MRA) and
linear combination of atomic orbitals, yield total energies of atoms with a
mean deviation of 0.9~{\mu}Ha and 0.2~{\mu}Ha, respectively. Spectacular
agreement with the MRA is reached also for total and atomization energies of
the G2-1 set consisting of 55 molecules. With the example of $\alpha$-iron we
demonstrate the capability of LAPW+lo of reaching {\mu}Ha/atom precision also
for periodic systems, which allows also for distinction between numerical
precision and the accuracy of a given functional.
| physics.comp-ph cond-mat.mtrl-sci | to address ultimate precision in densityfunctionaltheory calculations we employ the fullpotential linearized augmented planewave localorbital lapwlo method and justify its usage as a benchmark method lapwlo and two completely unrelated numerical approaches multiresolution analysis mra and linear combination of atomic orbitals yield total energies of atoms with a mean deviation of 09muha and 02muha respectively spectacular agreement with the mra is reached also for total and atomization energies of the g21 set consisting of 55 molecules with the example of alphairon we demonstrate the capability of lapwlo of reaching muhaatom precision also for periodic systems which allows also for distinction between numerical precision and the accuracy of a given functional | [['to', 'address', 'ultimate', 'precision', 'in', 'densityfunctionaltheory', 'calculations', 'we', 'employ', 'the', 'fullpotential', 'linearized', 'augmented', 'planewave', 'localorbital', 'lapwlo', 'method', 'and', 'justify', 'its', 'usage', 'as', 'a', 'benchmark', 'method', 'lapwlo', 'and', 'two', 'completely', 'unrelated', 'numerical', 'approaches', 'multiresolution', 'analysis', 'mra', 'and', 'linear', 'combination', 'of', 'atomic', 'orbitals', 'yield', 'total', 'energies', 'of', 'atoms', 'with', 'a', 'mean', 'deviation', 'of', '09muha', 'and', '02muha', 'respectively', 'spectacular', 'agreement', 'with', 'the', 'mra', 'is', 'reached', 'also', 'for', 'total', 'and', 'atomization', 'energies', 'of', 'the', 'g21', 'set', 'consisting', 'of', '55', 'molecules', 'with', 'the', 'example', 'of', 'alphairon', 'we', 'demonstrate', 'the', 'capability', 'of', 'lapwlo', 'of', 'reaching', 'muhaatom', 'precision', 'also', 'for', 'periodic', 'systems', 'which', 'allows', 'also', 'for', 'distinction', 'between', 'numerical', 'precision', 'and', 'the', 'accuracy', 'of', 'a', 'given', 'functional']] | [-0.07461376549626013, 0.021148288352676084, -0.06387222606784482, 0.0313257178711644, 0.02796682065230942, -0.093760576499539, 0.10037661650409556, 0.382803746873391, -0.22455751495740472, -0.3371535268063857, 0.023148965837964875, -0.30377847774655486, -0.1131982798470515, 0.20127270654688162, 0.02691999881171456, 0.11224682735242211, 0.12736631183728367, 0.01698478262122964, -0.14674469325517384, -0.20198659163629898, 0.2466783947441901, 0.10682377078196156, 0.2612075099273298, 0.06894394640797731, 0.12829316922715892, 0.0025256455170913276, -0.004003543017223199, 0.053517576520305095, -0.10831959565849017, 0.1876166936763014, 0.2504491914220363, 0.07046022469821935, 0.2574156579326525, -0.4230528633310416, -0.15707999673698134, 0.021904841578939807, 0.10989007463017217, 0.1107748290295408, -0.03906298585444967, -0.253274998465492, 0.08269598304346273, -0.164040642679521, -0.15931644344214943, -0.17504145195228962, -0.02118288186404889, 0.06678957194873245, -0.2799016195392915, 0.13384925915830265, -0.029980732580629464, 0.11669360278069561, -0.10184634896838454, -0.18612674047526356, -0.028302367130364072, 0.05088606804922641, -2.4938173635610353e-05, 0.04270070229186981, 0.09365988897908235, -0.06797514629123785, -0.12005661698232327, 0.4235820517849142, -0.07696442027297741, -0.1806689356584276, 0.21022159239782073, -0.09869057126996046, -0.12001190439658675, 0.16052239369078775, 0.1532555963130337, 0.0956144354210418, -0.1064121466190946, 0.06552541451463388, -0.021185302671706565, 0.19619202073315314, 0.0849165618463167, 0.03076012651418351, 0.13671170553697326, 0.19617674731710386, 0.03815408948826316, 0.07588161322969299, -0.1660023603379448, -0.09464921819581433, -0.28279108971914396, -0.1507029330410133, -0.17748935385737744, -0.014777428869845642, -0.08755638637002253, -0.16553061496396768, 0.39471164642110745, 0.15169121195327176, 0.1341661372239414, 0.06684169796334632, 0.2745889097965697, 0.08380876332491519, 0.02996255396038433, 0.023275168660471093, 0.25486265328521274, 0.17114956803820053, 0.02442291902116267, -0.25729390220916787, -0.026617326493000734, 0.0628005174711068] |
1,803.00777 | A Universal Break in the Planet-to-Star Mass-Ratio Function of Kepler
MKG stars | We follow the microlensing approach and quantify the occurrence of Kepler
exoplanets as a function of planet-to-star mass ratio, q, rather than planet
radius or mass. For planets with radii ~1-6 R_earth and periods <100 days, we
find that, except for a normalization factor, the occurrence rate vs q can be
described by the same broken power law with a break at ~3 x10^{-5} independent
of host type for hosts below 1 M_sun. These findings indicate that the
planet-to-star mass ratio is a more fundamental quantity in planet formation
than planet mass. We then compare our results to those from microlensing for
which the overwhelming majority satisfies the M_host<1 M_sun criterion. The
break in q for the microlensing planet population, which mostly probes the
region outside the snowline, is 3-10 times higher than that inferred from
Kepler. Thus, the most common planet inside the snowline is ~3-10 times less
massive than the one outside. With rocky planets interior to gaseous planets,
the Solar System broadly follows the combined mass-ratio function inferred from
Kepler and microlensing. However, the exoplanet population has a less extreme
radial distribution of planetary masses than the Solar System. Establishing
whether the mass-ratio function beyond the snowline is also host type
independent will be crucial to build a comprehensive theory of planet
formation.
| astro-ph.EP | we follow the microlensing approach and quantify the occurrence of kepler exoplanets as a function of planettostar mass ratio q rather than planet radius or mass for planets with radii 16 r_earth and periods 100 days we find that except for a normalization factor the occurrence rate vs q can be described by the same broken power law with a break at 3 x105 independent of host type for hosts below 1 m_sun these findings indicate that the planettostar mass ratio is a more fundamental quantity in planet formation than planet mass we then compare our results to those from microlensing for which the overwhelming majority satisfies the m_host1 m_sun criterion the break in q for the microlensing planet population which mostly probes the region outside the snowline is 310 times higher than that inferred from kepler thus the most common planet inside the snowline is 310 times less massive than the one outside with rocky planets interior to gaseous planets the solar system broadly follows the combined massratio function inferred from kepler and microlensing however the exoplanet population has a less extreme radial distribution of planetary masses than the solar system establishing whether the massratio function beyond the snowline is also host type independent will be crucial to build a comprehensive theory of planet formation | [['we', 'follow', 'the', 'microlensing', 'approach', 'and', 'quantify', 'the', 'occurrence', 'of', 'kepler', 'exoplanets', 'as', 'a', 'function', 'of', 'planettostar', 'mass', 'ratio', 'q', 'rather', 'than', 'planet', 'radius', 'or', 'mass', 'for', 'planets', 'with', 'radii', '16', 'r_earth', 'and', 'periods', '100', 'days', 'we', 'find', 'that', 'except', 'for', 'a', 'normalization', 'factor', 'the', 'occurrence', 'rate', 'vs', 'q', 'can', 'be', 'described', 'by', 'the', 'same', 'broken', 'power', 'law', 'with', 'a', 'break', 'at', '3', 'x105', 'independent', 'of', 'host', 'type', 'for', 'hosts', 'below', '1', 'm_sun', 'these', 'findings', 'indicate', 'that', 'the', 'planettostar', 'mass', 'ratio', 'is', 'a', 'more', 'fundamental', 'quantity', 'in', 'planet', 'formation', 'than', 'planet', 'mass', 'we', 'then', 'compare', 'our', 'results', 'to', 'those', 'from', 'microlensing', 'for', 'which', 'the', 'overwhelming', 'majority', 'satisfies', 'the', 'm_host1', 'm_sun', 'criterion', 'the', 'break', 'in', 'q', 'for', 'the', 'microlensing', 'planet', 'population', 'which', 'mostly', 'probes', 'the', 'region', 'outside', 'the', 'snowline', 'is', '310', 'times', 'higher', 'than', 'that', 'inferred', 'from', 'kepler', 'thus', 'the', 'most', 'common', 'planet', 'inside', 'the', 'snowline', 'is', '310', 'times', 'less', 'massive', 'than', 'the', 'one', 'outside', 'with', 'rocky', 'planets', 'interior', 'to', 'gaseous', 'planets', 'the', 'solar', 'system', 'broadly', 'follows', 'the', 'combined', 'massratio', 'function', 'inferred', 'from', 'kepler', 'and', 'microlensing', 'however', 'the', 'exoplanet', 'population', 'has', 'a', 'less', 'extreme', 'radial', 'distribution', 'of', 'planetary', 'masses', 'than', 'the', 'solar', 'system', 'establishing', 'whether', 'the', 'massratio', 'function', 'beyond', 'the', 'snowline', 'is', 'also', 'host', 'type', 'independent', 'will', 'be', 'crucial', 'to', 'build', 'a', 'comprehensive', 'theory', 'of', 'planet', 'formation']] | [-0.08563127612511, 0.13903763759448085, -0.05507490583803765, 0.10374575935434117, -0.09657400382985902, -0.08766630963140795, 0.09907655493453751, 0.29688519491857396, -0.13825920789751636, -0.37926487007373294, 0.07081380065119024, -0.28848825464049505, -0.06605577391658932, 0.23330404271025124, -0.08774535656963518, 0.019352427937041665, 0.0923069832770717, -0.026607292676127926, -0.06310409935689423, -0.2620540421120389, 0.2795384617565676, 0.053716747302475366, 0.07520195943584969, -0.019226393062448086, -0.009125532847822394, -0.04828323255899514, 0.0019932574527554733, -0.07727080511557329, -0.2148331839498877, 0.022810010343443515, 0.2046057881321758, 0.16137790437618563, 0.21662507226560698, -0.3110693145478361, -0.21458634307478056, 0.09031397647259562, 0.19076253504514, 0.0016452316075650066, -0.015808290751382903, -0.22518991672238986, 0.1385446215443703, -0.20603136093528984, -0.21089532123445426, 0.0911970512854845, 0.12861712882945012, -0.020896206843006145, -0.295309163264248, 0.1441244211793758, 0.04194453179966225, 0.11913550609376194, -0.1342171627854885, -0.15192074302345687, -0.08326104407328679, 0.07034811846110536, 0.05676886753130401, 0.07018275519746334, 0.218984817755192, -0.07157880682498216, 0.002862263410243877, 0.42035509254566805, -0.06756924586431502, -0.040176637271462486, 0.22570960062101136, -0.26629704476312493, -0.10924879018607181, 0.1521015721990532, 0.1645909942786052, 0.1426037048776485, -0.1478244917120698, -0.03757807651590854, -0.022484842642903503, 0.2613840639206776, 0.10635783657198772, 0.04169926436747923, 0.4153078115501896, 0.15841978448551408, 0.10579213570251107, 0.013884020040114952, -0.20182551199158782, -0.07506399093693945, -0.1886396029660868, -0.12416606086176322, -0.1789096480809412, 0.08521694092209949, -0.15676571755801316, -0.09674445039614342, 0.3211799005452587, 0.1455220950962326, 0.2061622847737961, 0.09863854384179725, 0.2955549544286589, 0.1240770860033673, 0.143503178967986, 0.09919693692652291, 0.34032953766846036, 0.12793620022035443, 0.06663661410295686, -0.21994878946110433, 0.09986387646518821, 0.005587094657253041] |
1,803.00778 | Finite-system effects on high-harmonic generation: from atoms to solids | Using time-dependent density functional theory, high-harmonic generation
(HHG) is studied in one-dimensional structures of sizes from a single nucleus
up to hundreds of nuclei. The HHG cutoff is observed to extent linearly with
the system size from the well known atomic HHG cutoff and is found to converge
into the previously observed cutoffs for bulk solids only for large systems. A
change in the response from that of single atoms or small molecules is observed
from system sizes of $N$ $\approx$ 6 nuclei and becomes independent of system
size at $N \gtrsim 60$. The system-size dependence of the observed HHG cutoffs
is found to follow the limitations, set by the finite size solid, on the
classical motion of electron-hole pairs. Because of the relation between
recombination energy and electron-hole propagation length in the system,
high-energy recombination events are not possible in small systems but become
accessible for larger systems resulting in the change of the cutoff energies
with system size. When varying the field intensity we observe that the cutoffs
move linearly with the intensity even for small systems of $N\gtrsim 6$ that
are far from the limit of a bulk solid.
| physics.atom-ph | using timedependent density functional theory highharmonic generation hhg is studied in onedimensional structures of sizes from a single nucleus up to hundreds of nuclei the hhg cutoff is observed to extent linearly with the system size from the well known atomic hhg cutoff and is found to converge into the previously observed cutoffs for bulk solids only for large systems a change in the response from that of single atoms or small molecules is observed from system sizes of n approx 6 nuclei and becomes independent of system size at n gtrsim 60 the systemsize dependence of the observed hhg cutoffs is found to follow the limitations set by the finite size solid on the classical motion of electronhole pairs because of the relation between recombination energy and electronhole propagation length in the system highenergy recombination events are not possible in small systems but become accessible for larger systems resulting in the change of the cutoff energies with system size when varying the field intensity we observe that the cutoffs move linearly with the intensity even for small systems of ngtrsim 6 that are far from the limit of a bulk solid | [['using', 'timedependent', 'density', 'functional', 'theory', 'highharmonic', 'generation', 'hhg', 'is', 'studied', 'in', 'onedimensional', 'structures', 'of', 'sizes', 'from', 'a', 'single', 'nucleus', 'up', 'to', 'hundreds', 'of', 'nuclei', 'the', 'hhg', 'cutoff', 'is', 'observed', 'to', 'extent', 'linearly', 'with', 'the', 'system', 'size', 'from', 'the', 'well', 'known', 'atomic', 'hhg', 'cutoff', 'and', 'is', 'found', 'to', 'converge', 'into', 'the', 'previously', 'observed', 'cutoffs', 'for', 'bulk', 'solids', 'only', 'for', 'large', 'systems', 'a', 'change', 'in', 'the', 'response', 'from', 'that', 'of', 'single', 'atoms', 'or', 'small', 'molecules', 'is', 'observed', 'from', 'system', 'sizes', 'of', 'n', 'approx', '6', 'nuclei', 'and', 'becomes', 'independent', 'of', 'system', 'size', 'at', 'n', 'gtrsim', '60', 'the', 'systemsize', 'dependence', 'of', 'the', 'observed', 'hhg', 'cutoffs', 'is', 'found', 'to', 'follow', 'the', 'limitations', 'set', 'by', 'the', 'finite', 'size', 'solid', 'on', 'the', 'classical', 'motion', 'of', 'electronhole', 'pairs', 'because', 'of', 'the', 'relation', 'between', 'recombination', 'energy', 'and', 'electronhole', 'propagation', 'length', 'in', 'the', 'system', 'highenergy', 'recombination', 'events', 'are', 'not', 'possible', 'in', 'small', 'systems', 'but', 'become', 'accessible', 'for', 'larger', 'systems', 'resulting', 'in', 'the', 'change', 'of', 'the', 'cutoff', 'energies', 'with', 'system', 'size', 'when', 'varying', 'the', 'field', 'intensity', 'we', 'observe', 'that', 'the', 'cutoffs', 'move', 'linearly', 'with', 'the', 'intensity', 'even', 'for', 'small', 'systems', 'of', 'ngtrsim', '6', 'that', 'are', 'far', 'from', 'the', 'limit', 'of', 'a', 'bulk', 'solid']] | [-0.08798858811618022, 0.229716488038927, -0.03760949707975669, 0.06076035744141942, 0.040507265514558334, -0.09922945445335547, 0.0259023098921413, 0.38366193139033083, -0.27079559531557607, -0.32851919607977226, 0.010926072153476222, -0.30719616167092073, -0.03132389641784054, 0.19750453025699244, 0.029713935929369956, 0.03306469941162504, 0.017402124421399396, 0.017020175387491083, -0.02847807719414656, -0.18972579781257082, 0.2923765162825778, 0.07347083587956149, 0.265084348199404, 0.05142316091530574, 0.05785724933321035, -0.013001991705095861, 0.034791244133278575, 0.026863049250096083, -0.08909705558892256, 0.08136035630013794, 0.20630246430785823, 0.01475821208346891, 0.24179060255604176, -0.40384020734927617, -0.22491326583258342, 0.059137114896657295, 0.1661067931793999, 0.14837466907677785, -0.02272632619436384, -0.21574582681447887, 0.035050270111241844, -0.13595753386956252, -0.1591603410482397, -0.017973609200756375, 0.08960642039467832, 0.06696560722290694, -0.2538402716963901, 0.09862218238655866, 0.02583386836401284, 0.047791674733161926, -0.066905127834616, -0.10609041750512915, -0.045185248796921464, 0.1034042494170535, 0.05280444495898943, 0.014089180304533025, 0.17372756797431066, -0.11688846745588914, -0.056314331285345055, 0.4219598214306946, -0.051755601648134565, -0.10955905128503218, 0.2143817536549856, -0.23180362321772918, -0.0993594717704885, 0.24394730319242322, 0.15762006333109943, 0.1226264398501371, -0.10794181778245122, 0.07601963050456106, -0.01601679350763637, 0.24483964184628348, 0.09834092164237518, 0.09595769778873849, 0.20761523379284577, 0.17774074473709334, 0.04731557969838226, 0.10721973646892972, -0.1184744213205704, -0.07893672398040508, -0.27485614047327545, -0.07334270380912737, -0.21920952599854596, 0.07576867449711244, -0.0653386836466628, -0.16119915792660322, 0.3410357074026251, 0.11141489370705433, 0.2215668599625739, 0.04380923691981783, 0.24713841896542968, 0.14674803091179456, 0.10825200290128123, 0.06238831579685211, 0.26044164556272636, 0.10251873510848479, 0.0812435043202034, -0.25818875132305646, 0.029765890441922238, -0.0024300086940153656] |
1,803.00779 | Neutron spin resonance in the 112-type iron-based superconductor | We use inelastic neutron scattering to study the low-energy spin excitations
of 112-type iron pnictide Ca$_{0.82}$La$_{0.18}$Fe$_{0.96}$Ni$_{0.04}$As$_{2}$
with bulk superconductivity below $T_c=22$ K. A two-dimensional spin resonance
mode is found around $E=$ 11 meV, where the resonance energy is almost
temperature independent and linearly scales with $T_c$ along with other
iron-based superconductors. Polarized neutron analysis reveals the resonance is
nearly isotropic in spin space without any $L$ modulations. Due to the unique
monoclinic structure with additional zigzag arsenic chains, the As $4p$
orbitals contribute to a three-dimensional hole pocket around $\Gamma$ point
and an extra electron pocket at $X$ point. Our results suggest that the energy
and momentum distribution of spin resonance does not directly response to the
$k_z$ dependence of fermiology, and the spin resonance intrinsically is a
spin-1 mode from singlet-triplet excitations of the Cooper pairs in the case of
weak spin-orbital coupling.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | we use inelastic neutron scattering to study the lowenergy spin excitations of 112type iron pnictide ca_082la_018fe_096ni_004as_2 with bulk superconductivity below t_c22 k a twodimensional spin resonance mode is found around e 11 mev where the resonance energy is almost temperature independent and linearly scales with t_c along with other ironbased superconductors polarized neutron analysis reveals the resonance is nearly isotropic in spin space without any l modulations due to the unique monoclinic structure with additional zigzag arsenic chains the as 4p orbitals contribute to a threedimensional hole pocket around gamma point and an extra electron pocket at x point our results suggest that the energy and momentum distribution of spin resonance does not directly response to the k_z dependence of fermiology and the spin resonance intrinsically is a spin1 mode from singlettriplet excitations of the cooper pairs in the case of weak spinorbital coupling | [['we', 'use', 'inelastic', 'neutron', 'scattering', 'to', 'study', 'the', 'lowenergy', 'spin', 'excitations', 'of', '112type', 'iron', 'pnictide', 'ca_082la_018fe_096ni_004as_2', 'with', 'bulk', 'superconductivity', 'below', 't_c22', 'k', 'a', 'twodimensional', 'spin', 'resonance', 'mode', 'is', 'found', 'around', 'e', '11', 'mev', 'where', 'the', 'resonance', 'energy', 'is', 'almost', 'temperature', 'independent', 'and', 'linearly', 'scales', 'with', 't_c', 'along', 'with', 'other', 'ironbased', 'superconductors', 'polarized', 'neutron', 'analysis', 'reveals', 'the', 'resonance', 'is', 'nearly', 'isotropic', 'in', 'spin', 'space', 'without', 'any', 'l', 'modulations', 'due', 'to', 'the', 'unique', 'monoclinic', 'structure', 'with', 'additional', 'zigzag', 'arsenic', 'chains', 'the', 'as', '4p', 'orbitals', 'contribute', 'to', 'a', 'threedimensional', 'hole', 'pocket', 'around', 'gamma', 'point', 'and', 'an', 'extra', 'electron', 'pocket', 'at', 'x', 'point', 'our', 'results', 'suggest', 'that', 'the', 'energy', 'and', 'momentum', 'distribution', 'of', 'spin', 'resonance', 'does', 'not', 'directly', 'response', 'to', 'the', 'k_z', 'dependence', 'of', 'fermiology', 'and', 'the', 'spin', 'resonance', 'intrinsically', 'is', 'a', 'spin1', 'mode', 'from', 'singlettriplet', 'excitations', 'of', 'the', 'cooper', 'pairs', 'in', 'the', 'case', 'of', 'weak', 'spinorbital', 'coupling']] | [-0.19159817205207957, 0.25937579738367367, -0.01657277806434077, 0.04568858145592877, -0.08589598579862207, -0.1568146091983556, 0.08626351190952362, 0.3709939597630417, -0.24036798303152299, -0.25703057861671996, -0.05891661416499882, -0.39889094790026963, -0.0333526852830489, 0.14872066178391655, 0.12322748679719814, -0.00662320877760779, -0.017916767682124683, 0.023557394355457353, -0.13135223203156327, -0.15340288975797073, 0.3393886120325619, 0.05920307847697262, 0.3087337426124857, 0.08373627264274063, 0.03034950601803204, 0.06539575071472974, 0.15935809135280707, -0.0526243970793317, -0.13717956568621842, 0.03585653838056784, 0.29490540781826874, -0.11740329359472652, 0.11803449325791032, -0.37536843495209005, -0.19776527595159213, 0.017715395346830982, 0.17006134411679918, 0.14482391517612614, -0.034192175934110745, -0.2560355545793354, 0.024574711246796967, -0.12564743420278485, -0.17313957829565668, -0.09288695470228062, -0.018545151284368306, -0.04374345454755337, -0.24915141971794874, 0.12381564609550096, 0.10682846416256853, 0.08236715560323084, -0.11256007675302925, -0.15484425544712718, -0.11863154617555023, -0.03980223985284671, 0.11802016244549955, 0.09924233464322255, 0.16627294727490394, -0.06546869459138675, -0.12656689524631035, 0.32303372030374367, -0.05874857871623879, -0.09478149630155389, 0.15435174314331238, -0.24884489530671414, -0.07509527546581585, 0.2361749665017103, 0.08265889823270663, 0.08977876556060323, -0.1162165014363884, 0.11172705424226612, -0.035877905557887835, 0.23612556801954207, 0.04160914985606304, 0.09333652529256561, 0.29671784491649456, 0.183804070853003, 0.05797877294415204, 0.08048634129451014, -0.20207937272311144, -0.019858860273982263, -0.22084675247982874, -0.1536951122375635, -0.2096611766996989, 0.0951340452181151, -0.03397679869109973, -0.16632336393565303, 0.37879419541377185, 0.06835838878149544, 0.2217582874390837, -0.11069498247453956, 0.2062050853627962, 0.08014900041613858, 0.0891738685460149, 0.07722980624074573, 0.23503614509465187, 0.1982179852886373, 0.08638433128891682, -0.3507724436589393, 0.0009653568479486487, -0.01953465235745209] |
1,803.0078 | Laser induced phase transition in epitaxial FeRh layers studied by
pump-probe valence band photoemission | We use time-resolved X-ray photoelectron spectroscopy to probe the electronic
and magnetization dynamics in FeRh films after ultrafast laser excitations. We
present experimental and theoretical results which investigate the electronic
structure of the FeRh during the first-order phase transition identifying a
clear signature of the magnetic phase. We find that a spin polarized feature at
the Fermi edge is a fingerprint of the magnetic status of the system that is
independent of the long-range ferromagnetic alignment of the magnetic domains.
We use this feature to follow the phase transition induced by a laser pulse in
a pump-probe experiment and find that the magnetic transition occurs in less
than 50 ps, and reaches its maximum in 100 ps.
| cond-mat.str-el | we use timeresolved xray photoelectron spectroscopy to probe the electronic and magnetization dynamics in ferh films after ultrafast laser excitations we present experimental and theoretical results which investigate the electronic structure of the ferh during the firstorder phase transition identifying a clear signature of the magnetic phase we find that a spin polarized feature at the fermi edge is a fingerprint of the magnetic status of the system that is independent of the longrange ferromagnetic alignment of the magnetic domains we use this feature to follow the phase transition induced by a laser pulse in a pumpprobe experiment and find that the magnetic transition occurs in less than 50 ps and reaches its maximum in 100 ps | [['we', 'use', 'timeresolved', 'xray', 'photoelectron', 'spectroscopy', 'to', 'probe', 'the', 'electronic', 'and', 'magnetization', 'dynamics', 'in', 'ferh', 'films', 'after', 'ultrafast', 'laser', 'excitations', 'we', 'present', 'experimental', 'and', 'theoretical', 'results', 'which', 'investigate', 'the', 'electronic', 'structure', 'of', 'the', 'ferh', 'during', 'the', 'firstorder', 'phase', 'transition', 'identifying', 'a', 'clear', 'signature', 'of', 'the', 'magnetic', 'phase', 'we', 'find', 'that', 'a', 'spin', 'polarized', 'feature', 'at', 'the', 'fermi', 'edge', 'is', 'a', 'fingerprint', 'of', 'the', 'magnetic', 'status', 'of', 'the', 'system', 'that', 'is', 'independent', 'of', 'the', 'longrange', 'ferromagnetic', 'alignment', 'of', 'the', 'magnetic', 'domains', 'we', 'use', 'this', 'feature', 'to', 'follow', 'the', 'phase', 'transition', 'induced', 'by', 'a', 'laser', 'pulse', 'in', 'a', 'pumpprobe', 'experiment', 'and', 'find', 'that', 'the', 'magnetic', 'transition', 'occurs', 'in', 'less', 'than', '50', 'ps', 'and', 'reaches', 'its', 'maximum', 'in', '100', 'ps']] | [-0.1613523026681545, 0.21750217829393143, -0.08623234374034736, 0.02177844260337675, -0.031059207752920114, -0.08120184925058459, 0.09032555241893946, 0.4590954437979266, -0.27029599261477105, -0.2982973310236747, 0.024538367337937284, -0.3126945001586603, -0.1127609305927514, 0.165530376510424, 0.08694083054358952, 0.006549564476272203, -0.003376592694917041, -0.02526286771146851, -0.11435883901575501, -0.12981204041996255, 0.2748465482543549, 0.03771315644864335, 0.29787363616837204, 0.08267074229561874, 0.08124826003152591, 0.005753681435783068, 0.08779424416203783, -0.02108904221851347, -0.14655091328854608, 0.028086645506784066, 0.24702887582735947, -0.01111327685197093, 0.19189890833277032, -0.45273280524226844, -0.19974355719601497, 0.026668715420075588, 0.09740214258070207, 0.1557892230209998, -0.0846584331498951, -0.27822855817806774, 0.06574899606151968, -0.11548292810399817, -0.1084200073646493, -0.08737631424720216, -0.002203687305092557, -0.004715228731879312, -0.2346935205387437, 0.08533010079772171, 0.07287874133286314, 0.11389287122580995, -0.09495818907590026, -0.018638683310869094, -0.0537295006096172, 0.05058059437622308, 0.01737386882941947, 0.10791609155682799, 0.17031411726314288, -0.13627357652578026, -0.1288567077822219, 0.33701302292637336, -0.08563960031230644, -0.006865256434131382, 0.1332288257833411, -0.23602423011763102, -0.09027491916671522, 0.19646386085794523, 0.10814246309684335, 0.14993211071396995, -0.10923883531085399, 5.0251778119649643e-05, 0.027697426676909383, 0.2527430840075398, 0.05151767051245412, 0.0765104049211766, 0.2334423830302862, 0.23753554349801, 0.027211478764079828, 0.1810763557580833, -0.19521667482045332, -0.053258546478807546, -0.21976497870050052, -0.1593424342174688, -0.21410215086836973, 0.0518635061975473, -0.050003276755297, -0.1518761138073527, 0.47099840310282814, 0.17932919232158834, 0.1798494017093928, -0.07631616721339683, 0.2825312420355681, 0.09137655682384203, 0.017206828575581312, 0.006138559373127472, 0.30043134599542004, 0.15426108151729992, 0.1495525168461932, -0.3051141735194171, 0.07910522499368486, -0.03318591797963167] |
1,803.00781 | Unsupervised Learning of Goal Spaces for Intrinsically Motivated Goal
Exploration | Intrinsically motivated goal exploration algorithms enable machines to
discover repertoires of policies that produce a diversity of effects in complex
environments. These exploration algorithms have been shown to allow real world
robots to acquire skills such as tool use in high-dimensional continuous state
and action spaces. However, they have so far assumed that self-generated goals
are sampled in a specifically engineered feature space, limiting their
autonomy. In this work, we propose to use deep representation learning
algorithms to learn an adequate goal space. This is a developmental 2-stage
approach: first, in a perceptual learning stage, deep learning algorithms use
passive raw sensor observations of world changes to learn a corresponding
latent space; then goal exploration happens in a second stage by sampling goals
in this latent space. We present experiments where a simulated robot arm
interacts with an object, and we show that exploration algorithms using such
learned representations can match the performance obtained using engineered
representations.
| cs.LG cs.AI | intrinsically motivated goal exploration algorithms enable machines to discover repertoires of policies that produce a diversity of effects in complex environments these exploration algorithms have been shown to allow real world robots to acquire skills such as tool use in highdimensional continuous state and action spaces however they have so far assumed that selfgenerated goals are sampled in a specifically engineered feature space limiting their autonomy in this work we propose to use deep representation learning algorithms to learn an adequate goal space this is a developmental 2stage approach first in a perceptual learning stage deep learning algorithms use passive raw sensor observations of world changes to learn a corresponding latent space then goal exploration happens in a second stage by sampling goals in this latent space we present experiments where a simulated robot arm interacts with an object and we show that exploration algorithms using such learned representations can match the performance obtained using engineered representations | [['intrinsically', 'motivated', 'goal', 'exploration', 'algorithms', 'enable', 'machines', 'to', 'discover', 'repertoires', 'of', 'policies', 'that', 'produce', 'a', 'diversity', 'of', 'effects', 'in', 'complex', 'environments', 'these', 'exploration', 'algorithms', 'have', 'been', 'shown', 'to', 'allow', 'real', 'world', 'robots', 'to', 'acquire', 'skills', 'such', 'as', 'tool', 'use', 'in', 'highdimensional', 'continuous', 'state', 'and', 'action', 'spaces', 'however', 'they', 'have', 'so', 'far', 'assumed', 'that', 'selfgenerated', 'goals', 'are', 'sampled', 'in', 'a', 'specifically', 'engineered', 'feature', 'space', 'limiting', 'their', 'autonomy', 'in', 'this', 'work', 'we', 'propose', 'to', 'use', 'deep', 'representation', 'learning', 'algorithms', 'to', 'learn', 'an', 'adequate', 'goal', 'space', 'this', 'is', 'a', 'developmental', '2stage', 'approach', 'first', 'in', 'a', 'perceptual', 'learning', 'stage', 'deep', 'learning', 'algorithms', 'use', 'passive', 'raw', 'sensor', 'observations', 'of', 'world', 'changes', 'to', 'learn', 'a', 'corresponding', 'latent', 'space', 'then', 'goal', 'exploration', 'happens', 'in', 'a', 'second', 'stage', 'by', 'sampling', 'goals', 'in', 'this', 'latent', 'space', 'we', 'present', 'experiments', 'where', 'a', 'simulated', 'robot', 'arm', 'interacts', 'with', 'an', 'object', 'and', 'we', 'show', 'that', 'exploration', 'algorithms', 'using', 'such', 'learned', 'representations', 'can', 'match', 'the', 'performance', 'obtained', 'using', 'engineered', 'representations']] | [-0.03603333457755696, 0.08565851398332157, -0.12080779243675861, 0.07011448094920866, -0.16918615259491143, -0.1316981724475267, 0.021900379115264792, 0.5159999725533424, -0.28482873376850393, -0.3394331476046069, 0.0654914921459558, -0.19891205369821116, -0.2505153542455689, 0.16590594177602963, -0.1527461883060302, 0.08009553940041335, 0.10871780825375467, 0.03726553776787867, -0.03784462605724645, -0.26239228916834967, 0.30111326412802003, 0.021751864611209745, 0.28951570131240567, -0.10227327533422192, 0.1664787583100568, -0.019803851059857446, -0.027829602798209733, -0.01500409571409439, -0.08748805049615341, 0.18048555703184332, 0.3979923075011629, 0.22500663682385377, 0.3602798480843046, -0.42471922520002364, -0.2209108735369459, 0.16092619244127895, 0.15470738107098303, 0.08194430718483155, -0.033472230356145105, -0.3369185103542486, 0.02903396266388001, -0.1452435634045559, -0.061952046522052044, -0.18593891291837594, -0.044442885312115314, -0.03898032698083289, -0.2955327279799748, -0.08507677771679013, 0.03647876190834317, 0.06471420898825926, -0.0867214804243854, -0.0628085661114855, 0.04175179370584049, 0.19609926492984223, -0.009380076799814584, 0.06559568310488656, 0.17915036891450642, -0.18788458265595517, -0.1879687094178561, 0.3666405482988828, -0.0297988740991279, -0.2130191942682834, 0.23404319113814478, -0.07372192415011347, -0.18252583302165956, 0.12382255806320697, 0.27732635593445154, 0.12236635080853085, -0.14243727002684384, 0.04176853927798498, 0.003577335847387458, 0.15164448715491327, 0.005482591529952208, 0.006584349049812859, 0.18103147954620705, 0.2540455887236508, 0.062413776892528035, 0.12209263877871974, -0.05796280076169664, -0.09444070613170398, -0.206782687941839, -0.12284965707867104, -0.2184197064518786, -0.012547290622950739, -0.04460266478872075, -0.09870719089273625, 0.3267280478030443, 0.23464428864799108, 0.23572183912916547, 0.09208219145739059, 0.32887347941850403, 0.00438428383282012, 0.0912443938602806, 0.11436249442386684, 0.19614026315768315, 0.01789560258035566, 0.14647787869878257, -0.15049795351887663, 0.09859966714925779, 0.011460234918246034] |
1,803.00782 | Anisotropic pressure effects on superconductivity in Fe1+yTe1-xSx | We have investigated uniaxial and hydrostatic pressure effects on
superconductivity in Fe1.07Te0.88S0.12 through magnetic-susceptibility
measurements down to 1.8 K. The superconducting transition temperature Tc is
enhanced by out-of-plane pressure (uniaxial pressure along the c-axis); the
onset temperature of the superconductivity reaches 11.8 K at 0.4 GPa. In
contrast, Tc is reduced by in-plane pressure (uniaxial pressure along the
ab-plane) and hydrostatic pressure. Taking into account these results, it is
inferred that the superconductivity of Fe1+yTe1-xSx is enhanced when the
lattice constant c considerably shrinks. This implies that the relationship
between Tc and the anion height for Fe1+yTe1-xSx is similar to that applicable
to most iron-based superconductors. We consider the reduction of Tc by
hydrostatic pressure due to suppression of spin fluctuations because the system
moves away from antiferromagnetic ordering, and the enhancement of Tc by
out-of-plane pressure due to the anion height effect on Tc.
| cond-mat.supr-con | we have investigated uniaxial and hydrostatic pressure effects on superconductivity in fe107te088s012 through magneticsusceptibility measurements down to 18 k the superconducting transition temperature tc is enhanced by outofplane pressure uniaxial pressure along the caxis the onset temperature of the superconductivity reaches 118 k at 04 gpa in contrast tc is reduced by inplane pressure uniaxial pressure along the abplane and hydrostatic pressure taking into account these results it is inferred that the superconductivity of fe1yte1xsx is enhanced when the lattice constant c considerably shrinks this implies that the relationship between tc and the anion height for fe1yte1xsx is similar to that applicable to most ironbased superconductors we consider the reduction of tc by hydrostatic pressure due to suppression of spin fluctuations because the system moves away from antiferromagnetic ordering and the enhancement of tc by outofplane pressure due to the anion height effect on tc | [['we', 'have', 'investigated', 'uniaxial', 'and', 'hydrostatic', 'pressure', 'effects', 'on', 'superconductivity', 'in', 'fe107te088s012', 'through', 'magneticsusceptibility', 'measurements', 'down', 'to', '18', 'k', 'the', 'superconducting', 'transition', 'temperature', 'tc', 'is', 'enhanced', 'by', 'outofplane', 'pressure', 'uniaxial', 'pressure', 'along', 'the', 'caxis', 'the', 'onset', 'temperature', 'of', 'the', 'superconductivity', 'reaches', '118', 'k', 'at', '04', 'gpa', 'in', 'contrast', 'tc', 'is', 'reduced', 'by', 'inplane', 'pressure', 'uniaxial', 'pressure', 'along', 'the', 'abplane', 'and', 'hydrostatic', 'pressure', 'taking', 'into', 'account', 'these', 'results', 'it', 'is', 'inferred', 'that', 'the', 'superconductivity', 'of', 'fe1yte1xsx', 'is', 'enhanced', 'when', 'the', 'lattice', 'constant', 'c', 'considerably', 'shrinks', 'this', 'implies', 'that', 'the', 'relationship', 'between', 'tc', 'and', 'the', 'anion', 'height', 'for', 'fe1yte1xsx', 'is', 'similar', 'to', 'that', 'applicable', 'to', 'most', 'ironbased', 'superconductors', 'we', 'consider', 'the', 'reduction', 'of', 'tc', 'by', 'hydrostatic', 'pressure', 'due', 'to', 'suppression', 'of', 'spin', 'fluctuations', 'because', 'the', 'system', 'moves', 'away', 'from', 'antiferromagnetic', 'ordering', 'and', 'the', 'enhancement', 'of', 'tc', 'by', 'outofplane', 'pressure', 'due', 'to', 'the', 'anion', 'height', 'effect', 'on', 'tc']] | [-0.18254864978371188, 0.2800406834269072, -0.009302698431484815, -0.052512444959979296, -0.05634360287674806, -0.12453505795242058, 0.17025803018219043, 0.3838938211233148, -0.28519662420876557, -0.2798703587355299, -0.009537653404145708, -0.3329276558684392, -0.0408533145285522, 0.1509040819817326, 0.06142072219679701, -0.008466206131237818, -0.09738339639928502, -0.004150677047113681, -0.1589024809024219, -0.2704490623307518, 0.28907405169835937, 0.06198346571828653, 0.36403943474740824, 0.13496887902147137, 0.009333226202417992, -0.04373618119441542, 0.16216684978765747, 0.09468087918422599, -0.19107580498525245, -0.05126255416285454, 0.26551142185861765, -0.11607156033601819, 0.18133447258797888, -0.3659315543643768, -0.2379264287463027, -0.024566881039188755, 0.07931001514791408, 0.11993751431711847, -0.02384745594887742, -0.2417475076444033, 0.11321157607502148, -0.07550149906051552, -0.1325119400219895, -0.08592045582675685, -0.004473431184629185, -0.05421090830997047, -0.23486906084387252, 0.19134294275944638, 0.10313336687330674, 0.18047461859856007, -0.1441380904240456, -0.18184009799329537, -0.11192253767836115, -0.05382736570896264, 0.13784548484464823, 0.15068890410475433, 0.23262242000621175, -0.09614275532819899, 0.002230571472965595, 0.3829693752599673, -0.06605866944220098, 0.030372490213873487, 0.13234487716625962, -0.15357577294990835, -0.03837940123371987, 0.23328286246073227, 0.10623398514306043, 0.0017225338023207667, -0.1035936411374981, 0.05980136684471896, 0.027540639793086383, 0.20292348370195315, 0.09813496123765869, -0.047532935222180744, 0.22149037054946852, 0.15593404709054287, 0.06438290453418934, 0.15571840235012738, -0.11295059147394365, -0.008688868325811604, -0.18573679699653034, -0.18495031356966743, -0.14209483938692655, 0.05295136555893502, -0.11136907486838431, -0.1337396052580415, 0.28794354028306973, 0.2193785731441393, 0.19863634680384873, -0.07225179812262973, 0.22866889846368899, 0.09817076289699697, 0.12106595686297321, 0.09370749888007089, 0.2717279485012922, 0.246382781653665, 0.15007171701048114, -0.36199328167195843, 0.13903812956414185, -0.005171466162816311] |
1,803.00783 | Sparse Multiple Kernel Learning: Support Identification via Mirror
Stratifiability | In statistical machine learning, kernel methods allow to consider infinite
dimensional feature spaces with a computational cost that only depends on the
number of observations. This is usually done by solving an optimization problem
depending on a data fit term and a suitable regularizer. In this paper we
consider feature maps which are the concatenation of a fixed, possibly large,
set of simpler feature maps. The penalty is a sparsity inducing one, promoting
solutions depending only on a small subset of the features. The group lasso
problem is a special case of this more general setting. We show that one of the
most popular optimization algorithms to solve the regularized objective
function, the forward-backward splitting method, allows to perform feature
selection in a stable manner. In particular, we prove that the set of relevant
features is identified by the algorithm after a finite number of iterations if
a suitable qualification condition holds. The main tools used in the proofs are
the notions of stratification and mirror stratifiability.
| math.OC | in statistical machine learning kernel methods allow to consider infinite dimensional feature spaces with a computational cost that only depends on the number of observations this is usually done by solving an optimization problem depending on a data fit term and a suitable regularizer in this paper we consider feature maps which are the concatenation of a fixed possibly large set of simpler feature maps the penalty is a sparsity inducing one promoting solutions depending only on a small subset of the features the group lasso problem is a special case of this more general setting we show that one of the most popular optimization algorithms to solve the regularized objective function the forwardbackward splitting method allows to perform feature selection in a stable manner in particular we prove that the set of relevant features is identified by the algorithm after a finite number of iterations if a suitable qualification condition holds the main tools used in the proofs are the notions of stratification and mirror stratifiability | [['in', 'statistical', 'machine', 'learning', 'kernel', 'methods', 'allow', 'to', 'consider', 'infinite', 'dimensional', 'feature', 'spaces', 'with', 'a', 'computational', 'cost', 'that', 'only', 'depends', 'on', 'the', 'number', 'of', 'observations', 'this', 'is', 'usually', 'done', 'by', 'solving', 'an', 'optimization', 'problem', 'depending', 'on', 'a', 'data', 'fit', 'term', 'and', 'a', 'suitable', 'regularizer', 'in', 'this', 'paper', 'we', 'consider', 'feature', 'maps', 'which', 'are', 'the', 'concatenation', 'of', 'a', 'fixed', 'possibly', 'large', 'set', 'of', 'simpler', 'feature', 'maps', 'the', 'penalty', 'is', 'a', 'sparsity', 'inducing', 'one', 'promoting', 'solutions', 'depending', 'only', 'on', 'a', 'small', 'subset', 'of', 'the', 'features', 'the', 'group', 'lasso', 'problem', 'is', 'a', 'special', 'case', 'of', 'this', 'more', 'general', 'setting', 'we', 'show', 'that', 'one', 'of', 'the', 'most', 'popular', 'optimization', 'algorithms', 'to', 'solve', 'the', 'regularized', 'objective', 'function', 'the', 'forwardbackward', 'splitting', 'method', 'allows', 'to', 'perform', 'feature', 'selection', 'in', 'a', 'stable', 'manner', 'in', 'particular', 'we', 'prove', 'that', 'the', 'set', 'of', 'relevant', 'features', 'is', 'identified', 'by', 'the', 'algorithm', 'after', 'a', 'finite', 'number', 'of', 'iterations', 'if', 'a', 'suitable', 'qualification', 'condition', 'holds', 'the', 'main', 'tools', 'used', 'in', 'the', 'proofs', 'are', 'the', 'notions', 'of', 'stratification', 'and', 'mirror', 'stratifiability']] | [-0.1100412277385598, 0.02820282573694946, -0.09886014002687604, 0.07860640096575758, -0.11382015355204617, -0.17067924143556884, 0.04077584753691325, 0.36611220170883185, -0.3085523449465867, -0.26654942169740886, 0.12504986050876113, -0.23216715592531623, -0.15770604717405792, 0.1886200285349376, -0.1026366451576709, 0.06334915110063433, 0.10157992618373166, 0.04347113463999759, -0.08816915288223177, -0.27976715582503775, 0.3593909790841193, 0.008629736339974546, 0.26205487486845, 0.0059435152543519075, 0.13821271764153537, 0.00953514933931881, -0.024608403804863965, 0.04005337059274762, -0.0829829629949377, 0.14338659370787898, 0.27516879527941124, 0.16545729816077043, 0.37940200731649015, -0.37065205236751875, -0.19977971029932845, 0.14368668064324486, 0.10655560250349431, 0.10000763494942426, -0.02402988301764708, -0.21999309765046718, 0.08641711417948102, -0.107628068568995, -0.07583195759641553, -0.09237650786749572, -0.04136656096740486, -0.0008773992875379002, -0.3284411633137647, 0.023209027335337716, 0.07706286381193977, 0.04887226134438268, -0.04958037535616749, -0.11319393348325223, 0.017955056321946626, 0.06660336959817095, 0.06105128155803743, 0.027128988022296997, 0.10424620505634272, -0.13218978304656614, -0.08805167303883477, 0.3827921436530744, -0.059561689954507585, -0.2615111058851157, 0.17046114891301492, -0.0662162393097303, -0.18779988306948167, 0.10887869169955103, 0.1872931738261379, 0.18269011945168148, -0.13225570036109516, 0.1123565867909894, -0.08214410398055069, 0.16637323994724873, 0.04631455511992385, 0.0037374447373823894, 0.11433837491695485, 0.1914382337544704, 0.15058225249971993, 0.16194696026480573, -0.06283990368051845, -0.06045508708820182, -0.304240057010672, -0.12018454848359267, -0.18964122517681317, -0.01635934111890857, -0.11321851290733843, -0.1771761145035619, 0.3963117824789293, 0.12585179248795436, 0.23193712774831468, 0.07195949051696472, 0.29965367435873624, 0.11813118750620549, 0.0858177048266408, 0.0839026103125227, 0.17662313394387905, 0.10224255381715289, 0.05029105154998199, -0.18586411892888163, 0.06923360460365337, 0.12862658050346248] |
1,803.00784 | Pseudo-hyperbolic Gauss maps of Lorentzian surfaces in anti-de Sitter
space | In this paper, we determine the type numbers of the pseudo-hyperbolic Gauss
maps of all oriented Lorentzian surfaces of constant mean and Gaussian
curvatures and non-diagonalizable shape operator in the $3$-dimensional anti-de
Sitter space. Also, we investigate the behavior of type numbers of the
pseudo-hyperbolic Gauss map along the parallel family of such oriented
Lorentzian surfaces in the $3$-dimensional anti-de Sitter space. Furthermore,
we investigate the type number of the pseudo-hyperbolic Gauss map of one of
Lorentzian hypersurfaces of B-scroll type in a general dimensional anti-de
Sitter space.
| math.DG | in this paper we determine the type numbers of the pseudohyperbolic gauss maps of all oriented lorentzian surfaces of constant mean and gaussian curvatures and nondiagonalizable shape operator in the 3dimensional antide sitter space also we investigate the behavior of type numbers of the pseudohyperbolic gauss map along the parallel family of such oriented lorentzian surfaces in the 3dimensional antide sitter space furthermore we investigate the type number of the pseudohyperbolic gauss map of one of lorentzian hypersurfaces of bscroll type in a general dimensional antide sitter space | [['in', 'this', 'paper', 'we', 'determine', 'the', 'type', 'numbers', 'of', 'the', 'pseudohyperbolic', 'gauss', 'maps', 'of', 'all', 'oriented', 'lorentzian', 'surfaces', 'of', 'constant', 'mean', 'and', 'gaussian', 'curvatures', 'and', 'nondiagonalizable', 'shape', 'operator', 'in', 'the', '3dimensional', 'antide', 'sitter', 'space', 'also', 'we', 'investigate', 'the', 'behavior', 'of', 'type', 'numbers', 'of', 'the', 'pseudohyperbolic', 'gauss', 'map', 'along', 'the', 'parallel', 'family', 'of', 'such', 'oriented', 'lorentzian', 'surfaces', 'in', 'the', '3dimensional', 'antide', 'sitter', 'space', 'furthermore', 'we', 'investigate', 'the', 'type', 'number', 'of', 'the', 'pseudohyperbolic', 'gauss', 'map', 'of', 'one', 'of', 'lorentzian', 'hypersurfaces', 'of', 'bscroll', 'type', 'in', 'a', 'general', 'dimensional', 'antide', 'sitter', 'space']] | [-0.20750349188416167, 0.1218515288341662, -0.04452289628057644, 0.09805964693914157, -0.09595364972884798, -0.08257591332062736, -0.06539386203485788, 0.3592743259137389, -0.21000553701800861, -0.19034479738309465, 0.0889657364580138, -0.22632191762670703, -0.19193307633629475, 0.17113759531371894, -0.11787668404158676, 0.02176042295050347, -0.03206252165395638, 0.08801837301888, -0.14942913631448287, -0.25217524188672374, 0.4818428721407364, -0.03756322420534046, 0.25012510741964494, -0.05298646328697816, 0.13131320284915038, -0.008184759208568555, -0.0017579540599608559, 0.06548915035793847, -0.23866358863981976, 0.14865547595759745, 0.17770393969405485, 0.0870589548828958, 0.1333598176809563, -0.3681849152192302, -0.24691198387279592, 0.1856294893606127, 0.15602627609208783, 0.05105567559995956, -0.01033965318367399, -0.2982793115935792, 0.013522943203476653, -0.0634948003651767, -0.23856449713288197, -0.054028771924732745, 0.005831175440943789, -0.008869989895550856, -0.126433652194067, 0.08100602185673444, 0.0993261740853389, 0.09562516753058667, -0.10517187561069069, -0.04573754398767761, -0.07856184710887656, 0.08775396040244691, 0.04911947809159756, 0.05929293122206782, 0.06435570786118336, -0.08237680751971176, -0.09082422432243481, 0.35453956890195587, -0.11334727753767337, -0.29483345043899, 0.09294567377060309, -0.23371119251282052, -0.13256696766328024, 0.12802681715452466, 0.20372232353721542, 0.22149993547762947, -0.052294399252097154, 0.24299120250955525, -0.007629673125158097, 0.05587349373890066, 0.18080638785814418, -0.018517152065727002, 0.20238328897180144, 0.0557580951965232, 0.08363694028564911, 0.18575141099335132, -0.07494215643697086, -0.09760716201566245, -0.39841336622063456, -0.32497671610493767, -0.14621683708044175, 0.15434250854833545, -0.21336036164483493, -0.2791536543946499, 0.3887826539415481, -0.0218068316890644, 0.19195792433302636, 0.07258520872451248, 0.2024697288014423, 0.0034253176130440042, -0.011070757352308124, 0.11480501740528591, 0.19766222266480327, 0.1632381030733044, 0.07884594996127932, -0.15391764851907888, -0.14936747001591086, 0.18582617392999] |
1,803.00785 | Convergence rates for discretized Monge-Amp\`ere equations and
quantitative stability of optimal transport | In recent works - both experimental and theoretical - it has been shown how
to use computational geometry to efficently construct approximations to the
optimal transport map between two given probability measures on Euclidean
space, by discretizing one of the measures. Here we provide a quantative
convergence analysis for the solutions of the corresponding discretized
Monge-Amp\`ere equations. This yields L^{2}-converge rates, in terms of the
corresponding spatial resolution h, of the discrete approximations of the
optimal transport map, when the source measure is discretized and the target
measure has bounded convex support. Periodic variants of the results are also
established. The proofs are based on quantitative stability results for optimal
transport maps, shown using complex geometry.
| math.NA cs.NA math.AP math.CV | in recent works both experimental and theoretical it has been shown how to use computational geometry to efficently construct approximations to the optimal transport map between two given probability measures on euclidean space by discretizing one of the measures here we provide a quantative convergence analysis for the solutions of the corresponding discretized mongeampere equations this yields l2converge rates in terms of the corresponding spatial resolution h of the discrete approximations of the optimal transport map when the source measure is discretized and the target measure has bounded convex support periodic variants of the results are also established the proofs are based on quantitative stability results for optimal transport maps shown using complex geometry | [['in', 'recent', 'works', 'both', 'experimental', 'and', 'theoretical', 'it', 'has', 'been', 'shown', 'how', 'to', 'use', 'computational', 'geometry', 'to', 'efficently', 'construct', 'approximations', 'to', 'the', 'optimal', 'transport', 'map', 'between', 'two', 'given', 'probability', 'measures', 'on', 'euclidean', 'space', 'by', 'discretizing', 'one', 'of', 'the', 'measures', 'here', 'we', 'provide', 'a', 'quantative', 'convergence', 'analysis', 'for', 'the', 'solutions', 'of', 'the', 'corresponding', 'discretized', 'mongeampere', 'equations', 'this', 'yields', 'l2converge', 'rates', 'in', 'terms', 'of', 'the', 'corresponding', 'spatial', 'resolution', 'h', 'of', 'the', 'discrete', 'approximations', 'of', 'the', 'optimal', 'transport', 'map', 'when', 'the', 'source', 'measure', 'is', 'discretized', 'and', 'the', 'target', 'measure', 'has', 'bounded', 'convex', 'support', 'periodic', 'variants', 'of', 'the', 'results', 'are', 'also', 'established', 'the', 'proofs', 'are', 'based', 'on', 'quantitative', 'stability', 'results', 'for', 'optimal', 'transport', 'maps', 'shown', 'using', 'complex', 'geometry']] | [-0.06962064668550738, 0.01159261398840629, -0.11681165021478332, 0.09303657811999853, -0.04085558863256925, -0.09902512117904345, 0.030282602065459026, 0.382633646584249, -0.2896112433435129, -0.24517207690015702, 0.14904952502651472, -0.2804702253613089, -0.1419785749582973, 0.23089046174261188, -0.09487254182957779, 0.134353027382271, 0.06495820377520951, 0.0213298315047723, -0.11063963351106006, -0.23743845181992843, 0.32645216797079357, 0.026316812137208347, 0.3059410007928299, 0.07949963351295862, 0.14759241637823703, -0.041709942030138336, -0.07298656021677223, 0.03536858318563775, -0.19386712098743633, 0.172064045818323, 0.23101891088923107, 0.11588614437849694, 0.2586796215868422, -0.40364784288353156, -0.23361662174907646, 0.09251434269390302, 0.13375337796242093, 0.07433583258638723, -0.04561926220776513, -0.277599977830375, 0.08146508825926244, -0.06586161680752411, -0.11371455730321552, -0.12358744592971302, 0.010798211471410468, 0.08290477971812445, -0.26585549619215143, 0.04325352271942912, 0.03336559963229645, 0.04746176822144272, -0.1066593617475259, -0.10201101185521111, -0.026629444436236684, 0.14212507484236475, 0.031992661783338656, 0.027059887718808438, 0.06517818853275717, -0.06304599416034762, -0.1326971139143487, 0.34984731930308044, -0.07451955127180554, -0.33358270169368814, 0.1985683051108416, -0.15683198206742027, -0.10385068797248616, 0.12925273452752403, 0.16454912697580376, 0.13165636218868063, -0.14142941415632646, 0.13233388762351492, -0.07515966540917621, 0.12678530417282932, 0.07133200246607885, 0.034830117610649074, 0.09639666698473905, 0.161945371337684, 0.1409534364065621, 0.1345151207933668, -0.06448290352065149, -0.1576545106280329, -0.29400970158167183, -0.12153645984861734, -0.1791631005554726, 0.040278250071943536, -0.11077343983067424, -0.1559400479906929, 0.3751293637615163, 0.12925603158406115, 0.17697017847240204, 0.08048835013427638, 0.2758676540896496, 0.17027664606783738, -0.018271084074513055, 0.07392234315713202, 0.2128128692628317, 0.17824032096333603, 0.08215128869051114, -0.21786167588600489, 0.06392868350563471, 0.12244573718258575] |
1,803.00786 | Simple and Local Independent Set Approximation | We bound the performance guarantees that follow from Tur\'an-like bounds for
unweighted and weighted independent sets in bounded-degree graphs. In
particular, a randomized approach of Boppana forms a simple 1-round distributed
algorithm, as well as a streaming and preemptive online algorithm. We show it
gives a tight $(\Delta+1)/2$-approximation in unweighted graphs of maximum
degree $\Delta$, which is best possible for 1-round distributed algorithms. For
weighted graphs, it gives only a $\Delta$-approximation, but a simple
modification results in an asymptotic expected $0.529 \Delta$-approximation.
This compares with a recent, more complex $\Delta$-approximation~\cite{BCGS17},
which holds deterministically.
| cs.DS | we bound the performance guarantees that follow from turanlike bounds for unweighted and weighted independent sets in boundeddegree graphs in particular a randomized approach of boppana forms a simple 1round distributed algorithm as well as a streaming and preemptive online algorithm we show it gives a tight delta12approximation in unweighted graphs of maximum degree delta which is best possible for 1round distributed algorithms for weighted graphs it gives only a deltaapproximation but a simple modification results in an asymptotic expected 0529 deltaapproximation this compares with a recent more complex deltaapproximationcitebcgs17 which holds deterministically | [['we', 'bound', 'the', 'performance', 'guarantees', 'that', 'follow', 'from', 'turanlike', 'bounds', 'for', 'unweighted', 'and', 'weighted', 'independent', 'sets', 'in', 'boundeddegree', 'graphs', 'in', 'particular', 'a', 'randomized', 'approach', 'of', 'boppana', 'forms', 'a', 'simple', '1round', 'distributed', 'algorithm', 'as', 'well', 'as', 'a', 'streaming', 'and', 'preemptive', 'online', 'algorithm', 'we', 'show', 'it', 'gives', 'a', 'tight', 'delta12approximation', 'in', 'unweighted', 'graphs', 'of', 'maximum', 'degree', 'delta', 'which', 'is', 'best', 'possible', 'for', '1round', 'distributed', 'algorithms', 'for', 'weighted', 'graphs', 'it', 'gives', 'only', 'a', 'deltaapproximation', 'but', 'a', 'simple', 'modification', 'results', 'in', 'an', 'asymptotic', 'expected', '0529', 'deltaapproximation', 'this', 'compares', 'with', 'a', 'recent', 'more', 'complex', 'deltaapproximationcitebcgs17', 'which', 'holds', 'deterministically']] | [-0.14042270391687958, 0.05795253275314786, -0.09686471175195442, 0.10087850532597965, -0.09492165952300032, -0.1893188333707965, 0.1221061232396298, 0.4067622413651811, -0.23833907538404067, -0.3222581669429524, 0.05577092229181694, -0.24481220814502902, -0.19897002884212675, 0.24229550382329357, -0.12963870547504888, 0.06845913914860123, 0.09485059459176329, 0.08394269538629386, -0.013178569407642095, -0.3077102974264158, 0.21148337452517202, 0.03801521521268619, 0.23613583664927218, 0.06902467140203548, 0.07065085202662481, 0.04527654339455896, 0.01638217229499585, 0.06677405381989147, -0.14464008757729768, 0.11071253192623974, 0.2631402740487829, 0.1938221778234745, 0.2550658610028525, -0.3390848189385401, -0.12818117431468434, 0.17933816397562624, 0.14409374505048617, 0.11179918706054903, -0.0481402725946585, -0.19230541133632262, 0.09700709713312487, -0.1449779696906464, -0.0728446150974681, -0.04297607579889397, 0.027227230680485565, 0.04521351799679299, -0.37078280128124685, 0.06863346127275792, 0.12245444386499002, -0.010763883994271358, -0.009704719357089036, -0.13928706362946994, 0.10211206306444688, 0.06501873580531942, -0.06822225387570345, 0.06430582365331551, 0.014539373562567764, -0.07984121757197297, -0.2041672264639702, 0.36344584330088564, -0.07517105010855529, -0.15602190490786194, 0.11301406397380763, -0.044655355304065676, -0.20810253655848404, 0.08052043793722988, 0.18658418010713326, 0.1857594424755209, -0.11730198258947995, 0.10389465031136448, -0.13832221968720357, 0.13756590053930673, 0.07993445795857244, 0.015072761626086301, 0.030215299458035992, 0.18951639863403721, 0.2186951406403548, 0.1691980799789437, 0.04609715010349949, -0.0799989798940563, -0.2510413012777766, -0.1200360609716477, -0.21227210937067867, 0.032001296389434074, -0.20974931293134835, -0.21958479019166488, 0.3698206998821762, 0.09520251706449522, 0.22666558086251218, 0.19159714024151778, 0.3084276340074009, 0.05974854030905084, 0.012808594030017655, 0.22666019715058308, 0.1735408074972737, 0.1120340821126269, 0.06335684233862493, -0.11455644273147401, 0.1119546600526923, 0.07056033749961191] |
1,803.00787 | Evaluation of tsunami wave energy generated by earthquakes in the Makran
subduction zone | The Makran subduction zone, an approximate 1000 km section of the
Eurasian-Arabian plate, is located offshore of Southern Iran and Pakistan. In
1945, the Makran subduction zone (MSZ) generated a tsunamigenic earthquake with
a magnitude of Mw 8.1. The region has also experienced large historical
earthquakes but the data regarding these events are poorly documented.
Therefore, the need to investigate tsunamis in Makran must be taken into
serious consideration. Using hydrodynamic numerical simulation, we evaluate the
tsunami wave energy generated by bottom motion for a tsunamigenic source model
distributed along the full length of the Makran subduction zone. The whole
rupture of the plate boundary is divided into 20 segments with width of order
of 200 km and a co-seismic slip of 10 m but with various lengths. Exchanges
between kinetic and potential components of tsunami wave energy are shown. The
total tsunami wave energy displays only 0.33% of the seismic energy released
from the earthquake source. As a result, for every increase in magnitude by one
unit, the associated tsunami wave energy becomes about 10^3 times greater.
| physics.geo-ph | the makran subduction zone an approximate 1000 km section of the eurasianarabian plate is located offshore of southern iran and pakistan in 1945 the makran subduction zone msz generated a tsunamigenic earthquake with a magnitude of mw 81 the region has also experienced large historical earthquakes but the data regarding these events are poorly documented therefore the need to investigate tsunamis in makran must be taken into serious consideration using hydrodynamic numerical simulation we evaluate the tsunami wave energy generated by bottom motion for a tsunamigenic source model distributed along the full length of the makran subduction zone the whole rupture of the plate boundary is divided into 20 segments with width of order of 200 km and a coseismic slip of 10 m but with various lengths exchanges between kinetic and potential components of tsunami wave energy are shown the total tsunami wave energy displays only 033 of the seismic energy released from the earthquake source as a result for every increase in magnitude by one unit the associated tsunami wave energy becomes about 103 times greater | [['the', 'makran', 'subduction', 'zone', 'an', 'approximate', '1000', 'km', 'section', 'of', 'the', 'eurasianarabian', 'plate', 'is', 'located', 'offshore', 'of', 'southern', 'iran', 'and', 'pakistan', 'in', '1945', 'the', 'makran', 'subduction', 'zone', 'msz', 'generated', 'a', 'tsunamigenic', 'earthquake', 'with', 'a', 'magnitude', 'of', 'mw', '81', 'the', 'region', 'has', 'also', 'experienced', 'large', 'historical', 'earthquakes', 'but', 'the', 'data', 'regarding', 'these', 'events', 'are', 'poorly', 'documented', 'therefore', 'the', 'need', 'to', 'investigate', 'tsunamis', 'in', 'makran', 'must', 'be', 'taken', 'into', 'serious', 'consideration', 'using', 'hydrodynamic', 'numerical', 'simulation', 'we', 'evaluate', 'the', 'tsunami', 'wave', 'energy', 'generated', 'by', 'bottom', 'motion', 'for', 'a', 'tsunamigenic', 'source', 'model', 'distributed', 'along', 'the', 'full', 'length', 'of', 'the', 'makran', 'subduction', 'zone', 'the', 'whole', 'rupture', 'of', 'the', 'plate', 'boundary', 'is', 'divided', 'into', '20', 'segments', 'with', 'width', 'of', 'order', 'of', '200', 'km', 'and', 'a', 'coseismic', 'slip', 'of', '10', 'm', 'but', 'with', 'various', 'lengths', 'exchanges', 'between', 'kinetic', 'and', 'potential', 'components', 'of', 'tsunami', 'wave', 'energy', 'are', 'shown', 'the', 'total', 'tsunami', 'wave', 'energy', 'displays', 'only', '033', 'of', 'the', 'seismic', 'energy', 'released', 'from', 'the', 'earthquake', 'source', 'as', 'a', 'result', 'for', 'every', 'increase', 'in', 'magnitude', 'by', 'one', 'unit', 'the', 'associated', 'tsunami', 'wave', 'energy', 'becomes', 'about', '103', 'times', 'greater']] | [-0.15321217040073568, 0.16592254658898214, -0.024003590529489905, 0.08001747529685371, -0.037821023335606704, -0.01856489393512829, 0.01869461556770286, 0.31526705529014604, -0.2177181366178612, -0.3246904442370948, 0.15344643943067007, -0.3267102983034029, -0.04179947376566923, 0.22813637083985627, -0.012859819137450507, 0.018847192566589278, 0.09432360914300358, 0.02679006766006982, -0.0023179052523889785, -0.1713680482053824, 0.20985763144645167, 0.08103424096006458, 0.26583619893260174, 0.08489672684026514, 0.09308334451371351, -0.04401192571481132, -0.04997479597811645, -0.038240063167308685, -0.14572446754052287, 0.05529112360666448, 0.23590064103883496, 0.0722337727366531, 0.27173170794359286, -0.4704736758799274, -0.22403520185534584, 0.04977869697041431, 0.1100334437750806, 0.03879086594597179, 0.027642125218427915, -0.30578960171548153, 0.07179959123364865, -0.2027000275224784, -0.17144392330283667, 0.09723787839487616, 0.08409099699995128, 0.02051206305458626, -0.20588848109378105, 0.12427607068044165, 0.010156325438180886, 0.10682993427203116, -0.08311603993835456, -0.11207440833818946, -0.11223844124469906, 0.11854029286621233, 0.09654990598456777, 0.0498190126153259, 0.14865739474640002, -0.07210308332669536, -0.013009902514059538, 0.40294546705518064, -0.026677083258916975, -0.1061110114941826, 0.1358027117094025, -0.15387984956377895, -0.0024394870362123527, 0.1992324305807456, 0.20002030613069227, 0.019016522908251794, -0.1538728787458507, -0.02272086722893367, -0.010177794581155508, 0.14683330855477011, 0.16042467022030535, -0.06002965088970538, 0.22638409362716527, 0.1924472378045952, 0.052770423301320334, 0.11034259295234415, -0.21727098716918833, -0.08325391989411776, -0.30283748720099063, -0.12807110649675635, -0.13699396982220774, 0.019196270660847153, -0.09083132363967979, -0.14469974974251226, 0.4021417599613384, 0.14261612412034688, 0.15615129647355547, 0.011807817012061086, 0.26498486359582657, 0.0769363211061395, 0.11462605464677353, 0.1450751105686492, 0.2551325802707066, 0.07949912989785694, 0.13263241819890037, -0.15037480319355545, 0.07322066961945492, 0.016332625237814452] |
1,803.00788 | Automated Map Reading: Image Based Localisation in 2-D Maps Using Binary
Semantic Descriptors | We describe a novel approach to image based localisation in urban
environments using semantic matching between images and a 2-D map. It contrasts
with the vast majority of existing approaches which use image to image database
matching. We use highly compact binary descriptors to represent semantic
features at locations, significantly increasing scalability compared with
existing methods and having the potential for greater invariance to variable
imaging conditions. The approach is also more akin to human map reading, making
it more suited to human-system interaction. The binary descriptors indicate the
presence or not of semantic features relating to buildings and road junctions
in discrete viewing directions. We use CNN classifiers to detect the features
in images and match descriptor estimates with a database of location tagged
descriptors derived from the 2-D map. In isolation, the descriptors are not
sufficiently discriminative, but when concatenated sequentially along a route,
their combination becomes highly distinctive and allows localisation even when
using non-perfect classifiers. Performance is further improved by taking into
account left or right turns over a route. Experimental results obtained using
Google StreetView and OpenStreetMap data show that the approach has
considerable potential, achieving localisation accuracy of around 85% using
routes corresponding to approximately 200 meters.
| cs.CV cs.RO | we describe a novel approach to image based localisation in urban environments using semantic matching between images and a 2d map it contrasts with the vast majority of existing approaches which use image to image database matching we use highly compact binary descriptors to represent semantic features at locations significantly increasing scalability compared with existing methods and having the potential for greater invariance to variable imaging conditions the approach is also more akin to human map reading making it more suited to humansystem interaction the binary descriptors indicate the presence or not of semantic features relating to buildings and road junctions in discrete viewing directions we use cnn classifiers to detect the features in images and match descriptor estimates with a database of location tagged descriptors derived from the 2d map in isolation the descriptors are not sufficiently discriminative but when concatenated sequentially along a route their combination becomes highly distinctive and allows localisation even when using nonperfect classifiers performance is further improved by taking into account left or right turns over a route experimental results obtained using google streetview and openstreetmap data show that the approach has considerable potential achieving localisation accuracy of around 85 using routes corresponding to approximately 200 meters | [['we', 'describe', 'a', 'novel', 'approach', 'to', 'image', 'based', 'localisation', 'in', 'urban', 'environments', 'using', 'semantic', 'matching', 'between', 'images', 'and', 'a', '2d', 'map', 'it', 'contrasts', 'with', 'the', 'vast', 'majority', 'of', 'existing', 'approaches', 'which', 'use', 'image', 'to', 'image', 'database', 'matching', 'we', 'use', 'highly', 'compact', 'binary', 'descriptors', 'to', 'represent', 'semantic', 'features', 'at', 'locations', 'significantly', 'increasing', 'scalability', 'compared', 'with', 'existing', 'methods', 'and', 'having', 'the', 'potential', 'for', 'greater', 'invariance', 'to', 'variable', 'imaging', 'conditions', 'the', 'approach', 'is', 'also', 'more', 'akin', 'to', 'human', 'map', 'reading', 'making', 'it', 'more', 'suited', 'to', 'humansystem', 'interaction', 'the', 'binary', 'descriptors', 'indicate', 'the', 'presence', 'or', 'not', 'of', 'semantic', 'features', 'relating', 'to', 'buildings', 'and', 'road', 'junctions', 'in', 'discrete', 'viewing', 'directions', 'we', 'use', 'cnn', 'classifiers', 'to', 'detect', 'the', 'features', 'in', 'images', 'and', 'match', 'descriptor', 'estimates', 'with', 'a', 'database', 'of', 'location', 'tagged', 'descriptors', 'derived', 'from', 'the', '2d', 'map', 'in', 'isolation', 'the', 'descriptors', 'are', 'not', 'sufficiently', 'discriminative', 'but', 'when', 'concatenated', 'sequentially', 'along', 'a', 'route', 'their', 'combination', 'becomes', 'highly', 'distinctive', 'and', 'allows', 'localisation', 'even', 'when', 'using', 'nonperfect', 'classifiers', 'performance', 'is', 'further', 'improved', 'by', 'taking', 'into', 'account', 'left', 'or', 'right', 'turns', 'over', 'a', 'route', 'experimental', 'results', 'obtained', 'using', 'google', 'streetview', 'and', 'openstreetmap', 'data', 'show', 'that', 'the', 'approach', 'has', 'considerable', 'potential', 'achieving', 'localisation', 'accuracy', 'of', 'around', '85', 'using', 'routes', 'corresponding', 'to', 'approximately', '200', 'meters']] | [-0.038650088662108444, -0.001126157424385141, -0.09470811401828756, 0.04264045015520535, -0.0738167287930938, -0.18034514133345905, 0.047713323623593436, 0.46018221307995505, -0.26617365487360306, -0.33410769662466544, 0.08653083468759845, -0.3183947249965569, -0.15333641921697652, 0.20481842336029255, -0.1009893890543671, 0.05922662442678522, 0.11019843388601147, 0.030058127908802273, -0.09390626893242021, -0.23594166895860963, 0.2765021748468624, 0.06311588232254087, 0.3368193367909034, 0.01168534251416258, 0.10602774531660794, -0.009962766377723848, -0.06375636134108556, 0.030969972908038077, -0.048422777135703046, 0.17214068899784477, 0.28755632185593955, 0.14357014303669113, 0.2247731925626033, -0.39880359403615856, -0.2094228482878884, 0.07998349023248835, 0.148819275964235, 0.1127473615434507, -0.03304111355358822, -0.374665431704675, 0.12593498328136363, -0.13809656429338485, -0.03294191107364931, -0.13633301547210058, 0.01336596145872669, -0.00947835413610627, -0.27086627855552864, 0.04494310369852155, 0.04480829070668594, 0.07520809034206744, -0.08640153937900824, -0.07634413928975434, -0.017951662521442317, 0.18049238318619845, -0.0025318146102919514, 0.07512524827232062, 0.15769631295147227, -0.20279858001906956, -0.09323578218762014, 0.4179720557730627, -0.052901812273953935, -0.20747090741565333, 0.23940670736629535, -0.0858956836829228, -0.10554255799991377, 0.14649856778715045, 0.1799987017342206, 0.10161495448452572, -0.15187367646948646, -0.02362846700288814, -0.025763196158429306, 0.1844862277385563, 0.10058791821379802, 0.03310226302782046, 0.22909495325213106, 0.21054819418608298, 0.0775092705084112, 0.1338756007914835, -0.1693716167266999, -0.04607520717898099, -0.18271136495830684, -0.09820732773910162, -0.1753361806757473, -0.02788806368410186, -0.12265513555145033, -0.13133656517304296, 0.38522155040627337, 0.23958762108894258, 0.22565776201910132, 0.0748552273565518, 0.3237967641583731, 0.022191105736763642, 0.14692540371646012, 0.07954669026245037, 0.15323760852520468, 0.037110167155225804, 0.09787868562422858, -0.12075782576323546, 0.07126624604086093, 0.060106321615327536] |
1,803.00789 | Bellman Functions and Dimension Free $L^p$estimates for the Riesz
Transforms in Bessel settings | In this article we prove dimension free $L^p$-boundedness of Riesz transforms
associated with a Bessel diferential operator. We obtain explicit estimates of
the $L^p$-norms for the Bessel-Riesz transforms in terms of p, establishing a
linear behaviour with respect to p. We use the Bellman function technique to
prove a bilinear dimension free inequality involving Poisson semigroups defined
through this Bessel operator.
| math.CA | in this article we prove dimension free lpboundedness of riesz transforms associated with a bessel diferential operator we obtain explicit estimates of the lpnorms for the besselriesz transforms in terms of p establishing a linear behaviour with respect to p we use the bellman function technique to prove a bilinear dimension free inequality involving poisson semigroups defined through this bessel operator | [['in', 'this', 'article', 'we', 'prove', 'dimension', 'free', 'lpboundedness', 'of', 'riesz', 'transforms', 'associated', 'with', 'a', 'bessel', 'diferential', 'operator', 'we', 'obtain', 'explicit', 'estimates', 'of', 'the', 'lpnorms', 'for', 'the', 'besselriesz', 'transforms', 'in', 'terms', 'of', 'p', 'establishing', 'a', 'linear', 'behaviour', 'with', 'respect', 'to', 'p', 'we', 'use', 'the', 'bellman', 'function', 'technique', 'to', 'prove', 'a', 'bilinear', 'dimension', 'free', 'inequality', 'involving', 'poisson', 'semigroups', 'defined', 'through', 'this', 'bessel', 'operator']] | [-0.11882855250026847, 0.07285602088467996, -0.09342408110387623, 0.12098903799444803, -0.1100447364914857, -0.08640968015600668, 0.003687011108535235, 0.33221834189579136, -0.3586625012523327, -0.1412144258482855, 0.0948279386913007, -0.2879337095960853, -0.16655530672153976, 0.20618657202872095, -0.08224569024426527, 0.10789948643841704, 0.024182113223388545, 0.0795342959768948, -0.1788357042852545, -0.22618542985845602, 0.3828801666615439, -0.04869223882245724, 0.17455704865946634, 0.03174900773485176, 0.1251290092153139, 0.06627653668191834, -0.054854780023337386, -0.10305261569189243, -0.22663238624752055, 0.18120043507975633, 0.25275889469585455, 0.05316091615889893, 0.31194382939548765, -0.37122503955100405, -0.13276508077979088, 0.21208435393198102, 0.1334132845284509, -0.05335832430721551, -0.03313636566802371, -0.2835057073226962, 0.05567026127618356, -0.13955660344513712, -0.24872542642911927, -0.11322569413507572, -0.0029419942407822998, 0.09510919350947512, -0.3860711778865242, 0.10389308359657155, 0.14308246371687436, 0.0839424236967671, -0.11192274276075549, -0.12071465918427852, 0.04843818694811131, 8.267756994264048e-05, 0.01675711053072429, 0.007953816635503631, 0.035733386127518675, -0.025451197998873035, -0.10667407167617415, 0.2935991766022854, -0.07333171784450285, -0.312604053220788, 0.07845012362679986, -0.1944520681119356, -0.11754755499833798, 0.05351511590549203, 0.11915237935962247, 0.1289090363033971, -0.1117481682602255, 0.1908336440940983, -0.05497820632623845, 0.07045708957403043, 0.1593742325718774, 0.0594802311560536, -0.01968028048076285, 0.05380766043347902, 0.1888990150153881, 0.2366917571816288, 0.027281394326624263, -0.0700464547138478, -0.39094680291218836, -0.24526579358202757, -0.1832044715458741, 0.12650752934764642, -0.12013312396364378, -0.21790744916948138, 0.3434335115503092, 0.06507162202233602, 0.15921449468883334, 0.16741796318808053, 0.1892922456513663, 0.24985542378128797, 0.029346295075155186, 0.033671557581716326, 0.08107527969863082, 0.21434721476245733, 0.09447053947379111, -0.167402377993357, -0.015785119442849375, 0.28434146584973474] |
1,803.0079 | Birth Death Swap population in random environment and aggregation with
two timescales | This paper deals with the stochastic modeling of a class of heterogeneous
population in a random environment, called birth-death-swap. In addition to
demographic events, swap events, i.e. moves between subgroups, occur in the
population. Event intensities are random functionals of the multi-type
population. In the first part, we show that the complexity of the problem is
significantly reduced by modeling the jumps measure of the population,
described by a multivariate counting process. This process is defined as a
solution of a stochastic differential system with random coefficients, driven
by a multivariate Poisson random measure. The solution is obtained under weak
assumptions, by the thinning of a strongly dominating point process generated
by the same Poisson measure. This key construction relies on a general strong
comparison result, of independent interest. The second part is dedicated to
averaging results when swap events are significantly more frequent than
demographic events. An important ingredient is the stable convergence, which is
well-adapted to the general random environment. The pathwise construction by
domination yields tightness results straightforwardly. At the limit, the
demographic intensity functionals are averaged against random kernels depending
on swap events. Finally, under a natural assumption, we show the convergence of
the aggregated population to a "true" birth-death process in random
environment, with non-linear intensity functionals.
| math.PR | this paper deals with the stochastic modeling of a class of heterogeneous population in a random environment called birthdeathswap in addition to demographic events swap events ie moves between subgroups occur in the population event intensities are random functionals of the multitype population in the first part we show that the complexity of the problem is significantly reduced by modeling the jumps measure of the population described by a multivariate counting process this process is defined as a solution of a stochastic differential system with random coefficients driven by a multivariate poisson random measure the solution is obtained under weak assumptions by the thinning of a strongly dominating point process generated by the same poisson measure this key construction relies on a general strong comparison result of independent interest the second part is dedicated to averaging results when swap events are significantly more frequent than demographic events an important ingredient is the stable convergence which is welladapted to the general random environment the pathwise construction by domination yields tightness results straightforwardly at the limit the demographic intensity functionals are averaged against random kernels depending on swap events finally under a natural assumption we show the convergence of the aggregated population to a true birthdeath process in random environment with nonlinear intensity functionals | [['this', 'paper', 'deals', 'with', 'the', 'stochastic', 'modeling', 'of', 'a', 'class', 'of', 'heterogeneous', 'population', 'in', 'a', 'random', 'environment', 'called', 'birthdeathswap', 'in', 'addition', 'to', 'demographic', 'events', 'swap', 'events', 'ie', 'moves', 'between', 'subgroups', 'occur', 'in', 'the', 'population', 'event', 'intensities', 'are', 'random', 'functionals', 'of', 'the', 'multitype', 'population', 'in', 'the', 'first', 'part', 'we', 'show', 'that', 'the', 'complexity', 'of', 'the', 'problem', 'is', 'significantly', 'reduced', 'by', 'modeling', 'the', 'jumps', 'measure', 'of', 'the', 'population', 'described', 'by', 'a', 'multivariate', 'counting', 'process', 'this', 'process', 'is', 'defined', 'as', 'a', 'solution', 'of', 'a', 'stochastic', 'differential', 'system', 'with', 'random', 'coefficients', 'driven', 'by', 'a', 'multivariate', 'poisson', 'random', 'measure', 'the', 'solution', 'is', 'obtained', 'under', 'weak', 'assumptions', 'by', 'the', 'thinning', 'of', 'a', 'strongly', 'dominating', 'point', 'process', 'generated', 'by', 'the', 'same', 'poisson', 'measure', 'this', 'key', 'construction', 'relies', 'on', 'a', 'general', 'strong', 'comparison', 'result', 'of', 'independent', 'interest', 'the', 'second', 'part', 'is', 'dedicated', 'to', 'averaging', 'results', 'when', 'swap', 'events', 'are', 'significantly', 'more', 'frequent', 'than', 'demographic', 'events', 'an', 'important', 'ingredient', 'is', 'the', 'stable', 'convergence', 'which', 'is', 'welladapted', 'to', 'the', 'general', 'random', 'environment', 'the', 'pathwise', 'construction', 'by', 'domination', 'yields', 'tightness', 'results', 'straightforwardly', 'at', 'the', 'limit', 'the', 'demographic', 'intensity', 'functionals', 'are', 'averaged', 'against', 'random', 'kernels', 'depending', 'on', 'swap', 'events', 'finally', 'under', 'a', 'natural', 'assumption', 'we', 'show', 'the', 'convergence', 'of', 'the', 'aggregated', 'population', 'to', 'a', 'true', 'birthdeath', 'process', 'in', 'random', 'environment', 'with', 'nonlinear', 'intensity', 'functionals']] | [-0.0989296668892179, 0.1266597337448794, -0.07683585204572474, 0.1153948495333964, -0.024646734939093626, -0.08403805019642928, 0.06430764125287092, 0.35472429762219226, -0.288600292233353, -0.25680737411470916, 0.10747550988527924, -0.26090858928788613, -0.14027764229214268, 0.19364174930555347, -0.11094785602023975, 0.025355166566924534, 0.08771977424003644, 0.028195882715964557, 0.00198145993649783, -0.2571681884693432, 0.3333618340492955, 0.07316915166947187, 0.29019320357626227, -0.058930372499851995, 0.12469591381981686, 0.03642503453569787, -0.08347292615308192, 0.023687448612992514, -0.09286901392324709, 0.0951668007108405, 0.21628350425970638, 0.1027682693534124, 0.3236905248058845, -0.39030052523759867, -0.21000927549392928, 0.13352802723107673, 0.07839060565252608, 0.08489256322503054, -0.03501041631041353, -0.30557303621888304, 0.06856512929857995, -0.13578798176976742, -0.12574176452568428, -0.021946657511904413, 0.011281192514568708, 0.08681991952802474, -0.3263451960908858, 0.09531883089345222, 0.10797382930902791, 0.043488444813407995, -0.0066351867832631865, -0.0624814846313457, -0.0033256475464992614, 0.07474766947261181, 0.05443804472479616, 0.0005822767088657589, 0.16655161122072012, -0.09058751766702328, -0.14078921235444564, 0.35015631911137374, -0.10530150766873134, -0.21433252600900016, 0.18502754984441175, -0.16660255706599822, -0.16091425434776727, 0.1611154724609866, 0.1789804003587637, 0.13042747998561585, -0.2114709948195212, 0.08199898255837919, -0.026037869888900722, 0.13100369878941417, 0.03390377602855547, -0.005253289874214944, 0.14346772711724043, 0.18248373841518156, 0.12988112297491722, 0.1470490934413315, -0.05883976870759333, -0.16039663085921432, -0.29475389907171873, -0.10658783673323134, -0.1835890691903954, 0.0757730294965755, -0.14353444926679063, -0.2021421272819641, 0.3759012020290145, 0.1494320732545796, 0.1936476216982538, 0.09034847835425323, 0.2511951058189345, 0.1897099680500105, -0.004719705575242886, 0.0442844020882489, 0.13011667459002604, 0.13960950326469537, 0.06715531782931274, -0.1596687795778889, 0.17679967853501086, 0.0705194761049691] |
1,803.00791 | Gigahertz Single-Electron Pumping Mediated by Parasitic States | In quantum metrology, semiconductor single-electron pumps are used to
generate accurate electric currents with the ultimate goal of implementing the
emerging quantum standard of the ampere. Pumps based on electrostatically
defined tunable quantum dots (QDs) have thus far shown the most promising
performance in combining fast and accurate charge transfer. However, at
frequencies exceeding approximately 1 GHz, the accuracy typically decreases.
Recently, hybrid pumps based on QDs coupled to trap states have led to
increased transfer rates due to tighter electrostatic confinement. Here, we
operate a hybrid electron pump in silicon obtained by coupling a QD to multiple
parasitic states, and achieve robust current quantization up to a few
gigahertz. We show that the fidelity of the electron capture depends on the
sequence in which the parasitic states become available for loading, resulting
in distinctive frequency dependent features in the pumped current.
| cond-mat.mes-hall | in quantum metrology semiconductor singleelectron pumps are used to generate accurate electric currents with the ultimate goal of implementing the emerging quantum standard of the ampere pumps based on electrostatically defined tunable quantum dots qds have thus far shown the most promising performance in combining fast and accurate charge transfer however at frequencies exceeding approximately 1 ghz the accuracy typically decreases recently hybrid pumps based on qds coupled to trap states have led to increased transfer rates due to tighter electrostatic confinement here we operate a hybrid electron pump in silicon obtained by coupling a qd to multiple parasitic states and achieve robust current quantization up to a few gigahertz we show that the fidelity of the electron capture depends on the sequence in which the parasitic states become available for loading resulting in distinctive frequency dependent features in the pumped current | [['in', 'quantum', 'metrology', 'semiconductor', 'singleelectron', 'pumps', 'are', 'used', 'to', 'generate', 'accurate', 'electric', 'currents', 'with', 'the', 'ultimate', 'goal', 'of', 'implementing', 'the', 'emerging', 'quantum', 'standard', 'of', 'the', 'ampere', 'pumps', 'based', 'on', 'electrostatically', 'defined', 'tunable', 'quantum', 'dots', 'qds', 'have', 'thus', 'far', 'shown', 'the', 'most', 'promising', 'performance', 'in', 'combining', 'fast', 'and', 'accurate', 'charge', 'transfer', 'however', 'at', 'frequencies', 'exceeding', 'approximately', '1', 'ghz', 'the', 'accuracy', 'typically', 'decreases', 'recently', 'hybrid', 'pumps', 'based', 'on', 'qds', 'coupled', 'to', 'trap', 'states', 'have', 'led', 'to', 'increased', 'transfer', 'rates', 'due', 'to', 'tighter', 'electrostatic', 'confinement', 'here', 'we', 'operate', 'a', 'hybrid', 'electron', 'pump', 'in', 'silicon', 'obtained', 'by', 'coupling', 'a', 'qd', 'to', 'multiple', 'parasitic', 'states', 'and', 'achieve', 'robust', 'current', 'quantization', 'up', 'to', 'a', 'few', 'gigahertz', 'we', 'show', 'that', 'the', 'fidelity', 'of', 'the', 'electron', 'capture', 'depends', 'on', 'the', 'sequence', 'in', 'which', 'the', 'parasitic', 'states', 'become', 'available', 'for', 'loading', 'resulting', 'in', 'distinctive', 'frequency', 'dependent', 'features', 'in', 'the', 'pumped', 'current']] | [-0.1234992774753523, 0.18314513524758144, 0.01946273710395039, 0.010469630062186592, 0.021331493336130197, -0.22727110569732606, 0.05277699305311921, 0.41557299566756883, -0.22721530479775795, -0.31307446327007993, 0.02362321260791849, -0.26802891111788407, -0.06956037148279072, 0.2879419302908887, -0.03760931246035116, 0.11027701389254399, 0.038672393869975924, -0.032336077374130696, -0.035128052141451815, -0.14701718848664314, 0.2288072699267732, 0.08689811046671411, 0.37526596510376203, 0.08120857928158112, 0.12172368639411116, -0.060860620054062196, 0.0733231359036823, -0.030493088145281226, -0.09410005646068513, 0.14043797273229822, 0.2626907910272794, -0.03421900876876439, 0.26194285604984724, -0.4971411461666436, -0.19850502568165915, 0.03260813192158001, 0.1572572964015679, 0.15221365574094742, -0.0892816650981254, -0.26184235611425477, 0.07128124008886516, -0.16928326475686511, -0.054196477759445846, -0.07929030032894037, -0.004448337286946849, 0.037445495864720756, -0.27872970563271016, 0.05975497769139392, 0.009687245138888051, 0.009322926061044276, -0.015150128903103546, -0.10809709565241782, -0.007194141568747205, 0.11594413043103102, -0.056137642823159695, 0.04091518729413584, 0.24451494184781758, -0.10972322305479139, -0.14501379524082156, 0.3066289188392775, -0.08028369947520256, -0.17420356441945048, 0.18076235585531195, -0.15889764484018087, -0.04330807243486945, 0.14535508278599926, 0.16303163765057344, 0.10441102738439723, -0.11438614476724646, 0.013154926449945852, 0.07713453849764462, 0.19435979602989598, 0.10811184465714639, 0.14553068559879148, 0.26777220791710776, 0.18633673855424923, 0.08107893605073782, 0.11716936964830252, -0.11013786561547739, -0.10425250203197849, -0.19427416278877374, -0.12172350631252056, -0.21946002409832788, 0.10939864431094692, 0.008981009096138403, -0.1525472936588979, 0.43896192246982435, 0.19497152133746415, 0.13895537122808607, -0.03721208067555112, 0.32490054923306466, 0.15530535514781277, 0.1290345866820106, 0.04777048965653693, 0.31799740725505155, 0.1572324315341793, 0.09178483928389795, -0.2751488274251911, -0.005535127873807936, -0.053052128382801066] |
1,803.00792 | A microscopic model for a one parameter class of fractional laplacians
with dirichlet boundary conditions | We prove the hydrodynamic limit for the symmetric exclusion process with long
jumps given by a mean zero probability transition rate with infinite variance
and in contact with infinitely many reservoirs with density $\alpha$ at the
left of the system and $\beta$ at the right of the system. The strength of the
reservoirs is ruled by $\kappa$N --$\theta$ > 0. Here N is the size of the
system, $\kappa$ > 0 and $\theta$ $\in$. Our results are valid for $\theta$
$\le$ 0. For $\theta$ = 0, we obtain a collection of fractional
reaction-diffusion equations indexed by the parameter $\kappa$ and with
Dirichlet boundary conditions. Their solutions also depend on $\kappa$. For
$\theta$ < 0, the hydrodynamic equation corresponds to a reaction equation with
Dirichlet boundary conditions. The case $\theta$ > 0 is still open. For that
reason we also analyze the convergence of the unique weak solution of the
equation in the case $\theta$ = 0 when we send the parameter $\kappa$ to zero.
Indeed, we conjecture that the limiting profile when $\kappa$ $\rightarrow$ 0
is the one that we should obtain when taking small values of $\theta$ > 0.
| math-ph cond-mat.stat-mech math.AP math.MP math.PR | we prove the hydrodynamic limit for the symmetric exclusion process with long jumps given by a mean zero probability transition rate with infinite variance and in contact with infinitely many reservoirs with density alpha at the left of the system and beta at the right of the system the strength of the reservoirs is ruled by kappan theta 0 here n is the size of the system kappa 0 and theta in our results are valid for theta le 0 for theta 0 we obtain a collection of fractional reactiondiffusion equations indexed by the parameter kappa and with dirichlet boundary conditions their solutions also depend on kappa for theta 0 the hydrodynamic equation corresponds to a reaction equation with dirichlet boundary conditions the case theta 0 is still open for that reason we also analyze the convergence of the unique weak solution of the equation in the case theta 0 when we send the parameter kappa to zero indeed we conjecture that the limiting profile when kappa rightarrow 0 is the one that we should obtain when taking small values of theta 0 | [['we', 'prove', 'the', 'hydrodynamic', 'limit', 'for', 'the', 'symmetric', 'exclusion', 'process', 'with', 'long', 'jumps', 'given', 'by', 'a', 'mean', 'zero', 'probability', 'transition', 'rate', 'with', 'infinite', 'variance', 'and', 'in', 'contact', 'with', 'infinitely', 'many', 'reservoirs', 'with', 'density', 'alpha', 'at', 'the', 'left', 'of', 'the', 'system', 'and', 'beta', 'at', 'the', 'right', 'of', 'the', 'system', 'the', 'strength', 'of', 'the', 'reservoirs', 'is', 'ruled', 'by', 'kappan', 'theta', '0', 'here', 'n', 'is', 'the', 'size', 'of', 'the', 'system', 'kappa', '0', 'and', 'theta', 'in', 'our', 'results', 'are', 'valid', 'for', 'theta', 'le', '0', 'for', 'theta', '0', 'we', 'obtain', 'a', 'collection', 'of', 'fractional', 'reactiondiffusion', 'equations', 'indexed', 'by', 'the', 'parameter', 'kappa', 'and', 'with', 'dirichlet', 'boundary', 'conditions', 'their', 'solutions', 'also', 'depend', 'on', 'kappa', 'for', 'theta', '0', 'the', 'hydrodynamic', 'equation', 'corresponds', 'to', 'a', 'reaction', 'equation', 'with', 'dirichlet', 'boundary', 'conditions', 'the', 'case', 'theta', '0', 'is', 'still', 'open', 'for', 'that', 'reason', 'we', 'also', 'analyze', 'the', 'convergence', 'of', 'the', 'unique', 'weak', 'solution', 'of', 'the', 'equation', 'in', 'the', 'case', 'theta', '0', 'when', 'we', 'send', 'the', 'parameter', 'kappa', 'to', 'zero', 'indeed', 'we', 'conjecture', 'that', 'the', 'limiting', 'profile', 'when', 'kappa', 'rightarrow', '0', 'is', 'the', 'one', 'that', 'we', 'should', 'obtain', 'when', 'taking', 'small', 'values', 'of', 'theta', '0']] | [-0.17665302880678346, 0.16502151246655916, -0.05837336344446585, 0.01303101948733307, -0.032914667130738005, -0.19082918402082363, 0.04912907190435144, 0.31162363436846624, -0.3006717856474669, -0.2142183925966666, 0.10506236075603052, -0.3081717293065733, -0.07361352922206571, 0.169704909352433, 0.025099251480376134, 0.04698830192389865, 0.010477490901254891, 0.09938433607200496, -0.0656320757844582, -0.21094010760142504, 0.3508488175858708, -0.034621977384706015, 0.1772126625521017, 0.043059592460322864, 0.10655090336234925, -0.04109829037877746, 0.06339930618039327, -0.012129021683819796, -0.2547153432750066, 0.006329730292082423, 0.20226965259182994, 0.033739688023772155, 0.2582742635009917, -0.3264460157541955, -0.16532096110635483, 0.12623535743354733, 0.14266357396200013, 0.025357805177202968, 0.042407355442403975, -0.26906296482711745, 0.1163230255943382, -0.11074656778895627, -0.21564938319602706, -0.024881321079316523, 0.0944664360105462, 0.06570573671608959, -0.35110975365800773, 0.1297162687065604, 0.09461807069251608, 0.028589335331296335, -0.07210549488765457, -0.16608563799454318, -0.031461360788003344, 0.11760905570884317, 0.09016171072420787, 0.03516894445167422, 0.058174883903518236, -0.18045511596347588, -0.003281004497873001, 0.32317136746164554, -0.11029016982402673, -0.27425013401779685, 0.1343176789855956, -0.23195558375694225, -0.13684073003782518, 0.12430804906300996, 0.0749897229780387, 0.15653613129060695, -0.06955947611177826, 0.19449899264082027, -0.03703680583670267, 0.16472135331924456, 0.10449708185713392, -0.04942485552963093, 0.15009287906596896, 0.12034970742925147, 0.09471773969447189, 0.13004319874768253, -0.0789687883559248, -0.07906417079178281, -0.3684718497097492, -0.1635743576137583, -0.16102584877148107, 0.1416197620037863, -0.143496579579981, -0.15791065920948413, 0.2853991704601082, 0.14672883502029574, 0.2071107775583619, 0.1130623754490513, 0.2036528352576771, 0.18024436517839976, -0.03540048114522844, 0.06265861152122917, 0.1589408288302684, 0.13331188121301635, 0.07284038033224438, -0.21162316591804592, 0.06273733531099444, 0.04559652973602582] |
1,803.00793 | Equivalence of some subcritical properties in continuum percolation | We consider the Boolean model on $\R^d$. We prove some equivalences between
subcritical percolation properties. Let us introduce some notations to state
one of these equivalences. Let $C$ denote the connected component of the origin
in the Boolean model. Let $|C|$ denotes its volume. Let $\ell$ denote the
maximal length of a chain of random balls from the origin. Under optimal
integrability conditions on the radii, we prove that $E(|C|)$ is finite if and
only if there exists $A,B >0$ such that $\P(\ell \ge n) \le Ae^{-Bn}$ for all
$n \ge 1$.
| math.PR | we consider the boolean model on rd we prove some equivalences between subcritical percolation properties let us introduce some notations to state one of these equivalences let c denote the connected component of the origin in the boolean model let c denotes its volume let ell denote the maximal length of a chain of random balls from the origin under optimal integrability conditions on the radii we prove that ec is finite if and only if there exists ab 0 such that pell ge n le aebn for all n ge 1 | [['we', 'consider', 'the', 'boolean', 'model', 'on', 'rd', 'we', 'prove', 'some', 'equivalences', 'between', 'subcritical', 'percolation', 'properties', 'let', 'us', 'introduce', 'some', 'notations', 'to', 'state', 'one', 'of', 'these', 'equivalences', 'let', 'c', 'denote', 'the', 'connected', 'component', 'of', 'the', 'origin', 'in', 'the', 'boolean', 'model', 'let', 'c', 'denotes', 'its', 'volume', 'let', 'ell', 'denote', 'the', 'maximal', 'length', 'of', 'a', 'chain', 'of', 'random', 'balls', 'from', 'the', 'origin', 'under', 'optimal', 'integrability', 'conditions', 'on', 'the', 'radii', 'we', 'prove', 'that', 'ec', 'is', 'finite', 'if', 'and', 'only', 'if', 'there', 'exists', 'ab', '0', 'such', 'that', 'pell', 'ge', 'n', 'le', 'aebn', 'for', 'all', 'n', 'ge', '1']] | [-0.19624863666287817, 0.18195412948389875, -0.018515230527475147, 0.007559685779807086, -0.014990452326486235, -0.20942016076910627, 0.029381437910270397, 0.3288311203429987, -0.3327727773339375, -0.1614299335076914, 0.05504109292767, -0.3396402576754054, -0.0821584283507296, 0.14542161884646004, -0.033779364493726705, -0.0647515557241974, -0.00349320805437126, 0.11259431855568847, -0.05751166694828278, -0.22901759983378125, 0.31986369608113396, -0.11866953587261858, 0.16479414766193828, 0.06799051384275247, 0.09079073962581517, 0.020051244027134808, 0.06619011657312512, 0.005930888911729658, -0.2829734368800188, 0.0554766593050662, 0.23593442507374746, 0.18112836422521497, 0.27874735646604837, -0.3982629908023627, -0.15542016633796496, 0.2929721680280476, 0.15465511918927616, -0.08891148012960431, 0.03259532585238608, -0.22301344744922533, 0.21937575771800846, -0.09225564345635556, -0.16189380651493404, -0.01034110268209498, 0.14707177099618282, 0.049818720998610934, -0.3112791041590294, -0.02021198765794327, 0.12269486877094996, 0.07259070982767658, -0.0334308040187602, -0.18296567928864732, -0.05147734334037363, 0.07667235526573526, -0.038989990254976674, 0.05242980918898196, 0.05022931838111317, -0.04681233058243499, -0.10858830113148132, 0.3522518630814994, -0.046454609564894424, -0.2034394657341661, 0.11631832499016118, -0.22359216512068286, -0.15931648738006807, 0.04647442294223295, 0.11406372102734806, 0.1327834392969425, -0.021570422748042332, 0.2596114286788289, -0.0922361503222159, 0.16033211085372245, 0.07749791222798465, -0.007993870547839574, 0.13121873727784708, 0.10171833380565538, 0.11291202911429087, 0.13701436446997553, -0.040289738768159035, -0.011070146619413909, -0.38379506570297284, -0.1315853566668191, -0.1674133150513376, 0.2084734301379585, -0.17495642333776962, -0.1702729330326502, 0.3079399720581433, 0.13676780760436355, 0.1889020550668567, 0.16093319524488933, 0.1613040097648851, 0.05615012708969496, -0.008037167135626078, 0.118906451762746, 0.040680685329409626, 0.22131612528100159, -0.0545983356781877, -0.1875505337445577, 0.08781433164827772, 0.1714486870402982] |
1,803.00794 | Parity-Time Symmetry in Non-Hermitian Complex Optical Media | The explorations of the quantum-inspired symmetries in optical and photonic
systems have witnessed immense research interests both fundamentally and
technologically in a wide range of subjects of physics and engineering. One of
the principal emerging fields in this context is non-Hermitian physics based on
parity-time symmetry, originally proposed in the studies pertaining to quantum
mechanics and quantum field theory, recently ramified into diverse set of
areas, particularly in optics and photonics. The intriguing physical effects
enabled by non-Hermitian physics and PT symmetry have enhanced significant
applications prospects and engineering of novel materials. In addition, it has
observed increasing research interests in many emerging directions beyond
optics and photonics. This Review paper attempts to bring together the state of
the art developments in the field of complex non-Hermitian physics based on PT
symmetry in various physical settings along with elucidating key concepts and
background and a detailed perspective on new emerging directions. It can be
anticipated that this trendy field of interest can be indispensable in
providing new perspectives in maneuvering the flow of light in the diverse
physical platforms in optics, photonics, condensed matter, opto-electronics and
beyond, and offer distinctive applications prospects in novel functional
materials.
| physics.optics | the explorations of the quantuminspired symmetries in optical and photonic systems have witnessed immense research interests both fundamentally and technologically in a wide range of subjects of physics and engineering one of the principal emerging fields in this context is nonhermitian physics based on paritytime symmetry originally proposed in the studies pertaining to quantum mechanics and quantum field theory recently ramified into diverse set of areas particularly in optics and photonics the intriguing physical effects enabled by nonhermitian physics and pt symmetry have enhanced significant applications prospects and engineering of novel materials in addition it has observed increasing research interests in many emerging directions beyond optics and photonics this review paper attempts to bring together the state of the art developments in the field of complex nonhermitian physics based on pt symmetry in various physical settings along with elucidating key concepts and background and a detailed perspective on new emerging directions it can be anticipated that this trendy field of interest can be indispensable in providing new perspectives in maneuvering the flow of light in the diverse physical platforms in optics photonics condensed matter optoelectronics and beyond and offer distinctive applications prospects in novel functional materials | [['the', 'explorations', 'of', 'the', 'quantuminspired', 'symmetries', 'in', 'optical', 'and', 'photonic', 'systems', 'have', 'witnessed', 'immense', 'research', 'interests', 'both', 'fundamentally', 'and', 'technologically', 'in', 'a', 'wide', 'range', 'of', 'subjects', 'of', 'physics', 'and', 'engineering', 'one', 'of', 'the', 'principal', 'emerging', 'fields', 'in', 'this', 'context', 'is', 'nonhermitian', 'physics', 'based', 'on', 'paritytime', 'symmetry', 'originally', 'proposed', 'in', 'the', 'studies', 'pertaining', 'to', 'quantum', 'mechanics', 'and', 'quantum', 'field', 'theory', 'recently', 'ramified', 'into', 'diverse', 'set', 'of', 'areas', 'particularly', 'in', 'optics', 'and', 'photonics', 'the', 'intriguing', 'physical', 'effects', 'enabled', 'by', 'nonhermitian', 'physics', 'and', 'pt', 'symmetry', 'have', 'enhanced', 'significant', 'applications', 'prospects', 'and', 'engineering', 'of', 'novel', 'materials', 'in', 'addition', 'it', 'has', 'observed', 'increasing', 'research', 'interests', 'in', 'many', 'emerging', 'directions', 'beyond', 'optics', 'and', 'photonics', 'this', 'review', 'paper', 'attempts', 'to', 'bring', 'together', 'the', 'state', 'of', 'the', 'art', 'developments', 'in', 'the', 'field', 'of', 'complex', 'nonhermitian', 'physics', 'based', 'on', 'pt', 'symmetry', 'in', 'various', 'physical', 'settings', 'along', 'with', 'elucidating', 'key', 'concepts', 'and', 'background', 'and', 'a', 'detailed', 'perspective', 'on', 'new', 'emerging', 'directions', 'it', 'can', 'be', 'anticipated', 'that', 'this', 'trendy', 'field', 'of', 'interest', 'can', 'be', 'indispensable', 'in', 'providing', 'new', 'perspectives', 'in', 'maneuvering', 'the', 'flow', 'of', 'light', 'in', 'the', 'diverse', 'physical', 'platforms', 'in', 'optics', 'photonics', 'condensed', 'matter', 'optoelectronics', 'and', 'beyond', 'and', 'offer', 'distinctive', 'applications', 'prospects', 'in', 'novel', 'functional', 'materials']] | [-0.09495648728536289, 0.1472085141921321, -0.07919867912887082, -0.0025435302332898944, -0.09922456303706431, -0.1747612839526668, -0.02061261121677805, 0.3648494501617186, -0.2622717999073924, -0.33331290095075206, 0.08235735629153039, -0.25712662307326967, -0.22738800107558466, 0.25135339785614336, -0.06707538721360723, 0.10824469446765297, -0.0216163526276098, -0.0669390535628309, -0.08414802696361036, -0.18504456018111953, 0.2609672401342731, 0.038059475103497734, 0.35528152983407585, 0.10312482303665352, 0.05279224463120787, 0.03219400938571792, -0.021040938395474638, -0.014083881974125243, -0.11203574551150175, 0.1827103515887367, 0.3355907075325673, 0.1044143322802966, 0.311163278562682, -0.4701294939946003, -0.29386010172726984, 0.05919289717697823, 0.1460572963958245, 0.12421835566352939, -0.17855390586681802, -0.3269764077041906, -0.00467443211379518, -0.14111377917021056, -0.14836726682818951, -0.10551220366056552, 0.03780233069045032, -0.01943925976496646, -0.15057124735606947, -0.017605324596527736, 0.019968668958148444, 0.11807177515524649, -0.01152658802267088, -0.1265231356148285, 0.03284306085860946, 0.08585900164503908, 0.03960324001881028, 0.005848436071703743, 0.14007217504680441, -0.2097598988983343, -0.19520252587615836, 0.4438220885278163, 0.02777350600333694, -0.11201715050190948, 0.22905104702139006, -0.13029955782480918, -0.17600023686619742, 0.08200836004879401, 0.23973264673021527, 0.04950671109171318, -0.14697536487341384, 0.140033225741532, 0.030402918165663675, 0.09553400931965407, 0.0006182341973299674, 0.15826127220453617, 0.30059058813150136, 0.21428619598855778, 0.029961906625932008, 0.08914404931271505, -0.01870919115323459, -0.14961912916327008, -0.26208319825509907, -0.18933163681994097, -0.16327549816508377, 0.027106254839110284, -0.04238621035159556, -0.12265581181284743, 0.4440315452746439, 0.20835692656810909, 0.11955373167839585, -0.13263265577819655, 0.24788634272824442, 0.05475967162360297, 0.09941920371309199, 0.004161041683745475, 0.28865244231966075, 0.1663721050100154, 0.18417786301484293, -0.1499615346309634, -0.008605245481796411, -0.049519311127517784] |
1,803.00795 | Perceptual decision making: Biases in post-error reaction times
explained by attractor network dynamics | Perceptual decision making is the subject of many experimental and
theoretical studies. Whereas most modeling analysis are based on statistical
processes of accumulation of evidence, less attention is being devoted to the
modeling with attractor network dynamics, even though they describe well
psychophysical and neurophysiological data. In particular, very few works
confront attractor models predictions with data from continuous sequences of
trials. Recently however, a biophysical competitive attractor network model has
been used to describe such sequences of decision trials, and has been shown to
reproduce repetition biases observed in perceptual decision experiments. Here
we propose an extension of the reduced attractor network model of Wong and Wang
(2006) to get more insights into such effects. We make explicit the conditions
under which such network can perform a succession of decisions, and show that
the model provides a mathematical framework for studying the effects of a trial
on the decision made on the next one. We study in details the reaction times
properties during a sequence of decision trials, and show that the model
reproduces behavioral data, both qualitatively and quantitatively. In
particular, we find that the decision made on the current trial is biased
toward the one made on the previous trial. More remarkably, we show that, in
the absence of any feedback about the correctness of the decision, the network
exhibits post-error slowing, a subtle effect in agreement with empirical data.
| physics.bio-ph cond-mat.dis-nn q-bio.NC | perceptual decision making is the subject of many experimental and theoretical studies whereas most modeling analysis are based on statistical processes of accumulation of evidence less attention is being devoted to the modeling with attractor network dynamics even though they describe well psychophysical and neurophysiological data in particular very few works confront attractor models predictions with data from continuous sequences of trials recently however a biophysical competitive attractor network model has been used to describe such sequences of decision trials and has been shown to reproduce repetition biases observed in perceptual decision experiments here we propose an extension of the reduced attractor network model of wong and wang 2006 to get more insights into such effects we make explicit the conditions under which such network can perform a succession of decisions and show that the model provides a mathematical framework for studying the effects of a trial on the decision made on the next one we study in details the reaction times properties during a sequence of decision trials and show that the model reproduces behavioral data both qualitatively and quantitatively in particular we find that the decision made on the current trial is biased toward the one made on the previous trial more remarkably we show that in the absence of any feedback about the correctness of the decision the network exhibits posterror slowing a subtle effect in agreement with empirical data | [['perceptual', 'decision', 'making', 'is', 'the', 'subject', 'of', 'many', 'experimental', 'and', 'theoretical', 'studies', 'whereas', 'most', 'modeling', 'analysis', 'are', 'based', 'on', 'statistical', 'processes', 'of', 'accumulation', 'of', 'evidence', 'less', 'attention', 'is', 'being', 'devoted', 'to', 'the', 'modeling', 'with', 'attractor', 'network', 'dynamics', 'even', 'though', 'they', 'describe', 'well', 'psychophysical', 'and', 'neurophysiological', 'data', 'in', 'particular', 'very', 'few', 'works', 'confront', 'attractor', 'models', 'predictions', 'with', 'data', 'from', 'continuous', 'sequences', 'of', 'trials', 'recently', 'however', 'a', 'biophysical', 'competitive', 'attractor', 'network', 'model', 'has', 'been', 'used', 'to', 'describe', 'such', 'sequences', 'of', 'decision', 'trials', 'and', 'has', 'been', 'shown', 'to', 'reproduce', 'repetition', 'biases', 'observed', 'in', 'perceptual', 'decision', 'experiments', 'here', 'we', 'propose', 'an', 'extension', 'of', 'the', 'reduced', 'attractor', 'network', 'model', 'of', 'wong', 'and', 'wang', '2006', 'to', 'get', 'more', 'insights', 'into', 'such', 'effects', 'we', 'make', 'explicit', 'the', 'conditions', 'under', 'which', 'such', 'network', 'can', 'perform', 'a', 'succession', 'of', 'decisions', 'and', 'show', 'that', 'the', 'model', 'provides', 'a', 'mathematical', 'framework', 'for', 'studying', 'the', 'effects', 'of', 'a', 'trial', 'on', 'the', 'decision', 'made', 'on', 'the', 'next', 'one', 'we', 'study', 'in', 'details', 'the', 'reaction', 'times', 'properties', 'during', 'a', 'sequence', 'of', 'decision', 'trials', 'and', 'show', 'that', 'the', 'model', 'reproduces', 'behavioral', 'data', 'both', 'qualitatively', 'and', 'quantitatively', 'in', 'particular', 'we', 'find', 'that', 'the', 'decision', 'made', 'on', 'the', 'current', 'trial', 'is', 'biased', 'toward', 'the', 'one', 'made', 'on', 'the', 'previous', 'trial', 'more', 'remarkably', 'we', 'show', 'that', 'in', 'the', 'absence', 'of', 'any', 'feedback', 'about', 'the', 'correctness', 'of', 'the', 'decision', 'the', 'network', 'exhibits', 'posterror', 'slowing', 'a', 'subtle', 'effect', 'in', 'agreement', 'with', 'empirical', 'data']] | [-0.07215848989465579, 0.051141139347237186, -0.1142239368889242, 0.08760924393999599, -0.06965910517389821, -0.13093641850417923, 0.07495677004746916, 0.4196338272645491, -0.20228155714897278, -0.2922783572044111, 0.12066927743304906, -0.25977218624581744, -0.2042097940032457, 0.21678261350888503, -0.08096859403303824, 0.07291747044454779, 0.10679972874691132, 0.049433864070030316, -0.00397382006059192, -0.24251068133764483, 0.2875196790043666, 0.07299250858065126, 0.2987183290573865, 0.007355436079298419, 0.09137034485257604, -0.00868585858502072, -0.05602439312923675, 0.012844579434825172, -0.11849116366308941, 0.08680371443564393, 0.25507251073572507, 0.1697193340344178, 0.3070675068502796, -0.46171833721294614, -0.2474730469302499, 0.10171800234619978, 0.10785758791989165, 0.1343082113804673, -0.04670199171094533, -0.28755004297749237, 0.052290900560208305, -0.14633212476950702, -0.07229884167137587, -0.11560019866788182, 0.007077557050847802, -0.000614225622339761, -0.2890796498867185, 0.028619325760920564, 0.05232358682079739, 0.06532197712583403, -0.055742236846809054, -0.108110658764229, -0.02441602203180082, 0.1488434074522831, 0.09129642034732287, 0.03586930924374711, 0.12222230898874716, -0.14758564969615062, -0.16305306392063484, 0.36478688779431556, -0.024657802967402827, -0.1785262261380859, 0.21218372268927413, -0.1292078392805957, -0.1888654532978825, 0.10465391966361745, 0.1774216445909556, 0.05729187484870761, -0.15910107625150605, 0.014958506167298264, -0.03984555865011724, 0.18293139568162714, 0.02557338752125486, -0.005018660540027385, 0.17237959781878404, 0.25206067146540717, 0.005058384634672808, 0.1295002176730436, -0.06115114750192051, -0.14051278602384062, -0.2507149012767357, -0.09243763119116795, -0.1275760666948968, 0.03679729889875583, -0.07466634995248099, -0.1468749157679197, 0.3909104769138202, 0.20781263161314137, 0.22014265489395193, 0.08645507052956261, 0.26598430844826687, 0.08450735038435407, 0.05493655443695326, 0.038203054287366506, 0.23279092357100534, 0.08551969491888704, 0.08693808692924936, -0.19660817290022006, 0.15816487853991365, 0.0011886928851740307] |
1,803.00796 | Fine-Grained Complexity of Analyzing Compressed Data: Quantifying
Improvements over Decompress-And-Solve | Can we analyze data without decompressing it? As our data keeps growing,
understanding the time complexity of problems on compressed inputs, rather than
in convenient uncompressed forms, becomes more and more relevant. Suppose we
are given a compression of size $n$ of data that originally has size $N$, and
we want to solve a problem with time complexity $T(\cdot)$. The naive strategy
of "decompress-and-solve" gives time $T(N)$, whereas "the gold standard" is
time $T(n)$: to analyze the compression as efficiently as if the original data
was small.
We restrict our attention to data in the form of a string (text, files,
genomes, etc.) and study the most ubiquitous tasks. While the challenge might
seem to depend heavily on the specific compression scheme, most methods of
practical relevance (Lempel-Ziv-family, dictionary methods, and others) can be
unified under the elegant notion of Grammar Compressions. A vast literature,
across many disciplines, established this as an influential notion for
Algorithm design.
We introduce a framework for proving (conditional) lower bounds in this
field, allowing us to assess whether decompress-and-solve can be improved, and
by how much. Our main results are:
- The $O(nN\sqrt{\log{N/n}})$ bound for LCS and the $O(\min\{N \log N, nM\})$
bound for Pattern Matching with Wildcards are optimal up to $N^{o(1)}$ factors,
under the Strong Exponential Time Hypothesis. (Here, $M$ denotes the
uncompressed length of the compressed pattern.)
- Decompress-and-solve is essentially optimal for Context-Free Grammar
Parsing and RNA Folding, under the $k$-Clique conjecture.
- We give an algorithm showing that decompress-and-solve is not optimal for
Disjointness.
| cs.CC cs.DS | can we analyze data without decompressing it as our data keeps growing understanding the time complexity of problems on compressed inputs rather than in convenient uncompressed forms becomes more and more relevant suppose we are given a compression of size n of data that originally has size n and we want to solve a problem with time complexity tcdot the naive strategy of decompressandsolve gives time tn whereas the gold standard is time tn to analyze the compression as efficiently as if the original data was small we restrict our attention to data in the form of a string text files genomes etc and study the most ubiquitous tasks while the challenge might seem to depend heavily on the specific compression scheme most methods of practical relevance lempelzivfamily dictionary methods and others can be unified under the elegant notion of grammar compressions a vast literature across many disciplines established this as an influential notion for algorithm design we introduce a framework for proving conditional lower bounds in this field allowing us to assess whether decompressandsolve can be improved and by how much our main results are the onnsqrtlognn bound for lcs and the ominn log n nm bound for pattern matching with wildcards are optimal up to no1 factors under the strong exponential time hypothesis here m denotes the uncompressed length of the compressed pattern decompressandsolve is essentially optimal for contextfree grammar parsing and rna folding under the kclique conjecture we give an algorithm showing that decompressandsolve is not optimal for disjointness | [['can', 'we', 'analyze', 'data', 'without', 'decompressing', 'it', 'as', 'our', 'data', 'keeps', 'growing', 'understanding', 'the', 'time', 'complexity', 'of', 'problems', 'on', 'compressed', 'inputs', 'rather', 'than', 'in', 'convenient', 'uncompressed', 'forms', 'becomes', 'more', 'and', 'more', 'relevant', 'suppose', 'we', 'are', 'given', 'a', 'compression', 'of', 'size', 'n', 'of', 'data', 'that', 'originally', 'has', 'size', 'n', 'and', 'we', 'want', 'to', 'solve', 'a', 'problem', 'with', 'time', 'complexity', 'tcdot', 'the', 'naive', 'strategy', 'of', 'decompressandsolve', 'gives', 'time', 'tn', 'whereas', 'the', 'gold', 'standard', 'is', 'time', 'tn', 'to', 'analyze', 'the', 'compression', 'as', 'efficiently', 'as', 'if', 'the', 'original', 'data', 'was', 'small', 'we', 'restrict', 'our', 'attention', 'to', 'data', 'in', 'the', 'form', 'of', 'a', 'string', 'text', 'files', 'genomes', 'etc', 'and', 'study', 'the', 'most', 'ubiquitous', 'tasks', 'while', 'the', 'challenge', 'might', 'seem', 'to', 'depend', 'heavily', 'on', 'the', 'specific', 'compression', 'scheme', 'most', 'methods', 'of', 'practical', 'relevance', 'lempelzivfamily', 'dictionary', 'methods', 'and', 'others', 'can', 'be', 'unified', 'under', 'the', 'elegant', 'notion', 'of', 'grammar', 'compressions', 'a', 'vast', 'literature', 'across', 'many', 'disciplines', 'established', 'this', 'as', 'an', 'influential', 'notion', 'for', 'algorithm', 'design', 'we', 'introduce', 'a', 'framework', 'for', 'proving', 'conditional', 'lower', 'bounds', 'in', 'this', 'field', 'allowing', 'us', 'to', 'assess', 'whether', 'decompressandsolve', 'can', 'be', 'improved', 'and', 'by', 'how', 'much', 'our', 'main', 'results', 'are', 'the', 'onnsqrtlognn', 'bound', 'for', 'lcs', 'and', 'the', 'ominn', 'log', 'n', 'nm', 'bound', 'for', 'pattern', 'matching', 'with', 'wildcards', 'are', 'optimal', 'up', 'to', 'no1', 'factors', 'under', 'the', 'strong', 'exponential', 'time', 'hypothesis', 'here', 'm', 'denotes', 'the', 'uncompressed', 'length', 'of', 'the', 'compressed', 'pattern', 'decompressandsolve', 'is', 'essentially', 'optimal', 'for', 'contextfree', 'grammar', 'parsing', 'and', 'rna', 'folding', 'under', 'the', 'kclique', 'conjecture', 'we', 'give', 'an', 'algorithm', 'showing', 'that', 'decompressandsolve', 'is', 'not', 'optimal', 'for', 'disjointness']] | [-0.09710246874345467, 0.10022555999935139, -0.08009816588833928, 0.08846231933357195, -0.10473745219409465, -0.15737412018794567, 0.09414875036291778, 0.38026984307437667, -0.28402191661391407, -0.3295664731711149, 0.10227384770894424, -0.24835120099503546, -0.13128550574928521, 0.21297653896734117, -0.1019369489904493, 0.06886591100413353, 0.04986302741477266, 0.0698650313615799, -0.047419680674560365, -0.2932593825934455, 0.2615060071330518, 0.07461266431678086, 0.3033546053291066, 0.03219607748487033, 0.050228471868205816, -0.008132162211462856, -0.02718982401676476, 0.00066106091812253, -0.12820683602086502, 0.12503137389058247, 0.29741466291993857, 0.22109238490089775, 0.26864399333298206, -0.4334387265220285, -0.17141743989195674, 0.11198505143169314, 0.15993186177127064, 0.13247963535413146, -0.026391022512922063, -0.22402435635216533, 0.13753782145120202, -0.09100834321044385, -0.04882988485507667, -0.08175076725892723, 0.05720755172381178, -0.021922923361184076, -0.28780521515593865, 0.036321743309497834, 0.09315665415488183, 0.019287069951184094, -0.02476576559152454, -0.11634332984499633, 0.05413977055763826, 0.11957884535193443, 0.048413103082217274, 0.06217988216038793, 0.09729518613964319, -0.11193412087112665, -0.11637896355520934, 0.39916166084632276, -0.04664438121515559, -0.1793345720358193, 0.16342339378595352, -0.07953277546353638, -0.15279606984741986, 0.11500318549200893, 0.177003378149122, 0.13369741205498575, -0.11655832353653386, 0.11436076514446177, -0.0894621654888615, 0.21154412143689114, 0.10955352930258959, 0.029905631970614195, 0.10698176104854792, 0.19139813552866689, 0.08097503254027105, 0.1606092871297151, -0.03714306394197047, -0.07107017600350082, -0.23753855020180345, -0.14237031834060326, -0.170309284908697, 0.01691042905958602, -0.13534443104855018, -0.160204712823499, 0.335416081759191, 0.1605475811297656, 0.2052809461802244, 0.11835114192555193, 0.2848070925641805, 0.07249621412111447, 0.07383086036145688, 0.11904364361762418, 0.12990869498811664, 0.08120300472760573, 0.07220391133568774, -0.17058187120966614, 0.1169073289874941, 0.06884974811412393] |
1,803.00797 | Survival of the fittest in the coherent evolution of quantum ensembles | We report two novel effects in an inhomogeneous ensemble of two-level systems
driven by an external field. First, we observe a rigidity of the oscillation
frequency: the dominant Rabi oscillation frequency does not change with the
frequency of the driving field, in contrast to the well-known law of Rabi
frequency increase with growing detuning of the driving field. Second, we
observe a time-dependent frequency shift of the ensemble-averaged oscillation.
We show that these effects follow from the inhomogeneity of the two-level
splitting across the ensemble, allowing for a distribution of local
oscillations in which those with high frequencies interfere destructively and
decay faster than those with a low frequency, which are the only to survive in
the output signal. Hence, coherence emerges from long-lived oscillations in an
inhomogeneous ensemble. We analyze the Fourier spectrum of the time-dependent
oscillation signal and find a non-trivial spectral structure that is double
peaked for certain parameters. We show that the effects observed in alkali
vapor are universal and expected in any system with a moderate inhomogeneity
driven by an external field.
| quant-ph physics.atom-ph | we report two novel effects in an inhomogeneous ensemble of twolevel systems driven by an external field first we observe a rigidity of the oscillation frequency the dominant rabi oscillation frequency does not change with the frequency of the driving field in contrast to the wellknown law of rabi frequency increase with growing detuning of the driving field second we observe a timedependent frequency shift of the ensembleaveraged oscillation we show that these effects follow from the inhomogeneity of the twolevel splitting across the ensemble allowing for a distribution of local oscillations in which those with high frequencies interfere destructively and decay faster than those with a low frequency which are the only to survive in the output signal hence coherence emerges from longlived oscillations in an inhomogeneous ensemble we analyze the fourier spectrum of the timedependent oscillation signal and find a nontrivial spectral structure that is double peaked for certain parameters we show that the effects observed in alkali vapor are universal and expected in any system with a moderate inhomogeneity driven by an external field | [['we', 'report', 'two', 'novel', 'effects', 'in', 'an', 'inhomogeneous', 'ensemble', 'of', 'twolevel', 'systems', 'driven', 'by', 'an', 'external', 'field', 'first', 'we', 'observe', 'a', 'rigidity', 'of', 'the', 'oscillation', 'frequency', 'the', 'dominant', 'rabi', 'oscillation', 'frequency', 'does', 'not', 'change', 'with', 'the', 'frequency', 'of', 'the', 'driving', 'field', 'in', 'contrast', 'to', 'the', 'wellknown', 'law', 'of', 'rabi', 'frequency', 'increase', 'with', 'growing', 'detuning', 'of', 'the', 'driving', 'field', 'second', 'we', 'observe', 'a', 'timedependent', 'frequency', 'shift', 'of', 'the', 'ensembleaveraged', 'oscillation', 'we', 'show', 'that', 'these', 'effects', 'follow', 'from', 'the', 'inhomogeneity', 'of', 'the', 'twolevel', 'splitting', 'across', 'the', 'ensemble', 'allowing', 'for', 'a', 'distribution', 'of', 'local', 'oscillations', 'in', 'which', 'those', 'with', 'high', 'frequencies', 'interfere', 'destructively', 'and', 'decay', 'faster', 'than', 'those', 'with', 'a', 'low', 'frequency', 'which', 'are', 'the', 'only', 'to', 'survive', 'in', 'the', 'output', 'signal', 'hence', 'coherence', 'emerges', 'from', 'longlived', 'oscillations', 'in', 'an', 'inhomogeneous', 'ensemble', 'we', 'analyze', 'the', 'fourier', 'spectrum', 'of', 'the', 'timedependent', 'oscillation', 'signal', 'and', 'find', 'a', 'nontrivial', 'spectral', 'structure', 'that', 'is', 'double', 'peaked', 'for', 'certain', 'parameters', 'we', 'show', 'that', 'the', 'effects', 'observed', 'in', 'alkali', 'vapor', 'are', 'universal', 'and', 'expected', 'in', 'any', 'system', 'with', 'a', 'moderate', 'inhomogeneity', 'driven', 'by', 'an', 'external', 'field']] | [-0.1847404128803456, 0.2355991129998228, -0.05731631207179889, 0.0405611549056856, -0.03650317697964693, -0.10840275835266895, 0.047924115982874806, 0.3765093272637068, -0.2767143887020437, -0.27924144713965765, 0.04770173428324972, -0.2351905073507526, -0.12424350626724588, 0.21512594177666525, 0.0026356338228672575, -0.01767405469265193, 0.018969866378748486, 0.05443759470136236, -0.043083274284493454, -0.12226816128852572, 0.31848216688228864, 0.06170751782144699, 0.3151923260351611, -0.027905698731478492, 0.06194175121579635, -0.015001431229855802, 0.020595324174422076, 0.00599662151048223, -0.07877863383019773, 0.050958095171020526, 0.1898200979106402, 0.04852075777989996, 0.26171730018199796, -0.41047417000988445, -0.22146932660117957, 0.12404050979773792, 0.15737176182716664, 0.1904178461294074, -0.06464085261150668, -0.2729879601537592, -0.0040435151507457094, -0.14917065084406758, -0.14289268603979868, -0.057944574832684746, 0.011104598433558046, 0.07397855325512546, -0.2978834257580177, 0.13276901378133202, 0.0687730879993783, 0.060731264294288254, -0.08303473834316694, -0.0619109331592023, 0.015562829395787696, 0.11371337166213888, 0.02462685039124878, 0.0036710735626181976, 0.15084483690223113, -0.12114596527496005, -0.09798817707772899, 0.34135547615087847, -0.1730412591626443, -0.12494208491512569, 0.15294812724394144, -0.23650548716554534, -0.07865593052537596, 0.16051558299400545, 0.1407142701771868, 0.061141984482859145, -0.10148286801469539, 0.033904428879755394, 0.03176448743600967, 0.2302830859934543, 0.08560992072015411, 0.07730988810091453, 0.20917435863323636, 0.13571433521054768, 0.06969106513585917, 0.14384348956226123, -0.10842654719737642, -0.08269211812415765, -0.2677460377161144, -0.07401651379883836, -0.1689750538654836, 0.07175561606413408, -0.0558197689213886, -0.20161085412969107, 0.44539083580428596, 0.15793240026933913, 0.2226889667543188, 0.008102293852236554, 0.29142086609861273, 0.18607192557557659, 0.07174320778504309, 0.04996396454924581, 0.29017134629568814, 0.12459539303471898, 0.09819303403903157, -0.3216070032819624, -0.0032141300386586097, -0.053600748072215224] |
1,803.00798 | Permutation Tests for Equality of Distributions of Functional Data | Economic data are often generated by stochastic processes that take place in
continuous time, though observations may occur only at discrete times. For
example, electricity and gas consumption take place in continuous time. Data
generated by a continuous time stochastic process are called functional data.
This paper is concerned with comparing two or more stochastic processes that
generate functional data. The data may be produced by a randomized experiment
in which there are multiple treatments. The paper presents a method for testing
the hypothesis that the same stochastic process generates all the functional
data. The test described here applies to both functional data and multiple
treatments. It is implemented as a combination of two permutation tests. This
ensures that in finite samples, the true and nominal probabilities that each
test rejects a correct null hypothesis are equal. The paper presents upper and
lower bounds on the asymptotic power of the test under alternative hypotheses.
The results of Monte Carlo experiments and an application to an experiment on
billing and pricing of natural gas illustrate the usefulness of the test.
| econ.EM stat.ME | economic data are often generated by stochastic processes that take place in continuous time though observations may occur only at discrete times for example electricity and gas consumption take place in continuous time data generated by a continuous time stochastic process are called functional data this paper is concerned with comparing two or more stochastic processes that generate functional data the data may be produced by a randomized experiment in which there are multiple treatments the paper presents a method for testing the hypothesis that the same stochastic process generates all the functional data the test described here applies to both functional data and multiple treatments it is implemented as a combination of two permutation tests this ensures that in finite samples the true and nominal probabilities that each test rejects a correct null hypothesis are equal the paper presents upper and lower bounds on the asymptotic power of the test under alternative hypotheses the results of monte carlo experiments and an application to an experiment on billing and pricing of natural gas illustrate the usefulness of the test | [['economic', 'data', 'are', 'often', 'generated', 'by', 'stochastic', 'processes', 'that', 'take', 'place', 'in', 'continuous', 'time', 'though', 'observations', 'may', 'occur', 'only', 'at', 'discrete', 'times', 'for', 'example', 'electricity', 'and', 'gas', 'consumption', 'take', 'place', 'in', 'continuous', 'time', 'data', 'generated', 'by', 'a', 'continuous', 'time', 'stochastic', 'process', 'are', 'called', 'functional', 'data', 'this', 'paper', 'is', 'concerned', 'with', 'comparing', 'two', 'or', 'more', 'stochastic', 'processes', 'that', 'generate', 'functional', 'data', 'the', 'data', 'may', 'be', 'produced', 'by', 'a', 'randomized', 'experiment', 'in', 'which', 'there', 'are', 'multiple', 'treatments', 'the', 'paper', 'presents', 'a', 'method', 'for', 'testing', 'the', 'hypothesis', 'that', 'the', 'same', 'stochastic', 'process', 'generates', 'all', 'the', 'functional', 'data', 'the', 'test', 'described', 'here', 'applies', 'to', 'both', 'functional', 'data', 'and', 'multiple', 'treatments', 'it', 'is', 'implemented', 'as', 'a', 'combination', 'of', 'two', 'permutation', 'tests', 'this', 'ensures', 'that', 'in', 'finite', 'samples', 'the', 'true', 'and', 'nominal', 'probabilities', 'that', 'each', 'test', 'rejects', 'a', 'correct', 'null', 'hypothesis', 'are', 'equal', 'the', 'paper', 'presents', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'asymptotic', 'power', 'of', 'the', 'test', 'under', 'alternative', 'hypotheses', 'the', 'results', 'of', 'monte', 'carlo', 'experiments', 'and', 'an', 'application', 'to', 'an', 'experiment', 'on', 'billing', 'and', 'pricing', 'of', 'natural', 'gas', 'illustrate', 'the', 'usefulness', 'of', 'the', 'test']] | [-0.09119863296480454, 0.10360366117886226, -0.10218640385382918, 0.11395390185358165, -0.04172966851171252, -0.12703184491574931, 0.07962768452629634, 0.35961694762048274, -0.23876296505644168, -0.2959771656623766, 0.14235825989364162, -0.2681352584466713, -0.10270615562656114, 0.2400152844795697, -0.05044728956268528, 0.05955597696378411, 0.08800369447523822, 0.015397150904543739, -0.023852474639724223, -0.2577334037622926, 0.2954988129210643, 0.07776783335194325, 0.3155650528558847, -0.009012622531443606, 0.11797303839016955, -0.012005996135942762, -0.07290661217015257, 0.010835748651018107, -0.07658913152591701, 0.08335218414945227, 0.26869243037413454, 0.17692470966900736, 0.31904838256558726, -0.5017759331278295, -0.1933589459308449, 0.11952557908787324, 0.06822263542757832, 0.06319823868601328, -0.08471410357376741, -0.24987037337837772, 0.08780090569117882, -0.14602569209193217, -0.08740863355927628, -0.07557525316268913, -0.029320891877615503, 0.020122045458245023, -0.33949052542968333, 0.07456561339649699, 0.06949108137323796, 0.051296234810978496, -0.05994182784245584, -0.0837504841574577, 0.0056676249066627896, 0.09647268269522578, 0.08168578094460704, 0.002939413507162026, 0.12173943131818701, -0.06376625455014522, -0.15415212298566527, 0.3647938301922056, -0.06252807980388995, -0.20243059183170437, 0.19892536606067301, -0.12482725240956138, -0.17250423554224403, 0.1084802650297633, 0.19667867891095037, 0.10711434064172833, -0.2207001374940799, 0.07791646215587486, -0.041951305685596095, 0.14671032128572026, 0.042329123734715056, -0.03351573479575152, 0.15571093770503666, 0.16743202708848862, 0.045627268626973784, 0.12018535134848207, -0.08857692176718057, -0.12171117873217224, -0.3175662043432877, -0.15819657069251108, -0.20608694344178863, -0.002614086160212547, -0.08441662247238717, -0.14022982886838908, 0.35677150479262937, 0.1871742629930611, 0.19181876494575228, 0.10377544781333616, 0.3086364829194779, 0.1406365524055228, 0.02410177456334691, 0.04676709971884942, 0.15601439288604027, 0.03853177116252482, 0.05017640444777864, -0.16621409738228224, 0.1289656257683505, -0.0014102452138032994] |
1,803.00799 | Double covers of quadratic degeneracy and Lagrangian intersection loci | We explain a general construction of double covers of quadratic degeneracy
loci and Lagrangian intersection loci based on reflexive sheaves. We relate the
double covers of quadratic degeneracy loci to the Stein factorizations of the
relative Hilbert schemes of linear spaces of the corresponding quadric
fibrations. We give a criterion for these double covers to be nonsingular. As
applications of these results, we show that the double covers of the EPW
sextics obtained by our construction give O'Grady's double EPW sextics and that
an analogous construction gives Iliev-Kapustka-Kapustka-Ranestad's EPW cubes.
| math.AG | we explain a general construction of double covers of quadratic degeneracy loci and lagrangian intersection loci based on reflexive sheaves we relate the double covers of quadratic degeneracy loci to the stein factorizations of the relative hilbert schemes of linear spaces of the corresponding quadric fibrations we give a criterion for these double covers to be nonsingular as applications of these results we show that the double covers of the epw sextics obtained by our construction give ogradys double epw sextics and that an analogous construction gives ilievkapustkakapustkaranestads epw cubes | [['we', 'explain', 'a', 'general', 'construction', 'of', 'double', 'covers', 'of', 'quadratic', 'degeneracy', 'loci', 'and', 'lagrangian', 'intersection', 'loci', 'based', 'on', 'reflexive', 'sheaves', 'we', 'relate', 'the', 'double', 'covers', 'of', 'quadratic', 'degeneracy', 'loci', 'to', 'the', 'stein', 'factorizations', 'of', 'the', 'relative', 'hilbert', 'schemes', 'of', 'linear', 'spaces', 'of', 'the', 'corresponding', 'quadric', 'fibrations', 'we', 'give', 'a', 'criterion', 'for', 'these', 'double', 'covers', 'to', 'be', 'nonsingular', 'as', 'applications', 'of', 'these', 'results', 'we', 'show', 'that', 'the', 'double', 'covers', 'of', 'the', 'epw', 'sextics', 'obtained', 'by', 'our', 'construction', 'give', 'ogradys', 'double', 'epw', 'sextics', 'and', 'that', 'an', 'analogous', 'construction', 'gives', 'ilievkapustkakapustkaranestads', 'epw', 'cubes']] | [-0.19464851840493386, 0.010837773190911995, -0.09582994570641705, 0.14027264522744365, -0.08331017666025443, -0.13903058122508646, 0.013744498341438476, 0.3006740961056412, -0.3237314202477423, -0.1861328249064724, 0.06877217052525349, -0.20855856180358467, -0.20998516392611552, 0.2834854495994161, -0.1830620468915257, -0.047404855460463496, 0.055459831574450384, -0.01031314938465196, -0.15097991347291997, -0.37678472692502685, 0.43847471919287456, -0.034615689658381965, 0.18880228149924386, 0.04788705634915929, 0.12961040279725658, 0.08271641589523282, -0.0427452309810546, -0.0406125922101351, -0.22798998866918932, 0.16581572353672447, 0.33443404374162805, 0.07389802792831586, 0.10618523673646235, -0.3377046896919106, -0.09967252311952088, 0.15479111822133654, 0.13239994504897112, 0.06237243940488676, 0.023583530274408168, -0.17004320883516516, 0.03235259961096172, -0.13315375485154016, -0.21543731770132868, -0.1448852520729049, -0.02944129764029149, 0.08800367774504624, -0.20667263801638666, -0.016852386557402906, 0.10073004853220073, 0.08664772614543692, -0.04988859768098827, -0.13898455684225003, -0.09557404915090609, 0.021032252123977028, -0.013970130008090748, -0.00010797662890694114, 0.059822156172496886, -0.06947750930433695, -0.1596080788903022, 0.33725609372924553, -0.049161456461885966, -0.20719986812870825, 0.11129417669373366, -0.1475627043996048, -0.16453279331692736, 0.19368829477703972, 0.104053708494463, 0.17739847487654914, 0.01824776859681928, 0.1800372620215221, -0.11434178694224592, 0.06262771369826593, 0.1228960630473461, -0.010581138037492421, 0.17082714670850488, 0.07945653568074275, 0.10349634909227992, 0.1499515750845685, -0.06980010586414026, -0.12050103430905683, -0.39577923338399845, -0.1734529194834752, -0.05132591902288828, 0.1112379132314805, -0.0866325272170675, -0.24955196535800783, 0.4194371670986829, -0.0258706562597765, 0.23605092328167362, 0.11024332337939505, 0.2028346853069124, 0.036968515500468146, 0.08669660832691059, -0.05197575157822183, 0.17094173489577985, 0.2405005630780681, -0.0638557641683251, -0.15058216283076933, -0.07648470830381586, 0.20361815207752954] |
1,803.008 | Waring decompositions and identifiability via Bertini and Macaulay2
software | Starting from our previous papers [AGMO] and [ABC], we prove the existence of
a non-empty Euclidean open subset whose elements are polynomial vectors with 4
components, in 3 variables, degrees, respectively, 2,3,3,3 and rank 6, which
are not identifiable over $ \mathbb{C} $ but are identifiable over $ \mathbb{R}
$. This result has been obtained via computer-aided procedures suitably adapted
to investigate the number of Waring decompositions for general polynomial
vectors over the fields of complex and real numbers. Furthermore, by means of
the Hessian criterion ([COV]), we prove identifiability over $ \mathbb{C} $ for
polynomial vectors in many cases of sub-generic rank.
| math.AG | starting from our previous papers agmo and abc we prove the existence of a nonempty euclidean open subset whose elements are polynomial vectors with 4 components in 3 variables degrees respectively 2333 and rank 6 which are not identifiable over mathbbc but are identifiable over mathbbr this result has been obtained via computeraided procedures suitably adapted to investigate the number of waring decompositions for general polynomial vectors over the fields of complex and real numbers furthermore by means of the hessian criterion cov we prove identifiability over mathbbc for polynomial vectors in many cases of subgeneric rank | [['starting', 'from', 'our', 'previous', 'papers', 'agmo', 'and', 'abc', 'we', 'prove', 'the', 'existence', 'of', 'a', 'nonempty', 'euclidean', 'open', 'subset', 'whose', 'elements', 'are', 'polynomial', 'vectors', 'with', '4', 'components', 'in', '3', 'variables', 'degrees', 'respectively', '2333', 'and', 'rank', '6', 'which', 'are', 'not', 'identifiable', 'over', 'mathbbc', 'but', 'are', 'identifiable', 'over', 'mathbbr', 'this', 'result', 'has', 'been', 'obtained', 'via', 'computeraided', 'procedures', 'suitably', 'adapted', 'to', 'investigate', 'the', 'number', 'of', 'waring', 'decompositions', 'for', 'general', 'polynomial', 'vectors', 'over', 'the', 'fields', 'of', 'complex', 'and', 'real', 'numbers', 'furthermore', 'by', 'means', 'of', 'the', 'hessian', 'criterion', 'cov', 'we', 'prove', 'identifiability', 'over', 'mathbbc', 'for', 'polynomial', 'vectors', 'in', 'many', 'cases', 'of', 'subgeneric', 'rank']] | [-0.14887234402370572, 0.06958690664517538, -0.024108470145923395, 0.014945326136512449, -0.05305655440315604, -0.11689961123617347, 0.0023479778477242994, 0.3773728859766076, -0.3029031448774428, -0.22975168070115615, 0.1551493651616814, -0.2279716125728252, -0.1511367889373408, 0.21915021499444265, -0.0666574520849584, 0.047768904303666204, 0.04822110792641373, 0.0853650695377534, -0.08841550328361336, -0.3752480197387437, 0.3365412522398401, -0.09215540124569088, 0.17025396447934327, -0.01223193240002729, 0.11656338102079644, 0.03618446773422571, -0.06707643011577602, 0.02046492134481544, -0.1266172649047803, 0.11912493680574698, 0.3149539316315592, 0.17674514841686081, 0.2516371269836479, -0.35356055571658845, -0.1876843651237626, 0.21296647310858438, 0.17358114717838666, 0.026344156759781374, 0.03996187887484363, -0.25109565984651755, 0.14330445880962847, -0.12287746377235938, -0.14560034365664856, -0.11331883892610979, 0.05387176075358487, 0.028943629842009006, -0.3111535201363343, 0.04240038202260621, 0.06935924554636586, 0.16017002545898626, -0.05305259583352987, -0.2070898813775178, -0.0017651970192673616, 0.04726357686255748, 0.00868598612093289, 0.03995810843965349, 0.04384479043559016, -0.06303646076654938, -0.11672329108599418, 0.3180947322010373, -0.00024642532419723767, -0.27523337975920487, 0.15832152898656204, -0.1381180130459446, -0.15439912324169805, 0.13211707718922602, 0.14514068854623474, 0.1398891056311792, -0.0790559553715866, 0.1625722605658666, -0.12829691524287531, 0.11606417078655795, 0.1437647183338413, -0.002479866740638196, 0.12973932832634696, 0.02675038578551418, 0.08370852243865556, 0.10513462661765516, -0.004146046776440926, -0.059737067250049826, -0.3022281032560083, -0.1540194436965976, -0.1721644285523022, 0.10377825045134159, -0.15383799555835745, -0.16795928242693967, 0.42580584265912574, 0.08942891106319924, 0.19316520809661597, 0.12448806286677912, 0.22673795828207707, 0.05977944298623091, 0.04930718109244481, 0.10131691612089828, 0.12530808066852236, 0.18009192878040872, -0.012911656779275896, -0.07450099830020918, 0.05298639913477624, 0.11315332192073886] |
1,803.00801 | Influence of evaporation on soap film rupture | Although soap films are prone to evaporate due to their large surface to
volume ratio, the effect of evaporation on macroscopic film features has often
been disregarded in the literature. In this work, we investigate experimentally
the influence of environmental humidity on soap film stability. An original
experiment allows to measure both the maximum length of a film pulled at
constant velocity and its thinning dynamics in a controlled atmosphere for
various values of the relative humidity $\RH$. At first order, the
environmental humidity seems to have almost no impact on most of the film
thinning dynamics. However, we find that the film length at rupture increases
continuously with $\RH$. To rationalize our observations, we propose that the
film bursting occurs when the thinning due to evaporation becomes comparable to
the thinning due to liquid drainage. This rupture criterion turns out to be in
reasonable agreement with an estimation of the evaporation rate in our
experiment.
| cond-mat.soft | although soap films are prone to evaporate due to their large surface to volume ratio the effect of evaporation on macroscopic film features has often been disregarded in the literature in this work we investigate experimentally the influence of environmental humidity on soap film stability an original experiment allows to measure both the maximum length of a film pulled at constant velocity and its thinning dynamics in a controlled atmosphere for various values of the relative humidity rh at first order the environmental humidity seems to have almost no impact on most of the film thinning dynamics however we find that the film length at rupture increases continuously with rh to rationalize our observations we propose that the film bursting occurs when the thinning due to evaporation becomes comparable to the thinning due to liquid drainage this rupture criterion turns out to be in reasonable agreement with an estimation of the evaporation rate in our experiment | [['although', 'soap', 'films', 'are', 'prone', 'to', 'evaporate', 'due', 'to', 'their', 'large', 'surface', 'to', 'volume', 'ratio', 'the', 'effect', 'of', 'evaporation', 'on', 'macroscopic', 'film', 'features', 'has', 'often', 'been', 'disregarded', 'in', 'the', 'literature', 'in', 'this', 'work', 'we', 'investigate', 'experimentally', 'the', 'influence', 'of', 'environmental', 'humidity', 'on', 'soap', 'film', 'stability', 'an', 'original', 'experiment', 'allows', 'to', 'measure', 'both', 'the', 'maximum', 'length', 'of', 'a', 'film', 'pulled', 'at', 'constant', 'velocity', 'and', 'its', 'thinning', 'dynamics', 'in', 'a', 'controlled', 'atmosphere', 'for', 'various', 'values', 'of', 'the', 'relative', 'humidity', 'rh', 'at', 'first', 'order', 'the', 'environmental', 'humidity', 'seems', 'to', 'have', 'almost', 'no', 'impact', 'on', 'most', 'of', 'the', 'film', 'thinning', 'dynamics', 'however', 'we', 'find', 'that', 'the', 'film', 'length', 'at', 'rupture', 'increases', 'continuously', 'with', 'rh', 'to', 'rationalize', 'our', 'observations', 'we', 'propose', 'that', 'the', 'film', 'bursting', 'occurs', 'when', 'the', 'thinning', 'due', 'to', 'evaporation', 'becomes', 'comparable', 'to', 'the', 'thinning', 'due', 'to', 'liquid', 'drainage', 'this', 'rupture', 'criterion', 'turns', 'out', 'to', 'be', 'in', 'reasonable', 'agreement', 'with', 'an', 'estimation', 'of', 'the', 'evaporation', 'rate', 'in', 'our', 'experiment']] | [-0.09951288321425612, 0.18029063916336058, -0.08782686684161234, -0.002614625899019675, -0.032112258701370314, -0.0861054232570892, 0.059882713213133126, 0.3857529222105558, -0.27980757441792564, -0.2992493616631971, 0.10277930444378096, -0.28357810044867504, -0.09330304358632137, 0.1893512402088023, -0.08522964680256943, 0.04498443102588331, 0.006776212581779617, -0.017171781516084686, -0.04593042979160181, -0.245652184358989, 0.24053059983700037, 0.13309002770499015, 0.3510503520523437, 0.10868233662003125, 0.05447452658340925, -0.06795685957424724, 0.0220707493643157, 0.04916799097704009, -0.20921671491771868, 0.015321332704610167, 0.23233107115046528, -0.020165185030633345, 0.24799676259191564, -0.4731518092702549, -0.2196730938799775, 0.05873209515658136, 0.10635531394673774, 0.1220453705232686, -0.025805183031852953, -0.21576359883571664, 0.08336705209102291, -0.11914115301213968, -0.1096816843506904, -0.022274776176812176, 0.05377805758960163, -0.02746427930590774, -0.2247077199534919, 0.08348190645651463, 0.038870328737548566, 0.06587013390171939, -0.05166660344865448, -0.05756115549220107, -0.07874904134540628, 0.10292960873163956, 0.15074510498044008, 0.020168048332636364, 0.24237676930183974, -0.11830616782670124, 0.0029532965795041467, 0.36365776193829685, -0.09863487458026682, -0.14779704578746206, 0.24431841992564166, -0.1673200276757901, -0.049287673316706415, 0.19586479643849322, 0.16675648637092075, 0.09158767209662937, -0.11733318034170317, -0.012606361932016742, -0.009344283109292006, 0.22985474284117421, 0.1362487465256634, -0.03405695197062204, 0.2189796530128194, 0.22009210263860998, 0.053720341017768264, 0.16884478747035758, -0.13461744563970476, -0.08658779361165869, -0.2320565978447214, -0.16738024684719932, -0.15930117963356538, 0.04736506398647833, -0.09138814631529758, -0.2050709715262294, 0.32733873583567447, 0.20060474244364274, 0.2301662128406744, 0.023707771805138923, 0.26172796868456477, 0.05490712437462301, 0.06027489514813985, 0.019278712322911583, 0.30440659894464683, 0.12230281891355005, 0.14041766761623037, -0.2703287854316071, 0.1924079135985663, 0.004939407254987134] |
1,803.00802 | Jointly Controlled Lotteries with Biased Coins | We provide a mechanism that uses two biased coins and implements any
distribution on a finite set of elements, in such a way that even if the
outcomes of one of the coins is determined by an adversary, the final
distribution remains unchanged. We apply this result to show that every
quitting game in which at least two players have at least two continue actions
has an undiscounted $\ep$-equilibrium, for every $\ep > 0$.
| math.PR cs.GT | we provide a mechanism that uses two biased coins and implements any distribution on a finite set of elements in such a way that even if the outcomes of one of the coins is determined by an adversary the final distribution remains unchanged we apply this result to show that every quitting game in which at least two players have at least two continue actions has an undiscounted epequilibrium for every ep 0 | [['we', 'provide', 'a', 'mechanism', 'that', 'uses', 'two', 'biased', 'coins', 'and', 'implements', 'any', 'distribution', 'on', 'a', 'finite', 'set', 'of', 'elements', 'in', 'such', 'a', 'way', 'that', 'even', 'if', 'the', 'outcomes', 'of', 'one', 'of', 'the', 'coins', 'is', 'determined', 'by', 'an', 'adversary', 'the', 'final', 'distribution', 'remains', 'unchanged', 'we', 'apply', 'this', 'result', 'to', 'show', 'that', 'every', 'quitting', 'game', 'in', 'which', 'at', 'least', 'two', 'players', 'have', 'at', 'least', 'two', 'continue', 'actions', 'has', 'an', 'undiscounted', 'epequilibrium', 'for', 'every', 'ep', '0']] | [-0.11744992105826123, 0.13566556788880493, -0.15992829151298493, 0.04382068475019442, -0.0018137139714743994, -0.195795892399723, 0.0610035253937471, 0.3951094576144872, -0.2643459786035835, -0.2505330767112542, 0.09876565251512172, -0.3173793820562224, -0.12662402604234546, 0.14781367291428454, -0.08397223286279669, -0.030185978808631636, 0.08364709423319118, 0.0780235317074024, 0.02580164468604816, -0.31362603752784535, 0.35208416036138795, -0.03559262889328936, 0.17837978436369195, 0.015985771860570125, 0.16523781867876444, 0.0407439859086418, 0.042214392907662344, 0.03350567923578089, -0.08764085662062839, 0.03782535691375602, 0.22849157990964308, 0.1751247431304663, 0.38290787424432904, -0.38105850910037525, -0.12783405423317462, 0.1805169258381508, 0.12181035049055537, 0.12236859575902712, -0.06967306320319488, -0.1748072838327809, 0.14158234273861736, -0.1698273297603408, -0.11240565967714185, -0.008080241461730983, 0.027289332968680417, -0.03190158298621847, -0.29490796033905387, -0.04990561126591, 0.0751449435260402, 0.028645091586465603, -0.020628798485108433, -0.13449084145744164, -0.004464637114959833, 0.19624507020878262, -0.0002843801806081239, 0.029428064631782984, 0.08225171478969134, -0.11538221420439547, -0.20035234906340707, 0.3533257632324957, -0.07361771107638536, -0.18994715150999072, 0.15815315311391875, -0.15434783993748158, -0.16483520823754116, 0.08891619027477421, 0.13041068076423995, 0.1360376440498927, -0.1300122277772896, 0.06198768149216162, -0.10579413158997689, 0.19444139017276976, 0.06078190157470638, -0.014888776073946732, 0.17160183979734167, 0.13389576787180077, 0.15707564278671596, 0.10150055128009353, -0.015908433708094367, -0.05224274372528881, -0.32439991885362424, -0.14669686723947015, -0.2044570103115466, 0.06964765457206801, -0.06730074143297939, -0.15725839954532989, 0.3685939638581994, 0.16184527048688024, 0.22628329607517753, 0.09790069811613848, 0.27999525492028526, 0.09015376673080824, 0.024577736203903206, 0.1486601714644428, 0.20536683066046402, 0.04733575699685065, 0.017600362335829293, -0.15974617153023407, 0.15480566136411403, 0.041057499988349025] |
1,803.00803 | Proofs of Technical Results Justifying an Algorithm of Reactive 3D
Navigation of a Mobile Robot through an Unknown Tunnel | A nonholonomic under-actuated robot with a bounded control range travels
inside an unknown and unstructured 3D tunnel bounded by a generic 2D surface.
The robot has access to the nearest point of the surface and measures the
distance to the surface along any ray from a narrow beam emitted from the robot
around the direction to the nearest point. The paper presents some mathematical
facts underlying justification of the convergence and performance of a new
navigation law that ensures constant advancement of the robot through the
tunnel, along with respecting a given safety margin to its surface, driving the
robot to the desired distance to it, and subsequently maintaining this
distance.
| math.OC | a nonholonomic underactuated robot with a bounded control range travels inside an unknown and unstructured 3d tunnel bounded by a generic 2d surface the robot has access to the nearest point of the surface and measures the distance to the surface along any ray from a narrow beam emitted from the robot around the direction to the nearest point the paper presents some mathematical facts underlying justification of the convergence and performance of a new navigation law that ensures constant advancement of the robot through the tunnel along with respecting a given safety margin to its surface driving the robot to the desired distance to it and subsequently maintaining this distance | [['a', 'nonholonomic', 'underactuated', 'robot', 'with', 'a', 'bounded', 'control', 'range', 'travels', 'inside', 'an', 'unknown', 'and', 'unstructured', '3d', 'tunnel', 'bounded', 'by', 'a', 'generic', '2d', 'surface', 'the', 'robot', 'has', 'access', 'to', 'the', 'nearest', 'point', 'of', 'the', 'surface', 'and', 'measures', 'the', 'distance', 'to', 'the', 'surface', 'along', 'any', 'ray', 'from', 'a', 'narrow', 'beam', 'emitted', 'from', 'the', 'robot', 'around', 'the', 'direction', 'to', 'the', 'nearest', 'point', 'the', 'paper', 'presents', 'some', 'mathematical', 'facts', 'underlying', 'justification', 'of', 'the', 'convergence', 'and', 'performance', 'of', 'a', 'new', 'navigation', 'law', 'that', 'ensures', 'constant', 'advancement', 'of', 'the', 'robot', 'through', 'the', 'tunnel', 'along', 'with', 'respecting', 'a', 'given', 'safety', 'margin', 'to', 'its', 'surface', 'driving', 'the', 'robot', 'to', 'the', 'desired', 'distance', 'to', 'it', 'and', 'subsequently', 'maintaining', 'this', 'distance']] | [-0.15194351349428697, 0.06726751190535242, -0.06596890292424071, -0.023760427781936568, -0.13348407044520114, -0.15798786937401774, 0.08037158872130923, 0.40301399894461437, -0.312513758319321, -0.3252812730366582, 0.06342622847506055, -0.2623517501402881, -0.10688612975918495, 0.21273212861018004, -0.11120175936066352, 0.09148149606341764, 0.06041808524756349, 0.060023212335533926, -0.059619688007326144, -0.15053039604613372, 0.28520961959745633, 0.05545876162579736, 0.24561095772403385, 0.05488879128720041, 0.18918401608243585, 0.02817884262644388, 0.07114788967914679, 0.008736842030843904, -0.11153806940903352, 0.15742977878901068, 0.19427421953747268, 0.11146609243508931, 0.2736845356789795, -0.40060749176788973, -0.20206362212093565, 0.07076874210054541, 0.10797596708577764, 0.0805752826267266, -0.05416495956245575, -0.3706904858149387, 0.10350622436417653, -0.1149471916828875, -0.20209388890899382, 0.027206218396607147, 0.011592522466991533, 0.04731682739178608, -0.22497036204010518, -0.03893532880858795, 0.05729078864133372, 0.09126887311068205, -0.06667057918552477, -0.021773267436671902, -0.05522434004825783, 0.2079968381345876, 0.06147819285927055, 0.11062012821737979, 0.19941616913320515, -0.1384835123815326, -0.08306132857729723, 0.39703673291909464, -0.005546774156181863, -0.2269914775010752, 0.20908932863558466, -0.12746268502008673, -0.04031733340407546, 0.15471200925205741, 0.217323068688783, 0.0872797184629153, -0.17775641237847037, 0.07894779577104559, -0.01235890708840662, 0.14285996031521628, 0.0813379478829636, -0.04151995681008106, 0.21516767270267345, 0.18544461769429413, 0.1695078342926462, 0.11488807720325149, -0.1281934005652999, -0.12212890596968029, -0.3086273567918856, -0.15709635758822835, -0.19534327930493936, 0.009192431236508194, -0.11437725999784815, -0.16456617941651996, 0.39999891854487024, 0.14130984432785562, 0.21279688841487104, 0.0852005242596607, 0.3426593131142425, 0.07000472584554741, 0.04847032282509849, 0.11872397976516334, 0.2240103169542062, 0.08829240683206097, 0.12441821849007192, -0.21285046701663518, 0.08448578212578017, 0.03938331460524644] |
1,803.00804 | Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars | Tree-adjoining grammars are a generalization of context-free grammars that
are well suited to model human languages and are thus popular in computational
linguistics. In the tree-adjoining grammar recognition problem, given a grammar
$\Gamma$ and a string $s$ of length $n$, the task is to decide whether $s$ can
be obtained from $\Gamma$. Rajasekaran and Yooseph's parser (JCSS'98) solves
this problem in time $O(n^{2\omega})$, where $\omega < 2.373$ is the matrix
multiplication exponent. The best algorithms avoiding fast matrix
multiplication take time $O(n^6)$.
The first evidence for hardness was given by Satta (J. Comp. Linguist.'94):
For a more general parsing problem, any algorithm that avoids fast matrix
multiplication and is significantly faster than $O(|\Gamma| n^6)$ in the case
of $|\Gamma| = \Theta(n^{12})$ would imply a breakthrough for Boolean matrix
multiplication.
Following an approach by Abboud et al. (FOCS'15) for context-free grammar
recognition, in this paper we resolve many of the disadvantages of the previous
lower bound. We show that, even on constant-size grammars, any improvement on
Rajasekaran and Yooseph's parser would imply a breakthrough for the $k$-Clique
problem. This establishes tree-adjoining grammar parsing as a practically
relevant problem with the unusual running time of $n^{2\omega}$, up to lower
order factors.
| cs.CC cs.DS | treeadjoining grammars are a generalization of contextfree grammars that are well suited to model human languages and are thus popular in computational linguistics in the treeadjoining grammar recognition problem given a grammar gamma and a string s of length n the task is to decide whether s can be obtained from gamma rajasekaran and yoosephs parser jcss98 solves this problem in time on2omega where omega 2373 is the matrix multiplication exponent the best algorithms avoiding fast matrix multiplication take time on6 the first evidence for hardness was given by satta j comp linguist94 for a more general parsing problem any algorithm that avoids fast matrix multiplication and is significantly faster than ogamma n6 in the case of gamma thetan12 would imply a breakthrough for boolean matrix multiplication following an approach by abboud et al focs15 for contextfree grammar recognition in this paper we resolve many of the disadvantages of the previous lower bound we show that even on constantsize grammars any improvement on rajasekaran and yoosephs parser would imply a breakthrough for the kclique problem this establishes treeadjoining grammar parsing as a practically relevant problem with the unusual running time of n2omega up to lower order factors | [['treeadjoining', 'grammars', 'are', 'a', 'generalization', 'of', 'contextfree', 'grammars', 'that', 'are', 'well', 'suited', 'to', 'model', 'human', 'languages', 'and', 'are', 'thus', 'popular', 'in', 'computational', 'linguistics', 'in', 'the', 'treeadjoining', 'grammar', 'recognition', 'problem', 'given', 'a', 'grammar', 'gamma', 'and', 'a', 'string', 's', 'of', 'length', 'n', 'the', 'task', 'is', 'to', 'decide', 'whether', 's', 'can', 'be', 'obtained', 'from', 'gamma', 'rajasekaran', 'and', 'yoosephs', 'parser', 'jcss98', 'solves', 'this', 'problem', 'in', 'time', 'on2omega', 'where', 'omega', '2373', 'is', 'the', 'matrix', 'multiplication', 'exponent', 'the', 'best', 'algorithms', 'avoiding', 'fast', 'matrix', 'multiplication', 'take', 'time', 'on6', 'the', 'first', 'evidence', 'for', 'hardness', 'was', 'given', 'by', 'satta', 'j', 'comp', 'linguist94', 'for', 'a', 'more', 'general', 'parsing', 'problem', 'any', 'algorithm', 'that', 'avoids', 'fast', 'matrix', 'multiplication', 'and', 'is', 'significantly', 'faster', 'than', 'ogamma', 'n6', 'in', 'the', 'case', 'of', 'gamma', 'thetan12', 'would', 'imply', 'a', 'breakthrough', 'for', 'boolean', 'matrix', 'multiplication', 'following', 'an', 'approach', 'by', 'abboud', 'et', 'al', 'focs15', 'for', 'contextfree', 'grammar', 'recognition', 'in', 'this', 'paper', 'we', 'resolve', 'many', 'of', 'the', 'disadvantages', 'of', 'the', 'previous', 'lower', 'bound', 'we', 'show', 'that', 'even', 'on', 'constantsize', 'grammars', 'any', 'improvement', 'on', 'rajasekaran', 'and', 'yoosephs', 'parser', 'would', 'imply', 'a', 'breakthrough', 'for', 'the', 'kclique', 'problem', 'this', 'establishes', 'treeadjoining', 'grammar', 'parsing', 'as', 'a', 'practically', 'relevant', 'problem', 'with', 'the', 'unusual', 'running', 'time', 'of', 'n2omega', 'up', 'to', 'lower', 'order', 'factors']] | [-0.0919508267103625, 0.08145184988136456, -0.030473851611183836, 0.0792881548107463, -0.13402924975881877, -0.17722638444529173, 0.09735097900897442, 0.3885273437233681, -0.2948923958465457, -0.3483660569206435, 0.04425797448431617, -0.23827921648533332, -0.14521156304560484, 0.21997906627601627, -0.12852815269651088, 0.07947993139548108, 0.10385023683131217, 0.0683717192447883, -0.043842023104785924, -0.2471744899948851, 0.2348241284316247, 0.058231589340411644, 0.2226573549146935, 0.041914901460528356, 0.05931850172148304, -0.019881243886862028, -0.036457764192860814, -0.009943907814189554, -0.06853697046031773, 0.1020808287052824, 0.326920771936668, 0.22746675962859647, 0.2512211383833114, -0.40661296195925234, -0.16995833224141377, 0.10740130148367322, 0.14750503698249962, 0.10284887527194904, -0.012521892421067063, -0.24471333843502316, 0.11947401318676829, -0.1588837882947236, -0.003023556161156677, -0.04151800444270385, 0.10697222290005773, -0.04736608740913265, -0.307936367752189, 0.03102536114091252, 0.16374556218494385, 0.0040362652920172895, -0.00010231181117210616, -0.1574278258454758, 0.10886659114305772, 0.09366676870961377, -0.01371893536936036, 0.10857907295576297, 0.04817242955818693, -0.13725308593711816, -0.18905316366556477, 0.38554708420378253, -0.04113616457710877, -0.19384669488174544, 0.13296967302325202, -0.07703391707284336, -0.2014104648087015, 0.11977554107718963, 0.13525830425242794, 0.1375643269684007, -0.10416178259146498, 0.17135112524308768, -0.09224792629817223, 0.2125892845809737, 0.16123021487518155, -0.03822388761878717, 0.09117225218722795, 0.1995321887500703, 0.06296863293298768, 0.11685111102997325, 0.030577078824516067, -0.007167337754892403, -0.2436413075917331, -0.15238941289104294, -0.1661789279327074, 0.016641362301480184, -0.1236243751936467, -0.16244181105867028, 0.3440347369066737, 0.14698971976139683, 0.15643076268965972, 0.16943379001508646, 0.26169200963836087, 0.11398430013263776, 0.06274803844741093, 0.14677952670094685, 0.10605372614326312, 0.0924661772312012, 0.08407735561040487, -0.20384741099142628, 0.11917932807874093, 0.14528674362450245] |
1,803.00805 | Unsupervised Deep Single-Image Intrinsic Decomposition using
Illumination-Varying Image Sequences | Machine learning based Single Image Intrinsic Decomposition (SIID) methods
decompose a captured scene into its albedo and shading images by using the
knowledge of a large set of known and realistic ground truth decompositions.
Collecting and annotating such a dataset is an approach that cannot scale to
sufficient variety and realism. We free ourselves from this limitation by
training on unannotated images.
Our method leverages the observation that two images of the same scene but
with different lighting provide useful information on their intrinsic
properties: by definition, albedo is invariant to lighting conditions, and
cross-combining the estimated albedo of a first image with the estimated
shading of a second one should lead back to the second one's input image. We
transcribe this relationship into a siamese training scheme for a deep
convolutional neural network that decomposes a single image into albedo and
shading. The siamese setting allows us to introduce a new loss function
including such cross-combinations, and to train solely on (time-lapse) images,
discarding the need for any ground truth annotations.
As a result, our method has the good properties of i) taking advantage of the
time-varying information of image sequences in the (pre-computed) training
step, ii) not requiring ground truth data to train on, and iii) being able to
decompose single images of unseen scenes at runtime. To demonstrate and
evaluate our work, we additionally propose a new rendered dataset containing
illumination-varying scenes and a set of quantitative metrics to evaluate SIID
algorithms. Despite its unsupervised nature, our results compete with state of
the art methods, including supervised and non data-driven methods.
| cs.CV | machine learning based single image intrinsic decomposition siid methods decompose a captured scene into its albedo and shading images by using the knowledge of a large set of known and realistic ground truth decompositions collecting and annotating such a dataset is an approach that cannot scale to sufficient variety and realism we free ourselves from this limitation by training on unannotated images our method leverages the observation that two images of the same scene but with different lighting provide useful information on their intrinsic properties by definition albedo is invariant to lighting conditions and crosscombining the estimated albedo of a first image with the estimated shading of a second one should lead back to the second ones input image we transcribe this relationship into a siamese training scheme for a deep convolutional neural network that decomposes a single image into albedo and shading the siamese setting allows us to introduce a new loss function including such crosscombinations and to train solely on timelapse images discarding the need for any ground truth annotations as a result our method has the good properties of i taking advantage of the timevarying information of image sequences in the precomputed training step ii not requiring ground truth data to train on and iii being able to decompose single images of unseen scenes at runtime to demonstrate and evaluate our work we additionally propose a new rendered dataset containing illuminationvarying scenes and a set of quantitative metrics to evaluate siid algorithms despite its unsupervised nature our results compete with state of the art methods including supervised and non datadriven methods | [['machine', 'learning', 'based', 'single', 'image', 'intrinsic', 'decomposition', 'siid', 'methods', 'decompose', 'a', 'captured', 'scene', 'into', 'its', 'albedo', 'and', 'shading', 'images', 'by', 'using', 'the', 'knowledge', 'of', 'a', 'large', 'set', 'of', 'known', 'and', 'realistic', 'ground', 'truth', 'decompositions', 'collecting', 'and', 'annotating', 'such', 'a', 'dataset', 'is', 'an', 'approach', 'that', 'can', 'not', 'scale', 'to', 'sufficient', 'variety', 'and', 'realism', 'we', 'free', 'ourselves', 'from', 'this', 'limitation', 'by', 'training', 'on', 'unannotated', 'images', 'our', 'method', 'leverages', 'the', 'observation', 'that', 'two', 'images', 'of', 'the', 'same', 'scene', 'but', 'with', 'different', 'lighting', 'provide', 'useful', 'information', 'on', 'their', 'intrinsic', 'properties', 'by', 'definition', 'albedo', 'is', 'invariant', 'to', 'lighting', 'conditions', 'and', 'crosscombining', 'the', 'estimated', 'albedo', 'of', 'a', 'first', 'image', 'with', 'the', 'estimated', 'shading', 'of', 'a', 'second', 'one', 'should', 'lead', 'back', 'to', 'the', 'second', 'ones', 'input', 'image', 'we', 'transcribe', 'this', 'relationship', 'into', 'a', 'siamese', 'training', 'scheme', 'for', 'a', 'deep', 'convolutional', 'neural', 'network', 'that', 'decomposes', 'a', 'single', 'image', 'into', 'albedo', 'and', 'shading', 'the', 'siamese', 'setting', 'allows', 'us', 'to', 'introduce', 'a', 'new', 'loss', 'function', 'including', 'such', 'crosscombinations', 'and', 'to', 'train', 'solely', 'on', 'timelapse', 'images', 'discarding', 'the', 'need', 'for', 'any', 'ground', 'truth', 'annotations', 'as', 'a', 'result', 'our', 'method', 'has', 'the', 'good', 'properties', 'of', 'i', 'taking', 'advantage', 'of', 'the', 'timevarying', 'information', 'of', 'image', 'sequences', 'in', 'the', 'precomputed', 'training', 'step', 'ii', 'not', 'requiring', 'ground', 'truth', 'data', 'to', 'train', 'on', 'and', 'iii', 'being', 'able', 'to', 'decompose', 'single', 'images', 'of', 'unseen', 'scenes', 'at', 'runtime', 'to', 'demonstrate', 'and', 'evaluate', 'our', 'work', 'we', 'additionally', 'propose', 'a', 'new', 'rendered', 'dataset', 'containing', 'illuminationvarying', 'scenes', 'and', 'a', 'set', 'of', 'quantitative', 'metrics', 'to', 'evaluate', 'siid', 'algorithms', 'despite', 'its', 'unsupervised', 'nature', 'our', 'results', 'compete', 'with', 'state', 'of', 'the', 'art', 'methods', 'including', 'supervised', 'and', 'non', 'datadriven', 'methods']] | [-0.013156873864444116, 0.0075167957474499975, -0.11233439185620787, 0.06955248425902727, -0.13024552774508125, -0.14010023098492708, 0.04506496820742121, 0.4420639009214938, -0.26704726095060605, -0.37315890214477593, 0.08572873707386092, -0.2551309705770109, -0.1384671157055821, 0.17422443436136326, -0.17737395314571375, 0.06601133303260072, 0.15369253437921332, 0.03767927865992533, -0.06656136283418164, -0.25520763590242357, 0.3357096224732231, -0.025558677976480863, 0.31206219873498553, 0.010703105200977565, 0.17957994448997153, -0.013849254119962167, -0.039185974774926975, 0.004973289246509712, -0.04952525458824172, 0.1985622674970028, 0.2578209355500383, 0.22027983849715943, 0.2699595406194791, -0.42393012364896443, -0.21855207955679642, 0.09185465637173575, 0.09444277640364956, 0.126351204522563, -0.024820003130186636, -0.38395762932845034, 0.08241658855784828, -0.1209155591079392, 0.005495974311354355, -0.16253027445099388, -0.02542015928013895, -0.05314628927466961, -0.30374817241233987, 0.012992454096316719, 0.08198971011599776, 0.07264395833302002, -0.10979158333166897, -0.10696573430457368, -0.018793614763909807, 0.20667845369316637, 0.0021292813577859374, 0.051613891324422394, 0.12486532730623506, -0.1995788662087132, -0.09215198155635825, 0.3959401850194599, -0.0631590858871977, -0.20599414569039184, 0.18800076629760532, -0.06231405309293992, -0.103510796228567, 0.15684774174807478, 0.2124325703865347, 0.11487224113303594, -0.15603824307153655, -0.012002313606969368, -0.058398956160705826, 0.19945955783746636, 0.043246525226948926, 0.01922674344095867, 0.18403180157519483, 0.21509200427502106, 0.026633087302056643, 0.16894477865246768, -0.18571897399826692, -0.007455328008374916, -0.2305480308490447, -0.11115988439951952, -0.2315573748254862, 0.009927295396986524, -0.091127816270063, -0.1746666620803388, 0.4119950135628432, 0.23538123569451272, 0.24710536199586036, 0.10000345599837601, 0.3800065260487967, -0.0004229774211685603, 0.11608155439294374, 0.0342915017681662, 0.1560834674639269, 0.02908887252247391, 0.10789250557365729, -0.14745273614647045, 0.08995774273151676, 0.06434740857366705] |
1,803.00806 | A fast implementation of near neighbors queries for Fr\'echet distance
(GIS Cup) | This paper describes an implementation of fast near-neighbours queries (also
known as range searching) with respect to the Fr\'echet distance. The algorithm
is designed to be efficient on practical data such as GPS trajectories. Our
approach is to use a quadtree data structure to enumerate all curves in the
database that have similar start and endpoints as the query curve. On these
curves we run positive and negative filters to narrow the set of potential
results. Only for those trajectories where these heuristics fail, we compute
the Fr\'echet distance exactly, by running a novel recursive variant of the
classic free-space diagram algorithm.
Our implementation won the ACM SIGSPATIAL GIS Cup 2017.
| cs.CG | this paper describes an implementation of fast nearneighbours queries also known as range searching with respect to the frechet distance the algorithm is designed to be efficient on practical data such as gps trajectories our approach is to use a quadtree data structure to enumerate all curves in the database that have similar start and endpoints as the query curve on these curves we run positive and negative filters to narrow the set of potential results only for those trajectories where these heuristics fail we compute the frechet distance exactly by running a novel recursive variant of the classic freespace diagram algorithm our implementation won the acm sigspatial gis cup 2017 | [['this', 'paper', 'describes', 'an', 'implementation', 'of', 'fast', 'nearneighbours', 'queries', 'also', 'known', 'as', 'range', 'searching', 'with', 'respect', 'to', 'the', 'frechet', 'distance', 'the', 'algorithm', 'is', 'designed', 'to', 'be', 'efficient', 'on', 'practical', 'data', 'such', 'as', 'gps', 'trajectories', 'our', 'approach', 'is', 'to', 'use', 'a', 'quadtree', 'data', 'structure', 'to', 'enumerate', 'all', 'curves', 'in', 'the', 'database', 'that', 'have', 'similar', 'start', 'and', 'endpoints', 'as', 'the', 'query', 'curve', 'on', 'these', 'curves', 'we', 'run', 'positive', 'and', 'negative', 'filters', 'to', 'narrow', 'the', 'set', 'of', 'potential', 'results', 'only', 'for', 'those', 'trajectories', 'where', 'these', 'heuristics', 'fail', 'we', 'compute', 'the', 'frechet', 'distance', 'exactly', 'by', 'running', 'a', 'novel', 'recursive', 'variant', 'of', 'the', 'classic', 'freespace', 'diagram', 'algorithm', 'our', 'implementation', 'won', 'the', 'acm', 'sigspatial', 'gis', 'cup', '2017']] | [-0.09195960340530125, 0.006626159855332268, -0.09090346603979006, 0.07970041546803994, -0.12001067757982453, -0.14418054440212563, 0.06816093863410995, 0.4421894802891333, -0.299600107191075, -0.33647178860067245, 0.10877548063220883, -0.2831631298134223, -0.1499011634994264, 0.23256379550476686, -0.10399816657732659, 0.08434376589646307, 0.08574074235479903, 0.02992179963754815, -0.053777443533421516, -0.288265902324742, 0.2673027865041833, 0.02914626932267202, 0.24484662909846788, -0.0029305113872530263, 0.076877753780044, 0.03131268128598912, -0.011462419853468827, 0.00348762777599788, -0.12136949180074542, 0.11788462585162952, 0.2611887500612834, 0.19814502919058596, 0.22434529696095631, -0.37437467875147085, -0.13346307787300865, 0.12037275522336398, 0.1325481793962829, 0.08255102073585768, -0.025656718961518565, -0.2921354887460213, 0.1012302151659008, -0.12651380755161062, -0.10748902375066499, -0.10381939994393412, 0.05146808484578537, 0.04518403234216598, -0.2342429946357205, -0.02539294632819242, 0.024756906639545335, 0.037784154924196664, -0.013724584858693661, -0.10328448498023486, 0.03685284934621817, 0.12274190417807036, -0.01664135196254751, 0.07980925131294397, 0.09222992998334247, -0.05874014882648985, -0.1674369827234357, 0.37647623948137693, -0.05203821020491353, -0.15111159084903059, 0.1875208940510766, -0.056350178418493053, -0.11112290832487473, 0.1028942514057143, 0.22340093162594313, 0.1489937028574219, -0.14995790239361567, 0.07525319030076914, -0.05437960042490052, 0.13512954907064592, 0.06757774950836042, -0.013491708601594245, 0.13454006745591077, 0.14098664225771204, 0.09931784833048753, 0.10183005009611232, -0.09334019466875754, -0.10693721106668952, -0.29841003288865225, -0.14656674370186729, -0.2046294319902658, -0.037233423777010055, -0.11159129045159265, -0.20784749781046438, 0.39248750170846597, 0.17403520384820503, 0.22900418037497397, 0.1254696702016432, 0.32815821463703565, 0.0680298631854084, 0.07196165734064688, 0.145852457338927, 0.16251494138236713, 0.026338792442335585, 0.10133921294344948, -0.17069227656417893, 0.06356926379862045, 0.09143955474975732] |
1,803.00807 | On the Relation of Strong Triadic Closure and Cluster Deletion | We study the parameterized and classical complexity of two related problems
on undirected graphs $G=(V,E)$. In Strong Triadic Closure we aim to label the
edges in $E$ as strong and weak such that at most~$k$ edges are weak and $G$
contains no induced $P_3$ with two strong edges. In Cluster Deletion, we aim to
destroy all induced $P_3$s by a minimum number of edge deletions. We first show
that Strong Triadic Closure admits a $4k$-vertex kernel. Then, we study
parameterization by $\ell:=|E|-k$ and show that both problems are
fixed-parameter tractable and unlikely to admit a polynomial kernel with
respect to $\ell$. Finally, we give a dichotomy of the classical complexity of
both problems on $H$-free graphs for all $H$ of order four.
| cs.DS cs.DM | we study the parameterized and classical complexity of two related problems on undirected graphs gve in strong triadic closure we aim to label the edges in e as strong and weak such that at mostk edges are weak and g contains no induced p_3 with two strong edges in cluster deletion we aim to destroy all induced p_3s by a minimum number of edge deletions we first show that strong triadic closure admits a 4kvertex kernel then we study parameterization by ellek and show that both problems are fixedparameter tractable and unlikely to admit a polynomial kernel with respect to ell finally we give a dichotomy of the classical complexity of both problems on hfree graphs for all h of order four | [['we', 'study', 'the', 'parameterized', 'and', 'classical', 'complexity', 'of', 'two', 'related', 'problems', 'on', 'undirected', 'graphs', 'gve', 'in', 'strong', 'triadic', 'closure', 'we', 'aim', 'to', 'label', 'the', 'edges', 'in', 'e', 'as', 'strong', 'and', 'weak', 'such', 'that', 'at', 'mostk', 'edges', 'are', 'weak', 'and', 'g', 'contains', 'no', 'induced', 'p_3', 'with', 'two', 'strong', 'edges', 'in', 'cluster', 'deletion', 'we', 'aim', 'to', 'destroy', 'all', 'induced', 'p_3s', 'by', 'a', 'minimum', 'number', 'of', 'edge', 'deletions', 'we', 'first', 'show', 'that', 'strong', 'triadic', 'closure', 'admits', 'a', '4kvertex', 'kernel', 'then', 'we', 'study', 'parameterization', 'by', 'ellek', 'and', 'show', 'that', 'both', 'problems', 'are', 'fixedparameter', 'tractable', 'and', 'unlikely', 'to', 'admit', 'a', 'polynomial', 'kernel', 'with', 'respect', 'to', 'ell', 'finally', 'we', 'give', 'a', 'dichotomy', 'of', 'the', 'classical', 'complexity', 'of', 'both', 'problems', 'on', 'hfree', 'graphs', 'for', 'all', 'h', 'of', 'order', 'four']] | [-0.19428740518245224, 0.10045064400716607, 0.010748887360872079, 0.09487387695504973, -0.13957351268424342, -0.1358879803214222, 0.06617526262028453, 0.42910921859826584, -0.3003333910057942, -0.309962158249012, 0.04537235763370215, -0.3046405594485501, -0.1685125855030492, 0.12607439379595842, -0.05905566996273895, 0.04816445197211579, 0.12204284647013992, 0.07274847036072364, -0.0042608383751939986, -0.2341349814552814, 0.3256538166470515, -0.04917307984821188, 0.1460231790319085, 0.10290519073605538, 0.05474596278121074, 0.019546039489796385, -0.006728627101983875, 0.1423468489277487, -0.19149529343212635, 0.05745044965296984, 0.24335492071695625, 0.15000066611294946, 0.26891740191495045, -0.4506063776401182, -0.146504650299903, 0.21187190792988986, 0.08422974816445881, 0.04132558974282195, 0.011626392073230818, -0.21306906040602674, 0.17106846147216856, -0.10485843074663231, -0.054570336275113124, -0.041780230953978995, 0.0732759692085286, 0.015200651448685676, -0.2754400288298105, 0.023647731854968393, 0.16024396918170775, 0.024694624493713492, 0.013720067493462313, -0.12398078657182245, -0.023915631436587623, 0.06507068561040796, -0.035792224248871206, 0.04973766872523508, -0.01070185173302889, -0.1512550310093502, -0.18531622318938995, 0.3623672333157932, -0.08169968206542157, -0.13754876145006467, 0.21178108329574266, -0.14317528258931514, -0.19746010949990403, 0.11650294612627476, 0.15261934099253266, 0.12198976972140371, -0.07993992192981143, 0.13647538112078716, -0.09453560144344617, 0.09715187627977381, 0.09724084980164965, 0.02948655167031878, 0.10622855330584571, 0.10253391747634548, 0.17200807478123656, 0.1965074928322186, -0.025196197675541043, -0.022759628308510096, -0.3118437047426899, -0.07626016344098994, -0.1724209339726561, 0.022239554497840194, -0.13666446164655402, -0.20755380724246303, 0.3998939307872206, 0.11472938195317207, 0.2285586151915292, 0.10382719240151346, 0.2301310362915198, 0.07560722303945416, 0.018927085120230912, 0.16571801816268514, 0.14980749351670966, 0.1667701781455738, -0.0728926845593378, -0.24330794969185565, 0.08488884774269537, 0.10929247865569777] |
1,803.00808 | Peak Effects in Stable Linear Difference Equations | We consider asymptotically stable scalar difference equations with unit-norm
initial conditions. First, it is shown that the solution may happen to deviate
far away from the equilibrium point at finite time instants prior to converging
to zero. Second, for a number of root distributions and initial conditions,
exact values of deviations or lower bounds are provided. Several specific
difference equations known from the literature are also analyzed and estimates
of deviations are proposed. Third, we consider difference equations with
non-random noise (i.e., bounded-noise autoregression) and provide upper bounds
on the solutions. Possible generalizations, e.g., to the vector case are
discussed and directions for future research are outlined.
| cs.SY | we consider asymptotically stable scalar difference equations with unitnorm initial conditions first it is shown that the solution may happen to deviate far away from the equilibrium point at finite time instants prior to converging to zero second for a number of root distributions and initial conditions exact values of deviations or lower bounds are provided several specific difference equations known from the literature are also analyzed and estimates of deviations are proposed third we consider difference equations with nonrandom noise ie boundednoise autoregression and provide upper bounds on the solutions possible generalizations eg to the vector case are discussed and directions for future research are outlined | [['we', 'consider', 'asymptotically', 'stable', 'scalar', 'difference', 'equations', 'with', 'unitnorm', 'initial', 'conditions', 'first', 'it', 'is', 'shown', 'that', 'the', 'solution', 'may', 'happen', 'to', 'deviate', 'far', 'away', 'from', 'the', 'equilibrium', 'point', 'at', 'finite', 'time', 'instants', 'prior', 'to', 'converging', 'to', 'zero', 'second', 'for', 'a', 'number', 'of', 'root', 'distributions', 'and', 'initial', 'conditions', 'exact', 'values', 'of', 'deviations', 'or', 'lower', 'bounds', 'are', 'provided', 'several', 'specific', 'difference', 'equations', 'known', 'from', 'the', 'literature', 'are', 'also', 'analyzed', 'and', 'estimates', 'of', 'deviations', 'are', 'proposed', 'third', 'we', 'consider', 'difference', 'equations', 'with', 'nonrandom', 'noise', 'ie', 'boundednoise', 'autoregression', 'and', 'provide', 'upper', 'bounds', 'on', 'the', 'solutions', 'possible', 'generalizations', 'eg', 'to', 'the', 'vector', 'case', 'are', 'discussed', 'and', 'directions', 'for', 'future', 'research', 'are', 'outlined']] | [-0.1303837594051767, 0.13369858120437536, -0.06254590817979563, 0.11389468422825405, -0.08119389462223817, -0.16801883823838887, 0.03919591987940753, 0.34702372401256426, -0.26027182656749387, -0.274079372153278, 0.17270350927991845, -0.31953314186082543, -0.09763502644018104, 0.20774345876971068, -0.0341310236531214, 0.07182858464273811, 0.05270365092285395, 0.07489392503244133, -0.11632171851880936, -0.2656180572730846, 0.319043225103937, 0.014607979363335348, 0.26712628068385, -0.007254735688530953, 0.08494550467547134, -0.08099168022685449, -0.03351560415195249, 0.01567464428039912, -0.18234101667458671, 0.05226134562812676, 0.24207370256935465, 0.10759125296983903, 0.2395859614284448, -0.3991686445182172, -0.1828809693003091, 0.1484249958422505, 0.11945720144727585, 0.1338239628723692, -0.05883941433074771, -0.2683014285546144, 0.12622870086794544, -0.09370326918384461, -0.17545042461149882, -0.07303598980967686, 0.028348596601216036, 0.06937886852875491, -0.3193108873642006, 0.09767179679594473, 0.0477447778238941, 0.018742520194315725, -0.10235191533498675, -0.20406459135255803, -0.017225325908337797, 0.1196207418519934, 0.10891990868644527, -0.032231836208190215, 0.08101881902978242, -0.0850341254758222, -0.07950804939724192, 0.3465611909072254, -0.0786922957191122, -0.2651542973678524, 0.17231701348394712, -0.16144030933729678, -0.10873939429853703, 0.10807743416141684, 0.16986324131123234, 0.11336684769028188, -0.13615524966408996, 0.07070094178578704, -0.009091748220619754, 0.08681789625606882, 0.12399202882460206, 0.029408137657827585, 0.16329951398074627, 0.06701463848247985, 0.13661371164511296, 0.12312497776088731, -0.05014017937818072, -0.18509008851235245, -0.3618921694807082, -0.07164578859054561, -0.16114045307040215, 0.030635524993744966, -0.07984940491771221, -0.15136378130362266, 0.3220072253563694, 0.17124433628901967, 0.1870108187529389, 0.10432329823515404, 0.25731644473064724, 0.16760924159958263, -0.02203261645980806, 0.10635747626928665, 0.2446768110635403, 0.13753998996559355, 0.09135666596659711, -0.13470875108576486, 0.08083692815363686, 0.05956648846122079] |
1,803.00809 | Tensor structure for Nori motives | We construct a tensor product on Freyd's universal abelian category attached
to an additive tensor category or a tensor quiver and establish a universal
property. This is used to give an alternative construction for the tensor
product on Nori motives.
| math.AG math.RT | we construct a tensor product on freyds universal abelian category attached to an additive tensor category or a tensor quiver and establish a universal property this is used to give an alternative construction for the tensor product on nori motives | [['we', 'construct', 'a', 'tensor', 'product', 'on', 'freyds', 'universal', 'abelian', 'category', 'attached', 'to', 'an', 'additive', 'tensor', 'category', 'or', 'a', 'tensor', 'quiver', 'and', 'establish', 'a', 'universal', 'property', 'this', 'is', 'used', 'to', 'give', 'an', 'alternative', 'construction', 'for', 'the', 'tensor', 'product', 'on', 'nori', 'motives']] | [-0.1520389776560478, 0.06079101605064352, -0.13806182309053838, 0.07852773261256515, -0.1827486477792263, -0.14911052394891158, -0.08837983302073553, 0.3405777305364609, -0.3903850646689534, -0.11395576857030391, 0.0993797771516256, -0.14055635896511376, -0.17432469011400825, 0.1256130406574812, -0.191992221144028, -0.09518388356082141, 0.03225090159394313, 0.17011861125938593, -0.06189532814896666, -0.27081102919764816, 0.47759805813548156, 8.713733404874801e-06, 0.3501332602696493, 0.047339729743544015, 0.17623947242973373, 0.026334725378546864, -0.03338673944817856, -0.03810506565496326, -0.16428330740309322, 0.20290691149421036, 0.3275626477785408, 0.053989834641106425, 0.14698666423209944, -0.3889547202270478, -0.04459271904124762, 0.18725151678081603, 0.03601618997054175, 0.0523049877025187, -0.009545345528749749, -0.25807722732424737, 0.10397398479981348, -0.38147118473425506, -0.08115701009519398, -0.16577298897318543, 0.08832752304151655, -0.13733735918067397, -0.32738908790051935, -0.07669245718279853, 0.03582156258635223, 0.07223558446858078, -0.12345614617224783, -0.11445149327628315, 0.025140230404213072, 0.05981867969385348, -0.04509600101155229, 0.05995528889761772, 0.11478852630825713, -0.11787695772363804, -0.14291059020033572, 0.2999662484508008, -0.13161501362919809, -0.28656072113662956, 0.159705037123058, 0.03044677705038339, -0.13693260145373642, 0.04222107339883223, 0.0679460408515297, 0.1456291529815644, 0.016357739688828588, 0.1771469359038747, -0.1476944281719625, 0.09885708298534154, 0.06789453185629099, -0.0018751144409179688, 0.1494911114918068, 0.05973350587300956, 0.042028917977586386, 0.21803354045841844, 0.086782889184542, -0.02369526631082408, -0.37421758405398575, -0.2680214019092091, -0.12473237905651331, 0.23614804206881673, -0.1251017771424813, -0.3064507910981774, 0.39931553713977336, 0.05066803230438381, 0.1711211320536677, 0.17449974156916143, 0.2308948294259608, 0.04935779720544815, 0.08391798469237984, 0.017885644640773534, 0.14768629181198775, 0.32773436047136784, -0.054176649544388056, -0.03717636602232233, -0.008351709321141243, 0.27055182051844895] |
1,803.0081 | Detecting non-causal artifacts in multivariate linear regression models | We consider linear models where $d$ potential causes $X_1,...,X_d$ are
correlated with one target quantity $Y$ and propose a method to infer whether
the association is causal or whether it is an artifact caused by overfitting or
hidden common causes. We employ the idea that in the former case the vector of
regression coefficients has 'generic' orientation relative to the covariance
matrix $\Sigma_{XX}$ of $X$. Using an ICA based model for confounding, we show
that both confounding and overfitting yield regression vectors that concentrate
mainly in the space of low eigenvalues of $\Sigma_{XX}$.
| stat.ML cs.LG | we consider linear models where d potential causes x_1x_d are correlated with one target quantity y and propose a method to infer whether the association is causal or whether it is an artifact caused by overfitting or hidden common causes we employ the idea that in the former case the vector of regression coefficients has generic orientation relative to the covariance matrix sigma_xx of x using an ica based model for confounding we show that both confounding and overfitting yield regression vectors that concentrate mainly in the space of low eigenvalues of sigma_xx | [['we', 'consider', 'linear', 'models', 'where', 'd', 'potential', 'causes', 'x_1x_d', 'are', 'correlated', 'with', 'one', 'target', 'quantity', 'y', 'and', 'propose', 'a', 'method', 'to', 'infer', 'whether', 'the', 'association', 'is', 'causal', 'or', 'whether', 'it', 'is', 'an', 'artifact', 'caused', 'by', 'overfitting', 'or', 'hidden', 'common', 'causes', 'we', 'employ', 'the', 'idea', 'that', 'in', 'the', 'former', 'case', 'the', 'vector', 'of', 'regression', 'coefficients', 'has', 'generic', 'orientation', 'relative', 'to', 'the', 'covariance', 'matrix', 'sigma_xx', 'of', 'x', 'using', 'an', 'ica', 'based', 'model', 'for', 'confounding', 'we', 'show', 'that', 'both', 'confounding', 'and', 'overfitting', 'yield', 'regression', 'vectors', 'that', 'concentrate', 'mainly', 'in', 'the', 'space', 'of', 'low', 'eigenvalues', 'of', 'sigma_xx']] | [-0.09637018259093967, 0.08420586803588787, -0.06482907273476163, 0.07365493987616832, -0.09709733065408004, -0.20123435365178832, 0.04902384175057773, 0.40155541461201444, -0.3116766841961972, -0.23705009564817434, 0.09549524275816336, -0.2778530980971071, -0.19816122746335402, 0.0881942377641036, -0.10007389425550417, 0.037039540497766386, 0.024670504001019302, 0.06224342547757651, -0.055275074684471695, -0.26738701312382135, 0.36053158083469955, 0.014452772215008736, 0.2858132089072618, -0.003975328683893206, 0.11442882023371195, 0.05074440706671486, -0.06131498153091118, 0.001627569622297581, -0.031481745606460436, 0.10177074002492573, 0.24391612202675933, 0.1482392631831669, 0.29957383286247974, -0.3700888330938034, -0.22824766180447995, 0.17700449566817492, 0.12194879095180221, 0.07054210774680619, -0.0019847166759552814, -0.22290943174182326, 0.06597302959460805, -0.12458444729207023, -0.09899054138710903, -0.09272046713408844, 0.019519533391200727, -0.04646161771429482, -0.33287251340125196, 0.16406065361794606, 0.0695793227652014, 0.06379592906863939, -0.03031192805808318, -0.16117115060783802, -0.009491934854116651, 0.06811222012945882, 0.11860486233396636, 0.05812574651152376, 0.09892457191361695, -0.11286432928435745, -0.11033618024059681, 0.36154490649219484, -0.08051294239328033, -0.2913030323682613, 0.17331029039867704, -0.1269905739113368, -0.12008985385839496, 0.091449834366319, 0.223193197080525, 0.08912517702186941, -0.1338549083629523, 0.085805352263075, -0.029232050422378766, 0.1868397551138074, 0.0074086200285662885, -0.019358019522261075, 0.1716764718894997, 0.12763556649768223, 0.03959276423018466, 0.11881301140472773, -0.16328363798017945, -0.0206683350586763, -0.268794829226149, -0.10678850237520472, -0.17096623173984948, 0.01530415641634615, -0.11370281320815075, -0.19907416748784243, 0.34667814673695674, 0.198644226419449, 0.26382538739852207, 0.009553494502700145, 0.27126442985258675, 0.11914985155266139, 0.042268102377733235, 0.07502279516249415, 0.20152083488922284, 0.1474927415275165, -0.011723816264621031, -0.22425847273239846, 0.15845171121319615, 0.03462451538171179] |
1,803.00811 | An easy proof of Polya's theorem on random walks | We present an easy proof of Polya's theorem on random walks: with the
probability one a random walk on the two-dimensional lattice returns to the
starting point.
| math.CO | we present an easy proof of polyas theorem on random walks with the probability one a random walk on the twodimensional lattice returns to the starting point | [['we', 'present', 'an', 'easy', 'proof', 'of', 'polyas', 'theorem', 'on', 'random', 'walks', 'with', 'the', 'probability', 'one', 'a', 'random', 'walk', 'on', 'the', 'twodimensional', 'lattice', 'returns', 'to', 'the', 'starting', 'point']] | [-0.09564069203204578, 0.14285078858234487, -0.15839939868008648, 0.02885016447140111, -0.05223732779699343, -0.168978667145388, 0.18029165118760257, 0.4055937667273813, -0.24858252704143524, -0.10584732978302916, 0.13599477651425534, -0.3081984685526954, -0.15627034698371534, 0.18843511140180957, -0.09190157176581798, 0.07964833336019958, 0.0214703434008967, 0.061768926162686616, 0.014001683090572004, -0.31064945183418413, 0.25464856928145446, 0.024548948380268283, 0.26881834785281505, 0.022472830144343554, 0.14189936524188076, 0.16217304419519174, -0.01325067738071084, -0.04184289987164515, -0.1684271120293825, 0.0959758870648565, 0.09973355286099293, 0.0020045600314107207, 0.26859368439073916, -0.4084280737572246, -0.12681532540807017, 0.103049509641197, 0.059917731434796694, 0.18466716280413997, -0.06165403808053169, -0.3215686462267681, 0.04273051133862248, -0.06951776029611076, -0.21938181799595002, -0.007183322372535865, -0.00041234293193728836, 0.04567137884872931, -0.2761097372406059, -0.014635993081524416, 0.13800104935136107, 0.0626700135913712, 0.06414745013333029, -0.12544478289783, 0.04191466917594274, 0.087602066134827, 0.006791487318912038, 0.07543985374892752, 0.10772984549058257, -0.02342148107924947, -0.25536892618294116, 0.418851791570584, -0.03947765575031991, -0.21876258409961505, 0.1836387226358056, -0.14041059215863547, -0.19711696773905446, 0.07943448396744551, 0.169986919724141, 0.10216629163672526, -0.11246875735620658, 0.09117381107407035, -0.15118765244605364, 0.11208290979805126, 0.013213836036070629, -0.04138590002225505, 0.18562720455574216, 0.12433149334457186, 0.16197970904047704, 0.19124610135676684, -0.06959395515904934, -0.21292815999024445, -0.28332027202230636, -0.13748825889908606, -0.35185420099231934, 0.21659176851864215, -0.2572644617132567, -0.34592739320187654, 0.41594939844475853, 0.18004198144707415, 0.2220618629621135, 0.20835874260713658, 0.220192554510302, 0.17139738059982104, -0.0681193588749954, 0.06424675305822382, 0.03698135712356479, 0.15323777745167413, 0.08542887726798654, -0.04489141468096663, 0.03799400366497813, 0.23117023872004616] |
1,803.00812 | $\mathbb{Z} R$ and rings of Witt vectors $W_S (R)$ | Using $\lambda$ operations, we give some results on the kernel of the natural
map from the monoid algebra $\mathbb{Z} R$ of a commutative ring $R$ to the
ring of $S$-Witt vectors of $R$. As a byproduct we obtain a very natural
interpretation of a power series used by Dwork in his proof of the rationality
of zeta functions for varieties over finite fields.
| math.AC | using lambda operations we give some results on the kernel of the natural map from the monoid algebra mathbbz r of a commutative ring r to the ring of switt vectors of r as a byproduct we obtain a very natural interpretation of a power series used by dwork in his proof of the rationality of zeta functions for varieties over finite fields | [['using', 'lambda', 'operations', 'we', 'give', 'some', 'results', 'on', 'the', 'kernel', 'of', 'the', 'natural', 'map', 'from', 'the', 'monoid', 'algebra', 'mathbbz', 'r', 'of', 'a', 'commutative', 'ring', 'r', 'to', 'the', 'ring', 'of', 'switt', 'vectors', 'of', 'r', 'as', 'a', 'byproduct', 'we', 'obtain', 'a', 'very', 'natural', 'interpretation', 'of', 'a', 'power', 'series', 'used', 'by', 'dwork', 'in', 'his', 'proof', 'of', 'the', 'rationality', 'of', 'zeta', 'functions', 'for', 'varieties', 'over', 'finite', 'fields']] | [-0.18856160166943747, -0.03270474568219675, -0.14658507507204288, 0.0387407178190657, -0.06946404359393543, -0.11191388828803846, 0.02610467452060191, 0.2947059309770984, -0.35659433588866263, -0.18628227015236212, 0.10820991401335285, -0.20950763597483596, -0.12159591723954485, 0.24834988719873852, -0.10907758048345004, -0.02466248744918454, 0.014519436375027703, 0.10863527685644166, -0.07445926586496493, -0.2889883231912409, 0.3753245855351129, 0.05678951496919317, 0.14667172952284735, 0.021686587677968126, 0.11438000418486134, 0.039709400633470185, -0.059752308245327686, -0.007246445083329754, -0.17286589045468118, 0.12472714190164791, 0.2865949126914324, 0.14359478498508613, 0.2495741975764113, -0.3911557426646112, -0.11636812446428643, 0.1473332052870143, 0.11848726429255499, 0.0020900001118500386, -0.007587013580280567, -0.2340578063120765, 0.0989060600047871, -0.22448373747418723, -0.10534435381451922, -0.09274191532524363, 0.10478208918545034, 0.07579563113470231, -0.31192025959852243, -0.010811624027067614, 0.1100052822955824, 0.1958948549844565, -0.041554838781350203, -0.13065474582535605, 0.000793537515546045, 0.051936028682957255, -0.008952916714347779, 0.035288459816647154, 0.1121351741641129, -0.10643786486358411, -0.11258356862010495, 0.38111595856025815, -0.12272683045856896, -0.18344855577414554, 0.1197577612399454, -0.18570632809743046, -0.12874275159969506, 0.08983144056119566, 0.07960461270845225, 0.18738022092128953, -0.005515460886301533, 0.20406786079007772, -0.19079680860440637, 0.08535162246816101, 0.11406021350393852, 0.023965401120574003, 0.15650202021483453, 0.04976048726107805, 0.04350729583435872, 0.16966032988256624, 0.02597989592205493, 0.006212295513720282, -0.3722796497656213, -0.19267754061447998, -0.17710769588818714, 0.1450706323113052, -0.13190978332873313, -0.17709866683693573, 0.45386838723695083, 0.09343198831794003, 0.2413157108390043, 0.11214919883998171, 0.20518411837157705, 0.07784040410244357, 0.09364909987385955, 0.00041627642067690047, 0.05190751283484015, 0.23139510930500803, 0.056372811685451454, -0.10361078478801515, -0.03136049144180311, 0.18004518153987104] |
1,803.00813 | Lifetime of flatband states | Flatbands feature the distortion-free storage of compact localized states of
tailorable shape. Their reliable storage sojourn is, however, limited by
disorder potentials, which generically cause uncontrolled coupling into
dispersive bands. We find that, while detuning flatband states from band
intersections suppresses their direct decay into dispersive bands,
disorder-induced state distortion causes a delayed, dephasing-mediated decay,
lifting the static nature of flatband states and setting a finite lifetime for
the reliable storage sojourn. We exemplify this generic, disorder-induced decay
mechanism at the cross-stitch lattice. Our analysis, which applies
platform-independently, relies on the time-resolved treatment of
disorder-averaged quantum systems with quantum master equations.
| quant-ph cond-mat.dis-nn | flatbands feature the distortionfree storage of compact localized states of tailorable shape their reliable storage sojourn is however limited by disorder potentials which generically cause uncontrolled coupling into dispersive bands we find that while detuning flatband states from band intersections suppresses their direct decay into dispersive bands disorderinduced state distortion causes a delayed dephasingmediated decay lifting the static nature of flatband states and setting a finite lifetime for the reliable storage sojourn we exemplify this generic disorderinduced decay mechanism at the crossstitch lattice our analysis which applies platformindependently relies on the timeresolved treatment of disorderaveraged quantum systems with quantum master equations | [['flatbands', 'feature', 'the', 'distortionfree', 'storage', 'of', 'compact', 'localized', 'states', 'of', 'tailorable', 'shape', 'their', 'reliable', 'storage', 'sojourn', 'is', 'however', 'limited', 'by', 'disorder', 'potentials', 'which', 'generically', 'cause', 'uncontrolled', 'coupling', 'into', 'dispersive', 'bands', 'we', 'find', 'that', 'while', 'detuning', 'flatband', 'states', 'from', 'band', 'intersections', 'suppresses', 'their', 'direct', 'decay', 'into', 'dispersive', 'bands', 'disorderinduced', 'state', 'distortion', 'causes', 'a', 'delayed', 'dephasingmediated', 'decay', 'lifting', 'the', 'static', 'nature', 'of', 'flatband', 'states', 'and', 'setting', 'a', 'finite', 'lifetime', 'for', 'the', 'reliable', 'storage', 'sojourn', 'we', 'exemplify', 'this', 'generic', 'disorderinduced', 'decay', 'mechanism', 'at', 'the', 'crossstitch', 'lattice', 'our', 'analysis', 'which', 'applies', 'platformindependently', 'relies', 'on', 'the', 'timeresolved', 'treatment', 'of', 'disorderaveraged', 'quantum', 'systems', 'with', 'quantum', 'master', 'equations']] | [-0.18903613311586656, 0.21345079199744935, -0.05593218856195407, 0.08353828427362998, -0.040345332270130665, -0.22169599406458815, 0.11894505439476684, 0.34837673515119033, -0.27883698369818505, -0.19246551271226972, 0.02533683869188106, -0.30381272978742013, -0.09825235519163085, 0.16359695985988534, 0.003347846326615774, 0.07861481870364662, 0.06987439997193187, -0.05107788259934897, -0.04577465384794079, -0.17473891725048724, 0.30623343012841286, 0.029914305594777972, 0.3527717748562796, 0.10722133326532338, 0.006116537861714158, 0.07695535195502218, 0.060083265223474513, -0.07267290697846976, -0.10118217852163292, 0.07814348062483895, 0.24317990077866447, -0.01621164663252656, 0.22954400459003418, -0.46421966417645566, -0.2482723302156147, 0.07440071450452311, 0.15984701446252828, 0.19622790443974386, -0.04779019388558362, -0.3498350548607325, 0.02060345355468341, -0.14962318859467602, -0.1337797759862786, -0.11988792208380847, 0.023049634509729317, -0.034534518613428294, -0.24581624962615245, 0.14692895834080197, 0.060770279457416344, 0.02611908633638211, -0.11298927117722353, -0.0398199989723813, -0.05513688455561571, 0.09316405442054149, -0.012654199978722391, -0.06348317605208116, 0.16024362350428345, -0.08664535713438509, -0.09631137365494112, 0.3604064637776276, -0.04553830533316641, -0.11955398779757546, 0.17059743244464348, -0.11029529229577895, -0.059576674157546625, 0.2233953031621911, 0.16999437706015835, 0.09593787450682033, -0.09773947955802967, 0.08210839894588454, 0.04912871616243413, 0.18079842702306884, 0.04258924075449356, 0.2165764797281361, 0.2050553106072575, 0.14522829712980023, 0.09178169773458833, 0.15345153450081594, -0.08372030445525065, -0.13112411527621626, -0.2936117168177258, -0.09451028355632467, -0.21230117688802155, 0.10081236430025199, -0.05327985395111186, -0.20711254792269132, 0.4352680302008685, 0.08227391263959233, 0.17684470151663956, 0.04833639929579063, 0.27415581451108056, 0.1369403156450705, 0.0695385441532114, 0.05757238173556298, 0.21945999713492287, 0.13274106611685846, 0.07874165032049547, -0.31413289898244495, 0.04328818466853012, 0.020032748100206707] |
1,803.00814 | Understanding Human Mobility Flows from Aggregated Mobile Phone Data | In this paper we deal with the study of travel flows and patterns of people
in large populated areas. Information about the movements of people is
extracted from coarse-grained aggregated cellular network data without tracking
mobile devices individually. Mobile phone data are provided by the Italian
telecommunication company TIM and consist of density profiles (i.e. the spatial
distribution) of people in a given area at various instants of time. By
computing a suitable approximation of the Wasserstein distance between two
consecutive density profiles, we are able to extract the main directions
followed by people, i.e. to understand how the mass of people distribute in
space and time. The main applications of the proposed technique are the
monitoring of daily flows of commuters, the organization of large events, and,
more in general, the traffic management and control.
| physics.soc-ph cs.SI | in this paper we deal with the study of travel flows and patterns of people in large populated areas information about the movements of people is extracted from coarsegrained aggregated cellular network data without tracking mobile devices individually mobile phone data are provided by the italian telecommunication company tim and consist of density profiles ie the spatial distribution of people in a given area at various instants of time by computing a suitable approximation of the wasserstein distance between two consecutive density profiles we are able to extract the main directions followed by people ie to understand how the mass of people distribute in space and time the main applications of the proposed technique are the monitoring of daily flows of commuters the organization of large events and more in general the traffic management and control | [['in', 'this', 'paper', 'we', 'deal', 'with', 'the', 'study', 'of', 'travel', 'flows', 'and', 'patterns', 'of', 'people', 'in', 'large', 'populated', 'areas', 'information', 'about', 'the', 'movements', 'of', 'people', 'is', 'extracted', 'from', 'coarsegrained', 'aggregated', 'cellular', 'network', 'data', 'without', 'tracking', 'mobile', 'devices', 'individually', 'mobile', 'phone', 'data', 'are', 'provided', 'by', 'the', 'italian', 'telecommunication', 'company', 'tim', 'and', 'consist', 'of', 'density', 'profiles', 'ie', 'the', 'spatial', 'distribution', 'of', 'people', 'in', 'a', 'given', 'area', 'at', 'various', 'instants', 'of', 'time', 'by', 'computing', 'a', 'suitable', 'approximation', 'of', 'the', 'wasserstein', 'distance', 'between', 'two', 'consecutive', 'density', 'profiles', 'we', 'are', 'able', 'to', 'extract', 'the', 'main', 'directions', 'followed', 'by', 'people', 'ie', 'to', 'understand', 'how', 'the', 'mass', 'of', 'people', 'distribute', 'in', 'space', 'and', 'time', 'the', 'main', 'applications', 'of', 'the', 'proposed', 'technique', 'are', 'the', 'monitoring', 'of', 'daily', 'flows', 'of', 'commuters', 'the', 'organization', 'of', 'large', 'events', 'and', 'more', 'in', 'general', 'the', 'traffic', 'management', 'and', 'control']] | [-0.14185466781268855, 0.11683923790833968, -0.06670338004615213, 0.07499008751748239, -0.028851653136799167, -0.10260766144047546, 0.061847092560663654, 0.3891231508939253, -0.2668557894991382, -0.3502871301093632, 0.09557447928904474, -0.33503803501576734, -0.11743372938465602, 0.18091015321175186, -0.1273438986784587, 0.04020905570659499, 0.05629393356930985, 0.050429484430317056, 0.01591029595446718, -0.23454301642863462, 0.309622471450198, 0.025332079145728666, 0.33896929634433676, 0.026031989665866336, 0.08662832079297754, 0.014049829035203028, -0.10490870142273385, -0.0020849146096546013, -0.0835917412152733, 0.20765629401498967, 0.32507513165610896, 0.166859806249062, 0.3190914548604804, -0.49057782114045145, -0.20313019177410752, 0.08488921535899863, 0.11508275364544449, 0.04083177307278246, -0.016898960952483534, -0.33457026434103576, 0.09408375776975471, -0.16629547854651772, -0.11751319820851837, -0.02882690791396753, 0.03111551799948382, 0.0855703989543733, -0.21041752211064757, 0.0517424583359731, -0.04640517442706315, 0.10241281828241293, -0.04626599551824363, -0.036250038030523096, -0.02429411329146259, 0.26306499694200125, 0.09500281168113682, -0.04302172533404219, 0.16258086381233572, -0.15347644945380606, -0.09990848250077654, 0.37123549319906435, -0.0034232827242436435, -0.14159755371442503, 0.16344896597643932, -0.1321978451913524, -0.103483496218413, 0.10962839734480333, 0.2582439879051355, 0.09547761192815789, -0.19583392935216098, -0.00975743626793915, -0.018672827050870505, 0.1533396373509758, 0.09436942672918495, 0.0005201947013333932, 0.20113158608129358, 0.19448319274028214, 0.10691068579292144, 0.07459374023806851, -0.12455483726979069, -0.12747653781244642, -0.22470913745928556, -0.14284791383440332, -0.19404085356440834, 0.0023256590562489104, -0.10422438271769566, -0.10434198186746524, 0.4213616806938423, 0.16700314322609783, 0.20240647748098983, 0.05156285594464006, 0.3162259765599361, 0.046688198216382745, 0.0996449689983445, 0.11439770113964401, 0.11677856293595944, 0.02647288835107568, 0.20500115406363928, -0.16550180448993, 0.08730300713881768, -0.015019530488643795] |
1,803.00815 | Crackling dynamics in the mechanical response of knitted fabrics,
Version 2 | Crackling noise, which occurs in a wide range of situations, is characterized
by discrete events of various sizes, often correlated in the form of
avalanches. We report experimental evidence that the mechanical response of
knitted fabric displays such broadly distributed events both in the force
signal and in the deformation field, with statistics analogous to that of
earthquakes or soft amorphous materials. A knit consists of a regular network
of frictional contacts, linked by the elasticity of the yarn. When deformed,
the fabric displays spatially extended avalanche-like yielding events resulting
from collective inter-yarn contact slips. We measure the size distribution of
these avalanches, at the stitch level from the analysis of non-elastic
displacement fields, and externally from force fluctuations. The two
measurements yield consistent power law distributions reminiscent of those
found in other avalanching systems. Our study shows that a knitted fabric is
not only a thread-based metamaterial with highly sought after mechanical
properties, but also an original, model system, with topologically protected
structural order, where intermittent, scale-invariant response emerges from
minimal ingredients, and thus a significant landmark in the study of
out-of-equilibrium universality.
| cond-mat.soft | crackling noise which occurs in a wide range of situations is characterized by discrete events of various sizes often correlated in the form of avalanches we report experimental evidence that the mechanical response of knitted fabric displays such broadly distributed events both in the force signal and in the deformation field with statistics analogous to that of earthquakes or soft amorphous materials a knit consists of a regular network of frictional contacts linked by the elasticity of the yarn when deformed the fabric displays spatially extended avalanchelike yielding events resulting from collective interyarn contact slips we measure the size distribution of these avalanches at the stitch level from the analysis of nonelastic displacement fields and externally from force fluctuations the two measurements yield consistent power law distributions reminiscent of those found in other avalanching systems our study shows that a knitted fabric is not only a threadbased metamaterial with highly sought after mechanical properties but also an original model system with topologically protected structural order where intermittent scaleinvariant response emerges from minimal ingredients and thus a significant landmark in the study of outofequilibrium universality | [['crackling', 'noise', 'which', 'occurs', 'in', 'a', 'wide', 'range', 'of', 'situations', 'is', 'characterized', 'by', 'discrete', 'events', 'of', 'various', 'sizes', 'often', 'correlated', 'in', 'the', 'form', 'of', 'avalanches', 'we', 'report', 'experimental', 'evidence', 'that', 'the', 'mechanical', 'response', 'of', 'knitted', 'fabric', 'displays', 'such', 'broadly', 'distributed', 'events', 'both', 'in', 'the', 'force', 'signal', 'and', 'in', 'the', 'deformation', 'field', 'with', 'statistics', 'analogous', 'to', 'that', 'of', 'earthquakes', 'or', 'soft', 'amorphous', 'materials', 'a', 'knit', 'consists', 'of', 'a', 'regular', 'network', 'of', 'frictional', 'contacts', 'linked', 'by', 'the', 'elasticity', 'of', 'the', 'yarn', 'when', 'deformed', 'the', 'fabric', 'displays', 'spatially', 'extended', 'avalanchelike', 'yielding', 'events', 'resulting', 'from', 'collective', 'interyarn', 'contact', 'slips', 'we', 'measure', 'the', 'size', 'distribution', 'of', 'these', 'avalanches', 'at', 'the', 'stitch', 'level', 'from', 'the', 'analysis', 'of', 'nonelastic', 'displacement', 'fields', 'and', 'externally', 'from', 'force', 'fluctuations', 'the', 'two', 'measurements', 'yield', 'consistent', 'power', 'law', 'distributions', 'reminiscent', 'of', 'those', 'found', 'in', 'other', 'avalanching', 'systems', 'our', 'study', 'shows', 'that', 'a', 'knitted', 'fabric', 'is', 'not', 'only', 'a', 'threadbased', 'metamaterial', 'with', 'highly', 'sought', 'after', 'mechanical', 'properties', 'but', 'also', 'an', 'original', 'model', 'system', 'with', 'topologically', 'protected', 'structural', 'order', 'where', 'intermittent', 'scaleinvariant', 'response', 'emerges', 'from', 'minimal', 'ingredients', 'and', 'thus', 'a', 'significant', 'landmark', 'in', 'the', 'study', 'of', 'outofequilibrium', 'universality']] | [-0.15500900550501145, 0.19225014961279147, -0.10642606468649855, 0.020911208179631765, -0.0018475471863451877, -0.12746081015736352, 0.003361228779670808, 0.3447397644326213, -0.26748704253772243, -0.29251884795404726, 0.06380241673790896, -0.2975303809937151, -0.21072647094222732, 0.18500157300372674, -0.03906655247715083, 0.05286453974155246, 0.012080583092565725, 0.010928885824214972, -0.018807689932523592, -0.14099378014158945, 0.27279554457528404, 0.04694998301845553, 0.3446281290653828, -0.004083900300205731, 0.07400130638801823, -0.005717716511858047, -0.009823339927656567, 0.08736514785617101, -0.09480378602670672, 0.0688400377056312, 0.2230487536191126, 0.006047728932030051, 0.21071940151811705, -0.46658270494615445, -0.23144599494538295, 0.0829759070018683, 0.10747572564764223, 0.09052780401050699, -0.03841221911191452, -0.28567504006325994, 0.04222996536097769, -0.15129543001549778, -0.1249510708616161, -0.05411050130506275, 0.03520596850360617, 0.06071145796659784, -0.23469600792340628, 0.13997156302494893, 0.09070712824471681, 0.08359022198316178, -0.0784806362582279, -0.04231701859163599, -0.037872886099589255, 0.10224447062552673, 0.06083513094720436, -0.01364708165596799, 0.21147981461117177, -0.16841784379663852, -0.10170616886878762, 0.39621076054102616, -0.023169410168128075, -0.1270762079400443, 0.20278797418011424, -0.15298689448381544, -0.11108198547175999, 0.19742664385044978, 0.17537173721175947, 0.04118628491339168, -0.16883000146123375, -0.002237187083645169, -0.0024549401024244522, 0.19818009698224034, 0.024374767692627315, 0.03546600272532939, 0.2394567115278151, 0.19713158669462935, 0.025041629497312985, 0.18505270155992798, -0.07180794396455517, -0.11030386842639679, -0.29993362762949993, -0.10503823851436234, -0.18735158997028048, 0.0539120332525739, -0.09828386234624956, -0.22050616377201238, 0.3995068065066379, 0.12462121854368292, 0.2033525086249749, 0.030397848057550445, 0.2335884295253826, 0.05681018682280708, 0.09664182119864126, 0.04826541270302415, 0.2507048608490922, 0.10081730483232137, 0.1036708550400462, -0.19624864114982793, 0.09805455960363882, -0.022549804082506748] |
1,803.00816 | NetGAN: Generating Graphs via Random Walks | We propose NetGAN - the first implicit generative model for graphs able to
mimic real-world networks. We pose the problem of graph generation as learning
the distribution of biased random walks over the input graph. The proposed
model is based on a stochastic neural network that generates discrete output
samples and is trained using the Wasserstein GAN objective. NetGAN is able to
produce graphs that exhibit well-known network patterns without explicitly
specifying them in the model definition. At the same time, our model exhibits
strong generalization properties, as highlighted by its competitive link
prediction performance, despite not being trained specifically for this task.
Being the first approach to combine both of these desirable properties, NetGAN
opens exciting avenues for further research.
| stat.ML cs.LG cs.SI | we propose netgan the first implicit generative model for graphs able to mimic realworld networks we pose the problem of graph generation as learning the distribution of biased random walks over the input graph the proposed model is based on a stochastic neural network that generates discrete output samples and is trained using the wasserstein gan objective netgan is able to produce graphs that exhibit wellknown network patterns without explicitly specifying them in the model definition at the same time our model exhibits strong generalization properties as highlighted by its competitive link prediction performance despite not being trained specifically for this task being the first approach to combine both of these desirable properties netgan opens exciting avenues for further research | [['we', 'propose', 'netgan', 'the', 'first', 'implicit', 'generative', 'model', 'for', 'graphs', 'able', 'to', 'mimic', 'realworld', 'networks', 'we', 'pose', 'the', 'problem', 'of', 'graph', 'generation', 'as', 'learning', 'the', 'distribution', 'of', 'biased', 'random', 'walks', 'over', 'the', 'input', 'graph', 'the', 'proposed', 'model', 'is', 'based', 'on', 'a', 'stochastic', 'neural', 'network', 'that', 'generates', 'discrete', 'output', 'samples', 'and', 'is', 'trained', 'using', 'the', 'wasserstein', 'gan', 'objective', 'netgan', 'is', 'able', 'to', 'produce', 'graphs', 'that', 'exhibit', 'wellknown', 'network', 'patterns', 'without', 'explicitly', 'specifying', 'them', 'in', 'the', 'model', 'definition', 'at', 'the', 'same', 'time', 'our', 'model', 'exhibits', 'strong', 'generalization', 'properties', 'as', 'highlighted', 'by', 'its', 'competitive', 'link', 'prediction', 'performance', 'despite', 'not', 'being', 'trained', 'specifically', 'for', 'this', 'task', 'being', 'the', 'first', 'approach', 'to', 'combine', 'both', 'of', 'these', 'desirable', 'properties', 'netgan', 'opens', 'exciting', 'avenues', 'for', 'further', 'research']] | [-0.04370615067891777, 0.021953708605724386, -0.06841110214397, 0.0808464829014459, -0.11762979691848159, -0.18850678540766239, 0.026313882608277103, 0.4650097720324993, -0.29160024790714184, -0.3338992209328959, 0.026597726906766185, -0.24995593902810168, -0.22721588333273152, 0.18430372119570773, -0.1051623232177614, 0.11261902042072809, 0.10279866864051049, 0.02912162340556582, -0.021004169032676146, -0.2584545686263785, 0.30423531574973217, 0.04964879894008239, 0.33802716399271354, 0.014021416668159266, 0.1541937328981779, -0.03440924609991877, 0.00020934590429533273, 0.013322707849632328, -0.07611733542350217, 0.15960043976277424, 0.23570324321238634, 0.15621971011084193, 0.30621926761232315, -0.41641523789148777, -0.251985806094793, 0.13447911314045388, 0.10303161033249732, 0.10508936214027927, -0.044276144294417466, -0.3149255281779915, 0.11571294711902738, -0.13604992444743402, -0.032948969160982715, -0.12980442743282766, -0.043837582513030306, 0.008691709618627403, -0.2741911902752084, 0.02474437337368727, 0.09453912208167216, -0.0007545555081984882, -0.021262107541163762, -0.1006958862572598, -0.00497855856277359, 0.17220375633623916, 0.012137410997335488, 0.05192101124363641, 0.08915998462228648, -0.1616101051661341, -0.18107097801354635, 0.373466126069737, -0.07899484497805437, -0.2054594013299114, 0.16299861136940308, -0.038212764057486005, -0.16770047498090815, 0.07467619573192981, 0.23064313835153977, 0.11340603480736415, -0.1629425516546083, 0.022848573867910695, -0.057662992544161774, 0.14902226515308334, 0.00993160112411715, 0.009103628961990276, 0.16484848137479274, 0.25850487349089235, 0.06303246941327718, 0.19462543804353724, -0.08629275083367247, -0.11406869076405807, -0.2210757415208112, -0.07476968797030471, -0.22164289145730437, 0.012337201629149301, -0.12336397174888893, -0.1663585335132666, 0.44104032225053136, 0.2436583997720542, 0.20647208649121845, 0.1683429649216123, 0.30368632551593083, 0.05132885574809431, 0.08931283069541678, 0.0964543743248214, 0.17154033306675653, 0.08422564231829407, 0.10650979163959468, -0.1478674383610875, 0.1560665725846775, 0.059386355072880787] |
1,803.00817 | Robustness against Disturbances in Power Systems under Frequency
Constraints | The wide deployment of renewable generation and the gradual decrease in the
overall system inertia make modern power grids more vulnerable to transient
instabilities and unacceptable frequency fluctuations. Time-domain
simulation-based assessment of the system robustness against uncertain and
stochastic disturbances is extremely time-consuming. In this paper, we develop
an alternative approach, which has its roots in the input-output stability
analysis for Lur'e systems. Our approach consists of a mathematically rigorous
characterization of the external disturbances that the power system is
transiently stable and the frequency constraints are not violated. The derived
certificate is efficiently constructed via convex optimization and is shown to
be non-conservative for different IEEE test cases.
| math.OC | the wide deployment of renewable generation and the gradual decrease in the overall system inertia make modern power grids more vulnerable to transient instabilities and unacceptable frequency fluctuations timedomain simulationbased assessment of the system robustness against uncertain and stochastic disturbances is extremely timeconsuming in this paper we develop an alternative approach which has its roots in the inputoutput stability analysis for lure systems our approach consists of a mathematically rigorous characterization of the external disturbances that the power system is transiently stable and the frequency constraints are not violated the derived certificate is efficiently constructed via convex optimization and is shown to be nonconservative for different ieee test cases | [['the', 'wide', 'deployment', 'of', 'renewable', 'generation', 'and', 'the', 'gradual', 'decrease', 'in', 'the', 'overall', 'system', 'inertia', 'make', 'modern', 'power', 'grids', 'more', 'vulnerable', 'to', 'transient', 'instabilities', 'and', 'unacceptable', 'frequency', 'fluctuations', 'timedomain', 'simulationbased', 'assessment', 'of', 'the', 'system', 'robustness', 'against', 'uncertain', 'and', 'stochastic', 'disturbances', 'is', 'extremely', 'timeconsuming', 'in', 'this', 'paper', 'we', 'develop', 'an', 'alternative', 'approach', 'which', 'has', 'its', 'roots', 'in', 'the', 'inputoutput', 'stability', 'analysis', 'for', 'lure', 'systems', 'our', 'approach', 'consists', 'of', 'a', 'mathematically', 'rigorous', 'characterization', 'of', 'the', 'external', 'disturbances', 'that', 'the', 'power', 'system', 'is', 'transiently', 'stable', 'and', 'the', 'frequency', 'constraints', 'are', 'not', 'violated', 'the', 'derived', 'certificate', 'is', 'efficiently', 'constructed', 'via', 'convex', 'optimization', 'and', 'is', 'shown', 'to', 'be', 'nonconservative', 'for', 'different', 'ieee', 'test', 'cases']] | [-0.1836776133400277, 0.04886398265907784, -0.0632008768942788, 0.06959294088167745, -0.06879042908378424, -0.1480863812729853, 0.042874443200587746, 0.3188356084902899, -0.2718959266037911, -0.29888336594780446, 0.1527902885615706, -0.22760893466856774, -0.1802911742744164, 0.24548278479418212, -0.12548287179526113, 0.0986257897077957, 0.07942536159914089, -0.049714396064759254, -0.011546578472950111, -0.21412188947786057, 0.2677532825982113, 0.11575553643115617, 0.3155945376557119, 0.00727148304069671, 0.07685199094836925, -0.030473561194904762, -0.013058012592768587, 0.02550236056164618, -0.04847286943883748, 0.10881415852388247, 0.2866806085093306, 0.14835199234802104, 0.33614623215083683, -0.43829035639352754, -0.21622285456183032, 0.10483382760393305, 0.11086391271364346, 0.08355624894632899, -0.025474654842374222, -0.2613502236535995, 0.10611541627974617, -0.22441968764605666, -0.13218074184287032, -0.12746973283356056, 0.02644777441944141, 0.05473039224060303, -0.31468093580643247, 0.07061141473668363, 0.07068860418069253, 0.06735359755378865, -0.065144166116466, -0.04701996308969283, -0.02595000102509394, 0.0987842012786332, 0.04083148381617262, -0.0290530153492534, 0.15204641216064999, -0.08765520667016438, -0.07743415640615815, 0.3972328231165852, -0.011421603701769485, -0.22024594475312262, 0.19680038150698972, -0.07025819590503196, -0.12571862392093336, 0.15443156278529846, 0.22217373888290257, 0.11139521396659109, -0.18497748076360365, 0.029905163103590694, 0.042153176065500175, 0.2020520731943463, 0.028077540692762224, 0.025777243525793758, 0.19981193304309672, 0.19943323321298723, 0.11349121881157605, 0.16270407617685959, -0.035920423423495454, -0.12037872539303444, -0.25104849944489266, -0.0728170893180671, -0.16262841362232736, 0.017643759901973914, -0.07416127665209213, -0.18704834446356922, 0.3791283980874909, 0.20080043358403607, 0.08194181125679421, 0.06279625058699605, 0.37828998337713404, 0.16948093176251192, 0.013018293088353282, 0.08492758366458332, 0.2759136858678192, 0.09424726248060891, 0.14455895653900203, -0.23503162235143346, 0.10157153511061034, -0.004685564167421619] |
1,803.00818 | Convex Restriction of Power Flow Feasibility Sets | The convex restriction of the power flow feasible sets identifies the convex
subset of power injections where the solution for power flow is guaranteed to
exist and satisfy the operational constraints. In contrast to convex
relaxations, the convex restriction provides a sufficient condition for power
flow feasibility and is particularly useful for problems involving uncertainty
in the power generation and demand. In this paper, we present a general
framework of constructing convex restriction of an algebraic set defined by
equality and inequality constraints and apply the framework to power flow
feasibility problem. The procedure results in convex quadratic constraints that
provide a sufficiently large region for practical operation of the grid.
| math.OC | the convex restriction of the power flow feasible sets identifies the convex subset of power injections where the solution for power flow is guaranteed to exist and satisfy the operational constraints in contrast to convex relaxations the convex restriction provides a sufficient condition for power flow feasibility and is particularly useful for problems involving uncertainty in the power generation and demand in this paper we present a general framework of constructing convex restriction of an algebraic set defined by equality and inequality constraints and apply the framework to power flow feasibility problem the procedure results in convex quadratic constraints that provide a sufficiently large region for practical operation of the grid | [['the', 'convex', 'restriction', 'of', 'the', 'power', 'flow', 'feasible', 'sets', 'identifies', 'the', 'convex', 'subset', 'of', 'power', 'injections', 'where', 'the', 'solution', 'for', 'power', 'flow', 'is', 'guaranteed', 'to', 'exist', 'and', 'satisfy', 'the', 'operational', 'constraints', 'in', 'contrast', 'to', 'convex', 'relaxations', 'the', 'convex', 'restriction', 'provides', 'a', 'sufficient', 'condition', 'for', 'power', 'flow', 'feasibility', 'and', 'is', 'particularly', 'useful', 'for', 'problems', 'involving', 'uncertainty', 'in', 'the', 'power', 'generation', 'and', 'demand', 'in', 'this', 'paper', 'we', 'present', 'a', 'general', 'framework', 'of', 'constructing', 'convex', 'restriction', 'of', 'an', 'algebraic', 'set', 'defined', 'by', 'equality', 'and', 'inequality', 'constraints', 'and', 'apply', 'the', 'framework', 'to', 'power', 'flow', 'feasibility', 'problem', 'the', 'procedure', 'results', 'in', 'convex', 'quadratic', 'constraints', 'that', 'provide', 'a', 'sufficiently', 'large', 'region', 'for', 'practical', 'operation', 'of', 'the', 'grid']] | [-0.14089937996421312, 0.01057837347341135, -0.06199365161225066, 0.04189259161740575, -0.11338531650888088, -0.1517586036719516, 0.05325270842169286, 0.2954718193693741, -0.3347387520327896, -0.2633213820019821, 0.16543263180164602, -0.23462194527776256, -0.10085796951190443, 0.2503052861581825, -0.12472449934664853, 0.13709989823988294, 0.05019805788351978, -0.019199639850092615, -0.05134799718428906, -0.2238423900368313, 0.33147360756993294, -0.004475775158015994, 0.28485106348756467, 0.1256009697838611, 0.11922464491212154, 0.0031103505081757233, 0.027727221090531162, 0.10611054761049983, -0.1336187656326057, 0.1810471642298859, 0.29741591750014873, 0.24780810947177578, 0.3071405039848508, -0.45679174764669156, -0.16695072858485285, 0.16676211689057685, 0.06109976441272207, 0.0070641902485140805, -0.06850556524990646, -0.1602045985458939, 0.10349444186562454, -0.14049011618234553, -0.09972685798247521, -0.1056860170184492, -0.007155174230065968, 0.022442816160954872, -0.4009125733764859, 0.051526600956446955, 0.09706102744078364, 0.04327146336855786, -0.08757505241177373, -0.05032169805243947, 0.020544801005959377, 0.07522723682409337, 0.021295835939445742, 0.008694774274051457, 0.09665278883531338, -0.09699595450457218, -0.0766297624287036, 0.4122602170551414, 0.009891258145741245, -0.2561795431952756, 0.10550838068278658, -0.10417685214522387, -0.16672944126499667, 0.1037017655923862, 0.228838918571201, 0.14826063164048367, -0.15549387222235636, 0.14205673366086558, -0.062139156792598134, 0.09937602712831518, 0.046033756745043675, 0.02940128056745691, 0.15330269330323817, 0.15878228515151654, 0.2283558290166495, 0.1984070773165136, -0.02792658085456571, -0.08756153175590543, -0.35500305162759516, -0.09326894065944126, -0.1858298559484349, 0.006953602416549918, -0.1084041939013971, -0.10324060260779686, 0.38313224580273164, 0.07917708295045069, 0.15478716387942032, 0.15360263473278768, 0.3464339637608678, 0.15512796532982007, 0.00969180599408778, 0.10071378226417142, 0.2121777789214173, 0.12139117414014297, 0.06307958006053357, -0.2229843071094496, 0.04126185438855811, 0.06090840238758975] |
1,803.00819 | The discrepancy between Einstein mass and dynamical mass for SIS and
power-law mass models | We investigate the discrepancy between the two-dimensional projected lensing
mass and the dynam- ical mass for an ensemble of 97 strong gravitational
lensing systems discovered by the Sloan Lens ACS (SLACS) Survey, the BOSS
Emission-Line Lens Survey (BELLS), and the BELLS for GALaxy-Ly{\alpha} EmitteR
sYs- tems (BELLS GALLERY) Survey. We fit the lensing data to obtain the
Einstein mass, and use the velocity dispersion of the lensing galaxies provided
by the Sloan Digital Sky Survey (SDSS) to get the projected dynamical mass
within the Einstein radius by assuming the power-law mass approximation. The
discrepancy is found to be obvious and quantified by Bayesian analysis. For the
singular isothermal sphere (SIS) mass model, we obtain that the Einstein mass
is 20.7% more than the dynamical mass, and the discrepancy increases with the
redshift of the lensing galaxies. For more general power-law mass model, the
discrepancy still exists within 1{\sigma} credible region. The main reason of
the the discrepancy could be mass contamination, including all invisible masses
along the line of sight. In addition, the measurement errors and the
approximation of the mass models could lead to part of the discrepancy.
| astro-ph.GA astro-ph.CO | we investigate the discrepancy between the twodimensional projected lensing mass and the dynam ical mass for an ensemble of 97 strong gravitational lensing systems discovered by the sloan lens acs slacs survey the boss emissionline lens survey bells and the bells for galaxylyalpha emitter sys tems bells gallery survey we fit the lensing data to obtain the einstein mass and use the velocity dispersion of the lensing galaxies provided by the sloan digital sky survey sdss to get the projected dynamical mass within the einstein radius by assuming the powerlaw mass approximation the discrepancy is found to be obvious and quantified by bayesian analysis for the singular isothermal sphere sis mass model we obtain that the einstein mass is 207 more than the dynamical mass and the discrepancy increases with the redshift of the lensing galaxies for more general powerlaw mass model the discrepancy still exists within 1sigma credible region the main reason of the the discrepancy could be mass contamination including all invisible masses along the line of sight in addition the measurement errors and the approximation of the mass models could lead to part of the discrepancy | [['we', 'investigate', 'the', 'discrepancy', 'between', 'the', 'twodimensional', 'projected', 'lensing', 'mass', 'and', 'the', 'dynam', 'ical', 'mass', 'for', 'an', 'ensemble', 'of', '97', 'strong', 'gravitational', 'lensing', 'systems', 'discovered', 'by', 'the', 'sloan', 'lens', 'acs', 'slacs', 'survey', 'the', 'boss', 'emissionline', 'lens', 'survey', 'bells', 'and', 'the', 'bells', 'for', 'galaxylyalpha', 'emitter', 'sys', 'tems', 'bells', 'gallery', 'survey', 'we', 'fit', 'the', 'lensing', 'data', 'to', 'obtain', 'the', 'einstein', 'mass', 'and', 'use', 'the', 'velocity', 'dispersion', 'of', 'the', 'lensing', 'galaxies', 'provided', 'by', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'to', 'get', 'the', 'projected', 'dynamical', 'mass', 'within', 'the', 'einstein', 'radius', 'by', 'assuming', 'the', 'powerlaw', 'mass', 'approximation', 'the', 'discrepancy', 'is', 'found', 'to', 'be', 'obvious', 'and', 'quantified', 'by', 'bayesian', 'analysis', 'for', 'the', 'singular', 'isothermal', 'sphere', 'sis', 'mass', 'model', 'we', 'obtain', 'that', 'the', 'einstein', 'mass', 'is', '207', 'more', 'than', 'the', 'dynamical', 'mass', 'and', 'the', 'discrepancy', 'increases', 'with', 'the', 'redshift', 'of', 'the', 'lensing', 'galaxies', 'for', 'more', 'general', 'powerlaw', 'mass', 'model', 'the', 'discrepancy', 'still', 'exists', 'within', '1sigma', 'credible', 'region', 'the', 'main', 'reason', 'of', 'the', 'the', 'discrepancy', 'could', 'be', 'mass', 'contamination', 'including', 'all', 'invisible', 'masses', 'along', 'the', 'line', 'of', 'sight', 'in', 'addition', 'the', 'measurement', 'errors', 'and', 'the', 'approximation', 'of', 'the', 'mass', 'models', 'could', 'lead', 'to', 'part', 'of', 'the', 'discrepancy']] | [-0.08082056803771703, 0.02209931524864967, -0.05715151152957881, 0.15268815804159555, -0.09219125065479487, -0.062023442207771555, 0.015414104284472251, 0.3252506118425459, -0.15545892899747563, -0.38146867021602926, 0.04621975004818369, -0.3133703890261511, -0.014899591333848774, 0.20227002950690726, -0.010343445360410475, 0.050372509477985286, 0.03711407842538344, -0.07653039699745556, -0.0909284215977769, -0.27172512686552686, 0.3369522749017628, 0.07174105104058981, 0.2148683015380311, -0.015128462845163922, 0.07190949545751903, -0.02065418082136641, -0.08200347462974528, 0.029206504932575164, -0.18706423354295246, 0.04365438856732682, 0.1848181276381419, 0.16494545077648823, 0.2214670435121411, -0.24972352416996188, -0.15490185083555325, 0.12469758264099558, 0.18164773431246872, 0.10125500696006591, -0.055310069932756334, -0.36296313715773443, 0.04382436466772878, -0.17138078441183088, -0.18633110924234625, 0.04233285077113323, -0.0071035039108542225, 0.01897908984831283, -0.2209426562872188, 0.2287808201970562, 0.017549129782882693, 0.05669297917534119, -0.08410877982775371, -0.1047960471074841, -0.05875392082743544, 0.04754661116256285, 0.030095479905694014, 0.07811469202565532, 0.16403334931761185, -0.12333081804570697, 0.0025342020240646823, 0.432059258879187, -0.0704165387449191, -0.07040969025043071, 0.10721398588447344, -0.19048664121637268, -0.12230023639304341, 0.10176525756017005, 0.16855490663970904, 0.021559252482518634, -0.22031498594682605, 0.04530848623512106, -0.04741190129178995, 0.27171501398293507, 0.0713324742317791, 0.015529614598822914, 0.3311241244793766, 0.09365557930580089, 0.06844394616092797, 0.035933474512406124, -0.2421729114749247, -0.05170704677045621, -0.26777720366106933, -0.11247964874994029, -0.1559423232536083, 0.08701601738871503, -0.15653633933083805, -0.11699421539725292, 0.3183379009361108, 0.150947791382562, 0.20917341741856443, 0.1241698218762096, 0.31830463595577474, 0.09081698245327013, 0.10652297142912787, 0.022618813745716893, 0.41693595410497103, 0.20933595745178757, 0.08096064186701797, -0.22480733075213652, -0.01776246376404608, 0.024610265838130127] |
1,803.0082 | Non-thermal WIMP baryogenesis | We propose a WIMP baryogensis achieved by the annihilation of non-thermally
produced WIMPs from decay of heavy particles, which can result in low reheating
temerature. Dark matter (DM) can be produced non-thermally during a reheating
period created by the decay of long-lived heavy particle, and subsequently
re-annihilate to lighter particles even after the thermal freeze-out. The
re-annihilation of DM provides the observed baryon asymmetry as well as the
correct relic density of DM. We investigate how wahout effects can affect the
generation of the baryon asymmetry and study a model suppressing them. In this
scenario, we find that DM can be heavy enough and its annihilation cross
section can also be larger than that adopted in the usual thermal WIMP
baryogenesis.
| hep-ph astro-ph.CO | we propose a wimp baryogensis achieved by the annihilation of nonthermally produced wimps from decay of heavy particles which can result in low reheating temerature dark matter dm can be produced nonthermally during a reheating period created by the decay of longlived heavy particle and subsequently reannihilate to lighter particles even after the thermal freezeout the reannihilation of dm provides the observed baryon asymmetry as well as the correct relic density of dm we investigate how wahout effects can affect the generation of the baryon asymmetry and study a model suppressing them in this scenario we find that dm can be heavy enough and its annihilation cross section can also be larger than that adopted in the usual thermal wimp baryogenesis | [['we', 'propose', 'a', 'wimp', 'baryogensis', 'achieved', 'by', 'the', 'annihilation', 'of', 'nonthermally', 'produced', 'wimps', 'from', 'decay', 'of', 'heavy', 'particles', 'which', 'can', 'result', 'in', 'low', 'reheating', 'temerature', 'dark', 'matter', 'dm', 'can', 'be', 'produced', 'nonthermally', 'during', 'a', 'reheating', 'period', 'created', 'by', 'the', 'decay', 'of', 'longlived', 'heavy', 'particle', 'and', 'subsequently', 'reannihilate', 'to', 'lighter', 'particles', 'even', 'after', 'the', 'thermal', 'freezeout', 'the', 'reannihilation', 'of', 'dm', 'provides', 'the', 'observed', 'baryon', 'asymmetry', 'as', 'well', 'as', 'the', 'correct', 'relic', 'density', 'of', 'dm', 'we', 'investigate', 'how', 'wahout', 'effects', 'can', 'affect', 'the', 'generation', 'of', 'the', 'baryon', 'asymmetry', 'and', 'study', 'a', 'model', 'suppressing', 'them', 'in', 'this', 'scenario', 'we', 'find', 'that', 'dm', 'can', 'be', 'heavy', 'enough', 'and', 'its', 'annihilation', 'cross', 'section', 'can', 'also', 'be', 'larger', 'than', 'that', 'adopted', 'in', 'the', 'usual', 'thermal', 'wimp', 'baryogenesis']] | [-0.08712908535013993, 0.3480557290398899, -0.14617497585870387, 0.18412112252407184, -0.05761956424499322, -0.11005211031424399, 0.0037971539970706493, 0.28151424247928025, -0.24315313578528516, -0.35036760014520973, -0.008423107620446058, -0.2506961963851662, 0.036041990270791184, 0.1458194013009975, 0.06415857747979775, -0.023445565469206914, 0.04768320875430182, 0.03055307687800221, 0.011136758090349055, -0.277182017163444, 0.24202136087970919, 0.09944776317668187, 0.16547203615127803, 0.11582219763071973, 0.0271802872082829, -0.01788553435300641, -0.024325748922414844, -0.06686012864410251, -0.11580520029780905, 0.039831912614592985, 0.16715581662084186, 0.10264055857419216, 0.08270318970718116, -0.4521084800362587, -0.22782883002665363, 0.27200775143510403, 0.24252598381311702, 0.1390644579239487, -0.14567630156530303, -0.3337198779331285, 0.10370585794693657, -0.2677802528497301, -0.10542268263363913, -0.046299873796456004, -0.03307109314384831, -0.0528470220361218, -0.28886230194553764, 0.17042017839785406, -0.01617099594191781, -0.12434819272617582, -0.018689295227107192, -0.11094265166247468, -0.0820915959716751, -0.06161338392011195, 0.1410670948885929, -0.055401443787498256, 0.2943487675667803, -0.19250195911506332, -0.06121345259593565, 0.4410319596415527, -0.19012903304197806, -0.074314299082587, 0.13282689045989463, -0.13922251442431652, -0.12049749079395179, 0.15257170188686803, 0.18593503003000839, 0.10072231700276064, -0.14774416131554408, 0.09428463613359109, -0.004613580402796853, 0.164779690708652, 0.09464694834275156, 0.03004657378529801, 0.3524519981691191, 0.19577288395576492, 0.01930795472404849, 0.07888680095921326, -0.1104019213810051, -0.019484941311524947, -0.35223065083455135, -0.15200926999741493, -0.11812160891958144, 0.01825650133576025, -0.059301456862678084, -0.05364210922427538, 0.3672071897792591, 0.1354116952856768, 0.2713696411615159, -0.03780515103096127, 0.33827804861699834, 0.10087009285529684, 0.03744715302676342, 0.024921710315324804, 0.3300870942077091, 0.14345733465689445, 0.1355622214961703, -0.23239506269656435, 0.08433673064177465, -0.0188851263432787] |
1,803.00821 | Transverse Wave Induced Kelvin-Helmholtz Rolls in Spicules | In addition to their jet-like dynamic behaviour, spicules usually exhibit
strong transverse speeds, multi-stranded structure and heating from
chromospheric to transition region temperatures. In this work we first analyse
\textit{Hinode} \& \textit{IRIS} observations of spicules and find different
behaviours in terms of their Doppler velocity evolution and collective motion
of their sub-structure. Some have a Doppler shift sign change that is rather
fixed along the spicule axis, and lack coherence in the oscillatory motion of
strand-like structure, matching rotation models or long wavelength torsional
Alfv\'en waves. Others exhibit a Doppler shift sign change at maximum
displacement and coherent motion of their strands, suggesting a collective MHD
wave. By comparing with an idealised 3-D MHD simulation combined with radiative
transfer modelling, we analyse the role of transverse MHD waves and associated
instabilities in spicule-like features. We find that Transverse Wave Induced
Kelvin-Helmholtz (TWIKH) rolls lead to coherence of strand-like structure in
imaging and spectral maps, as seen in some observations. The rapid transverse
dynamics and the density and temperature gradients at the spicule boundary lead
to ring-shaped \ion{Mg}{2} k and \ion{Ca}{2} H source functions in the
transverse cross-section, potentially allowing IRIS to capture the KHI
dynamics. Twists and currents propagate along the spicule at Alfv\'enic speeds,
and the temperature variations within TWIKH rolls produce sudden appearance /
disappearance of strands seen in Doppler velocity and in \ion{Ca}{2} H
intensity. However, only a mild intensity increase in higher temperature lines
is obtained, suggesting there is an additional heating mechanism at work in
spicules.
| astro-ph.SR | in addition to their jetlike dynamic behaviour spicules usually exhibit strong transverse speeds multistranded structure and heating from chromospheric to transition region temperatures in this work we first analyse textithinode textitiris observations of spicules and find different behaviours in terms of their doppler velocity evolution and collective motion of their substructure some have a doppler shift sign change that is rather fixed along the spicule axis and lack coherence in the oscillatory motion of strandlike structure matching rotation models or long wavelength torsional alfven waves others exhibit a doppler shift sign change at maximum displacement and coherent motion of their strands suggesting a collective mhd wave by comparing with an idealised 3d mhd simulation combined with radiative transfer modelling we analyse the role of transverse mhd waves and associated instabilities in spiculelike features we find that transverse wave induced kelvinhelmholtz twikh rolls lead to coherence of strandlike structure in imaging and spectral maps as seen in some observations the rapid transverse dynamics and the density and temperature gradients at the spicule boundary lead to ringshaped ionmg2 k and ionca2 h source functions in the transverse crosssection potentially allowing iris to capture the khi dynamics twists and currents propagate along the spicule at alfvenic speeds and the temperature variations within twikh rolls produce sudden appearance disappearance of strands seen in doppler velocity and in ionca2 h intensity however only a mild intensity increase in higher temperature lines is obtained suggesting there is an additional heating mechanism at work in spicules | [['in', 'addition', 'to', 'their', 'jetlike', 'dynamic', 'behaviour', 'spicules', 'usually', 'exhibit', 'strong', 'transverse', 'speeds', 'multistranded', 'structure', 'and', 'heating', 'from', 'chromospheric', 'to', 'transition', 'region', 'temperatures', 'in', 'this', 'work', 'we', 'first', 'analyse', 'textithinode', 'textitiris', 'observations', 'of', 'spicules', 'and', 'find', 'different', 'behaviours', 'in', 'terms', 'of', 'their', 'doppler', 'velocity', 'evolution', 'and', 'collective', 'motion', 'of', 'their', 'substructure', 'some', 'have', 'a', 'doppler', 'shift', 'sign', 'change', 'that', 'is', 'rather', 'fixed', 'along', 'the', 'spicule', 'axis', 'and', 'lack', 'coherence', 'in', 'the', 'oscillatory', 'motion', 'of', 'strandlike', 'structure', 'matching', 'rotation', 'models', 'or', 'long', 'wavelength', 'torsional', 'alfven', 'waves', 'others', 'exhibit', 'a', 'doppler', 'shift', 'sign', 'change', 'at', 'maximum', 'displacement', 'and', 'coherent', 'motion', 'of', 'their', 'strands', 'suggesting', 'a', 'collective', 'mhd', 'wave', 'by', 'comparing', 'with', 'an', 'idealised', '3d', 'mhd', 'simulation', 'combined', 'with', 'radiative', 'transfer', 'modelling', 'we', 'analyse', 'the', 'role', 'of', 'transverse', 'mhd', 'waves', 'and', 'associated', 'instabilities', 'in', 'spiculelike', 'features', 'we', 'find', 'that', 'transverse', 'wave', 'induced', 'kelvinhelmholtz', 'twikh', 'rolls', 'lead', 'to', 'coherence', 'of', 'strandlike', 'structure', 'in', 'imaging', 'and', 'spectral', 'maps', 'as', 'seen', 'in', 'some', 'observations', 'the', 'rapid', 'transverse', 'dynamics', 'and', 'the', 'density', 'and', 'temperature', 'gradients', 'at', 'the', 'spicule', 'boundary', 'lead', 'to', 'ringshaped', 'ionmg2', 'k', 'and', 'ionca2', 'h', 'source', 'functions', 'in', 'the', 'transverse', 'crosssection', 'potentially', 'allowing', 'iris', 'to', 'capture', 'the', 'khi', 'dynamics', 'twists', 'and', 'currents', 'propagate', 'along', 'the', 'spicule', 'at', 'alfvenic', 'speeds', 'and', 'the', 'temperature', 'variations', 'within', 'twikh', 'rolls', 'produce', 'sudden', 'appearance', 'disappearance', 'of', 'strands', 'seen', 'in', 'doppler', 'velocity', 'and', 'in', 'ionca2', 'h', 'intensity', 'however', 'only', 'a', 'mild', 'intensity', 'increase', 'in', 'higher', 'temperature', 'lines', 'is', 'obtained', 'suggesting', 'there', 'is', 'an', 'additional', 'heating', 'mechanism', 'at', 'work', 'in', 'spicules']] | [-0.16989940602470743, 0.2253820733514373, -0.0404420179032453, 0.07900682674257092, -0.0957219703235181, -0.08541096783576002, -0.035135914040467585, 0.45342435605681863, -0.26523921063476535, -0.28157405903465654, 0.05652254089772941, -0.23341731819881492, -0.07153898188339389, 0.1854276599906699, 0.0023331389046904356, 0.010215508818895701, 0.08087339649214428, -0.03391669495531496, -0.039729907274635205, -0.09392273806112193, 0.26296934761466034, 0.08473527566324096, 0.2575607180415866, 0.013573024313463026, 0.05956972901799144, -0.08478290148371134, -0.035707892814509, 0.053705204491892526, -0.1328059508118439, 0.0057283825312094035, 0.1976505436503496, 0.0464086369027493, 0.20702191749045318, -0.4468749878352067, -0.253196219936103, 0.008892349286349004, 0.19722104994694695, 0.10616923621051522, -0.0036848725325121247, -0.25814369855912395, -0.0008636031254946467, -0.1120126542380925, -0.15779218452993826, -0.00782390016815569, 0.05526336773960705, 0.024316903861542512, -0.24373161626103554, 0.14967489491233668, 0.074213740562676, 0.168952446303753, -0.08235002846371038, -0.0370780895384642, -0.08760995292067378, 0.072597261674863, 0.10652459527732408, 0.05036778479298375, 0.17683234893722483, -0.1617186229954657, -0.09596864365968838, 0.34748214815582434, -0.10130170092031539, -0.09952881818625096, 0.19931090201614013, -0.2369437692948733, -0.08953004711902285, 0.24249330427063756, 0.1823216828865459, 0.0657900453617153, -0.04187619559776345, -0.040157164681009036, 0.0029372743174974174, 0.13389023898139477, 0.14720218131659052, 0.041376398664050136, 0.2598999884319922, 0.07924978262894454, 0.030879053110481208, 0.10873107483024226, -0.2004198970099683, -0.058412538256017436, -0.26523260439906915, -0.10272075576019514, -0.05289208511990237, 0.03813099094896098, -0.0793005616460103, -0.1945133067472991, 0.40211418413755345, 0.1551923244108304, 0.24132581973863565, -0.010236330281047293, 0.2772179190349956, 0.11687188981106528, 0.08620980552895122, 0.13681297399567433, 0.2736425778267991, 0.19621846231493545, 0.19761359117117272, -0.31202904899963685, 0.06309832295077483, 0.021769878202974498] |
1,803.00822 | The 155-day X-ray cycle of the very massive Wolf-Rayet star Melnick 34
in the Large Magellanic Cloud | The Wolf-Rayet star Mk 34 was observed more than 50 times as part of the deep
T-ReX Chandra ACIS-I X-ray imaging survey of the Tarantula Nebula in the Large
Magellanic Cloud conducted between 2014 May and 2016 January. Its brightness
showed one bright maximum and repeated faint minima which help define an X-ray
recurrence time of $155.1\pm0.1$ days that is probably the orbital period of an
eccentric binary system. The maximum immediately precedes the minimum in the
folded X-ray light curve as confirmed by new Swift XRT observations.
Notwithstanding its extreme median luminosity of
$1.2\times10^{35}\mathrm{erg}~\mathrm{s}^{-1}$, which makes it over an order of
magnitude brighter than comparable stars in the Milky Way, Mk 34 is almost
certainly a colliding-wind binary system. Its spectrum shows phase-related
changes of luminosity and absorption that are probably related to the orbital
dynamics of two of the most massive stars known.
| astro-ph.SR astro-ph.HE | the wolfrayet star mk 34 was observed more than 50 times as part of the deep trex chandra acisi xray imaging survey of the tarantula nebula in the large magellanic cloud conducted between 2014 may and 2016 january its brightness showed one bright maximum and repeated faint minima which help define an xray recurrence time of 1551pm01 days that is probably the orbital period of an eccentric binary system the maximum immediately precedes the minimum in the folded xray light curve as confirmed by new swift xrt observations notwithstanding its extreme median luminosity of 12times1035mathrmergmathrms1 which makes it over an order of magnitude brighter than comparable stars in the milky way mk 34 is almost certainly a collidingwind binary system its spectrum shows phaserelated changes of luminosity and absorption that are probably related to the orbital dynamics of two of the most massive stars known | [['the', 'wolfrayet', 'star', 'mk', '34', 'was', 'observed', 'more', 'than', '50', 'times', 'as', 'part', 'of', 'the', 'deep', 'trex', 'chandra', 'acisi', 'xray', 'imaging', 'survey', 'of', 'the', 'tarantula', 'nebula', 'in', 'the', 'large', 'magellanic', 'cloud', 'conducted', 'between', '2014', 'may', 'and', '2016', 'january', 'its', 'brightness', 'showed', 'one', 'bright', 'maximum', 'and', 'repeated', 'faint', 'minima', 'which', 'help', 'define', 'an', 'xray', 'recurrence', 'time', 'of', '1551pm01', 'days', 'that', 'is', 'probably', 'the', 'orbital', 'period', 'of', 'an', 'eccentric', 'binary', 'system', 'the', 'maximum', 'immediately', 'precedes', 'the', 'minimum', 'in', 'the', 'folded', 'xray', 'light', 'curve', 'as', 'confirmed', 'by', 'new', 'swift', 'xrt', 'observations', 'notwithstanding', 'its', 'extreme', 'median', 'luminosity', 'of', '12times1035mathrmergmathrms1', 'which', 'makes', 'it', 'over', 'an', 'order', 'of', 'magnitude', 'brighter', 'than', 'comparable', 'stars', 'in', 'the', 'milky', 'way', 'mk', '34', 'is', 'almost', 'certainly', 'a', 'collidingwind', 'binary', 'system', 'its', 'spectrum', 'shows', 'phaserelated', 'changes', 'of', 'luminosity', 'and', 'absorption', 'that', 'are', 'probably', 'related', 'to', 'the', 'orbital', 'dynamics', 'of', 'two', 'of', 'the', 'most', 'massive', 'stars', 'known']] | [-0.09383829639348612, 0.10666745993863527, -0.09304738969548598, 0.10319218085915945, -0.11685378022387728, -0.06533910380350752, 0.05617956630397145, 0.4129263897038918, -0.17685221240227272, -0.3822144074691134, 0.08418184712975306, -0.34253769356210334, -0.06407774274947343, 0.24926733585087568, -0.08303320228115663, -0.01396014931867342, 0.14030815275399, -0.03941589943296113, -0.05388199407086297, -0.3217644752426581, 0.2064273797913448, 0.0924210862427139, 0.12891996834896036, -0.058018149887830335, 0.06011621510671856, -0.03305590821599418, -0.04574947632703494, -0.08334318312516735, -0.07385721072357984, 0.027102942418576123, 0.22892619463634659, 0.14045323105854587, 0.21331421275772935, -0.3443538501200924, -0.17885088322397608, 0.05160151572223961, 0.17756423418462225, -0.05246228565562881, 0.031718067777114334, -0.25300115397870804, 0.048748324890588446, -0.1982812509990877, -0.2050650553953658, 0.08336076477112678, 0.11874087418712857, 0.004856060578168689, -0.1769583274979125, 0.11375199995081793, 0.03633174516091293, 0.10877391809298025, -0.1380909173203945, -0.07574269988157271, -0.04676336126232689, 0.032682670697967126, 0.03658583599722365, 0.10889097534354542, 0.09889065683982172, -0.12073752381578348, -0.06555912371763921, 0.37029728537646833, -0.05177542880048057, 0.14942166415186456, 0.20218965391647983, -0.21141380849506028, -0.15647269153342278, 0.2160369050534364, 0.12171065107548049, 0.15110579952988382, -0.19810072110536006, -0.03428736660699523, -0.024653327524323355, 0.26636289777820343, 0.08294302041779135, 0.07244286580024274, 0.31304387659016814, 0.13277506039370424, 0.058306201219467536, 0.1482712490471093, -0.2854112788507311, -0.044009456456593286, -0.20234104217245028, -0.09928461898222461, -0.14795919199526258, 0.10471496581738177, -0.137941124462836, -0.1398715413976591, 0.36965786613250423, 0.10731096650633336, 0.20327151356219358, 0.0004774445042639346, 0.2795424224479918, 0.10867554334096506, 0.09668939143479915, 0.14505223526091843, 0.34312007430016056, 0.15780860457367465, 0.1266182335606496, -0.2353222343510577, 0.08620225981047208, -0.018945909096286274] |
1,803.00823 | The "No Justice in the Universe" phenomenon: why honesty of effort may
not be rewarded in tournaments | In 2000 Allen Schwenk, using a well-known mathematical model of matchplay
tournaments in which the probability of one player beating another in a single
match is fixed for each pair of players, showed that the classical
single-elimination, seeded format can be "unfair" in the sense that situations
can arise where an indisputibly better (and thus higher seeded) player may have
a smaller probability of winning the tournament than a worse one. This in turn
implies that, if the players are able to influence their seeding in some
preliminary competition, situations can arise where it is in a player's
interest to behave "dishonestly", by deliberately trying to lose a match. This
motivated us to ask whether it is possible for a tournament to be both honest,
meaning that it is impossible for a situation to arise where a rational player
throws a match, and "symmetric" - meaning basically that the rules treat
everyone the same - yet unfair, in the sense that an objectively better player
has a smaller probability of winning than a worse one. After rigorously
defining our terms, our main result is that such tournaments exist and we
construct explicit examples for any number n >= 3 of players. For n=3, we show
(Theorem 3.6) that the collection of win-probability vectors for such
tournaments form a 5-vertex convex polygon in R^3, minus some boundary points.
We conjecture a similar result for any n >= 4 and prove some partial results
towards it.
| math.PR cs.GT math.CO | in 2000 allen schwenk using a wellknown mathematical model of matchplay tournaments in which the probability of one player beating another in a single match is fixed for each pair of players showed that the classical singleelimination seeded format can be unfair in the sense that situations can arise where an indisputibly better and thus higher seeded player may have a smaller probability of winning the tournament than a worse one this in turn implies that if the players are able to influence their seeding in some preliminary competition situations can arise where it is in a players interest to behave dishonestly by deliberately trying to lose a match this motivated us to ask whether it is possible for a tournament to be both honest meaning that it is impossible for a situation to arise where a rational player throws a match and symmetric meaning basically that the rules treat everyone the same yet unfair in the sense that an objectively better player has a smaller probability of winning than a worse one after rigorously defining our terms our main result is that such tournaments exist and we construct explicit examples for any number n 3 of players for n3 we show theorem 36 that the collection of winprobability vectors for such tournaments form a 5vertex convex polygon in r3 minus some boundary points we conjecture a similar result for any n 4 and prove some partial results towards it | [['in', '2000', 'allen', 'schwenk', 'using', 'a', 'wellknown', 'mathematical', 'model', 'of', 'matchplay', 'tournaments', 'in', 'which', 'the', 'probability', 'of', 'one', 'player', 'beating', 'another', 'in', 'a', 'single', 'match', 'is', 'fixed', 'for', 'each', 'pair', 'of', 'players', 'showed', 'that', 'the', 'classical', 'singleelimination', 'seeded', 'format', 'can', 'be', 'unfair', 'in', 'the', 'sense', 'that', 'situations', 'can', 'arise', 'where', 'an', 'indisputibly', 'better', 'and', 'thus', 'higher', 'seeded', 'player', 'may', 'have', 'a', 'smaller', 'probability', 'of', 'winning', 'the', 'tournament', 'than', 'a', 'worse', 'one', 'this', 'in', 'turn', 'implies', 'that', 'if', 'the', 'players', 'are', 'able', 'to', 'influence', 'their', 'seeding', 'in', 'some', 'preliminary', 'competition', 'situations', 'can', 'arise', 'where', 'it', 'is', 'in', 'a', 'players', 'interest', 'to', 'behave', 'dishonestly', 'by', 'deliberately', 'trying', 'to', 'lose', 'a', 'match', 'this', 'motivated', 'us', 'to', 'ask', 'whether', 'it', 'is', 'possible', 'for', 'a', 'tournament', 'to', 'be', 'both', 'honest', 'meaning', 'that', 'it', 'is', 'impossible', 'for', 'a', 'situation', 'to', 'arise', 'where', 'a', 'rational', 'player', 'throws', 'a', 'match', 'and', 'symmetric', 'meaning', 'basically', 'that', 'the', 'rules', 'treat', 'everyone', 'the', 'same', 'yet', 'unfair', 'in', 'the', 'sense', 'that', 'an', 'objectively', 'better', 'player', 'has', 'a', 'smaller', 'probability', 'of', 'winning', 'than', 'a', 'worse', 'one', 'after', 'rigorously', 'defining', 'our', 'terms', 'our', 'main', 'result', 'is', 'that', 'such', 'tournaments', 'exist', 'and', 'we', 'construct', 'explicit', 'examples', 'for', 'any', 'number', 'n', '3', 'of', 'players', 'for', 'n3', 'we', 'show', 'theorem', '36', 'that', 'the', 'collection', 'of', 'winprobability', 'vectors', 'for', 'such', 'tournaments', 'form', 'a', '5vertex', 'convex', 'polygon', 'in', 'r3', 'minus', 'some', 'boundary', 'points', 'we', 'conjecture', 'a', 'similar', 'result', 'for', 'any', 'n', '4', 'and', 'prove', 'some', 'partial', 'results', 'towards', 'it']] | [-0.07468787435012064, 0.10290674989862009, -0.11616218901018344, 0.11733364834404802, -0.08275766233455832, -0.2103956694217987, 0.08791981840415432, 0.3609874917833545, -0.24332206904240963, -0.2838634708107023, 0.08772468119386141, -0.30454091253587817, -0.16326903165324855, 0.15366584726340943, -0.15148920697622428, -0.01265012251284226, 0.07439738072275373, 0.09210379687690382, 0.038272220928713255, -0.3199240233141424, 0.30350990285722035, -0.00902860340962218, 0.20315487850487027, 0.018997972387173292, 0.0818723288218696, -0.0059145167884337956, 0.03453637821149965, 0.06354036128988995, -0.10387418575771597, 0.0576140712690145, 0.28512661571326364, 0.16755915074550026, 0.33365814083934586, -0.40397154058377116, -0.14979285278783763, 0.1839664094564426, 0.12593506692607306, 0.11104414509698134, -0.014026718560440497, -0.2151516868922291, 0.1148284646244404, -0.1662447521092086, -0.1341512884798665, -0.045344871852617964, 0.03224023347286413, -0.014460171013478568, -0.31616120430753347, -0.012975546650260971, 0.11021851176609111, 0.01580811917517429, -0.004910464476008694, -0.12410180666224964, -0.022988124472341675, 0.175599217072516, 0.02191900679598941, 0.06366779067814034, 0.06329287239251721, -0.14328875710351108, -0.15983270967904067, 0.3974447544837781, -0.02226513191148485, -0.21106582716841377, 0.17241816073300917, -0.15424280132313054, -0.14489418272939275, 0.10733458735305279, 0.0930975409050993, 0.12850591636132608, -0.08520169423151193, 0.01615892184436542, -0.14155481838950715, 0.1786463007610094, 0.1527917141951147, 6.755978121595867e-05, 0.15752721535065606, 0.10946670258555845, 0.14554285580108348, 0.11100514529280807, 0.0401297437561818, -0.11502461521457132, -0.2967092150016254, -0.1524174852519675, -0.16950867154292162, 0.06796317266584453, -0.08937001175587993, -0.1530006919135103, 0.35496263369097536, 0.16092523960204266, 0.196281846679902, 0.07526833103511925, 0.25496093370809647, 0.08037569786035219, 0.034229217993955806, 0.09522768406698606, 0.205816193811188, 0.029510520060223103, 0.03860740098407713, -0.13854336725440375, 0.10684977635993796, 0.04893353818797396] |
1,803.00824 | Selection and processing of calibration samples to measure the particle
identification performance of the LHCb experiment in Run 2 | Since 2015, with the restart of the LHC for its second run of data taking,
the LHCb experiment has been empowered with a dedicated computing model to
select and analyse calibration samples to measure the performance of the
particle identification (PID) detectors and algorithms. The novel technique was
developed within the framework of the innovative trigger model of the LHCb
experiment, which relies on online event reconstruction for most of the
datasets, reserving offline reconstruction to special physics cases. The
strategy to select and process the calibration samples, which includes a
dedicated data-processing scheme combining online and offline reconstruction,
is discussed. The use of the calibration samples to measure the detector PID
performance, and the efficiency of PID requirements across a large range of
decay channels, is described. Applications of the calibration samples in
data-quality monitoring and validation procedures are also detailed.
| hep-ex | since 2015 with the restart of the lhc for its second run of data taking the lhcb experiment has been empowered with a dedicated computing model to select and analyse calibration samples to measure the performance of the particle identification pid detectors and algorithms the novel technique was developed within the framework of the innovative trigger model of the lhcb experiment which relies on online event reconstruction for most of the datasets reserving offline reconstruction to special physics cases the strategy to select and process the calibration samples which includes a dedicated dataprocessing scheme combining online and offline reconstruction is discussed the use of the calibration samples to measure the detector pid performance and the efficiency of pid requirements across a large range of decay channels is described applications of the calibration samples in dataquality monitoring and validation procedures are also detailed | [['since', '2015', 'with', 'the', 'restart', 'of', 'the', 'lhc', 'for', 'its', 'second', 'run', 'of', 'data', 'taking', 'the', 'lhcb', 'experiment', 'has', 'been', 'empowered', 'with', 'a', 'dedicated', 'computing', 'model', 'to', 'select', 'and', 'analyse', 'calibration', 'samples', 'to', 'measure', 'the', 'performance', 'of', 'the', 'particle', 'identification', 'pid', 'detectors', 'and', 'algorithms', 'the', 'novel', 'technique', 'was', 'developed', 'within', 'the', 'framework', 'of', 'the', 'innovative', 'trigger', 'model', 'of', 'the', 'lhcb', 'experiment', 'which', 'relies', 'on', 'online', 'event', 'reconstruction', 'for', 'most', 'of', 'the', 'datasets', 'reserving', 'offline', 'reconstruction', 'to', 'special', 'physics', 'cases', 'the', 'strategy', 'to', 'select', 'and', 'process', 'the', 'calibration', 'samples', 'which', 'includes', 'a', 'dedicated', 'dataprocessing', 'scheme', 'combining', 'online', 'and', 'offline', 'reconstruction', 'is', 'discussed', 'the', 'use', 'of', 'the', 'calibration', 'samples', 'to', 'measure', 'the', 'detector', 'pid', 'performance', 'and', 'the', 'efficiency', 'of', 'pid', 'requirements', 'across', 'a', 'large', 'range', 'of', 'decay', 'channels', 'is', 'described', 'applications', 'of', 'the', 'calibration', 'samples', 'in', 'dataquality', 'monitoring', 'and', 'validation', 'procedures', 'are', 'also', 'detailed']] | [-0.029861362785441985, 0.026941123585754508, -0.12025218589467482, 0.040023100061133986, -0.07819700078763278, -0.17056690352562237, 0.03941768907259782, 0.361328148322416, -0.20890508365282842, -0.3975821005600229, 0.13971003867492315, -0.29568432433642183, -0.041386349434951245, 0.21133530995411745, -0.06853229285080091, 0.13980197542204365, 0.13171971855934342, -0.01899134397218135, -0.04678339544113096, -0.2655569164010263, 0.2200027640095689, 0.15825380430832295, 0.3285815709313168, -0.008172304828611898, 0.14528902405856545, 0.038894095281007846, -0.11936735655476248, -0.02114877677070927, -0.11699030127599311, 0.09465216407117853, 0.29257812673016126, 0.20485306693680427, 0.24550094921141863, -0.3582595934120702, -0.15412485052529776, 0.1077269310603889, 0.08429712054449212, 0.05112679934112312, -0.08707681258002453, -0.3098382450194216, 0.09090226220006359, -0.1815798850336545, -0.05886444690617615, -0.06952592929248029, -0.018061884655945108, 0.005403304315159019, -0.32596246271171203, 0.012769343175484248, -0.01382638376802993, 0.0416061877089382, -0.026486507431912634, -0.1272970565338947, 0.060234715032365015, 0.13562144769001488, 0.02337968897900026, -0.0021150804339567014, 0.16560671653952713, -0.12999266916623628, -0.17122353877032725, 0.3284408056364119, 0.001840226355494118, -0.15687222231809103, 0.19286613808420133, -0.10410013305626704, -0.12870653684277245, 0.12613212069066923, 0.2397244768938653, 0.09042927723141833, -0.2226703868798492, 0.05931724017756724, 0.043852475078278025, 0.1713753286421194, 0.003456459192126255, 0.021632195069966182, 0.10263655897767716, 0.2871038473644097, 0.06104604210819341, 0.13146961871928103, -0.15910231059377777, -0.06025062517499105, -0.32397956297155733, -0.15519630185551417, -0.18173911774524448, -0.06516061730774671, -0.037827814221882236, -0.13170556456152296, 0.42038313634488156, 0.16745771010222674, 0.16749902548675072, 0.008140617355000896, 0.34912812211354016, 0.06196920819987189, 0.1013486659069034, 0.026171928927512238, 0.27863782759211486, 0.07161282576998929, 0.15853564812093449, -0.2066709261904487, 0.07626451713256013, 0.036022169890970936] |
1,803.00825 | Inclusive electron-nucleus cross section within the Self Consistent
Green's Function approach | We compute inclusive electron-nucleus cross sections using ab initio spectral
functions of $^4$He and $^{16}$O obtained within the Self Consistent Green's
Function approach. The formalism adopted is based on the factorization of the
spectral function and the nuclear transition matrix elements. This allows to
provide an accurate description of nuclear dynamics and to account for
relativistic effects in the interaction vertex. Our calculations use a
saturating chiral Hamiltonian in order reproduce the correct nuclear sizes.
When final state interactions for the struck particle are accounted for, we
find nice agreement between the data and the theory for the inclusive
electron-$^{16}$O cross section. The results lay the foundations for future
applications of the Self Consistent Green's Function method, in both closed and
open shell nuclei, to neutrino data analysis.
This work also presents results for the point-proton, charge and
single-nucleon momentum distribution of the same two nuclei. The center of mass
can affect these quantities for light nuclei and cannot be separated cleanly in
most ab initio post-Hartree-Fock methods. In order to address this, we
developed a Metropolis Monte Carlo calculation in which the center of mass
coordinate can be subtracted exactly from the trial wave function and the
expectation values. We gauged this effect for $^4$He by removing the center of
mass effect from the Optimal Reference State wave function that is generated
during the Self Consistent Green's Function calculations. Our findings clearly
indicate that the residual center of mass contribution strongly modifies
calculated matter distributions with respect to those obtained in the intrinsic
frame. Hence, its subtraction is crucial for a correct description of light
nuclei.
| nucl-th hep-ex nucl-ex | we compute inclusive electronnucleus cross sections using ab initio spectral functions of 4he and 16o obtained within the self consistent greens function approach the formalism adopted is based on the factorization of the spectral function and the nuclear transition matrix elements this allows to provide an accurate description of nuclear dynamics and to account for relativistic effects in the interaction vertex our calculations use a saturating chiral hamiltonian in order reproduce the correct nuclear sizes when final state interactions for the struck particle are accounted for we find nice agreement between the data and the theory for the inclusive electron16o cross section the results lay the foundations for future applications of the self consistent greens function method in both closed and open shell nuclei to neutrino data analysis this work also presents results for the pointproton charge and singlenucleon momentum distribution of the same two nuclei the center of mass can affect these quantities for light nuclei and cannot be separated cleanly in most ab initio posthartreefock methods in order to address this we developed a metropolis monte carlo calculation in which the center of mass coordinate can be subtracted exactly from the trial wave function and the expectation values we gauged this effect for 4he by removing the center of mass effect from the optimal reference state wave function that is generated during the self consistent greens function calculations our findings clearly indicate that the residual center of mass contribution strongly modifies calculated matter distributions with respect to those obtained in the intrinsic frame hence its subtraction is crucial for a correct description of light nuclei | [['we', 'compute', 'inclusive', 'electronnucleus', 'cross', 'sections', 'using', 'ab', 'initio', 'spectral', 'functions', 'of', '4he', 'and', '16o', 'obtained', 'within', 'the', 'self', 'consistent', 'greens', 'function', 'approach', 'the', 'formalism', 'adopted', 'is', 'based', 'on', 'the', 'factorization', 'of', 'the', 'spectral', 'function', 'and', 'the', 'nuclear', 'transition', 'matrix', 'elements', 'this', 'allows', 'to', 'provide', 'an', 'accurate', 'description', 'of', 'nuclear', 'dynamics', 'and', 'to', 'account', 'for', 'relativistic', 'effects', 'in', 'the', 'interaction', 'vertex', 'our', 'calculations', 'use', 'a', 'saturating', 'chiral', 'hamiltonian', 'in', 'order', 'reproduce', 'the', 'correct', 'nuclear', 'sizes', 'when', 'final', 'state', 'interactions', 'for', 'the', 'struck', 'particle', 'are', 'accounted', 'for', 'we', 'find', 'nice', 'agreement', 'between', 'the', 'data', 'and', 'the', 'theory', 'for', 'the', 'inclusive', 'electron16o', 'cross', 'section', 'the', 'results', 'lay', 'the', 'foundations', 'for', 'future', 'applications', 'of', 'the', 'self', 'consistent', 'greens', 'function', 'method', 'in', 'both', 'closed', 'and', 'open', 'shell', 'nuclei', 'to', 'neutrino', 'data', 'analysis', 'this', 'work', 'also', 'presents', 'results', 'for', 'the', 'pointproton', 'charge', 'and', 'singlenucleon', 'momentum', 'distribution', 'of', 'the', 'same', 'two', 'nuclei', 'the', 'center', 'of', 'mass', 'can', 'affect', 'these', 'quantities', 'for', 'light', 'nuclei', 'and', 'can', 'not', 'be', 'separated', 'cleanly', 'in', 'most', 'ab', 'initio', 'posthartreefock', 'methods', 'in', 'order', 'to', 'address', 'this', 'we', 'developed', 'a', 'metropolis', 'monte', 'carlo', 'calculation', 'in', 'which', 'the', 'center', 'of', 'mass', 'coordinate', 'can', 'be', 'subtracted', 'exactly', 'from', 'the', 'trial', 'wave', 'function', 'and', 'the', 'expectation', 'values', 'we', 'gauged', 'this', 'effect', 'for', '4he', 'by', 'removing', 'the', 'center', 'of', 'mass', 'effect', 'from', 'the', 'optimal', 'reference', 'state', 'wave', 'function', 'that', 'is', 'generated', 'during', 'the', 'self', 'consistent', 'greens', 'function', 'calculations', 'our', 'findings', 'clearly', 'indicate', 'that', 'the', 'residual', 'center', 'of', 'mass', 'contribution', 'strongly', 'modifies', 'calculated', 'matter', 'distributions', 'with', 'respect', 'to', 'those', 'obtained', 'in', 'the', 'intrinsic', 'frame', 'hence', 'its', 'subtraction', 'is', 'crucial', 'for', 'a', 'correct', 'description', 'of', 'light', 'nuclei']] | [-0.03976593478425835, 0.1216378589217967, -0.1263869958842515, 0.12559123672954808, -0.007429023102372327, -0.059168908148585414, 0.026034331860889295, 0.38034863413524317, -0.21330223613146568, -0.27686473827970337, -0.01607690940563975, -0.3087775676210052, -0.0740820067464725, 0.16850112151042365, 0.043039082831176426, 0.05953171751742061, 0.07197272332781082, 0.008359986241520574, -0.12189812626827452, -0.16316390527265795, 0.32297626386696565, 0.0853076614038356, 0.24766258967339239, 0.10544294863939285, 0.0668938476618463, 0.08085940691401784, -0.0364474872360878, 0.009719037867677903, -0.12705198796621867, 0.10013092944681058, 0.24965033788440666, 0.07110602436901144, 0.18086923467787158, -0.4398552008349909, -0.17623035853235086, 0.08673370221528584, 0.15043992972461862, 0.1547775512699854, -0.06936533909948536, -0.2574187250997983, 0.05350484803021617, -0.20207693383851077, -0.177486842315058, -0.0933492324090029, 0.012236312127668647, 0.029622040511316478, -0.2737599177678876, 0.09055846404144278, -0.02644004795154424, -0.0036949399060919384, -0.12110071101863362, -0.18163514857037405, -0.02998884707473023, 0.10802921898497796, 0.04013004739662416, 0.07567480636201625, 0.17823424696406062, -0.11861656817358182, -0.07933684018499843, 0.382248516811916, -0.04723723424155586, -0.182684612165254, 0.10697233979067022, -0.17306207963143394, -0.12921434678250665, 0.1465478093870863, 0.14603155571356946, 0.11605934196845925, -0.18271067142531264, 0.07934655510464662, -0.004278702591524079, 0.16695511404055166, 0.008916432300429052, 0.020076884550393657, 0.19383764655716465, 0.1435254358482453, -0.011166811575380605, 0.061814342035078323, -0.09907459166539268, -0.12779541978479994, -0.3375742697760407, -0.11595062355710421, -0.17281459493053317, 0.024128092095299015, -0.0724038842813485, -0.13907468428203926, 0.39472087752422813, 0.14270595721255164, 0.211628556396282, 0.03017169860503828, 0.30664235758263797, 0.13015177727948127, 0.07069421121466919, 0.06083800166815673, 0.2920660216104909, 0.1719746777939537, 0.034994234465244, -0.27685648279634306, 0.04503671786388599, 0.0736846680890713] |
1,803.00826 | Switching of the Chiral Magnetic Domains in the Hybrid Multiferroic
(ND4)2[FeCl5(D2O)] | Neutron spherical polarimetry, which is directly sensitive to the absolute
magnetic configuration and domain population, has been used in this work to
unambiguously prove the multiferroicity of (ND4)2[FeCl5(D2O)]. We demonstrate
that the application of an electric field upon cooling results in the
stabilization of a single-cycloidal magnetic domain below 6.9 K, while poling
in the opposite electric field direction produces the full population of the
domain with opposite magnetic chirality. We prove the complete switchability of
the magnetic domains at low temperature by the applied electric field, which
constitutes a direct proof of the strong magnetoelectric coupling.
Additionally, we refine the magnetic structure of the ordered ground state,
determining the underlying magnetic space group consistent with the direction
of the ferroelectric polarization, and we provide evidence of a collinear
amplitude-modulated state with magnetic moments along the a-axis in the
temperature region between 6.9 and 7.2 K.
| cond-mat.mtrl-sci cond-mat.str-el | neutron spherical polarimetry which is directly sensitive to the absolute magnetic configuration and domain population has been used in this work to unambiguously prove the multiferroicity of nd42fecl5d2o we demonstrate that the application of an electric field upon cooling results in the stabilization of a singlecycloidal magnetic domain below 69 k while poling in the opposite electric field direction produces the full population of the domain with opposite magnetic chirality we prove the complete switchability of the magnetic domains at low temperature by the applied electric field which constitutes a direct proof of the strong magnetoelectric coupling additionally we refine the magnetic structure of the ordered ground state determining the underlying magnetic space group consistent with the direction of the ferroelectric polarization and we provide evidence of a collinear amplitudemodulated state with magnetic moments along the aaxis in the temperature region between 69 and 72 k | [['neutron', 'spherical', 'polarimetry', 'which', 'is', 'directly', 'sensitive', 'to', 'the', 'absolute', 'magnetic', 'configuration', 'and', 'domain', 'population', 'has', 'been', 'used', 'in', 'this', 'work', 'to', 'unambiguously', 'prove', 'the', 'multiferroicity', 'of', 'nd42fecl5d2o', 'we', 'demonstrate', 'that', 'the', 'application', 'of', 'an', 'electric', 'field', 'upon', 'cooling', 'results', 'in', 'the', 'stabilization', 'of', 'a', 'singlecycloidal', 'magnetic', 'domain', 'below', '69', 'k', 'while', 'poling', 'in', 'the', 'opposite', 'electric', 'field', 'direction', 'produces', 'the', 'full', 'population', 'of', 'the', 'domain', 'with', 'opposite', 'magnetic', 'chirality', 'we', 'prove', 'the', 'complete', 'switchability', 'of', 'the', 'magnetic', 'domains', 'at', 'low', 'temperature', 'by', 'the', 'applied', 'electric', 'field', 'which', 'constitutes', 'a', 'direct', 'proof', 'of', 'the', 'strong', 'magnetoelectric', 'coupling', 'additionally', 'we', 'refine', 'the', 'magnetic', 'structure', 'of', 'the', 'ordered', 'ground', 'state', 'determining', 'the', 'underlying', 'magnetic', 'space', 'group', 'consistent', 'with', 'the', 'direction', 'of', 'the', 'ferroelectric', 'polarization', 'and', 'we', 'provide', 'evidence', 'of', 'a', 'collinear', 'amplitudemodulated', 'state', 'with', 'magnetic', 'moments', 'along', 'the', 'aaxis', 'in', 'the', 'temperature', 'region', 'between', '69', 'and', '72', 'k']] | [-0.17863518074025503, 0.17788761637600853, -0.03088715502558949, -0.008989500851991275, -0.10566404249241007, -0.026748153190257855, 0.07077199550500761, 0.42635692190378904, -0.25931507122004405, -0.32285691584305215, 0.046073846069500886, -0.22255423912752625, -0.05155821352188165, 0.17410715012293723, 0.0474837298269348, -0.04582151895172299, -0.03834580291552609, 0.06271461064675855, -0.060176537554879256, -0.16775818123682662, 0.2890958768936495, -0.002408587062948047, 0.32630329035843414, 0.07887791354571366, 0.08653523284010589, 0.012839425429572456, 0.07696316796096249, 0.051604234697353805, -0.10257131343299382, 0.07859822890734197, 0.1902177417327443, -0.010885320628100695, 0.2054991359165999, -0.4243841506411425, -0.1678906307529865, 0.06196365783236817, 0.12365398434404698, 0.14114052795533402, -0.0686450353168766, -0.29425233158852077, 0.08011458216383795, -0.08685497208433743, -0.17815052863766645, -0.09970901614158517, 0.004114390123706673, 0.02004967091367386, -0.2873926453551879, 0.062117993980387434, 0.10600221529279628, 0.12668032155811992, -0.15677241465406647, -0.1310037526418455, -0.04366984969399507, 0.08001959633677164, 0.09215795873347411, 0.14664056068350975, 0.1331170949625731, -0.1242620180875949, -0.12391864187116476, 0.303805362193897, -0.07502843650258405, -0.0965705230870905, 0.13727798235938987, -0.2435485936293844, -0.0792801940875102, 0.16910407515630746, 0.12573670021407046, 0.13850595442474717, -0.0944691195412209, 0.0859144634780225, -0.022098396316222433, 0.18255332459941404, 0.03675700920737452, 0.017544348040246405, 0.2614170615900851, 0.1505058848205307, 0.08270506571150488, 0.17452659575145743, -0.14864824492057474, -0.03635511214249871, -0.2707753650255553, -0.1706449950191503, -0.18634994261083193, 0.046659227399181366, -0.0979802114681863, -0.17136449150307775, 0.4102386384167605, 0.16764477291629495, 0.16158773050281322, -0.0568391101405723, 0.288589645552242, 0.07834855503056638, 0.05650909094967776, 0.059238842027197175, 0.29920305902810973, 0.23263203746884958, 0.14190554020296986, -0.29618751107934965, 0.07087734120108911, -0.0004618727002202326] |
1,803.00827 | Differentiation and regularity of semi-discrete optimal transport with
respect to the parameters of the discrete measure | This paper aims at determining under which conditions the semi-discrete
optimal transport is twice differentiable with respect to the parameters of the
discrete measure and exhibits numerical applications. The discussion focuses on
minimal conditions on the background measure to ensure differentiability. We
provide numerical illustrations in stippling and blue noise problems.
| math.NA | this paper aims at determining under which conditions the semidiscrete optimal transport is twice differentiable with respect to the parameters of the discrete measure and exhibits numerical applications the discussion focuses on minimal conditions on the background measure to ensure differentiability we provide numerical illustrations in stippling and blue noise problems | [['this', 'paper', 'aims', 'at', 'determining', 'under', 'which', 'conditions', 'the', 'semidiscrete', 'optimal', 'transport', 'is', 'twice', 'differentiable', 'with', 'respect', 'to', 'the', 'parameters', 'of', 'the', 'discrete', 'measure', 'and', 'exhibits', 'numerical', 'applications', 'the', 'discussion', 'focuses', 'on', 'minimal', 'conditions', 'on', 'the', 'background', 'measure', 'to', 'ensure', 'differentiability', 'we', 'provide', 'numerical', 'illustrations', 'in', 'stippling', 'and', 'blue', 'noise', 'problems']] | [-0.10400923493080864, 0.033626551648565366, -0.08003070115056984, 0.06231743805840904, -0.0763449461345433, -0.10070193865719963, 0.02440601470651945, 0.4105716942006028, -0.2501724354840596, -0.258823169665822, 0.17818150717500306, -0.2787835877776767, -0.14235126975850732, 0.20279091470600927, -0.1593486745750495, 0.11734682211524569, 0.06906511477363357, 0.015136690002834132, -0.13559527377433636, -0.2404421491950166, 0.32969463481476496, 0.07466588067073449, 0.30348822927358104, 0.09557808531498463, 0.16315973164769365, -0.0567713934544693, -0.08918727397480432, -0.03452877618153306, -0.21752757467694728, 0.07695599323978611, 0.22507524464790726, 0.07995459322781101, 0.3072848391591334, -0.39454975430214523, -0.16675838685649283, 0.10560899510906607, 0.06825958318350946, 0.02078449129647411, -0.04981433945781022, -0.2592692609474647, 0.11947753575320046, -0.022952602044040083, -0.16059336217814216, -0.08178511831233752, -0.03554312625498164, 0.06760996587428392, -0.3114047545537937, 0.049835207634696774, 0.030486982589697138, 0.0744862549335641, -0.08599337501743552, -0.06932181689669104, -0.00956522802110104, 0.08055769968047446, 0.06500718849893733, -0.017924206778772322, 0.11189287007950685, -0.09202542191133926, -0.059091739251515736, 0.3991294096717063, -0.0681870411351031, -0.2759774100108474, 0.22876188407341638, -0.10755678605945672, -0.13090635366810888, 0.10944375766477749, 0.18106109196064518, 0.12078737558833524, -0.17204036154583388, 0.0962461125009748, -0.01929338909137775, 0.14679909632632546, 0.055099283550482464, 0.06930174559866097, 0.1274736086089237, 0.19440898664441764, 0.19801537761939506, 0.17998676997262472, -0.0413699117055455, -0.11094446632755446, -0.3661518371572681, -0.10927314550488018, -0.13770217987179173, 0.01272975448884216, -0.08352100980575379, -0.18318811836926377, 0.4201128111750472, 0.19190311641888877, 0.15682114494562732, 0.08422969394208242, 0.28549068362689484, 0.16255740817709297, -0.02970310427960666, 0.09415264775538269, 0.1893508923970455, 0.1469942243934116, 0.09494339255844335, -0.22762193365533853, 0.07443210866996179, 0.067127413883367] |
1,803.00828 | Experimental Observation of Acoustic Weyl Points and Topological Surface
States | Weyl points emerge as topological monopoles of Berry flux in the
three-dimensional (3D) momentum space and have been extensively studied in
topological semimetals. As the underlying topological principles apply to any
type of waves under periodic boundary conditions, Weyl points can also be
realized in classical wave systems, which are easier to engineer compared to
condensed matter materials. Here, we made an acoustic Weyl phononic crystal by
breaking space inversion (P) symmetry using a combination of slanted acoustic
waveguides. We conducted angle-resolved transmission measurements to
characterize the acoustic Weyl points. We also experimentally confirmed the
existence of acoustic "Fermi arcs" and demonstrated robust one-way acoustic
transport, where the surface waves can overcome a step barrier without
reflection. This work lays a solid foundation for the basic research in 3D
topological acoustic effects.
| cond-mat.mes-hall | weyl points emerge as topological monopoles of berry flux in the threedimensional 3d momentum space and have been extensively studied in topological semimetals as the underlying topological principles apply to any type of waves under periodic boundary conditions weyl points can also be realized in classical wave systems which are easier to engineer compared to condensed matter materials here we made an acoustic weyl phononic crystal by breaking space inversion p symmetry using a combination of slanted acoustic waveguides we conducted angleresolved transmission measurements to characterize the acoustic weyl points we also experimentally confirmed the existence of acoustic fermi arcs and demonstrated robust oneway acoustic transport where the surface waves can overcome a step barrier without reflection this work lays a solid foundation for the basic research in 3d topological acoustic effects | [['weyl', 'points', 'emerge', 'as', 'topological', 'monopoles', 'of', 'berry', 'flux', 'in', 'the', 'threedimensional', '3d', 'momentum', 'space', 'and', 'have', 'been', 'extensively', 'studied', 'in', 'topological', 'semimetals', 'as', 'the', 'underlying', 'topological', 'principles', 'apply', 'to', 'any', 'type', 'of', 'waves', 'under', 'periodic', 'boundary', 'conditions', 'weyl', 'points', 'can', 'also', 'be', 'realized', 'in', 'classical', 'wave', 'systems', 'which', 'are', 'easier', 'to', 'engineer', 'compared', 'to', 'condensed', 'matter', 'materials', 'here', 'we', 'made', 'an', 'acoustic', 'weyl', 'phononic', 'crystal', 'by', 'breaking', 'space', 'inversion', 'p', 'symmetry', 'using', 'a', 'combination', 'of', 'slanted', 'acoustic', 'waveguides', 'we', 'conducted', 'angleresolved', 'transmission', 'measurements', 'to', 'characterize', 'the', 'acoustic', 'weyl', 'points', 'we', 'also', 'experimentally', 'confirmed', 'the', 'existence', 'of', 'acoustic', 'fermi', 'arcs', 'and', 'demonstrated', 'robust', 'oneway', 'acoustic', 'transport', 'where', 'the', 'surface', 'waves', 'can', 'overcome', 'a', 'step', 'barrier', 'without', 'reflection', 'this', 'work', 'lays', 'a', 'solid', 'foundation', 'for', 'the', 'basic', 'research', 'in', '3d', 'topological', 'acoustic', 'effects']] | [-0.19694475469816208, 0.20703980775479894, -0.06337452587004835, 0.041336131785735204, -0.16666251078960626, -0.1530532644193789, 0.06360678323615117, 0.3866914179825196, -0.28189196519088, -0.23748777524892692, 0.04511035435081629, -0.2812234443527731, -0.20719623062794915, 0.2038666566844437, -0.0030345228027947473, 0.1444822288396994, -0.030603918260153892, -0.05190228646141336, -0.11966916881007791, -0.18695055173575933, 0.32191939164432837, 0.0031971554942146845, 0.3655479788307496, 0.03611875404242186, 0.044061196629296646, -0.015268140135572828, 0.05623584384253869, 0.04943200697986564, -0.15953020707379575, 0.07534060507102615, 0.29298405499007046, -0.06424354699574354, 0.1703018075504312, -0.5126543274205743, -0.3323180636842594, 0.04657506765303851, 0.15607848599382013, 0.17485549560528438, -0.1095775336178838, -0.3547918179890875, 0.06037350712964932, -0.10105155173082356, -0.17375074546770053, -0.10449596625668081, -0.014739583835541976, -0.06211931237626369, -0.14130050590205373, 0.04470285932334126, 0.02730602529746565, 0.10163312494952345, -0.09580435336454574, -0.03294141248228367, -0.10171866286404882, 0.06721373091832819, 0.011165330024210341, -0.01383790911076534, 0.07533832999373165, -0.07935547076781266, -0.16840342473535036, 0.43267139274570526, -0.027498831372764525, -0.19325042069734386, 0.17506587418911018, -0.11843461306257681, -0.05953546398615634, 0.13120811697885845, 0.18666446337672163, 0.06916659735989841, -0.11401145730280515, 0.08482644823291621, -0.04508113229519839, 0.09903619138199385, 0.10579739998193514, 0.06157914205510734, 0.27809295657260175, 0.15490736339283598, 0.049837908187217894, 0.12847250485422343, -0.13668567266590384, 0.026267408767263547, -0.31005617224780674, -0.2141794355896612, -0.2738199793472604, 0.037014464318913684, 0.008561153606658054, -0.19927944084206087, 0.41959297814702784, 0.1300053763618714, 0.16735144497325757, -0.05938832957921973, 0.2500483428946499, 0.08786338482097948, 0.07312676701765282, 0.05344855459406972, 0.2717904052644206, 0.15070506471039896, 0.10648921727216944, -0.23099372479500194, -0.01459018462760882, 0.0834175317766935] |
1,803.00829 | Independence number and the number of maximum independent sets in
pseudofractal scale-free web and Sierpi\'nski gasket | As a fundamental subject of theoretical computer science, the maximum
independent set (MIS) problem not only is of purely theoretical interest, but
also has found wide applications in various fields. However, for a general
graph determining the size of a MIS is NP-hard, and exact computation of the
number of all MISs is even more difficult. It is thus of significant interest
to seek special graphs for which the MIS problem can be exactly solved. In this
paper, we address the MIS problem in the pseudofractal scale-free web and the
Sierpi\'nski gasket, which have the same number of vertices and edges. For both
graphs, we determine exactly the independence number and the number of all
possible MISs. The independence number of the pseudofractal scale-free web is
as twice as the one of the Sierpi\'nski gasket. Moreover, the pseudofractal
scale-free web has a unique MIS, while the number of MISs in the Sierpi\'nski
gasket grows exponentially with the number of vertices.
| cs.DS cs.SI | as a fundamental subject of theoretical computer science the maximum independent set mis problem not only is of purely theoretical interest but also has found wide applications in various fields however for a general graph determining the size of a mis is nphard and exact computation of the number of all miss is even more difficult it is thus of significant interest to seek special graphs for which the mis problem can be exactly solved in this paper we address the mis problem in the pseudofractal scalefree web and the sierpinski gasket which have the same number of vertices and edges for both graphs we determine exactly the independence number and the number of all possible miss the independence number of the pseudofractal scalefree web is as twice as the one of the sierpinski gasket moreover the pseudofractal scalefree web has a unique mis while the number of miss in the sierpinski gasket grows exponentially with the number of vertices | [['as', 'a', 'fundamental', 'subject', 'of', 'theoretical', 'computer', 'science', 'the', 'maximum', 'independent', 'set', 'mis', 'problem', 'not', 'only', 'is', 'of', 'purely', 'theoretical', 'interest', 'but', 'also', 'has', 'found', 'wide', 'applications', 'in', 'various', 'fields', 'however', 'for', 'a', 'general', 'graph', 'determining', 'the', 'size', 'of', 'a', 'mis', 'is', 'nphard', 'and', 'exact', 'computation', 'of', 'the', 'number', 'of', 'all', 'miss', 'is', 'even', 'more', 'difficult', 'it', 'is', 'thus', 'of', 'significant', 'interest', 'to', 'seek', 'special', 'graphs', 'for', 'which', 'the', 'mis', 'problem', 'can', 'be', 'exactly', 'solved', 'in', 'this', 'paper', 'we', 'address', 'the', 'mis', 'problem', 'in', 'the', 'pseudofractal', 'scalefree', 'web', 'and', 'the', 'sierpinski', 'gasket', 'which', 'have', 'the', 'same', 'number', 'of', 'vertices', 'and', 'edges', 'for', 'both', 'graphs', 'we', 'determine', 'exactly', 'the', 'independence', 'number', 'and', 'the', 'number', 'of', 'all', 'possible', 'miss', 'the', 'independence', 'number', 'of', 'the', 'pseudofractal', 'scalefree', 'web', 'is', 'as', 'twice', 'as', 'the', 'one', 'of', 'the', 'sierpinski', 'gasket', 'moreover', 'the', 'pseudofractal', 'scalefree', 'web', 'has', 'a', 'unique', 'mis', 'while', 'the', 'number', 'of', 'miss', 'in', 'the', 'sierpinski', 'gasket', 'grows', 'exponentially', 'with', 'the', 'number', 'of', 'vertices']] | [-0.14748814650884015, 0.09994942214107141, -0.020059554482577367, 0.05970932068012189, -0.09547005032072775, -0.11805654617492109, 0.03384913771733409, 0.3329425760777667, -0.2627098719909554, -0.3649927916005254, 0.120872084569055, -0.2925319140209467, -0.16380994722712786, 0.1831000646285247, -0.05726673358276457, 0.08702726050250931, 0.04590191990662333, 0.09827817883051466, 0.05489324719928845, -0.3323177189895432, 0.26717548884189457, 0.028045702577219344, 0.26798951742821375, 0.0751256523974007, 0.04208085616119206, 0.01958284315187484, -0.011018258859985508, 0.10561994982999749, -0.13283466439606856, 0.09018519434976043, 0.24820929946872639, 0.17538710434923815, 0.28296896676765754, -0.39775054588681086, -0.17799883750267326, 0.18790811290673445, 0.178172908610577, 0.08492261011124355, -0.0010473736930180166, -0.18943026263295906, 0.10908984692068771, -0.10631406849570339, -0.10388542017608415, -0.002799257359583862, 0.10098390578932595, 0.028230751464798233, -0.2202177621453302, 0.023455291047685022, 0.08017433230197639, 0.03620308698300505, 0.05004244810115779, -0.12675572454390932, -0.04106154839610099, 0.16572144322562962, 0.013728272240587102, 0.026498539343447192, 0.05325648880098015, -0.16348103139171144, -0.14626610583945876, 0.40701368234003893, 0.038601329375524074, -0.1874992670112988, 0.16226938557811083, -0.1149700147623662, -0.18702277274569495, 0.1254818817607884, 0.15468895474914462, 0.12610560085158795, -0.1501526741310954, 0.15868192860361888, -0.13975048868451267, 0.1254557276144624, 0.10339817757485434, 0.03428501413181948, 0.14654029681696557, 0.1927230723813409, 0.1462423397184466, 0.16186765734528308, -0.010546848573721946, -0.08089188035410189, -0.25218281092238615, -0.1170836754146876, -0.27418057036265964, 0.04533629494262641, -0.17126581630400323, -0.24658238157862797, 0.41660406580922427, 0.1699736148613738, 0.1986219539976446, 0.08431354614294832, 0.23125003043096512, 0.08112589604579626, 0.061017467587953435, 0.14829873162962032, 0.1838966444367543, 0.11010592382226606, 0.06364878211898031, -0.1477471812424483, 0.10341041924693854, 0.06010784970130771] |
1,803.0083 | Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with
Category Shift | Unsupervised domain adaptation (UDA) conventionally assumes labeled source
samples coming from a single underlying source distribution. Whereas in
practical scenario, labeled data are typically collected from diverse sources.
The multiple sources are different not only from the target but also from each
other, thus, domain adaptater should not be modeled in the same way. Moreover,
those sources may not completely share their categories, which further brings a
new transfer challenge called category shift. In this paper, we propose a deep
cocktail network (DCTN) to battle the domain and category shifts among multiple
sources. Motivated by the theoretical results in \cite{mansour2009domain}, the
target distribution can be represented as the weighted combination of source
distributions, and, the multi-source unsupervised domain adaptation via DCTN is
then performed as two alternating steps: i) It deploys multi-way adversarial
learning to minimize the discrepancy between the target and each of the
multiple source domains, which also obtains the source-specific perplexity
scores to denote the possibilities that a target sample belongs to different
source domains. ii) The multi-source category classifiers are integrated with
the perplexity scores to classify target sample, and the pseudo-labeled target
samples together with source samples are utilized to update the multi-source
category classifier and the feature extractor. We evaluate DCTN in three domain
adaptation benchmarks, which clearly demonstrate the superiority of our
framework.
| cs.LG cs.CV | unsupervised domain adaptation uda conventionally assumes labeled source samples coming from a single underlying source distribution whereas in practical scenario labeled data are typically collected from diverse sources the multiple sources are different not only from the target but also from each other thus domain adaptater should not be modeled in the same way moreover those sources may not completely share their categories which further brings a new transfer challenge called category shift in this paper we propose a deep cocktail network dctn to battle the domain and category shifts among multiple sources motivated by the theoretical results in citemansour2009domain the target distribution can be represented as the weighted combination of source distributions and the multisource unsupervised domain adaptation via dctn is then performed as two alternating steps i it deploys multiway adversarial learning to minimize the discrepancy between the target and each of the multiple source domains which also obtains the sourcespecific perplexity scores to denote the possibilities that a target sample belongs to different source domains ii the multisource category classifiers are integrated with the perplexity scores to classify target sample and the pseudolabeled target samples together with source samples are utilized to update the multisource category classifier and the feature extractor we evaluate dctn in three domain adaptation benchmarks which clearly demonstrate the superiority of our framework | [['unsupervised', 'domain', 'adaptation', 'uda', 'conventionally', 'assumes', 'labeled', 'source', 'samples', 'coming', 'from', 'a', 'single', 'underlying', 'source', 'distribution', 'whereas', 'in', 'practical', 'scenario', 'labeled', 'data', 'are', 'typically', 'collected', 'from', 'diverse', 'sources', 'the', 'multiple', 'sources', 'are', 'different', 'not', 'only', 'from', 'the', 'target', 'but', 'also', 'from', 'each', 'other', 'thus', 'domain', 'adaptater', 'should', 'not', 'be', 'modeled', 'in', 'the', 'same', 'way', 'moreover', 'those', 'sources', 'may', 'not', 'completely', 'share', 'their', 'categories', 'which', 'further', 'brings', 'a', 'new', 'transfer', 'challenge', 'called', 'category', 'shift', 'in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'cocktail', 'network', 'dctn', 'to', 'battle', 'the', 'domain', 'and', 'category', 'shifts', 'among', 'multiple', 'sources', 'motivated', 'by', 'the', 'theoretical', 'results', 'in', 'citemansour2009domain', 'the', 'target', 'distribution', 'can', 'be', 'represented', 'as', 'the', 'weighted', 'combination', 'of', 'source', 'distributions', 'and', 'the', 'multisource', 'unsupervised', 'domain', 'adaptation', 'via', 'dctn', 'is', 'then', 'performed', 'as', 'two', 'alternating', 'steps', 'i', 'it', 'deploys', 'multiway', 'adversarial', 'learning', 'to', 'minimize', 'the', 'discrepancy', 'between', 'the', 'target', 'and', 'each', 'of', 'the', 'multiple', 'source', 'domains', 'which', 'also', 'obtains', 'the', 'sourcespecific', 'perplexity', 'scores', 'to', 'denote', 'the', 'possibilities', 'that', 'a', 'target', 'sample', 'belongs', 'to', 'different', 'source', 'domains', 'ii', 'the', 'multisource', 'category', 'classifiers', 'are', 'integrated', 'with', 'the', 'perplexity', 'scores', 'to', 'classify', 'target', 'sample', 'and', 'the', 'pseudolabeled', 'target', 'samples', 'together', 'with', 'source', 'samples', 'are', 'utilized', 'to', 'update', 'the', 'multisource', 'category', 'classifier', 'and', 'the', 'feature', 'extractor', 'we', 'evaluate', 'dctn', 'in', 'three', 'domain', 'adaptation', 'benchmarks', 'which', 'clearly', 'demonstrate', 'the', 'superiority', 'of', 'our', 'framework']] | [-0.02289427446074348, 0.025738288860964596, -0.06456678575801945, 0.06573255462417114, -0.1321512803695925, -0.16365189316955933, 0.06821233410988464, 0.4576615146233128, -0.33230135410408906, -0.33105877861636906, 0.06172229416632102, -0.30156000418195483, -0.07502964661625393, 0.1700420947752785, -0.11614196801797376, 0.005730324478204781, 0.09667141608244509, 0.04765668338369749, -0.02464015228746442, -0.237858168406993, 0.36392901048658055, 0.010187208198983897, 0.3639837699352738, -0.011922175756766708, 0.10306991690208007, -0.04466767069764025, -0.05547204024773604, 0.0016511131719891153, -0.003832320583544494, 0.15081008600173604, 0.33237649704577454, 0.1855277698081192, 0.26830841597156824, -0.3472169037059098, -0.2346478349116947, 0.13141003703920667, 0.15529750887765933, 0.1048225909936105, -0.03107527826876388, -0.3423167459598375, 0.08486732998659936, -0.17049899073680777, 0.013014891317302208, -0.046809258491629646, -0.03791501572987902, 0.032086796693315885, -0.29216106391272617, 0.02507947680648254, 0.058745053184534844, 0.027339082585066694, -0.0865809772496855, -0.14779486828654526, -0.0017959300050546132, 0.18908957989433559, 0.01670437186172471, 0.07341331079839344, 0.11781408396387182, -0.1299341459864515, -0.14743045143731828, 0.33068930295321647, -0.044692837710090735, -0.2317414698935271, 0.20312371780805358, -0.06904090500576635, -0.125342450390886, 0.10366489700097249, 0.19588669491590027, 0.12986145056399662, -0.1963808331440989, 0.0013246339125827877, -0.035517724888792276, 0.18755044533503712, 0.060246280569651534, 0.01316026031731739, 0.18570794296128368, 0.1762919704250376, 0.00794681667327804, 0.18878408651740222, -0.1593932543898326, -0.06339696448386023, -0.29154069559651835, -0.06874376500491053, -0.2045350592335635, -0.024718505760599804, -0.07829198185235653, -0.12596664732693771, 0.3696108757424245, 0.1699744447688743, 0.22648550272457849, 0.07190055985413833, 0.29657072738697327, 0.00400060707641287, 0.10343366761802944, 0.09376444208538245, 0.15740189658811127, 0.03010015685107012, 0.08426135312125019, -0.13729816234516784, 0.09503307231953431, 0.001372765655706235] |
1,803.00831 | Lexico-acoustic Neural-based Models for Dialog Act Classification | Recent works have proposed neural models for dialog act classification in
spoken dialogs. However, they have not explored the role and the usefulness of
acoustic information. We propose a neural model that processes both lexical and
acoustic features for classification. Our results on two benchmark datasets
reveal that acoustic features are helpful in improving the overall accuracy.
Finally, a deeper analysis shows that acoustic features are valuable in three
cases: when a dialog act has sufficient data, when lexical information is
limited and when strong lexical cues are not present.
| cs.CL | recent works have proposed neural models for dialog act classification in spoken dialogs however they have not explored the role and the usefulness of acoustic information we propose a neural model that processes both lexical and acoustic features for classification our results on two benchmark datasets reveal that acoustic features are helpful in improving the overall accuracy finally a deeper analysis shows that acoustic features are valuable in three cases when a dialog act has sufficient data when lexical information is limited and when strong lexical cues are not present | [['recent', 'works', 'have', 'proposed', 'neural', 'models', 'for', 'dialog', 'act', 'classification', 'in', 'spoken', 'dialogs', 'however', 'they', 'have', 'not', 'explored', 'the', 'role', 'and', 'the', 'usefulness', 'of', 'acoustic', 'information', 'we', 'propose', 'a', 'neural', 'model', 'that', 'processes', 'both', 'lexical', 'and', 'acoustic', 'features', 'for', 'classification', 'our', 'results', 'on', 'two', 'benchmark', 'datasets', 'reveal', 'that', 'acoustic', 'features', 'are', 'helpful', 'in', 'improving', 'the', 'overall', 'accuracy', 'finally', 'a', 'deeper', 'analysis', 'shows', 'that', 'acoustic', 'features', 'are', 'valuable', 'in', 'three', 'cases', 'when', 'a', 'dialog', 'act', 'has', 'sufficient', 'data', 'when', 'lexical', 'information', 'is', 'limited', 'and', 'when', 'strong', 'lexical', 'cues', 'are', 'not', 'present']] | [-0.03591348300170567, 0.03278501197799212, -0.05364664437301043, 0.09584278624323714, -0.16695072313046289, -0.17602507155905994, 0.00821786278910521, 0.45044247212095395, -0.20046366126690474, -0.31597996482418644, 0.08187173943992497, -0.3478800513678127, -0.2183630985311336, 0.2540254179155454, -0.07628060896208302, 0.038567499371452464, 0.16753923028914464, 0.07812812040404728, -0.009842540674273752, -0.29943499452743305, 0.3041852938865001, 0.03948746868409216, 0.38973064593349893, 0.08203414069074723, 0.09443433915083814, -0.08189272148431176, -0.07330699106937068, -0.016783858014180926, -0.05319783737383356, 0.13079316900629137, 0.38654723600148927, 0.19858546343425082, 0.33003518527580633, -0.42129981459584087, -0.31308859293090385, 0.056908089460598096, 0.1618580667560713, 0.16546791020098478, -0.06094887968178631, -0.34722781021975807, 0.09948661119366685, -0.12340161377667552, 0.07436714600771666, -0.20239469953295258, 0.0083930602711108, 0.02064118375354964, -0.23738003050287565, 0.09685572725203302, 0.17830594876367184, 0.10632732041801016, -0.0832300954627701, -0.12393909219600674, -0.016538828143125607, 0.23182485413756998, 0.008179327964575754, 0.005721432459540665, 0.09252629772527143, -0.1946239875836505, -0.1365148865307371, 0.36745046584142577, -0.08548782630112126, -0.26265095460952986, 0.23118333579558464, -0.028602511290874745, -0.1643864775231729, 0.03174574895658427, 0.23497097666517625, 0.06384753657815358, -0.15697063790721585, -0.004004845257926112, -0.05899665622661511, 0.20614360829090905, 0.024224510255994067, 0.06874088944556812, 0.2383178234979924, 0.27236097890935423, -0.047026134811393505, 0.09015275151468813, -0.10693698466186308, 0.0021633599108705917, -0.2167622779056223, -0.07001454224292603, -0.1551946728826604, -0.060350435416977335, -0.08745662426630993, -0.10018979555202855, 0.38586060448239246, 0.24789172431661022, 0.20313133399209216, 0.06096123121678829, 0.3256099238784777, 0.013846812886832696, 0.11642399526511629, 0.08634706733023954, 0.22776695358463458, -0.020757710985425445, 0.14701150989470382, -0.16892721893576285, 0.1039560232220942, 0.020404672503678334] |
1,803.00832 | Towards a Question Answering System over the Semantic Web | Thanks to the development of the Semantic Web, a lot of new structured data
has become available on the Web in the form of knowledge bases (KBs). Making
this valuable data accessible and usable for end-users is one of the main goals
of Question Answering (QA) over KBs. Most current QA systems query one KB, in
one language (namely English). The existing approaches are not designed to be
easily adaptable to new KBs and languages. We first introduce a new approach
for translating natural language questions to SPARQL queries. It is able to
query several KBs simultaneously, in different languages, and can easily be
ported to other KBs and languages. In our evaluation, the impact of our
approach is proven using 5 different well-known and large KBs: Wikidata,
DBpedia, MusicBrainz, DBLP and Freebase as well as 5 different languages namely
English, German, French, Italian and Spanish. Second, we show how we integrated
our approach, to make it easily accessible by the research community and by
end-users. To summarize, we provided a conceptional solution for multilingual,
KB-agnostic Question Answering over the Semantic Web. The provided first
approximation validates this concept.
| cs.AI cs.CL | thanks to the development of the semantic web a lot of new structured data has become available on the web in the form of knowledge bases kbs making this valuable data accessible and usable for endusers is one of the main goals of question answering qa over kbs most current qa systems query one kb in one language namely english the existing approaches are not designed to be easily adaptable to new kbs and languages we first introduce a new approach for translating natural language questions to sparql queries it is able to query several kbs simultaneously in different languages and can easily be ported to other kbs and languages in our evaluation the impact of our approach is proven using 5 different wellknown and large kbs wikidata dbpedia musicbrainz dblp and freebase as well as 5 different languages namely english german french italian and spanish second we show how we integrated our approach to make it easily accessible by the research community and by endusers to summarize we provided a conceptional solution for multilingual kbagnostic question answering over the semantic web the provided first approximation validates this concept | [['thanks', 'to', 'the', 'development', 'of', 'the', 'semantic', 'web', 'a', 'lot', 'of', 'new', 'structured', 'data', 'has', 'become', 'available', 'on', 'the', 'web', 'in', 'the', 'form', 'of', 'knowledge', 'bases', 'kbs', 'making', 'this', 'valuable', 'data', 'accessible', 'and', 'usable', 'for', 'endusers', 'is', 'one', 'of', 'the', 'main', 'goals', 'of', 'question', 'answering', 'qa', 'over', 'kbs', 'most', 'current', 'qa', 'systems', 'query', 'one', 'kb', 'in', 'one', 'language', 'namely', 'english', 'the', 'existing', 'approaches', 'are', 'not', 'designed', 'to', 'be', 'easily', 'adaptable', 'to', 'new', 'kbs', 'and', 'languages', 'we', 'first', 'introduce', 'a', 'new', 'approach', 'for', 'translating', 'natural', 'language', 'questions', 'to', 'sparql', 'queries', 'it', 'is', 'able', 'to', 'query', 'several', 'kbs', 'simultaneously', 'in', 'different', 'languages', 'and', 'can', 'easily', 'be', 'ported', 'to', 'other', 'kbs', 'and', 'languages', 'in', 'our', 'evaluation', 'the', 'impact', 'of', 'our', 'approach', 'is', 'proven', 'using', '5', 'different', 'wellknown', 'and', 'large', 'kbs', 'wikidata', 'dbpedia', 'musicbrainz', 'dblp', 'and', 'freebase', 'as', 'well', 'as', '5', 'different', 'languages', 'namely', 'english', 'german', 'french', 'italian', 'and', 'spanish', 'second', 'we', 'show', 'how', 'we', 'integrated', 'our', 'approach', 'to', 'make', 'it', 'easily', 'accessible', 'by', 'the', 'research', 'community', 'and', 'by', 'endusers', 'to', 'summarize', 'we', 'provided', 'a', 'conceptional', 'solution', 'for', 'multilingual', 'kbagnostic', 'question', 'answering', 'over', 'the', 'semantic', 'web', 'the', 'provided', 'first', 'approximation', 'validates', 'this', 'concept']] | [-0.043631478044687505, -0.008597043945508845, -0.0242407376066169, 0.12406669980983305, -0.1905126744622295, -0.1412942575186212, 0.0684090701584271, 0.4026610614821554, -0.30705799590509864, -0.366426669180712, 0.07520830414113513, -0.2982294342136957, -0.08442411224113748, 0.2771529374758708, -0.09517968991362953, 0.040203793883886445, 0.10116877846163325, 0.035153366281665904, 0.002170657064207894, -0.3380010325180237, 0.3190226166952342, 0.015715959877831573, 0.3003473078911716, 0.08583719221586213, 0.06566614657017915, -0.05162769175049933, -0.06328908832654118, -0.01465710538519138, -0.09432968436578477, 0.2341720908556512, 0.4303575737020848, 0.32513075146854004, 0.30678603056081155, -0.37283308386683145, -0.1295695903008794, 0.01400942082845551, 0.1327642529277146, 0.11400759490928986, 0.00691113717303696, -0.36257058626568733, 0.09660826080583315, -0.21881642393683168, 0.02627938904520622, -0.14725186886766398, 0.03839661067421424, -0.023216592670881494, -0.2075887077605043, -0.06495700146315649, 0.09989211161279762, 0.11508944878270003, -0.021673332355707325, -0.1123833842202025, 0.056762178194395364, 0.20241025214974973, 0.036290677459810905, 0.07382221096058321, 0.09670269885473949, -0.10176063346910603, -0.18788527239133967, 0.41173154526056455, -0.060136652641237416, -0.18921187765557657, 0.2223816465824235, -0.07209291998645599, -0.188765493311227, 0.023073691720352136, 0.1842531332208272, 0.1017682340972245, -0.21772203442545976, 0.0723483181150162, -0.061258846338599286, 0.2394468810728049, 0.12229869373511264, -0.019599821929008086, 0.1995439103899155, 0.2510401241551029, -4.967933279128476e-06, 0.1306597171528738, 0.019819113621388607, -0.06268937185526213, -0.19241422721257004, -0.17557502636078368, -0.15166459101336924, -0.02718504110373305, -0.06907460918428406, -0.1332743831207966, 0.3868406873662025, 0.25158334726139026, 0.1062786410323638, 0.06879616250597777, 0.3211445759603365, -0.03046162342988851, 0.1446665221748047, 0.10730860654244767, 0.11003252897999265, -0.035942697009808795, 0.20904978717936273, -0.06487027866617069, 0.09000325088518707, 0.01152755205275461] |
1,803.00833 | The Maillot-R\"ossler current and the polylogarithm on abelian schemes | We give a conceptual proof of the fact that the realisation of the degree
zero part of the polylogarithm on abelian schemes in analytic Deligne
cohomology can be described in terms of the Bismut-K\"ohler higher analytic
torsion form of the Poincar\'e bundle. Furthermore, we provide a new axiomatic
characterization of the arithmetic Chern character of the Poincar\'e bundle
using only invariance properties under isogenies. For this we obtain a
decomposition result for the arithmetic Chow group of independent interest.
| math.AG | we give a conceptual proof of the fact that the realisation of the degree zero part of the polylogarithm on abelian schemes in analytic deligne cohomology can be described in terms of the bismutkohler higher analytic torsion form of the poincare bundle furthermore we provide a new axiomatic characterization of the arithmetic chern character of the poincare bundle using only invariance properties under isogenies for this we obtain a decomposition result for the arithmetic chow group of independent interest | [['we', 'give', 'a', 'conceptual', 'proof', 'of', 'the', 'fact', 'that', 'the', 'realisation', 'of', 'the', 'degree', 'zero', 'part', 'of', 'the', 'polylogarithm', 'on', 'abelian', 'schemes', 'in', 'analytic', 'deligne', 'cohomology', 'can', 'be', 'described', 'in', 'terms', 'of', 'the', 'bismutkohler', 'higher', 'analytic', 'torsion', 'form', 'of', 'the', 'poincare', 'bundle', 'furthermore', 'we', 'provide', 'a', 'new', 'axiomatic', 'characterization', 'of', 'the', 'arithmetic', 'chern', 'character', 'of', 'the', 'poincare', 'bundle', 'using', 'only', 'invariance', 'properties', 'under', 'isogenies', 'for', 'this', 'we', 'obtain', 'a', 'decomposition', 'result', 'for', 'the', 'arithmetic', 'chow', 'group', 'of', 'independent', 'interest']] | [-0.22749270725613221, 0.03845716834975741, -0.17663358939954868, 0.07144469026183614, -0.12002967582203639, -0.0881079262516533, 0.024666675867942665, 0.2768776843567582, -0.2868751084240965, -0.20873840590222523, 0.08655763863144109, -0.16156252366132462, -0.16672019945839658, 0.22175820195713106, -0.14851241242379332, -0.014933882687145319, -0.0034740085755355465, 0.09259309643284024, -0.09631677388619536, -0.308499644513433, 0.3832579378802807, -0.00968500998062201, 0.25166623882400113, 0.07798516562504049, 0.13466669383864754, 0.022253719713682167, -0.02158914641954769, -0.04894952397966662, -0.14919620427313837, 0.21412385874786055, 0.3088016204673272, 0.04447044575807432, 0.18080576087754124, -0.40867569717841273, -0.11890228621613903, 0.13437046649722525, 0.098031064752155, 0.05203581089153886, -0.02619478954987314, -0.2611618242883243, 0.08792991764867344, -0.19340792965037204, -0.19271242526025537, -0.1328723340605696, 0.027380055592705805, 0.014864388113029493, -0.2053402304255332, 0.009367282445638034, 0.10462550911455391, 0.1931236740321112, -0.08764395127908732, -0.08682589461573233, -0.016259625303344086, 0.06469865647765498, 0.0289520350857996, 0.004896652419120073, 0.0940912449792123, -0.11286932652374396, -0.14322599842069814, 0.3808683337142261, -0.10236688694940546, -0.24112827949321422, 0.07505453725417073, -0.14804977894975588, -0.20066218605885902, 0.12437320267781615, 0.10018762885234676, 0.15751886234069482, 0.022011345801636193, 0.16883155733404026, -0.1283481924030452, 0.07537374066976973, 0.0958635982317038, 0.04931174286115819, 0.11392699905002537, 0.06532954918340039, 0.048206772174662314, 0.14928930065182683, 0.033920477816047005, -0.05751026324474086, -0.4197473951543753, -0.28384259155091757, -0.1550670139825879, 0.16520956789071745, -0.12932777600601697, -0.17585054476960346, 0.46583864757588184, 0.06735168253549208, 0.1666636997117446, 0.1503136563473023, 0.26230363767498577, 0.12400767972501807, 0.0509437139516171, -0.009470941815286493, 0.1973537167844673, 0.22446907378542116, -0.017971129186499197, -0.12776100765674925, 0.013454728437444339, 0.24201835677003822] |
1,803.00834 | The case of Neumann, Robin and periodic lateral condition for the semi
infinite generalized Graetz problem and applications | The Graetz problem is a convection-diffusion equation in a pipe invariant
along a direction. The contribution of the present work is to propose a
mathematical analysis of the Neumann, Robin and periodic boundary condition on
the boundary of a semi-infinite pipe. The solution in the 3D space of the
original problem is reduced to eigenproblems in the 2D section of the pipe. The
set of solutions is described, its structure depends on the type of boundary
condition and of the sign of the total flow of the fluid. This analysis is the
cornerstone of numerical methods to solve Graetz problem in finite pipes, semi
infinite pipes and exchangers of arbitrary cross section. Numerical test-cases
illustrate the capabilities of these methods to provide solutions in various
configurations.
| math.NA | the graetz problem is a convectiondiffusion equation in a pipe invariant along a direction the contribution of the present work is to propose a mathematical analysis of the neumann robin and periodic boundary condition on the boundary of a semiinfinite pipe the solution in the 3d space of the original problem is reduced to eigenproblems in the 2d section of the pipe the set of solutions is described its structure depends on the type of boundary condition and of the sign of the total flow of the fluid this analysis is the cornerstone of numerical methods to solve graetz problem in finite pipes semi infinite pipes and exchangers of arbitrary cross section numerical testcases illustrate the capabilities of these methods to provide solutions in various configurations | [['the', 'graetz', 'problem', 'is', 'a', 'convectiondiffusion', 'equation', 'in', 'a', 'pipe', 'invariant', 'along', 'a', 'direction', 'the', 'contribution', 'of', 'the', 'present', 'work', 'is', 'to', 'propose', 'a', 'mathematical', 'analysis', 'of', 'the', 'neumann', 'robin', 'and', 'periodic', 'boundary', 'condition', 'on', 'the', 'boundary', 'of', 'a', 'semiinfinite', 'pipe', 'the', 'solution', 'in', 'the', '3d', 'space', 'of', 'the', 'original', 'problem', 'is', 'reduced', 'to', 'eigenproblems', 'in', 'the', '2d', 'section', 'of', 'the', 'pipe', 'the', 'set', 'of', 'solutions', 'is', 'described', 'its', 'structure', 'depends', 'on', 'the', 'type', 'of', 'boundary', 'condition', 'and', 'of', 'the', 'sign', 'of', 'the', 'total', 'flow', 'of', 'the', 'fluid', 'this', 'analysis', 'is', 'the', 'cornerstone', 'of', 'numerical', 'methods', 'to', 'solve', 'graetz', 'problem', 'in', 'finite', 'pipes', 'semi', 'infinite', 'pipes', 'and', 'exchangers', 'of', 'arbitrary', 'cross', 'section', 'numerical', 'testcases', 'illustrate', 'the', 'capabilities', 'of', 'these', 'methods', 'to', 'provide', 'solutions', 'in', 'various', 'configurations']] | [-0.1663370404407502, 0.03408038841265689, -0.08332977168855348, -0.005721553870957465, -0.07291943125141363, -0.10002701127180649, -0.016835868493804047, 0.29448012138469026, -0.28592386893973115, -0.25584588135637704, 0.16391465273186295, -0.2773349329175788, -0.10191846964129757, 0.19883529591794696, -0.06613237686425207, 0.14012433309812145, 0.12025551107757154, 0.03711382435815927, -0.0847204580504988, -0.19410906487422425, 0.35656053706770763, -0.007492678367622917, 0.29250634077282983, 0.10205560366833402, 0.1136169833837137, -0.03825370399206276, -0.042885599004465244, 0.04514675168672599, -0.16702607241947384, 0.13329310833397623, 0.2171589491077729, 0.0640574799805519, 0.2528591294671529, -0.44789143959661165, -0.20641749531721637, 0.044207143651757146, 0.12511724752051034, 0.09385501458910445, -0.0034591724153517954, -0.24367954445281817, 0.10355684703456298, -0.1315637685118183, -0.1768650095571854, 0.030044745541207733, -0.0016619636388044924, 0.016548807304652947, -0.24902271665491899, 0.07948191435406765, 0.055247282228177236, 0.028689274849790718, -0.13184904579106987, -0.06434334758969565, -0.005982076890969409, 0.0962398961569453, 0.05406050241905295, -0.010270598164248851, 0.07760475241699286, -0.1565346251403342, -0.08842937511790003, 0.4120033747186103, -0.03789327799383881, -0.31752959396990554, 0.1541303309101251, -0.10582869553435294, -0.057883429939993805, 0.13129734624582792, 0.19564186388836993, 0.1611716077107215, -0.13485174963012292, 0.11639599395675759, -0.08510750941950979, 0.11862366366004871, 0.06237714616732011, -0.08806207909008427, 0.13259055956657376, 0.1925917387007728, 0.11463630513284326, 0.19815162964345467, -0.06795150416550197, -0.12407712950446312, -0.34838873466416714, -0.19648973899330163, -0.15427084985159098, 0.018916322881611245, -0.08431629725366234, -0.24874215567814967, 0.4077537339744008, 0.0953266732469802, 0.1922043653114909, 0.004768706512667479, 0.30844676276413546, 0.13939836721047252, 0.008998457924462855, 0.06720018207711438, 0.21238307395551895, 0.18832631785077072, 0.1589604481574028, -0.25047208279025773, 0.037046103563625365, 0.12799152729078947] |
1,803.00835 | Infrared divergences in the EPRL-FK Spin Foam model | We provide an algorithm to estimate the divergence degree of the Lorentzian
EPRL-FK spin foam amplitudes for arbitrary 2-complexes. We focus on the
"self-energy" and "vertex renormalization" diagrams and find an upper bound
estimate. We argue that our upper bound must be close to the actual value, and
explain what numerical improvements are needed to verify this numerically. For
the self-energy, this turns out to be significantly more divergent than the
lower bound estimate present in the literature. We support the validity of our
algorithm using 3-stranded versions of the amplitudes (corresponding to a toy
3d model) for which our estimates are confirmed numerically. We also apply our
methods to the simplified EPRLs model, finding a completely convergent
behavior, and to BF theory, independently recovering the divergent estimates
present in the literature.
| gr-qc math-ph math.MP | we provide an algorithm to estimate the divergence degree of the lorentzian eprlfk spin foam amplitudes for arbitrary 2complexes we focus on the selfenergy and vertex renormalization diagrams and find an upper bound estimate we argue that our upper bound must be close to the actual value and explain what numerical improvements are needed to verify this numerically for the selfenergy this turns out to be significantly more divergent than the lower bound estimate present in the literature we support the validity of our algorithm using 3stranded versions of the amplitudes corresponding to a toy 3d model for which our estimates are confirmed numerically we also apply our methods to the simplified eprls model finding a completely convergent behavior and to bf theory independently recovering the divergent estimates present in the literature | [['we', 'provide', 'an', 'algorithm', 'to', 'estimate', 'the', 'divergence', 'degree', 'of', 'the', 'lorentzian', 'eprlfk', 'spin', 'foam', 'amplitudes', 'for', 'arbitrary', '2complexes', 'we', 'focus', 'on', 'the', 'selfenergy', 'and', 'vertex', 'renormalization', 'diagrams', 'and', 'find', 'an', 'upper', 'bound', 'estimate', 'we', 'argue', 'that', 'our', 'upper', 'bound', 'must', 'be', 'close', 'to', 'the', 'actual', 'value', 'and', 'explain', 'what', 'numerical', 'improvements', 'are', 'needed', 'to', 'verify', 'this', 'numerically', 'for', 'the', 'selfenergy', 'this', 'turns', 'out', 'to', 'be', 'significantly', 'more', 'divergent', 'than', 'the', 'lower', 'bound', 'estimate', 'present', 'in', 'the', 'literature', 'we', 'support', 'the', 'validity', 'of', 'our', 'algorithm', 'using', '3stranded', 'versions', 'of', 'the', 'amplitudes', 'corresponding', 'to', 'a', 'toy', '3d', 'model', 'for', 'which', 'our', 'estimates', 'are', 'confirmed', 'numerically', 'we', 'also', 'apply', 'our', 'methods', 'to', 'the', 'simplified', 'eprls', 'model', 'finding', 'a', 'completely', 'convergent', 'behavior', 'and', 'to', 'bf', 'theory', 'independently', 'recovering', 'the', 'divergent', 'estimates', 'present', 'in', 'the', 'literature']] | [-0.06783402039854297, 0.07542655238004593, -0.13785066827065276, 0.12302386311224114, -0.08168417469861398, -0.10798474497922504, 0.07624941098815691, 0.35250627415126745, -0.1937475963886685, -0.29832788370194213, 0.09769699534131143, -0.2663423992650768, -0.17740847142582106, 0.2145487805010879, -0.04519497741454544, 0.022818564671937745, 0.038441982511288796, 0.03823268620269764, -0.1006138147377473, -0.281818178980007, 0.2819957585742285, 0.04864349192761965, 0.2445338173904492, 0.09455230167377314, 0.03545504710317113, -0.014129827936528293, -0.03532046241150771, 0.007275205907564724, -0.20280008199688035, 0.13497348242076754, 0.21491963897462052, 0.08016421351908841, 0.1923230846220528, -0.3981069031221266, -0.17955165390522426, 0.09345474464193214, 0.17851132494068656, 0.16113857829584277, 0.0012127946326215859, -0.2627563024337851, 0.10443329271231244, -0.16297295430547626, -0.17234385416324016, -0.11469322900138511, -0.0006967135314040511, -0.051716368327286974, -0.2884586545432569, 0.06448678560941551, 0.03585042499311496, -0.007450902012073726, -0.06405840107801421, -0.1377355088586457, 0.00845628529644877, 0.12740462913199235, 0.04474474050332117, 0.043514189512987855, 0.06688766169916298, -0.11596275704805313, -0.11014038382652606, 0.30643979496614054, -0.07266337681041395, -0.2391890410639573, 0.14837955863158156, -0.14524037067472706, -0.13453587595344954, 0.10932993048531864, 0.15410812404575466, 0.15185924554030403, -0.15142423110455985, 0.06281486926653657, -0.06824493178216215, 0.1528898527070823, 0.03211895145746019, 0.0011031547079630593, 0.15170293313074318, 0.10805110821770575, 0.06288665340402881, 0.16549487526613849, -0.06842760177585118, -0.10561312283638097, -0.3305733590920008, -0.11732856923925783, -0.17294718663009126, 0.019275168529249556, -0.11446166513194436, -0.17611289910175873, 0.36474478146672706, 0.2453348056576748, 0.20473311596104826, 0.12867097364016986, 0.2986181202799594, 0.1819079325761902, 0.03829084692224292, 0.12538435916551424, 0.2630536246810194, 0.13521854916431067, 0.01698587485411354, -0.2348028452309801, 0.03008653104388802, 0.10455565320910844] |
1,803.00836 | Weak measurement and weak values -- New insights and effects in
reflectivity and scattering processes | Recently, the notions of Weak Measurement (WM), Weak Value (WV) and
Two-State-Vector Formalism (TSVF), firstly introduced by Aharonov and
collaborators, have extended the theoretical frame of standard quantum
mechanics, thus providing a quantum-theoretical formalism for extracting new
information from a system in the limit of small disturbance to its state. Here
we provide an application to the case of two-body scattering with one body
weakly interacting with its environment --- e.g. a neutron being scattered from
a H2 molecule physisorbed in a carbon nanotube.
In particular, we make contact with the field of incoherent inelastic neutron
scattering from condensed systems. We provide a physically compelling
prediction of a new quantum effect --- a momentum transfer deficit; or
equivalently, an enhanced energy transfer; or an apparent reduction of the mass
of the struck particle. E.g., when a neutron collides with a H2 molecule in a
C-nanotube and excites its translational motion along the nanotube, it
apparently exchanges energy and momentum with a fictitious particle with mass
of 0.64 atomic mass units. Experimental results are shown and discussed in the
new theoretical frame. The effect under consideration has no conventional
interpretation, thus also supporting the novelty of the quantum theoretical
framework of WV and TVSF. Some speculative remarks about possible applications
being of technological interest (fuel cells and hydrogen storage; Li+
batteries; information and communication technology) are shortly mentioned.
\end{abstract}
| quant-ph cond-mat.mes-hall physics.atom-ph | recently the notions of weak measurement wm weak value wv and twostatevector formalism tsvf firstly introduced by aharonov and collaborators have extended the theoretical frame of standard quantum mechanics thus providing a quantumtheoretical formalism for extracting new information from a system in the limit of small disturbance to its state here we provide an application to the case of twobody scattering with one body weakly interacting with its environment eg a neutron being scattered from a h2 molecule physisorbed in a carbon nanotube in particular we make contact with the field of incoherent inelastic neutron scattering from condensed systems we provide a physically compelling prediction of a new quantum effect a momentum transfer deficit or equivalently an enhanced energy transfer or an apparent reduction of the mass of the struck particle eg when a neutron collides with a h2 molecule in a cnanotube and excites its translational motion along the nanotube it apparently exchanges energy and momentum with a fictitious particle with mass of 064 atomic mass units experimental results are shown and discussed in the new theoretical frame the effect under consideration has no conventional interpretation thus also supporting the novelty of the quantum theoretical framework of wv and tvsf some speculative remarks about possible applications being of technological interest fuel cells and hydrogen storage li batteries information and communication technology are shortly mentioned endabstract | [['recently', 'the', 'notions', 'of', 'weak', 'measurement', 'wm', 'weak', 'value', 'wv', 'and', 'twostatevector', 'formalism', 'tsvf', 'firstly', 'introduced', 'by', 'aharonov', 'and', 'collaborators', 'have', 'extended', 'the', 'theoretical', 'frame', 'of', 'standard', 'quantum', 'mechanics', 'thus', 'providing', 'a', 'quantumtheoretical', 'formalism', 'for', 'extracting', 'new', 'information', 'from', 'a', 'system', 'in', 'the', 'limit', 'of', 'small', 'disturbance', 'to', 'its', 'state', 'here', 'we', 'provide', 'an', 'application', 'to', 'the', 'case', 'of', 'twobody', 'scattering', 'with', 'one', 'body', 'weakly', 'interacting', 'with', 'its', 'environment', 'eg', 'a', 'neutron', 'being', 'scattered', 'from', 'a', 'h2', 'molecule', 'physisorbed', 'in', 'a', 'carbon', 'nanotube', 'in', 'particular', 'we', 'make', 'contact', 'with', 'the', 'field', 'of', 'incoherent', 'inelastic', 'neutron', 'scattering', 'from', 'condensed', 'systems', 'we', 'provide', 'a', 'physically', 'compelling', 'prediction', 'of', 'a', 'new', 'quantum', 'effect', 'a', 'momentum', 'transfer', 'deficit', 'or', 'equivalently', 'an', 'enhanced', 'energy', 'transfer', 'or', 'an', 'apparent', 'reduction', 'of', 'the', 'mass', 'of', 'the', 'struck', 'particle', 'eg', 'when', 'a', 'neutron', 'collides', 'with', 'a', 'h2', 'molecule', 'in', 'a', 'cnanotube', 'and', 'excites', 'its', 'translational', 'motion', 'along', 'the', 'nanotube', 'it', 'apparently', 'exchanges', 'energy', 'and', 'momentum', 'with', 'a', 'fictitious', 'particle', 'with', 'mass', 'of', '064', 'atomic', 'mass', 'units', 'experimental', 'results', 'are', 'shown', 'and', 'discussed', 'in', 'the', 'new', 'theoretical', 'frame', 'the', 'effect', 'under', 'consideration', 'has', 'no', 'conventional', 'interpretation', 'thus', 'also', 'supporting', 'the', 'novelty', 'of', 'the', 'quantum', 'theoretical', 'framework', 'of', 'wv', 'and', 'tvsf', 'some', 'speculative', 'remarks', 'about', 'possible', 'applications', 'being', 'of', 'technological', 'interest', 'fuel', 'cells', 'and', 'hydrogen', 'storage', 'li', 'batteries', 'information', 'and', 'communication', 'technology', 'are', 'shortly', 'mentioned', 'endabstract']] | [-0.10620865320951063, 0.16479205528561838, -0.06825520046498111, 0.041134387823798794, -0.04121602144524721, -0.15872727488541777, 0.0718442136161944, 0.35179119037431, -0.25151138197231504, -0.2891610403915235, 0.049163997222681895, -0.3015872511385688, -0.08653591981107768, 0.1738701833362159, -0.048525602710599615, 0.042377778479931294, 0.0759921240969561, 0.053006241284362786, -0.06633905899538409, -0.17358027296982723, 0.2948029037132593, 0.08575834986705948, 0.23874814923016988, 0.10562974279543726, 0.09500442471471615, 0.031351473256238806, -0.014820367830127777, 0.00622041745477223, -0.1241073519049678, 0.13676674196072522, 0.20425486722212685, 0.07842481051505144, 0.24319880076135242, -0.45130386482924223, -0.21751611359299464, 0.05481393126891427, 0.09906739971107267, 0.13437313203965978, -0.11268314576838227, -0.2904517527093568, 0.004215431293622325, -0.2111014891592536, -0.13712195665721083, -0.048422246323233206, 0.061974845461008954, 0.0033033228059399073, -0.23515828064410016, 0.07532373897356592, 0.05981793285159905, 0.048165602676038234, -0.08716998358379767, -0.11066301643222687, -0.013051056932973941, 0.06849338126643748, 0.04589295168001887, 0.03559600620896423, 0.18478947388731676, -0.15208895030290087, -0.0899405942618614, 0.3995894301582926, -0.04605396949357653, -0.18171382384441262, 0.1942314401593259, -0.12833495634133993, -0.11208204257127363, 0.13027494836959314, 0.1002369454223039, 0.08788211460445641, -0.16139035069532578, 0.0596570290321584, -0.0245983997384818, 0.14201756738579466, 0.07220207789837982, 0.0800757682217019, 0.2573715047754896, 0.19282640196823714, 0.02374858884078484, 0.10531945455399441, -0.1048465503803787, -0.11956698293033696, -0.2842513565826396, -0.1991977402748424, -0.15824392386405503, 0.08522996122961299, -0.04269072730351452, -0.12528258350500568, 0.3164111780019344, 0.10949563754236026, 0.1899211812165699, -0.016128064061506717, 0.31511091104039224, 0.09692151192471751, 0.0509282141138101, 0.035255069123065495, 0.27329507985333684, 0.19794025797818904, 0.13219636215113237, -0.21705199864663882, 0.025929131837723877, -0.005124325805809349] |
1,803.00837 | K-theory and 0-cycles on schemes | We prove Bloch's formula for 0-cycles on affine schemes over algebraically
closed fields. We prove this formula also for projective schemes over
algebraically closed fields which are regular in codimension one. Several
applications, including Bloch's formula for 0-cycles with modulus, are derived.
| math.AG | we prove blochs formula for 0cycles on affine schemes over algebraically closed fields we prove this formula also for projective schemes over algebraically closed fields which are regular in codimension one several applications including blochs formula for 0cycles with modulus are derived | [['we', 'prove', 'blochs', 'formula', 'for', '0cycles', 'on', 'affine', 'schemes', 'over', 'algebraically', 'closed', 'fields', 'we', 'prove', 'this', 'formula', 'also', 'for', 'projective', 'schemes', 'over', 'algebraically', 'closed', 'fields', 'which', 'are', 'regular', 'in', 'codimension', 'one', 'several', 'applications', 'including', 'blochs', 'formula', 'for', '0cycles', 'with', 'modulus', 'are', 'derived']] | [-0.26898702420294285, 0.04586112370625848, -0.11377770172077276, 0.11434568028752914, -0.07374373300089723, -0.2209584064604271, -0.03569258962358747, 0.3732674577761264, -0.2881803207454227, -0.11683926296730836, 0.07966940697847999, -0.14014675614557096, -0.14824188689124726, 0.4390858237055086, -0.1404423773111332, -0.061377160073745815, -0.018421085856278382, 0.13505091185548476, -0.1277800039166496, -0.40909566162874744, 0.3610296829470566, -0.18975429520720527, 0.30294109712399186, 0.11571861133866367, 0.16140468908651245, 0.036151878269655366, 0.02308719525379794, 0.03378836320535768, -0.22173802665479125, 0.1284552019178158, 0.40694638359404744, 0.042562225323525216, 0.13058191706382094, -0.3743917691920485, -0.21442839241630973, 0.21660263457202486, 0.1592430659636323, 0.08347818469129768, 0.00634726418259864, -0.2402265708272656, 0.14009634192500794, -0.1969809765439658, -0.21881844546823276, -0.13029984910307185, 0.08027366023244602, 0.053560684756597594, -0.24609575819756305, 0.04512372365639922, 0.09146458794739806, 0.26564156401547645, -0.12061272317632324, -0.12549090673703522, 0.048351527945626346, -0.019900123167428233, 0.03828732829008784, 0.019813150433557376, 0.07195729605986603, -0.04580269642506859, -0.11918288538055051, 0.2825630413634436, -0.08836803760468251, -0.2570266053080559, 0.046115539164193683, -0.12218021601438522, -0.12454568045879048, 0.1621815358022494, 0.0628332466419254, 0.23335717643965923, 0.0017493961467629387, 0.24332493656714047, -0.09984707858945642, -0.026484347081610134, 0.13790932450709598, 0.04596263884256283, 0.08129652695996421, -0.03402442360917727, 0.1020417257123405, 0.12267867775101747, 0.002651954762681964, -0.10940752329216116, -0.3871070130151652, -0.245830798144674, -0.05381851714281809, 0.22790748745735204, -0.17323574411594087, -0.1941675545115556, 0.3419984479745229, -0.00393837315606929, 0.10119660484737583, 0.2024057306421344, 0.305325537653906, 0.060619014337481486, 0.0707595699599811, 0.07819253070989535, 0.09357144729056883, 0.2874854098384579, -0.0835446091978589, -0.05115106084295327, -0.012538738792673462, 0.3028987711517229] |
1,803.00838 | A multi-instance deep neural network classifier: application to Higgs
boson CP measurement | We investigate properties of a classifier applied to the measurements of the
CP state of the Higgs boson in $H\rightarrow\tau\tau$ decays. The problem is
framed as binary classifier applied to individual instances. Then the prior
knowledge that the instances belong to the same class is used to define the
multi-instance classifier. Its final score is calculated as multiplication of
single instance scores for a given series of instances. In the paper we discuss
properties of such classifier, notably its dependence on the number of
instances in the series. This classifier exhibits very strong random dependence
on the number of epochs used for training and requires careful tuning of the
classification threshold. We derive formula for this optimal threshold.
| cs.LG cs.NE hep-ex physics.data-an | we investigate properties of a classifier applied to the measurements of the cp state of the higgs boson in hrightarrowtautau decays the problem is framed as binary classifier applied to individual instances then the prior knowledge that the instances belong to the same class is used to define the multiinstance classifier its final score is calculated as multiplication of single instance scores for a given series of instances in the paper we discuss properties of such classifier notably its dependence on the number of instances in the series this classifier exhibits very strong random dependence on the number of epochs used for training and requires careful tuning of the classification threshold we derive formula for this optimal threshold | [['we', 'investigate', 'properties', 'of', 'a', 'classifier', 'applied', 'to', 'the', 'measurements', 'of', 'the', 'cp', 'state', 'of', 'the', 'higgs', 'boson', 'in', 'hrightarrowtautau', 'decays', 'the', 'problem', 'is', 'framed', 'as', 'binary', 'classifier', 'applied', 'to', 'individual', 'instances', 'then', 'the', 'prior', 'knowledge', 'that', 'the', 'instances', 'belong', 'to', 'the', 'same', 'class', 'is', 'used', 'to', 'define', 'the', 'multiinstance', 'classifier', 'its', 'final', 'score', 'is', 'calculated', 'as', 'multiplication', 'of', 'single', 'instance', 'scores', 'for', 'a', 'given', 'series', 'of', 'instances', 'in', 'the', 'paper', 'we', 'discuss', 'properties', 'of', 'such', 'classifier', 'notably', 'its', 'dependence', 'on', 'the', 'number', 'of', 'instances', 'in', 'the', 'series', 'this', 'classifier', 'exhibits', 'very', 'strong', 'random', 'dependence', 'on', 'the', 'number', 'of', 'epochs', 'used', 'for', 'training', 'and', 'requires', 'careful', 'tuning', 'of', 'the', 'classification', 'threshold', 'we', 'derive', 'formula', 'for', 'this', 'optimal', 'threshold']] | [-0.07048102144065108, 0.035375952444402343, -0.07066160308639124, 0.08562981462504683, -0.09506937969570696, -0.14874828135657867, 0.11319384665891402, 0.37649755126212614, -0.2812801082164712, -0.3173007106929386, 0.056164586445971755, -0.25158165232463386, -0.10581493487984131, 0.18818311520417563, -0.06569819358745747, 0.09748423989108464, 0.08464778335646615, 0.12273148444118136, -0.07779908191089092, -0.3034643651029663, 0.3351957795577187, 0.024035119443689867, 0.28274193652353047, 0.006078241775759449, 0.09403759823575364, 0.0292177864595048, -0.00652974529854827, -0.0036665205922672304, -0.08923568140146355, 0.10285566573453499, 0.2558988207098791, 0.172083515942223, 0.27614799441012033, -0.3175216026809382, -0.13967827297510357, 0.15171507865948192, 0.09718681778758764, 0.10752123621118775, -0.004404343461412621, -0.27140328751075854, 0.11979347685454571, -0.1455644853413105, -0.04646290080045681, -0.08649717424246403, 0.0030558332879790815, 0.0025165752286754424, -0.31885705278965376, 0.045602889036980725, 0.04854612830252844, 0.03838971602509461, -0.06313206113567102, -0.1390585490360351, 0.011090406256143824, 0.1370834335763702, 0.07493367827678951, 0.02232319277995345, 0.12883020731052225, -0.18694188240205206, -0.14132418319725004, 0.3755557651994592, -0.08289867019975337, -0.18507872509051873, 0.15682075646611215, -0.09585291211951082, -0.18250475696808957, 0.09642135969686748, 0.23718513669525038, 0.14442391738974317, -0.12306084676440489, 0.048235311330260586, -0.07183167374677073, 0.16743825100385978, 0.05382207089095866, 0.00892611886118144, 0.16118119739516937, 0.21070050067363022, 0.022377720844568842, 0.22002104883697832, -0.14370946543117574, -0.02679777608284632, -0.3125097897235241, -0.12303993138445193, -0.19565111111407563, 0.02509566292490305, -0.10502714037752643, -0.20080136420142095, 0.4372959697611188, 0.16362059602545478, 0.24777435217747243, 0.08420028367821696, 0.2364715219266176, 0.11200855158652195, 0.07099241677324399, 0.05073092739843622, 0.23116111142513485, 0.12015002810838238, 0.08301353525622922, -0.19793819322377065, 0.12448238992226958, 0.08825532892734696] |
1,803.00839 | Pose-Robust Face Recognition via Deep Residual Equivariant Mapping | Face recognition achieves exceptional success thanks to the emergence of deep
learning. However, many contemporary face recognition models still perform
relatively poor in processing profile faces compared to frontal faces. A key
reason is that the number of frontal and profile training faces are highly
imbalanced - there are extensively more frontal training samples compared to
profile ones. In addition, it is intrinsically hard to learn a deep
representation that is geometrically invariant to large pose variations. In
this study, we hypothesize that there is an inherent mapping between frontal
and profile faces, and consequently, their discrepancy in the deep
representation space can be bridged by an equivariant mapping. To exploit this
mapping, we formulate a novel Deep Residual EquivAriant Mapping (DREAM) block,
which is capable of adaptively adding residuals to the input deep
representation to transform a profile face representation to a canonical pose
that simplifies recognition. The DREAM block consistently enhances the
performance of profile face recognition for many strong deep networks,
including ResNet models, without deliberately augmenting training data of
profile faces. The block is easy to use, light-weight, and can be implemented
with a negligible computational overhead.
| cs.CV | face recognition achieves exceptional success thanks to the emergence of deep learning however many contemporary face recognition models still perform relatively poor in processing profile faces compared to frontal faces a key reason is that the number of frontal and profile training faces are highly imbalanced there are extensively more frontal training samples compared to profile ones in addition it is intrinsically hard to learn a deep representation that is geometrically invariant to large pose variations in this study we hypothesize that there is an inherent mapping between frontal and profile faces and consequently their discrepancy in the deep representation space can be bridged by an equivariant mapping to exploit this mapping we formulate a novel deep residual equivariant mapping dream block which is capable of adaptively adding residuals to the input deep representation to transform a profile face representation to a canonical pose that simplifies recognition the dream block consistently enhances the performance of profile face recognition for many strong deep networks including resnet models without deliberately augmenting training data of profile faces the block is easy to use lightweight and can be implemented with a negligible computational overhead | [['face', 'recognition', 'achieves', 'exceptional', 'success', 'thanks', 'to', 'the', 'emergence', 'of', 'deep', 'learning', 'however', 'many', 'contemporary', 'face', 'recognition', 'models', 'still', 'perform', 'relatively', 'poor', 'in', 'processing', 'profile', 'faces', 'compared', 'to', 'frontal', 'faces', 'a', 'key', 'reason', 'is', 'that', 'the', 'number', 'of', 'frontal', 'and', 'profile', 'training', 'faces', 'are', 'highly', 'imbalanced', 'there', 'are', 'extensively', 'more', 'frontal', 'training', 'samples', 'compared', 'to', 'profile', 'ones', 'in', 'addition', 'it', 'is', 'intrinsically', 'hard', 'to', 'learn', 'a', 'deep', 'representation', 'that', 'is', 'geometrically', 'invariant', 'to', 'large', 'pose', 'variations', 'in', 'this', 'study', 'we', 'hypothesize', 'that', 'there', 'is', 'an', 'inherent', 'mapping', 'between', 'frontal', 'and', 'profile', 'faces', 'and', 'consequently', 'their', 'discrepancy', 'in', 'the', 'deep', 'representation', 'space', 'can', 'be', 'bridged', 'by', 'an', 'equivariant', 'mapping', 'to', 'exploit', 'this', 'mapping', 'we', 'formulate', 'a', 'novel', 'deep', 'residual', 'equivariant', 'mapping', 'dream', 'block', 'which', 'is', 'capable', 'of', 'adaptively', 'adding', 'residuals', 'to', 'the', 'input', 'deep', 'representation', 'to', 'transform', 'a', 'profile', 'face', 'representation', 'to', 'a', 'canonical', 'pose', 'that', 'simplifies', 'recognition', 'the', 'dream', 'block', 'consistently', 'enhances', 'the', 'performance', 'of', 'profile', 'face', 'recognition', 'for', 'many', 'strong', 'deep', 'networks', 'including', 'resnet', 'models', 'without', 'deliberately', 'augmenting', 'training', 'data', 'of', 'profile', 'faces', 'the', 'block', 'is', 'easy', 'to', 'use', 'lightweight', 'and', 'can', 'be', 'implemented', 'with', 'a', 'negligible', 'computational', 'overhead']] | [-0.06284584830649884, -0.009122113873538758, -0.07256233041591355, 0.07769905481928666, -0.1212048749672249, -0.2026125685115786, -0.02316162589398262, 0.4871752328508975, -0.32281617855555134, -0.31132217309388677, 0.09967770467904445, -0.25791626220912134, -0.21153728648235923, 0.15114766661273807, -0.21712483784772063, 0.056110849008454304, 0.1391876733383948, 0.005307475835280983, -0.0792003619864485, -0.25756735546226417, 0.2888356162945887, 0.037561957745530984, 0.351467459300827, 0.017620855613954756, 0.13435645629154017, -0.04102377697678381, 0.010826127520321232, -0.00462922670305584, 0.0028214047373407275, 0.20554114595135234, 0.31435178095451094, 0.17744688893129168, 0.26576917265590866, -0.42940425720850106, -0.2171226851151962, 0.11342739555372024, 0.16380050294530138, 0.10877796698447414, -0.07204299022200039, -0.30837856609080183, 0.11173072040906654, -0.1432402322607997, -0.04314375119773965, -0.14042232191974396, 0.01765939658017535, -0.05853908363496885, -0.2533752518102502, 0.012672476736387533, 0.06515306848910098, 0.08303902374433451, -0.011569138604069227, -0.07526971202245668, 0.017460415621386154, 0.18629954659723139, 0.04959984491579235, 0.09767641850967744, 0.13462838659210033, -0.2483278300864377, -0.0573789345247573, 0.38364830584752396, -0.04885047986417224, -0.22606013987066323, 0.22112110883340633, -0.04822226867545396, -0.13698224520898963, 0.16895335899224798, 0.20425907537512678, 0.06226850222355049, -0.13023800527873008, 0.03428883972014055, -0.07458513035978141, 0.19733561349934653, 0.07505316116700048, -0.03891126024414246, 0.20401608584767306, 0.21380431072688416, 0.05151542521657814, 0.14694402581938593, -0.15773430516159065, -0.06481530957512166, -0.18169854718726128, -0.10549070054763242, -0.18246703987303925, -0.023268484799681525, -0.10473166597045125, -0.16331623409864016, 0.3931577111643396, 0.1829530480195229, 0.2545260239441536, 0.10474450954363994, 0.3378059474751353, 0.05182199248504874, 0.15896117231735077, 0.07143716571242151, 0.17824650684518642, 0.05443898396394951, 0.07430188874009458, -0.15531553218974486, 0.09734498004821178, 0.037280482655440116] |
1,803.0084 | Linear-in-frequency optical conductivity in GdPtBi due to transitions
near the triple points | The complex optical conductivity of the half-Heusler compound GdPtBi is
measured in a frequency range from 20 to 22 000 cm$^{-1}$ (2.5 meV - 2.73 eV)
at temperatures down to 10 K in zero magnetic field. We find the real part of
the conductivity, $\sigma_{1}(\omega)$, to be almost perfectly linear in
frequency over a broad range from 50 to 800 cm$^{-1}$ ($\sim$ 6 - 100 meV) for
$T \leq 50$ K. This linearity strongly suggests the presence of
three-dimensional linear electronic bands with band crossings (nodes) near the
chemical potential. Band-structure calculations show the presence of triple
points, where one doubly degenerate and one nondegenerate band cross each other
in close vicinity of the chemical potential. From a comparison of our data with
the optical conductivity computed from the band structure, we conclude that the
observed nearly linear $\sigma_{1}(\omega)$ originates as a cumulative effect
from all the transitions near the triple points.
| cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el | the complex optical conductivity of the halfheusler compound gdptbi is measured in a frequency range from 20 to 22 000 cm1 25 mev 273 ev at temperatures down to 10 k in zero magnetic field we find the real part of the conductivity sigma_1omega to be almost perfectly linear in frequency over a broad range from 50 to 800 cm1 sim 6 100 mev for t leq 50 k this linearity strongly suggests the presence of threedimensional linear electronic bands with band crossings nodes near the chemical potential bandstructure calculations show the presence of triple points where one doubly degenerate and one nondegenerate band cross each other in close vicinity of the chemical potential from a comparison of our data with the optical conductivity computed from the band structure we conclude that the observed nearly linear sigma_1omega originates as a cumulative effect from all the transitions near the triple points | [['the', 'complex', 'optical', 'conductivity', 'of', 'the', 'halfheusler', 'compound', 'gdptbi', 'is', 'measured', 'in', 'a', 'frequency', 'range', 'from', '20', 'to', '22', '000', 'cm1', '25', 'mev', '273', 'ev', 'at', 'temperatures', 'down', 'to', '10', 'k', 'in', 'zero', 'magnetic', 'field', 'we', 'find', 'the', 'real', 'part', 'of', 'the', 'conductivity', 'sigma_1omega', 'to', 'be', 'almost', 'perfectly', 'linear', 'in', 'frequency', 'over', 'a', 'broad', 'range', 'from', '50', 'to', '800', 'cm1', 'sim', '6', '100', 'mev', 'for', 't', 'leq', '50', 'k', 'this', 'linearity', 'strongly', 'suggests', 'the', 'presence', 'of', 'threedimensional', 'linear', 'electronic', 'bands', 'with', 'band', 'crossings', 'nodes', 'near', 'the', 'chemical', 'potential', 'bandstructure', 'calculations', 'show', 'the', 'presence', 'of', 'triple', 'points', 'where', 'one', 'doubly', 'degenerate', 'and', 'one', 'nondegenerate', 'band', 'cross', 'each', 'other', 'in', 'close', 'vicinity', 'of', 'the', 'chemical', 'potential', 'from', 'a', 'comparison', 'of', 'our', 'data', 'with', 'the', 'optical', 'conductivity', 'computed', 'from', 'the', 'band', 'structure', 'we', 'conclude', 'that', 'the', 'observed', 'nearly', 'linear', 'sigma_1omega', 'originates', 'as', 'a', 'cumulative', 'effect', 'from', 'all', 'the', 'transitions', 'near', 'the', 'triple', 'points']] | [-0.12355721430697789, 0.14593554263856884, 0.019307904342810312, -0.030651952349580826, -0.009137819675185408, -0.12123895552630226, 0.1366206318885088, 0.3767716229955355, -0.2974022355178992, -0.3337694968904058, 0.021673395320152243, -0.3648732888326049, -0.06944532241672277, 0.1895141482492909, 0.08011225427190463, -0.020095720095559953, 0.01344517861182491, 0.021279624293480688, -0.08775403941515833, -0.17478487285785377, 0.2543853086854021, 0.033873966156194604, 0.2494926179635028, 0.08284721131126085, 0.0228904350544326, -0.0005688995444991937, 0.08487008763321986, -0.01657212754711509, -0.12701289798002108, 0.022689186204224825, 0.2968338324626287, -0.09121671676946183, 0.20414610677864403, -0.30277723585255445, -0.18938043871894478, 0.06755455096252262, 0.09394622740335762, 0.06567608470407625, -0.0020162752674271664, -0.22518468357001742, 0.10823398106188203, -0.13138320998443911, -0.17717610718061527, -0.01201208854171758, 0.005771155932452529, -0.040388386864215135, -0.22988917701450798, 0.12179197271858963, -0.01848124069472154, 0.1317169411802024, -0.12082958189149698, -0.20033340465161018, -0.09132509659510106, 0.03726959114350999, -0.002064755268705388, 0.05462019995165368, 0.14582615805168947, -0.06200204749436428, -0.07820908147764082, 0.4056859650773307, -0.12257548654840017, -0.015525095822910468, 0.1795741553728779, -0.2433406936377287, -0.064855012545983, 0.2683901405458649, 0.11688913769709568, 0.08966837498048941, -0.11369717368118776, 0.08705704996789185, 0.005807177952180306, 0.2078226015115312, 0.08596918005806704, 0.053379777291168766, 0.24917808345208564, 0.12518624767893927, 0.030285500021030507, 0.08501395148729594, -0.18860926013750334, -0.025113759217783808, -0.2527646591265996, -0.11006364674307406, -0.17858656036434695, 0.12259178831242025, -0.11849816373539701, -0.14915297497995197, 0.4236023063166067, 0.10307029381394386, 0.2562269592781862, 0.007513678177880744, 0.22860356494163472, 0.1146437538197885, 0.10021849347278476, 0.1076968150488877, 0.28730078611522913, 0.15942164783521245, 0.12536582749259348, -0.2116662008020406, -0.05251118802775939, -0.08043869510913888] |
1,803.00841 | Gradient-based Sampling: An Adaptive Importance Sampling for
Least-squares | In modern data analysis, random sampling is an efficient and widely-used
strategy to overcome the computational difficulties brought by large sample
size. In previous studies, researchers conducted random sampling which is
according to the input data but independent on the response variable, however
the response variable may also be informative for sampling. In this paper we
propose an adaptive sampling called the gradient-based sampling which is
dependent on both the input data and the output for fast solving of
least-square (LS) problems. We draw the data points by random sampling from the
full data according to their gradient values. This sampling is computationally
saving, since the running time of computing the sampling probabilities is
reduced to O(nd) where n is the full sample size and d is the dimension of the
input. Theoretically, we establish an error bound analysis of the general
importance sampling with respect to LS solution from full data. The result
establishes an improved performance of the use of our gradient- based sampling.
Synthetic and real data sets are used to empirically argue that the
gradient-based sampling has an obvious advantage over existing sampling methods
from two aspects of statistical efficiency and computational saving.
| stat.ML cs.LG | in modern data analysis random sampling is an efficient and widelyused strategy to overcome the computational difficulties brought by large sample size in previous studies researchers conducted random sampling which is according to the input data but independent on the response variable however the response variable may also be informative for sampling in this paper we propose an adaptive sampling called the gradientbased sampling which is dependent on both the input data and the output for fast solving of leastsquare ls problems we draw the data points by random sampling from the full data according to their gradient values this sampling is computationally saving since the running time of computing the sampling probabilities is reduced to ond where n is the full sample size and d is the dimension of the input theoretically we establish an error bound analysis of the general importance sampling with respect to ls solution from full data the result establishes an improved performance of the use of our gradient based sampling synthetic and real data sets are used to empirically argue that the gradientbased sampling has an obvious advantage over existing sampling methods from two aspects of statistical efficiency and computational saving | [['in', 'modern', 'data', 'analysis', 'random', 'sampling', 'is', 'an', 'efficient', 'and', 'widelyused', 'strategy', 'to', 'overcome', 'the', 'computational', 'difficulties', 'brought', 'by', 'large', 'sample', 'size', 'in', 'previous', 'studies', 'researchers', 'conducted', 'random', 'sampling', 'which', 'is', 'according', 'to', 'the', 'input', 'data', 'but', 'independent', 'on', 'the', 'response', 'variable', 'however', 'the', 'response', 'variable', 'may', 'also', 'be', 'informative', 'for', 'sampling', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adaptive', 'sampling', 'called', 'the', 'gradientbased', 'sampling', 'which', 'is', 'dependent', 'on', 'both', 'the', 'input', 'data', 'and', 'the', 'output', 'for', 'fast', 'solving', 'of', 'leastsquare', 'ls', 'problems', 'we', 'draw', 'the', 'data', 'points', 'by', 'random', 'sampling', 'from', 'the', 'full', 'data', 'according', 'to', 'their', 'gradient', 'values', 'this', 'sampling', 'is', 'computationally', 'saving', 'since', 'the', 'running', 'time', 'of', 'computing', 'the', 'sampling', 'probabilities', 'is', 'reduced', 'to', 'ond', 'where', 'n', 'is', 'the', 'full', 'sample', 'size', 'and', 'd', 'is', 'the', 'dimension', 'of', 'the', 'input', 'theoretically', 'we', 'establish', 'an', 'error', 'bound', 'analysis', 'of', 'the', 'general', 'importance', 'sampling', 'with', 'respect', 'to', 'ls', 'solution', 'from', 'full', 'data', 'the', 'result', 'establishes', 'an', 'improved', 'performance', 'of', 'the', 'use', 'of', 'our', 'gradient', 'based', 'sampling', 'synthetic', 'and', 'real', 'data', 'sets', 'are', 'used', 'to', 'empirically', 'argue', 'that', 'the', 'gradientbased', 'sampling', 'has', 'an', 'obvious', 'advantage', 'over', 'existing', 'sampling', 'methods', 'from', 'two', 'aspects', 'of', 'statistical', 'efficiency', 'and', 'computational', 'saving']] | [-0.05223456564416097, 0.058472578941863904, -0.10997742776366584, 0.06759103929427769, -0.08596123228568187, -0.11144768281575046, 0.1038531036084272, 0.4106354602461274, -0.3012261345869091, -0.3381683447171915, 0.1422374040664878, -0.24551057168826235, -0.1017362485500289, 0.20581711863928714, -0.1241222357278132, 0.09201421792600316, 0.10279121616061039, 0.004377930472382737, -0.06496107819735966, -0.29493963279227164, 0.26523624617502395, 0.10879256287861502, 0.3385595814395828, -0.05566339234485844, 0.10547321763461064, 0.028437109536439333, -0.07971927195286312, 0.0010465850023438133, -0.11093205535627912, 0.1413294762458066, 0.25804090359943166, 0.18454815709734007, 0.33096125899686424, -0.3897873542248951, -0.18205240267674028, 0.12189906166374759, 0.1353035324234232, 0.11618483941505668, -0.051687322088947454, -0.2470093892844687, 0.073044360466396, -0.10254774214274387, -0.055334859024166, -0.10739022441832397, -0.006075474706615515, 0.03160861285278092, -0.3390127370313642, 0.035714788928948256, 0.03252073676120915, 0.057011848112312975, -0.0020737186828297255, -0.15672217838662358, 0.04300023691591613, 0.10972013024685356, 0.05538252407926026, 0.03917422132958956, 0.08995258939797579, -0.08731529919305334, -0.13934514860310568, 0.3484706288075954, -0.01800310477699498, -0.22710427600857305, 0.1743984538600851, -0.07281427575762237, -0.13523569696956328, 0.17400136337554092, 0.2053168834598385, 0.10796682617442711, -0.1433840722772222, 0.0836172313680565, -0.0019156434218668696, 0.16992747701401942, -0.009115457310232566, 0.004510314819854471, 0.09619814639811777, 0.21348938144280144, 0.09084221764661485, 0.1378841956121242, -0.14154269264495062, -0.12136074919123581, -0.2399263995165374, -0.11744348286812993, -0.28329738894439666, -0.0029045777634107675, -0.15636462918185773, -0.15519570286957746, 0.3675705391327439, 0.22392352508336097, 0.20191254478590895, 0.09594589179774113, 0.35272010769411394, 0.13521291387975357, 0.05185023059732834, 0.103816544338068, 0.1844269417670702, 0.0856735436257618, 0.07329144216494796, -0.20536064013228916, 0.08415473086923729, 0.009377805511396246] |
1,803.00842 | Searching for scalar boson decaying into light $Z'$ boson at collider
experiments in $U(1)_{L_\mu-L_\tau}$ model | We study a model with $U(1)_{L_\mu - L_\tau}$ gauge symmetry and discuss
collider searches for a scalar boson, which breaks $U(1)_{L_\mu - L_\tau}$
symmetry spontaneously, decaying into light $Z'$ gauge boson. In this model,
the new gauge boson, $Z'$, with a mass lighter than $\mathcal{O}(100)$ MeV,
plays a role in explaining the anomalous magnetic moment of muon via one-loop
contribution. For the gauge boson to have such a low mass, the scalar boson,
$\phi$ with $\mathcal{O}(100)$ GeV mass appears associated with the symmetry
breaking. We investigate experimental constraints on $U(1)_{L_\mu - L_\tau}$
gauge coupling, kinetic mixing, and mixing between the SM Higgs and $\phi$.
Then collider search is discussed considering $\phi$ production followed by
decay process $\phi \to Z' Z'$ at the large hadron collider and the
international linear collider. We also estimate discovery significance at the
linear collider taking into account relevant kinematical cut effects.
| hep-ph hep-ex | we study a model with u1_l_mu l_tau gauge symmetry and discuss collider searches for a scalar boson which breaks u1_l_mu l_tau symmetry spontaneously decaying into light z gauge boson in this model the new gauge boson z with a mass lighter than mathcalo100 mev plays a role in explaining the anomalous magnetic moment of muon via oneloop contribution for the gauge boson to have such a low mass the scalar boson phi with mathcalo100 gev mass appears associated with the symmetry breaking we investigate experimental constraints on u1_l_mu l_tau gauge coupling kinetic mixing and mixing between the sm higgs and phi then collider search is discussed considering phi production followed by decay process phi to z z at the large hadron collider and the international linear collider we also estimate discovery significance at the linear collider taking into account relevant kinematical cut effects | [['we', 'study', 'a', 'model', 'with', 'u1_l_mu', 'l_tau', 'gauge', 'symmetry', 'and', 'discuss', 'collider', 'searches', 'for', 'a', 'scalar', 'boson', 'which', 'breaks', 'u1_l_mu', 'l_tau', 'symmetry', 'spontaneously', 'decaying', 'into', 'light', 'z', 'gauge', 'boson', 'in', 'this', 'model', 'the', 'new', 'gauge', 'boson', 'z', 'with', 'a', 'mass', 'lighter', 'than', 'mathcalo100', 'mev', 'plays', 'a', 'role', 'in', 'explaining', 'the', 'anomalous', 'magnetic', 'moment', 'of', 'muon', 'via', 'oneloop', 'contribution', 'for', 'the', 'gauge', 'boson', 'to', 'have', 'such', 'a', 'low', 'mass', 'the', 'scalar', 'boson', 'phi', 'with', 'mathcalo100', 'gev', 'mass', 'appears', 'associated', 'with', 'the', 'symmetry', 'breaking', 'we', 'investigate', 'experimental', 'constraints', 'on', 'u1_l_mu', 'l_tau', 'gauge', 'coupling', 'kinetic', 'mixing', 'and', 'mixing', 'between', 'the', 'sm', 'higgs', 'and', 'phi', 'then', 'collider', 'search', 'is', 'discussed', 'considering', 'phi', 'production', 'followed', 'by', 'decay', 'process', 'phi', 'to', 'z', 'z', 'at', 'the', 'large', 'hadron', 'collider', 'and', 'the', 'international', 'linear', 'collider', 'we', 'also', 'estimate', 'discovery', 'significance', 'at', 'the', 'linear', 'collider', 'taking', 'into', 'account', 'relevant', 'kinematical', 'cut', 'effects']] | [-0.1162320714609997, 0.3270447043884363, -0.04282554270621467, 0.17908744602771715, -0.11828632280006647, -0.21785025673729558, 0.02245082941200988, 0.3221720899097048, -0.21353710878809745, -0.2847833560545232, -0.005392962969005942, -0.28018373056881496, 0.03596770207330884, 0.08288800654040611, 0.1604456384926774, 0.060339414631830644, 0.03439819874157282, -0.0028502742069532404, -0.0727869541989965, -0.2280239208073883, 0.2617868362971536, 0.06195023162876601, 0.16869372841283367, 0.09513163378696654, 0.12019499711093161, 0.05411136866436451, -0.020467359033312284, -0.12258069856756634, -0.11704484556339212, 0.03069402124094484, 0.12662220298527524, 0.03194683456428714, 0.13000736336087013, -0.3025894819765345, -0.09665421842616963, 0.19475670056938604, 0.16240032017230988, 0.07401335670961184, -0.15530237636668934, -0.3667520937368183, 0.0989341210131045, -0.23131348141241115, -0.09931460170521421, -0.050652190992121024, -0.045174123497901265, -0.16323372092703684, -0.3530446734943694, 0.11226131719959594, -0.07212985976814078, 0.07141791403430377, 0.030724022651442907, -0.16512131990890924, -0.128483167341487, -0.10861490735575766, 0.23797544981560578, 0.0739306308788254, 0.1769742915493117, -0.21598387562826118, -0.15858182733735213, 0.4402549117738446, -0.11003930203608885, -0.15211059571361052, 0.14457364185954202, -0.19590674132642732, -0.23227678008377145, 0.13197718063773184, 0.29203864997187695, -0.0013715292936047683, -0.16272575957895993, 0.27271531220754264, -0.017177679031351385, 0.16087555268720782, 0.02494172983105991, 0.054643497470167134, 0.30033850770157117, 0.21868033882986, 0.02842239245537903, 0.05495913668659392, -0.0680902309482103, -0.06104362683396761, -0.4926451674395508, -0.14552767314928602, -0.003454854571866197, 0.07940147179781322, -0.04491032230044174, -0.028463563806917908, 0.3748998118082543, 0.09292479730178635, 0.28508661232784493, 0.021926466845321124, 0.2560045457627442, 0.12738782901706017, 0.13885917970475128, 0.01714400421342425, 0.31221727704486024, 0.19803463645406405, 0.10626649160354913, -0.27369241159852153, -0.08416075495208476, 0.1218517023916975] |
1,803.00843 | Beyond series-parallel concurrent systems: the case of arch processes | In this paper we focus on concurrent processes built on synchronization by
means of futures. This concept is an abstraction for processes based on a main
execution thread but allowing to delay some computations. The structure of a
general concurrent process with futures is more or less a directed acyclic
graph. Since the quantitative study of such increasingly labeled graphs
(directly related to processes) seems out of reach, we restrict ourselves to
the study of arch processes, a simplistic model of processes with futures. They
are based on two parameters related to their sizes and their numbers of arches.
The increasingly labeled structures seems not to be specifiable in the sense of
Analytic Combinatorics, but we manage to derive a recurrence equation for the
enumeration. For this model we first exhibit an exact and an asymptotic formula
for the number of runs of a given process. The second main contribution is
composed of an uniform random sampler algorithm and an unranking one that allow
efficient generation and exhaustive enumeration of the runs of a given arch
process.
| cs.DM | in this paper we focus on concurrent processes built on synchronization by means of futures this concept is an abstraction for processes based on a main execution thread but allowing to delay some computations the structure of a general concurrent process with futures is more or less a directed acyclic graph since the quantitative study of such increasingly labeled graphs directly related to processes seems out of reach we restrict ourselves to the study of arch processes a simplistic model of processes with futures they are based on two parameters related to their sizes and their numbers of arches the increasingly labeled structures seems not to be specifiable in the sense of analytic combinatorics but we manage to derive a recurrence equation for the enumeration for this model we first exhibit an exact and an asymptotic formula for the number of runs of a given process the second main contribution is composed of an uniform random sampler algorithm and an unranking one that allow efficient generation and exhaustive enumeration of the runs of a given arch process | [['in', 'this', 'paper', 'we', 'focus', 'on', 'concurrent', 'processes', 'built', 'on', 'synchronization', 'by', 'means', 'of', 'futures', 'this', 'concept', 'is', 'an', 'abstraction', 'for', 'processes', 'based', 'on', 'a', 'main', 'execution', 'thread', 'but', 'allowing', 'to', 'delay', 'some', 'computations', 'the', 'structure', 'of', 'a', 'general', 'concurrent', 'process', 'with', 'futures', 'is', 'more', 'or', 'less', 'a', 'directed', 'acyclic', 'graph', 'since', 'the', 'quantitative', 'study', 'of', 'such', 'increasingly', 'labeled', 'graphs', 'directly', 'related', 'to', 'processes', 'seems', 'out', 'of', 'reach', 'we', 'restrict', 'ourselves', 'to', 'the', 'study', 'of', 'arch', 'processes', 'a', 'simplistic', 'model', 'of', 'processes', 'with', 'futures', 'they', 'are', 'based', 'on', 'two', 'parameters', 'related', 'to', 'their', 'sizes', 'and', 'their', 'numbers', 'of', 'arches', 'the', 'increasingly', 'labeled', 'structures', 'seems', 'not', 'to', 'be', 'specifiable', 'in', 'the', 'sense', 'of', 'analytic', 'combinatorics', 'but', 'we', 'manage', 'to', 'derive', 'a', 'recurrence', 'equation', 'for', 'the', 'enumeration', 'for', 'this', 'model', 'we', 'first', 'exhibit', 'an', 'exact', 'and', 'an', 'asymptotic', 'formula', 'for', 'the', 'number', 'of', 'runs', 'of', 'a', 'given', 'process', 'the', 'second', 'main', 'contribution', 'is', 'composed', 'of', 'an', 'uniform', 'random', 'sampler', 'algorithm', 'and', 'an', 'unranking', 'one', 'that', 'allow', 'efficient', 'generation', 'and', 'exhaustive', 'enumeration', 'of', 'the', 'runs', 'of', 'a', 'given', 'arch', 'process']] | [-0.1224919248177962, 0.09427061610788404, -0.09103231369859754, 0.08685045607244268, -0.11362028902785926, -0.09753210941266457, 0.08045097150626766, 0.39050014752179046, -0.2706395202003272, -0.2921846964893768, 0.1258928922365425, -0.23073973140474094, -0.1308707757392572, 0.21117220026780298, -0.06848911581676727, 0.03211959484322681, 0.0670139879332908, 0.04318273862913293, 0.002700740516864521, -0.2533055434529972, 0.3096052269414488, 0.0797047793317986, 0.22670014793221643, 0.018556706736253648, 0.09042161605241945, 0.014858883166275287, -0.08146917525847248, -0.01377154442239658, -0.12698339731492514, 0.15555408167900087, 0.232571627815796, 0.1465604376984434, 0.2692304823013538, -0.4567485261382272, -0.14628556114226832, 0.11718889350061026, 0.12444276528236967, 0.10229648711780708, 0.007119570280892885, -0.23828961854895292, 0.0825692274164419, -0.15984344874485001, -0.09881868922430495, -0.060404533389455894, 0.04154343170634771, 0.03900592027450412, -0.2916530525975461, -0.00539643583966598, 0.11156252063850289, 0.060753471233834656, -0.0045060159304405505, -0.08205266069360394, -0.0010713852171149462, 0.11945703260384836, 0.029369396854204845, -0.01842375534933881, 0.08105605939570236, -0.1279929803860621, -0.17383180804732176, 0.37717891321912156, 0.008421094252827898, -0.20155161767040436, 0.2062907190927657, -0.09690225150404592, -0.18349538340712082, 0.1189066190956592, 0.2031666002148173, 0.1538845643632661, -0.1689419484113397, 0.054902510079528906, -0.04226835460354716, 0.16686899176046335, 0.06094522371435654, -0.023173157629191265, 0.17312080588581114, 0.20077056907601443, 0.07772130535462987, 0.17945089066956235, -0.016700718438747406, -0.13986954775160063, -0.2932488100740027, -0.16320866226326505, -0.15715899626792823, 0.03583166150826406, -0.0835992012499821, -0.2384937689968485, 0.36567768768938835, 0.17822375414777272, 0.21311882588128417, 0.11272215584850749, 0.27835853494069734, 0.11975254677926679, 0.046909114451142354, 0.08587900006954195, 0.12492582223876011, 0.13296938960251034, 0.08848712603051194, -0.13910778399999515, 0.1189847035526882, 0.05486159828507294] |
1,803.00844 | Production and Integration of the ATLAS Insertable B-Layer | During the shutdown of the CERN Large Hadron Collider in 2013-2014, an
additional pixel layer was installed between the existing Pixel detector of the
ATLAS experiment and a new, smaller radius beam pipe. The motivation for this
new pixel layer, the Insertable B-Layer (IBL), was to maintain or improve the
robustness and performance of the ATLAS tracking system, given the higher
instantaneous and integrated luminosities realised following the shutdown.
Because of the extreme radiation and collision rate environment, several new
radiation-tolerant sensor and electronic technologies were utilised for this
layer. This paper reports on the IBL construction and integration prior to its
operation in the ATLAS detector.
| physics.ins-det hep-ex | during the shutdown of the cern large hadron collider in 20132014 an additional pixel layer was installed between the existing pixel detector of the atlas experiment and a new smaller radius beam pipe the motivation for this new pixel layer the insertable blayer ibl was to maintain or improve the robustness and performance of the atlas tracking system given the higher instantaneous and integrated luminosities realised following the shutdown because of the extreme radiation and collision rate environment several new radiationtolerant sensor and electronic technologies were utilised for this layer this paper reports on the ibl construction and integration prior to its operation in the atlas detector | [['during', 'the', 'shutdown', 'of', 'the', 'cern', 'large', 'hadron', 'collider', 'in', '20132014', 'an', 'additional', 'pixel', 'layer', 'was', 'installed', 'between', 'the', 'existing', 'pixel', 'detector', 'of', 'the', 'atlas', 'experiment', 'and', 'a', 'new', 'smaller', 'radius', 'beam', 'pipe', 'the', 'motivation', 'for', 'this', 'new', 'pixel', 'layer', 'the', 'insertable', 'blayer', 'ibl', 'was', 'to', 'maintain', 'or', 'improve', 'the', 'robustness', 'and', 'performance', 'of', 'the', 'atlas', 'tracking', 'system', 'given', 'the', 'higher', 'instantaneous', 'and', 'integrated', 'luminosities', 'realised', 'following', 'the', 'shutdown', 'because', 'of', 'the', 'extreme', 'radiation', 'and', 'collision', 'rate', 'environment', 'several', 'new', 'radiationtolerant', 'sensor', 'and', 'electronic', 'technologies', 'were', 'utilised', 'for', 'this', 'layer', 'this', 'paper', 'reports', 'on', 'the', 'ibl', 'construction', 'and', 'integration', 'prior', 'to', 'its', 'operation', 'in', 'the', 'atlas', 'detector']] | [-0.056667879371790686, 0.08799235075051248, -0.05370723532739086, 0.00023273570532692927, -0.03407893408629521, -0.14399636086842446, -0.03338978599178143, 0.3812607299997776, -0.1937470517216999, -0.3945378933545794, 0.14694948438511482, -0.2986075026897069, 0.0025911776187925416, 0.17404711645348955, -0.10288420094560101, 0.16308242910287005, 0.13056505001889906, -0.03045412419564047, -0.039741566101150046, -0.24342089503455175, 0.24614424028251075, 0.24148422848676968, 0.3203966827806364, 0.06641321647128909, 0.1674117685217306, -0.011811679453266976, -0.07121572227034474, -0.06144762834507937, -0.07917492347769439, 0.11704433240240143, 0.2594652018187759, 0.11569798968854213, 0.20616081934074096, -0.4566948158300926, -0.10806364268276658, 0.07099303359135324, 0.08436657205467747, 0.0027632397277472173, -0.08704581943005497, -0.3161592025866854, 0.10471524349979569, -0.28162923582316, -0.11563825078970083, 0.09097055241326306, -0.0009463410824537277, -0.02239131178950595, -0.26451965002560657, -0.04219015986467146, 0.010109163350730298, 0.06963227200539451, -0.03949131368916203, -0.13626187028707154, -0.030324038309610894, 0.10714164645863679, -0.024909223421154734, 0.0608368751965028, 0.21456677089749931, -0.15983305282664495, -0.1134460594278769, 0.2441396021815104, 0.0031578231942361204, -0.09071719425373545, 0.1952518114611228, -0.1889492712009733, -0.08341330944812883, 0.13182132959008983, 0.26451670918417836, 0.054561746915993845, -0.22038646249500948, 0.02076122719276627, 0.05829923878158399, 0.1962046640986037, 0.08672095027482399, 0.04362683248854129, 0.2113283368493387, 0.30729677596904126, 0.0827926526152938, 0.1525010046610069, -0.2047120581585566, 0.0004310328774502344, -0.3869889464368608, -0.15445900757859077, -0.1181598604661108, -0.04308502417749716, -0.01972393237547209, -0.07831377797176904, 0.4142039774734283, 0.16201751347126386, 0.20463540710978836, -0.02650346641350433, 0.32924735474739675, 0.03815351953407941, 0.1541073126057446, 0.015907403027663816, 0.32864783681650583, 0.05842193974417016, 0.25857279757385915, -0.1993893517733978, 0.06307044026015379, 0.059111714824407455] |
1,803.00845 | Topological Dirac semimetal phase in the iron-based superconductor
Fe(Te,Se) | Topological Dirac semimetals (TDSs) exhibit bulk Dirac cones protected by
time reversal and crystal symmetry, as well as surface states originating from
non-trivial topology. While there is a manifold possible onset of
superconducting order in such systems, few observations of intrinsic
superconductivity have so far been reported for TDSs. We observe evidence for a
TDS phase in FeTe$_{1-x}$Se$_x$ ($x$ = 0.45), one of the high transition
temperature ($T_c$) iron-based superconductors. In angle-resolved photoelectron
spectroscopy (ARPES) and transport experiments, we find spin-polarized states
overlapping with the bulk states on the (001) surface, and linear
magnetoresistance (MR) starting from 6 T. Combined, this strongly suggests the
existence of a TDS phase, which is confirmed by theoretical calculations. In
total, the topological electronic states in Fe(Te,Se) provide a promising high
$T_c$ platform to realize multiple topological superconducting phases.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | topological dirac semimetals tdss exhibit bulk dirac cones protected by time reversal and crystal symmetry as well as surface states originating from nontrivial topology while there is a manifold possible onset of superconducting order in such systems few observations of intrinsic superconductivity have so far been reported for tdss we observe evidence for a tds phase in fete_1xse_x x 045 one of the high transition temperature t_c ironbased superconductors in angleresolved photoelectron spectroscopy arpes and transport experiments we find spinpolarized states overlapping with the bulk states on the 001 surface and linear magnetoresistance mr starting from 6 t combined this strongly suggests the existence of a tds phase which is confirmed by theoretical calculations in total the topological electronic states in fetese provide a promising high t_c platform to realize multiple topological superconducting phases | [['topological', 'dirac', 'semimetals', 'tdss', 'exhibit', 'bulk', 'dirac', 'cones', 'protected', 'by', 'time', 'reversal', 'and', 'crystal', 'symmetry', 'as', 'well', 'as', 'surface', 'states', 'originating', 'from', 'nontrivial', 'topology', 'while', 'there', 'is', 'a', 'manifold', 'possible', 'onset', 'of', 'superconducting', 'order', 'in', 'such', 'systems', 'few', 'observations', 'of', 'intrinsic', 'superconductivity', 'have', 'so', 'far', 'been', 'reported', 'for', 'tdss', 'we', 'observe', 'evidence', 'for', 'a', 'tds', 'phase', 'in', 'fete_1xse_x', 'x', '045', 'one', 'of', 'the', 'high', 'transition', 'temperature', 't_c', 'ironbased', 'superconductors', 'in', 'angleresolved', 'photoelectron', 'spectroscopy', 'arpes', 'and', 'transport', 'experiments', 'we', 'find', 'spinpolarized', 'states', 'overlapping', 'with', 'the', 'bulk', 'states', 'on', 'the', '001', 'surface', 'and', 'linear', 'magnetoresistance', 'mr', 'starting', 'from', '6', 't', 'combined', 'this', 'strongly', 'suggests', 'the', 'existence', 'of', 'a', 'tds', 'phase', 'which', 'is', 'confirmed', 'by', 'theoretical', 'calculations', 'in', 'total', 'the', 'topological', 'electronic', 'states', 'in', 'fetese', 'provide', 'a', 'promising', 'high', 't_c', 'platform', 'to', 'realize', 'multiple', 'topological', 'superconducting', 'phases']] | [-0.21002749344264504, 0.24734908880130735, -0.06566065389996589, 0.018375775174310764, -0.05849364519452871, -0.1743109717464714, 0.14937417913026718, 0.37729417581333596, -0.22618904527374056, -0.32050909858141374, -0.0010167502323791052, -0.3790006292566879, -0.14054478814046997, 0.1714121730730577, 0.053803030974857176, 0.09716172491325371, -0.04809140044250595, -0.06588512311716488, -0.16269073342781082, -0.1925444008448898, 0.3060543181082762, -0.030836798681585648, 0.3403146595297965, 0.08420356120149702, 0.031237418554834466, -0.054364615005315906, 0.12760869777976855, 0.04100106658636412, -0.15579817018040748, -0.009148356294495735, 0.32836483920396153, -0.10033211164496172, 0.15270765193863145, -0.43003149780986916, -0.2713108176796405, -0.024203323733075453, 0.12245858011336358, 0.1234816703745581, -0.1425789198996725, -0.32273183216048934, 0.07630671562501855, -0.11123206754868377, -0.1239654593736128, -0.13818051470026596, -0.030013178207619645, -0.09285073085912197, -0.15370456507575433, 0.10521109950721765, 0.0058934968842346384, 0.13299347841611553, -0.08869335355946044, -0.10749153921957504, -0.14536854609615324, 0.013264621010244781, 0.029865343544159585, 0.07386124088192608, 0.07881235714424957, -0.07769536777701813, -0.16389673605992167, 0.3454658916331272, -0.04348076182441897, -0.03312178915922544, 0.18171890691416198, -0.20177989300705731, -0.12223378077337045, 0.18396872779660262, 0.08629426310045658, 0.11515299204750848, -0.0844822957653052, 0.0738971905801063, -0.03067178144328185, 0.16897380329779724, 0.012425935999212314, 0.15310325439491157, 0.2965279472783319, 0.1976643434148838, 0.06756459426225177, 0.10700700957842393, -0.14192367552035948, 0.025207773017359953, -0.23220670590248418, -0.21270918853775556, -0.248027919060568, 0.1039308827029847, -0.009637382829847656, -0.1904720152700459, 0.41601766765451254, 0.10569316186896983, 0.2205212530158738, -0.0868606419526666, 0.1979250543604869, 0.07530361454787929, 0.08138097597220079, 0.05309678981021575, 0.2601712405222899, 0.1534866970136706, 0.1248436406195692, -0.26834275774525673, 0.0641075100579452, -0.008451554535040215] |
1,803.00846 | Direct observation of multiple topological phases in the iron-based
superconductor Li(Fe,Co)As | Topological insulators/semimetals and unconventional iron-based
superconductors have attracted major attentions in condensed matter physics in
the past 10 years. However, there is little overlap between these two fields,
although the combination of topological states and superconducting states will
produce more exotic topologically superconducting states and Majorana bound
states (MBS), a promising candidate for realizing topological quantum
computations. With the progress in laser-based spin-resolved and angle-resolved
photoemission spectroscopy (ARPES) with very high energy- and
momentum-resolution, we directly resolved the topological insulator (TI) phase
and topological Dirac semimetal (TDS) phase near Fermi level ($E_F$) in the
iron-based superconductor Li(Fe,Co)As. The TI and TDS phases can be separately
tuned to $E_F$ by Co doping, allowing a detailed study of different
superconducting topological states in the same material. Together with the
topological states in Fe(Te,Se), our study shows the ubiquitous coexistence of
superconductivity and multiple topological phases in iron-based
superconductors, and opens a new age for the study of high-Tc iron-based
superconductors and topological superconductivity.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | topological insulatorssemimetals and unconventional ironbased superconductors have attracted major attentions in condensed matter physics in the past 10 years however there is little overlap between these two fields although the combination of topological states and superconducting states will produce more exotic topologically superconducting states and majorana bound states mbs a promising candidate for realizing topological quantum computations with the progress in laserbased spinresolved and angleresolved photoemission spectroscopy arpes with very high energy and momentumresolution we directly resolved the topological insulator ti phase and topological dirac semimetal tds phase near fermi level e_f in the ironbased superconductor lifecoas the ti and tds phases can be separately tuned to e_f by co doping allowing a detailed study of different superconducting topological states in the same material together with the topological states in fetese our study shows the ubiquitous coexistence of superconductivity and multiple topological phases in ironbased superconductors and opens a new age for the study of hightc ironbased superconductors and topological superconductivity | [['topological', 'insulatorssemimetals', 'and', 'unconventional', 'ironbased', 'superconductors', 'have', 'attracted', 'major', 'attentions', 'in', 'condensed', 'matter', 'physics', 'in', 'the', 'past', '10', 'years', 'however', 'there', 'is', 'little', 'overlap', 'between', 'these', 'two', 'fields', 'although', 'the', 'combination', 'of', 'topological', 'states', 'and', 'superconducting', 'states', 'will', 'produce', 'more', 'exotic', 'topologically', 'superconducting', 'states', 'and', 'majorana', 'bound', 'states', 'mbs', 'a', 'promising', 'candidate', 'for', 'realizing', 'topological', 'quantum', 'computations', 'with', 'the', 'progress', 'in', 'laserbased', 'spinresolved', 'and', 'angleresolved', 'photoemission', 'spectroscopy', 'arpes', 'with', 'very', 'high', 'energy', 'and', 'momentumresolution', 'we', 'directly', 'resolved', 'the', 'topological', 'insulator', 'ti', 'phase', 'and', 'topological', 'dirac', 'semimetal', 'tds', 'phase', 'near', 'fermi', 'level', 'e_f', 'in', 'the', 'ironbased', 'superconductor', 'lifecoas', 'the', 'ti', 'and', 'tds', 'phases', 'can', 'be', 'separately', 'tuned', 'to', 'e_f', 'by', 'co', 'doping', 'allowing', 'a', 'detailed', 'study', 'of', 'different', 'superconducting', 'topological', 'states', 'in', 'the', 'same', 'material', 'together', 'with', 'the', 'topological', 'states', 'in', 'fetese', 'our', 'study', 'shows', 'the', 'ubiquitous', 'coexistence', 'of', 'superconductivity', 'and', 'multiple', 'topological', 'phases', 'in', 'ironbased', 'superconductors', 'and', 'opens', 'a', 'new', 'age', 'for', 'the', 'study', 'of', 'hightc', 'ironbased', 'superconductors', 'and', 'topological', 'superconductivity']] | [-0.2187081492639955, 0.29557526175008864, -0.056627495144054574, 0.05640408894487908, -0.07024848567462473, -0.2375061232040185, 0.17211933647657293, 0.36175686006182395, -0.20989991914855796, -0.29736774584641623, -0.06589856526430743, -0.3807380005787566, -0.1161978978058909, 0.1819220356831368, 0.024932181105345674, 0.10532499746413632, -0.06117915572106557, -0.11020769281957135, -0.21248263873323892, -0.2481898769923726, 0.3597728076314776, -0.04651512126160094, 0.3626589647101812, 0.10280108213301678, -0.0381525127662334, -0.06855162511412757, 0.1544576841435811, 0.0020123916544875354, -0.16127256743182317, 0.08164784543980616, 0.3974180157946528, -0.12022461411221035, 0.16004918214027425, -0.4659165352372066, -0.29002237648398577, -0.017394420228101923, 0.13367413989203814, 0.12938261368903536, -0.14228290406763391, -0.3715091136418892, 0.07730034653114963, -0.15490720356058962, -0.07614442339143569, -0.14668826273651267, -0.027140217631141533, -0.10213816804377912, -0.10103260307520065, 0.04222622999347418, -0.019070760084831582, 0.12316666121825974, -0.07868624515187159, -0.10572795494922302, -0.12022898289442367, 0.0106326636225688, 0.04134661977543787, 0.06256092794231467, 0.054173152001996364, -0.16033481870288815, -0.1624662798694657, 0.3278759906750096, 0.005152492286086832, -0.007861975160187239, 0.20966076061317007, -0.1679191369383593, -0.1263850325859099, 0.12351971609758085, 0.053267738524144924, 0.06513463200872424, -0.07691191179595841, 0.09232240843033102, -0.020627106791772182, 0.17267979046552437, 0.0005986657427073275, 0.21348458549605226, 0.36417712534795393, 0.2161567624520698, 0.0785774824183153, 0.11124061645702722, -0.13197954370960635, -0.011478315530719716, -0.2031947300310317, -0.27712243909650314, -0.24327563417163156, 0.05317319642771445, 0.02182490613297618, -0.20475611626756313, 0.4730638531768847, 0.13295160049613589, 0.18811321207000026, -0.16609486562943776, 0.2050006380597563, 0.06925823348911139, 0.06490324229681455, 0.03084426215679953, 0.22656453702212223, 0.18001402336986935, 0.1288057239433317, -0.28356479939751317, 0.06289712056728466, 0.004746732369369868] |
1,803.00847 | Vertically Sheared Horizontal Flow-Forming Instability in Stratified
Turbulence: Analytical Linear Stability Analysis of Statistical State
Dynamics Equilibria | Vertically banded zonal jets are frequently observed in weakly or
non-rotating stratified turbulence, with the quasi-biennial oscillation in the
equatorial stratosphere and the ocean's equatorial deep jets being two
examples. Explaining the formation of jets in stratified turbulence is a
fundamental problem in geophysical fluid dynamics. Statistical state dynamics
(SSD) provides powerful methods for analyzing turbulent systems exhibiting
emergent organization, such as banded jets. In SSD, dynamical equations are
written directly for the evolution of the turbulence statistics, enabling
direct analysis of the statistical interactions between the incoherent
component of the turbulence and the coherent large-scale structure component
that underlie jet formation. A second-order closure of SSD, known as S3T, has
previously been applied to show that meridionally banded jets emerge in
barotropic beta-plane turbulence via a statistical instability referred to as
the zonostrophic instability. Two-dimensional Boussinesq turbulence provides a
simple model of non-rotating stratified turbulence analogous to the beta-plane
model of planetary turbulence. Jets known as vertically sheared horizontal
flows (VSHFs) often emerge in simulations of Boussinesq turbulence, but their
dynamics is not yet clearly understood. In this work S3T analysis of the
zonostrophic instability is extended to study VSHF emergence in two-dimensional
Boussinesq turbulence using an analytical formulation of S3T amenable to
perturbation stability analysis. VSHFs are shown to form via an instability
that is analogous in stratified turbulence to the zonostrophic instability in
beta-plane turbulence. This instability is shown to be strikingly similar to
the zonostrophic instability, suggesting that jet emergence in both geostrophic
and non-rotating stratified turbulence may be understood as instances of the
same generic phenomenon.
| physics.flu-dyn physics.ao-ph | vertically banded zonal jets are frequently observed in weakly or nonrotating stratified turbulence with the quasibiennial oscillation in the equatorial stratosphere and the oceans equatorial deep jets being two examples explaining the formation of jets in stratified turbulence is a fundamental problem in geophysical fluid dynamics statistical state dynamics ssd provides powerful methods for analyzing turbulent systems exhibiting emergent organization such as banded jets in ssd dynamical equations are written directly for the evolution of the turbulence statistics enabling direct analysis of the statistical interactions between the incoherent component of the turbulence and the coherent largescale structure component that underlie jet formation a secondorder closure of ssd known as s3t has previously been applied to show that meridionally banded jets emerge in barotropic betaplane turbulence via a statistical instability referred to as the zonostrophic instability twodimensional boussinesq turbulence provides a simple model of nonrotating stratified turbulence analogous to the betaplane model of planetary turbulence jets known as vertically sheared horizontal flows vshfs often emerge in simulations of boussinesq turbulence but their dynamics is not yet clearly understood in this work s3t analysis of the zonostrophic instability is extended to study vshf emergence in twodimensional boussinesq turbulence using an analytical formulation of s3t amenable to perturbation stability analysis vshfs are shown to form via an instability that is analogous in stratified turbulence to the zonostrophic instability in betaplane turbulence this instability is shown to be strikingly similar to the zonostrophic instability suggesting that jet emergence in both geostrophic and nonrotating stratified turbulence may be understood as instances of the same generic phenomenon | [['vertically', 'banded', 'zonal', 'jets', 'are', 'frequently', 'observed', 'in', 'weakly', 'or', 'nonrotating', 'stratified', 'turbulence', 'with', 'the', 'quasibiennial', 'oscillation', 'in', 'the', 'equatorial', 'stratosphere', 'and', 'the', 'oceans', 'equatorial', 'deep', 'jets', 'being', 'two', 'examples', 'explaining', 'the', 'formation', 'of', 'jets', 'in', 'stratified', 'turbulence', 'is', 'a', 'fundamental', 'problem', 'in', 'geophysical', 'fluid', 'dynamics', 'statistical', 'state', 'dynamics', 'ssd', 'provides', 'powerful', 'methods', 'for', 'analyzing', 'turbulent', 'systems', 'exhibiting', 'emergent', 'organization', 'such', 'as', 'banded', 'jets', 'in', 'ssd', 'dynamical', 'equations', 'are', 'written', 'directly', 'for', 'the', 'evolution', 'of', 'the', 'turbulence', 'statistics', 'enabling', 'direct', 'analysis', 'of', 'the', 'statistical', 'interactions', 'between', 'the', 'incoherent', 'component', 'of', 'the', 'turbulence', 'and', 'the', 'coherent', 'largescale', 'structure', 'component', 'that', 'underlie', 'jet', 'formation', 'a', 'secondorder', 'closure', 'of', 'ssd', 'known', 'as', 's3t', 'has', 'previously', 'been', 'applied', 'to', 'show', 'that', 'meridionally', 'banded', 'jets', 'emerge', 'in', 'barotropic', 'betaplane', 'turbulence', 'via', 'a', 'statistical', 'instability', 'referred', 'to', 'as', 'the', 'zonostrophic', 'instability', 'twodimensional', 'boussinesq', 'turbulence', 'provides', 'a', 'simple', 'model', 'of', 'nonrotating', 'stratified', 'turbulence', 'analogous', 'to', 'the', 'betaplane', 'model', 'of', 'planetary', 'turbulence', 'jets', 'known', 'as', 'vertically', 'sheared', 'horizontal', 'flows', 'vshfs', 'often', 'emerge', 'in', 'simulations', 'of', 'boussinesq', 'turbulence', 'but', 'their', 'dynamics', 'is', 'not', 'yet', 'clearly', 'understood', 'in', 'this', 'work', 's3t', 'analysis', 'of', 'the', 'zonostrophic', 'instability', 'is', 'extended', 'to', 'study', 'vshf', 'emergence', 'in', 'twodimensional', 'boussinesq', 'turbulence', 'using', 'an', 'analytical', 'formulation', 'of', 's3t', 'amenable', 'to', 'perturbation', 'stability', 'analysis', 'vshfs', 'are', 'shown', 'to', 'form', 'via', 'an', 'instability', 'that', 'is', 'analogous', 'in', 'stratified', 'turbulence', 'to', 'the', 'zonostrophic', 'instability', 'in', 'betaplane', 'turbulence', 'this', 'instability', 'is', 'shown', 'to', 'be', 'strikingly', 'similar', 'to', 'the', 'zonostrophic', 'instability', 'suggesting', 'that', 'jet', 'emergence', 'in', 'both', 'geostrophic', 'and', 'nonrotating', 'stratified', 'turbulence', 'may', 'be', 'understood', 'as', 'instances', 'of', 'the', 'same', 'generic', 'phenomenon']] | [-0.1706760928491523, 0.19666256916531277, -0.10393919246168665, 0.17389700389369053, -0.06790503924462758, -0.06747891963950191, -0.11784573978569601, 0.2824662299148767, -0.30269220932226243, -0.2362591301437139, 0.09250018943522226, -0.18160962346308754, -0.13878674336916041, 0.19719169221834504, -0.0013489268962793423, 0.07698766437940785, 0.047160859081458825, -0.0770927779528159, 0.017724427676463494, -0.12455843377704964, 0.31063948992026036, 0.10932211276595177, 0.27683584180114595, -0.053197639652659896, 0.021716383002141768, -0.14960189412751188, -0.011243272012757972, 0.047755734148877765, -0.16899035195831186, -0.02073002010414384, 0.23343079373458137, 0.04820758612002193, 0.24424362950345013, -0.4745511239701418, -0.3206071972140464, -0.0015091760810179158, 0.25138093069183703, 0.10192995872063085, -0.014422056252240308, -0.2507054665504145, 0.05583603142036332, -0.20417723504530258, -0.1400852220934027, -0.07289503090943555, -0.016246775241918376, 0.02262262800232047, -0.2776001635075804, 0.17471591832822767, 0.13529934542700986, 0.1268492724775012, -0.08569224596637305, -0.0046729272342076475, -0.11302881681545855, 0.04826991769602929, 0.10015155125313022, 0.04505128970805027, 0.14880512149913513, -0.17938675372718593, -0.08719090996773993, 0.42795659654499013, -0.05442995276864996, -0.2232293211981557, 0.26280160607605946, -0.19206442316401737, -0.09970486035545524, 0.18850374061496522, 0.21094404834178115, 0.058843665124698616, -0.07652189937831434, -0.025842453646375458, -0.13810037630984837, 0.12971555709551622, 0.04825730904422958, -0.04109649853495403, 0.24633441346437024, 0.23152155309676467, 0.020851422709651946, 0.12714547129843912, -0.09732034138289648, -0.16577692035143174, -0.24087192430392879, -0.10077626601180911, -0.10473987863977151, 0.054648401091284285, -0.030302334005194644, -0.24006622373121986, 0.34835546086827773, 0.12101183960729875, 0.11551379772486474, -0.019560256629461474, 0.32084229662907365, 0.07727482913274289, 0.012231042266955377, 0.19032890446059464, 0.33186096068956955, 0.24292760917567202, 0.1444956969748112, -0.20153763605517216, 0.0618980737988234, 0.10234459564250348] |
1,803.00848 | CsPbBr3 Perovskites: Theoretical and Experimental Investigation on
Water-Assisted Transition From Nanowire Formation to Degradation | Recent advances in colloidal synthesis methods have led to increased research
focus on halide perovskites. Due to highly ionic crystal structure of
perovskite materials, stability issue pops up especially against polar solvents
such as water. In this study, we investigate water-driven structural evolution
of CsPbBr3 by performing experiments and state-of-the-art first-principles
calculations. It is seen that while optical image shows the gradual degradation
of yellowish-colored CsPbBr3 structure under daylight, UV illumination reveals
that the degradation of crystals takes place in two steps; transition from
blue-emitting to green-emitting structure and and then transition from
green-emitting phase to complete degradation. We found that as-synthesized
CsPbBr3 NWs emit blue light under 254 nm UV source and before the degradation,
first CsPbBr3 NWs undergoes a water-driven structural transition to form large
bundles. It is also seen that formation of such bundles provide longer-term
environmental stability. In addition theoretical calculations revealed how
strong is the interaction of water molecules with ligands and surfaces of
CsPbBr3 and provide atomistic-level explanation to transition from
ligand-covered nanowires to bundle formation. Further interaction of
green-light-emitting bundles with water causes complete degradation of CsPbBr3
and photoluminescence signal is entirely quenched. Moreover, Raman and XRD
measurements revealed that completely degraded regions are decomposed to PbBr2
and CsBr precursors. We believe that findings of this study may provide further
insight into the degradation mechanism of CsPbBr3 perovskite by water.
| cond-mat.mtrl-sci physics.app-ph | recent advances in colloidal synthesis methods have led to increased research focus on halide perovskites due to highly ionic crystal structure of perovskite materials stability issue pops up especially against polar solvents such as water in this study we investigate waterdriven structural evolution of cspbbr3 by performing experiments and stateoftheart firstprinciples calculations it is seen that while optical image shows the gradual degradation of yellowishcolored cspbbr3 structure under daylight uv illumination reveals that the degradation of crystals takes place in two steps transition from blueemitting to greenemitting structure and and then transition from greenemitting phase to complete degradation we found that assynthesized cspbbr3 nws emit blue light under 254 nm uv source and before the degradation first cspbbr3 nws undergoes a waterdriven structural transition to form large bundles it is also seen that formation of such bundles provide longerterm environmental stability in addition theoretical calculations revealed how strong is the interaction of water molecules with ligands and surfaces of cspbbr3 and provide atomisticlevel explanation to transition from ligandcovered nanowires to bundle formation further interaction of greenlightemitting bundles with water causes complete degradation of cspbbr3 and photoluminescence signal is entirely quenched moreover raman and xrd measurements revealed that completely degraded regions are decomposed to pbbr2 and csbr precursors we believe that findings of this study may provide further insight into the degradation mechanism of cspbbr3 perovskite by water | [['recent', 'advances', 'in', 'colloidal', 'synthesis', 'methods', 'have', 'led', 'to', 'increased', 'research', 'focus', 'on', 'halide', 'perovskites', 'due', 'to', 'highly', 'ionic', 'crystal', 'structure', 'of', 'perovskite', 'materials', 'stability', 'issue', 'pops', 'up', 'especially', 'against', 'polar', 'solvents', 'such', 'as', 'water', 'in', 'this', 'study', 'we', 'investigate', 'waterdriven', 'structural', 'evolution', 'of', 'cspbbr3', 'by', 'performing', 'experiments', 'and', 'stateoftheart', 'firstprinciples', 'calculations', 'it', 'is', 'seen', 'that', 'while', 'optical', 'image', 'shows', 'the', 'gradual', 'degradation', 'of', 'yellowishcolored', 'cspbbr3', 'structure', 'under', 'daylight', 'uv', 'illumination', 'reveals', 'that', 'the', 'degradation', 'of', 'crystals', 'takes', 'place', 'in', 'two', 'steps', 'transition', 'from', 'blueemitting', 'to', 'greenemitting', 'structure', 'and', 'and', 'then', 'transition', 'from', 'greenemitting', 'phase', 'to', 'complete', 'degradation', 'we', 'found', 'that', 'assynthesized', 'cspbbr3', 'nws', 'emit', 'blue', 'light', 'under', '254', 'nm', 'uv', 'source', 'and', 'before', 'the', 'degradation', 'first', 'cspbbr3', 'nws', 'undergoes', 'a', 'waterdriven', 'structural', 'transition', 'to', 'form', 'large', 'bundles', 'it', 'is', 'also', 'seen', 'that', 'formation', 'of', 'such', 'bundles', 'provide', 'longerterm', 'environmental', 'stability', 'in', 'addition', 'theoretical', 'calculations', 'revealed', 'how', 'strong', 'is', 'the', 'interaction', 'of', 'water', 'molecules', 'with', 'ligands', 'and', 'surfaces', 'of', 'cspbbr3', 'and', 'provide', 'atomisticlevel', 'explanation', 'to', 'transition', 'from', 'ligandcovered', 'nanowires', 'to', 'bundle', 'formation', 'further', 'interaction', 'of', 'greenlightemitting', 'bundles', 'with', 'water', 'causes', 'complete', 'degradation', 'of', 'cspbbr3', 'and', 'photoluminescence', 'signal', 'is', 'entirely', 'quenched', 'moreover', 'raman', 'and', 'xrd', 'measurements', 'revealed', 'that', 'completely', 'degraded', 'regions', 'are', 'decomposed', 'to', 'pbbr2', 'and', 'csbr', 'precursors', 'we', 'believe', 'that', 'findings', 'of', 'this', 'study', 'may', 'provide', 'further', 'insight', 'into', 'the', 'degradation', 'mechanism', 'of', 'cspbbr3', 'perovskite', 'by', 'water']] | [-0.09389183241790452, 0.13097391706487296, -0.06361051224539632, -0.013073559501730407, -0.008358308574552293, -0.1461384589491504, 0.08938125251779842, 0.49012482259840173, -0.24709435401175323, -0.28916507221407556, 0.05783998446524427, -0.2885223176255154, -0.2053750438919508, 0.1516548178989791, -0.04945668486268531, 0.00852895084760181, 0.06444999585951357, -0.11759879720366494, -0.06175967822563438, -0.19967301109243987, 0.24055519198159367, 0.07585618005764792, 0.31899153560633886, 0.13115721504306296, 0.02932903524268953, -0.059413162239305435, 0.06437920815741535, -0.004627470942965872, -0.14714743000147978, 0.08544756591867138, 0.2503225363654214, 0.012501121187507439, 0.2026483453551478, -0.48718828526680513, -0.2776635728083183, 0.03367970406700076, 0.13575077714030986, 0.10165362746868233, -0.13079544025757286, -0.2524558747638301, 0.07304983096606528, -0.08404783134449445, -0.07523373383707617, -0.08215310252266372, -0.01892113162939658, 0.00270901297348564, -0.21135844738298876, 0.0601331129892794, 0.06071634549280052, 0.08887814811994416, -0.12186408287014461, -0.1111098297468633, -0.09770545905723232, 0.08201197230553614, 0.06486057129640534, 0.017397630556993973, 0.21767957401649835, -0.08014646367975949, -0.09048514185586085, 0.4200366976119645, -0.07579383206023363, -0.040313221169677414, 0.18626420621472023, -0.18076351372683797, -0.12656774257848483, 0.25047530637502735, 0.13365025728321822, 0.09933989488774485, -0.11974436467625159, -0.008316710372319687, 0.034146002880501194, 0.2218673065526102, 0.09703820256198936, 0.09926974622850127, 0.2164834977582832, 0.22025392398305002, -0.015175096856664048, 0.17864399701315126, -0.08441678979726416, -0.05429161622214043, -0.15658383615859972, -0.18853452447551247, -0.09999817128151221, 0.10002045814557922, -0.05002875898743096, -0.1822192790226869, 0.3593789970871863, 0.10642433872878669, 0.15786091613190692, -0.02727531046802888, 0.23445265591791895, 0.007377211637210284, 0.08832838590102346, -0.04181382610909474, 0.2814613757926486, 0.1547699170341118, 0.09423255569076024, -0.24581920790314807, 0.11341664773117617, -0.01859139323635486] |
1,803.00849 | Maximum Volume Subset Selection for Anchored Boxes | Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each
box has a corner at the origin and the other corner in the positive quadrant of
$\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of
selecting $k$ boxes in $B$ that maximize the volume of the union of the
selected boxes. This research is motivated by applications in skyline queries
for databases and in multicriteria optimization, where the problem is known as
the hypervolume subset selection problem. It is known that the problem can be
solved in polynomial time in the plane, while the best known running time in
any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$. We show that:
- The problem is NP-hard already in 3 dimensions.
- In 3 dimensions, we break the bound $\Omega\big(\binom{n}{k}\big)$, by
providing an $n^{O(\sqrt{k})}$ algorithm.
- For any constant dimension $d$, we present an efficient polynomial-time
approximation scheme.
| cs.CG cs.DS | let b be a set of n axisparallel boxes in mathbbrd such that each box has a corner at the origin and the other corner in the positive quadrant of mathbbrd and let k be a positive integer we study the problem of selecting k boxes in b that maximize the volume of the union of the selected boxes this research is motivated by applications in skyline queries for databases and in multicriteria optimization where the problem is known as the hypervolume subset selection problem it is known that the problem can be solved in polynomial time in the plane while the best known running time in any dimension d ge 3 is omegabigbinomnkbig we show that the problem is nphard already in 3 dimensions in 3 dimensions we break the bound omegabigbinomnkbig by providing an nosqrtk algorithm for any constant dimension d we present an efficient polynomialtime approximation scheme | [['let', 'b', 'be', 'a', 'set', 'of', 'n', 'axisparallel', 'boxes', 'in', 'mathbbrd', 'such', 'that', 'each', 'box', 'has', 'a', 'corner', 'at', 'the', 'origin', 'and', 'the', 'other', 'corner', 'in', 'the', 'positive', 'quadrant', 'of', 'mathbbrd', 'and', 'let', 'k', 'be', 'a', 'positive', 'integer', 'we', 'study', 'the', 'problem', 'of', 'selecting', 'k', 'boxes', 'in', 'b', 'that', 'maximize', 'the', 'volume', 'of', 'the', 'union', 'of', 'the', 'selected', 'boxes', 'this', 'research', 'is', 'motivated', 'by', 'applications', 'in', 'skyline', 'queries', 'for', 'databases', 'and', 'in', 'multicriteria', 'optimization', 'where', 'the', 'problem', 'is', 'known', 'as', 'the', 'hypervolume', 'subset', 'selection', 'problem', 'it', 'is', 'known', 'that', 'the', 'problem', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'in', 'the', 'plane', 'while', 'the', 'best', 'known', 'running', 'time', 'in', 'any', 'dimension', 'd', 'ge', '3', 'is', 'omegabigbinomnkbig', 'we', 'show', 'that', 'the', 'problem', 'is', 'nphard', 'already', 'in', '3', 'dimensions', 'in', '3', 'dimensions', 'we', 'break', 'the', 'bound', 'omegabigbinomnkbig', 'by', 'providing', 'an', 'nosqrtk', 'algorithm', 'for', 'any', 'constant', 'dimension', 'd', 'we', 'present', 'an', 'efficient', 'polynomialtime', 'approximation', 'scheme']] | [-0.14502078019132889, 0.05784001309173716, 0.007557307329104358, 0.01910031902465365, -0.04766055244033703, -0.1691147058956778, 0.06885313078276561, 0.35687781341776653, -0.2847533517554906, -0.29890712654859936, 0.12199443862679087, -0.2970475281613904, -0.11543460938657911, 0.15622549661988946, -0.05393179077214587, 0.046784841128297755, 0.010303886454690853, 0.059678986879392854, -0.015277194770877375, -0.3222341962360047, 0.2895218470492526, -0.027365736323534638, 0.1698699559689172, 0.0669556391217771, 0.06871353596688022, 0.005777504786336166, 0.008150783571968408, 0.07845348047054801, -0.13896837345945076, 0.07069777387801583, 0.294506933524374, 0.19454358714982525, 0.3086843062129274, -0.3610476842401801, -0.16240960790624692, 0.18266369637205718, 0.18962636530223126, 0.053539970963627, -0.013739590981434024, -0.2316219843735264, 0.1343659706212379, -0.06954286153435336, -0.12011885514948517, -0.004346071906085755, 0.11029097609964476, -0.05908627126474449, -0.32733228257731406, 0.021760857368290826, 0.08152763932830075, 0.022926485543516843, -0.03490224689861911, -0.15198839808235298, 0.061604557274148576, 0.1084247023524792, -0.030826557193437555, 0.12319956335626114, 0.03340558571712668, -0.09423095406099172, -0.17740455244013384, 0.40335690692646076, -0.020550410288411217, -0.24710499963918198, 0.11808670416625368, -0.14733062464605412, -0.12138779005476248, 0.1315068855340517, 0.17673186191382842, 0.18527560807317944, -0.1049392333480756, 0.18356875176234738, -0.14283334600072153, 0.15479282870246852, 0.0890084039058058, -0.026099822307760652, 0.1481372551076945, 0.15875678676860155, 0.15689431586479013, 0.17223432118378304, -0.05885888508605972, -0.015159770657585279, -0.30449705637639035, -0.1584694692098089, -0.2524594257348154, 0.032702715098354464, -0.1485145777693794, -0.13385154062731042, 0.31903093635989804, 0.10939944609905265, 0.2139859394031904, 0.07201185996165953, 0.28465876890648456, 0.10348889707971909, 0.04403831200545175, 0.1581214374919246, 0.13956161160525438, 0.031476497353995346, 0.025604130066239048, -0.1871205142453766, 0.06187125024499019, 0.1165514863536668] |
1,803.0085 | Galerkin-Collocation domain decomposition method for arbitrary binary
black holes | We present a new computational framework for the Galerkin-collocation method
for double domain in the context of ADM 3+1 approach in numerical relativity.
This work enables us to perform high resolution calculations for initial sets
of two arbitrary black holes. We use the Bowen-York method for binary systems
and the puncture method to solve the Hamiltonian constraint. The nonlinear
numerical code solves the set of equations for the spectral modes using the
standard Newton-Raphson method, LU decomposition and Gaussian quadratures. We
show convergence of our code for the conformal factor and the ADM mass. Thus,
we display features of the conformal factor for different masses, spins and
linear momenta.
| gr-qc | we present a new computational framework for the galerkincollocation method for double domain in the context of adm 31 approach in numerical relativity this work enables us to perform high resolution calculations for initial sets of two arbitrary black holes we use the bowenyork method for binary systems and the puncture method to solve the hamiltonian constraint the nonlinear numerical code solves the set of equations for the spectral modes using the standard newtonraphson method lu decomposition and gaussian quadratures we show convergence of our code for the conformal factor and the adm mass thus we display features of the conformal factor for different masses spins and linear momenta | [['we', 'present', 'a', 'new', 'computational', 'framework', 'for', 'the', 'galerkincollocation', 'method', 'for', 'double', 'domain', 'in', 'the', 'context', 'of', 'adm', '31', 'approach', 'in', 'numerical', 'relativity', 'this', 'work', 'enables', 'us', 'to', 'perform', 'high', 'resolution', 'calculations', 'for', 'initial', 'sets', 'of', 'two', 'arbitrary', 'black', 'holes', 'we', 'use', 'the', 'bowenyork', 'method', 'for', 'binary', 'systems', 'and', 'the', 'puncture', 'method', 'to', 'solve', 'the', 'hamiltonian', 'constraint', 'the', 'nonlinear', 'numerical', 'code', 'solves', 'the', 'set', 'of', 'equations', 'for', 'the', 'spectral', 'modes', 'using', 'the', 'standard', 'newtonraphson', 'method', 'lu', 'decomposition', 'and', 'gaussian', 'quadratures', 'we', 'show', 'convergence', 'of', 'our', 'code', 'for', 'the', 'conformal', 'factor', 'and', 'the', 'adm', 'mass', 'thus', 'we', 'display', 'features', 'of', 'the', 'conformal', 'factor', 'for', 'different', 'masses', 'spins', 'and', 'linear', 'momenta']] | [-0.08828868235059835, 0.010419160349790109, -0.09107306556041361, 0.07249845047118228, -0.06950545820211051, -0.125788590217163, 0.014132434250188803, 0.3442668894438261, -0.23487539082357592, -0.3193098721607084, 0.06690944904042835, -0.2442351819246734, -0.09437810210511088, 0.22511646851102626, -0.0133779666466914, 0.13863168180057214, 0.0983592737679703, -0.027080412236375546, -0.15540701578106356, -0.24265939899540823, 0.36184626429354017, 0.0485866527167072, 0.23292087661871397, 0.0025953639794243583, 0.14016297527529095, 0.015082261202549305, -0.02880552750713098, 0.011849347467816204, -0.13087329393628677, 0.12454673221522788, 0.20401894652130886, 0.15819291626487714, 0.23299505786517413, -0.39104898977990543, -0.1880016444387649, 0.027762656200489184, 0.1413989437726933, 0.18169458939292288, -0.05427304596892225, -0.23338788920915216, 0.10301613903373753, -0.19353122653550717, -0.1613289935240915, -0.14148301605579502, -0.04457297440139799, -0.04450615417690725, -0.3179219158712364, 0.10808355857643785, 0.05258306608868575, -0.004649540049052229, -0.0898579687452576, -0.10502735642746193, 0.03547856155697496, 0.07623847248032689, 0.04828791005682166, -0.003986616435230052, 0.09025788823689479, -0.06140123192144028, -0.1130042088243666, 0.3666112278545395, -0.05934757007277408, -0.2690117108409182, 0.16327852513982888, -0.14035999225324378, -0.15742349537268896, 0.103663907471805, 0.20677831980245992, 0.2020365225040106, -0.1379036925681824, 0.12609895920474937, -0.0013650992090617298, 0.16377525411358257, 0.07431348737055829, -0.0026090267806425007, 0.19696059732467208, 0.12476150006260894, 0.049390413559152996, 0.12291098810698188, -0.09676786512563672, -0.10357960509435368, -0.29262788618440577, -0.1688915126948455, -0.1679982744294022, 0.013422842675802904, -0.16711885773805354, -0.15501355353332713, 0.42003565997637193, 0.15561752310401863, 0.14041755724390712, 0.09928929617568645, 0.28903455888055324, 0.11755878774360048, 0.04868680774547969, 0.10992563498813078, 0.22464137465838308, 0.1574598699295466, 0.10598781886681435, -0.28628530341132175, -0.10807546857026738, 0.13162272633907787] |
1,803.00851 | A nonlinear graph-based theory for dynamical network observability | A faithful description of the state of a complex dynamical network would
require, in principle, the measurement of all its $d$ variables, an infeasible
task for systems with practical limited access and composed of many nodes with
high dimensional dynamics. However, even if the network dynamics is observable
from a reduced set of measured variables, how to reliably identifying such a
minimum set of variables providing full observability remains an unsolved
problem. From the Jacobian matrix of the governing equations of nonlinear
systems, we construct a {\it pruned fluence graph} in which the nodes are the
state variables and the links represent {\it only the linear} dynamical
interdependences encoded in the Jacobian matrix after ignoring nonlinear
relationships. From this graph, we identify the largest connected sub-graphs
where there is a path from every node to every other node and there are not
outcoming links. In each one of those sub-graphs, at least one node must be
measured to correctly monitor the state of the system in a $d$-dimensional
reconstructed space. Our procedure is here validated by investigating
large-dimensional reaction networks for which the determinant of the
observability matrix can be rigorously computed.
| nlin.CD | a faithful description of the state of a complex dynamical network would require in principle the measurement of all its d variables an infeasible task for systems with practical limited access and composed of many nodes with high dimensional dynamics however even if the network dynamics is observable from a reduced set of measured variables how to reliably identifying such a minimum set of variables providing full observability remains an unsolved problem from the jacobian matrix of the governing equations of nonlinear systems we construct a it pruned fluence graph in which the nodes are the state variables and the links represent it only the linear dynamical interdependences encoded in the jacobian matrix after ignoring nonlinear relationships from this graph we identify the largest connected subgraphs where there is a path from every node to every other node and there are not outcoming links in each one of those subgraphs at least one node must be measured to correctly monitor the state of the system in a ddimensional reconstructed space our procedure is here validated by investigating largedimensional reaction networks for which the determinant of the observability matrix can be rigorously computed | [['a', 'faithful', 'description', 'of', 'the', 'state', 'of', 'a', 'complex', 'dynamical', 'network', 'would', 'require', 'in', 'principle', 'the', 'measurement', 'of', 'all', 'its', 'd', 'variables', 'an', 'infeasible', 'task', 'for', 'systems', 'with', 'practical', 'limited', 'access', 'and', 'composed', 'of', 'many', 'nodes', 'with', 'high', 'dimensional', 'dynamics', 'however', 'even', 'if', 'the', 'network', 'dynamics', 'is', 'observable', 'from', 'a', 'reduced', 'set', 'of', 'measured', 'variables', 'how', 'to', 'reliably', 'identifying', 'such', 'a', 'minimum', 'set', 'of', 'variables', 'providing', 'full', 'observability', 'remains', 'an', 'unsolved', 'problem', 'from', 'the', 'jacobian', 'matrix', 'of', 'the', 'governing', 'equations', 'of', 'nonlinear', 'systems', 'we', 'construct', 'a', 'it', 'pruned', 'fluence', 'graph', 'in', 'which', 'the', 'nodes', 'are', 'the', 'state', 'variables', 'and', 'the', 'links', 'represent', 'it', 'only', 'the', 'linear', 'dynamical', 'interdependences', 'encoded', 'in', 'the', 'jacobian', 'matrix', 'after', 'ignoring', 'nonlinear', 'relationships', 'from', 'this', 'graph', 'we', 'identify', 'the', 'largest', 'connected', 'subgraphs', 'where', 'there', 'is', 'a', 'path', 'from', 'every', 'node', 'to', 'every', 'other', 'node', 'and', 'there', 'are', 'not', 'outcoming', 'links', 'in', 'each', 'one', 'of', 'those', 'subgraphs', 'at', 'least', 'one', 'node', 'must', 'be', 'measured', 'to', 'correctly', 'monitor', 'the', 'state', 'of', 'the', 'system', 'in', 'a', 'ddimensional', 'reconstructed', 'space', 'our', 'procedure', 'is', 'here', 'validated', 'by', 'investigating', 'largedimensional', 'reaction', 'networks', 'for', 'which', 'the', 'determinant', 'of', 'the', 'observability', 'matrix', 'can', 'be', 'rigorously', 'computed']] | [-0.15352776548631178, 0.0943303040853607, -0.046025098000579114, 0.04101411079439762, -0.05095520819304511, -0.15982634962832284, 0.05651294869312551, 0.33810476369520376, -0.32948444248904707, -0.2766206147595464, 0.122300168307144, -0.2892037102768275, -0.1542485690661124, 0.15155664724685872, -0.038917420406278325, 0.05841740595928968, 0.11108163565707703, 0.10157448066820507, -0.032150133014511084, -0.23836386656239483, 0.32755792109067744, 0.005408650283546497, 0.20559954044559467, -0.008071679466714462, 0.14972436457901495, 0.026161813428188907, -0.0175390797212458, 0.055919529609279074, -0.06268609481026033, 0.08895983193603267, 0.29476060746916727, 0.1693762943468755, 0.25459648513788125, -0.4264660128910691, -0.21663437018287368, 0.18311237217858434, 0.10900615308977042, 0.11034001459120191, 0.04400798532393916, -0.26685700125138584, 0.0969990394605702, -0.14366773540677968, -0.10891663434692116, -0.0591315937769347, 0.02816604631273852, -0.00867574278951603, -0.26601144560906204, 0.03224163051466652, 0.01166955112148571, 0.02801583201411025, -0.018733860797510715, -0.08609710990458552, -0.06440440754704468, 0.17414943799303728, -0.021343565296168283, 0.030330477824008995, 0.09754338802000954, -0.13651585414894876, -0.10396287467665388, 0.38280323403644917, 0.024129720848577563, -0.2226132177990318, 0.16737448397664897, -0.12703804120489318, -0.16409387336534564, 0.14822272745611068, 0.167667629259995, 0.10730350370674084, -0.18728208478629918, 0.05349341811203582, -0.052763226383225025, 0.1841215667260864, 0.027054502804882457, 0.03687508758836581, 0.17222549238541282, 0.18363438436426804, 0.08106975315210245, 0.10977046078702794, -0.035977127908305796, -0.07157372263463913, -0.28412547724534915, -0.12963171034061816, -0.243486890269196, 0.06650592396310155, -0.1270378578335567, -0.16260036849416792, 0.42742085847082006, 0.13857542161683037, 0.21792302771549052, 0.04197186175224488, 0.2679925363760655, 0.12629536006428074, 0.06871363366857015, 0.12417615919518236, 0.19333655983791687, 0.14945727020312916, 0.04395842260585899, -0.18961365237191785, 0.11862640833229914, 0.05853756391419059] |
1,803.00852 | Local hidden-variable model for a recent experimental test of quantum
nonlocality and local contextuality | An experiment has recently been performed to demonstrate quantum nonlocality
by establishing contextuality in one of a pair of photons encoding four qubits;
however, low detection efficiencies and use of the fair-sampling hypothesis
leave these results open to possible criticism due to the detection loophole.
In this Letter, a physically motivated local hidden-variable model is
considered as a possible mechanism for explaining the experimentally observed
results. The model, though not intrinsically contextual, acquires this quality
upon post-selection of coincident detections.
| quant-ph | an experiment has recently been performed to demonstrate quantum nonlocality by establishing contextuality in one of a pair of photons encoding four qubits however low detection efficiencies and use of the fairsampling hypothesis leave these results open to possible criticism due to the detection loophole in this letter a physically motivated local hiddenvariable model is considered as a possible mechanism for explaining the experimentally observed results the model though not intrinsically contextual acquires this quality upon postselection of coincident detections | [['an', 'experiment', 'has', 'recently', 'been', 'performed', 'to', 'demonstrate', 'quantum', 'nonlocality', 'by', 'establishing', 'contextuality', 'in', 'one', 'of', 'a', 'pair', 'of', 'photons', 'encoding', 'four', 'qubits', 'however', 'low', 'detection', 'efficiencies', 'and', 'use', 'of', 'the', 'fairsampling', 'hypothesis', 'leave', 'these', 'results', 'open', 'to', 'possible', 'criticism', 'due', 'to', 'the', 'detection', 'loophole', 'in', 'this', 'letter', 'a', 'physically', 'motivated', 'local', 'hiddenvariable', 'model', 'is', 'considered', 'as', 'a', 'possible', 'mechanism', 'for', 'explaining', 'the', 'experimentally', 'observed', 'results', 'the', 'model', 'though', 'not', 'intrinsically', 'contextual', 'acquires', 'this', 'quality', 'upon', 'postselection', 'of', 'coincident', 'detections']] | [-0.12217201655730606, 0.11189674993092921, -0.06574634946882725, 0.08702343827317235, -0.0595801500196103, -0.2236379081674386, 0.09066453774867114, 0.3562284310464747, -0.18660825714468957, -0.3525138454628177, 0.03320384820981417, -0.23833340983837842, -0.10710860899998806, 0.18683831133530476, -0.08749889002647251, 0.10259887267457088, 0.05895447451621294, 0.017628491716459395, -0.021094593566158438, -0.2630092568870168, 0.2801022930740146, 0.12885425884014695, 0.32442122905049475, 0.09283107357914559, 0.1293582270562183, -0.0370423153945012, -0.04806594643741846, -0.008100312255555764, -0.052051086339633915, 0.07493513236986474, 0.2653258741716854, 0.17135582221089862, 0.2633908274117857, -0.4105134783545509, -0.25608398476615546, 0.11613206210313365, 0.13153627940628213, 0.14817660565895494, -0.08844434580678354, -0.3508273103274405, 0.039509866223670545, -0.17570794380735605, -0.10506084462394938, -0.07171641449676827, 0.02271374235278927, -0.1295164033261244, -0.22930098264696425, 0.1031121366948355, 0.09169573015533387, 0.028870366187766193, -0.002496673259884119, 0.00450467353221029, 0.06144186008605175, 0.04080552496598102, 0.03114799635950476, 0.003964854739024304, 0.11596120971953497, -0.15458352583809756, -0.23838871786138044, 0.3502895683515817, -0.003174866223707795, -0.17137212948000524, 0.21820861856685952, -0.11277632020937745, -0.1832368474220857, 0.09579309979453683, 0.06905382756376639, 0.0897478747589048, -0.16542377118894364, 0.023363297621472157, -0.06189190710429102, 0.1902008363555069, 0.09576932132476941, 0.11363965765340253, 0.25115488714072853, 0.14449740532872965, 0.009289850259665399, 0.12808709259261378, -0.1073923087795265, -0.08373874526732834, -0.3166175660211593, -0.15916628063896496, -0.2162878115195781, 0.062228664447502524, 0.020571800787183746, -0.10851516420370899, 0.3565117624704726, 0.20369658674026142, 0.21263076161267236, 3.286169085185975e-05, 0.29048190340399743, 0.06926142939919373, 0.08945612745301332, 0.006625232816440984, 0.3411769814090803, 0.1173054746730486, 0.04136503299814649, -0.1899744428723352, 0.13218859267653899, -0.02011900347424671] |
1,803.00853 | Quantum distance-based classifier with constant size memory, distributed
knowledge and state recycling | In this work we examine recently proposed distance-based classification
method designed for near-term quantum processing units with limited resources.
We further study possibilities to reduce the quantum resources without any
efficiency decrease. We show that only a part of the information undergoes
coherent evolution and this fact allows us to introduce an algorithm with
significantly reduced quantum memory size. Additionally, considering only
partial information at a time, we propose a classification protocol with
information distributed among a number of agents. Finally, we show that the
information evolution during a measurement can lead to a better solution and
that accuracy of the algorithm can be improved by harnessing the state after
the final measurement.
| quant-ph cs.CV cs.MA | in this work we examine recently proposed distancebased classification method designed for nearterm quantum processing units with limited resources we further study possibilities to reduce the quantum resources without any efficiency decrease we show that only a part of the information undergoes coherent evolution and this fact allows us to introduce an algorithm with significantly reduced quantum memory size additionally considering only partial information at a time we propose a classification protocol with information distributed among a number of agents finally we show that the information evolution during a measurement can lead to a better solution and that accuracy of the algorithm can be improved by harnessing the state after the final measurement | [['in', 'this', 'work', 'we', 'examine', 'recently', 'proposed', 'distancebased', 'classification', 'method', 'designed', 'for', 'nearterm', 'quantum', 'processing', 'units', 'with', 'limited', 'resources', 'we', 'further', 'study', 'possibilities', 'to', 'reduce', 'the', 'quantum', 'resources', 'without', 'any', 'efficiency', 'decrease', 'we', 'show', 'that', 'only', 'a', 'part', 'of', 'the', 'information', 'undergoes', 'coherent', 'evolution', 'and', 'this', 'fact', 'allows', 'us', 'to', 'introduce', 'an', 'algorithm', 'with', 'significantly', 'reduced', 'quantum', 'memory', 'size', 'additionally', 'considering', 'only', 'partial', 'information', 'at', 'a', 'time', 'we', 'propose', 'a', 'classification', 'protocol', 'with', 'information', 'distributed', 'among', 'a', 'number', 'of', 'agents', 'finally', 'we', 'show', 'that', 'the', 'information', 'evolution', 'during', 'a', 'measurement', 'can', 'lead', 'to', 'a', 'better', 'solution', 'and', 'that', 'accuracy', 'of', 'the', 'algorithm', 'can', 'be', 'improved', 'by', 'harnessing', 'the', 'state', 'after', 'the', 'final', 'measurement']] | [-0.10520060607067318, 0.09076579193807664, -0.09864984581708512, 0.0035323957620040244, -0.06480359678379202, -0.14691328287816943, 0.10766212797756677, 0.3849776346005697, -0.29485119374435953, -0.3592412340232229, 0.09060932102353535, -0.23351921783402188, -0.15481180202347777, 0.18910256790541177, -0.10513196155156908, 0.05956853280025246, 0.13660458167932465, 0.05327244418203435, -0.08887976861921494, -0.2973959868839752, 0.2764972110198547, 0.08796866598386581, 0.298855458044208, 0.05798683627879461, 0.12195028524549134, 0.02037410140602872, -0.03904580125642891, 0.0391090501592272, -0.11775448342955999, 0.13865723812013073, 0.24086435861984448, 0.18193676817618246, 0.3198368793798495, -0.43003755616666994, -0.22715785638717687, 0.1473662565231521, 0.14133797768545667, 0.1813483222869876, -0.057639882759710326, -0.2755583964836314, 0.10619268912525304, -0.2027012590088148, -0.07316954109809501, -0.12769749416944992, -0.03468669408652107, -0.029933854108223017, -0.271278794402611, 0.05289414100991809, 0.0618380072477183, -0.009677109838076002, -0.020695272829503116, -0.03023179505737416, 0.043954034412147854, 0.1400987818585791, -0.04867994971779398, 0.0082518956304602, 0.12213077899315848, -0.1331649548868624, -0.17617778044886293, 0.3394795593566599, -0.05861107150630498, -0.19508035088666772, 0.1527889429764674, -0.09400732810114536, -0.1456347620444356, 0.10340571419162824, 0.2087909990743388, 0.08748646508242967, -0.1397286420688033, 0.023390811220001, 0.01362314952158295, 0.2458529502969334, 0.0232875191017293, 0.0932591892799478, 0.15692304092896195, 0.1987423126017098, 0.08757748472168465, 0.1682476243735662, -0.09228813074183016, -0.09798592156565757, -0.2391865541334305, -0.21152429346539145, -0.1829654838420055, 0.043348686584164346, -0.0719515080306168, -0.07193098144721141, 0.40282414649176385, 0.21204826772311883, 0.1911651398780533, 0.06746848861777545, 0.33745901177810356, 0.0944834008907685, 0.08954800449031512, 0.12362828700539483, 0.19602908234449878, 0.05383740745451862, 0.10898606818729797, -0.2593833782124968, 0.08710113172295743, 0.00832180480217248] |
1,803.00854 | A more globally accurate dimensionality reduction method using triplets | We first show that the commonly used dimensionality reduction (DR) methods
such as t-SNE and LargeVis poorly capture the global structure of the data in
the low dimensional embedding. We show this via a number of tests for the DR
methods that can be easily applied by any practitioner to the dataset at hand.
Surprisingly enough, t-SNE performs the best w.r.t. the commonly used measures
that reward the local neighborhood accuracy such as precision-recall while
having the worst performance in our tests for global structure. We then
contrast the performance of these two DR method against our new method called
TriMap. The main idea behind TriMap is to capture higher orders of structure
with triplet information (instead of pairwise information used by t-SNE and
LargeVis), and to minimize a robust loss function for satisfying the chosen
triplets. We provide compelling experimental evidence on large natural datasets
for the clear advantage of the TriMap DR results. As LargeVis, TriMap scales
linearly with the number of data points.
| cs.LG | we first show that the commonly used dimensionality reduction dr methods such as tsne and largevis poorly capture the global structure of the data in the low dimensional embedding we show this via a number of tests for the dr methods that can be easily applied by any practitioner to the dataset at hand surprisingly enough tsne performs the best wrt the commonly used measures that reward the local neighborhood accuracy such as precisionrecall while having the worst performance in our tests for global structure we then contrast the performance of these two dr method against our new method called trimap the main idea behind trimap is to capture higher orders of structure with triplet information instead of pairwise information used by tsne and largevis and to minimize a robust loss function for satisfying the chosen triplets we provide compelling experimental evidence on large natural datasets for the clear advantage of the trimap dr results as largevis trimap scales linearly with the number of data points | [['we', 'first', 'show', 'that', 'the', 'commonly', 'used', 'dimensionality', 'reduction', 'dr', 'methods', 'such', 'as', 'tsne', 'and', 'largevis', 'poorly', 'capture', 'the', 'global', 'structure', 'of', 'the', 'data', 'in', 'the', 'low', 'dimensional', 'embedding', 'we', 'show', 'this', 'via', 'a', 'number', 'of', 'tests', 'for', 'the', 'dr', 'methods', 'that', 'can', 'be', 'easily', 'applied', 'by', 'any', 'practitioner', 'to', 'the', 'dataset', 'at', 'hand', 'surprisingly', 'enough', 'tsne', 'performs', 'the', 'best', 'wrt', 'the', 'commonly', 'used', 'measures', 'that', 'reward', 'the', 'local', 'neighborhood', 'accuracy', 'such', 'as', 'precisionrecall', 'while', 'having', 'the', 'worst', 'performance', 'in', 'our', 'tests', 'for', 'global', 'structure', 'we', 'then', 'contrast', 'the', 'performance', 'of', 'these', 'two', 'dr', 'method', 'against', 'our', 'new', 'method', 'called', 'trimap', 'the', 'main', 'idea', 'behind', 'trimap', 'is', 'to', 'capture', 'higher', 'orders', 'of', 'structure', 'with', 'triplet', 'information', 'instead', 'of', 'pairwise', 'information', 'used', 'by', 'tsne', 'and', 'largevis', 'and', 'to', 'minimize', 'a', 'robust', 'loss', 'function', 'for', 'satisfying', 'the', 'chosen', 'triplets', 'we', 'provide', 'compelling', 'experimental', 'evidence', 'on', 'large', 'natural', 'datasets', 'for', 'the', 'clear', 'advantage', 'of', 'the', 'trimap', 'dr', 'results', 'as', 'largevis', 'trimap', 'scales', 'linearly', 'with', 'the', 'number', 'of', 'data', 'points']] | [-0.019213302769271814, -0.013403588863852692, -0.07651078277996864, 0.12711296193526092, -0.06552025585025774, -0.12476580991993198, 0.0534711119137036, 0.3739827243409243, -0.26569131030879933, -0.32516072181906236, 0.1021226568144735, -0.27999641571238815, -0.15860592160396367, 0.21882998812607074, -0.07922075482938125, 0.06404027298754866, 0.06908154330519309, 0.04709230394664372, -0.04654335250926529, -0.295023935848387, 0.3154460998127203, 0.06833339863490448, 0.3224592848361122, 0.02426876277516944, 0.12338498519475471, -0.012529673718241414, -0.018304280992821758, 0.05909458987684135, -0.070491202880377, 0.13735460152664414, 0.2548295599352344, 0.1952780618932637, 0.2865718574226688, -0.39549506607140045, -0.18171475832743278, 0.10626169636912913, 0.12125004606085818, 0.11088939187762464, -0.048928278083884974, -0.2690655606047037, 0.11656768202461885, -0.12716353296425686, -0.0585807416930301, -0.17019315090707884, -0.027433063287893873, 0.031212058663789004, -0.3116888490990113, 0.06200100530039923, 0.06875125526069069, 0.047435299207243216, -0.035673524143668006, -0.12689289502120654, -0.023798101427347725, 0.13360023192208575, 0.0735016933541341, 0.04435147206630019, 0.09017541247464896, -0.11215140953217669, -0.11660457562924509, 0.37843266874551773, -0.11092679009559643, -0.20677257259656867, 0.22193863472329026, -0.09938933128625693, -0.13310853231990014, 0.11130812249976738, 0.16801610068664943, 0.130958864482187, -0.10938035633032075, 0.029536527680220498, -0.03405504822394395, 0.19446191411600056, 0.02631971045083041, 0.02633118766909802, 0.11632684848821127, 0.1975396206765155, 0.09385694492137037, 0.10361946740605678, -0.13562604293706884, -0.044623672395540645, -0.2700105579906558, -0.1434070117019835, -0.1916046247492174, -0.03657921045844679, -0.1307975170059664, -0.1303382101693157, 0.3863452109620424, 0.2059377420799532, 0.24133195605196328, 0.06414620407242665, 0.3581978832091014, 0.06034072504746335, 0.12264120248314667, 0.08998092661432204, 0.1935925706070904, 0.028637954447676528, 0.03844347031063299, -0.21645401427746716, 0.09695586786992534, 0.058258045209481954] |
1,803.00855 | Pentagon identities arising in supersymmetric gauge theory computations | The partition functions of three-dimensional N=2 supersymmetric gauge
theories on different manifolds can be expressed as q-hypergeometric integrals.
By comparing the partition functions of three-dimensional mirror dual theories,
one finds complicated integral identities. In some cases, these identities can
be written in the form of pentagon relations. Such identities often have an
interpretation as the Pachner's 3-2 move for triangulated manifolds via the
so-called 3d-3d correspondence. From the physics perspective, another important
application of pentagon identities is that they may be used to construct new
solutions to the quantum Yang-Baxter equation.
| math-ph hep-th math.MP math.QA | the partition functions of threedimensional n2 supersymmetric gauge theories on different manifolds can be expressed as qhypergeometric integrals by comparing the partition functions of threedimensional mirror dual theories one finds complicated integral identities in some cases these identities can be written in the form of pentagon relations such identities often have an interpretation as the pachners 32 move for triangulated manifolds via the socalled 3d3d correspondence from the physics perspective another important application of pentagon identities is that they may be used to construct new solutions to the quantum yangbaxter equation | [['the', 'partition', 'functions', 'of', 'threedimensional', 'n2', 'supersymmetric', 'gauge', 'theories', 'on', 'different', 'manifolds', 'can', 'be', 'expressed', 'as', 'qhypergeometric', 'integrals', 'by', 'comparing', 'the', 'partition', 'functions', 'of', 'threedimensional', 'mirror', 'dual', 'theories', 'one', 'finds', 'complicated', 'integral', 'identities', 'in', 'some', 'cases', 'these', 'identities', 'can', 'be', 'written', 'in', 'the', 'form', 'of', 'pentagon', 'relations', 'such', 'identities', 'often', 'have', 'an', 'interpretation', 'as', 'the', 'pachners', '32', 'move', 'for', 'triangulated', 'manifolds', 'via', 'the', 'socalled', '3d3d', 'correspondence', 'from', 'the', 'physics', 'perspective', 'another', 'important', 'application', 'of', 'pentagon', 'identities', 'is', 'that', 'they', 'may', 'be', 'used', 'to', 'construct', 'new', 'solutions', 'to', 'the', 'quantum', 'yangbaxter', 'equation']] | [-0.12622303150128572, 0.07800255312419418, -0.10046557504683733, 0.1553951991786663, -0.11877138368371461, -0.17953455329148305, -0.059646646756057936, 0.2890347522786922, -0.29765643786328533, -0.2835864257481363, 0.11271119052802937, -0.28910347674455905, -0.22025816939357254, 0.19088453028558028, -0.06510427681625718, 0.029588600744803746, 0.030852339610767863, 0.02153882608335051, -0.12599590028403326, -0.2589193641466813, 0.34917417286584773, -0.05296250773826614, 0.21798664381106694, 0.02273361569063531, 0.05805237802883817, -0.008413461766516169, 0.021705987418277395, 0.017940567774166992, -0.13024677232000006, 0.13986110592571396, 0.2849194734150337, 0.11847664433427983, 0.14319330060647595, -0.48178128610468574, -0.15043703366277947, 0.07274344180089733, 0.21344733354118134, 0.08513691533977787, -0.013956390110413648, -0.28350614679770336, 0.00045629805988735625, -0.15032036842053964, -0.19914513296163122, -0.12741813483234082, -0.022501449768121042, 0.0010115246805879805, -0.2268184412477745, 0.04580048705554671, -0.010233671109502514, 0.025066927385826904, -0.06173215408085121, -0.12574893083268154, -0.06234178281026996, 0.1481254116166383, 0.04194002842090817, 0.04325518077756796, 0.07763148054170112, -0.19012403736511865, -0.1977498259395361, 0.3885110101973017, 0.014743353106961067, -0.3078420263514595, 0.15489787368310823, -0.09085360086109075, -0.21198106441750295, 0.08790642004460096, 0.07836958257377975, 0.16270188821686637, -0.17580353358967438, 0.13896037167093406, -0.11114648613664839, 0.06394371370681458, 0.14752158928248618, 0.042176357672239345, 0.24825484537157333, -0.004824638232174847, -0.006895688449084345, 0.2033349775463446, 0.050055245659314095, -0.1457815011911508, -0.3624398414356013, -0.19993799011119537, -0.13203122792765498, 0.14163029729388654, -0.14882957946198683, -0.17909448048513796, 0.33114926354286983, 0.07888263338374801, 0.13549546193745401, 0.04011677392861909, 0.1768751522526145, 0.17924382070131187, 0.15033003576099874, -0.021261121223991115, 0.15892282473602487, 0.16613222930011237, 0.04959033356669049, -0.12813094620748114, -0.04336058117656244, 0.24066224007660317] |
1,803.00856 | Embedded loops in the hyperbolic plane with prescribed, almost constant
curvature | Given a constant $k>1$ and a real valued function $K$ on the hyperbolic plane
$\mathbb H^2$, we study the problem of finding, for any $\epsilon\approx 0$, a
closed and embedded curve $u^\epsilon $ in $\mathbb H^2$ having geodesic
curvature $k+\epsilon K(u^\epsilon)$ at each point.
| math.DG | given a constant k1 and a real valued function k on the hyperbolic plane mathbb h2 we study the problem of finding for any epsilonapprox 0 a closed and embedded curve uepsilon in mathbb h2 having geodesic curvature kepsilon kuepsilon at each point | [['given', 'a', 'constant', 'k1', 'and', 'a', 'real', 'valued', 'function', 'k', 'on', 'the', 'hyperbolic', 'plane', 'mathbb', 'h2', 'we', 'study', 'the', 'problem', 'of', 'finding', 'for', 'any', 'epsilonapprox', '0', 'a', 'closed', 'and', 'embedded', 'curve', 'uepsilon', 'in', 'mathbb', 'h2', 'having', 'geodesic', 'curvature', 'kepsilon', 'kuepsilon', 'at', 'each', 'point']] | [-0.24093685538641044, 0.04040592236976538, 0.019356899440199846, -0.011844456905410403, -0.06857924495956727, -0.15514118110184513, -0.0016538962233989011, 0.3553801310204324, -0.2828491027245209, -0.15175152295047328, 0.09712648617624793, -0.324513024384422, -0.102570149238177, 0.1848690099459851, -0.02639318012266553, 0.034555296457949136, -0.015030309380519958, 0.11496108885677088, -0.09484009076619432, -0.25295522729200975, 0.32451967965988887, -0.12680857499972695, 0.117289482161314, 0.06531523660357509, 0.14160301713716417, -0.014361574358883359, 0.0504385911737613, 0.009108910270567452, -0.28362487867984565, 0.07111680449729431, 0.22958038564372277, 0.08849564295572539, 0.22488731152511068, -0.3240309434809855, -0.24295832673531204, 0.25723227491557954, 0.1447910225861484, -0.05753096445862736, -0.029892554431821088, -0.23234764694990145, 0.11895906635826188, 0.017338454435091643, -0.21571051453550658, 0.05902944157077443, 0.10555113253316709, -0.010841717439082762, -0.2824902271053621, 0.028353858295650708, 0.07128014446546634, 0.1159617456696218, -0.10512365626969508, -0.12542777588324888, -0.0621463841026915, 0.05081561965025252, -0.05228045218003293, 0.2195352356869816, 0.0967125342382739, -0.026911962940911985, -0.007827160990841332, 0.41585426680034115, -0.1478315701796895, -0.301351877417238, 0.07041862948487203, -0.19296221368546998, -0.14814444980584085, 0.19325094989367894, 0.1510877681873916, 0.20104998662801726, -0.015393654283668314, 0.2610019017870183, -0.09797361220366188, 0.11335484118414267, 0.11600807958859063, -0.08228740672625247, 0.16424315885108495, 0.03275716402346179, 0.10559908126569575, 0.10859543387223744, -0.032382936721357204, -0.05923990423547193, -0.3854365050792694, -0.22441360759105355, -0.17621757337612853, 0.18728120970938886, -0.20780592756498317, -0.20442873844876885, 0.3034256116176645, -0.04528700032581886, 0.24113389396197385, 0.1233151694537983, 0.27104281212779735, 0.12371867793817296, -0.04058286666847943, 0.15347072847985796, 0.05125382882986395, 0.11889089702162892, 0.008959238129180102, -0.1688254354965119, -0.043061800400859544, 0.100637176672795] |
1,803.00857 | Generic cycles, Lefschetz representations, and the generalized Hodge and
Bloch conjectures for abelian varieties | We prove Bloch's conjecture for correspondences on powers of complex abelian
varieties, that are "generically defined". As an application we establish
vanishing results for (skew-)symmetric cycles on powers of abelian varieties
and we address a question of Voisin concerning (skew-)symmetric cycles on
powers of K3 surfaces in the case of Kummer surfaces. We also prove Bloch's
conjecture in the following situation. Let $\gamma$ be a correspondence between
two abelian varieties $A$ and $B$ that can be written as a linear combination
of products of symmetric divisors. Assume that $A$ is isogenous to the product
of an abelian variety of totally real type with the power of an abelian
surface. We show that $\gamma$ satisfies the conclusion of Bloch's conjecture.
A key ingredient consists in establishing a strong form of the generalized
Hodge conjecture for Hodge sub-structures of the cohomology of $A$ that arise
as sub-representations of the Lefschetz group of $A$. As a by-product of our
method, we use a strong form of the generalized Hodge conjecture established
for powers of abelian surfaces to show that every finite-order symplectic
automorphism of a generalized Kummer variety acts as the identity on the
zero-cycles.
| math.AG | we prove blochs conjecture for correspondences on powers of complex abelian varieties that are generically defined as an application we establish vanishing results for skewsymmetric cycles on powers of abelian varieties and we address a question of voisin concerning skewsymmetric cycles on powers of k3 surfaces in the case of kummer surfaces we also prove blochs conjecture in the following situation let gamma be a correspondence between two abelian varieties a and b that can be written as a linear combination of products of symmetric divisors assume that a is isogenous to the product of an abelian variety of totally real type with the power of an abelian surface we show that gamma satisfies the conclusion of blochs conjecture a key ingredient consists in establishing a strong form of the generalized hodge conjecture for hodge substructures of the cohomology of a that arise as subrepresentations of the lefschetz group of a as a byproduct of our method we use a strong form of the generalized hodge conjecture established for powers of abelian surfaces to show that every finiteorder symplectic automorphism of a generalized kummer variety acts as the identity on the zerocycles | [['we', 'prove', 'blochs', 'conjecture', 'for', 'correspondences', 'on', 'powers', 'of', 'complex', 'abelian', 'varieties', 'that', 'are', 'generically', 'defined', 'as', 'an', 'application', 'we', 'establish', 'vanishing', 'results', 'for', 'skewsymmetric', 'cycles', 'on', 'powers', 'of', 'abelian', 'varieties', 'and', 'we', 'address', 'a', 'question', 'of', 'voisin', 'concerning', 'skewsymmetric', 'cycles', 'on', 'powers', 'of', 'k3', 'surfaces', 'in', 'the', 'case', 'of', 'kummer', 'surfaces', 'we', 'also', 'prove', 'blochs', 'conjecture', 'in', 'the', 'following', 'situation', 'let', 'gamma', 'be', 'a', 'correspondence', 'between', 'two', 'abelian', 'varieties', 'a', 'and', 'b', 'that', 'can', 'be', 'written', 'as', 'a', 'linear', 'combination', 'of', 'products', 'of', 'symmetric', 'divisors', 'assume', 'that', 'a', 'is', 'isogenous', 'to', 'the', 'product', 'of', 'an', 'abelian', 'variety', 'of', 'totally', 'real', 'type', 'with', 'the', 'power', 'of', 'an', 'abelian', 'surface', 'we', 'show', 'that', 'gamma', 'satisfies', 'the', 'conclusion', 'of', 'blochs', 'conjecture', 'a', 'key', 'ingredient', 'consists', 'in', 'establishing', 'a', 'strong', 'form', 'of', 'the', 'generalized', 'hodge', 'conjecture', 'for', 'hodge', 'substructures', 'of', 'the', 'cohomology', 'of', 'a', 'that', 'arise', 'as', 'subrepresentations', 'of', 'the', 'lefschetz', 'group', 'of', 'a', 'as', 'a', 'byproduct', 'of', 'our', 'method', 'we', 'use', 'a', 'strong', 'form', 'of', 'the', 'generalized', 'hodge', 'conjecture', 'established', 'for', 'powers', 'of', 'abelian', 'surfaces', 'to', 'show', 'that', 'every', 'finiteorder', 'symplectic', 'automorphism', 'of', 'a', 'generalized', 'kummer', 'variety', 'acts', 'as', 'the', 'identity', 'on', 'the', 'zerocycles']] | [-0.2210617510972952, 0.06601912724931935, -0.12189607581240125, 0.07294724054675801, -0.08295815793098882, -0.12720118983512899, -0.003577184379537357, 0.28936742004952976, -0.31126736104488373, -0.20004991976505457, 0.08863758317177901, -0.19968413068636437, -0.18825770658198357, 0.24962574368692003, -0.15538393065313963, -0.06384727697877679, 0.02869982876048501, 0.07960256823328866, -0.08996488116099499, -0.32141058130522043, 0.45416156951493275, -0.0741770148906653, 0.2363504732978375, 0.1349932798621012, 0.11190400953879968, 0.02786099361401284, 0.0014567850084858947, -0.03192736673493831, -0.09262989630095338, 0.13535066955106836, 0.31352784774207976, 0.05858944227171984, 0.18102526409590305, -0.3941912431975349, -0.16117357921636236, 0.2125960346214318, 0.07973730732192053, 0.004292651060192536, -0.037746575816224016, -0.20581200022206758, 0.10763202615635237, -0.20061404839604316, -0.2366530858950379, -0.09054455781370052, 0.043109722430623755, 0.041848539032798726, -0.25513515968729433, 0.008229253962629931, 0.13106726488331333, 0.1394179132039426, -0.051459325009394284, -0.09302583098906325, -0.06939601224075886, 0.04975848966569174, 0.035218745303912634, 0.013399529840777783, 0.05044191033963822, -0.1226096364359061, -0.14258312939152043, 0.38214358178568847, -0.10461000206123572, -0.1882971433030131, 0.10209413644952292, -0.12395120287692407, -0.19242513697463437, 0.10756119364426316, 0.10023261055054415, 0.18845029027943383, 0.026318811932772707, 0.16462646569986342, -0.19477629386346962, 0.07405947521995888, 0.13960899869319596, -0.04933137684080672, 0.14876235508684962, 0.07051207975140035, 0.06868035273995095, 0.14115697288313336, -0.010064485497423448, -0.013725502348582571, -0.3861274865970093, -0.24444249698111284, -0.13876827081791512, 0.2144471404123275, -0.11231441665086095, -0.19394589914008975, 0.3831558712226979, 0.023573157035571057, 0.17270681439549662, 0.12618188099683417, 0.20344759252899772, 0.05028844024279048, 0.045198840706689225, 0.024348553068800054, 0.11864788460661657, 0.28634854608875077, -0.07913825930154417, -0.1276891477797714, -0.018923125838531025, 0.20794034652256718] |
1,803.00858 | Numerical Relativity with Arbitrary Precision Arithmetic: Applications
to Gravitational Collapse | Numerical Relativity is a mature field with many applications in
Astrophysics, Cosmology and even in Fundamental Physics. As such, we are
entering a stage in which new sophisticated methods adapted to open problems
are being developed. In this paper, we advocate the use of Pseudo-Spectral
Collocation (PSC) methods in combination with high-order precision arithmetic
for Numerical Relativity problems with high accuracy and performance
requirements. The PSC method provides exponential convergence (for smooth
problems, as is the case in many problems in Numerical Relativity) and we can
use different bit precision without the need of changing the structure of the
numerical algorithms. Moreover, the PSC method provides high-compression
storage of the information. We introduce a series of techniques for combining
these tools and show their potential in two problems in relativistic
gravitational collapse: (i) The classical Choptuik collapse, estimating with
arbitrary precision the location of the apparent horizon. (ii) Collapse in
asympotically anti-de Sitter spacetimes, showing that the total energy is
preserved by the numerical evolution to a very high degree of precision.
| physics.comp-ph gr-qc | numerical relativity is a mature field with many applications in astrophysics cosmology and even in fundamental physics as such we are entering a stage in which new sophisticated methods adapted to open problems are being developed in this paper we advocate the use of pseudospectral collocation psc methods in combination with highorder precision arithmetic for numerical relativity problems with high accuracy and performance requirements the psc method provides exponential convergence for smooth problems as is the case in many problems in numerical relativity and we can use different bit precision without the need of changing the structure of the numerical algorithms moreover the psc method provides highcompression storage of the information we introduce a series of techniques for combining these tools and show their potential in two problems in relativistic gravitational collapse i the classical choptuik collapse estimating with arbitrary precision the location of the apparent horizon ii collapse in asympotically antide sitter spacetimes showing that the total energy is preserved by the numerical evolution to a very high degree of precision | [['numerical', 'relativity', 'is', 'a', 'mature', 'field', 'with', 'many', 'applications', 'in', 'astrophysics', 'cosmology', 'and', 'even', 'in', 'fundamental', 'physics', 'as', 'such', 'we', 'are', 'entering', 'a', 'stage', 'in', 'which', 'new', 'sophisticated', 'methods', 'adapted', 'to', 'open', 'problems', 'are', 'being', 'developed', 'in', 'this', 'paper', 'we', 'advocate', 'the', 'use', 'of', 'pseudospectral', 'collocation', 'psc', 'methods', 'in', 'combination', 'with', 'highorder', 'precision', 'arithmetic', 'for', 'numerical', 'relativity', 'problems', 'with', 'high', 'accuracy', 'and', 'performance', 'requirements', 'the', 'psc', 'method', 'provides', 'exponential', 'convergence', 'for', 'smooth', 'problems', 'as', 'is', 'the', 'case', 'in', 'many', 'problems', 'in', 'numerical', 'relativity', 'and', 'we', 'can', 'use', 'different', 'bit', 'precision', 'without', 'the', 'need', 'of', 'changing', 'the', 'structure', 'of', 'the', 'numerical', 'algorithms', 'moreover', 'the', 'psc', 'method', 'provides', 'highcompression', 'storage', 'of', 'the', 'information', 'we', 'introduce', 'a', 'series', 'of', 'techniques', 'for', 'combining', 'these', 'tools', 'and', 'show', 'their', 'potential', 'in', 'two', 'problems', 'in', 'relativistic', 'gravitational', 'collapse', 'i', 'the', 'classical', 'choptuik', 'collapse', 'estimating', 'with', 'arbitrary', 'precision', 'the', 'location', 'of', 'the', 'apparent', 'horizon', 'ii', 'collapse', 'in', 'asympotically', 'antide', 'sitter', 'spacetimes', 'showing', 'that', 'the', 'total', 'energy', 'is', 'preserved', 'by', 'the', 'numerical', 'evolution', 'to', 'a', 'very', 'high', 'degree', 'of', 'precision']] | [-0.09962386642020943, 0.05156420162597368, -0.09523849792746004, 0.08460068636232727, -0.0790667529975952, -0.14392051005162038, -0.00866041831106359, 0.3654180066470533, -0.25831083657502923, -0.32660180574748665, 0.1431004937628533, -0.23206748460895968, -0.12094483215654225, 0.24045559420077087, -0.08120939925280508, 0.11501074326495359, 0.09817085419185893, 0.005307109253535177, -0.13374835227854376, -0.2511094967295892, 0.31403221844608875, 0.08120915929104613, 0.2366137275428966, 0.017978915499339183, 0.0879204215503536, -0.03811240496877364, -0.04312615642604299, 0.051068839856503304, -0.12621071807611875, 0.13358490344754226, 0.27161894814479487, 0.1802759807324037, 0.321185065770446, -0.41475475650296956, -0.23245255737568843, 0.06565492701659867, 0.15398808732780433, 0.14957129001295258, -0.10747612479649116, -0.24325902076562606, 0.08317448745947331, -0.16665548270747274, -0.15427449633513557, -0.09247509824642695, -0.017236303767530506, 0.04386400078899812, -0.2565027641780203, 0.09561829027438233, 0.00804102899937154, 0.048790062845381364, -0.04401099237310158, -0.08427840164594547, 0.049931583755519676, 0.10000787459876995, 0.04439867952659856, 0.013723161133130752, 0.07182055664384808, -0.15252900115338824, -0.14856433668200922, 0.4142544637867358, -0.05232020402983708, -0.22524399131666437, 0.19199382932518264, -0.16655790701584328, -0.15782301489881045, 0.10160020633254113, 0.1722061368149467, 0.1487961457961044, -0.09169170674685183, 0.11829506634425935, 0.05266082300371382, 0.12607670307206295, 0.0687050515742496, 0.026689450844694578, 0.20490461569631385, 0.18372793854647423, 0.04623519676279948, 0.09676172710456994, -0.07686852973880419, -0.10471858552130492, -0.3196459683145635, -0.15196502739888465, -0.15014594553754568, 0.01761330287770888, -0.13391709280285582, -0.16264627311584476, 0.3478001073695893, 0.1527314815669575, 0.10025536382928231, 0.04439540062340648, 0.31951109855977256, 0.09169251568071263, 0.015587375905408068, 0.10786211891532138, 0.26262736559756167, 0.11743680723038567, 0.14501338640260403, -0.2149957666304883, 0.009477786153966432, 0.068742647369089] |
1,803.00859 | Renormalization group properties of the conformal mode of a torus | The Wilsonian renormalization group properties of the conformal factor of the
metric are profoundly altered by the fact that it has a wrong-sign kinetic
term. If couplings are chosen so that the quantum field theory exists on
$\mathbb{R}^4$, it fails to exist on manifolds below a certain size, if a
certain universal shape function turns negative. We demonstrate that this is
triggered by inhomogeneity in the cases of $\mathbb{T}^4$ and
$\mathbb{T}^3\times\mathbb{R}$, including twisted versions. Varying the moduli,
we uncover a rich phenomenology.
| hep-th gr-qc | the wilsonian renormalization group properties of the conformal factor of the metric are profoundly altered by the fact that it has a wrongsign kinetic term if couplings are chosen so that the quantum field theory exists on mathbbr4 it fails to exist on manifolds below a certain size if a certain universal shape function turns negative we demonstrate that this is triggered by inhomogeneity in the cases of mathbbt4 and mathbbt3timesmathbbr including twisted versions varying the moduli we uncover a rich phenomenology | [['the', 'wilsonian', 'renormalization', 'group', 'properties', 'of', 'the', 'conformal', 'factor', 'of', 'the', 'metric', 'are', 'profoundly', 'altered', 'by', 'the', 'fact', 'that', 'it', 'has', 'a', 'wrongsign', 'kinetic', 'term', 'if', 'couplings', 'are', 'chosen', 'so', 'that', 'the', 'quantum', 'field', 'theory', 'exists', 'on', 'mathbbr4', 'it', 'fails', 'to', 'exist', 'on', 'manifolds', 'below', 'a', 'certain', 'size', 'if', 'a', 'certain', 'universal', 'shape', 'function', 'turns', 'negative', 'we', 'demonstrate', 'that', 'this', 'is', 'triggered', 'by', 'inhomogeneity', 'in', 'the', 'cases', 'of', 'mathbbt4', 'and', 'mathbbt3timesmathbbr', 'including', 'twisted', 'versions', 'varying', 'the', 'moduli', 'we', 'uncover', 'a', 'rich', 'phenomenology']] | [-0.17093690933751654, 0.20203074752813044, -0.11961042393504838, 0.10993454744464454, -0.09132623267762455, -0.1389028645971399, -0.003102265124462177, 0.35317248066910256, -0.282380233053118, -0.24392468459260316, 0.06824422571779355, -0.2667279549425951, -0.21296917801193985, 0.16966757577280572, -0.047624790126940715, -0.02382810487423414, 0.011410522912801415, 0.06299954947130179, -0.11154660405188707, -0.25244236785349333, 0.3919812091942417, 0.008469045580433751, 0.26880480474389995, 0.10048123747599023, 0.10874125563660292, -0.029463793964550636, 0.03256032907944403, 0.06640365728721749, -0.16330535272393235, 0.03423505149965669, 0.18536646272067303, 0.053821795510795016, 0.23653989858971333, -0.37457359122273365, -0.24427320253977805, 0.12433857931812972, 0.11348573307802809, 0.07863017592441153, -0.04852352522451569, -0.26613673818711603, 0.09966868999770578, -0.1450884898285163, -0.15052361358072103, -0.09915355968944452, 0.029179768747489118, -0.03865444203723728, -0.20623277255368452, 0.04284616457413376, 0.04974718842609429, 0.005584427787933821, -0.006949274881202497, -0.056311814551368175, -0.05996822354809186, 0.08971793406907423, 0.10048497537507411, 0.04696574234001247, 0.15697348247753617, -0.18381414501237925, -0.048332938435774894, 0.36922634215335604, -0.08250809639094421, -0.24106992182126383, 0.14602253670850193, -0.14897630837699974, -0.14992794504872076, 0.11278817042662406, 0.08383202775565471, 0.11575798929904668, -0.07974416828127923, 0.2020857068415398, -0.09123553176996885, 0.17236021387586256, 0.06259043130126817, 0.028694206135876386, 0.1773605865460855, 0.10541072556817974, 0.06405029275000418, 0.11422017893328527, -0.0016478717292624492, -0.1277408790487198, -0.35934807557934595, -0.10098803560192018, -0.1442646358254147, 0.1334360694558716, -0.13253257723139272, -0.19615497196346154, 0.3943753982376721, 0.10573861374211481, 0.2073662466496045, 0.01570390135532728, 0.19194897322162388, 0.11518897024201757, 0.134254567940248, 0.06727782934674142, 0.26350912346251676, 0.1327671175793871, 0.02505455311405024, -0.2145183982699822, 0.025254983725141227, 0.10135777272789935] |
1,803.0086 | Can we steal your vocal identity from the Internet?: Initial
investigation of cloning Obama's voice using GAN, WaveNet and low-quality
found data | Thanks to the growing availability of spoofing databases and rapid advances
in using them, systems for detecting voice spoofing attacks are becoming more
and more capable, and error rates close to zero are being reached for the
ASVspoof2015 database. However, speech synthesis and voice conversion paradigms
that are not considered in the ASVspoof2015 database are appearing. Such
examples include direct waveform modelling and generative adversarial networks.
We also need to investigate the feasibility of training spoofing systems using
only low-quality found data. For that purpose, we developed a generative
adversarial network-based speech enhancement system that improves the quality
of speech data found in publicly available sources. Using the enhanced data, we
trained state-of-the-art text-to-speech and voice conversion models and
evaluated them in terms of perceptual speech quality and speaker similarity.
The results show that the enhancement models significantly improved the SNR of
low-quality degraded data found in publicly available sources and that they
significantly improved the perceptual cleanliness of the source speech without
significantly degrading the naturalness of the voice. However, the results also
show limitations when generating speech with the low-quality found data.
| eess.AS cs.CL cs.SD stat.ML | thanks to the growing availability of spoofing databases and rapid advances in using them systems for detecting voice spoofing attacks are becoming more and more capable and error rates close to zero are being reached for the asvspoof2015 database however speech synthesis and voice conversion paradigms that are not considered in the asvspoof2015 database are appearing such examples include direct waveform modelling and generative adversarial networks we also need to investigate the feasibility of training spoofing systems using only lowquality found data for that purpose we developed a generative adversarial networkbased speech enhancement system that improves the quality of speech data found in publicly available sources using the enhanced data we trained stateoftheart texttospeech and voice conversion models and evaluated them in terms of perceptual speech quality and speaker similarity the results show that the enhancement models significantly improved the snr of lowquality degraded data found in publicly available sources and that they significantly improved the perceptual cleanliness of the source speech without significantly degrading the naturalness of the voice however the results also show limitations when generating speech with the lowquality found data | [['thanks', 'to', 'the', 'growing', 'availability', 'of', 'spoofing', 'databases', 'and', 'rapid', 'advances', 'in', 'using', 'them', 'systems', 'for', 'detecting', 'voice', 'spoofing', 'attacks', 'are', 'becoming', 'more', 'and', 'more', 'capable', 'and', 'error', 'rates', 'close', 'to', 'zero', 'are', 'being', 'reached', 'for', 'the', 'asvspoof2015', 'database', 'however', 'speech', 'synthesis', 'and', 'voice', 'conversion', 'paradigms', 'that', 'are', 'not', 'considered', 'in', 'the', 'asvspoof2015', 'database', 'are', 'appearing', 'such', 'examples', 'include', 'direct', 'waveform', 'modelling', 'and', 'generative', 'adversarial', 'networks', 'we', 'also', 'need', 'to', 'investigate', 'the', 'feasibility', 'of', 'training', 'spoofing', 'systems', 'using', 'only', 'lowquality', 'found', 'data', 'for', 'that', 'purpose', 'we', 'developed', 'a', 'generative', 'adversarial', 'networkbased', 'speech', 'enhancement', 'system', 'that', 'improves', 'the', 'quality', 'of', 'speech', 'data', 'found', 'in', 'publicly', 'available', 'sources', 'using', 'the', 'enhanced', 'data', 'we', 'trained', 'stateoftheart', 'texttospeech', 'and', 'voice', 'conversion', 'models', 'and', 'evaluated', 'them', 'in', 'terms', 'of', 'perceptual', 'speech', 'quality', 'and', 'speaker', 'similarity', 'the', 'results', 'show', 'that', 'the', 'enhancement', 'models', 'significantly', 'improved', 'the', 'snr', 'of', 'lowquality', 'degraded', 'data', 'found', 'in', 'publicly', 'available', 'sources', 'and', 'that', 'they', 'significantly', 'improved', 'the', 'perceptual', 'cleanliness', 'of', 'the', 'source', 'speech', 'without', 'significantly', 'degrading', 'the', 'naturalness', 'of', 'the', 'voice', 'however', 'the', 'results', 'also', 'show', 'limitations', 'when', 'generating', 'speech', 'with', 'the', 'lowquality', 'found', 'data']] | [-0.08626250062092289, 0.0016090034685317812, -0.004220493641459261, 0.08810206845848133, -0.08118897126785116, -0.19190152178002198, 0.04424072125339475, 0.4297973468186999, -0.2181970681084077, -0.3322379729937023, 0.09938047165253563, -0.3231302197293743, -0.1580663195092474, 0.27959652281234687, -0.1442344097759696, 0.1278467987051598, 0.1526652738634173, 0.035334363310223285, -0.035806423277751055, -0.3037976908368443, 0.2844690123557761, 0.05732046948928062, 0.3982567691709846, 0.029431876077306577, 0.0767031707706021, -0.06759689903296733, -0.06293538023506383, -0.08439919349747589, -0.022975596152323502, 0.15025788913835245, 0.35114713462941005, 0.24738966425344266, 0.2443340263872296, -0.41076704246275453, -0.22619542495205835, 0.09758692324090668, 0.16743222803241856, 0.1340175913583548, -0.12062849433230281, -0.3904389731912449, 0.12975977294643046, -0.2007105175795479, 0.04293491332488054, -0.10826393717940411, -0.01981920366043873, 0.0010042896598030854, -0.27598200572095305, 0.04194323690424663, 0.08886397568984768, 0.11066977038179808, -0.05497450288385153, -0.1272614777117269, -0.023348095199174208, 0.18991427717723444, 0.07627434018397015, 0.029621131919354768, 0.147600368186629, -0.21918621150594528, -0.10303993417651129, 0.38178691987717606, -0.09476904058449334, -0.18653144735625296, 0.2091581631349349, -0.037743214815197025, -0.13509790480400072, 0.1344367973082547, 0.22259984655386728, 0.0648179304856888, -0.20628814509496884, -0.042061939629607165, 0.05711101425265003, 0.25265970183650294, 0.06177630133575092, 0.04587606029615373, 0.13653920957649066, 0.1894652896153275, -0.03786287629349238, 0.1497654003336641, -0.13327200175041545, 0.010073129125648056, -0.16856862203744444, -0.0627502724654851, -0.17771740158027766, -0.04725789425901894, -0.06072107814203343, -0.10446839487374983, 0.3578729313120003, 0.26039445782383985, 0.13512569941129818, 0.10563883358744257, 0.38328229277597176, 0.02655154445876732, 0.11025690929154339, 0.0791274421321957, 0.24944039037117086, -0.030800977644621922, 0.14180207159876337, -0.1632177358677955, 0.12779343491369535, -0.0534972375481511] |
1,803.00861 | The Determination of 2-color zero-sum generalized Schur Numbers | Consider the equation $\mathcal{E}: x_1+ \cdots+x_{k-1} =x_{k}$ and let $k$
and $r$ be positive integers such that $r\mid k$. The number
$S_{\mathfrak{z},2}(k;r)$ is defined to be the least positive integer $t$ such
that for any 2-coloring $\chi: [1, t] \to \{0, 1\}$ there exists a solution
$(\hat{x}_1, \hat{x}_2, \ldots, \hat{x}_k)$ to the equation $\mathcal{E}$
satisfying $\displaystyle \sum_{i=1}^k\chi(\hat{x}_i) \equiv 0\pmod{r}$. In a
recent paper, the first author posed the question of determining the exact
value of $S_{\mathfrak{z}, 2}(k;4)$. In this article, we solve this problem and
show, more generally, that $S_{\mathfrak{z}, 2}(k, r)=kr - 2r+1$ for all
positive integers $k$ and $r$ with $k>r$ and $r \mid k$.
| math.CO | consider the equation mathcale x_1 cdotsx_k1 x_k and let k and r be positive integers such that rmid k the number s_mathfrakz2kr is defined to be the least positive integer t such that for any 2coloring chi 1 t to 0 1 there exists a solution hatx_1 hatx_2 ldots hatx_k to the equation mathcale satisfying displaystyle sum_i1kchihatx_i equiv 0pmodr in a recent paper the first author posed the question of determining the exact value of s_mathfrakz 2k4 in this article we solve this problem and show more generally that s_mathfrakz 2k rkr 2r1 for all positive integers k and r with kr and r mid k | [['consider', 'the', 'equation', 'mathcale', 'x_1', 'cdotsx_k1', 'x_k', 'and', 'let', 'k', 'and', 'r', 'be', 'positive', 'integers', 'such', 'that', 'rmid', 'k', 'the', 'number', 's_mathfrakz2kr', 'is', 'defined', 'to', 'be', 'the', 'least', 'positive', 'integer', 't', 'such', 'that', 'for', 'any', '2coloring', 'chi', '1', 't', 'to', '0', '1', 'there', 'exists', 'a', 'solution', 'hatx_1', 'hatx_2', 'ldots', 'hatx_k', 'to', 'the', 'equation', 'mathcale', 'satisfying', 'displaystyle', 'sum_i1kchihatx_i', 'equiv', '0pmodr', 'in', 'a', 'recent', 'paper', 'the', 'first', 'author', 'posed', 'the', 'question', 'of', 'determining', 'the', 'exact', 'value', 'of', 's_mathfrakz', '2k4', 'in', 'this', 'article', 'we', 'solve', 'this', 'problem', 'and', 'show', 'more', 'generally', 'that', 's_mathfrakz', '2k', 'rkr', '2r1', 'for', 'all', 'positive', 'integers', 'k', 'and', 'r', 'with', 'kr', 'and', 'r', 'mid', 'k']] | [-0.24115900035365484, 0.11300436942838132, -0.013480749086011202, -0.022810779160354285, -0.0434315866837278, -0.24525895125232636, -0.017131081017432735, 0.30620490776374937, -0.31228068267926573, -0.23998651036061347, 0.04559347797418013, -0.3557353552803397, -0.1013844959018752, 0.12024694800376892, -0.023712451392784713, -0.006356653736438602, -0.0010578234200147563, 0.11901925091166049, -0.026920517946127803, -0.30930250361794603, 0.29541880071134075, -0.09867531690280884, 0.07001978432759642, 0.0663901913445443, 0.1110093985684216, -0.006035733106546104, 0.06952029219828545, 0.03281808901345357, -0.26303271368720743, 0.02627849720767699, 0.3304223365150392, 0.16250058653764426, 0.3167609733319841, -0.307319166501984, -0.12601018768968061, 0.2673339459579438, 0.1644890799280256, -0.08052362619899213, -0.0009376886963582365, -0.19521475426852702, 0.23772779762512072, -0.09472378028789535, -0.1064459419157356, -0.03352008388377726, 0.1822009107284248, -0.013970852121710777, -0.37973409636877475, 0.029663637299090623, 0.13324889412149787, 0.0842855201009661, -0.03465823064383585, -0.2553319974988699, 0.013781765718013048, 0.03980405184905976, 0.002693656190531328, 0.16282024522894062, -0.03380291404668242, -0.07553182701114565, -0.053829134651459755, 0.3273623956460506, -0.09656810708343982, -0.17448984330054373, 0.049712322372943166, -0.17379834106759517, -0.14334756244905292, 0.07912277762778103, 0.036973460465669634, 0.22185725893825292, -0.023206064281985163, 0.2102508388151182, -0.1376423471327871, 0.15018233575858175, 0.13422970029525458, -0.030390439028851687, 0.12056514302967117, 0.016673268493614158, 0.10386272573377937, 0.07493352696066723, 0.025316434847190976, 0.06897360258735716, -0.3378113337978721, -0.18116042131907306, -0.19513010341790504, 0.20048921118490398, -0.10241601583940792, -0.11114097904413939, 0.282505309432745, 0.13672616334282794, 0.22410646735690534, 0.11389822696335614, 0.2084303757215821, 0.12215053369291126, -0.05278807651076931, 0.14922352201770991, 0.01830999402794987, 0.15539596431655808, 0.03813341835513711, -0.18406341361347586, -0.0017268217616947367, 0.0955491978675127] |
1,803.00862 | A Fast Interior Point Method for Atomic Norm Soft Thresholding | The atomic norm provides a generalization of the $\ell_1$-norm to continuous
parameter spaces. When applied as a sparse regularizer for line spectral
estimation the solution can be obtained by solving a convex optimization
problem. This problem is known as atomic norm soft thresholding (AST). It can
be cast as a semidefinite program and solved by standard methods. In the
semidefinite formulation there are $O(N^2)$ dual variables which complicates
the implementation of a standard primal-dual interior-point method based on
symmetric cones. That has lead researcher to consider alternating direction
method of multipliers (ADMM) for the solution of AST, but this method is still
somewhat slow for large problem sizes. To obtain a faster algorithm we
reformulate AST as a non-symmetric conic program. That has two properties of
key importance to its numerical solution: the conic formulation has only $O(N)$
dual variables and the Toeplitz structure inherent to AST is preserved. Based
on it we derive FastAST which is a primal-dual interior point method for
solving AST. Two variants are considered with the fastest one requiring only
$O(N^2)$ flops per iteration. Extensive numerical experiments demonstrate that
FastAST solves AST significantly faster than a state-of-the-art solver based on
ADMM.
| math.NA cs.NA eess.SP | the atomic norm provides a generalization of the ell_1norm to continuous parameter spaces when applied as a sparse regularizer for line spectral estimation the solution can be obtained by solving a convex optimization problem this problem is known as atomic norm soft thresholding ast it can be cast as a semidefinite program and solved by standard methods in the semidefinite formulation there are on2 dual variables which complicates the implementation of a standard primaldual interiorpoint method based on symmetric cones that has lead researcher to consider alternating direction method of multipliers admm for the solution of ast but this method is still somewhat slow for large problem sizes to obtain a faster algorithm we reformulate ast as a nonsymmetric conic program that has two properties of key importance to its numerical solution the conic formulation has only on dual variables and the toeplitz structure inherent to ast is preserved based on it we derive fastast which is a primaldual interior point method for solving ast two variants are considered with the fastest one requiring only on2 flops per iteration extensive numerical experiments demonstrate that fastast solves ast significantly faster than a stateoftheart solver based on admm | [['the', 'atomic', 'norm', 'provides', 'a', 'generalization', 'of', 'the', 'ell_1norm', 'to', 'continuous', 'parameter', 'spaces', 'when', 'applied', 'as', 'a', 'sparse', 'regularizer', 'for', 'line', 'spectral', 'estimation', 'the', 'solution', 'can', 'be', 'obtained', 'by', 'solving', 'a', 'convex', 'optimization', 'problem', 'this', 'problem', 'is', 'known', 'as', 'atomic', 'norm', 'soft', 'thresholding', 'ast', 'it', 'can', 'be', 'cast', 'as', 'a', 'semidefinite', 'program', 'and', 'solved', 'by', 'standard', 'methods', 'in', 'the', 'semidefinite', 'formulation', 'there', 'are', 'on2', 'dual', 'variables', 'which', 'complicates', 'the', 'implementation', 'of', 'a', 'standard', 'primaldual', 'interiorpoint', 'method', 'based', 'on', 'symmetric', 'cones', 'that', 'has', 'lead', 'researcher', 'to', 'consider', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'for', 'the', 'solution', 'of', 'ast', 'but', 'this', 'method', 'is', 'still', 'somewhat', 'slow', 'for', 'large', 'problem', 'sizes', 'to', 'obtain', 'a', 'faster', 'algorithm', 'we', 'reformulate', 'ast', 'as', 'a', 'nonsymmetric', 'conic', 'program', 'that', 'has', 'two', 'properties', 'of', 'key', 'importance', 'to', 'its', 'numerical', 'solution', 'the', 'conic', 'formulation', 'has', 'only', 'on', 'dual', 'variables', 'and', 'the', 'toeplitz', 'structure', 'inherent', 'to', 'ast', 'is', 'preserved', 'based', 'on', 'it', 'we', 'derive', 'fastast', 'which', 'is', 'a', 'primaldual', 'interior', 'point', 'method', 'for', 'solving', 'ast', 'two', 'variants', 'are', 'considered', 'with', 'the', 'fastest', 'one', 'requiring', 'only', 'on2', 'flops', 'per', 'iteration', 'extensive', 'numerical', 'experiments', 'demonstrate', 'that', 'fastast', 'solves', 'ast', 'significantly', 'faster', 'than', 'a', 'stateoftheart', 'solver', 'based', 'on', 'admm']] | [-0.08655131119903484, -0.018404610114191304, -0.08069330671371307, 0.05689072817115152, -0.1303872405407355, -0.20300872005118997, 0.02597498088911867, 0.40985757341973256, -0.35171528379480865, -0.26976789815649005, 0.18931839930688119, -0.2177989771805665, -0.13168089301805444, 0.22035596313881545, -0.08205594187698413, 0.08922788110704488, 0.11931864226587385, 0.00208251396753374, -0.16663782366013788, -0.2508623833268804, 0.2495290870242992, 0.009616667462378433, 0.21858144743660868, 0.016766400705331686, 0.14174946098703622, 0.00841505911690903, 0.024947731962101052, 0.048138173983537966, -0.04810070446220595, 0.12592102261470178, 0.27360075066038936, 0.19576086756562064, 0.34153415006465404, -0.41789414933834645, -0.1455831078310814, 0.10769976849353287, 0.17613705272843927, 0.050439849737119506, -0.0660606064130408, -0.24009477494034878, 0.10829170372639543, -0.11393108337723948, -0.07382838401136939, -0.12405113452930272, -0.036312076067503966, -0.025216859544521755, -0.329763570111833, 0.04824310505688287, 0.06402273051807963, -0.019789807042019974, -0.05491808322246292, -0.17720757005136153, 0.0496770002466348, -0.009151005899484423, 0.06789244940209192, 0.10027096375160534, 0.10713087467263098, -0.05366673022172577, -0.13277501029984967, 0.38376610518010695, -0.031472367180295925, -0.27419208174033727, 0.13985297847515182, -0.0313203467077758, -0.13411288175578276, 0.14258998393599598, 0.17295920250342664, 0.22694640342366987, -0.121113531148441, 0.1467726770914448, -0.10333053579256322, 0.17757014322383258, 0.05203486603958359, -0.030971390226395012, 0.09406709912612304, 0.17798483699497758, 0.19903569281600492, 0.1548613997294205, -0.03620291470799634, -0.12206113290554152, -0.238073336876828, -0.13802793524384058, -0.2127223397633925, 0.005057701274522187, -0.12013122489536061, -0.17396418170369776, 0.37971811415087525, 0.11690195949661747, 0.15875003125864207, 0.0886654827237302, 0.33632922017966044, 0.1421353356053419, 0.09525506365134413, 0.11087498103614091, 0.1979832978362275, 0.13529563442079023, 0.07350070653819316, -0.23184770305302552, 0.06670860924335562, 0.21230735096566802] |
1,803.00863 | Deep-blue light emitting diode based on defect variations of a 2D hybrid
organic-inorganic low dimensional perovskite semiconductor | 2D hybrid organic-inorganic semiconductors (HOIS) are low-cost,
self-assembled semiconductors that have proven to be vital for novel
optoelectronic devices due to their inherent stable excitons even at room
temperature. 2D HOIS are chemically stable with respect to the 3D analogues,
but their inherent anisotropy complicates their implementation in devices,
including electroluminescence (EL) devices. We report on the synthesis,
characterization, cathodoluminescence and EL of a new 2D HOIS, (4-fluoro
phenethylamine-H)2PbBr4, and its defect variations (DVs). The latter, in
contrast to the pristine material, allow for the first time the simple
fabrication of a prototype blue EL device by coating DVs on a conducting anode
substrate and using a Ga/In droplet cathode. DVs' optimization can lead to
improved light emitting devices (LEDs) and the work here is expected to provide
the incentive for utilizing HOIS DVs, as these are compatible with industrial
scale synthesis. In contrast to the pristine iodine analogue, whose thin films
readily provide EL, only the DVs or mixtures with MoS2 nano-sized platelets
provide EL, after careful deposition. These exhibit defects that disrupt the
planar non-conductive nature of the micrometric 2D HOIS platelets, usually
aligned parallel to the substrate, thus, providing mechanisms for current flow.
Finally, the choice of the fluorine-modified amine enhances the functionality
of the DVs as LED materials compared to using unmodified amine due to the
repulsion among the amine tails, leading to stable decorated 2D inorganic
sheets that are weakly bound.
| cond-mat.mtrl-sci | 2d hybrid organicinorganic semiconductors hois are lowcost selfassembled semiconductors that have proven to be vital for novel optoelectronic devices due to their inherent stable excitons even at room temperature 2d hois are chemically stable with respect to the 3d analogues but their inherent anisotropy complicates their implementation in devices including electroluminescence el devices we report on the synthesis characterization cathodoluminescence and el of a new 2d hois 4fluoro phenethylamineh2pbbr4 and its defect variations dvs the latter in contrast to the pristine material allow for the first time the simple fabrication of a prototype blue el device by coating dvs on a conducting anode substrate and using a gain droplet cathode dvs optimization can lead to improved light emitting devices leds and the work here is expected to provide the incentive for utilizing hois dvs as these are compatible with industrial scale synthesis in contrast to the pristine iodine analogue whose thin films readily provide el only the dvs or mixtures with mos2 nanosized platelets provide el after careful deposition these exhibit defects that disrupt the planar nonconductive nature of the micrometric 2d hois platelets usually aligned parallel to the substrate thus providing mechanisms for current flow finally the choice of the fluorinemodified amine enhances the functionality of the dvs as led materials compared to using unmodified amine due to the repulsion among the amine tails leading to stable decorated 2d inorganic sheets that are weakly bound | [['2d', 'hybrid', 'organicinorganic', 'semiconductors', 'hois', 'are', 'lowcost', 'selfassembled', 'semiconductors', 'that', 'have', 'proven', 'to', 'be', 'vital', 'for', 'novel', 'optoelectronic', 'devices', 'due', 'to', 'their', 'inherent', 'stable', 'excitons', 'even', 'at', 'room', 'temperature', '2d', 'hois', 'are', 'chemically', 'stable', 'with', 'respect', 'to', 'the', '3d', 'analogues', 'but', 'their', 'inherent', 'anisotropy', 'complicates', 'their', 'implementation', 'in', 'devices', 'including', 'electroluminescence', 'el', 'devices', 'we', 'report', 'on', 'the', 'synthesis', 'characterization', 'cathodoluminescence', 'and', 'el', 'of', 'a', 'new', '2d', 'hois', '4fluoro', 'phenethylamineh2pbbr4', 'and', 'its', 'defect', 'variations', 'dvs', 'the', 'latter', 'in', 'contrast', 'to', 'the', 'pristine', 'material', 'allow', 'for', 'the', 'first', 'time', 'the', 'simple', 'fabrication', 'of', 'a', 'prototype', 'blue', 'el', 'device', 'by', 'coating', 'dvs', 'on', 'a', 'conducting', 'anode', 'substrate', 'and', 'using', 'a', 'gain', 'droplet', 'cathode', 'dvs', 'optimization', 'can', 'lead', 'to', 'improved', 'light', 'emitting', 'devices', 'leds', 'and', 'the', 'work', 'here', 'is', 'expected', 'to', 'provide', 'the', 'incentive', 'for', 'utilizing', 'hois', 'dvs', 'as', 'these', 'are', 'compatible', 'with', 'industrial', 'scale', 'synthesis', 'in', 'contrast', 'to', 'the', 'pristine', 'iodine', 'analogue', 'whose', 'thin', 'films', 'readily', 'provide', 'el', 'only', 'the', 'dvs', 'or', 'mixtures', 'with', 'mos2', 'nanosized', 'platelets', 'provide', 'el', 'after', 'careful', 'deposition', 'these', 'exhibit', 'defects', 'that', 'disrupt', 'the', 'planar', 'nonconductive', 'nature', 'of', 'the', 'micrometric', '2d', 'hois', 'platelets', 'usually', 'aligned', 'parallel', 'to', 'the', 'substrate', 'thus', 'providing', 'mechanisms', 'for', 'current', 'flow', 'finally', 'the', 'choice', 'of', 'the', 'fluorinemodified', 'amine', 'enhances', 'the', 'functionality', 'of', 'the', 'dvs', 'as', 'led', 'materials', 'compared', 'to', 'using', 'unmodified', 'amine', 'due', 'to', 'the', 'repulsion', 'among', 'the', 'amine', 'tails', 'leading', 'to', 'stable', 'decorated', '2d', 'inorganic', 'sheets', 'that', 'are', 'weakly', 'bound']] | [-0.08343784182378422, 0.11881470389947967, -0.03203473031888576, -0.042143046541030564, -0.048011072561576516, -0.2100171842502406, 0.03727093759279392, 0.4650188369252779, -0.24547038719261888, -0.32233565611402054, 0.05241640942429029, -0.2853534908859307, -0.14299825845434141, 0.22091741719914704, -0.08016392349889062, 0.0608438724647436, 0.007381383395082289, -0.12425095635796538, -0.03966752817662425, -0.19316066320148165, 0.1890190990557774, 0.07210307616276802, 0.37417167783994626, 0.07083581411479592, 0.05134738491280524, -0.02893430442457355, 0.07026803435741767, 0.013057330893072832, -0.12725180298908262, 0.1436357436144061, 0.25602756483908023, -0.07750506520415197, 0.18861166275078392, -0.5139406668302071, -0.21028893142678803, 0.00840085774036564, 0.1364100985333939, 0.09017349464035405, -0.14741809539299042, -0.265044357575668, 0.12991338804196326, -0.12546200387763426, -0.08081246566246868, -0.07644465127600109, -0.03824623556190086, 0.04491795095427226, -0.20953290191925703, 0.04731836585355963, 0.04839950631364636, 0.018347618983490913, -0.08835065941792981, -0.12134992541013837, -0.08494362821842467, 0.08303446598778691, -0.012469408473563521, -0.03892262688590126, 0.2434137826006012, -0.12986658012310578, -0.09364873164857022, 0.39175425005513104, -0.01704686306953598, -0.1274763904696794, 0.24301619885905043, -0.10716889164827229, -0.057580182110978685, 0.18465246524373988, 0.14784653523393262, 0.13683975269681226, -0.1680526299170536, 0.053824970006039405, 0.03216601232123709, 0.1739601729994304, 0.09846066262237248, 0.1137056216685493, 0.26085057391289446, 0.24982555785472205, 0.04283531091279398, 0.13888341314688948, -0.09732492255494637, -0.02640152719099666, -0.1590351044113424, -0.2399529743124731, -0.1551777985498565, 0.04493094012620879, -0.06825543173999514, -0.2592615349280204, 0.35871187772585855, 0.12721752470994743, 0.15233628518775488, -0.0016980802304563092, 0.2868288471553347, 0.029974472448689456, 0.12150143281568657, -0.039213556729361033, 0.24754200531209744, 0.10914295147245054, 0.1534380579933493, -0.21076267747840016, 0.11469453822045943, -0.020017682665123607] |
1,803.00864 | Game-theoretical model of cooperation between producers in a production
process: 3-agent interaction case | A network model of manufacturing system is considered. This is a network
formation game where players are participants of a production process and their
actions are their's requests for interaction. Production networks are formed as
a result of an interaction. Players' payoff functions are defined on the set of
all possible networks. In this paper the special case of network formation
games is considered. Payoff functions are supposed to be additive and depend on
subsets of arcs. Two cases are considered. First, subsets of arcs are supposed
to be not intersected. The necessary and sufficient conditions for equilibrium
are given for this case. The second case is the one where subsets of arcs are
determined by 3-agent coalitions. An illustrative example is given where
equilibria and a compromise solution are found.
| math.OC cs.GT | a network model of manufacturing system is considered this is a network formation game where players are participants of a production process and their actions are theirs requests for interaction production networks are formed as a result of an interaction players payoff functions are defined on the set of all possible networks in this paper the special case of network formation games is considered payoff functions are supposed to be additive and depend on subsets of arcs two cases are considered first subsets of arcs are supposed to be not intersected the necessary and sufficient conditions for equilibrium are given for this case the second case is the one where subsets of arcs are determined by 3agent coalitions an illustrative example is given where equilibria and a compromise solution are found | [['a', 'network', 'model', 'of', 'manufacturing', 'system', 'is', 'considered', 'this', 'is', 'a', 'network', 'formation', 'game', 'where', 'players', 'are', 'participants', 'of', 'a', 'production', 'process', 'and', 'their', 'actions', 'are', 'theirs', 'requests', 'for', 'interaction', 'production', 'networks', 'are', 'formed', 'as', 'a', 'result', 'of', 'an', 'interaction', 'players', 'payoff', 'functions', 'are', 'defined', 'on', 'the', 'set', 'of', 'all', 'possible', 'networks', 'in', 'this', 'paper', 'the', 'special', 'case', 'of', 'network', 'formation', 'games', 'is', 'considered', 'payoff', 'functions', 'are', 'supposed', 'to', 'be', 'additive', 'and', 'depend', 'on', 'subsets', 'of', 'arcs', 'two', 'cases', 'are', 'considered', 'first', 'subsets', 'of', 'arcs', 'are', 'supposed', 'to', 'be', 'not', 'intersected', 'the', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'equilibrium', 'are', 'given', 'for', 'this', 'case', 'the', 'second', 'case', 'is', 'the', 'one', 'where', 'subsets', 'of', 'arcs', 'are', 'determined', 'by', '3agent', 'coalitions', 'an', 'illustrative', 'example', 'is', 'given', 'where', 'equilibria', 'and', 'a', 'compromise', 'solution', 'are', 'found']] | [-0.17794359992974654, 0.08856673773149781, -0.030552053852723193, 0.07944457608040326, -0.04202685146055256, -0.1679586014817827, 0.03316312945501592, 0.40385790724450576, -0.25115544509787396, -0.25652612634003163, 0.11416662842697965, -0.308172385310396, -0.1482354792766273, 0.13456299037744218, -0.09073595767840743, 0.004776133210040056, 0.0662911972317558, 0.07205986330249849, 0.055848149478417604, -0.33533332915976644, 0.39727021857666284, -0.010565471258730842, 0.19629566841400586, 0.05058533251285553, 0.0475822203935912, -0.05830592766153411, 0.007600084476423664, 0.05000485771058895, -0.10314853087497446, 0.06556092095919526, 0.27093970792171046, 0.15209033434041955, 0.2974541380714912, -0.4140275289949316, -0.1572505443983783, 0.16510481064637694, 0.10177685945079877, 0.07625760089319486, 0.01049235427680497, -0.2597057147184387, 0.08877437353635637, -0.16612817659400977, -0.07616450356749388, -0.04340708354273094, 0.02775696972385049, 0.09013216336472676, -0.3653498059174476, -0.01504413471198999, 0.027888661429572564, 0.032242794839951856, -0.07703252465177614, -0.10592875911119895, -0.058841416381227855, 0.18797932356381072, 0.01404871527674214, 0.013482813160114277, 0.13164163429576617, -0.1296990305525609, -0.14124105501060302, 0.4267291433392809, 0.03894056846710065, -0.24104163945862989, 0.17621631003701343, -0.10756545886039161, -0.11012387711984607, 0.09250428584995321, 0.17499627843499183, 0.15565775521099567, -0.18079878135512656, 0.03765096676428444, -0.08986242265225602, 0.11108975607830171, 0.07201633137435867, 0.04294289836230186, 0.19187129568308592, 0.1901071108268717, 0.10101035885297908, 0.13100947947778668, 0.027286537725908253, -0.1369019364799337, -0.335968915036378, -0.11045378000260546, -0.1952948880319197, 0.015349649466113007, -0.050576810326982434, -0.1558962533608652, 0.36365535834517615, 0.05953334485395596, 0.19127909167862248, 0.07311517242342233, 0.25463528733413954, 0.12522140986324162, 0.02372697288922679, 0.08401137698943226, 0.20343809336280594, 0.0917997430329426, 0.033422073514129104, -0.10842580798176081, 0.16465787748233057, 0.04106281038481169] |
1,803.00865 | Nash equilibria in routing games with edge priorities | In this paper we present a new competitive packet routing model with edge
priorities. We consider players that route selfishly through a network over
time and try to reach their destinations as fast as possible. If the number of
players who want to enter an edge at the same time exceeds the inflow capacity
of this edge, edge priorities with respect to the preceding edge solve these
conflicts. Our edge priorities are well-motivated by applications in traffic.
For this class of games, we show the existence of equilibrium solutions for
single-source-single-sink games and we analyze structural properties of these
solutions. We present an algorithm that computes Nash equilibria and we prove
bounds both on the Price of Stability and on the Price of Anarchy. Moreover, we
introduce the new concept of a Price of Mistrust. Finally, we also study the
relations to earliest arrival flows.
| cs.GT cs.DM | in this paper we present a new competitive packet routing model with edge priorities we consider players that route selfishly through a network over time and try to reach their destinations as fast as possible if the number of players who want to enter an edge at the same time exceeds the inflow capacity of this edge edge priorities with respect to the preceding edge solve these conflicts our edge priorities are wellmotivated by applications in traffic for this class of games we show the existence of equilibrium solutions for singlesourcesinglesink games and we analyze structural properties of these solutions we present an algorithm that computes nash equilibria and we prove bounds both on the price of stability and on the price of anarchy moreover we introduce the new concept of a price of mistrust finally we also study the relations to earliest arrival flows | [['in', 'this', 'paper', 'we', 'present', 'a', 'new', 'competitive', 'packet', 'routing', 'model', 'with', 'edge', 'priorities', 'we', 'consider', 'players', 'that', 'route', 'selfishly', 'through', 'a', 'network', 'over', 'time', 'and', 'try', 'to', 'reach', 'their', 'destinations', 'as', 'fast', 'as', 'possible', 'if', 'the', 'number', 'of', 'players', 'who', 'want', 'to', 'enter', 'an', 'edge', 'at', 'the', 'same', 'time', 'exceeds', 'the', 'inflow', 'capacity', 'of', 'this', 'edge', 'edge', 'priorities', 'with', 'respect', 'to', 'the', 'preceding', 'edge', 'solve', 'these', 'conflicts', 'our', 'edge', 'priorities', 'are', 'wellmotivated', 'by', 'applications', 'in', 'traffic', 'for', 'this', 'class', 'of', 'games', 'we', 'show', 'the', 'existence', 'of', 'equilibrium', 'solutions', 'for', 'singlesourcesinglesink', 'games', 'and', 'we', 'analyze', 'structural', 'properties', 'of', 'these', 'solutions', 'we', 'present', 'an', 'algorithm', 'that', 'computes', 'nash', 'equilibria', 'and', 'we', 'prove', 'bounds', 'both', 'on', 'the', 'price', 'of', 'stability', 'and', 'on', 'the', 'price', 'of', 'anarchy', 'moreover', 'we', 'introduce', 'the', 'new', 'concept', 'of', 'a', 'price', 'of', 'mistrust', 'finally', 'we', 'also', 'study', 'the', 'relations', 'to', 'earliest', 'arrival', 'flows']] | [-0.17094077032783794, 0.07470295843914856, -0.0953942561593269, 0.04723675720500372, -0.07208876474760473, -0.14182395919771, 0.1752146247995875, 0.41162025658155066, -0.29405798461650395, -0.29332309576057014, 0.11146609531553825, -0.2802154361076343, -0.16298951616530152, 0.08860544722443188, -0.11288874548659401, 0.05172109050262305, 0.06276807380749637, 0.04355528304909563, 0.044431215374869576, -0.27638124368645045, 0.337541872698542, 0.04052800826159202, 0.22822592803923827, 0.08401440487553676, 0.06879514071948102, -0.013561432081688609, -0.0039990006674391525, 0.047566630055371206, -0.19376154099609266, 0.09940784370539607, 0.25878750132202794, 0.18460598802549713, 0.3124096642649319, -0.47232971081717146, -0.1484246095836473, 0.14350100866674134, 0.09305002554255123, 0.08468355355338038, -0.025562780705513433, -0.24686650157673284, 0.12781126750794808, -0.19773192820785981, -0.10978312597500109, -0.054418820332405936, 0.004345986862770385, 0.06541756247720008, -0.26232598297711873, -0.019830069124105246, 0.012438023009356888, -0.0153513811269982, -0.08430154847600432, -0.09354459359019529, -0.013905957433356283, 0.17090578019593117, 0.06418389597577819, -0.055063243242734136, 0.07486005810278584, -0.18166675557828663, -0.2142376617153382, 0.38977746691347825, -0.06458065435233745, -0.1429623228484868, 0.18979483601773003, -0.0978157243581437, -0.14108306890880662, 0.07434640259695395, 0.2349089841526519, 0.12968182265608952, -0.10816833862595053, 0.018432493772706948, -0.0947929161743054, 0.12085317658865177, 0.08492505764135988, 0.06854652183958226, 0.18616281048485284, 0.16324558194699218, 0.21409790551762045, 0.1551887626450884, -0.04129660006340904, -0.12808396362339003, -0.2928232507838402, -0.17679923330433667, -0.1366001072908855, 0.01857764356827829, -0.09247506803714917, -0.126702866998029, 0.4349476822082781, 0.2063598895232038, 0.1757083628197304, 0.14214564573356053, 0.2963063153745477, 0.11462363079044735, -0.037932164394280536, 0.17506521955753365, 0.2015438250366262, 0.0256112416860156, 0.12786041531863804, -0.20542399285235055, 0.11589635735031657, 0.05920555269242161] |
1,803.00866 | Quasi-isometric embedding from the generalised Thompson's group $T_n$ to
$T$ | Brown has defined the generalised Thompson's group $F_n$, $T_n$, where $n$ is
an integer at least $2$ and Thompson's groups $F= F_2$ and $T =T_2$ in the
80's. Burillo, Cleary and Stein have found that there is a quasi-isometric
embedding from $F_n$ to $F_m$ where $n$ and $m$ are positive integers at least
2. We show that there is a quasi-isometric embedding from $T_n$ to $T_2$ for
any $n \geq 2$ and no embeddings from $T_2$ to $T_n$ for $n \geq 3$.
| math.GR | brown has defined the generalised thompsons group f_n t_n where n is an integer at least 2 and thompsons groups f f_2 and t t_2 in the 80s burillo cleary and stein have found that there is a quasiisometric embedding from f_n to f_m where n and m are positive integers at least 2 we show that there is a quasiisometric embedding from t_n to t_2 for any n geq 2 and no embeddings from t_2 to t_n for n geq 3 | [['brown', 'has', 'defined', 'the', 'generalised', 'thompsons', 'group', 'f_n', 't_n', 'where', 'n', 'is', 'an', 'integer', 'at', 'least', '2', 'and', 'thompsons', 'groups', 'f', 'f_2', 'and', 't', 't_2', 'in', 'the', '80s', 'burillo', 'cleary', 'and', 'stein', 'have', 'found', 'that', 'there', 'is', 'a', 'quasiisometric', 'embedding', 'from', 'f_n', 'to', 'f_m', 'where', 'n', 'and', 'm', 'are', 'positive', 'integers', 'at', 'least', '2', 'we', 'show', 'that', 'there', 'is', 'a', 'quasiisometric', 'embedding', 'from', 't_n', 'to', 't_2', 'for', 'any', 'n', 'geq', '2', 'and', 'no', 'embeddings', 'from', 't_2', 'to', 't_n', 'for', 'n', 'geq', '3']] | [-0.14263206120166513, 0.25861147067521806, -0.042630200538738276, 0.020750585470613047, -0.01926261572926133, -0.17752127055032754, 0.012568273834516237, 0.4318210333585739, -0.2865546091609163, -0.24267970294588143, 0.062363231512947856, -0.3957223533940168, -0.10753451264571157, 0.16157689318959143, -0.033825903510053955, -0.06751602291370984, -0.01710530419914443, 0.17418049426496396, -0.07251011533590815, -0.32708558196454873, 0.27452132240926597, -0.15248974472180837, 0.09078281824649484, 0.026133642669905116, 0.10724257751379485, -0.021661357683945955, 0.06574123879365715, -0.020368002428397262, -0.18904816141487876, 0.006548507761405666, 0.36272685625302936, 0.11228359743584822, 0.24788530910226667, -0.28543363523060156, -0.13812615857948263, 0.2335103732522255, 0.17280674591821468, -0.06601753152538965, -0.014290005394062142, -0.23518585668945755, 0.19898586084399325, -0.07150279633186321, -0.029913244418293974, -0.05324601809735651, 0.19791743352457328, -0.0585117730093591, -0.30885311279353905, 0.02866272224734227, 0.2040580790489912, 0.11329014733847645, 0.017215141747003122, -0.23413315778713167, -0.05562737707140637, 0.13066389548511784, 0.0024500472016954497, 0.19450733467309886, 0.0034338838512790793, -0.019709052707724, -0.09317181323781426, 0.3550307275842369, -0.1150829660947676, -0.13005537045314725, 0.15873170286462998, -0.22968489102398357, -0.22650544379872303, 0.13409689266556574, 0.04715580137929431, 0.16740428295308424, -0.016103335380278253, 0.23883216308047536, -0.09375289742501429, 0.19111658278622745, 0.15256719296384189, -0.08025738272246802, 0.07639043658316412, 0.06589816528678595, 0.1497587621309737, 0.06772944662306044, 0.03842817072722095, 0.1124614280142626, -0.3043617195346289, -0.14982336968827395, -0.23656114596689556, 0.2112624823362969, -0.15473116920987162, -0.07369366471287737, 0.2597923409538688, 0.05824866152747914, 0.22379114347751494, 0.15234261067055258, 0.14151865832599592, 0.03608082696496521, 0.06324876743702242, 0.18160835414963925, -0.00915677829956015, 0.1828701928096973, -0.07904071215954092, -0.15260151550346227, -0.04426784684053726, 0.14753595010641915] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.