id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0916 | Splitting Fermi Surfaces and Heavy Electronic States in
Non-Centrosymmetric U3Ni3Sn4 | We report the single-crystal growth of the non-centrosymmetric paramagnet
U3Ni3Sn4 by the Bridgman method and the Fermi surface properties detected by de
Haas-van Alphen (dHvA) experiments. We have also investigated single-crystal
U3Ni3Sn4 by single-crystal X-ray diffraction, magnetization, electrical
resistivity, and heat capacity measurements. The angular dependence of the dHvA
frequencies reveals many closed Fermi surfaces, which are nearly spherical in
topology. The experimental results are in good agreement with local density
approximation (LDA) band structure calculations based on the 5f-itinerant
model. The band structure calculation predicts many Fermi surfaces, mostly with
spherical shape, derived from 12 bands crossing the Fermi energy. To our
knowledge, the splitting of Fermi surfaces due to the non-centrosymmetric
crystal in 5f-electron systems is experimentally detected for the first time.
The temperature dependence of the dHvA amplitude reveals a large cyclotron
effective mass of up to 35m0, indicating the heavy electronic state of U3Ni3Sn4
due to the proximity of the quantum critical point. From the field dependence
of the dHvA amplitude, a mean free path of conduction electrons of up to 1950A
is detected, reflecting the good quality of the grown crystal. The small
splitting energy related to the antisymmetric spin-orbit interaction is most
likely due to the large cyclotron effective mass.
| cond-mat.str-el | we report the singlecrystal growth of the noncentrosymmetric paramagnet u3ni3sn4 by the bridgman method and the fermi surface properties detected by de haasvan alphen dhva experiments we have also investigated singlecrystal u3ni3sn4 by singlecrystal xray diffraction magnetization electrical resistivity and heat capacity measurements the angular dependence of the dhva frequencies reveals many closed fermi surfaces which are nearly spherical in topology the experimental results are in good agreement with local density approximation lda band structure calculations based on the 5fitinerant model the band structure calculation predicts many fermi surfaces mostly with spherical shape derived from 12 bands crossing the fermi energy to our knowledge the splitting of fermi surfaces due to the noncentrosymmetric crystal in 5felectron systems is experimentally detected for the first time the temperature dependence of the dhva amplitude reveals a large cyclotron effective mass of up to 35m0 indicating the heavy electronic state of u3ni3sn4 due to the proximity of the quantum critical point from the field dependence of the dhva amplitude a mean free path of conduction electrons of up to 1950a is detected reflecting the good quality of the grown crystal the small splitting energy related to the antisymmetric spinorbit interaction is most likely due to the large cyclotron effective mass | [['we', 'report', 'the', 'singlecrystal', 'growth', 'of', 'the', 'noncentrosymmetric', 'paramagnet', 'u3ni3sn4', 'by', 'the', 'bridgman', 'method', 'and', 'the', 'fermi', 'surface', 'properties', 'detected', 'by', 'de', 'haasvan', 'alphen', 'dhva', 'experiments', 'we', 'have', 'also', 'investigated', 'singlecrystal', 'u3ni3sn4', 'by', 'singlecrystal', 'xray', 'diffraction', 'magnetization', 'electrical', 'resistivity', 'and', 'heat', 'capacity', 'measurements', 'the', 'angular', 'dependence', 'of', 'the', 'dhva', 'frequencies', 'reveals', 'many', 'closed', 'fermi', 'surfaces', 'which', 'are', 'nearly', 'spherical', 'in', 'topology', 'the', 'experimental', 'results', 'are', 'in', 'good', 'agreement', 'with', 'local', 'density', 'approximation', 'lda', 'band', 'structure', 'calculations', 'based', 'on', 'the', '5fitinerant', 'model', 'the', 'band', 'structure', 'calculation', 'predicts', 'many', 'fermi', 'surfaces', 'mostly', 'with', 'spherical', 'shape', 'derived', 'from', '12', 'bands', 'crossing', 'the', 'fermi', 'energy', 'to', 'our', 'knowledge', 'the', 'splitting', 'of', 'fermi', 'surfaces', 'due', 'to', 'the', 'noncentrosymmetric', 'crystal', 'in', '5felectron', 'systems', 'is', 'experimentally', 'detected', 'for', 'the', 'first', 'time', 'the', 'temperature', 'dependence', 'of', 'the', 'dhva', 'amplitude', 'reveals', 'a', 'large', 'cyclotron', 'effective', 'mass', 'of', 'up', 'to', '35m0', 'indicating', 'the', 'heavy', 'electronic', 'state', 'of', 'u3ni3sn4', 'due', 'to', 'the', 'proximity', 'of', 'the', 'quantum', 'critical', 'point', 'from', 'the', 'field', 'dependence', 'of', 'the', 'dhva', 'amplitude', 'a', 'mean', 'free', 'path', 'of', 'conduction', 'electrons', 'of', 'up', 'to', '1950a', 'is', 'detected', 'reflecting', 'the', 'good', 'quality', 'of', 'the', 'grown', 'crystal', 'the', 'small', 'splitting', 'energy', 'related', 'to', 'the', 'antisymmetric', 'spinorbit', 'interaction', 'is', 'most', 'likely', 'due', 'to', 'the', 'large', 'cyclotron', 'effective', 'mass']] | [-0.17909137070353323, 0.18367100903922645, -0.06980599075087847, 0.03881247296844485, -0.069925368997484, -0.0884480618096411, 0.09814934770053647, 0.3482851909973608, -0.23291857364034657, -0.3325451823694659, -0.0197324079680463, -0.3439105472899056, -0.09774784297278619, 0.2508885242627576, 0.04173297421683286, 0.058506270710566986, 0.010235489279563938, -0.016855931292595387, -0.12158666545607774, -0.19552163949025236, 0.3228667000207701, 0.10958931438585863, 0.36083487454994484, 0.09933363058744228, 0.035771793884275656, -0.0025206326273054325, 0.07275431959206248, 0.01558460884043956, -0.15953600481377622, 0.0737820914487717, 0.25154248618645814, -0.13666747707364338, 0.14918358254893294, -0.4101585038935334, -0.21137648715816548, -0.008034259970919251, 0.0874636696314375, 0.12411146612064868, -0.07357605210370086, -0.2819385693587473, 0.011387622481661624, -0.1141562210625322, -0.14088941713292702, -0.09029396460477603, -0.047125141573909284, -0.010878106814022336, -0.15339603546715522, 0.13434609248640653, 0.025921516177207782, 0.0991395633363981, -0.1478066435668691, -0.1351891250597322, -0.07803377364945639, 0.03851946886271018, 0.08065652208038022, 0.055674172698157685, 0.16004360077462246, -0.07860786931846163, -0.0738664916716516, 0.37246411730503215, -0.08298755359372555, -0.05999677881639763, 0.14731251304794854, -0.2674551466319325, -0.0871312207808452, 0.21573645020536894, 0.1159254995919076, 0.06642426032196785, -0.11419571954080275, 0.11707186396749865, -0.001941029517452595, 0.19433273301013113, 0.08838097112404705, 0.03112461426827381, 0.2504715746582392, 0.16030354518500695, 0.007599804069264218, 0.09351608931921937, -0.20167206949554384, -0.03275842568951801, -0.21412353108297538, -0.1350863044255693, -0.23115062084177446, 0.07300830624419553, -0.05942209873000375, -0.20861818208565633, 0.40212649624712143, 0.07662536709436349, 0.1884678289583274, -0.03024071739961306, 0.24215259334173403, 0.10600288375854272, 0.09567061920416325, 0.07819069970371614, 0.275765189166947, 0.1804567034599449, 0.09959694912216713, -0.3413962965402202, 0.05818146186206361, -0.0003758380453336268] |
1,802.09161 | Pappus's Theorem in Grassmannian Gr(3,C^n) | In this paper we study intersections of quadrics, components of the
hypersurface in Grassmannian $Gr(3, \CC^n)$ introduced in \cite{SoSuSi}. This
lead to an alternative statement and proof of Pappus's Theorem retrieving
Pappus's and Hesse configurations of lines as special points in complex
projective Grassmannian. This new connection is obtained through a third purely
combinatorial object, the intersection lattice of Discriminantal arrangement.
| math.AG math.CO | in this paper we study intersections of quadrics components of the hypersurface in grassmannian gr3 ccn introduced in citesosusi this lead to an alternative statement and proof of pappuss theorem retrieving pappuss and hesse configurations of lines as special points in complex projective grassmannian this new connection is obtained through a third purely combinatorial object the intersection lattice of discriminantal arrangement | [['in', 'this', 'paper', 'we', 'study', 'intersections', 'of', 'quadrics', 'components', 'of', 'the', 'hypersurface', 'in', 'grassmannian', 'gr3', 'ccn', 'introduced', 'in', 'citesosusi', 'this', 'lead', 'to', 'an', 'alternative', 'statement', 'and', 'proof', 'of', 'pappuss', 'theorem', 'retrieving', 'pappuss', 'and', 'hesse', 'configurations', 'of', 'lines', 'as', 'special', 'points', 'in', 'complex', 'projective', 'grassmannian', 'this', 'new', 'connection', 'is', 'obtained', 'through', 'a', 'third', 'purely', 'combinatorial', 'object', 'the', 'intersection', 'lattice', 'of', 'discriminantal', 'arrangement']] | [-0.20941562093018243, -0.020195343552768464, -0.06699447465362027, 0.014991817481738204, -0.07418846571817994, -0.13372411945989976, 0.02897675561447007, 0.2986533929593861, -0.28109436444938185, -0.1838715335354209, 0.05811801792588085, -0.22719724472068872, -0.2130466564713667, 0.14739232389256357, -0.19336422476917506, -0.023941406378677737, 0.05647004295994217, -0.021048027036401133, -0.060208893739885146, -0.29818151211366056, 0.4196490732836537, -0.005176420416682958, 0.23420887952282404, 0.09330873546811441, 0.09772896122982881, 0.07937110957767193, -0.0250321658483396, -0.008026244848345717, -0.12757585354459783, 0.19304259923907618, 0.3207226387535532, 0.14720001149301729, 0.10911431053342918, -0.3882713181587557, -0.11314279064536095, 0.18964194022119046, 0.17666999287127208, 0.06895218500867487, -0.00259970265130202, -0.2529078798368573, 0.04280804851247619, -0.10671383021399379, -0.23846009854848185, -0.046651977525713546, 0.04650327283112953, -0.004269044570780049, -0.17460512216202914, -0.033337864985999964, 0.1313351655456548, 0.21536616067945336, -0.04546073303402712, -0.08233373885353407, -0.02693836665712297, 0.030663125069501498, -0.017853357382894803, 0.0679855398950167, 0.06327705036286109, -0.07772753171157092, -0.15012138100961844, 0.4011310341767967, 0.029096497579788168, -0.24246765716622273, 0.10055284372065217, -0.08194317171971004, -0.18304852374518912, 0.13542971553785416, 0.1419155202029894, 0.18453579738270492, -0.08407208280016978, 0.11046650724601932, -0.14488155726188173, 0.03620894480263814, 0.15578173965526124, -0.002834541517465065, 0.1609446360108753, 0.09320494931501647, 0.058120134576529384, 0.1896899549183824, -0.014120621172090371, -0.10765759288333357, -0.35614232312267025, -0.23585338691870372, -0.14516559096518905, 0.11028619169956073, -0.14287582159304293, -0.1996139617326359, 0.37797756859411796, 0.04297839414793998, 0.24638071678734075, 0.012690285911473136, 0.2758541921037249, 0.012191006741098439, 0.01603783858784785, -0.004818480764515698, 0.17890061712823807, 0.18974176179617644, 0.05040464394260198, -0.08728406038911392, -0.05077132802301397, 0.2162831144174561] |
1,802.09162 | From the seep to the surface: the ascent and dissolution of methane
bubbles in the ocean | Methane, as a strong greenhouse gas, has 21-25 times the warming potential
per unit mass than carbon dioxide, and the methane from the oceans can
contribute to ~4% of the annual atmosphere methane budget. Large methane bubble
plumes have been observed in seep sites globally on shallow continental
shelves, and emerging industry of methane hydrates mining causes growing
environmental concern on possible disastrous blowout which destabilizes the
methane hydrate and releases huge amount of methane gas. To better estimate how
much methane in gaseous phase leaked from the seeps can reach the atmosphere, a
simplified model is developed to simulate the ascent of a methane bubble from a
shallow ocean methane seep, and the methane transfer with the surrounding
water. The breakup and coalescence of bubbles are neglected, and the bubble is
assumed to remain spherical following a vertical path during the whole rising
process. We calculated the survival distance of bubbles with varying initial
sizes and depths and the remaining percentage of methane reaching the sea
surface, and applied the results to the seep sites in the Shenhu area in the
South China Sea. The study can provide insight into the relative significance
of different water bodies in contributing to the atmosphere greenhouse gas.
| physics.geo-ph | methane as a strong greenhouse gas has 2125 times the warming potential per unit mass than carbon dioxide and the methane from the oceans can contribute to 4 of the annual atmosphere methane budget large methane bubble plumes have been observed in seep sites globally on shallow continental shelves and emerging industry of methane hydrates mining causes growing environmental concern on possible disastrous blowout which destabilizes the methane hydrate and releases huge amount of methane gas to better estimate how much methane in gaseous phase leaked from the seeps can reach the atmosphere a simplified model is developed to simulate the ascent of a methane bubble from a shallow ocean methane seep and the methane transfer with the surrounding water the breakup and coalescence of bubbles are neglected and the bubble is assumed to remain spherical following a vertical path during the whole rising process we calculated the survival distance of bubbles with varying initial sizes and depths and the remaining percentage of methane reaching the sea surface and applied the results to the seep sites in the shenhu area in the south china sea the study can provide insight into the relative significance of different water bodies in contributing to the atmosphere greenhouse gas | [['methane', 'as', 'a', 'strong', 'greenhouse', 'gas', 'has', '2125', 'times', 'the', 'warming', 'potential', 'per', 'unit', 'mass', 'than', 'carbon', 'dioxide', 'and', 'the', 'methane', 'from', 'the', 'oceans', 'can', 'contribute', 'to', '4', 'of', 'the', 'annual', 'atmosphere', 'methane', 'budget', 'large', 'methane', 'bubble', 'plumes', 'have', 'been', 'observed', 'in', 'seep', 'sites', 'globally', 'on', 'shallow', 'continental', 'shelves', 'and', 'emerging', 'industry', 'of', 'methane', 'hydrates', 'mining', 'causes', 'growing', 'environmental', 'concern', 'on', 'possible', 'disastrous', 'blowout', 'which', 'destabilizes', 'the', 'methane', 'hydrate', 'and', 'releases', 'huge', 'amount', 'of', 'methane', 'gas', 'to', 'better', 'estimate', 'how', 'much', 'methane', 'in', 'gaseous', 'phase', 'leaked', 'from', 'the', 'seeps', 'can', 'reach', 'the', 'atmosphere', 'a', 'simplified', 'model', 'is', 'developed', 'to', 'simulate', 'the', 'ascent', 'of', 'a', 'methane', 'bubble', 'from', 'a', 'shallow', 'ocean', 'methane', 'seep', 'and', 'the', 'methane', 'transfer', 'with', 'the', 'surrounding', 'water', 'the', 'breakup', 'and', 'coalescence', 'of', 'bubbles', 'are', 'neglected', 'and', 'the', 'bubble', 'is', 'assumed', 'to', 'remain', 'spherical', 'following', 'a', 'vertical', 'path', 'during', 'the', 'whole', 'rising', 'process', 'we', 'calculated', 'the', 'survival', 'distance', 'of', 'bubbles', 'with', 'varying', 'initial', 'sizes', 'and', 'depths', 'and', 'the', 'remaining', 'percentage', 'of', 'methane', 'reaching', 'the', 'sea', 'surface', 'and', 'applied', 'the', 'results', 'to', 'the', 'seep', 'sites', 'in', 'the', 'shenhu', 'area', 'in', 'the', 'south', 'china', 'sea', 'the', 'study', 'can', 'provide', 'insight', 'into', 'the', 'relative', 'significance', 'of', 'different', 'water', 'bodies', 'in', 'contributing', 'to', 'the', 'atmosphere', 'greenhouse', 'gas']] | [-0.03524132960677996, 0.2067888973237417, -0.033522901843146734, 0.08006470084483583, 0.021593071524893828, -0.025550465542348286, 0.10395971812392293, 0.3381002772901625, -0.232561785953722, -0.3115030297251674, 0.14460824489280782, -0.31486287605309604, -0.06108469750381796, 0.15245744449031703, -0.06389444977685343, -0.011938920859178966, 0.07623973326739289, -0.05815408910911726, 0.021383803045347462, -0.2668599534457933, 0.2013895480948336, 0.10047510252608095, 0.23000810664619648, 0.14265298556454262, 0.05492554876985321, -0.12260421313226734, -0.0406215180957909, -0.05939973822073536, -0.15762103082584766, 0.09148020697652029, 0.21769211881602293, 0.08207805546151255, 0.21744488970394812, -0.5175801935770056, -0.2756166569432061, 0.1060520794890894, 0.10631048161189492, 0.07555578430080512, -0.035814724476236445, -0.20417940966310164, -0.034336934215959854, -0.1985905367718991, -0.16181871031385883, 0.03302678117167899, 0.04282498974969391, 0.009643716038565389, -0.219019597202229, 0.0973355234874522, 0.021258426438305156, 0.10726009665956429, -0.14181163819982126, -0.19670327853265346, -0.1649649984730572, 0.13150661033247232, 0.062783133696654, 0.01190599590864069, 0.2673396195933296, -0.12498864914660397, 0.05304997570598133, 0.4332004222315827, -0.13862747803945882, -0.056758363508076094, 0.2611899635133644, -0.19048080912690757, -0.06800890030795284, 0.2808232488585453, 0.21285367375993006, 0.03066905022270101, -0.14932667289851417, -0.03406527153171791, -0.06756899254761782, 0.17229873950332952, 0.1522216120753072, -0.043731695619713074, 0.32299279595837804, 0.22393394719042323, 0.08295231214073925, 0.12822025700919695, -0.20811457858722218, -0.10919921787931611, -0.16415236870114527, -0.18738801981432035, -0.09782074742913976, 0.014707031692880406, -0.04841311943570926, -0.15706742453346356, 0.3219677099710394, 0.09874974254874841, 0.12491119532005898, -0.04739584717226178, 0.2976941240822449, 0.030020865917036895, 0.09482279745633622, 0.08525800302296001, 0.24995843875313214, 0.08862090905598712, 0.17920338800268285, -0.22600516389174313, 0.13041211736409047, 0.025417690649263414] |
1,802.09163 | Relationship between Magnetic Anisotropy Below Pseudogap Temperature and
Short-Range Antiferromagnetic Order in High-Temperature Cuprate
Superconductor | The central issue in high-temperature cuprate superconductors is the
pseudogap state appearing below the pseudogap temperature $T^*$, which is well
above the superconducting transition temperature. In this study, we
theoretically investigate the rapid increase of the magnetic anisotropy below
the pseudogap temperature detected by the recent torque-magnetometry
measurements on YBa$_2$Cu$_3$O$_y$ [Y. Sato et al., Nat. Phys., 13, 1074
(2017)]. Applying the spin Green's function formalism including the
Dzyaloshinskii--Moriya interaction arising from the buckling of the CuO$_2$
plane, we obtain results that are in good agreement with the experiment and
find a scaling relationship. Our analysis suggests that the characteristic
temperature associated with the magnetic anisotropy, which coincides with
$T^*$, is not a phase transition temperature but a crossover temperature
associated with the short-range antiferromagnetic order.
| cond-mat.str-el | the central issue in hightemperature cuprate superconductors is the pseudogap state appearing below the pseudogap temperature t which is well above the superconducting transition temperature in this study we theoretically investigate the rapid increase of the magnetic anisotropy below the pseudogap temperature detected by the recent torquemagnetometry measurements on yba_2cu_3o_y y sato et al nat phys 13 1074 2017 applying the spin greens function formalism including the dzyaloshinskiimoriya interaction arising from the buckling of the cuo_2 plane we obtain results that are in good agreement with the experiment and find a scaling relationship our analysis suggests that the characteristic temperature associated with the magnetic anisotropy which coincides with t is not a phase transition temperature but a crossover temperature associated with the shortrange antiferromagnetic order | [['the', 'central', 'issue', 'in', 'hightemperature', 'cuprate', 'superconductors', 'is', 'the', 'pseudogap', 'state', 'appearing', 'below', 'the', 'pseudogap', 'temperature', 't', 'which', 'is', 'well', 'above', 'the', 'superconducting', 'transition', 'temperature', 'in', 'this', 'study', 'we', 'theoretically', 'investigate', 'the', 'rapid', 'increase', 'of', 'the', 'magnetic', 'anisotropy', 'below', 'the', 'pseudogap', 'temperature', 'detected', 'by', 'the', 'recent', 'torquemagnetometry', 'measurements', 'on', 'yba_2cu_3o_y', 'y', 'sato', 'et', 'al', 'nat', 'phys', '13', '1074', '2017', 'applying', 'the', 'spin', 'greens', 'function', 'formalism', 'including', 'the', 'dzyaloshinskiimoriya', 'interaction', 'arising', 'from', 'the', 'buckling', 'of', 'the', 'cuo_2', 'plane', 'we', 'obtain', 'results', 'that', 'are', 'in', 'good', 'agreement', 'with', 'the', 'experiment', 'and', 'find', 'a', 'scaling', 'relationship', 'our', 'analysis', 'suggests', 'that', 'the', 'characteristic', 'temperature', 'associated', 'with', 'the', 'magnetic', 'anisotropy', 'which', 'coincides', 'with', 't', 'is', 'not', 'a', 'phase', 'transition', 'temperature', 'but', 'a', 'crossover', 'temperature', 'associated', 'with', 'the', 'shortrange', 'antiferromagnetic', 'order']] | [-0.1774901312291472, 0.21689863594233869, -0.028873550352610407, 0.011014999068837853, -0.05622038996267703, -0.09339530767136885, 0.0789298811071222, 0.3400117111797895, -0.22625000504851941, -0.30910771455796016, -0.011179528093048102, -0.3579684544745232, -0.10678305814883882, 0.16062351311707207, 0.04469657083316105, -0.0008415099488751542, -0.08631431024461504, -0.0007629733712923142, -0.15311994764112657, -0.20719773959154414, 0.3013381964166559, 0.05921803640141603, 0.3323407758688254, 0.11163493931563871, 0.019170983375290468, 0.002188255293144574, 0.0903801535887103, 0.028931747693868894, -0.22495544419096755, -0.026749995492038228, 0.2818871959288146, -0.08520972180075102, 0.1501244255053485, -0.34589049178025416, -0.24200937477871776, 0.035675973015566985, 0.09997451961446073, 0.11492963456511197, -0.05540212582714195, -0.2743542966763339, 0.015107013288915398, -0.14204027152980767, -0.14900948124751826, -0.07215346805676218, 0.0013500196078131276, -0.007301011995878071, -0.2396795483054443, 0.19505509354489586, 0.09217553729127582, 0.10126971092165238, -0.08214882404671141, -0.11669094759159751, -0.056053881094069974, -0.007142896095531121, 0.04450134580932377, 0.1758878437253917, 0.1269741594911583, -0.0802926816057504, -0.08804243997926073, 0.28345600834056256, -0.044051181071535536, 0.017566844452953628, 0.17693712773747863, -0.21496341723550652, -0.0951860670522306, 0.14799897658878997, 0.06981952528228923, 0.0540289644287118, -0.1256814577847704, 0.13598240244590992, -0.050866606555158095, 0.18562485644173238, 0.05702771776310739, 0.02076753515006379, 0.22888817641163064, 0.2036759020054653, -0.0004454681184142828, 0.13369252763110243, -0.12256589586444709, -0.08143510358011906, -0.28337922501527973, -0.1329876083480544, -0.22668357831970487, 0.027302162756607306, -0.06757985293898533, -0.1576032892635633, 0.3718382917464741, 0.21277164354650002, 0.2748001277777216, -0.04314245541595043, 0.20895939453757525, 0.13301203743509588, 0.04009206595947035, 0.09781645916612638, 0.25969658979785537, 0.21664187482242742, 0.17750865532340662, -0.3287488595721492, 0.08098144542459669, 0.028301091271362478] |
1,802.09164 | Matrix product solutions to the reflection equation from three
dimensional integrability | We formulate a quantized reflection equation in which $q$-boson valued $L$
and $K$ matrices satisfy the reflection equation up to conjugation by a
solution to the Isaev-Kulish 3D reflection equation. By forming its
$n$-concatenation along the $q$-boson Fock space followed by suitable
reductions, we construct families of solutions to the reflection equation in a
matrix product form connected to the 3D integrability. They involve the quantum
$R$ matrices of the antisymmetric tensor representations of
$U_p(A^{(1)}_{n-1})$ and the spin representations of $U_p(B^{(1)}_{n})$,
$U_p(D^{(1)}_{n})$ and $U_p(D^{(2)}_{n+1})$.
| math-ph math.MP math.QA nlin.SI | we formulate a quantized reflection equation in which qboson valued l and k matrices satisfy the reflection equation up to conjugation by a solution to the isaevkulish 3d reflection equation by forming its nconcatenation along the qboson fock space followed by suitable reductions we construct families of solutions to the reflection equation in a matrix product form connected to the 3d integrability they involve the quantum r matrices of the antisymmetric tensor representations of u_pa1_n1 and the spin representations of u_pb1_n u_pd1_n and u_pd2_n1 | [['we', 'formulate', 'a', 'quantized', 'reflection', 'equation', 'in', 'which', 'qboson', 'valued', 'l', 'and', 'k', 'matrices', 'satisfy', 'the', 'reflection', 'equation', 'up', 'to', 'conjugation', 'by', 'a', 'solution', 'to', 'the', 'isaevkulish', '3d', 'reflection', 'equation', 'by', 'forming', 'its', 'nconcatenation', 'along', 'the', 'qboson', 'fock', 'space', 'followed', 'by', 'suitable', 'reductions', 'we', 'construct', 'families', 'of', 'solutions', 'to', 'the', 'reflection', 'equation', 'in', 'a', 'matrix', 'product', 'form', 'connected', 'to', 'the', '3d', 'integrability', 'they', 'involve', 'the', 'quantum', 'r', 'matrices', 'of', 'the', 'antisymmetric', 'tensor', 'representations', 'of', 'u_pa1_n1', 'and', 'the', 'spin', 'representations', 'of', 'u_pb1_n', 'u_pd1_n', 'and', 'u_pd2_n1']] | [-0.17205262313095424, 0.12201300557129659, -0.05354564158150401, -0.0033733920098688356, -0.10857950519913664, -0.1409466441672964, 0.0065444833151279734, 0.3398615360642091, -0.33133760421799546, -0.22603716153221634, 0.09869229972350578, -0.2661941508428218, -0.15477963653990093, 0.10572203033818649, 0.003305301320954011, 0.057376753502280615, 0.032810507506394804, 0.06167617599623135, -0.1697577089862301, -0.21619445465218562, 0.38326463368363106, -0.036429390020202845, 0.22886683172486627, -0.03289329368047989, 0.1741182256866103, 0.04979930344360092, -0.008954881905363156, -0.05653880424954248, -0.10409489176116693, 0.1475403092783661, 0.2591760020153836, 0.06189079976712282, 0.14969628700055182, -0.43314996255466187, -0.15942387939848673, 0.08408347856647407, 0.12403894178509617, 0.0745057320768515, 0.002071273238517535, -0.33596566731396776, 0.05565886654389592, -0.1940128720449045, -0.18176473358956477, -0.08646199624472035, 0.014463797522087892, -0.027325622223986264, -0.27860626224906015, 0.07084502932878259, 0.0829551612588171, -0.01778629994115386, -0.1185372802742327, -0.0603309796932034, -0.051683708834342465, 0.06209395185280114, -0.027353534743619654, -0.02866527160259489, 0.05426179957337295, -0.14715457878385982, -0.09277549536767392, 0.3890173486016022, -0.05353197726444938, -0.3001566955055564, 0.12496374924189578, -0.13995390759709364, -0.07464080189283077, 0.15600410349762592, 0.11946096061728895, 0.09473640292596358, -0.10517547130345917, 0.16677810606107904, -0.08818843536890852, 0.08365536237863871, 0.10275396289160618, -0.012021313946789656, 0.14676751993978635, 0.02225369934249335, 0.06502447710133707, 0.14013719614833975, 0.018039211744251542, -0.10155074462557259, -0.3150577310186166, -0.2119503923608229, -0.16557022127716875, 0.1410146809171121, -0.10170954347006791, -0.18298954082032046, 0.3961123588691967, 0.06894930218083736, 0.2176738165517469, 0.03953179557216712, 0.21802593192133385, 0.2107298044869915, 0.09050363209397079, 0.06591678618525083, 0.08911238041204902, 0.29018844958418644, 0.08010237281903243, -0.22797068568448034, -0.046090337266482845, 0.15970015469102714] |
1,802.09165 | Optimal contract for a fund manager, with capital injections and
endogenous trading constraints | In this paper, we construct a solution to the optimal contract problem for
delegated portfolio management of the fist-best (risk-sharing) type. The
novelty of our result is (i) in the robustness of the optimal contract with
respect to perturbations of the wealth process (interpreted as capital
injections), and (ii) in the more general form of principals objective
function, which is allowed to depend directly on the agents strategy, as
opposed to being a function of the generated wealth only. In particular, the
latter feature allows us to incorporate endogenous trading constraints in the
contract. We reduce the optimal contract problem to the following inverse
problem: for a given portfolio (defined in a feedback form, as a random field),
construct a stochastic utility whose optimal portfolio coincides with the given
one. We characterize the solution to this problem through a Stochastic Partial
Differential Equation (SPDE), prove its well-posedness, and compute the
solution explicitly in the Black-Scholes model.
| q-fin.PM | in this paper we construct a solution to the optimal contract problem for delegated portfolio management of the fistbest risksharing type the novelty of our result is i in the robustness of the optimal contract with respect to perturbations of the wealth process interpreted as capital injections and ii in the more general form of principals objective function which is allowed to depend directly on the agents strategy as opposed to being a function of the generated wealth only in particular the latter feature allows us to incorporate endogenous trading constraints in the contract we reduce the optimal contract problem to the following inverse problem for a given portfolio defined in a feedback form as a random field construct a stochastic utility whose optimal portfolio coincides with the given one we characterize the solution to this problem through a stochastic partial differential equation spde prove its wellposedness and compute the solution explicitly in the blackscholes model | [['in', 'this', 'paper', 'we', 'construct', 'a', 'solution', 'to', 'the', 'optimal', 'contract', 'problem', 'for', 'delegated', 'portfolio', 'management', 'of', 'the', 'fistbest', 'risksharing', 'type', 'the', 'novelty', 'of', 'our', 'result', 'is', 'i', 'in', 'the', 'robustness', 'of', 'the', 'optimal', 'contract', 'with', 'respect', 'to', 'perturbations', 'of', 'the', 'wealth', 'process', 'interpreted', 'as', 'capital', 'injections', 'and', 'ii', 'in', 'the', 'more', 'general', 'form', 'of', 'principals', 'objective', 'function', 'which', 'is', 'allowed', 'to', 'depend', 'directly', 'on', 'the', 'agents', 'strategy', 'as', 'opposed', 'to', 'being', 'a', 'function', 'of', 'the', 'generated', 'wealth', 'only', 'in', 'particular', 'the', 'latter', 'feature', 'allows', 'us', 'to', 'incorporate', 'endogenous', 'trading', 'constraints', 'in', 'the', 'contract', 'we', 'reduce', 'the', 'optimal', 'contract', 'problem', 'to', 'the', 'following', 'inverse', 'problem', 'for', 'a', 'given', 'portfolio', 'defined', 'in', 'a', 'feedback', 'form', 'as', 'a', 'random', 'field', 'construct', 'a', 'stochastic', 'utility', 'whose', 'optimal', 'portfolio', 'coincides', 'with', 'the', 'given', 'one', 'we', 'characterize', 'the', 'solution', 'to', 'this', 'problem', 'through', 'a', 'stochastic', 'partial', 'differential', 'equation', 'spde', 'prove', 'its', 'wellposedness', 'and', 'compute', 'the', 'solution', 'explicitly', 'in', 'the', 'blackscholes', 'model']] | [-0.08264965731237504, -0.022897904798869165, -0.0802060819561443, 0.08769717699771366, -0.12147945776401509, -0.12534045558422804, 0.10061917422609704, 0.32885304408208016, -0.36263348641655135, -0.25575695216933625, 0.15848383364913565, -0.26126094357300206, -0.1435545365296064, 0.14401913851109002, -0.12514294733203227, 0.06516745336196055, -0.001024948209223728, 0.027401579812830014, 0.004210299526851985, -0.24873123167743605, 0.34236642124296557, 0.04500402378954835, 0.2515945393577098, -0.009912742225212916, 0.16117759734737658, 0.012297256057330917, -0.027649447057891876, 0.02834552692685036, -0.12953970418837402, 0.14223458596069605, 0.2764928455527444, 0.16849414803718607, 0.3710955068709389, -0.42834314951492897, -0.1502403388588479, 0.14988712290031536, 0.06933564157938704, 0.10038400714420864, -0.010493722000448484, -0.22564471748567397, 0.057360150938433024, -0.20754824477518277, -0.15038408449280166, -0.027909392581111, -0.006293826264088914, 0.04096705921858243, -0.35896462486876596, 0.0326812524739052, 0.04633797163203839, -0.04331488279295304, -0.12285636560878746, -0.061384442120399924, -0.03442097794595024, 0.11469410319902724, 0.08711733169339207, 0.0010939092495508731, 0.11152179605297503, -0.13475868204578517, -0.12543624570450534, 0.3787112571539417, -0.08841623289120053, -0.25253462178272107, 0.09090231666040997, -0.10411476925496133, -0.11928256064232799, 0.11158616508267098, 0.2057868495929025, 0.1387729041488661, -0.18155700332304883, 0.09547530146120417, -0.06345977759769847, 0.1438790079258803, 0.04205407457005593, 0.003975093027111143, 0.1271275379094145, 0.17102611750033833, 0.18271749576388469, 0.1762624448860034, 0.02299170046594114, -0.16795394651651863, -0.3183324250302488, -0.15749058924773107, -0.15266376667085194, 0.057868609903380275, -0.10526438249019726, -0.18443248125484152, 0.3927875171355422, 0.167451661880759, 0.17131407484412192, 0.10232218514542066, 0.25424676642062205, 0.18530986525508905, 0.0072385108969624965, 0.07805735453843109, 0.19329160629140754, 0.06935476433455703, 0.1243281212755509, -0.23588888654485346, 0.13795098101780298, 0.059103551795405725] |
1,802.09166 | Short Block-length Codes for Ultra-Reliable Low-Latency Communications | This paper reviews the state of the art channel coding techniques for
ultra-reliable low latency communication (URLLC). The stringent requirements of
URLLC services, such as ultra-high reliability and low latency, have made it
the most challenging feature of the fifth generation (5G) mobile systems. The
problem is even more challenging for the services beyond the 5G promise, such
as tele-surgery and factory automation, which require latencies less than 1ms
and failure rate as low as $10^{-9}$. The very low latency requirements of
URLLC do not allow traditional approaches such as re-transmission to be used to
increase the reliability. On the other hand, to guarantee the delay
requirements, the block length needs to be small, so conventional channel
codes, originally designed and optimised for moderate-to-long block-lengths,
show notable deficiencies for short blocks. This paper provides an overview on
channel coding techniques for short block lengths and compares them in terms of
performance and complexity. Several important research directions are
identified and discussed in more detail with several possible solutions.
| cs.IT math.IT | this paper reviews the state of the art channel coding techniques for ultrareliable low latency communication urllc the stringent requirements of urllc services such as ultrahigh reliability and low latency have made it the most challenging feature of the fifth generation 5g mobile systems the problem is even more challenging for the services beyond the 5g promise such as telesurgery and factory automation which require latencies less than 1ms and failure rate as low as 109 the very low latency requirements of urllc do not allow traditional approaches such as retransmission to be used to increase the reliability on the other hand to guarantee the delay requirements the block length needs to be small so conventional channel codes originally designed and optimised for moderatetolong blocklengths show notable deficiencies for short blocks this paper provides an overview on channel coding techniques for short block lengths and compares them in terms of performance and complexity several important research directions are identified and discussed in more detail with several possible solutions | [['this', 'paper', 'reviews', 'the', 'state', 'of', 'the', 'art', 'channel', 'coding', 'techniques', 'for', 'ultrareliable', 'low', 'latency', 'communication', 'urllc', 'the', 'stringent', 'requirements', 'of', 'urllc', 'services', 'such', 'as', 'ultrahigh', 'reliability', 'and', 'low', 'latency', 'have', 'made', 'it', 'the', 'most', 'challenging', 'feature', 'of', 'the', 'fifth', 'generation', '5g', 'mobile', 'systems', 'the', 'problem', 'is', 'even', 'more', 'challenging', 'for', 'the', 'services', 'beyond', 'the', '5g', 'promise', 'such', 'as', 'telesurgery', 'and', 'factory', 'automation', 'which', 'require', 'latencies', 'less', 'than', '1ms', 'and', 'failure', 'rate', 'as', 'low', 'as', '109', 'the', 'very', 'low', 'latency', 'requirements', 'of', 'urllc', 'do', 'not', 'allow', 'traditional', 'approaches', 'such', 'as', 'retransmission', 'to', 'be', 'used', 'to', 'increase', 'the', 'reliability', 'on', 'the', 'other', 'hand', 'to', 'guarantee', 'the', 'delay', 'requirements', 'the', 'block', 'length', 'needs', 'to', 'be', 'small', 'so', 'conventional', 'channel', 'codes', 'originally', 'designed', 'and', 'optimised', 'for', 'moderatetolong', 'blocklengths', 'show', 'notable', 'deficiencies', 'for', 'short', 'blocks', 'this', 'paper', 'provides', 'an', 'overview', 'on', 'channel', 'coding', 'techniques', 'for', 'short', 'block', 'lengths', 'and', 'compares', 'them', 'in', 'terms', 'of', 'performance', 'and', 'complexity', 'several', 'important', 'research', 'directions', 'are', 'identified', 'and', 'discussed', 'in', 'more', 'detail', 'with', 'several', 'possible', 'solutions']] | [-0.20476096064900745, 0.0488071204003673, 0.03223393858594452, 0.08668845322772213, -0.07250487218850744, -0.22947536175791733, 0.06799760277795712, 0.38195036681826244, -0.24550065008190064, -0.32587087497918193, 0.18118843871648396, -0.23208357234803323, -0.1298829352979487, 0.2457976701905014, -0.13627655724130436, 0.14251527257478366, 0.07428417168278804, 0.02219893292434692, -0.06168348694946561, -0.3061294118890505, 0.2236615199718379, 0.1458914557326875, 0.3705201488835904, 0.10110596686177803, 0.030676836563374648, -0.012203974398354927, -0.018675211451746925, -0.061108858343060436, -0.08776160536269785, 0.11690959296939325, 0.35718832665797834, 0.199174409849335, 0.27996770975676305, -0.47133030573430357, -0.23955177715672793, 0.05927415984030255, 0.17997374090165302, 0.07452510855464588, -0.04404772334964946, -0.2295781516896639, 0.1425259766408694, -0.2622484385320348, -0.0739402556973147, -0.0393873669170847, -0.0007096341292479795, 0.061410362229955766, -0.2508216991206397, 0.0004858548814308144, -0.005076663887886676, 0.02551564272258899, 2.4720532875396536e-05, -0.13279782980959304, 0.06246772865363268, 0.16329513514459043, 0.07192576921393001, 0.036041328694649086, 0.09071870333714478, -0.17431797365613372, -0.11422446989147605, 0.430911819891123, -0.011001031517213584, -0.17131600914311088, 0.2385850826478396, -0.028269787002522164, -0.16444199854329586, 0.12647760364130797, 0.22595667557701646, 0.05394361435273986, -0.16955900538021218, 0.004520288351741982, 0.09549965118308981, 0.17264736655675722, 0.08813135447761344, 0.20880154748921265, 0.16319842674367932, 0.24071726549840616, 0.13774064172987832, 0.0838064911519456, -0.0893355254601467, -0.04159136853232411, -0.22979709900034492, -0.13999744113426638, -0.14589276280767188, 0.0037220511795474707, -0.08017490799672983, -0.0952703661151498, 0.3486500782808456, 0.18793772787837212, 0.12841180194459276, 0.10937238436312174, 0.3878670943354418, 0.06800435446300349, 0.12098429354275772, 0.11868196364469871, 0.20596000367376818, 0.049257924719602095, 0.16902333267680006, -0.1479674369880294, 0.10104008287074279, -0.0050231066961496686] |
1,802.09167 | Timeliness in Lossless Block Coding | We examine lossless data compression from an average delay perspective. An
encoder receives input symbols one per unit time from an i.i.d. source and
submits binary codewords to a FIFO buffer that transmits bits at a fixed rate
to a receiver/decoder. Each input symbol at the encoder is viewed as a status
update by the source and the system performance is characterized by the status
update age, defined as the number of time units (symbols) the decoder output
lags behind the encoder input. An upper bound on the average status age is
derived from the exponential bound on the probability of error in streaming
source coding with delay. Apart from the influence of the error exponent that
describes the convergence of the error, this upper bound also scales with the
constant multiplier term in the error probability. However, the error exponent
does not lead to an accurate description of the status age for small delay and
small blocklength. An age optimal block coding scheme is proposed based on an
approximation of the average age by converting the streaming source coding
system into a D/G/1 queue. We compare this scheme to the error exponent optimal
coding scheme which uses the method of types. We show that maximizing the error
exponent is not equivalent to minimizing the average status age.
| cs.IT math.IT | we examine lossless data compression from an average delay perspective an encoder receives input symbols one per unit time from an iid source and submits binary codewords to a fifo buffer that transmits bits at a fixed rate to a receiverdecoder each input symbol at the encoder is viewed as a status update by the source and the system performance is characterized by the status update age defined as the number of time units symbols the decoder output lags behind the encoder input an upper bound on the average status age is derived from the exponential bound on the probability of error in streaming source coding with delay apart from the influence of the error exponent that describes the convergence of the error this upper bound also scales with the constant multiplier term in the error probability however the error exponent does not lead to an accurate description of the status age for small delay and small blocklength an age optimal block coding scheme is proposed based on an approximation of the average age by converting the streaming source coding system into a dg1 queue we compare this scheme to the error exponent optimal coding scheme which uses the method of types we show that maximizing the error exponent is not equivalent to minimizing the average status age | [['we', 'examine', 'lossless', 'data', 'compression', 'from', 'an', 'average', 'delay', 'perspective', 'an', 'encoder', 'receives', 'input', 'symbols', 'one', 'per', 'unit', 'time', 'from', 'an', 'iid', 'source', 'and', 'submits', 'binary', 'codewords', 'to', 'a', 'fifo', 'buffer', 'that', 'transmits', 'bits', 'at', 'a', 'fixed', 'rate', 'to', 'a', 'receiverdecoder', 'each', 'input', 'symbol', 'at', 'the', 'encoder', 'is', 'viewed', 'as', 'a', 'status', 'update', 'by', 'the', 'source', 'and', 'the', 'system', 'performance', 'is', 'characterized', 'by', 'the', 'status', 'update', 'age', 'defined', 'as', 'the', 'number', 'of', 'time', 'units', 'symbols', 'the', 'decoder', 'output', 'lags', 'behind', 'the', 'encoder', 'input', 'an', 'upper', 'bound', 'on', 'the', 'average', 'status', 'age', 'is', 'derived', 'from', 'the', 'exponential', 'bound', 'on', 'the', 'probability', 'of', 'error', 'in', 'streaming', 'source', 'coding', 'with', 'delay', 'apart', 'from', 'the', 'influence', 'of', 'the', 'error', 'exponent', 'that', 'describes', 'the', 'convergence', 'of', 'the', 'error', 'this', 'upper', 'bound', 'also', 'scales', 'with', 'the', 'constant', 'multiplier', 'term', 'in', 'the', 'error', 'probability', 'however', 'the', 'error', 'exponent', 'does', 'not', 'lead', 'to', 'an', 'accurate', 'description', 'of', 'the', 'status', 'age', 'for', 'small', 'delay', 'and', 'small', 'blocklength', 'an', 'age', 'optimal', 'block', 'coding', 'scheme', 'is', 'proposed', 'based', 'on', 'an', 'approximation', 'of', 'the', 'average', 'age', 'by', 'converting', 'the', 'streaming', 'source', 'coding', 'system', 'into', 'a', 'dg1', 'queue', 'we', 'compare', 'this', 'scheme', 'to', 'the', 'error', 'exponent', 'optimal', 'coding', 'scheme', 'which', 'uses', 'the', 'method', 'of', 'types', 'we', 'show', 'that', 'maximizing', 'the', 'error', 'exponent', 'is', 'not', 'equivalent', 'to', 'minimizing', 'the', 'average', 'status', 'age']] | [-0.16782226142138756, 0.06846968148300404, -0.0678679451758411, 0.05415556718748758, -0.030131235035256512, -0.20544613210252627, 0.15722316516722093, 0.3695037324316285, -0.3077144855783591, -0.27439693500789974, 0.12531645583581127, -0.2647237084668628, -0.09952734932056649, 0.19036761866367427, -0.14708519803815037, 0.07137959802411668, 0.04991537730063608, 0.14158734269783518, -0.06551608180923361, -0.3009593689144688, 0.2638158583283974, 0.15620704307242336, 0.29470896996205787, -0.01615618664582479, 0.13735447052414507, -0.002148085295261326, -0.03817972354805483, -0.0806227638654428, -0.11599640148658437, 0.06876276679495821, 0.21669193900357675, 0.1842251107169633, 0.2784390557398547, -0.3548088408148234, -0.19094334623437323, 0.047622735000511604, 0.1565152956870243, 0.09812735145308575, -0.03724859521589092, -0.25428067608511135, 0.10634054493133305, -0.18564854867001007, -0.019696374610495594, 0.10218328471222575, 0.011132086305299662, 0.04250854703174981, -0.32868700701322767, 0.08368497138533394, 0.03459244854919921, 0.02356047660497571, -0.09088712007511184, -0.1417739650369772, 0.05028731899640699, 0.20199840213923204, 0.047297763564164666, 0.0909370371131956, 0.11467904741725614, -0.08733462751306559, -0.10666084021741894, 0.30303826146171114, -0.08674898794058213, -0.20833359512689303, 0.07542317523513728, -0.06939188804915218, -0.06461361862616055, 0.15510717963731166, 0.22690579637644753, 0.05211256365914087, -0.1366509993727993, 0.037067814486815856, -0.016193049645463375, 0.3129892829475143, 0.07324063173422272, 0.10628296687559563, 0.12588735339060117, 0.15661642258591985, 0.10447598820389141, 0.15267987314972184, -0.11216018299133869, -0.09761625377210244, -0.32608730587164103, -0.12160078534546087, -0.22338295274323994, 0.04088536231289832, -0.15125603442090244, -0.13438516809961282, 0.3462818593956743, 0.12828231311064162, 0.19082764911269937, 0.1659799794895008, 0.34567347087378053, 0.14125156256988267, 0.044993344030218534, 0.1885456593750055, 0.15294138417892536, 0.10044249553074588, 0.049399025549399685, -0.2300245893007565, 0.14987485049601457, 0.12390607426346448] |
1,802.09168 | Resilient Distributed $H_\infty$ Estimation via Dynamic Rejection of
Biasing Attacks | We consider the distributed $H_\infty$ estimation problem with additional
requirement of resilience to biasing attacks. An attack scenario is considered
where an adversary misappropriates some of the observer nodes and injects
biasing signals into observer dynamics. Using a dynamic modelling of biasing
attack inputs, a novel distributed state estimation algorithm is proposed which
involves feedback from a network of attack detection filters. We show that each
observer in the network can be computed in real time and in a decentralized
fashion. When these controlled observers are interconnected to form a network,
they are shown to cooperatively produce an unbiased estimate the plant, despite
some of the nodes are compromised.
| cs.SY | we consider the distributed h_infty estimation problem with additional requirement of resilience to biasing attacks an attack scenario is considered where an adversary misappropriates some of the observer nodes and injects biasing signals into observer dynamics using a dynamic modelling of biasing attack inputs a novel distributed state estimation algorithm is proposed which involves feedback from a network of attack detection filters we show that each observer in the network can be computed in real time and in a decentralized fashion when these controlled observers are interconnected to form a network they are shown to cooperatively produce an unbiased estimate the plant despite some of the nodes are compromised | [['we', 'consider', 'the', 'distributed', 'h_infty', 'estimation', 'problem', 'with', 'additional', 'requirement', 'of', 'resilience', 'to', 'biasing', 'attacks', 'an', 'attack', 'scenario', 'is', 'considered', 'where', 'an', 'adversary', 'misappropriates', 'some', 'of', 'the', 'observer', 'nodes', 'and', 'injects', 'biasing', 'signals', 'into', 'observer', 'dynamics', 'using', 'a', 'dynamic', 'modelling', 'of', 'biasing', 'attack', 'inputs', 'a', 'novel', 'distributed', 'state', 'estimation', 'algorithm', 'is', 'proposed', 'which', 'involves', 'feedback', 'from', 'a', 'network', 'of', 'attack', 'detection', 'filters', 'we', 'show', 'that', 'each', 'observer', 'in', 'the', 'network', 'can', 'be', 'computed', 'in', 'real', 'time', 'and', 'in', 'a', 'decentralized', 'fashion', 'when', 'these', 'controlled', 'observers', 'are', 'interconnected', 'to', 'form', 'a', 'network', 'they', 'are', 'shown', 'to', 'cooperatively', 'produce', 'an', 'unbiased', 'estimate', 'the', 'plant', 'despite', 'some', 'of', 'the', 'nodes', 'are', 'compromised']] | [-0.20912559004392717, 0.03937034165695271, -0.07877225562481692, -0.004158184676607898, -0.06803850761907934, -0.2344749955960584, 0.037695969075516415, 0.41136183446117985, -0.30124310819276917, -0.30309891264402755, 0.12171953464793558, -0.24874098681310122, -0.17395288257426322, 0.15284309335294421, -0.14310924976598471, 0.05438608756823534, 0.024669944867060555, 0.0572419126272305, 0.024566892182014674, -0.23972814118153313, 0.286534904357891, 0.083027923147677, 0.2667483665451679, -0.0680730522920688, 0.14141792366798553, -0.007683543458201543, -0.017089639524110006, 0.05390970053418574, -0.016275684740860556, 0.07629812168522256, 0.2967962045287196, 0.19501811325877766, 0.33783943378539, -0.43610214769702266, -0.2248436873175066, 0.15036685778586953, 0.15723303175117406, 0.16377034971891488, -0.05938173597678542, -0.36094323645725296, 0.09692819927672476, -0.19787878446988072, -0.04420706649586834, -0.039710559183731675, -0.054099476710824226, 0.02781436616022701, -0.33682106988056115, 0.00589835739918743, 0.017056748117923876, 0.01274422957147989, -0.0660955097711714, -0.02907418325991818, -0.0017369758656800346, 0.16307896808467814, -0.013311069059892799, -0.02163209628175806, 0.21823056046937214, -0.11653396584033207, -0.12612359933727593, 0.3183238326606375, 0.01991154066409864, -0.23042369270438534, 0.12453859896373211, -0.031084288292159153, -0.12269491842232162, 0.11020453987401668, 0.26319274164874246, 0.09595175669959712, -0.17104493238366558, -0.003028111507538361, -0.020908750007273973, 0.20322651517172172, 0.005745861663146772, 0.015759027886411384, 0.17198040774437012, 0.1711471797963087, 0.16403463731209436, 0.1568880540402865, -0.08893915626686066, -0.08923601722603457, -0.27465843266529394, -0.10478704450468757, -0.19103606053007147, 0.02080589130464769, -0.10162661689483449, -0.1380745275169762, 0.3809782274270051, 0.19647035839605248, 0.22231479377390956, 0.06618978067503863, 0.3672766536819162, 0.09713805219399985, 0.05031244225662063, 0.15843946514306245, 0.2405659395827334, 0.04995892953162116, 0.039008385182737755, -0.18491738148710551, 0.16044135429223794, -0.012428722383144] |
1,802.09169 | An algebraic method to calculate parameter regions for constrained
steady-state distribution in stochastic reaction networks | Steady state is an essential concept in reaction networks. Its stability
reflects fundamental characteristics of several biological phenomena such as
cellular signal transduction and gene expression. Because biochemical reactions
occur at the cellular level, they are affected by unavoidable fluctuations.
Although several methods have been proposed to detect and analyze the stability
of steady states for deterministic models, these methods cannot be applied to
stochastic reaction networks. In this paper, we propose an algorithm based on
algebraic computations to calculate parameter regions for constrained
steady-state distribution of stochastic reaction networks, in which the means
and variances satisfy some given inequality constraints. To evaluate our
proposed method, we perform computer simulations for three typical chemical
reactions and demonstrate that the results obtained with our method are
consistent with the simulation results.
| q-bio.MN physics.bio-ph | steady state is an essential concept in reaction networks its stability reflects fundamental characteristics of several biological phenomena such as cellular signal transduction and gene expression because biochemical reactions occur at the cellular level they are affected by unavoidable fluctuations although several methods have been proposed to detect and analyze the stability of steady states for deterministic models these methods cannot be applied to stochastic reaction networks in this paper we propose an algorithm based on algebraic computations to calculate parameter regions for constrained steadystate distribution of stochastic reaction networks in which the means and variances satisfy some given inequality constraints to evaluate our proposed method we perform computer simulations for three typical chemical reactions and demonstrate that the results obtained with our method are consistent with the simulation results | [['steady', 'state', 'is', 'an', 'essential', 'concept', 'in', 'reaction', 'networks', 'its', 'stability', 'reflects', 'fundamental', 'characteristics', 'of', 'several', 'biological', 'phenomena', 'such', 'as', 'cellular', 'signal', 'transduction', 'and', 'gene', 'expression', 'because', 'biochemical', 'reactions', 'occur', 'at', 'the', 'cellular', 'level', 'they', 'are', 'affected', 'by', 'unavoidable', 'fluctuations', 'although', 'several', 'methods', 'have', 'been', 'proposed', 'to', 'detect', 'and', 'analyze', 'the', 'stability', 'of', 'steady', 'states', 'for', 'deterministic', 'models', 'these', 'methods', 'can', 'not', 'be', 'applied', 'to', 'stochastic', 'reaction', 'networks', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'based', 'on', 'algebraic', 'computations', 'to', 'calculate', 'parameter', 'regions', 'for', 'constrained', 'steadystate', 'distribution', 'of', 'stochastic', 'reaction', 'networks', 'in', 'which', 'the', 'means', 'and', 'variances', 'satisfy', 'some', 'given', 'inequality', 'constraints', 'to', 'evaluate', 'our', 'proposed', 'method', 'we', 'perform', 'computer', 'simulations', 'for', 'three', 'typical', 'chemical', 'reactions', 'and', 'demonstrate', 'that', 'the', 'results', 'obtained', 'with', 'our', 'method', 'are', 'consistent', 'with', 'the', 'simulation', 'results']] | [-0.08476855850179559, 0.06639159751815174, -0.06905822136918374, 0.07400544439904562, -0.00213515144268065, -0.13762675136512587, 0.02838481032158042, 0.3690742843336504, -0.27625165640852833, -0.2946707510766182, 0.07749100831490124, -0.23526233074944894, -0.22296285881653768, 0.2425387933395291, -0.04646699595840947, 0.0953981643964764, 0.09164163972898066, 0.017602805697842578, -0.004883467661437244, -0.21795706312662658, 0.2977101979492844, 0.06476858834814252, 0.3029921216808458, 0.06683908698134806, 0.1030897709420164, -0.08704173864213792, -0.030949342688403398, 0.02471301660389561, -0.14417107353007594, 0.11093594871580473, 0.29123216362453785, 0.16680342462518116, 0.24454713737919131, -0.4882635857682419, -0.27498628326624147, 0.15350321007764522, 0.16602385448574494, 0.1517086785867853, -0.04703297294438141, -0.2671470303223504, 0.10244431134441313, -0.15417945248124595, -0.08439266545794023, -0.15325738437107644, -0.02205829486563688, 0.07797973759770963, -0.27212134712261954, 0.07372282999958701, 0.02687106718209693, 0.05858264363704974, -0.08057323434898445, -0.12143683094684149, -0.01961793219635107, 0.14660985540076096, 0.016838914787568746, -0.043790529100828667, 0.18215944685880806, -0.09927780851885055, -0.1629987212639117, 0.35859109339027007, -0.027988683802025918, -0.2521276397431511, 0.20863128819801482, -0.08336356194878267, -0.19147925017373138, 0.13739115489604137, 0.196915878388206, 0.11062342005973781, -0.19140293901316993, 0.015888349752062717, 0.02682313615569973, 0.13858973934450222, 0.03487702682863153, 0.02400055875688905, 0.12352199359789832, 0.20641024565174892, 0.03489671898330384, 0.0987258780816968, -0.08274934229348566, -0.15136403627053813, -0.2433098560298672, -0.09599704199776281, -0.15951753219852635, 0.03059024895012169, -0.061952176943282734, -0.13655966295654537, 0.36650163513956635, 0.18079558941571197, 0.17565709241418295, 0.06917469689839356, 0.2937945080139027, 0.1276026666599845, 0.035174331826847476, 0.06024436869317282, 0.2334423957666727, 0.1608614664158663, 0.10755358895869883, -0.23364374299981552, 0.1412253753577167, 0.02444725474946997] |
1,802.0917 | Characterizing the Quantum Confined Stark Effect in Semiconductor
Quantum Dots and Nanorods for Single-Molecule Electrophysiology | We optimized the performance of quantum confined Stark effect QCSE based
voltage nanosensors. A high throughput approach for single particle QCSE
characterization was developed and utilized to screen a library of such
nanosensors. Type II ZnSe CdS seeded nanorods were found to have the best
performance among the different nanosensors evaluated in this work. The degree
of correlation between intensity changes and spectral changes of the excitons
emission under applied field was characterized. An upper limit for the temporal
response of individual ZnSe CdS nanorods to voltage modulation was
characterized by high throughput, high temporal resolution intensity
measurements using a novel photon counting camera. The measured 3.5 us response
time is limited by the voltage modulation electronics and represents about 30
times higher bandwidth than needed for recording an action potential in a
neuron.
| cond-mat.mes-hall physics.chem-ph physics.optics | we optimized the performance of quantum confined stark effect qcse based voltage nanosensors a high throughput approach for single particle qcse characterization was developed and utilized to screen a library of such nanosensors type ii znse cds seeded nanorods were found to have the best performance among the different nanosensors evaluated in this work the degree of correlation between intensity changes and spectral changes of the excitons emission under applied field was characterized an upper limit for the temporal response of individual znse cds nanorods to voltage modulation was characterized by high throughput high temporal resolution intensity measurements using a novel photon counting camera the measured 35 us response time is limited by the voltage modulation electronics and represents about 30 times higher bandwidth than needed for recording an action potential in a neuron | [['we', 'optimized', 'the', 'performance', 'of', 'quantum', 'confined', 'stark', 'effect', 'qcse', 'based', 'voltage', 'nanosensors', 'a', 'high', 'throughput', 'approach', 'for', 'single', 'particle', 'qcse', 'characterization', 'was', 'developed', 'and', 'utilized', 'to', 'screen', 'a', 'library', 'of', 'such', 'nanosensors', 'type', 'ii', 'znse', 'cds', 'seeded', 'nanorods', 'were', 'found', 'to', 'have', 'the', 'best', 'performance', 'among', 'the', 'different', 'nanosensors', 'evaluated', 'in', 'this', 'work', 'the', 'degree', 'of', 'correlation', 'between', 'intensity', 'changes', 'and', 'spectral', 'changes', 'of', 'the', 'excitons', 'emission', 'under', 'applied', 'field', 'was', 'characterized', 'an', 'upper', 'limit', 'for', 'the', 'temporal', 'response', 'of', 'individual', 'znse', 'cds', 'nanorods', 'to', 'voltage', 'modulation', 'was', 'characterized', 'by', 'high', 'throughput', 'high', 'temporal', 'resolution', 'intensity', 'measurements', 'using', 'a', 'novel', 'photon', 'counting', 'camera', 'the', 'measured', '35', 'us', 'response', 'time', 'is', 'limited', 'by', 'the', 'voltage', 'modulation', 'electronics', 'and', 'represents', 'about', '30', 'times', 'higher', 'bandwidth', 'than', 'needed', 'for', 'recording', 'an', 'action', 'potential', 'in', 'a', 'neuron']] | [-0.11078443705215495, 0.11462716681994811, -0.023792429830628768, 0.02281490200087984, -0.01387359393559007, -0.1793359713420383, 0.06149962458780397, 0.4776561737352454, -0.20160518054600193, -0.3793405976785875, 0.03225669012676035, -0.25477139333457643, -0.09264510395978369, 0.22447176164784122, -0.08502556261286806, 0.06929525718398725, -0.010348011729126768, -0.0064339551574258665, -0.026166046695060917, -0.2047482247763216, 0.1742476350610464, 0.13320903116819768, 0.3732665409820516, 0.06498950151787418, 0.10896496086575981, 0.02215722914951951, 0.0024329505534147595, 0.028482984827914788, -0.10200024346487402, 0.10695116879835936, 0.24678142983709642, 0.028626156908307058, 0.24203245067593657, -0.4306107912796424, -0.20766417121292272, 0.04539357408283473, 0.10314495648855149, 0.0655982939825296, -0.07920488411623205, -0.2671935177380358, 0.07331045936452531, -0.13720159191186904, -0.08114827516377528, -0.007086167014690477, 0.008186570164545982, 0.05649280805251936, -0.2668995478419837, 0.040349763352423906, -0.014322031682892354, 0.10821721001607261, -0.05908749609101397, -0.0766432568736708, 0.01750479764374557, 0.12899610671669126, -0.04356094001646418, 0.022723424557679846, 0.20925348037645333, -0.1086440374662078, -0.14360721661221, 0.3096194734810782, -0.111811607042801, -0.11150052787131394, 0.1166932418014604, -0.15994818753965978, -0.04205085924451253, 0.21458621400255543, 0.16024244291344727, 0.11281433573979606, -0.17730913641115428, 0.013082581473629116, 0.08703660704334502, 0.2602059887270374, 0.17226420973302492, 0.0922686995020998, 0.20298122132280425, 0.21878412082954657, 0.018342218968197148, 0.17611368489712337, -0.181579687083557, -0.02010520591414464, -0.18340122678452658, -0.13836117427724018, -0.18981529001507963, 0.05341838312912176, -0.07310320441265775, -0.13687387038606094, 0.4375861802263491, 0.12154894502166269, 0.12965431241944098, 0.010556441161837151, 0.29377547801131687, 0.1479586865796374, 0.11806255787499804, 0.0034925564135330966, 0.23163204249550604, 0.14010496468651595, 0.1566506151905728, -0.253568291434768, 0.07713281539088088, -0.03503669487701645] |
1,802.09171 | Cryogenic Scintillation Properties of n-Type GaAs for the Direct
Detection of MeV/c2 Dark Matter | This paper is the first report of n-type GaAs as a cryogenic scintillation
radiation detector for the detection of electron recoils from interacting dark
matter (DM) particles in the poorly explored MeV/c2 mass range. Seven GaAs
samples from two commercial suppliers and with different silicon and boron
concentrations were studied for their low temperature optical and scintillation
properties. All samples are n-type even at low temperatures and exhibit
emission between silicon donors and boron acceptors that peaks at 1.33 eV (930
nm). The lowest excitation band peaks at 1.44 eV (860 nm) and the overlap
between the emission and excitation bands is small. The X-ray excited
luminosities range from 7 to 43 photons/keV. Thermally stimulated luminescence
measurements show that n-type GaAs does not accumulate metastable radiative
states that could cause afterglow. Further development and use with cryogenic
photodetectors promises a remarkable combination of large target size,
ultra-low backgrounds, and a sensitivity to electron recoils of a few eV that
would be produced by DM particles as light as a few MeV/c2.
| physics.ins-det hep-ex | this paper is the first report of ntype gaas as a cryogenic scintillation radiation detector for the detection of electron recoils from interacting dark matter dm particles in the poorly explored mevc2 mass range seven gaas samples from two commercial suppliers and with different silicon and boron concentrations were studied for their low temperature optical and scintillation properties all samples are ntype even at low temperatures and exhibit emission between silicon donors and boron acceptors that peaks at 133 ev 930 nm the lowest excitation band peaks at 144 ev 860 nm and the overlap between the emission and excitation bands is small the xray excited luminosities range from 7 to 43 photonskev thermally stimulated luminescence measurements show that ntype gaas does not accumulate metastable radiative states that could cause afterglow further development and use with cryogenic photodetectors promises a remarkable combination of large target size ultralow backgrounds and a sensitivity to electron recoils of a few ev that would be produced by dm particles as light as a few mevc2 | [['this', 'paper', 'is', 'the', 'first', 'report', 'of', 'ntype', 'gaas', 'as', 'a', 'cryogenic', 'scintillation', 'radiation', 'detector', 'for', 'the', 'detection', 'of', 'electron', 'recoils', 'from', 'interacting', 'dark', 'matter', 'dm', 'particles', 'in', 'the', 'poorly', 'explored', 'mevc2', 'mass', 'range', 'seven', 'gaas', 'samples', 'from', 'two', 'commercial', 'suppliers', 'and', 'with', 'different', 'silicon', 'and', 'boron', 'concentrations', 'were', 'studied', 'for', 'their', 'low', 'temperature', 'optical', 'and', 'scintillation', 'properties', 'all', 'samples', 'are', 'ntype', 'even', 'at', 'low', 'temperatures', 'and', 'exhibit', 'emission', 'between', 'silicon', 'donors', 'and', 'boron', 'acceptors', 'that', 'peaks', 'at', '133', 'ev', '930', 'nm', 'the', 'lowest', 'excitation', 'band', 'peaks', 'at', '144', 'ev', '860', 'nm', 'and', 'the', 'overlap', 'between', 'the', 'emission', 'and', 'excitation', 'bands', 'is', 'small', 'the', 'xray', 'excited', 'luminosities', 'range', 'from', '7', 'to', '43', 'photonskev', 'thermally', 'stimulated', 'luminescence', 'measurements', 'show', 'that', 'ntype', 'gaas', 'does', 'not', 'accumulate', 'metastable', 'radiative', 'states', 'that', 'could', 'cause', 'afterglow', 'further', 'development', 'and', 'use', 'with', 'cryogenic', 'photodetectors', 'promises', 'a', 'remarkable', 'combination', 'of', 'large', 'target', 'size', 'ultralow', 'backgrounds', 'and', 'a', 'sensitivity', 'to', 'electron', 'recoils', 'of', 'a', 'few', 'ev', 'that', 'would', 'be', 'produced', 'by', 'dm', 'particles', 'as', 'light', 'as', 'a', 'few', 'mevc2']] | [-0.033964975742822, 0.263503946895624, 0.0040648704209522895, 0.03829457565981415, 0.03483085861233504, -0.18409037832660893, 0.07189990915371683, 0.4666782339261463, -0.17736476400529433, -0.4224919239331407, -0.0015377394306304597, -0.396507515860667, 0.02755533703003754, 0.18720501559045796, 0.031660439447930074, 0.005989548325407924, 0.045894072485722776, -0.1106271379765488, -0.0704613123810714, -0.1573228919088884, 0.17651616682145985, 0.0972275731653487, 0.2820284097204911, 0.12208529699005578, 0.09013039140678855, -0.05708378950700338, 0.10024450825832305, -0.09526333367528274, -0.10156537585824385, 0.02789787090981205, 0.31315504980671127, -0.046647151158741344, 0.18540067055905293, -0.4110688431493459, -0.18285714886668655, 0.07501529895956492, 0.15070719627679832, 0.06734339981094788, -0.1274657947670298, -0.2726522262353853, 0.07947385378661212, -0.15486974856810787, -0.08781482943480737, 0.03410008845902565, 0.0044531948232685616, -0.0015722222749432494, -0.20150762260210706, 0.10160091465981731, -0.04426190461003499, 0.030023882416082403, -0.11295001120007003, -0.18024274050013014, -0.0667748796271585, -0.004589641423166146, 0.009209847309196379, -0.016712158951058723, 0.2988713385090668, -0.09524139962758194, -0.09282355147212396, 0.3722312225584398, -0.09531120249997466, 0.009177118518024857, 0.20927496369906337, -0.21263572930124158, -0.05977811939382588, 0.2810661190744947, 0.1270313799035414, 0.12135676645308907, -0.17115535498841813, 0.016481406041775008, 0.03288494192652012, 0.2529910924947924, 0.1301387551632759, 0.14725395675737693, 0.28365713779471424, 0.1941555456009187, 0.017931025478667553, 0.057674964518852706, -0.22282409411446566, 0.07826589452707323, -0.21737518656606736, -0.13923386181977015, -0.1663804316044954, 0.11684002246708018, -0.05434518032603453, -0.1123256029544823, 0.3687767512382863, 0.0912644593085963, 0.15778583246936792, -0.012833289434447101, 0.28090728829173667, 0.06703930554791887, 0.06538911881361004, 0.0074852444912301514, 0.3251410708735474, 0.17697630700796887, 0.1125194235372613, -0.22264587948621625, 0.0164219681173563, -0.10580881455608872] |
1,802.09172 | Millionaire: A Hint-guided Approach for Crowdsourcing | Modern machine learning is migrating to the era of complex models, which
requires a plethora of well-annotated data. While crowdsourcing is a promising
tool to achieve this goal, existing crowdsourcing approaches barely acquire a
sufficient amount of high-quality labels. In this paper, motivated by the
"Guess-with-Hints" answer strategy from the Millionaire game show, we introduce
the hint-guided approach into crowdsourcing to deal with this challenge. Our
approach encourages workers to get help from hints when they are unsure of
questions. Specifically, we propose a hybrid-stage setting, consisting of the
main stage and the hint stage. When workers face any uncertain question on the
main stage, they are allowed to enter the hint stage and look up hints before
making any answer. A unique payment mechanism that meets two important design
principles for crowdsourcing is developed. Besides, the proposed mechanism
further encourages high-quality workers less using hints, which helps identify
and assigns larger possible payment to them. Experiments are performed on
Amazon Mechanical Turk, which show that our approach ensures a sufficient
number of high-quality labels with low expenditure and detects high-quality
workers.
| cs.HC cs.GT | modern machine learning is migrating to the era of complex models which requires a plethora of wellannotated data while crowdsourcing is a promising tool to achieve this goal existing crowdsourcing approaches barely acquire a sufficient amount of highquality labels in this paper motivated by the guesswithhints answer strategy from the millionaire game show we introduce the hintguided approach into crowdsourcing to deal with this challenge our approach encourages workers to get help from hints when they are unsure of questions specifically we propose a hybridstage setting consisting of the main stage and the hint stage when workers face any uncertain question on the main stage they are allowed to enter the hint stage and look up hints before making any answer a unique payment mechanism that meets two important design principles for crowdsourcing is developed besides the proposed mechanism further encourages highquality workers less using hints which helps identify and assigns larger possible payment to them experiments are performed on amazon mechanical turk which show that our approach ensures a sufficient number of highquality labels with low expenditure and detects highquality workers | [['modern', 'machine', 'learning', 'is', 'migrating', 'to', 'the', 'era', 'of', 'complex', 'models', 'which', 'requires', 'a', 'plethora', 'of', 'wellannotated', 'data', 'while', 'crowdsourcing', 'is', 'a', 'promising', 'tool', 'to', 'achieve', 'this', 'goal', 'existing', 'crowdsourcing', 'approaches', 'barely', 'acquire', 'a', 'sufficient', 'amount', 'of', 'highquality', 'labels', 'in', 'this', 'paper', 'motivated', 'by', 'the', 'guesswithhints', 'answer', 'strategy', 'from', 'the', 'millionaire', 'game', 'show', 'we', 'introduce', 'the', 'hintguided', 'approach', 'into', 'crowdsourcing', 'to', 'deal', 'with', 'this', 'challenge', 'our', 'approach', 'encourages', 'workers', 'to', 'get', 'help', 'from', 'hints', 'when', 'they', 'are', 'unsure', 'of', 'questions', 'specifically', 'we', 'propose', 'a', 'hybridstage', 'setting', 'consisting', 'of', 'the', 'main', 'stage', 'and', 'the', 'hint', 'stage', 'when', 'workers', 'face', 'any', 'uncertain', 'question', 'on', 'the', 'main', 'stage', 'they', 'are', 'allowed', 'to', 'enter', 'the', 'hint', 'stage', 'and', 'look', 'up', 'hints', 'before', 'making', 'any', 'answer', 'a', 'unique', 'payment', 'mechanism', 'that', 'meets', 'two', 'important', 'design', 'principles', 'for', 'crowdsourcing', 'is', 'developed', 'besides', 'the', 'proposed', 'mechanism', 'further', 'encourages', 'highquality', 'workers', 'less', 'using', 'hints', 'which', 'helps', 'identify', 'and', 'assigns', 'larger', 'possible', 'payment', 'to', 'them', 'experiments', 'are', 'performed', 'on', 'amazon', 'mechanical', 'turk', 'which', 'show', 'that', 'our', 'approach', 'ensures', 'a', 'sufficient', 'number', 'of', 'highquality', 'labels', 'with', 'low', 'expenditure', 'and', 'detects', 'highquality', 'workers']] | [-0.06614341328763429, 0.05108115068694067, -0.09243031188991316, 0.04438484374364817, -0.18178465724246337, -0.21086215413586554, 0.1174091727963217, 0.3874996625428093, -0.2611985558633531, -0.3836866528414939, 0.08084657032455073, -0.2961362504618836, -0.15707609424752564, 0.178621190740576, -0.12294393107190978, 0.05338775380592606, 0.14057489976582155, 0.035435155298113405, 0.04429963743671848, -0.3047271500063238, 0.32080873031059914, 0.049804859594363905, 0.31096644499911485, 0.036011550999532696, 0.12003642249271643, -0.051180044689551306, -0.05393037349557993, -0.021874866156979315, -0.10373717205192147, 0.16462304309601036, 0.30864446973337484, 0.2113519515477995, 0.4031214985538628, -0.434826094251355, -0.1402630239953391, 0.10083307741293111, 0.11947558779209623, 0.131380154013077, -0.09497204085086165, -0.26658707010096677, 0.11941492388820973, -0.16291204583440913, -0.0680701082615265, -0.1386549423942043, -0.04233752811514882, -0.06367185420789834, -0.3123750242888511, 0.004117692935192052, 0.039427229712519524, 0.02327272362549212, -0.068990890933695, -0.09891791821473055, 0.03994994977223765, 0.18651736989342893, 0.05537267228987095, 0.03162277721690649, 0.10954322965422843, -0.15622540982570188, -0.1329009519719555, 0.4001095947398487, 0.02372866642125492, -0.13111358586869165, 0.20726893356787926, -0.07128036884570171, -0.1656183367829208, 0.09153856278277475, 0.18643508570830666, 0.1017530314341726, -0.1654673612466168, -0.004658829303576699, -0.0376389322505858, 0.20132776856092038, 0.02100710653538644, -0.006726315806947607, 0.2315964802238549, 0.20508558793818088, 0.057189826655862384, 0.13711624588185203, -0.0107393840319079, -0.07045690009829604, -0.2381714143576985, -0.13154809048409735, -0.14043069076230072, 0.04617794915544671, -0.04092811282389854, -0.09658942224364207, 0.3686276417194382, 0.2300168965219952, 0.2177478387488791, 0.06048239164728172, 0.3291099362866173, 0.01946940752300408, 0.09598087687331497, 0.08818373641300967, 0.1830864608490725, -0.019360244462745233, 0.14001352249061969, -0.15880145948489494, 0.10615927974339678, -0.0007172284450111442] |
1,802.09173 | Reply to: "Section IV. G. Mitri's cross sections" in the paper titled
"Multiple scattering and scattering cross sections" [J. Acoust. Soc. Am. 143,
995 (2018)] | The aim of this note is to rebut some unsupported claims which cast
suspicions on the results of the papers titled: "Extrinsic extinction
cross-section in the multiple acoustic scattering by fluid particles," [J.
Appl. Phys. 121, 144904 (2017)]; and "Intrinsic acoustical cross sections in
the multiple scattering by a pair of rigid cylindrical particles in 2D," [J.
Phys. D: Appl. Phys. 50, 325601 (2017)]. It is important to emphasize that the
results presented in these works are entirely physical and valid, in complete
agreement with the basic physical law of energy conservation. Moreover,
scientific convincing results in peer-reviewed publications should be supported
by illustrative examples using rigorous methods as well as computational
analyses and solid conclusive evidence, instead of raising mere suspicions with
baseless speculations.
| physics.class-ph | the aim of this note is to rebut some unsupported claims which cast suspicions on the results of the papers titled extrinsic extinction crosssection in the multiple acoustic scattering by fluid particles j appl phys 121 144904 2017 and intrinsic acoustical cross sections in the multiple scattering by a pair of rigid cylindrical particles in 2d j phys d appl phys 50 325601 2017 it is important to emphasize that the results presented in these works are entirely physical and valid in complete agreement with the basic physical law of energy conservation moreover scientific convincing results in peerreviewed publications should be supported by illustrative examples using rigorous methods as well as computational analyses and solid conclusive evidence instead of raising mere suspicions with baseless speculations | [['the', 'aim', 'of', 'this', 'note', 'is', 'to', 'rebut', 'some', 'unsupported', 'claims', 'which', 'cast', 'suspicions', 'on', 'the', 'results', 'of', 'the', 'papers', 'titled', 'extrinsic', 'extinction', 'crosssection', 'in', 'the', 'multiple', 'acoustic', 'scattering', 'by', 'fluid', 'particles', 'j', 'appl', 'phys', '121', '144904', '2017', 'and', 'intrinsic', 'acoustical', 'cross', 'sections', 'in', 'the', 'multiple', 'scattering', 'by', 'a', 'pair', 'of', 'rigid', 'cylindrical', 'particles', 'in', '2d', 'j', 'phys', 'd', 'appl', 'phys', '50', '325601', '2017', 'it', 'is', 'important', 'to', 'emphasize', 'that', 'the', 'results', 'presented', 'in', 'these', 'works', 'are', 'entirely', 'physical', 'and', 'valid', 'in', 'complete', 'agreement', 'with', 'the', 'basic', 'physical', 'law', 'of', 'energy', 'conservation', 'moreover', 'scientific', 'convincing', 'results', 'in', 'peerreviewed', 'publications', 'should', 'be', 'supported', 'by', 'illustrative', 'examples', 'using', 'rigorous', 'methods', 'as', 'well', 'as', 'computational', 'analyses', 'and', 'solid', 'conclusive', 'evidence', 'instead', 'of', 'raising', 'mere', 'suspicions', 'with', 'baseless', 'speculations']] | [-0.0617398417240569, 0.08050052335909832, -0.03625768884198695, 0.00042819010370176257, -0.08162750706561213, -0.07889175640297978, 0.05334503256632545, 0.3446584950935671, -0.14315973546325675, -0.36268306258550986, 0.04978871074830735, -0.30600263020856594, -0.15653094626788988, 0.19707253270941535, -0.11849803370764343, 0.07161143215418589, 0.06869557527900953, -0.04463088828918895, 7.829402679410892e-05, -0.27947359143309597, 0.25122697822507317, 0.09747381766546305, 0.2674339555598591, 0.10752261284269332, 0.03180809070146075, 0.048832133906416414, -0.13557559088803828, 0.009780260140825881, -0.18932711564571592, 0.10025831834390396, 0.27859721759644646, 0.05573900392074592, 0.23985760453406993, -0.4346542387473874, -0.2080427308044419, 0.02112509909737098, 0.09877444007926113, 0.1050273627324344, -0.031065060595254892, -0.3100893925496839, 0.04230881406077585, -0.16219312060866656, -0.15049951271782439, -0.07609131369679197, 0.12725766722824636, 0.022091607328474035, -0.21459951734064314, 0.1471180291420485, 0.1214140440891989, 0.10466713109242964, -0.05071564664500122, -0.15894791447534795, -0.032002208351225754, 0.03129445599880433, 0.0702004111409793, 0.025258101920438248, 0.1114809389104991, -0.07008929450511629, -0.17048820336084297, 0.37103510893336156, -0.03166855047021546, -0.18374272453886403, 0.23698852009828983, -0.10777690071552022, -0.12345597634614422, 0.12505411876865277, 0.1491016308981471, 0.08615654762447443, -0.17136341163025395, 0.09806889114471729, -0.10411241856532369, 0.13592847024007298, 0.1306955409160535, -0.010195024577085387, 0.20256744864457324, 0.12965965294847037, -0.07472195462664454, 0.039339377525890985, -0.036885257558594266, -0.10504312026579447, -0.3596341827197182, -0.1756247565513704, -0.18800227474175182, 0.10138513101832713, 0.0077325226326153155, -0.09758476750183154, 0.30329894400921054, 0.14695401913751432, 0.18746004152921883, -0.034440798517430156, 0.25662922570709046, 0.06975443685442452, -0.002411268577661093, 0.10534158187002186, 0.30271876010238347, 0.15469371206959998, 0.14097635840573083, -0.13300574740122367, 0.023086955895783697, 0.02116823946390816] |
1,802.09174 | Bergman-Toeplitz operators on fat Hartogs triangles | In this paper, we obtain some $L^{p}$ mapping properties of the
Bergman-Toeplitz operator \[ f\longrightarrow
T_{K^{-\alpha}}\left(f\right):=\intop_{\Omega}K_{\Omega}\left(\cdot,w\right)K^{-\alpha}\left(w,w\right)f\left(w\right)dV(w)
\] on fat Hartogs triangles $\Omega_{k}:=\left\{
\left(z_{1},z_{2}\right)\in\mathbb{C}^{2}:\left|z_{1}\right|^{k}<\left|z_{2}\right|<1\right\}
$, where $\alpha\in\mathbb{R}$ and $k\in \mathbb Z^+$.
| math.CV math.AP | in this paper we obtain some lp mapping properties of the bergmantoeplitz operator flongrightarrow t_kalphaleftfrightintop_omegak_omegaleftcdotwrightkalphaleftwwrightfleftwrightdvw on fat hartogs triangles omega_kleft leftz_1z_2rightinmathbbc2leftz_1rightkleftz_2right1right where alphainmathbbr and kin mathbb z | [['in', 'this', 'paper', 'we', 'obtain', 'some', 'lp', 'mapping', 'properties', 'of', 'the', 'bergmantoeplitz', 'operator', 'flongrightarrow', 't_kalphaleftfrightintop_omegak_omegaleftcdotwrightkalphaleftwwrightfleftwrightdvw', 'on', 'fat', 'hartogs', 'triangles', 'omega_kleft', 'leftz_1z_2rightinmathbbc2leftz_1rightkleftz_2right1right', 'where', 'alphainmathbbr', 'and', 'kin', 'mathbb', 'z']] | [-0.13511576976937553, 0.006575333381382127, -0.02755640391842462, 0.055337219203162626, -0.0755169105832465, -0.1309122061356902, 0.022024179153959267, 0.3861068240366876, -0.33360759386171895, -0.07935566175729036, 0.15424369624330816, -0.3420172611561914, -0.15468802848287547, 0.12649613975857696, -0.11717235661732654, 0.02925694516549508, -0.018073191536435235, 0.011049418710172176, -0.07487460229701053, -0.21038321871310472, 0.3625375287762533, -0.12090547196567059, 0.11050593373753752, 0.09904687232725944, 0.051974289235658944, 0.03689530849078437, 0.021800366424334545, -0.06146001233719289, -0.30030234158039093, 0.1024545778054744, 0.21600026249264678, 0.10537269195386519, 0.2299317984531323, -0.3388543364902337, -0.10251603456466303, 0.2616996360011399, 0.2097597036821147, -0.14355968109642467, -0.0531867449026322, -0.3121873488028844, 0.08891232474707067, -0.05338326081012686, -0.131383539410308, -0.028054884208055835, 0.049680612224619836, 0.05863731960319759, -0.3247930814589684, 0.07639420752335961, 0.19919470557942986, 0.09753170962600659, -0.06269891699776053, -0.16320282748589912, -0.012930927953372398, 0.03483771092336004, -0.023054957583857078, 0.14983643271261826, -0.011908456974197179, -0.06982981164280015, -0.07434132516694565, 0.3515479960478842, -0.008398878140724264, -0.26019912026822567, 0.07897931381982441, -0.23988528014160693, -0.23107630899176002, -0.015964261605404317, 0.1682143552073588, 0.1988218274588386, -0.09481224155751988, 0.28188241043972084, -0.12942105679151913, 0.061884306371212006, 0.14035084870799133, 0.064365013424928, 0.007739296959092219, 0.06364598575358589, 0.1466881784144789, 0.13376783604811257, -0.015080517788495248, 0.026007526476557057, -0.35590551463731873, -0.18419734799923995, -0.11695604911074042, 0.14827852327531824, -0.18855313543402494, -0.14547026925720274, 0.37532343026153586, 0.06286244094371796, 0.24688781956986836, 0.15518132383779934, 0.1583980539580807, 0.06352244724985212, -0.004061161268812914, 0.06062059587081118, 0.06815616032326943, 0.10606869768040876, 0.03652065645049637, -0.11490022701521714, -0.039931256925531976, 0.24547516131618372] |
1,802.09175 | Interior and boundary higher integrability of very weak solutions for
quasilinear parabolic equations with variable exponents | We prove boundary higher integrability for the (spatial) gradient of
\emph{very weak} solutions of quasilinear parabolic equations of the form $$
\left\{
\begin{array}{ll} u_t - div \mathcal{A}(x,t,\nabla u) = 0 &\quad \text{on} \
\Omega \times (-T,T), \\ u = 0 &\quad \text{on} \ \partial \Omega \times
(-T,T),
\end{array} \right. $$ where the non-linear structure $\mathcal{A}(x,
t,\nabla u)$ is modelled after the variable exponent $p(x,t)$-Laplace operator
given by $|\nabla u|^{p(x,t)-2} \nabla u$. To this end, we prove that the
gradients satisfy a reverse H\"older inequality near the boundary by
constructing a suitable test function which is Lipschitz continuous and
preserves the boundary values. In the interior case, such a result was proved
in \cite{bogelein2014very} provided $p(x,t) \geq \mathfrak{p}^- \geq 2$ holds
and was then extended to the singular case $\frac{2n}{n+2}< \mathfrak{p}^-\leq
p(x,t)\leq \mathfrak{p}^+ \leq 2$ in \cite{li2017very}. This restriction was
necessary because the intrinsic scalings for quasilinear parabolic problems are
different in the case $\mathfrak{p}^+ \leq 2$ and $\mathfrak{p}^-\geq 2$.
In this paper, we develop a new unified intrinsic scaling, using which, we
are able to extend the results of \cite{bogelein2014very,li2017very} to the
full range $\frac{2n}{n+2} < \mathfrak{p}^- \leq p(x,t)\leq
\mathfrak{p}^+<\infty$ and also obtain analogous results upto the boundary.
\emph{The main novelty of this paper is that our methods are able to handle
both the singular case and degenerate case simultaneously.} To simplify the
exposition, we will only prove the higher integrability result near the
boundary, provided the domain $\Omega$ satisfies a uniform measure density
condition. Our techniques are also applicable to higher order equations as well
as systems.
| math.AP | we prove boundary higher integrability for the spatial gradient of emphvery weak solutions of quasilinear parabolic equations of the form left beginarrayll u_t div mathcalaxtnabla u 0 quad texton omega times tt u 0 quad texton partial omega times tt endarray right where the nonlinear structure mathcalax tnabla u is modelled after the variable exponent pxtlaplace operator given by nabla upxt2 nabla u to this end we prove that the gradients satisfy a reverse holder inequality near the boundary by constructing a suitable test function which is lipschitz continuous and preserves the boundary values in the interior case such a result was proved in citebogelein2014very provided pxt geq mathfrakp geq 2 holds and was then extended to the singular case frac2nn2 mathfrakpleq pxtleq mathfrakp leq 2 in citeli2017very this restriction was necessary because the intrinsic scalings for quasilinear parabolic problems are different in the case mathfrakp leq 2 and mathfrakpgeq 2 in this paper we develop a new unified intrinsic scaling using which we are able to extend the results of citebogelein2014veryli2017very to the full range frac2nn2 mathfrakp leq pxtleq mathfrakpinfty and also obtain analogous results upto the boundary emphthe main novelty of this paper is that our methods are able to handle both the singular case and degenerate case simultaneously to simplify the exposition we will only prove the higher integrability result near the boundary provided the domain omega satisfies a uniform measure density condition our techniques are also applicable to higher order equations as well as systems | [['we', 'prove', 'boundary', 'higher', 'integrability', 'for', 'the', 'spatial', 'gradient', 'of', 'emphvery', 'weak', 'solutions', 'of', 'quasilinear', 'parabolic', 'equations', 'of', 'the', 'form', 'left', 'beginarrayll', 'u_t', 'div', 'mathcalaxtnabla', 'u', '0', 'quad', 'texton', 'omega', 'times', 'tt', 'u', '0', 'quad', 'texton', 'partial', 'omega', 'times', 'tt', 'endarray', 'right', 'where', 'the', 'nonlinear', 'structure', 'mathcalax', 'tnabla', 'u', 'is', 'modelled', 'after', 'the', 'variable', 'exponent', 'pxtlaplace', 'operator', 'given', 'by', 'nabla', 'upxt2', 'nabla', 'u', 'to', 'this', 'end', 'we', 'prove', 'that', 'the', 'gradients', 'satisfy', 'a', 'reverse', 'holder', 'inequality', 'near', 'the', 'boundary', 'by', 'constructing', 'a', 'suitable', 'test', 'function', 'which', 'is', 'lipschitz', 'continuous', 'and', 'preserves', 'the', 'boundary', 'values', 'in', 'the', 'interior', 'case', 'such', 'a', 'result', 'was', 'proved', 'in', 'citebogelein2014very', 'provided', 'pxt', 'geq', 'mathfrakp', 'geq', '2', 'holds', 'and', 'was', 'then', 'extended', 'to', 'the', 'singular', 'case', 'frac2nn2', 'mathfrakpleq', 'pxtleq', 'mathfrakp', 'leq', '2', 'in', 'citeli2017very', 'this', 'restriction', 'was', 'necessary', 'because', 'the', 'intrinsic', 'scalings', 'for', 'quasilinear', 'parabolic', 'problems', 'are', 'different', 'in', 'the', 'case', 'mathfrakp', 'leq', '2', 'and', 'mathfrakpgeq', '2', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'unified', 'intrinsic', 'scaling', 'using', 'which', 'we', 'are', 'able', 'to', 'extend', 'the', 'results', 'of', 'citebogelein2014veryli2017very', 'to', 'the', 'full', 'range', 'frac2nn2', 'mathfrakp', 'leq', 'pxtleq', 'mathfrakpinfty', 'and', 'also', 'obtain', 'analogous', 'results', 'upto', 'the', 'boundary', 'emphthe', 'main', 'novelty', 'of', 'this', 'paper', 'is', 'that', 'our', 'methods', 'are', 'able', 'to', 'handle', 'both', 'the', 'singular', 'case', 'and', 'degenerate', 'case', 'simultaneously', 'to', 'simplify', 'the', 'exposition', 'we', 'will', 'only', 'prove', 'the', 'higher', 'integrability', 'result', 'near', 'the', 'boundary', 'provided', 'the', 'domain', 'omega', 'satisfies', 'a', 'uniform', 'measure', 'density', 'condition', 'our', 'techniques', 'are', 'also', 'applicable', 'to', 'higher', 'order', 'equations', 'as', 'well', 'as', 'systems']] | [-0.13893793621530928, 0.05921460654216764, -0.02026052476971277, 0.05265076386697293, -0.09992169821170206, -0.1787846114881681, -0.04439564564210527, 0.32587661816711155, -0.32335596052272353, -0.18887188981439793, 0.13507035505095058, -0.31153317776062533, -0.10311907600511663, 0.1722459797634931, -0.07849943794372703, 0.058550676349327924, 0.004884232909755171, 0.04645320338572712, -0.10691667909238942, -0.21531417522630303, 0.34309018601295577, -0.10333209860083811, 0.20175035612876802, 0.0715176397347588, 0.11525277088654517, -0.02476708741835123, 0.05141407286380457, -0.02008576742119054, -0.24134845783017594, 0.05593995634146512, 0.2392686874270165, 0.04666947902467869, 0.2952538076250133, -0.38522124990621315, -0.16577723586810517, 0.14450517138554284, 0.16371433917108236, -0.003727848574073062, 0.019576230272748546, -0.29844538159492356, 0.17152137193093156, -0.09084667175217774, -0.2049382113203007, -0.04734913642839098, 0.05213200477902785, 0.04352780449851768, -0.3690591751783206, 0.1267019231104734, 0.1292977389266143, 0.009508722478390805, -0.09751526200987336, -0.14368715438724713, -0.03547887301107697, 0.06522112122067728, 0.0047189879119631, 0.10848023173176222, 0.0226913925870263, -0.09041476347914137, 0.0012056491046189134, 0.3584629978961116, -0.07994233545193746, -0.2499868829789407, 0.12300846218170614, -0.21859168196136147, -0.1579639056869665, 0.06093601899675461, 0.11306905281434555, 0.17764652646029322, -0.1005986561918506, 0.20347253734929713, -0.05515605171050626, 0.1521943314548801, 0.11068252659551486, -0.027749685988384357, 0.029659506941151593, 0.0967577433393595, 0.14586591197592558, 0.10860534539512758, -0.0312572375395797, -0.010298903853468159, -0.3850401365550376, -0.15445825872510405, -0.1050101984771626, 0.11974982555938284, -0.09816345529457869, -0.11317904451089136, 0.3157429163556491, 0.1330423975958168, 0.18079574253926634, 0.09463181148357533, 0.21421989711087605, 0.17851085742904232, -0.00477434743045117, 0.10658874938547212, 0.1396401736238666, 0.15104763734862678, 0.1386896319346925, -0.18037639057289168, 0.0033557268051321015, 0.11847945419237989] |
1,802.09176 | Boundary higher integrability for very weak solutions of quasilinear
parabolic equations | We prove boundary higher integrability for the (spatial) gradient of
\emph{very weak} solutions of quasilinear parabolic equations of the form $$u_t
- \text{div}\,\mathcal{A}(x,t, \nabla u)=0 \quad \text{on} \ \Omega \times
\mathbb{R},$$ where the non-linear structure $\text{div}\,\mathcal{A}(x,
t,\nabla u)$ is modelled after the $p$-Laplace operator. To this end, we prove
that the gradients satisfy a reverse H\"older inequality near the boundary. In
order to do this, we construct a suitable test function which is Lipschitz
continuous and preserves the boundary values. \emph{These results are new even
for linear parabolic equations on domains with smooth boundary and make no
assumptions on the smoothness of $\mathcal{A}(x,t,\nabla u)$}. These results
are also applicable for systems as well as higher order parabolic equations.
| math.AP | we prove boundary higher integrability for the spatial gradient of emphvery weak solutions of quasilinear parabolic equations of the form u_t textdivmathcalaxt nabla u0 quad texton omega times mathbbr where the nonlinear structure textdivmathcalax tnabla u is modelled after the plaplace operator to this end we prove that the gradients satisfy a reverse holder inequality near the boundary in order to do this we construct a suitable test function which is lipschitz continuous and preserves the boundary values emphthese results are new even for linear parabolic equations on domains with smooth boundary and make no assumptions on the smoothness of mathcalaxtnabla u these results are also applicable for systems as well as higher order parabolic equations | [['we', 'prove', 'boundary', 'higher', 'integrability', 'for', 'the', 'spatial', 'gradient', 'of', 'emphvery', 'weak', 'solutions', 'of', 'quasilinear', 'parabolic', 'equations', 'of', 'the', 'form', 'u_t', 'textdivmathcalaxt', 'nabla', 'u0', 'quad', 'texton', 'omega', 'times', 'mathbbr', 'where', 'the', 'nonlinear', 'structure', 'textdivmathcalax', 'tnabla', 'u', 'is', 'modelled', 'after', 'the', 'plaplace', 'operator', 'to', 'this', 'end', 'we', 'prove', 'that', 'the', 'gradients', 'satisfy', 'a', 'reverse', 'holder', 'inequality', 'near', 'the', 'boundary', 'in', 'order', 'to', 'do', 'this', 'we', 'construct', 'a', 'suitable', 'test', 'function', 'which', 'is', 'lipschitz', 'continuous', 'and', 'preserves', 'the', 'boundary', 'values', 'emphthese', 'results', 'are', 'new', 'even', 'for', 'linear', 'parabolic', 'equations', 'on', 'domains', 'with', 'smooth', 'boundary', 'and', 'make', 'no', 'assumptions', 'on', 'the', 'smoothness', 'of', 'mathcalaxtnabla', 'u', 'these', 'results', 'are', 'also', 'applicable', 'for', 'systems', 'as', 'well', 'as', 'higher', 'order', 'parabolic', 'equations']] | [-0.1484314520324094, 0.034245414618171946, -0.023131537980573103, 0.059517643185728025, -0.13778867493012706, -0.17527456767857075, -0.07520834361491478, 0.3516515801141484, -0.3308778476398603, -0.16175004806105805, 0.1702713559791693, -0.311901869136939, -0.10158148245263712, 0.18150858309086973, -0.06875088451990644, 0.11041017101041713, 0.03433235740264367, 0.03854224975509322, -0.13840681739538843, -0.19570566291624136, 0.39001281573478364, -0.15572265493353846, 0.19713205526854877, 0.06035286563951357, 0.1364703990387178, -0.04920657049139253, 0.060330620754110435, -0.002868859470302684, -0.21874521029691996, 0.06340986180152183, 0.21065529185322535, -0.003749909061748963, 0.32719414221510223, -0.44483427400082615, -0.20974821025872423, 0.12525199857165428, 0.10215692318959442, 0.020296093376262724, 0.0012439380511146995, -0.312916013354485, 0.1271366664925508, -0.055828491291773, -0.2105769068909298, -0.061511353688495876, 0.01552795055239931, 0.10187786953900817, -0.3738744421609661, 0.15781880736498335, 0.10041839188784855, 0.011407427514482916, -0.1417978737025266, -0.09786102517746982, -0.07807262040534577, 0.05272493338566768, 0.013638923080654534, 0.08944830250415324, 0.02251493995205656, -0.12028235282781904, -0.013123870761323292, 0.3615460118559082, -0.11089536608134981, -0.30371227046161625, 0.15194644019073617, -0.19389905239892216, -0.13757228883255307, 0.05364019750098212, 0.16217466253803764, 0.17384193744510412, -0.12615319092570498, 0.18877547253561988, -0.04935407413548864, 0.1455922398254671, 0.11791288700218486, -0.012891947132106705, 0.019500251352556248, 0.09376701982939138, 0.204303110894063, 0.08897938032477962, 6.911092009230525e-05, -0.07190139350827486, -0.40005515648497153, -0.15524240307905504, -0.08021792051777969, 0.1244181555127148, -0.12029217163783877, -0.2009949192437714, 0.31251592935573935, 0.1171941279343008, 0.19009038627938887, 0.10098090064732473, 0.19275616776544305, 0.21554688715573764, 0.020578892796456947, 0.09762586696733787, 0.15896308457734376, 0.13601472735429693, 0.14668941071908098, -0.20529667423642448, 0.04026458818729209, 0.1412367101025199] |
1,802.09177 | The multidimensional dependence of halo bias in the eye of a machine: a
tale of halo structure, assembly and environment | We develop a novel approach in exploring the joint dependence of halo bias on
multiple halo properties using Gaussian process regression. Using a
$\Lambda$CDM $N$-body simulation, we carry out a comprehensive study of the
joint bias dependence on halo structure, formation history and environment. We
show that the bias is a multivariate function of halo properties that falls
into three regimes. For massive haloes, halo mass explains the majority of bias
variation. For early-forming haloes, bias depends sensitively on the recent
mass accretion history. For low-mass and late-forming haloes, bias depends more
on the structure of a halo such as its shape and spin. Our framework enables us
to convincingly prove that $V_\mathrm{max}/V_\mathrm{vir}$ is a lossy proxy of
formation time for bias modelling, whereas the mass, spin, shape and formation
time variables are non-redundant with respect to each other. Combining mass and
formation time largely accounts for the mass accretion history dependence of
bias. Combining all the internal halo properties fully accounts for the density
profile dependence inside haloes, and predicts the clustering variation of
individual haloes to a $20\%$ level at $\sim 10\mathrm{Mpc}h^{-1}$. When an
environmental density is measured outside $1\mathrm{Mpc}h^{-1}$ from the halo
centre, it outperforms and largely accounts for the bias dependence on the
internal halo structure, explaining the bias variation above a level of $30\%$.
| astro-ph.CO astro-ph.GA | we develop a novel approach in exploring the joint dependence of halo bias on multiple halo properties using gaussian process regression using a lambdacdm nbody simulation we carry out a comprehensive study of the joint bias dependence on halo structure formation history and environment we show that the bias is a multivariate function of halo properties that falls into three regimes for massive haloes halo mass explains the majority of bias variation for earlyforming haloes bias depends sensitively on the recent mass accretion history for lowmass and lateforming haloes bias depends more on the structure of a halo such as its shape and spin our framework enables us to convincingly prove that v_mathrmmaxv_mathrmvir is a lossy proxy of formation time for bias modelling whereas the mass spin shape and formation time variables are nonredundant with respect to each other combining mass and formation time largely accounts for the mass accretion history dependence of bias combining all the internal halo properties fully accounts for the density profile dependence inside haloes and predicts the clustering variation of individual haloes to a 20 level at sim 10mathrmmpch1 when an environmental density is measured outside 1mathrmmpch1 from the halo centre it outperforms and largely accounts for the bias dependence on the internal halo structure explaining the bias variation above a level of 30 | [['we', 'develop', 'a', 'novel', 'approach', 'in', 'exploring', 'the', 'joint', 'dependence', 'of', 'halo', 'bias', 'on', 'multiple', 'halo', 'properties', 'using', 'gaussian', 'process', 'regression', 'using', 'a', 'lambdacdm', 'nbody', 'simulation', 'we', 'carry', 'out', 'a', 'comprehensive', 'study', 'of', 'the', 'joint', 'bias', 'dependence', 'on', 'halo', 'structure', 'formation', 'history', 'and', 'environment', 'we', 'show', 'that', 'the', 'bias', 'is', 'a', 'multivariate', 'function', 'of', 'halo', 'properties', 'that', 'falls', 'into', 'three', 'regimes', 'for', 'massive', 'haloes', 'halo', 'mass', 'explains', 'the', 'majority', 'of', 'bias', 'variation', 'for', 'earlyforming', 'haloes', 'bias', 'depends', 'sensitively', 'on', 'the', 'recent', 'mass', 'accretion', 'history', 'for', 'lowmass', 'and', 'lateforming', 'haloes', 'bias', 'depends', 'more', 'on', 'the', 'structure', 'of', 'a', 'halo', 'such', 'as', 'its', 'shape', 'and', 'spin', 'our', 'framework', 'enables', 'us', 'to', 'convincingly', 'prove', 'that', 'v_mathrmmaxv_mathrmvir', 'is', 'a', 'lossy', 'proxy', 'of', 'formation', 'time', 'for', 'bias', 'modelling', 'whereas', 'the', 'mass', 'spin', 'shape', 'and', 'formation', 'time', 'variables', 'are', 'nonredundant', 'with', 'respect', 'to', 'each', 'other', 'combining', 'mass', 'and', 'formation', 'time', 'largely', 'accounts', 'for', 'the', 'mass', 'accretion', 'history', 'dependence', 'of', 'bias', 'combining', 'all', 'the', 'internal', 'halo', 'properties', 'fully', 'accounts', 'for', 'the', 'density', 'profile', 'dependence', 'inside', 'haloes', 'and', 'predicts', 'the', 'clustering', 'variation', 'of', 'individual', 'haloes', 'to', 'a', '20', 'level', 'at', 'sim', '10mathrmmpch1', 'when', 'an', 'environmental', 'density', 'is', 'measured', 'outside', '1mathrmmpch1', 'from', 'the', 'halo', 'centre', 'it', 'outperforms', 'and', 'largely', 'accounts', 'for', 'the', 'bias', 'dependence', 'on', 'the', 'internal', 'halo', 'structure', 'explaining', 'the', 'bias', 'variation', 'above', 'a', 'level', 'of', '30']] | [-0.09706980639937145, 0.073033782384637, -0.13308383674679877, 0.12145171457441224, -0.12911840017639203, -0.017492918407596234, 0.026065261952613515, 0.3928769641141925, -0.19253451478909012, -0.391414091455873, 0.015928623304784263, -0.2493630041523526, -0.052860078158253734, 0.19068655792485784, 0.010812757879547361, -0.014690768856747093, 0.0003610304998734069, -0.03313267745263012, -0.08753611441729676, -0.24647151956149307, 0.3439341589929191, 0.09149852041284451, 0.25830265144597636, 0.019878082216665562, 0.1204098513332644, 0.020398035491342417, -0.05749201932566292, 0.016233065178514354, -0.15356158229240935, -0.00039616628351655825, 0.16369268186692218, 0.11558538874184403, 0.27691563673175146, -0.35708662178539846, -0.21761134894418152, 0.06738365512703443, 0.1810738105365696, 0.10527145467872119, -0.12533595751739524, -0.23067626310512424, 0.061138784382449185, -0.2079485884190675, -0.11396408490394673, 0.004816375892712838, 0.01521061495144817, 0.030450774290969734, -0.26273794040376003, 0.22761250158375199, 0.03094757413728749, 0.012809960572566424, -0.05726611370455767, -0.11592666170973745, -0.061225906414350634, 0.10473296328415961, 0.02837279808415958, 0.00533553655717427, 0.28768177228953895, -0.15037094351956276, -0.01679541797245663, 0.3553463314289089, -0.0752303382808653, -0.11464975442827886, 0.17727497596125533, -0.19489651227249177, -0.1780584695623946, 0.07409331155294138, 0.16610884706757065, 0.07664759811531338, -0.1471331630213239, 0.06095602083115847, -0.009067412865718964, 0.2515922801731331, 0.0377141909902329, -0.0007893348897427872, 0.32652910606487207, 0.190061339516197, 0.08640036315234655, 0.054071030920399436, -0.14736353123293225, -0.07542681681971536, -0.21652961952942726, -0.07500881429640921, -0.1278560814729038, 0.013439856763903258, -0.13025868332388874, -0.15734964644717467, 0.4210019057651085, 0.158103627165676, 0.2823937223508471, 0.12242506046809636, 0.32333901181334146, 0.09574107572714435, 0.0873807795039654, 0.08107902081273669, 0.20141156803368143, 0.18308245420727567, 0.012896929606709077, -0.2806768726365623, 0.13877135477216346, -0.052881270539526466] |
1,802.09178 | Photographic Text-to-Image Synthesis with a Hierarchically-nested
Adversarial Network | This paper presents a novel method to deal with the challenging task of
generating photographic images conditioned on semantic image descriptions. Our
method introduces accompanying hierarchical-nested adversarial objectives
inside the network hierarchies, which regularize mid-level representations and
assist generator training to capture the complex image statistics. We present
an extensile single-stream generator architecture to better adapt the jointed
discriminators and push generated images up to high resolutions. We adopt a
multi-purpose adversarial loss to encourage more effective image and text
information usage in order to improve the semantic consistency and image
fidelity simultaneously. Furthermore, we introduce a new visual-semantic
similarity measure to evaluate the semantic consistency of generated images.
With extensive experimental validation on three public datasets, our method
significantly improves previous state of the arts on all datasets over
different evaluation metrics.
| cs.CV | this paper presents a novel method to deal with the challenging task of generating photographic images conditioned on semantic image descriptions our method introduces accompanying hierarchicalnested adversarial objectives inside the network hierarchies which regularize midlevel representations and assist generator training to capture the complex image statistics we present an extensile singlestream generator architecture to better adapt the jointed discriminators and push generated images up to high resolutions we adopt a multipurpose adversarial loss to encourage more effective image and text information usage in order to improve the semantic consistency and image fidelity simultaneously furthermore we introduce a new visualsemantic similarity measure to evaluate the semantic consistency of generated images with extensive experimental validation on three public datasets our method significantly improves previous state of the arts on all datasets over different evaluation metrics | [['this', 'paper', 'presents', 'a', 'novel', 'method', 'to', 'deal', 'with', 'the', 'challenging', 'task', 'of', 'generating', 'photographic', 'images', 'conditioned', 'on', 'semantic', 'image', 'descriptions', 'our', 'method', 'introduces', 'accompanying', 'hierarchicalnested', 'adversarial', 'objectives', 'inside', 'the', 'network', 'hierarchies', 'which', 'regularize', 'midlevel', 'representations', 'and', 'assist', 'generator', 'training', 'to', 'capture', 'the', 'complex', 'image', 'statistics', 'we', 'present', 'an', 'extensile', 'singlestream', 'generator', 'architecture', 'to', 'better', 'adapt', 'the', 'jointed', 'discriminators', 'and', 'push', 'generated', 'images', 'up', 'to', 'high', 'resolutions', 'we', 'adopt', 'a', 'multipurpose', 'adversarial', 'loss', 'to', 'encourage', 'more', 'effective', 'image', 'and', 'text', 'information', 'usage', 'in', 'order', 'to', 'improve', 'the', 'semantic', 'consistency', 'and', 'image', 'fidelity', 'simultaneously', 'furthermore', 'we', 'introduce', 'a', 'new', 'visualsemantic', 'similarity', 'measure', 'to', 'evaluate', 'the', 'semantic', 'consistency', 'of', 'generated', 'images', 'with', 'extensive', 'experimental', 'validation', 'on', 'three', 'public', 'datasets', 'our', 'method', 'significantly', 'improves', 'previous', 'state', 'of', 'the', 'arts', 'on', 'all', 'datasets', 'over', 'different', 'evaluation', 'metrics']] | [-0.026944543586895717, -0.02846903385932709, -0.05756668134938192, 0.09974212328123747, -0.14582976649839882, -0.1380793502533131, 0.017181233918315476, 0.48404694176420116, -0.24205229566855865, -0.36996896186081524, 0.031699992937677904, -0.28936311399394815, -0.15552426468242297, 0.1635275230757102, -0.1800071120572587, 0.09051465818651416, 0.17239264887052053, 0.03534708205420016, -0.08471413570540873, -0.29745388918408106, 0.33268863393106696, 0.057170287783568106, 0.3906268395808046, 0.011601047731484428, 0.1762670239638255, -0.040071024146692995, -0.07463589854854615, -0.04533610303858013, -0.08326697197855648, 0.2167688902149111, 0.29627573893627746, 0.2289495492410479, 0.27137662166426185, -0.40058467204146314, -0.20964572000119722, 0.06598751653853635, 0.10589780190705576, 0.07761716688423115, -0.03696755124000254, -0.3998671188019216, 0.11212929280891056, -0.18155216192121082, 0.04610349916126297, -0.19064660397160685, -0.07392218113245415, -0.03959080953041628, -0.31035529347277724, 0.012509419775707294, 0.06443128890753018, 0.07435939689590172, -0.051593915518782466, -0.061983403523988796, 0.01920699813953516, 0.20057626537781095, 0.0253480264447827, 0.08553149290188837, 0.12212166580756081, -0.1964578675502487, -0.1369581960042882, 0.3431041453979119, -0.06681720746211905, -0.24375650505658775, 0.21558864515232432, -0.03391089454067476, -0.13140649841675026, 0.10683287069497799, 0.27128108757879643, 0.11804229766835994, -0.15311358821098553, -0.033452535016377544, -0.015486667292531241, 0.20365909708109967, 0.07139142823518452, -0.0017542427645601106, 0.14462261473421345, 0.24916611150415105, 0.04029167424552284, 0.18792827208491156, -0.13844530886413078, -0.03254097548426327, -0.2266911391070056, -0.12411713405427607, -0.18426153691270333, -0.05679833111847102, -0.10582804332697185, -0.14871202596766647, 0.4368702110509868, 0.3118903171271086, 0.2228878995678811, 0.11800393178639228, 0.37460321918920136, -0.0432445683435424, 0.12385467666635205, 0.055668668152506914, 0.11346946115725476, -0.009470367521950693, 0.13596838077082243, -0.1607584886492766, 0.053332494813454985, 0.07793005281233821] |
1,802.09179 | A magnetic resonance in high-frequency viscosity of two-dimensional
electrons | Two-dimensional (2D) electrons in high-quality nanostructures at low
temperatures can form a viscous fluid. We develop a theory of high-frequency
magnetotransport in such fluid. The time dispersion of viscosity should be
taken into account at the frequencies about and above the rate of
electron-electron collisions. We show that the shear viscosity coefficients as
functions of magnetic field and frequency have the only resonance at the
frequency equal to the doubled cyclotron frequency. We demonstrate that such
resonance manifests itself in the plasmon damping. Apparently, the predicted
resonance is also responsible for the peaks and features in photoresistance and
photovoltage, recently observed on the best-quality GaAs quantum wells. The
last fact should considered as an important evidence of forming a viscous
electron fluid in such structures.
| cond-mat.mes-hall | twodimensional 2d electrons in highquality nanostructures at low temperatures can form a viscous fluid we develop a theory of highfrequency magnetotransport in such fluid the time dispersion of viscosity should be taken into account at the frequencies about and above the rate of electronelectron collisions we show that the shear viscosity coefficients as functions of magnetic field and frequency have the only resonance at the frequency equal to the doubled cyclotron frequency we demonstrate that such resonance manifests itself in the plasmon damping apparently the predicted resonance is also responsible for the peaks and features in photoresistance and photovoltage recently observed on the bestquality gaas quantum wells the last fact should considered as an important evidence of forming a viscous electron fluid in such structures | [['twodimensional', '2d', 'electrons', 'in', 'highquality', 'nanostructures', 'at', 'low', 'temperatures', 'can', 'form', 'a', 'viscous', 'fluid', 'we', 'develop', 'a', 'theory', 'of', 'highfrequency', 'magnetotransport', 'in', 'such', 'fluid', 'the', 'time', 'dispersion', 'of', 'viscosity', 'should', 'be', 'taken', 'into', 'account', 'at', 'the', 'frequencies', 'about', 'and', 'above', 'the', 'rate', 'of', 'electronelectron', 'collisions', 'we', 'show', 'that', 'the', 'shear', 'viscosity', 'coefficients', 'as', 'functions', 'of', 'magnetic', 'field', 'and', 'frequency', 'have', 'the', 'only', 'resonance', 'at', 'the', 'frequency', 'equal', 'to', 'the', 'doubled', 'cyclotron', 'frequency', 'we', 'demonstrate', 'that', 'such', 'resonance', 'manifests', 'itself', 'in', 'the', 'plasmon', 'damping', 'apparently', 'the', 'predicted', 'resonance', 'is', 'also', 'responsible', 'for', 'the', 'peaks', 'and', 'features', 'in', 'photoresistance', 'and', 'photovoltage', 'recently', 'observed', 'on', 'the', 'bestquality', 'gaas', 'quantum', 'wells', 'the', 'last', 'fact', 'should', 'considered', 'as', 'an', 'important', 'evidence', 'of', 'forming', 'a', 'viscous', 'electron', 'fluid', 'in', 'such', 'structures']] | [-0.16395113536342978, 0.19112067054689397, -0.07908520977734589, 0.0544140759781003, -0.02860491300560534, -0.10840044983103872, -0.004538441873155535, 0.36465839672088624, -0.25929850404709576, -0.27808763342723253, 0.01990438395133242, -0.27297427086532117, -0.11600726512819529, 0.22882156028412282, 0.030776626433245836, 0.04556806288659573, -0.003490914975292981, 0.01080691069504246, -0.011227577248588205, -0.14811094341799616, 0.26231386682391167, 0.062160951654426755, 0.2791032363772392, 0.10850563064962626, 0.08849627831764519, -0.02891429085470736, 0.06680394742637873, 0.04365195554029196, -0.14994721753767226, 0.00395516280666925, 0.2713282029889524, -0.07134244705736636, 0.25327843199670314, -0.4568646877044812, -0.2410870905071497, -0.010723059963434934, 0.17724145535565913, 0.1360722445519641, -0.06637747517693787, -0.24269026866555213, 0.03450851435866207, -0.12008306557685136, -0.10615797132253647, -0.047620843581855296, 0.01655819554720074, -0.015461725234985351, -0.25477844348177314, 0.15956947720586323, 0.0861416335105896, 0.05761225885152817, -0.1285089151188731, -0.11485799615085125, -0.05653800132870674, 0.06414291190728545, 0.07091910078935325, 0.0013968565771356224, 0.18169045895896851, -0.13332863067928702, -0.08042136933654546, 0.38642441155947743, -0.09285162806138396, -0.12178694150596857, 0.205596572086215, -0.2578428731113672, -0.05016339334100485, 0.1647203243151307, 0.19250787730515004, 0.06712298061326147, -0.11024289100710302, 0.04770645354711451, -0.018100498519837856, 0.17297707961499692, 0.11265375476330519, 0.07882845900207758, 0.28042566749453546, 0.14894271347671748, -0.006707599012181163, 0.12012643563887104, -0.14924056348134765, -0.00036228667199611665, -0.2628177264072001, -0.1658593137487769, -0.19783150172233582, 0.06818527379631996, -0.05083118666708469, -0.160245429135859, 0.4013834582325071, 0.11121431758627295, 0.19358419721480458, -0.0361997778955847, 0.2864812732078135, 0.19044625331647694, 0.10809203414618969, 0.07106484284251928, 0.2977367824092507, 0.15052083771675825, 0.12805449929833412, -0.2740475271400064, 0.018267500828951597, -9.246008656919003e-05] |
1,802.0918 | Cuttlefish: A Lightweight Primitive for Adaptive Query Processing | Modern data processing applications execute increasingly sophisticated
analysis that requires operations beyond traditional relational algebra. As a
result, operators in query plans grow in diversity and complexity. Designing
query optimizer rules and cost models to choose physical operators for all of
these novel logical operators is impractical. To address this challenge, we
develop Cuttlefish, a new primitive for adaptively processing online query
plans that explores candidate physical operator instances during query
execution and exploits the fastest ones using multi-armed bandit reinforcement
learning techniques. We prototype Cuttlefish in Apache Spark and adaptively
choose operators for image convolution, regular expression matching, and
relational joins. Our experiments show Cuttlefish-based adaptive convolution
and regular expression operators can reach 72-99% of the throughput of an
all-knowing oracle that always selects the optimal algorithm, even when
individual physical operators are up to 105x slower than the optimal.
Additionally, Cuttlefish achieves join throughput improvements of up to 7.5x
compared with Spark SQL's query optimizer.
| cs.DB cs.DC | modern data processing applications execute increasingly sophisticated analysis that requires operations beyond traditional relational algebra as a result operators in query plans grow in diversity and complexity designing query optimizer rules and cost models to choose physical operators for all of these novel logical operators is impractical to address this challenge we develop cuttlefish a new primitive for adaptively processing online query plans that explores candidate physical operator instances during query execution and exploits the fastest ones using multiarmed bandit reinforcement learning techniques we prototype cuttlefish in apache spark and adaptively choose operators for image convolution regular expression matching and relational joins our experiments show cuttlefishbased adaptive convolution and regular expression operators can reach 7299 of the throughput of an allknowing oracle that always selects the optimal algorithm even when individual physical operators are up to 105x slower than the optimal additionally cuttlefish achieves join throughput improvements of up to 75x compared with spark sqls query optimizer | [['modern', 'data', 'processing', 'applications', 'execute', 'increasingly', 'sophisticated', 'analysis', 'that', 'requires', 'operations', 'beyond', 'traditional', 'relational', 'algebra', 'as', 'a', 'result', 'operators', 'in', 'query', 'plans', 'grow', 'in', 'diversity', 'and', 'complexity', 'designing', 'query', 'optimizer', 'rules', 'and', 'cost', 'models', 'to', 'choose', 'physical', 'operators', 'for', 'all', 'of', 'these', 'novel', 'logical', 'operators', 'is', 'impractical', 'to', 'address', 'this', 'challenge', 'we', 'develop', 'cuttlefish', 'a', 'new', 'primitive', 'for', 'adaptively', 'processing', 'online', 'query', 'plans', 'that', 'explores', 'candidate', 'physical', 'operator', 'instances', 'during', 'query', 'execution', 'and', 'exploits', 'the', 'fastest', 'ones', 'using', 'multiarmed', 'bandit', 'reinforcement', 'learning', 'techniques', 'we', 'prototype', 'cuttlefish', 'in', 'apache', 'spark', 'and', 'adaptively', 'choose', 'operators', 'for', 'image', 'convolution', 'regular', 'expression', 'matching', 'and', 'relational', 'joins', 'our', 'experiments', 'show', 'cuttlefishbased', 'adaptive', 'convolution', 'and', 'regular', 'expression', 'operators', 'can', 'reach', '7299', 'of', 'the', 'throughput', 'of', 'an', 'allknowing', 'oracle', 'that', 'always', 'selects', 'the', 'optimal', 'algorithm', 'even', 'when', 'individual', 'physical', 'operators', 'are', 'up', 'to', '105x', 'slower', 'than', 'the', 'optimal', 'additionally', 'cuttlefish', 'achieves', 'join', 'throughput', 'improvements', 'of', 'up', 'to', '75x', 'compared', 'with', 'spark', 'sqls', 'query', 'optimizer']] | [-0.07662016701463971, 0.002409946483713875, -0.053624052396644986, 0.09918901045476236, -0.1456319970289065, -0.2170785972773428, 0.11703462361568405, 0.44012046063378935, -0.3164417931002625, -0.3385736084152614, 0.10576771482780216, -0.28959264454221534, -0.13593066134940712, 0.20565691277565015, -0.13982701793673538, 0.12879113248406698, 0.1125743166213074, 0.03510229627511675, -0.0859361885044153, -0.2918504845831663, 0.2492909149454546, 0.09086089034099132, 0.27874660302674575, -0.04863573295034228, 0.0829242694189757, 0.013336624643735348, -0.045037581375049006, -0.029876350497286167, -0.053197480773416184, 0.12841935788972242, 0.3515243722241599, 0.27820612689360014, 0.33583215879832184, -0.4483579028698225, -0.09588022591966776, 0.08654519406958452, 0.1652212929341101, 0.044384573922762946, -0.05804802498014103, -0.25737124516838983, 0.09397430678438996, -0.16537757625262584, -0.005493894327552088, -0.15645206783477578, 0.01629075356308491, -0.01257207369912536, -0.3636669963387953, -0.035809637126963466, 0.0473544203593666, 0.027484848554576596, -0.05043932135074189, -0.10179425927832902, 0.07117959123495365, 0.11926573246863911, -0.043446991441305725, 0.06693833614549329, 0.19657500227011981, -0.10419529637231702, -0.23650572832313277, 0.36024527956033126, -0.0007935963831128432, -0.14859056867538922, 0.1548801077710044, -0.052187908762284824, -0.16617572309088804, 0.08305235840680618, 0.21492727057587716, 0.1217544382047509, -0.1767110997680462, 0.09809334263010251, -0.01950185999514595, 0.1781002534523366, 0.10092041350210146, 0.07840797224292351, 0.10597004593620377, 0.23740362692173692, 0.12102621731258208, 0.15801564168425336, 0.018153202581790186, -0.11975528617059031, -0.20645272885073698, -0.14619430326406033, -0.13557621964719146, -0.03181086761704195, -0.1934726302371165, -0.15428649269930658, 0.3302067008590506, 0.24725059220987944, 0.14639340411409765, 0.16310943722980278, 0.34995996844429045, 0.04366192138385809, 0.16821341914755683, 0.18930891134265448, 0.10808279174980857, -0.03020974143498367, 0.14634961804652946, -0.16999366764925541, 0.08360736893805405, 0.08418601224078767] |
1,802.09181 | Unusual spin-wave dynamics in core-shell magnetic nanodisks | We investigated the spin dynamics of a vortex state in a core-shell magnetic
nanodisk driven by an oscillating field applied perpendicular to the disk plane
by means of micromagnetic simulations. The nanodisk comprises a Py (Fe0.2Ni0.8)
core of 100 nm in radius, surrounded by a 50 nm thick Fe shell. Fourier
transform analyses show that the Py core and the Fe shell dominate spin-wave
oscillation at the fundamental and higher order radial modes, respectively. For
oscillating driving field tuned to the fundamental eigenfrequency, the Py/Fe
interface effectively confines spin-wave excitation in the Py core region. This
effect leads to significantly more rapid vortex core (VC) reversal in
comparison to homogeneous disks. Our work demonstrates that the higher order
modes can drive much faster VC reversal than the fundamental mode, in sharp
contrast to the results obtained in homogeneous disks. With excitation levels
up to 30 mT, we find strong nonlinear spin-wave dynamics in the system, which
results in mode frequency redshifting, therefore the observation of the most
rapid VC reversals below eigenfrequencies and VC switching in wide ranges of
frequencies.
| cond-mat.mes-hall | we investigated the spin dynamics of a vortex state in a coreshell magnetic nanodisk driven by an oscillating field applied perpendicular to the disk plane by means of micromagnetic simulations the nanodisk comprises a py fe02ni08 core of 100 nm in radius surrounded by a 50 nm thick fe shell fourier transform analyses show that the py core and the fe shell dominate spinwave oscillation at the fundamental and higher order radial modes respectively for oscillating driving field tuned to the fundamental eigenfrequency the pyfe interface effectively confines spinwave excitation in the py core region this effect leads to significantly more rapid vortex core vc reversal in comparison to homogeneous disks our work demonstrates that the higher order modes can drive much faster vc reversal than the fundamental mode in sharp contrast to the results obtained in homogeneous disks with excitation levels up to 30 mt we find strong nonlinear spinwave dynamics in the system which results in mode frequency redshifting therefore the observation of the most rapid vc reversals below eigenfrequencies and vc switching in wide ranges of frequencies | [['we', 'investigated', 'the', 'spin', 'dynamics', 'of', 'a', 'vortex', 'state', 'in', 'a', 'coreshell', 'magnetic', 'nanodisk', 'driven', 'by', 'an', 'oscillating', 'field', 'applied', 'perpendicular', 'to', 'the', 'disk', 'plane', 'by', 'means', 'of', 'micromagnetic', 'simulations', 'the', 'nanodisk', 'comprises', 'a', 'py', 'fe02ni08', 'core', 'of', '100', 'nm', 'in', 'radius', 'surrounded', 'by', 'a', '50', 'nm', 'thick', 'fe', 'shell', 'fourier', 'transform', 'analyses', 'show', 'that', 'the', 'py', 'core', 'and', 'the', 'fe', 'shell', 'dominate', 'spinwave', 'oscillation', 'at', 'the', 'fundamental', 'and', 'higher', 'order', 'radial', 'modes', 'respectively', 'for', 'oscillating', 'driving', 'field', 'tuned', 'to', 'the', 'fundamental', 'eigenfrequency', 'the', 'pyfe', 'interface', 'effectively', 'confines', 'spinwave', 'excitation', 'in', 'the', 'py', 'core', 'region', 'this', 'effect', 'leads', 'to', 'significantly', 'more', 'rapid', 'vortex', 'core', 'vc', 'reversal', 'in', 'comparison', 'to', 'homogeneous', 'disks', 'our', 'work', 'demonstrates', 'that', 'the', 'higher', 'order', 'modes', 'can', 'drive', 'much', 'faster', 'vc', 'reversal', 'than', 'the', 'fundamental', 'mode', 'in', 'sharp', 'contrast', 'to', 'the', 'results', 'obtained', 'in', 'homogeneous', 'disks', 'with', 'excitation', 'levels', 'up', 'to', '30', 'mt', 'we', 'find', 'strong', 'nonlinear', 'spinwave', 'dynamics', 'in', 'the', 'system', 'which', 'results', 'in', 'mode', 'frequency', 'redshifting', 'therefore', 'the', 'observation', 'of', 'the', 'most', 'rapid', 'vc', 'reversals', 'below', 'eigenfrequencies', 'and', 'vc', 'switching', 'in', 'wide', 'ranges', 'of', 'frequencies']] | [-0.16300711808794863, 0.1849734642984525, 0.0010470144994808048, 0.01212562496964872, -0.06579673100194862, -0.08489518298694257, 0.03531650776956544, 0.39686759295507096, -0.26876516582174853, -0.2964435242838488, 0.040187473013196556, -0.24200678208654516, -0.04377571641947561, 0.21430080551444813, 0.0552755405358235, -0.003281769496414894, 0.0052497840114984285, -0.03379575055997735, -0.03440676805866736, -0.12665170826425964, 0.2618200282201307, 0.024132919817603078, 0.31992708581886936, -0.000898728004409513, 0.007920998062289665, -0.03587811500366432, 0.07276858511809887, 0.022452989235400022, -0.14818802293629735, 0.07283832047532281, 0.2181850564299842, -0.03568081776519944, 0.23927297200379746, -0.4665666071153926, -0.18946108753005503, -0.02370716525853894, 0.2232289509625394, 0.11955949299369698, -0.03583171486691376, -0.24858323341298305, 0.09355237407235721, -0.1402191318377978, -0.1689457028242236, -0.022837624004832732, 0.04621541674191321, -0.006511790275029587, -0.2604219435525828, 0.08926953968305527, 0.12402921209368185, 0.09935034548581233, -0.08838601445313543, -0.08223673030590178, -0.06683797929357486, 0.03288233814188122, 0.045407442282329395, 0.07806137911295204, 0.18934392052430535, -0.10814065077627245, -0.0956238151104137, 0.333951868969696, -0.1311675057413084, -0.10758449225634169, 0.17703998829447404, -0.25451709224915736, -0.01788596856130517, 0.20030951643299855, 0.13623557803796582, 0.11274550372755594, -0.06919800175672391, 0.021644225934313695, 0.03616444157368472, 0.24746992894490197, 0.11191564106403358, 0.006307318610442656, 0.23865123176842593, 0.17176541763493855, 0.040175044088980205, 0.15729321853069358, -0.16183140193206375, -0.10237990753604832, -0.21257886631751768, -0.12275486870759084, -0.17109458066236616, 0.009492463510734647, -0.1002486805668463, -0.13903282257450975, 0.3996337859791944, 0.12586353947617784, 0.16459234073997497, -0.025899847537106467, 0.27701351778016664, 0.13633341667715856, 0.12977192002568352, 0.09730100391035, 0.3100598528248708, 0.20576988397757365, 0.1521802051496441, -0.3054758514947352, -0.005752123010567497, -0.02594774329427923] |
1,802.09182 | On the Validity of Encodings of the Synchronous in the Asynchronous
$\pi$-calculus | Process calculi may be compared in their expressive power by means of
encodings between them. A widely accepted definition of what constitutes a
valid encoding for (dis)proving relative expressiveness results between process
calculi was proposed by Gorla. Prior to this work, diverse encodability and
separation results were generally obtained using distinct, and often
incompatible, quality criteria on encodings.
Textbook examples of valid encoding are the encodings proposed by Boudol and
by Honda & Tokoro of the synchronous choice-free $\pi$-calculus into its
asynchronous fragment, illustrating that the latter is no less expressive than
the former. Here I formally establish that these encodings indeed satisfy
Gorla's criteria.
| cs.LO | process calculi may be compared in their expressive power by means of encodings between them a widely accepted definition of what constitutes a valid encoding for disproving relative expressiveness results between process calculi was proposed by gorla prior to this work diverse encodability and separation results were generally obtained using distinct and often incompatible quality criteria on encodings textbook examples of valid encoding are the encodings proposed by boudol and by honda tokoro of the synchronous choicefree picalculus into its asynchronous fragment illustrating that the latter is no less expressive than the former here i formally establish that these encodings indeed satisfy gorlas criteria | [['process', 'calculi', 'may', 'be', 'compared', 'in', 'their', 'expressive', 'power', 'by', 'means', 'of', 'encodings', 'between', 'them', 'a', 'widely', 'accepted', 'definition', 'of', 'what', 'constitutes', 'a', 'valid', 'encoding', 'for', 'disproving', 'relative', 'expressiveness', 'results', 'between', 'process', 'calculi', 'was', 'proposed', 'by', 'gorla', 'prior', 'to', 'this', 'work', 'diverse', 'encodability', 'and', 'separation', 'results', 'were', 'generally', 'obtained', 'using', 'distinct', 'and', 'often', 'incompatible', 'quality', 'criteria', 'on', 'encodings', 'textbook', 'examples', 'of', 'valid', 'encoding', 'are', 'the', 'encodings', 'proposed', 'by', 'boudol', 'and', 'by', 'honda', 'tokoro', 'of', 'the', 'synchronous', 'choicefree', 'picalculus', 'into', 'its', 'asynchronous', 'fragment', 'illustrating', 'that', 'the', 'latter', 'is', 'no', 'less', 'expressive', 'than', 'the', 'former', 'here', 'i', 'formally', 'establish', 'that', 'these', 'encodings', 'indeed', 'satisfy', 'gorlas', 'criteria']] | [-0.07452067134811212, 0.07025978126554176, -0.08993995099668749, 0.12962026272295518, -0.11009682480989096, -0.19530924500521415, 0.06547227670223667, 0.39381528036812175, -0.23432256579354332, -0.31337366700888825, 0.048795917388186075, -0.20986216742760286, -0.11579060772111496, 0.23182673623355535, -0.132809257613889, 0.05906169692808852, 0.04038979740618323, 0.006882189396912089, -0.04584707868679498, -0.2590483290035851, 0.29416955639429104, 0.035294071692848004, 0.2743958364522908, -0.016369693522462442, 0.06441253517718556, -0.005913421668363019, -0.05406085459981114, 0.0469505697927581, -0.10564164117567998, 0.1404096636509236, 0.2975023685923169, 0.247782502121901, 0.25458018822022355, -0.40857513222055364, -0.15301437703041862, 0.054041108062777385, 0.11632376873883633, 0.07110003222568104, 0.01974239171137854, -0.30717995929388475, 0.12242463951518473, -0.18745897932407948, -0.0003710315706065068, -0.13605365808605432, 0.04773653732487359, 0.034344627922669485, -0.2346364366642844, 0.023795264020848732, 0.21113706376805708, 0.08589808303021038, -0.03278420193573066, -0.11358182627904731, -0.020253420462652754, 0.05707173198998834, 0.004555312233256141, -0.02768348679931548, 0.0804516701385952, -0.06236530380332484, -0.2020485419108389, 0.3377247861622331, 0.017641964208870868, -0.21013197225735125, 0.2167906365223014, -0.04882581422302442, -0.14396849653208987, 0.10541118746802497, 0.05202912166714668, 0.11224344574909012, -0.16627996118264632, 0.04972984471477013, -0.03305383407636187, 0.21501692595372263, 0.17184663593966085, 0.07208983398987374, 0.15867110738494936, 0.13566871242241738, -0.02342626262599459, 0.1601768328882127, 0.07506042258123322, -0.14793633296638012, -0.2597391448261288, -0.13752415333874524, -0.11714955361542077, -0.0211216602272963, -0.07174962703902565, -0.09659541739473262, 0.3151724038269514, 0.1727110736728019, 0.11510236904275818, 0.14660975048676705, 0.3304473416826043, 0.09546402990012072, 0.08648167535277305, 0.046813118419287585, 0.2090158738725362, 0.1349204208572001, 0.08998813086565441, -0.11801311387367044, 0.16544535541638303, 0.06915080272413504] |
1,802.09183 | Synthetic topological Kondo insulator in a pumped optical cavity | Motivated by experimental advances on ultracold atoms coupled to a pumped
optical cavity, we propose a scheme for synthesizing and observing the Kondo
insulator in Fermi gases trapped in optical lattices. The synthetic Kondo phase
arises from the screening of localized atoms coupled to mobile ones, which in
our proposal is generated via the pumping laser as well as the cavity. By
designing the atom-cavity coupling, it can engineer a nearest-neighbor-site
Kondo coupling that plays an essential role for supporting topological Kondo
phase. Therefore, the cavity-induced Kondo transition is associated with a
nontrivial topological features, resulting in the coexistence of the
superradiant and topological Kondo state. Our proposal can be realized with
current technique, and thus has potential applications in quantum simulation of
the topological Kondo insulator in ultracold atoms.
| cond-mat.quant-gas | motivated by experimental advances on ultracold atoms coupled to a pumped optical cavity we propose a scheme for synthesizing and observing the kondo insulator in fermi gases trapped in optical lattices the synthetic kondo phase arises from the screening of localized atoms coupled to mobile ones which in our proposal is generated via the pumping laser as well as the cavity by designing the atomcavity coupling it can engineer a nearestneighborsite kondo coupling that plays an essential role for supporting topological kondo phase therefore the cavityinduced kondo transition is associated with a nontrivial topological features resulting in the coexistence of the superradiant and topological kondo state our proposal can be realized with current technique and thus has potential applications in quantum simulation of the topological kondo insulator in ultracold atoms | [['motivated', 'by', 'experimental', 'advances', 'on', 'ultracold', 'atoms', 'coupled', 'to', 'a', 'pumped', 'optical', 'cavity', 'we', 'propose', 'a', 'scheme', 'for', 'synthesizing', 'and', 'observing', 'the', 'kondo', 'insulator', 'in', 'fermi', 'gases', 'trapped', 'in', 'optical', 'lattices', 'the', 'synthetic', 'kondo', 'phase', 'arises', 'from', 'the', 'screening', 'of', 'localized', 'atoms', 'coupled', 'to', 'mobile', 'ones', 'which', 'in', 'our', 'proposal', 'is', 'generated', 'via', 'the', 'pumping', 'laser', 'as', 'well', 'as', 'the', 'cavity', 'by', 'designing', 'the', 'atomcavity', 'coupling', 'it', 'can', 'engineer', 'a', 'nearestneighborsite', 'kondo', 'coupling', 'that', 'plays', 'an', 'essential', 'role', 'for', 'supporting', 'topological', 'kondo', 'phase', 'therefore', 'the', 'cavityinduced', 'kondo', 'transition', 'is', 'associated', 'with', 'a', 'nontrivial', 'topological', 'features', 'resulting', 'in', 'the', 'coexistence', 'of', 'the', 'superradiant', 'and', 'topological', 'kondo', 'state', 'our', 'proposal', 'can', 'be', 'realized', 'with', 'current', 'technique', 'and', 'thus', 'has', 'potential', 'applications', 'in', 'quantum', 'simulation', 'of', 'the', 'topological', 'kondo', 'insulator', 'in', 'ultracold', 'atoms']] | [-0.1714640559173774, 0.25718098742151435, -0.03586726612501684, -0.005438385821893349, 0.012392793449955855, -0.24840087732733335, 0.0791280000207065, 0.38004102054514105, -0.24398250323395396, -0.2508836922690619, 0.0007517500979060582, -0.29344208628054735, -0.14224285689406385, 0.2102567689681007, 0.007917174635375597, 0.04853674689760836, -0.01242553093651122, -0.07239915465921626, -0.04875744739727861, -0.2239528967269747, 0.3066474407561152, 0.017978575686173327, 0.31014369217346804, 0.11960139894829125, 0.03688762862552968, -0.022045465572484473, 0.15096655888880003, -0.009836898566144265, -0.08534919885881724, 0.10691783474505583, 0.2891474915162999, -0.0809835568647976, 0.2208352825900381, -0.45115090768004573, -0.2347910677402302, 0.030031037060255113, 0.17400545570566212, 0.21213154046698798, -0.13632300116623527, -0.3919263224066921, -0.04467338248690258, -0.17831411875979325, -0.10170407679884932, -0.1473355058999371, -0.03544174148944791, -0.05668586242741855, -0.2780746775507826, 0.020436908226720122, 0.040324747767263316, 0.08881775612488042, -0.057326722897358184, -0.0004888451008429361, -0.021941607361370626, 0.06225526971063872, -0.03814420078397375, 0.05405899241761586, 0.16138500053897614, -0.16648624775310358, -0.15063063280166003, 0.41435023046336894, -0.10372544301659331, -0.07567877435060434, 0.2131323244408235, -0.10563018387490378, -0.02727407380909652, 0.12236860003177971, 0.10664856061700356, 0.05176269753958828, -0.07341819695989392, 0.11069580467008126, -0.045313778838734754, 0.161557681105901, 0.0006769144358907559, 0.1470278456280109, 0.32376272589430327, 0.23113220532121526, 0.06290374393755382, 0.2193504196416601, -0.1086111853567905, -0.12610448554136552, -0.23104851105965155, -0.15496011490594278, -0.29600576034118964, 0.05991086635247681, -0.022725355598101817, -0.1593223980857175, 0.4369469390841787, 0.19443422897227916, 0.1656221928690423, -0.12955123418490871, 0.28545972534866876, 0.1452057184831983, 0.07716152695000403, -0.019142795020223473, 0.24329665806794235, 0.14241163702248488, 0.08364580268069177, -0.36536554613713784, -6.566309485613376e-05, 0.062497178117867355] |
1,802.09184 | Variance Reduction Methods for Sublinear Reinforcement Learning | There is a technical issue in the analysis that is not easily fixable. We,
therefore, withdraw the submission. Sorry for the inconvenience.
| cs.AI cs.LG stat.ML | there is a technical issue in the analysis that is not easily fixable we therefore withdraw the submission sorry for the inconvenience | [['there', 'is', 'a', 'technical', 'issue', 'in', 'the', 'analysis', 'that', 'is', 'not', 'easily', 'fixable', 'we', 'therefore', 'withdraw', 'the', 'submission', 'sorry', 'for', 'the', 'inconvenience']] | [-0.1307548392056064, 0.04579672564498403, -0.14284898912195454, 0.08089169035454026, -0.11662580166012049, -0.16693847014738078, 0.08245398345488039, 0.37425160145556385, -0.22195621215823022, -0.2705614473670721, 0.20987025944156235, -0.28694477982141753, -0.1484973452646624, 0.13815902918577194, -0.23025844495912845, -0.0317460030994632, 0.1264130768620155, 0.011104281102730469, 0.02138268965592777, -0.305064738728106, 0.3004859635098414, 0.06218782786957242, 0.25713250235739077, 0.17013286888091403, -7.546834901652552e-05, -0.03177503430792554, -0.04311034451662139, -0.020397689659148455, -0.09513799737330621, 0.05492799132215706, 0.3211363054473292, 0.18354494547979397, 0.3931292349641973, -0.3487729668955911, -0.13656592335213313, 0.13469619401307267, 0.125930261798203, 0.13383832762271844, -0.07444875899024984, -0.2056293821978298, 0.1435488296080042, -0.22038150248541075, -0.12956254603341222, -0.03465562516992742, 0.027653826231306248, -0.07998524064367468, -0.2000572070775723, 0.026155299549414354, 0.12368184226480397, 0.047528032890774986, -0.018073777583512394, -0.07387610761956735, 0.04582729478451339, 0.15726546801372684, 0.11394547872160646, 0.050652475879442965, 0.08647451022724537, -0.10754100389418784, -0.06772771503098986, 0.39776143567128613, 0.007668224163353443, -0.2612823048098521, 0.12827057865532962, -0.08185937573117288, -0.2506474376740781, 0.09748876230283217, 0.08823138754814863, 0.05913430012085221, -0.2146490047135475, 0.05338542874563824, -0.04549201916564594, 0.2317509065297517, 0.05692450410093774, -0.06384975571100684, 0.1471167100508782, 0.15694166465916418, 0.08303210549903187, 0.10092425462789834, 0.0015705417926338587, -0.016909479438750583, -0.3408399691635912, -0.1658621155233546, -0.194489198313518, 0.047366238258043515, 0.055483314991843974, -0.14528544347690928, 0.35019042647697707, 0.2640918107195334, 0.09483491697094658, -0.022646061864427545, 0.33938956091349776, 0.08335845887830312, 0.1228694688867439, 0.09251364275537939, 0.2289273034442555, -0.06840111200951716, 0.1736768355423754, -0.12230349353260615, 0.19294438676231287, 0.022672509816898542] |
1,802.09185 | $\alpha$-Attractor and Reheating in a Model with Non-Canonical Scalar
Fields | We consider two non-canonical scalar fields (tachyon and DBI) with E-model
type of the potential. We study cosmological inflation in these models to find
possible $\alpha$-attractors. We show that similar to the canonical scalar
field case, in both tachyon and DBI models there is a value of the scalar
spectral index in small $\alpha$ limit which is just a function of the e-folds
number. However, the value of $n_{s}$ in DBI model is somewhat different from
the other ones. We also compare the results with Planck2015 TT, TE, EE+lowP
data. The reheating phase after inflation is studied in these models which
gives some more constraints on the model's parameters.
| astro-ph.CO gr-qc hep-th | we consider two noncanonical scalar fields tachyon and dbi with emodel type of the potential we study cosmological inflation in these models to find possible alphaattractors we show that similar to the canonical scalar field case in both tachyon and dbi models there is a value of the scalar spectral index in small alpha limit which is just a function of the efolds number however the value of n_s in dbi model is somewhat different from the other ones we also compare the results with planck2015 tt te eelowp data the reheating phase after inflation is studied in these models which gives some more constraints on the models parameters | [['we', 'consider', 'two', 'noncanonical', 'scalar', 'fields', 'tachyon', 'and', 'dbi', 'with', 'emodel', 'type', 'of', 'the', 'potential', 'we', 'study', 'cosmological', 'inflation', 'in', 'these', 'models', 'to', 'find', 'possible', 'alphaattractors', 'we', 'show', 'that', 'similar', 'to', 'the', 'canonical', 'scalar', 'field', 'case', 'in', 'both', 'tachyon', 'and', 'dbi', 'models', 'there', 'is', 'a', 'value', 'of', 'the', 'scalar', 'spectral', 'index', 'in', 'small', 'alpha', 'limit', 'which', 'is', 'just', 'a', 'function', 'of', 'the', 'efolds', 'number', 'however', 'the', 'value', 'of', 'n_s', 'in', 'dbi', 'model', 'is', 'somewhat', 'different', 'from', 'the', 'other', 'ones', 'we', 'also', 'compare', 'the', 'results', 'with', 'planck2015', 'tt', 'te', 'eelowp', 'data', 'the', 'reheating', 'phase', 'after', 'inflation', 'is', 'studied', 'in', 'these', 'models', 'which', 'gives', 'some', 'more', 'constraints', 'on', 'the', 'models', 'parameters']] | [-0.14447937531016528, 0.154938642674664, -0.0845373954598305, 0.11619584597732632, -0.08652647212681729, -0.1880305171986922, -0.030640111898644528, 0.3228544867640242, -0.18534983157547652, -0.30752892817857613, 0.05210013501826725, -0.26107139911058297, -0.15084314271764948, 0.17895635852906341, -0.03434057141987419, 0.005224100203005546, 0.0200168217122213, 0.09010807366682849, -0.05382673830112203, -0.29333485954509486, 0.3415217183171472, 0.06143961872461192, 0.20771149803944136, -0.010572284460067749, 0.029620754042290014, -0.09303708284785715, 0.0009092246011378021, -0.0020176255135634625, -0.21144171552381472, 0.033461438592335364, 0.1481015367510594, 0.14085825615553954, 0.19186184244281654, -0.3818373956691918, -0.2753506804893323, 0.18800475660694438, 0.10509306496786756, 0.13541614829237922, -0.012937373528283714, -0.21279880127425246, 0.05713524901371667, -0.16469390859075506, -0.08390875861322114, -0.06795527774054523, 0.0010295984316019153, -0.03850302420483919, -0.3116091044647448, 0.11448674603475369, -0.026764042670154996, -0.0017844401983492966, -0.09007967720149991, -0.12984862991976082, -0.07038455911049056, -0.01753956649384094, 0.17317933800476476, 0.004620942161119449, 0.0948748322750587, -0.2329030988156932, -0.05370114066044228, 0.37658151957727626, -0.17886331678291253, -0.16419759001839188, 0.13076711642137223, -0.13333291794256727, -0.16314478174552594, 0.045441912899409, 0.08332043119766024, 0.12117387657694587, -0.10003088920061058, 0.18253306234404956, 0.021472398727841742, 0.17298954891878257, 0.07431002684928682, 0.0050784878372941, 0.2546642901281903, 0.09601602393176852, 0.022525311310972095, 0.14706106953709513, -0.03991533280350268, -0.1322502552648075, -0.3626821414319747, -0.08801701281288075, -0.10891685357163532, 0.058072390906307676, -0.19596196178303082, -0.17402318533437344, 0.43830922840658676, 0.169228476087708, 0.22757946700712137, 0.07207572429628889, 0.2557696637808593, 0.13059875586095754, 0.04312416362157519, 0.05692266233461918, 0.2901727292025056, 0.10805401027655451, 0.14433224901232286, -0.18176941231636484, -0.09020212848901475, 0.023336822269569842] |
1,802.09186 | Inflationary Cosmology, Diffeomorphism Group of the Line and Virasoro
Coadjoint Orbits | The cosmological field equations sourced by a self-interacting scalar field
are dynamically equivalent to a closed system of equations obtained by applying
the moment method to non-linear Schr\"odinger equations possessing an
underlying non-relativistic conformal $SL(2,\mathbb{R})$ symmetry. We consider
the one-dimensional, quintic Schr\"odinger equation relevant to strongly
repulsive, dilute Bose gases. The action of the diffeomorphism group on the
space of Schr\"odinger operators generates an harmonic trapping potential that
can be identified with the kinetic energy of the cosmological scalar field.
Inflationary cosmologies are represented by points on the orbit of the de
Sitter solution, which is the quotient manifold ${\rm
Diff}(\mathbb{R})/SL(2,\mathbb{R})$. Key roles are played by the Schwarzian
derivative of the diffeomorphism and the Ermakov-Pinney equation. The
underlying $SL(2,\mathbb{R})$ symmetry results in a first integral constraint
which ensures energy-momentum conservation. When the analysis is restricted to
the universal cover group of diffeomorphisms on the circle, the generation of a
rolling scalar field can be understood in terms of the Virasoro coadjoint
action. The corresponding symplectic two-form and Hamiltonian generator of the
coadjoint orbit are determined by the scalar field kinetic energy.
| hep-th astro-ph.CO gr-qc | the cosmological field equations sourced by a selfinteracting scalar field are dynamically equivalent to a closed system of equations obtained by applying the moment method to nonlinear schrodinger equations possessing an underlying nonrelativistic conformal sl2mathbbr symmetry we consider the onedimensional quintic schrodinger equation relevant to strongly repulsive dilute bose gases the action of the diffeomorphism group on the space of schrodinger operators generates an harmonic trapping potential that can be identified with the kinetic energy of the cosmological scalar field inflationary cosmologies are represented by points on the orbit of the de sitter solution which is the quotient manifold rm diffmathbbrsl2mathbbr key roles are played by the schwarzian derivative of the diffeomorphism and the ermakovpinney equation the underlying sl2mathbbr symmetry results in a first integral constraint which ensures energymomentum conservation when the analysis is restricted to the universal cover group of diffeomorphisms on the circle the generation of a rolling scalar field can be understood in terms of the virasoro coadjoint action the corresponding symplectic twoform and hamiltonian generator of the coadjoint orbit are determined by the scalar field kinetic energy | [['the', 'cosmological', 'field', 'equations', 'sourced', 'by', 'a', 'selfinteracting', 'scalar', 'field', 'are', 'dynamically', 'equivalent', 'to', 'a', 'closed', 'system', 'of', 'equations', 'obtained', 'by', 'applying', 'the', 'moment', 'method', 'to', 'nonlinear', 'schrodinger', 'equations', 'possessing', 'an', 'underlying', 'nonrelativistic', 'conformal', 'sl2mathbbr', 'symmetry', 'we', 'consider', 'the', 'onedimensional', 'quintic', 'schrodinger', 'equation', 'relevant', 'to', 'strongly', 'repulsive', 'dilute', 'bose', 'gases', 'the', 'action', 'of', 'the', 'diffeomorphism', 'group', 'on', 'the', 'space', 'of', 'schrodinger', 'operators', 'generates', 'an', 'harmonic', 'trapping', 'potential', 'that', 'can', 'be', 'identified', 'with', 'the', 'kinetic', 'energy', 'of', 'the', 'cosmological', 'scalar', 'field', 'inflationary', 'cosmologies', 'are', 'represented', 'by', 'points', 'on', 'the', 'orbit', 'of', 'the', 'de', 'sitter', 'solution', 'which', 'is', 'the', 'quotient', 'manifold', 'rm', 'diffmathbbrsl2mathbbr', 'key', 'roles', 'are', 'played', 'by', 'the', 'schwarzian', 'derivative', 'of', 'the', 'diffeomorphism', 'and', 'the', 'ermakovpinney', 'equation', 'the', 'underlying', 'sl2mathbbr', 'symmetry', 'results', 'in', 'a', 'first', 'integral', 'constraint', 'which', 'ensures', 'energymomentum', 'conservation', 'when', 'the', 'analysis', 'is', 'restricted', 'to', 'the', 'universal', 'cover', 'group', 'of', 'diffeomorphisms', 'on', 'the', 'circle', 'the', 'generation', 'of', 'a', 'rolling', 'scalar', 'field', 'can', 'be', 'understood', 'in', 'terms', 'of', 'the', 'virasoro', 'coadjoint', 'action', 'the', 'corresponding', 'symplectic', 'twoform', 'and', 'hamiltonian', 'generator', 'of', 'the', 'coadjoint', 'orbit', 'are', 'determined', 'by', 'the', 'scalar', 'field', 'kinetic', 'energy']] | [-0.22896416866634456, 0.1418526848786213, -0.08193834010809142, 0.056295209861774415, -0.12465204731625919, -0.1280938585754484, -0.10837097502048386, 0.2788097823659579, -0.2558801680596338, -0.2340907262922782, 0.07008029360505234, -0.26202876368641026, -0.11824205476376745, 0.15208143038875682, -0.019678314383296917, 0.05506575416721818, 0.031052744353655726, 0.10315395714844473, -0.08432727837029638, -0.25505371637926955, 0.41413735986376804, 0.021745660458691418, 0.2065825612284243, -4.577822983264923e-05, 0.15768077100316683, -0.013270443759392948, 0.03206893553853863, -0.00370274677681866, -0.1245376593913938, 0.08380102345512973, 0.17612514089689488, 0.028791637364257543, 0.195705549687975, -0.41285733047665824, -0.23787324561530518, 0.11077416346718867, 0.1438853338567747, 0.0939718526826861, -0.037963322227329226, -0.38481382973388667, 0.012835907192331636, -0.14213205511785215, -0.1981060310551483, -0.10383228443356024, 0.004099141328414488, -0.005706911821228762, -0.23655724211647694, 0.10846719425802197, 0.046100156102329495, 0.042604161876564225, -0.1416070676447513, -0.030935862980550156, -0.11873908877993623, 0.03696919541641061, 0.07734309445562151, 0.06513079694317032, 0.15319039593547737, -0.1358962718061068, -0.07828860881014002, 0.44650498386472465, -0.135880060465489, -0.28535044918454433, 0.07633859323751595, -0.13643466866213, -0.12212220926562117, 0.14295467673464374, 0.11846614317942618, 0.13006549447309226, -0.1590712248002496, 0.24655281400709, -0.02811702275907414, 0.09616663832485857, 0.07198185979699095, -0.018487516363772254, 0.2389817106398469, 0.07502552701625972, 0.08274237435931961, 0.0889988438394438, 0.03013377318339836, -0.16198412258591915, -0.38112511854204867, -0.14960030476666158, -0.17496870655288352, 0.13310628851629897, -0.14142711955727363, -0.16605223033111544, 0.4056685188707585, 0.07673261462566895, 0.12807045337330136, 0.031443891529165234, 0.21091671239377724, 0.2031907698437054, 0.06838139291891518, 0.058113485696311626, 0.2122189611662179, 0.21333363231581945, 0.049021117798596, -0.2921744977951878, -0.12974998080672878, 0.20066991681362398] |
1,802.09187 | Null-Controllability of Two Species Reaction-Diffusion System with
Nonlinear Coupling: A New Duality Method | We consider a $2\times2$ nonlinear reaction-diffusion system posed on a
smooth bounded domain$$\Omega$ of R N (N $\ge$ 1$). The control input is in the
source term of only one equation. It is localized in some arbitrary nonempty
open subset $\omega$ of the domain $\Omega$. First, we prove a global
null-controllability result when the coupling term in the second equation is an
odd power. As the linearized system around zero is not null-controllable, the
usual strategy consists in using the return method, introduced by Jean-Michel
Coron, or the method of power series expansions. In this paper, we give a
direct nonlinear proof, which relies on a new duality method that we call
Reflexive Uniqueness Method. It is a variation in reflexive Banach spaces of
the well-known Hilbert Uniqueness Method, introduced by Jacques-Louis Lions. It
is based on Carleman estimates in $L^p$ ($2 \leq p < \infty$) obtained from the
usual Carleman inequality in $L^2$ and parabolic regularity arguments. This
strategy enables us to find a control of the heat equation, which is an odd
power of a regular function. Another advantage of the method is to produce
small controls for small initial data. Secondly, thanks to the return method,
we also prove a null-controllability result for more general nonlinear
reaction-diffusion systems, where the coupling term in the second equation
behaves as an odd power at zero.
| math.AP | we consider a 2times2 nonlinear reactiondiffusion system posed on a smooth bounded domainomega of r n n ge 1 the control input is in the source term of only one equation it is localized in some arbitrary nonempty open subset omega of the domain omega first we prove a global nullcontrollability result when the coupling term in the second equation is an odd power as the linearized system around zero is not nullcontrollable the usual strategy consists in using the return method introduced by jeanmichel coron or the method of power series expansions in this paper we give a direct nonlinear proof which relies on a new duality method that we call reflexive uniqueness method it is a variation in reflexive banach spaces of the wellknown hilbert uniqueness method introduced by jacqueslouis lions it is based on carleman estimates in lp 2 leq p infty obtained from the usual carleman inequality in l2 and parabolic regularity arguments this strategy enables us to find a control of the heat equation which is an odd power of a regular function another advantage of the method is to produce small controls for small initial data secondly thanks to the return method we also prove a nullcontrollability result for more general nonlinear reactiondiffusion systems where the coupling term in the second equation behaves as an odd power at zero | [['we', 'consider', 'a', '2times2', 'nonlinear', 'reactiondiffusion', 'system', 'posed', 'on', 'a', 'smooth', 'bounded', 'domainomega', 'of', 'r', 'n', 'n', 'ge', '1', 'the', 'control', 'input', 'is', 'in', 'the', 'source', 'term', 'of', 'only', 'one', 'equation', 'it', 'is', 'localized', 'in', 'some', 'arbitrary', 'nonempty', 'open', 'subset', 'omega', 'of', 'the', 'domain', 'omega', 'first', 'we', 'prove', 'a', 'global', 'nullcontrollability', 'result', 'when', 'the', 'coupling', 'term', 'in', 'the', 'second', 'equation', 'is', 'an', 'odd', 'power', 'as', 'the', 'linearized', 'system', 'around', 'zero', 'is', 'not', 'nullcontrollable', 'the', 'usual', 'strategy', 'consists', 'in', 'using', 'the', 'return', 'method', 'introduced', 'by', 'jeanmichel', 'coron', 'or', 'the', 'method', 'of', 'power', 'series', 'expansions', 'in', 'this', 'paper', 'we', 'give', 'a', 'direct', 'nonlinear', 'proof', 'which', 'relies', 'on', 'a', 'new', 'duality', 'method', 'that', 'we', 'call', 'reflexive', 'uniqueness', 'method', 'it', 'is', 'a', 'variation', 'in', 'reflexive', 'banach', 'spaces', 'of', 'the', 'wellknown', 'hilbert', 'uniqueness', 'method', 'introduced', 'by', 'jacqueslouis', 'lions', 'it', 'is', 'based', 'on', 'carleman', 'estimates', 'in', 'lp', '2', 'leq', 'p', 'infty', 'obtained', 'from', 'the', 'usual', 'carleman', 'inequality', 'in', 'l2', 'and', 'parabolic', 'regularity', 'arguments', 'this', 'strategy', 'enables', 'us', 'to', 'find', 'a', 'control', 'of', 'the', 'heat', 'equation', 'which', 'is', 'an', 'odd', 'power', 'of', 'a', 'regular', 'function', 'another', 'advantage', 'of', 'the', 'method', 'is', 'to', 'produce', 'small', 'controls', 'for', 'small', 'initial', 'data', 'secondly', 'thanks', 'to', 'the', 'return', 'method', 'we', 'also', 'prove', 'a', 'nullcontrollability', 'result', 'for', 'more', 'general', 'nonlinear', 'reactiondiffusion', 'systems', 'where', 'the', 'coupling', 'term', 'in', 'the', 'second', 'equation', 'behaves', 'as', 'an', 'odd', 'power', 'at', 'zero']] | [-0.14096043058308877, 0.05545476474042516, -0.09548639505894647, 0.060240186885413195, -0.0967505604504711, -0.17993882434028718, 0.008861613936411838, 0.28608121846285134, -0.32024314103648066, -0.2251924846155776, 0.11255121292805093, -0.2782156689837575, -0.13862640856351288, 0.2084723804063267, -0.08750553679962952, 0.04427085548742778, 0.0367554395676901, 0.058340594563633205, -0.03624682045438223, -0.24635204397297153, 0.3568110683808724, -0.042702861457235286, 0.2234902900374598, 0.04364296545584997, 0.1311782478256565, 0.011799266901281144, 0.003907017554673884, -0.017184345397270387, -0.15620455927542126, 0.09808500509916081, 0.22146624483064645, 0.08287717993060748, 0.3503539052688413, -0.3776138776499364, -0.17683465513090293, 0.12044802450471455, 0.11596685932897445, 0.07197357973394294, -0.026071234408882447, -0.2574191200940145, 0.09745575412590471, -0.13818314083230993, -0.19173533383963837, -0.06581600751417378, 0.0357933765815364, 0.022322672406314976, -0.342743588981943, 0.09042317873578415, 0.13887692279699776, 0.03385145813640621, -0.1224303321310112, -0.0770896128963472, -0.012741886929919323, 0.05632519130763184, 0.0021831215985326302, 0.0532805877034035, 0.01900061972387549, -0.0659457645399703, -0.06922564183258348, 0.32494093670613233, -0.10208002252271399, -0.2678377193607998, 0.10947456635431282, -0.14687723087146878, -0.12043347668782291, 0.10718604038417753, 0.14388726573644414, 0.19206765726001726, -0.11514423536143215, 0.1665778250969015, -0.07874663943735262, 0.17128878607673365, 0.077874404547943, -0.0044695965477472375, 0.06263484805822372, 0.16755961815826595, 0.17203291822845737, 0.14412871525519425, -0.019751383057122842, -0.0564726491818308, -0.33768174893067526, -0.14363277200402486, -0.21311575495120552, 0.10696531842469185, -0.1035929323518778, -0.16545883254044585, 0.3505793873220682, 0.10227243792627834, 0.1665610473168393, 0.07443627488488952, 0.27099433671476114, 0.1654771860802753, 0.016783847289366854, 0.0780518775641556, 0.17723785593135594, 0.13605533564463257, 0.12412666802501512, -0.20436155863649522, 0.010656353158669338, 0.17191323942006825] |
1,802.09188 | Analysis of Langevin Monte Carlo via convex optimization | In this paper, we provide new insights on the Unadjusted Langevin Algorithm.
We show that this method can be formulated as a first order optimization
algorithm of an objective functional defined on the Wasserstein space of order
$2$. Using this interpretation and techniques borrowed from convex
optimization, we give a non-asymptotic analysis of this method to sample from
logconcave smooth target distribution on $\mathbb{R}^d$. Based on this
interpretation, we propose two new methods for sampling from a non-smooth
target distribution, which we analyze as well. Besides, these new algorithms
are natural extensions of the Stochastic Gradient Langevin Dynamics (SGLD)
algorithm, which is a popular extension of the Unadjusted Langevin Algorithm.
Similar to SGLD, they only rely on approximations of the gradient of the target
log density and can be used for large-scale Bayesian inference.
| stat.CO stat.ML | in this paper we provide new insights on the unadjusted langevin algorithm we show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the wasserstein space of order 2 using this interpretation and techniques borrowed from convex optimization we give a nonasymptotic analysis of this method to sample from logconcave smooth target distribution on mathbbrd based on this interpretation we propose two new methods for sampling from a nonsmooth target distribution which we analyze as well besides these new algorithms are natural extensions of the stochastic gradient langevin dynamics sgld algorithm which is a popular extension of the unadjusted langevin algorithm similar to sgld they only rely on approximations of the gradient of the target log density and can be used for largescale bayesian inference | [['in', 'this', 'paper', 'we', 'provide', 'new', 'insights', 'on', 'the', 'unadjusted', 'langevin', 'algorithm', 'we', 'show', 'that', 'this', 'method', 'can', 'be', 'formulated', 'as', 'a', 'first', 'order', 'optimization', 'algorithm', 'of', 'an', 'objective', 'functional', 'defined', 'on', 'the', 'wasserstein', 'space', 'of', 'order', '2', 'using', 'this', 'interpretation', 'and', 'techniques', 'borrowed', 'from', 'convex', 'optimization', 'we', 'give', 'a', 'nonasymptotic', 'analysis', 'of', 'this', 'method', 'to', 'sample', 'from', 'logconcave', 'smooth', 'target', 'distribution', 'on', 'mathbbrd', 'based', 'on', 'this', 'interpretation', 'we', 'propose', 'two', 'new', 'methods', 'for', 'sampling', 'from', 'a', 'nonsmooth', 'target', 'distribution', 'which', 'we', 'analyze', 'as', 'well', 'besides', 'these', 'new', 'algorithms', 'are', 'natural', 'extensions', 'of', 'the', 'stochastic', 'gradient', 'langevin', 'dynamics', 'sgld', 'algorithm', 'which', 'is', 'a', 'popular', 'extension', 'of', 'the', 'unadjusted', 'langevin', 'algorithm', 'similar', 'to', 'sgld', 'they', 'only', 'rely', 'on', 'approximations', 'of', 'the', 'gradient', 'of', 'the', 'target', 'log', 'density', 'and', 'can', 'be', 'used', 'for', 'largescale', 'bayesian', 'inference']] | [-0.0194549061316274, -0.017829531945228235, -0.1842364124204866, 0.11785246143048045, -0.08732756273820996, -0.11742998454580779, 0.043066538871203396, 0.4141720638805027, -0.2979839042857734, -0.31292482409904254, 0.10633498384989103, -0.2028261728722901, -0.21476478523004855, 0.210983308567318, -0.11593446651397189, 0.1063459510775978, 0.05252561434658606, 0.01373910149337842, -0.0845820660965253, -0.2598026968649964, 0.29645044606790616, 0.019000886591957575, 0.2547727492585806, 0.005815988840924493, 0.1617741548246009, 0.00285458225937588, -0.016168119236409886, 0.044617504690931904, -0.1464218631156641, 0.19515322696038787, 0.21855117676174962, 0.19609345326464234, 0.32979736254731223, -0.4080716343315856, -0.19955396895130068, 0.12305590595898858, 0.153136645513022, 0.1231408920330204, -0.05515771626873609, -0.29252196723289453, 0.058711776214498856, -0.12903028606687353, -0.057608515780016, -0.14962285679222934, -0.09322679975094385, 0.08302429725012894, -0.3158575150309436, 0.06981691078859757, 0.06469345197807859, 0.0305043641137265, -0.04695448395101103, -0.17258952618507084, 0.08349764737154622, 0.04441997016182364, 0.028622635674954794, 0.06745215843139744, 0.12440287038825501, -0.055035322367686275, -0.13474199701962408, 0.3418376041409462, -0.10799249142596025, -0.2554096185477145, 0.1852024541351138, -0.0610271266647684, -0.19125722588992108, 0.11686964065475917, 0.2796619051177777, 0.2149580006918578, -0.18685358475699132, 0.08437731613860285, -0.04348582635136711, 0.1178917285583135, 0.004504638035962386, -0.027459841899212394, 0.10292615724463405, 0.2048025319019138, 0.15624546612710205, 0.137909399236052, -0.09536365472968779, -0.151350370684722, -0.3153045368450346, -0.14786491909154706, -0.22217230116531475, 0.03528135165540891, -0.1277387592341636, -0.1742467688354872, 0.3602310283033094, 0.19345172413332917, 0.20396317446034457, 0.11711427479210908, 0.31920138435132467, 0.12813602458623086, -0.0055514434769527235, 0.10952574936603543, 0.14115273127064748, 0.11078136029250141, 0.0679380274204009, -0.1865770712437511, 0.08609738203943637, 0.10351753963067183] |
1,802.09189 | Language Distribution Prediction based on Batch Markov Monte Carlo
Simulation with Migration | Language spreading is a complex mechanism that involves issues like culture,
economics, migration, population etc. In this paper, we propose a set of
methods to model the dynamics of the spreading system. To model the randomness
of language spreading, we propose the Batch Markov Monte Carlo Simulation with
Migration(BMMCSM) algorithm, in which each agent is treated as a language
stack. The agent learns languages and migrates based on the proposed Batch
Markov Property according to the transition matrix T and migration matrix M.
Since population plays a crucial role in language spreading, we also introduce
the Mortality and Fertility Mechanism, which controls the birth and death of
the simulated agents, into the BMMCSM algorithm. The simulation results of
BMMCSM show that the numerical and geographic distribution of languages varies
across the time. The change of distribution fits the world cultural and
economic development trend. Next, when we construct Matrix T, there are some
entries of T can be directly calculated from historical statistics while some
entries of T is unknown. Thus, the key to the success of the BMMCSM lies in the
accurate estimation of transition matrix T by estimating the unknown entries of
T under the supervision of the known entries. To achieve this, we first
construct a 20 by 20 by 5 factor tensor X to characterize each entry of T. Then
we train a Random Forest Regressor on the known entries of T and use the
trained regressor to predict the unknown entries. The reason why we choose
Random Forest(RF) is that, compared to Single Decision Tree, it conquers the
problem of over fitting and the Shapiro test also suggests that the residual of
RF subjects to the Normal distribution.
| cs.CL | language spreading is a complex mechanism that involves issues like culture economics migration population etc in this paper we propose a set of methods to model the dynamics of the spreading system to model the randomness of language spreading we propose the batch markov monte carlo simulation with migrationbmmcsm algorithm in which each agent is treated as a language stack the agent learns languages and migrates based on the proposed batch markov property according to the transition matrix t and migration matrix m since population plays a crucial role in language spreading we also introduce the mortality and fertility mechanism which controls the birth and death of the simulated agents into the bmmcsm algorithm the simulation results of bmmcsm show that the numerical and geographic distribution of languages varies across the time the change of distribution fits the world cultural and economic development trend next when we construct matrix t there are some entries of t can be directly calculated from historical statistics while some entries of t is unknown thus the key to the success of the bmmcsm lies in the accurate estimation of transition matrix t by estimating the unknown entries of t under the supervision of the known entries to achieve this we first construct a 20 by 20 by 5 factor tensor x to characterize each entry of t then we train a random forest regressor on the known entries of t and use the trained regressor to predict the unknown entries the reason why we choose random forestrf is that compared to single decision tree it conquers the problem of over fitting and the shapiro test also suggests that the residual of rf subjects to the normal distribution | [['language', 'spreading', 'is', 'a', 'complex', 'mechanism', 'that', 'involves', 'issues', 'like', 'culture', 'economics', 'migration', 'population', 'etc', 'in', 'this', 'paper', 'we', 'propose', 'a', 'set', 'of', 'methods', 'to', 'model', 'the', 'dynamics', 'of', 'the', 'spreading', 'system', 'to', 'model', 'the', 'randomness', 'of', 'language', 'spreading', 'we', 'propose', 'the', 'batch', 'markov', 'monte', 'carlo', 'simulation', 'with', 'migrationbmmcsm', 'algorithm', 'in', 'which', 'each', 'agent', 'is', 'treated', 'as', 'a', 'language', 'stack', 'the', 'agent', 'learns', 'languages', 'and', 'migrates', 'based', 'on', 'the', 'proposed', 'batch', 'markov', 'property', 'according', 'to', 'the', 'transition', 'matrix', 't', 'and', 'migration', 'matrix', 'm', 'since', 'population', 'plays', 'a', 'crucial', 'role', 'in', 'language', 'spreading', 'we', 'also', 'introduce', 'the', 'mortality', 'and', 'fertility', 'mechanism', 'which', 'controls', 'the', 'birth', 'and', 'death', 'of', 'the', 'simulated', 'agents', 'into', 'the', 'bmmcsm', 'algorithm', 'the', 'simulation', 'results', 'of', 'bmmcsm', 'show', 'that', 'the', 'numerical', 'and', 'geographic', 'distribution', 'of', 'languages', 'varies', 'across', 'the', 'time', 'the', 'change', 'of', 'distribution', 'fits', 'the', 'world', 'cultural', 'and', 'economic', 'development', 'trend', 'next', 'when', 'we', 'construct', 'matrix', 't', 'there', 'are', 'some', 'entries', 'of', 't', 'can', 'be', 'directly', 'calculated', 'from', 'historical', 'statistics', 'while', 'some', 'entries', 'of', 't', 'is', 'unknown', 'thus', 'the', 'key', 'to', 'the', 'success', 'of', 'the', 'bmmcsm', 'lies', 'in', 'the', 'accurate', 'estimation', 'of', 'transition', 'matrix', 't', 'by', 'estimating', 'the', 'unknown', 'entries', 'of', 't', 'under', 'the', 'supervision', 'of', 'the', 'known', 'entries', 'to', 'achieve', 'this', 'we', 'first', 'construct', 'a', '20', 'by', '20', 'by', '5', 'factor', 'tensor', 'x', 'to', 'characterize', 'each', 'entry', 'of', 't', 'then', 'we', 'train', 'a', 'random', 'forest', 'regressor', 'on', 'the', 'known', 'entries', 'of', 't', 'and', 'use', 'the', 'trained', 'regressor', 'to', 'predict', 'the', 'unknown', 'entries', 'the', 'reason', 'why', 'we', 'choose', 'random', 'forestrf', 'is', 'that', 'compared', 'to', 'single', 'decision', 'tree', 'it', 'conquers', 'the', 'problem', 'of', 'over', 'fitting', 'and', 'the', 'shapiro', 'test', 'also', 'suggests', 'that', 'the', 'residual', 'of', 'rf', 'subjects', 'to', 'the', 'normal', 'distribution']] | [-0.07414390669565556, 0.10462477243773878, -0.050115482069658004, 0.0684666496971241, -0.07142460731842498, -0.14991369637995428, 0.09294978596702602, 0.3914678665507731, -0.3018372136423384, -0.2821713137089066, 0.0952097115047223, -0.26264876622401734, -0.17225185424765552, 0.12596822286511894, -0.07602769884801208, 0.03532509252700782, 0.05465582856706267, 0.07737722772246498, -0.03202819574195096, -0.2738220508523564, 0.3057701640639759, 0.043014371277742894, 0.2741634777458749, -0.021059787290517135, 0.14070803224477002, 0.009283525835278566, -0.042451628455245916, -0.029591307399308292, -0.10219020731682936, 0.10235102538407194, 0.25468018063629094, 0.20104576395393692, 0.31479471515585733, -0.3852907563882857, -0.18436643077570986, 0.11699930376545575, 0.13428092723235063, 0.0874889549294659, -0.009657172801874551, -0.2550811017991882, 0.07957405593325766, -0.1747136504308145, -0.0817003351962691, -0.039822199262572563, 0.025430061681249123, 0.00751342302212306, -0.3033565472004839, 0.05081708660640081, 0.0666100935201787, 0.0509693209730044, -0.0282611447316843, -0.13457556586966143, -0.004713625889901218, 0.1648079090792308, 0.06531510737292084, 0.040397272517347836, 0.16122270709935665, -0.11131833673759738, -0.12063929882419239, 0.35599457796039957, -0.07123826290779081, -0.17905649591860398, 0.15421877775815218, -0.1458569216563489, -0.13091386421633308, 0.09856539853232055, 0.19627972594603194, 0.0879440068447916, -0.15684644576250964, 0.061289339735640005, -0.053974716725272, 0.16778789811313577, 0.04226411913365815, -0.04549589405313558, 0.15529535466422298, 0.19533920241934097, 0.04778899248271809, 0.11833634277614802, -0.09461264213997858, -0.1139917513148468, -0.26432575996023905, -0.140647697484059, -0.19777861039827038, 0.038934247523506445, -0.11593089622877922, -0.17878154693734816, 0.39859402162152147, 0.21171838489362765, 0.21304978669419705, 0.10712072223222324, 0.2560223389178302, 0.07132717557637779, 0.060838931354485266, 0.09207695631104856, 0.1201631764649725, 0.10567691691428609, 0.1155715752877726, -0.21120405193953526, 0.17527987760594413, 0.04406842618502902] |
1,802.0919 | Generalized Burchnall-Type Identities for Orthogonal Polynomials and
Expansions | Burchnall's method to invert the Feldheim-Watson linearization formula for
the Hermite polynomials is extended to all polynomial families in the
Askey-scheme and its $q$-analogue. The resulting expansion formulas are made
explicit for several families corresponding to measures with infinite support,
including the Wilson and Askey-Wilson polynomials. An integrated version gives
the possibility to give alternate expression for orthogonal polynomials with
respect to a modified weight. This gives expansions for polynomials, such as
Hermite, Laguerre, Meixner, Charlier, Meixner-Pollaczek and big $q$-Jacobi
polynomials and big $q$-Laguerre polynomials. We show that one can find
expansions for the orthogonal polynomials corresponding to the
Toda-modification of the weight for the classical polynomials that correspond
to known explicit solutions for the Toda lattice, i.e., for Hermite, Laguerre,
Charlier, Meixner, Meixner-Pollaczek and Krawtchouk polynomials.
| math.CA | burchnalls method to invert the feldheimwatson linearization formula for the hermite polynomials is extended to all polynomial families in the askeyscheme and its qanalogue the resulting expansion formulas are made explicit for several families corresponding to measures with infinite support including the wilson and askeywilson polynomials an integrated version gives the possibility to give alternate expression for orthogonal polynomials with respect to a modified weight this gives expansions for polynomials such as hermite laguerre meixner charlier meixnerpollaczek and big qjacobi polynomials and big qlaguerre polynomials we show that one can find expansions for the orthogonal polynomials corresponding to the todamodification of the weight for the classical polynomials that correspond to known explicit solutions for the toda lattice ie for hermite laguerre charlier meixner meixnerpollaczek and krawtchouk polynomials | [['burchnalls', 'method', 'to', 'invert', 'the', 'feldheimwatson', 'linearization', 'formula', 'for', 'the', 'hermite', 'polynomials', 'is', 'extended', 'to', 'all', 'polynomial', 'families', 'in', 'the', 'askeyscheme', 'and', 'its', 'qanalogue', 'the', 'resulting', 'expansion', 'formulas', 'are', 'made', 'explicit', 'for', 'several', 'families', 'corresponding', 'to', 'measures', 'with', 'infinite', 'support', 'including', 'the', 'wilson', 'and', 'askeywilson', 'polynomials', 'an', 'integrated', 'version', 'gives', 'the', 'possibility', 'to', 'give', 'alternate', 'expression', 'for', 'orthogonal', 'polynomials', 'with', 'respect', 'to', 'a', 'modified', 'weight', 'this', 'gives', 'expansions', 'for', 'polynomials', 'such', 'as', 'hermite', 'laguerre', 'meixner', 'charlier', 'meixnerpollaczek', 'and', 'big', 'qjacobi', 'polynomials', 'and', 'big', 'qlaguerre', 'polynomials', 'we', 'show', 'that', 'one', 'can', 'find', 'expansions', 'for', 'the', 'orthogonal', 'polynomials', 'corresponding', 'to', 'the', 'todamodification', 'of', 'the', 'weight', 'for', 'the', 'classical', 'polynomials', 'that', 'correspond', 'to', 'known', 'explicit', 'solutions', 'for', 'the', 'toda', 'lattice', 'ie', 'for', 'hermite', 'laguerre', 'charlier', 'meixner', 'meixnerpollaczek', 'and', 'krawtchouk', 'polynomials']] | [-0.13367022144337815, 0.05919112173773277, -0.08328026885752596, 0.1000491794566774, -0.12432709160906773, -0.15315166950195788, -0.03339741610351109, 0.32837026801350855, -0.31869273085988337, -0.1387438665603235, 0.11794123204890639, -0.26873641254590647, -0.17429656068223617, 0.23054134076641453, -0.07185479168507417, 0.09680118037701299, 0.0050207040246365775, 0.037177243968471885, -0.16395421913118974, -0.29602852970034993, 0.3135449544286295, 0.03381841998892806, 0.1949223769592091, -0.043582761630175576, 0.11423223354523221, -0.0366752594671843, -0.03626122356452528, -0.1958395588895186, -0.12542122727574034, 0.1518003175733611, 0.2949260481813502, 0.12534687101405353, 0.19721413309866143, -0.33884659218752095, -0.04841278065671964, 0.19202332146514597, 0.2502689805677942, 0.0379244978351879, 0.017001284173719825, -0.23806442137086584, -0.017437081671349944, -0.1705937697815018, -0.28341175049483297, -0.1631496711145906, 0.01510858642793591, 0.1576045379192839, -0.37424466485578206, 0.06953168454610052, 0.05812007001405882, 0.09930518901185884, 0.009253745300567618, -0.24656191540341224, 0.06174120412869079, -0.00047484974962689225, -0.023202153465395132, -0.02820137154494953, -0.05444361087340381, -0.07490098893064104, -0.16405341784740168, 0.3724903628650692, -0.011686346354714085, -0.30668008069117225, 0.0684874510475164, -0.15821565605790144, -0.19755508591826523, 0.0923476283310705, 0.08472588671288724, 0.061489660567003154, -0.059494974140468386, 0.10184964962113995, -0.08607556185339607, 0.02199439862142167, 0.24956627727501215, 0.027593540711208217, 0.1294618713061115, -0.14479998078369985, -0.01254125212078854, 0.22684394481081155, 0.06492158170459011, -0.17051152778308717, -0.2658513402716527, -0.20451180237221472, -0.1738695567915021, 0.04902882141722066, -0.2322018653741848, -0.26294606419340255, 0.4133333066448329, 0.08790356604215284, 0.15883541320480646, 0.17068476533336985, 0.18051905872585672, 0.20771211026951805, 0.06839401556945016, 0.03479714579354491, 0.06871371471413201, 0.26500120518669007, 0.09473488189940972, -0.15863017120453501, -0.007557349417061965, 0.289319452536743] |
1,802.09191 | Polarization of seven MBM clouds at high galactic latitude | We made R-band polarization measurements of 234 stars towards the direction
of MBM 33-39 cloud complex. The distance of MBM 33-39 complex was determined as
$120\pm10$ pc using polarization results and near-infrared photometry from the
2MASS survey. The magnetic field geometry of the individual cloud inferred from
our polarimetric results reveals that the field lines are in general consistent
with the global magnetic field geometry of the region obtained from the
previous studies. This implies that the clouds in the complex are permeated by
the interstellar magnetic field. Multi-wavelength polarization measurements of
a few stars projected on the complex suggest that the size of the dust grains
in these clouds is similar to those found in the normal interstellar medium of
the Milky Way. We studied a possible formation scenario of MBM 33-39 complex by
combining the polarization results from our study and from the literature and
by identifying the distribution of ionized, atomic and molecular (dust)
components of material in the region.
| astro-ph.GA astro-ph.SR | we made rband polarization measurements of 234 stars towards the direction of mbm 3339 cloud complex the distance of mbm 3339 complex was determined as 120pm10 pc using polarization results and nearinfrared photometry from the 2mass survey the magnetic field geometry of the individual cloud inferred from our polarimetric results reveals that the field lines are in general consistent with the global magnetic field geometry of the region obtained from the previous studies this implies that the clouds in the complex are permeated by the interstellar magnetic field multiwavelength polarization measurements of a few stars projected on the complex suggest that the size of the dust grains in these clouds is similar to those found in the normal interstellar medium of the milky way we studied a possible formation scenario of mbm 3339 complex by combining the polarization results from our study and from the literature and by identifying the distribution of ionized atomic and molecular dust components of material in the region | [['we', 'made', 'rband', 'polarization', 'measurements', 'of', '234', 'stars', 'towards', 'the', 'direction', 'of', 'mbm', '3339', 'cloud', 'complex', 'the', 'distance', 'of', 'mbm', '3339', 'complex', 'was', 'determined', 'as', '120pm10', 'pc', 'using', 'polarization', 'results', 'and', 'nearinfrared', 'photometry', 'from', 'the', '2mass', 'survey', 'the', 'magnetic', 'field', 'geometry', 'of', 'the', 'individual', 'cloud', 'inferred', 'from', 'our', 'polarimetric', 'results', 'reveals', 'that', 'the', 'field', 'lines', 'are', 'in', 'general', 'consistent', 'with', 'the', 'global', 'magnetic', 'field', 'geometry', 'of', 'the', 'region', 'obtained', 'from', 'the', 'previous', 'studies', 'this', 'implies', 'that', 'the', 'clouds', 'in', 'the', 'complex', 'are', 'permeated', 'by', 'the', 'interstellar', 'magnetic', 'field', 'multiwavelength', 'polarization', 'measurements', 'of', 'a', 'few', 'stars', 'projected', 'on', 'the', 'complex', 'suggest', 'that', 'the', 'size', 'of', 'the', 'dust', 'grains', 'in', 'these', 'clouds', 'is', 'similar', 'to', 'those', 'found', 'in', 'the', 'normal', 'interstellar', 'medium', 'of', 'the', 'milky', 'way', 'we', 'studied', 'a', 'possible', 'formation', 'scenario', 'of', 'mbm', '3339', 'complex', 'by', 'combining', 'the', 'polarization', 'results', 'from', 'our', 'study', 'and', 'from', 'the', 'literature', 'and', 'by', 'identifying', 'the', 'distribution', 'of', 'ionized', 'atomic', 'and', 'molecular', 'dust', 'components', 'of', 'material', 'in', 'the', 'region']] | [-0.09978233485908052, 0.07559881348128396, -0.05922201865663131, 0.009105283197843365, -0.04853999264607275, 0.004705674635867278, 0.04389830090013551, 0.4203322948772966, -0.2353051261757903, -0.32484399939795244, 0.04217607069136805, -0.25946786040371933, -0.08278980482668605, 0.20174668237989493, -0.009182766715122942, -0.025414165304858745, 0.024887838860812746, -0.07008462331694677, -0.012981189691884167, -0.2219427186380612, 0.3397173249481798, 0.055885851210742084, 0.19404950387269995, -0.021573577836848636, 0.054467368117148446, -0.0628589447501495, -0.10592846902529997, 0.04173526754257856, -0.127513017251692, 0.1351239263470986, 0.18028582407040866, 0.10781905239011035, 0.14977728531201495, -0.3952277759549978, -0.24524086510279663, 0.02281914747697028, 0.15967382513630538, 0.08036245679034403, -0.05182651930595001, -0.3094551616569659, 0.058178354755696486, -0.1016370563733357, -0.20259568691656085, 0.03974862901614634, 0.0234833009250715, 0.06992936202031733, -0.22329728784223582, 0.08646799478662649, 0.01876624645004164, 0.1358945600143749, -0.13110627584952722, -0.13459217101321153, -0.06111382817659803, 0.08315758970508605, 0.018942796212713015, 0.10409387756702433, 0.18181084119768692, -0.1635281552510684, -0.034623119655283696, 0.409019245631004, -0.07390024893368123, -0.033587939313427476, 0.19299261008653742, -0.2390749691619055, -0.13254804534400688, 0.1604134198730915, 0.1453813046078991, 0.14718376619764317, -0.1569585562194985, 0.04380845480431791, -0.08573591090985977, 0.15907648066633645, 0.03922857348749667, 0.05780524671412602, 0.27532121687293926, 0.09911569133170961, 0.02320837852487414, 0.13592548676756394, -0.2202268336129944, -0.09715308427248713, -0.23469474495271433, -0.1236144697788045, -0.16476015013320672, 0.07981824120621622, -0.15345871942886727, -0.08857509919821664, 0.35833790715364167, 0.1386032618386786, 0.22079392031760725, -0.021696021283091404, 0.32604403156689427, 0.03987471643694458, 0.09639717457545806, 0.10208588980287774, 0.3240889201435134, 0.18357385706334708, 0.12182065898288087, -0.21805480902261434, 0.07241866965548216, -0.034759465116363616] |
1,802.09192 | Convexity of the distance function to convex subsets of Riemannian
manifolds | A characterization of the proximal normal cone is obtained and a separation
theorem for convex subsets of Riemannian manifolds is established. Moreover,
the convexity of the distance function $d_S$ for a convex subset $S$ in the
cases where the boundary of $S$ contains a geodesic segment, the boundary of
$S$ is $C^2$ or the boundary of $S$ is not regular is discussed. Furthermore, a
nonsmooth version of positive semi-definiteness of Hessian of convex functions
on Riemannian manifolds is established.
| math.DG | a characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of riemannian manifolds is established moreover the convexity of the distance function d_s for a convex subset s in the cases where the boundary of s contains a geodesic segment the boundary of s is c2 or the boundary of s is not regular is discussed furthermore a nonsmooth version of positive semidefiniteness of hessian of convex functions on riemannian manifolds is established | [['a', 'characterization', 'of', 'the', 'proximal', 'normal', 'cone', 'is', 'obtained', 'and', 'a', 'separation', 'theorem', 'for', 'convex', 'subsets', 'of', 'riemannian', 'manifolds', 'is', 'established', 'moreover', 'the', 'convexity', 'of', 'the', 'distance', 'function', 'd_s', 'for', 'a', 'convex', 'subset', 's', 'in', 'the', 'cases', 'where', 'the', 'boundary', 'of', 's', 'contains', 'a', 'geodesic', 'segment', 'the', 'boundary', 'of', 's', 'is', 'c2', 'or', 'the', 'boundary', 'of', 's', 'is', 'not', 'regular', 'is', 'discussed', 'furthermore', 'a', 'nonsmooth', 'version', 'of', 'positive', 'semidefiniteness', 'of', 'hessian', 'of', 'convex', 'functions', 'on', 'riemannian', 'manifolds', 'is', 'established']] | [-0.19638298937602888, 0.04438457757314149, -0.07589886328677022, 0.08186486663733007, -0.07990672960995307, -0.17771282152543905, 0.011568787212990508, 0.334740549656032, -0.29155000273869197, -0.14467413223030257, 0.15751675040537752, -0.31569232653732165, -0.09150751985762787, 0.1826315303480465, -0.12874141166906192, 0.04982235438272923, 0.0751603036541256, 0.09436482098543003, -0.16798135203226836, -0.21884718377001677, 0.40962579912399943, -0.10524292643877524, 0.16590883742569934, 0.13756815032279002, 0.10878044892621191, -0.011375590227544308, 0.015486964525631334, 0.0805321779159696, -0.13534562178899215, 0.13982464880623582, 0.23112513206875587, 0.16405784781385638, 0.263869448859669, -0.3364179243769827, -0.18843022836490145, 0.1493254532872499, 0.0563917415676332, -0.04773345410446577, -0.012031728780498328, -0.26812596336195743, 0.11137680525455294, 0.004312841245267964, -0.17426824458297105, -0.019815903852540482, 0.06684586189427896, 0.016122121032315626, -0.3334053000847844, 0.06778245506501651, 0.11989581534238178, 0.06516320816583082, -0.0950796749867216, -0.14245454184239423, -0.07169295291569602, 0.03064475083853342, 0.024135976882439247, 0.13395813040883292, 0.10016915325445265, -0.019662870026025566, -0.06456135553484664, 0.3304566648918428, -0.02552379778574539, -0.3127079874725093, 0.13223907732864534, -0.15713824457901565, -0.0767211568412147, 0.1319118049703067, 0.14346381958243967, 0.24285770959774905, -0.1470123946289473, 0.20923569052158913, -0.10097780302785855, 0.06661647643092312, 0.09053015894008966, -0.031227008816845054, 0.09311877793479192, 0.14650403874442924, 0.22253364168219505, 0.1707444729967208, -0.05239610258442692, -0.05294731221032105, -0.3982304522083907, -0.19531427543091623, -0.26494599356245296, 0.1075770927040876, -0.15355317321104214, -0.24331411162886438, 0.3776225476301735, -0.07177144095089429, 0.1869176495348728, 0.11582957321329962, 0.2312740424789394, 0.0669868589744349, 0.024437230699283035, 0.10488767044646724, 0.18500635723430145, 0.20013633549885376, 0.016541123231047693, -0.18832739216829592, 0.044841296776327526, 0.1855499040470989] |
1,802.09193 | Fourier Multipliers on Anisotropic Mixed-Norm Spaces of Distributions | A new general Hormander type condition involving anisotropies and mixed norms
is introduced, and boundedness results for Fourier multi- pliers on anisotropic
Besov and Triebel-Lizorkin spaces of distributions with mixed Lebesgue norms
are obtained. As an application, the continuity of such operators is
established on mixed Sobolev and Lebesgue spaces too. Some lifting properties
and equivalent norms are obtained as well.
| math.FA | a new general hormander type condition involving anisotropies and mixed norms is introduced and boundedness results for fourier multi pliers on anisotropic besov and triebellizorkin spaces of distributions with mixed lebesgue norms are obtained as an application the continuity of such operators is established on mixed sobolev and lebesgue spaces too some lifting properties and equivalent norms are obtained as well | [['a', 'new', 'general', 'hormander', 'type', 'condition', 'involving', 'anisotropies', 'and', 'mixed', 'norms', 'is', 'introduced', 'and', 'boundedness', 'results', 'for', 'fourier', 'multi', 'pliers', 'on', 'anisotropic', 'besov', 'and', 'triebellizorkin', 'spaces', 'of', 'distributions', 'with', 'mixed', 'lebesgue', 'norms', 'are', 'obtained', 'as', 'an', 'application', 'the', 'continuity', 'of', 'such', 'operators', 'is', 'established', 'on', 'mixed', 'sobolev', 'and', 'lebesgue', 'spaces', 'too', 'some', 'lifting', 'properties', 'and', 'equivalent', 'norms', 'are', 'obtained', 'as', 'well']] | [-0.07467387186088523, 0.14045695886497775, -0.05201254304132012, 0.2165571800852958, -0.09227040376834815, -0.09511696973998772, -0.10015313829615956, 0.35989109060314833, -0.35192057029267804, -0.15122311211908696, 0.23150142419655792, -0.26186492697137304, -0.06506539102582658, 0.2365724232093599, -0.14479512033495504, 0.1256058154108583, 0.012154855169966573, -0.01367545150006648, -0.14981350530183218, -0.2648421061820671, 0.4957499455233089, -0.03921253948670919, 0.25174739911053023, 0.0302471380039561, 0.04823310472468128, -0.004105879230516367, -0.04367114992842811, -0.011809968496443795, -0.19549703222439915, 0.16906041336306904, 0.20974171994498275, 0.055037874743708824, 0.31059313204414285, -0.3620533659199222, -0.19844243706387207, 0.1705249599868157, 0.0855073830662448, -0.10903585276215291, -0.05989652371690532, -0.38036353165497544, 0.02677254586434755, -0.05229369274600119, -0.15687120337512528, -0.20078318457684066, -0.021521617198500355, 0.13300039909291464, -0.42306696495316065, 0.11165168021851388, 0.07559587161217007, 0.09486655616125123, -0.2676030662231392, -0.18360049634614622, -0.006791818799206712, 0.04916778794627209, 0.005515849576560689, 0.01691153162296434, 0.02804781937757965, -0.018458917034698315, -0.10290061759945678, 0.3302741016978856, -0.0741020344564172, -0.2918821289280399, 0.16221189211870804, -0.11608639999185918, -0.12900455180005949, 0.001282705314701698, 0.11243406947335748, 0.15767751255484877, -0.06492509140220822, 0.15792176723919168, -0.04504897381698132, 0.07358679344847066, 0.13015119555849033, 0.1837083207659011, -0.011081824701309938, 0.07239394157086729, 0.1943522747453363, 0.12773853727066736, 0.0018802414205474933, -0.09386390837512483, -0.3610869143463549, -0.1626383871847733, -0.19364304872626653, 0.0704767220638326, -0.15384631115274283, -0.22204423043113508, 0.2906901047652832, 0.011310702132549687, 0.12910509625541383, 0.118240676423321, 0.1652436053235328, 0.10494086726904527, 0.04078862834416452, 0.009981548963267296, 0.17247838743239047, 0.2475044977408452, 0.17108001239353515, -0.0816314312033966, 0.058029075260045096, 0.22105855513822104] |
1,802.09194 | Deep Feed-forward Sequential Memory Networks for Speech Synthesis | The Bidirectional LSTM (BLSTM) RNN based speech synthesis system is among the
best parametric Text-to-Speech (TTS) systems in terms of the naturalness of
generated speech, especially the naturalness in prosody. However, the model
complexity and inference cost of BLSTM prevents its usage in many runtime
applications. Meanwhile, Deep Feed-forward Sequential Memory Networks (DFSMN)
has shown its consistent out-performance over BLSTM in both word error rate
(WER) and the runtime computation cost in speech recognition tasks. Since
speech synthesis also requires to model long-term dependencies compared to
speech recognition, in this paper, we investigate the Deep-FSMN (DFSMN) in
speech synthesis. Both objective and subjective experiments show that, compared
with BLSTM TTS method, the DFSMN system can generate synthesized speech with
comparable speech quality while drastically reduce model complexity and speech
generation time.
| cs.CL | the bidirectional lstm blstm rnn based speech synthesis system is among the best parametric texttospeech tts systems in terms of the naturalness of generated speech especially the naturalness in prosody however the model complexity and inference cost of blstm prevents its usage in many runtime applications meanwhile deep feedforward sequential memory networks dfsmn has shown its consistent outperformance over blstm in both word error rate wer and the runtime computation cost in speech recognition tasks since speech synthesis also requires to model longterm dependencies compared to speech recognition in this paper we investigate the deepfsmn dfsmn in speech synthesis both objective and subjective experiments show that compared with blstm tts method the dfsmn system can generate synthesized speech with comparable speech quality while drastically reduce model complexity and speech generation time | [['the', 'bidirectional', 'lstm', 'blstm', 'rnn', 'based', 'speech', 'synthesis', 'system', 'is', 'among', 'the', 'best', 'parametric', 'texttospeech', 'tts', 'systems', 'in', 'terms', 'of', 'the', 'naturalness', 'of', 'generated', 'speech', 'especially', 'the', 'naturalness', 'in', 'prosody', 'however', 'the', 'model', 'complexity', 'and', 'inference', 'cost', 'of', 'blstm', 'prevents', 'its', 'usage', 'in', 'many', 'runtime', 'applications', 'meanwhile', 'deep', 'feedforward', 'sequential', 'memory', 'networks', 'dfsmn', 'has', 'shown', 'its', 'consistent', 'outperformance', 'over', 'blstm', 'in', 'both', 'word', 'error', 'rate', 'wer', 'and', 'the', 'runtime', 'computation', 'cost', 'in', 'speech', 'recognition', 'tasks', 'since', 'speech', 'synthesis', 'also', 'requires', 'to', 'model', 'longterm', 'dependencies', 'compared', 'to', 'speech', 'recognition', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'deepfsmn', 'dfsmn', 'in', 'speech', 'synthesis', 'both', 'objective', 'and', 'subjective', 'experiments', 'show', 'that', 'compared', 'with', 'blstm', 'tts', 'method', 'the', 'dfsmn', 'system', 'can', 'generate', 'synthesized', 'speech', 'with', 'comparable', 'speech', 'quality', 'while', 'drastically', 'reduce', 'model', 'complexity', 'and', 'speech', 'generation', 'time']] | [-0.05436671585596811, -0.014158721884282736, -0.001202350059667459, 0.06327433222904802, -0.08211883526617804, -0.20271965357376479, 0.039797252075424276, 0.48393628140195055, -0.2835971024603798, -0.3228394348340001, 0.06005237616974717, -0.2546611266353956, -0.1997655155387922, 0.22968330319720107, -0.194754070050504, 0.16757047140809636, 0.17478038196523601, 0.09650166628237528, -0.0430043501201838, -0.3102943213369984, 0.15583924642370012, 0.05547124780513024, 0.3994112319133889, -0.019533828717584793, 0.12473653970698181, -0.08148752529030809, -0.0027272660070313858, -0.1488460725459915, 0.0474132235983024, 0.14071422097488093, 0.33363391691818833, 0.22715799872978376, 0.3045037747898067, -0.4067091811233415, -0.2386720300831187, 0.09707443576234465, 0.16079474976823593, 0.0989890929365244, -0.0393159424742827, -0.3628754431883303, 0.11307253503025724, -0.21263198177688397, 0.18680134269458135, -0.10166801540360142, -0.004927972575219778, -0.03213949319727432, -0.2676334703484407, 0.04885783155354707, 0.1509081856813282, 0.1093512719998566, -0.0838300973839628, -0.1260007057392683, -0.00860505856287021, 0.15963475147190576, 0.09777423631525241, 0.07522790386305692, 0.1241166494818082, -0.24209166763019033, -0.17392414258792996, 0.3934774588215917, -0.1576767152426048, -0.20899143983753254, 0.21126368752358338, 0.002980381203815341, -0.1369007629987139, 0.10361528299533977, 0.27062608070241717, 0.053760616244891514, -0.19619096024678304, 0.05023918165825307, 0.055022907787217544, 0.33155800064739127, 0.10047695137237987, 0.052148368249002555, 0.12551145039212244, 0.328703686298104, -0.06749133273574094, 0.18601735094203972, -0.10521946148946881, -0.06179572607104022, -0.14174331413725247, -0.09544071818773563, -0.16552484054834796, -0.06068337871334874, -0.11065443759882608, -0.12330014678501847, 0.4156205579925042, 0.26412318060532786, 0.1322824020189448, 0.24894623377252945, 0.35695852028349273, 0.06942848085354154, 0.14466699527290006, 0.06726532048689059, 0.16514534694679942, -0.014422819494771269, 0.17661171238600779, -0.27149296016432345, 0.17098974058977687, 0.037683177434910946] |
1,802.09195 | An exponential diophantine equation related to odd perfect numbers | We shall show that, for any given primes $\ell\geq 17$ and $p, q\equiv
1\pmod{\ell}$, the diophantine equation $(x^\ell-1)/(x-1)=p^m q$ has at most
four positive integral solutions $(x, m)$ and give its application to odd
perfect number problem.
| math.NT | we shall show that for any given primes ellgeq 17 and p qequiv 1pmodell the diophantine equation xell1x1pm q has at most four positive integral solutions x m and give its application to odd perfect number problem | [['we', 'shall', 'show', 'that', 'for', 'any', 'given', 'primes', 'ellgeq', '17', 'and', 'p', 'qequiv', '1pmodell', 'the', 'diophantine', 'equation', 'xell1x1pm', 'q', 'has', 'at', 'most', 'four', 'positive', 'integral', 'solutions', 'x', 'm', 'and', 'give', 'its', 'application', 'to', 'odd', 'perfect', 'number', 'problem']] | [-0.2867618463933468, 0.05676601694098541, -0.06573709274775215, 0.05423348833407674, -0.08838805835694075, -0.2312538640706667, 0.009226853320641177, 0.28844806370990617, -0.25922975645600155, -0.3071396557348115, 0.06282929297802704, -0.3569624057837895, -0.10756199629312115, 0.1786154141583081, -0.0363261131303651, 0.048998304178738704, 0.027925163454243115, 0.14887782618669526, -0.04833503061506365, -0.38832874771739756, 0.3306446169103895, -0.1494576090148517, 0.12379487937183252, 0.0509725223960621, 0.15620956396950142, 0.03093587729547705, 0.0805645632690617, -0.03134927812165448, -0.2305284739083228, 0.016348930378444492, 0.3399636590055057, 0.13156037868133613, 0.2744201793202332, -0.3531869313014405, -0.11224711908559715, 0.23694060408909406, 0.15985538412683775, -0.016709500950362, -0.03361817899027041, -0.13395588637462685, 0.2328005884108799, -0.12760604710451195, -0.19678436536341906, -0.057124585418828894, 0.19063918611833028, 0.001944524621857064, -0.317542072438768, 0.004441570357552597, 0.11456670801022223, 0.07840907608291932, -0.09160077989633594, -0.27237563923533475, 0.04615518438762852, 0.03280478400577392, 0.01938255445233413, 0.0624146737125037, -0.027845873084983656, -0.06190369783767632, -0.09893976801208088, 0.33561099033270564, -0.04525411975170885, -0.23035010071471335, 0.08552055132708379, -0.20860952404992922, -0.16726409470928566, 0.17068534695676396, 0.046514424242611443, 0.1408477220817336, 0.040273246222308705, 0.20579813047910908, -0.12482254036835262, 0.16207685523799487, 0.18362614052104098, -0.0204006272235087, 0.08587131655242826, -0.010386463467563901, 0.11508622897256698, 0.09457707506205354, -0.026434450703007834, 0.10720624629674214, -0.35119856595993043, -0.1537640891969204, -0.1683282477248992, 0.20617938627089774, -0.14818457627053638, -0.11508899799415044, 0.29361527072531834, 0.08571763480348246, 0.14936041172061648, 0.09942751856786865, 0.18324275793773787, 0.131915447222335, -0.07694260120125754, 0.1259241168536911, 0.06754836938011327, 0.15238031883324896, 0.04973936543932983, -0.1585245574957558, -0.055054887224520954, 0.12914156039644564] |
1,802.09196 | Advanced approach to the local structure reconstruction and theory
validation on the example of the W L$_3$-edge extended X-ray absorption fine
structure of tungsten | Atomistic simulations of the experimental W L$_3$-edge extended X-ray
absorption fine structure (EXAFS) of bcc tungsten at T = 300 K were performed
using classical molecular dynamics (MD) and reverse Monte Carlo (RMC) methods.
The MD-EXAFS method based on the results of MD simulations allowed us to access
the structural information, encoded in EXAFS, beyond the first coordination
shell and to validate the accuracy of two interaction potential models - the
embedded atom model potential and the second nearest-neighbor modified embedded
atom method potential. The RMC-EXAFS method was used for more elaborate
analysis of the EXAFS data giving access to thermal disorder effects. The
results of both methods suggest that the correlation in atomic motion in bcc
tungsten becomes negligible above 8 {\AA}. This fact allowed us to use the
EXAFS data to determine not only mean-square relative displacements of atomic
W-W pair motion but also mean-square displacements of individual tungsten
atoms, which are usually accessible from diffraction data only.
| cond-mat.mtrl-sci | atomistic simulations of the experimental w l_3edge extended xray absorption fine structure exafs of bcc tungsten at t 300 k were performed using classical molecular dynamics md and reverse monte carlo rmc methods the mdexafs method based on the results of md simulations allowed us to access the structural information encoded in exafs beyond the first coordination shell and to validate the accuracy of two interaction potential models the embedded atom model potential and the second nearestneighbor modified embedded atom method potential the rmcexafs method was used for more elaborate analysis of the exafs data giving access to thermal disorder effects the results of both methods suggest that the correlation in atomic motion in bcc tungsten becomes negligible above 8 aa this fact allowed us to use the exafs data to determine not only meansquare relative displacements of atomic ww pair motion but also meansquare displacements of individual tungsten atoms which are usually accessible from diffraction data only | [['atomistic', 'simulations', 'of', 'the', 'experimental', 'w', 'l_3edge', 'extended', 'xray', 'absorption', 'fine', 'structure', 'exafs', 'of', 'bcc', 'tungsten', 'at', 't', '300', 'k', 'were', 'performed', 'using', 'classical', 'molecular', 'dynamics', 'md', 'and', 'reverse', 'monte', 'carlo', 'rmc', 'methods', 'the', 'mdexafs', 'method', 'based', 'on', 'the', 'results', 'of', 'md', 'simulations', 'allowed', 'us', 'to', 'access', 'the', 'structural', 'information', 'encoded', 'in', 'exafs', 'beyond', 'the', 'first', 'coordination', 'shell', 'and', 'to', 'validate', 'the', 'accuracy', 'of', 'two', 'interaction', 'potential', 'models', 'the', 'embedded', 'atom', 'model', 'potential', 'and', 'the', 'second', 'nearestneighbor', 'modified', 'embedded', 'atom', 'method', 'potential', 'the', 'rmcexafs', 'method', 'was', 'used', 'for', 'more', 'elaborate', 'analysis', 'of', 'the', 'exafs', 'data', 'giving', 'access', 'to', 'thermal', 'disorder', 'effects', 'the', 'results', 'of', 'both', 'methods', 'suggest', 'that', 'the', 'correlation', 'in', 'atomic', 'motion', 'in', 'bcc', 'tungsten', 'becomes', 'negligible', 'above', '8', 'aa', 'this', 'fact', 'allowed', 'us', 'to', 'use', 'the', 'exafs', 'data', 'to', 'determine', 'not', 'only', 'meansquare', 'relative', 'displacements', 'of', 'atomic', 'ww', 'pair', 'motion', 'but', 'also', 'meansquare', 'displacements', 'of', 'individual', 'tungsten', 'atoms', 'which', 'are', 'usually', 'accessible', 'from', 'diffraction', 'data', 'only']] | [-0.033304631298867605, 0.08063395587631907, -0.060822272240423046, 0.060545067597652234, -0.03290470120144817, -0.1456212067307952, 0.09339047803018147, 0.4718230349811701, -0.2902979306005037, -0.3017453747467162, 0.01090685821001012, -0.33121015312962043, -0.06569860889636076, 0.12732625735225156, 0.10901090970191245, 0.0797400412042267, 0.08343825441746351, -0.026407450146507472, -0.07593105731752868, -0.23665229847821861, 0.22377797391546222, 0.1335270291982362, 0.27645384054630995, 0.06999434445960781, 0.02795682023264444, 0.038517125915043436, -0.026416910494355343, 0.03031124400336128, -0.16682733098539942, 0.12960821344630602, 0.2037075219722959, 0.009041718828927677, 0.21041585653214356, -0.46976500631381685, -0.2032143934391057, 0.030836847973450158, 0.1460906222420864, 0.13425651464524727, -0.025548273189764215, -0.27957736818382567, 0.060042293073284105, -0.12687089921606598, -0.11237845916109972, -0.10039537884623338, -0.03166299072715143, 0.025475408028190333, -0.26949561261221205, 0.08799470563621398, 0.01870748579513486, 0.09305293563729486, -0.09453147957668616, -0.12854612118098885, -0.05638025862236436, 0.08725146723326105, -0.021726875069315355, 0.03281775455793533, 0.18536330981311414, -0.04158813848297518, -0.11274598965694448, 0.41487886774568605, -0.04295779658684459, -0.12338048899068664, 0.20266323179776707, -0.17375115082466389, -0.12172246262586366, 0.22435857890508112, 0.12310125279831342, 0.10248803076907419, -0.17068653595253216, 0.07069963636063338, 0.018152399327402983, 0.24283723932995388, 0.07053173389778795, 0.014318413713063376, 0.12398294859434454, 0.15933582443484248, -0.010531219116483744, 0.11404132523920196, -0.20349249293138152, -0.11611753520675194, -0.25410254222328943, -0.1309087567959721, -0.20756463336053854, 0.01627786041512408, -0.10122384706436349, -0.15583799821205246, 0.3103894241130314, 0.17310306904591227, 0.1595434026691155, -0.04153888923853325, 0.28127623114433403, 0.0070611504622950004, 0.05956559983613447, 0.011298427014387413, 0.24010103249188083, 0.16615888555922234, 0.1018300817007772, -0.2804978478892829, 0.07490443972533402, 0.039064778289638266] |
1,802.09197 | AI4AI: Quantitative Methods for Classifying Host Species from Avian
Influenza DNA Sequence | Avian Influenza breakouts cause millions of dollars in damage each year
globally, especially in Asian countries such as China and South Korea. The
impact magnitude of a breakout directly correlates to time required to fully
understand the influenza virus, particularly the interspecies pathogenicity.
The procedure requires laboratory tests that require resources typically
lacking in a breakout emergency. In this study, we propose new quantitative
methods utilizing machine learning and deep learning to correctly classify host
species given raw DNA sequence data of the influenza virus, and provide
probabilities for each classification. The best deep learning models achieve
top-1 classification accuracy of 47%, and top-3 classification accuracy of 82%,
on a dataset of 11 host species classes.
| q-bio.QM cs.LG stat.ML | avian influenza breakouts cause millions of dollars in damage each year globally especially in asian countries such as china and south korea the impact magnitude of a breakout directly correlates to time required to fully understand the influenza virus particularly the interspecies pathogenicity the procedure requires laboratory tests that require resources typically lacking in a breakout emergency in this study we propose new quantitative methods utilizing machine learning and deep learning to correctly classify host species given raw dna sequence data of the influenza virus and provide probabilities for each classification the best deep learning models achieve top1 classification accuracy of 47 and top3 classification accuracy of 82 on a dataset of 11 host species classes | [['avian', 'influenza', 'breakouts', 'cause', 'millions', 'of', 'dollars', 'in', 'damage', 'each', 'year', 'globally', 'especially', 'in', 'asian', 'countries', 'such', 'as', 'china', 'and', 'south', 'korea', 'the', 'impact', 'magnitude', 'of', 'a', 'breakout', 'directly', 'correlates', 'to', 'time', 'required', 'to', 'fully', 'understand', 'the', 'influenza', 'virus', 'particularly', 'the', 'interspecies', 'pathogenicity', 'the', 'procedure', 'requires', 'laboratory', 'tests', 'that', 'require', 'resources', 'typically', 'lacking', 'in', 'a', 'breakout', 'emergency', 'in', 'this', 'study', 'we', 'propose', 'new', 'quantitative', 'methods', 'utilizing', 'machine', 'learning', 'and', 'deep', 'learning', 'to', 'correctly', 'classify', 'host', 'species', 'given', 'raw', 'dna', 'sequence', 'data', 'of', 'the', 'influenza', 'virus', 'and', 'provide', 'probabilities', 'for', 'each', 'classification', 'the', 'best', 'deep', 'learning', 'models', 'achieve', 'top1', 'classification', 'accuracy', 'of', '47', 'and', 'top3', 'classification', 'accuracy', 'of', '82', 'on', 'a', 'dataset', 'of', '11', 'host', 'species', 'classes']] | [-0.04252708632627438, 0.03237609888410902, -0.002136576776232185, 0.11777174627259855, -0.08160652441639003, -0.16355559837217604, 0.11013948181262721, 0.38565250460443823, -0.19459082911108172, -0.3483896129604044, 0.09602115787304777, -0.3094297380483677, -0.1504667923898147, 0.19663882503639266, -0.14318806543576948, 0.01948581733600365, 0.1553617251197936, 0.030516325627355276, 0.022773860941705262, -0.35800656359161026, 0.19918589013355686, 0.06830069120794711, 0.3415238984362704, 0.02024312461284792, 0.11598089753935145, -0.028197076130991577, -0.05215802600061328, -0.07916513201780617, -0.08765238070899896, 0.13349175595092297, 0.3759680935035217, 0.22111501067009723, 0.3360367336206074, -0.4166780292329475, -0.22270141727018072, 0.16695491935664403, 0.13425260154552485, 0.1161368456558758, 0.003939682169183125, -0.29803812743570046, 0.01951284618478204, -0.21890720692443147, -0.10309904764816848, -0.06409083749970486, 0.030909942246266996, 0.011422126731586418, -0.24416629008242283, 0.11481695582865384, -0.03199540373291178, 0.17799043265203462, -0.07055340276565403, -0.11225402365631328, -0.006543433895848435, 0.19468018309421967, 0.051840695391955044, 0.05878988021266133, 0.16884695458354365, -0.17175641186447044, -0.13377986278320694, 0.36087485857243684, -0.046339050025161324, -0.06993987061813924, 0.21028899379498084, -0.10478750207177404, -0.16934932900014624, 0.1382576191179647, 0.2724969209059431, 0.08341056989618288, -0.20456951250450622, -0.07831373614016197, 0.008340100324230975, 0.18715256369062538, 0.08247005467800873, -0.05549353399065098, 0.1921629987552698, 0.2780822830852763, 0.0030653352501946664, 0.049439655520535745, -0.19281463669051, -0.0506133206453624, -0.18334309969113433, -0.12667856336739877, -0.08575164194315157, 0.012062733507201332, -0.09098693244068899, -0.14971716551246636, 0.4204856031253163, 0.19271132417107484, 0.16386933819037572, 0.07627758737412635, 0.2704954323126003, -0.06509862293525406, 0.09182764214447475, 0.07805074726488313, 0.1998230321653958, 0.008748741804397312, 0.12936789601447124, -0.19486196869422265, 0.15302215901139224, 0.024800539305754776] |
1,802.09198 | Quantum spin ice with frustrated transverse exchange: from pi-flux phase
to nematic quantum spin liquid | Quantum spin ice materials, pyrochlore magnets with competing Ising and
transverse exchange interactions, have been widely discussed as candidates for
a quantum spin-liquid ground state. Here, motivated by quantum chemical
calculations for Pr pyrochlores, we present the results of a study for
frustrated transverse exchange. Using a combination of variational
calculations, exact diagonalisation, numerical linked-cluster and series
expansions, we find that the previously-studied U(1) quantum spin liquid, in
its pi-flux phase, transforms into a nematic quantum spin liquid at a
high-symmetry, SU(2) point.
| cond-mat.str-el | quantum spin ice materials pyrochlore magnets with competing ising and transverse exchange interactions have been widely discussed as candidates for a quantum spinliquid ground state here motivated by quantum chemical calculations for pr pyrochlores we present the results of a study for frustrated transverse exchange using a combination of variational calculations exact diagonalisation numerical linkedcluster and series expansions we find that the previouslystudied u1 quantum spin liquid in its piflux phase transforms into a nematic quantum spin liquid at a highsymmetry su2 point | [['quantum', 'spin', 'ice', 'materials', 'pyrochlore', 'magnets', 'with', 'competing', 'ising', 'and', 'transverse', 'exchange', 'interactions', 'have', 'been', 'widely', 'discussed', 'as', 'candidates', 'for', 'a', 'quantum', 'spinliquid', 'ground', 'state', 'here', 'motivated', 'by', 'quantum', 'chemical', 'calculations', 'for', 'pr', 'pyrochlores', 'we', 'present', 'the', 'results', 'of', 'a', 'study', 'for', 'frustrated', 'transverse', 'exchange', 'using', 'a', 'combination', 'of', 'variational', 'calculations', 'exact', 'diagonalisation', 'numerical', 'linkedcluster', 'and', 'series', 'expansions', 'we', 'find', 'that', 'the', 'previouslystudied', 'u1', 'quantum', 'spin', 'liquid', 'in', 'its', 'piflux', 'phase', 'transforms', 'into', 'a', 'nematic', 'quantum', 'spin', 'liquid', 'at', 'a', 'highsymmetry', 'su2', 'point']] | [-0.16835066261603104, 0.2694525542635336, -0.05328267038286473, 0.07233308440814894, -0.04268171947943159, -0.18455557638487544, 0.061330628351319624, 0.3780456849609513, -0.19896532589126467, -0.21466973024498986, 0.047542879665102136, -0.3530867382188339, -0.1323567003864481, 0.15645236997158232, 0.16966889350021438, 0.07484492223432108, -0.015898122957133384, -0.03569309059979327, -0.18148775786688798, -0.206995522356536, 0.1988283975206944, -0.02379556673037429, 0.27836444567473806, 0.05108923730384334, 0.12091995363336909, 0.0575883583311575, 0.17773049622100878, -0.005360892884074205, -0.22319604789444417, 0.026249855790421904, 0.2952630918736693, -0.1410355865197952, 0.13838937029197632, -0.4643503106143101, -0.22538747480251345, 0.022977950621932093, 0.12728228007095405, 0.23398889408233653, -0.11962470736534121, -0.31563450471239995, -0.0054197181352829355, -0.248004780627832, -0.12748976153074706, -0.23576790363673705, -0.07886727895946746, -0.009809404401899686, -0.23603854765021523, 0.1023091436532068, 0.042840729021545815, 0.1651009038602302, -0.05670567475825952, -0.1599297663757959, -0.031231454064429974, 0.01060275078739926, 0.042262174071272814, 0.06739926045614643, 0.1188108617080802, -0.13866744194381747, -0.2564034830184137, 0.38862032361373483, -0.003799240082412599, -0.15255818183601172, 0.1504729582748589, -0.12669086140013827, -0.17928427198610034, 0.12319780188242355, 0.09063018051800822, 0.06902031618428517, -0.12925323051770768, 0.12250296160977064, -0.03917226708123842, 0.1413861107020162, -0.061533138834792805, 0.0609960848274809, 0.3064403617642371, 0.1513471130550985, 0.003243627234261079, 0.1877636732786041, -0.12389064360836363, -0.24619194093238878, -0.22541561238018862, -0.22390831741139697, -0.3089605354176587, 0.09892149433964886, -0.07682874390304212, -0.1915241278348917, 0.3886802430118782, 0.10968430026669998, 0.09356242092887321, -0.0703587431505502, 0.21450680471866965, 0.034667916650636996, 0.00832632221618151, 0.013523707209794546, 0.22384779895753992, 0.2237397841183491, 0.06983616799452758, -0.2915190262411418, -0.0059256975999079555, 0.12020845878139946] |
1,802.09199 | Quantifier-free descriptions for quantifier solutions to interval linear
systems of relations | We study systems of relations of the form $Ax\,\sigma\,b$, where $\sigma$ is
a vector of binary relations with the components "$=$", "$\geq$" and "$\leq$",
and the parameters (elements of the matrix $A$ and right-hand side vector $b$)
can take values from prescribed intervals. What is considered to be the set of
its solutions depends on which logical quantifier is associated with each
interval-valued parameter and what is the order of the quantifier prefixes for
certain parameters. For solution sets that correspond to the quantifier prefix
of a general form, we present equivalent quantifier-free descriptions in the
classical interval arithmetic, in Kaucher complete interval arithmetic and in
the usual real arithmetic.
| math.OC | we study systems of relations of the form axsigmab where sigma is a vector of binary relations with the components geq and leq and the parameters elements of the matrix a and righthand side vector b can take values from prescribed intervals what is considered to be the set of its solutions depends on which logical quantifier is associated with each intervalvalued parameter and what is the order of the quantifier prefixes for certain parameters for solution sets that correspond to the quantifier prefix of a general form we present equivalent quantifierfree descriptions in the classical interval arithmetic in kaucher complete interval arithmetic and in the usual real arithmetic | [['we', 'study', 'systems', 'of', 'relations', 'of', 'the', 'form', 'axsigmab', 'where', 'sigma', 'is', 'a', 'vector', 'of', 'binary', 'relations', 'with', 'the', 'components', 'geq', 'and', 'leq', 'and', 'the', 'parameters', 'elements', 'of', 'the', 'matrix', 'a', 'and', 'righthand', 'side', 'vector', 'b', 'can', 'take', 'values', 'from', 'prescribed', 'intervals', 'what', 'is', 'considered', 'to', 'be', 'the', 'set', 'of', 'its', 'solutions', 'depends', 'on', 'which', 'logical', 'quantifier', 'is', 'associated', 'with', 'each', 'intervalvalued', 'parameter', 'and', 'what', 'is', 'the', 'order', 'of', 'the', 'quantifier', 'prefixes', 'for', 'certain', 'parameters', 'for', 'solution', 'sets', 'that', 'correspond', 'to', 'the', 'quantifier', 'prefix', 'of', 'a', 'general', 'form', 'we', 'present', 'equivalent', 'quantifierfree', 'descriptions', 'in', 'the', 'classical', 'interval', 'arithmetic', 'in', 'kaucher', 'complete', 'interval', 'arithmetic', 'and', 'in', 'the', 'usual', 'real', 'arithmetic']] | [-0.16330215250463964, 0.11629315987925663, -0.05157289305858523, 0.09012692604892861, -0.10415944746460452, -0.12639449325294416, 0.07784301635078111, 0.31660252959232466, -0.30885721978113473, -0.23411825890261156, 0.132151716904471, -0.29924245828666907, -0.0984129085092344, 0.17587295729693062, -0.05847020532552884, 0.05355765478901465, 0.020042423641953234, 0.14089580069548477, -0.09666200739192281, -0.24282164651917937, 0.3646694813184788, -0.07045595682983365, 0.18231857277531283, 0.006773303471784169, 0.13276263224570273, 0.011178063688947706, 0.002168669461089874, 0.03879233530644223, -0.1326238436945502, 0.13087524923443725, 0.2630577579218999, 0.19563254377604505, 0.23865622960936242, -0.39277619667455693, -0.12779932482185485, 0.1495723459417018, 0.10219918264546127, 0.058703648240879945, 0.07277305375797692, -0.2290934535476736, 0.129819390065881, -0.12654700549319386, -0.0803053324789714, -0.03794622591209258, 0.09885256829732489, 0.06284212231174738, -0.30350158394044524, 0.029740328709029148, 0.092322027658887, 0.09029191363359167, -0.05272336997130938, -0.12865457064842056, 0.03484572981327563, 0.10024238453098686, -0.0024941129409751604, 0.03911367958959923, 0.050798431356550655, -0.10835229093644107, -0.09945900171176991, 0.3866363124939326, -0.03997169402493251, -0.2709292126210215, 0.11140033148803583, -0.14566424295793626, -0.11640718683304492, 0.07305617395910287, 0.1355245497162567, 0.11758273135801063, -0.08497246920575048, 0.13832016843403733, -0.08860615324054923, 0.23336582188712102, 0.11026887919658046, 0.06694506380813649, 0.1772392236009658, 0.10309317867297714, 0.032703561385672986, 0.1354044764639949, -0.020914400891274665, -0.10872368623337178, -0.3674633126949596, -0.17044630280269363, -0.11779768790649338, 0.01722026333456563, -0.14768022080710938, -0.20410617358686628, 0.39094546154820337, 0.1233566183347699, 0.20297992546285423, 0.10487976615321518, 0.2534439335359591, 0.18142989586299463, 0.07937503297798004, 0.052751681680364586, 0.13156455615970575, 0.15839952715045869, 0.0026472545833823003, -0.16033849313802948, 0.09541732127229884, 0.10653987537555953] |
1,802.092 | On the local asymptotic stabilization of the nonlinear systems with
small time-varying perturbations by state-feedback control | In this paper, we are interested in the relation between the solutions of the
control system $\dot x=f(x,u)$ and the solutions of its (potentially unknown)
perturbation $\dot x=f(x,u)+w(x,t).$ Under the assumption that the linear part
of the unperturbed system at the point $(0,0)$ is controllable and that
disturbance $w(x,t)$ is asymptotically sufficiently small, there exists a
state-feedback controller of the form $u=-Kx$ such that the perturbed system
preserves the local asymptotic stability of the zero solution of unperturbed
system. The main result of this paper gives the sufficient conditions, more
specifically, the relations between the important parameters of the system, to
ensure this property and at the same time provides the method for calculating
the lower bound of region of attraction. Moreover, we obtain a nontrivial
extension of the classical result of H. K. Khalil regarding asymptotic behavior
of the (uncontrolled) perturbed systems whose nominal part is exponentially
asymptotically stable at the origin $x=0.$
| math.OC | in this paper we are interested in the relation between the solutions of the control system dot xfxu and the solutions of its potentially unknown perturbation dot xfxuwxt under the assumption that the linear part of the unperturbed system at the point 00 is controllable and that disturbance wxt is asymptotically sufficiently small there exists a statefeedback controller of the form ukx such that the perturbed system preserves the local asymptotic stability of the zero solution of unperturbed system the main result of this paper gives the sufficient conditions more specifically the relations between the important parameters of the system to ensure this property and at the same time provides the method for calculating the lower bound of region of attraction moreover we obtain a nontrivial extension of the classical result of h k khalil regarding asymptotic behavior of the uncontrolled perturbed systems whose nominal part is exponentially asymptotically stable at the origin x0 | [['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'the', 'relation', 'between', 'the', 'solutions', 'of', 'the', 'control', 'system', 'dot', 'xfxu', 'and', 'the', 'solutions', 'of', 'its', 'potentially', 'unknown', 'perturbation', 'dot', 'xfxuwxt', 'under', 'the', 'assumption', 'that', 'the', 'linear', 'part', 'of', 'the', 'unperturbed', 'system', 'at', 'the', 'point', '00', 'is', 'controllable', 'and', 'that', 'disturbance', 'wxt', 'is', 'asymptotically', 'sufficiently', 'small', 'there', 'exists', 'a', 'statefeedback', 'controller', 'of', 'the', 'form', 'ukx', 'such', 'that', 'the', 'perturbed', 'system', 'preserves', 'the', 'local', 'asymptotic', 'stability', 'of', 'the', 'zero', 'solution', 'of', 'unperturbed', 'system', 'the', 'main', 'result', 'of', 'this', 'paper', 'gives', 'the', 'sufficient', 'conditions', 'more', 'specifically', 'the', 'relations', 'between', 'the', 'important', 'parameters', 'of', 'the', 'system', 'to', 'ensure', 'this', 'property', 'and', 'at', 'the', 'same', 'time', 'provides', 'the', 'method', 'for', 'calculating', 'the', 'lower', 'bound', 'of', 'region', 'of', 'attraction', 'moreover', 'we', 'obtain', 'a', 'nontrivial', 'extension', 'of', 'the', 'classical', 'result', 'of', 'h', 'k', 'khalil', 'regarding', 'asymptotic', 'behavior', 'of', 'the', 'uncontrolled', 'perturbed', 'systems', 'whose', 'nominal', 'part', 'is', 'exponentially', 'asymptotically', 'stable', 'at', 'the', 'origin', 'x0']] | [-0.2032449734604023, 0.08201927990701638, -0.10724452908739056, 0.03513087679043805, 0.01698742675025163, -0.13451469750572487, 0.053376892977547344, 0.283733154732832, -0.2872384993334938, -0.2679758815609507, 0.13036225877294783, -0.27764325656646277, -0.1501112776367288, 0.1697165750114149, -0.045287498674473396, 0.0657966716309219, 0.04061826137292787, 0.08693894192937908, -0.06627739546207809, -0.2051350076952459, 0.35084137363714707, 0.036884963101903465, 0.241181921187825, 0.010426302193464883, 0.1203868881015009, -0.026090156547357572, 0.047806317219510674, -0.011388349034333308, -0.15797039540843558, 0.1001224074953873, 0.1981593855276802, 0.08672427999064032, 0.30059515534115855, -0.37512424722387405, -0.11741139895993431, 0.12346094160564366, 0.137566406603008, 0.08803128470715724, -0.03259597712483236, -0.2547403873544873, 0.14224092392128354, -0.1235259838285856, -0.2064287543211034, -0.020068509717882415, 0.03407304177955283, 0.015111234080426297, -0.29219245885063794, 0.07463878476348902, 0.147335925877805, 0.028286953616005025, -0.11084575664196898, -0.05655313694258343, -0.0372269903095194, 0.1585002828475186, 0.066757568781644, 0.003858776355627924, 0.08749746226423763, -0.11114880739937928, -0.006257335203515954, 0.34446706010126754, -0.07688617850669145, -0.20233444750805288, 0.1799972853041254, -0.18068974899544724, -0.09410106096765958, 0.12437392477601718, 0.13423743772651314, 0.1363145874715165, -0.14808130647840076, 0.15505378037318893, -0.05005651000446003, 0.15466691839212313, 0.05692186724167856, 0.07041129969844692, 0.15502020787588613, 0.14444899508625417, 0.1645727329627047, 0.1636251726059096, -0.024078822458824634, -0.10159597913795886, -0.35319516538813905, -0.13635232482958695, -0.1670979024523771, 0.038823247772310616, -0.1081902901376835, -0.19041642469452008, 0.38892150573941, 0.13816914699725058, 0.18037402842463435, 0.06570952811345801, 0.26877627162933715, 0.1745080869598161, -0.01135648847986503, 0.09184544190678648, 0.25429555763472117, 0.11931101771187969, 0.08600289595472675, -0.26089838557374223, 0.09879118650171317, 0.054066899505223295] |
1,802.09201 | Exciton diffusion in WSe2 monolayers embedded in a van der Waals
heterostructure | We have combined spatially-resolved steady-state micro-photoluminescence
($\mu$PL) with time-resolved photoluminescence (TRPL) to investigate the
exciton diffusion in a WSe$_2$ monolayer encapsulated with hexagonal boron
nitride (hBN). At 300 K, we extract an exciton diffusion length $L_X= 0.36\pm
0.02 \; \mu$m and an exciton diffusion coefficient of $D_X=14.5 \pm
2\;\mbox{cm}^2$/s. This represents a nearly 10-fold increase in the effective
mobility of excitons with respect to several previously reported values on
nonencapsulated samples. At cryogenic temperatures, the high optical quality of
these samples has allowed us to discriminate the diffusion of the different
exciton species : bright and dark neutral excitons, as well as charged
excitons. The longer lifetime of dark neutral excitons yields a larger
diffusion length of $L_{X^D}=1.5\pm 0.02 \;\mu$m.
| cond-mat.mes-hall cond-mat.mtrl-sci | we have combined spatiallyresolved steadystate microphotoluminescence mupl with timeresolved photoluminescence trpl to investigate the exciton diffusion in a wse_2 monolayer encapsulated with hexagonal boron nitride hbn at 300 k we extract an exciton diffusion length l_x 036pm 002 mum and an exciton diffusion coefficient of d_x145 pm 2mboxcm2s this represents a nearly 10fold increase in the effective mobility of excitons with respect to several previously reported values on nonencapsulated samples at cryogenic temperatures the high optical quality of these samples has allowed us to discriminate the diffusion of the different exciton species bright and dark neutral excitons as well as charged excitons the longer lifetime of dark neutral excitons yields a larger diffusion length of l_xd15pm 002 mum | [['we', 'have', 'combined', 'spatiallyresolved', 'steadystate', 'microphotoluminescence', 'mupl', 'with', 'timeresolved', 'photoluminescence', 'trpl', 'to', 'investigate', 'the', 'exciton', 'diffusion', 'in', 'a', 'wse_2', 'monolayer', 'encapsulated', 'with', 'hexagonal', 'boron', 'nitride', 'hbn', 'at', '300', 'k', 'we', 'extract', 'an', 'exciton', 'diffusion', 'length', 'l_x', '036pm', '002', 'mum', 'and', 'an', 'exciton', 'diffusion', 'coefficient', 'of', 'd_x145', 'pm', '2mboxcm2s', 'this', 'represents', 'a', 'nearly', '10fold', 'increase', 'in', 'the', 'effective', 'mobility', 'of', 'excitons', 'with', 'respect', 'to', 'several', 'previously', 'reported', 'values', 'on', 'nonencapsulated', 'samples', 'at', 'cryogenic', 'temperatures', 'the', 'high', 'optical', 'quality', 'of', 'these', 'samples', 'has', 'allowed', 'us', 'to', 'discriminate', 'the', 'diffusion', 'of', 'the', 'different', 'exciton', 'species', 'bright', 'and', 'dark', 'neutral', 'excitons', 'as', 'well', 'as', 'charged', 'excitons', 'the', 'longer', 'lifetime', 'of', 'dark', 'neutral', 'excitons', 'yields', 'a', 'larger', 'diffusion', 'length', 'of', 'l_xd15pm', '002', 'mum']] | [-0.06580491112342671, 0.20013172319791603, 0.008874492169074391, 0.012754009835138594, 0.040494903711521105, -0.18015646026267307, 0.0585245825127577, 0.48737931360045206, -0.21835047470648652, -0.3290526971367755, -0.06651035966047936, -0.3748581685125828, 0.019123832051358793, 0.16469396976146686, 0.07090593221516389, 0.02562422452243956, -0.01280922745556935, -0.10087260801355233, -0.0012112290355498377, -0.2032634556495949, 0.17780820739496014, 0.06967550420161822, 0.30690650310691286, 0.11914082963991424, 0.07624162098294145, -0.0368045214685085, 0.05764401025017318, -0.047278991706021456, -0.2671550640026512, 0.09702169267946611, 0.23005603529796328, -0.14460522946699159, 0.20443063289655938, -0.37971911048111706, -0.18649713908848556, 0.052689555206376575, 0.2119578336082075, 0.14272324665773498, -0.07342498271888041, -0.276038900791141, 0.05331446883349639, -0.11305006569575356, -0.06549289188064311, -0.009657150276167236, 0.038744241687590664, -0.034714871985108954, -0.23891035365345686, 0.18784337360690267, -0.06755829087316828, 0.0556782313723765, -0.1346460990405277, -0.1591606182805465, -0.07717462030401373, 0.03923754609068451, 0.023932578641435373, 0.0002684528494010801, 0.25803683770354835, -0.09644280356537227, -0.11050315036985052, 0.350740108837414, -0.17836365528080775, -0.036854710624269815, 0.19295938538144464, -0.19497267239443633, -0.009709661425617726, 0.25217551146836387, 0.11187617901874625, 0.1585996762333114, -0.1408215354495358, 0.012561128902977899, -0.050261313729393096, 0.2716340516248475, 0.11898743678896648, 0.16601425554431246, 0.25030566692028355, 0.2154073792307273, 0.031916257526482576, 0.09947280708457465, -0.18240333358838182, 0.007967876962831487, -0.13735429838390859, -0.22789959256010858, -0.1631924543124826, 0.1874713822470411, -0.11601120052105018, -0.16172421280821056, 0.38735209415950206, 0.09158852155897361, 0.2367141462376584, 0.018708302331683427, 0.24492526852485277, 0.09837636994400425, 0.09371000804088038, -0.03347075204162494, 0.2688036962695744, 0.18335098720094917, 0.1367995162555219, -0.2841231018406056, 0.03255401490580129, -0.0614079708557414] |
1,802.09202 | Simulation and Efficiency Studies of Optical Photon Transportation and
Detection with Plastic Antineutrino Detector Modules | In this work, the simulation of optical photons is carried out in an
antineutrino detector module consisting of a plastic scintillator connected to
light guides and photomultipliers on both ends, which is considered to be used
for remote reactor monitoring in the field of nuclear safety. Using Monte Carlo
(MC) based GEANT4 simulation, numerous parameters influencing the light
collection and thereby the energy resolution of the antineutrino detector
module are studied: e.g., degrees of scintillator surface roughness, reflector
type, and its ap- plying method onto scintillator and light guide surface, the
reflectivity of the reflector, light guide geometries and diameter of the
photocathode. The impact of each parameter is inves- tigated by looking at the
detected spectrum, i.e. the number photoelectrons per depositing energy. In
addition, the average light collection efficiency of the detector module and
its spatial variation are calculated for each simulation setup. According to
the simulation re- sults, it is found that photocathode size, light guide
shape, reflectivity of reflecting material and wrapping method show a
significant impact on the light collection efficiency while scin- tillator
surface polishing level and the choose of reflector type show relatively less
impact. This study demonstrates that these parameters are very important in the
design of plastic scintillator included antineutrino detectors to improve the
energy resolution efficiency.
| physics.ins-det hep-ex | in this work the simulation of optical photons is carried out in an antineutrino detector module consisting of a plastic scintillator connected to light guides and photomultipliers on both ends which is considered to be used for remote reactor monitoring in the field of nuclear safety using monte carlo mc based geant4 simulation numerous parameters influencing the light collection and thereby the energy resolution of the antineutrino detector module are studied eg degrees of scintillator surface roughness reflector type and its ap plying method onto scintillator and light guide surface the reflectivity of the reflector light guide geometries and diameter of the photocathode the impact of each parameter is inves tigated by looking at the detected spectrum ie the number photoelectrons per depositing energy in addition the average light collection efficiency of the detector module and its spatial variation are calculated for each simulation setup according to the simulation re sults it is found that photocathode size light guide shape reflectivity of reflecting material and wrapping method show a significant impact on the light collection efficiency while scin tillator surface polishing level and the choose of reflector type show relatively less impact this study demonstrates that these parameters are very important in the design of plastic scintillator included antineutrino detectors to improve the energy resolution efficiency | [['in', 'this', 'work', 'the', 'simulation', 'of', 'optical', 'photons', 'is', 'carried', 'out', 'in', 'an', 'antineutrino', 'detector', 'module', 'consisting', 'of', 'a', 'plastic', 'scintillator', 'connected', 'to', 'light', 'guides', 'and', 'photomultipliers', 'on', 'both', 'ends', 'which', 'is', 'considered', 'to', 'be', 'used', 'for', 'remote', 'reactor', 'monitoring', 'in', 'the', 'field', 'of', 'nuclear', 'safety', 'using', 'monte', 'carlo', 'mc', 'based', 'geant4', 'simulation', 'numerous', 'parameters', 'influencing', 'the', 'light', 'collection', 'and', 'thereby', 'the', 'energy', 'resolution', 'of', 'the', 'antineutrino', 'detector', 'module', 'are', 'studied', 'eg', 'degrees', 'of', 'scintillator', 'surface', 'roughness', 'reflector', 'type', 'and', 'its', 'ap', 'plying', 'method', 'onto', 'scintillator', 'and', 'light', 'guide', 'surface', 'the', 'reflectivity', 'of', 'the', 'reflector', 'light', 'guide', 'geometries', 'and', 'diameter', 'of', 'the', 'photocathode', 'the', 'impact', 'of', 'each', 'parameter', 'is', 'inves', 'tigated', 'by', 'looking', 'at', 'the', 'detected', 'spectrum', 'ie', 'the', 'number', 'photoelectrons', 'per', 'depositing', 'energy', 'in', 'addition', 'the', 'average', 'light', 'collection', 'efficiency', 'of', 'the', 'detector', 'module', 'and', 'its', 'spatial', 'variation', 'are', 'calculated', 'for', 'each', 'simulation', 'setup', 'according', 'to', 'the', 'simulation', 're', 'sults', 'it', 'is', 'found', 'that', 'photocathode', 'size', 'light', 'guide', 'shape', 'reflectivity', 'of', 'reflecting', 'material', 'and', 'wrapping', 'method', 'show', 'a', 'significant', 'impact', 'on', 'the', 'light', 'collection', 'efficiency', 'while', 'scin', 'tillator', 'surface', 'polishing', 'level', 'and', 'the', 'choose', 'of', 'reflector', 'type', 'show', 'relatively', 'less', 'impact', 'this', 'study', 'demonstrates', 'that', 'these', 'parameters', 'are', 'very', 'important', 'in', 'the', 'design', 'of', 'plastic', 'scintillator', 'included', 'antineutrino', 'detectors', 'to', 'improve', 'the', 'energy', 'resolution', 'efficiency']] | [-0.06971354089287478, 0.13112879203216898, -0.071902414887797, -0.0030539314749888904, -0.014067083549534166, -0.15372477218638672, 0.03419336638099319, 0.4160012031277252, -0.22447088723352482, -0.36323310116869073, 0.06695585247984719, -0.32175588040980835, -0.056276323347417424, 0.24748842874866758, -0.05950753088379929, 0.0623916998437909, 0.10637030666802338, -0.014510710628400016, -0.045794485409224275, -0.21382589129687743, 0.22386856010335301, 0.18097203416739005, 0.3089176817970394, 0.06340538067743182, 0.12364654414637317, 0.02637967234802281, -0.062468868139914646, -0.01289305801447183, -0.07658865873182062, 0.0798511449209696, 0.24924351078198226, 0.06771707783593948, 0.17032315459882105, -0.4370016163301676, -0.22663092811072116, 0.06415263156800498, 0.09657425463387775, 0.0019957798349042963, -0.07517674458429738, -0.25332011787199177, 0.06724052145254127, -0.16715757492063352, -0.1422211407142323, 0.018708133171610318, -0.039839035757210886, 0.06267146509611805, -0.20322236463774082, -0.03643907318108303, -0.020635162747660002, 0.056048638952441165, -0.028372873191526808, -0.13472885601330808, -0.034545620903372765, 0.08271909488884863, 0.038499500606274016, -0.007144091746006377, 0.20524345196913493, -0.12313906608885804, -0.016467082967201983, 0.3462232295902267, 0.009853767734670709, -0.17229950078871362, 0.12777751253289713, -0.161157044937271, -0.019894619511310444, 0.21828024495652942, 0.20523825462333598, 0.11861957451870102, -0.14647780953105105, 0.014594935107066534, 0.014923160051017306, 0.23129063113159393, 0.09342057364992798, 0.04202069646657206, 0.22413055212345234, 0.2782608000215056, 0.031817660036735064, 0.12527476623979245, -0.20010260918156006, -0.001970410554908043, -0.3121126946088923, -0.18094335606235057, -0.15301806774900056, 0.03529379295921603, -0.07006066213632653, -0.13223146557114845, 0.4086102946683071, 0.10973883048999448, 0.1250515481153893, -0.029396380327620306, 0.3098523154898092, 0.017669059489961975, 0.07507662168530704, 0.018538846049544422, 0.28078208829568657, 0.1265313629770305, 0.0996131028081182, -0.2690621358580714, 0.046127957662264275, 0.027870026879489074] |
1,802.09203 | Fusion and monodromy in the Temperley-Lieb category | Graham and Lehrer (1998) introduced a Temperley-Lieb category
$\mathsf{\widetilde{TL}}$ whose objects are the non-negative integers and the
morphisms in $\mathsf{Hom}(n,m)$ are the link diagrams from $n$ to $m$ nodes.
The Temperley-Lieb algebra $\mathsf{TL}_{n}$ is identified with
$\mathsf{Hom}(n,n)$. The category $\mathsf{\widetilde{TL}}$ is shown to be
monoidal. We show that it is also a braided category by constructing explicitly
a commutor. A twist is also defined on $\mathsf{\widetilde{TL}}$. We introduce
a module category ${\text{ Mod}_{\mathsf{\widetilde{TL}}}}$ whose objects are
functors from $\mathsf{\widetilde{TL}}$ to $\mathsf{Vect}_{\mathbb C}$ and
define on it a fusion bifunctor extending the one introduced by Read and Saleur
(2007). We use the natural morphisms constructed for $\mathsf{\widetilde{TL}}$
to induce the structure of a ribbon category on ${\text{
Mod}_{\mathsf{\widetilde{TL}}}}(\beta=-q-q^{-1})$, when $q$ is not a root of
unity. We discuss how the braiding on $\mathsf{\widetilde{TL}}$ and
integrability of statistical models are related. The extension of these
structures to the family of dilute Temperley-Lieb algebras is also discussed.
| math-ph math.CT math.MP | graham and lehrer 1998 introduced a temperleylieb category mathsfwidetildetl whose objects are the nonnegative integers and the morphisms in mathsfhomnm are the link diagrams from n to m nodes the temperleylieb algebra mathsftl_n is identified with mathsfhomnn the category mathsfwidetildetl is shown to be monoidal we show that it is also a braided category by constructing explicitly a commutor a twist is also defined on mathsfwidetildetl we introduce a module category text mod_mathsfwidetildetl whose objects are functors from mathsfwidetildetl to mathsfvect_mathbb c and define on it a fusion bifunctor extending the one introduced by read and saleur 2007 we use the natural morphisms constructed for mathsfwidetildetl to induce the structure of a ribbon category on text mod_mathsfwidetildetlbetaqq1 when q is not a root of unity we discuss how the braiding on mathsfwidetildetl and integrability of statistical models are related the extension of these structures to the family of dilute temperleylieb algebras is also discussed | [['graham', 'and', 'lehrer', '1998', 'introduced', 'a', 'temperleylieb', 'category', 'mathsfwidetildetl', 'whose', 'objects', 'are', 'the', 'nonnegative', 'integers', 'and', 'the', 'morphisms', 'in', 'mathsfhomnm', 'are', 'the', 'link', 'diagrams', 'from', 'n', 'to', 'm', 'nodes', 'the', 'temperleylieb', 'algebra', 'mathsftl_n', 'is', 'identified', 'with', 'mathsfhomnn', 'the', 'category', 'mathsfwidetildetl', 'is', 'shown', 'to', 'be', 'monoidal', 'we', 'show', 'that', 'it', 'is', 'also', 'a', 'braided', 'category', 'by', 'constructing', 'explicitly', 'a', 'commutor', 'a', 'twist', 'is', 'also', 'defined', 'on', 'mathsfwidetildetl', 'we', 'introduce', 'a', 'module', 'category', 'text', 'mod_mathsfwidetildetl', 'whose', 'objects', 'are', 'functors', 'from', 'mathsfwidetildetl', 'to', 'mathsfvect_mathbb', 'c', 'and', 'define', 'on', 'it', 'a', 'fusion', 'bifunctor', 'extending', 'the', 'one', 'introduced', 'by', 'read', 'and', 'saleur', '2007', 'we', 'use', 'the', 'natural', 'morphisms', 'constructed', 'for', 'mathsfwidetildetl', 'to', 'induce', 'the', 'structure', 'of', 'a', 'ribbon', 'category', 'on', 'text', 'mod_mathsfwidetildetlbetaqq1', 'when', 'q', 'is', 'not', 'a', 'root', 'of', 'unity', 'we', 'discuss', 'how', 'the', 'braiding', 'on', 'mathsfwidetildetl', 'and', 'integrability', 'of', 'statistical', 'models', 'are', 'related', 'the', 'extension', 'of', 'these', 'structures', 'to', 'the', 'family', 'of', 'dilute', 'temperleylieb', 'algebras', 'is', 'also', 'discussed']] | [-0.11657360768580072, 0.09512728987021009, -0.043425767557482994, 0.09404287652750093, -0.11180411716110554, -0.1462648472367417, -0.022735543206846655, 0.3878432967068765, -0.3686256044913058, -0.21701117915229484, 0.09661265696639558, -0.22869366998065438, -0.17041605201099794, 0.15863052917638132, -0.1754596490133046, -0.05358344339453084, 0.07127258434951081, 0.10478289658516246, -0.05251620706927106, -0.26038302012075415, 0.4038007551891692, 0.029536543062406797, 0.2345789871522344, 0.012520666527968126, 0.10194578014889219, -0.020999032959510767, -0.028208425968585398, 0.011177391998294817, -0.14326153721625412, 0.13947306372515933, 0.2712418183370311, 0.08395379897357033, 0.14963957387250817, -0.3099181544498209, -0.09098869184307104, 0.11330122647388219, 0.11357285764268381, 0.05463585438638076, 0.018804111138248703, -0.32914701151667825, 0.13504347777706666, -0.24102678871244793, -0.044686864763060774, -0.0695203238248125, 0.09594882324012934, 0.006792277269590421, -0.24013278153514014, -0.04702605352633095, 0.09903274002428723, 0.09450463295426695, -0.03777649293922438, -0.09586739450093083, -0.0710862437825675, 0.09388860243770307, -0.08353038399399026, 0.045486366560670156, 0.1280548277579798, -0.1074542336653443, -0.13926263081086424, 0.36114923753611583, -0.013962902650612112, -0.24677056932334332, 0.15414368199972098, -0.10493122560953434, -0.15830074665730431, 0.0847540754237331, 0.02950563411784652, 0.11316629125417879, -0.07976168873432739, 0.1786052343984847, -0.14455014274568115, 0.07831721564976736, 0.1078498271175179, -0.008937702514231205, 0.17389677422458694, 0.09536475879327713, -0.02252535549798768, 0.16611461154100854, -0.01624572603031993, -0.05194301595645738, -0.3102758286033301, -0.18273266086092332, -0.11575078047755731, 0.09237778687930898, -0.036809898645210004, -0.19455164944774145, 0.39150651884359, 0.14947471410761143, 0.22064298811433494, 0.11013993171775001, 0.17467900815157333, 0.06370488672998527, 0.12151082692552208, 0.04573312414741306, 0.12893841850052543, 0.2530214361902701, 0.028646722428138125, -0.0898339209969518, -0.007211170870273205, 0.21903839293123542] |
1,802.09204 | Signatures of surface Majorana modes in the magnetic response of
topological superconductors | We study the magnetic susceptibility of a two-dimensional cone of Majorana
modes localised at the surface of a three-dimensional time-reversal invariant
topological superconductor belonging to class DIII. A field parallel to the
surface tilts the surface Majorana cone along the supercurrent direction. For
fields larger than a critical threshold field $H^*$, $H>H^*$, a transition from
type I to type II Dirac cone occurs and a finite current carried by the
Majorana modes start to flow, leading to an additional diamagnetic contribution
to the surface magnetization. On a curved surface interband transitions are
promoted by the Majorana spin connection that couples to the external field,
giving rise to a finite frequency magnetic susceptibility.
| cond-mat.supr-con cond-mat.mes-hall | we study the magnetic susceptibility of a twodimensional cone of majorana modes localised at the surface of a threedimensional timereversal invariant topological superconductor belonging to class diii a field parallel to the surface tilts the surface majorana cone along the supercurrent direction for fields larger than a critical threshold field h hh a transition from type i to type ii dirac cone occurs and a finite current carried by the majorana modes start to flow leading to an additional diamagnetic contribution to the surface magnetization on a curved surface interband transitions are promoted by the majorana spin connection that couples to the external field giving rise to a finite frequency magnetic susceptibility | [['we', 'study', 'the', 'magnetic', 'susceptibility', 'of', 'a', 'twodimensional', 'cone', 'of', 'majorana', 'modes', 'localised', 'at', 'the', 'surface', 'of', 'a', 'threedimensional', 'timereversal', 'invariant', 'topological', 'superconductor', 'belonging', 'to', 'class', 'diii', 'a', 'field', 'parallel', 'to', 'the', 'surface', 'tilts', 'the', 'surface', 'majorana', 'cone', 'along', 'the', 'supercurrent', 'direction', 'for', 'fields', 'larger', 'than', 'a', 'critical', 'threshold', 'field', 'h', 'hh', 'a', 'transition', 'from', 'type', 'i', 'to', 'type', 'ii', 'dirac', 'cone', 'occurs', 'and', 'a', 'finite', 'current', 'carried', 'by', 'the', 'majorana', 'modes', 'start', 'to', 'flow', 'leading', 'to', 'an', 'additional', 'diamagnetic', 'contribution', 'to', 'the', 'surface', 'magnetization', 'on', 'a', 'curved', 'surface', 'interband', 'transitions', 'are', 'promoted', 'by', 'the', 'majorana', 'spin', 'connection', 'that', 'couples', 'to', 'the', 'external', 'field', 'giving', 'rise', 'to', 'a', 'finite', 'frequency', 'magnetic', 'susceptibility']] | [-0.24561641864212497, 0.27024350395692764, -0.021703626898150623, 0.03902686432203544, -0.1384432753548026, -0.1806358935843621, 0.07276181544875726, 0.33926872125760255, -0.2493433436279052, -0.24984741107826786, 0.0055677866933235365, -0.2748679215936655, -0.09204092071325119, 0.15498160224108556, 0.049455622940773276, -0.01630330687787916, -0.05861783722814705, 0.02961722237523645, -0.13861736388103704, -0.1772345244493668, 0.3570549911320476, -0.0337317401135806, 0.32594454142131973, 0.05212445034495821, 0.01468041428597644, -0.03279481215161338, 0.10088088760052674, 0.0581717975479218, -0.12320326170791825, 0.052211061986911646, 0.18684535387936713, -0.09937538185373082, 0.15610968270837994, -0.43741132501911906, -0.18989451405026816, 0.03568191032432618, 0.11973499719377807, 0.1445896931025865, -0.07493204933624449, -0.32689724529960323, 0.0719831520691514, -0.11203648047220278, -0.19005492618972702, -0.036777137130099745, -0.0006308892490259106, -0.1032537246127114, -0.2586777448720698, 0.07206300040758963, 0.07311526369656869, 0.10076645334317748, -0.04187808695132844, -0.07109502775295239, -0.12961343126620964, 0.041584049754809324, 0.08906531127701912, 0.09816607525863219, 0.14241939727799036, -0.15160391045251995, -0.10771539459736752, 0.32673974712504006, -0.10886429028388582, -0.1527045126256001, 0.18207424253341742, -0.1716512171260547, -0.01937364528255005, 0.2317069602265422, 0.16611322761413508, 0.11129415894590368, -0.09239549956795859, 0.09197527274903093, -0.004235447615168856, 0.09825094553941328, 0.022860876134862856, 0.022461165927649875, 0.31682558099938823, 0.1100552653952036, 0.1205042626534123, 0.1262204873533587, -0.14761313543879492, -0.03237565746738775, -0.33490999109510866, -0.22550368975082943, -0.20821510965885995, 0.0940998253032116, -0.007613885428327194, -0.22703609330346808, 0.4833134209662343, 0.09171885661947142, 0.181735307269264, -0.031067786231038293, 0.20366895099141402, 0.12377877065435834, 0.1043767352618618, 0.0631089583787668, 0.21826824836898595, 0.2379031982439171, 0.10339303635243725, -0.32451806958124507, -0.055780987650255805, 0.0824225216139374] |
1,802.09205 | Solving $k$-center Clustering (with Outliers) in MapReduce and
Streaming, almost as Accurately as Sequentially | Center-based clustering is a fundamental primitive for data analysis and
becomes very challenging for large datasets. In this paper, we focus on the
popular $k$-center variant which, given a set $S$ of points from some metric
space and a parameter $k<|S|$, requires to identify a subset of $k$ centers in
$S$ minimizing the maximum distance of any point of $S$ from its closest
center. A more general formulation, introduced to deal with noisy datasets,
features a further parameter $z$ and allows up to $z$ points of $S$ (outliers)
to be disregarded when computing the maximum distance from the centers. We
present coreset-based 2-round MapReduce algorithms for the above two
formulations of the problem, and a 1-pass Streaming algorithm for the case with
outliers. For any fixed $\epsilon>0$, the algorithms yield solutions whose
approximation ratios are a mere additive term $\epsilon$ away from those
achievable by the best known polynomial-time sequential algorithms, a result
that substantially improves upon the state of the art. Our algorithms are
rather simple and adapt to the intrinsic complexity of the dataset, captured by
the doubling dimension $D$ of the metric space. Specifically, our analysis
shows that the algorithms become very space-efficient for the important case of
small (constant) $D$. These theoretical results are complemented with a set of
experiments on real-world and synthetic datasets of up to over a billion
points, which show that our algorithms yield better quality solutions over the
state of the art while featuring excellent scalability, and that they also lend
themselves to sequential implementations much faster than existing ones.
| cs.DC cs.DS | centerbased clustering is a fundamental primitive for data analysis and becomes very challenging for large datasets in this paper we focus on the popular kcenter variant which given a set s of points from some metric space and a parameter ks requires to identify a subset of k centers in s minimizing the maximum distance of any point of s from its closest center a more general formulation introduced to deal with noisy datasets features a further parameter z and allows up to z points of s outliers to be disregarded when computing the maximum distance from the centers we present coresetbased 2round mapreduce algorithms for the above two formulations of the problem and a 1pass streaming algorithm for the case with outliers for any fixed epsilon0 the algorithms yield solutions whose approximation ratios are a mere additive term epsilon away from those achievable by the best known polynomialtime sequential algorithms a result that substantially improves upon the state of the art our algorithms are rather simple and adapt to the intrinsic complexity of the dataset captured by the doubling dimension d of the metric space specifically our analysis shows that the algorithms become very spaceefficient for the important case of small constant d these theoretical results are complemented with a set of experiments on realworld and synthetic datasets of up to over a billion points which show that our algorithms yield better quality solutions over the state of the art while featuring excellent scalability and that they also lend themselves to sequential implementations much faster than existing ones | [['centerbased', 'clustering', 'is', 'a', 'fundamental', 'primitive', 'for', 'data', 'analysis', 'and', 'becomes', 'very', 'challenging', 'for', 'large', 'datasets', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'popular', 'kcenter', 'variant', 'which', 'given', 'a', 'set', 's', 'of', 'points', 'from', 'some', 'metric', 'space', 'and', 'a', 'parameter', 'ks', 'requires', 'to', 'identify', 'a', 'subset', 'of', 'k', 'centers', 'in', 's', 'minimizing', 'the', 'maximum', 'distance', 'of', 'any', 'point', 'of', 's', 'from', 'its', 'closest', 'center', 'a', 'more', 'general', 'formulation', 'introduced', 'to', 'deal', 'with', 'noisy', 'datasets', 'features', 'a', 'further', 'parameter', 'z', 'and', 'allows', 'up', 'to', 'z', 'points', 'of', 's', 'outliers', 'to', 'be', 'disregarded', 'when', 'computing', 'the', 'maximum', 'distance', 'from', 'the', 'centers', 'we', 'present', 'coresetbased', '2round', 'mapreduce', 'algorithms', 'for', 'the', 'above', 'two', 'formulations', 'of', 'the', 'problem', 'and', 'a', '1pass', 'streaming', 'algorithm', 'for', 'the', 'case', 'with', 'outliers', 'for', 'any', 'fixed', 'epsilon0', 'the', 'algorithms', 'yield', 'solutions', 'whose', 'approximation', 'ratios', 'are', 'a', 'mere', 'additive', 'term', 'epsilon', 'away', 'from', 'those', 'achievable', 'by', 'the', 'best', 'known', 'polynomialtime', 'sequential', 'algorithms', 'a', 'result', 'that', 'substantially', 'improves', 'upon', 'the', 'state', 'of', 'the', 'art', 'our', 'algorithms', 'are', 'rather', 'simple', 'and', 'adapt', 'to', 'the', 'intrinsic', 'complexity', 'of', 'the', 'dataset', 'captured', 'by', 'the', 'doubling', 'dimension', 'd', 'of', 'the', 'metric', 'space', 'specifically', 'our', 'analysis', 'shows', 'that', 'the', 'algorithms', 'become', 'very', 'spaceefficient', 'for', 'the', 'important', 'case', 'of', 'small', 'constant', 'd', 'these', 'theoretical', 'results', 'are', 'complemented', 'with', 'a', 'set', 'of', 'experiments', 'on', 'realworld', 'and', 'synthetic', 'datasets', 'of', 'up', 'to', 'over', 'a', 'billion', 'points', 'which', 'show', 'that', 'our', 'algorithms', 'yield', 'better', 'quality', 'solutions', 'over', 'the', 'state', 'of', 'the', 'art', 'while', 'featuring', 'excellent', 'scalability', 'and', 'that', 'they', 'also', 'lend', 'themselves', 'to', 'sequential', 'implementations', 'much', 'faster', 'than', 'existing', 'ones']] | [-0.0997070017873946, 0.022552908669696926, -0.06721294497848357, 0.055609204400057496, -0.05968345596066687, -0.16120350217396343, 0.11089823210727007, 0.37060545885424817, -0.25674948346186216, -0.3259623285749762, 0.1051184393215608, -0.2911960932104889, -0.11462789369229241, 0.2409965818366719, -0.06486843100436118, 0.06533506854538874, 0.11266725536698338, 0.05045921922190309, -0.07981176540106319, -0.30674751325327054, 0.3016574223755956, 0.04118748239428524, 0.25930113457664705, -0.0024192449187277368, 0.08119066948705787, -0.02525237325262494, -0.0284530766097951, 0.06436203319815789, -0.10438665122651804, 0.1525050540473564, 0.24828515014104172, 0.17338836594829948, 0.2802047361696182, -0.36503859585992504, -0.18732645917633498, 0.1335731499471511, 0.13059547810157235, 0.10090200588686714, -0.022003613434236183, -0.2810222878764495, 0.1287997431044456, -0.10176750587687818, -0.07816135579482814, -0.0927867881039474, 0.039450959690835716, -0.000281211722985586, -0.28857320422687815, 0.05163197725295254, 0.06836569392343472, 0.01683354493173048, -0.03348407854391693, -0.17384477657433167, 0.03922269342945436, 0.09089720152189477, 0.04133620574334582, 0.08022498917221145, 0.08253826617360345, -0.12954367038930503, -0.13730102985005999, 0.39227339174979614, -0.054273496449641384, -0.18105857596871117, 0.21217165506870977, -0.08666916926208035, -0.1304980723805812, 0.14386585007446842, 0.18575840711802186, 0.15370001358925778, -0.09845065949674611, 0.10518978144879125, -0.05100083238225876, 0.17254412040156206, 0.05038952017041161, 0.027239371699948067, 0.12089622220110767, 0.1684593422325781, 0.12005890643720346, 0.12438068021799915, -0.06780015476565794, -0.08922806742482434, -0.2608797094743325, -0.11331943482640164, -0.1870287728359254, 0.014694946836257662, -0.15728137395970576, -0.16016284212808626, 0.365446268962013, 0.159889218521495, 0.24426912074606563, 0.09821647554941648, 0.31466162204652537, 0.04154509825249469, 0.06787134731335846, 0.14342480278699785, 0.1941652089735164, 0.05899839120661718, 0.06298103483580772, -0.17586632641742517, 0.057431970207869255, 0.04356859769949934] |
1,802.09206 | Tests of Gravitational Symmetries with Pulsar Binary J1713+0747 | Symmetries play an important role in modern theories of gravity. The strong
equivalence principle (SEP) constitutes a collection of gravitational
symmetries which are all implemented by general relativity. Alternative
theories, however, are generally expected to violate some aspects of SEP. We
test three aspects of SEP using observed change rates in the orbital period and
eccentricity of binary pulsar J1713+0747: 1. the gravitational constant's
constancy as part of locational invariance of gravitation; 2. the
post-Newtonian parameter $\hat{\alpha}_3$ in gravitational Lorentz invariance;
3. the universality of free fall (UFF) for strongly self-gravitating bodies.
Based on the pulsar timing result of the combined dataset from the North
American Nanohertz Gravitational Observatory (NANOGrav) and the European Pulsar
Timing Array (EPTA), we find $\dot{G}/G = (-0.1 \pm 0.9) \times 10^{-12}\,{\rm
yr}^{-1}$, which is weaker than Solar system limits, but applies for strongly
self-gravitating objects. Furthermore, we obtain the constraints $|\Delta|<
0.002$ for the UFF test and $-3\times10^{-20} < \hat{\alpha}_3 <
4\times10^{-20}$ at 95% confidence. These are the first direct UFF and
$\hat{\alpha}_3$ tests based on pulsar binaries, and they overcome various
limitations of previous tests.
| astro-ph.HE | symmetries play an important role in modern theories of gravity the strong equivalence principle sep constitutes a collection of gravitational symmetries which are all implemented by general relativity alternative theories however are generally expected to violate some aspects of sep we test three aspects of sep using observed change rates in the orbital period and eccentricity of binary pulsar j17130747 1 the gravitational constants constancy as part of locational invariance of gravitation 2 the postnewtonian parameter hatalpha_3 in gravitational lorentz invariance 3 the universality of free fall uff for strongly selfgravitating bodies based on the pulsar timing result of the combined dataset from the north american nanohertz gravitational observatory nanograv and the european pulsar timing array epta we find dotgg 01 pm 09 times 1012rm yr1 which is weaker than solar system limits but applies for strongly selfgravitating objects furthermore we obtain the constraints delta 0002 for the uff test and 3times1020 hatalpha_3 4times1020 at 95 confidence these are the first direct uff and hatalpha_3 tests based on pulsar binaries and they overcome various limitations of previous tests | [['symmetries', 'play', 'an', 'important', 'role', 'in', 'modern', 'theories', 'of', 'gravity', 'the', 'strong', 'equivalence', 'principle', 'sep', 'constitutes', 'a', 'collection', 'of', 'gravitational', 'symmetries', 'which', 'are', 'all', 'implemented', 'by', 'general', 'relativity', 'alternative', 'theories', 'however', 'are', 'generally', 'expected', 'to', 'violate', 'some', 'aspects', 'of', 'sep', 'we', 'test', 'three', 'aspects', 'of', 'sep', 'using', 'observed', 'change', 'rates', 'in', 'the', 'orbital', 'period', 'and', 'eccentricity', 'of', 'binary', 'pulsar', 'j17130747', '1', 'the', 'gravitational', 'constants', 'constancy', 'as', 'part', 'of', 'locational', 'invariance', 'of', 'gravitation', '2', 'the', 'postnewtonian', 'parameter', 'hatalpha_3', 'in', 'gravitational', 'lorentz', 'invariance', '3', 'the', 'universality', 'of', 'free', 'fall', 'uff', 'for', 'strongly', 'selfgravitating', 'bodies', 'based', 'on', 'the', 'pulsar', 'timing', 'result', 'of', 'the', 'combined', 'dataset', 'from', 'the', 'north', 'american', 'nanohertz', 'gravitational', 'observatory', 'nanograv', 'and', 'the', 'european', 'pulsar', 'timing', 'array', 'epta', 'we', 'find', 'dotgg', '01', 'pm', '09', 'times', '1012rm', 'yr1', 'which', 'is', 'weaker', 'than', 'solar', 'system', 'limits', 'but', 'applies', 'for', 'strongly', 'selfgravitating', 'objects', 'furthermore', 'we', 'obtain', 'the', 'constraints', 'delta', '0002', 'for', 'the', 'uff', 'test', 'and', '3times1020', 'hatalpha_3', '4times1020', 'at', '95', 'confidence', 'these', 'are', 'the', 'first', 'direct', 'uff', 'and', 'hatalpha_3', 'tests', 'based', 'on', 'pulsar', 'binaries', 'and', 'they', 'overcome', 'various', 'limitations', 'of', 'previous', 'tests']] | [-0.17072266070461584, 0.15517901923676156, -0.04102767409301642, 0.14604788190766768, -0.09754041768873563, -0.09980934562877157, 0.020379984188340815, 0.2931514801694301, -0.15541554376809188, -0.3505612543052704, 0.09601740221858635, -0.25327641440102944, -0.05896774314785913, 0.26454399693441594, -0.031746026281120075, 0.03410619112405147, 0.07623557935831911, -0.028897679675275744, -0.07126254825158923, -0.21752302929605122, 0.2324554275281959, 0.11413635158816636, 0.20117693329777497, -0.009087986183894725, 0.11705248176049846, -0.02217776247360717, -0.02318827221304899, -0.015269040127447939, -0.1391698718610309, 0.07672722100564358, 0.20115112728639217, 0.1666659493115073, 0.2050094952580577, -0.4044895259568752, -0.16947980127481502, 0.05267809472957068, 0.06809428403822253, 0.04735592030657003, 0.007801302591612363, -0.33615579205567786, 0.040803861724065436, -0.23853680323862003, -0.15017645324627726, 0.024247046002307853, 0.06667281106103864, 0.04040113485241993, -0.22949738994682745, 0.13052534869751015, 0.06345337389384285, 0.05838436218462674, -0.10440286595274373, -0.12659586301286532, 0.032007054017335806, 0.06102736482375675, 0.11531218045028084, 0.047377695874074255, 0.1307823908479758, -0.0833972990039294, -0.1330047042226145, 0.4540212343382454, -0.06385896148235408, -0.13154091108537747, 0.18840021131518112, -0.23089651059685537, -0.23619071459976462, 0.10509722777260835, 0.17274123536587935, 0.10589895412683656, -0.15889182400009674, 0.09884942691650841, 0.011862460068705897, 0.20643462248851602, 0.1264138707159729, 0.056030426618030114, 0.32462916910743056, 0.09095153608622482, 0.057686169517337016, 0.03826107383484684, -0.16465400163173718, -0.07228040938807578, -0.32417305357922604, -0.08605390394338022, -0.09827882602434647, 0.08079844911067778, -0.1423975223173699, -0.09641510555755786, 0.32543700833747025, 0.17001357839816372, 0.06198509637329538, 0.07765526607590544, 0.22283361152887848, 0.10414052186178643, 0.02060327104841672, 0.0723757593797804, 0.3697598631144172, 0.12346394116711398, 0.06418526137516029, -0.2028068656228104, 0.041719032961896246, 0.0687469456615821] |
1,802.09207 | Towards evaluating emergent behavior of the Internet of Things using
large scale simulation techniques | With the increase in Internet of Things devices and more decentralized
architectures we see a new type of application gain importance, a type where
local interactions between individual entities lead to a global emergent
behavior, Emergent-based IoT (EBI) Systems. In this position paper we explore
techniques to evaluate this emergent behavior in IoT applications. Because of
the required scale and diversity this is not an easy task. Therefore, we mainly
focus on a distributed simulation approach and provide an overview of possible
techniques that could optimize the overall simulation performance. Our focus is
both on modeling and simulation technology.
| cs.DC | with the increase in internet of things devices and more decentralized architectures we see a new type of application gain importance a type where local interactions between individual entities lead to a global emergent behavior emergentbased iot ebi systems in this position paper we explore techniques to evaluate this emergent behavior in iot applications because of the required scale and diversity this is not an easy task therefore we mainly focus on a distributed simulation approach and provide an overview of possible techniques that could optimize the overall simulation performance our focus is both on modeling and simulation technology | [['with', 'the', 'increase', 'in', 'internet', 'of', 'things', 'devices', 'and', 'more', 'decentralized', 'architectures', 'we', 'see', 'a', 'new', 'type', 'of', 'application', 'gain', 'importance', 'a', 'type', 'where', 'local', 'interactions', 'between', 'individual', 'entities', 'lead', 'to', 'a', 'global', 'emergent', 'behavior', 'emergentbased', 'iot', 'ebi', 'systems', 'in', 'this', 'position', 'paper', 'we', 'explore', 'techniques', 'to', 'evaluate', 'this', 'emergent', 'behavior', 'in', 'iot', 'applications', 'because', 'of', 'the', 'required', 'scale', 'and', 'diversity', 'this', 'is', 'not', 'an', 'easy', 'task', 'therefore', 'we', 'mainly', 'focus', 'on', 'a', 'distributed', 'simulation', 'approach', 'and', 'provide', 'an', 'overview', 'of', 'possible', 'techniques', 'that', 'could', 'optimize', 'the', 'overall', 'simulation', 'performance', 'our', 'focus', 'is', 'both', 'on', 'modeling', 'and', 'simulation', 'technology']] | [-0.16183957198458931, 0.01663314446846109, -0.07728768506251295, 0.05218714579098801, -0.11058607836947681, -0.13241860871345792, 0.04190272155659729, 0.3871722894587687, -0.2565961472728119, -0.32952519146991627, 0.09767593842531953, -0.2453372118547939, -0.2260444600097075, 0.21598874678721233, -0.10470901819288123, -0.0032573416068845864, 0.049061231052607526, 0.007682666764891592, -0.05232491211820755, -0.2549506160858258, 0.30165587394255955, 0.08316273101586469, 0.37456083530560136, 0.08153270667760956, 0.06179875372528878, -0.009083785890002869, -0.032982225914732835, 0.0035867697027112755, -0.11245729727945254, 0.1780326847766279, 0.2903437637438884, 0.1613977638938065, 0.3208437683250831, -0.45398007873065616, -0.2015105651273411, 0.10870089989193545, 0.19398797398471102, 0.0840504081226049, -0.09949245746202924, -0.263162151530233, 0.09311674048943559, -0.2291064402088523, -0.11084788721942757, -0.07554842981186752, 0.010120214295706578, 0.03742219404583531, -0.23851894432849877, 0.0022012734434054214, 0.02463611649415855, 0.07231813515251388, -0.037479640535412743, -0.04792827698021975, 0.05997226708711182, 0.16898613569459744, 0.02238344735637003, -0.028840416961596633, 0.1464817305428109, -0.15397714636202756, -0.14532881507612005, 0.37096695917449435, 0.008743060409443035, -0.1922999999927813, 0.23386168680676467, -0.0396872139915976, -0.15536527810333184, 0.05008950168076826, 0.26210728255029275, 0.1062543748269732, -0.1769343971046714, 0.050514727011227945, 0.03467479362437616, 0.208926255615162, -0.04153745513105271, 0.08873922750947769, 0.21735934161923218, 0.2663438290984807, 0.09771212159503935, 0.11955708918180696, -0.03797523063733432, -0.10450797218280579, -0.24790891208828483, -0.1723176120894448, -0.1520925860623924, 0.04168116422242376, -0.061558072730228876, -0.12831117775367232, 0.37959976087571407, 0.26881262515101356, 0.18248048997474126, 0.028514338407798538, 0.3501965672024811, 0.0347218333080658, 0.05895484631348934, 0.06366486394034261, 0.2096077069837353, 0.03267952602128593, 0.19318982456069517, -0.20210326468448478, 0.07249490074024592, -0.01656989603569465] |
1,802.09208 | A gravitational energy-momentum and the thermodynamic description of
gravity | A proposal for the gravitational energy-momentum tensor, known in the
literature as the square root of Bel-Robinson tensor, is analyzed in detail.
Being constructed exclusively from the Weyl part of the Riemann tensor, such
tensor encapsulates the geometric properties of free gravitational fields in
terms of optical scalars of null congruences: making use of the general
decomposition of any energymomentum tensor, we explore the thermodynamic
interpretation of such geometric quantities. While the matter energy-momentum
is identically conserved due to Einstein's field equations, the SQBR is not
necessarily conserved and dissipative terms could arise in its vacuum
continuity equation. We discuss the possible physical interpretations of such
mathematical properties.
| gr-qc | a proposal for the gravitational energymomentum tensor known in the literature as the square root of belrobinson tensor is analyzed in detail being constructed exclusively from the weyl part of the riemann tensor such tensor encapsulates the geometric properties of free gravitational fields in terms of optical scalars of null congruences making use of the general decomposition of any energymomentum tensor we explore the thermodynamic interpretation of such geometric quantities while the matter energymomentum is identically conserved due to einsteins field equations the sqbr is not necessarily conserved and dissipative terms could arise in its vacuum continuity equation we discuss the possible physical interpretations of such mathematical properties | [['a', 'proposal', 'for', 'the', 'gravitational', 'energymomentum', 'tensor', 'known', 'in', 'the', 'literature', 'as', 'the', 'square', 'root', 'of', 'belrobinson', 'tensor', 'is', 'analyzed', 'in', 'detail', 'being', 'constructed', 'exclusively', 'from', 'the', 'weyl', 'part', 'of', 'the', 'riemann', 'tensor', 'such', 'tensor', 'encapsulates', 'the', 'geometric', 'properties', 'of', 'free', 'gravitational', 'fields', 'in', 'terms', 'of', 'optical', 'scalars', 'of', 'null', 'congruences', 'making', 'use', 'of', 'the', 'general', 'decomposition', 'of', 'any', 'energymomentum', 'tensor', 'we', 'explore', 'the', 'thermodynamic', 'interpretation', 'of', 'such', 'geometric', 'quantities', 'while', 'the', 'matter', 'energymomentum', 'is', 'identically', 'conserved', 'due', 'to', 'einsteins', 'field', 'equations', 'the', 'sqbr', 'is', 'not', 'necessarily', 'conserved', 'and', 'dissipative', 'terms', 'could', 'arise', 'in', 'its', 'vacuum', 'continuity', 'equation', 'we', 'discuss', 'the', 'possible', 'physical', 'interpretations', 'of', 'such', 'mathematical', 'properties']] | [-0.19453550638439498, 0.1386800220270998, -0.07505041220286321, 0.07303011338509376, -0.15467750613586367, -0.055649912820380426, -0.1164586626289186, 0.27082731669646837, -0.277065312872841, -0.22079631569577712, 0.07837977679881537, -0.24590648695495781, -0.1632287691991393, 0.10774191220565134, -0.024349180576783196, 0.05294627064314592, -0.011797047560712514, 0.09784953882830723, -0.12168010646231454, -0.20754070238810834, 0.3782851856961307, 0.033859650447755775, 0.271227130690311, 0.0588591320126831, 0.1522513007849594, -0.006473540140220147, -0.0855065840171328, 0.03850691910467555, -0.11387343365464046, 0.07628974393358297, 0.2183044831808134, 0.14265364397177907, 0.17727712103139573, -0.4357322693462962, -0.2066429150160228, 0.1387045926460126, 0.09961536732093196, 0.11695832376820949, 0.024487725233824524, -0.26151262432615335, 0.04323736896355436, -0.17792266407964108, -0.1861140917394763, -0.12302979658723365, 0.014236238207363429, -0.011042652460724707, -0.18740438539795926, 0.14588368291940504, 0.04821555173377045, 0.025578104758147743, -0.14594159320662686, -0.15131857759584716, -0.050078419672551555, 0.0642712317607322, 0.12271251199249109, -0.02215247282270934, 0.1454296858424199, -0.1920225873902858, -0.08425268902939474, 0.4329859956785619, -0.06699881744440471, -0.2754423637987576, 0.13681430927538704, -0.1123642988903361, -0.12035493686290405, 0.06066024587620224, 0.08913212087632061, 0.12004253770242158, -0.186940076882803, 0.1699185605138044, -0.03407517678069525, 0.056586905161710895, 0.09946457179976959, 0.09937608916536583, 0.27184588824198624, 0.022554754366593384, 0.004022741703333977, 0.1462610567197482, 0.007770164517215758, -0.10340449464709768, -0.4303549311741769, -0.2288226923256869, -0.23606675208729005, 0.1337393734487977, -0.14171733235857106, -0.23087447087028037, 0.38939507006097446, 0.13668192755572375, 0.10248226650052696, 0.039797578289861156, 0.2803033465153982, 0.11782597725292686, 0.10145887226806344, 0.056031879259569345, 0.3111463844880601, 0.24530238887538838, 0.11711699024025594, -0.19441288393523945, 0.010983258472738143, 0.1212473862726137] |
1,802.09209 | Output feedback stable stochastic predictive control with hard control
constraints | We present a stochastic predictive controller for discrete time linear time
invariant systems under incomplete state information. Our approach is based on
a suitable choice of control policies, stability constraints, and employment of
a Kalman filter to estimate the states of the system from incomplete and
corrupt observations. We demonstrate that this approach yields a
computationally tractable problem that should be solved online periodically,
and that the resulting closed loop system is mean-square bounded for any
positive bound on the control actions. Our results allow one to tackle the
largest class of linear time invariant systems known to be amenable to
stochastic stabilization under bounded control actions via output feedback
stochastic predictive control.
| math.OC | we present a stochastic predictive controller for discrete time linear time invariant systems under incomplete state information our approach is based on a suitable choice of control policies stability constraints and employment of a kalman filter to estimate the states of the system from incomplete and corrupt observations we demonstrate that this approach yields a computationally tractable problem that should be solved online periodically and that the resulting closed loop system is meansquare bounded for any positive bound on the control actions our results allow one to tackle the largest class of linear time invariant systems known to be amenable to stochastic stabilization under bounded control actions via output feedback stochastic predictive control | [['we', 'present', 'a', 'stochastic', 'predictive', 'controller', 'for', 'discrete', 'time', 'linear', 'time', 'invariant', 'systems', 'under', 'incomplete', 'state', 'information', 'our', 'approach', 'is', 'based', 'on', 'a', 'suitable', 'choice', 'of', 'control', 'policies', 'stability', 'constraints', 'and', 'employment', 'of', 'a', 'kalman', 'filter', 'to', 'estimate', 'the', 'states', 'of', 'the', 'system', 'from', 'incomplete', 'and', 'corrupt', 'observations', 'we', 'demonstrate', 'that', 'this', 'approach', 'yields', 'a', 'computationally', 'tractable', 'problem', 'that', 'should', 'be', 'solved', 'online', 'periodically', 'and', 'that', 'the', 'resulting', 'closed', 'loop', 'system', 'is', 'meansquare', 'bounded', 'for', 'any', 'positive', 'bound', 'on', 'the', 'control', 'actions', 'our', 'results', 'allow', 'one', 'to', 'tackle', 'the', 'largest', 'class', 'of', 'linear', 'time', 'invariant', 'systems', 'known', 'to', 'be', 'amenable', 'to', 'stochastic', 'stabilization', 'under', 'bounded', 'control', 'actions', 'via', 'output', 'feedback', 'stochastic', 'predictive', 'control']] | [-0.12712047189737843, 0.0618307869943205, -0.10603648484313646, 0.050286615841230786, -0.11381194386960922, -0.20017968109948972, 0.07752116050249773, 0.3755993412527363, -0.3204092579209699, -0.2619875961733339, 0.1924601830369525, -0.20029185292830246, -0.15810407507202415, 0.22537551166704006, -0.1170336439612165, 0.1360168042671259, 0.0878757678994299, 0.05124445923859567, -0.043578761945008836, -0.2578182142821297, 0.2948726672118744, 0.02945780409633932, 0.2537316498016955, -0.027150154782384965, 0.18720116197601355, 0.016511381888119257, -0.0002083211675681899, 0.045221388687181854, -0.09839348688064116, 0.12385494951972639, 0.271805395528806, 0.14974985036801183, 0.32966356826698884, -0.41040043552628663, -0.20185336230767775, 0.12121460717109617, 0.09952511705084192, 0.11115021200487966, -0.04764326219034867, -0.31164352584267613, 0.09451688387208676, -0.1647882887566116, -0.09091836122581654, -0.11373055434736333, -0.030439804522403045, -0.0008479425422938704, -0.35897095283839553, 0.05546637263305617, 0.06849575437300434, 0.005150340802440073, -0.11838045358797947, -0.058872566671745306, 0.012967279992700942, 0.13697612262124906, -0.016978514557951584, -0.019148974737103006, 0.168223813736597, -0.06960111970815445, -0.16533856877678, 0.34321445369252324, -0.07085206197673637, -0.2796185025450798, 0.13996725996947987, -0.07123372609834228, -0.13793356865809292, 0.14914302921862202, 0.2378895466949428, 0.15599006061252635, -0.18681317853815524, 0.07434229411038495, -0.049494561371991035, 0.23122812314700764, -0.024519734035155415, 0.03950624038110924, 0.132150899025455, 0.1640415806632357, 0.19925467716942055, 0.14035723600701422, -1.5002251674824979e-05, -0.1613079376572298, -0.2909153712484821, -0.07421593123941839, -0.1388713815908846, 0.03578362902379142, -0.07554985781005003, -0.15784901243313093, 0.36988731528080143, 0.16275286814403941, 0.14404061988441158, 0.1498642002182922, 0.3168655900960475, 0.17093074668108163, 0.01724350883262809, 0.10084345418366447, 0.18254953449122213, 0.09949598547928365, 0.06463117408772222, -0.27397139487268846, 0.10608768307364884, 0.05100225775159557] |
1,802.0921 | A representer theorem for deep neural networks | We propose to optimize the activation functions of a deep neural network by
adding a corresponding functional regularization to the cost function. We
justify the use of a second-order total-variation criterion. This allows us to
derive a general representer theorem for deep neural networks that makes a
direct connection with splines and sparsity. Specifically, we show that the
optimal network configuration can be achieved with activation functions that
are nonuniform linear splines with adaptive knots. The bottom line is that the
action of each neuron is encoded by a spline whose parameters (including the
number of knots) are optimized during the training procedure. The scheme
results in a computational structure that is compatible with the existing
deep-ReLU, parametric ReLU, APL (adaptive piecewise-linear) and MaxOut
architectures. It also suggests novel optimization challenges, while making the
link with $\ell_1$ minimization and sparsity-promoting techniques explicit.
| stat.ML cs.LG | we propose to optimize the activation functions of a deep neural network by adding a corresponding functional regularization to the cost function we justify the use of a secondorder totalvariation criterion this allows us to derive a general representer theorem for deep neural networks that makes a direct connection with splines and sparsity specifically we show that the optimal network configuration can be achieved with activation functions that are nonuniform linear splines with adaptive knots the bottom line is that the action of each neuron is encoded by a spline whose parameters including the number of knots are optimized during the training procedure the scheme results in a computational structure that is compatible with the existing deeprelu parametric relu apl adaptive piecewiselinear and maxout architectures it also suggests novel optimization challenges while making the link with ell_1 minimization and sparsitypromoting techniques explicit | [['we', 'propose', 'to', 'optimize', 'the', 'activation', 'functions', 'of', 'a', 'deep', 'neural', 'network', 'by', 'adding', 'a', 'corresponding', 'functional', 'regularization', 'to', 'the', 'cost', 'function', 'we', 'justify', 'the', 'use', 'of', 'a', 'secondorder', 'totalvariation', 'criterion', 'this', 'allows', 'us', 'to', 'derive', 'a', 'general', 'representer', 'theorem', 'for', 'deep', 'neural', 'networks', 'that', 'makes', 'a', 'direct', 'connection', 'with', 'splines', 'and', 'sparsity', 'specifically', 'we', 'show', 'that', 'the', 'optimal', 'network', 'configuration', 'can', 'be', 'achieved', 'with', 'activation', 'functions', 'that', 'are', 'nonuniform', 'linear', 'splines', 'with', 'adaptive', 'knots', 'the', 'bottom', 'line', 'is', 'that', 'the', 'action', 'of', 'each', 'neuron', 'is', 'encoded', 'by', 'a', 'spline', 'whose', 'parameters', 'including', 'the', 'number', 'of', 'knots', 'are', 'optimized', 'during', 'the', 'training', 'procedure', 'the', 'scheme', 'results', 'in', 'a', 'computational', 'structure', 'that', 'is', 'compatible', 'with', 'the', 'existing', 'deeprelu', 'parametric', 'relu', 'apl', 'adaptive', 'piecewiselinear', 'and', 'maxout', 'architectures', 'it', 'also', 'suggests', 'novel', 'optimization', 'challenges', 'while', 'making', 'the', 'link', 'with', 'ell_1', 'minimization', 'and', 'sparsitypromoting', 'techniques', 'explicit']] | [-0.0867788189863588, 0.007078631438400781, -0.09393640170005936, 0.08308543117076211, -0.13193412125440881, -0.20870695277348372, 0.062004544883669216, 0.46429504853085424, -0.3162655062900843, -0.27131513495605886, 0.08985392342021041, -0.19959546341108741, -0.27623921846772764, 0.1584758796920696, -0.10410028069894364, 0.1311806847625379, 0.08931877108370052, -0.010458898529119737, -0.10952495115170097, -0.2696113695080082, 0.30711657815886967, 0.06156448460413566, 0.2766714223234498, -0.003180063435319045, 0.15851600650124745, -0.002038766871080965, -0.009426106480841941, 0.004013794624570308, -0.10794419894645739, 0.19815848916868103, 0.2592624549007585, 0.14163384384455832, 0.3459913311278487, -0.4270920344753891, -0.250125265970879, 0.10978636901383124, 0.09591250719687512, 0.08308878329793877, 0.008676111057453544, -0.22376474039298846, 0.0917739917207113, -0.15206662678417374, -0.05153435310150715, -0.13123619092251868, -0.07704381006010247, 0.07154375111893915, -0.35753581833287557, 0.045421921200381514, 0.05256505789076711, 0.016046167338095236, -0.03300401927194895, -0.10896298749593634, -0.02410387729974926, 0.06180706138372527, -0.010304561187017789, 0.08457786628273845, 0.1056528767134915, -0.13949685457413555, -0.12461251026128438, 0.2895467719983752, -0.05215104428905967, -0.2573575121631304, 0.16054303957981633, -0.023032735671570645, -0.13472516407384305, 0.12736177655161485, 0.17708101562812184, 0.09750825250587354, -0.1472676565927612, 0.06991343012332242, -0.03777766148460672, 0.16849085343142983, 0.047087955866537405, 0.0030069197416602773, 0.10654366798930082, 0.2001635598015463, 0.11272562056423184, 0.19567974360332765, -0.10450400313996572, -0.07265578641007978, -0.27783001990698225, -0.11716267212908318, -0.18086130632391423, -0.02089136015584177, -0.14278237867953028, -0.16748435500058087, 0.3995701821830488, 0.10449438731694687, 0.22692188327464916, 0.16253635944494754, 0.33148683400177364, 0.12182327819631454, 0.14074718506993555, 0.0936198155808507, 0.20176441874107384, 0.10451899845886262, 0.05540547678940632, -0.18064546436715395, 0.06819546788426013, 0.12473318072577529] |
1,802.09211 | Comments on "Fractional Extreme Value Adaptive Training Method:
Fractional Steepest Descent Approach" | In this comment, we raise serious concerns over the derivation of the rate of
convergence of fractional steepest descent algorithm in Fractional Adaptive
Learning (FAL) approach presented in `Fractional Extreme Value Adaptive
Training Method: Fractional Steepest Descent Approach' [IEEE Trans. Neural
Netw. Learn. Syst., vol. 26, no. 4, pp. 653--662, April 2015]. We substantiate
that the estimate of the rate of convergence is grandiloquent. We also draw
attention towards a critical flaw in the design of the algorithm stymieing its
applicability for broad adaptive learning problems. Our claims are based on
analytical reasoning supported by experimental results.
| math.OC | in this comment we raise serious concerns over the derivation of the rate of convergence of fractional steepest descent algorithm in fractional adaptive learning fal approach presented in fractional extreme value adaptive training method fractional steepest descent approach ieee trans neural netw learn syst vol 26 no 4 pp 653662 april 2015 we substantiate that the estimate of the rate of convergence is grandiloquent we also draw attention towards a critical flaw in the design of the algorithm stymieing its applicability for broad adaptive learning problems our claims are based on analytical reasoning supported by experimental results | [['in', 'this', 'comment', 'we', 'raise', 'serious', 'concerns', 'over', 'the', 'derivation', 'of', 'the', 'rate', 'of', 'convergence', 'of', 'fractional', 'steepest', 'descent', 'algorithm', 'in', 'fractional', 'adaptive', 'learning', 'fal', 'approach', 'presented', 'in', 'fractional', 'extreme', 'value', 'adaptive', 'training', 'method', 'fractional', 'steepest', 'descent', 'approach', 'ieee', 'trans', 'neural', 'netw', 'learn', 'syst', 'vol', '26', 'no', '4', 'pp', '653662', 'april', '2015', 'we', 'substantiate', 'that', 'the', 'estimate', 'of', 'the', 'rate', 'of', 'convergence', 'is', 'grandiloquent', 'we', 'also', 'draw', 'attention', 'towards', 'a', 'critical', 'flaw', 'in', 'the', 'design', 'of', 'the', 'algorithm', 'stymieing', 'its', 'applicability', 'for', 'broad', 'adaptive', 'learning', 'problems', 'our', 'claims', 'are', 'based', 'on', 'analytical', 'reasoning', 'supported', 'by', 'experimental', 'results']] | [-0.06851813794074064, -0.042959475003064, -0.11307620816428135, 0.04868394736834663, -0.09733910232465318, -0.16285893860015463, 0.0785177402914145, 0.39258953374860056, -0.2160132890269953, -0.33207575334830486, 0.12406293449408197, -0.2373949120098606, -0.2363529133287189, 0.22108065752817832, -0.1762289092968321, 0.11631655631069232, 0.07628405686626409, -0.03335378974913917, -0.0774626212982223, -0.31669548595760094, 0.2218822726851052, 0.08558682282207573, 0.3020515034874366, 0.04541218903985746, 0.10383508696983706, 0.002515059885905778, -0.10417230397046721, -0.05720797956158268, -0.155584748599451, 0.18266425222812338, 0.2820821304290377, 0.15556618352816937, 0.41042548461638867, -0.3606395047118372, -0.15028452192324193, 0.07224221008165957, 0.11397501853532455, 0.07465214387295728, -0.05647416440200338, -0.3032797054447075, 0.10802275778111467, -0.1571343607254366, -0.0898769110183608, -0.051029900326690775, 0.025221888558007777, 0.05484021267546539, -0.2770999402124831, 0.1365702060280997, 0.08763155957406506, 0.10273504731780354, -0.059623881489313406, -0.16994423609464726, 0.04023830302584758, 0.003650815581575908, 0.043111357657100134, 0.05987587811900897, 0.13732639115125417, -0.09773620742898276, -0.21962896280704028, 0.29704827477937523, -0.030334620075201258, -0.14643151844118504, 0.11852763964487438, -0.05584538559072671, -0.17679706265892278, 0.14795932744411713, 0.24737355324558596, 0.13971263043919302, -0.11310166446368229, 0.08606043780480135, -0.048976893170162086, 0.16758371865317384, 0.053791768504603904, -0.05284925735000759, 0.09274471586599867, 0.21127770522094153, 0.09489102366360579, 0.0903209055739237, -0.09975881807932115, -0.18066622944984664, -0.3124452240547126, -0.13563033609968075, -0.18212315180101135, 0.02323125095720938, -0.12407172767524706, -0.10805486144818133, 0.3347506952729631, 0.2831402385032716, 0.15209417782248336, 0.09053022037706081, 0.24787328892605417, 0.14436660265237924, -0.027030899669935413, 0.13115792559519251, 0.26307609901228485, 0.13352046305799184, 0.19855049915210482, -0.24003326189902394, 0.03847535447950693, 0.11764218303513654] |
1,802.09212 | Devil's Staircases in SFS Josephson Junctions | We study the effect of coupling between the superconducting current and
magnetization in the superconductor/ferromagnet/superconductor Josephson
junction under an applied circularly polarized magnetic field. Manifestation of
ferromagnetic resonance in the frequency dependence of the amplitude of the
magnetization and the average critical current density is demonstrated
numerically. The IV-characteristics show subharmonic steps that form devil's
staircases, following a continued fraction algorithm. The origin of the found
steps is related to the effect of the magnetization dynamics on the phase
difference in the Josephson junction. The dynamics of our system is described
by a generalized RCSJ model coupled to the Landau-Lifshitz-Gilbert equation. In
the suplement we justify analytically the appearance of the fractional steps in
IV-characteristics of the superconductor/ferromagnet/superconductor Josephson
junction.
| cond-mat.supr-con cond-mat.mes-hall | we study the effect of coupling between the superconducting current and magnetization in the superconductorferromagnetsuperconductor josephson junction under an applied circularly polarized magnetic field manifestation of ferromagnetic resonance in the frequency dependence of the amplitude of the magnetization and the average critical current density is demonstrated numerically the ivcharacteristics show subharmonic steps that form devils staircases following a continued fraction algorithm the origin of the found steps is related to the effect of the magnetization dynamics on the phase difference in the josephson junction the dynamics of our system is described by a generalized rcsj model coupled to the landaulifshitzgilbert equation in the suplement we justify analytically the appearance of the fractional steps in ivcharacteristics of the superconductorferromagnetsuperconductor josephson junction | [['we', 'study', 'the', 'effect', 'of', 'coupling', 'between', 'the', 'superconducting', 'current', 'and', 'magnetization', 'in', 'the', 'superconductorferromagnetsuperconductor', 'josephson', 'junction', 'under', 'an', 'applied', 'circularly', 'polarized', 'magnetic', 'field', 'manifestation', 'of', 'ferromagnetic', 'resonance', 'in', 'the', 'frequency', 'dependence', 'of', 'the', 'amplitude', 'of', 'the', 'magnetization', 'and', 'the', 'average', 'critical', 'current', 'density', 'is', 'demonstrated', 'numerically', 'the', 'ivcharacteristics', 'show', 'subharmonic', 'steps', 'that', 'form', 'devils', 'staircases', 'following', 'a', 'continued', 'fraction', 'algorithm', 'the', 'origin', 'of', 'the', 'found', 'steps', 'is', 'related', 'to', 'the', 'effect', 'of', 'the', 'magnetization', 'dynamics', 'on', 'the', 'phase', 'difference', 'in', 'the', 'josephson', 'junction', 'the', 'dynamics', 'of', 'our', 'system', 'is', 'described', 'by', 'a', 'generalized', 'rcsj', 'model', 'coupled', 'to', 'the', 'landaulifshitzgilbert', 'equation', 'in', 'the', 'suplement', 'we', 'justify', 'analytically', 'the', 'appearance', 'of', 'the', 'fractional', 'steps', 'in', 'ivcharacteristics', 'of', 'the', 'superconductorferromagnetsuperconductor', 'josephson', 'junction']] | [-0.26497877951899246, 0.1329085014873241, -0.060462910559467786, 0.02399157459491535, -0.03524517548904449, -0.07934841199410188, 0.06522001706439406, 0.3375821771694958, -0.2505536850858793, -0.24399854296802723, -0.005785217439215787, -0.2582137817702796, -0.15090317663075323, 0.21443726944721483, 0.05377675741989197, 0.016339268680161036, -0.03889376079632329, -0.007313496716899656, -0.02786412332480883, -0.18011356536455514, 0.3070326097732206, -0.036406565556388756, 0.33879775641595616, 0.05083589264174078, 0.08373519522333596, -0.05171043173206516, 0.11422794831901037, 0.030011744242349342, -0.15977147501188246, -0.01304975853246801, 0.17873264166737804, -0.07353969987082205, 0.18061643981320016, -0.502635059549528, -0.15374365272078694, 0.05255867660577808, 0.16037531830018245, 0.13098803756586394, 0.004435935404989086, -0.30692842078371707, 0.008440049509948292, -0.10730828418388587, -0.13843215430182787, -0.03245612407228401, 0.023912532925175332, 0.04708405799709824, -0.24873224813334582, 0.1050235818085425, 0.08354080415197782, 0.0449304926216978, -0.022298868193815487, -0.07127063170597818, -0.046870694024206586, 0.03551354088640513, 0.045396457342209616, 0.038331575196690296, 0.14375851274381915, -0.14604068697359757, -0.1200589618269949, 0.2740912632468869, -0.09890137853672211, -0.15540843040627592, 0.06550568291338302, -0.2144261663921467, -0.050864923714088794, 0.1287908094676853, 0.09675907635349124, 0.10797428976775718, -0.1622497770170282, 0.06707939559486431, 0.008492945226793717, 0.16041322075957512, 0.06537285568623044, -0.0017047277886514402, 0.25263147673201786, 0.2509806353301436, 0.03416105858715517, 0.20122485366031653, -0.1449272824009145, -0.12301947181543507, -0.2919368868490227, -0.13690020035592323, -0.2041245796052473, 0.06983822123944845, -0.05096875054408608, -0.18996440634491438, 0.46451815835810695, 0.2025180983302348, 0.16151044927067867, -0.030507899773847155, 0.3035012286375551, 0.21900476348594206, 0.03140919777650793, 0.008197019796255006, 0.2304006438905827, 0.22738936383222394, 0.16021496506247418, -0.41320607464901415, 0.07789163935162566, 0.01792380861163202] |
1,802.09213 | Underground current impulses as a possible source of unipolar magnetic
pulses | Recently several cases of observations of unipolar magnetic field pulses
associated with earthquakes at different points (California, Italy, Peru) have
been recorded. The paper attempts to model unipolar magnetic field pulses based
on one mechanism that should be omnipresent for all measurement points, namely,
the magnetic field diffusion through a conductive medium. The structure of
magnetic fields supported by electric current sources is thoroughly modelled.
The source of electric current is considered as an elongated volume of finite
cross-section being immersed in a conductive medium. To model the unipolarity
feature of the observed pulses prior to and at the earthquake main shock, the
electric current of the source is of impulse form. Special attention is paid to
the differences in the pulse structure (as amplitude envelope and the pulse
width) that are measured by various magnetometers (fluxgate or search-coil). An
analysis and comparison with recorded magnetic field pulse characteristics
reveal that the observed unipolar pulses may have a common genesis, an electric
current source within a conductive medium such as the earth crust.
| physics.geo-ph | recently several cases of observations of unipolar magnetic field pulses associated with earthquakes at different points california italy peru have been recorded the paper attempts to model unipolar magnetic field pulses based on one mechanism that should be omnipresent for all measurement points namely the magnetic field diffusion through a conductive medium the structure of magnetic fields supported by electric current sources is thoroughly modelled the source of electric current is considered as an elongated volume of finite crosssection being immersed in a conductive medium to model the unipolarity feature of the observed pulses prior to and at the earthquake main shock the electric current of the source is of impulse form special attention is paid to the differences in the pulse structure as amplitude envelope and the pulse width that are measured by various magnetometers fluxgate or searchcoil an analysis and comparison with recorded magnetic field pulse characteristics reveal that the observed unipolar pulses may have a common genesis an electric current source within a conductive medium such as the earth crust | [['recently', 'several', 'cases', 'of', 'observations', 'of', 'unipolar', 'magnetic', 'field', 'pulses', 'associated', 'with', 'earthquakes', 'at', 'different', 'points', 'california', 'italy', 'peru', 'have', 'been', 'recorded', 'the', 'paper', 'attempts', 'to', 'model', 'unipolar', 'magnetic', 'field', 'pulses', 'based', 'on', 'one', 'mechanism', 'that', 'should', 'be', 'omnipresent', 'for', 'all', 'measurement', 'points', 'namely', 'the', 'magnetic', 'field', 'diffusion', 'through', 'a', 'conductive', 'medium', 'the', 'structure', 'of', 'magnetic', 'fields', 'supported', 'by', 'electric', 'current', 'sources', 'is', 'thoroughly', 'modelled', 'the', 'source', 'of', 'electric', 'current', 'is', 'considered', 'as', 'an', 'elongated', 'volume', 'of', 'finite', 'crosssection', 'being', 'immersed', 'in', 'a', 'conductive', 'medium', 'to', 'model', 'the', 'unipolarity', 'feature', 'of', 'the', 'observed', 'pulses', 'prior', 'to', 'and', 'at', 'the', 'earthquake', 'main', 'shock', 'the', 'electric', 'current', 'of', 'the', 'source', 'is', 'of', 'impulse', 'form', 'special', 'attention', 'is', 'paid', 'to', 'the', 'differences', 'in', 'the', 'pulse', 'structure', 'as', 'amplitude', 'envelope', 'and', 'the', 'pulse', 'width', 'that', 'are', 'measured', 'by', 'various', 'magnetometers', 'fluxgate', 'or', 'searchcoil', 'an', 'analysis', 'and', 'comparison', 'with', 'recorded', 'magnetic', 'field', 'pulse', 'characteristics', 'reveal', 'that', 'the', 'observed', 'unipolar', 'pulses', 'may', 'have', 'a', 'common', 'genesis', 'an', 'electric', 'current', 'source', 'within', 'a', 'conductive', 'medium', 'such', 'as', 'the', 'earth', 'crust']] | [-0.14514576816354055, 0.1636816656855391, -0.03637772358202359, 0.04705681483675209, -0.05847350210741119, -0.07260992342595295, -0.016278623793225148, 0.44743904715393024, -0.2281518311631915, -0.3290310133989269, 0.08811410869286554, -0.2733943573585902, -0.06802994137281301, 0.22500453876434928, 0.00390746244174913, 0.00042654606050740907, 0.013821885086410838, 0.04312613063589915, 0.015517547907721665, -0.16001425471172323, 0.2659379986839162, 0.07638276225141091, 0.30795501385494106, 0.03287064093736965, 0.08945583602704914, -0.05414119215473827, 0.019175133318980686, 0.028546971047769164, -0.042074575417697886, 0.040116047843397534, 0.22311302942185723, 0.03647954917610868, 0.22440814408500903, -0.5140571555678259, -0.265983286798436, 0.06413859821044518, 0.11455905950922322, 0.08530139722670728, -0.07507055761409673, -0.29736757245219764, 0.04755442398695591, -0.13833492364780706, -0.1390898618193572, 0.016975454060219185, 0.05030768677831916, 0.08760709708491177, -0.2658945734167406, 0.04167641392038939, 0.03809564608375253, 0.0923152880808502, -0.09063485332857273, -0.09428178258403613, -0.015345989008248942, 0.08770867679145579, 0.08795621781337636, 0.09348680223208955, 0.19729303223304231, -0.13800438258753359, -0.08963967818761386, 0.3417909480086718, -0.05912762173936207, -0.09326807296785869, 0.1345785755149432, -0.18498526427252163, -0.043679726824752595, 0.17789380691880197, 0.17088941082069706, 0.08329715045735414, -0.18332443471891774, 0.012987669687023745, -0.022905030957700915, 0.15217636498603535, 0.09827015758219736, 0.014080726996347395, 0.26585501835447306, 0.18332263216177513, 0.007252545819661379, 0.13519641686311232, -0.17617325254815375, -0.047029619639921846, -0.2652736056362189, -0.08800717883155142, -0.16050672564418628, 0.039804148374054556, -0.03839034105663675, -0.19321406733657218, 0.4136393547033597, 0.14044438926462216, 0.13927078579841126, -0.08780390953056906, 0.3269369019364274, 0.11543936515839673, 0.0731338870586359, 0.07465726990056665, 0.2701277113220061, 0.19552707055730648, 0.1476482641910426, -0.20471520257884995, 0.0859598146059839, -0.01571823189808437] |
1,802.09214 | An Asymptotic Series for an Integral | We obtain an asymptotic series $\sum_{j=0}^\infty\frac{I_j}{n^j}$ for the
integral $\int_0^1[x^n+(1-x)^n]^{\frac1{n}}dx$ as $n\to\infty$, and compute
$I_j$ in terms of alternating (or "colored") multiple zeta value. We also show
that $I_j$ is a rational polynomial the ordinary zeta values, and give explicit
formulas for $j\le 12$. As a byproduct, we obtain precise results about the
convergence of norms of random variables and their moments. We study
$\Vert(U,1-U)\Vert_n$ as $n$ tends to infinity and we also discuss
$\Vert(U_1,U_2,\dots,U_r)\Vert_n$ for standard uniformly distributed random
variables.
| math.NT math.CO math.PR | we obtain an asymptotic series sum_j0inftyfraci_jnj for the integral int_01xn1xnfrac1ndx as ntoinfty and compute i_j in terms of alternating or colored multiple zeta value we also show that i_j is a rational polynomial the ordinary zeta values and give explicit formulas for jle 12 as a byproduct we obtain precise results about the convergence of norms of random variables and their moments we study vertu1uvert_n as n tends to infinity and we also discuss vertu_1u_2dotsu_rvert_n for standard uniformly distributed random variables | [['we', 'obtain', 'an', 'asymptotic', 'series', 'sum_j0inftyfraci_jnj', 'for', 'the', 'integral', 'int_01xn1xnfrac1ndx', 'as', 'ntoinfty', 'and', 'compute', 'i_j', 'in', 'terms', 'of', 'alternating', 'or', 'colored', 'multiple', 'zeta', 'value', 'we', 'also', 'show', 'that', 'i_j', 'is', 'a', 'rational', 'polynomial', 'the', 'ordinary', 'zeta', 'values', 'and', 'give', 'explicit', 'formulas', 'for', 'jle', '12', 'as', 'a', 'byproduct', 'we', 'obtain', 'precise', 'results', 'about', 'the', 'convergence', 'of', 'norms', 'of', 'random', 'variables', 'and', 'their', 'moments', 'we', 'study', 'vertu1uvert_n', 'as', 'n', 'tends', 'to', 'infinity', 'and', 'we', 'also', 'discuss', 'vertu_1u_2dotsu_rvert_n', 'for', 'standard', 'uniformly', 'distributed', 'random', 'variables']] | [-0.15703635962752552, 0.10011657612423212, -0.08412720552077155, 0.09451457050889005, -0.05374441160397096, -0.11054631789493097, 0.05638320473107425, 0.35210303930783426, -0.28493094227167887, -0.23541345417668874, 0.13070936432840036, -0.28125201644037257, -0.15278227823822724, 0.17039793347274618, -0.04277525557255729, 0.04231511098018986, 0.0005841593185512276, 0.12426767013241331, -0.08721296725017563, -0.2958015909345893, 0.27903279507163814, -0.0328360153120253, 0.14634060176307118, 0.009195964886238436, 0.11841109545384353, 0.0506830178624527, -0.027623816284459906, -0.026577984623901256, -0.1926214986624591, 0.0643289534423452, 0.25000981717671317, 0.09080545084139743, 0.2501378964100565, -0.38620739098783435, -0.09044881235481567, 0.16586475341592904, 0.22633331089413591, 0.03156687754702259, 0.012201341044448026, -0.2051133739145158, 0.12804765898323098, -0.15366076813805124, -0.2179026792019412, -0.15261111080694895, 0.05066186171357653, 0.13380753783230948, -0.40102261672546335, 0.05931569975513554, 0.07927833247155726, 0.07844679487578861, -0.048966076491134505, -0.22528500534448917, 0.052783914091815425, 0.13189203755676068, 0.07371237347591911, 0.006234453316753754, 0.043068807999990494, -0.09827000539305365, -0.11061570628896936, 0.3099899096047814, -0.11301333895678838, -0.2285230456996564, 0.11896888822220363, -0.1452824798134434, -0.16698497463646647, 0.04370951638012737, 0.14383944428779863, 0.1893771403082102, -0.07627453806193231, 0.11744596629838955, -0.10839515946224912, 0.09927723740904847, 0.1109840048646385, 0.050932516410414665, 0.10521740801390503, 0.007097602785601244, 0.09503497548594877, 0.19446630672213028, -0.03835330154843532, -0.06792833676029529, -0.3776709639547429, -0.24091158916133565, -0.1906045605428517, 0.12197973943835536, -0.20288771392048832, -0.20906056016199775, 0.3368877920672878, 0.11991518005341678, 0.25121001433429924, 0.21112102564037233, 0.2211786238113781, 0.19122116405111678, -0.03907661993576625, 0.06121888146251924, 0.09928647750178231, 0.16934240115927413, 0.061067950872510865, -0.13445424928946734, 0.04045861257336937, 0.15927149898481446] |
1,802.09215 | Finite groups with a large automorphism orbit | We study the nonabelian composition factors of a finite group $G$ assumed to
admit an $\operatorname{Aut}(G)$-orbit of length at least $\rho|G|$, for a
given $\rho\in\left(0,1\right]$. Our main results are the following: The orders
of the nonabelian composition factors of $G$ are then bounded in terms of
$\rho$, and if $\rho>\frac{18}{19}$, then $G$ is solvable. On the other hand,
for each nonabelian finite simple group $S$, there is a constant
$c(S)\in\left(0,1\right]$ such that $S$ occurs with arbitrarily large
multiplicity as a composition factor in some finite group $G$ having an
$\operatorname{Aut}(G)$-orbit of length at least $c(S)|G|$.
| math.GR | we study the nonabelian composition factors of a finite group g assumed to admit an operatornameautgorbit of length at least rhog for a given rhoinleft01right our main results are the following the orders of the nonabelian composition factors of g are then bounded in terms of rho and if rhofrac1819 then g is solvable on the other hand for each nonabelian finite simple group s there is a constant csinleft01right such that s occurs with arbitrarily large multiplicity as a composition factor in some finite group g having an operatornameautgorbit of length at least csg | [['we', 'study', 'the', 'nonabelian', 'composition', 'factors', 'of', 'a', 'finite', 'group', 'g', 'assumed', 'to', 'admit', 'an', 'operatornameautgorbit', 'of', 'length', 'at', 'least', 'rhog', 'for', 'a', 'given', 'rhoinleft01right', 'our', 'main', 'results', 'are', 'the', 'following', 'the', 'orders', 'of', 'the', 'nonabelian', 'composition', 'factors', 'of', 'g', 'are', 'then', 'bounded', 'in', 'terms', 'of', 'rho', 'and', 'if', 'rhofrac1819', 'then', 'g', 'is', 'solvable', 'on', 'the', 'other', 'hand', 'for', 'each', 'nonabelian', 'finite', 'simple', 'group', 's', 'there', 'is', 'a', 'constant', 'csinleft01right', 'such', 'that', 's', 'occurs', 'with', 'arbitrarily', 'large', 'multiplicity', 'as', 'a', 'composition', 'factor', 'in', 'some', 'finite', 'group', 'g', 'having', 'an', 'operatornameautgorbit', 'of', 'length', 'at', 'least', 'csg']] | [-0.1801752552574316, 0.22275927487618782, -0.0859534214301915, -0.011891995247064547, -0.07927384114936813, -0.11610929185401771, 0.011419832010518063, 0.3782954946324065, -0.2756414274367821, -0.2511044540493698, 0.09602212701453366, -0.2739718390608227, -0.07845789940444405, 0.18355678951183518, -0.03884559053131942, -0.04965426718591006, 0.021538560104730365, 0.2030532054480288, -0.08110344526357949, -0.28876806906127667, 0.3402703341280857, -0.047505325955021514, 0.16855900337571625, 0.07507362357944578, 0.118840515746602, -0.018345582549675152, -0.0029687493717154632, 0.068826737868661, -0.153245479495736, 0.06025379049786172, 0.25673222875959434, 0.04992422853995647, 0.2624519947547834, -0.34579023055650376, -0.19474156650172159, 0.17538507532451178, 0.09362909424497368, 0.013387323960989387, -0.019495084724429953, -0.19564144245788948, 0.196039232484239, -0.17389152365849242, -0.14851874651407804, 0.00921067292546178, 0.12120421215441528, 0.0067783558388128055, -0.26250859268091536, 0.026954164943442896, 0.08480765140400483, 0.0786792388178103, 0.004892784600647597, -0.17306116034000457, -0.029578085873623962, 0.1423202860732, 0.034932215355213854, 0.05321226653049362, 0.05937158968811343, -0.13390445799674267, -0.10392488933239992, 0.4190850672158566, -0.11019879371787493, -0.16597269878692025, 0.17593550035131297, -0.16746275493322493, -0.165875618330684, 0.11995404860475561, 0.10461727802764502, 0.1588676714102973, -0.04919106798799156, 0.15948098486450574, -0.12615182458494717, 0.16572384879115845, 0.06707403027954009, -0.007926651036141666, 0.11737986810116487, 0.1343833030211729, 0.1318151423820182, 0.0907015848762847, 0.02913265758971837, 0.046511317060871436, -0.4062652941588517, -0.12460315763530741, -0.18704439741610498, 0.08993909136484285, -0.14526487935246812, -0.19097787565500526, 0.3860249685553404, 0.03245358336409861, 0.2031962697772862, 0.06081368140671607, 0.20098436605389958, 0.13131184066942597, 0.06749201740475964, 0.13466602906195835, 0.0727881290044784, 0.17024877576597527, -0.11773630636386, -0.23154924151098744, 0.02816523563444287, 0.131000743074065] |
1,802.09216 | Coupled quintessence with a $\Lambda$CDM background: removing the
$\sigma_8$ tension | A well-known problem of the $\Lambda$CDM model is the tension between the
relatively high level of clustering, as quantified by the parameter $\sigma_8$,
found in cosmic microwave background experiments and the smaller one obtained
from large-scale observations in the late Universe. In this paper we show that
coupled quintessence, i.e. a single dark energy scalar field conformally
coupled to dark matter through a constant coupling, can solve this problem if
the background is taken to be identical to the $\Lambda$CDM one. We show that
two competing effects arise. On one hand, the additional scalar force is
attractive, and is therefore expected to increase the clustering. On the other,
in order to obtain the same background as $\Lambda$CDM, coupled quintessence
must have a smaller amount of dark matter near the present epoch. We show that
the second effect is dominating today and leads to an overall slower growth.
Comparing to redshift distortion data, we find that coupled quintessence with
$\Lambda$CDM background solves the tension between early and late clustering.
We find for the coupling $\beta$ and for $\sigma_8$ the best fit values
$|\beta| = 0.079^{+ 0.059}_{- 0.067}$ and $\sigma_8 = 0.818^{+0.115}_{-0.088}$.
These values also fit the lensing data from the KiDS-450 survey. We also
estimate that the future missions SKA and Euclid will constrain $\beta$ with an
error of $\pm\, 1.5\times10^{-3}$ and for $\sigma_8$ of $\pm
\,1.8\times10^{-3}$ at $1\sigma$ level.
| astro-ph.CO | a wellknown problem of the lambdacdm model is the tension between the relatively high level of clustering as quantified by the parameter sigma_8 found in cosmic microwave background experiments and the smaller one obtained from largescale observations in the late universe in this paper we show that coupled quintessence ie a single dark energy scalar field conformally coupled to dark matter through a constant coupling can solve this problem if the background is taken to be identical to the lambdacdm one we show that two competing effects arise on one hand the additional scalar force is attractive and is therefore expected to increase the clustering on the other in order to obtain the same background as lambdacdm coupled quintessence must have a smaller amount of dark matter near the present epoch we show that the second effect is dominating today and leads to an overall slower growth comparing to redshift distortion data we find that coupled quintessence with lambdacdm background solves the tension between early and late clustering we find for the coupling beta and for sigma_8 the best fit values beta 0079 0059_ 0067 and sigma_8 08180115_0088 these values also fit the lensing data from the kids450 survey we also estimate that the future missions ska and euclid will constrain beta with an error of pm 15times103 and for sigma_8 of pm 18times103 at 1sigma level | [['a', 'wellknown', 'problem', 'of', 'the', 'lambdacdm', 'model', 'is', 'the', 'tension', 'between', 'the', 'relatively', 'high', 'level', 'of', 'clustering', 'as', 'quantified', 'by', 'the', 'parameter', 'sigma_8', 'found', 'in', 'cosmic', 'microwave', 'background', 'experiments', 'and', 'the', 'smaller', 'one', 'obtained', 'from', 'largescale', 'observations', 'in', 'the', 'late', 'universe', 'in', 'this', 'paper', 'we', 'show', 'that', 'coupled', 'quintessence', 'ie', 'a', 'single', 'dark', 'energy', 'scalar', 'field', 'conformally', 'coupled', 'to', 'dark', 'matter', 'through', 'a', 'constant', 'coupling', 'can', 'solve', 'this', 'problem', 'if', 'the', 'background', 'is', 'taken', 'to', 'be', 'identical', 'to', 'the', 'lambdacdm', 'one', 'we', 'show', 'that', 'two', 'competing', 'effects', 'arise', 'on', 'one', 'hand', 'the', 'additional', 'scalar', 'force', 'is', 'attractive', 'and', 'is', 'therefore', 'expected', 'to', 'increase', 'the', 'clustering', 'on', 'the', 'other', 'in', 'order', 'to', 'obtain', 'the', 'same', 'background', 'as', 'lambdacdm', 'coupled', 'quintessence', 'must', 'have', 'a', 'smaller', 'amount', 'of', 'dark', 'matter', 'near', 'the', 'present', 'epoch', 'we', 'show', 'that', 'the', 'second', 'effect', 'is', 'dominating', 'today', 'and', 'leads', 'to', 'an', 'overall', 'slower', 'growth', 'comparing', 'to', 'redshift', 'distortion', 'data', 'we', 'find', 'that', 'coupled', 'quintessence', 'with', 'lambdacdm', 'background', 'solves', 'the', 'tension', 'between', 'early', 'and', 'late', 'clustering', 'we', 'find', 'for', 'the', 'coupling', 'beta', 'and', 'for', 'sigma_8', 'the', 'best', 'fit', 'values', 'beta', '0079', '0059_', '0067', 'and', 'sigma_8', '08180115_0088', 'these', 'values', 'also', 'fit', 'the', 'lensing', 'data', 'from', 'the', 'kids450', 'survey', 'we', 'also', 'estimate', 'that', 'the', 'future', 'missions', 'ska', 'and', 'euclid', 'will', 'constrain', 'beta', 'with', 'an', 'error', 'of', 'pm', '15times103', 'and', 'for', 'sigma_8', 'of', 'pm', '18times103', 'at', '1sigma', 'level']] | [-0.10073338898447608, 0.12979942501897312, -0.08018412305474547, 0.11283043784611177, -0.10938408649443383, -0.13151003914702283, -0.028120459397281854, 0.3231705846161016, -0.23649879362658663, -0.361779466813979, 0.0498171878321695, -0.3253530394751059, -0.04955951870241344, 0.1866313532217256, 0.014451605858734442, -0.010462163031661476, 0.029273830611990497, 0.014158928779319726, -0.03720666942789259, -0.29085882970061255, 0.2955271585014998, 0.12452930315963126, 0.23924251092414903, 0.0002752693835645914, 0.07671401778134168, -0.08190080491788519, -0.04535844806689836, 0.034733816925186796, -0.207815523720488, 0.03633450107424453, 0.20915282686058032, 0.11255479063506105, 0.2235062080487426, -0.36368011838307474, -0.20605299469337165, 0.17536489493172017, 0.16280636713989743, 0.1031080231893741, -0.04530466765312927, -0.2783254675367581, 0.058103360612091946, -0.15447648983328172, -0.09256836191135724, -0.01674956151587789, -0.03751371952187453, -0.0307990951683418, -0.28340883167038555, 0.1820609583402464, -0.049982991647474204, -0.04524703079992572, -0.10053226741729304, -0.11685714191740512, -0.024420546904106492, 0.04877579166662015, 0.09954131083681464, 0.09076081439733182, 0.1215988030572979, -0.1780140049034214, -0.038518358352510926, 0.40912161592028234, -0.17159467389917285, -0.13370245561054617, 0.1283727701780403, -0.16505286730950633, -0.1647239765048393, 0.06658472794775402, 0.13863025573560403, 0.02110237867392633, -0.1158236558860933, 0.11614675699456711, 0.04291692906450147, 0.2512335255794044, 0.05800912079887764, -0.018436373010834877, 0.28731900238407043, 0.136082177516073, 0.09612441465703471, 0.08060809422879954, -0.11606453628129591, -0.03231142918645803, -0.2975760620642437, -0.09656313431436761, -0.14890728270568485, 0.05412053691439463, -0.17278918990372663, -0.14076070330546436, 0.34701688505759065, 0.166622296728227, 0.20829610964054673, 0.07603096329902266, 0.31959667831792365, 0.08204446219419229, 0.03238358316954353, 0.038262004040007014, 0.3488198531974506, 0.09402259801884481, 0.053594878704773564, -0.2369058414781518, -0.0011910334599503716, -0.03210868614925338] |
1,802.09217 | Normalized solutions to the mixed dispersion nonlinear Schr\"odinger
equation in the mass critical and supercritical regime | In this paper, we study the existence of solutions to the mixed dispersion
nonlinear Schr\"odinger equation $$ \gamma \Delta ^2 u -\Delta u + \alpha
u=|u|^{2 \sigma} u, \quad u \in H^2(\R^N), $$ under the constraint $$
\int_{\R^N}|u|^2 \, dx =c>0. $$ We assume $\gamma >0, N \geq 1, 4 \leq \sigma N
< \frac{4N}{(N-4)^+}$, whereas the parameter $\alpha \in \R$ will appear as a
Lagrange multiplier. Given $c \in \R^+$, we consider several questions
including the existence of ground states, of positive solutions and the
multiplicity of radial solutions. We also discuss the stability of the standing
waves of the associated dispersive equation.
| math.AP | in this paper we study the existence of solutions to the mixed dispersion nonlinear schrodinger equation gamma delta 2 u delta u alpha uu2 sigma u quad u in h2rn under the constraint int_rnu2 dx c0 we assume gamma 0 n geq 1 4 leq sigma n frac4nn4 whereas the parameter alpha in r will appear as a lagrange multiplier given c in r we consider several questions including the existence of ground states of positive solutions and the multiplicity of radial solutions we also discuss the stability of the standing waves of the associated dispersive equation | [['in', 'this', 'paper', 'we', 'study', 'the', 'existence', 'of', 'solutions', 'to', 'the', 'mixed', 'dispersion', 'nonlinear', 'schrodinger', 'equation', 'gamma', 'delta', '2', 'u', 'delta', 'u', 'alpha', 'uu2', 'sigma', 'u', 'quad', 'u', 'in', 'h2rn', 'under', 'the', 'constraint', 'int_rnu2', 'dx', 'c0', 'we', 'assume', 'gamma', '0', 'n', 'geq', '1', '4', 'leq', 'sigma', 'n', 'frac4nn4', 'whereas', 'the', 'parameter', 'alpha', 'in', 'r', 'will', 'appear', 'as', 'a', 'lagrange', 'multiplier', 'given', 'c', 'in', 'r', 'we', 'consider', 'several', 'questions', 'including', 'the', 'existence', 'of', 'ground', 'states', 'of', 'positive', 'solutions', 'and', 'the', 'multiplicity', 'of', 'radial', 'solutions', 'we', 'also', 'discuss', 'the', 'stability', 'of', 'the', 'standing', 'waves', 'of', 'the', 'associated', 'dispersive', 'equation']] | [-0.24754056145258724, 0.10149259257942755, 0.00868489876627288, 0.03587033923224923, -0.029822619889486344, -0.1932496913025116, -0.0011858598197849982, 0.297766538970965, -0.32556671658134523, -0.20839124113479826, 0.07318989184011329, -0.36297258826844553, -0.06814608675863673, 0.11955804711931009, 0.03531235524829715, 0.04949890619064582, 0.013382160867703087, 0.08255615458163332, -0.10495848235292757, -0.17245439174857505, 0.3553481526038748, -0.11040428197605813, 0.10179508352488716, 0.03567030655029428, 0.05067613932422976, -0.030189295026889825, 0.022953889798372984, -0.014996113612296734, -0.29451606127413665, 0.03783219607554356, 0.2029809452038496, 0.09652475254768704, 0.30939646163816625, -0.35685223382600445, -0.18087082371695284, 0.16097020640216292, 0.17340969908586207, -0.02510636865577482, 0.0025271208005699704, -0.26374578058343146, 0.11408869064403103, -0.10007784822262189, -0.25134757553484843, 0.008870154381432432, 0.13515133641541321, 0.09540000409036478, -0.30374694243073463, 0.12704067493688584, 0.09302743832442037, -0.01831725459704374, -0.11104245390743017, -0.20970579004410575, -0.045917351413121886, 0.03158079118943436, 0.03796837799265941, 0.07710608897081754, -0.027256125663506225, -0.1530423677090476, -0.009396285829233362, 0.3613807040445031, -0.139530225676742, -0.2525827239287343, 0.10184780974931856, -0.2155673099047643, -0.16333088217342787, 0.07764398071796019, 0.12737135360750587, 0.17174115004711488, -0.058761665508388836, 0.258969552125757, -0.052490499727626115, 0.20014747887096823, 0.13349746633321047, 0.004635128455157293, 0.07339824179306309, 0.09305491857230663, 0.11751516648825813, 0.05734662524365047, -0.0991952762885782, 0.040286289750935234, -0.4246465472227081, -0.14499535088358012, -0.09237434341512779, 0.14675113095089476, -0.09519519521641183, -0.13916159601525424, 0.3485970509020572, 0.08417925136560138, 0.16252261282321304, 0.03496613367113899, 0.12993431074465525, 0.16074270183255182, -0.08282153712872892, 0.09281283210185258, 0.15166457254994423, 0.16558499767276597, 0.10665754681611632, -0.26828306880680486, -0.045854477103467677, 0.0896824056460978] |
1,802.09218 | New physics with the lepton flavor violating decay $\tau\to 3\mu$ | Lepton flavour violating (LFV) processes are a smoking gun signal of new
physics (NP). If the semileptonic $B$ decay anomalies are indeed due to some
NP, such operators can potentially lead to LFV decays involving the second and
the third generation leptons, like $\tau\to 3\mu$. In this paper, we explore
how far the nature of NP can be unraveled at the next generation $B$-factories
like Belle-II, provided the decay $\tau\to 3\mu$ has been observed. We use four
observables with which the differentiation among NP operators may be achieved
to a high confidence level. Possible presence of multiple NP operators are also
analysed with the Optimal Observable technique. While the analysis can be
improved even further if the final state muon polarisations are measured, we
present this work as a motivational tool for the experimentalists, as well as a
template for the analysis of similar processes.
| hep-ph | lepton flavour violating lfv processes are a smoking gun signal of new physics np if the semileptonic b decay anomalies are indeed due to some np such operators can potentially lead to lfv decays involving the second and the third generation leptons like tauto 3mu in this paper we explore how far the nature of np can be unraveled at the next generation bfactories like belleii provided the decay tauto 3mu has been observed we use four observables with which the differentiation among np operators may be achieved to a high confidence level possible presence of multiple np operators are also analysed with the optimal observable technique while the analysis can be improved even further if the final state muon polarisations are measured we present this work as a motivational tool for the experimentalists as well as a template for the analysis of similar processes | [['lepton', 'flavour', 'violating', 'lfv', 'processes', 'are', 'a', 'smoking', 'gun', 'signal', 'of', 'new', 'physics', 'np', 'if', 'the', 'semileptonic', 'b', 'decay', 'anomalies', 'are', 'indeed', 'due', 'to', 'some', 'np', 'such', 'operators', 'can', 'potentially', 'lead', 'to', 'lfv', 'decays', 'involving', 'the', 'second', 'and', 'the', 'third', 'generation', 'leptons', 'like', 'tauto', '3mu', 'in', 'this', 'paper', 'we', 'explore', 'how', 'far', 'the', 'nature', 'of', 'np', 'can', 'be', 'unraveled', 'at', 'the', 'next', 'generation', 'bfactories', 'like', 'belleii', 'provided', 'the', 'decay', 'tauto', '3mu', 'has', 'been', 'observed', 'we', 'use', 'four', 'observables', 'with', 'which', 'the', 'differentiation', 'among', 'np', 'operators', 'may', 'be', 'achieved', 'to', 'a', 'high', 'confidence', 'level', 'possible', 'presence', 'of', 'multiple', 'np', 'operators', 'are', 'also', 'analysed', 'with', 'the', 'optimal', 'observable', 'technique', 'while', 'the', 'analysis', 'can', 'be', 'improved', 'even', 'further', 'if', 'the', 'final', 'state', 'muon', 'polarisations', 'are', 'measured', 'we', 'present', 'this', 'work', 'as', 'a', 'motivational', 'tool', 'for', 'the', 'experimentalists', 'as', 'well', 'as', 'a', 'template', 'for', 'the', 'analysis', 'of', 'similar', 'processes']] | [-0.07236223679421278, 0.22307123599959344, -0.05172227819867689, 0.18217130031533024, -0.08760469471875193, -0.20098632762915103, 0.06531056797709958, 0.2917094109001859, -0.2661367022881991, -0.28566207795821386, 0.0909942190219038, -0.3093167240281814, -0.07075364118891543, 0.17290248957237808, 0.04587458818829779, 0.09520335259108707, 0.06318333376327466, -0.010446745131550163, -0.0287637534145876, -0.19793560733408508, 0.2506377295317963, 0.07369240558995255, 0.1925844010062002, 0.12021415956350492, -0.023978284476646062, -0.04223349537732529, -0.03172276203745398, -0.025427392234319245, -0.07644951595314618, 0.05661831014741469, 0.2527318905653625, 0.1696822956324844, 0.14995607855440726, -0.40380187985840543, -0.13096079640572184, 0.21008718487774503, 0.1836944590234358, 0.08946709584781964, -0.07625221417381846, -0.31946292949021504, 0.11276595568091705, -0.17084020869164118, -0.08168370635730439, -0.1365785219995626, -0.02396922909558333, -0.04361241377031045, -0.3456668171710495, 0.056935219713767735, 0.018749896179210267, 0.003236989200050975, 0.018598082680897465, -0.19128688762670962, 0.013309440776256138, 0.1033673246583805, 0.12127686891431824, 0.0347161094635998, 0.12906109712423822, -0.12137144718254948, -0.21801241694724766, 0.3906309110465749, -0.08507041058920581, -0.1981649645202761, 0.18508714777818913, -0.21745292591894494, -0.20061701058956055, 0.08130226657115694, 0.22149633607859243, 0.08665360406940353, -0.2000924499320059, 0.11250850916318274, -0.020131286387813502, 0.11883415552498451, 0.07120477998757671, 0.11477119364085255, 0.21772651421227332, 0.19628101424715513, 0.03339935952861761, 0.07119527317519332, -0.08875771548823806, 0.016223053633765284, -0.36770492667243976, -0.14895500670476206, -0.07526989361785096, 0.09222268039713903, -0.006875586545733125, -0.08177774000655988, 0.3967101554835922, 0.09958398655008782, 0.22642159670077522, -0.0076406345839194695, 0.28984803430222233, 0.12852628052892998, 0.08663399501679593, 0.015388997355154876, 0.3032224490413651, 0.1010895722417225, 0.12020396941084543, -0.2310106111901154, 0.11577487265498473, 0.020655636884400558] |
1,802.09219 | Digital Archives as Big Data | Digital archives contribute to Big data. Combining social network analysis,
coincidence analysis, data reduction, and visual analytics leads to better
characterize topics over time, publishers' main themes and best authors of all
times, according to the British newspaper The Guardian and from the 3 million
records of the British National Bibliography.
| cs.DL | digital archives contribute to big data combining social network analysis coincidence analysis data reduction and visual analytics leads to better characterize topics over time publishers main themes and best authors of all times according to the british newspaper the guardian and from the 3 million records of the british national bibliography | [['digital', 'archives', 'contribute', 'to', 'big', 'data', 'combining', 'social', 'network', 'analysis', 'coincidence', 'analysis', 'data', 'reduction', 'and', 'visual', 'analytics', 'leads', 'to', 'better', 'characterize', 'topics', 'over', 'time', 'publishers', 'main', 'themes', 'and', 'best', 'authors', 'of', 'all', 'times', 'according', 'to', 'the', 'british', 'newspaper', 'the', 'guardian', 'and', 'from', 'the', '3', 'million', 'records', 'of', 'the', 'british', 'national', 'bibliography']] | [-0.00972442134447834, -0.04049902263681824, -0.060916018599242554, 0.08785279958928917, -0.16453114549136338, -0.07117120194814953, 0.12147209650206872, 0.3103738298785745, -0.23086096711602866, -0.40590353025233045, 0.12633488548225633, -0.4636546354740858, -0.09741439075008326, 0.2046705397101594, -0.11461867039621461, -0.026277638241356493, 0.1311062429666373, 0.034890796605716735, 0.011239142704974203, -0.3760351647951585, 0.28661993886891973, 0.1064412745774961, 0.3947063185201556, -0.007613854923322066, 0.03475870816128365, -0.0013700964331042533, -0.24805934403968208, -0.07346760513909804, -0.11189133063981346, 0.17892861765279783, 0.4057356981816245, 0.30145323451827555, 0.3336554762049049, -0.40992062882173297, -0.12194580309019953, 0.08806876354841127, 0.08952349679106299, 0.04884693807210116, 0.05078939872099927, -0.3686891665645674, 0.08154393684840304, -0.18687006097067804, -0.03808539040277109, -0.04410931308452478, 0.04068835740726368, 0.035231405684231394, -0.1760345392440464, 0.04844016957955033, -0.02903973508407088, 0.16745039694668615, -0.04943160986637368, -0.15144220892997348, 0.007229722068444186, 0.26082114487265545, 0.10111688727549478, 0.044268361012013084, 0.13643342183501111, -0.10766399711571342, -0.1681035359700521, 0.3977080019391781, -0.029272024903227303, 0.009611540935093574, 0.15371766368237635, -0.09581347741186619, -0.13284840991642946, 0.09760106667218839, 0.2723021218165134, -0.026595939526005703, -0.21865486176501886, 0.001709493887199856, -0.03440466061161429, 0.24207834439242587, 0.1339670521225415, -0.031209018521978722, 0.147383364081821, 0.20289428835259934, 0.0023096239230796403, 0.04485916581881397, -0.05937605168597371, -0.10032744217189211, -0.2010536651108779, -0.1316456287624497, -0.10121580052837803, 0.02107256101718282, -0.09441412444706943, -0.08445887924993739, 0.44426722762485343, 0.18439810662804282, 0.14012317125703774, -0.0244138930540751, 0.28269104595643046, -0.07096424768222313, 0.10873156805595785, 0.11941556961220853, 0.07783880627111477, 0.016710900975500837, 0.3042197481194949, -0.05445312531025825, 0.03593780816185708, 0.011452484885048048] |
1,802.0922 | The Trusted Server: A secure computational environment for privacy
compliant evaluations on plain personal data | A growing framework of legal and ethical requirements limit scientific and
commercial evalua-tion of personal data. Typically, pseudonymization,
encryption, or methods of distributed com-puting try to protect individual
privacy. However, computational infrastructures still depend on human system
administrators. This introduces severe security risks and has strong impact on
privacy: system administrators have unlimited access to the computers that they
manage in-cluding encryption keys and pseudonymization-tables. Distributed
computing and data obfuscation technologies reduce but do not eliminate the
risk of privacy leakage by administrators. They produce higher implementation
effort and possible data quality degradation. This paper proposes the Trusted
Server as an alternative approach that provides a sealed and inaccessible
computational environment in a cryptographically strict sense. During operation
or by direct physical access to storage media, data stored and processed inside
the Trusted Server can by no means be read, manipulated or leaked, other than
by brute-force. Thus, secure and privacy-compliant data processing or
evaluation of plain person-related data becomes possible even from multiple
sources, which want their data kept mutually secret.
| cs.CR cs.CY | a growing framework of legal and ethical requirements limit scientific and commercial evaluation of personal data typically pseudonymization encryption or methods of distributed computing try to protect individual privacy however computational infrastructures still depend on human system administrators this introduces severe security risks and has strong impact on privacy system administrators have unlimited access to the computers that they manage including encryption keys and pseudonymizationtables distributed computing and data obfuscation technologies reduce but do not eliminate the risk of privacy leakage by administrators they produce higher implementation effort and possible data quality degradation this paper proposes the trusted server as an alternative approach that provides a sealed and inaccessible computational environment in a cryptographically strict sense during operation or by direct physical access to storage media data stored and processed inside the trusted server can by no means be read manipulated or leaked other than by bruteforce thus secure and privacycompliant data processing or evaluation of plain personrelated data becomes possible even from multiple sources which want their data kept mutually secret | [['a', 'growing', 'framework', 'of', 'legal', 'and', 'ethical', 'requirements', 'limit', 'scientific', 'and', 'commercial', 'evaluation', 'of', 'personal', 'data', 'typically', 'pseudonymization', 'encryption', 'or', 'methods', 'of', 'distributed', 'computing', 'try', 'to', 'protect', 'individual', 'privacy', 'however', 'computational', 'infrastructures', 'still', 'depend', 'on', 'human', 'system', 'administrators', 'this', 'introduces', 'severe', 'security', 'risks', 'and', 'has', 'strong', 'impact', 'on', 'privacy', 'system', 'administrators', 'have', 'unlimited', 'access', 'to', 'the', 'computers', 'that', 'they', 'manage', 'including', 'encryption', 'keys', 'and', 'pseudonymizationtables', 'distributed', 'computing', 'and', 'data', 'obfuscation', 'technologies', 'reduce', 'but', 'do', 'not', 'eliminate', 'the', 'risk', 'of', 'privacy', 'leakage', 'by', 'administrators', 'they', 'produce', 'higher', 'implementation', 'effort', 'and', 'possible', 'data', 'quality', 'degradation', 'this', 'paper', 'proposes', 'the', 'trusted', 'server', 'as', 'an', 'alternative', 'approach', 'that', 'provides', 'a', 'sealed', 'and', 'inaccessible', 'computational', 'environment', 'in', 'a', 'cryptographically', 'strict', 'sense', 'during', 'operation', 'or', 'by', 'direct', 'physical', 'access', 'to', 'storage', 'media', 'data', 'stored', 'and', 'processed', 'inside', 'the', 'trusted', 'server', 'can', 'by', 'no', 'means', 'be', 'read', 'manipulated', 'or', 'leaked', 'other', 'than', 'by', 'bruteforce', 'thus', 'secure', 'and', 'privacycompliant', 'data', 'processing', 'or', 'evaluation', 'of', 'plain', 'personrelated', 'data', 'becomes', 'possible', 'even', 'from', 'multiple', 'sources', 'which', 'want', 'their', 'data', 'kept', 'mutually', 'secret']] | [-0.18807692387383126, 0.01712591984730915, -0.05420075881937962, 0.07165479709718577, -0.12717064442057607, -0.2764972215767817, 0.16750054341710416, 0.3671973347946256, -0.2966620652115948, -0.37139336140050244, 0.1696863897592439, -0.3140284899577853, -0.04588742342145581, 0.19064615304385024, -0.18590368382034025, 0.10094112274236977, 0.06503458528632541, -0.0029681471226337764, 0.023711075380560942, -0.31580388551464283, 0.28609511687509004, 0.09449406110798009, 0.37764113550517886, 0.049053049890235775, 0.03680662361702638, -0.00740098316011773, -0.08606584978544907, -0.04456926958491316, -0.04144081586760183, 0.1560819262678186, 0.3478611560200252, 0.2588726985656346, 0.35630820005116265, -0.5078646138842616, -0.1345885770570021, 0.10123397674552896, 0.16927128147965828, 0.08732212741978444, -0.08383845407765225, -0.3211749499951977, 0.0949675820465061, -0.25818929172722466, -0.06509456557216167, -0.13939306971206816, -0.03304693859536201, -0.026336832039218973, -0.23193657037613558, -0.020756276823314174, 0.01668858817651025, 0.11151433576430593, 0.039973036686812215, -0.029763748122301575, -0.018881234972338592, 0.20597562251801027, 0.026607222310433696, -0.01444998945676378, 0.22390912643770985, -0.12916981301913483, -0.1359324217531442, 0.38356163405391963, 0.060958283297406435, -0.19052284978707099, 0.1696124768526975, -0.015305513202855807, -0.12385105894091317, 0.12874258322214396, 0.22587980948654668, 0.0010966511049662672, -0.21706884155338185, 0.04660205213960061, 0.048994968207331284, 0.24952360897857165, 0.10017676304172103, 0.12071595889158614, 0.1776209071616731, 0.12777921748732166, 0.08484642240814753, 0.0928126191405075, 0.0011070873394298057, -0.08305627041859441, -0.19178279772590723, -0.14860793068683484, -0.19732645508234523, 0.04952615042020625, -0.04684301783787045, -0.15361940140324545, 0.26211236069987837, 0.23429751658390852, 0.08753514169560124, 0.026842381556413046, 0.46574435094814925, -0.0034018272064193817, 0.16123190702221887, 0.15790443887401903, 0.15007510559267498, -0.044507935618249964, 0.20222143946392906, -0.125304764526109, 0.2066177928049694, -0.08231876162712329] |
1,802.09221 | Data-Driven Source Separation Based on Simplex Analysis | Blind source separation (BSS) is addressed, using a novel data-driven
approach, based on a well-established probabilistic model. The proposed method
is specifically designed for separation of multichannel audio mixtures. The
algorithm relies on spectral decomposition of the correlation matrix between
different time frames. The probabilistic model implies that the column space of
the correlation matrix is spanned by the probabilities of the various speakers
across time. The number of speakers is recovered by the eigenvalue decay, and
the eigenvectors form a simplex of the speakers' probabilities. Time frames
dominated by each of the speakers are identified exploiting convex geometry
tools on the recovered simplex. The mixing acoustic channels are estimated
utilizing the identified sets of frames, and a linear umixing is performed to
extract the individual speakers. The derived simplexes are visually
demonstrated for mixtures of 2, 3 and 4 speakers. We also conduct a
comprehensive experimental study, showing high separation capabilities in
various reverberation conditions.
| eess.AS cs.SD eess.SP | blind source separation bss is addressed using a novel datadriven approach based on a wellestablished probabilistic model the proposed method is specifically designed for separation of multichannel audio mixtures the algorithm relies on spectral decomposition of the correlation matrix between different time frames the probabilistic model implies that the column space of the correlation matrix is spanned by the probabilities of the various speakers across time the number of speakers is recovered by the eigenvalue decay and the eigenvectors form a simplex of the speakers probabilities time frames dominated by each of the speakers are identified exploiting convex geometry tools on the recovered simplex the mixing acoustic channels are estimated utilizing the identified sets of frames and a linear umixing is performed to extract the individual speakers the derived simplexes are visually demonstrated for mixtures of 2 3 and 4 speakers we also conduct a comprehensive experimental study showing high separation capabilities in various reverberation conditions | [['blind', 'source', 'separation', 'bss', 'is', 'addressed', 'using', 'a', 'novel', 'datadriven', 'approach', 'based', 'on', 'a', 'wellestablished', 'probabilistic', 'model', 'the', 'proposed', 'method', 'is', 'specifically', 'designed', 'for', 'separation', 'of', 'multichannel', 'audio', 'mixtures', 'the', 'algorithm', 'relies', 'on', 'spectral', 'decomposition', 'of', 'the', 'correlation', 'matrix', 'between', 'different', 'time', 'frames', 'the', 'probabilistic', 'model', 'implies', 'that', 'the', 'column', 'space', 'of', 'the', 'correlation', 'matrix', 'is', 'spanned', 'by', 'the', 'probabilities', 'of', 'the', 'various', 'speakers', 'across', 'time', 'the', 'number', 'of', 'speakers', 'is', 'recovered', 'by', 'the', 'eigenvalue', 'decay', 'and', 'the', 'eigenvectors', 'form', 'a', 'simplex', 'of', 'the', 'speakers', 'probabilities', 'time', 'frames', 'dominated', 'by', 'each', 'of', 'the', 'speakers', 'are', 'identified', 'exploiting', 'convex', 'geometry', 'tools', 'on', 'the', 'recovered', 'simplex', 'the', 'mixing', 'acoustic', 'channels', 'are', 'estimated', 'utilizing', 'the', 'identified', 'sets', 'of', 'frames', 'and', 'a', 'linear', 'umixing', 'is', 'performed', 'to', 'extract', 'the', 'individual', 'speakers', 'the', 'derived', 'simplexes', 'are', 'visually', 'demonstrated', 'for', 'mixtures', 'of', '2', '3', 'and', '4', 'speakers', 'we', 'also', 'conduct', 'a', 'comprehensive', 'experimental', 'study', 'showing', 'high', 'separation', 'capabilities', 'in', 'various', 'reverberation', 'conditions']] | [-0.0966278740400148, 0.07616410247020183, -0.07224592224003808, 0.0859693835196536, -0.031741825273380646, -0.14338774346716462, 0.0578062592254531, 0.3870610476621697, -0.26518335699013645, -0.2848811962401434, 0.08967713779214048, -0.2627507676821082, -0.12927294283384277, 0.16878550683050567, -0.039504519555597535, 0.08018466125753138, 0.07048058688280083, 0.019613001183156044, -0.0936686270494735, -0.2211802853091109, 0.3130000471272656, 0.04007297058499629, 0.2995381326407134, -0.014652841436045784, 0.15236755621228967, 0.005863052002725101, -0.1263061183685016, -0.0016770239703492412, -0.06036874523800385, 0.1359752950709193, 0.2766768219535269, 0.20615634775810665, 0.25987512006634667, -0.3765636335097013, -0.196806749871241, 0.07552773175580847, 0.11259983513023585, 0.07844878366036762, -0.027371553571203782, -0.36097877071269097, 0.08021300160025636, -0.12052844948240465, -0.02117680724289629, -0.04635399360389959, -0.001016240056243635, 0.013222928271598874, -0.2822656218202845, 0.09583392129711536, 0.05770340304250919, 0.08894104204711414, -0.06418516895538497, -0.15785162398411381, 0.03747598413347958, 0.16964634785789154, 0.004440361222312335, -0.023102405798741645, 0.12248101764839263, -0.06325036587734376, -0.09559733303143612, 0.36652178927775353, -0.043007771700860994, -0.24295671409176242, 0.19538016353523538, -0.10772707751246109, -0.08483808066906227, 0.12973900812888337, 0.18972681798040866, 0.12226625399198383, -0.17885780565801165, 0.03922876696620557, -0.060796614907561775, 0.22307233127254633, 0.09507798058912158, 0.014241593721653185, 0.1771929796094135, 0.17717467866116954, 0.01697667732632028, 0.15156979753725952, -0.1435291103012259, -0.05908892997240107, -0.26182334946708813, -0.10785499301048056, -0.25203443583882146, -0.05627709260630992, -0.1089633621933547, -0.12085792959457443, 0.42099637242124205, 0.10848329540101752, 0.19259401286741898, 0.10495948785025958, 0.28220140591203685, 0.07179264561423371, 0.03823150478814158, 0.05065782192433553, 0.19082704844749382, 0.12689757461269055, 0.07708245695178066, -0.20909973304538476, 0.0852381549985899, 0.0908612790314721] |
1,802.09222 | Observable signatures of wind--driven chemistry with a fully consistent
three dimensional radiative hydrodynamics model of HD 209458b | We present a study of the effect of wind-driven advection on the chemical
composition of hot Jupiter atmospheres using a fully-consistent 3D
hydrodynamics, chemistry and radiative transfer code, the Met Office Unified
Model (UM). Chemical modelling of exoplanet atmospheres has primarily been
restricted to 1D models that cannot account for 3D dynamical processes. In this
work we couple a chemical relaxation scheme to the UM to account for the
chemical interconversion of methane and carbon monoxide. This is done
consistently with the radiative transfer meaning that departures from chemical
equilibrium are included in the heating rates (and emission) and hence complete
the feedback between the dynamics, thermal structure and chemical composition.
In this letter we simulate the well studied atmosphere of HD~209458b. We find
that the combined effect of horizontal and vertical advection leads to an
increase in the methane abundance by several orders of magnitude; directly
opposite to the trend found in previous works. Our results demonstrate the need
to include 3D effects when considering the chemistry of hot Jupiter
atmospheres. We calculate transmission and emission spectra, as well as the
emission phase curve, from our simulations. We conclude that gas-phase
non-equilibrium chemistry is unlikely to explain the model-observation
discrepancy in the 4.5\,{\textmu m} {\it Spitzer}/IRAC channel. However, we
highlight other spectral regions, observable with the James Webb Space
Telescope, where signatures of wind-driven chemistry are more prominant.
| astro-ph.EP | we present a study of the effect of winddriven advection on the chemical composition of hot jupiter atmospheres using a fullyconsistent 3d hydrodynamics chemistry and radiative transfer code the met office unified model um chemical modelling of exoplanet atmospheres has primarily been restricted to 1d models that cannot account for 3d dynamical processes in this work we couple a chemical relaxation scheme to the um to account for the chemical interconversion of methane and carbon monoxide this is done consistently with the radiative transfer meaning that departures from chemical equilibrium are included in the heating rates and emission and hence complete the feedback between the dynamics thermal structure and chemical composition in this letter we simulate the well studied atmosphere of hd209458b we find that the combined effect of horizontal and vertical advection leads to an increase in the methane abundance by several orders of magnitude directly opposite to the trend found in previous works our results demonstrate the need to include 3d effects when considering the chemistry of hot jupiter atmospheres we calculate transmission and emission spectra as well as the emission phase curve from our simulations we conclude that gasphase nonequilibrium chemistry is unlikely to explain the modelobservation discrepancy in the 45textmu m it spitzerirac channel however we highlight other spectral regions observable with the james webb space telescope where signatures of winddriven chemistry are more prominant | [['we', 'present', 'a', 'study', 'of', 'the', 'effect', 'of', 'winddriven', 'advection', 'on', 'the', 'chemical', 'composition', 'of', 'hot', 'jupiter', 'atmospheres', 'using', 'a', 'fullyconsistent', '3d', 'hydrodynamics', 'chemistry', 'and', 'radiative', 'transfer', 'code', 'the', 'met', 'office', 'unified', 'model', 'um', 'chemical', 'modelling', 'of', 'exoplanet', 'atmospheres', 'has', 'primarily', 'been', 'restricted', 'to', '1d', 'models', 'that', 'can', 'not', 'account', 'for', '3d', 'dynamical', 'processes', 'in', 'this', 'work', 'we', 'couple', 'a', 'chemical', 'relaxation', 'scheme', 'to', 'the', 'um', 'to', 'account', 'for', 'the', 'chemical', 'interconversion', 'of', 'methane', 'and', 'carbon', 'monoxide', 'this', 'is', 'done', 'consistently', 'with', 'the', 'radiative', 'transfer', 'meaning', 'that', 'departures', 'from', 'chemical', 'equilibrium', 'are', 'included', 'in', 'the', 'heating', 'rates', 'and', 'emission', 'and', 'hence', 'complete', 'the', 'feedback', 'between', 'the', 'dynamics', 'thermal', 'structure', 'and', 'chemical', 'composition', 'in', 'this', 'letter', 'we', 'simulate', 'the', 'well', 'studied', 'atmosphere', 'of', 'hd209458b', 'we', 'find', 'that', 'the', 'combined', 'effect', 'of', 'horizontal', 'and', 'vertical', 'advection', 'leads', 'to', 'an', 'increase', 'in', 'the', 'methane', 'abundance', 'by', 'several', 'orders', 'of', 'magnitude', 'directly', 'opposite', 'to', 'the', 'trend', 'found', 'in', 'previous', 'works', 'our', 'results', 'demonstrate', 'the', 'need', 'to', 'include', '3d', 'effects', 'when', 'considering', 'the', 'chemistry', 'of', 'hot', 'jupiter', 'atmospheres', 'we', 'calculate', 'transmission', 'and', 'emission', 'spectra', 'as', 'well', 'as', 'the', 'emission', 'phase', 'curve', 'from', 'our', 'simulations', 'we', 'conclude', 'that', 'gasphase', 'nonequilibrium', 'chemistry', 'is', 'unlikely', 'to', 'explain', 'the', 'modelobservation', 'discrepancy', 'in', 'the', '45textmu', 'm', 'it', 'spitzerirac', 'channel', 'however', 'we', 'highlight', 'other', 'spectral', 'regions', 'observable', 'with', 'the', 'james', 'webb', 'space', 'telescope', 'where', 'signatures', 'of', 'winddriven', 'chemistry', 'are', 'more', 'prominant']] | [-0.040123326308907345, 0.12081969973554187, -0.0642988207632082, 0.06458684020547611, -0.04721201523603652, -0.0645564196912946, 0.05113459836237141, 0.4035447444034716, -0.2431125011616366, -0.3363922125371132, 0.05532387905249852, -0.2548213525630501, -0.10996660151657156, 0.16793567752140254, -0.02470645887419321, 0.013546477569120745, 0.0699392663249868, -0.1212479018018577, -0.01884429554930811, -0.21755523161503068, 0.2979150794418, 0.10858366128838089, 0.17112717385135395, 0.07892729667031641, 0.0003139798256963101, -0.10332475108090447, -0.07287920368265963, -0.021408093356203053, -0.16727573915568228, 0.04741586806348171, 0.21042132761917398, 0.08071478521634365, 0.16054733787809689, -0.4455630678894999, -0.33453014300623707, 0.08431165713174309, 0.13592195793616232, 0.1093380305322302, -0.08031040061435278, -0.1987037887343299, 0.006735970149239663, -0.16981287262561084, -0.10999244373234794, -0.026736774804135662, 0.022470207580906138, -0.015438783746241634, -0.27048487546213185, 0.07231943261520897, 0.05288768815591943, 0.10591063801784834, -0.11485611619712484, -0.14739130184412264, -0.11920787583310645, 0.12703300998091197, -0.016349810510609446, -0.008970033215749277, 0.17775006835932505, -0.1085006042462916, -0.05473553369382974, 0.45305809785721735, -0.14977238817073357, -0.10178911345136478, 0.2563782166748096, -0.19649185087556206, -0.1217708980388061, 0.15787670842074997, 0.1575736105035356, 0.1270599205099762, -0.17207742023428416, 0.039150403029901505, -0.013670181017775724, 0.15695431253946016, 0.026253942294477375, 0.021785941251500726, 0.2735512767784708, 0.15818299527847365, 0.0016610701385413715, 0.11607902814805972, -0.1603656424988289, -0.11254832248902966, -0.2123190388083458, -0.1794113158655056, -0.12772870929728722, 0.055930625148156686, -0.0505921701615596, -0.13205178324478845, 0.34775338860998, 0.19817806691679632, 0.17415433633649582, 0.0006782698381984989, 0.34267273328295506, 0.07715923554674767, 0.06902505755505838, 0.07761564462823899, 0.27359708860174925, 0.15610738685374925, 0.13826300830511157, -0.3046784085815358, 0.08355959029827575, 0.01289829373863977] |
1,802.09223 | Commuting varieties for nilpotent radicals | Let U be the unipotent radical of a Borel subgroup of a connected reductive
algebraic group G, which is defined over an algebraically closed field k. In
this paper, we extend work by Goodwin-R\"ohrle concerning the commuting variety
of Lie(U) for char(k)=0 to fields, whose characteristic is good for G
| math.RT | let u be the unipotent radical of a borel subgroup of a connected reductive algebraic group g which is defined over an algebraically closed field k in this paper we extend work by goodwinrohrle concerning the commuting variety of lieu for chark0 to fields whose characteristic is good for g | [['let', 'u', 'be', 'the', 'unipotent', 'radical', 'of', 'a', 'borel', 'subgroup', 'of', 'a', 'connected', 'reductive', 'algebraic', 'group', 'g', 'which', 'is', 'defined', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'in', 'this', 'paper', 'we', 'extend', 'work', 'by', 'goodwinrohrle', 'concerning', 'the', 'commuting', 'variety', 'of', 'lieu', 'for', 'chark0', 'to', 'fields', 'whose', 'characteristic', 'is', 'good', 'for', 'g']] | [-0.26311858467833726, 0.10266909065296427, -0.1016971123765926, -0.062016152270727466, -0.13932251686952551, -0.11989681718262787, -0.006265999373922847, 0.3294809912996633, -0.33807816484714953, -0.18334320411846347, 0.04071829460171641, -0.19791102801848734, -0.07352361338669244, 0.2585141649659799, -0.1380734872453067, -0.09854172904529057, 0.012655920976278733, 0.19199934992369036, -0.04716170948873065, -0.2905913654106612, 0.4198018371754763, -0.10052143474470596, 0.19274622536435418, 0.04371771818901203, 0.08952025675728005, 0.025024219739193818, 0.007889591081410038, 0.0526142435300411, -0.1270944710288729, 0.11493222890611814, 0.3956918854038326, 0.062070597533364684, 0.2642909306652692, -0.35717170791966574, -0.1871114598054971, 0.29600521625608817, 0.19384616731228876, -0.06024473828824275, 0.005358411075205219, -0.29624057367291984, 0.16468717977024463, -0.1949501681160562, -0.17014695411281927, -0.05620661721925954, 0.1418242145125393, -0.015285095409015003, -0.2930506776486124, -0.019785503533725837, 0.07241122964864635, 0.2287951416469046, 0.005598927762511433, -0.10582358519100032, -0.0003605705676410271, 0.05419673160554803, -0.016520364751697193, 0.1608081634289452, 0.06209796851462856, -0.049079999436947463, -0.08833939184871864, 0.3930222790745296, -0.14531664468576105, -0.1733516179861463, 0.09354401535677667, -0.17767484825370566, -0.09817795580899229, 0.12724266516766986, 0.13098963752997164, 0.18205656240485152, -0.06105489000602036, 0.2604660988804333, -0.20797324623456415, 0.003154218995145389, 0.03318014279083938, -0.05646096185153844, 0.11714741572433589, 0.051335560718589295, 0.07200606769825123, 0.06725309084749267, 0.11987059460762813, 0.06127826481218906, -0.37158290996235244, -0.18947617147992157, -0.12304733792433933, 0.21617170208494882, -0.07034819845908455, -0.18567881501298777, 0.4711929404613923, 0.0797844076034974, 0.1451540467880514, 0.11235064445110989, 0.16755814666916824, 0.05890541589742868, 0.040954034262317786, 0.11435261283221902, 0.02098618204496345, 0.3337055976949252, -0.1451831208090583, -0.18950022420636853, -0.007110612191335887, 0.14342378201533337] |
1,802.09224 | Controllability and observability for non-autonomous evolution
equations: the averaged Hautus test | We consider the observability problem for non-autonomous evolution systems
(i.e., the operators governing the system depend on time). We introduce an
averaged Hautus condition and prove that for skew-adjoint operators it
characterizes exact observability. Next, we extend this to more general class
of operators under a growth condition on the associated evolution family. We
give an application to the Schr\"odinger equation with time dependent potential
and the damped wave equation with a time dependent damping coefficient.
| math.AP math.OC | we consider the observability problem for nonautonomous evolution systems ie the operators governing the system depend on time we introduce an averaged hautus condition and prove that for skewadjoint operators it characterizes exact observability next we extend this to more general class of operators under a growth condition on the associated evolution family we give an application to the schrodinger equation with time dependent potential and the damped wave equation with a time dependent damping coefficient | [['we', 'consider', 'the', 'observability', 'problem', 'for', 'nonautonomous', 'evolution', 'systems', 'ie', 'the', 'operators', 'governing', 'the', 'system', 'depend', 'on', 'time', 'we', 'introduce', 'an', 'averaged', 'hautus', 'condition', 'and', 'prove', 'that', 'for', 'skewadjoint', 'operators', 'it', 'characterizes', 'exact', 'observability', 'next', 'we', 'extend', 'this', 'to', 'more', 'general', 'class', 'of', 'operators', 'under', 'a', 'growth', 'condition', 'on', 'the', 'associated', 'evolution', 'family', 'we', 'give', 'an', 'application', 'to', 'the', 'schrodinger', 'equation', 'with', 'time', 'dependent', 'potential', 'and', 'the', 'damped', 'wave', 'equation', 'with', 'a', 'time', 'dependent', 'damping', 'coefficient']] | [-0.18924751881920537, 0.09285065143615755, -0.046885953064223655, 0.06394385325103558, -0.09500002124236505, -0.1213967457389165, -0.038533233841390985, 0.3080530066570071, -0.3004593373962531, -0.19641138757824114, 0.15187940275446685, -0.26494219119807605, -0.17045005050634868, 0.2071147840837703, -0.003752659477820424, 0.08932538134487052, 0.05559569920756315, 0.05032257647805014, -0.1068832912316889, -0.21777401008569686, 0.4396883728423793, 0.020010876542839565, 0.21730926985803403, 0.04308221402415687, 0.13912893993485914, 0.05359743646725914, 0.000890564639121294, -0.021898164340343914, -0.19985349662649815, 0.04415758362033797, 0.1502670901214802, 0.08786109359751113, 0.28666609004875154, -0.4353871808730458, -0.19177385751084475, 0.14923660898287044, 0.1153698440849487, 0.11454176211937968, -0.03316124312761148, -0.28869288226001355, 0.011558363486792109, -0.1323924387413028, -0.21857818989634611, -0.05500463910376359, 0.07126886623078271, 0.048535543102556596, -0.32335139138280955, 0.13311561407202757, 0.07059253400534783, -0.002467736283219174, -0.18001476476753228, -0.01921391898557838, 0.0018490710736889589, 0.061171707934638685, -0.011322195588084134, -0.046929474356339165, 0.07277790938602074, -0.06010699257144312, -0.06923901444717653, 0.35156247135187424, -0.13441226156244643, -0.2943186457513979, 0.13106701055834205, -0.1379522100813981, -0.16087368638009616, 0.05671803446143473, 0.21451225577804603, 0.1745160931574279, -0.15298875031600656, 0.10712064366242358, -0.03219721188112377, 0.16065643204523153, 0.036709101454011704, 0.07027913923880796, 0.07868674033823864, 0.15996603504448248, 0.16759690054919033, 0.1406843720021578, 0.042555056926702445, -0.10814404487609863, -0.3300817538248865, -0.15141782620891095, -0.10443133268946488, 0.0917201718002616, -0.06958184427371873, -0.1923171925024546, 0.42125042993575335, 0.19570411121668785, 0.178427432026518, 0.13899853794627184, 0.19053928402105444, 0.28790931808027, 0.017843354861006924, 0.07681459701301432, 0.1562956892395098, 0.15859227757410785, 0.156068104147715, -0.2842935532404992, 0.06807437561770999, 0.12882956712947866] |
1,802.09225 | Interpreting Complex Regression Models | Interpretation of a machine learning induced models is critical for feature
engineering, debugging, and, arguably, compliance. Yet, best of breed machine
learning models tend to be very complex. This paper presents a method for model
interpretation which has the main benefit that the simple interpretations it
provides are always grounded in actual sets of learning examples. The method is
validated on the task of interpreting a complex regression model in the context
of both an academic problem -- predicting the year in which a song was recorded
and an industrial one -- predicting mail user churn.
| cs.LG stat.ML | interpretation of a machine learning induced models is critical for feature engineering debugging and arguably compliance yet best of breed machine learning models tend to be very complex this paper presents a method for model interpretation which has the main benefit that the simple interpretations it provides are always grounded in actual sets of learning examples the method is validated on the task of interpreting a complex regression model in the context of both an academic problem predicting the year in which a song was recorded and an industrial one predicting mail user churn | [['interpretation', 'of', 'a', 'machine', 'learning', 'induced', 'models', 'is', 'critical', 'for', 'feature', 'engineering', 'debugging', 'and', 'arguably', 'compliance', 'yet', 'best', 'of', 'breed', 'machine', 'learning', 'models', 'tend', 'to', 'be', 'very', 'complex', 'this', 'paper', 'presents', 'a', 'method', 'for', 'model', 'interpretation', 'which', 'has', 'the', 'main', 'benefit', 'that', 'the', 'simple', 'interpretations', 'it', 'provides', 'are', 'always', 'grounded', 'in', 'actual', 'sets', 'of', 'learning', 'examples', 'the', 'method', 'is', 'validated', 'on', 'the', 'task', 'of', 'interpreting', 'a', 'complex', 'regression', 'model', 'in', 'the', 'context', 'of', 'both', 'an', 'academic', 'problem', 'predicting', 'the', 'year', 'in', 'which', 'a', 'song', 'was', 'recorded', 'and', 'an', 'industrial', 'one', 'predicting', 'mail', 'user', 'churn']] | [-0.050574354039742905, 0.004783929006426912, -0.09030967410542368, 0.08958278632688119, -0.12435143131842004, -0.20366870313684673, 0.019550518371769167, 0.38879357119824026, -0.24828819751224301, -0.34237499094687085, 0.0944493283193182, -0.26914623263292015, -0.20488585485702757, 0.25179878625761165, -0.12446247821951166, 0.0672721076271239, 0.10172624861266702, 0.06819647932028834, 0.007246242167348874, -0.26847147059805215, 0.2746797578813052, 0.07179802695309069, 0.3236662307556005, 0.050057510640397866, 0.093865047456657, -0.025398450016856512, -0.04074258979984579, -0.009074188496402286, -0.03726012608263347, 0.20466315399987273, 0.3500425477665905, 0.23242268086648843, 0.3507186482918072, -0.36478406745702663, -0.2352898048999858, 0.11141756852157414, 0.10608192409408536, 0.09873041663903426, -0.04123933353718925, -0.28255368137058423, 0.06555709346851453, -0.19267641601866073, -0.0648963722410275, -0.11584620702357844, 0.016340082283429008, -0.07045762550997291, -0.2721627933478498, 0.009204773326463838, 0.0838869471261476, 0.11910168190506544, -0.07181690293710996, -0.1027817346423151, 0.035627692794189494, 0.15061032579855083, 0.06184844423501574, 0.04950726486276835, 0.1334230039328178, -0.19185225474103254, -0.1684221666160119, 0.4165542182770181, -0.002605394797122225, -0.17755055019478413, 0.22446001872068588, -0.025788377296734364, -0.16452683816029828, 0.061143316655479216, 0.2261101944629658, 0.10050113810265952, -0.18952085229350216, 0.03306562742936683, -0.05918014218332246, 0.15366898891961875, 0.015537162990051699, -0.0921147988336359, 0.22314885164551596, 0.30029517838711595, 0.0052173359052060135, 0.09069414210302676, -0.03888775681472443, -0.09409806302728806, -0.24907504558870372, -0.1559286652667884, -0.1800668997135251, -0.021551844329533585, -0.060937094571195206, -0.18220317600532732, 0.4204559445064119, 0.19202925130090814, 0.19159065355408064, 0.06070389572600339, 0.33354132449343565, 0.09242097067924097, 0.061222257062872036, 0.053932794227953405, 0.1983670847777753, 0.02981110749409554, 0.1418401726293675, -0.13769945087149105, 0.17767728473793, 0.029140972532331944] |
1,802.09226 | Power variations for a class of Brown-Resnick processes | We consider the class of simple Brown-Resnick max-stable processes whose
spectral processes are continuous exponential martingales. We develop the
asymptotic theory for the realized power variations of these max-stable
processes, that is, sums of powers of absolute increments. We consider an
infill asymptotic setting, where the sampling frequency converges to zero while
the time span remains fixed. More specifically we obtain a biased central limit
theorem whose bias depend on the local times of the differences between the
logarithms of the underlying spectral processes.
| math.ST stat.TH | we consider the class of simple brownresnick maxstable processes whose spectral processes are continuous exponential martingales we develop the asymptotic theory for the realized power variations of these maxstable processes that is sums of powers of absolute increments we consider an infill asymptotic setting where the sampling frequency converges to zero while the time span remains fixed more specifically we obtain a biased central limit theorem whose bias depend on the local times of the differences between the logarithms of the underlying spectral processes | [['we', 'consider', 'the', 'class', 'of', 'simple', 'brownresnick', 'maxstable', 'processes', 'whose', 'spectral', 'processes', 'are', 'continuous', 'exponential', 'martingales', 'we', 'develop', 'the', 'asymptotic', 'theory', 'for', 'the', 'realized', 'power', 'variations', 'of', 'these', 'maxstable', 'processes', 'that', 'is', 'sums', 'of', 'powers', 'of', 'absolute', 'increments', 'we', 'consider', 'an', 'infill', 'asymptotic', 'setting', 'where', 'the', 'sampling', 'frequency', 'converges', 'to', 'zero', 'while', 'the', 'time', 'span', 'remains', 'fixed', 'more', 'specifically', 'we', 'obtain', 'a', 'biased', 'central', 'limit', 'theorem', 'whose', 'bias', 'depend', 'on', 'the', 'local', 'times', 'of', 'the', 'differences', 'between', 'the', 'logarithms', 'of', 'the', 'underlying', 'spectral', 'processes']] | [-0.11216931993978851, 0.1494523283231718, -0.12534524099568703, 0.11158097303234085, -0.022346536831242873, -0.06947172919310451, 0.07115971662625227, 0.3980248369764359, -0.27828246044615906, -0.1976751092643965, 0.12626452845731928, -0.20943024943525893, -0.09192204541925873, 0.18326290279981636, -0.06228936787894262, 0.040829428258196764, -0.025467220183816693, 0.016595632225895923, -0.056048634814076306, -0.210004455437662, 0.3236100723068895, 0.03852944115975073, 0.26959504794684197, -0.025906654983936322, 0.13725863374808492, 0.02732535792026846, -0.09437905743141614, -0.05483624296972439, -0.14746824515350454, 0.11223940662707069, 0.23696032670947412, 0.05177874871463116, 0.30417842602002476, -0.38527802700298797, -0.1796272605369311, 0.21983649244066328, 0.13604221960745885, 0.007901733937961538, 0.018302583299719982, -0.21924060424568043, 0.08178970314717542, -0.13389725156178298, -0.15488164634665563, -0.05714200658812409, 0.016824952681504544, 0.10207745562504333, -0.3440806737080926, 0.11790349573961326, 0.14901036744759905, 0.04826407842448957, -0.0002351845323573798, -0.1355534172727771, 0.02862664959615185, 0.13060672913256677, 0.07767393641240362, -0.08335601761306559, 0.1548087350979802, -0.10598770010152034, -0.13249867150720784, 0.30169855145781876, -0.08555348023600388, -0.19069203626020767, 0.1688380805010508, -0.2084845170445208, -0.15981328458015231, 0.11797878571919032, 0.19764926158157842, 0.17291026099562823, -0.13378843666647472, 0.1759337276175973, -0.02984002941021962, 0.10222887507240687, 0.08248237903518159, 0.07173472950567625, 0.15548860023929073, 0.12373986991588026, 0.11886475594309602, 0.13006825033863562, -0.0675911721135933, -0.16129989946438444, -0.3483623955066183, -0.09521806120340313, -0.1817931368104404, 0.11055362749002165, -0.1941185464051419, -0.24109617379006176, 0.3972138065756077, 0.13157988681701854, 0.21929519365741207, 0.1724346610052245, 0.21843339950733243, 0.2538953591692483, -0.026732452102892455, 0.07470079486345294, 0.1507330672105863, 0.17492117145143093, 0.05878925047692887, -0.1634047290426679, 0.06997739401690307, 0.062137873227974136] |
1,802.09227 | Depth Masked Discriminative Correlation Filter | Depth information provides a strong cue for occlusion detection and handling,
but has been largely omitted in generic object tracking until recently due to
lack of suitable benchmark datasets and applications. In this work, we propose
a Depth Masked Discriminative Correlation Filter (DM-DCF) which adopts novel
depth segmentation based occlusion detection that stops correlation filter
updating and depth masking which adaptively adjusts the spatial support for
correlation filter. In Princeton RGBD Tracking Benchmark, our DM-DCF is among
the state-of-the-art in overall ranking and the winner on multiple categories.
Moreover, since it is based on DCF, ``DM-DCF`` runs an order of magnitude
faster than its competitors making it suitable for time constrained
applications.
| cs.CV | depth information provides a strong cue for occlusion detection and handling but has been largely omitted in generic object tracking until recently due to lack of suitable benchmark datasets and applications in this work we propose a depth masked discriminative correlation filter dmdcf which adopts novel depth segmentation based occlusion detection that stops correlation filter updating and depth masking which adaptively adjusts the spatial support for correlation filter in princeton rgbd tracking benchmark our dmdcf is among the stateoftheart in overall ranking and the winner on multiple categories moreover since it is based on dcf dmdcf runs an order of magnitude faster than its competitors making it suitable for time constrained applications | [['depth', 'information', 'provides', 'a', 'strong', 'cue', 'for', 'occlusion', 'detection', 'and', 'handling', 'but', 'has', 'been', 'largely', 'omitted', 'in', 'generic', 'object', 'tracking', 'until', 'recently', 'due', 'to', 'lack', 'of', 'suitable', 'benchmark', 'datasets', 'and', 'applications', 'in', 'this', 'work', 'we', 'propose', 'a', 'depth', 'masked', 'discriminative', 'correlation', 'filter', 'dmdcf', 'which', 'adopts', 'novel', 'depth', 'segmentation', 'based', 'occlusion', 'detection', 'that', 'stops', 'correlation', 'filter', 'updating', 'and', 'depth', 'masking', 'which', 'adaptively', 'adjusts', 'the', 'spatial', 'support', 'for', 'correlation', 'filter', 'in', 'princeton', 'rgbd', 'tracking', 'benchmark', 'our', 'dmdcf', 'is', 'among', 'the', 'stateoftheart', 'in', 'overall', 'ranking', 'and', 'the', 'winner', 'on', 'multiple', 'categories', 'moreover', 'since', 'it', 'is', 'based', 'on', 'dcf', 'dmdcf', 'runs', 'an', 'order', 'of', 'magnitude', 'faster', 'than', 'its', 'competitors', 'making', 'it', 'suitable', 'for', 'time', 'constrained', 'applications']] | [-0.04601687283346629, -0.022986404567486067, -0.0855346510943491, 0.03769167019345332, -0.10109182974805922, -0.21759176385655468, 0.005085621544692133, 0.46942925307666883, -0.2280627056731776, -0.3332502301283447, 0.10952839896448754, -0.2589339227083006, -0.1512415745777876, 0.15989144550050177, -0.14830074836001067, 0.09450439615050397, 0.11297357780858874, 0.03779577941999638, -0.06307556358348977, -0.2887258062032093, 0.23846687106041436, 0.1065281715938389, 0.3342273296626185, 0.05267238641057962, 0.16161572539463773, 0.06083068969746819, -0.11383455377030519, 0.01864496007328853, -0.018750592706900143, 0.12325357375435228, 0.2670739445768829, 0.16132533146654687, 0.30403722413549467, -0.3552065809531736, -0.21171794335740352, 0.06473121771289568, 0.14124900799444212, 0.0668663044126723, -0.060363025988668335, -0.3644242173925574, 0.06791690308974856, -0.15928899581610625, 0.026122500394454358, -0.12078094050853647, 0.08037156326879215, -0.045012897346168756, -0.33704936022903503, 0.08245519527762164, 0.05850951642995434, 0.07107698839847996, -0.0313308549510631, -0.1256820216471429, 0.034538045197093324, 0.13812469159685342, 0.013474157227652281, 0.05215672721741222, 0.14383731823181733, -0.21722478630129313, -0.09841177147297588, 0.3506528406045878, -0.04048555634718858, -0.17937042281014978, 0.2256132649677706, -0.018300003039517572, -0.1264133958694791, 0.1368875356690426, 0.17672007565020717, 0.14170630771410028, -0.14894456896165917, 0.008515708778369506, -0.044202897009589445, 0.22236433070169628, 0.09853853983804584, 0.028211200605645508, 0.18000352817554294, 0.26647626111766193, 0.12613283211820608, 0.11926001174184162, -0.2263329395251016, -0.07829062672785117, -0.18199573598446608, -0.09153606259496883, -0.17942098577207485, -0.08360416047175281, -0.08314101876073567, -0.1561705485486787, 0.4083592728670088, 0.30675366858486086, 0.19014864676864818, 0.09141391355452859, 0.3961321472223582, 0.05128392785991309, 0.1406134908070921, 0.07598874183271878, 0.20583013493368135, -0.00407469505859938, 0.10643538916026175, -0.15983156301704834, 0.13422752157618692, 0.07173688578352864] |
1,802.09228 | Universal van der Waals-type interactions in rattler containing cage
materials | Rattling motion of fillers in cage materials has been of great interest for
their import roles in superconductivity and thermoelectric applications. The
standing waves of the rattling oscillations are normally lower in energy than
the propagating waves of the acoustic phonons, thus exert large influences on
the configuration of phonon dispersions as well as the associated thermal and
electrical properties. Although it has been extensively studied, the origin of
the low energy soft modes is still not clear. In the present paper, we show
that van der Waals-type interactions are predominant between fillers and their
surrounding cage frameworks, which explains the origin of the low energy modes
in cage materials as a universal rule. Mass, free space and chemical
environment of guest atoms are shown to be the most important factors to
determine the three dimensional van der Waals-type interactions. The present
work is mainly focused on type-I clathrates, skutterudites and pyrochlores.
| cond-mat.mtrl-sci | rattling motion of fillers in cage materials has been of great interest for their import roles in superconductivity and thermoelectric applications the standing waves of the rattling oscillations are normally lower in energy than the propagating waves of the acoustic phonons thus exert large influences on the configuration of phonon dispersions as well as the associated thermal and electrical properties although it has been extensively studied the origin of the low energy soft modes is still not clear in the present paper we show that van der waalstype interactions are predominant between fillers and their surrounding cage frameworks which explains the origin of the low energy modes in cage materials as a universal rule mass free space and chemical environment of guest atoms are shown to be the most important factors to determine the three dimensional van der waalstype interactions the present work is mainly focused on typei clathrates skutterudites and pyrochlores | [['rattling', 'motion', 'of', 'fillers', 'in', 'cage', 'materials', 'has', 'been', 'of', 'great', 'interest', 'for', 'their', 'import', 'roles', 'in', 'superconductivity', 'and', 'thermoelectric', 'applications', 'the', 'standing', 'waves', 'of', 'the', 'rattling', 'oscillations', 'are', 'normally', 'lower', 'in', 'energy', 'than', 'the', 'propagating', 'waves', 'of', 'the', 'acoustic', 'phonons', 'thus', 'exert', 'large', 'influences', 'on', 'the', 'configuration', 'of', 'phonon', 'dispersions', 'as', 'well', 'as', 'the', 'associated', 'thermal', 'and', 'electrical', 'properties', 'although', 'it', 'has', 'been', 'extensively', 'studied', 'the', 'origin', 'of', 'the', 'low', 'energy', 'soft', 'modes', 'is', 'still', 'not', 'clear', 'in', 'the', 'present', 'paper', 'we', 'show', 'that', 'van', 'der', 'waalstype', 'interactions', 'are', 'predominant', 'between', 'fillers', 'and', 'their', 'surrounding', 'cage', 'frameworks', 'which', 'explains', 'the', 'origin', 'of', 'the', 'low', 'energy', 'modes', 'in', 'cage', 'materials', 'as', 'a', 'universal', 'rule', 'mass', 'free', 'space', 'and', 'chemical', 'environment', 'of', 'guest', 'atoms', 'are', 'shown', 'to', 'be', 'the', 'most', 'important', 'factors', 'to', 'determine', 'the', 'three', 'dimensional', 'van', 'der', 'waalstype', 'interactions', 'the', 'present', 'work', 'is', 'mainly', 'focused', 'on', 'typei', 'clathrates', 'skutterudites', 'and', 'pyrochlores']] | [-0.14300757359428404, 0.21491724100748175, -0.016237976885014705, 0.033966813050363656, -0.07028339570005253, -0.10561237695908762, 0.029540692801483123, 0.38778405727230403, -0.25854300855146567, -0.2672773995191643, 0.03136827709079769, -0.339551746373457, -0.15966238959471843, 0.17979658271360677, 0.01733023674521399, 0.0010150304212737339, 0.0026754159020799164, -0.009380425596119542, -0.003956572194032273, -0.18223702875548042, 0.26250372036654307, 0.1104006495190429, 0.31289258018430127, 0.11703804837797131, 0.05319558838259821, -0.021052326978717343, 0.06156673199362367, 0.027952253301344553, -0.14591843410394895, 0.10024225507521278, 0.248255829204266, -0.042121895843209994, 0.26940339909694894, -0.4791525590086454, -0.25437690711604727, 0.060607266658304355, 0.15127099594744658, 0.1270343913600204, -0.07330003720983912, -0.23112590540519082, 0.028225119437066543, -0.151208255542626, -0.11049919804300819, -0.08248899453074525, 0.06083596044520259, 0.047826014615374765, -0.13330184131872988, 0.11548411221328454, 0.07488697351915394, 0.06044306879323956, -0.12516783081656813, -0.15160854360836215, -0.061535747576272115, 0.10579327872255817, 0.07999631932225863, -0.042212826542948424, 0.1726325478245455, -0.12086219450300537, -0.07718300725154174, 0.4664682272674614, -0.009569543391319857, -0.12115451808724749, 0.2534020649220206, -0.14461158539511657, -0.08748137912526115, 0.12840554599135526, 0.16303912865604567, 0.07564959793633438, -0.16511333954986185, 0.10564002435574749, 0.026885202528271628, 0.13057990721580082, 0.09147382661773774, 0.10362194863601441, 0.26212029733180414, 0.17612530542139307, -0.014964595345143033, 0.10822227253428489, -0.058042622352475426, -0.021467021156384266, -0.189092583739885, -0.1934665815405376, -0.2144647361281769, -0.0030308163028453954, -0.02868582189071994, -0.2107516630056029, 0.37886965124389943, 0.09022063659703188, 0.15813711524663776, -0.08317758191275827, 0.2322009222514584, 0.07503792651588906, 0.10070513599049791, 0.03171767106916951, 0.34637632902319493, 0.15526351567026914, 0.08689820343677543, -0.26604491280465337, 0.08326596348840547, 0.023105430594066428] |
1,802.09229 | Experimental observation of time singularity in classical-to-quantum
chaos transition | The emergence of chaotic phenomena in a quantum system has long been an
elusive subject. Experimental progresses in this subject have become urgently
needed in recent years, when considerable theoretical studies have unveiled the
vital roles of chaos in a broad range of topics in quantum physics. Here, we
report the first experimental observation of time singularity, that signals a
classical-to-quantum chaos transition and finds its origin in the {\it sudden
change} in system's memory behaviors. The time singularity observed is an
analog of the "dynamical quantum phase transition" (DQPT) -- proposed very
recently for regular systems -- in chaotic systems, but with totally different
physical origin.
| cond-mat.dis-nn cond-mat.mes-hall quant-ph | the emergence of chaotic phenomena in a quantum system has long been an elusive subject experimental progresses in this subject have become urgently needed in recent years when considerable theoretical studies have unveiled the vital roles of chaos in a broad range of topics in quantum physics here we report the first experimental observation of time singularity that signals a classicaltoquantum chaos transition and finds its origin in the it sudden change in systems memory behaviors the time singularity observed is an analog of the dynamical quantum phase transition dqpt proposed very recently for regular systems in chaotic systems but with totally different physical origin | [['the', 'emergence', 'of', 'chaotic', 'phenomena', 'in', 'a', 'quantum', 'system', 'has', 'long', 'been', 'an', 'elusive', 'subject', 'experimental', 'progresses', 'in', 'this', 'subject', 'have', 'become', 'urgently', 'needed', 'in', 'recent', 'years', 'when', 'considerable', 'theoretical', 'studies', 'have', 'unveiled', 'the', 'vital', 'roles', 'of', 'chaos', 'in', 'a', 'broad', 'range', 'of', 'topics', 'in', 'quantum', 'physics', 'here', 'we', 'report', 'the', 'first', 'experimental', 'observation', 'of', 'time', 'singularity', 'that', 'signals', 'a', 'classicaltoquantum', 'chaos', 'transition', 'and', 'finds', 'its', 'origin', 'in', 'the', 'it', 'sudden', 'change', 'in', 'systems', 'memory', 'behaviors', 'the', 'time', 'singularity', 'observed', 'is', 'an', 'analog', 'of', 'the', 'dynamical', 'quantum', 'phase', 'transition', 'dqpt', 'proposed', 'very', 'recently', 'for', 'regular', 'systems', 'in', 'chaotic', 'systems', 'but', 'with', 'totally', 'different', 'physical', 'origin']] | [-0.19094540669937574, 0.16282056234361206, -0.13795171064058584, 0.03954101137462116, -0.015578354925050266, -0.13580997515846754, 0.037126505731915435, 0.32859049348737157, -0.24937452003359795, -0.25528726755597053, 0.10293000527169732, -0.2686268990238508, -0.22883714354109197, 0.20755612108679045, -0.03971509720154461, 0.11444318580962275, 0.03715959049406506, 0.02702012755464585, -0.05178206079373402, -0.22414884966398987, 0.2701541862749894, 0.0728882062215624, 0.27160101777075657, 0.07079805146814103, 0.060659611411392686, -0.05741440139577857, 0.015701400293480782, -0.013832439074204082, -0.13075570662185781, 0.014003566408618575, 0.28709967299586253, 0.08656789723096327, 0.3142069980324734, -0.467745027992697, -0.29538558130817755, 0.13093781429121182, 0.14629168373399548, 0.12999403875853335, -0.13481569626324233, -0.2923575640256916, 0.028160134410219532, -0.15806735196993466, -0.12889574404273715, -0.0716056507757111, 0.1265832790240113, -0.03985697826193202, -0.1454450652446775, 0.08861746224436155, 0.08063431991835214, 0.12985877640367974, -0.029267171245910936, -0.03089608048377115, 0.06255019546453176, 0.14458582060151023, 0.03840912972754311, 0.017789978498504274, 0.06286130879695216, -0.1376115305681846, -0.19269076282424585, 0.37585527560718, -0.014294603020174518, -0.09059417221828231, 0.25085010682010933, -0.19347388610421193, -0.19120123827209076, 0.15224460591783837, 0.16217414561126914, 0.0871064204412202, -0.14031175788272993, 0.08716582207929431, 0.004783312958620844, 0.15277963624823662, -0.00801227917185142, 0.12306089938751288, 0.2790420487789171, 0.23005557388200293, 0.0024022380067479044, 0.11040271427482366, -0.05529433127570276, -0.19544355944685993, -0.23895396159773338, -0.11763274348396364, -0.18749988070644794, 0.05627472649461457, -0.015773783479900366, -0.17035771564003968, 0.411189137523373, 0.18585421254060097, 0.2292056668727171, -0.05565764664539269, 0.2491521539521359, 0.11526203155074091, 0.0532256773229511, 0.01321051958504887, 0.29561594593383017, 0.12063565857353664, 0.19293000442641123, -0.2058959458422448, 0.11043838257790499, -0.028465837231349378] |
1,802.0923 | The linkedness of cubical polytopes | A cubical polytope is a polytope with all its facets being combinatorially
equivalent to cubes. The paper is concerned with the linkedness of the graphs
of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for
every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of
vertices, there are $k$ vertex-disjoint paths joining the vertices in the
pairs.
Larman and Mani in 1970 proved that simplicial $d$-polytopes, polytopes with
all their facets being combinatorially equivalent to simplices, are
$\floor{(d+1)/2}$-linked; this is the maximum possible linkedness given the
facts that a $\floor{(d+1)/2}$-linked graph is at least
$(2\floor{(d+1)/2}-1)$-connected and that some of these graphs are
$d$-connected but not $(d+1)$-connected.
Here we establish that cubical $d$-polytopes are also
$\floor{(d+1)/2}$-linked for every $d\ne 3$; this is again the maximum possible
linkedness for such a class of polytopes.
| math.CO | a cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes the paper is concerned with the linkedness of the graphs of cubical polytopes a graph with at least 2k vertices is klinked if for every set of 2k distinct vertices organised in arbitrary k pairs of vertices there are k vertexdisjoint paths joining the vertices in the pairs larman and mani in 1970 proved that simplicial dpolytopes polytopes with all their facets being combinatorially equivalent to simplices are floord12linked this is the maximum possible linkedness given the facts that a floord12linked graph is at least 2floord121connected and that some of these graphs are dconnected but not d1connected here we establish that cubical dpolytopes are also floord12linked for every dne 3 this is again the maximum possible linkedness for such a class of polytopes | [['a', 'cubical', 'polytope', 'is', 'a', 'polytope', 'with', 'all', 'its', 'facets', 'being', 'combinatorially', 'equivalent', 'to', 'cubes', 'the', 'paper', 'is', 'concerned', 'with', 'the', 'linkedness', 'of', 'the', 'graphs', 'of', 'cubical', 'polytopes', 'a', 'graph', 'with', 'at', 'least', '2k', 'vertices', 'is', 'klinked', 'if', 'for', 'every', 'set', 'of', '2k', 'distinct', 'vertices', 'organised', 'in', 'arbitrary', 'k', 'pairs', 'of', 'vertices', 'there', 'are', 'k', 'vertexdisjoint', 'paths', 'joining', 'the', 'vertices', 'in', 'the', 'pairs', 'larman', 'and', 'mani', 'in', '1970', 'proved', 'that', 'simplicial', 'dpolytopes', 'polytopes', 'with', 'all', 'their', 'facets', 'being', 'combinatorially', 'equivalent', 'to', 'simplices', 'are', 'floord12linked', 'this', 'is', 'the', 'maximum', 'possible', 'linkedness', 'given', 'the', 'facts', 'that', 'a', 'floord12linked', 'graph', 'is', 'at', 'least', '2floord121connected', 'and', 'that', 'some', 'of', 'these', 'graphs', 'are', 'dconnected', 'but', 'not', 'd1connected', 'here', 'we', 'establish', 'that', 'cubical', 'dpolytopes', 'are', 'also', 'floord12linked', 'for', 'every', 'dne', '3', 'this', 'is', 'again', 'the', 'maximum', 'possible', 'linkedness', 'for', 'such', 'a', 'class', 'of', 'polytopes']] | [-0.17014303876545883, 0.1441337363452048, -0.031415835961096865, 0.04663259994156439, -0.09112225714660085, -0.15700361740720623, 0.028256623143747942, 0.3953920975053573, -0.2926398464752471, -0.24430882204871843, 0.11676965411735342, -0.4010029016336536, -0.14570033985450315, 0.08151234836002592, -0.15202085769680493, -0.033503197282056245, 0.10696091071483405, 0.0794385969210827, 0.01235019694585764, -0.35886898902047987, 0.31317616162761946, -0.09413811546640799, 0.1412046352343168, 0.07613036211799173, 0.1395072629675269, -0.030983291223973912, 0.07214607226727393, 0.11818809242343858, -0.18111871634990914, 0.13859386652406744, 0.30177488375236006, 0.17244498152285814, 0.18312064695825991, -0.35456279457524514, -0.07634641949142165, 0.21679653215687722, 0.10695786623332157, 0.03102426781483433, 0.055945249110022015, -0.1613476149710443, 0.160168143475483, -0.03726553207482485, -0.11246273202670957, 0.017713548850117472, 0.13748696265632615, 0.006135186144948581, -0.25012010016464903, -0.04792978728437447, 0.1135496037758832, 0.1141483313335544, 0.07168115038674681, -0.17719081656404717, -0.08753798676908071, 0.07826620917972725, -0.06977141986477792, 0.06846386166494887, -0.019629382700419657, -0.050938563089242536, -0.19775410986724584, 0.39849114313255996, 0.08004877196885098, -0.17099776752430068, 0.15090568823164657, -0.18713850523208214, -0.1798121870139285, 0.188647706342368, 0.0435223688631702, 0.1750132133910323, -0.12579171518411705, 0.10188292922376764, -0.17753892729524523, 0.0624967646521434, 0.1776163709240363, 0.012440719470546088, 0.17386036890264436, 0.12752555706880658, 0.1376532176269821, 0.17928882995072534, 0.04717462119194405, 0.005935175505703014, -0.31971407146877884, -0.1292857790043961, -0.223488768139813, 0.06488453399791017, -0.18713352317311494, -0.16970842419301763, 0.3310449967325172, 0.045382717533571204, 0.20918020351382438, 0.16074802576194464, 0.1987028402440688, 0.0057598873417566, 0.06657692384803393, 0.1535619824563208, 0.12014013297812198, 0.16594376456786825, -0.03151196742649464, -0.0721411381913212, 0.03455327289274839, 0.15386675686493298] |
1,802.09231 | The physical and chemical structure of Sagittarius B2. III. Radiative
transfer simulations of the hot core SgrB2(M) for methyl cyanide | We model the emission of methyl cyanide (CH3CN) lines towards the massive hot
molecular core SgrB2(M). We aim at reconstructing the CH3CN abundance field and
investigating the gas temperature distribution as well as the velocity field.
SgrB2(M) was observed with the ALMA in a spectral line survey from 211 to 275
GHz. This frequency range includes several transitions of CH3CN (including
isotopologues and vibrationally excited states). We employ the
three-dimensional radiative transfer toolbox Pandora in order to retrieve the
velocity and abundance field by modeling different CH3CN lines. For this
purpose, we base our model on the results of a previous study that determined
the physical structure of SgrB2(M), i.e.\ the distribution of dust dense cores,
ionized regions and heating sources. The morphology of the CH3CN emission can
be reproduced by a molecular density field that consists of a superposition of
cores with modified Plummer-like density profiles. The averaged relative
abundance of CH3CN with respect to H2 ranges from 4x10^{-11} to 2x10^{-8} in
the northern part of SgrB2(M) and from 2x10^{-10} to 5x10^{-7} in the southern
part. In general, we find that the relative abundance of CH3CN is lower at the
center of the very dense and hot cores, causing the general morphology of the
CH3CN emission to be shifted with respect to the dust continuum emission. The
dust temperature calculated by the radiative transfer simulation based on the
available luminosity reaches values up to 900 K. However, in some regions
vibrationally excited transitions of CH3CN are underestimated by the model,
indicating that the predicted gas temperature, which is assumed to be equal to
the dust temperature, is partly underestimated. The determination of the
velocity component along the line of sight reveals that a velocity gradient
from the north to the south exists in SgrB2(M).
| astro-ph.GA | we model the emission of methyl cyanide ch3cn lines towards the massive hot molecular core sgrb2m we aim at reconstructing the ch3cn abundance field and investigating the gas temperature distribution as well as the velocity field sgrb2m was observed with the alma in a spectral line survey from 211 to 275 ghz this frequency range includes several transitions of ch3cn including isotopologues and vibrationally excited states we employ the threedimensional radiative transfer toolbox pandora in order to retrieve the velocity and abundance field by modeling different ch3cn lines for this purpose we base our model on the results of a previous study that determined the physical structure of sgrb2m ie the distribution of dust dense cores ionized regions and heating sources the morphology of the ch3cn emission can be reproduced by a molecular density field that consists of a superposition of cores with modified plummerlike density profiles the averaged relative abundance of ch3cn with respect to h2 ranges from 4x1011 to 2x108 in the northern part of sgrb2m and from 2x1010 to 5x107 in the southern part in general we find that the relative abundance of ch3cn is lower at the center of the very dense and hot cores causing the general morphology of the ch3cn emission to be shifted with respect to the dust continuum emission the dust temperature calculated by the radiative transfer simulation based on the available luminosity reaches values up to 900 k however in some regions vibrationally excited transitions of ch3cn are underestimated by the model indicating that the predicted gas temperature which is assumed to be equal to the dust temperature is partly underestimated the determination of the velocity component along the line of sight reveals that a velocity gradient from the north to the south exists in sgrb2m | [['we', 'model', 'the', 'emission', 'of', 'methyl', 'cyanide', 'ch3cn', 'lines', 'towards', 'the', 'massive', 'hot', 'molecular', 'core', 'sgrb2m', 'we', 'aim', 'at', 'reconstructing', 'the', 'ch3cn', 'abundance', 'field', 'and', 'investigating', 'the', 'gas', 'temperature', 'distribution', 'as', 'well', 'as', 'the', 'velocity', 'field', 'sgrb2m', 'was', 'observed', 'with', 'the', 'alma', 'in', 'a', 'spectral', 'line', 'survey', 'from', '211', 'to', '275', 'ghz', 'this', 'frequency', 'range', 'includes', 'several', 'transitions', 'of', 'ch3cn', 'including', 'isotopologues', 'and', 'vibrationally', 'excited', 'states', 'we', 'employ', 'the', 'threedimensional', 'radiative', 'transfer', 'toolbox', 'pandora', 'in', 'order', 'to', 'retrieve', 'the', 'velocity', 'and', 'abundance', 'field', 'by', 'modeling', 'different', 'ch3cn', 'lines', 'for', 'this', 'purpose', 'we', 'base', 'our', 'model', 'on', 'the', 'results', 'of', 'a', 'previous', 'study', 'that', 'determined', 'the', 'physical', 'structure', 'of', 'sgrb2m', 'ie', 'the', 'distribution', 'of', 'dust', 'dense', 'cores', 'ionized', 'regions', 'and', 'heating', 'sources', 'the', 'morphology', 'of', 'the', 'ch3cn', 'emission', 'can', 'be', 'reproduced', 'by', 'a', 'molecular', 'density', 'field', 'that', 'consists', 'of', 'a', 'superposition', 'of', 'cores', 'with', 'modified', 'plummerlike', 'density', 'profiles', 'the', 'averaged', 'relative', 'abundance', 'of', 'ch3cn', 'with', 'respect', 'to', 'h2', 'ranges', 'from', '4x1011', 'to', '2x108', 'in', 'the', 'northern', 'part', 'of', 'sgrb2m', 'and', 'from', '2x1010', 'to', '5x107', 'in', 'the', 'southern', 'part', 'in', 'general', 'we', 'find', 'that', 'the', 'relative', 'abundance', 'of', 'ch3cn', 'is', 'lower', 'at', 'the', 'center', 'of', 'the', 'very', 'dense', 'and', 'hot', 'cores', 'causing', 'the', 'general', 'morphology', 'of', 'the', 'ch3cn', 'emission', 'to', 'be', 'shifted', 'with', 'respect', 'to', 'the', 'dust', 'continuum', 'emission', 'the', 'dust', 'temperature', 'calculated', 'by', 'the', 'radiative', 'transfer', 'simulation', 'based', 'on', 'the', 'available', 'luminosity', 'reaches', 'values', 'up', 'to', '900', 'k', 'however', 'in', 'some', 'regions', 'vibrationally', 'excited', 'transitions', 'of', 'ch3cn', 'are', 'underestimated', 'by', 'the', 'model', 'indicating', 'that', 'the', 'predicted', 'gas', 'temperature', 'which', 'is', 'assumed', 'to', 'be', 'equal', 'to', 'the', 'dust', 'temperature', 'is', 'partly', 'underestimated', 'the', 'determination', 'of', 'the', 'velocity', 'component', 'along', 'the', 'line', 'of', 'sight', 'reveals', 'that', 'a', 'velocity', 'gradient', 'from', 'the', 'north', 'to', 'the', 'south', 'exists', 'in', 'sgrb2m']] | [-0.05043121632977815, 0.11646454593845469, -0.013581110341316562, 0.0141206035820641, -0.0038220413131797213, -0.04012844138068415, 0.03152167715321658, 0.4288503568872052, -0.18614828915224743, -0.3130448096262102, 0.05549720672424883, -0.2658471282666265, 0.013277493464618416, 0.11914107527473342, 0.035977030156190866, -0.037724972013887255, 0.0047098833720310256, -0.07365167886058216, -0.030952926471797843, -0.14787416645341506, 0.2933428801659305, 0.09805527854458256, 0.19466656323017206, 0.0684497914268138, 0.030836257393771813, -0.1772392177559688, -0.04330398378325468, -0.02235230106102713, -0.13185892434954993, 0.1015318741680565, 0.24426814306653657, 0.09848811509624376, 0.17171767396078902, -0.3587444054278529, -0.24966515662085453, 0.06325010989429587, 0.17066338142869458, 0.092404736532293, -9.762584863199016e-05, -0.2909910664830546, 0.04020808663661197, -0.1521532246574633, -0.19591219671133717, 0.04458460427358968, 0.03715326678228833, 0.025997003921212913, -0.22474943588850863, 0.14089480617036254, -0.02645437393719291, 0.11110293708931086, -0.10311528172943804, -0.17171751797057183, -0.1078665599400588, 0.07368734855050915, -0.0022634574847485303, 0.07142553365536791, 0.23868693543313924, -0.11879082699700938, -0.013088380295972703, 0.4254350878980989, -0.17275904916755666, -0.03991354915927069, 0.22462447999021576, -0.1994271683261998, -0.1812313234338821, 0.24114488924151065, 0.1319810143324657, 0.13382075552560263, -0.11377295473476051, -0.016047327777260315, -0.04714839690230724, 0.2116237379521747, 0.07506311899524624, 0.011640944749006402, 0.29373500180446493, 0.06164283652521543, 0.0314648913665501, 0.15837023265391462, -0.23377551321271745, -0.11594016845574824, -0.2261113735054959, -0.1385884248872556, -0.14123235452857058, 0.04341321210692621, -0.06949860538815748, -0.1015486427675538, 0.34894234098620336, 0.12864217310591394, 0.22645767008869955, 0.019349840753396057, 0.33402475506911783, 0.08676504780956686, 0.08450420350467755, 0.14054237430346972, 0.2515294132609181, 0.22698378904122796, 0.11309228797553707, -0.2773719419583173, 0.075498335095817, -0.01670788003100177] |
1,802.09232 | 2D/3D Pose Estimation and Action Recognition using Multitask Deep
Learning | Action recognition and human pose estimation are closely related but both
problems are generally handled as distinct tasks in the literature. In this
work, we propose a multitask framework for jointly 2D and 3D pose estimation
from still images and human action recognition from video sequences. We show
that a single architecture can be used to solve the two problems in an
efficient way and still achieves state-of-the-art results. Additionally, we
demonstrate that optimization from end-to-end leads to significantly higher
accuracy than separated learning. The proposed architecture can be trained with
data from different categories simultaneously in a seamlessly way. The reported
results on four datasets (MPII, Human3.6M, Penn Action and NTU) demonstrate the
effectiveness of our method on the targeted tasks.
| cs.CV | action recognition and human pose estimation are closely related but both problems are generally handled as distinct tasks in the literature in this work we propose a multitask framework for jointly 2d and 3d pose estimation from still images and human action recognition from video sequences we show that a single architecture can be used to solve the two problems in an efficient way and still achieves stateoftheart results additionally we demonstrate that optimization from endtoend leads to significantly higher accuracy than separated learning the proposed architecture can be trained with data from different categories simultaneously in a seamlessly way the reported results on four datasets mpii human36m penn action and ntu demonstrate the effectiveness of our method on the targeted tasks | [['action', 'recognition', 'and', 'human', 'pose', 'estimation', 'are', 'closely', 'related', 'but', 'both', 'problems', 'are', 'generally', 'handled', 'as', 'distinct', 'tasks', 'in', 'the', 'literature', 'in', 'this', 'work', 'we', 'propose', 'a', 'multitask', 'framework', 'for', 'jointly', '2d', 'and', '3d', 'pose', 'estimation', 'from', 'still', 'images', 'and', 'human', 'action', 'recognition', 'from', 'video', 'sequences', 'we', 'show', 'that', 'a', 'single', 'architecture', 'can', 'be', 'used', 'to', 'solve', 'the', 'two', 'problems', 'in', 'an', 'efficient', 'way', 'and', 'still', 'achieves', 'stateoftheart', 'results', 'additionally', 'we', 'demonstrate', 'that', 'optimization', 'from', 'endtoend', 'leads', 'to', 'significantly', 'higher', 'accuracy', 'than', 'separated', 'learning', 'the', 'proposed', 'architecture', 'can', 'be', 'trained', 'with', 'data', 'from', 'different', 'categories', 'simultaneously', 'in', 'a', 'seamlessly', 'way', 'the', 'reported', 'results', 'on', 'four', 'datasets', 'mpii', 'human36m', 'penn', 'action', 'and', 'ntu', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method', 'on', 'the', 'targeted', 'tasks']] | [-0.01815184140692419, -0.030786716794193394, -0.06005039486018311, 0.03475317712510615, -0.0657733172124832, -0.18025220965310076, -0.027321260332771134, 0.48482511140650414, -0.2436057499220564, -0.3949413500023914, 0.08624835403971985, -0.25820223600832654, -0.2328298207006005, 0.2766866928393968, -0.2032796978019178, 0.08077310034089157, 0.19865155276521795, 0.06244068256899959, -0.08147762287942478, -0.298019851611347, 0.27941296090272666, -0.02974463270625985, 0.3668146312206251, 0.035328896090266154, 0.13182313901421874, -0.06656529864326852, -0.0059950057795027, 0.01947753494758098, -0.029443114069047132, 0.21119264107231875, 0.3141496843795796, 0.18599339685647093, 0.28662221659677195, -0.39580702738164636, -0.2200366067700088, 0.032197500426383294, 0.1719629240268078, 0.12093084139597209, -0.04526235594711892, -0.39184464123405394, 0.08320524521767482, -0.1635466233414949, 0.057954844407981536, -0.140615564389307, -0.07436272520552863, -0.05529002117023605, -0.3140524171185909, 0.07505802133074793, 0.038162232690574754, 0.0322351127435438, -0.1119043887473574, -0.13107808517505887, 0.04205405117646165, 0.21158065655665687, 0.039287090414112096, 0.07256423520138029, 0.14515371704245078, -0.19281869100933496, -0.19352013315455835, 0.40598482443172423, -0.06853014332889751, -0.23538805171847343, 0.23770858866513753, -0.04349383728609222, -0.1603118456197811, 0.08977830609245623, 0.23839433622531225, 0.170766105688345, -0.16937365072977836, -0.0019599971400581485, -0.06938101745928164, 0.19403762247062242, 0.03388533777877933, -0.03018338026356746, 0.1723809086853165, 0.24228857341604154, 0.03351360886953161, 0.1453560869949946, -0.1409523937904627, -0.059323936342032715, -0.17277385630324238, -0.07644973051558691, -0.16317358290104836, -0.05965488536863542, -0.08860691834838019, -0.07920908223127672, 0.39549867332470223, 0.2755258224034285, 0.21286232351539197, 0.13503268892403508, 0.3640534598685679, 0.010886769659710346, 0.11445785055011434, 0.10583880444469511, 0.1799363206717048, -0.05738198344946885, 0.0854468818751095, -0.20487086150459335, 0.04187702342531965, 0.05098683664911106] |
1,802.09233 | EiTAKA at SemEval-2018 Task 1: An Ensemble of N-Channels ConvNet and
XGboost Regressors for Emotion Analysis of Tweets | This paper describes our system that has been used in Task1 Affect in Tweets.
We combine two different approaches. The first one called N-Stream ConvNets,
which is a deep learning approach where the second one is XGboost regresseor
based on a set of embedding and lexicons based features. Our system was
evaluated on the testing sets of the tasks outperforming all other approaches
for the Arabic version of valence intensity regression task and valence ordinal
classification task.
| cs.CL | this paper describes our system that has been used in task1 affect in tweets we combine two different approaches the first one called nstream convnets which is a deep learning approach where the second one is xgboost regresseor based on a set of embedding and lexicons based features our system was evaluated on the testing sets of the tasks outperforming all other approaches for the arabic version of valence intensity regression task and valence ordinal classification task | [['this', 'paper', 'describes', 'our', 'system', 'that', 'has', 'been', 'used', 'in', 'task1', 'affect', 'in', 'tweets', 'we', 'combine', 'two', 'different', 'approaches', 'the', 'first', 'one', 'called', 'nstream', 'convnets', 'which', 'is', 'a', 'deep', 'learning', 'approach', 'where', 'the', 'second', 'one', 'is', 'xgboost', 'regresseor', 'based', 'on', 'a', 'set', 'of', 'embedding', 'and', 'lexicons', 'based', 'features', 'our', 'system', 'was', 'evaluated', 'on', 'the', 'testing', 'sets', 'of', 'the', 'tasks', 'outperforming', 'all', 'other', 'approaches', 'for', 'the', 'arabic', 'version', 'of', 'valence', 'intensity', 'regression', 'task', 'and', 'valence', 'ordinal', 'classification', 'task']] | [-0.015210311723252138, -0.011186774571736653, -0.09998522659142813, 0.05325924411571274, -0.09765398579339186, -0.16624012236793836, 0.029010607527258495, 0.42169019419699905, -0.20954269073903561, -0.27262874180451035, 0.06358119350858032, -0.34732508008678753, -0.17044159620068966, 0.21901794207592806, -0.09177211537957192, 0.07675629379848639, 0.11795156709849834, 0.09029747413471341, -0.048116247725362576, -0.3198942544311285, 0.36584162145853044, -0.045067396018421274, 0.37295648783445357, 0.031293751088281474, 0.14332800939058263, -0.012326299200455347, -0.025823991540819408, 0.004254293292760849, -0.01620366216064819, 0.19601462818061313, 0.2855633275086681, 0.20570934865313273, 0.3400829776128133, -0.3308017223825057, -0.2108162557457884, 0.06022803369288643, 0.11788292436550062, 0.08799490659536484, 0.046313124699518086, -0.32301161068181194, 0.0858731259778142, -0.16737764207025368, 0.06326739855110645, -0.1189957885319988, -0.018578629816571872, -0.030504785031080246, -0.2603635135417183, 0.020405241815994183, 0.09774452210093539, 0.08046609926968813, -0.07907077696795264, -0.17557210536984105, 0.05858060874355336, 0.17647011534621318, 0.04387855921561519, 0.0694329685655733, 0.10936315646395087, -0.13326287125237285, -0.19891330548872552, 0.38864826269447805, -0.08059650755797823, -0.21078242174039286, 0.20579109693566958, -0.036992932011683785, -0.23500490152587494, 0.04063714321702719, 0.23034785751253367, 0.1456191095088919, -0.15541599442561468, 0.023520005480386318, -0.06545899589856466, 0.23100595546265443, 0.06609484386940798, -0.05434639137859146, 0.15052679737408955, 0.31646889115373295, -0.018411924429237843, 0.13162145119238025, -0.1483742029654483, -0.04606806702290972, -0.19282317931453388, -0.12091697598497073, -0.21449906389073778, -0.07422327887577315, -0.06565384167518157, -0.16680466854323944, 0.44771104767918585, 0.2159712635477384, 0.1659222000837326, 0.08388712833480289, 0.33247054542104404, 0.054727609854696005, 0.1006147542844216, 0.09986613395158202, 0.1886847531919678, -0.0030638950566450754, 0.1058038412531217, -0.16301056667269828, 0.09572270042883853, 0.12185644561424852] |
1,802.09234 | Lateral interatomic dispersion forces | Van der Waals forces between atoms and molecules are universally assumed to
act along the line separating them. Inspired by recent works on effects which
can propel atoms parallel to a macroscopic surface via the Casimir--Polder
force, we predict a lateral van der Waals force between two atoms, one of which
is in an excited state with non-zero angular momentum and the other is
isotropic and in its ground state. The resulting force acts in the same way as
a planetary gear, in contrast to the rack-and-pinion motion predicted in works
on the lateral Casimir--Polder force in the analogous case, for which the force
predicted here is the microscopic origin. We illustrate the effect by
predicting the trajectories of an excited caesium in the vicinity of
ground-state rubidium, finding behaviour qualitatively different to that if
lateral forces are ignored.
| quant-ph | van der waals forces between atoms and molecules are universally assumed to act along the line separating them inspired by recent works on effects which can propel atoms parallel to a macroscopic surface via the casimirpolder force we predict a lateral van der waals force between two atoms one of which is in an excited state with nonzero angular momentum and the other is isotropic and in its ground state the resulting force acts in the same way as a planetary gear in contrast to the rackandpinion motion predicted in works on the lateral casimirpolder force in the analogous case for which the force predicted here is the microscopic origin we illustrate the effect by predicting the trajectories of an excited caesium in the vicinity of groundstate rubidium finding behaviour qualitatively different to that if lateral forces are ignored | [['van', 'der', 'waals', 'forces', 'between', 'atoms', 'and', 'molecules', 'are', 'universally', 'assumed', 'to', 'act', 'along', 'the', 'line', 'separating', 'them', 'inspired', 'by', 'recent', 'works', 'on', 'effects', 'which', 'can', 'propel', 'atoms', 'parallel', 'to', 'a', 'macroscopic', 'surface', 'via', 'the', 'casimirpolder', 'force', 'we', 'predict', 'a', 'lateral', 'van', 'der', 'waals', 'force', 'between', 'two', 'atoms', 'one', 'of', 'which', 'is', 'in', 'an', 'excited', 'state', 'with', 'nonzero', 'angular', 'momentum', 'and', 'the', 'other', 'is', 'isotropic', 'and', 'in', 'its', 'ground', 'state', 'the', 'resulting', 'force', 'acts', 'in', 'the', 'same', 'way', 'as', 'a', 'planetary', 'gear', 'in', 'contrast', 'to', 'the', 'rackandpinion', 'motion', 'predicted', 'in', 'works', 'on', 'the', 'lateral', 'casimirpolder', 'force', 'in', 'the', 'analogous', 'case', 'for', 'which', 'the', 'force', 'predicted', 'here', 'is', 'the', 'microscopic', 'origin', 'we', 'illustrate', 'the', 'effect', 'by', 'predicting', 'the', 'trajectories', 'of', 'an', 'excited', 'caesium', 'in', 'the', 'vicinity', 'of', 'groundstate', 'rubidium', 'finding', 'behaviour', 'qualitatively', 'different', 'to', 'that', 'if', 'lateral', 'forces', 'are', 'ignored']] | [-0.132745900948485, 0.19847551962589383, -0.07508654615057887, 0.004892092264297572, -0.028381878389514607, -0.12585508954717958, 0.007522309838841073, 0.3649322123487862, -0.2595667838447278, -0.2924880715984878, -0.08032478418171057, -0.3129723284748658, -0.14441772307128573, 0.19387647178586867, 0.011997338957253764, 0.021675339993340693, 0.0010146932884139552, 0.009599445909077449, -0.008260353433182665, -0.17943351111448497, 0.3110670155121965, 0.056601028246202056, 0.25528896165669984, 0.10952579327557477, 0.07597175993196158, -0.008715242023492675, 0.08430232408476605, 0.03680219548828096, -0.16131684640549138, 0.10530531322315549, 0.1979194368242467, -0.08327018947293646, 0.2559196229139678, -0.5104104065128582, -0.18746156398903766, 0.08511314479124954, 0.1186108446994917, 0.21237204098661946, -0.025393823602256907, -0.313917431630288, -0.04003232786525711, -0.15144538150081854, -0.14713827089118442, -0.05822207512695798, 0.05838202426156445, 0.08182446144373832, -0.21420799408831614, 0.09941605049714768, 0.0683227970713763, 0.042591961435705636, -0.11607953179991978, -0.08604912006333068, -0.030849319936292207, 0.14116694496462134, 0.033759019074613136, 0.042442694386775545, 0.22646593213711175, -0.11743468902301606, -0.06693662746588318, 0.42128940779554974, -0.09618262586806961, -0.18317292473888655, 0.22510464864669086, -0.11877448900549156, -0.035354870693128315, 0.09364753864243251, 0.10243468673350356, 0.06666611563481337, -0.12968327195497512, 0.04021337217016467, 0.004872554826061074, 0.1446201237347379, 0.139218098083645, -0.013463827275516961, 0.2403967808396053, 0.10170160952399371, 0.04245476059870218, 0.12671463968309327, -0.11576515022960907, -0.12427911764050988, -0.229062978231864, -0.16684850303308785, -0.2370666145688767, 0.03674119325662903, -0.017465120647626044, -0.17394090826093828, 0.31850144308623224, 0.10998439760845181, 0.20066905636742388, -0.03639181087332905, 0.3273463469541384, 0.057584405440348034, 0.0532265049405396, 0.021313837020014742, 0.35016671273348143, 0.12307133121255169, 0.056737099606677784, -0.2835230634257988, 0.07124211240254959, 0.07468811945869125] |
1,802.09235 | Quantum complementarity of clocks in the context of general relativity | Clocks play a special role at the interface of general relativity and quantum
mechanics. We analyze a clock-interferometry thought experiment and go on to
theoretically derive and experimentally test a complementarity relation for
quantum clocks in the context of the gravitational time lag. We study this
relation in detail and discuss its application to various types of quantum
clocks.
| quant-ph | clocks play a special role at the interface of general relativity and quantum mechanics we analyze a clockinterferometry thought experiment and go on to theoretically derive and experimentally test a complementarity relation for quantum clocks in the context of the gravitational time lag we study this relation in detail and discuss its application to various types of quantum clocks | [['clocks', 'play', 'a', 'special', 'role', 'at', 'the', 'interface', 'of', 'general', 'relativity', 'and', 'quantum', 'mechanics', 'we', 'analyze', 'a', 'clockinterferometry', 'thought', 'experiment', 'and', 'go', 'on', 'to', 'theoretically', 'derive', 'and', 'experimentally', 'test', 'a', 'complementarity', 'relation', 'for', 'quantum', 'clocks', 'in', 'the', 'context', 'of', 'the', 'gravitational', 'time', 'lag', 'we', 'study', 'this', 'relation', 'in', 'detail', 'and', 'discuss', 'its', 'application', 'to', 'various', 'types', 'of', 'quantum', 'clocks']] | [-0.12611308080497488, 0.12682109094899277, -0.07812742876884496, 0.14436135144607196, -0.012201384078221524, -0.14905328425610886, 0.06566290743247574, 0.3514837116757729, -0.2545219870436744, -0.28576507425770675, 0.07869360993760799, -0.23061174994479094, -0.18270382082796302, 0.21026757276408245, -0.02125007077923109, 0.0552145115146012, 0.013884688599099373, 0.039432444938875995, -0.0726810788157685, -0.18661164913069586, 0.28541611661684924, 0.11675839868157395, 0.2794880621528638, 0.034847859574224926, 0.108371135152491, 0.006872733693634127, -0.017191441151602514, 0.023576621977805065, -0.1686914340384176, 0.09392148791009496, 0.25792474640083723, 0.1350522864015837, 0.2539003805000463, -0.4698552118036254, -0.19116433125374646, 0.09812146553705478, 0.0627178400634499, 0.1810424473008205, -0.07857157679571738, -0.3011738760717984, 0.00124817356017643, -0.16619124171195615, -0.15050553546511922, -0.05438720220539334, 0.06751382151811287, -0.030589061375739503, -0.13174412918983605, 0.05551290474350339, 0.04563089593409978, 0.08474562583683894, -0.024980134348754353, 0.011907556098243543, 0.12216792396743428, 0.14087905936296388, -0.008747542373322207, -0.02888744545634836, 0.10891188085400338, -0.09448951010287193, -0.1768970114885476, 0.4664367211276087, -0.0495261927938153, -0.1848621603165721, 0.21272363968129301, -0.1527905856732857, -0.1499894566769744, -0.09285265902370407, 0.2128585477937655, 0.09275169937935626, -0.12067242209992275, 0.0814054542309444, 0.014521123102769769, 0.14242456557132818, 0.12160143653605261, 0.12097620393715575, 0.27070094716076837, 0.14359701824262097, -0.004099201611724907, 0.14741154281615182, -0.07068959072408877, -0.16893337850041432, -0.3673248748166551, -0.23304112191344128, -0.11408565739362404, 0.047299109166989844, -0.07069860937390958, -0.09712022257936669, 0.37947660578607484, 0.18414485101299038, 0.13297458713199814, 0.04418231042680042, 0.259432405618758, 0.12296017379186855, -0.0013496467024730198, -0.02609156787491821, 0.35739757190458477, 0.18635903560588585, 0.11331346925701304, -0.2691943785496827, 0.023796800275108422, 0.0635948986585798] |
1,802.09236 | Thermal Conductivity of Suspended Few-Layer MoS2 | Modifying phonon thermal conductivity in nanomaterials is important not only
for fundamental research but also for practical applications. However, the
experiments on tailoring the thermal conductivity in nanoscale, especially in
two-dimensional materials, are rare due to technical challenges. In this work,
we demonstrate in-situ thermal conduction measurement of MoS2 and find that its
thermal conductivity can be continuously tuned to a required value from
crystalline to amorphous limits. The reduction of thermal conductivity is
understood from phonon-defects scatterings that decrease the phonon
transmission coefficient. Beyond a threshold, a sharp drop in thermal
conductivity is observed, which is believed to be a crystalline-amorphous
transition. Our method and results provide guidance for potential applications
in thermoelectrics, photoelectronics, and energy harvesting where thermal
management is critical with further integration and miniaturization.
| cond-mat.mes-hall | modifying phonon thermal conductivity in nanomaterials is important not only for fundamental research but also for practical applications however the experiments on tailoring the thermal conductivity in nanoscale especially in twodimensional materials are rare due to technical challenges in this work we demonstrate insitu thermal conduction measurement of mos2 and find that its thermal conductivity can be continuously tuned to a required value from crystalline to amorphous limits the reduction of thermal conductivity is understood from phonondefects scatterings that decrease the phonon transmission coefficient beyond a threshold a sharp drop in thermal conductivity is observed which is believed to be a crystallineamorphous transition our method and results provide guidance for potential applications in thermoelectrics photoelectronics and energy harvesting where thermal management is critical with further integration and miniaturization | [['modifying', 'phonon', 'thermal', 'conductivity', 'in', 'nanomaterials', 'is', 'important', 'not', 'only', 'for', 'fundamental', 'research', 'but', 'also', 'for', 'practical', 'applications', 'however', 'the', 'experiments', 'on', 'tailoring', 'the', 'thermal', 'conductivity', 'in', 'nanoscale', 'especially', 'in', 'twodimensional', 'materials', 'are', 'rare', 'due', 'to', 'technical', 'challenges', 'in', 'this', 'work', 'we', 'demonstrate', 'insitu', 'thermal', 'conduction', 'measurement', 'of', 'mos2', 'and', 'find', 'that', 'its', 'thermal', 'conductivity', 'can', 'be', 'continuously', 'tuned', 'to', 'a', 'required', 'value', 'from', 'crystalline', 'to', 'amorphous', 'limits', 'the', 'reduction', 'of', 'thermal', 'conductivity', 'is', 'understood', 'from', 'phonondefects', 'scatterings', 'that', 'decrease', 'the', 'phonon', 'transmission', 'coefficient', 'beyond', 'a', 'threshold', 'a', 'sharp', 'drop', 'in', 'thermal', 'conductivity', 'is', 'observed', 'which', 'is', 'believed', 'to', 'be', 'a', 'crystallineamorphous', 'transition', 'our', 'method', 'and', 'results', 'provide', 'guidance', 'for', 'potential', 'applications', 'in', 'thermoelectrics', 'photoelectronics', 'and', 'energy', 'harvesting', 'where', 'thermal', 'management', 'is', 'critical', 'with', 'further', 'integration', 'and', 'miniaturization']] | [-0.07380302536015318, 0.17874066930220234, -0.06517337531027362, -0.03660646129736868, -0.07091251386542195, -0.16083899137058008, 0.0802744055152174, 0.4077426294876835, -0.29957504901580334, -0.2723618497500035, 0.09693774373516235, -0.3022848700033867, -0.16129493950976162, 0.27531359613988565, -0.05875423430340496, 0.05876552510051438, 0.030267317713362964, -0.06566364682021947, -0.02651900018466358, -0.18440261742422784, 0.21547892087645185, 0.08892526859408391, 0.35085383482372723, 0.20178273768626212, 0.00040470425215527765, -0.0332814157504119, 0.06374943385260018, 0.03861827922867626, -0.13138098770905632, 0.09011402803905837, 0.3209826489983816, -0.07801732540453278, 0.2271356114670341, -0.4386434445201647, -0.2843913274971167, 0.05922835232699372, 0.13537269674138877, 0.117254388184052, -0.0919109866835221, -0.17580858316624492, 0.05995455229156247, -0.11592712387347257, -0.10781872801974922, -0.11963459276447556, 0.00817890207037535, -0.04350312562626383, -0.2558529632804021, 0.10938506294385618, 0.030964878435415313, 0.03150435731797589, -0.10908545401885988, -0.1369218362887632, -0.03438208540204883, 0.08680006913752772, 0.03335145205455488, -0.016390252454155013, 0.24385814651054896, -0.18605315672530698, -0.0863755641204459, 0.43151885925198163, -0.04238915327096754, -0.10181946211355174, 0.1783851346800353, -0.14389177814756673, -0.09496036472209678, 0.17481921330519665, 0.15331389596612435, 0.06184148841618201, -0.17809597303170535, 0.058659955883017326, 0.07288966825833236, 0.15757447703169497, 0.049110600800898775, 0.09738538248141802, 0.2370545398700601, 0.23466932238996263, 0.05032044555052315, 0.15424540845812923, -0.06616021653336626, 0.0008745396759097031, -0.22637574066495977, -0.21131265294686782, -0.24789346998014788, 0.10419111096725972, -0.07375903607586282, -0.17906251989624017, 0.3537189324980411, 0.2085338703679346, 0.152589867294832, -0.03333099218411738, 0.3164373953665394, 0.1560437682746565, 0.08572482929920675, 0.051894413479640494, 0.28911590254975583, 0.13124144464496554, 0.16850052863784779, -0.2596566733816184, 0.07523760460610465, -0.056042342204747235] |
1,802.09237 | Symplectic quotients of unstable Morse strata for normsquares of moment
maps | Let K be a compact Lie group and fix an invariant inner product on its Lie
algebra. Given a Hamiltonian action of K on a compact symplectic manifold X,
the normsquare of the moment map defines a Morse stratification of X by locally
closed symplectic submanifolds such that the stratum to which any x in X
belongs is determined by the limiting behaviour of its downwards trajectory
under the gradient flow with respect to a suitably compatible Riemannian metric
on X. The open stratum indexed by 0 retracts K-equivariantly via this gradient
flow to the minimum which is the zero-locus of the moment map (if this is not
empty). The usual 'symplectic quotient' for the action of K on any other
stratum is empty. Nonetheless, motivated by recent results in non-reductive
geometric invariant theory, we find that the symplectic quotient construction
can be modified to provide natural 'symplectic quotients' for the unstable
strata labelled by nonzero indices. There is an analogous infinite-dimensional
picture for the Yang--Mills functional over a Riemann surface with strata
determined by Harder-Narasimhan type.
| math.AG | let k be a compact lie group and fix an invariant inner product on its lie algebra given a hamiltonian action of k on a compact symplectic manifold x the normsquare of the moment map defines a morse stratification of x by locally closed symplectic submanifolds such that the stratum to which any x in x belongs is determined by the limiting behaviour of its downwards trajectory under the gradient flow with respect to a suitably compatible riemannian metric on x the open stratum indexed by 0 retracts kequivariantly via this gradient flow to the minimum which is the zerolocus of the moment map if this is not empty the usual symplectic quotient for the action of k on any other stratum is empty nonetheless motivated by recent results in nonreductive geometric invariant theory we find that the symplectic quotient construction can be modified to provide natural symplectic quotients for the unstable strata labelled by nonzero indices there is an analogous infinitedimensional picture for the yangmills functional over a riemann surface with strata determined by hardernarasimhan type | [['let', 'k', 'be', 'a', 'compact', 'lie', 'group', 'and', 'fix', 'an', 'invariant', 'inner', 'product', 'on', 'its', 'lie', 'algebra', 'given', 'a', 'hamiltonian', 'action', 'of', 'k', 'on', 'a', 'compact', 'symplectic', 'manifold', 'x', 'the', 'normsquare', 'of', 'the', 'moment', 'map', 'defines', 'a', 'morse', 'stratification', 'of', 'x', 'by', 'locally', 'closed', 'symplectic', 'submanifolds', 'such', 'that', 'the', 'stratum', 'to', 'which', 'any', 'x', 'in', 'x', 'belongs', 'is', 'determined', 'by', 'the', 'limiting', 'behaviour', 'of', 'its', 'downwards', 'trajectory', 'under', 'the', 'gradient', 'flow', 'with', 'respect', 'to', 'a', 'suitably', 'compatible', 'riemannian', 'metric', 'on', 'x', 'the', 'open', 'stratum', 'indexed', 'by', '0', 'retracts', 'kequivariantly', 'via', 'this', 'gradient', 'flow', 'to', 'the', 'minimum', 'which', 'is', 'the', 'zerolocus', 'of', 'the', 'moment', 'map', 'if', 'this', 'is', 'not', 'empty', 'the', 'usual', 'symplectic', 'quotient', 'for', 'the', 'action', 'of', 'k', 'on', 'any', 'other', 'stratum', 'is', 'empty', 'nonetheless', 'motivated', 'by', 'recent', 'results', 'in', 'nonreductive', 'geometric', 'invariant', 'theory', 'we', 'find', 'that', 'the', 'symplectic', 'quotient', 'construction', 'can', 'be', 'modified', 'to', 'provide', 'natural', 'symplectic', 'quotients', 'for', 'the', 'unstable', 'strata', 'labelled', 'by', 'nonzero', 'indices', 'there', 'is', 'an', 'analogous', 'infinitedimensional', 'picture', 'for', 'the', 'yangmills', 'functional', 'over', 'a', 'riemann', 'surface', 'with', 'strata', 'determined', 'by', 'hardernarasimhan', 'type']] | [-0.19358480399717914, 0.1183741676135965, -0.11562531035716264, 0.03160113360222154, -0.1007211753114296, -0.12436314974382351, 0.014857122817457739, 0.34186249087030196, -0.33512033751784737, -0.18551209278633574, 0.09395372808450536, -0.22989719720895996, -0.1322201624623796, 0.18164777736919033, -0.16658473188131626, -0.03278696307428287, 0.06098872517097995, 0.1489430788988102, -0.1342512074863242, -0.24633856548991223, 0.4271066368329974, -0.013741668147056109, 0.2184586516576184, 0.007504848375405841, 0.14891159918492616, -0.03461701721376316, 0.02945451756981625, 0.03658760245922498, -0.15342405205369272, 0.13216653260513506, 0.2664006989163516, 0.06417795278618789, 0.18028977276513947, -0.36081876257561485, -0.19803773325359295, 0.16906281643473034, 0.09891702027413306, -0.0507726968948687, 0.007481185636524143, -0.2976186202034693, 0.12683281309595754, -0.10755103652296714, -0.18431116452186622, -0.08294996577685444, 0.06296557083260268, -0.02818352090385319, -0.21576228382499804, -0.019874468787417176, 0.09749034903837707, 0.11065065161462619, -0.07393091775090645, -0.09468682655344972, -0.12277193306760058, 0.06292971850780305, 0.006622633365953912, 0.1462915192903231, 0.14302713582450946, -0.043988687020663005, -0.06484431929195787, 0.3769116288908249, -0.10846725084676026, -0.2927125254391285, 0.0949138317135459, -0.15180442769401867, -0.1519776448522779, 0.17365729397120463, 0.06817135078943631, 0.16215616473610597, -0.05456619148819961, 0.22717075001425904, -0.10647078482328322, 0.05909296777297806, 0.07589037329572337, -0.07872050253684972, 0.17907276106416248, 0.09435828536119185, 0.15364354801435678, 0.10272017225592704, 0.007967837985647335, -0.0657960845855996, -0.3653823011131449, -0.18188228558326294, -0.13821983655295547, 0.17422964120164994, -0.13477773805119464, -0.19294859961056235, 0.36193029795223003, 0.018804116018476303, 0.21448673914313654, 0.08048857444770295, 0.22827882231980434, 0.09029690035227263, 0.06363957893336192, 0.09226113509397361, 0.11504539484502113, 0.20736862924505575, -0.05757203033334173, -0.18053060250134545, -8.549550693714991e-05, 0.20953865290026774] |
1,802.09238 | Towards Exact Molecular Dynamics Simulations with Machine-Learned Force
Fields | Molecular dynamics (MD) simulations employing classical force fields
constitute the cornerstone of contemporary atomistic modeling in chemistry,
biology, and materials science. However, the predictive power of these
simulations is only as good as the underlying interatomic potential. Classical
potentials often fail to faithfully capture key quantum effects in molecules
and materials. Here we enable the direct construction of flexible molecular
force fields from high-level ab initio calculations by incorporating spatial
and temporal physical symmetries into a gradient-domain machine learning
(sGDML) model in an automatic data-driven way. The developed sGDML approach
faithfully reproduces global force fields at quantum-chemical CCSD(T) level of
accuracy and allows converged molecular dynamics simulations with fully
quantized electrons and nuclei. We present MD simulations, for flexible
molecules with up to a few dozen atoms and provide insights into the dynamical
behavior of these molecules. Our approach provides the key missing ingredient
for achieving spectroscopic accuracy in molecular simulations.
| physics.chem-ph | molecular dynamics md simulations employing classical force fields constitute the cornerstone of contemporary atomistic modeling in chemistry biology and materials science however the predictive power of these simulations is only as good as the underlying interatomic potential classical potentials often fail to faithfully capture key quantum effects in molecules and materials here we enable the direct construction of flexible molecular force fields from highlevel ab initio calculations by incorporating spatial and temporal physical symmetries into a gradientdomain machine learning sgdml model in an automatic datadriven way the developed sgdml approach faithfully reproduces global force fields at quantumchemical ccsdt level of accuracy and allows converged molecular dynamics simulations with fully quantized electrons and nuclei we present md simulations for flexible molecules with up to a few dozen atoms and provide insights into the dynamical behavior of these molecules our approach provides the key missing ingredient for achieving spectroscopic accuracy in molecular simulations | [['molecular', 'dynamics', 'md', 'simulations', 'employing', 'classical', 'force', 'fields', 'constitute', 'the', 'cornerstone', 'of', 'contemporary', 'atomistic', 'modeling', 'in', 'chemistry', 'biology', 'and', 'materials', 'science', 'however', 'the', 'predictive', 'power', 'of', 'these', 'simulations', 'is', 'only', 'as', 'good', 'as', 'the', 'underlying', 'interatomic', 'potential', 'classical', 'potentials', 'often', 'fail', 'to', 'faithfully', 'capture', 'key', 'quantum', 'effects', 'in', 'molecules', 'and', 'materials', 'here', 'we', 'enable', 'the', 'direct', 'construction', 'of', 'flexible', 'molecular', 'force', 'fields', 'from', 'highlevel', 'ab', 'initio', 'calculations', 'by', 'incorporating', 'spatial', 'and', 'temporal', 'physical', 'symmetries', 'into', 'a', 'gradientdomain', 'machine', 'learning', 'sgdml', 'model', 'in', 'an', 'automatic', 'datadriven', 'way', 'the', 'developed', 'sgdml', 'approach', 'faithfully', 'reproduces', 'global', 'force', 'fields', 'at', 'quantumchemical', 'ccsdt', 'level', 'of', 'accuracy', 'and', 'allows', 'converged', 'molecular', 'dynamics', 'simulations', 'with', 'fully', 'quantized', 'electrons', 'and', 'nuclei', 'we', 'present', 'md', 'simulations', 'for', 'flexible', 'molecules', 'with', 'up', 'to', 'a', 'few', 'dozen', 'atoms', 'and', 'provide', 'insights', 'into', 'the', 'dynamical', 'behavior', 'of', 'these', 'molecules', 'our', 'approach', 'provides', 'the', 'key', 'missing', 'ingredient', 'for', 'achieving', 'spectroscopic', 'accuracy', 'in', 'molecular', 'simulations']] | [-0.04985279266741252, 0.06522048531999051, -0.11222325653250285, 0.061447431562287144, -0.03327475844463646, -0.13137552396928728, 0.030369313302506137, 0.3987926148978256, -0.2700850712572968, -0.33403020174611336, -0.03708990937481312, -0.2267556944378572, -0.16129121671574528, 0.20683837354170695, 0.045539908126721644, 0.10233350173959309, 0.08692040952585088, -0.06825972047939916, -0.01624783860900808, -0.18374759253995782, 0.2337623688598607, 0.11826882454732296, 0.24962638735758677, 0.049026389200015355, 0.10866944454047804, -0.01162120084053268, -0.008590739939186798, -0.006379479104840515, -0.16019584492416178, 0.18175521121679136, 0.29400181964714855, 0.05790111174941338, 0.2795457816338979, -0.5516926100068951, -0.2872360334948452, 0.011654895547489892, 0.1429819702444248, 0.176313067317609, -0.08430544353221486, -0.25151340374035525, 0.03179258614584753, -0.14245473658322239, -0.1234840177180833, -0.22562934116979175, -0.02165372580627367, 0.0713794717304221, -0.24130840855181818, 0.10639600887982137, -0.008009848572609122, 0.12636249305655198, -0.07370258034746031, -0.12914461900648855, 0.008642946762945377, 0.16800406386828887, -0.04530103941176137, 0.057124256804286996, 0.21339614372255106, -0.13677984308107638, -0.1283384542349701, 0.4714677984507492, -0.025750551287603608, -0.1682851757954231, 0.2546205285986598, -0.09523401262032356, -0.16379403446382224, 0.15360407134980564, 0.14834162873847273, 0.07424464672116325, -0.16519032255902685, 0.06696019626156921, 0.020687333414418585, 0.1999228014204426, -0.023368264986014606, 0.042980784737823796, 0.23118567364852902, 0.2127291771439498, -0.03810974893053906, 0.038375929366772206, -0.0914380064288048, -0.19434573766994195, -0.2314169506523633, -0.1435179173332661, -0.18050554497229973, 0.05658667377702542, -0.07241079536416636, -0.13519722987872693, 0.3704537523522873, 0.1768284227047428, 0.1063756122560109, 0.02071501660604505, 0.34077254820290026, 0.01499805125273489, 0.0689596175903692, 0.03485363153990783, 0.2230271080340065, 0.1649345657772591, 0.05284395268586958, -0.22354417786802222, 0.03385592470314329, 0.0306443458160498] |
1,802.09239 | Scalable and Precise Estimation and Debugging of the Worst-Case
Execution Time for Analysis-Friendly Processors | Estimating the Worst-Case Execution Time (WCET) of an application is an
essential task in the context of developing real-time or safety-critical
software, but it is also a complex and error-prone process. Conventional
approaches require at least some manual inputs from the user, such as loop
bounds and infeasible path information, which are hard to obtain and can lead
to unsafe results if they are incorrect. This is aggravated by the lack of a
comprehensive explanation of the WCET estimate, i.e., a specific trace showing
how WCET was reached. It is therefore hard to spot incorrect inputs and hard to
improve the worst-case timing of the application. Meanwhile, modern processors
have reached a complexity that refutes analysis and puts more and more burden
on the practitioner. In this article we show how all of these issues can be
significantly mitigated or even solved, if we use processors that are amenable
to WCET analysis. We define and identify such processors, and then we propose
an automated tool set which estimates a precise WCET without unsafe manual
inputs, and also reconstructs a maximum-detail view of the WCET path that can
be examined in a debugger environment. Our approach is based on Model Checking,
which however is known to scale badly with growing application size. We address
this issue by shifting the analysis to source code level, where source code
transformations can be applied that retain the timing behavior, but reduce the
complexity. Our experiments show that fast and precise estimates can be
achieved with Model Checking, that its scalability can even exceed current
approaches, and that new opportunities arise in the context of "timing
debugging".
| cs.SE | estimating the worstcase execution time wcet of an application is an essential task in the context of developing realtime or safetycritical software but it is also a complex and errorprone process conventional approaches require at least some manual inputs from the user such as loop bounds and infeasible path information which are hard to obtain and can lead to unsafe results if they are incorrect this is aggravated by the lack of a comprehensive explanation of the wcet estimate ie a specific trace showing how wcet was reached it is therefore hard to spot incorrect inputs and hard to improve the worstcase timing of the application meanwhile modern processors have reached a complexity that refutes analysis and puts more and more burden on the practitioner in this article we show how all of these issues can be significantly mitigated or even solved if we use processors that are amenable to wcet analysis we define and identify such processors and then we propose an automated tool set which estimates a precise wcet without unsafe manual inputs and also reconstructs a maximumdetail view of the wcet path that can be examined in a debugger environment our approach is based on model checking which however is known to scale badly with growing application size we address this issue by shifting the analysis to source code level where source code transformations can be applied that retain the timing behavior but reduce the complexity our experiments show that fast and precise estimates can be achieved with model checking that its scalability can even exceed current approaches and that new opportunities arise in the context of timing debugging | [['estimating', 'the', 'worstcase', 'execution', 'time', 'wcet', 'of', 'an', 'application', 'is', 'an', 'essential', 'task', 'in', 'the', 'context', 'of', 'developing', 'realtime', 'or', 'safetycritical', 'software', 'but', 'it', 'is', 'also', 'a', 'complex', 'and', 'errorprone', 'process', 'conventional', 'approaches', 'require', 'at', 'least', 'some', 'manual', 'inputs', 'from', 'the', 'user', 'such', 'as', 'loop', 'bounds', 'and', 'infeasible', 'path', 'information', 'which', 'are', 'hard', 'to', 'obtain', 'and', 'can', 'lead', 'to', 'unsafe', 'results', 'if', 'they', 'are', 'incorrect', 'this', 'is', 'aggravated', 'by', 'the', 'lack', 'of', 'a', 'comprehensive', 'explanation', 'of', 'the', 'wcet', 'estimate', 'ie', 'a', 'specific', 'trace', 'showing', 'how', 'wcet', 'was', 'reached', 'it', 'is', 'therefore', 'hard', 'to', 'spot', 'incorrect', 'inputs', 'and', 'hard', 'to', 'improve', 'the', 'worstcase', 'timing', 'of', 'the', 'application', 'meanwhile', 'modern', 'processors', 'have', 'reached', 'a', 'complexity', 'that', 'refutes', 'analysis', 'and', 'puts', 'more', 'and', 'more', 'burden', 'on', 'the', 'practitioner', 'in', 'this', 'article', 'we', 'show', 'how', 'all', 'of', 'these', 'issues', 'can', 'be', 'significantly', 'mitigated', 'or', 'even', 'solved', 'if', 'we', 'use', 'processors', 'that', 'are', 'amenable', 'to', 'wcet', 'analysis', 'we', 'define', 'and', 'identify', 'such', 'processors', 'and', 'then', 'we', 'propose', 'an', 'automated', 'tool', 'set', 'which', 'estimates', 'a', 'precise', 'wcet', 'without', 'unsafe', 'manual', 'inputs', 'and', 'also', 'reconstructs', 'a', 'maximumdetail', 'view', 'of', 'the', 'wcet', 'path', 'that', 'can', 'be', 'examined', 'in', 'a', 'debugger', 'environment', 'our', 'approach', 'is', 'based', 'on', 'model', 'checking', 'which', 'however', 'is', 'known', 'to', 'scale', 'badly', 'with', 'growing', 'application', 'size', 'we', 'address', 'this', 'issue', 'by', 'shifting', 'the', 'analysis', 'to', 'source', 'code', 'level', 'where', 'source', 'code', 'transformations', 'can', 'be', 'applied', 'that', 'retain', 'the', 'timing', 'behavior', 'but', 'reduce', 'the', 'complexity', 'our', 'experiments', 'show', 'that', 'fast', 'and', 'precise', 'estimates', 'can', 'be', 'achieved', 'with', 'model', 'checking', 'that', 'its', 'scalability', 'can', 'even', 'exceed', 'current', 'approaches', 'and', 'that', 'new', 'opportunities', 'arise', 'in', 'the', 'context', 'of', 'timing', 'debugging']] | [-0.08703935151228963, 0.06094338307542704, -0.09150089249891191, 0.09814994240280098, -0.1174535348803506, -0.1760551435417561, 0.09652011538941647, 0.40316796367822605, -0.2758822525160669, -0.359728673112156, 0.18132420347976014, -0.23579315556646274, -0.13951822012646564, 0.2402228993394608, -0.1273556669492694, 0.07384301594357999, 0.12743789824653706, 0.031456370229705675, -0.05155530914696917, -0.26895164768898866, 0.260997651882016, 0.07619326430754358, 0.246133177584691, 0.07904663429285376, 0.041509701105198096, -0.007515868841759805, -0.030060253503416214, 0.028962912594700213, -0.0544019618082731, 0.12503525650092637, 0.29790412253297255, 0.22234953085228637, 0.28041566669514806, -0.4633792074787262, -0.17781861013315303, 0.11611586949758823, 0.15990066002346437, 0.105878587869319, -0.02008745963635813, -0.253527819265773, 0.12698076664026814, -0.1776308559699197, -0.08376605305872253, -0.12735946237013376, -0.011268619518397149, -0.016416314002590398, -0.264536008750848, 0.008431217580564608, 0.07036933622226751, 0.0373547456993608, -0.0016867037139991058, -0.0668191526435673, 0.03248540978669103, 0.1637066204557917, 0.053039073030274476, 0.04830719439179217, 0.13162619336353568, -0.1266462836729026, -0.13148703339691806, 0.37361885423040037, -0.008595866757340651, -0.19982245836812468, 0.20251660927274434, -0.07380060210000944, -0.16304900523660038, 0.11232231715281676, 0.1788462020200763, 0.1004890197470468, -0.1555418733720465, 0.06711784670772925, 0.012875391909254652, 0.2532128234397331, 0.047704566850041714, 0.018477498830340774, 0.17660510830128628, 0.1978726121167415, 0.07759424527622484, 0.1362228084731902, -0.051200921965030115, -0.06398237640350865, -0.26837790371593245, -0.14132071299499033, -0.16293166223715827, 0.01826153388135204, -0.07218005519723941, -0.16232858516741544, 0.34272605912051957, 0.24003931506356693, 0.16450554195222722, 0.08557255647524957, 0.35557027803338737, 0.1356069139253569, 0.07522463056493406, 0.12671742100948194, 0.19286669367407552, -0.0007347204237901417, 0.08134659482862086, -0.19605509309025956, 0.13776484985983625, 0.002918354068913693] |
1,802.0924 | The Finite Model Property of Quasi-transitive Modal Logic | The finite model property of quasi-transitive modal logic
$\mathsf{K}_2^3=\mathsf{K}\oplus \Box\Box p\rightarrow \Box\Box\Box p$ is
established. This modal logic is conservatively extended to the tense logic
$\mathsf{Kt}_2^3$. We present a Gentzen sequent calculus $\mathsf{G}$ for
$\mathsf{Kt}_2^3$. The sequent calculus $\mathsf{G}$ has the finite algebra
property by a finite syntactic construction. It follows that $\mathsf{Kt}_2^3$
and $\mathsf{K}_2^3$ have the finite model property.
| cs.LO | the finite model property of quasitransitive modal logic mathsfk_23mathsfkoplus boxbox prightarrow boxboxbox p is established this modal logic is conservatively extended to the tense logic mathsfkt_23 we present a gentzen sequent calculus mathsfg for mathsfkt_23 the sequent calculus mathsfg has the finite algebra property by a finite syntactic construction it follows that mathsfkt_23 and mathsfk_23 have the finite model property | [['the', 'finite', 'model', 'property', 'of', 'quasitransitive', 'modal', 'logic', 'mathsfk_23mathsfkoplus', 'boxbox', 'prightarrow', 'boxboxbox', 'p', 'is', 'established', 'this', 'modal', 'logic', 'is', 'conservatively', 'extended', 'to', 'the', 'tense', 'logic', 'mathsfkt_23', 'we', 'present', 'a', 'gentzen', 'sequent', 'calculus', 'mathsfg', 'for', 'mathsfkt_23', 'the', 'sequent', 'calculus', 'mathsfg', 'has', 'the', 'finite', 'algebra', 'property', 'by', 'a', 'finite', 'syntactic', 'construction', 'it', 'follows', 'that', 'mathsfkt_23', 'and', 'mathsfk_23', 'have', 'the', 'finite', 'model', 'property']] | [-0.09475622402637132, 0.10792029100204152, -0.17084231941095954, 0.12417726030149165, -0.23677448984900756, -0.17129427129735372, 0.04287737003843566, 0.3485476633400789, -0.35807117354124784, -0.1322560368238815, 0.06208584945748693, -0.2511676784737834, -0.060157763880852144, 0.097762258631909, -0.16544501037736023, 0.049288874525310736, -0.019259644472705468, 0.1021863027708605, -0.014019600585535434, -0.1459469358170671, 0.2734225476659568, -0.08239207575596603, 0.22863901900460146, 0.049110684086502134, 0.14133156877609768, 0.08783707323683691, 0.018363513750955462, 0.04213734603087817, -0.1379963684642332, 0.08892103800150965, 0.3435553716096495, 0.19068896700628102, 0.3184635634201446, -0.38413573906291276, -0.1280771436987769, 0.09529159060080669, 0.06868863143193137, 0.044607948777931075, 0.029104882743143077, -0.3196154155302793, 0.15023795409693516, -0.2901489262502374, -0.09246800339250123, -0.07407063583377749, 0.11375335903306093, -0.051673357497618, -0.18277816201693245, -0.06572565120378775, 0.3496511596853712, 0.17678091789795353, 0.0016579702496528625, -0.08235109262334715, -0.04778906282237066, -0.06970556847019387, -0.13136059858620033, -0.012196905977491821, 0.07075917756135043, 0.05518646701654818, -0.20500718810321164, 0.2721162659082828, -0.042306028439530304, -0.23134345503058285, 0.07422210893959605, -0.12890821691170068, -0.20148292632906564, 0.04472443410590391, -0.005817969379547451, 0.16264980389470501, -0.08332167711029927, 0.28981814630658065, -0.1084232291239979, 0.19685330659350647, 0.11648635604485337, 0.04264290736422741, 0.0856907474309472, 0.21608017315156758, -0.009423553756537981, 0.15327412894527828, 0.07309362175874412, -0.10695553290757484, -0.3609099730217297, -0.14735730000964914, -0.04172117808567626, 0.0011824336667944277, -0.11172384356255602, -0.23389154998585582, 0.2986498892839466, 0.11275720183870622, 0.051210922097587694, 0.22714901098515838, 0.2570804858696647, 0.20234625547059945, 0.1627410366532526, -0.049226689354067536, 0.09525276064024572, 0.2881772809903071, 0.10320791282824107, -0.16219287882891617, 0.09824045450659469, 0.2125518758423693] |
1,802.09241 | A novel reduced order model for vortex induced vibrations of long
flexible cylinders | In this manuscript the development of a reduced order model for the analysis
of long flexible cylinders in an offshore environment is proposed. In
particular the focus is on the modelling of the vortex induced vibrations (VIV)
and the aim is the development of a model capable of capturing both the in-line
and cross-flow oscillations. The reduced order model is identified starting
from the results of a high fidelity solver developed coupling together a Finite
Element Solver (FEM) with a Computational Fluid Dynamics (CFD) solver. The high
fidelity analyses are conducted on a reduced domain size representing a small
section of the long cylinder, which is nevertheless, already flexible. The
section is forced using a motion which matches the expected motion in full
scale, and the results are used for the system-parameter identification of the
reduced order model. The reduced order model is identified by using a system
and parameter identification approach. The final proposed model consists in the
combination of a forced van der Pol oscillator, to model the cross-flow forces,
and a linear state-space model, to model the in-line forces. The model is
applied to study a full scale flexible model and the results are validated by
using experiments conducted on a flexible riser inside a towing tank.
| cs.CE | in this manuscript the development of a reduced order model for the analysis of long flexible cylinders in an offshore environment is proposed in particular the focus is on the modelling of the vortex induced vibrations viv and the aim is the development of a model capable of capturing both the inline and crossflow oscillations the reduced order model is identified starting from the results of a high fidelity solver developed coupling together a finite element solver fem with a computational fluid dynamics cfd solver the high fidelity analyses are conducted on a reduced domain size representing a small section of the long cylinder which is nevertheless already flexible the section is forced using a motion which matches the expected motion in full scale and the results are used for the systemparameter identification of the reduced order model the reduced order model is identified by using a system and parameter identification approach the final proposed model consists in the combination of a forced van der pol oscillator to model the crossflow forces and a linear statespace model to model the inline forces the model is applied to study a full scale flexible model and the results are validated by using experiments conducted on a flexible riser inside a towing tank | [['in', 'this', 'manuscript', 'the', 'development', 'of', 'a', 'reduced', 'order', 'model', 'for', 'the', 'analysis', 'of', 'long', 'flexible', 'cylinders', 'in', 'an', 'offshore', 'environment', 'is', 'proposed', 'in', 'particular', 'the', 'focus', 'is', 'on', 'the', 'modelling', 'of', 'the', 'vortex', 'induced', 'vibrations', 'viv', 'and', 'the', 'aim', 'is', 'the', 'development', 'of', 'a', 'model', 'capable', 'of', 'capturing', 'both', 'the', 'inline', 'and', 'crossflow', 'oscillations', 'the', 'reduced', 'order', 'model', 'is', 'identified', 'starting', 'from', 'the', 'results', 'of', 'a', 'high', 'fidelity', 'solver', 'developed', 'coupling', 'together', 'a', 'finite', 'element', 'solver', 'fem', 'with', 'a', 'computational', 'fluid', 'dynamics', 'cfd', 'solver', 'the', 'high', 'fidelity', 'analyses', 'are', 'conducted', 'on', 'a', 'reduced', 'domain', 'size', 'representing', 'a', 'small', 'section', 'of', 'the', 'long', 'cylinder', 'which', 'is', 'nevertheless', 'already', 'flexible', 'the', 'section', 'is', 'forced', 'using', 'a', 'motion', 'which', 'matches', 'the', 'expected', 'motion', 'in', 'full', 'scale', 'and', 'the', 'results', 'are', 'used', 'for', 'the', 'systemparameter', 'identification', 'of', 'the', 'reduced', 'order', 'model', 'the', 'reduced', 'order', 'model', 'is', 'identified', 'by', 'using', 'a', 'system', 'and', 'parameter', 'identification', 'approach', 'the', 'final', 'proposed', 'model', 'consists', 'in', 'the', 'combination', 'of', 'a', 'forced', 'van', 'der', 'pol', 'oscillator', 'to', 'model', 'the', 'crossflow', 'forces', 'and', 'a', 'linear', 'statespace', 'model', 'to', 'model', 'the', 'inline', 'forces', 'the', 'model', 'is', 'applied', 'to', 'study', 'a', 'full', 'scale', 'flexible', 'model', 'and', 'the', 'results', 'are', 'validated', 'by', 'using', 'experiments', 'conducted', 'on', 'a', 'flexible', 'riser', 'inside', 'a', 'towing', 'tank']] | [-0.1200797464589936, 0.0782255204044239, -0.07070125174752111, 0.00968382982470309, -0.02837994286532037, -0.12063540552595728, 0.0023090144704011354, 0.32008267561214393, -0.24263430653478613, -0.2944466257467866, 0.12137277626140605, -0.25587985634081883, -0.10854031187237094, 0.22119488091760595, -0.008676676466196562, 0.09748665238485525, 0.0970599570414096, 0.010935332299695845, -0.022300126688314253, -0.17718657699767856, 0.23708892701545722, 0.09720956521224605, 0.3006718979756299, 0.018433367762197717, 0.14390780515166704, -0.022163630261544904, -0.03143092309643902, 0.07557864614615314, -0.13772040803346652, 0.12753713904973565, 0.19573592252998154, 0.031225369605239934, 0.28264931389732223, -0.44030441236838197, -0.22522503411928657, 0.023632668429967817, 0.09514875219952154, 0.13515540616894275, -0.015680468163305993, -0.2897381055331455, 0.06488800135276249, -0.2144803526325588, -0.1461839029636751, -0.0662546812603473, -0.009602195534266923, 0.0310214916433533, -0.2718557508742553, 0.05237493954786059, 0.06369836082719334, 0.05362580664919324, -0.0695993913422254, -0.061742074363731275, -0.022878952101585966, 0.10448182267515639, 0.00036612219838915686, 0.03145585342256896, 0.12827233244769684, -0.13891300241213345, -0.06504388997647643, 0.41680698173396896, -0.07856434106973834, -0.24372846978097157, 0.19414424707747674, -0.08453018450886723, -0.05224327633545052, 0.147644833869938, 0.21286669902895627, 0.10255771816783901, -0.13997053043497948, 0.07789176412352303, -0.0192235250145188, 0.21361159400025195, 0.012121592208288574, -0.10779807835474219, 0.17506213590021483, 0.2791500641824009, 0.012753370231347221, 0.15483487896402878, -0.10099014114147346, -0.11513783723844491, -0.2971250097753043, -0.13012965797763051, -0.1680163975602292, -0.04065075454872512, -0.05665662622875222, -0.16008317134561437, 0.41556594930767443, 0.13710597477425512, 0.17229439177242348, 0.02332509586222149, 0.3361574203459965, 0.09794185447738324, 0.07746450359483013, 0.03592719225899169, 0.2251530206454784, 0.12758475775344735, 0.10025693702569419, -0.24712472263184426, 0.05368534752733685, 0.07658904479174879] |
1,802.09242 | Second-Order Necessary Conditions for Optimal Control with Recursive
Utilities | The necessary conditions for an optimal control of a stochastic control
problem with recursive utilities is investigated. The first order condition is
the the well-known Pontryagin type maximum principle. When the optimal control
satisfying such first-order necessary condition is singular in some sense,
certain type of the second-order necessary condition will come in naturally.
The aim of this paper is to explore such kind of conditions for our optimal
control problem.
| math.OC | the necessary conditions for an optimal control of a stochastic control problem with recursive utilities is investigated the first order condition is the the wellknown pontryagin type maximum principle when the optimal control satisfying such firstorder necessary condition is singular in some sense certain type of the secondorder necessary condition will come in naturally the aim of this paper is to explore such kind of conditions for our optimal control problem | [['the', 'necessary', 'conditions', 'for', 'an', 'optimal', 'control', 'of', 'a', 'stochastic', 'control', 'problem', 'with', 'recursive', 'utilities', 'is', 'investigated', 'the', 'first', 'order', 'condition', 'is', 'the', 'the', 'wellknown', 'pontryagin', 'type', 'maximum', 'principle', 'when', 'the', 'optimal', 'control', 'satisfying', 'such', 'firstorder', 'necessary', 'condition', 'is', 'singular', 'in', 'some', 'sense', 'certain', 'type', 'of', 'the', 'secondorder', 'necessary', 'condition', 'will', 'come', 'in', 'naturally', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'explore', 'such', 'kind', 'of', 'conditions', 'for', 'our', 'optimal', 'control', 'problem']] | [-0.16516604644416924, 0.06673957073825745, -0.04475790536372175, 0.09326119010474428, -0.14897332822536707, -0.14410007408570866, 0.02352705108441255, 0.3030004403652282, -0.3535880585738891, -0.25919745954632445, 0.1796982035099883, -0.16020833855678498, -0.18557107522034308, 0.18647904530115111, -0.15508550442230534, 0.1413723464373132, 0.02354900994088868, 0.09804494595023948, -0.07476060698464723, -0.25672813297682245, 0.3799473482485808, 0.013424521771220254, 0.30012403293447176, 0.0718060447768846, 0.14621392175109243, 0.0020602106733221405, 0.04057090175928364, 0.028181375902880664, -0.2057485192371401, 0.07064895754561983, 0.2757371162444773, 0.15433117963740944, 0.36396592073667217, -0.4092999042051149, -0.14552829076181834, 0.16213337443506634, 0.05862313615687808, 0.09330768026673877, -0.02043252490775686, -0.1938912688531506, 0.15554847675014916, -0.09045077348455892, -0.18751911848494915, -0.02159672385921151, -0.05891695075576574, 0.04851836389550467, -0.4045609504928891, 0.020854648123954385, 0.11100255375282025, 0.022340529703233445, -0.10649946438883182, -0.03404962049115082, 0.02172542140740429, 0.1116604485641673, 0.0012523249500024486, -0.03986859743312841, 0.04086903477428665, -0.10160201972573471, -0.09071210862471867, 0.3865808956095503, 0.00746367025536708, -0.21103231600997313, 0.13292164174498808, -0.06943180672102936, -0.15415631010341393, 0.10834390027973224, 0.13155786011000753, 0.17349961985715887, -0.21191697400887202, 0.07835445200211145, -0.03924710626228595, 0.11262062021439344, 0.05437826630200299, 0.05053472087528347, 0.10789247284787641, 0.13918964952086163, 0.24632434896193445, 0.17227749121178623, -0.0010441012195193432, -0.11828804992034402, -0.4097009749581355, -0.1550184917885443, -0.1148204350922729, 0.037715320645923346, -0.08949550636060222, -0.14643483279063038, 0.34190852496720536, 0.13615305993286236, 0.10902363227837732, 0.07279130204213442, 0.26554672510533683, 0.20151304905663547, -0.017438568246983727, 0.03763096130282526, 0.2269944152684102, 0.15181114081302363, 0.10350115397866343, -0.2464207332896095, 0.11853998895524673, 0.11468473959609236] |
1,802.09243 | An algorithm for computing Fr\'echet means on the sphere | For most optimisation methods an essential assumption is the vector space
structure of the feasible set. This condition is not fulfilled if we consider
optimisation problems over the sphere. We present an algorithm for solving a
special global problem over the sphere, namely the determination of Fr\'echet
means, which are points minimising the mean distance to a given set of points.
The Branch and Bound method derived needs no further assumptions on the input
data, but is able to cope with this objective function which is neither convex
nor differentiable. The algorithm's performance is tested on simulated and real
data.
| stat.CO math.OC | for most optimisation methods an essential assumption is the vector space structure of the feasible set this condition is not fulfilled if we consider optimisation problems over the sphere we present an algorithm for solving a special global problem over the sphere namely the determination of frechet means which are points minimising the mean distance to a given set of points the branch and bound method derived needs no further assumptions on the input data but is able to cope with this objective function which is neither convex nor differentiable the algorithms performance is tested on simulated and real data | [['for', 'most', 'optimisation', 'methods', 'an', 'essential', 'assumption', 'is', 'the', 'vector', 'space', 'structure', 'of', 'the', 'feasible', 'set', 'this', 'condition', 'is', 'not', 'fulfilled', 'if', 'we', 'consider', 'optimisation', 'problems', 'over', 'the', 'sphere', 'we', 'present', 'an', 'algorithm', 'for', 'solving', 'a', 'special', 'global', 'problem', 'over', 'the', 'sphere', 'namely', 'the', 'determination', 'of', 'frechet', 'means', 'which', 'are', 'points', 'minimising', 'the', 'mean', 'distance', 'to', 'a', 'given', 'set', 'of', 'points', 'the', 'branch', 'and', 'bound', 'method', 'derived', 'needs', 'no', 'further', 'assumptions', 'on', 'the', 'input', 'data', 'but', 'is', 'able', 'to', 'cope', 'with', 'this', 'objective', 'function', 'which', 'is', 'neither', 'convex', 'nor', 'differentiable', 'the', 'algorithms', 'performance', 'is', 'tested', 'on', 'simulated', 'and', 'real', 'data']] | [-0.10216831207886572, -0.012712459440517705, -0.09566476850770414, 0.0818084130610805, -0.10323229103349149, -0.12240220357663929, 0.042303209647070614, 0.40059027711860834, -0.2870638712478103, -0.2911086910031736, 0.15316173110157252, -0.23403682277887128, -0.14778441991657018, 0.23013675671536477, -0.0971495326794684, 0.0915999004675541, 0.09969215426244774, 0.06459674095269292, -0.09639474702998996, -0.30108120455406606, 0.3484496052702889, 0.016441084009129553, 0.26001047367230057, 0.052568235200596974, 0.15155097755254246, 0.027214780491776766, 0.006459420118480921, 0.042452576909854545, -0.1283391734669567, 0.11277903245179914, 0.2188633935758844, 0.20722216295311227, 0.2949988406361081, -0.3957434028945863, -0.17565298537374474, 0.20926974227651954, 0.10897243115585298, 0.04026034793118015, -0.006375445874873549, -0.2437308221659623, 0.11485247501404956, -0.056723752534016965, -0.11208743041614071, -0.06897160849068314, -0.009860979244112968, -0.00517708599101752, -0.32409010419913103, -0.0024965372891165316, 0.03501520216464996, 0.05426710870116949, -0.10483815491199494, -0.10601056796032936, 0.009014291146304459, 0.09189434020314366, 0.03309312804718502, 0.08277976599056273, 0.10110188892111183, -0.0874580983677879, -0.0912837427156046, 0.388932234570384, -0.009059227807447313, -0.2895613134279847, 0.1643451790488325, -0.08104014313663356, -0.10792168234940619, 0.12631063438544515, 0.1753645509853959, 0.15585823114030062, -0.16012220089382026, 0.1246578430372756, -0.06467216898221523, 0.18365646995604037, 0.018779085366986692, -0.03156690231175162, 0.14012645059498027, 0.1821896936558187, 0.17048121612053366, 0.10600872022565454, -0.07578549732046667, -0.1042686697107274, -0.3351907458982896, -0.11238973781291861, -0.25088043591938913, -0.017568938073818572, -0.08603751818503952, -0.19806092953309418, 0.35205947612877936, 0.11369434422813356, 0.19777301224530675, 0.08877174492925405, 0.32473082691431043, 0.14874742498883278, 0.053909924221225085, 0.12840965576004237, 0.20363718542503192, 0.08768961005611345, 0.03571110041579231, -0.16692351556848734, 0.0893057262012735, 0.07454597698524594] |
1,802.09244 | A remark on torsion growth in homology and volume of 3-manifolds | We show that L\"uck's conjecture on torsion growth in homology implies that
two 3-manifolds have equal volume if the fundamental groups have the same set
of finite quotients.
| math.GR math.GT | we show that lucks conjecture on torsion growth in homology implies that two 3manifolds have equal volume if the fundamental groups have the same set of finite quotients | [['we', 'show', 'that', 'lucks', 'conjecture', 'on', 'torsion', 'growth', 'in', 'homology', 'implies', 'that', 'two', '3manifolds', 'have', 'equal', 'volume', 'if', 'the', 'fundamental', 'groups', 'have', 'the', 'same', 'set', 'of', 'finite', 'quotients']] | [-0.22377271384799055, 0.1636118170073522, -0.148643712845764, 0.06352226815319487, -0.03274997403579099, -0.1150832299276122, -0.045211311762354205, 0.3195433965052611, -0.2657269274682871, -0.22190795153645532, 0.10868148802962553, -0.2589312041361284, -0.14063781702342176, 0.21256368790221, -0.16358696187048086, -0.05722925512652312, 0.06747523197970752, 0.12555640882679395, -0.024490329220757952, -0.39856576826423407, 0.436316052850868, -0.13237255678645202, 0.2822000422581498, 0.16569064969995193, 0.10504409587675971, -0.056705212370226424, -0.014509000881974186, 0.05815031698771885, -0.2043002474846227, 0.07810989294999413, 0.23909189831465483, 0.03776664198708853, 0.21317571986998832, -0.3991063205259187, -0.1594876288186892, 0.23117080896294542, 0.14335950134721184, -0.00740727356501988, -0.08551157228066586, -0.17257958251450742, 0.20333734713494778, -0.19284643651917577, -0.10747198259923607, -0.03563746893944751, 0.06708018315423812, 0.016051044930853613, -0.06642658572777041, 0.022292763186019977, 0.06393438748948808, 0.11511953185046357, -0.09144140021609408, -0.11404428158753685, -0.06044417655461335, 0.1698660723798509, 0.04978264158125967, -0.022029210713558962, 0.04249961476307362, -0.03382739517837763, -0.15790308922130084, 0.37752789658095154, -0.07154586166143417, -0.25866679521277547, 0.14978623696203744, -0.26511403086728286, -0.28515796044043135, 0.14775324415781402, 0.07647308334708214, 0.10501557768189482, 0.04454793827608228, 0.20628091732838325, -0.18499615815068995, 0.10504845676145383, 0.18079639266112021, -0.038732427737808654, 0.16319518809073738, 0.047429920972457955, 0.13735853067399667, 0.10420356356397471, 0.07169712664991883, -0.002946124944303717, -0.3171235200549875, -0.2294098011251273, -0.1647010888638241, 0.16945449838281743, -0.14262249477074615, -0.2039418947700012, 0.2968591519498399, 0.04391029902866909, 0.106669110778187, 0.19980697500120317, 0.202115435286292, -0.0019482633002293628, 0.10713555437645741, 0.08926391847697752, 0.17824180410908802, 0.2096838051719325, -0.1267461199812325, -0.17120116835992252, 0.009819953053790544, 0.2582275578419545] |
1,802.09245 | Measurement of the D-meson nuclear modification factor and elliptic flow
in Pb-Pb collisions at $\sqrt{s_{\text{{NN}}}}$ = 5.02 TeV with ALICE at the
LHC | Heavy-flavour hadrons are effective probes to study the Quark-Gluon Plasma
(QGP) formed in ultra-relativistic heavy-ion collisions. The ALICE
Collaboration measured the D-mesons (D$^{0}$, D$^{+}$, D*$^{+}$ and
D$^{+}_{\text s}$) production in Pb-Pb collisions at $\sqrt{s_{\text{{NN}}}}$ =
5.02 TeV. The in-medium energy loss can be studied by means of the nuclear
modification factor ($R_{\text{AA}}$). The comparison between the D$^{+}_{\text
s}$ and the non-strange D-meson $R_{\text{AA}}$ can help to study the
hadronisation mechanism of the charm quark in the QGP. In semi-central
collisions the measurement of the D-meson elliptic flow, $v_{2}$, at low
$p_{\text{T}}$ allows to investigate the participation of the heavy quarks in
the collective expansion of the system while at high $p_{\text{T}}$ it
constrains the path-length dependence of the energy loss. Furthermore the
Event-Shape Engineering (ESE) technique is used to measure D-meson elliptic
flow in order to study the coupling of the charm quarks to the light quarks of
the underlying medium.
| nucl-ex | heavyflavour hadrons are effective probes to study the quarkgluon plasma qgp formed in ultrarelativistic heavyion collisions the alice collaboration measured the dmesons d0 d d and d_text s production in pbpb collisions at sqrts_textnn 502 tev the inmedium energy loss can be studied by means of the nuclear modification factor r_textaa the comparison between the d_text s and the nonstrange dmeson r_textaa can help to study the hadronisation mechanism of the charm quark in the qgp in semicentral collisions the measurement of the dmeson elliptic flow v_2 at low p_textt allows to investigate the participation of the heavy quarks in the collective expansion of the system while at high p_textt it constrains the pathlength dependence of the energy loss furthermore the eventshape engineering ese technique is used to measure dmeson elliptic flow in order to study the coupling of the charm quarks to the light quarks of the underlying medium | [['heavyflavour', 'hadrons', 'are', 'effective', 'probes', 'to', 'study', 'the', 'quarkgluon', 'plasma', 'qgp', 'formed', 'in', 'ultrarelativistic', 'heavyion', 'collisions', 'the', 'alice', 'collaboration', 'measured', 'the', 'dmesons', 'd0', 'd', 'd', 'and', 'd_text', 's', 'production', 'in', 'pbpb', 'collisions', 'at', 'sqrts_textnn', '502', 'tev', 'the', 'inmedium', 'energy', 'loss', 'can', 'be', 'studied', 'by', 'means', 'of', 'the', 'nuclear', 'modification', 'factor', 'r_textaa', 'the', 'comparison', 'between', 'the', 'd_text', 's', 'and', 'the', 'nonstrange', 'dmeson', 'r_textaa', 'can', 'help', 'to', 'study', 'the', 'hadronisation', 'mechanism', 'of', 'the', 'charm', 'quark', 'in', 'the', 'qgp', 'in', 'semicentral', 'collisions', 'the', 'measurement', 'of', 'the', 'dmeson', 'elliptic', 'flow', 'v_2', 'at', 'low', 'p_textt', 'allows', 'to', 'investigate', 'the', 'participation', 'of', 'the', 'heavy', 'quarks', 'in', 'the', 'collective', 'expansion', 'of', 'the', 'system', 'while', 'at', 'high', 'p_textt', 'it', 'constrains', 'the', 'pathlength', 'dependence', 'of', 'the', 'energy', 'loss', 'furthermore', 'the', 'eventshape', 'engineering', 'ese', 'technique', 'is', 'used', 'to', 'measure', 'dmeson', 'elliptic', 'flow', 'in', 'order', 'to', 'study', 'the', 'coupling', 'of', 'the', 'charm', 'quarks', 'to', 'the', 'light', 'quarks', 'of', 'the', 'underlying', 'medium']] | [-0.0747736818989506, 0.2815947649255395, -0.20721337281788388, 0.13525286833522843, 0.015859729916167756, -0.07856037264379362, -0.063159557916224, 0.31968819111585617, -0.24397757571190595, -0.2686641846876591, -0.09361435642000288, -0.39963313398426786, 0.140737678638349, 0.09177625889516397, 0.08585901817617317, 0.15106602494139224, 0.12983570655807852, 0.007229372733272612, -0.03489055438655972, -0.19399599786226948, 0.311103373899435, 0.09042908370494843, 0.22366396757153173, 0.266028787670657, 0.023842517274121445, 0.060768521521628524, -0.04992285304508793, -0.04291999530047178, -0.13004689983121354, 0.07598651268267229, 0.25213461386777153, 0.01950959491853913, 0.13342289192446818, -0.3231027769545714, -0.1315889063399906, 0.11945613561508556, 0.14772276842966675, 0.07313666534765313, -0.026097475669036307, -0.23515293839387597, 0.11793860661564395, -0.2520985214753697, -0.16042138624858732, -0.046485282042995096, -0.01564108710736036, -0.011071221502885843, -0.31675412066901726, 0.12252836100233253, -0.05553234747921427, 0.054460810576565565, 0.032592341337585824, -0.18333206659415738, -0.08990120902347068, 0.010867724164078633, 0.12112731766421347, 0.14369004568240296, 0.19977873992174863, -0.19564193358412013, -0.14514477378067872, 0.4320999723424514, -0.021775296581132957, -0.11621053339603046, 0.16851040577399545, -0.2364414442051202, -0.09507306672943135, 0.12627560348560413, 0.31907261386930863, 0.07671590631982933, -0.23053371652960777, 0.030181126465128424, -0.021153691622118154, 0.16553684228875984, 0.11181475626343551, 0.09170003646363814, 0.12571132344504196, 0.20012013145334398, -0.05661956895065184, 0.06873881394819667, -0.04433926644579818, -0.04632171551852177, -0.3923400125776728, -0.09404973743017762, -0.09653028038951258, 0.0490725344295303, -0.13440770445915404, -0.006777294591690103, 0.3928924094637235, 0.04623365291704734, 0.2866287835687399, -0.12463600841040412, 0.2824297920288518, 0.0791208064587166, 0.0031067496344136694, 0.15670119094196708, 0.3149208383386334, 0.21153907942275207, 0.2579280384769663, -0.3959598115676393, 0.0556186046761771, 0.1183414680728068] |
1,802.09246 | Efficient kernel-based variable selection with sparsistency | Variable selection is central to high-dimensional data analysis, and various
algorithms have been developed. Ideally, a variable selection algorithm shall
be flexible, scalable, and with theoretical guarantee, yet most existing
algorithms cannot attain these properties at the same time. In this article, a
three-step variable selection algorithm is developed, involving kernel-based
estimation of the regression function and its gradient functions as well as a
hard thresholding. Its key advantage is that it assumes no explicit model
assumption, admits general predictor effects, allows for scalable computation,
and attains desirable asymptotic sparsistency. The proposed algorithm can be
adapted to any reproducing kernel Hilbert space (RKHS) with different kernel
functions, and can be extended to interaction selection with slight
modification. Its computational cost is only linear in the data dimension, and
can be further improved through parallel computing. The sparsistency of the
proposed algorithm is established for general RKHS under mild conditions,
including linear and Gaussian kernels as special cases. Its effectiveness is
also supported by a variety of simulated and real examples.
| stat.ML cs.LG | variable selection is central to highdimensional data analysis and various algorithms have been developed ideally a variable selection algorithm shall be flexible scalable and with theoretical guarantee yet most existing algorithms cannot attain these properties at the same time in this article a threestep variable selection algorithm is developed involving kernelbased estimation of the regression function and its gradient functions as well as a hard thresholding its key advantage is that it assumes no explicit model assumption admits general predictor effects allows for scalable computation and attains desirable asymptotic sparsistency the proposed algorithm can be adapted to any reproducing kernel hilbert space rkhs with different kernel functions and can be extended to interaction selection with slight modification its computational cost is only linear in the data dimension and can be further improved through parallel computing the sparsistency of the proposed algorithm is established for general rkhs under mild conditions including linear and gaussian kernels as special cases its effectiveness is also supported by a variety of simulated and real examples | [['variable', 'selection', 'is', 'central', 'to', 'highdimensional', 'data', 'analysis', 'and', 'various', 'algorithms', 'have', 'been', 'developed', 'ideally', 'a', 'variable', 'selection', 'algorithm', 'shall', 'be', 'flexible', 'scalable', 'and', 'with', 'theoretical', 'guarantee', 'yet', 'most', 'existing', 'algorithms', 'can', 'not', 'attain', 'these', 'properties', 'at', 'the', 'same', 'time', 'in', 'this', 'article', 'a', 'threestep', 'variable', 'selection', 'algorithm', 'is', 'developed', 'involving', 'kernelbased', 'estimation', 'of', 'the', 'regression', 'function', 'and', 'its', 'gradient', 'functions', 'as', 'well', 'as', 'a', 'hard', 'thresholding', 'its', 'key', 'advantage', 'is', 'that', 'it', 'assumes', 'no', 'explicit', 'model', 'assumption', 'admits', 'general', 'predictor', 'effects', 'allows', 'for', 'scalable', 'computation', 'and', 'attains', 'desirable', 'asymptotic', 'sparsistency', 'the', 'proposed', 'algorithm', 'can', 'be', 'adapted', 'to', 'any', 'reproducing', 'kernel', 'hilbert', 'space', 'rkhs', 'with', 'different', 'kernel', 'functions', 'and', 'can', 'be', 'extended', 'to', 'interaction', 'selection', 'with', 'slight', 'modification', 'its', 'computational', 'cost', 'is', 'only', 'linear', 'in', 'the', 'data', 'dimension', 'and', 'can', 'be', 'further', 'improved', 'through', 'parallel', 'computing', 'the', 'sparsistency', 'of', 'the', 'proposed', 'algorithm', 'is', 'established', 'for', 'general', 'rkhs', 'under', 'mild', 'conditions', 'including', 'linear', 'and', 'gaussian', 'kernels', 'as', 'special', 'cases', 'its', 'effectiveness', 'is', 'also', 'supported', 'by', 'a', 'variety', 'of', 'simulated', 'and', 'real', 'examples']] | [-0.044757353357033944, -0.00026276986229053714, -0.13523992265258747, 0.09860300385714536, -0.1416215357923477, -0.20649738041738494, 0.020984399971165503, 0.4532389684160899, -0.265846404351147, -0.2763957132596239, 0.15852892407139882, -0.1713988337181924, -0.17353160238119486, 0.21992446980384664, -0.09537146947661834, 0.1430724543806612, 0.08231336339948732, 0.0077427761555698355, -0.08113732330034057, -0.2986472191851401, 0.27482022049943017, 0.10158395316391879, 0.29926689085142133, 0.023071767243199943, 0.14051596242090283, 0.025774913409735725, -0.03042770060574451, 0.04409504047216402, -0.06341994256592166, 0.09632326766837672, 0.2867083728088104, 0.18161613775188462, 0.3445130977561774, -0.36989944625771143, -0.22628426837206583, 0.15223485663974365, 0.14199743157508646, 0.07259215112525033, -0.03369509668922738, -0.23857939768887576, 0.08774992188558592, -0.13479787408720093, -0.10013381576938936, -0.18482762537365616, -0.031915515568652, 0.021564062074785343, -0.35972165555164914, 0.058076646338095776, 0.054321745757084365, 0.014832008148037028, -0.029351886534417997, -0.1416619798231173, 0.02398704982305501, 0.06827768825855084, 0.022029294029874892, 0.04706366903731349, 0.12431831881917921, -0.06997111998089965, -0.12941909383720995, 0.349768874461474, -0.06476742586315669, -0.2668341893746316, 0.21873138656115365, -0.07615641258079668, -0.14676391011735762, 0.1177021215270867, 0.18710098520182727, 0.11078378132800436, -0.16130014863246453, 0.12921554431297452, -0.04487822184676838, 0.12228942077405403, 0.012459836186764882, 0.034824484395549485, 0.07931723602235927, 0.18552385691052292, 0.08298771932778325, 0.1459142829955975, -0.06588091493763945, -0.09566561213275146, -0.3002806306756728, -0.15244802222546322, -0.21850636119992412, -0.0379272757249725, -0.16571720879952484, -0.1641513880244211, 0.37735815914020987, 0.1176263617150137, 0.19046878421744495, 0.07843940792951123, 0.3336605849479766, 0.15443566546173582, 0.0847743296157024, 0.12410310427358712, 0.18380240706879405, 0.11459797222646531, 0.04734044294118097, -0.1800699835310946, 0.14399353517369198, 0.05127388964494287] |
1,802.09247 | Frequency dependent polarisation switching in h-ErMnO$_3$ | We report an electric-field poling study of the geometric-driven improper
ferroelectric h-ErMnO$_3$. From a detailed dielectric analysis we deduce the
temperature and frequency dependent range for which single-crystalline
h-ErMnO$_3$ exhibits purely intrinsic dielectric behaviour, i.e., free from
extrinsic so-called Maxwell-Wagner polarisations that arise, for example, from
surface barrier layers. In this regime ferroelectric hysteresis loops as
function of frequency, temperature and applied electric fields are measured
revealing the theoretically predicted saturation polarisation in the order of 5
- 6 $\mu$C/cm$^2$. Special emphasis is put on frequency-dependent polarisation
switching, which is explained in terms of domain-wall movement similar to
proper ferroelectrics. Controlling the domain walls via electric fields brings
us an important step closer to their utilization in domain-wall-based
electronics.
| cond-mat.mtrl-sci | we report an electricfield poling study of the geometricdriven improper ferroelectric hermno_3 from a detailed dielectric analysis we deduce the temperature and frequency dependent range for which singlecrystalline hermno_3 exhibits purely intrinsic dielectric behaviour ie free from extrinsic socalled maxwellwagner polarisations that arise for example from surface barrier layers in this regime ferroelectric hysteresis loops as function of frequency temperature and applied electric fields are measured revealing the theoretically predicted saturation polarisation in the order of 5 6 muccm2 special emphasis is put on frequencydependent polarisation switching which is explained in terms of domainwall movement similar to proper ferroelectrics controlling the domain walls via electric fields brings us an important step closer to their utilization in domainwallbased electronics | [['we', 'report', 'an', 'electricfield', 'poling', 'study', 'of', 'the', 'geometricdriven', 'improper', 'ferroelectric', 'hermno_3', 'from', 'a', 'detailed', 'dielectric', 'analysis', 'we', 'deduce', 'the', 'temperature', 'and', 'frequency', 'dependent', 'range', 'for', 'which', 'singlecrystalline', 'hermno_3', 'exhibits', 'purely', 'intrinsic', 'dielectric', 'behaviour', 'ie', 'free', 'from', 'extrinsic', 'socalled', 'maxwellwagner', 'polarisations', 'that', 'arise', 'for', 'example', 'from', 'surface', 'barrier', 'layers', 'in', 'this', 'regime', 'ferroelectric', 'hysteresis', 'loops', 'as', 'function', 'of', 'frequency', 'temperature', 'and', 'applied', 'electric', 'fields', 'are', 'measured', 'revealing', 'the', 'theoretically', 'predicted', 'saturation', 'polarisation', 'in', 'the', 'order', 'of', '5', '6', 'muccm2', 'special', 'emphasis', 'is', 'put', 'on', 'frequencydependent', 'polarisation', 'switching', 'which', 'is', 'explained', 'in', 'terms', 'of', 'domainwall', 'movement', 'similar', 'to', 'proper', 'ferroelectrics', 'controlling', 'the', 'domain', 'walls', 'via', 'electric', 'fields', 'brings', 'us', 'an', 'important', 'step', 'closer', 'to', 'their', 'utilization', 'in', 'domainwallbased', 'electronics']] | [-0.15738709236029536, 0.15857522261297885, -0.051307027258284, 0.0007765335442321696, -0.1207528434340553, -0.11795700119471113, 0.08509956863869367, 0.4582148474352113, -0.2587846255989681, -0.28995621667026766, 0.037743209291185284, -0.22707459280179043, -0.11838326717381654, 0.22975280156543734, -0.016157984439532497, -0.009819471405754829, -0.07452848931806612, -0.04450172507043543, -0.04100050074138663, -0.11280839405713025, 0.23675535754942945, 0.006498977911241096, 0.34498074110035365, 0.1019987282182636, 0.09730935916766235, 0.010796240522879464, 0.04346436368510256, 0.0374909693602039, -0.11536162845412287, 0.056835685631838335, 0.23170181960349195, -0.09178688622416993, 0.1677532206723017, -0.44462769392251583, -0.20872507045639616, 0.035494303589702805, 0.10624213525543696, 0.12080955325077881, -0.06375443470460596, -0.23588371800322985, 0.03094888163393299, -0.09682735128745694, -0.1480258854411157, -0.08629432946628217, 0.003097897612264958, 0.013275267594445753, -0.24389591047154932, 0.08676384677628762, 0.0754320795872602, 0.14179029860453488, -0.10690507182755091, -0.17903304931804023, -0.03383367945809431, 0.07963926914290541, 0.08257128239272098, 0.06539829286690481, 0.1956608127561751, -0.11446983606709119, -0.11483949109719231, 0.3444932568898617, -0.039853300665432974, -0.12323562385000546, 0.11752192022535822, -0.2083150100039222, -0.03674795001680995, 0.16095592949142004, 0.1839423262860911, 0.10688490920965078, -0.14945835721125056, 0.08570970586051457, 0.08403338023043912, 0.17728929874358762, 0.128464721771487, 0.06680529051187352, 0.24050130960049815, 0.1847119690149878, 0.016978087859099794, 0.20665600381747434, -0.09260038007050753, -0.047310752758017646, -0.2882980423626201, -0.1181719485742586, -0.16241066312369215, 0.10374297082909897, -0.11797713569806013, -0.2019676873460412, 0.3979920398700854, 0.12858209665463274, 0.14768474253801758, -0.03621893592283194, 0.2631382389688575, 0.13090276487817956, 0.08083632041836672, 0.004298649112099846, 0.2696245564549262, 0.18871039111801455, 0.1694438970318578, -0.2800311976060239, 0.09080353408955552, -0.04156501581320331] |
1,802.09248 | Automatic spin-chain learning to explore the quantum speed limit | One of the ambitious goals of artificial intelligence is to build a machine
that outperforms human intelligence, even if limited knowledge and data are
provided. Reinforcement Learning (RL) provides one such possibility to reach
this goal. In this work, we consider a specific task from quantum physics, i.e.
quantum state transfer in a one-dimensional spin chain. The mission for the
machine is to find transfer schemes with fastest speeds while maintaining high
transfer fidelities. The first scenario we consider is when the Hamiltonian is
time-independent. We update the coupling strength by minimizing a loss function
dependent on both the fidelity and the speed. Compared with a scheme proven to
be at the quantum speed limit for the perfect state transfer, the scheme
provided by RL is faster while maintaining the infidelity below $5\times
10^{-4}$. In the second scenario where a time-dependent external field is
introduced, we convert the state transfer process into a Markov decision
process that can be understood by the machine. We solve it with the deep
Q-learning algorithm. After training, the machine successfully finds transfer
schemes with high fidelities and speeds, which are faster than previously known
ones. These results show that Reinforcement Learning can be a powerful tool for
quantum control problems.
| cond-mat.mes-hall physics.comp-ph quant-ph | one of the ambitious goals of artificial intelligence is to build a machine that outperforms human intelligence even if limited knowledge and data are provided reinforcement learning rl provides one such possibility to reach this goal in this work we consider a specific task from quantum physics ie quantum state transfer in a onedimensional spin chain the mission for the machine is to find transfer schemes with fastest speeds while maintaining high transfer fidelities the first scenario we consider is when the hamiltonian is timeindependent we update the coupling strength by minimizing a loss function dependent on both the fidelity and the speed compared with a scheme proven to be at the quantum speed limit for the perfect state transfer the scheme provided by rl is faster while maintaining the infidelity below 5times 104 in the second scenario where a timedependent external field is introduced we convert the state transfer process into a markov decision process that can be understood by the machine we solve it with the deep qlearning algorithm after training the machine successfully finds transfer schemes with high fidelities and speeds which are faster than previously known ones these results show that reinforcement learning can be a powerful tool for quantum control problems | [['one', 'of', 'the', 'ambitious', 'goals', 'of', 'artificial', 'intelligence', 'is', 'to', 'build', 'a', 'machine', 'that', 'outperforms', 'human', 'intelligence', 'even', 'if', 'limited', 'knowledge', 'and', 'data', 'are', 'provided', 'reinforcement', 'learning', 'rl', 'provides', 'one', 'such', 'possibility', 'to', 'reach', 'this', 'goal', 'in', 'this', 'work', 'we', 'consider', 'a', 'specific', 'task', 'from', 'quantum', 'physics', 'ie', 'quantum', 'state', 'transfer', 'in', 'a', 'onedimensional', 'spin', 'chain', 'the', 'mission', 'for', 'the', 'machine', 'is', 'to', 'find', 'transfer', 'schemes', 'with', 'fastest', 'speeds', 'while', 'maintaining', 'high', 'transfer', 'fidelities', 'the', 'first', 'scenario', 'we', 'consider', 'is', 'when', 'the', 'hamiltonian', 'is', 'timeindependent', 'we', 'update', 'the', 'coupling', 'strength', 'by', 'minimizing', 'a', 'loss', 'function', 'dependent', 'on', 'both', 'the', 'fidelity', 'and', 'the', 'speed', 'compared', 'with', 'a', 'scheme', 'proven', 'to', 'be', 'at', 'the', 'quantum', 'speed', 'limit', 'for', 'the', 'perfect', 'state', 'transfer', 'the', 'scheme', 'provided', 'by', 'rl', 'is', 'faster', 'while', 'maintaining', 'the', 'infidelity', 'below', '5times', '104', 'in', 'the', 'second', 'scenario', 'where', 'a', 'timedependent', 'external', 'field', 'is', 'introduced', 'we', 'convert', 'the', 'state', 'transfer', 'process', 'into', 'a', 'markov', 'decision', 'process', 'that', 'can', 'be', 'understood', 'by', 'the', 'machine', 'we', 'solve', 'it', 'with', 'the', 'deep', 'qlearning', 'algorithm', 'after', 'training', 'the', 'machine', 'successfully', 'finds', 'transfer', 'schemes', 'with', 'high', 'fidelities', 'and', 'speeds', 'which', 'are', 'faster', 'than', 'previously', 'known', 'ones', 'these', 'results', 'show', 'that', 'reinforcement', 'learning', 'can', 'be', 'a', 'powerful', 'tool', 'for', 'quantum', 'control', 'problems']] | [-0.07439330737875069, 0.13159705444184827, -0.041852313534636955, 0.05602054919172499, -0.07296866434626281, -0.19546965520051354, 0.055048332386876196, 0.42685630210071746, -0.285770908683014, -0.33276786252820084, 0.09192234972543852, -0.2382542936411659, -0.10879968858473184, 0.23716786981179397, -0.06181799952795241, 0.09680788144378842, 0.09433567769445696, 0.05640690397127595, -0.0484147268806322, -0.264416054829286, 0.2830492079662593, 0.053304480380707564, 0.3127495282017671, 0.003064482841297116, 0.14667615979668025, -0.0124345948621269, 0.06510713773280002, -0.03370434361356266, -0.06831606720837406, 0.1217462922360531, 0.2947120426315362, 0.18144378895663377, 0.3318509042457433, -0.3922807598685466, -0.23300540774554304, 0.10502276571243731, 0.125225767185256, 0.15862839945616852, -0.031783995667565165, -0.2695678303072464, 0.08875015438127432, -0.18265207425139626, -0.05912815104238689, -0.12368642913801506, -0.024825876975970034, -0.029689502094485752, -0.2979106508083506, 0.02571956665273213, 0.07220060992827729, 0.021087705415393253, -0.02760681312743719, -0.07895230603612309, 0.0483117842621812, 0.11890705932738165, 0.0033024372473625845, 0.09403518371699938, 0.14015983177792027, -0.18337058825463562, -0.17434102402394186, 0.37104693106692105, -0.06886623492183275, -0.1917960038600779, 0.1843300357108339, -0.06768001749596188, -0.1032879034495795, 0.11602416436992657, 0.17666675039715116, 0.13626909840318546, -0.1318431038139484, 0.0546327196414813, 0.02663539669666331, 0.1828772043638345, -0.002013500391062602, -0.0021759463853917075, 0.17068894497272605, 0.2122591035338842, 0.08945086738094687, 0.13975513290367497, -0.06452255801623236, -0.16275931423353665, -0.2199883263612401, -0.15071500839385232, -0.2052825980094144, 0.059834798718847844, -0.05757479051341929, -0.0690266963843826, 0.3406131731005975, 0.19895709039652607, 0.20100477705845265, 0.08626601038539095, 0.355730018533825, 0.14231659921148376, 0.06808168187684344, 0.14767676239773334, 0.2726651738528886, 0.0839820853705762, 0.11054480290469867, -0.23496233621282725, 0.08969201527771006, 0.026247064913035308] |
1,802.09249 | Joins and meets in the structure of Ceers | We study computably enumerable equivalence relations (abbreviated as ceers)
under computable reducibility, and we investigate the resulting degree
structure Ceers, which is a poset with a smallest and a greatest element. We
point out a partition of the ceers into three classes: the finite ceers, the
light ceers, and the dark ceers. These classes yield a partition of the degree
structure as well, and in the language of posets the corresponding classes of
degrees are first order definable within Ceers. There is no least, no maximal,
no greatest dark degree, but there are infinitely many minimal dark degrees. We
study joins and meets in Ceers, addressing the cases when two incomparable
degrees of ceers X,Y have or do not have join or meet according to where X,Y
are located in the classes of the aforementioned partition: in particular no
pair of dark ceers has join, and no pair in which at least one ceer is dark has
meet. We also exhibit examples of ceers X,Y having join which coincides with
their uniform join, but also examples when their join is strictly less than the
uniform join. We study join-irreducibility and meet-irreducibility. In
particular we characterize the property of being meet-irreducible for a ceer E,
by showing that it coincides with the property of E being self-full, i.e. every
reducibility from E to itself is in fact surjective on its equivalence classes
(this property properly extends darkness). We then study the quotient structure
obtained by dividing the poset Ceers by the degrees of the finite ceers, and
study joins and meets in this quotient structure. We look at automorphisms of
Ceers, and show that there are continuum many automorphisms fixing the dark
ceers, and continuum many automorphisms fixing the light ceers. Finally, we
compute the complexity of the index sets of the classes of ceers studied in the
paper.
| math.LO | we study computably enumerable equivalence relations abbreviated as ceers under computable reducibility and we investigate the resulting degree structure ceers which is a poset with a smallest and a greatest element we point out a partition of the ceers into three classes the finite ceers the light ceers and the dark ceers these classes yield a partition of the degree structure as well and in the language of posets the corresponding classes of degrees are first order definable within ceers there is no least no maximal no greatest dark degree but there are infinitely many minimal dark degrees we study joins and meets in ceers addressing the cases when two incomparable degrees of ceers xy have or do not have join or meet according to where xy are located in the classes of the aforementioned partition in particular no pair of dark ceers has join and no pair in which at least one ceer is dark has meet we also exhibit examples of ceers xy having join which coincides with their uniform join but also examples when their join is strictly less than the uniform join we study joinirreducibility and meetirreducibility in particular we characterize the property of being meetirreducible for a ceer e by showing that it coincides with the property of e being selffull ie every reducibility from e to itself is in fact surjective on its equivalence classes this property properly extends darkness we then study the quotient structure obtained by dividing the poset ceers by the degrees of the finite ceers and study joins and meets in this quotient structure we look at automorphisms of ceers and show that there are continuum many automorphisms fixing the dark ceers and continuum many automorphisms fixing the light ceers finally we compute the complexity of the index sets of the classes of ceers studied in the paper | [['we', 'study', 'computably', 'enumerable', 'equivalence', 'relations', 'abbreviated', 'as', 'ceers', 'under', 'computable', 'reducibility', 'and', 'we', 'investigate', 'the', 'resulting', 'degree', 'structure', 'ceers', 'which', 'is', 'a', 'poset', 'with', 'a', 'smallest', 'and', 'a', 'greatest', 'element', 'we', 'point', 'out', 'a', 'partition', 'of', 'the', 'ceers', 'into', 'three', 'classes', 'the', 'finite', 'ceers', 'the', 'light', 'ceers', 'and', 'the', 'dark', 'ceers', 'these', 'classes', 'yield', 'a', 'partition', 'of', 'the', 'degree', 'structure', 'as', 'well', 'and', 'in', 'the', 'language', 'of', 'posets', 'the', 'corresponding', 'classes', 'of', 'degrees', 'are', 'first', 'order', 'definable', 'within', 'ceers', 'there', 'is', 'no', 'least', 'no', 'maximal', 'no', 'greatest', 'dark', 'degree', 'but', 'there', 'are', 'infinitely', 'many', 'minimal', 'dark', 'degrees', 'we', 'study', 'joins', 'and', 'meets', 'in', 'ceers', 'addressing', 'the', 'cases', 'when', 'two', 'incomparable', 'degrees', 'of', 'ceers', 'xy', 'have', 'or', 'do', 'not', 'have', 'join', 'or', 'meet', 'according', 'to', 'where', 'xy', 'are', 'located', 'in', 'the', 'classes', 'of', 'the', 'aforementioned', 'partition', 'in', 'particular', 'no', 'pair', 'of', 'dark', 'ceers', 'has', 'join', 'and', 'no', 'pair', 'in', 'which', 'at', 'least', 'one', 'ceer', 'is', 'dark', 'has', 'meet', 'we', 'also', 'exhibit', 'examples', 'of', 'ceers', 'xy', 'having', 'join', 'which', 'coincides', 'with', 'their', 'uniform', 'join', 'but', 'also', 'examples', 'when', 'their', 'join', 'is', 'strictly', 'less', 'than', 'the', 'uniform', 'join', 'we', 'study', 'joinirreducibility', 'and', 'meetirreducibility', 'in', 'particular', 'we', 'characterize', 'the', 'property', 'of', 'being', 'meetirreducible', 'for', 'a', 'ceer', 'e', 'by', 'showing', 'that', 'it', 'coincides', 'with', 'the', 'property', 'of', 'e', 'being', 'selffull', 'ie', 'every', 'reducibility', 'from', 'e', 'to', 'itself', 'is', 'in', 'fact', 'surjective', 'on', 'its', 'equivalence', 'classes', 'this', 'property', 'properly', 'extends', 'darkness', 'we', 'then', 'study', 'the', 'quotient', 'structure', 'obtained', 'by', 'dividing', 'the', 'poset', 'ceers', 'by', 'the', 'degrees', 'of', 'the', 'finite', 'ceers', 'and', 'study', 'joins', 'and', 'meets', 'in', 'this', 'quotient', 'structure', 'we', 'look', 'at', 'automorphisms', 'of', 'ceers', 'and', 'show', 'that', 'there', 'are', 'continuum', 'many', 'automorphisms', 'fixing', 'the', 'dark', 'ceers', 'and', 'continuum', 'many', 'automorphisms', 'fixing', 'the', 'light', 'ceers', 'finally', 'we', 'compute', 'the', 'complexity', 'of', 'the', 'index', 'sets', 'of', 'the', 'classes', 'of', 'ceers', 'studied', 'in', 'the', 'paper']] | [-0.16882754842982037, 0.13273992924989061, -0.07826216087000919, 0.07724845564119165, -0.06456589329762542, -0.11111597538304825, 0.027343656834644063, 0.38137675737322985, -0.30354000278139864, -0.26285659662277433, 0.0748153619047443, -0.3147104708660467, -0.0801654511862366, 0.14537290797996474, -0.06250859449542998, -0.019332746288996325, 0.017582821774066674, 0.09423496604598815, -0.062494897550684124, -0.27300208765599465, 0.3577539855758873, -0.053655580291068, 0.19601130497860997, 0.03208977089387523, 0.09022701270817444, -0.0060225169935638045, -0.010397168084845141, 0.0643767065662092, -0.1688710173055643, 0.07183763103443959, 0.23743040447452052, 0.15919555028066576, 0.22069663849196647, -0.3440641818207261, -0.1368946117848109, 0.2345207459780272, 0.09911192606471089, 0.005023567178332265, -0.009173989310035834, -0.21634079572848147, 0.13435979516069374, -0.14892078755137905, -0.12003393958815757, -0.04007914560402628, 0.03828756739400644, 0.024798459082376212, -0.18064372638108062, -0.03517939526229348, 0.13166603547394629, 0.10347668560270488, -0.0003954864056093095, -0.10811600891578017, -0.08756099801184913, 0.08678432493839638, 0.023383377227183505, 0.003390921544575808, 0.03652042199441329, -0.1313739789770064, -0.11315951023815395, 0.4221443740310135, -0.00666769924030519, -0.1870752419554324, 0.20805981011492097, -0.15806224997219281, -0.19374799405322016, 0.11537085735129521, 0.08245541891722265, 0.11287996102903598, -0.07784421057556376, 0.18295954720644445, -0.12592826303586538, 0.1558739870016842, 0.13415842283641907, 0.07013290399172666, 0.1979632900519528, 0.11122725648102443, 0.09608448073979364, 0.18068931718490824, 0.010887667591519216, -0.06381450274052232, -0.33935918384444674, -0.16941489553645106, -0.11682821173841755, 0.028727761385370778, -0.08859447956438446, -0.17048850321070919, 0.3951221762492863, 0.09608041575738514, 0.18393833782322996, 0.09009284090084858, 0.23328553503866192, 0.06085799409396524, 0.07234314969874724, 0.11278527423441166, 0.18747629781917127, 0.1370150047572013, -0.07571189647422133, -0.1586454210200292, 0.036634062885556345, 0.10100690295670206] |
1,802.0925 | The minimum number of Hamilton cycles in a hamiltonian threshold graph
of a prescribed order | We prove that the minimum number of Hamilton cycles in a hamiltonian
threshold graph of order $n$ is $2^{\lfloor (n-3)/2\rfloor}$ and this minimum
number is attained uniquely by the graph with degree sequence
$n-1,n-1,n-2,\ldots,\lceil n/2\rceil,\lceil n/2\rceil,\ldots,3,2$ of $n-2$
distinct degrees. This graph is also the unique graph of minimum size among all
hamiltonian threshold graphs of order $n.$
| math.CO | we prove that the minimum number of hamilton cycles in a hamiltonian threshold graph of order n is 2lfloor n32rfloor and this minimum number is attained uniquely by the graph with degree sequence n1n1n2ldotslceil n2rceillceil n2rceilldots32 of n2 distinct degrees this graph is also the unique graph of minimum size among all hamiltonian threshold graphs of order n | [['we', 'prove', 'that', 'the', 'minimum', 'number', 'of', 'hamilton', 'cycles', 'in', 'a', 'hamiltonian', 'threshold', 'graph', 'of', 'order', 'n', 'is', '2lfloor', 'n32rfloor', 'and', 'this', 'minimum', 'number', 'is', 'attained', 'uniquely', 'by', 'the', 'graph', 'with', 'degree', 'sequence', 'n1n1n2ldotslceil', 'n2rceillceil', 'n2rceilldots32', 'of', 'n2', 'distinct', 'degrees', 'this', 'graph', 'is', 'also', 'the', 'unique', 'graph', 'of', 'minimum', 'size', 'among', 'all', 'hamiltonian', 'threshold', 'graphs', 'of', 'order', 'n']] | [-0.26459048560786025, 0.19654043586234804, -0.0024130094313511144, -0.012081379284306118, -0.056561797124299186, -0.09361479451224484, 0.055163464959521125, 0.32937326417218343, -0.26774612274365844, -0.41172150312060557, 0.06458019570089635, -0.3070901082138772, -0.1885944923679172, 0.044379472335869516, -0.0696362226649567, 0.060675173922424656, 0.12712491936636744, 0.1884133164615681, 0.06481591816042999, -0.2860894153968224, 0.28622961887244686, -0.010589863139170187, 0.12949734243253866, 0.05210057621890748, 0.08205440316211295, 0.051041342990679875, 0.09839056932401878, 0.10060822370427626, -0.1888857745373874, 0.08120627214925157, 0.2379469728588851, 0.18322884216818405, 0.23768348867694536, -0.35050375092153746, -0.16129212531571588, 0.2507461794583058, 0.11631278497063452, 0.07177184147898245, 0.0866840679017413, -0.1140517546575413, 0.18398207817571582, -0.09962240445747739, -0.12181632164693265, 0.01627589011978772, 0.10517417530839641, 0.023292137447882583, -0.29008309986373343, -0.014029790867762468, 0.106563250379016, 0.08097737912019645, 0.12207556290000125, -0.17964552120409077, -0.0901263878180611, 0.12400757743442362, -0.06526369754552704, 0.0653407182997196, 0.0020459420910036124, -0.1145195443165937, -0.12319983341903598, 0.33187268770955225, -0.00016605646642683833, -0.11192415947853415, 0.08297479686249669, -0.13869952989086784, -0.17845944986954607, 0.1753041223898806, 0.10101131494674417, 0.15584995418235106, -0.12145836392624511, 0.12969578781781751, -0.08803592472233707, 0.1929887796372727, 0.12462609990810354, 0.06171046453528106, 0.09896277036103937, 0.1412089729198703, 0.22566800852547642, 0.17183600255736597, 0.019339989663826093, -0.025792317844375415, -0.3167686316150206, -0.10789659015696358, -0.30690136857339423, 0.08049429046352291, -0.25835924011766176, -0.15333835504673146, 0.48025683989679374, 0.10652704159211782, 0.187712875953703, 0.1255249557154322, 0.19505384826549776, 0.13314715303756572, 0.011329603295221372, 0.18643324781657644, 0.13856448081356507, 0.19251433388692224, -0.06637175362212239, -0.23380351045030962, 0.005323148410146435, 0.1762442950124818] |
1,802.09251 | Phenomenology of the Higgs sector of a Dimension-7 Neutrino Mass
Generation Mechanism | In this paper, we revisit the dimension-7 neutrino mass generation mechanism
based on the addition of an isospin $3/2$ scalar quadruplet and two vector-like
iso-triplet leptons to the standard model. We discuss the LHC phenomenology of
the charged scalars of this model, complemented by the electroweak precision
and lepton flavor violation constraints. We pay particular attention to the
triply charged and doubly charged components. We focus on the
same-sign-tri-lepton signatures originating from the triply-charged scalars and
find a discovery reach of 600 - 950 GeV at 3 ab$^{-1}$ of integrated luminosity
at the LHC. On the other hand, doubly charged Higgs has been an object of
collider searches for a long time, and we show how the present bounds on its
mass depend on the particle spectrum of the theory. Strong constraint on the
model parameter space can arise from the measured decay rate of the Standard
Model Higgs to a pair of photons as well.
| hep-ph | in this paper we revisit the dimension7 neutrino mass generation mechanism based on the addition of an isospin 32 scalar quadruplet and two vectorlike isotriplet leptons to the standard model we discuss the lhc phenomenology of the charged scalars of this model complemented by the electroweak precision and lepton flavor violation constraints we pay particular attention to the triply charged and doubly charged components we focus on the samesigntrilepton signatures originating from the triplycharged scalars and find a discovery reach of 600 950 gev at 3 ab1 of integrated luminosity at the lhc on the other hand doubly charged higgs has been an object of collider searches for a long time and we show how the present bounds on its mass depend on the particle spectrum of the theory strong constraint on the model parameter space can arise from the measured decay rate of the standard model higgs to a pair of photons as well | [['in', 'this', 'paper', 'we', 'revisit', 'the', 'dimension7', 'neutrino', 'mass', 'generation', 'mechanism', 'based', 'on', 'the', 'addition', 'of', 'an', 'isospin', '32', 'scalar', 'quadruplet', 'and', 'two', 'vectorlike', 'isotriplet', 'leptons', 'to', 'the', 'standard', 'model', 'we', 'discuss', 'the', 'lhc', 'phenomenology', 'of', 'the', 'charged', 'scalars', 'of', 'this', 'model', 'complemented', 'by', 'the', 'electroweak', 'precision', 'and', 'lepton', 'flavor', 'violation', 'constraints', 'we', 'pay', 'particular', 'attention', 'to', 'the', 'triply', 'charged', 'and', 'doubly', 'charged', 'components', 'we', 'focus', 'on', 'the', 'samesigntrilepton', 'signatures', 'originating', 'from', 'the', 'triplycharged', 'scalars', 'and', 'find', 'a', 'discovery', 'reach', 'of', '600', '950', 'gev', 'at', '3', 'ab1', 'of', 'integrated', 'luminosity', 'at', 'the', 'lhc', 'on', 'the', 'other', 'hand', 'doubly', 'charged', 'higgs', 'has', 'been', 'an', 'object', 'of', 'collider', 'searches', 'for', 'a', 'long', 'time', 'and', 'we', 'show', 'how', 'the', 'present', 'bounds', 'on', 'its', 'mass', 'depend', 'on', 'the', 'particle', 'spectrum', 'of', 'the', 'theory', 'strong', 'constraint', 'on', 'the', 'model', 'parameter', 'space', 'can', 'arise', 'from', 'the', 'measured', 'decay', 'rate', 'of', 'the', 'standard', 'model', 'higgs', 'to', 'a', 'pair', 'of', 'photons', 'as', 'well']] | [-0.07207930311500155, 0.22025942482835123, -0.021813324386520044, 0.12864540649695902, -0.05989593836666363, -0.16949804254819628, 0.028869986003446212, 0.3248009690168229, -0.20768561145266543, -0.30879208545333575, 0.05427192163717171, -0.32296339319656037, 0.0015113112583224262, 0.13830123620497836, 0.06152141479739024, 0.05508488088554413, 0.07441742093507926, 0.047880059319802305, -0.06035652227983991, -0.22774564418654478, 0.32251361009737406, 0.05870357992175918, 0.20194603366226974, 0.12510364968934423, 0.09992224224177855, 0.0056505085516406536, -0.04056637501344085, -0.08668965556036663, -0.12601182847767584, 0.11115065869246307, 0.09997458462663866, 0.10910206506718192, 0.12777032614262265, -0.3736360644174788, -0.12061821610376529, 0.18764320789691205, 0.13799839126333208, 0.10572224420755376, -0.10173672415745481, -0.3239320272023415, 0.09248806723671688, -0.2184866123663431, -0.10956325360827825, -0.018034209882804228, -0.05054730923495606, -0.07051250021662805, -0.3070996685268043, 0.06783343210450507, -0.02235020717300547, 0.012036682505692755, -0.021407610247691777, -0.16862960706174665, -0.06232391848295395, -0.0013835664064466178, 0.16043440537079684, -0.0072176677874870015, 0.15861863617039915, -0.19078208928528642, -0.19056854154022604, 0.3953362346094634, -0.11845737966775362, -0.17200571423481134, 0.18217536148330946, -0.1758949091150002, -0.1647294171263355, 0.09287254160342666, 0.2688822627170374, 0.11720218760560133, -0.14922624510749208, 0.17904659424562236, -0.07471724331428829, 0.1793387254198118, 0.04066541993555117, 0.09381062613630836, 0.27716892903561813, 0.19944621966289985, 0.04045540938797738, 0.08195766849955846, -0.13005519258281725, -0.06171613963707894, -0.40581845859815546, -0.1329842379056643, -0.08062169568117272, 0.03811704170438098, -0.04436163465118613, -0.07976089587190201, 0.4332792388287361, 0.1162483579049782, 0.27286938545838385, 0.024048803912403136, 0.2722181381964633, 0.10004352662914928, 0.07507775339706915, 0.011692267647840827, 0.33877524401532944, 0.12972382199194574, 0.13230755542368663, -0.24181930656399722, -0.022481503832160025, 0.07142014236661134] |
1,802.09252 | Comments on "Design of fractional-order variants of complex LMS and NLMS
algorithms for adaptive channel equalization" | The purpose of this note is to discuss some aspects of recently proposed
fractional-order variants of complex least mean square (CLMS) and normalized
least mean square (NLMS) algorithms in ``Design of Fractional-order Variants of
Complex LMS and Normalized LMS Algorithms for Adaptive Channel Equalization''
[Nonlinear Dyn. 88(2), 839-858 (2017)]. It is observed that these algorithms do
not always converge whereas they have apparently no advantage over the CLMS and
NLMS algorithms whenever they converge. Our claims are based on analytical
reasoning and are supported by numerical simulations.
| math.OC | the purpose of this note is to discuss some aspects of recently proposed fractionalorder variants of complex least mean square clms and normalized least mean square nlms algorithms in design of fractionalorder variants of complex lms and normalized lms algorithms for adaptive channel equalization nonlinear dyn 882 839858 2017 it is observed that these algorithms do not always converge whereas they have apparently no advantage over the clms and nlms algorithms whenever they converge our claims are based on analytical reasoning and are supported by numerical simulations | [['the', 'purpose', 'of', 'this', 'note', 'is', 'to', 'discuss', 'some', 'aspects', 'of', 'recently', 'proposed', 'fractionalorder', 'variants', 'of', 'complex', 'least', 'mean', 'square', 'clms', 'and', 'normalized', 'least', 'mean', 'square', 'nlms', 'algorithms', 'in', 'design', 'of', 'fractionalorder', 'variants', 'of', 'complex', 'lms', 'and', 'normalized', 'lms', 'algorithms', 'for', 'adaptive', 'channel', 'equalization', 'nonlinear', 'dyn', '882', '839858', '2017', 'it', 'is', 'observed', 'that', 'these', 'algorithms', 'do', 'not', 'always', 'converge', 'whereas', 'they', 'have', 'apparently', 'no', 'advantage', 'over', 'the', 'clms', 'and', 'nlms', 'algorithms', 'whenever', 'they', 'converge', 'our', 'claims', 'are', 'based', 'on', 'analytical', 'reasoning', 'and', 'are', 'supported', 'by', 'numerical', 'simulations']] | [-0.09779191412421506, 0.01710420887549083, -0.09048341600181059, 0.06776180824259469, -0.0636552483070815, -0.199981871580835, -0.032289776452925315, 0.46450160006277785, -0.21113388492660815, -0.27331988795032336, 0.18770574494996, -0.26845454808790237, -0.26664256781534573, 0.19128286554667623, -0.12169532354401294, 0.09414640924525122, 0.08206799307968034, 0.029828238219759145, -0.07146078489482575, -0.35997837486265355, 0.1878286735208835, 0.04626186586494103, 0.2375156018818014, -0.012230514031618313, 0.13984006520382367, -0.032182090206418275, -0.06541960172593421, 0.038671514181810064, -0.1415644691270393, 0.07772699852885548, 0.24643002788341323, 0.1343021682127877, 0.3764981583280619, -0.3877497152533642, -0.18373212090498486, 0.14554476651882883, 0.20317170710497817, 0.02205910085332255, 0.004198218083962105, -0.22639727083489644, 0.14798107981508554, -0.08741194265894592, -0.043619037665383414, -0.09270321430508481, -0.02558317550912846, 0.11079804298229688, -0.25949171187659337, 0.0937082490472253, 0.110860685725848, 0.0947046066569381, -0.018168862734455615, -0.2576789461444457, 0.04695569051072261, 0.04100091841754092, 0.034726250399618824, -0.0030230067367124002, 0.057536313312972875, -0.05664384819643009, -0.18482245565500371, 0.3266065070882093, -0.024511144880941787, -0.246882498827438, 0.1976401478053493, -0.06297500522233286, -0.10980199904419309, 0.1588930128477947, 0.19066683764482828, 0.08799127441679322, -0.1337443393936684, 0.03662488288733415, -0.03065930743875025, 0.17918422025476777, 0.049787418258093505, 0.019206284587325657, 0.11654119594780685, 0.13784104273762815, 0.08892062227349988, 0.017569596283570972, -0.07147725622527042, -0.19665131534904587, -0.233604108264973, -0.12745079643981055, -0.18936518181608122, -0.029786461593175773, -0.060141136885355335, -0.19394658869782158, 0.3573995578795845, 0.17062338017100512, 0.10311870195707956, 0.137930964571857, 0.3044490935930679, 0.13779233843440103, 0.07046369172979233, 0.17622930727909905, 0.23310193503553014, 0.14193576672872485, 0.09786243394401661, -0.20676087223123327, 0.08632119809450625, 0.09343859809180072] |
1,802.09253 | Categorical relations between Langlands dual quantum affine algebras:
Exceptional cases | We first compute the denominator formulas for quantum affine algebras of all
exceptional types. Then we prove the isomorphisms among Grothendieck rings of
categories $C_Q^{(t)}$ $(t=1,2,3)$, $\mathscr{C}_{\mathscr{Q}}^{(1)}$ and
$\mathscr{C}_{\mathfrak{Q}}^{(1)}$. These results give Dorey's rule for all
exceptional affine types, prove the conjectures of Kashiwara-Kang-Kim and
Kashiwara-Oh, and provides the partial answers of Frenkel-Hernandez on
Langlands duality for finite dimensional representations of quantum affine
algebras of exceptional types.
| math.RT math.CO | we first compute the denominator formulas for quantum affine algebras of all exceptional types then we prove the isomorphisms among grothendieck rings of categories c_qt t123 mathscrc_mathscrq1 and mathscrc_mathfrakq1 these results give doreys rule for all exceptional affine types prove the conjectures of kashiwarakangkim and kashiwaraoh and provides the partial answers of frenkelhernandez on langlands duality for finite dimensional representations of quantum affine algebras of exceptional types | [['we', 'first', 'compute', 'the', 'denominator', 'formulas', 'for', 'quantum', 'affine', 'algebras', 'of', 'all', 'exceptional', 'types', 'then', 'we', 'prove', 'the', 'isomorphisms', 'among', 'grothendieck', 'rings', 'of', 'categories', 'c_qt', 't123', 'mathscrc_mathscrq1', 'and', 'mathscrc_mathfrakq1', 'these', 'results', 'give', 'doreys', 'rule', 'for', 'all', 'exceptional', 'affine', 'types', 'prove', 'the', 'conjectures', 'of', 'kashiwarakangkim', 'and', 'kashiwaraoh', 'and', 'provides', 'the', 'partial', 'answers', 'of', 'frenkelhernandez', 'on', 'langlands', 'duality', 'for', 'finite', 'dimensional', 'representations', 'of', 'quantum', 'affine', 'algebras', 'of', 'exceptional', 'types']] | [-0.1703583954700402, 0.018719905846944405, -0.06991304541450172, 0.09571646557499965, -0.09997087782101026, -0.20264252063833058, 0.019810689095821645, 0.31420879113295724, -0.3411669342054261, -0.1745096542798574, 0.10503154553635607, -0.21909546784110487, -0.1767068575653765, 0.2250741860637116, -0.13711796836102463, -0.028223985998285194, 0.028782862053799724, 0.09476947426677697, -0.15135016767973347, -0.382558932054847, 0.4171824941175088, -0.11309489696323576, 0.25041466531535933, 0.06063128481545146, 0.1693810406399684, 0.05220375532313945, -0.044417956710926125, -0.055160651264327856, -0.1841102915091647, 0.1540317925345522, 0.3925511593383456, 0.0843557307334055, 0.14632848992810718, -0.3775527487021117, -0.024463562183969077, 0.1721509298575776, 0.14363836030136712, 0.07514663918002967, 0.01230987277998042, -0.28581488895274343, 0.09628833162908752, -0.17027344420138332, -0.13919236975175048, -0.131532514674796, 0.0786770678177062, 0.051089148332793564, -0.240637170594363, 0.018868797251747713, 0.11010469171026396, 0.17520963535496284, -0.1438740956345721, -0.12105191487168508, 0.0038099285022961714, 0.1139599856521402, -0.06745235453404132, -0.11237096443535789, 0.05494415814737006, -0.10843708666398592, -0.24290574387100244, 0.3359404268364112, 0.07954383135536715, -0.14362501761033422, 0.15442488091491488, -0.16522723856189894, -0.2134653329904679, 0.06295068566465661, 0.03428495883764256, 0.10102789245900654, 0.009887411661024782, 0.180623514663672, -0.14909048112375395, -0.05147951582838441, 0.15336923854100326, 0.07344521635714622, 0.1617725740319916, -0.005214870591381831, 0.041057495533355644, 0.15319889688139987, 0.04801133800194495, -0.06046795961077488, -0.3947070257531272, -0.23491146539648375, -0.015107092373664416, 0.13494516682204982, -0.162483694066713, -0.18161385787266587, 0.4072174151383695, 0.10218834733158084, 0.16025910137723837, 0.16417463741723506, 0.16319215597791803, 0.06452240896899075, 0.0825511882791207, 0.004492761286359931, 0.1148688275078755, 0.25434879062785987, -0.09288968698727706, -0.13886821901957905, -0.0625494107264944, 0.27513186166447307] |
1,802.09254 | Generalized Ultrastrong Optomechanics | We propose a reliable scheme to realize a generalized ultrastrong
optomechanical coupling in a two-mode cross-Kerr-type coupled system, where one
of the bosonic modes is strongly driven. The effective optomechanical
interaction takes the form of a product of the photon number operator of one
mode and the quadrature operator of the other mode. The coupling strength and
quadrature phase are both tunable via the driving field. The coupling strength
can be strongly enhanced to reach the ultrastrong-coupling regime, where the
few-photon optomechanical effects such as photon blockade and macroscopically
distinct quantum superposition become accessible. The presence of tunable
quadrature phase also enables the implementation of geometric quantum
operations. Numerical simulations show that this method works well in a wide
parameter space. We also present an analysis of the experimental implementation
of this scheme.
| quant-ph | we propose a reliable scheme to realize a generalized ultrastrong optomechanical coupling in a twomode crosskerrtype coupled system where one of the bosonic modes is strongly driven the effective optomechanical interaction takes the form of a product of the photon number operator of one mode and the quadrature operator of the other mode the coupling strength and quadrature phase are both tunable via the driving field the coupling strength can be strongly enhanced to reach the ultrastrongcoupling regime where the fewphoton optomechanical effects such as photon blockade and macroscopically distinct quantum superposition become accessible the presence of tunable quadrature phase also enables the implementation of geometric quantum operations numerical simulations show that this method works well in a wide parameter space we also present an analysis of the experimental implementation of this scheme | [['we', 'propose', 'a', 'reliable', 'scheme', 'to', 'realize', 'a', 'generalized', 'ultrastrong', 'optomechanical', 'coupling', 'in', 'a', 'twomode', 'crosskerrtype', 'coupled', 'system', 'where', 'one', 'of', 'the', 'bosonic', 'modes', 'is', 'strongly', 'driven', 'the', 'effective', 'optomechanical', 'interaction', 'takes', 'the', 'form', 'of', 'a', 'product', 'of', 'the', 'photon', 'number', 'operator', 'of', 'one', 'mode', 'and', 'the', 'quadrature', 'operator', 'of', 'the', 'other', 'mode', 'the', 'coupling', 'strength', 'and', 'quadrature', 'phase', 'are', 'both', 'tunable', 'via', 'the', 'driving', 'field', 'the', 'coupling', 'strength', 'can', 'be', 'strongly', 'enhanced', 'to', 'reach', 'the', 'ultrastrongcoupling', 'regime', 'where', 'the', 'fewphoton', 'optomechanical', 'effects', 'such', 'as', 'photon', 'blockade', 'and', 'macroscopically', 'distinct', 'quantum', 'superposition', 'become', 'accessible', 'the', 'presence', 'of', 'tunable', 'quadrature', 'phase', 'also', 'enables', 'the', 'implementation', 'of', 'geometric', 'quantum', 'operations', 'numerical', 'simulations', 'show', 'that', 'this', 'method', 'works', 'well', 'in', 'a', 'wide', 'parameter', 'space', 'we', 'also', 'present', 'an', 'analysis', 'of', 'the', 'experimental', 'implementation', 'of', 'this', 'scheme']] | [-0.21130369967343568, 0.22576304420462376, -0.05154658945023336, -0.013121110938355383, -0.05608172036679179, -0.2004913658178835, 0.06781699051410242, 0.3494610758851085, -0.2664199390053523, -0.25251168152317405, 0.036260529705252724, -0.22739361117198836, -0.16250050903975286, 0.24341289732943883, 0.026847475007261066, 0.04670502955206868, 0.046541994428756, -0.000694141089986784, -0.01260189642021997, -0.17294482911220807, 0.30589562113693153, 0.01514967167697085, 0.3151049359461688, 0.05590857686139784, 0.1232974219284105, 0.00442660036390986, 0.06587034629333313, -0.013850766414234937, -0.08222581827370352, 0.07864593688017604, 0.23248991953027365, 0.016880819827995518, 0.2808025345403814, -0.3958222427631192, -0.17747253036324048, 0.10361132866378422, 0.18001283426190529, 0.17124200341376392, -0.0281122468807029, -0.3084029024890201, -0.046791434619632186, -0.21744277596360806, -0.1163251105921738, -0.1252111637449795, -0.05626167281738934, 0.003903129871821765, -0.32629686437907035, 0.05202816069592672, 0.015962418308569766, 0.013829425894514177, 0.008281476806256582, -0.0036393479456433633, 0.01822825966607497, 0.06483439603118424, -0.056526026669113584, 0.01647902378075135, 0.15806438680032664, -0.13449990286520033, -0.1056176729563793, 0.35909953106646286, -0.0940625831453045, -0.19678809091618116, 0.17174714369784025, -0.11372106669075562, -0.05349607914897867, 0.10705130074568318, 0.15263531269914837, 0.11559351875312683, -0.08788258205238504, 0.07324684615410991, 0.01220283031491845, 0.20362991589177964, 0.016097823485986075, 0.16010576114411268, 0.18337563857097516, 0.1642311474195484, 0.05151829951456889, 0.1899446427154489, -0.08951913407531031, -0.13952267390083184, -0.3339433820184433, -0.1411712171375808, -0.20243509874500998, 0.01414888002292366, -0.11205083583307428, -0.17205316870593268, 0.41922769742103067, 0.1692897503257193, 0.1426315672958453, -0.0317269715526367, 0.33870170480539935, 0.1927978705013326, 0.05473359678448601, 0.006849979752477146, 0.34285663387201953, 0.1680352073445013, 0.06746506022825612, -0.307866480372578, -0.025061453786981998, 0.022473927350912356] |
1,802.09255 | A survey for dwarf galaxy remnants around fourteen globular clusters in
the outer halo | We report the results of a systematic photometric survey of the peripheral
regions of a sample of fourteen globular clusters in the outer halo of the
Milky Way at distances d_GC>25 kpc from the Galactic centre. The survey is
aimed at searching for the remnants of the host satellite galaxies where these
clusters could originally have been formed before being accreted onto the
Galactic halo. The limiting surface brightness varies within our sample, but
reaches muV_lim=30-32 mag arcsec^-2. For only two globular clusters (NGC 7492
and Whiting 1; already suggested to be associated with the Sagittarius galaxy)
we detect extended stellar populations that cannot be associated with either
the clusters themselves or with the surrounding Galactic field population. We
show that the lack of substructures around globular clusters at these
Galactocentric distances is still compatible with the predictions of
cosmological simulations whereby in the outer halo the Galactic globular
cluster system is built up through hierarchical accretion at early epochs.
| astro-ph.GA astro-ph.SR | we report the results of a systematic photometric survey of the peripheral regions of a sample of fourteen globular clusters in the outer halo of the milky way at distances d_gc25 kpc from the galactic centre the survey is aimed at searching for the remnants of the host satellite galaxies where these clusters could originally have been formed before being accreted onto the galactic halo the limiting surface brightness varies within our sample but reaches muv_lim3032 mag arcsec2 for only two globular clusters ngc 7492 and whiting 1 already suggested to be associated with the sagittarius galaxy we detect extended stellar populations that cannot be associated with either the clusters themselves or with the surrounding galactic field population we show that the lack of substructures around globular clusters at these galactocentric distances is still compatible with the predictions of cosmological simulations whereby in the outer halo the galactic globular cluster system is built up through hierarchical accretion at early epochs | [['we', 'report', 'the', 'results', 'of', 'a', 'systematic', 'photometric', 'survey', 'of', 'the', 'peripheral', 'regions', 'of', 'a', 'sample', 'of', 'fourteen', 'globular', 'clusters', 'in', 'the', 'outer', 'halo', 'of', 'the', 'milky', 'way', 'at', 'distances', 'd_gc25', 'kpc', 'from', 'the', 'galactic', 'centre', 'the', 'survey', 'is', 'aimed', 'at', 'searching', 'for', 'the', 'remnants', 'of', 'the', 'host', 'satellite', 'galaxies', 'where', 'these', 'clusters', 'could', 'originally', 'have', 'been', 'formed', 'before', 'being', 'accreted', 'onto', 'the', 'galactic', 'halo', 'the', 'limiting', 'surface', 'brightness', 'varies', 'within', 'our', 'sample', 'but', 'reaches', 'muv_lim3032', 'mag', 'arcsec2', 'for', 'only', 'two', 'globular', 'clusters', 'ngc', '7492', 'and', 'whiting', '1', 'already', 'suggested', 'to', 'be', 'associated', 'with', 'the', 'sagittarius', 'galaxy', 'we', 'detect', 'extended', 'stellar', 'populations', 'that', 'can', 'not', 'be', 'associated', 'with', 'either', 'the', 'clusters', 'themselves', 'or', 'with', 'the', 'surrounding', 'galactic', 'field', 'population', 'we', 'show', 'that', 'the', 'lack', 'of', 'substructures', 'around', 'globular', 'clusters', 'at', 'these', 'galactocentric', 'distances', 'is', 'still', 'compatible', 'with', 'the', 'predictions', 'of', 'cosmological', 'simulations', 'whereby', 'in', 'the', 'outer', 'halo', 'the', 'galactic', 'globular', 'cluster', 'system', 'is', 'built', 'up', 'through', 'hierarchical', 'accretion', 'at', 'early', 'epochs']] | [-0.05053511647373561, 0.09099631413301956, -0.10751841677083347, 0.07857210634191339, -0.10483388712412953, 0.01152717156265057, 0.04294057320451961, 0.4287409247982802, -0.18460404142479664, -0.38285339947016733, 0.025367585240728543, -0.31090432442959, 0.009680148473290622, 0.20677245809966055, -0.009780136313371407, -0.0847334803137694, 0.0791708766885465, -0.04729754464120938, -0.023919837206672383, -0.31684228511667756, 0.30013426242735963, 0.07779194628409807, 0.10773162224986034, -0.10868564774955874, 0.06272262948310389, -0.12492864420081037, -0.06444685974153953, -0.0008476773751372437, -0.14276267012990146, 0.03525349956940063, 0.2601061581382118, 0.1311874632851668, 0.22770524046049928, -0.38129318279385166, -0.20005839697594913, 0.08548911417242866, 0.28177868975795006, 0.06854692913091057, -0.11605675497517698, -0.3087347861549249, 0.11601305549155991, -0.18355230916783494, -0.25098923253446065, 0.1303444293989513, 0.03424993851851766, 0.0480090827130531, -0.12812278927274565, 0.18921947364150635, 0.002045334498368719, 0.09040730605019057, -0.10749013763530262, -0.1231267295255027, -0.053893896390877244, 0.0980724516469669, -0.0027174998657578755, 0.09668227524713338, 0.240325086826236, -0.10137741753696786, 0.020427120849490166, 0.398318488572566, 0.006283183037391248, 0.038879059237551014, 0.2565777228043983, -0.23069998616083237, -0.2163927825899947, 0.0666417016855693, 0.1587242652170079, 0.08526219165760954, -0.21626865774767953, 0.053378668083273365, -0.03864418418708978, 0.19551418268827592, 0.08154583034843628, 0.020332658609302872, 0.3783031919584522, 0.11471812431729815, 0.08820395196536146, 0.08125126693960068, -0.265834593756634, -0.06871715180338624, -0.20122498628220656, -0.052413346223187565, -0.11184607490124006, 0.04596523126836576, -0.15823050346157774, -0.11019495510314621, 0.32406274756158954, 0.07545399865568997, 0.23660344160571928, 0.05413953185743365, 0.27537940659577836, 0.012406909639900257, 0.17734718473874173, 0.15216881987849637, 0.3110114111559196, 0.1670985736901749, 0.008273580091062395, -0.23475441929837396, 0.07409851780782144, -0.025960195345405793] |
1,802.09256 | D-meson production in proton-proton collisions with ALICE at the LHC | In this paper, an overview of recent $\mathrm D^{0}$, $\mathrm D^{+}$ and
$\mathrm D^{*+}$ measurements, performed by ALICE in proton--proton collisions
at $\sqrt{s}~=~2.76$, 5, 7, 8 and 13 TeV, is reported. The minimum-bias
production cross sections, as well as their energy and species dependences, are
compared to perturbative QCD calculations. The evolution of the D-meson yields
with the event multiplicity is compared to phenomenological models.
| hep-ex nucl-ex | in this paper an overview of recent mathrm d0 mathrm d and mathrm d measurements performed by alice in protonproton collisions at sqrts276 5 7 8 and 13 tev is reported the minimumbias production cross sections as well as their energy and species dependences are compared to perturbative qcd calculations the evolution of the dmeson yields with the event multiplicity is compared to phenomenological models | [['in', 'this', 'paper', 'an', 'overview', 'of', 'recent', 'mathrm', 'd0', 'mathrm', 'd', 'and', 'mathrm', 'd', 'measurements', 'performed', 'by', 'alice', 'in', 'protonproton', 'collisions', 'at', 'sqrts276', '5', '7', '8', 'and', '13', 'tev', 'is', 'reported', 'the', 'minimumbias', 'production', 'cross', 'sections', 'as', 'well', 'as', 'their', 'energy', 'and', 'species', 'dependences', 'are', 'compared', 'to', 'perturbative', 'qcd', 'calculations', 'the', 'evolution', 'of', 'the', 'dmeson', 'yields', 'with', 'the', 'event', 'multiplicity', 'is', 'compared', 'to', 'phenomenological', 'models']] | [-0.06729558376022256, 0.17651089134182818, -0.09223458054833687, 0.11390680431280858, 0.06064103589608119, -0.09112591413924327, -0.10176754914618169, 0.33866900022213275, -0.1660651654864733, -0.3582560091924209, 0.002552746390350736, -0.43641097539892565, 0.10692996270238207, 0.14515902515715703, 0.06768367691681935, 0.1252693540488298, 0.13509321099577043, 0.03573487408889028, -0.06517658919239273, -0.22645949543668673, 0.2595105714773616, 0.1522982503287494, 0.18545032190158964, 0.17873915453942923, 0.035503868121080674, 0.051200578920543194, -0.09399779553149039, -0.05073355705692218, -0.19209460272238804, 0.0645547785263401, 0.3133581321711692, 0.02723527166705865, 0.07817165771355995, -0.3321268540735428, -0.0749713878505505, 0.10542345900948231, 0.15603122131612437, 0.07321771428911374, -0.023482871557084412, -0.254080881866125, 0.15076913484013998, -0.27709780341157547, -0.10001738510596064, -0.015575710454812416, 0.041183815939495196, -0.010370700491162448, -0.30458332035833824, 0.1536973928889403, -0.0721356461952942, 0.14632700145000574, -0.029943268130031914, -0.25434334355478105, -0.09617020043257911, -0.026074432495694893, 0.08143688410771294, 0.1490780727078135, 0.15685112823087435, -0.09344759303897332, -0.25040020438340993, 0.37110557957337453, -0.000942623271391942, -0.10513093101505477, 0.2079869192953293, -0.21432277443460546, -0.13693504709965335, 0.14389698720322205, 0.23632658530886358, 0.11159440714937563, -0.20563841833231541, 0.07659337586239696, 0.03293232386215375, 0.17371554319890073, 0.07478109444849766, 0.05668461981874246, 0.06335900358569163, 0.24791645049475708, -0.08794059340591327, 0.004274903037227117, -0.1080312844652396, -0.053670267406134654, -0.456514691389524, -0.07015502027307566, -0.07213442185177253, 0.0984226048995669, -0.06715526228990011, 0.04630812435912398, 0.31214101237173264, 0.04928105948582435, 0.37849731668829917, -0.0005520475634302085, 0.26860659546577015, 0.07079191349196033, 0.007461297526382483, 0.08678338761942891, 0.2758382570428344, 0.17951801764922073, 0.2276892333936233, -0.2235215311583418, 0.022024392166461508, 0.06461675866292073] |
1,802.09257 | Controlled creation and stability of k{\pi}-skyrmions on a discrete
lattice | We determine sizes and activation energies of k{\pi}-skyrmions on a discrete
lattice using the Landau- Lifshitz-Gilbert equation and the geodesic nudged
elastic band method. The employed atomic material parameters are based on the
skyrmionic material system Pd/Fe/Ir(111). We find that the critical magnetic
fields for collapse of the 2{\pi}-skyrmion and 3{\pi}-skyrmion are very close
to each other and considerably lower than the critical field of the
1{\pi}-skyrmion. The activation energy protecting the structures does not
strictly decrease with increasing k as it can be larger for the 3{\pi}-skyrmion
than for the 2{\pi}-skyrmion depending on the applied magnetic field.
Furthermore, we propose a method of switching the skyrmion order k by a
reversion of the magnetic field direction in samples of finite size.
| cond-mat.mes-hall | we determine sizes and activation energies of kpiskyrmions on a discrete lattice using the landau lifshitzgilbert equation and the geodesic nudged elastic band method the employed atomic material parameters are based on the skyrmionic material system pdfeir111 we find that the critical magnetic fields for collapse of the 2piskyrmion and 3piskyrmion are very close to each other and considerably lower than the critical field of the 1piskyrmion the activation energy protecting the structures does not strictly decrease with increasing k as it can be larger for the 3piskyrmion than for the 2piskyrmion depending on the applied magnetic field furthermore we propose a method of switching the skyrmion order k by a reversion of the magnetic field direction in samples of finite size | [['we', 'determine', 'sizes', 'and', 'activation', 'energies', 'of', 'kpiskyrmions', 'on', 'a', 'discrete', 'lattice', 'using', 'the', 'landau', 'lifshitzgilbert', 'equation', 'and', 'the', 'geodesic', 'nudged', 'elastic', 'band', 'method', 'the', 'employed', 'atomic', 'material', 'parameters', 'are', 'based', 'on', 'the', 'skyrmionic', 'material', 'system', 'pdfeir111', 'we', 'find', 'that', 'the', 'critical', 'magnetic', 'fields', 'for', 'collapse', 'of', 'the', '2piskyrmion', 'and', '3piskyrmion', 'are', 'very', 'close', 'to', 'each', 'other', 'and', 'considerably', 'lower', 'than', 'the', 'critical', 'field', 'of', 'the', '1piskyrmion', 'the', 'activation', 'energy', 'protecting', 'the', 'structures', 'does', 'not', 'strictly', 'decrease', 'with', 'increasing', 'k', 'as', 'it', 'can', 'be', 'larger', 'for', 'the', '3piskyrmion', 'than', 'for', 'the', '2piskyrmion', 'depending', 'on', 'the', 'applied', 'magnetic', 'field', 'furthermore', 'we', 'propose', 'a', 'method', 'of', 'switching', 'the', 'skyrmion', 'order', 'k', 'by', 'a', 'reversion', 'of', 'the', 'magnetic', 'field', 'direction', 'in', 'samples', 'of', 'finite', 'size']] | [-0.13300375136996395, 0.1845239013401342, -0.05511049919456629, 0.038048117991601085, -0.06520639229686288, -0.09689207286734519, 0.06838226492580926, 0.38685010015514903, -0.26430857185964823, -0.31852568893147437, 0.07766749606977602, -0.242872875986685, -0.09966094708792737, 0.2198276761979475, 0.04619722623289723, 0.025939159841951113, -0.010345763009009433, 0.08879809483387989, -0.09150536458513796, -0.21055420757078663, 0.32616279181293695, 0.03805867290718417, 0.30342319069815604, 0.06141387177872118, 0.07122828650834231, 0.001596336698577065, 0.08036309354416706, 0.07234636043571739, -0.15537902020182157, 0.10903210666207276, 0.16438278679109725, -0.007709481271690336, 0.23545471868269016, -0.44149192342341975, -0.21028401248221254, 0.07980262470865172, 0.1420349934828821, 0.13859687585198996, -0.03496556881923582, -0.2352904952070997, 0.11583158010536612, -0.10196182147824559, -0.10384464104146023, -0.07604294105689845, 0.007959733553559938, 0.062077165581285954, -0.25530171749615593, 0.06752458455619113, 0.04547652849176866, 0.06783113422390105, -0.13835990449799032, -0.15277666465784745, -0.062596159916901, 0.08180183277401173, 0.052938291048309924, 0.06898709126258397, 0.16655802876479794, -0.13269753704060286, -0.07690152179064422, 0.39318031096702505, -0.04936878778495031, -0.16951176021167816, 0.16215198042858714, -0.153024330265531, -0.06205450772339928, 0.18081939678261827, 0.1708620535049202, 0.12564990962534373, -0.08784928984522562, 0.06215709966611406, -0.0008377097637376523, 0.17643759475121723, 0.044794312413332274, 0.002104695972681431, 0.17680268419970727, 0.16650475423526148, 0.09681531008999596, 0.14334455559156625, -0.14124571444398468, -0.058044758585185326, -0.26750033289386793, -0.16460524749107144, -0.21789881093266966, 0.032393690501866614, -0.10986278077200104, -0.18596543598085127, 0.3990084064305471, 0.16689994508111528, 0.19514423108194023, 0.015982685763196183, 0.2528482880925053, 0.15341063478764885, 0.1213648005525164, 0.0815716733200604, 0.2427524258864337, 0.13365632987878254, 0.101271851502102, -0.26360130498932416, 0.05564836179436152, 0.030928026106015874] |
1,802.09258 | Simple groups of birational transformations in dimension two | We classify simple groups that act by birational transformations on compact
complex K\"ahler surfaces. Moreover, we show that every finitely generated
simple group that acts non-trivially by birational transformations on a
projective surface over an arbitrary field is finite.
| math.AG math.GR | we classify simple groups that act by birational transformations on compact complex kahler surfaces moreover we show that every finitely generated simple group that acts nontrivially by birational transformations on a projective surface over an arbitrary field is finite | [['we', 'classify', 'simple', 'groups', 'that', 'act', 'by', 'birational', 'transformations', 'on', 'compact', 'complex', 'kahler', 'surfaces', 'moreover', 'we', 'show', 'that', 'every', 'finitely', 'generated', 'simple', 'group', 'that', 'acts', 'nontrivially', 'by', 'birational', 'transformations', 'on', 'a', 'projective', 'surface', 'over', 'an', 'arbitrary', 'field', 'is', 'finite']] | [-0.18672503605007362, 0.1786725080175809, -0.11287894950081141, 0.02412945898070645, -0.16353437634041676, -0.1760987091021469, -0.0438199208285182, 0.48026412305159444, -0.32417202091369873, -0.12885946918947574, 0.056557060768589, -0.20824291717070034, -0.2380921568793173, 0.31410808144853664, -0.19245611348499855, -0.11868163021520162, 0.010131293471950369, 0.07775453688242497, -0.13472629446560183, -0.4057128395980749, 0.4940078589969721, -0.09479422657153545, 0.2514378869762787, 0.01982185325752466, 0.23304665733415347, 0.0749546572780953, 0.01591096742030902, 0.033307413857143656, -0.07798869551725847, 0.03724069050393808, 0.29529318927476805, 0.0354360201372168, 0.10020517763227989, -0.3979564902860707, -0.22493657718102136, 0.24151290165117154, 0.0728552731183859, 0.05038071824954106, -0.13382115504608896, -0.2940137167103015, 0.10469604371927488, -0.1470467205135486, -0.1331237377360081, -0.1634478179546885, 0.061949133672990285, 0.0013779856216831084, -0.1488123474499354, -0.09900640927923796, 0.1013578301629959, 0.15911601607998213, -0.03517703965115242, 0.04375465507977284, -0.14638054356552088, 0.10024349466682626, -0.07033465748342375, 0.06425317735053025, 0.2220703952644283, 0.012774285729019305, -0.09283742069815978, 0.38184859183354253, -0.12422554230747315, -0.29783672949251455, 0.1710494277664484, -0.11000022755410427, -0.18484929418907717, 0.1684298717106382, 0.14354664861009672, 0.19135237131745386, -0.023028489250021104, 0.24374672178274545, -0.16194194127829412, 0.14309236622200563, 0.09544326768567164, -0.1371024788882679, 0.11917230114340782, 0.038601756740648016, 0.15578088508202478, 0.08968373078805132, 0.08986817798219048, 0.03734246445580935, -0.4121353354973671, -0.19426143589692238, -0.11429569304275972, 0.18642749466025868, -0.1293982899007507, -0.16157240206256318, 0.40498698173234093, -0.012082566626560994, 0.19418009704886338, 0.09313494728830381, 0.19686567508734953, -0.014799501681222748, 0.10582084915576837, 0.07648919206351423, 0.05969551370407526, 0.17098448627317944, -0.20253539996711203, -0.12886212041111997, -0.08741420340270568, 0.17934908870703134] |
1,802.09259 | Period multiplication in a parametrically driven superconducting
resonator | We report on the experimental observation of period multiplication in
parametrically driven tunable superconducting resonators. We modulate the
magnetic flux through a superconducting quantum interference device, attached
to a quarter-wavelength resonator, with frequencies $n\omega$ close to
multiples, $n=2,\,3,\,4,\,5$, of the resonator fundamental mode and observe
intense output radiation at $\omega$. The output field manifests $n$-fold
degeneracy with respect to the phase, the $n$ states are phase shifted by
$2\pi/n$ with respect to each other. Our demonstration verifies the theoretical
prediction by Guo et al. in PRL 111, 205303 (2013), and paves the way for
engineering complex macroscopic quantum cat states with microwave photons.
| quant-ph cond-mat.mes-hall | we report on the experimental observation of period multiplication in parametrically driven tunable superconducting resonators we modulate the magnetic flux through a superconducting quantum interference device attached to a quarterwavelength resonator with frequencies nomega close to multiples n2345 of the resonator fundamental mode and observe intense output radiation at omega the output field manifests nfold degeneracy with respect to the phase the n states are phase shifted by 2pin with respect to each other our demonstration verifies the theoretical prediction by guo et al in prl 111 205303 2013 and paves the way for engineering complex macroscopic quantum cat states with microwave photons | [['we', 'report', 'on', 'the', 'experimental', 'observation', 'of', 'period', 'multiplication', 'in', 'parametrically', 'driven', 'tunable', 'superconducting', 'resonators', 'we', 'modulate', 'the', 'magnetic', 'flux', 'through', 'a', 'superconducting', 'quantum', 'interference', 'device', 'attached', 'to', 'a', 'quarterwavelength', 'resonator', 'with', 'frequencies', 'nomega', 'close', 'to', 'multiples', 'n2345', 'of', 'the', 'resonator', 'fundamental', 'mode', 'and', 'observe', 'intense', 'output', 'radiation', 'at', 'omega', 'the', 'output', 'field', 'manifests', 'nfold', 'degeneracy', 'with', 'respect', 'to', 'the', 'phase', 'the', 'n', 'states', 'are', 'phase', 'shifted', 'by', '2pin', 'with', 'respect', 'to', 'each', 'other', 'our', 'demonstration', 'verifies', 'the', 'theoretical', 'prediction', 'by', 'guo', 'et', 'al', 'in', 'prl', '111', '205303', '2013', 'and', 'paves', 'the', 'way', 'for', 'engineering', 'complex', 'macroscopic', 'quantum', 'cat', 'states', 'with', 'microwave', 'photons']] | [-0.18883186390225604, 0.22927391536316824, -0.009898204489800971, -0.07758325516151318, -0.07039936924877677, -0.17504974460970718, 0.07355793714704155, 0.39658298712332274, -0.21005338354452144, -0.3369728365372776, -0.03281301814041019, -0.3095889479639314, -0.11972580795646509, 0.24588013845337645, -0.04076738771530393, 0.0766551841176974, 0.015926784813150907, -0.03278483027022657, -0.014935209204497051, -0.15542005318741414, 0.2684426703072126, 0.060931580428269155, 0.3341920978832737, -0.01279706310806344, 0.07563386143646339, -0.03459156069506719, 0.05280871528231322, -0.08695330108217533, -0.12408369494086692, 0.06661356563648227, 0.23979665724180857, -0.03273261301061229, 0.21313873900878197, -0.42202945896288724, -0.16060997516784853, 0.04846905292129343, 0.11178314927694144, 0.12857655614379396, -0.026253980789017112, -0.3347370107160899, 0.010583744045274639, -0.10696580473026171, -0.1217544085970058, -0.0453311742794275, 0.011972455417475148, -0.022107996019417223, -0.24696603944543208, 0.049606864453627934, 0.015651488052771508, 0.057593804847412895, -0.005949951005303889, -0.060076037607182865, -0.018712198219343442, 0.021460328965438803, -0.07278720115863004, 0.0925455862855159, 0.15244374477566736, -0.058322002585678934, -0.15946462339929585, 0.3234738440171463, -0.08137116717283153, -0.10973718691192277, 0.13435062153933985, -0.18075844340785904, -0.05621162806049857, 0.11596084696701864, 0.09423148015839528, 0.034636651161262424, -0.029998420751246722, 0.05552876494639526, 0.013450336118129272, 0.2126894375350037, 0.13084078567030216, 0.0963602984206552, 0.24442731672264997, 0.12919590014566495, 0.021531964075814897, 0.19699050945306684, -0.06826163270088022, -0.05492081116597864, -0.2738176276004541, -0.1312539703376564, -0.20600886870762197, 0.08752365764320909, -0.018552530656096262, -0.141151976690275, 0.4205299264489158, 0.12673047508194463, 0.20925432772746363, -0.03600575932238287, 0.28099565451187125, 0.1386202915438261, 0.043177447719889406, 0.051083108780959854, 0.29324329022354295, 0.22449456962295672, 0.10626633014548027, -0.30518193469717375, -0.019964427350414465, -0.022115414143874516] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.