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.0026 | When quantum games can be played classically: in support of van
Enk-Pike's assertion | N. Vyas and C. Benjamin (arXiv:1701.08573[quant-ph]) propose a new mixed
strategy for the (quantum) Hawk-Dove and Prisoners' Dilemma games and argue
that this strategy yields payoffs, which cannot be obtained in the
corresponding classical games. They conclude that this refutes the earlier
assertion by S.J. van Enk and R. Pike that the quantum equilibrium solution is
present in a corresponding extended classical game. This paper argues that the
scheme suggested by N. Vyas and C. Benjamin changes the rules of the original
game, and hence it does not refute the argument put forward by van Enk and
Pike.
| quant-ph | n vyas and c benjamin arxiv170108573quantph propose a new mixed strategy for the quantum hawkdove and prisoners dilemma games and argue that this strategy yields payoffs which cannot be obtained in the corresponding classical games they conclude that this refutes the earlier assertion by sj van enk and r pike that the quantum equilibrium solution is present in a corresponding extended classical game this paper argues that the scheme suggested by n vyas and c benjamin changes the rules of the original game and hence it does not refute the argument put forward by van enk and pike | [['n', 'vyas', 'and', 'c', 'benjamin', 'arxiv170108573quantph', 'propose', 'a', 'new', 'mixed', 'strategy', 'for', 'the', 'quantum', 'hawkdove', 'and', 'prisoners', 'dilemma', 'games', 'and', 'argue', 'that', 'this', 'strategy', 'yields', 'payoffs', 'which', 'can', 'not', 'be', 'obtained', 'in', 'the', 'corresponding', 'classical', 'games', 'they', 'conclude', 'that', 'this', 'refutes', 'the', 'earlier', 'assertion', 'by', 'sj', 'van', 'enk', 'and', 'r', 'pike', 'that', 'the', 'quantum', 'equilibrium', 'solution', 'is', 'present', 'in', 'a', 'corresponding', 'extended', 'classical', 'game', 'this', 'paper', 'argues', 'that', 'the', 'scheme', 'suggested', 'by', 'n', 'vyas', 'and', 'c', 'benjamin', 'changes', 'the', 'rules', 'of', 'the', 'original', 'game', 'and', 'hence', 'it', 'does', 'not', 'refute', 'the', 'argument', 'put', 'forward', 'by', 'van', 'enk', 'and', 'pike']] | [-0.11012063746587658, 0.07755907681742114, -0.18139533682640793, 0.09863592087224658, -0.03573052473936458, -0.2568887235045585, 0.11517585314719994, 0.2973141345214479, -0.23697927441657046, -0.27882281901809025, 0.07044036397520377, -0.22019031909959658, -0.20525903949913168, 0.08079686829326105, -0.14027062539315346, -0.001560700221025214, 0.06541174751877481, -0.04969023044544215, 0.05702968895297535, -0.2998581410252622, 0.31336093246366603, 0.03046277357201206, 0.2126501155351954, 0.04583424334984501, 0.05863042675642943, 0.056824129830323616, -0.03132423143168645, 0.07955088534829569, -0.16137261949247939, 0.08337116606567085, 0.25229936472748465, 0.1702988336946131, 0.34549559890387616, -0.380641533061862, -0.15875087180935152, 0.08972350590653261, 0.1277406848301845, 0.11225419862514209, -0.003858556647842028, -0.3126802982344311, 0.09104094775488639, -0.1983058293093452, -0.1181229179334822, -0.040650668791590294, 0.06689836906402238, -0.0028479843761543837, -0.25777640667558666, 0.012706954613071392, 0.15267306138590284, 0.016242356828356883, -0.003090596669923742, -0.14315935549307235, 0.0015123401844531906, 0.028131318653990725, -0.03865510616118887, 0.03923233166070921, 0.05228325971687327, -0.07978114533969867, -0.20396611806984077, 0.35296452044490345, -0.057697847818157504, -0.14440461598355703, 0.141043173700419, -0.09357048374866801, -0.1186133397324961, 0.0482080441291387, 0.0066487943867639615, 0.15046694846253614, -0.09431891250709186, 0.13959071013603683, -0.11735149945740644, 0.15303183242450563, 0.09802666937514228, -0.0342186277599207, 0.12455230099814278, 0.037356647151422555, 0.07273540833527792, 0.08629507746675755, 0.031507419303477724, -0.15282716708523886, -0.2831408663187176, -0.17028513192840644, -0.15366885090740967, 0.07510587074633507, -0.045257113445271044, -0.12003710047065397, 0.27783373462840916, 0.1353087708038012, 0.12766573407089726, 0.08181415315674694, 0.2148566722147623, 0.09612981514168942, -0.011979295312051604, 0.09182246181904813, 0.23963275502378845, 0.08842489925897395, 0.18138971961844635, -0.2533349763003311, 0.08801052596287004, 0.11706399146410428] |
1,802.00261 | MHD simulations of resistive viscous accretion disk around millisecond
pulsar | We perform MHD simulations of a thin resistive and viscous accretion disk
around a neutron star with the surface dipolar magnetic field of 10$^8$ Gauss.
The system evolution is followed during the interval of 500 millisecond pulsar
rotations. Matter is accreted through a stable accretion column from the disk
onto the star. We also show propagation of the stellar wind through the corona.
Analysis of the mass accretion flux and torques on the star shows that the disk
reaches the quasi-stationary state.
| astro-ph.HE | we perform mhd simulations of a thin resistive and viscous accretion disk around a neutron star with the surface dipolar magnetic field of 108 gauss the system evolution is followed during the interval of 500 millisecond pulsar rotations matter is accreted through a stable accretion column from the disk onto the star we also show propagation of the stellar wind through the corona analysis of the mass accretion flux and torques on the star shows that the disk reaches the quasistationary state | [['we', 'perform', 'mhd', 'simulations', 'of', 'a', 'thin', 'resistive', 'and', 'viscous', 'accretion', 'disk', 'around', 'a', 'neutron', 'star', 'with', 'the', 'surface', 'dipolar', 'magnetic', 'field', 'of', '108', 'gauss', 'the', 'system', 'evolution', 'is', 'followed', 'during', 'the', 'interval', 'of', '500', 'millisecond', 'pulsar', 'rotations', 'matter', 'is', 'accreted', 'through', 'a', 'stable', 'accretion', 'column', 'from', 'the', 'disk', 'onto', 'the', 'star', 'we', 'also', 'show', 'propagation', 'of', 'the', 'stellar', 'wind', 'through', 'the', 'corona', 'analysis', 'of', 'the', 'mass', 'accretion', 'flux', 'and', 'torques', 'on', 'the', 'star', 'shows', 'that', 'the', 'disk', 'reaches', 'the', 'quasistationary', 'state']] | [-0.1372558518267441, 0.17973201092696045, -0.05135517592382867, 0.05413926853911906, -0.09084617182975863, 0.03155675114745774, 0.022454180811509128, 0.38688191087780205, -0.22515536088314725, -0.32120104488439677, 0.08497423935886018, -0.2424184434661051, 0.023292346425899644, 0.253870285564761, 0.02019628115770657, 0.018623724670671835, 0.0956227810281079, -0.040408695312557606, -0.09283606115467392, -0.19893812302981997, 0.32055259396026775, 0.06338577094010828, 0.09263319835611959, -0.03565760659871668, 0.10636387796073062, -0.13109313000686376, 0.004509222256474015, -0.05945694796377566, -0.19178636100403354, -0.023779017913223403, 0.12898327465873302, 0.0954789986390984, 0.19891818594641802, -0.4831030971665935, -0.24257358649132274, -0.04711803073835809, 0.16102590989860957, 0.024160381202108977, -0.0837550285434146, -0.20726214869447598, 0.051400718199679764, -0.2759709497232263, -0.12297660438343883, 0.0584689739569113, 0.037176214006627205, 0.01692629689577876, -0.2607215063443419, 0.13815580117026424, 0.12716375040628652, 0.04905566131332662, -0.1491307109458054, 0.0077947225924240564, -0.13669383057915582, 0.01330693931142777, 0.10575661232990281, 0.10916453721456049, 0.29966280314071875, -0.14560949100499473, -0.00032648667068470544, 0.3701853484778506, -0.1055666541754518, -0.051680791895927454, 0.20094190479437934, -0.2895199817547819, -0.0879382123864006, 0.21539858350439406, 0.16687258753198675, 0.14613367537059252, -0.09063990898543924, -0.006233791912985375, -0.06182886008457167, 0.2031230765292648, 0.05719229445804092, -0.0641461127386542, 0.44065524327636857, 0.19965571939743623, 0.0315806522707046, 0.15579384015645922, -0.26380454739516673, -0.08238695782223125, -0.20921976198215128, -0.11754016931986482, -0.14846594039089522, 0.1392887574805106, -0.14093260231914806, -0.14558632649117853, 0.36124028075236553, 0.07254459623747118, 0.18239032941665956, 3.049852576379369e-05, 0.3327780332325435, 0.10525795132512362, 0.02062084438370132, 0.22117751493777443, 0.3277276917474299, 0.2607245017070232, 0.14250633025434714, -0.335971663737238, 0.06536573928599132, 0.04158775563772041] |
1,802.00262 | Photonic Generation of High Power, Ultrastable Microwave Signals by
Vernier Effect in a Femtosecond Laser Frequency Comb | Optical frequency division of an ultrastable laser to the microwave frequency
range by an optical frequency comb has allowed the generation of microwave
signals with unprecedently high spectral purity and stability. However, the
generated microwave signal will suffer from a very low power level if no
external optical frequency comb repetition rate multiplication device is used.
This paper reports theoretical and experimental studies on the beneficial use
of the Vernier effect together with the spectral selective filtering in a
double directional coupler add-drop optical fibre ring resonator to increase
the comb repetition rate and generate high power microwaves. The studies are
focused on two selective filtering aspects: the high rejection of undesirable
optical modes of the frequency comb and the transmission of the desirable modes
with the lowest possible loss. Moreover, the conservation of the frequency comb
stability and linewidth at the resonator output is particularly considered.
Accordingly, a fibre ring resonator is designed, fabricated, and characterized,
and a technique to stabilize the resonator's resonance comb is proposed. A
significant power gain is achieved for the photonically generated beat note at
10 GHz. Routes to highly improve the performances of such proof-of-concept
device are also discussed.
| physics.ins-det physics.optics | optical frequency division of an ultrastable laser to the microwave frequency range by an optical frequency comb has allowed the generation of microwave signals with unprecedently high spectral purity and stability however the generated microwave signal will suffer from a very low power level if no external optical frequency comb repetition rate multiplication device is used this paper reports theoretical and experimental studies on the beneficial use of the vernier effect together with the spectral selective filtering in a double directional coupler adddrop optical fibre ring resonator to increase the comb repetition rate and generate high power microwaves the studies are focused on two selective filtering aspects the high rejection of undesirable optical modes of the frequency comb and the transmission of the desirable modes with the lowest possible loss moreover the conservation of the frequency comb stability and linewidth at the resonator output is particularly considered accordingly a fibre ring resonator is designed fabricated and characterized and a technique to stabilize the resonators resonance comb is proposed a significant power gain is achieved for the photonically generated beat note at 10 ghz routes to highly improve the performances of such proofofconcept device are also discussed | [['optical', 'frequency', 'division', 'of', 'an', 'ultrastable', 'laser', 'to', 'the', 'microwave', 'frequency', 'range', 'by', 'an', 'optical', 'frequency', 'comb', 'has', 'allowed', 'the', 'generation', 'of', 'microwave', 'signals', 'with', 'unprecedently', 'high', 'spectral', 'purity', 'and', 'stability', 'however', 'the', 'generated', 'microwave', 'signal', 'will', 'suffer', 'from', 'a', 'very', 'low', 'power', 'level', 'if', 'no', 'external', 'optical', 'frequency', 'comb', 'repetition', 'rate', 'multiplication', 'device', 'is', 'used', 'this', 'paper', 'reports', 'theoretical', 'and', 'experimental', 'studies', 'on', 'the', 'beneficial', 'use', 'of', 'the', 'vernier', 'effect', 'together', 'with', 'the', 'spectral', 'selective', 'filtering', 'in', 'a', 'double', 'directional', 'coupler', 'adddrop', 'optical', 'fibre', 'ring', 'resonator', 'to', 'increase', 'the', 'comb', 'repetition', 'rate', 'and', 'generate', 'high', 'power', 'microwaves', 'the', 'studies', 'are', 'focused', 'on', 'two', 'selective', 'filtering', 'aspects', 'the', 'high', 'rejection', 'of', 'undesirable', 'optical', 'modes', 'of', 'the', 'frequency', 'comb', 'and', 'the', 'transmission', 'of', 'the', 'desirable', 'modes', 'with', 'the', 'lowest', 'possible', 'loss', 'moreover', 'the', 'conservation', 'of', 'the', 'frequency', 'comb', 'stability', 'and', 'linewidth', 'at', 'the', 'resonator', 'output', 'is', 'particularly', 'considered', 'accordingly', 'a', 'fibre', 'ring', 'resonator', 'is', 'designed', 'fabricated', 'and', 'characterized', 'and', 'a', 'technique', 'to', 'stabilize', 'the', 'resonators', 'resonance', 'comb', 'is', 'proposed', 'a', 'significant', 'power', 'gain', 'is', 'achieved', 'for', 'the', 'photonically', 'generated', 'beat', 'note', 'at', '10', 'ghz', 'routes', 'to', 'highly', 'improve', 'the', 'performances', 'of', 'such', 'proofofconcept', 'device', 'are', 'also', 'discussed']] | [-0.17499400592261774, 0.1414224738648639, -0.011355609269527604, -0.06469372825516502, -0.0751731193824006, -0.192026441439283, 0.07092457841095819, 0.48269857952789386, -0.23552871976054882, -0.25416347042334325, 0.1142804083008704, -0.24042543643788253, -0.08036847266473104, 0.2868629808309583, -0.058828050113278345, 0.08114470452265053, 0.042503797692099436, -0.02136877127352874, 0.047731058866591, -0.14341526853077455, 0.222478245575057, 0.17336725900828726, 0.40475973767722595, 0.01730568779927051, 0.1448984495934327, -0.036233668776860996, -0.032249409661447744, -0.08199241632127621, -0.09833781847704146, 0.10635967933506306, 0.2737290099671833, 0.04396014209903244, 0.2669451933815049, -0.3713701942422408, -0.2057098596801088, 0.09626356239801234, 0.13107004508670725, 0.11469266849703022, -0.07795239032937537, -0.22709658062940805, 0.0831436017962952, -0.17779178660343953, -0.095275973734845, -0.043700295327022215, -0.03066391844007814, 0.06223513151201828, -0.2793327380394639, 0.01428050058403846, 0.062186976429075, 0.09333539625145115, -0.004684157835851822, -0.035965496343940646, -0.03000450356624669, 0.06564980218120452, -0.06937781191901399, -0.02617720346728563, 0.17857426052351189, -0.08485979178643605, -0.14626484113384267, 0.3485294937997182, -0.12229459184430996, -0.1146478639411911, 0.16397755903343916, -0.18545686956067398, -0.0037750771378490086, 0.16622856999058466, 0.15105735340953938, 0.04852980609189681, -0.09324331013652097, -0.0038020456340746023, 0.07538355787389209, 0.28133060146427274, 0.1927160061111826, 0.16624502000358546, 0.2129249274398067, 0.17335032767198066, 0.05441781013968819, 0.15803777222160478, -0.1244149133169546, 0.033947373975878485, -0.21188614006975087, -0.07220326120993692, -0.21173319879596178, 0.03394323884039091, -0.0804616987975629, -0.11251931372146141, 0.46308309076667514, 0.12231466208575104, 0.14050454710971336, -0.02667879494862175, 0.3696028122545353, 0.16893736836120335, 0.08690506391398305, -0.036418028237602235, 0.3137365723556212, 0.16332309600797348, 0.1387783320958023, -0.29057271287263353, -0.0550700676133286, -0.05590345204109326] |
1,802.00263 | Robust Sequential Detection in Distributed Sensor Networks | We consider the problem of sequential binary hypothesis testing with a
distributed sensor network in a non-Gaussian noise environment. To this end, we
present a general formulation of the Consensus + Innovations Sequential
Probability Ratio Test (CISPRT). Furthermore, we introduce two different
concepts for robustifying the CISPRT and propose four different algorithms,
namely, the Least-Favorable-Density-CISPRT, the Median-CISPRT, the M-CISPRT,
and the Myriad-CISPRT. Subsequently, we analyze their suitability for different
binary hypothesis tests before verifying and evaluating their performance in a
shift-in-mean and a shift-in-variance scenario.
| cs.IT math.IT | we consider the problem of sequential binary hypothesis testing with a distributed sensor network in a nongaussian noise environment to this end we present a general formulation of the consensus innovations sequential probability ratio test cisprt furthermore we introduce two different concepts for robustifying the cisprt and propose four different algorithms namely the leastfavorabledensitycisprt the mediancisprt the mcisprt and the myriadcisprt subsequently we analyze their suitability for different binary hypothesis tests before verifying and evaluating their performance in a shiftinmean and a shiftinvariance scenario | [['we', 'consider', 'the', 'problem', 'of', 'sequential', 'binary', 'hypothesis', 'testing', 'with', 'a', 'distributed', 'sensor', 'network', 'in', 'a', 'nongaussian', 'noise', 'environment', 'to', 'this', 'end', 'we', 'present', 'a', 'general', 'formulation', 'of', 'the', 'consensus', 'innovations', 'sequential', 'probability', 'ratio', 'test', 'cisprt', 'furthermore', 'we', 'introduce', 'two', 'different', 'concepts', 'for', 'robustifying', 'the', 'cisprt', 'and', 'propose', 'four', 'different', 'algorithms', 'namely', 'the', 'leastfavorabledensitycisprt', 'the', 'mediancisprt', 'the', 'mcisprt', 'and', 'the', 'myriadcisprt', 'subsequently', 'we', 'analyze', 'their', 'suitability', 'for', 'different', 'binary', 'hypothesis', 'tests', 'before', 'verifying', 'and', 'evaluating', 'their', 'performance', 'in', 'a', 'shiftinmean', 'and', 'a', 'shiftinvariance', 'scenario']] | [-0.1458121452045131, 0.05026108776400616, -0.0890067055603707, 0.09235017317613321, -0.006596790185173998, -0.16147737591466926, 0.08875656332639227, 0.3927817049545127, -0.2546700170965164, -0.29668159251911685, 0.12227282958262443, -0.1821207186062034, -0.17473470478306535, 0.13020992552401958, -0.0670582443693435, 0.11335894879098836, 0.07292481386949393, 0.01516394080086188, -0.09778760858605821, -0.2696518760972789, 0.35835010617783947, 0.055728417458375555, 0.31491240879593346, -0.014937970091818601, 0.11330325150856288, 0.031679566568610346, -0.0650008978902713, 0.023511910271322864, -0.09783286838671314, 0.11963959614437848, 0.21305047188486373, 0.23585121245304871, 0.3390134432195843, -0.4193418542189257, -0.16315461533119927, 0.13041160180680939, 0.06807107910175215, 0.10754398709879705, -0.061501193876293575, -0.27514277522258657, 0.11540719418931607, -0.18986165891220044, -0.0632653766728986, -0.02831996598752675, -0.028959923645696155, 0.01145726086741144, -0.3108747224867731, 0.03967003505556034, 0.06528005857843083, 0.026271236461720297, -0.05658728553151542, -0.10224135557957623, 0.1213208320369194, 0.1239164154069474, 0.029522516708760584, -0.05884357317435471, 0.11349944823554584, -0.11564461162084012, -0.167663351427038, 0.3560363016508568, -0.05500642416844532, -0.21809190572065593, 0.2333274774084037, -0.06163445711982521, -0.20563757588917558, 0.008267028112109606, 0.24013265389223376, 0.14103263216214135, -0.19619847052766906, 0.023386339369750063, -0.0053267096080091576, 0.1344062690441678, 0.034033936508870745, 0.006106747928916102, 0.21356925963690238, 0.2004767121118191, 0.014201266678993577, 0.2129409396899985, -0.15600040738241044, -0.0979035622742656, -0.25453950663085106, -0.19037811990295136, -0.13537127251113923, -0.022270470446386893, -0.1183949231960835, -0.1567375653290323, 0.42418110859277963, 0.20851913579231637, 0.20403117044260363, 0.122451841244595, 0.32887362446877866, 0.08475701839892895, -0.03447340310901984, 0.06468116104347305, 0.21061345872275725, 0.07619317112998529, 0.0795127780769359, -0.17811287445463725, 0.09142495715966473, 0.00925762958631113] |
1,802.00264 | Automatic Safety Helmet Wearing Detection | Surveillance is essential for the safety of power substation. The detection
of whether wearing safety helmets or not for perambulatory workers is the key
component of overall intelligent surveillance system in power substation. In
this paper, a novel and practical safety helmet detection framework based on
computer vision, machine learning and image processing is proposed. In order to
ascertain motion objects in power substation, the ViBe background modelling
algorithm is employed. Moreover, based on the result of motion objects
segmentation, real-time human classification framework C4 is applied to locate
pedestrian in power substation accurately and quickly. Finally, according to
the result of pedestrian detection, the safety helmet wearing detection is
implemented using the head location, the color space transformation and the
color feature discrimination. Extensive compelling experimental results in
power substation illustrate the efficiency and effectiveness of the proposed
framework.
| cs.HC | surveillance is essential for the safety of power substation the detection of whether wearing safety helmets or not for perambulatory workers is the key component of overall intelligent surveillance system in power substation in this paper a novel and practical safety helmet detection framework based on computer vision machine learning and image processing is proposed in order to ascertain motion objects in power substation the vibe background modelling algorithm is employed moreover based on the result of motion objects segmentation realtime human classification framework c4 is applied to locate pedestrian in power substation accurately and quickly finally according to the result of pedestrian detection the safety helmet wearing detection is implemented using the head location the color space transformation and the color feature discrimination extensive compelling experimental results in power substation illustrate the efficiency and effectiveness of the proposed framework | [['surveillance', 'is', 'essential', 'for', 'the', 'safety', 'of', 'power', 'substation', 'the', 'detection', 'of', 'whether', 'wearing', 'safety', 'helmets', 'or', 'not', 'for', 'perambulatory', 'workers', 'is', 'the', 'key', 'component', 'of', 'overall', 'intelligent', 'surveillance', 'system', 'in', 'power', 'substation', 'in', 'this', 'paper', 'a', 'novel', 'and', 'practical', 'safety', 'helmet', 'detection', 'framework', 'based', 'on', 'computer', 'vision', 'machine', 'learning', 'and', 'image', 'processing', 'is', 'proposed', 'in', 'order', 'to', 'ascertain', 'motion', 'objects', 'in', 'power', 'substation', 'the', 'vibe', 'background', 'modelling', 'algorithm', 'is', 'employed', 'moreover', 'based', 'on', 'the', 'result', 'of', 'motion', 'objects', 'segmentation', 'realtime', 'human', 'classification', 'framework', 'c4', 'is', 'applied', 'to', 'locate', 'pedestrian', 'in', 'power', 'substation', 'accurately', 'and', 'quickly', 'finally', 'according', 'to', 'the', 'result', 'of', 'pedestrian', 'detection', 'the', 'safety', 'helmet', 'wearing', 'detection', 'is', 'implemented', 'using', 'the', 'head', 'location', 'the', 'color', 'space', 'transformation', 'and', 'the', 'color', 'feature', 'discrimination', 'extensive', 'compelling', 'experimental', 'results', 'in', 'power', 'substation', 'illustrate', 'the', 'efficiency', 'and', 'effectiveness', 'of', 'the', 'proposed', 'framework']] | [-0.07468618338917503, -0.011074498579229998, -0.07911294232041616, -0.003153263729789456, -0.09257605987216305, -0.1696295602672288, 0.018928138222849077, 0.38690560008736624, -0.20754045450493044, -0.3547485712915659, 0.1221349054518952, -0.2668336122431725, -0.16567954464150808, 0.1992628444171767, -0.2013183255035403, 0.12734215763276038, 0.07520708121170384, 0.10323284427631997, 0.05465317844557475, -0.2143641436621007, 0.2371530185041922, 0.06235899946287922, 0.3972759465282054, 0.08337844243657816, 0.0903906698230708, 0.0122190105907646, -0.04233051865172667, 0.008912581843448435, -0.02298338176932294, 0.13294136576502974, 0.3278180192666722, 0.23113324464825186, 0.2841714983029912, -0.401512639651048, -0.2205413639472892, 0.08973531894034882, 0.12898630932972266, 0.030482219835824293, -0.08534066117051449, -0.3545507669610822, 0.13074664315428125, -0.20427659761997452, -0.08700069937976482, -0.08420732543985966, -0.0018596444785109034, 0.007845191784419012, -0.2613965281482745, 0.027281169477672833, 0.05218238585993, 0.10354468578715688, -0.07901818431117505, -0.02606040181885676, 0.028664268300180203, 0.20637377957388273, 0.013115814239110636, 0.020266772581912253, 0.23694039339982514, -0.22810252340665707, -0.1522969695928412, 0.4255722272142336, 0.006193674286317917, -0.16682889895594638, 0.1920851272956023, -0.04793705524576396, -0.15263085489404266, 0.11986433801686634, 0.25151899274087686, 0.11446468289764396, -0.17181496004037478, -0.016394711405366146, 0.02903417582232235, 0.1864486421134485, 0.03495022253997192, -0.050960158203741994, 0.22140751301945336, 0.25701468240847625, 0.07810545029444282, 0.13497525899151366, -0.18626954580279256, -0.06420783375970264, -0.2547696682192601, -0.14070702698149218, -0.1780100759655318, -0.06334155384589078, -0.07343216500853685, -0.09629773481519542, 0.41820119514022075, 0.2553109052941959, 0.13175759715638866, 0.04677190737414133, 0.43785201822933945, 0.08238459206388696, 0.04711878531868907, 0.08724177262637818, 0.1924412703998657, -0.0002064289072987394, 0.14011854624402695, -0.24844696299186436, 0.0997713846626921, 0.06634869173918244] |
1,802.00265 | VR-Goggles for Robots: Real-to-sim Domain Adaptation for Visual Control | In this paper, we deal with the reality gap from a novel perspective,
targeting transferring Deep Reinforcement Learning (DRL) policies learned in
simulated environments to the real-world domain for visual control tasks.
Instead of adopting the common solutions to the problem by increasing the
visual fidelity of synthetic images output from simulators during the training
phase, we seek to tackle the problem by translating the real-world image
streams back to the synthetic domain during the deployment phase, to make the
robot feel at home. We propose this as a lightweight, flexible, and efficient
solution for visual control, as 1) no extra transfer steps are required during
the expensive training of DRL agents in simulation; 2) the trained DRL agents
will not be constrained to being deployable in only one specific real-world
environment; 3) the policy training and the transfer operations are decoupled,
and can be conducted in parallel. Besides this, we propose a simple yet
effective shift loss that is agnostic to the downstream task, to constrain the
consistency between subsequent frames which is important for consistent policy
outputs. We validate the shift loss for artistic style transfer for videos and
domain adaptation, and validate our visual control approach in indoor and
outdoor robotics experiments.
| cs.RO cs.CV cs.LG | in this paper we deal with the reality gap from a novel perspective targeting transferring deep reinforcement learning drl policies learned in simulated environments to the realworld domain for visual control tasks instead of adopting the common solutions to the problem by increasing the visual fidelity of synthetic images output from simulators during the training phase we seek to tackle the problem by translating the realworld image streams back to the synthetic domain during the deployment phase to make the robot feel at home we propose this as a lightweight flexible and efficient solution for visual control as 1 no extra transfer steps are required during the expensive training of drl agents in simulation 2 the trained drl agents will not be constrained to being deployable in only one specific realworld environment 3 the policy training and the transfer operations are decoupled and can be conducted in parallel besides this we propose a simple yet effective shift loss that is agnostic to the downstream task to constrain the consistency between subsequent frames which is important for consistent policy outputs we validate the shift loss for artistic style transfer for videos and domain adaptation and validate our visual control approach in indoor and outdoor robotics experiments | [['in', 'this', 'paper', 'we', 'deal', 'with', 'the', 'reality', 'gap', 'from', 'a', 'novel', 'perspective', 'targeting', 'transferring', 'deep', 'reinforcement', 'learning', 'drl', 'policies', 'learned', 'in', 'simulated', 'environments', 'to', 'the', 'realworld', 'domain', 'for', 'visual', 'control', 'tasks', 'instead', 'of', 'adopting', 'the', 'common', 'solutions', 'to', 'the', 'problem', 'by', 'increasing', 'the', 'visual', 'fidelity', 'of', 'synthetic', 'images', 'output', 'from', 'simulators', 'during', 'the', 'training', 'phase', 'we', 'seek', 'to', 'tackle', 'the', 'problem', 'by', 'translating', 'the', 'realworld', 'image', 'streams', 'back', 'to', 'the', 'synthetic', 'domain', 'during', 'the', 'deployment', 'phase', 'to', 'make', 'the', 'robot', 'feel', 'at', 'home', 'we', 'propose', 'this', 'as', 'a', 'lightweight', 'flexible', 'and', 'efficient', 'solution', 'for', 'visual', 'control', 'as', '1', 'no', 'extra', 'transfer', 'steps', 'are', 'required', 'during', 'the', 'expensive', 'training', 'of', 'drl', 'agents', 'in', 'simulation', '2', 'the', 'trained', 'drl', 'agents', 'will', 'not', 'be', 'constrained', 'to', 'being', 'deployable', 'in', 'only', 'one', 'specific', 'realworld', 'environment', '3', 'the', 'policy', 'training', 'and', 'the', 'transfer', 'operations', 'are', 'decoupled', 'and', 'can', 'be', 'conducted', 'in', 'parallel', 'besides', 'this', 'we', 'propose', 'a', 'simple', 'yet', 'effective', 'shift', 'loss', 'that', 'is', 'agnostic', 'to', 'the', 'downstream', 'task', 'to', 'constrain', 'the', 'consistency', 'between', 'subsequent', 'frames', 'which', 'is', 'important', 'for', 'consistent', 'policy', 'outputs', 'we', 'validate', 'the', 'shift', 'loss', 'for', 'artistic', 'style', 'transfer', 'for', 'videos', 'and', 'domain', 'adaptation', 'and', 'validate', 'our', 'visual', 'control', 'approach', 'in', 'indoor', 'and', 'outdoor', 'robotics', 'experiments']] | [-0.06325725550399866, 0.045364513319190135, -0.05493563138084804, 0.06032770852353878, -0.14169309920540488, -0.17933740460700015, 0.06602264645384488, 0.5014699751465785, -0.2895412462445476, -0.3542076189570674, 0.09680469121000299, -0.21945589483238576, -0.16906144323406697, 0.1754598471267921, -0.17486023267095047, 0.08255102137819205, 0.1311790199555661, 0.0043310972180490084, -0.04649895061440652, -0.2566689330857338, 0.30398056771515347, 0.02964989558393249, 0.30683371448753083, 0.008327808195338925, 0.1417037112979082, -0.027824143446391312, 0.0019205756823350562, -0.04720307732818694, -0.03687520306802315, 0.159684357306602, 0.3526454552690067, 0.21503797041297687, 0.3400027996542432, -0.44479480097297486, -0.22392946494198063, 0.08886907587009596, 0.15273780953593372, 0.10174942613954133, -0.07577970898539828, -0.34124511901698096, 0.09120966645863429, -0.16177471874327196, -2.6115739899801045e-05, -0.11738116615565448, -0.007138478042126247, -0.030400375946901922, -0.32075408265539784, -0.008779862589094923, 0.026461065029043978, 0.07324151892623887, -0.0831536676984553, -0.05942858686988674, 0.0261080546543093, 0.21981937436659524, 0.023406487937289767, 0.05489156227331699, 0.1755058011812408, -0.18615252938655363, -0.12558063574918976, 0.37778816057777986, -0.01713287860280039, -0.19987079068200617, 0.21631679363639617, -0.019862472863368143, -0.10045545822827191, 0.08896828023489656, 0.2629496086536475, 0.12916999359547002, -0.17525757543810802, 0.00422854039693115, -0.00013462930190853955, 0.1879967882667055, 0.036926973301054135, -0.05260795399080962, 0.1805861192624789, 0.23753123814921553, 0.0792339719036912, 0.1712959923043211, -0.0744864690905471, -0.11542549969049216, -0.2362744197670708, -0.11613680403225306, -0.19941742117403122, -0.030375197687592333, -0.08809578111806952, -0.08224054011289121, 0.3671166773703767, 0.2576905651030091, 0.2075155328220983, 0.1031415719260666, 0.4019225969547179, 0.029942927504435363, 0.09683717871255174, 0.08923446938548828, 0.20607897973982844, -0.03359121795993571, 0.2104529691297879, -0.203204941776831, 0.08280424768582167, -0.0127101835317728] |
1,802.00266 | Quark mass functions and pion structure in the Covariant Spectator
Theory | The Covariant Spectator Theory is applied to the description of quarks and
the pion. The dressed quark mass function is calculated dynamically in
Minkowski space and used in the calculation of the pion electromagnetic form
factor. The effects of the mass function on the pion form factor and the
different quark-pole contributions to the triangle diagram are analyzed.
| hep-ph nucl-th | the covariant spectator theory is applied to the description of quarks and the pion the dressed quark mass function is calculated dynamically in minkowski space and used in the calculation of the pion electromagnetic form factor the effects of the mass function on the pion form factor and the different quarkpole contributions to the triangle diagram are analyzed | [['the', 'covariant', 'spectator', 'theory', 'is', 'applied', 'to', 'the', 'description', 'of', 'quarks', 'and', 'the', 'pion', 'the', 'dressed', 'quark', 'mass', 'function', 'is', 'calculated', 'dynamically', 'in', 'minkowski', 'space', 'and', 'used', 'in', 'the', 'calculation', 'of', 'the', 'pion', 'electromagnetic', 'form', 'factor', 'the', 'effects', 'of', 'the', 'mass', 'function', 'on', 'the', 'pion', 'form', 'factor', 'and', 'the', 'different', 'quarkpole', 'contributions', 'to', 'the', 'triangle', 'diagram', 'are', 'analyzed']] | [-0.08108470709831045, 0.24143787947270953, -0.11519777019949336, 0.16300387544508435, -0.035618439872275316, 0.005004809560711708, 0.056750472477767946, 0.31511521381897883, -0.1777021972576908, -0.235781063636144, -0.07625800124042782, -0.29722249983368737, -0.050356357897582804, 0.10158031999149866, 0.0771732594360385, 0.07340070284216811, -0.0038789160173843826, 0.0715414924759483, -0.11679087708328377, -0.1986594334440796, 0.40917644428350686, 0.006055620711362153, 0.25174927365100175, 0.15840088223156176, 0.06814787350594997, 0.04036908612276117, -0.07077384521171712, -0.041738005543409507, -0.12496316991746426, 0.05092841993788617, 0.15448033840195358, 0.05657897470110472, 0.12507223033166506, -0.36219662251441104, -0.12618320751853548, 0.05962747480850993, 0.12098520762172707, 0.08916347455886896, 0.004612386820984906, -0.2795826566585323, 0.03886254474912819, -0.19567208294348234, -0.18113001841202117, -0.10221214311426147, -0.0105611864526413, -0.04662177187243575, -0.3067834373612545, 0.07798207337200119, -0.07940296649834827, -0.03979502115071865, -0.08782800145676001, -0.20841941015239349, -0.022335445344970936, 0.11908030131088342, 0.11648146158672477, 0.1573436046917841, 0.21374111250042915, -0.19207999017089605, -0.05894076312777766, 0.4634860680814375, -0.07937044364383869, -0.244073663233665, 0.06744413226516101, -0.20463771216179194, -0.07508453871368577, 0.12431335642018862, 0.17616404113032968, 0.08485734402334824, -0.21539770663928307, 0.09970893007968634, -0.031961388624551, 0.15340729817143528, 0.12123841224565056, 0.04477705110452677, 0.18175012168981003, 0.12741786535633237, -0.07941277078434564, 0.11251154986389897, -0.028142037045766125, -0.1495041017208183, -0.3613291886684142, -0.09836753188191276, -0.1349731219703691, 0.03249811869637485, -0.14037630622981834, -0.17696608555617563, 0.40690886273391935, 0.03939000463211223, 0.1828324882999847, -0.03321267303825855, 0.31869948027949585, 0.1723634505219627, 0.12827308977578292, 0.08655246159290536, 0.28657020907849073, 0.22093809834730468, 0.11024389335714084, -0.2913604588329531, -0.04417548991133165, 0.13746542101235767] |
1,802.00267 | Relaxation in Quantum Systems | A new discrete model for energy relaxation of a quantum particle is described
via a projection operator, causing the wave function collapse. Power laws for
the evolution of the particle coordinate and momentum dispersions are derived.
A new dissipative Schrodinger equation is proposed and solved for particular
cases. A new dissipative Liouville equation is heuristically constructed.
| quant-ph cond-mat.stat-mech | a new discrete model for energy relaxation of a quantum particle is described via a projection operator causing the wave function collapse power laws for the evolution of the particle coordinate and momentum dispersions are derived a new dissipative schrodinger equation is proposed and solved for particular cases a new dissipative liouville equation is heuristically constructed | [['a', 'new', 'discrete', 'model', 'for', 'energy', 'relaxation', 'of', 'a', 'quantum', 'particle', 'is', 'described', 'via', 'a', 'projection', 'operator', 'causing', 'the', 'wave', 'function', 'collapse', 'power', 'laws', 'for', 'the', 'evolution', 'of', 'the', 'particle', 'coordinate', 'and', 'momentum', 'dispersions', 'are', 'derived', 'a', 'new', 'dissipative', 'schrodinger', 'equation', 'is', 'proposed', 'and', 'solved', 'for', 'particular', 'cases', 'a', 'new', 'dissipative', 'liouville', 'equation', 'is', 'heuristically', 'constructed']] | [-0.12631675491242536, 0.14772043954248407, -0.13287081036417345, 0.10755681909878538, -0.09781874671378839, -0.16797714379416512, -0.058591065084328875, 0.24918317176135524, -0.3071941781340034, -0.22889988693142577, 0.047910562150978615, -0.2532148719100015, -0.10731224775580424, 0.21397786510975234, 0.03355030457688762, 0.12571560531588538, 0.058092367390470044, -0.009247745495356088, -0.10255883294822914, -0.1377526069679464, 0.3360616323770955, 0.028268729376057827, 0.22864663156880333, 0.012791440273368997, 0.20402468881885788, -0.0012899599844656353, 0.009645052852907352, 0.02395560305762956, -0.14982961344399623, 0.040273137881220986, 0.16823834756256215, 0.062061947105186324, 0.2672648336738348, -0.41152017254249323, -0.27364128418932004, 0.06684588256757706, 0.1617565268970793, 0.14153677674143442, -0.10531982283906213, -0.2835761568525673, -0.0006171306179437254, -0.1768550750732954, -0.2151510679063254, -0.06426214137380677, 0.049720362826649635, 0.06064936868746632, -0.3021979254138257, 0.17738446756681828, 0.059848673458743305, -0.023297547150702615, -0.12632035376736894, -0.039868318575567434, -0.029638622646286552, 0.02185197261860594, -0.03361432042895883, 0.022371626700208123, 0.1278217229659536, -0.10824680177029222, -0.10302129820255297, 0.4204853312112391, -0.05684810838595565, -0.31034873033474597, 0.12282850153652751, -0.07382693866799984, -0.0856797071485614, 0.11826971690503083, 0.16950659901236317, 0.129313937005853, -0.21302740242182544, 0.11936138029614085, -0.03337397960188225, 0.10303509102335998, 0.05938516069103831, -3.949075471609831e-05, 0.1640213206410408, 0.1395962926118435, 0.07352078748226631, 0.11064997860895735, -0.04177804265678527, -0.20173987919198616, -0.34392968204338104, -0.19256057788983785, -0.25654315574294223, 0.08582508720402464, -0.08087632004285947, -0.1434625483650182, 0.42988113267347217, 0.034061071121998666, 0.13799869448744825, 0.06532132815170501, 0.24972413280712707, 0.3002611710357347, 0.03923541720723733, 0.09869680582778528, 0.21522027292355364, 0.17731240733077616, 0.1388653252423475, -0.2819308385047147, -0.02735514935505177, 0.1493208529677109] |
1,802.00268 | Retrieving the Size of Deep-subwavelength Objects via Tunable Optical
Spin-Orbit Coupling | We propose a scheme to retrieve the size parameters of a nano-particle on a
glass substrate at a scale much smaller than the wavelength. This is achieved
by illuminating the particle using two plane waves to create rich and
non-trivial local polarization distributions, and observing the far-field
scattering pattern into the substrate. A simple dipole model which exploits
tunneling effect of evanescent field into regions beyond the critical angle, as
well as directional scattering due to spin-orbit coupling is developed, to
relate the particle's shape, size and position to the far-field scattering with
remarkable sensitivity. Our method brings about a far-field super-resolution
imaging scheme based on the interaction of vectorial light with nanoparticles.
| physics.optics | we propose a scheme to retrieve the size parameters of a nanoparticle on a glass substrate at a scale much smaller than the wavelength this is achieved by illuminating the particle using two plane waves to create rich and nontrivial local polarization distributions and observing the farfield scattering pattern into the substrate a simple dipole model which exploits tunneling effect of evanescent field into regions beyond the critical angle as well as directional scattering due to spinorbit coupling is developed to relate the particles shape size and position to the farfield scattering with remarkable sensitivity our method brings about a farfield superresolution imaging scheme based on the interaction of vectorial light with nanoparticles | [['we', 'propose', 'a', 'scheme', 'to', 'retrieve', 'the', 'size', 'parameters', 'of', 'a', 'nanoparticle', 'on', 'a', 'glass', 'substrate', 'at', 'a', 'scale', 'much', 'smaller', 'than', 'the', 'wavelength', 'this', 'is', 'achieved', 'by', 'illuminating', 'the', 'particle', 'using', 'two', 'plane', 'waves', 'to', 'create', 'rich', 'and', 'nontrivial', 'local', 'polarization', 'distributions', 'and', 'observing', 'the', 'farfield', 'scattering', 'pattern', 'into', 'the', 'substrate', 'a', 'simple', 'dipole', 'model', 'which', 'exploits', 'tunneling', 'effect', 'of', 'evanescent', 'field', 'into', 'regions', 'beyond', 'the', 'critical', 'angle', 'as', 'well', 'as', 'directional', 'scattering', 'due', 'to', 'spinorbit', 'coupling', 'is', 'developed', 'to', 'relate', 'the', 'particles', 'shape', 'size', 'and', 'position', 'to', 'the', 'farfield', 'scattering', 'with', 'remarkable', 'sensitivity', 'our', 'method', 'brings', 'about', 'a', 'farfield', 'superresolution', 'imaging', 'scheme', 'based', 'on', 'the', 'interaction', 'of', 'vectorial', 'light', 'with', 'nanoparticles']] | [-0.09117549463727437, 0.14435626895257594, -0.10360533914289775, 0.028223237044392235, -0.10055015556745034, -0.13494163373509932, 0.027737296664411517, 0.4145276131586427, -0.2734445216200125, -0.30639806455742996, 0.013708918169964996, -0.2670953701110145, -0.13250903927605698, 0.18710199626784904, 0.022114248954550882, 0.03904909849480058, -0.008165953985819248, -0.03062384696759745, -0.032877234704957334, -0.1194917272273616, 0.2876577649174868, 0.07303671868913601, 0.3156081043241496, 0.09678095699477512, 0.1270124236352544, 0.08050583973032448, 0.022901664708485512, 0.015565860237662507, -0.10727043586280362, 0.12672070767812893, 0.17502981692859573, 0.016335006654921887, 0.18119471219360037, -0.4382688371151422, -0.22102639028715976, 0.036650169978693, 0.170892292938599, 0.16028332320738387, -0.06973911562431769, -0.31501980125491996, 0.01036670737265222, -0.06261419065799399, -0.15169774033376468, -0.040133268658928904, -0.00047624164644167224, 0.0009966163022394202, -0.28993883570120466, 0.030911299243437506, 0.039178328191968655, 0.052699299446776905, -0.01474107182543494, -0.08350936691426111, -0.0008438261930492863, 0.07118050268216602, 0.04298032064297838, 0.04402235569226333, 0.1794336703317487, -0.14288186184254237, -0.05876599215547991, 0.3943062942573982, -0.06952025528970912, -0.18882414726828908, 0.17375624579773077, -0.20142398294951536, 0.02387682362500809, 0.21576189764865997, 0.2036962313247861, 0.11475101303292719, -0.12250669050417774, 0.029999566782138155, -0.018319879262914174, 0.2523527217707473, 0.11884443859973576, 0.07180209895101401, 0.2510569200035086, 0.22828051181658443, 0.057518755922308276, 0.16786550845027762, -0.17869336001855213, -0.057582204246613304, -0.22745255153395433, -0.10799525811674848, -0.2157021588244088, 0.01546323481139488, -0.12109146404362889, -0.15698037536369752, 0.39649245668576355, 0.15930927771687572, 0.20841623280213867, 0.023976961436137492, 0.34218929424280287, 0.0872314714865792, 0.1257033623771462, -0.007752178620085516, 0.30465407339048334, 0.1590116651938915, 0.10227202361169378, -0.25562027376145124, 0.028450390142677105, 0.018284722721715153] |
1,802.00269 | Langevin equations for the run-and-tumble of swimming bacteria | The run and tumble motions of a swimming bacterium are well characterized by
two stochastic variables: the speed $v(t)$ and the change of direction or
deflection \mbox{$x(t)=\cos\varphi(t)$}, where $\varphi(t)$ is the turning
angle at time $t$. Recently, we have introduced [Soft Matter {\bf 13}, 3385
(2017)] a single stochastic model for the deflection $x(t)$ of an {\sl E. coli}
bacterium performing both types of movement in isotropic media without taxis,
based on available experimental data. In this work we introduce Langevin
equations for the variables $(v,x)$, which for particular values of a control
parameter $\beta$ correspond to run and tumble motions, respectively. These
Langevin equations have analytical solutions, which make it possible to
calculate the statistical properties of both movements in detail. Assuming that
the stochastic processes $x$ and $v$ are not independent during the tumble, we
show that there are small displacements of the center of mass along the normal
direction to the axis of the bacterial body, a consequence of the flagellar
unbundling during the run-to-tumble transition. Regarding the tumble we show,
by means of the directional correlation, that the process is not stationary for
tumble-times of the order of experimentally measured characteristic
tumble-time. The mean square displacement is studied in detail for both
movements even in the non-stationary regime. We determine the diffusion and
ballistic coefficients for tumble- and run-times, establishing their properties
and relationships.
| cond-mat.soft physics.bio-ph | the run and tumble motions of a swimming bacterium are well characterized by two stochastic variables the speed vt and the change of direction or deflection mboxxtcosvarphit where varphit is the turning angle at time t recently we have introduced soft matter bf 13 3385 2017 a single stochastic model for the deflection xt of an sl e coli bacterium performing both types of movement in isotropic media without taxis based on available experimental data in this work we introduce langevin equations for the variables vx which for particular values of a control parameter beta correspond to run and tumble motions respectively these langevin equations have analytical solutions which make it possible to calculate the statistical properties of both movements in detail assuming that the stochastic processes x and v are not independent during the tumble we show that there are small displacements of the center of mass along the normal direction to the axis of the bacterial body a consequence of the flagellar unbundling during the runtotumble transition regarding the tumble we show by means of the directional correlation that the process is not stationary for tumbletimes of the order of experimentally measured characteristic tumbletime the mean square displacement is studied in detail for both movements even in the nonstationary regime we determine the diffusion and ballistic coefficients for tumble and runtimes establishing their properties and relationships | [['the', 'run', 'and', 'tumble', 'motions', 'of', 'a', 'swimming', 'bacterium', 'are', 'well', 'characterized', 'by', 'two', 'stochastic', 'variables', 'the', 'speed', 'vt', 'and', 'the', 'change', 'of', 'direction', 'or', 'deflection', 'mboxxtcosvarphit', 'where', 'varphit', 'is', 'the', 'turning', 'angle', 'at', 'time', 't', 'recently', 'we', 'have', 'introduced', 'soft', 'matter', 'bf', '13', '3385', '2017', 'a', 'single', 'stochastic', 'model', 'for', 'the', 'deflection', 'xt', 'of', 'an', 'sl', 'e', 'coli', 'bacterium', 'performing', 'both', 'types', 'of', 'movement', 'in', 'isotropic', 'media', 'without', 'taxis', 'based', 'on', 'available', 'experimental', 'data', 'in', 'this', 'work', 'we', 'introduce', 'langevin', 'equations', 'for', 'the', 'variables', 'vx', 'which', 'for', 'particular', 'values', 'of', 'a', 'control', 'parameter', 'beta', 'correspond', 'to', 'run', 'and', 'tumble', 'motions', 'respectively', 'these', 'langevin', 'equations', 'have', 'analytical', 'solutions', 'which', 'make', 'it', 'possible', 'to', 'calculate', 'the', 'statistical', 'properties', 'of', 'both', 'movements', 'in', 'detail', 'assuming', 'that', 'the', 'stochastic', 'processes', 'x', 'and', 'v', 'are', 'not', 'independent', 'during', 'the', 'tumble', 'we', 'show', 'that', 'there', 'are', 'small', 'displacements', 'of', 'the', 'center', 'of', 'mass', 'along', 'the', 'normal', 'direction', 'to', 'the', 'axis', 'of', 'the', 'bacterial', 'body', 'a', 'consequence', 'of', 'the', 'flagellar', 'unbundling', 'during', 'the', 'runtotumble', 'transition', 'regarding', 'the', 'tumble', 'we', 'show', 'by', 'means', 'of', 'the', 'directional', 'correlation', 'that', 'the', 'process', 'is', 'not', 'stationary', 'for', 'tumbletimes', 'of', 'the', 'order', 'of', 'experimentally', 'measured', 'characteristic', 'tumbletime', 'the', 'mean', 'square', 'displacement', 'is', 'studied', 'in', 'detail', 'for', 'both', 'movements', 'even', 'in', 'the', 'nonstationary', 'regime', 'we', 'determine', 'the', 'diffusion', 'and', 'ballistic', 'coefficients', 'for', 'tumble', 'and', 'runtimes', 'establishing', 'their', 'properties', 'and', 'relationships']] | [-0.14274472454690112, 0.1667685771541463, -0.06235244220364881, 0.01315881773323164, -0.04517182890452075, -0.11966459848606194, 0.021300568408540648, 0.3939140954005, -0.3003499082052648, -0.2712648549225248, 0.08294472181244471, -0.25883781710997156, -0.13962350911710278, 0.19171557861825153, -0.0172862187111085, 0.048486902080769924, 0.03588820710449779, 0.03685677462323968, -0.003911700043837689, -0.20398520869535527, 0.22585670350651657, 0.02158724569874591, 0.2352198060585319, -0.019539701190556764, 0.15759750983280746, 0.018831763772011203, -0.01986668658927166, 0.028496861374670907, -0.17170802678184113, 0.04950806601846125, 0.17174549880188092, 0.060036558530263004, 0.2307369171051375, -0.44175923141717377, -0.19192163025166206, 0.11475544253533242, 0.13641691662698058, 0.0875786592192266, -0.02803697159626089, -0.2708786871517077, 0.05644571396156347, -0.12131801020690805, -0.1526197647835943, -0.06260673272065885, 0.10502898618246295, 0.08664151894273735, -0.27055617775165175, 0.13363104376393103, 0.05697374829209626, 0.06687574066641641, -0.06411851283961109, -0.09149133405298926, -0.04580193374944689, 0.13081965158094785, 0.0991549606368218, 0.011429959999596966, 0.15857820073493453, -0.13291002953961392, -0.11589193445745748, 0.37575889308521127, -0.05349539388459691, -0.2353979138195947, 0.17521939935249975, -0.18309152586984315, -0.10508531852558788, 0.1302221288403546, 0.190364618626128, 0.11255359496967035, -0.16011419456065465, 0.06811481933592793, -0.014578443599410613, 0.12704132600629237, 0.0882502283472734, -0.042760852100660225, 0.1617224108548336, 0.1404788307871578, 0.04567894414815653, 0.08242514874759113, -0.13691899449518782, -0.12047827113903102, -0.2966997809749695, -0.15897060165402113, -0.15086497353539535, 0.03187902125305949, -0.10181630562153389, -0.13288605233953735, 0.3760067729724272, 0.1323478178980752, 0.2167483323012545, 0.07646355612087063, 0.23685867408494232, 0.09935390444297809, -0.0019514137545359387, 0.09192374136494307, 0.25993021687151796, 0.08969274825566183, 0.13591683027308527, -0.2422909170501433, 0.10788995964685455, 0.028582475329000902] |
1,802.0027 | Tunable Majorana corner states in a two-dimensional second-order
topological superconductor induced by magnetic fields | A two-dimensional second-order topological superconductor exhibits a finite
gap in both bulk and edges, with the nontrivial topology manifesting itself
through Majorana zero modes localized at the corners, i.e., Majorana corner
states. We investigate a time-reversal-invariant topological superconductor in
two dimension and demonstrate that an in-plane magnetic field could transform
it into a second-order topological superconductor. A detailed analysis reveals
that the magnetic field gives rise to mass terms which take distinct values
among the edges, and Majorana corner states naturally emerge at the
intersection of two adjacent edges with opposite masses. With the rotation of
the magnetic field, Majorana corner states localized around the boundary may
hop from one corner to a neighboring one and eventually make a full circle
around the system when the field rotates by $2\pi$. In the end we briefly
discuss physical realizations of this system.
| cond-mat.mes-hall | a twodimensional secondorder topological superconductor exhibits a finite gap in both bulk and edges with the nontrivial topology manifesting itself through majorana zero modes localized at the corners ie majorana corner states we investigate a timereversalinvariant topological superconductor in two dimension and demonstrate that an inplane magnetic field could transform it into a secondorder topological superconductor a detailed analysis reveals that the magnetic field gives rise to mass terms which take distinct values among the edges and majorana corner states naturally emerge at the intersection of two adjacent edges with opposite masses with the rotation of the magnetic field majorana corner states localized around the boundary may hop from one corner to a neighboring one and eventually make a full circle around the system when the field rotates by 2pi in the end we briefly discuss physical realizations of this system | [['a', 'twodimensional', 'secondorder', 'topological', 'superconductor', 'exhibits', 'a', 'finite', 'gap', 'in', 'both', 'bulk', 'and', 'edges', 'with', 'the', 'nontrivial', 'topology', 'manifesting', 'itself', 'through', 'majorana', 'zero', 'modes', 'localized', 'at', 'the', 'corners', 'ie', 'majorana', 'corner', 'states', 'we', 'investigate', 'a', 'timereversalinvariant', 'topological', 'superconductor', 'in', 'two', 'dimension', 'and', 'demonstrate', 'that', 'an', 'inplane', 'magnetic', 'field', 'could', 'transform', 'it', 'into', 'a', 'secondorder', 'topological', 'superconductor', 'a', 'detailed', 'analysis', 'reveals', 'that', 'the', 'magnetic', 'field', 'gives', 'rise', 'to', 'mass', 'terms', 'which', 'take', 'distinct', 'values', 'among', 'the', 'edges', 'and', 'majorana', 'corner', 'states', 'naturally', 'emerge', 'at', 'the', 'intersection', 'of', 'two', 'adjacent', 'edges', 'with', 'opposite', 'masses', 'with', 'the', 'rotation', 'of', 'the', 'magnetic', 'field', 'majorana', 'corner', 'states', 'localized', 'around', 'the', 'boundary', 'may', 'hop', 'from', 'one', 'corner', 'to', 'a', 'neighboring', 'one', 'and', 'eventually', 'make', 'a', 'full', 'circle', 'around', 'the', 'system', 'when', 'the', 'field', 'rotates', 'by', '2pi', 'in', 'the', 'end', 'we', 'briefly', 'discuss', 'physical', 'realizations', 'of', 'this', 'system']] | [-0.24876057662083007, 0.23092641187214594, -0.05650569937119247, 0.037013343749204584, -0.07381038891864901, -0.1805368776380329, 0.06377031065602885, 0.3189086320080154, -0.2574734126633786, -0.2649576234134205, 0.03687842702905892, -0.326994041943632, -0.12273624970524816, 0.11903175610573367, 0.012182186431158995, -0.01858775362490878, 0.01501107398513044, 0.07319553245638385, -0.12182951420842808, -0.1769374330818706, 0.34098955406311976, -0.07431771443720828, 0.29464089593037646, 0.06216405471126344, 0.029289231202994467, -0.018391811728134012, 0.10252289277342881, 0.03225765862099245, -0.1324927552430007, 0.037698841782977, 0.2074752415543594, -0.06463358691952964, 0.20029597932882343, -0.483199387597224, -0.16249161876790913, 0.022136284203552608, 0.1706781845526598, 0.12385441441045981, -0.051171958840333244, -0.32947056614364506, 0.0731836558313023, -0.107150708100633, -0.1547202362995991, -0.04039697651255955, -0.018445008018232407, -0.09386631413461997, -0.21999144263347573, 0.03532655297362424, 0.04876567928305437, 0.05890800335596428, -0.02484384896679524, -0.0874205835226342, -0.12061431377148586, 0.09704451781143567, 0.06319729977201485, 0.0332628106946086, 0.09682756138252134, -0.12527701552092024, -0.11385120954265461, 0.3250065639446628, -0.0325248569286435, -0.14947694726948832, 0.19563368431140557, -0.19984165012360888, -0.0577776891456798, 0.1620392660834952, 0.11890250240974393, 0.06329396156132211, -0.08311139337244981, 0.07795618040361672, -0.05386129453206923, 0.11821802898065735, 0.05381559323294894, 0.0916592816406108, 0.35118671884456426, 0.13954559898297864, 0.1364835815038532, 0.1613797310630668, -0.13088242562755228, -0.07649682927546454, -0.3114140471410508, -0.2083039005759258, -0.22967140157277702, 0.0440035004322318, -0.07716573948364255, -0.22003314204527236, 0.4901485946623886, 0.1190721170014061, 0.25688348543097045, -0.03584994083016133, 0.2580758986981414, 0.11007657605190332, 0.09624113836688987, 0.10192389936097204, 0.21969378182783406, 0.1491728774849854, 0.07184164613775962, -0.2621851031146679, -0.046934190891511365, 0.07608898880343276] |
1,802.00271 | The condition of a function relative to a polytope | The condition number of a smooth convex function, namely the ratio of its
smoothness to strong convexity constants, is closely tied to fundamental
properties of the function. In particular, the condition number of a quadratic
convex function is precisely the square of the diameter-to-width ratio of a
canonical ellipsoid associated to the function. Furthermore, the condition
number of a function bounds the linear rate of convergence of the gradient
descent algorithm for unconstrained minimization.
We propose a condition number of a smooth convex function relative to a
reference polytope. This relative condition number is defined as the ratio of a
relative smooth constant to a relative strong convexity constant of the
function, where both constants are relative to the reference polytope. The
relative condition number extends the main properties of the traditional
condition number. In particular, we show that the condition number of a
quadratic convex function relative to a polytope is precisely the square of the
diameter-to-facial-distance ratio of a scaled polytope for a canonical scaling
induced by the function. Furthermore, we illustrate how the relative condition
number of a function bounds the linear rate of convergence of first-order
methods for minimization of the function over the polytope.
| math.OC | the condition number of a smooth convex function namely the ratio of its smoothness to strong convexity constants is closely tied to fundamental properties of the function in particular the condition number of a quadratic convex function is precisely the square of the diametertowidth ratio of a canonical ellipsoid associated to the function furthermore the condition number of a function bounds the linear rate of convergence of the gradient descent algorithm for unconstrained minimization we propose a condition number of a smooth convex function relative to a reference polytope this relative condition number is defined as the ratio of a relative smooth constant to a relative strong convexity constant of the function where both constants are relative to the reference polytope the relative condition number extends the main properties of the traditional condition number in particular we show that the condition number of a quadratic convex function relative to a polytope is precisely the square of the diametertofacialdistance ratio of a scaled polytope for a canonical scaling induced by the function furthermore we illustrate how the relative condition number of a function bounds the linear rate of convergence of firstorder methods for minimization of the function over the polytope | [['the', 'condition', 'number', 'of', 'a', 'smooth', 'convex', 'function', 'namely', 'the', 'ratio', 'of', 'its', 'smoothness', 'to', 'strong', 'convexity', 'constants', 'is', 'closely', 'tied', 'to', 'fundamental', 'properties', 'of', 'the', 'function', 'in', 'particular', 'the', 'condition', 'number', 'of', 'a', 'quadratic', 'convex', 'function', 'is', 'precisely', 'the', 'square', 'of', 'the', 'diametertowidth', 'ratio', 'of', 'a', 'canonical', 'ellipsoid', 'associated', 'to', 'the', 'function', 'furthermore', 'the', 'condition', 'number', 'of', 'a', 'function', 'bounds', 'the', 'linear', 'rate', 'of', 'convergence', 'of', 'the', 'gradient', 'descent', 'algorithm', 'for', 'unconstrained', 'minimization', 'we', 'propose', 'a', 'condition', 'number', 'of', 'a', 'smooth', 'convex', 'function', 'relative', 'to', 'a', 'reference', 'polytope', 'this', 'relative', 'condition', 'number', 'is', 'defined', 'as', 'the', 'ratio', 'of', 'a', 'relative', 'smooth', 'constant', 'to', 'a', 'relative', 'strong', 'convexity', 'constant', 'of', 'the', 'function', 'where', 'both', 'constants', 'are', 'relative', 'to', 'the', 'reference', 'polytope', 'the', 'relative', 'condition', 'number', 'extends', 'the', 'main', 'properties', 'of', 'the', 'traditional', 'condition', 'number', 'in', 'particular', 'we', 'show', 'that', 'the', 'condition', 'number', 'of', 'a', 'quadratic', 'convex', 'function', 'relative', 'to', 'a', 'polytope', 'is', 'precisely', 'the', 'square', 'of', 'the', 'diametertofacialdistance', 'ratio', 'of', 'a', 'scaled', 'polytope', 'for', 'a', 'canonical', 'scaling', 'induced', 'by', 'the', 'function', 'furthermore', 'we', 'illustrate', 'how', 'the', 'relative', 'condition', 'number', 'of', 'a', 'function', 'bounds', 'the', 'linear', 'rate', 'of', 'convergence', 'of', 'firstorder', 'methods', 'for', 'minimization', 'of', 'the', 'function', 'over', 'the', 'polytope']] | [-0.16402008974697763, 0.053743318323670006, -0.08874621282047698, 0.05972632341651804, -0.0644968429150126, -0.08087034061371448, 0.048845118353720095, 0.3041334534583963, -0.36004615376519067, -0.28321476542594165, 0.08035598372506346, -0.22105626986943525, -0.15580627747674278, 0.17071052996186437, -0.10676781700801123, 0.10187063326906687, 0.016629233275573266, 0.07614193659341956, -0.14985148108866878, -0.2718699422409654, 0.3237437182271541, 0.026106783874370727, 0.2615593493440978, 0.09596628321542731, 0.1351105162027637, 0.014472669061405707, 0.0435110635412526, 0.06773735318087079, -0.17252851399223865, 0.12407026548638259, 0.15655502053344064, 0.17413411902849973, 0.32854236280403765, -0.34427648309977527, -0.10087311846206466, 0.19254706973247798, 0.06864590415976904, 0.02807836476855245, 0.003268868232212091, -0.15969671615337963, 0.11157374509340176, -0.10224850359254606, -0.16952336530631343, -0.0010279285660023012, 0.006112203531458899, 0.11194291877262483, -0.3479924997797018, 0.08496876523787449, 0.06724063800748314, 0.06507574478022489, -0.0736376730527795, -0.1145485435171658, -0.025131614557301937, 0.04669373150829812, 0.0733191382641039, 0.10204049076431143, 0.11685333607321237, -0.1426635721951326, -0.04939119372195399, 0.3608369253537982, -0.09683914304838567, -0.28743187180214425, 0.12897364207340148, -0.1479710285211464, -0.07497067326859472, 0.13562482519803312, 0.16979163975648695, 0.18535979606475927, -0.0941330815055573, 0.10752982495182435, -0.09667601796141281, 0.12967716490254183, 0.051300768402457085, 0.03991781463752014, 0.11403417776854056, 0.09357366443323302, 0.17630825390055926, 0.2100594103109413, -0.05241037359689291, -0.09276847500675524, -0.3633718895654993, -0.16338874699859904, -0.23569427746664828, 0.023723165780012757, -0.1747885397848139, -0.19640497308162982, 0.383369981557093, 0.027593280826955276, 0.25278555493102156, 0.1395701292836046, 0.29432362871159456, 0.1568605899332129, 0.04071476648982406, 0.01816466241970961, 0.21653895059288455, 0.19328108438418298, -0.0031226890068264857, -0.25588917895692975, 0.09134704570243428, 0.13885559878893536] |
1,802.00272 | Real-Time Human-Robot Interaction for a Service Robot Based on 3D Human
Activity Recognition and Human-mimicking Decision Mechanism | This paper describes the development of a real-time Human-Robot Interaction
(HRI) system for a service robot based on 3D human activity recognition and
human-like decision mechanism. The Human-Robot Interactive (HRI) system, which
allows one person to interact with a service robot using natural body language,
collects sequences of 3D skeleton joints comprising rich human movement
information about the user via Microsoft Kinect. This information is used to
train a three-layer Long-Short-Term Memory (LSTM) network for human action
recognition. The robot understands user intent based on an online LSTM network
test, and responds to the user via movements of the robotic arm or chassis.
Furthermore, the human-like decision mechanism is also fused into this process,
which allows the robot to instinctively decide whether to interrupt the current
task according to task priority. The framework of the overall system is
established on the Robot Operating System (ROS) platform. The real-life
activity interaction between our service robot and the user was conducted to
demonstrate the effectiveness of developed HRI system.
| cs.HC cs.RO | this paper describes the development of a realtime humanrobot interaction hri system for a service robot based on 3d human activity recognition and humanlike decision mechanism the humanrobot interactive hri system which allows one person to interact with a service robot using natural body language collects sequences of 3d skeleton joints comprising rich human movement information about the user via microsoft kinect this information is used to train a threelayer longshortterm memory lstm network for human action recognition the robot understands user intent based on an online lstm network test and responds to the user via movements of the robotic arm or chassis furthermore the humanlike decision mechanism is also fused into this process which allows the robot to instinctively decide whether to interrupt the current task according to task priority the framework of the overall system is established on the robot operating system ros platform the reallife activity interaction between our service robot and the user was conducted to demonstrate the effectiveness of developed hri system | [['this', 'paper', 'describes', 'the', 'development', 'of', 'a', 'realtime', 'humanrobot', 'interaction', 'hri', 'system', 'for', 'a', 'service', 'robot', 'based', 'on', '3d', 'human', 'activity', 'recognition', 'and', 'humanlike', 'decision', 'mechanism', 'the', 'humanrobot', 'interactive', 'hri', 'system', 'which', 'allows', 'one', 'person', 'to', 'interact', 'with', 'a', 'service', 'robot', 'using', 'natural', 'body', 'language', 'collects', 'sequences', 'of', '3d', 'skeleton', 'joints', 'comprising', 'rich', 'human', 'movement', 'information', 'about', 'the', 'user', 'via', 'microsoft', 'kinect', 'this', 'information', 'is', 'used', 'to', 'train', 'a', 'threelayer', 'longshortterm', 'memory', 'lstm', 'network', 'for', 'human', 'action', 'recognition', 'the', 'robot', 'understands', 'user', 'intent', 'based', 'on', 'an', 'online', 'lstm', 'network', 'test', 'and', 'responds', 'to', 'the', 'user', 'via', 'movements', 'of', 'the', 'robotic', 'arm', 'or', 'chassis', 'furthermore', 'the', 'humanlike', 'decision', 'mechanism', 'is', 'also', 'fused', 'into', 'this', 'process', 'which', 'allows', 'the', 'robot', 'to', 'instinctively', 'decide', 'whether', 'to', 'interrupt', 'the', 'current', 'task', 'according', 'to', 'task', 'priority', 'the', 'framework', 'of', 'the', 'overall', 'system', 'is', 'established', 'on', 'the', 'robot', 'operating', 'system', 'ros', 'platform', 'the', 'reallife', 'activity', 'interaction', 'between', 'our', 'service', 'robot', 'and', 'the', 'user', 'was', 'conducted', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'developed', 'hri', 'system']] | [-0.11581062034823691, -0.006647911136687599, -0.06571211058557212, 0.004277796664784198, -0.20492005734676552, -0.23555337192356854, 0.05279118759337322, 0.4608245708751018, -0.2433259798001922, -0.36924520010563605, 0.02048572523569588, -0.2519388747247128, -0.22956893268085926, 0.1768520522171152, -0.17479840676372727, 0.08192095147657716, 0.15292503273192637, 0.14307310115295033, 0.0924830957243364, -0.25237831897185947, 0.24093330961869594, 0.041463682366657754, 0.31919523190796195, 0.02453470172243427, 0.1723060526098766, 0.06623422018737493, 0.029329847575801083, -0.10370495908202298, -0.028116290284666473, 0.1673298281043054, 0.3074623231356406, 0.2168350921425143, 0.3249997911182885, -0.46865584970100554, -0.15543320250535708, -0.003419293776645275, 0.11017931861563134, 0.025471620558632793, 0.008156659712451705, -0.4631676749287251, 0.06937306564619129, -0.2443374724623686, -0.024071558097009352, -0.046659436110340194, 0.008675292128708191, -0.030237661504526874, -0.31724825104305376, -0.09126500770450335, 0.03983343015759514, 0.12628227118737326, -0.08056421991518536, 0.02898996975482023, 0.0051759994670875584, 0.2961001738774852, 0.04212689502872276, 0.058743131086286045, 0.2689081142394396, -0.1796712186452403, -0.16363535518897418, 0.40560513665107734, 0.03026549158824195, -0.20091452401042162, 0.2558548822218251, -0.027437447639974112, -0.11486575753751495, 0.09187860288908203, 0.2813394613296329, 0.06654255298084111, -0.24272311703597535, -0.03781604371974691, -0.038157643315320955, 0.23382327627267935, 0.026506932301747943, -0.08808713483841654, 0.20948617314239462, 0.3264496757197166, 0.04828144626379638, 0.1486659191303446, -0.05808302355389261, -0.09715673905758265, -0.17703676171333133, -0.13883501312885055, -0.15270797114172383, -0.06204119438311074, -0.08107279375807903, -0.09987105451758482, 0.4053734336717578, 0.2452107312932923, 0.11691440411419524, 0.10045746869887197, 0.38245895850711953, -0.006144828374307982, 0.09823164646165211, 0.0598245649256961, 0.1273900082705732, -0.07985137344455112, 0.23639127355303147, -0.24499288569957375, 0.14912151984318334, 0.058481871160193384] |
1,802.00273 | Emerging Language Spaces Learned From Massively Multilingual Corpora | Translations capture important information about languages that can be used
as implicit supervision in learning linguistic properties and semantic
representations. In an information-centric view, translated texts may be
considered as semantic mirrors of the original text and the significant
variations that we can observe across various languages can be used to
disambiguate a given expression using the linguistic signal that is grounded in
translation. Parallel corpora consisting of massive amounts of human
translations with a large linguistic variation can be applied to increase
abstractions and we propose the use of highly multilingual machine translation
models to find language-independent meaning representations. Our initial
experiments show that neural machine translation models can indeed learn in
such a setup and we can show that the learning algorithm picks up information
about the relation between languages in order to optimize transfer leaning with
shared parameters. The model creates a continuous language space that
represents relationships in terms of geometric distances, which we can
visualize to illustrate how languages cluster according to language families
and groups. Does this open the door for new ideas of data-driven language
typology with promising models and techniques in empirical cross-linguistic
research?
| cs.CL | translations capture important information about languages that can be used as implicit supervision in learning linguistic properties and semantic representations in an informationcentric view translated texts may be considered as semantic mirrors of the original text and the significant variations that we can observe across various languages can be used to disambiguate a given expression using the linguistic signal that is grounded in translation parallel corpora consisting of massive amounts of human translations with a large linguistic variation can be applied to increase abstractions and we propose the use of highly multilingual machine translation models to find languageindependent meaning representations our initial experiments show that neural machine translation models can indeed learn in such a setup and we can show that the learning algorithm picks up information about the relation between languages in order to optimize transfer leaning with shared parameters the model creates a continuous language space that represents relationships in terms of geometric distances which we can visualize to illustrate how languages cluster according to language families and groups does this open the door for new ideas of datadriven language typology with promising models and techniques in empirical crosslinguistic research | [['translations', 'capture', 'important', 'information', 'about', 'languages', 'that', 'can', 'be', 'used', 'as', 'implicit', 'supervision', 'in', 'learning', 'linguistic', 'properties', 'and', 'semantic', 'representations', 'in', 'an', 'informationcentric', 'view', 'translated', 'texts', 'may', 'be', 'considered', 'as', 'semantic', 'mirrors', 'of', 'the', 'original', 'text', 'and', 'the', 'significant', 'variations', 'that', 'we', 'can', 'observe', 'across', 'various', 'languages', 'can', 'be', 'used', 'to', 'disambiguate', 'a', 'given', 'expression', 'using', 'the', 'linguistic', 'signal', 'that', 'is', 'grounded', 'in', 'translation', 'parallel', 'corpora', 'consisting', 'of', 'massive', 'amounts', 'of', 'human', 'translations', 'with', 'a', 'large', 'linguistic', 'variation', 'can', 'be', 'applied', 'to', 'increase', 'abstractions', 'and', 'we', 'propose', 'the', 'use', 'of', 'highly', 'multilingual', 'machine', 'translation', 'models', 'to', 'find', 'languageindependent', 'meaning', 'representations', 'our', 'initial', 'experiments', 'show', 'that', 'neural', 'machine', 'translation', 'models', 'can', 'indeed', 'learn', 'in', 'such', 'a', 'setup', 'and', 'we', 'can', 'show', 'that', 'the', 'learning', 'algorithm', 'picks', 'up', 'information', 'about', 'the', 'relation', 'between', 'languages', 'in', 'order', 'to', 'optimize', 'transfer', 'leaning', 'with', 'shared', 'parameters', 'the', 'model', 'creates', 'a', 'continuous', 'language', 'space', 'that', 'represents', 'relationships', 'in', 'terms', 'of', 'geometric', 'distances', 'which', 'we', 'can', 'visualize', 'to', 'illustrate', 'how', 'languages', 'cluster', 'according', 'to', 'language', 'families', 'and', 'groups', 'does', 'this', 'open', 'the', 'door', 'for', 'new', 'ideas', 'of', 'datadriven', 'language', 'typology', 'with', 'promising', 'models', 'and', 'techniques', 'in', 'empirical', 'crosslinguistic', 'research']] | [-0.041456483983589955, 0.05988500739302557, -0.09916945691020373, 0.12219246556530076, -0.17697839161943799, -0.13818951850407757, 0.04873047217673351, 0.44317440406242287, -0.33834827458971023, -0.34424214683046256, 0.021874347374856978, -0.2596917125914236, -0.1729290483732863, 0.2072989174982164, -0.149049891573668, 0.030370666806751007, 0.10584892311453586, 0.058909873478114605, -0.08019294065646439, -0.23312781068185964, 0.3139973243402589, -0.009569944954516055, 0.3306641707361753, 0.01812508694092685, 0.12288776968731933, -0.05916665345284855, -0.02969194073860611, -0.0005094826445883882, -0.062211292326461866, 0.22293341876502382, 0.3848430195152825, 0.24504089568654308, 0.2932508582234732, -0.4075933600834105, -0.20559526467695832, 0.07281548140421516, 0.1683709460933945, 0.13184978202662023, -0.009220297659946178, -0.34264815076312516, 0.07489373483258532, -0.17308649590874362, 0.01622601172615153, -0.18259201766826058, 0.0067241695505799726, 0.00319542108142438, -0.24345409510048435, -0.0014859004198418309, 0.11878484796519236, 0.09306070351643332, -0.04475641892592345, -0.06907700651693933, 0.00557985290470242, 0.1985563152945057, 0.048837528233889316, 0.0789998755584141, 0.13091308570437832, -0.13621640896781173, -0.19458754966641814, 0.4008697516983375, -0.0911959662692728, -0.26391657403776964, 0.23904186534734131, -0.04648326164169703, -0.16393696205583788, 0.022681244069341727, 0.24623205745471446, 0.04182616316635782, -0.18193857161289392, 0.04596234811530545, -0.04805896198862077, 0.2613314582564878, 0.10008807734629954, 0.0005505221847670327, 0.23012130253967675, 0.2004781441170659, -0.011060059788481643, 0.15646363781464365, -0.04908244091044859, -0.06729336121255376, -0.23998992024030485, -0.1458216314810367, -0.1297359986953476, -0.014063790052508315, -0.10482701039548677, -0.14248902124844184, 0.37130343493724166, 0.23775692508631133, 0.1665303559275344, 0.09060198136815718, 0.2580366034526378, 0.0349208496427309, 0.15083688871375975, 0.10225161827232417, 0.11103055557396146, 0.019142598561302293, 0.12087168118826715, -0.13192692050324695, 0.11562850313900223, 0.02400925316597598] |
1,802.00274 | Spin-Imbalanced Pairing and Fermi Surface Deformation in Flat Bands | We study the attractive Hubbard model with spin imbalance on two lattices
featuring a flat band: the Lieb and kagome lattices. We present mean-field
phase diagrams featuring exotic superfluid phases, similar to the
Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) state, whose stability is confirmed by
dynamical mean-field theory (DMFT). The nature of the pairing is found to be
richer than just the Fermi surface shift responsible for the usual FFLO state.
The presence of a flat band allows for changes in the particle momentum
distributions at null energy cost. This facilitates formation of nontrivial
superfluid phases via multiband Cooper pair formation: the momentum
distribution of the spin component in the flat band deforms to mimic the Fermi
surface of the other spin component residing in a dispersive band. The Fermi
surface of the unpaired particles that are typical for gapless superfluids
becomes deformed as well. The results highlight the profound effect of flat
dispersions on Fermi surface instabilities, and provide a potential route for
observing spin-imbalanced superfluidity and superconductivity.
| cond-mat.quant-gas cond-mat.supr-con | we study the attractive hubbard model with spin imbalance on two lattices featuring a flat band the lieb and kagome lattices we present meanfield phase diagrams featuring exotic superfluid phases similar to the fuldeferrelllarkinovchinnikov fflo state whose stability is confirmed by dynamical meanfield theory dmft the nature of the pairing is found to be richer than just the fermi surface shift responsible for the usual fflo state the presence of a flat band allows for changes in the particle momentum distributions at null energy cost this facilitates formation of nontrivial superfluid phases via multiband cooper pair formation the momentum distribution of the spin component in the flat band deforms to mimic the fermi surface of the other spin component residing in a dispersive band the fermi surface of the unpaired particles that are typical for gapless superfluids becomes deformed as well the results highlight the profound effect of flat dispersions on fermi surface instabilities and provide a potential route for observing spinimbalanced superfluidity and superconductivity | [['we', 'study', 'the', 'attractive', 'hubbard', 'model', 'with', 'spin', 'imbalance', 'on', 'two', 'lattices', 'featuring', 'a', 'flat', 'band', 'the', 'lieb', 'and', 'kagome', 'lattices', 'we', 'present', 'meanfield', 'phase', 'diagrams', 'featuring', 'exotic', 'superfluid', 'phases', 'similar', 'to', 'the', 'fuldeferrelllarkinovchinnikov', 'fflo', 'state', 'whose', 'stability', 'is', 'confirmed', 'by', 'dynamical', 'meanfield', 'theory', 'dmft', 'the', 'nature', 'of', 'the', 'pairing', 'is', 'found', 'to', 'be', 'richer', 'than', 'just', 'the', 'fermi', 'surface', 'shift', 'responsible', 'for', 'the', 'usual', 'fflo', 'state', 'the', 'presence', 'of', 'a', 'flat', 'band', 'allows', 'for', 'changes', 'in', 'the', 'particle', 'momentum', 'distributions', 'at', 'null', 'energy', 'cost', 'this', 'facilitates', 'formation', 'of', 'nontrivial', 'superfluid', 'phases', 'via', 'multiband', 'cooper', 'pair', 'formation', 'the', 'momentum', 'distribution', 'of', 'the', 'spin', 'component', 'in', 'the', 'flat', 'band', 'deforms', 'to', 'mimic', 'the', 'fermi', 'surface', 'of', 'the', 'other', 'spin', 'component', 'residing', 'in', 'a', 'dispersive', 'band', 'the', 'fermi', 'surface', 'of', 'the', 'unpaired', 'particles', 'that', 'are', 'typical', 'for', 'gapless', 'superfluids', 'becomes', 'deformed', 'as', 'well', 'the', 'results', 'highlight', 'the', 'profound', 'effect', 'of', 'flat', 'dispersions', 'on', 'fermi', 'surface', 'instabilities', 'and', 'provide', 'a', 'potential', 'route', 'for', 'observing', 'spinimbalanced', 'superfluidity', 'and', 'superconductivity']] | [-0.2106155283353997, 0.24071170625587304, -0.1062620602096572, 0.11513272668605416, -0.07146738989589115, -0.15983420883968585, 0.07396522424550671, 0.3485197231060628, -0.22222483850818014, -0.25794415273421417, -0.029222770388746128, -0.2934967740933644, -0.08823673184396642, 0.13771987665536334, 0.06241664256561886, -0.0019590071063827386, -0.019658761973859684, -0.05139081852464711, -0.16043633862123402, -0.2218919883630323, 0.3741063853365962, 0.009377515643383518, 0.3278049733094645, 0.07054600862532177, 0.015074265226157325, 0.0428422966816773, 0.11035953763110394, 0.0011452615063524607, -0.15012556128931465, 0.0458860594296394, 0.23350355327411582, -0.1378812928373615, 0.15903121807302037, -0.42671921199018303, -0.266278057895375, 0.047808989222076805, 0.14770156211346727, 0.16428813917957472, -0.05182329107809699, -0.3322722405279902, -0.03985574127485355, -0.21615429936597744, -0.2193360311430738, -0.09483012233183465, -0.003700231077770392, -0.026562537141426496, -0.16303503479611015, 0.15428727573122492, 0.06360671121157903, 0.06582113664427941, -0.13141688757018666, -0.10964354923502966, -0.14521295942620122, 0.02793583896039336, 0.027330272592547715, 0.04798060847361657, 0.11232763027461866, -0.17161981519029448, -0.08616278023092133, 0.4012655039402572, -0.05572387474405167, -0.12197286690387762, 0.21416012576188553, -0.16946460244009467, -0.052635450341569426, 0.1861998340961608, 0.1057458165073485, 0.01839979710904035, -0.07238998710544724, 0.08178828600406025, -0.03401732701018001, 0.14116551506361275, -0.007386644909186571, 0.1012347694251785, 0.34356375167315656, 0.22668366484682667, 0.0866243703601261, 0.14004595469521133, -0.1727978608853212, -0.1108656535235544, -0.25396190038458866, -0.16864962586251114, -0.23871780181811614, -0.003698494094141731, -0.020632644412266515, -0.21081365346626352, 0.43169996408237654, 0.07993492454777218, 0.18339367014352428, -0.037315414208128596, 0.20727609181494425, 0.09754459300769888, 0.04310343584158655, 0.082129408564475, 0.2584876272319393, 0.15055309004206774, 0.0583303409910789, -0.3085420108640171, -0.0059436133089052, 0.051727385553672456] |
1,802.00275 | Direct observation of electron thermalization and electron-phonon
coupling in photoexcited bismuth | We investigate the ultrafast response of the bismuth (111) surface by means
of time resolved photoemission spectroscopy. The direct visualization of the
electronic structure allows us to gain insights on electron-electron and
electron-phonon interaction. Concerning electron-electron interaction, it is
found that electron thermalization is fluence dependent and can take as much as
several hundreds of femtoseconds at low fluences. This behavior is in
qualitative agreement with Landau's theory of Fermi liquids but the data show
deviations from the behavior of a common 3D degenerate electron gas. Concerning
electron-phonon interaction, our data allows us to directly observe the
coupling of individual Bloch state to the coherent $A_{1g}$ mode. It is found
that surface states are much less coupled to this mode when compared to bulk
states. This is confirmed by \textit{ab initio} calculations of surface and
bulk bismuth.
| cond-mat.mtrl-sci | we investigate the ultrafast response of the bismuth 111 surface by means of time resolved photoemission spectroscopy the direct visualization of the electronic structure allows us to gain insights on electronelectron and electronphonon interaction concerning electronelectron interaction it is found that electron thermalization is fluence dependent and can take as much as several hundreds of femtoseconds at low fluences this behavior is in qualitative agreement with landaus theory of fermi liquids but the data show deviations from the behavior of a common 3d degenerate electron gas concerning electronphonon interaction our data allows us to directly observe the coupling of individual bloch state to the coherent a_1g mode it is found that surface states are much less coupled to this mode when compared to bulk states this is confirmed by textitab initio calculations of surface and bulk bismuth | [['we', 'investigate', 'the', 'ultrafast', 'response', 'of', 'the', 'bismuth', '111', 'surface', 'by', 'means', 'of', 'time', 'resolved', 'photoemission', 'spectroscopy', 'the', 'direct', 'visualization', 'of', 'the', 'electronic', 'structure', 'allows', 'us', 'to', 'gain', 'insights', 'on', 'electronelectron', 'and', 'electronphonon', 'interaction', 'concerning', 'electronelectron', 'interaction', 'it', 'is', 'found', 'that', 'electron', 'thermalization', 'is', 'fluence', 'dependent', 'and', 'can', 'take', 'as', 'much', 'as', 'several', 'hundreds', 'of', 'femtoseconds', 'at', 'low', 'fluences', 'this', 'behavior', 'is', 'in', 'qualitative', 'agreement', 'with', 'landaus', 'theory', 'of', 'fermi', 'liquids', 'but', 'the', 'data', 'show', 'deviations', 'from', 'the', 'behavior', 'of', 'a', 'common', '3d', 'degenerate', 'electron', 'gas', 'concerning', 'electronphonon', 'interaction', 'our', 'data', 'allows', 'us', 'to', 'directly', 'observe', 'the', 'coupling', 'of', 'individual', 'bloch', 'state', 'to', 'the', 'coherent', 'a_1g', 'mode', 'it', 'is', 'found', 'that', 'surface', 'states', 'are', 'much', 'less', 'coupled', 'to', 'this', 'mode', 'when', 'compared', 'to', 'bulk', 'states', 'this', 'is', 'confirmed', 'by', 'textitab', 'initio', 'calculations', 'of', 'surface', 'and', 'bulk', 'bismuth']] | [-0.10536364645227267, 0.17402929054185692, -0.10191289505438648, 0.08323457882141382, -0.05994221325929746, -0.13908270001411438, 0.06319843543724014, 0.3930846684863859, -0.2719052842253969, -0.3171271706122334, -0.023584499665413622, -0.3574316645685641, -0.0957156333929594, 0.2077743808172106, 0.0639309173443076, 0.04156578827758123, 0.04232449559698792, -0.04297869765695973, -0.10092336395211572, -0.19052165181267272, 0.2957137897440715, 0.08742378890768449, 0.3161176803222701, 0.13314264539771978, 0.03316271596929793, 0.023960691224103863, 0.06960294741702124, -0.009731713903347289, -0.13385178793927427, 0.09981538318556454, 0.28407888579901214, -0.06721632011629043, 0.24666489170096054, -0.4907502073685836, -0.24258275574113983, -0.04598718606968866, 0.12294356136461278, 0.16453216267056273, -0.02315683847201485, -0.26315512077842096, -0.004150730861949115, -0.14016169093780384, -0.13204567187064647, -0.1258740452403733, -0.011311476764670253, -0.03154712855768302, -0.2234424485805458, 0.11226459891011897, -0.010308170798200652, 0.04176476816123098, -0.09826132687689043, -0.06709198209110402, -0.06910072486630103, 0.06564385052596178, 0.0853109875486579, 0.0428100745805478, 0.1680665578876697, -0.076645239972659, -0.0807397007044867, 0.39202707531406494, -0.062240885390499, -0.08937707610673061, 0.2257463109754298, -0.21601320882701744, -0.06345397607851637, 0.21796859032644408, 0.09416541977136321, 0.08823049024603989, -0.14354287950506003, 0.05184914939760665, -0.03118176993499272, 0.21468824644600223, 0.04373168418299488, 0.09865958442741343, 0.19857801266531222, 0.20370619087887887, 0.014439907171389592, 0.09202666039218324, -0.1302933783464161, -0.035575894594709154, -0.21510497590078273, -0.14725604836223988, -0.21730469244177092, 0.10803990234981162, -0.031437030138025554, -0.14054848935054004, 0.4222412324394949, 0.142719778082721, 0.15956835243782966, -0.022242648921308728, 0.2451411659428238, 0.11339295281855268, 0.0495780773739582, 0.009680859894953995, 0.29092085404987755, 0.16385798936329074, 0.07087346676560323, -0.3358612923090938, 0.07055809900902184, -0.020579711624156057] |
1,802.00276 | Graphene Nanoribbon as an Elastic Damper | Heterostructures composed of dissimilar two-dimensional nanomaterials can
have nontrivial physical and mechanical properties promising for many
applications. Interestingly, in some cases, it is possible to create
heterostructures composed of weakly and strongly stretched domains with the
same chemical composition, as it has been demonstrated for some polymer chains,
DNA, and intermetallic nanowires supporting this effect of two-phase
stretching. These materials at relatively strong tension forces split into
domains with smaller and larger tensile strain. Within this region, average
strain increases at constant tensile force due to the growth of the domain with
the larger strain in the expense of the domain with smaller strain. Here the
two-phase stretching phenomenon is described for graphene nanoribbons with the
help of molecular dynamics simulations. This unprecedented feature of graphene
revealed in our study is related to the peculiarities of nucleation and motion
of the domain walls separating the domains with different elastic strain. It
turns out that the loading-unloading curves exhibit a hysteresis-like behavior
due to the energy dissipation during the domain wall nucleation and motion.
Here, we originally put forward the idea of implementing graphene nanoribbons
as elastic dampers, efficiently converting mechanical strain energy into heat
during cyclic loading-unloading through elastic extension where domains with
larger and smaller strain coexist. Furthermore, in the regime of two-phase
stretching, graphene nanoribbon is a heterostructure for which the fraction of
domains with larger and smaller strain, and consequently its physical and
mechanical properties, can be tuned in a controllable manner by applying
elastic strain and/or heat.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.comp-ph | heterostructures composed of dissimilar twodimensional nanomaterials can have nontrivial physical and mechanical properties promising for many applications interestingly in some cases it is possible to create heterostructures composed of weakly and strongly stretched domains with the same chemical composition as it has been demonstrated for some polymer chains dna and intermetallic nanowires supporting this effect of twophase stretching these materials at relatively strong tension forces split into domains with smaller and larger tensile strain within this region average strain increases at constant tensile force due to the growth of the domain with the larger strain in the expense of the domain with smaller strain here the twophase stretching phenomenon is described for graphene nanoribbons with the help of molecular dynamics simulations this unprecedented feature of graphene revealed in our study is related to the peculiarities of nucleation and motion of the domain walls separating the domains with different elastic strain it turns out that the loadingunloading curves exhibit a hysteresislike behavior due to the energy dissipation during the domain wall nucleation and motion here we originally put forward the idea of implementing graphene nanoribbons as elastic dampers efficiently converting mechanical strain energy into heat during cyclic loadingunloading through elastic extension where domains with larger and smaller strain coexist furthermore in the regime of twophase stretching graphene nanoribbon is a heterostructure for which the fraction of domains with larger and smaller strain and consequently its physical and mechanical properties can be tuned in a controllable manner by applying elastic strain andor heat | [['heterostructures', 'composed', 'of', 'dissimilar', 'twodimensional', 'nanomaterials', 'can', 'have', 'nontrivial', 'physical', 'and', 'mechanical', 'properties', 'promising', 'for', 'many', 'applications', 'interestingly', 'in', 'some', 'cases', 'it', 'is', 'possible', 'to', 'create', 'heterostructures', 'composed', 'of', 'weakly', 'and', 'strongly', 'stretched', 'domains', 'with', 'the', 'same', 'chemical', 'composition', 'as', 'it', 'has', 'been', 'demonstrated', 'for', 'some', 'polymer', 'chains', 'dna', 'and', 'intermetallic', 'nanowires', 'supporting', 'this', 'effect', 'of', 'twophase', 'stretching', 'these', 'materials', 'at', 'relatively', 'strong', 'tension', 'forces', 'split', 'into', 'domains', 'with', 'smaller', 'and', 'larger', 'tensile', 'strain', 'within', 'this', 'region', 'average', 'strain', 'increases', 'at', 'constant', 'tensile', 'force', 'due', 'to', 'the', 'growth', 'of', 'the', 'domain', 'with', 'the', 'larger', 'strain', 'in', 'the', 'expense', 'of', 'the', 'domain', 'with', 'smaller', 'strain', 'here', 'the', 'twophase', 'stretching', 'phenomenon', 'is', 'described', 'for', 'graphene', 'nanoribbons', 'with', 'the', 'help', 'of', 'molecular', 'dynamics', 'simulations', 'this', 'unprecedented', 'feature', 'of', 'graphene', 'revealed', 'in', 'our', 'study', 'is', 'related', 'to', 'the', 'peculiarities', 'of', 'nucleation', 'and', 'motion', 'of', 'the', 'domain', 'walls', 'separating', 'the', 'domains', 'with', 'different', 'elastic', 'strain', 'it', 'turns', 'out', 'that', 'the', 'loadingunloading', 'curves', 'exhibit', 'a', 'hysteresislike', 'behavior', 'due', 'to', 'the', 'energy', 'dissipation', 'during', 'the', 'domain', 'wall', 'nucleation', 'and', 'motion', 'here', 'we', 'originally', 'put', 'forward', 'the', 'idea', 'of', 'implementing', 'graphene', 'nanoribbons', 'as', 'elastic', 'dampers', 'efficiently', 'converting', 'mechanical', 'strain', 'energy', 'into', 'heat', 'during', 'cyclic', 'loadingunloading', 'through', 'elastic', 'extension', 'where', 'domains', 'with', 'larger', 'and', 'smaller', 'strain', 'coexist', 'furthermore', 'in', 'the', 'regime', 'of', 'twophase', 'stretching', 'graphene', 'nanoribbon', 'is', 'a', 'heterostructure', 'for', 'which', 'the', 'fraction', 'of', 'domains', 'with', 'larger', 'and', 'smaller', 'strain', 'and', 'consequently', 'its', 'physical', 'and', 'mechanical', 'properties', 'can', 'be', 'tuned', 'in', 'a', 'controllable', 'manner', 'by', 'applying', 'elastic', 'strain', 'andor', 'heat']] | [-0.14444109650915007, 0.19068315007772105, -0.05443479032144396, -0.04762570144292301, -0.06293552577221002, -0.14332755386413806, 0.03173467999999504, 0.4214056453749211, -0.3274106104761748, -0.2842431969614143, 0.05601914077431364, -0.24102199778695446, -0.13625404393426568, 0.2093382147307771, 0.022177981339702085, 0.03847800340272479, 0.020332098117124185, -0.08557317825961873, -0.03664143055058697, -0.18892190708830744, 0.2617242296014827, 0.04290023009142972, 0.3450891926849402, 0.08844663206102008, 0.03399240482078848, -0.021342100484660304, 0.0831413361742727, 0.07589886032200234, -0.17443004807757526, 0.09595745400547892, 0.22593380507653157, -0.10020669018274611, 0.2435168580910881, -0.5050007638621674, -0.24621507761985123, 0.052886369057459776, 0.14617588550438623, 0.13281392546480084, -0.03887913994357988, -0.250736725464671, 0.09006949176963612, -0.10846476665553284, -0.10121671149423796, -0.05655639827117452, 0.04033295775738645, 0.03717515191765487, -0.20119835782157947, 0.11507324290933066, 0.044981754707743925, 0.06220574044544561, -0.11563823818167916, -0.10266410958474553, -0.07498642565975656, 0.059611198496522445, 0.09244638036164748, 0.030686644814069942, 0.2305847610016743, -0.12671228434354348, -0.05631942934991117, 0.40902990090523467, -0.006316067722340326, -0.1724562583663626, 0.217704292430368, -0.13436290660531694, -0.059312953590160325, 0.17447549754297323, 0.14900295009866238, 0.06397983800541922, -0.14245092915742105, 0.041063901762863245, 0.05062875768728183, 0.14983710911648118, 0.1170004757160165, 0.032691557353651854, 0.2347482115297441, 0.23604503789530748, 0.05249142061118445, 0.2084575540541979, -0.067819429960369, -0.05409341307187201, -0.23539490185945158, -0.1714299409557505, -0.19978309027012067, 0.05753080127389723, -0.11896969190929957, -0.20050799051314533, 0.3746453360357578, 0.082809473172691, 0.16288418163437826, -0.009941886745456353, 0.2213227468676331, 0.07026259967615732, 0.13107889520275254, 0.021094575913927233, 0.27023792638006505, 0.14125538541030036, 0.11764774493830449, -0.24432383386039758, 0.07294715196450809, -0.03532387554994321] |
1,802.00277 | Momentum-space and real-space Berry curvatures in Mn$_{3}$Sn | Mn$_{3}$X (X= Sn, Ge) are noncollinear antiferromagnets hosting a large
anomalous Hall effect (AHE). Weyl nodes in the electronic dispersions are
believed to cause this AHE, but their locus in the momentum space is yet to be
pinned down. We present a detailed study of the Hall conductivity tensor and
magnetization in Mn$_{3}$Sn crystals and find that in the presence of a
moderate magnetic field, spin texture sets the orientation of the $k$-space
Berry curvature with no detectable in-plane anisotropy due to the $Z_6$
symmetry of the underlying lattice. We quantify the energy cost of domain
nucleation and show that the multidomain regime is restricted to a narrow field
window. Comparing the field dependence of AHE and magnetization, we find that
there is a distinct component in the AHE which does not scale with
magnetization when the domain walls are erected. This so-called `topological'
Hall effect provides indirect evidence for a non-coplanar spin components and
real-space Berry curvature in domain walls.
| cond-mat.mtrl-sci | mn_3x x sn ge are noncollinear antiferromagnets hosting a large anomalous hall effect ahe weyl nodes in the electronic dispersions are believed to cause this ahe but their locus in the momentum space is yet to be pinned down we present a detailed study of the hall conductivity tensor and magnetization in mn_3sn crystals and find that in the presence of a moderate magnetic field spin texture sets the orientation of the kspace berry curvature with no detectable inplane anisotropy due to the z_6 symmetry of the underlying lattice we quantify the energy cost of domain nucleation and show that the multidomain regime is restricted to a narrow field window comparing the field dependence of ahe and magnetization we find that there is a distinct component in the ahe which does not scale with magnetization when the domain walls are erected this socalled topological hall effect provides indirect evidence for a noncoplanar spin components and realspace berry curvature in domain walls | [['mn_3x', 'x', 'sn', 'ge', 'are', 'noncollinear', 'antiferromagnets', 'hosting', 'a', 'large', 'anomalous', 'hall', 'effect', 'ahe', 'weyl', 'nodes', 'in', 'the', 'electronic', 'dispersions', 'are', 'believed', 'to', 'cause', 'this', 'ahe', 'but', 'their', 'locus', 'in', 'the', 'momentum', 'space', 'is', 'yet', 'to', 'be', 'pinned', 'down', 'we', 'present', 'a', 'detailed', 'study', 'of', 'the', 'hall', 'conductivity', 'tensor', 'and', 'magnetization', 'in', 'mn_3sn', 'crystals', 'and', 'find', 'that', 'in', 'the', 'presence', 'of', 'a', 'moderate', 'magnetic', 'field', 'spin', 'texture', 'sets', 'the', 'orientation', 'of', 'the', 'kspace', 'berry', 'curvature', 'with', 'no', 'detectable', 'inplane', 'anisotropy', 'due', 'to', 'the', 'z_6', 'symmetry', 'of', 'the', 'underlying', 'lattice', 'we', 'quantify', 'the', 'energy', 'cost', 'of', 'domain', 'nucleation', 'and', 'show', 'that', 'the', 'multidomain', 'regime', 'is', 'restricted', 'to', 'a', 'narrow', 'field', 'window', 'comparing', 'the', 'field', 'dependence', 'of', 'ahe', 'and', 'magnetization', 'we', 'find', 'that', 'there', 'is', 'a', 'distinct', 'component', 'in', 'the', 'ahe', 'which', 'does', 'not', 'scale', 'with', 'magnetization', 'when', 'the', 'domain', 'walls', 'are', 'erected', 'this', 'socalled', 'topological', 'hall', 'effect', 'provides', 'indirect', 'evidence', 'for', 'a', 'noncoplanar', 'spin', 'components', 'and', 'realspace', 'berry', 'curvature', 'in', 'domain', 'walls']] | [-0.2270203025083156, 0.20837567385173292, -0.06683454552021091, 0.03831921817076115, -0.14520222117534334, -0.09496725676147418, 0.023055431282622104, 0.405889694006269, -0.27113373228204174, -0.2720441835330834, 0.045610667887485086, -0.27546178675054206, -0.1386271071018686, 0.15460399485060147, 0.02003112216682538, -0.049731686529096056, -0.046923998887910975, -0.03964773427857005, -0.0820730409750524, -0.19598619369515188, 0.30188276130570135, -0.05284306475377833, 0.3231863924562468, 0.10271800028576707, 0.0588521387085307, -0.022809795613013068, 0.09744260827171969, 0.09294223018631959, -0.14198546499654366, 0.026750674714212833, 0.22420600301048121, -0.12513515300562847, 0.15119442811686984, -0.41959059291652273, -0.1897611914098448, 0.07751679586200333, 0.13494196631049055, 0.1544300352435802, -0.058129019325928795, -0.2809520648273217, 0.07603832935301229, -0.10488358241403244, -0.11815801599865684, -0.10710375615603851, 0.023745953176974647, -0.07991001369310138, -0.2255891447574817, 0.13639907950176772, 0.10019888194648098, 0.11865901004129685, -0.08233368782303441, -0.12957412351764483, -0.09980889693226504, 0.051594761060876196, 0.09996959732365303, 0.08663514504492607, 0.13373428914024962, -0.13321691335312275, -0.1400849924521139, 0.3676358120434958, -0.017936022737445254, -0.16171202886457733, 0.12774491567534874, -0.25602632417106386, -0.08492024323500993, 0.1582271672282021, 0.1350524461949649, 0.06909539364712163, -0.09587405317056974, 0.11708283688698068, -0.017395170226184108, 0.15580706661046476, 0.0061112968569262795, 0.06401123161361154, 0.28623669398030244, 0.14974670603029686, 0.07751667065800259, 0.13643711986329685, -0.17984103657571332, -0.02970256689959061, -0.25890182391942845, -0.19781450526962369, -0.27340477854534057, 0.11242271807221536, -0.09765815620861228, -0.2150056314197664, 0.38652472575455443, 0.14217140087395075, 0.18688834570268725, -0.047155320892393916, 0.2525252525474853, 0.07411546879650457, 0.10246166365325265, 0.09831297322413567, 0.24633292334663295, 0.17838710280979828, 0.12058937526452615, -0.30849999407456713, 0.0670532941852945, -0.017764922095497387] |
1,802.00278 | HoloFace: Augmenting Human-to-Human Interactions on HoloLens | We present HoloFace, an open-source framework for face alignment, head pose
estimation and facial attribute retrieval for Microsoft HoloLens. HoloFace
implements two state-of-the-art face alignment methods which can be used
interchangeably: one running locally and one running on a remote backend. Head
pose estimation is accomplished by fitting a deformable 3D model to the
landmarks localized using face alignment. The head pose provides both the
rotation of the head and a position in the world space. The parameters of the
fitted 3D face model provide estimates of facial attributes such as mouth
opening or smile. Together the above information can be used to augment the
faces of people seen by the HoloLens user, and thus their interaction.
Potential usage scenarios include facial recognition, emotion recognition, eye
gaze tracking and many others. We demonstrate the capabilities of our framework
by augmenting the faces of people seen through the HoloLens with various
objects and animations.
| cs.CV | we present holoface an opensource framework for face alignment head pose estimation and facial attribute retrieval for microsoft hololens holoface implements two stateoftheart face alignment methods which can be used interchangeably one running locally and one running on a remote backend head pose estimation is accomplished by fitting a deformable 3d model to the landmarks localized using face alignment the head pose provides both the rotation of the head and a position in the world space the parameters of the fitted 3d face model provide estimates of facial attributes such as mouth opening or smile together the above information can be used to augment the faces of people seen by the hololens user and thus their interaction potential usage scenarios include facial recognition emotion recognition eye gaze tracking and many others we demonstrate the capabilities of our framework by augmenting the faces of people seen through the hololens with various objects and animations | [['we', 'present', 'holoface', 'an', 'opensource', 'framework', 'for', 'face', 'alignment', 'head', 'pose', 'estimation', 'and', 'facial', 'attribute', 'retrieval', 'for', 'microsoft', 'hololens', 'holoface', 'implements', 'two', 'stateoftheart', 'face', 'alignment', 'methods', 'which', 'can', 'be', 'used', 'interchangeably', 'one', 'running', 'locally', 'and', 'one', 'running', 'on', 'a', 'remote', 'backend', 'head', 'pose', 'estimation', 'is', 'accomplished', 'by', 'fitting', 'a', 'deformable', '3d', 'model', 'to', 'the', 'landmarks', 'localized', 'using', 'face', 'alignment', 'the', 'head', 'pose', 'provides', 'both', 'the', 'rotation', 'of', 'the', 'head', 'and', 'a', 'position', 'in', 'the', 'world', 'space', 'the', 'parameters', 'of', 'the', 'fitted', '3d', 'face', 'model', 'provide', 'estimates', 'of', 'facial', 'attributes', 'such', 'as', 'mouth', 'opening', 'or', 'smile', 'together', 'the', 'above', 'information', 'can', 'be', 'used', 'to', 'augment', 'the', 'faces', 'of', 'people', 'seen', 'by', 'the', 'hololens', 'user', 'and', 'thus', 'their', 'interaction', 'potential', 'usage', 'scenarios', 'include', 'facial', 'recognition', 'emotion', 'recognition', 'eye', 'gaze', 'tracking', 'and', 'many', 'others', 'we', 'demonstrate', 'the', 'capabilities', 'of', 'our', 'framework', 'by', 'augmenting', 'the', 'faces', 'of', 'people', 'seen', 'through', 'the', 'hololens', 'with', 'various', 'objects', 'and', 'animations']] | [-0.052119688059986624, -0.022924592350636583, -0.05105404803122313, 0.03237787584098833, -0.10555259313893856, -0.22924414267516788, -0.03625067726351222, 0.46000145368327366, -0.2655104011704294, -0.3671855242515834, 0.11636965054115095, -0.2825820162022696, -0.16692520392633087, 0.19110882363824902, -0.1849391920960798, 0.07891773660698079, 0.1322905779022119, 0.07133329034160779, -0.0217302451814164, -0.20653427119632037, 0.24658043980629288, -0.005288290254623684, 0.2734278655111395, 0.0437522809674951, 0.12728951312447373, 0.02644853259356606, -0.04408704848352524, -0.0018535675421212214, -0.04199517630225676, 0.21720818541203904, 0.2851615305978416, 0.2071468630367705, 0.23530699554460727, -0.4349258060486901, -0.19183920691443596, 0.00684342762480015, 0.1532485661796905, 0.10548926559924487, -0.08317331892873056, -0.43738598224170355, 0.027088458251997533, -0.19411003738117485, -0.06599092636171063, -0.09145907158439127, -0.021713777951008043, -0.035521831125983144, -0.26446262468269327, 0.023977013178391765, 0.019624442802680445, 0.12490080745384985, -0.0703300260753673, -0.09410762441011504, -0.006152428500816868, 0.29515364256514764, 0.04361058475869085, 0.04392464835094966, 0.2037507930758181, -0.2520950099696954, -0.14753683738561582, 0.42519478059515653, -0.0163936571245828, -0.23024442461195913, 0.19613701285831384, -0.03531374030789693, -0.089449573665956, 0.1013005307477757, 0.2194608390726001, 0.09966538644654813, -0.1349627144603114, 0.012153931863340765, -0.03543104556491691, 0.17791787456468192, 0.07247765745007008, -0.05925836978751599, 0.23772386879666357, 0.17379882430275348, 0.025846829267437664, 0.13369871846813436, -0.2205069583288659, -0.019039820182747795, -0.18212193876831786, -0.12421200398836803, -0.16722522886463792, -0.10393123762891782, -0.14077712243846124, -0.14677163719242772, 0.4458923522191776, 0.21611708035038796, 0.22025894915796077, 0.07992996396273312, 0.3784911698285515, 0.007344576557913166, 0.1269944579146235, 0.051357450231983764, 0.17636127782436642, -0.07393842189347631, 0.11681871995058478, -0.18380867903867107, 0.13156160671226927, 0.07576735874341912] |
1,802.00279 | Overview of Plasma Lens Experiments and Recent Results at SPARC_LAB | Beam injection and extraction from a plasma module is still one of the
crucial aspects to solve in order to produce high quality electron beams with a
plasma accelerator. Proper matching conditions require to focus the incoming
high brightness beam down to few microns size and to capture a high divergent
beam at the exit without loss of beam quality. Plasma-based lenses have proven
to provide focusing gradients of the order of kT/m with radially symmetric
focusing thus promising compact and affordable alternative to permanent magnets
in the design of transport lines. In this paper an overview of recent
experiments and future perspectives of plasma lenses is reported.
| physics.acc-ph | beam injection and extraction from a plasma module is still one of the crucial aspects to solve in order to produce high quality electron beams with a plasma accelerator proper matching conditions require to focus the incoming high brightness beam down to few microns size and to capture a high divergent beam at the exit without loss of beam quality plasmabased lenses have proven to provide focusing gradients of the order of ktm with radially symmetric focusing thus promising compact and affordable alternative to permanent magnets in the design of transport lines in this paper an overview of recent experiments and future perspectives of plasma lenses is reported | [['beam', 'injection', 'and', 'extraction', 'from', 'a', 'plasma', 'module', 'is', 'still', 'one', 'of', 'the', 'crucial', 'aspects', 'to', 'solve', 'in', 'order', 'to', 'produce', 'high', 'quality', 'electron', 'beams', 'with', 'a', 'plasma', 'accelerator', 'proper', 'matching', 'conditions', 'require', 'to', 'focus', 'the', 'incoming', 'high', 'brightness', 'beam', 'down', 'to', 'few', 'microns', 'size', 'and', 'to', 'capture', 'a', 'high', 'divergent', 'beam', 'at', 'the', 'exit', 'without', 'loss', 'of', 'beam', 'quality', 'plasmabased', 'lenses', 'have', 'proven', 'to', 'provide', 'focusing', 'gradients', 'of', 'the', 'order', 'of', 'ktm', 'with', 'radially', 'symmetric', 'focusing', 'thus', 'promising', 'compact', 'and', 'affordable', 'alternative', 'to', 'permanent', 'magnets', 'in', 'the', 'design', 'of', 'transport', 'lines', 'in', 'this', 'paper', 'an', 'overview', 'of', 'recent', 'experiments', 'and', 'future', 'perspectives', 'of', 'plasma', 'lenses', 'is', 'reported']] | [-0.08235553535417205, 0.11973784303120703, -0.05718447891262325, 0.0210825507232652, -0.08998508862418088, -0.15440798275112347, -0.03193365489197378, 0.44616485166328923, -0.21127569145971425, -0.34355864088758137, 0.10441690386398006, -0.26715108364199597, 0.009977728550977729, 0.22669715527445078, -0.04030395497964626, 0.11377776381602787, 0.05593273852718994, -0.043615609668012, -0.059721770709277026, -0.20025434019259625, 0.28138222036607285, 0.16331537092466736, 0.326842418388912, 0.11230920823463411, 0.14378667148519997, -0.02107408212032169, -0.014234086080385303, -0.018890881238298282, -0.10361325503766204, 0.1351551624749037, 0.24979940589724314, 0.09191145206568763, 0.2606696714733348, -0.4727480494831171, -0.2196243411378452, 0.03501982713351026, 0.14499360529050506, 0.10273161088978802, -0.12468690496731412, -0.21060331408322477, 0.07076547319162206, -0.13933097201839295, -0.18547972083885084, -0.048384805929985036, 0.0015973933041095734, 0.06967037818739535, -0.28673435829168065, 0.0002780974954711618, 0.02553603984846699, 0.048210308499013386, 0.0065627103559327896, -0.1064987307957684, 0.05105459042911038, 0.0816160036397546, 0.035908621679819015, 0.08489528623909724, 0.14383599555326831, -0.17795173333811196, -0.08021270574708642, 0.4019066659664666, -0.018834275308849843, -0.14572856278607138, 0.19124205564838592, -0.21980229180944325, -0.06597535369521076, 0.20146174456372304, 0.2329799488738731, 0.10399855902694442, -0.13499992211452788, -0.03454970960134502, 0.04813633236551174, 0.14667651699144496, 0.12814465539823114, 0.07240192029685541, 0.2657111994922161, 0.21224441512970738, 0.09476918149610153, 0.13911123756433544, -0.1124823969418045, 0.016059605825123273, -0.26007096303833854, -0.1233657109292431, -0.11433038829946546, 0.03568358461726112, -0.0069309621871474925, -0.15503493696882356, 0.40090128328409735, 0.16766968562647147, 0.16955994286453696, -0.03712634086884834, 0.35534051797111277, 0.06161380538294368, 0.06905586755008833, 0.03923268448906364, 0.25054634553897714, 0.1149480888055189, 0.13634702878038366, -0.20622194033435168, 0.016866280180962617, -0.011614644578744279] |
1,802.0028 | Online optimal exact identification of a quantum change point | We consider online detection strategies for identifying a change point in a
stream of quantum particles allegedly prepared in identical states. We show
that the identification of the change point can be done without error via
sequential local measurements while attaining the optimal performance bound set
by quantum mechanics. In this way, we establish the task of exactly identifying
a quantum change point as an instance where local protocols are as powerful as
global ones. The optimal online detection strategy requires only one bit of
memory between subsequent measurements, and it is amenable to experimental
realization with current technology.
| quant-ph stat.ML | we consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states we show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mechanics in this way we establish the task of exactly identifying a quantum change point as an instance where local protocols are as powerful as global ones the optimal online detection strategy requires only one bit of memory between subsequent measurements and it is amenable to experimental realization with current technology | [['we', 'consider', 'online', 'detection', 'strategies', 'for', 'identifying', 'a', 'change', 'point', 'in', 'a', 'stream', 'of', 'quantum', 'particles', 'allegedly', 'prepared', 'in', 'identical', 'states', 'we', 'show', 'that', 'the', 'identification', 'of', 'the', 'change', 'point', 'can', 'be', 'done', 'without', 'error', 'via', 'sequential', 'local', 'measurements', 'while', 'attaining', 'the', 'optimal', 'performance', 'bound', 'set', 'by', 'quantum', 'mechanics', 'in', 'this', 'way', 'we', 'establish', 'the', 'task', 'of', 'exactly', 'identifying', 'a', 'quantum', 'change', 'point', 'as', 'an', 'instance', 'where', 'local', 'protocols', 'are', 'as', 'powerful', 'as', 'global', 'ones', 'the', 'optimal', 'online', 'detection', 'strategy', 'requires', 'only', 'one', 'bit', 'of', 'memory', 'between', 'subsequent', 'measurements', 'and', 'it', 'is', 'amenable', 'to', 'experimental', 'realization', 'with', 'current', 'technology']] | [-0.12381174516713604, 0.11404211803546971, -0.08111188826950813, 0.031170719688889955, -0.03182786268727722, -0.2050620502641782, 0.12042046824912306, 0.3755762320990213, -0.2791561026577697, -0.32842246713963424, 0.11633455530491027, -0.2522164605266292, -0.13148127522582959, 0.21164013343778523, -0.07335803865671459, 0.10234667260124526, 0.09019190939425518, 0.07883392376919286, -0.05900053254497999, -0.24573741881929415, 0.2648026759905571, 0.06609867434511243, 0.2975827636517058, -0.001860505191026011, 0.0992756722908881, 0.052911396312405067, -0.011224118738689205, 0.006416536227922247, -0.08928042748683389, 0.0930324597066654, 0.30574562213374207, 0.14475500681014222, 0.2806248991101077, -0.42584714580402533, -0.18728454816014026, 0.13267863826412293, 0.12198044304651293, 0.16614526301161434, -0.09150052152461174, -0.2803468147029329, 0.10007886085518156, -0.13592624800712472, -0.08650033920532976, -0.07923898615432207, -0.020867087008111705, -0.03254313739263594, -0.27172209422169913, 0.07561840550654163, 0.060682894130510215, 0.05554891542021204, -0.011107755192282676, -0.05980227833538495, 0.052103576525537806, 0.17705906111972802, -0.014855013655809065, 0.023828212148274738, 0.1813599685009456, -0.1585586492226205, -0.20553159339334628, 0.36226024089211767, -0.046874253493216306, -0.19317182392879118, 0.16380350668961652, -0.06257068252454352, -0.13957442849818052, 0.07409820264449926, 0.1458538738549734, 0.11392793333101453, -0.16648216498545323, 0.04686286663013332, -0.0308459559079222, 0.16022130379757862, 0.04872454273410969, 0.08415590857409617, 0.20407669657883656, 0.1678380990457354, 0.14173179052092813, 0.14590466626322443, -0.0664746089976027, -0.12041492771470186, -0.29916841516064274, -0.19862409314020735, -0.20978731300559533, 0.06228228132334547, -0.05025506944785417, -0.13786581477192653, 0.34923472850950377, 0.1483668730914066, 0.19904972214458716, 0.02185947620639145, 0.3108543266984399, 0.09937217770714073, 0.02797525345037381, 0.10429163823301688, 0.24760856836883707, 0.028137920708912943, 0.06561953951416519, -0.2024005742254432, 0.11590409559559905, 0.06082842893183532] |
1,802.00281 | Derived equivalent Hilbert schemes of points on K3 surfaces which are
not birational | We provide a criterion for when Hilbert schemes of points on K3 surfaces are
birational. In particular, this allows us to generate a plethora of examples of
non-birational Hilbert schemes which are derived equivalent.
| math.AG | we provide a criterion for when hilbert schemes of points on k3 surfaces are birational in particular this allows us to generate a plethora of examples of nonbirational hilbert schemes which are derived equivalent | [['we', 'provide', 'a', 'criterion', 'for', 'when', 'hilbert', 'schemes', 'of', 'points', 'on', 'k3', 'surfaces', 'are', 'birational', 'in', 'particular', 'this', 'allows', 'us', 'to', 'generate', 'a', 'plethora', 'of', 'examples', 'of', 'nonbirational', 'hilbert', 'schemes', 'which', 'are', 'derived', 'equivalent']] | [-0.12470594171763343, 0.02312973911380943, -0.13742457516491413, 0.10725851579884287, -0.08012781993431203, -0.2249414109186653, 0.02716982507092111, 0.37422220836229186, -0.24664129831773393, -0.19812004598241081, 0.08155152697102441, -0.21180364775158095, -0.15774276113028035, 0.3342109470463851, -0.19047970434322076, 0.04596101295422105, 0.03246806088752825, -0.015696591785800754, -0.13040029235622463, -0.3897925447124769, 0.464335371466244, -0.03825628716389046, 0.25878502121743036, 0.0348677501657649, 0.1469476329817981, -0.05729378069586614, -0.018743386218214735, -0.037703199449050075, -0.187995953430586, 0.19735729349229267, 0.3464547504177865, 0.07603724151575829, 0.19888996086357272, -0.40754419170758305, -0.18727323936079354, 0.19361612997839556, 0.09527795296162367, 0.13356018439962475, -0.008777410192552078, -0.23889944724300327, 0.07275590125252218, -0.12803619845277248, -0.12046481055371902, -0.20025970315670266, -0.01213765244328362, 0.03334164142656578, -0.28445679310928373, -0.03392497257685617, 0.04635966152829282, 0.10707278294927057, -0.03420633866677664, -0.028574330869185573, -0.06593165354912772, 0.07221682025684618, -0.03335849628509844, -0.030873969909461105, 0.018990346915362513, -0.0524224365277298, -0.0977547164348995, 0.3999961221261936, -0.002438741992912529, -0.26299967244267464, 0.20930609492557672, -0.06917756543878247, -0.1206320538322496, 0.1838772973483976, 0.18191131916554534, 0.1778406645582222, -0.04321155513111187, 0.1371145044617793, -0.12228960868464235, 0.09208363530171268, 0.08358955964007798, 0.08062578581602257, 0.1181325903710197, 0.05307839110986713, 0.11749771275721929, 0.13585195117219187, -0.0506427787066273, -0.11593794220072381, -0.3870296610847992, -0.21712167985627756, -0.07198691872112892, 0.10173499134971815, -0.07249313391580739, -0.1511539621415603, 0.41018847650026574, 0.09367900938891313, 0.22495993780081763, 0.05374523052630727, 0.20080935486647136, 0.06894999756203855, 0.02395527289413354, 0.02098971966873197, 0.15504226378877373, 0.1617638767861268, -0.05056481631746625, -0.07933608798638862, -0.04251324997612221, 0.21388347553746664] |
1,802.00282 | Nonlinear and anisotropic polarization rotation in two dimensional Dirac
materials | We predict nonlinear optical polarization rotation in two dimensional
massless Dirac systems including graphene and 8-$Pmmn$ borophene. When
illuminated, a continuous wave optical field leads to a nonlinear steady state
of photo-excited carriers in the medium. The photo-excited population inversion
and the inter-band coherence gives rise to a finite transverse optical
conductivity, $\sigma_{xy} (\omega)$. This in turn leads to definitive
signatures in associated Kerr and Faraday polarization rotation, which are
measurable in a realistic experimental scenario.
| cond-mat.mes-hall | we predict nonlinear optical polarization rotation in two dimensional massless dirac systems including graphene and 8pmmn borophene when illuminated a continuous wave optical field leads to a nonlinear steady state of photoexcited carriers in the medium the photoexcited population inversion and the interband coherence gives rise to a finite transverse optical conductivity sigma_xy omega this in turn leads to definitive signatures in associated kerr and faraday polarization rotation which are measurable in a realistic experimental scenario | [['we', 'predict', 'nonlinear', 'optical', 'polarization', 'rotation', 'in', 'two', 'dimensional', 'massless', 'dirac', 'systems', 'including', 'graphene', 'and', '8pmmn', 'borophene', 'when', 'illuminated', 'a', 'continuous', 'wave', 'optical', 'field', 'leads', 'to', 'a', 'nonlinear', 'steady', 'state', 'of', 'photoexcited', 'carriers', 'in', 'the', 'medium', 'the', 'photoexcited', 'population', 'inversion', 'and', 'the', 'interband', 'coherence', 'gives', 'rise', 'to', 'a', 'finite', 'transverse', 'optical', 'conductivity', 'sigma_xy', 'omega', 'this', 'in', 'turn', 'leads', 'to', 'definitive', 'signatures', 'in', 'associated', 'kerr', 'and', 'faraday', 'polarization', 'rotation', 'which', 'are', 'measurable', 'in', 'a', 'realistic', 'experimental', 'scenario']] | [-0.1901707519435532, 0.21235116853035593, -0.04837301898576123, 0.023044808055458003, -0.07733305226276188, -0.16080987992647447, 0.01993934997957886, 0.4384801303477664, -0.2616871996831737, -0.19767596078178795, -0.006061587073705404, -0.2832336250208563, -0.11450955717775382, 0.2129502663998497, 0.0025342092481686882, 0.054414293786976486, -0.030926679530622142, -0.07529222396643538, -0.049479058925307504, -0.12983159165627225, 0.2747105979973352, -0.04536903625060069, 0.33301981759110566, 0.05304814433973087, 0.07060948615942739, 0.006767261264796712, 0.04891755092447918, 0.029659324766773926, -0.07938114190964322, 0.05324159968088344, 0.24810441379974546, -0.10108402801530533, 0.17459513535255897, -0.4324893882914789, -0.22777956980280578, 0.050050158899179416, 0.1423396363940188, 0.2298932909325231, -0.09676095606808208, -0.28716126138246373, -0.0647280991692433, -0.1278381866500958, -0.1592205612135953, -0.07266406042158212, 0.04124201584981117, -0.050586614819047485, -0.2776723071736725, 0.1719132457296119, 0.029150961405033933, 0.03682086953746253, -0.14103869302811003, -0.04089832845248135, -0.11530734628046814, 0.013433819396595936, 0.025728564635899506, 0.06002173513345616, 0.13568463331505068, -0.11479684362300184, -0.0985915753500242, 0.39963448273116037, -0.09772442075374879, -0.12418512695493471, 0.1613922656489242, -0.2685496303081316, -0.002659727543543436, 0.20898572202330748, 0.20764923601190707, 0.079239241349952, -0.10997857730379972, 0.04947215379721265, -0.055918786282410635, 0.1639646617634418, 0.07800024616115384, 0.1497463110380953, 0.298669104709437, 0.13490122111550973, 0.038928426606090444, 0.13642997161093118, -0.10626079529404371, -0.020100872819679545, -0.23492676701004567, -0.15031121462877645, -0.15803464414171972, 0.19572149485554147, -0.06020777386411761, -0.18508148784013956, 0.4653579805438456, 0.13092540465157454, 0.16989449806523657, -0.05942396921608107, 0.28695788910906567, 0.15929637273381414, 0.02416227984710866, 0.027390723658180304, 0.2998155765235424, 0.22104523264141263, 0.15454767720994392, -0.33368849212695895, -0.006177026821349405, -0.025657458831311056] |
1,802.00283 | Mode solutions for a Klein-Gordon field in anti-de Sitter spacetime with
dynamical boundary conditions of Wentzell type | We study a real, massive Klein-Gordon field in the Poincar\'e fundamental
domain of the $(d+1)$-dimensional anti-de Sitter (AdS) spacetime, subject to a
particular choice of dynamical boundary conditions of generalized Wentzell
type, whereby the boundary data solves a non-homogeneous, boundary Klein-Gordon
equation, with the source term fixed by the normal derivative of the scalar
field at the boundary. This naturally defines a field in the conformal boundary
of the Poincar\'e fundamental domain of AdS. We completely solve the equations
for the bulk and boundary fields and investigate the existence of bound state
solutions, motivated by the analogous problem with Robin boundary conditions,
which are recovered as a limiting case. Finally, we argue that both Robin and
generalized Wentzell boundary conditions are distinguished in the sense that
they are invariant under the action of the isometry group of the AdS conformal
boundary, a condition which ensures in addition that the total flux of energy
across the boundary vanishes.
| hep-th gr-qc math-ph math.MP | we study a real massive kleingordon field in the poincare fundamental domain of the d1dimensional antide sitter ads spacetime subject to a particular choice of dynamical boundary conditions of generalized wentzell type whereby the boundary data solves a nonhomogeneous boundary kleingordon equation with the source term fixed by the normal derivative of the scalar field at the boundary this naturally defines a field in the conformal boundary of the poincare fundamental domain of ads we completely solve the equations for the bulk and boundary fields and investigate the existence of bound state solutions motivated by the analogous problem with robin boundary conditions which are recovered as a limiting case finally we argue that both robin and generalized wentzell boundary conditions are distinguished in the sense that they are invariant under the action of the isometry group of the ads conformal boundary a condition which ensures in addition that the total flux of energy across the boundary vanishes | [['we', 'study', 'a', 'real', 'massive', 'kleingordon', 'field', 'in', 'the', 'poincare', 'fundamental', 'domain', 'of', 'the', 'd1dimensional', 'antide', 'sitter', 'ads', 'spacetime', 'subject', 'to', 'a', 'particular', 'choice', 'of', 'dynamical', 'boundary', 'conditions', 'of', 'generalized', 'wentzell', 'type', 'whereby', 'the', 'boundary', 'data', 'solves', 'a', 'nonhomogeneous', 'boundary', 'kleingordon', 'equation', 'with', 'the', 'source', 'term', 'fixed', 'by', 'the', 'normal', 'derivative', 'of', 'the', 'scalar', 'field', 'at', 'the', 'boundary', 'this', 'naturally', 'defines', 'a', 'field', 'in', 'the', 'conformal', 'boundary', 'of', 'the', 'poincare', 'fundamental', 'domain', 'of', 'ads', 'we', 'completely', 'solve', 'the', 'equations', 'for', 'the', 'bulk', 'and', 'boundary', 'fields', 'and', 'investigate', 'the', 'existence', 'of', 'bound', 'state', 'solutions', 'motivated', 'by', 'the', 'analogous', 'problem', 'with', 'robin', 'boundary', 'conditions', 'which', 'are', 'recovered', 'as', 'a', 'limiting', 'case', 'finally', 'we', 'argue', 'that', 'both', 'robin', 'and', 'generalized', 'wentzell', 'boundary', 'conditions', 'are', 'distinguished', 'in', 'the', 'sense', 'that', 'they', 'are', 'invariant', 'under', 'the', 'action', 'of', 'the', 'isometry', 'group', 'of', 'the', 'ads', 'conformal', 'boundary', 'a', 'condition', 'which', 'ensures', 'in', 'addition', 'that', 'the', 'total', 'flux', 'of', 'energy', 'across', 'the', 'boundary', 'vanishes']] | [-0.20006723456369463, 0.14309244600842427, -0.0967423350151308, 0.047840870904237935, -0.11909835727197254, -0.1372530929437263, -0.027349559993595833, 0.2712612475704544, -0.23752569059609988, -0.2339514766873163, 0.18308425036846263, -0.22577821201152481, -0.1530729900974377, 0.12237614735806729, -0.0782989118393558, 0.07116098645303374, 0.044741496470442434, 0.11443376229708171, -0.10703793018507611, -0.21939788126404497, 0.458868436017044, -0.02858344792791755, 0.30142953057008187, 0.040810200217799845, 0.11117415357407799, -0.00724912961132255, 0.014112340357557982, 0.039628848658910226, -0.16801951521080524, 0.06765812269343763, 0.193750722250741, 0.02851604732572083, 0.2406991250385904, -0.4346648917776669, -0.2414846210473567, 0.0978660269693774, 0.11003688468663081, 0.061187941096070564, -0.0280839571993276, -0.31768679044470427, 0.08013690877290573, -0.06662111470452065, -0.2083623913253189, 0.01914964826291154, -0.021961801517072613, -0.05760184735813101, -0.2924578094819359, 0.12178883260000307, 0.045867622813475346, 0.012278922519106774, -0.1952353057445614, -0.02125990982048783, -0.07270839168381682, 0.08877043521541889, 0.09050003717250078, 0.039131157642977824, 0.08561421536664764, -0.16955508048954615, -0.05814581549619651, 0.35882158855059343, -0.07733394114625385, -0.3049227972396288, 0.1710990525894816, -0.17565230730992215, -0.09038714503655863, 0.07278749450602022, 0.12195750396657189, 0.17208630799843816, -0.17444492157257258, 0.20118931276837934, -0.06444408993976737, 0.07475963193377491, 0.1451804731664052, -0.0048597336948439955, 0.17166939222959765, 0.05592044886456696, 0.12130584385524842, 0.19655477698109333, -0.0016071481220898735, -0.13103986593188754, -0.42743680874630213, -0.18360588557990032, -0.1498804382214643, 0.08229382932304767, -0.15755700383153315, -0.22669039154128665, 0.3599871671669612, 0.10180059982560853, 0.15030933997642387, 0.030559422080308662, 0.18786917763293548, 0.15802372720279392, 0.043720547101639466, 0.11360404656155948, 0.20664686486154651, 0.14324385896147152, 0.12776526146580222, -0.26220664380646197, -0.06800648629825538, 0.13660350393883552] |
1,802.00284 | Dominance analysis of linear complementarity systems | The paper extends the concepts of dominance and p-dissipativity to the
non-smooth family of linear complementarity systems. Dominance generalizes
incremental stability whereas p-dissipativity generalizes incremental
passivity. The generalization aims at an interconnection theory for the design
and analysis of switching and oscillatory systems. The approach is illustrated
by a detailed study of classical electrical circuits that switch and oscillate.
| cs.SY | the paper extends the concepts of dominance and pdissipativity to the nonsmooth family of linear complementarity systems dominance generalizes incremental stability whereas pdissipativity generalizes incremental passivity the generalization aims at an interconnection theory for the design and analysis of switching and oscillatory systems the approach is illustrated by a detailed study of classical electrical circuits that switch and oscillate | [['the', 'paper', 'extends', 'the', 'concepts', 'of', 'dominance', 'and', 'pdissipativity', 'to', 'the', 'nonsmooth', 'family', 'of', 'linear', 'complementarity', 'systems', 'dominance', 'generalizes', 'incremental', 'stability', 'whereas', 'pdissipativity', 'generalizes', 'incremental', 'passivity', 'the', 'generalization', 'aims', 'at', 'an', 'interconnection', 'theory', 'for', 'the', 'design', 'and', 'analysis', 'of', 'switching', 'and', 'oscillatory', 'systems', 'the', 'approach', 'is', 'illustrated', 'by', 'a', 'detailed', 'study', 'of', 'classical', 'electrical', 'circuits', 'that', 'switch', 'and', 'oscillate']] | [-0.17844963505079872, 0.05155203441845196, -0.08182970909330291, 0.029280572821255447, -0.10060027052174535, -0.1729039897276252, 0.04437114621836563, 0.27872174824669693, -0.30649838643965494, -0.251949805913395, 0.11045197311895001, -0.25237629069178774, -0.2514112513152915, 0.18213530041669546, -0.06997708275325988, 0.050254164426996, 0.034415112620448336, -0.025040602154229163, -0.0752802433879033, -0.15951686857366248, 0.33311317892941206, 0.06108950518823245, 0.31962372787427484, 0.017851768894807288, 0.12231214404138818, 0.05211458912348015, -0.02577770674568519, 0.04970363386408344, -0.0777132427693894, 0.16666243860922886, 0.25584752177983, 0.12188018936042984, 0.29145379339165073, -0.3944525018399745, -0.20329342527609123, 0.07443402302369737, 0.11409598216414452, 0.059750475348872054, -0.0034129458495922257, -0.22827803984022976, 0.08152322089626339, -0.14870678880987198, -0.13512834572445667, -0.10487078378597896, -0.023258920007368976, 0.05393028005614484, -0.28233682215540556, 0.050037766953832226, 0.1754161834455373, 0.08597459580484786, -0.0952570164216715, -0.09724444547145251, 0.013945659058854767, 0.056353203323261256, 0.0035707993522743906, -0.01734965643028549, 0.13329025855483978, -0.07895558105226148, -0.20513859358534478, 0.31284845259608374, -0.0155049369000552, -0.12916661478709757, 0.2124847118465001, -0.03712866765757402, -0.1218505361354338, 0.08772817369256365, 0.20095828551341566, 0.12172926009812376, -0.16217822221254832, 0.08773393776643564, -0.0015552126099927384, 0.13038643640302644, 0.07202390638147399, 0.023088272252495875, 0.14647819513553068, 0.24077306276089266, 0.1394958603604321, 0.19691430733144985, 0.03570714461404765, -0.18466792664114842, -0.3083717292991647, -0.12993969274848177, -0.12122587210972581, -0.004272371365100537, -0.07242649524746332, -0.14386954145473346, 0.43598296228600175, 0.12168681080220267, 0.14212653393808164, 0.14206481219285674, 0.30466463880842193, 0.11525043521664645, 0.02358953875342482, 0.0455231739681933, 0.2570374975503798, 0.23054633006911007, 0.1431381903392704, -0.29699593824293596, 0.07898414909447495, 0.05895860312637268] |
1,802.00285 | Virtual-to-Real: Learning to Control in Visual Semantic Segmentation | Collecting training data from the physical world is usually time-consuming
and even dangerous for fragile robots, and thus, recent advances in robot
learning advocate the use of simulators as the training platform.
Unfortunately, the reality gap between synthetic and real visual data prohibits
direct migration of the models trained in virtual worlds to the real world.
This paper proposes a modular architecture for tackling the virtual-to-real
problem. The proposed architecture separates the learning model into a
perception module and a control policy module, and uses semantic image
segmentation as the meta representation for relating these two modules. The
perception module translates the perceived RGB image to semantic image
segmentation. The control policy module is implemented as a deep reinforcement
learning agent, which performs actions based on the translated image
segmentation. Our architecture is evaluated in an obstacle avoidance task and a
target following task. Experimental results show that our architecture
significantly outperforms all of the baseline methods in both virtual and real
environments, and demonstrates a faster learning curve than them. We also
present a detailed analysis for a variety of variant configurations, and
validate the transferability of our modular architecture.
| cs.CV cs.RO cs.SY | collecting training data from the physical world is usually timeconsuming and even dangerous for fragile robots and thus recent advances in robot learning advocate the use of simulators as the training platform unfortunately the reality gap between synthetic and real visual data prohibits direct migration of the models trained in virtual worlds to the real world this paper proposes a modular architecture for tackling the virtualtoreal problem the proposed architecture separates the learning model into a perception module and a control policy module and uses semantic image segmentation as the meta representation for relating these two modules the perception module translates the perceived rgb image to semantic image segmentation the control policy module is implemented as a deep reinforcement learning agent which performs actions based on the translated image segmentation our architecture is evaluated in an obstacle avoidance task and a target following task experimental results show that our architecture significantly outperforms all of the baseline methods in both virtual and real environments and demonstrates a faster learning curve than them we also present a detailed analysis for a variety of variant configurations and validate the transferability of our modular architecture | [['collecting', 'training', 'data', 'from', 'the', 'physical', 'world', 'is', 'usually', 'timeconsuming', 'and', 'even', 'dangerous', 'for', 'fragile', 'robots', 'and', 'thus', 'recent', 'advances', 'in', 'robot', 'learning', 'advocate', 'the', 'use', 'of', 'simulators', 'as', 'the', 'training', 'platform', 'unfortunately', 'the', 'reality', 'gap', 'between', 'synthetic', 'and', 'real', 'visual', 'data', 'prohibits', 'direct', 'migration', 'of', 'the', 'models', 'trained', 'in', 'virtual', 'worlds', 'to', 'the', 'real', 'world', 'this', 'paper', 'proposes', 'a', 'modular', 'architecture', 'for', 'tackling', 'the', 'virtualtoreal', 'problem', 'the', 'proposed', 'architecture', 'separates', 'the', 'learning', 'model', 'into', 'a', 'perception', 'module', 'and', 'a', 'control', 'policy', 'module', 'and', 'uses', 'semantic', 'image', 'segmentation', 'as', 'the', 'meta', 'representation', 'for', 'relating', 'these', 'two', 'modules', 'the', 'perception', 'module', 'translates', 'the', 'perceived', 'rgb', 'image', 'to', 'semantic', 'image', 'segmentation', 'the', 'control', 'policy', 'module', 'is', 'implemented', 'as', 'a', 'deep', 'reinforcement', 'learning', 'agent', 'which', 'performs', 'actions', 'based', 'on', 'the', 'translated', 'image', 'segmentation', 'our', 'architecture', 'is', 'evaluated', 'in', 'an', 'obstacle', 'avoidance', 'task', 'and', 'a', 'target', 'following', 'task', 'experimental', 'results', 'show', 'that', 'our', 'architecture', 'significantly', 'outperforms', 'all', 'of', 'the', 'baseline', 'methods', 'in', 'both', 'virtual', 'and', 'real', 'environments', 'and', 'demonstrates', 'a', 'faster', 'learning', 'curve', 'than', 'them', 'we', 'also', 'present', 'a', 'detailed', 'analysis', 'for', 'a', 'variety', 'of', 'variant', 'configurations', 'and', 'validate', 'the', 'transferability', 'of', 'our', 'modular', 'architecture']] | [-0.06907242017455006, -0.02698113285058705, -0.09156195158751583, 0.05644353383257495, -0.11978567727645369, -0.17101018222441014, 0.033885154672469456, 0.44412208658299945, -0.26401205785376464, -0.3404342812829112, 0.07320662487396284, -0.21581996649038046, -0.2175270343248389, 0.22772566545387044, -0.15610246874980235, 0.08022072079995843, 0.17799143226706962, 0.04845414788670544, -0.027411920571926443, -0.24966667459168668, 0.3277486747351328, 0.011229970883639332, 0.357536881402331, 0.029684401435262867, 0.16248984196296845, 0.0105723600730447, -0.01853910925075118, -0.05122487653708575, -0.005326128083374657, 0.1933812906187469, 0.3364823805372955, 0.2343186683732232, 0.31364322208897455, -0.41902970962814595, -0.19160670836235544, 0.07678075198476252, 0.14005936295602864, 0.06573467937874068, -0.054410946768046795, -0.3766648376948739, 0.06184576183287917, -0.18496814722219776, 0.009553095002315546, -0.12196593464499242, -0.008479570028813261, -0.06977400607674529, -0.2967967832038228, -0.03684649725852834, 0.0595124897786024, 0.1024559977072242, -0.1097165654805538, -0.09579955336368201, 0.02513739965047295, 0.19242720196366703, -0.01964693575129403, 0.06541157161914989, 0.1981904063422821, -0.21037021618409965, -0.16213426555163765, 0.3864644818204014, -0.007863736289053984, -0.20674389550756467, 0.2199237925502913, -0.00819469444441462, -0.1244612575398366, 0.0817388663387024, 0.21101767641712765, 0.10516141108727377, -0.13688986307304157, 0.030495434610700037, -0.04156278139592982, 0.1640472966099256, 0.004397706753623329, -0.056244575145262245, 0.17126889921001795, 0.3080425645763937, 0.03699915208394247, 0.14064106078891966, -0.11852700928376228, -0.09295321903436592, -0.2368239219270962, -0.1583663914034045, -0.1889300078993026, -0.05178816802983515, -0.10312351436012633, -0.1407380039252243, 0.38865976986034134, 0.23168853671829168, 0.214265318187934, 0.14085463136985996, 0.40985318349772376, -0.011263250861022818, 0.1422505751840378, 0.08289156039551783, 0.1730525875120963, -0.02212986204601628, 0.16363480052065202, -0.16951850502580207, 0.09260928165841553, 0.05232366677741275] |
1,802.00286 | Closed sets with the Kakeya property | We say that a planar set $A$ has the Kakeya property if there exist two
different positions of $A$ such that $A$ can be continuously moved from the
first position to the second within a set of arbitrarily small area. We prove
that if $A$ is closed and has the Kakeya property, then the union of the
nontrivial connected components of $A$ can be covered by a null set which is
either the union of parallel lines or the union of concentric circles. In
particular, if $A$ is closed, connected and has the Kakeya property, then $A$
can be covered by a line or a circle.
| math.MG math.CA | we say that a planar set a has the kakeya property if there exist two different positions of a such that a can be continuously moved from the first position to the second within a set of arbitrarily small area we prove that if a is closed and has the kakeya property then the union of the nontrivial connected components of a can be covered by a null set which is either the union of parallel lines or the union of concentric circles in particular if a is closed connected and has the kakeya property then a can be covered by a line or a circle | [['we', 'say', 'that', 'a', 'planar', 'set', 'a', 'has', 'the', 'kakeya', 'property', 'if', 'there', 'exist', 'two', 'different', 'positions', 'of', 'a', 'such', 'that', 'a', 'can', 'be', 'continuously', 'moved', 'from', 'the', 'first', 'position', 'to', 'the', 'second', 'within', 'a', 'set', 'of', 'arbitrarily', 'small', 'area', 'we', 'prove', 'that', 'if', 'a', 'is', 'closed', 'and', 'has', 'the', 'kakeya', 'property', 'then', 'the', 'union', 'of', 'the', 'nontrivial', 'connected', 'components', 'of', 'a', 'can', 'be', 'covered', 'by', 'a', 'null', 'set', 'which', 'is', 'either', 'the', 'union', 'of', 'parallel', 'lines', 'or', 'the', 'union', 'of', 'concentric', 'circles', 'in', 'particular', 'if', 'a', 'is', 'closed', 'connected', 'and', 'has', 'the', 'kakeya', 'property', 'then', 'a', 'can', 'be', 'covered', 'by', 'a', 'line', 'or', 'a', 'circle']] | [-0.16605469328790623, 0.13982406034538486, -0.08860149907106359, -0.0020822160976130587, -0.06680503840786668, -0.12536469946246384, 0.056002661950429376, 0.3562656811192491, -0.3048548836015024, -0.2018462162613671, 0.1633734233174385, -0.30444085923076236, -0.0823467161444912, 0.19767170077418242, -0.08059523617771876, -0.026291329826597334, 0.0754247959703207, 0.11454900977078755, -0.03875092675970902, -0.2385145736471662, 0.3553805059560065, -0.10233014790376402, 0.22149990949744605, 0.07888436121514665, 0.1119042995148602, -0.03472952850004834, 0.056621805643926396, 0.1992690370259982, -0.09050882771881111, 0.1320070712256052, 0.22757969752727253, 0.16463465867168708, 0.2936883499178122, -0.384216472629528, -0.17740502505440195, 0.19543047544528852, 0.15513502041378743, 0.03628298926127653, -0.016022060587035737, -0.2523795230806155, 0.13251034241556278, -0.10257763348800956, -0.17139555829717726, 0.02909185834018127, 0.06141045990066146, 0.04186997940886836, -0.2563316537757, -0.053233179606427, 0.12008036084402844, 0.029963293095242302, 0.0025087320333663024, -0.03205068371662835, -0.05725765265392596, 0.1317939492390614, -0.02155818396362142, 0.09349415159151661, 0.062393101578016044, -0.03500008983164147, -0.09639184381527263, 0.37997927503519746, -0.06276733907958809, -0.2500690119516737, 0.1428031707742638, -0.1632299499085419, -0.12857961221949532, 0.14252851929357452, 0.12679816228513308, 0.10376863738627366, -0.12464954226084475, 0.15566136585746207, -0.16161718929432473, 0.1503019905297683, 0.13476711431878424, -0.03990254330422448, 0.2620758363924358, 0.12019817573062302, 0.13371340299341203, 0.16063721702853656, -0.08898000307556875, -0.003789770803502146, -0.3372565444014123, -0.1638496784792053, -0.2299536346624834, 0.08888941964371798, -0.072095887102615, -0.2220225996900139, 0.40557855041368146, 0.032491288376853465, 0.24487559212248702, 0.026099578223744722, 0.2739314301958624, 0.08949313700824585, 0.10403073895371186, 0.13347771255527888, 0.21389758156366506, 0.07942353873865081, -0.047577616178764486, -0.07436457390535649, 0.05194133825441998, 0.08476586925867453] |
1,802.00287 | The non-archimedean SYZ fibration | We construct non-archimedean SYZ fibrations for maximally degenerate
Calabi-Yau varieties, and we show that they are affinoid torus fibrations away
from a codimension two subset of the base. This confirms a prediction by
Kontsevich and Soibelman. We also give an explicit description of the induced
integral affine structure on the base of the SYZ fibration. Our main technical
tool is a study of the structure of minimal dlt-models along one-dimensional
strata.
| math.AG | we construct nonarchimedean syz fibrations for maximally degenerate calabiyau varieties and we show that they are affinoid torus fibrations away from a codimension two subset of the base this confirms a prediction by kontsevich and soibelman we also give an explicit description of the induced integral affine structure on the base of the syz fibration our main technical tool is a study of the structure of minimal dltmodels along onedimensional strata | [['we', 'construct', 'nonarchimedean', 'syz', 'fibrations', 'for', 'maximally', 'degenerate', 'calabiyau', 'varieties', 'and', 'we', 'show', 'that', 'they', 'are', 'affinoid', 'torus', 'fibrations', 'away', 'from', 'a', 'codimension', 'two', 'subset', 'of', 'the', 'base', 'this', 'confirms', 'a', 'prediction', 'by', 'kontsevich', 'and', 'soibelman', 'we', 'also', 'give', 'an', 'explicit', 'description', 'of', 'the', 'induced', 'integral', 'affine', 'structure', 'on', 'the', 'base', 'of', 'the', 'syz', 'fibration', 'our', 'main', 'technical', 'tool', 'is', 'a', 'study', 'of', 'the', 'structure', 'of', 'minimal', 'dltmodels', 'along', 'onedimensional', 'strata']] | [-0.2220509811703648, -0.0038566814417468516, -0.1305105542464714, 0.122091540108834, -0.11429930398506778, -0.11844037234384035, 0.0014422563569886345, 0.33622141749864176, -0.30718806580906466, -0.18198374739981124, 0.10111475215692606, -0.23147737365881246, -0.18716625729575753, 0.20723957360855172, -0.20427970512370977, -0.07033463912417313, 0.05298068403332893, 0.02473890713549086, -0.10463868618244306, -0.2936780523176172, 0.4840720103787524, -0.022036379522510936, 0.25243178962596824, 0.06636254053030695, 0.13371560954089676, 0.011819850566930004, -0.003788269776850939, -0.04473278355851237, -0.1571435853345195, 0.1882771774594273, 0.3054442494841559, 0.05847549476394696, 0.1301237261521497, -0.4218102112678545, -0.15668316268628196, 0.13491482876374253, 0.10616801734348492, 0.06943318098118263, -0.00017667784455365369, -0.28204920385032894, 0.06292216612824372, -0.1602847340583269, -0.24067129626471018, -0.11169649021966117, -0.011892963207459875, 0.0229998638487554, -0.18461663129772724, -0.08166224085434806, 0.1151763586859618, 0.15831338090689054, -0.08785009917670063, -0.08885239217696446, -0.13642239802450473, 0.06151583269903702, 0.023039436430138137, 0.08025396094058773, 0.08614018627974604, -0.10618241226766259, -0.11114209142563465, 0.3118015353301806, -0.047418433188327724, -0.227122608492417, 0.10058985160929816, -0.11823427209497563, -0.17946927460642265, 0.15865370647183485, 0.07882518499557462, 0.18634056797517198, -0.01865014556429482, 0.17481115948508627, -0.15869486149666565, 0.07059095713068797, 0.07377195505292287, -0.04584297014267317, 0.18621782206797174, 0.1359661505956735, 0.07956771484709212, 0.14891992873911347, -0.028153666843926266, -0.07816363405436277, -0.43432274335729226, -0.20191946988260107, -0.057506193360313776, 0.2171563790179789, -0.10340389390434471, -0.16474423777014766, 0.4477887062621968, 0.027434619862054074, 0.23417405277224523, 0.09962775112819924, 0.24569909692342792, -0.018808473778023783, 0.01323607981737171, 0.048885894634960486, 0.15283927333408168, 0.1903572116745636, -0.05761917924974114, -0.1222833307493212, -0.08019786730541714, 0.24848060860697713] |
1,802.00288 | Topological Weyl semimetals in $\rm Bi$$_{1-x}$$\rm Sb$$_{x}$ alloys | We have investigated the Weyl semimetal (WSM) phases in bismuth antimony
($\rm Bi$$_{1-x}$$\rm Sb$$_{x}$) alloys by the combination of atomic
composition and arrangement. Via first principles calculations, we have found
two WSM states with the Sb concentration of $x=0.5$ and $x=0.83$ with specific
inversion symmetry broken elemental arrangement. The Weyl points are close to
the Fermi level in both of these two WSM states. Therefore, it has a good
opportunity to obtain Weyl points in Bi-Sb alloy. The WSM phase provides a
reasonable explanation for the current transport study of BiSb alloy with the
violation of Ohm's law [Dongwoo Shin, et al., Nature Materials 16, 1096
(2017)]. This work shows that the topological phases in Bi-Sb alloys depend on
both elemental composition and their specific arrangement.
| cond-mat.mtrl-sci | we have investigated the weyl semimetal wsm phases in bismuth antimony rm bi_1xrm sb_x alloys by the combination of atomic composition and arrangement via first principles calculations we have found two wsm states with the sb concentration of x05 and x083 with specific inversion symmetry broken elemental arrangement the weyl points are close to the fermi level in both of these two wsm states therefore it has a good opportunity to obtain weyl points in bisb alloy the wsm phase provides a reasonable explanation for the current transport study of bisb alloy with the violation of ohms law dongwoo shin et al nature materials 16 1096 2017 this work shows that the topological phases in bisb alloys depend on both elemental composition and their specific arrangement | [['we', 'have', 'investigated', 'the', 'weyl', 'semimetal', 'wsm', 'phases', 'in', 'bismuth', 'antimony', 'rm', 'bi_1xrm', 'sb_x', 'alloys', 'by', 'the', 'combination', 'of', 'atomic', 'composition', 'and', 'arrangement', 'via', 'first', 'principles', 'calculations', 'we', 'have', 'found', 'two', 'wsm', 'states', 'with', 'the', 'sb', 'concentration', 'of', 'x05', 'and', 'x083', 'with', 'specific', 'inversion', 'symmetry', 'broken', 'elemental', 'arrangement', 'the', 'weyl', 'points', 'are', 'close', 'to', 'the', 'fermi', 'level', 'in', 'both', 'of', 'these', 'two', 'wsm', 'states', 'therefore', 'it', 'has', 'a', 'good', 'opportunity', 'to', 'obtain', 'weyl', 'points', 'in', 'bisb', 'alloy', 'the', 'wsm', 'phase', 'provides', 'a', 'reasonable', 'explanation', 'for', 'the', 'current', 'transport', 'study', 'of', 'bisb', 'alloy', 'with', 'the', 'violation', 'of', 'ohms', 'law', 'dongwoo', 'shin', 'et', 'al', 'nature', 'materials', '16', '1096', '2017', 'this', 'work', 'shows', 'that', 'the', 'topological', 'phases', 'in', 'bisb', 'alloys', 'depend', 'on', 'both', 'elemental', 'composition', 'and', 'their', 'specific', 'arrangement']] | [-0.17459635238485702, 0.17152773801878582, -0.05184475871062547, -0.027873635105979552, -0.034933086626850005, -0.17337256424190078, 0.1511305093604949, 0.37318067909142033, -0.2268310293868245, -0.3410546120072975, -0.02671770055656184, -0.3290995216974225, -0.15703722091055797, 0.1031235321329479, 0.017143135081182738, 0.05787692653954212, -0.07437614233187231, -0.1012043320329585, -0.15267899923301378, -0.2591859188052963, 0.28672244735291136, 0.030572159177638957, 0.35031097843388065, 0.015792951787455527, -0.0042973111076356815, -0.047911524524545814, 0.11618273344389368, 0.02494584175864937, -0.15078079470913508, 0.03253920573538902, 0.2503150112308623, -0.10193913810520021, 0.10057917979286342, -0.42816263822014217, -0.2001451950226376, 0.014366827111263743, 0.08175731138192636, 0.06813342911649312, -0.1473819448309187, -0.3018969061830249, 0.07877517696164671, -0.15982234263105594, -0.1171428053315393, -0.10543132654093511, 0.01113743211722887, -0.01895286343022265, -0.17401202478003305, 0.1021500438161683, 0.05799755964764073, 0.13415653773598502, -0.14393454208420436, -0.1613539880462235, -0.11161543749898795, 0.046559820577624395, 0.02885427297241833, -0.011611935776824392, 0.0995266949652969, -0.050589848284945504, -0.12342762552797183, 0.4346025201041618, 0.0007031208751570495, -0.07146645619793505, 0.19014031314443736, -0.18940741082555118, -0.1521727308272155, 0.13358364260343256, 0.07971003119305127, 0.062174377563425254, -0.12421532840941285, 0.12818314567004085, -0.05518334362365794, 0.13923168788877788, 0.02026113724626112, 0.05873131636362217, 0.26342127211086575, 0.15737351470199398, 0.006571414572240204, 0.10506212645683621, -0.11659321810699022, -0.008381100767005815, -0.2449410156591139, -0.2730716121398279, -0.24367580599663016, 0.04930639034900509, -0.060925147232917316, -0.19752856752010764, 0.4084396102603097, 0.09170142425816757, 0.19304497616144173, -0.0995752407069944, 0.14681037381810488, 0.08070652069310184, 0.054567937996833904, 0.023469695974080287, 0.26710183425714856, 0.16636464286683372, 0.13072561296313756, -0.2572085872658941, 0.11068227731805967, 0.08104087245940673] |
1,802.00289 | Moduli of Stokes torsors and singularities of differential equations | Let M be a meromorphic connection with poles along a smooth divisor D in a
smooth algebraic variety. Let Sol M be the solution complex of M. We prove that
the good formal decomposition locus of M coincides with the locus where the
restrictions to D of Sol M and Sol End M are local systems. By contrast to the
very different natures of these loci (the first one is defined via algebra, the
second one is defined via analysis), the proof of their coincidence is
geometric. It relies on the moduli of Stokes torsors.
| math.AG | let m be a meromorphic connection with poles along a smooth divisor d in a smooth algebraic variety let sol m be the solution complex of m we prove that the good formal decomposition locus of m coincides with the locus where the restrictions to d of sol m and sol end m are local systems by contrast to the very different natures of these loci the first one is defined via algebra the second one is defined via analysis the proof of their coincidence is geometric it relies on the moduli of stokes torsors | [['let', 'm', 'be', 'a', 'meromorphic', 'connection', 'with', 'poles', 'along', 'a', 'smooth', 'divisor', 'd', 'in', 'a', 'smooth', 'algebraic', 'variety', 'let', 'sol', 'm', 'be', 'the', 'solution', 'complex', 'of', 'm', 'we', 'prove', 'that', 'the', 'good', 'formal', 'decomposition', 'locus', 'of', 'm', 'coincides', 'with', 'the', 'locus', 'where', 'the', 'restrictions', 'to', 'd', 'of', 'sol', 'm', 'and', 'sol', 'end', 'm', 'are', 'local', 'systems', 'by', 'contrast', 'to', 'the', 'very', 'different', 'natures', 'of', 'these', 'loci', 'the', 'first', 'one', 'is', 'defined', 'via', 'algebra', 'the', 'second', 'one', 'is', 'defined', 'via', 'analysis', 'the', 'proof', 'of', 'their', 'coincidence', 'is', 'geometric', 'it', 'relies', 'on', 'the', 'moduli', 'of', 'stokes', 'torsors']] | [-0.23556322147947198, 0.04623519924322241, -0.1374199171403521, 0.0007120289484431085, -0.11013957290959202, -0.17913311380206753, 0.004816777337538569, 0.2827266998491005, -0.29472039887975704, -0.24722126885072182, 0.1142722896553766, -0.2104964043749006, -0.14726422322227767, 0.19657565148939427, -0.11705970769061853, -0.03376887043643939, 0.031653010649116416, 0.06477212612762263, -0.0804613140460692, -0.2566312196517461, 0.42066310377497423, -0.042242195633681194, 0.20062825381755828, 0.014687358623517579, 0.10401128267771319, -0.004883120201626106, -0.027371661110143913, 0.0017601666824990198, -0.14617998505196547, 0.14864128027601461, 0.29378851223737, 0.087908553403165, 0.21100406535950147, -0.3572659070358465, -0.15338824139417787, 0.18174151393928026, 0.14295449072102967, -0.03806269720784928, 0.04679769755855791, -0.22119636267031495, 0.14570224826273165, -0.07967119191430116, -0.1771984776334935, -0.041980829913365214, 0.08505117122427021, 0.06043721210995787, -0.21902355287027986, -0.03088344026749071, 0.05835032339550947, 0.12806345321924278, -0.024329558132510438, -0.11059224545637047, -0.13148777915875576, 0.0659278095307711, 0.005831784835869544, 0.10449424251227786, 0.1081862797911622, -0.05007981819247729, -0.05071017263751281, 0.3502095726563742, -0.09424811209502973, -0.2386993987216173, 0.1974373974249159, -0.1737010556910383, -0.09999860337396202, 0.1537105513540538, 0.08643180251513657, 0.18537940939790323, -0.03904588978835627, 0.20813230902973662, -0.09382213628115622, 0.09417462666690546, 0.10148614224928774, -0.057396257899113394, 0.17055974548167893, 0.13896422820459856, 0.08091998795341504, 0.08713201942951664, -0.03315278430665402, -0.03461894241994933, -0.35292687954773244, -0.19457206336389246, -0.17505478329074226, 0.13789125225678284, -0.12629944736759888, -0.15310966646004665, 0.3630356585508899, -0.0008452636728945531, 0.27855280123552995, 0.0719190640571086, 0.2330766061026799, 0.0753518174059297, 0.022320874028005883, 0.05998877368769363, 0.1392433280811498, 0.22806716410345154, 0.021172379599393984, -0.18755442379318227, 0.008229552978943837, 0.15386486319138815] |
1,802.0029 | The Kakeya problem for circular arcs | We prove that if a circular arc has angle short enough, then it can be
continuously moved to any prescribed position within a set of arbitrarily small
area.
| math.MG math.CA | we prove that if a circular arc has angle short enough then it can be continuously moved to any prescribed position within a set of arbitrarily small area | [['we', 'prove', 'that', 'if', 'a', 'circular', 'arc', 'has', 'angle', 'short', 'enough', 'then', 'it', 'can', 'be', 'continuously', 'moved', 'to', 'any', 'prescribed', 'position', 'within', 'a', 'set', 'of', 'arbitrarily', 'small', 'area']] | [-0.1658232148204531, 0.2259706565445023, -0.13682061166036874, 0.009492915755669986, -0.09225246842418398, -0.21850008627266757, 0.08244738642991122, 0.4454104373497622, -0.35383477680651204, -0.2717294461160366, 0.1539142098211284, -0.24577681766822934, -0.07095435860433749, 0.21462372916617564, -0.11557251939458572, 0.027622702627143423, 0.1275748239297952, 0.1363179207380329, -0.051366524396663796, -0.20777621572571142, 0.22967471747376425, -0.02103620002578412, 0.14400790265894362, 0.1095863903506792, 0.15567526791710407, 0.013130875420756638, 0.09861622942012868, 0.19920981099962123, -0.11091499337557512, 0.08408802285391305, 0.2471300995675847, 0.09043419569830544, 0.3182032738945314, -0.3954997024099742, -0.15489702432283334, 0.17310061102866062, 0.15037089527218736, 0.11034688030901764, -0.004271247723538961, -0.24731525825336576, 0.18911007319443993, -0.1620091960649006, -0.25478756974916905, -0.02275853806973568, 0.14258529565164021, 0.05194228425222848, -0.21052852186507412, -0.09982037081915353, 0.047157830957855494, -0.015408210090494581, 0.004525244934484363, 0.01425967674835452, -0.03948922644069951, 0.1490750387976212, 0.02076739749671625, 0.158976476306894, 0.12128286876915288, -0.02940654569621464, -0.0001968281909025141, 0.33020908917699543, -0.06542662684140461, -0.26674507305558237, 0.10314818175226849, -0.2674023966704096, -0.070837805413508, 0.17511269503406116, 0.16447920754684933, 0.09751133381256036, -0.1059033952520362, 0.11456660814915917, -0.12040745307292257, 0.24056605821741478, 0.16549437004973047, -0.04343965501591031, 0.30865021236240864, 0.08425324430157032, 0.18774268816092185, 0.12262854425352998, -0.18255709449294955, -0.002022947442518281, -0.3391868167423776, -0.08222604755844388, -0.21313934507114546, 0.10102042417773711, -0.05705534896281149, -0.17412395432724484, 0.345043341363115, 0.05605624528003058, 0.25743095739744604, 0.09875258281161743, 0.2502807996767972, 0.08007914888574826, 0.11353578757760781, 0.15802440549513058, 0.22962485613035305, 0.03754262942155557, 0.022553184003170048, -0.07832291680720768, 0.11667377822699823, 0.025893264134148403] |
1,802.00291 | Strong Eulerian triples | We prove that there exist infinitely many rationals a, b and c with the
property that a^2-1, b^2-1, c^2-1, ab-1, ac-1 and bc-1 are all perfect squares.
This provides a solution to a variant of the problem studied by Diophantus and
Euler.
| math.NT | we prove that there exist infinitely many rationals a b and c with the property that a21 b21 c21 ab1 ac1 and bc1 are all perfect squares this provides a solution to a variant of the problem studied by diophantus and euler | [['we', 'prove', 'that', 'there', 'exist', 'infinitely', 'many', 'rationals', 'a', 'b', 'and', 'c', 'with', 'the', 'property', 'that', 'a21', 'b21', 'c21', 'ab1', 'ac1', 'and', 'bc1', 'are', 'all', 'perfect', 'squares', 'this', 'provides', 'a', 'solution', 'to', 'a', 'variant', 'of', 'the', 'problem', 'studied', 'by', 'diophantus', 'and', 'euler']] | [-0.20722357605007433, 0.0852166226887632, -0.06604709397513597, 0.057217278867028654, -0.03196450618893972, -0.20640833632621383, 0.004994070822639125, 0.34049895671861513, -0.2958694760731998, -0.22030395375830786, 0.11571115821910401, -0.31235696565515053, -0.12505003172416418, 0.15928570433918918, -0.06602006316894576, 0.04794196365401149, 0.07661588742796864, 0.0206125535381337, -0.022389579237261342, -0.2868326311664922, 0.2590115828705685, -0.13472694094248472, 0.14420544605569116, 0.06783577169491244, 0.1587151413772344, 0.014710306810835997, 0.07791109888681344, 0.05873299645082582, -0.1801165385200182, 0.06833823153560627, 0.2701416720769235, 0.15177313632531358, 0.28402798715424504, -0.3135591469084223, -0.12496390520218051, 0.1928144893387244, 0.10944584347972912, 0.024253898810240485, -0.07308985475295533, -0.18963201390579343, 0.2064267663046762, -0.14843464301278195, -0.15692318311803752, -0.03585690991686923, 0.07890732342466003, 0.020071827762876637, -0.28958745899477173, 0.002562921250327712, 0.1506437961721704, 0.07840474127303987, -0.026471961634732515, -0.1692863033552255, 0.005185674521185103, 0.0056526203573282275, 0.03553378280429613, 0.06589056531499539, -0.03358419517809082, -0.08923005183515627, -0.10766548417519689, 0.37796517958243686, -0.0704263066207724, -0.19721650868831647, 0.1559422791913329, -0.11046820550247849, -0.13450065207490253, 0.13612913361950113, 0.026189236458213555, 0.1254937506635629, -0.0963359573146417, 0.20247771552835947, -0.18651118139608852, 0.14183524698906003, 0.1418444957207179, -0.03366275071831686, 0.1102084650525025, 0.04193788386016552, 0.11643832130219034, 0.10007131438414078, 0.008561086818753253, -0.03817102460501095, -0.3030597654038242, -0.20225806371308863, -0.11785664671887866, 0.12729156427528887, -0.06115651131681045, -0.21002711740688287, 0.30401479632460643, 0.08681012458345365, 0.1923060788817349, 0.09256783076783731, 0.1954390491758074, 0.06252643723218214, 0.013209112397383987, 0.15093219258068574, 0.15551270203044018, 0.14244337537370266, 0.048942815290675276, -0.13979085673262098, 0.020713709782631623, 0.1295397628897003] |
1,802.00292 | Fast-spinning black holes inferred from symmetrically limb-brightened
radio jets | This paper theoretically investigates the relations between the structure of
relativistic jets and produced synchrotron images, by using a steady
axisymmetric force-free jet model. We especially focus on the limb-brightened
jets that are largely symmetric to the jet axes and observed in some active
galactic nuclei such as M87, Mrk~501, Cyg~A, and 3C84. We find that
symmetrically limb-brightened images can be produced when magnetic field lines
of the jet penetrate a fast-spinning black hole as motivated by the
Blandford-Znajek mechanism. On the other hand, jets with magnetic field lines
that pass through a slowly spinning black hole or the Keplerian accretion disk
produce highly asymmetric radio images. In addition, the edge of a counter jet
tends to be luminous in the accretion-disk model even for rather small viewing
angles, which may be problematic for some observed jets. We also suggest that
the site of particle accelerations in relativistic jets can be constrained by
fitting the radio images to observations. This kind of study focusing on the
jet images far away from the central engine is complimentary to those
concentrating directly on the innermost region with upcoming data of the Event
Horizon Telescope.
| astro-ph.HE astro-ph.GA | this paper theoretically investigates the relations between the structure of relativistic jets and produced synchrotron images by using a steady axisymmetric forcefree jet model we especially focus on the limbbrightened jets that are largely symmetric to the jet axes and observed in some active galactic nuclei such as m87 mrk501 cyga and 3c84 we find that symmetrically limbbrightened images can be produced when magnetic field lines of the jet penetrate a fastspinning black hole as motivated by the blandfordznajek mechanism on the other hand jets with magnetic field lines that pass through a slowly spinning black hole or the keplerian accretion disk produce highly asymmetric radio images in addition the edge of a counter jet tends to be luminous in the accretiondisk model even for rather small viewing angles which may be problematic for some observed jets we also suggest that the site of particle accelerations in relativistic jets can be constrained by fitting the radio images to observations this kind of study focusing on the jet images far away from the central engine is complimentary to those concentrating directly on the innermost region with upcoming data of the event horizon telescope | [['this', 'paper', 'theoretically', 'investigates', 'the', 'relations', 'between', 'the', 'structure', 'of', 'relativistic', 'jets', 'and', 'produced', 'synchrotron', 'images', 'by', 'using', 'a', 'steady', 'axisymmetric', 'forcefree', 'jet', 'model', 'we', 'especially', 'focus', 'on', 'the', 'limbbrightened', 'jets', 'that', 'are', 'largely', 'symmetric', 'to', 'the', 'jet', 'axes', 'and', 'observed', 'in', 'some', 'active', 'galactic', 'nuclei', 'such', 'as', 'm87', 'mrk501', 'cyga', 'and', '3c84', 'we', 'find', 'that', 'symmetrically', 'limbbrightened', 'images', 'can', 'be', 'produced', 'when', 'magnetic', 'field', 'lines', 'of', 'the', 'jet', 'penetrate', 'a', 'fastspinning', 'black', 'hole', 'as', 'motivated', 'by', 'the', 'blandfordznajek', 'mechanism', 'on', 'the', 'other', 'hand', 'jets', 'with', 'magnetic', 'field', 'lines', 'that', 'pass', 'through', 'a', 'slowly', 'spinning', 'black', 'hole', 'or', 'the', 'keplerian', 'accretion', 'disk', 'produce', 'highly', 'asymmetric', 'radio', 'images', 'in', 'addition', 'the', 'edge', 'of', 'a', 'counter', 'jet', 'tends', 'to', 'be', 'luminous', 'in', 'the', 'accretiondisk', 'model', 'even', 'for', 'rather', 'small', 'viewing', 'angles', 'which', 'may', 'be', 'problematic', 'for', 'some', 'observed', 'jets', 'we', 'also', 'suggest', 'that', 'the', 'site', 'of', 'particle', 'accelerations', 'in', 'relativistic', 'jets', 'can', 'be', 'constrained', 'by', 'fitting', 'the', 'radio', 'images', 'to', 'observations', 'this', 'kind', 'of', 'study', 'focusing', 'on', 'the', 'jet', 'images', 'far', 'away', 'from', 'the', 'central', 'engine', 'is', 'complimentary', 'to', 'those', 'concentrating', 'directly', 'on', 'the', 'innermost', 'region', 'with', 'upcoming', 'data', 'of', 'the', 'event', 'horizon', 'telescope']] | [-0.09163478142655021, 0.12986675159839903, -0.059597654494881164, 0.14441627949288516, -0.13544963281333486, -0.13090947024397434, -0.019002749523055296, 0.44243996948276826, -0.21807741225058339, -0.31136494335299114, 0.0998281763478899, -0.2703300484350068, -0.005311431569237438, 0.22486694728211956, -0.016136015641182437, -0.03384060827108266, 0.06967468070188118, -0.05703801604436408, -0.021686266149279626, -0.12577231350282927, 0.34207805794181, 0.1280118369531491, 0.18511039048618594, -0.0291182411607862, 0.0626550976653871, -0.05505993087527328, -0.014351098995694783, 0.06660474283152616, -0.06596243954175249, 0.053830066117427876, 0.2024406276265993, 0.1038903132671032, 0.17341905848861547, -0.44465934806893437, -0.21274591673345972, 0.04382546957648062, 0.19004522556443917, 0.058708862656774975, -0.08259504003613621, -0.2756511806973612, 0.07066472986114519, -0.20743447945194796, -0.15382635752632068, 0.03543909656673826, 0.006561276942969383, 0.029488551416385587, -0.21881594849142114, 0.08345944520938746, 0.0693274771644434, 0.023755954723580892, -0.07605281860277505, -0.02822025195593063, -0.07504947340488921, 0.051415688317562866, 0.139639364967503, 0.09013708058320453, 0.2309141910649563, -0.18219448187198314, -0.1253635426379828, 0.38717354839930984, -0.0036548353604855337, -0.11104514645851407, 0.20174898656758025, -0.27423134348501516, -0.1413961005694579, 0.17722686343577676, 0.2143476798311266, 0.16666890911182575, -0.11584511144077271, 0.00019334553508087993, -0.0887010174118353, 0.13928701118590475, 0.046962804570599065, 0.014741148226723778, 0.34439273586213903, 0.09303581337834567, -0.0035066909189652943, 0.1684898623342733, -0.23217634067636628, -0.04506301169444597, -0.27719927592085997, -0.07661640741594175, -0.1395581293246509, 0.08510158648007399, -0.09365699700720143, -0.12464929664257154, 0.36189583126280006, 0.0932466293653444, 0.2429000088086849, -0.03543246528609163, 0.33293453353354757, 0.05063032233936429, 0.08085610389621704, 0.18094905022487864, 0.376423039477555, 0.10394204931372669, 0.12757998545951557, -0.19555139803834728, 0.050395040239539016, 0.0430782480965032] |
1,802.00293 | Layout considerations for a future electron plasma research accelerator
facility EuPRAXIA | The Horizon 2020 Project EuPRAXIA (European Plasma Research Accelerator with
eXcellence In Applications) is preparing a conceptual design for a highly
compact and cost-effective European facility with multi-GeV electron beams
using plasma as the acceleration medium. The design includes two user areas:
one for FEL science and one for High Energy Physics (HEP) detector development
and other pilot applications. The accelerator facility will be based on a laser
and/or a beam driven plasma acceleration approach. This contribution introduces
layout considerations of the future plasma accelerator facilities in the
context of EuPRAXIA. It compares conventional and novel plasma accelerator
facility requirements and presents potential layouts for the future site.
Together with performance analysis, cost effectiveness, and targeted user cases
of the individual configurations, such layout studies will later enable a
ranking of potential configurations. Based on this information the optimal
combination of technologies will be defined for the 2019 conceptual design
report of the EuPRAXIA facility.
| physics.acc-ph | the horizon 2020 project eupraxia european plasma research accelerator with excellence in applications is preparing a conceptual design for a highly compact and costeffective european facility with multigev electron beams using plasma as the acceleration medium the design includes two user areas one for fel science and one for high energy physics hep detector development and other pilot applications the accelerator facility will be based on a laser andor a beam driven plasma acceleration approach this contribution introduces layout considerations of the future plasma accelerator facilities in the context of eupraxia it compares conventional and novel plasma accelerator facility requirements and presents potential layouts for the future site together with performance analysis cost effectiveness and targeted user cases of the individual configurations such layout studies will later enable a ranking of potential configurations based on this information the optimal combination of technologies will be defined for the 2019 conceptual design report of the eupraxia facility | [['the', 'horizon', '2020', 'project', 'eupraxia', 'european', 'plasma', 'research', 'accelerator', 'with', 'excellence', 'in', 'applications', 'is', 'preparing', 'a', 'conceptual', 'design', 'for', 'a', 'highly', 'compact', 'and', 'costeffective', 'european', 'facility', 'with', 'multigev', 'electron', 'beams', 'using', 'plasma', 'as', 'the', 'acceleration', 'medium', 'the', 'design', 'includes', 'two', 'user', 'areas', 'one', 'for', 'fel', 'science', 'and', 'one', 'for', 'high', 'energy', 'physics', 'hep', 'detector', 'development', 'and', 'other', 'pilot', 'applications', 'the', 'accelerator', 'facility', 'will', 'be', 'based', 'on', 'a', 'laser', 'andor', 'a', 'beam', 'driven', 'plasma', 'acceleration', 'approach', 'this', 'contribution', 'introduces', 'layout', 'considerations', 'of', 'the', 'future', 'plasma', 'accelerator', 'facilities', 'in', 'the', 'context', 'of', 'eupraxia', 'it', 'compares', 'conventional', 'and', 'novel', 'plasma', 'accelerator', 'facility', 'requirements', 'and', 'presents', 'potential', 'layouts', 'for', 'the', 'future', 'site', 'together', 'with', 'performance', 'analysis', 'cost', 'effectiveness', 'and', 'targeted', 'user', 'cases', 'of', 'the', 'individual', 'configurations', 'such', 'layout', 'studies', 'will', 'later', 'enable', 'a', 'ranking', 'of', 'potential', 'configurations', 'based', 'on', 'this', 'information', 'the', 'optimal', 'combination', 'of', 'technologies', 'will', 'be', 'defined', 'for', 'the', '2019', 'conceptual', 'design', 'report', 'of', 'the', 'eupraxia', 'facility']] | [-0.10022231364930649, 0.11804016859480931, -0.073748454091049, 0.02326714160566729, -0.10596908578468907, -0.17711186201401777, 0.005110917781149187, 0.4025089958262059, -0.1907084934143049, -0.34533569624707583, 0.11343479049992898, -0.2764190077300995, -0.03850639086374412, 0.2786888327043984, -0.04552094681609061, 0.08860687599968045, 0.12192209513797875, -0.05004992438480258, -0.01195831520880963, -0.1881589740274414, 0.25999978093745846, 0.25538039320118483, 0.37392221946990295, 0.09426266236170645, 0.10040010308185893, 0.010592023427447965, -0.04569445939494237, -0.020870529908995284, -0.07504956153805382, 0.134267130406994, 0.3418928291783818, 0.22066160173816307, 0.32889026101197927, -0.44636867850297884, -0.19634297399541303, -0.0022413849379987485, 0.05474967463843284, 0.03837708386202012, -0.14060874668160273, -0.25343029311587734, -0.039316390791998036, -0.23105394611916236, -0.18559594180645242, -0.0004308421735561663, -0.03522291836899615, 0.08454472701395711, -0.27912792278633963, -0.09871563392450973, -0.054387723950428825, 0.041432804259802065, -0.029294651500400035, -0.16287267479384618, 0.0915154836410957, 0.08854760232892248, -0.02249112059963086, 0.0653482871753494, 0.19477234632377663, -0.14055907062344974, -0.16602612522641017, 0.40988227804341626, 0.02319685147264071, -0.11344200052065595, 0.16475856858826685, -0.17154085213250872, -0.13902807059667766, 0.08923869158381656, 0.2414966623809549, 0.06483553466086667, -0.18385011031923273, 0.04897907073233997, 0.061139791957553355, 0.12577657792717217, 0.09384841032236094, 0.037077542274228985, 0.27721480182071606, 0.3141828459957915, 0.10859023222264143, 0.1346138076154485, -0.11222742348458738, -0.020599896400686234, -0.3236138291807184, -0.12777186549839473, -0.10444580493194441, -0.02160351461385407, 0.02071283694052498, -0.09705293334179348, 0.42537504708574664, 0.15782980174427072, 0.04117364823037097, -0.07114140706347122, 0.3453581947112276, 0.006704490788416156, 0.06381362750825863, 0.05928668687720933, 0.2046623665088367, 0.013610624942568041, 0.21810393808409573, -0.2040412884175537, 0.010745644815746814, 0.014033245475542161] |
1,802.00294 | Dissipation and detonation of shock waves in lipid monolayers | Lipid interfaces not only compartmentalize but also connect different
reaction centers within a cell architecture. These interfaces have well defined
specific heats and compressibilities, hence energy can propagate along them
analogous to sound waves. Lipid monolayers prepared at the air-water interface
of a Langmuir trough present an excellent model system to study such
propagations. Here we propose that recent observations of two-dimensional shock
waves observed in lipid monolayers also provide the evidence for the detonation
of shock waves at such interfaces, i.e. chemical energy stored in the interface
can be absorbed by a propagating shock front reinforcing it in the process. To
this end, we apply the classical theory in shock waves and detonation in the
context of a lipid interface and its thermodynamic state. Based on these
insights it is claimed that the observed self-sustaining waves in lipid
monolayers represent a detonation like phenomena that utilizes the latent heat
of phase transition of the lipids. However, the general nature of these
equations allows that other possible sources of chemical energy can contribute
to the propagating shock wave in a similar manner. Consequently, the
understanding is applied to the nerve pulse propagation that is believed to
represent a similar phenomenon, to obtain a qualitative understanding of the
pressure and temperature dependence of amplitude and threshold for action
potentials. While we mainly discuss the case of a stable detonation, the
problem of initiation of detonation at interfaces and corresponding heat
exchange is briefly discussed, which also suggests a role for thunder like
phenomena in pulse initiation.
| physics.bio-ph | lipid interfaces not only compartmentalize but also connect different reaction centers within a cell architecture these interfaces have well defined specific heats and compressibilities hence energy can propagate along them analogous to sound waves lipid monolayers prepared at the airwater interface of a langmuir trough present an excellent model system to study such propagations here we propose that recent observations of twodimensional shock waves observed in lipid monolayers also provide the evidence for the detonation of shock waves at such interfaces ie chemical energy stored in the interface can be absorbed by a propagating shock front reinforcing it in the process to this end we apply the classical theory in shock waves and detonation in the context of a lipid interface and its thermodynamic state based on these insights it is claimed that the observed selfsustaining waves in lipid monolayers represent a detonation like phenomena that utilizes the latent heat of phase transition of the lipids however the general nature of these equations allows that other possible sources of chemical energy can contribute to the propagating shock wave in a similar manner consequently the understanding is applied to the nerve pulse propagation that is believed to represent a similar phenomenon to obtain a qualitative understanding of the pressure and temperature dependence of amplitude and threshold for action potentials while we mainly discuss the case of a stable detonation the problem of initiation of detonation at interfaces and corresponding heat exchange is briefly discussed which also suggests a role for thunder like phenomena in pulse initiation | [['lipid', 'interfaces', 'not', 'only', 'compartmentalize', 'but', 'also', 'connect', 'different', 'reaction', 'centers', 'within', 'a', 'cell', 'architecture', 'these', 'interfaces', 'have', 'well', 'defined', 'specific', 'heats', 'and', 'compressibilities', 'hence', 'energy', 'can', 'propagate', 'along', 'them', 'analogous', 'to', 'sound', 'waves', 'lipid', 'monolayers', 'prepared', 'at', 'the', 'airwater', 'interface', 'of', 'a', 'langmuir', 'trough', 'present', 'an', 'excellent', 'model', 'system', 'to', 'study', 'such', 'propagations', 'here', 'we', 'propose', 'that', 'recent', 'observations', 'of', 'twodimensional', 'shock', 'waves', 'observed', 'in', 'lipid', 'monolayers', 'also', 'provide', 'the', 'evidence', 'for', 'the', 'detonation', 'of', 'shock', 'waves', 'at', 'such', 'interfaces', 'ie', 'chemical', 'energy', 'stored', 'in', 'the', 'interface', 'can', 'be', 'absorbed', 'by', 'a', 'propagating', 'shock', 'front', 'reinforcing', 'it', 'in', 'the', 'process', 'to', 'this', 'end', 'we', 'apply', 'the', 'classical', 'theory', 'in', 'shock', 'waves', 'and', 'detonation', 'in', 'the', 'context', 'of', 'a', 'lipid', 'interface', 'and', 'its', 'thermodynamic', 'state', 'based', 'on', 'these', 'insights', 'it', 'is', 'claimed', 'that', 'the', 'observed', 'selfsustaining', 'waves', 'in', 'lipid', 'monolayers', 'represent', 'a', 'detonation', 'like', 'phenomena', 'that', 'utilizes', 'the', 'latent', 'heat', 'of', 'phase', 'transition', 'of', 'the', 'lipids', 'however', 'the', 'general', 'nature', 'of', 'these', 'equations', 'allows', 'that', 'other', 'possible', 'sources', 'of', 'chemical', 'energy', 'can', 'contribute', 'to', 'the', 'propagating', 'shock', 'wave', 'in', 'a', 'similar', 'manner', 'consequently', 'the', 'understanding', 'is', 'applied', 'to', 'the', 'nerve', 'pulse', 'propagation', 'that', 'is', 'believed', 'to', 'represent', 'a', 'similar', 'phenomenon', 'to', 'obtain', 'a', 'qualitative', 'understanding', 'of', 'the', 'pressure', 'and', 'temperature', 'dependence', 'of', 'amplitude', 'and', 'threshold', 'for', 'action', 'potentials', 'while', 'we', 'mainly', 'discuss', 'the', 'case', 'of', 'a', 'stable', 'detonation', 'the', 'problem', 'of', 'initiation', 'of', 'detonation', 'at', 'interfaces', 'and', 'corresponding', 'heat', 'exchange', 'is', 'briefly', 'discussed', 'which', 'also', 'suggests', 'a', 'role', 'for', 'thunder', 'like', 'phenomena', 'in', 'pulse', 'initiation']] | [-0.13332139401532273, 0.16500496118262128, -0.07260834252308854, 0.0615199535654064, -0.07586762329892201, -0.12288810653319839, 0.047834622576905815, 0.37896948486712634, -0.2684276989095059, -0.25795428570469514, 0.04596407592762262, -0.26636646671646375, -0.16938767478454347, 0.17681271662917353, 0.031953756408035466, 0.02375352752792156, 0.040919904766933, -0.0019524105622515302, -0.007749677565651854, -0.1335836300060299, 0.27846712277124763, 0.06358159657570023, 0.29329765690947135, 0.10514676790825986, 0.0741497867708163, -0.054538631409991024, 0.03938047653007065, -0.011127290798935529, -0.16276881552427463, 0.05522833834265304, 0.25688358840678693, 0.053529063119169544, 0.2128315165531639, -0.5145683062719364, -0.3199600285576547, 0.023538327913767858, 0.1786642218688868, 0.15092064464583482, -0.08210509939384007, -0.24875421288386718, 0.03584581719044888, -0.13495048525852754, -0.1332332197882637, 0.001678652785645396, 0.004689384215310508, 0.06877199656663316, -0.20973168045793678, 0.12682508865939726, 0.06153438006956861, 0.00902298757550763, -0.10228641410746302, -0.04597022720503018, -0.08846478067502818, 0.08727798388686542, 0.06123835199008075, 0.03764707183467644, 0.1733038200978555, -0.12863417253646928, -0.06135899529189748, 0.41351562969970934, -0.055526409870671, -0.1514131218278849, 0.24363775929783052, -0.15426660672083553, -0.08801960452989328, 0.17511538173272914, 0.18591375671619292, 0.07986018716850701, -0.15354664188572298, -0.02150800450768906, 0.006341601433472105, 0.15840790027241206, 0.12947679100941648, -0.004806710301907551, 0.25509338012357774, 0.19126051007473258, 0.002935616546378964, 0.1434048529529451, -0.07010581359169081, -0.06451350205107684, -0.28155326384151647, -0.19250088455520717, -0.11849044093350862, 0.014971080545436445, -0.050636793343994, -0.20285902053058402, 0.40031408295035364, 0.16032819412266333, 0.1545161156093373, -0.01682001364134325, 0.23347328784692958, 0.09352811363288292, 0.028743740116410395, 0.0761774829150561, 0.262331346230691, 0.15559570981673532, 0.15357593844379938, -0.20712538470203679, 0.1129155700496745, 0.025175388947165773] |
1,802.00295 | A Semantic Model for Historical Manuscripts | The study and publication of historical scientific manuscripts are com- plex
tasks that involve, among others, the explicit representation of the text mean-
ings and reasoning on temporal entities. In this paper we present the first
results of an interdisciplinary project dedicated to the study of Saussure's
manuscripts. These results aim to fulfill requirements elaborated with
Saussurean humanists. They comprise a model for the representation of
time-varying statements and time-varying domain knowledge (in particular
terminologies) as well as imple- mentation techniques for the semantic indexing
of manuscripts and for temporal reasoning on knowledge extracted from the
manuscripts.
| cs.AI | the study and publication of historical scientific manuscripts are com plex tasks that involve among others the explicit representation of the text mean ings and reasoning on temporal entities in this paper we present the first results of an interdisciplinary project dedicated to the study of saussures manuscripts these results aim to fulfill requirements elaborated with saussurean humanists they comprise a model for the representation of timevarying statements and timevarying domain knowledge in particular terminologies as well as imple mentation techniques for the semantic indexing of manuscripts and for temporal reasoning on knowledge extracted from the manuscripts | [['the', 'study', 'and', 'publication', 'of', 'historical', 'scientific', 'manuscripts', 'are', 'com', 'plex', 'tasks', 'that', 'involve', 'among', 'others', 'the', 'explicit', 'representation', 'of', 'the', 'text', 'mean', 'ings', 'and', 'reasoning', 'on', 'temporal', 'entities', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'results', 'of', 'an', 'interdisciplinary', 'project', 'dedicated', 'to', 'the', 'study', 'of', 'saussures', 'manuscripts', 'these', 'results', 'aim', 'to', 'fulfill', 'requirements', 'elaborated', 'with', 'saussurean', 'humanists', 'they', 'comprise', 'a', 'model', 'for', 'the', 'representation', 'of', 'timevarying', 'statements', 'and', 'timevarying', 'domain', 'knowledge', 'in', 'particular', 'terminologies', 'as', 'well', 'as', 'imple', 'mentation', 'techniques', 'for', 'the', 'semantic', 'indexing', 'of', 'manuscripts', 'and', 'for', 'temporal', 'reasoning', 'on', 'knowledge', 'extracted', 'from', 'the', 'manuscripts']] | [-0.0439361578735866, 0.02218289280840269, -0.07064790582578433, 0.0842746890922028, -0.16083641164985144, -0.07493717994442896, 0.022547649806610455, 0.39522667260546435, -0.22565584424883128, -0.3653219982785614, 0.09532844420571468, -0.2901531122673891, -0.1566198205679508, 0.18035693818360174, -0.12266116546172845, 0.04237333274029784, 0.1078102868160625, 0.08224178445035298, -0.02597225162715308, -0.2472431815425424, 0.32759547507096276, 0.019193262802927116, 0.2863494401895686, 0.05129126456786731, 0.10587387105548068, 0.01257500147545024, -0.15466380177163763, -0.04861729793544663, -0.10279670357007202, 0.2003274004465263, 0.3659921790424146, 0.2513917373591348, 0.3059207585297133, -0.44262158894225173, -0.1559431992471218, 0.029063707359723353, 0.1076802497827693, 0.06708513074799588, 0.01981640988593235, -0.361874714307487, 0.05795433895515376, -0.16564122075214982, -0.022563129300741773, -0.11434627661579534, 0.028999496839548413, 0.05769712678892048, -0.19834263575214303, 0.0045101985629451904, 0.12293151473552968, 0.13731838926476866, -0.09208530903744855, -0.12845843198071968, 0.049280451912138805, 0.2004551175025929, 0.07909469525942481, 0.009527277078871665, 0.06558696012147457, -0.15584014291188827, -0.17253772279149607, 0.37845692791436847, -0.02793034776849182, -0.18263300180827316, 0.17607155139312933, -0.05529319094984155, -0.1950983193261843, 0.0366526090196873, 0.21495996404831347, 0.08980619276040479, -0.19453859867430048, 0.03235174607926686, -0.018555393697399843, 0.17660113649540826, 0.07634359850597225, 0.034290264875284936, 0.18701681662350894, 0.18603561706595906, -0.020301944703647965, 0.09072291977384961, -0.0332390542534229, -0.1012491125012993, -0.27666389514741146, -0.17088663283441413, -0.15865866891843708, -0.03124240955435916, -0.04785387699774123, -0.1594065135246829, 0.38383249862021523, 0.19752535099457752, 0.13458418790251017, 0.06415018869355615, 0.2931001301144103, 0.00020284707363890975, 0.06839772929486475, 0.040969983988294476, 0.1327121392934044, 0.06566274500119586, 0.21993469528265688, -0.11619791335205694, 0.09718549074605107, 0.04482041765494566] |
1,802.00296 | $S$-Leaping: An adaptive, accelerated stochastic simulation algorithm,
bridging $\tau$-leaping and $R$-leaping | We propose the $S$-leaping algorithm for the acceleration of Gillespie's
stochastic simulation algorithm that combines the advantages of the two main
accelerated methods; the $\tau$-leaping and $R$-leaping algorithms. These
algorithms are known to be efficient under different conditions; the
$\tau$-leaping is efficient for non-stiff systems or systems with partial
equilibrium, while the $R$-leaping performs better in stiff system thanks to an
efficient sampling procedure. However, even a small change in a system's set up
can critically affect the nature of the simulated system and thus reduce the
efficiency of an accelerated algorithm. The proposed algorithm combines the
efficient time step selection from the $\tau$-leaping with the effective
sampling procedure from the $R$-leaping algorithm. The $S$-leaping is shown to
maintain its efficiency under different conditions and in the case of large and
stiff systems or systems with fast dynamics, the $S$-leaping outperforms both
methods. We demonstrate the performance and the accuracy of the $S$-leaping in
comparison with the $\tau$-leaping and $R$-leaping on a number of benchmark
systems involving biological reaction networks.
| math.PR q-bio.MN | we propose the sleaping algorithm for the acceleration of gillespies stochastic simulation algorithm that combines the advantages of the two main accelerated methods the tauleaping and rleaping algorithms these algorithms are known to be efficient under different conditions the tauleaping is efficient for nonstiff systems or systems with partial equilibrium while the rleaping performs better in stiff system thanks to an efficient sampling procedure however even a small change in a systems set up can critically affect the nature of the simulated system and thus reduce the efficiency of an accelerated algorithm the proposed algorithm combines the efficient time step selection from the tauleaping with the effective sampling procedure from the rleaping algorithm the sleaping is shown to maintain its efficiency under different conditions and in the case of large and stiff systems or systems with fast dynamics the sleaping outperforms both methods we demonstrate the performance and the accuracy of the sleaping in comparison with the tauleaping and rleaping on a number of benchmark systems involving biological reaction networks | [['we', 'propose', 'the', 'sleaping', 'algorithm', 'for', 'the', 'acceleration', 'of', 'gillespies', 'stochastic', 'simulation', 'algorithm', 'that', 'combines', 'the', 'advantages', 'of', 'the', 'two', 'main', 'accelerated', 'methods', 'the', 'tauleaping', 'and', 'rleaping', 'algorithms', 'these', 'algorithms', 'are', 'known', 'to', 'be', 'efficient', 'under', 'different', 'conditions', 'the', 'tauleaping', 'is', 'efficient', 'for', 'nonstiff', 'systems', 'or', 'systems', 'with', 'partial', 'equilibrium', 'while', 'the', 'rleaping', 'performs', 'better', 'in', 'stiff', 'system', 'thanks', 'to', 'an', 'efficient', 'sampling', 'procedure', 'however', 'even', 'a', 'small', 'change', 'in', 'a', 'systems', 'set', 'up', 'can', 'critically', 'affect', 'the', 'nature', 'of', 'the', 'simulated', 'system', 'and', 'thus', 'reduce', 'the', 'efficiency', 'of', 'an', 'accelerated', 'algorithm', 'the', 'proposed', 'algorithm', 'combines', 'the', 'efficient', 'time', 'step', 'selection', 'from', 'the', 'tauleaping', 'with', 'the', 'effective', 'sampling', 'procedure', 'from', 'the', 'rleaping', 'algorithm', 'the', 'sleaping', 'is', 'shown', 'to', 'maintain', 'its', 'efficiency', 'under', 'different', 'conditions', 'and', 'in', 'the', 'case', 'of', 'large', 'and', 'stiff', 'systems', 'or', 'systems', 'with', 'fast', 'dynamics', 'the', 'sleaping', 'outperforms', 'both', 'methods', 'we', 'demonstrate', 'the', 'performance', 'and', 'the', 'accuracy', 'of', 'the', 'sleaping', 'in', 'comparison', 'with', 'the', 'tauleaping', 'and', 'rleaping', 'on', 'a', 'number', 'of', 'benchmark', 'systems', 'involving', 'biological', 'reaction', 'networks']] | [-0.09934659863698898, 0.01502877591222333, -0.09490178733642952, 0.047630134470048636, -0.012847215712399168, -0.14760969632359988, 0.025998439982204753, 0.4019539094365695, -0.2549409764325794, -0.33729408119312104, 0.10902517202638966, -0.20987700021770947, -0.15385120865642368, 0.24917774663635475, -0.05564093682743773, 0.10211532133980654, 0.11789494037819917, 0.006233821099843172, -0.07175341803470955, -0.27204385360922007, 0.255001749218825, 0.10804903987959466, 0.3019346374210299, -0.0017592084176345345, 0.15227597279556315, -0.02744555220055832, -0.010591581637067173, 0.021979606255669804, -0.05534927620409529, 0.11348507176153362, 0.19422723762143185, 0.15740076265955233, 0.3008373603443889, -0.4112067121793242, -0.18302168247892575, 0.09813099741894642, 0.1479398086302407, 0.13380649786524693, -0.0416453010546427, -0.2518886393251117, 0.09411224524613798, -0.15163228075338445, -0.08290124000871883, -0.12501116058624842, -0.05195267643943867, 0.08402833818177255, -0.31055924861746675, 0.07832723927550593, 0.04933685160255717, -0.0050958019448444246, -0.04707811879446073, -0.12994255937279806, 0.040354322158621954, 0.10376734692219863, 0.020681505405124933, -0.013502955005798654, 0.11393954479957329, -0.11423481115489267, -0.1521341801237534, 0.40288763158571195, -0.0406338577172445, -0.20950704768628758, 0.2594103171764051, -0.03638096973847817, -0.12903499027495, 0.18419334007536664, 0.19546110939974076, 0.17427696906413664, -0.13181733335642254, 0.05467050545917386, 0.052647991818101966, 0.1433520097833346, -0.007017346088062314, -0.007067236389197848, 0.103048011327765, 0.23957091255442184, 0.09593383670948884, 0.1294582118437735, -0.07968717736794668, -0.13475880942937424, -0.21136528109542696, -0.154893090345842, -0.16066912846256268, -0.047175918267491984, -0.12448822534266475, -0.14672527379845954, 0.36234782776411845, 0.2186151550315759, 0.15130620822858284, 0.07727000770049498, 0.36033872979528764, 0.09885757760605296, 0.037914556464837754, 0.12462738483925076, 0.21126618941095385, 0.07839150898815954, 0.1060206162126954, -0.2880892910419361, 0.08866612440769506, 0.059927212989286466] |
1,802.00297 | Complex Network Geometry and Frustrated Synchronization | The dynamics of networks of neuronal cultures has been recently shown to be
strongly dependent on the network geometry and in particular on their
dimensionality. However, this phenomenon has been so far mostly unexplored from
the theoretical point of view. Here we reveal the rich interplay between
network geometry and synchronization of coupled oscillators in the context of a
simplicial complex model of manifolds called Complex Network Manifold. The
networks generated by this model combine small world properties (infinite
Hausdorff dimension) and a high modular structure with finite and tunable
spectral dimension. We show that the networks display frustrated
synchronization for a wide range of the coupling strength of the oscillators,
and that the synchronization properties are directly affected by the spectral
dimension of the network.
| cond-mat.dis-nn cond-mat.stat-mech physics.soc-ph q-bio.NC | the dynamics of networks of neuronal cultures has been recently shown to be strongly dependent on the network geometry and in particular on their dimensionality however this phenomenon has been so far mostly unexplored from the theoretical point of view here we reveal the rich interplay between network geometry and synchronization of coupled oscillators in the context of a simplicial complex model of manifolds called complex network manifold the networks generated by this model combine small world properties infinite hausdorff dimension and a high modular structure with finite and tunable spectral dimension we show that the networks display frustrated synchronization for a wide range of the coupling strength of the oscillators and that the synchronization properties are directly affected by the spectral dimension of the network | [['the', 'dynamics', 'of', 'networks', 'of', 'neuronal', 'cultures', 'has', 'been', 'recently', 'shown', 'to', 'be', 'strongly', 'dependent', 'on', 'the', 'network', 'geometry', 'and', 'in', 'particular', 'on', 'their', 'dimensionality', 'however', 'this', 'phenomenon', 'has', 'been', 'so', 'far', 'mostly', 'unexplored', 'from', 'the', 'theoretical', 'point', 'of', 'view', 'here', 'we', 'reveal', 'the', 'rich', 'interplay', 'between', 'network', 'geometry', 'and', 'synchronization', 'of', 'coupled', 'oscillators', 'in', 'the', 'context', 'of', 'a', 'simplicial', 'complex', 'model', 'of', 'manifolds', 'called', 'complex', 'network', 'manifold', 'the', 'networks', 'generated', 'by', 'this', 'model', 'combine', 'small', 'world', 'properties', 'infinite', 'hausdorff', 'dimension', 'and', 'a', 'high', 'modular', 'structure', 'with', 'finite', 'and', 'tunable', 'spectral', 'dimension', 'we', 'show', 'that', 'the', 'networks', 'display', 'frustrated', 'synchronization', 'for', 'a', 'wide', 'range', 'of', 'the', 'coupling', 'strength', 'of', 'the', 'oscillators', 'and', 'that', 'the', 'synchronization', 'properties', 'are', 'directly', 'affected', 'by', 'the', 'spectral', 'dimension', 'of', 'the', 'network']] | [-0.14822929781133545, 0.1196587180740954, -0.045723565218467564, 0.03999396003893621, -0.061489046658463185, -0.13379861907072602, 0.009790186049594056, 0.39588267927516313, -0.2871574624002697, -0.26768569135299275, 0.08295850264507212, -0.2435657045552655, -0.2666294200822622, 0.1708722133374226, -0.05094030485888074, 0.019834347978411687, 0.04710105535322948, 0.04849842616674742, -0.02442355211898093, -0.20008177569223565, 0.38130973496415194, 0.04101332294360165, 0.3251146913750008, 0.06072408041643304, 0.13539521298593, -0.056651276240627914, 0.02594926749773708, 0.07192233041121018, -0.10812125393868117, 0.16001652342282116, 0.22596846596293507, 0.08374824219139382, 0.245379204590184, -0.41997769844555666, -0.298441010349918, 0.13020596904532303, 0.15619079738907102, 0.09389827071156885, 0.0015765178545806852, -0.31849598566750215, 0.06994650821526727, -0.1501471717538874, -0.09794603267477618, -0.10654207979447193, 0.02065639605464798, 0.04258979178617694, -0.19584113865811748, 0.015405747292947674, 0.06024798221649632, 0.11735621248445814, -0.012637015866366999, -0.04027419769397331, -0.05439638669439961, 0.15774895930856778, -0.016038628919641414, -0.01491600152803585, 0.1045747095837243, -0.13399947207746288, -0.10510619650299233, 0.3370515747635167, -0.02263047294839034, -0.19846199634926123, 0.23921250748366768, -0.15109576738720376, -0.15956456758200177, 0.12111886762755199, 0.2074412493134982, 0.09842242300510406, -0.12676129379311563, 0.13421612731430546, -0.04025681789166161, 0.1816908401810834, 0.026034080027972185, 0.08129247335997956, 0.17189988811012535, 0.24379364241631554, 0.056695935419864125, 0.1406203836585129, -0.06479232740266958, -0.13976523423537848, -0.1970194974204614, -0.0655676104084012, -0.22215607576072216, 0.07326943776200688, -0.13268903398547702, -0.18426243265945694, 0.43561195493454025, 0.1209784638328803, 0.2309659833748204, 0.0394908262838033, 0.24942963094347054, 0.06072087780321165, 0.08786167109954274, 0.04125791432572499, 0.258403490234669, 0.17911907276212577, 0.10796358451498525, -0.20618277102790122, 0.052991656889577236, 0.027754061777765553] |
1,802.00298 | Exploring the diluted ferromagnetic p-spin model with a Cavity Master
Equation | We introduce a new solution to Glauber multi-spin dynamics on random graphs.
The solution is based on the recently introduced Cavity Master Equation (CME),
a time-closure turning the in principle exact Dynamic Cavity Method into a
practical method of analysis and of fast simulation.
Running CME once is of comparable computational complexity as one Monte Carlo
run on the same problem. We show that CME correctly models the ferromagnetic
$p$-spin Glauber dynamics from high temperatures down to and below the
spinoidal transition. We also show that CME allows a novel exploration of the
low-temperature spin-glass phase of the model.
| cond-mat.dis-nn | we introduce a new solution to glauber multispin dynamics on random graphs the solution is based on the recently introduced cavity master equation cme a timeclosure turning the in principle exact dynamic cavity method into a practical method of analysis and of fast simulation running cme once is of comparable computational complexity as one monte carlo run on the same problem we show that cme correctly models the ferromagnetic pspin glauber dynamics from high temperatures down to and below the spinoidal transition we also show that cme allows a novel exploration of the lowtemperature spinglass phase of the model | [['we', 'introduce', 'a', 'new', 'solution', 'to', 'glauber', 'multispin', 'dynamics', 'on', 'random', 'graphs', 'the', 'solution', 'is', 'based', 'on', 'the', 'recently', 'introduced', 'cavity', 'master', 'equation', 'cme', 'a', 'timeclosure', 'turning', 'the', 'in', 'principle', 'exact', 'dynamic', 'cavity', 'method', 'into', 'a', 'practical', 'method', 'of', 'analysis', 'and', 'of', 'fast', 'simulation', 'running', 'cme', 'once', 'is', 'of', 'comparable', 'computational', 'complexity', 'as', 'one', 'monte', 'carlo', 'run', 'on', 'the', 'same', 'problem', 'we', 'show', 'that', 'cme', 'correctly', 'models', 'the', 'ferromagnetic', 'pspin', 'glauber', 'dynamics', 'from', 'high', 'temperatures', 'down', 'to', 'and', 'below', 'the', 'spinoidal', 'transition', 'we', 'also', 'show', 'that', 'cme', 'allows', 'a', 'novel', 'exploration', 'of', 'the', 'lowtemperature', 'spinglass', 'phase', 'of', 'the', 'model']] | [-0.07031684760580358, 0.137994964189405, -0.12847500456708302, 0.08818372036810465, -0.07024514468713212, -0.12959935731187308, 0.05896525092893424, 0.38915602793705834, -0.22412557832743088, -0.3208742862202458, 0.07496556049073595, -0.24343980676221502, -0.14074423836217714, 0.18635436798417077, 0.024462949249355756, 0.09167092331905954, 0.09791193070543028, 0.001465915348836864, -0.08952753981287331, -0.18547736460429415, 0.24887034378120118, 0.04064161549370313, 0.2690200334049992, 0.05088710637052649, 0.16638641529140474, 0.00296228830270546, 0.08731719526010998, 0.007634650013342346, -0.15720575776496618, 0.02864069269715626, 0.1523746169313921, 0.0864859790848472, 0.2629083836854426, -0.4514522336461802, -0.2181840551268194, 0.050736149566574504, 0.16211145897347903, 0.18311007176621905, -0.03658076757013068, -0.29585805688936684, 0.04812992797185158, -0.1838549420852022, -0.10973423965438509, -0.08626786474445738, -0.05507478983016666, -0.008857122958474552, -0.2726170357662378, 0.0774681627334542, 0.034427665490849114, 0.031527708438177086, -0.02563422358626039, -0.07332842248808785, 0.005055239697745473, 0.08180197886642568, 0.020391138484125437, 0.05333195138031367, 0.11847265024871095, -0.09612088027222984, -0.15114186014788053, 0.35841707410962925, -0.052795553149069786, -0.12951321531202376, 0.18613976750015185, -0.15422020620215185, -0.16241633850773893, 0.17264636107432396, 0.18255341718376605, 0.11957888243739138, -0.1531746469056426, 0.08279338465480268, -0.01123027217372791, 0.17634083750206478, -0.02272846780179702, -0.05808499191897278, 0.1362950363359654, 0.23352774753014452, 0.06431616337720267, 0.2029724188686646, -0.09165094987268455, -0.18480976705545002, -0.27201370783534246, -0.13259040574740005, -0.22857338300493268, 0.018744697757113304, -0.17394377101547584, -0.19131221259300857, 0.410778800851291, 0.2421479661632137, 0.1462923412945736, 0.06311908882284134, 0.2964144940896094, 0.1254515144097878, 0.014351536135774912, 0.117431978455063, 0.20347436668216876, 0.1572556034757842, 0.13481650973391748, -0.2887184176013142, 0.049028983421578104, 0.12753637949696062] |
1,802.00299 | The finiteness of the genus of a finite-dimensional division algebra,
and some generalizations | We prove that the genus of a finite-dimensional division algebra is finite
whenever the center is a finitely generated field of any characteristic. We
also discuss potential applications of our method to other problems, including
the finiteness of the genus of simple algebraic groups of type $\textsf{G}_2$.
These applications involve the double cosets of adele groups of algebraic
groups over arbitrary finitely generated fields: while over number fields these
double cosets are associated with the class numbers of algebraic groups and
hence have been actively analyzed, similar question over more general fields
seem to come up for the first time. In the Appendix, we link the double cosets
with $\check{\rm C}$ech cohomology and indicate connections between certain
finiteness properties involving double cosets (Condition (T)) and Bass's
finiteness conjecture in $K$-theory.
| math.RA math.AG math.NT | we prove that the genus of a finitedimensional division algebra is finite whenever the center is a finitely generated field of any characteristic we also discuss potential applications of our method to other problems including the finiteness of the genus of simple algebraic groups of type textsfg_2 these applications involve the double cosets of adele groups of algebraic groups over arbitrary finitely generated fields while over number fields these double cosets are associated with the class numbers of algebraic groups and hence have been actively analyzed similar question over more general fields seem to come up for the first time in the appendix we link the double cosets with checkrm cech cohomology and indicate connections between certain finiteness properties involving double cosets condition t and basss finiteness conjecture in ktheory | [['we', 'prove', 'that', 'the', 'genus', 'of', 'a', 'finitedimensional', 'division', 'algebra', 'is', 'finite', 'whenever', 'the', 'center', 'is', 'a', 'finitely', 'generated', 'field', 'of', 'any', 'characteristic', 'we', 'also', 'discuss', 'potential', 'applications', 'of', 'our', 'method', 'to', 'other', 'problems', 'including', 'the', 'finiteness', 'of', 'the', 'genus', 'of', 'simple', 'algebraic', 'groups', 'of', 'type', 'textsfg_2', 'these', 'applications', 'involve', 'the', 'double', 'cosets', 'of', 'adele', 'groups', 'of', 'algebraic', 'groups', 'over', 'arbitrary', 'finitely', 'generated', 'fields', 'while', 'over', 'number', 'fields', 'these', 'double', 'cosets', 'are', 'associated', 'with', 'the', 'class', 'numbers', 'of', 'algebraic', 'groups', 'and', 'hence', 'have', 'been', 'actively', 'analyzed', 'similar', 'question', 'over', 'more', 'general', 'fields', 'seem', 'to', 'come', 'up', 'for', 'the', 'first', 'time', 'in', 'the', 'appendix', 'we', 'link', 'the', 'double', 'cosets', 'with', 'checkrm', 'cech', 'cohomology', 'and', 'indicate', 'connections', 'between', 'certain', 'finiteness', 'properties', 'involving', 'double', 'cosets', 'condition', 't', 'and', 'basss', 'finiteness', 'conjecture', 'in', 'ktheory']] | [-0.18193864953332373, 0.12730605016614116, -0.08705012454080951, 0.06942690116382211, -0.08674392804445684, -0.14409912646885298, 0.008234892751617257, 0.3445043567596942, -0.3500624248584689, -0.2496816602340618, 0.10315173169843449, -0.21539027327464086, -0.14054300673955747, 0.29445756096465064, -0.12643247077515882, -0.024332253139668195, 0.038985763698123226, 0.1280201048113752, -0.07925597502391554, -0.3498079637868705, 0.40568168123808596, -0.05549872363195574, 0.2233825675825509, 0.0553000297851643, 0.07543502625641088, 0.0061306681144664915, -0.05354668807180584, -0.00692846258928956, -0.10090993546418053, 0.10676894933274088, 0.3010804200934809, 0.040112908698560656, 0.2246868852886927, -0.3886756644577019, -0.17321640830811894, 0.21485822191173137, 0.1391897299687934, 0.011710830500291647, -0.0758930231529593, -0.23706691309289876, 0.14867581935353982, -0.17853415345181098, -0.15654434992475147, -0.05936572808671252, 0.044948174828454104, 0.07868282854252011, -0.21218802047398866, -0.0018195944692481077, 0.058211602930290006, 0.13983604122068763, -0.0388690278849153, -0.11127502807278851, -0.02110184132222577, 0.11350757208501183, 0.01854737732891542, -0.01329280793045958, 0.09995859302941335, -0.10572555988247312, -0.16279822801304764, 0.34388357806633146, 0.008452456466160541, -0.17496863874614008, 0.17184758313404497, -0.18110860234068693, -0.2016295861676624, 0.13592316437685906, 0.08319832136955603, 0.1396770642216628, -0.0063696158436206424, 0.2115668269084557, -0.10590088406447755, 0.04531623503056088, 0.11730046896985913, 0.043651759525663546, 0.15070500998765, 0.043957608127461155, 0.04099823924886106, 0.13198783862009256, 0.024295025313497105, -0.06791051075245116, -0.367516752866696, -0.18720625522510373, -0.05480139608704304, 0.12545867697083096, -0.10437324488963733, -0.19375088833662313, 0.43430795864916816, 0.06486937324624768, 0.12369148300368657, 0.13119689323542308, 0.20428107885369498, 0.059404762856149686, 0.10524393950206365, 0.032859998740717884, 0.09414156443302253, 0.27734342496875986, -0.06103270416880792, -0.13956050372270998, -0.04465901043785866, 0.16606683832369457] |
1,802.003 | MaD TwinNet: Masker-Denoiser Architecture with Twin Networks for
Monaural Sound Source Separation | Monaural singing voice separation task focuses on the prediction of the
singing voice from a single channel music mixture signal. Current state of the
art (SOTA) results in monaural singing voice separation are obtained with deep
learning based methods. In this work we present a novel deep learning based
method that learns long-term temporal patterns and structures of a musical
piece. We build upon the recently proposed Masker-Denoiser (MaD) architecture
and we enhance it with the Twin Networks, a technique to regularize a recurrent
generative network using a backward running copy of the network. We evaluate
our method using the Demixing Secret Dataset and we obtain an increment to
signal-to-distortion ratio (SDR) of 0.37 dB and to signal-to-interference ratio
(SIR) of 0.23 dB, compared to previous SOTA results.
| cs.SD eess.AS | monaural singing voice separation task focuses on the prediction of the singing voice from a single channel music mixture signal current state of the art sota results in monaural singing voice separation are obtained with deep learning based methods in this work we present a novel deep learning based method that learns longterm temporal patterns and structures of a musical piece we build upon the recently proposed maskerdenoiser mad architecture and we enhance it with the twin networks a technique to regularize a recurrent generative network using a backward running copy of the network we evaluate our method using the demixing secret dataset and we obtain an increment to signaltodistortion ratio sdr of 037 db and to signaltointerference ratio sir of 023 db compared to previous sota results | [['monaural', 'singing', 'voice', 'separation', 'task', 'focuses', 'on', 'the', 'prediction', 'of', 'the', 'singing', 'voice', 'from', 'a', 'single', 'channel', 'music', 'mixture', 'signal', 'current', 'state', 'of', 'the', 'art', 'sota', 'results', 'in', 'monaural', 'singing', 'voice', 'separation', 'are', 'obtained', 'with', 'deep', 'learning', 'based', 'methods', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'deep', 'learning', 'based', 'method', 'that', 'learns', 'longterm', 'temporal', 'patterns', 'and', 'structures', 'of', 'a', 'musical', 'piece', 'we', 'build', 'upon', 'the', 'recently', 'proposed', 'maskerdenoiser', 'mad', 'architecture', 'and', 'we', 'enhance', 'it', 'with', 'the', 'twin', 'networks', 'a', 'technique', 'to', 'regularize', 'a', 'recurrent', 'generative', 'network', 'using', 'a', 'backward', 'running', 'copy', 'of', 'the', 'network', 'we', 'evaluate', 'our', 'method', 'using', 'the', 'demixing', 'secret', 'dataset', 'and', 'we', 'obtain', 'an', 'increment', 'to', 'signaltodistortion', 'ratio', 'sdr', 'of', '037', 'db', 'and', 'to', 'signaltointerference', 'ratio', 'sir', 'of', '023', 'db', 'compared', 'to', 'previous', 'sota', 'results']] | [-0.07480382023555204, -0.025252872915625918, -0.09900871021709749, 0.026031025438789483, -0.0921338761086011, -0.1918108147077673, 0.07470476410102363, 0.4343066930653542, -0.24236322146305067, -0.3108160392065921, 0.05131555551032382, -0.26885190728582503, -0.21899058286276624, 0.18549883854025462, -0.14769033284667205, 0.10411881092169475, 0.11414112311083911, 0.03862409833378679, -0.06629319803781925, -0.23804509353743294, 0.29141826665498255, 0.04895072416393233, 0.3999020231770366, 0.007523877828521287, 0.16052439240885413, -0.01507121964731789, -0.04124474179322325, -0.07857109669515291, -0.07446194040103436, 0.13829800519380925, 0.2714303477197944, 0.22566829138897418, 0.2745123438713119, -0.35433152366400233, -0.20820902813387315, 0.07222831372068975, 0.11789475961800987, 0.12015087822063525, -0.02724773026031156, -0.37833359313067266, 0.12551757238262634, -0.19986294611819147, 0.06388645472122341, -0.05195926647545315, -0.05675858945593121, -0.00953869064389838, -0.30502623326959105, 0.07053880657685378, 0.08919005431454834, 0.061570753314070345, -0.05288381816078652, -0.17797555074491722, 0.06620155843515609, 0.15509928302384737, 0.02763251232635963, 0.09559960615652519, 0.1292214219781064, -0.16536144450838325, -0.1617842836481497, 0.29750242569725815, -0.16317124072302822, -0.1766772954541398, 0.16783358467289972, -0.012622492343891324, -0.0913182468204869, 0.12493250798434019, 0.2506814487205129, 0.1052174029475826, -0.15571307868322753, -0.08781960395010789, -0.0400122337769277, 0.2831906911873031, 0.07138006095811138, -0.014291216703645122, 0.14069038268736028, 0.3158839194060076, -0.010459639920347085, 0.1538694223103033, -0.20906192948858393, -0.05017262150892827, -0.1450389223833253, -0.11129487014932954, -0.16537230539384964, -0.02594526384876469, -0.0888689310637332, -0.13402638178113407, 0.4290557149467682, 0.2095930190815583, 0.2040450783798427, 0.1405390990186688, 0.3742782048235728, 0.03390277004122411, 0.06159511418998476, 0.09083557892984924, 0.23482447850525262, 0.045488666149046945, 0.18634792272456166, -0.19020068192740858, 0.06899299219573342, 0.0723690526630073] |
1,802.00301 | Mapping road network communities for guiding disease surveillance and
control strategies | Human mobility is increasing in its volume, speed and reach, leading to the
movement and introduction of pathogens through infected travelers. An
understanding of how areas are connected, the strength of these connections and
how this translates into disease spread is valuable for planning surveillance
and designing control and elimination strategies. While analyses have been
undertaken to identify and map connectivity in global air, shipping and
migration networks, such analyses have yet to be undertaken on the road
networks that carry the vast majority of travellers in low and middle income
settings. Here we present methods for identifying road connectivity
communities, as well as mapping bridge areas between communities and key
linkage routes. We apply these to Africa, and show how many highly-connected
communities straddle national borders and when integrating malaria prevalence
and population data as an example, the communities change, highlighting regions
most strongly connected to areas of high burden. The approaches and results
presented provide a flexible tool for supporting the design of disease
surveillance and control strategies through mapping areas of high connectivity
that form coherent units of intervention and key link routes between
communities for targeting surveillance.
| physics.soc-ph | human mobility is increasing in its volume speed and reach leading to the movement and introduction of pathogens through infected travelers an understanding of how areas are connected the strength of these connections and how this translates into disease spread is valuable for planning surveillance and designing control and elimination strategies while analyses have been undertaken to identify and map connectivity in global air shipping and migration networks such analyses have yet to be undertaken on the road networks that carry the vast majority of travellers in low and middle income settings here we present methods for identifying road connectivity communities as well as mapping bridge areas between communities and key linkage routes we apply these to africa and show how many highlyconnected communities straddle national borders and when integrating malaria prevalence and population data as an example the communities change highlighting regions most strongly connected to areas of high burden the approaches and results presented provide a flexible tool for supporting the design of disease surveillance and control strategies through mapping areas of high connectivity that form coherent units of intervention and key link routes between communities for targeting surveillance | [['human', 'mobility', 'is', 'increasing', 'in', 'its', 'volume', 'speed', 'and', 'reach', 'leading', 'to', 'the', 'movement', 'and', 'introduction', 'of', 'pathogens', 'through', 'infected', 'travelers', 'an', 'understanding', 'of', 'how', 'areas', 'are', 'connected', 'the', 'strength', 'of', 'these', 'connections', 'and', 'how', 'this', 'translates', 'into', 'disease', 'spread', 'is', 'valuable', 'for', 'planning', 'surveillance', 'and', 'designing', 'control', 'and', 'elimination', 'strategies', 'while', 'analyses', 'have', 'been', 'undertaken', 'to', 'identify', 'and', 'map', 'connectivity', 'in', 'global', 'air', 'shipping', 'and', 'migration', 'networks', 'such', 'analyses', 'have', 'yet', 'to', 'be', 'undertaken', 'on', 'the', 'road', 'networks', 'that', 'carry', 'the', 'vast', 'majority', 'of', 'travellers', 'in', 'low', 'and', 'middle', 'income', 'settings', 'here', 'we', 'present', 'methods', 'for', 'identifying', 'road', 'connectivity', 'communities', 'as', 'well', 'as', 'mapping', 'bridge', 'areas', 'between', 'communities', 'and', 'key', 'linkage', 'routes', 'we', 'apply', 'these', 'to', 'africa', 'and', 'show', 'how', 'many', 'highlyconnected', 'communities', 'straddle', 'national', 'borders', 'and', 'when', 'integrating', 'malaria', 'prevalence', 'and', 'population', 'data', 'as', 'an', 'example', 'the', 'communities', 'change', 'highlighting', 'regions', 'most', 'strongly', 'connected', 'to', 'areas', 'of', 'high', 'burden', 'the', 'approaches', 'and', 'results', 'presented', 'provide', 'a', 'flexible', 'tool', 'for', 'supporting', 'the', 'design', 'of', 'disease', 'surveillance', 'and', 'control', 'strategies', 'through', 'mapping', 'areas', 'of', 'high', 'connectivity', 'that', 'form', 'coherent', 'units', 'of', 'intervention', 'and', 'key', 'link', 'routes', 'between', 'communities', 'for', 'targeting', 'surveillance']] | [-0.10759069800927884, 0.07458799755330568, -0.03801714489724078, 0.06627555462929142, -0.07013587279766993, -0.14595194968340994, 0.12066848116959762, 0.3933077756564147, -0.25077246811974757, -0.3238760831092938, 0.15341003445959625, -0.297209480377548, -0.22533063715596863, 0.20055554236202497, -0.11016742992141718, 0.0008729365218494146, 0.07780588180538638, -0.021647488904223383, 0.08318730128480424, -0.23457877897701337, 0.2681703256109135, 0.04566469829921435, 0.32988621463087336, 0.09664966443827691, 0.062849267878989, 0.008479567924855736, -0.06968191318964849, 0.04485893401400191, -0.11942736262064585, 0.1636209532677035, 0.39131766885362995, 0.21834647304534482, 0.34998978470593534, -0.4722498357881114, -0.24140664170549803, 0.12420135615783602, 0.17051082726397931, 0.07348817874219132, -0.020716195560672383, -0.310023698487675, 0.05821854583748387, -0.17135317778185555, -0.12136441492810797, -0.09039568892772754, 0.03105227617426234, 0.04447971460627665, -0.20730195301999363, 0.033473955818417805, -0.040701550248088754, 0.1367048611766927, -0.025344602178681046, -0.09177767436497927, -0.04557795246760726, 0.29546672627479154, 0.06241616248567613, -0.00849275434626198, 0.18944419812196525, -0.19530055954618408, -0.1289282508257835, 0.34366426531576516, 0.04130323921910521, -0.14506163359595298, 0.25270227056620786, -0.07205442599744989, -0.14727866599526432, 0.08827177937147428, 0.24634880386209126, 0.04450944866418244, -0.17663157141576363, -0.021543963765512167, 0.023241383075977416, 0.13029682567021297, 0.05982309142103253, 0.007448820212882753, 0.21332371731761707, 0.2458149303757727, 0.16661051465948087, 0.06825001702884076, -0.10619910832900427, -0.10177961839192318, -0.1939172330483092, -0.15263794449094625, -0.09947395942988196, -0.03007834557570634, -0.0868745843127293, -0.1428836334998968, 0.4031088401634168, 0.15914938551086094, 0.15376550760315194, 0.05454536053200901, 0.28244794673391216, -0.0030733589003720755, 0.08754642664706908, 0.0754162719075846, 0.1602097218484418, 0.0733444800454738, 0.11775990933331013, -0.18135581864531675, 0.14234963270984297, -0.036176776795048285] |
1,802.00302 | Fluctuations of random semi-linear advection equations | We consider a semi-linear advection equation driven by a highly-oscillatory
space-time Gaussian random field, with the randomness affecting both the drift
and the nonlinearity. In the linear setting, classical results show that the
characteristics converge in distribution to a homogenized Brownian motion,
hence the point-wise law of the solution is close to a functional of the
Brownian motion. Our main result is that the nonlinearity plays the role of a
\emph{random diffeomorphism}, and the point-wise limiting distribution is
obtained by applying the diffeomorphism to the limit in the linear setting.
| math.PR math.AP | we consider a semilinear advection equation driven by a highlyoscillatory spacetime gaussian random field with the randomness affecting both the drift and the nonlinearity in the linear setting classical results show that the characteristics converge in distribution to a homogenized brownian motion hence the pointwise law of the solution is close to a functional of the brownian motion our main result is that the nonlinearity plays the role of a emphrandom diffeomorphism and the pointwise limiting distribution is obtained by applying the diffeomorphism to the limit in the linear setting | [['we', 'consider', 'a', 'semilinear', 'advection', 'equation', 'driven', 'by', 'a', 'highlyoscillatory', 'spacetime', 'gaussian', 'random', 'field', 'with', 'the', 'randomness', 'affecting', 'both', 'the', 'drift', 'and', 'the', 'nonlinearity', 'in', 'the', 'linear', 'setting', 'classical', 'results', 'show', 'that', 'the', 'characteristics', 'converge', 'in', 'distribution', 'to', 'a', 'homogenized', 'brownian', 'motion', 'hence', 'the', 'pointwise', 'law', 'of', 'the', 'solution', 'is', 'close', 'to', 'a', 'functional', 'of', 'the', 'brownian', 'motion', 'our', 'main', 'result', 'is', 'that', 'the', 'nonlinearity', 'plays', 'the', 'role', 'of', 'a', 'emphrandom', 'diffeomorphism', 'and', 'the', 'pointwise', 'limiting', 'distribution', 'is', 'obtained', 'by', 'applying', 'the', 'diffeomorphism', 'to', 'the', 'limit', 'in', 'the', 'linear', 'setting']] | [-0.12921559465014273, 0.0848774093332597, -0.10064250115926067, 0.04251515629261525, -0.06320037915267879, -0.0889798294338915, -0.0015114236830009353, 0.29289909481174414, -0.32452473915699453, -0.21855802856799628, 0.11402308857844522, -0.2792324563074443, -0.1606185190922891, 0.18550719540152286, -0.09959134914291402, 0.08623229598419534, 0.042176972991890375, 0.011939270111421743, 0.0029740076563838456, -0.2047822073024387, 0.3449631383901255, 0.015535556897521018, 0.26405256839158636, -0.029347939484028352, 0.15171619867905975, 0.007167596069888936, -0.016605321028166347, 0.026754825748503207, -0.12591935539595497, 0.0889730093224595, 0.16359914345149365, 0.01161111705005169, 0.33646546776096026, -0.37876626110325257, -0.24811347938246198, 0.0882932623848319, 0.10866335668704576, 0.09142933460987276, -0.05378568884399202, -0.3043837638778819, 0.05975432322722756, -0.08676666557374928, -0.1986219559899635, -0.03583996501078622, 0.003932045344522016, 0.07264829891630345, -0.3021026712324884, 0.14042550921440125, 0.18063929631478257, 0.0066873674901823206, -0.09032116672541532, -0.027720720988387862, -0.015531379698465268, 0.12279946186786725, 0.08201640280506885, 0.03682757015857432, 0.1446089596953243, -0.14199563063577644, -0.07050380758527253, 0.3954708354340659, -0.15253401776361797, -0.31521103856050303, 0.13879130590810543, -0.19738003354933525, -0.09878519141736129, 0.11488666043927272, 0.1340998172126193, 0.09319876725955206, -0.169365686757697, 0.1591966218716051, -0.022554359176299638, 0.12723249418971438, 0.0533546202402148, -0.0070603063226574, 0.10847012812478675, 0.1365249424189743, 0.1383813341251678, 0.15790894807885505, -0.06286312216996319, -0.17088848372610907, -0.34388083948029413, -0.15617364962171348, -0.19615211764143572, 0.10649394985909263, -0.16747341145625494, -0.17838501557707787, 0.3619887770981424, 0.13807624761830084, 0.18008369821020298, 0.096841312562012, 0.25170465607015, 0.22779840687936587, -0.019068684998071857, 0.09477212839087265, 0.22351375178744395, 0.18561026270035655, 0.11340543073084619, -0.24145713261742557, 0.057969019324001336, 0.10459142089303997] |
1,802.00303 | Slate: extending Firedrake's domain-specific abstraction to hybridized
solvers for geoscience and beyond | Within the finite element community, discontinuous Galerkin (DG) and mixed
finite element methods have become increasingly popular in simulating
geophysical flows. However, robust and efficient solvers for the resulting
saddle-point and elliptic systems arising from these discretizations continue
to be an on-going challenge. One possible approach for addressing this issue is
to employ a method known as hybridization, where the discrete equations are
transformed such that classic static condensation and local post-processing
methods can be employed. However, it is challenging to implement hybridization
as performant parallel code within complex models, whilst maintaining
separation of concerns between applications scientists and software experts. In
this paper, we introduce a domain-specific abstraction within the Firedrake
finite element library that permits the rapid execution of these hybridization
techniques within a code-generating framework. The resulting framework composes
naturally with Firedrake's solver environment, allowing for the implementation
of hybridization and static condensation as runtime-configurable
preconditioners via the Python interface to PETSc, petsc4py. We provide
examples derived from second order elliptic problems and geophysical fluid
dynamics. In addition, we demonstrate that hybridization shows great promise
for improving the performance of solvers for mixed finite element
discretizations of equations related to large-scale geophysical flows.
| cs.MS | within the finite element community discontinuous galerkin dg and mixed finite element methods have become increasingly popular in simulating geophysical flows however robust and efficient solvers for the resulting saddlepoint and elliptic systems arising from these discretizations continue to be an ongoing challenge one possible approach for addressing this issue is to employ a method known as hybridization where the discrete equations are transformed such that classic static condensation and local postprocessing methods can be employed however it is challenging to implement hybridization as performant parallel code within complex models whilst maintaining separation of concerns between applications scientists and software experts in this paper we introduce a domainspecific abstraction within the firedrake finite element library that permits the rapid execution of these hybridization techniques within a codegenerating framework the resulting framework composes naturally with firedrakes solver environment allowing for the implementation of hybridization and static condensation as runtimeconfigurable preconditioners via the python interface to petsc petsc4py we provide examples derived from second order elliptic problems and geophysical fluid dynamics in addition we demonstrate that hybridization shows great promise for improving the performance of solvers for mixed finite element discretizations of equations related to largescale geophysical flows | [['within', 'the', 'finite', 'element', 'community', 'discontinuous', 'galerkin', 'dg', 'and', 'mixed', 'finite', 'element', 'methods', 'have', 'become', 'increasingly', 'popular', 'in', 'simulating', 'geophysical', 'flows', 'however', 'robust', 'and', 'efficient', 'solvers', 'for', 'the', 'resulting', 'saddlepoint', 'and', 'elliptic', 'systems', 'arising', 'from', 'these', 'discretizations', 'continue', 'to', 'be', 'an', 'ongoing', 'challenge', 'one', 'possible', 'approach', 'for', 'addressing', 'this', 'issue', 'is', 'to', 'employ', 'a', 'method', 'known', 'as', 'hybridization', 'where', 'the', 'discrete', 'equations', 'are', 'transformed', 'such', 'that', 'classic', 'static', 'condensation', 'and', 'local', 'postprocessing', 'methods', 'can', 'be', 'employed', 'however', 'it', 'is', 'challenging', 'to', 'implement', 'hybridization', 'as', 'performant', 'parallel', 'code', 'within', 'complex', 'models', 'whilst', 'maintaining', 'separation', 'of', 'concerns', 'between', 'applications', 'scientists', 'and', 'software', 'experts', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'domainspecific', 'abstraction', 'within', 'the', 'firedrake', 'finite', 'element', 'library', 'that', 'permits', 'the', 'rapid', 'execution', 'of', 'these', 'hybridization', 'techniques', 'within', 'a', 'codegenerating', 'framework', 'the', 'resulting', 'framework', 'composes', 'naturally', 'with', 'firedrakes', 'solver', 'environment', 'allowing', 'for', 'the', 'implementation', 'of', 'hybridization', 'and', 'static', 'condensation', 'as', 'runtimeconfigurable', 'preconditioners', 'via', 'the', 'python', 'interface', 'to', 'petsc', 'petsc4py', 'we', 'provide', 'examples', 'derived', 'from', 'second', 'order', 'elliptic', 'problems', 'and', 'geophysical', 'fluid', 'dynamics', 'in', 'addition', 'we', 'demonstrate', 'that', 'hybridization', 'shows', 'great', 'promise', 'for', 'improving', 'the', 'performance', 'of', 'solvers', 'for', 'mixed', 'finite', 'element', 'discretizations', 'of', 'equations', 'related', 'to', 'largescale', 'geophysical', 'flows']] | [-0.06694519609560312, 0.042198320765755803, -0.07480997596553725, 0.0586989276476658, -0.0879764586814964, -0.15556333896612334, -0.015148244117183967, 0.3726520544325769, -0.3347016942163765, -0.3241110043841477, 0.11906506402244299, -0.2217677380184527, -0.1284206846440597, 0.22087552704139, -0.04522024980297438, 0.10024312826915803, 0.11192099264113552, -0.07471210646326654, -0.09993427961375902, -0.20660468789633035, 0.29521697923695484, 0.01985212799567015, 0.28688736153293615, 0.07203530387680283, 0.08545990134806522, -0.0439947343062262, -0.041071534960245994, 0.05100583421655115, -0.06148752636680171, 0.14941696331648088, 0.3741783750218189, 0.12597089259368924, 0.3225381791948204, -0.4558445214646159, -0.2248341804720133, 0.050934952631269445, 0.177637851770504, 0.14487686362195942, -0.08784015081856651, -0.2515929376518286, 0.09335132264121981, -0.19743424243356433, -0.11241610823536938, -0.13542309386047674, -0.01641561359003032, 0.007692608484694339, -0.2844109721337035, 0.04818217598090016, 0.03827681024908691, 0.0914031667628813, -0.032132782736899325, -0.11849862241808692, 0.0058947429519359005, 0.11640679251180643, 0.005989584140479565, -0.009986387930057673, 0.07175041855025767, -0.08428785985412916, -0.10704916659766721, 0.4483036050775663, -0.05937668199679896, -0.23015118679972704, 0.2366251358123004, -0.018854905077898054, -0.133147817211216, 0.11240003663091076, 0.2294595879068299, 0.16021490335425873, -0.1249357864666016, 0.11464650899810003, 0.0259946106252661, 0.15968938005866165, 0.02263541628457027, -0.026979245629084388, 0.1739428745006052, 0.20894941408428427, 0.08086052266615468, 0.11538124336364047, -0.028290015761740506, -0.1675973156460445, -0.2522079017679231, -0.16292280327876152, -0.13771828462688224, -0.04480392217619219, -0.08280268864933259, -0.2430426689694814, 0.3552040975936568, 0.204310836666143, 0.06656281044465427, 0.019045977936478553, 0.3331436410092705, 0.09712639742291417, 0.08524729557567001, 0.11313185906471984, 0.14453319021816718, 0.13122396613833123, 0.135171120834339, -0.23420789487822188, 0.057470388156772044, 0.1155006321045447] |
1,802.00304 | Distributed Clustering Algorithm for Spatial Data Mining | Distributed data mining techniques and mainly distributed clustering are
widely used in the last decade because they deal with very large and
heterogeneous datasets which cannot be gathered centrally. Current distributed
clustering approaches are normally generating global models by aggregating
local results that are obtained on each site. While this approach mines the
datasets on their locations the aggregation phase is complex, which may produce
incorrect and ambiguous global clusters and therefore incorrect knowledge. In
this paper we propose a new clustering approach for very large spatial datasets
that are heterogeneous and distributed. The approach is based on K-means
Algorithm but it generates the number of global clusters dynamically. Moreover,
this approach uses an elaborated aggregation phase. The aggregation phase is
designed in such a way that the overall process is efficient in time and memory
allocation. Preliminary results show that the proposed approach produces high
quality results and scales up well. We also compared it to two popular
clustering algorithms and show that this approach is much more efficient.
| cs.DB | distributed data mining techniques and mainly distributed clustering are widely used in the last decade because they deal with very large and heterogeneous datasets which cannot be gathered centrally current distributed clustering approaches are normally generating global models by aggregating local results that are obtained on each site while this approach mines the datasets on their locations the aggregation phase is complex which may produce incorrect and ambiguous global clusters and therefore incorrect knowledge in this paper we propose a new clustering approach for very large spatial datasets that are heterogeneous and distributed the approach is based on kmeans algorithm but it generates the number of global clusters dynamically moreover this approach uses an elaborated aggregation phase the aggregation phase is designed in such a way that the overall process is efficient in time and memory allocation preliminary results show that the proposed approach produces high quality results and scales up well we also compared it to two popular clustering algorithms and show that this approach is much more efficient | [['distributed', 'data', 'mining', 'techniques', 'and', 'mainly', 'distributed', 'clustering', 'are', 'widely', 'used', 'in', 'the', 'last', 'decade', 'because', 'they', 'deal', 'with', 'very', 'large', 'and', 'heterogeneous', 'datasets', 'which', 'can', 'not', 'be', 'gathered', 'centrally', 'current', 'distributed', 'clustering', 'approaches', 'are', 'normally', 'generating', 'global', 'models', 'by', 'aggregating', 'local', 'results', 'that', 'are', 'obtained', 'on', 'each', 'site', 'while', 'this', 'approach', 'mines', 'the', 'datasets', 'on', 'their', 'locations', 'the', 'aggregation', 'phase', 'is', 'complex', 'which', 'may', 'produce', 'incorrect', 'and', 'ambiguous', 'global', 'clusters', 'and', 'therefore', 'incorrect', 'knowledge', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'clustering', 'approach', 'for', 'very', 'large', 'spatial', 'datasets', 'that', 'are', 'heterogeneous', 'and', 'distributed', 'the', 'approach', 'is', 'based', 'on', 'kmeans', 'algorithm', 'but', 'it', 'generates', 'the', 'number', 'of', 'global', 'clusters', 'dynamically', 'moreover', 'this', 'approach', 'uses', 'an', 'elaborated', 'aggregation', 'phase', 'the', 'aggregation', 'phase', 'is', 'designed', 'in', 'such', 'a', 'way', 'that', 'the', 'overall', 'process', 'is', 'efficient', 'in', 'time', 'and', 'memory', 'allocation', 'preliminary', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'produces', 'high', 'quality', 'results', 'and', 'scales', 'up', 'well', 'we', 'also', 'compared', 'it', 'to', 'two', 'popular', 'clustering', 'algorithms', 'and', 'show', 'that', 'this', 'approach', 'is', 'much', 'more', 'efficient']] | [-0.07641409679754414, 0.06800649791204695, -0.12023913195324049, 0.08081066285432816, -0.07612073376273726, -0.1292880811314616, 0.024287588470234205, 0.45352556040151076, -0.2734766573759547, -0.34134705750304356, 0.1200402141957168, -0.24824809259054256, -0.18171527594932468, 0.19264222150505111, -0.07522177068946873, 0.035919827492485554, 0.10723057762333, 0.0201085179728287, -0.005791329480118761, -0.31682656677875515, 0.2974811816037965, 0.07774194643413376, 0.37405181887467004, 0.01112468730200801, 0.0763483589456542, -0.04154923500776378, -0.08533136953316542, 0.05608657003538302, -0.046138007783071255, 0.16839098056563181, 0.2729934245270409, 0.177392659531171, 0.295874153792161, -0.4184683089754517, -0.1992703164935831, 0.09489753584742372, 0.1813747485315329, 0.133650094637908, -0.09482633845776126, -0.27322375137707466, 0.13183431195201384, -0.15239561257927478, -0.033078068646749385, -0.15044019302102732, 0.005861426556580945, 0.030715016724081567, -0.28598187940892333, 0.09937198595290225, 0.038942750639347525, -0.009962531885034159, -0.06027119769714773, -0.12273583350953651, 0.04291495130865764, 0.10622185573243258, 0.029713427414947424, 0.028666985972800797, 0.12050967406187403, -0.09701281317580514, -0.11573902312230472, 0.38143599254476745, -0.00074179464003496, -0.19012716309200123, 0.24122719492147845, -0.05519914438087515, -0.1868436801252745, 0.12071831537443295, 0.20136984719075154, 0.15898413947451184, -0.18099242128834825, 0.013651684266978015, -0.03957172769955114, 0.19836284488178135, 0.01837879108341291, -0.002946305262981451, 0.16505457343239532, 0.2159327216751394, 0.10357698995915476, 0.10025585592623626, -0.09059807849599985, -0.1134508288443655, -0.20532630829614373, -0.08824749425195201, -0.20941289122439702, -0.04733561885491087, -0.12423749842847104, -0.15556915179003925, 0.3568644699537092, 0.2152147134745559, 0.21400046593112032, 0.06608860925801932, 0.35167199692400225, 0.067444561392461, 0.09980891830538405, 0.11584018777282527, 0.16972840995165622, -0.0016300005073065472, 0.1338380910823808, -0.14330439419248714, 0.09530891500272494, 0.0057935481046854755] |
1,802.00305 | Polynomial factorization statistics and point configurations in
$\mathbb{R}^3$ | We use generating functions to relate the expected values of polynomial
factorization statistics over $\mathbb{F}_q$ to the cohomology of ordered
configurations in $\mathbb{R}^3$ as a representation of the symmetric group.
Our methods lead to a new proof of the twisted Grothendieck-Lefschetz formula
for squarefree polynomial factorization statistics of Church, Ellenberg, and
Farb.
| math.RT math.CO math.NT | we use generating functions to relate the expected values of polynomial factorization statistics over mathbbf_q to the cohomology of ordered configurations in mathbbr3 as a representation of the symmetric group our methods lead to a new proof of the twisted grothendiecklefschetz formula for squarefree polynomial factorization statistics of church ellenberg and farb | [['we', 'use', 'generating', 'functions', 'to', 'relate', 'the', 'expected', 'values', 'of', 'polynomial', 'factorization', 'statistics', 'over', 'mathbbf_q', 'to', 'the', 'cohomology', 'of', 'ordered', 'configurations', 'in', 'mathbbr3', 'as', 'a', 'representation', 'of', 'the', 'symmetric', 'group', 'our', 'methods', 'lead', 'to', 'a', 'new', 'proof', 'of', 'the', 'twisted', 'grothendiecklefschetz', 'formula', 'for', 'squarefree', 'polynomial', 'factorization', 'statistics', 'of', 'church', 'ellenberg', 'and', 'farb']] | [-0.17422329553832802, 0.05293806886766106, -0.18749677573885912, 0.09706990004409678, -0.10153862952183072, -0.09167649344397852, -0.002734760297104143, 0.27260028975657546, -0.35679191487053263, -0.2064875691637728, 0.05669774111279716, -0.20616962384575835, -0.12975250442440694, 0.21734055017049497, -0.10616701203756608, 0.044146445586822944, 0.009492478131925544, 0.06561325243316017, -0.14712161282435632, -0.333112731611786, 0.35728791818166006, -0.03583502246496769, 0.23964078924976862, 0.05795046748020328, 0.10496681401183686, 0.037513675848738506, -0.032796828873240605, -0.06543434364273427, -0.13807641981671062, 0.16090217327627426, 0.3269965313374996, 0.09297138139104041, 0.21080461409068307, -0.3744884654163168, -0.09206785703113732, 0.18314909782762137, 0.14298328635497734, 0.06379642033089812, 0.004821688151703431, -0.2578091979958117, 0.14553897857415274, -0.23248898033769086, -0.15630362077186313, -0.1189600256486581, 0.05506930205648622, 0.05776598431895344, -0.3207278335466981, 0.012863886470978077, 0.09203920015492119, 0.12679532245517924, -0.053355054455236174, -0.16896658141810733, 0.04581694313450358, 0.07583102981488292, 0.002885356366347808, 0.06014686364393968, 0.044810922019398555, -0.15164690529211208, -0.18875286258900395, 0.3356513447450617, -0.07020552108923976, -0.2093005201134544, 0.07525065443657625, -0.16592404749602652, -0.19972070958465338, 0.11901551864754695, 0.129337572098638, 0.1839038512776964, 0.034212837676302746, 0.16130205168491768, -0.1957263346009243, 0.08086658705948278, 0.14250152464956045, -0.014898407693880681, 0.13610328157217458, 0.001243726833938406, 0.031105644553183362, 0.1736117906581897, 0.0418172711148285, -0.08058808729625665, -0.3220444628968835, -0.1880168837423508, -0.18235851756225413, 0.11341091098550421, -0.13258302817093165, -0.24055842582422954, 0.4429793475339046, 0.12438711427295437, 0.14685680359028852, 0.19717624111889073, 0.21620585626134506, 0.08107638157581767, 0.09107399868886344, 0.009715443450169494, 0.029843897827399466, 0.26640767571874535, 0.03438313426046919, -0.14832016224793804, 0.019126563695653413, 0.2601915764926861] |
1,802.00306 | Nondegenerate multistationarity in small reaction networks | Much attention has been focused in recent years on the following algebraic
problem arising from applications: which chemical reaction networks, when taken
with mass-action kinetics, admit multiple positive steady states? The interest
behind this question is in steady states that are stable. As a step toward this
difficult question, here we address the question of multiple nondegenerate
positive steady states. Mathematically, this asks whether certain families of
parametrized, real, sparse polynomial systems ever admit multiple positive real
roots that are simple. Our main results settle this problem for certain types
of small networks, and our techniques point the way forward for larger
networks.
| math.DS math.AG | much attention has been focused in recent years on the following algebraic problem arising from applications which chemical reaction networks when taken with massaction kinetics admit multiple positive steady states the interest behind this question is in steady states that are stable as a step toward this difficult question here we address the question of multiple nondegenerate positive steady states mathematically this asks whether certain families of parametrized real sparse polynomial systems ever admit multiple positive real roots that are simple our main results settle this problem for certain types of small networks and our techniques point the way forward for larger networks | [['much', 'attention', 'has', 'been', 'focused', 'in', 'recent', 'years', 'on', 'the', 'following', 'algebraic', 'problem', 'arising', 'from', 'applications', 'which', 'chemical', 'reaction', 'networks', 'when', 'taken', 'with', 'massaction', 'kinetics', 'admit', 'multiple', 'positive', 'steady', 'states', 'the', 'interest', 'behind', 'this', 'question', 'is', 'in', 'steady', 'states', 'that', 'are', 'stable', 'as', 'a', 'step', 'toward', 'this', 'difficult', 'question', 'here', 'we', 'address', 'the', 'question', 'of', 'multiple', 'nondegenerate', 'positive', 'steady', 'states', 'mathematically', 'this', 'asks', 'whether', 'certain', 'families', 'of', 'parametrized', 'real', 'sparse', 'polynomial', 'systems', 'ever', 'admit', 'multiple', 'positive', 'real', 'roots', 'that', 'are', 'simple', 'our', 'main', 'results', 'settle', 'this', 'problem', 'for', 'certain', 'types', 'of', 'small', 'networks', 'and', 'our', 'techniques', 'point', 'the', 'way', 'forward', 'for', 'larger', 'networks']] | [-0.12360920198713836, 0.09974604978416006, -0.04792702811328215, 0.06237178024704776, -0.06908926196866533, -0.1903408402441413, 0.026267617823357143, 0.35021748480576914, -0.31648241573022406, -0.24384268094306288, 0.0915129951549495, -0.23388042946535986, -0.2004835936240852, 0.21606691506718403, -0.06946744937540113, 0.11816414230439848, 0.11512370141747508, 0.01960601088889305, -0.006665372701126685, -0.2963458520102595, 0.41131731916164743, -0.024074492085435727, 0.2639600927534613, 0.07769475166586418, 0.10144161323121595, -0.0534340708552706, 0.0037986050423198534, 0.006731781963873836, -0.11245939905093463, 0.11271848155522393, 0.3226632993166489, 0.14946449929803104, 0.35594479927548167, -0.46159130969600193, -0.25476988073149065, 0.20753303373196316, 0.15907176994736696, 0.1518429891122686, -0.049457517277349906, -0.25450515627264253, 0.094121788456602, -0.12411752560184998, -0.12974476682257305, -0.06646277152512729, 0.07641599339532476, -0.010458089786500317, -0.20557850045694526, 0.037458535934825545, 0.1029158112348862, 0.05742361172310357, -0.0631307219652441, -0.13379323071895113, 0.02234368087176812, 0.17168723118126403, 0.024868802748421587, 0.01016478984898128, 0.0702552648930295, -0.09680030830159277, -0.15008536769637784, 0.3496137105055081, 0.01234611663153594, -0.22276333162506806, 0.21364886046938816, -0.10657055750579654, -0.21838023641047258, 0.14978341437261372, 0.1762580009724366, 0.15715419521410634, -0.11092699219959277, 0.0775405004325558, -0.12433301358601277, 0.10231706291777352, 0.09737621529877764, -0.01570520799627383, 0.2184653329319384, 0.14661312179902153, 0.07983580642171854, 0.12262727658137751, 0.024423849879700726, -0.13638057249137064, -0.21440549133949036, -0.09471962402701306, -0.15743364775282087, 0.14033557243138842, -0.04621541248258651, -0.16817769515825418, 0.3965607182986275, 0.10755848742623642, 0.2293585508573547, 0.08171768435073601, 0.2710855789663433, 0.11021969758665859, -0.004408160577193626, 0.051862285585653825, 0.18519440443069646, 0.1350444875277796, 0.13271223517695388, -0.1607571171033784, 0.09572750309457352, 0.034294074762938095] |
1,802.00307 | Applications and homological properties of local rings with decomposable
maximal ideals | We construct a local Cohen-Macaulay ring $R$ with a prime ideal
$\mathfrak{p}\in\spec(R)$ such that $R$ satisfies the uniform Auslander
condition (UAC), but the localization $R_{\mathfrak{p}}$ does not satisfy
Auslander's condition (AC). Given any positive integer $n$, we also construct a
local Cohen-Macaulay ring $R$ with a prime ideal $\mathfrak{p}\in\spec(R)$ such
that $R$ has exactly two non-isomorphic semidualizing modules, but the
localization $R_{\mathfrak{p}}$ has $2^n$ non-isomorphic semidualizing modules.
Each of these examples is constructed as a fiber product of two local rings
over their common residue field. Additionally, we characterize the non-trivial
Cohen-Macaulay fiber products of finite Cohen-Macaulay type.
| math.AC | we construct a local cohenmacaulay ring r with a prime ideal mathfrakpinspecr such that r satisfies the uniform auslander condition uac but the localization r_mathfrakp does not satisfy auslanders condition ac given any positive integer n we also construct a local cohenmacaulay ring r with a prime ideal mathfrakpinspecr such that r has exactly two nonisomorphic semidualizing modules but the localization r_mathfrakp has 2n nonisomorphic semidualizing modules each of these examples is constructed as a fiber product of two local rings over their common residue field additionally we characterize the nontrivial cohenmacaulay fiber products of finite cohenmacaulay type | [['we', 'construct', 'a', 'local', 'cohenmacaulay', 'ring', 'r', 'with', 'a', 'prime', 'ideal', 'mathfrakpinspecr', 'such', 'that', 'r', 'satisfies', 'the', 'uniform', 'auslander', 'condition', 'uac', 'but', 'the', 'localization', 'r_mathfrakp', 'does', 'not', 'satisfy', 'auslanders', 'condition', 'ac', 'given', 'any', 'positive', 'integer', 'n', 'we', 'also', 'construct', 'a', 'local', 'cohenmacaulay', 'ring', 'r', 'with', 'a', 'prime', 'ideal', 'mathfrakpinspecr', 'such', 'that', 'r', 'has', 'exactly', 'two', 'nonisomorphic', 'semidualizing', 'modules', 'but', 'the', 'localization', 'r_mathfrakp', 'has', '2n', 'nonisomorphic', 'semidualizing', 'modules', 'each', 'of', 'these', 'examples', 'is', 'constructed', 'as', 'a', 'fiber', 'product', 'of', 'two', 'local', 'rings', 'over', 'their', 'common', 'residue', 'field', 'additionally', 'we', 'characterize', 'the', 'nontrivial', 'cohenmacaulay', 'fiber', 'products', 'of', 'finite', 'cohenmacaulay', 'type']] | [-0.29530334480902337, 0.02403676587467392, -0.06778379785828292, 0.040574985125810294, -0.0626418010215275, -0.3129843659165393, -0.11996425435063429, 0.3737324185082495, -0.36196884914534166, -0.11268879155250033, 0.1011131697887322, -0.2195249416787798, -0.09208155315476081, 0.15596517407296537, -0.10735040509219591, -0.05756034728741118, 0.05081182271290648, 0.15956339311863607, -0.05101245405482283, -0.3687209892135191, 0.3649725253150488, -0.008340660744579509, 0.20937329488030323, 0.022619582775708597, 0.1274711732112337, 0.034022753447061405, 0.014320107014403524, 0.09471797495401309, -0.24947731089757022, 0.08773598222614964, 0.33082814611649763, 0.09631246879386406, 0.21791655158934495, -0.3644853430838945, -0.06874659584354958, 0.3043549473513849, 0.14257494220510125, -0.007629765129725759, -0.012137072410647912, -0.16884800763364183, 0.20854351273480157, -0.26894522935617715, -0.15432051536239064, -0.09030535586255913, 0.12290005985050811, 0.07787940483346271, -0.31435083748025744, -0.051468815133375756, 0.14432294548896607, 0.19088310197063643, -0.0113600785213445, -0.0618005714204628, -0.06918982583738398, 0.03978003052664766, -0.12061012144598256, -0.028277508231743315, 0.12634305189809916, -0.060691109875430506, -0.10386142617790028, 0.300061129576837, -0.05442743505894517, -0.18226307426084531, 0.17247805486355597, -0.1829655572558598, -0.10112651406476895, 0.1408628347926424, -0.060607026040088385, 0.13979285490252855, -0.007496546643475692, 0.1927085078204982, -0.20859525579726323, 0.08815130478857706, 0.1354987622180488, 0.06714618477902452, 0.16542424025950217, 0.040230595778363444, 0.10432493953036708, 0.1329751822001223, -0.002288063153779755, 0.085133066958709, -0.3639576212250783, -0.19339099353722608, -0.18541108384670224, 0.18737694457392232, -0.13608152791372655, -0.18002171250797497, 0.41741653985809535, 0.05564842818421312, 0.1433060046723161, 0.10622269797992583, 0.22778789307146022, -0.01974752098491687, 0.11906519309801904, 0.07698525017379627, 0.0822022526759459, 0.2231104245681005, -0.04576618150288899, -0.09653242589229194, -0.026655129229766317, 0.1974333715819133] |
1,802.00308 | ChronoNet: A Deep Recurrent Neural Network for Abnormal EEG
Identification | Brain-related disorders such as epilepsy can be diagnosed by analyzing
electroencephalograms (EEG). However, manual analysis of EEG data requires
highly trained clinicians, and is a procedure that is known to have relatively
low inter-rater agreement (IRA). Moreover, the volume of the data and the rate
at which new data becomes available make manual interpretation a
time-consuming, resource-hungry, and expensive process. In contrast, automated
analysis of EEG data offers the potential to improve the quality of patient
care by shortening the time to diagnosis and reducing manual error. In this
paper, we focus on one of the first steps in interpreting an EEG session -
identifying whether the brain activity is abnormal or normal. To solve this
task, we propose a novel recurrent neural network (RNN) architecture termed
ChronoNet which is inspired by recent developments from the field of image
classification and designed to work efficiently with EEG data. ChronoNet is
formed by stacking multiple 1D convolution layers followed by deep gated
recurrent unit (GRU) layers where each 1D convolution layer uses multiple
filters of exponentially varying lengths and the stacked GRU layers are densely
connected in a feed-forward manner. We used the recently released TUH Abnormal
EEG Corpus dataset for evaluating the performance of ChronoNet. Unlike previous
studies using this dataset, ChronoNet directly takes time-series EEG as input
and learns meaningful representations of brain activity patterns. ChronoNet
outperforms the previously reported best results by 7.79% thereby setting a new
benchmark for this dataset. Furthermore, we demonstrate the domain-independent
nature of ChronoNet by successfully applying it to classify speech commands.
| eess.SP cs.LG | brainrelated disorders such as epilepsy can be diagnosed by analyzing electroencephalograms eeg however manual analysis of eeg data requires highly trained clinicians and is a procedure that is known to have relatively low interrater agreement ira moreover the volume of the data and the rate at which new data becomes available make manual interpretation a timeconsuming resourcehungry and expensive process in contrast automated analysis of eeg data offers the potential to improve the quality of patient care by shortening the time to diagnosis and reducing manual error in this paper we focus on one of the first steps in interpreting an eeg session identifying whether the brain activity is abnormal or normal to solve this task we propose a novel recurrent neural network rnn architecture termed chrononet which is inspired by recent developments from the field of image classification and designed to work efficiently with eeg data chrononet is formed by stacking multiple 1d convolution layers followed by deep gated recurrent unit gru layers where each 1d convolution layer uses multiple filters of exponentially varying lengths and the stacked gru layers are densely connected in a feedforward manner we used the recently released tuh abnormal eeg corpus dataset for evaluating the performance of chrononet unlike previous studies using this dataset chrononet directly takes timeseries eeg as input and learns meaningful representations of brain activity patterns chrononet outperforms the previously reported best results by 779 thereby setting a new benchmark for this dataset furthermore we demonstrate the domainindependent nature of chrononet by successfully applying it to classify speech commands | [['brainrelated', 'disorders', 'such', 'as', 'epilepsy', 'can', 'be', 'diagnosed', 'by', 'analyzing', 'electroencephalograms', 'eeg', 'however', 'manual', 'analysis', 'of', 'eeg', 'data', 'requires', 'highly', 'trained', 'clinicians', 'and', 'is', 'a', 'procedure', 'that', 'is', 'known', 'to', 'have', 'relatively', 'low', 'interrater', 'agreement', 'ira', 'moreover', 'the', 'volume', 'of', 'the', 'data', 'and', 'the', 'rate', 'at', 'which', 'new', 'data', 'becomes', 'available', 'make', 'manual', 'interpretation', 'a', 'timeconsuming', 'resourcehungry', 'and', 'expensive', 'process', 'in', 'contrast', 'automated', 'analysis', 'of', 'eeg', 'data', 'offers', 'the', 'potential', 'to', 'improve', 'the', 'quality', 'of', 'patient', 'care', 'by', 'shortening', 'the', 'time', 'to', 'diagnosis', 'and', 'reducing', 'manual', 'error', 'in', 'this', 'paper', 'we', 'focus', 'on', 'one', 'of', 'the', 'first', 'steps', 'in', 'interpreting', 'an', 'eeg', 'session', 'identifying', 'whether', 'the', 'brain', 'activity', 'is', 'abnormal', 'or', 'normal', 'to', 'solve', 'this', 'task', 'we', 'propose', 'a', 'novel', 'recurrent', 'neural', 'network', 'rnn', 'architecture', 'termed', 'chrononet', 'which', 'is', 'inspired', 'by', 'recent', 'developments', 'from', 'the', 'field', 'of', 'image', 'classification', 'and', 'designed', 'to', 'work', 'efficiently', 'with', 'eeg', 'data', 'chrononet', 'is', 'formed', 'by', 'stacking', 'multiple', '1d', 'convolution', 'layers', 'followed', 'by', 'deep', 'gated', 'recurrent', 'unit', 'gru', 'layers', 'where', 'each', '1d', 'convolution', 'layer', 'uses', 'multiple', 'filters', 'of', 'exponentially', 'varying', 'lengths', 'and', 'the', 'stacked', 'gru', 'layers', 'are', 'densely', 'connected', 'in', 'a', 'feedforward', 'manner', 'we', 'used', 'the', 'recently', 'released', 'tuh', 'abnormal', 'eeg', 'corpus', 'dataset', 'for', 'evaluating', 'the', 'performance', 'of', 'chrononet', 'unlike', 'previous', 'studies', 'using', 'this', 'dataset', 'chrononet', 'directly', 'takes', 'timeseries', 'eeg', 'as', 'input', 'and', 'learns', 'meaningful', 'representations', 'of', 'brain', 'activity', 'patterns', 'chrononet', 'outperforms', 'the', 'previously', 'reported', 'best', 'results', 'by', '779', 'thereby', 'setting', 'a', 'new', 'benchmark', 'for', 'this', 'dataset', 'furthermore', 'we', 'demonstrate', 'the', 'domainindependent', 'nature', 'of', 'chrononet', 'by', 'successfully', 'applying', 'it', 'to', 'classify', 'speech', 'commands']] | [-0.06473417541593342, 0.03029787757795154, -0.03134925510597148, 0.05787946712459324, -0.11681043725305547, -0.19921494844412907, 0.06085668876270814, 0.43655307793108994, -0.2441844532190454, -0.31647605847052024, 0.10366472430787115, -0.28210443352500714, -0.20855685180552166, 0.22248134934686326, -0.13017757993747386, 0.08431208539436492, 0.14818854518992783, 0.03888165241092906, -0.01762718125178782, -0.2604431864253224, 0.271405643065164, 0.04779096417814446, 0.35041397623356807, -0.03292964267826011, 0.07705111225007477, -0.010397254977584636, -0.07505797485601204, -0.03552610817403251, -0.022161294131900964, 0.15779650124947742, 0.3258744279642828, 0.157819529966444, 0.3095235512709216, -0.46604148243272375, -0.2507637125519357, 0.05800187565763517, 0.152479536315632, 0.07825406870079162, -0.01616975518761116, -0.3537792221412005, 0.11223424777348866, -0.13765777225331802, 0.025579987413271568, -0.11655111067617933, -0.0006394892937301608, -0.04375217848659543, -0.296422398244861, 0.10548802543983817, 0.03724699765768682, 0.10427236267231954, -0.05911535829172087, -0.07897250524175159, 0.014094716246608038, 0.19211477558796344, 0.04232957525674683, 0.10227907482036498, 0.14167028391052872, -0.14052176555481471, -0.1195237525109772, 0.2839979594808014, -0.039456055718907264, -0.16983384502304413, 0.18447862002572638, -0.041047704987256795, -0.1528498066784164, 0.10271336984741249, 0.19782558031282713, 0.0894499595869015, -0.21862946217789408, -0.026958812550346496, 0.002743696645912967, 0.2018259861104934, 0.05866793740397254, -0.04627210562695075, 0.14279812885684778, 0.2868055669200975, -0.05493728559921755, 0.16605551077378733, -0.1659268922589416, 0.00865348776470321, -0.18760035007645182, -0.10357112976020318, -0.18777993282974634, -0.010572707986679333, -0.05610343890023001, -0.14542269476602765, 0.4315969919020584, 0.17932154790339486, 0.22299135777767198, 0.08695365248388763, 0.33380481785130794, 0.028052932316574537, 0.1507239337487583, 0.06043199381981471, 0.155541765622708, 0.02152464577482378, 0.1458253349672079, -0.1707925114703054, 0.11161718479684345, 0.04408977416798819] |
1,802.00309 | Gauss-Bonnet Dyonic Black Holes: geometry, thermodynamics and test
particles' trajectories | In this paper, we investigate a class of $5$-dimensional black holes in the
presence of Gauss-Bonnet gravity with dyonic charges. At first step,
thermodynamical quantities of the black holes and their behaviors are explored
for different limits. Thermal stability and the possibility of the van der
Waals like phase transition are addressed and the effects of different
parameters on them are investigated. The second part is devoted to simulation
of the trajectory of particles around these black holes and investigation of
the angular frequency of particles' motion. The main goal is understanding the
effects of higher curvature gravity (Gauss-Bonnet gravity) and magnetic charge
on the structure of black holes and the geodesic paths of particles moving
around these black holes.
| gr-qc hep-th | in this paper we investigate a class of 5dimensional black holes in the presence of gaussbonnet gravity with dyonic charges at first step thermodynamical quantities of the black holes and their behaviors are explored for different limits thermal stability and the possibility of the van der waals like phase transition are addressed and the effects of different parameters on them are investigated the second part is devoted to simulation of the trajectory of particles around these black holes and investigation of the angular frequency of particles motion the main goal is understanding the effects of higher curvature gravity gaussbonnet gravity and magnetic charge on the structure of black holes and the geodesic paths of particles moving around these black holes | [['in', 'this', 'paper', 'we', 'investigate', 'a', 'class', 'of', '5dimensional', 'black', 'holes', 'in', 'the', 'presence', 'of', 'gaussbonnet', 'gravity', 'with', 'dyonic', 'charges', 'at', 'first', 'step', 'thermodynamical', 'quantities', 'of', 'the', 'black', 'holes', 'and', 'their', 'behaviors', 'are', 'explored', 'for', 'different', 'limits', 'thermal', 'stability', 'and', 'the', 'possibility', 'of', 'the', 'van', 'der', 'waals', 'like', 'phase', 'transition', 'are', 'addressed', 'and', 'the', 'effects', 'of', 'different', 'parameters', 'on', 'them', 'are', 'investigated', 'the', 'second', 'part', 'is', 'devoted', 'to', 'simulation', 'of', 'the', 'trajectory', 'of', 'particles', 'around', 'these', 'black', 'holes', 'and', 'investigation', 'of', 'the', 'angular', 'frequency', 'of', 'particles', 'motion', 'the', 'main', 'goal', 'is', 'understanding', 'the', 'effects', 'of', 'higher', 'curvature', 'gravity', 'gaussbonnet', 'gravity', 'and', 'magnetic', 'charge', 'on', 'the', 'structure', 'of', 'black', 'holes', 'and', 'the', 'geodesic', 'paths', 'of', 'particles', 'moving', 'around', 'these', 'black', 'holes']] | [-0.1955798333316731, 0.14474339589942248, -0.03899754647864029, 0.09211600296063503, -0.049908594717271625, -0.084563244782233, 0.0030068277825193944, 0.2875533292729718, -0.16892197798782338, -0.32428072318434714, 0.055594861288166916, -0.3513985341996886, -0.10887893796898425, 0.16985309194618214, -0.031034924408110478, 0.04985173216555268, -0.035469607030972836, 0.011667638423386962, -0.06329021186878284, -0.21051968095319656, 0.41261728268103376, 0.08860652771157523, 0.21594425212048615, 0.03339144263494139, 0.07762196679056312, -0.031045171315781772, 0.009315839456394314, 0.0821897514979355, -0.21303748534992337, 0.08564337151280293, 0.16012440733223532, 0.014090399750663589, 0.22854933092021384, -0.4388283827342093, -0.22808199107336502, 0.05863904522460264, 0.12357094083854463, 0.15996734878669183, -0.1001244477869477, -0.27948236629987755, 0.0687555649278996, -0.17227124734781682, -0.14455718632477024, -0.0383058813555787, 0.05242386144236662, 0.008432522462680937, -0.1500063076367951, 0.11481538570175569, 0.09929761087987572, -0.05941161690279841, -0.11882414367282763, -0.07875714664502691, -0.05902433899464086, 0.1518542139674537, 0.14104763011370475, -0.03987724097096361, 0.20976925300589452, -0.12634308516474752, -0.10156430685116599, 0.394325768307317, -0.0330408504155154, -0.1768055446445942, 0.19290513978339732, -0.24895560255584617, -0.11561073375244936, 0.0964649918411548, 0.1861648532251517, 0.22333377608447336, -0.1525035426830679, 0.11725847851970078, 0.08333168515237048, 0.12173020137900797, 0.12021250759329026, 0.08936705647502094, 0.4194712957794157, 0.140434373934598, -0.01398680176741133, 0.16308913937148947, -0.06950603072012503, -0.10276455839630216, -0.29402587142540143, -0.19590124015909774, -0.16967774903556954, 0.04643549632746726, -0.16943849958794696, -0.18324776745478932, 0.3630890130065382, 0.12622914183108758, 0.13833187367223823, 0.010725802625529468, 0.2413346150989734, 0.050234350597020236, 0.007736943955145155, 0.058252023125533015, 0.35650157813797706, 0.14660611798559936, 0.14473456954001448, -0.2742469759446976, -0.05565694216832829, 0.11963976515301813] |
1,802.0031 | Cavity formation in confined growing crystals | Growing crystals form a cavity when placed against a wall. The birth of the
cavity is observed both by optical microscopy of sodium chlorate crystals
(NaClO$_3$) growing in the vicinity of a glass surface, and in simulations with
a thin film model. The cavity appears when growth cannot be maintained in the
center of the contact region due to an insufficient supply of growth units
through the liquid film between the crystal and the wall. We obtain a
non-equilibrium morphology diagram characterizing the conditions under which a
cavity appears. Cavity formation is a generic phenomenon at the origin of the
formation of growth rims observed in many experiments, and is a source of
complexity for the morphology of growing crystals in natural environments. Our
results also provide restrictions for the conditions under which compact
crystals can grow in confinement.
| cond-mat.other physics.geo-ph | growing crystals form a cavity when placed against a wall the birth of the cavity is observed both by optical microscopy of sodium chlorate crystals naclo_3 growing in the vicinity of a glass surface and in simulations with a thin film model the cavity appears when growth cannot be maintained in the center of the contact region due to an insufficient supply of growth units through the liquid film between the crystal and the wall we obtain a nonequilibrium morphology diagram characterizing the conditions under which a cavity appears cavity formation is a generic phenomenon at the origin of the formation of growth rims observed in many experiments and is a source of complexity for the morphology of growing crystals in natural environments our results also provide restrictions for the conditions under which compact crystals can grow in confinement | [['growing', 'crystals', 'form', 'a', 'cavity', 'when', 'placed', 'against', 'a', 'wall', 'the', 'birth', 'of', 'the', 'cavity', 'is', 'observed', 'both', 'by', 'optical', 'microscopy', 'of', 'sodium', 'chlorate', 'crystals', 'naclo_3', 'growing', 'in', 'the', 'vicinity', 'of', 'a', 'glass', 'surface', 'and', 'in', 'simulations', 'with', 'a', 'thin', 'film', 'model', 'the', 'cavity', 'appears', 'when', 'growth', 'can', 'not', 'be', 'maintained', 'in', 'the', 'center', 'of', 'the', 'contact', 'region', 'due', 'to', 'an', 'insufficient', 'supply', 'of', 'growth', 'units', 'through', 'the', 'liquid', 'film', 'between', 'the', 'crystal', 'and', 'the', 'wall', 'we', 'obtain', 'a', 'nonequilibrium', 'morphology', 'diagram', 'characterizing', 'the', 'conditions', 'under', 'which', 'a', 'cavity', 'appears', 'cavity', 'formation', 'is', 'a', 'generic', 'phenomenon', 'at', 'the', 'origin', 'of', 'the', 'formation', 'of', 'growth', 'rims', 'observed', 'in', 'many', 'experiments', 'and', 'is', 'a', 'source', 'of', 'complexity', 'for', 'the', 'morphology', 'of', 'growing', 'crystals', 'in', 'natural', 'environments', 'our', 'results', 'also', 'provide', 'restrictions', 'for', 'the', 'conditions', 'under', 'which', 'compact', 'crystals', 'can', 'grow', 'in', 'confinement']] | [-0.12565559835555098, 0.171060956358887, -0.09869994707874578, -0.029003587962637436, -0.02162122716725194, -0.0994027376764541, 0.037167992101556774, 0.37864919448469886, -0.24662922720739738, -0.26918508577421846, 0.12404393133198133, -0.2487877249288902, -0.0914103768417518, 0.21310119479794135, -0.02420096888844252, 0.00966693359098846, -0.0006247056185823979, -0.017693361644122226, -0.03967203179930451, -0.19555944797629826, 0.27372642411522086, 0.04791000112493375, 0.3353348362574474, 0.09264061694023394, 0.06513898382834393, -0.06959477017412512, 0.09535872614640983, 0.027332660246292037, -0.17655186062316885, 0.07153523289900032, 0.21116534470439816, 0.0022050331232787894, 0.2414328146645491, -0.48632645194264623, -0.23353018556058192, 0.04950485205639609, 0.16391906771212547, 0.12477433971102557, -0.12579700538365962, -0.23987916386820268, 0.05461611391695069, -0.11906146846390028, -0.17066119183457906, 0.039457040578219034, 0.005947305861083295, 0.018234230895575285, -0.24730757627135358, 0.058586471831122845, 0.05802921375608165, 0.07366206501644078, -0.09969850130070992, 0.011308439214137657, -0.06849309687650086, 0.08391321489960961, 0.020061586834423297, 0.027794807499422015, 0.20462882746238825, -0.19326236766005914, -0.05854126935650548, 0.4096334352687323, -0.0526581094466257, -0.14593491975329867, 0.2310442787548192, -0.22591870678789752, -0.06921701587522201, 0.17533444000153448, 0.1478340315239725, 0.07632958436746606, -0.12008032398805082, 0.0472584824222676, -0.043894122873948845, 0.20359603477484486, 0.10649700400841644, 0.02656899003325392, 0.2737492114077691, 0.2393734274639768, 0.010623229385718783, 0.21231673751445151, -0.10287341400109928, -0.05704591995466956, -0.2573008697560365, -0.16663882070013303, -0.16705557173319, 0.008799882006112036, -0.100300475897744, -0.20057381113418277, 0.3403235461693525, 0.04773771429179813, 0.1882880842212668, -0.03029471590089873, 0.2237006052088984, 0.06419787325028652, 0.10978169367387355, 0.031890961539214675, 0.25364509844321675, 0.15295727076276922, 0.09552423824338835, -0.26348438865351054, 0.10637793610569277, -0.027741900082382795] |
1,802.00311 | Quantification of systemic risk from overlapping portfolios in the
financial system | Financial markets are exposed to systemic risk, the risk that a substantial
fraction of the system ceases to function and collapses. Systemic risk can
propagate through different mechanisms and channels of contagion. One important
form of financial contagion arises from indirect interconnections between
financial institutions mediated by financial markets. This indirect
interconnection occurs when financial institutions invest in common assets and
is referred to as overlapping portfolios. In this work we quantify systemic
risk from indirect interconnections between financial institutions. Having
complete information of security holdings of major Mexican financial
intermediaries and the ability to uniquely identify securities in their
portfolios, allows us to represent the Mexican financial system as a bipartite
network of securities and financial institutions. This makes it possible to
quantify systemic risk arising from overlapping portfolios. We show that
focusing only on direct exposures underestimates total systemic risk levels by
up to 50%. By representing the financial system as a multi-layer network of
direct exposures (default contagion) and indirect exposures (overlapping
portfolios) we estimate the mutual influence of different channels of
contagion. The method presented here is the first objective data-driven
quantification of systemic risk on national scales that includes overlapping
portfolios.
| q-fin.RM | financial markets are exposed to systemic risk the risk that a substantial fraction of the system ceases to function and collapses systemic risk can propagate through different mechanisms and channels of contagion one important form of financial contagion arises from indirect interconnections between financial institutions mediated by financial markets this indirect interconnection occurs when financial institutions invest in common assets and is referred to as overlapping portfolios in this work we quantify systemic risk from indirect interconnections between financial institutions having complete information of security holdings of major mexican financial intermediaries and the ability to uniquely identify securities in their portfolios allows us to represent the mexican financial system as a bipartite network of securities and financial institutions this makes it possible to quantify systemic risk arising from overlapping portfolios we show that focusing only on direct exposures underestimates total systemic risk levels by up to 50 by representing the financial system as a multilayer network of direct exposures default contagion and indirect exposures overlapping portfolios we estimate the mutual influence of different channels of contagion the method presented here is the first objective datadriven quantification of systemic risk on national scales that includes overlapping portfolios | [['financial', 'markets', 'are', 'exposed', 'to', 'systemic', 'risk', 'the', 'risk', 'that', 'a', 'substantial', 'fraction', 'of', 'the', 'system', 'ceases', 'to', 'function', 'and', 'collapses', 'systemic', 'risk', 'can', 'propagate', 'through', 'different', 'mechanisms', 'and', 'channels', 'of', 'contagion', 'one', 'important', 'form', 'of', 'financial', 'contagion', 'arises', 'from', 'indirect', 'interconnections', 'between', 'financial', 'institutions', 'mediated', 'by', 'financial', 'markets', 'this', 'indirect', 'interconnection', 'occurs', 'when', 'financial', 'institutions', 'invest', 'in', 'common', 'assets', 'and', 'is', 'referred', 'to', 'as', 'overlapping', 'portfolios', 'in', 'this', 'work', 'we', 'quantify', 'systemic', 'risk', 'from', 'indirect', 'interconnections', 'between', 'financial', 'institutions', 'having', 'complete', 'information', 'of', 'security', 'holdings', 'of', 'major', 'mexican', 'financial', 'intermediaries', 'and', 'the', 'ability', 'to', 'uniquely', 'identify', 'securities', 'in', 'their', 'portfolios', 'allows', 'us', 'to', 'represent', 'the', 'mexican', 'financial', 'system', 'as', 'a', 'bipartite', 'network', 'of', 'securities', 'and', 'financial', 'institutions', 'this', 'makes', 'it', 'possible', 'to', 'quantify', 'systemic', 'risk', 'arising', 'from', 'overlapping', 'portfolios', 'we', 'show', 'that', 'focusing', 'only', 'on', 'direct', 'exposures', 'underestimates', 'total', 'systemic', 'risk', 'levels', 'by', 'up', 'to', '50', 'by', 'representing', 'the', 'financial', 'system', 'as', 'a', 'multilayer', 'network', 'of', 'direct', 'exposures', 'default', 'contagion', 'and', 'indirect', 'exposures', 'overlapping', 'portfolios', 'we', 'estimate', 'the', 'mutual', 'influence', 'of', 'different', 'channels', 'of', 'contagion', 'the', 'method', 'presented', 'here', 'is', 'the', 'first', 'objective', 'datadriven', 'quantification', 'of', 'systemic', 'risk', 'on', 'national', 'scales', 'that', 'includes', 'overlapping', 'portfolios']] | [-0.10906468130819195, 0.03258320590604705, -0.07222465882362912, 0.17702735640638395, -0.11115112161853027, -0.10743717150762677, 0.14032502508745187, 0.4144473382537918, -0.29482090472937467, -0.25963161250205746, 0.12792969558789508, -0.3482698006853158, -0.1572581206971651, 0.13807072449589566, -0.1300074300438888, 0.001496886411605745, 0.026634578340050136, -0.0581087166365065, 0.11029581149668215, -0.2658414644977952, 0.31038778700998854, 0.07806680873701614, 0.302576947840862, 0.061388321465584546, 0.10730614541282602, -0.000502025264277294, -0.08731206647020631, 0.0026603141711663684, -0.10773563369741392, 0.20018041916951843, 0.3945270917480526, 0.15510637570429137, 0.5022997231383726, -0.4444482139862922, -0.15424039415368923, 0.15434749803638884, 0.011946678539376934, 0.030262626184872826, 0.10692538599821036, -0.3369032803077099, -0.06698584981614306, -0.3192411958933713, -0.09046131852635286, -0.07089728504842223, 0.02590741184825192, 0.01261363251191773, -0.279780973471245, 0.1369275393520425, -0.04753166458769036, 0.0838502306700209, -0.033210658592145836, -0.10221789254182094, -0.11433913671810712, 0.18920575466190526, 0.16251444495972056, -0.12035928189526407, 0.2300468884795733, -0.11340705810081479, -0.17493985691202843, 0.3394899227684934, -0.05412463373171964, -0.09550056084681645, 0.17377582665863067, -0.12026557334632214, -0.1095439278477879, 0.13735466188637122, 0.29708959038217303, -0.05975492018374747, -0.22570947151340376, -0.03188806025213942, -0.005536519418641621, 0.17450759962096582, 0.09787151715195529, 0.016268506244642243, 0.15890039651469345, 0.16966196923957405, 0.17095054039014124, 0.1336072257181513, -0.07180410623312833, -0.18068375493244182, -0.23659310012352558, -0.10588437230658851, -0.09762245784893785, 0.051891541407842724, -0.15406941991624284, -0.17732681906829606, 0.390674300664057, 0.16662750752614242, 0.1032358819407373, 0.044660819623125146, 0.26454143071243047, 0.0576094977666947, 0.06128846911347604, 0.03752374245157959, 0.21728251407835253, 0.0014582492164051046, 0.09089436554955793, -0.12513258994309878, 0.25115222885387434, -0.07906570338539551] |
1,802.00312 | Digitalization of Swedish Government Agencies - A Perspective Through
the Lens of a Software Development Census | Software engineering is at the core of the digitalization of society.
Ill-informed decisions can have major consequences, as made evident in the 2017
government crisis in Sweden, originating in a data breach caused by an
outsourcing deal made by the Swedish Transport Agency. Many Government Agencies
(GovAgs) in Sweden are rapidly undergoing a digital transition, thus it is
important to overview how widespread, and mature, software development is in
this part of the public sector. We present a software development census of
Swedish GovAgs, complemented by document analysis and a survey. We show that
39.2% of the GovAgs develop software internally, some matching the number of
developers in large companies. Our findings suggest that the development
largely resembles private sector counterparts, and that established best
practices are implemented. Still, we identify improvement potential in the
areas of strategic sourcing, openness, collaboration across GovAgs, and quality
requirements. The Swedish Government has announced the establishment of a new
digitalization agency next year, and our hope is that the software engineering
community will contribute its expertise with a clear voice.
| cs.SE | software engineering is at the core of the digitalization of society illinformed decisions can have major consequences as made evident in the 2017 government crisis in sweden originating in a data breach caused by an outsourcing deal made by the swedish transport agency many government agencies govags in sweden are rapidly undergoing a digital transition thus it is important to overview how widespread and mature software development is in this part of the public sector we present a software development census of swedish govags complemented by document analysis and a survey we show that 392 of the govags develop software internally some matching the number of developers in large companies our findings suggest that the development largely resembles private sector counterparts and that established best practices are implemented still we identify improvement potential in the areas of strategic sourcing openness collaboration across govags and quality requirements the swedish government has announced the establishment of a new digitalization agency next year and our hope is that the software engineering community will contribute its expertise with a clear voice | [['software', 'engineering', 'is', 'at', 'the', 'core', 'of', 'the', 'digitalization', 'of', 'society', 'illinformed', 'decisions', 'can', 'have', 'major', 'consequences', 'as', 'made', 'evident', 'in', 'the', '2017', 'government', 'crisis', 'in', 'sweden', 'originating', 'in', 'a', 'data', 'breach', 'caused', 'by', 'an', 'outsourcing', 'deal', 'made', 'by', 'the', 'swedish', 'transport', 'agency', 'many', 'government', 'agencies', 'govags', 'in', 'sweden', 'are', 'rapidly', 'undergoing', 'a', 'digital', 'transition', 'thus', 'it', 'is', 'important', 'to', 'overview', 'how', 'widespread', 'and', 'mature', 'software', 'development', 'is', 'in', 'this', 'part', 'of', 'the', 'public', 'sector', 'we', 'present', 'a', 'software', 'development', 'census', 'of', 'swedish', 'govags', 'complemented', 'by', 'document', 'analysis', 'and', 'a', 'survey', 'we', 'show', 'that', '392', 'of', 'the', 'govags', 'develop', 'software', 'internally', 'some', 'matching', 'the', 'number', 'of', 'developers', 'in', 'large', 'companies', 'our', 'findings', 'suggest', 'that', 'the', 'development', 'largely', 'resembles', 'private', 'sector', 'counterparts', 'and', 'that', 'established', 'best', 'practices', 'are', 'implemented', 'still', 'we', 'identify', 'improvement', 'potential', 'in', 'the', 'areas', 'of', 'strategic', 'sourcing', 'openness', 'collaboration', 'across', 'govags', 'and', 'quality', 'requirements', 'the', 'swedish', 'government', 'has', 'announced', 'the', 'establishment', 'of', 'a', 'new', 'digitalization', 'agency', 'next', 'year', 'and', 'our', 'hope', 'is', 'that', 'the', 'software', 'engineering', 'community', 'will', 'contribute', 'its', 'expertise', 'with', 'a', 'clear', 'voice']] | [-0.12384000233247537, 0.06672824814259828, -0.06622939185697098, 0.05779845621741102, -0.12146375860637901, -0.0852804560629672, 0.05978991208063566, 0.3549923744338395, -0.20531743855405116, -0.34669966670282354, 0.1729904417039837, -0.31418687441989523, -0.15127086533307607, 0.20794598502636125, -0.1377906524854056, 0.003780728978282158, 0.1102553470144895, -0.04001927742766301, 0.05335230177677824, -0.26330249991521915, 0.27469079808691854, 0.09924894043202089, 0.3541044578345133, 0.08493272151364098, 0.018324625382692004, -0.027952190993925218, -0.11397045705565358, -0.025710811419313275, -0.08221998397973286, 0.16244278366271334, 0.37756347113331273, 0.24995478850641203, 0.40054661032362754, -0.4207514975516295, -0.15567218280788933, 0.03291419229009824, 0.10498302233728199, 0.04304512581967918, -0.08356460037545978, -0.3369325797168792, 0.009141761110764823, -0.2650352552445838, -0.1671461221809626, -0.060197666369442064, 0.0169557920969303, -0.007092430566858225, -0.17793546065645802, -0.023280299365896182, -0.005370649887481704, 0.146612740789847, -0.02664430158024929, -0.11676994396574711, -0.04675750010805628, 0.22148949512682686, 0.07607763935629919, 0.06788562162017281, 0.1456668136227315, -0.16586399798821236, -0.1347093190058579, 0.367162355986445, -0.02400578693380918, -0.04544661253748927, 0.1658880584413551, -0.12027718198739669, -0.19884426190930587, 0.07098900059579384, 0.19686820993824353, -0.013629229659934274, -0.20722077451170084, 0.06274590863606798, 0.00554276185919827, 0.20589703786973504, 0.050014490663835946, -0.029574572860093958, 0.23872121788603676, 0.21511831867213582, 0.05756665077900503, 0.10580081010068004, -0.01862831113447266, -0.11205700247426814, -0.25144295827207813, -0.16651712753148537, -0.11511278126536953, 0.018912467255921165, 0.013641347352363069, -0.1340120019766883, 0.3697501856632615, 0.1801673637449064, 0.05874865850703579, -0.033785460736577407, 0.31120018938566896, -0.02076871946271488, 0.10891511193635366, 0.10393241784582972, 0.24696966091555209, -0.00938377407411198, 0.22249807126883586, -0.13121169358915227, 0.1329123001381628, -0.037612406801517034] |
1,802.00313 | Gravitational Baryogenesis in Ho$\check{r}$ava-Lifshitz gravity | In this work we intend to address the matter-antimatter asymmetry via the
gravitational baryogenesis mechanism in the background of a quantum theory of
gravity. We investigate this mechanism under the framework of
Ho$\check{r}$ava-Lifshitz gravity. We will compute the baryon-to-entropy ratio
in the chosen framework and investigate its physical viability against the
observational bounds. We also conduct the above study for various sources of
matter like scalar field and Chaplygin gas as specific examples. We speculate
that quantum corrections from the background geometry will lead to interesting
results.
| gr-qc | in this work we intend to address the matterantimatter asymmetry via the gravitational baryogenesis mechanism in the background of a quantum theory of gravity we investigate this mechanism under the framework of hocheckravalifshitz gravity we will compute the baryontoentropy ratio in the chosen framework and investigate its physical viability against the observational bounds we also conduct the above study for various sources of matter like scalar field and chaplygin gas as specific examples we speculate that quantum corrections from the background geometry will lead to interesting results | [['in', 'this', 'work', 'we', 'intend', 'to', 'address', 'the', 'matterantimatter', 'asymmetry', 'via', 'the', 'gravitational', 'baryogenesis', 'mechanism', 'in', 'the', 'background', 'of', 'a', 'quantum', 'theory', 'of', 'gravity', 'we', 'investigate', 'this', 'mechanism', 'under', 'the', 'framework', 'of', 'hocheckravalifshitz', 'gravity', 'we', 'will', 'compute', 'the', 'baryontoentropy', 'ratio', 'in', 'the', 'chosen', 'framework', 'and', 'investigate', 'its', 'physical', 'viability', 'against', 'the', 'observational', 'bounds', 'we', 'also', 'conduct', 'the', 'above', 'study', 'for', 'various', 'sources', 'of', 'matter', 'like', 'scalar', 'field', 'and', 'chaplygin', 'gas', 'as', 'specific', 'examples', 'we', 'speculate', 'that', 'quantum', 'corrections', 'from', 'the', 'background', 'geometry', 'will', 'lead', 'to', 'interesting', 'results']] | [-0.12337938779710803, 0.11520801184313564, -0.1128651524262353, 0.15011854110895817, -0.07557616581947639, -0.1128228773180952, 0.030935117795571, 0.305646480799749, -0.22657824287340902, -0.30343938920775365, 0.059597311976322925, -0.24170773456023, -0.1669198826715436, 0.17184175884929195, -0.05519557669330603, 0.019025332951415116, -0.04297492624763614, -0.0007698212632502632, -0.05093384932608868, -0.2525361853855095, 0.36809445006087765, 0.12752300679640866, 0.2493234627442595, 0.10724931698621668, 0.060185343466014014, -0.08709240914590058, -0.05098475312985394, 0.003623458803042598, -0.22159167022978546, 0.05623244856559168, 0.17061531816705547, 0.15982027395746146, 0.21424490414110237, -0.4406199733801614, -0.24203486352002826, 0.14556696447383227, 0.11055355427797413, 0.17185643857516264, -0.10973921843172832, -0.2813941054260251, 0.07828654117625335, -0.20609326349121743, -0.14961436899357486, -0.0957553656397109, -0.04803979303018757, -0.049012754623639, -0.2247093198125133, 0.055977090451553274, 0.018234979115083986, -0.043991481598959055, -0.0881114117172279, -0.049591011003773104, 0.051983241113598574, 0.05482706694660344, 0.1124988270645169, -0.008538088571258831, 0.17112400477495174, -0.18498687271092987, -0.11586274744155978, 0.42722980682363454, -0.1363646057594953, -0.18101948050075564, 0.1572697056328942, -0.16008718444526882, -0.1750950122455499, 0.007368846874063213, 0.21559743011228463, 0.10580874495904079, -0.14450099449283604, 0.12566415858374716, -0.017408479256662487, 0.10903971059376309, 0.040361610958459734, 0.06927967892060506, 0.3104691670286929, 0.11117411812703157, 0.01165556435569607, 0.19026798827991145, -0.10062438986082187, -0.10111963093794625, -0.3889609867835353, -0.15838541264977607, -0.0837588925757606, 0.05215177126764052, -0.09141324675105374, -0.11065523572943184, 0.3775979346948965, 0.24619912620297307, 0.1733130268302971, 0.005785176910502815, 0.29696258264540254, 0.06499130254204588, 0.005989400996430509, 0.02764768389471132, 0.30924500951051026, 0.15351588738247238, 0.10812419383176441, -0.27138496814135077, 0.0006455578734220445, 0.03047849582615255] |
1,802.00314 | The Chern-Simons current in systems of DNA-RNA transcriptions | A Chern-Simons current, coming from ghost and anti-ghost fields of
supersymmetry theory, can be used to define a spectrum of gene expression in
new time series data where a spinor field, as alternative representation of a
gene, is adopted instead of using the standard alphabet sequence of bases $A,
T, C, G, U$. After a general discussion on the use of supersymmetry in
biological systems, we give examples of the use of supersymmetry for living
organism, discuss the codon and anti-codon ghost fields and develop an
algebraic construction for the trash DNA, the DNA area which does not seem
active in biological systems. As a general result, all hidden states of codon
can be computed by Chern-Simons 3 forms. Finally, we plot a time series of
genetic variations of viral glycoprotein gene and host T-cell receptor gene by
using a gene tensor correlation network related to the Chern-Simons current. An
empirical analysis of genetic shift, in host cell receptor genes with separated
cluster of gene and genetic drift in viral gene, is obtained by using a tensor
correlation plot over time series data derived as the empirical mode
decomposition of Chern-Simons current.
| physics.gen-ph | a chernsimons current coming from ghost and antighost fields of supersymmetry theory can be used to define a spectrum of gene expression in new time series data where a spinor field as alternative representation of a gene is adopted instead of using the standard alphabet sequence of bases a t c g u after a general discussion on the use of supersymmetry in biological systems we give examples of the use of supersymmetry for living organism discuss the codon and anticodon ghost fields and develop an algebraic construction for the trash dna the dna area which does not seem active in biological systems as a general result all hidden states of codon can be computed by chernsimons 3 forms finally we plot a time series of genetic variations of viral glycoprotein gene and host tcell receptor gene by using a gene tensor correlation network related to the chernsimons current an empirical analysis of genetic shift in host cell receptor genes with separated cluster of gene and genetic drift in viral gene is obtained by using a tensor correlation plot over time series data derived as the empirical mode decomposition of chernsimons current | [['a', 'chernsimons', 'current', 'coming', 'from', 'ghost', 'and', 'antighost', 'fields', 'of', 'supersymmetry', 'theory', 'can', 'be', 'used', 'to', 'define', 'a', 'spectrum', 'of', 'gene', 'expression', 'in', 'new', 'time', 'series', 'data', 'where', 'a', 'spinor', 'field', 'as', 'alternative', 'representation', 'of', 'a', 'gene', 'is', 'adopted', 'instead', 'of', 'using', 'the', 'standard', 'alphabet', 'sequence', 'of', 'bases', 'a', 't', 'c', 'g', 'u', 'after', 'a', 'general', 'discussion', 'on', 'the', 'use', 'of', 'supersymmetry', 'in', 'biological', 'systems', 'we', 'give', 'examples', 'of', 'the', 'use', 'of', 'supersymmetry', 'for', 'living', 'organism', 'discuss', 'the', 'codon', 'and', 'anticodon', 'ghost', 'fields', 'and', 'develop', 'an', 'algebraic', 'construction', 'for', 'the', 'trash', 'dna', 'the', 'dna', 'area', 'which', 'does', 'not', 'seem', 'active', 'in', 'biological', 'systems', 'as', 'a', 'general', 'result', 'all', 'hidden', 'states', 'of', 'codon', 'can', 'be', 'computed', 'by', 'chernsimons', '3', 'forms', 'finally', 'we', 'plot', 'a', 'time', 'series', 'of', 'genetic', 'variations', 'of', 'viral', 'glycoprotein', 'gene', 'and', 'host', 'tcell', 'receptor', 'gene', 'by', 'using', 'a', 'gene', 'tensor', 'correlation', 'network', 'related', 'to', 'the', 'chernsimons', 'current', 'an', 'empirical', 'analysis', 'of', 'genetic', 'shift', 'in', 'host', 'cell', 'receptor', 'genes', 'with', 'separated', 'cluster', 'of', 'gene', 'and', 'genetic', 'drift', 'in', 'viral', 'gene', 'is', 'obtained', 'by', 'using', 'a', 'tensor', 'correlation', 'plot', 'over', 'time', 'series', 'data', 'derived', 'as', 'the', 'empirical', 'mode', 'decomposition', 'of', 'chernsimons', 'current']] | [-0.11742106358293951, 0.11657729536354058, -0.03689289094236587, 0.09905765923678739, -0.0734244793487703, -0.13721852479941402, 0.0728586786329083, 0.3261419128704602, -0.25200595839329415, -0.2424812607408662, 0.050715187381945685, -0.2216193837367232, -0.23840200940527373, 0.16053045860428306, -0.0633613996912301, -0.011836902079347969, 0.06916440720669925, 0.08123920178918548, 0.0296776278568578, -0.23584634543479424, 0.29721606264490613, 0.04144796495281979, 0.23856775254420742, -0.016198115328239053, 0.1278306502368574, -0.021711244588566662, -0.06436472437320111, 0.0040320051554834264, -0.1166239694048558, 0.15722658704930956, 0.31888995867793046, 0.22721994474422946, 0.23667293290012756, -0.4446444406871396, -0.21641920684121857, 0.09263989875210127, 0.18711093749548674, 0.16622097987415885, -0.034460526772199386, -0.2600876820317582, 0.051127513999811795, -0.16643355451999672, -0.05981266878652557, -0.08905418148917678, 0.02644473654205828, 0.01130839731515, -0.2667587707824859, 0.13752998775773295, -0.006892775062286339, 0.15197536276643656, -0.05461996519713814, -0.1394233340239006, -0.06101664457060592, 0.14292130174105547, 0.08577604729594439, 0.06273066698383364, 0.2026474285378311, -0.11815239280140447, -0.15956337879843405, 0.31663384376318043, -0.08707047171533566, -0.2174483743783925, 0.16115693975342388, -0.09811127822387827, -0.1658827389410029, 0.10579217212147894, 0.13547165220583843, 0.08839200744137207, -0.1990220614011687, 0.12075155231149633, -0.003720608169300706, 0.18265265892064736, 0.1287430957476584, -0.01674555462641222, 0.1961774789723348, 0.14433122105550275, 0.03027606511937152, 0.13225243730514422, -0.07872821141585357, -0.07229024074796139, -0.28471347458016966, -0.17040718135107624, -0.16064923909155734, 0.08951501080381419, -0.1228743507157303, -0.21980487749087796, 0.4192273445446922, 0.04433370579560702, 0.17616475522286545, 0.09304125723368074, 0.21368287758126425, 0.058944621272702065, 0.11482578666249281, -0.03967194899390037, 0.10215153150791936, 0.14359359043962394, 0.08960058035619109, -0.25993264654860954, 0.042803485905849106, 0.06556409895871107] |
1,802.00315 | Subpulse Drifting, Nulling and Mode changing in PSR J1822$-$2256 | We report a detailed observational study of the single pulses from the pulsar
J1822$-$2256. The pulsar shows the presence of subpulse drifting, nulling as
well as multiple emission modes. During these observations the pulsar existed
primarily in two modes; mode A with prominent drift bands and mode B which was
more disorderly without any clear subpulse drifting. A third mode C was also
seen for a short duration with a different drifting periodicity compared to
mode A. The nulls were present throughout the observations but were more
frequent during the disorderly B mode. The nulling also exhibited periodicity
with a clear peak in the fluctuation spectra. Before the transition from mode A
to nulling the pulsar switched to a third drifting state with periodicity
different from both mode A and C. The diversity seen in the single pulse
behaviour of the pulsar J1822$-$2256 provides an unique window into the
emission physics.
| astro-ph.HE | we report a detailed observational study of the single pulses from the pulsar j18222256 the pulsar shows the presence of subpulse drifting nulling as well as multiple emission modes during these observations the pulsar existed primarily in two modes mode a with prominent drift bands and mode b which was more disorderly without any clear subpulse drifting a third mode c was also seen for a short duration with a different drifting periodicity compared to mode a the nulls were present throughout the observations but were more frequent during the disorderly b mode the nulling also exhibited periodicity with a clear peak in the fluctuation spectra before the transition from mode a to nulling the pulsar switched to a third drifting state with periodicity different from both mode a and c the diversity seen in the single pulse behaviour of the pulsar j18222256 provides an unique window into the emission physics | [['we', 'report', 'a', 'detailed', 'observational', 'study', 'of', 'the', 'single', 'pulses', 'from', 'the', 'pulsar', 'j18222256', 'the', 'pulsar', 'shows', 'the', 'presence', 'of', 'subpulse', 'drifting', 'nulling', 'as', 'well', 'as', 'multiple', 'emission', 'modes', 'during', 'these', 'observations', 'the', 'pulsar', 'existed', 'primarily', 'in', 'two', 'modes', 'mode', 'a', 'with', 'prominent', 'drift', 'bands', 'and', 'mode', 'b', 'which', 'was', 'more', 'disorderly', 'without', 'any', 'clear', 'subpulse', 'drifting', 'a', 'third', 'mode', 'c', 'was', 'also', 'seen', 'for', 'a', 'short', 'duration', 'with', 'a', 'different', 'drifting', 'periodicity', 'compared', 'to', 'mode', 'a', 'the', 'nulls', 'were', 'present', 'throughout', 'the', 'observations', 'but', 'were', 'more', 'frequent', 'during', 'the', 'disorderly', 'b', 'mode', 'the', 'nulling', 'also', 'exhibited', 'periodicity', 'with', 'a', 'clear', 'peak', 'in', 'the', 'fluctuation', 'spectra', 'before', 'the', 'transition', 'from', 'mode', 'a', 'to', 'nulling', 'the', 'pulsar', 'switched', 'to', 'a', 'third', 'drifting', 'state', 'with', 'periodicity', 'different', 'from', 'both', 'mode', 'a', 'and', 'c', 'the', 'diversity', 'seen', 'in', 'the', 'single', 'pulse', 'behaviour', 'of', 'the', 'pulsar', 'j18222256', 'provides', 'an', 'unique', 'window', 'into', 'the', 'emission', 'physics']] | [-0.159844064110557, 0.17382530135147672, -0.09918848862439789, 0.04265304264729682, -0.11587210160538258, -0.1432166283222421, 0.08127110583410099, 0.4002398129379907, -0.24338279912727792, -0.2789257820202223, 0.0980960179327691, -0.2577414577965631, -0.08031329898077329, 0.20667741751137947, -0.02007298988431988, -0.025920129448964897, 0.0872943222843456, -0.00015846273201881655, -0.0018080518510044609, -0.10645163487456046, 0.20436365393280292, 0.09288174512839278, 0.23178658938530328, -0.05218671270282261, 0.055753790029472616, -0.03513111947381881, -0.028586469003190566, -0.02462167078197397, -0.060011178995205076, -0.003127210810533817, 0.17759568721752936, 0.08748350147811683, 0.23524163491308492, -0.40676674919684, -0.21989757195808957, 0.044511191958610884, 0.16133334895978305, 0.07804987294250938, -0.046324918420703166, -0.29799790175890684, 0.02574582550279944, -0.16139304852236483, -0.13822526228459958, 0.042267702898436184, 0.056291136976997586, 0.04115702588549069, -0.2213863032617119, 0.08509169620984475, 0.09343403458845068, 0.07939831045955814, -0.0773992893295301, -0.08131320413744805, 0.005620905279878847, 0.09212982086834824, 0.10191850202922888, 0.02621042638221472, 0.07644419766814503, -0.06888762110881261, -0.1395605576289386, 0.36767258538266284, -0.1029758087254518, -0.05076091201198812, 0.19496421139403586, -0.25506895673862157, -0.11924534621309267, 0.21532993994973945, 0.1081429474589273, 0.08131198620806072, -0.12595004763219828, -0.07399978443351111, 0.01585514952940558, 0.24460679745387953, 0.11044947379299544, 0.07216032431615109, 0.297026680276686, 0.15483620144397525, 0.01952104332135213, 0.18892524135761604, -0.23428041785061113, -0.024502883992151708, -0.26589740989829985, -0.0849641131342, -0.12203278575059402, 0.03407303292291942, -0.038504788932499985, -0.14772743449256515, 0.4891062773924494, 0.042687216253807794, 0.177493374478627, 0.01517771710009493, 0.301551714271233, 0.1258911686681137, 0.07087777271197603, 0.0883193405064452, 0.31134259362553945, 0.12081042470391963, 0.1792891158210422, -0.24861059000635433, 0.05897709404099856, -0.08360850513413154] |
1,802.00316 | On Nichols algebras over basic Hopf algebras | This is a contribution to the classification of finite-dimensional Hopf
algebras over an algebraically closed field $\Bbbk$ of characteristic 0.
Concretely, we show that a finite-dimensional Hopf algebra whose Hopf coradical
is basic is a lifting of a Nichols algebra of a semisimple Yetter-Drinfeld
module and we explain how to classify Nichols algebras of this kind. We provide
along the way new examples of Nichols algebras and Hopf algebras with finite
Gelfand-Kirillov dimension.
| math.QA math.RA | this is a contribution to the classification of finitedimensional hopf algebras over an algebraically closed field bbbk of characteristic 0 concretely we show that a finitedimensional hopf algebra whose hopf coradical is basic is a lifting of a nichols algebra of a semisimple yetterdrinfeld module and we explain how to classify nichols algebras of this kind we provide along the way new examples of nichols algebras and hopf algebras with finite gelfandkirillov dimension | [['this', 'is', 'a', 'contribution', 'to', 'the', 'classification', 'of', 'finitedimensional', 'hopf', 'algebras', 'over', 'an', 'algebraically', 'closed', 'field', 'bbbk', 'of', 'characteristic', '0', 'concretely', 'we', 'show', 'that', 'a', 'finitedimensional', 'hopf', 'algebra', 'whose', 'hopf', 'coradical', 'is', 'basic', 'is', 'a', 'lifting', 'of', 'a', 'nichols', 'algebra', 'of', 'a', 'semisimple', 'yetterdrinfeld', 'module', 'and', 'we', 'explain', 'how', 'to', 'classify', 'nichols', 'algebras', 'of', 'this', 'kind', 'we', 'provide', 'along', 'the', 'way', 'new', 'examples', 'of', 'nichols', 'algebras', 'and', 'hopf', 'algebras', 'with', 'finite', 'gelfandkirillov', 'dimension']] | [-0.2526185745883682, 0.05520381005373241, -0.05827790931224415, 0.06267494188576987, -0.22544634081295703, -0.2054085648261419, -0.07314121760651214, 0.3708645772341996, -0.4659036909268327, -0.08286285785677498, 0.13752901812453996, -0.15926925810564257, -0.20324987710823547, 0.20844843259004697, -0.18576614986084503, -0.16886242019803557, 0.0980248655996298, 0.20880771205443188, -0.1351043057710902, -0.34241235695064887, 0.49164989590644836, -0.04590495353028791, 0.177488478819189, -0.007137601946365752, 0.1685880203157255, -0.0044112560683733796, 0.015659556749646794, -0.008024463468320565, -0.19774554472479233, 0.048112025242043686, 0.40407782226596795, 0.02796298491589929, 0.21348866664689697, -0.26971777240197137, -0.04473076355069468, 0.2079895788114773, 0.2625898090892867, 0.0643577521666087, -0.01261881994656032, -0.28004410847613254, 0.09690471309753874, -0.34079913710792586, -0.12722495472543452, -0.12459777226697093, 0.15218856152025856, -0.0956102471594533, -0.25588642393098504, 0.0075293173822127794, 0.11818006262821082, 0.26093637939440467, -0.14760192837055824, -0.06743672084420511, -0.09143434669056984, 0.061855033197925006, -0.14847469607636027, 0.011218284231240619, 0.13231376291265431, -0.06992444755471222, -0.2564160298454027, 0.27950327916785256, 0.030618544055582727, -0.22006844829334177, 0.1389151268179388, -0.2101448296875476, -0.1658924018760046, 0.11947064709926203, 0.009824125274811706, 0.08403517532940596, -0.012169227214555626, 0.21818844749343466, -0.18968564428848356, -0.046164218336343765, 0.02266303929564071, -0.015260348358025698, 0.12942423873217393, 0.1286023165392753, 0.014735256710842456, 0.1480045590345582, 0.09049233042775359, 0.023381266156083918, -0.4258202496048522, -0.2342098372899098, -0.005036825148312197, 0.2141185696173, -0.0952915938133342, -0.2173470340745702, 0.5226258668691328, 0.1611138769897492, 0.16620190416092742, 0.14390984773380708, 0.1946237080870834, 0.03848817249144466, 0.19236478405328442, 0.027830978657744112, 0.08021274420802724, 0.41240500153539933, -0.016584599704787848, -0.0911336793972511, -0.157726442543407, 0.2926035749993912] |
1,802.00317 | Polynomial-Time Algorithms for Phylogenetic Inference Problems involving
duplication and reticulation | A common problem in phylogenetics is to try to infer a species phylogeny from
gene trees. We consider different variants of this problem. The first variant,
called Unrestricted Minimal Episodes Inference, aims at inferring a species
tree based on a model with speciation and duplication where duplications are
clustered in duplication episodes. The goal is to minimize the number of such
episodes. The second variant, Parental Hybridization, aims at inferring a
species \emph{network} based on a model with speciation and reticulation. The
goal is to minimize the number of reticulation events. It is a variant of the
well-studied Hybridization Number problem with a more generous view on which
gene trees are consistent with a given species network. We show that these
seemingly different problems are in fact closely related and can, surprisingly,
both be solved in polynomial time, using a structure we call "beaded trees".
However, we also show that methods based on these problems have to be used with
care because the optimal species phylogenies always have a restricted form. To
mitigate this problem, we introduce a new variant of Unrestricted Minimal
Episodes Inference that minimizes the duplication episode depth. We prove that
this new variant of the problem can also be solved in polynomial time
| q-bio.PE | a common problem in phylogenetics is to try to infer a species phylogeny from gene trees we consider different variants of this problem the first variant called unrestricted minimal episodes inference aims at inferring a species tree based on a model with speciation and duplication where duplications are clustered in duplication episodes the goal is to minimize the number of such episodes the second variant parental hybridization aims at inferring a species emphnetwork based on a model with speciation and reticulation the goal is to minimize the number of reticulation events it is a variant of the wellstudied hybridization number problem with a more generous view on which gene trees are consistent with a given species network we show that these seemingly different problems are in fact closely related and can surprisingly both be solved in polynomial time using a structure we call beaded trees however we also show that methods based on these problems have to be used with care because the optimal species phylogenies always have a restricted form to mitigate this problem we introduce a new variant of unrestricted minimal episodes inference that minimizes the duplication episode depth we prove that this new variant of the problem can also be solved in polynomial time | [['a', 'common', 'problem', 'in', 'phylogenetics', 'is', 'to', 'try', 'to', 'infer', 'a', 'species', 'phylogeny', 'from', 'gene', 'trees', 'we', 'consider', 'different', 'variants', 'of', 'this', 'problem', 'the', 'first', 'variant', 'called', 'unrestricted', 'minimal', 'episodes', 'inference', 'aims', 'at', 'inferring', 'a', 'species', 'tree', 'based', 'on', 'a', 'model', 'with', 'speciation', 'and', 'duplication', 'where', 'duplications', 'are', 'clustered', 'in', 'duplication', 'episodes', 'the', 'goal', 'is', 'to', 'minimize', 'the', 'number', 'of', 'such', 'episodes', 'the', 'second', 'variant', 'parental', 'hybridization', 'aims', 'at', 'inferring', 'a', 'species', 'emphnetwork', 'based', 'on', 'a', 'model', 'with', 'speciation', 'and', 'reticulation', 'the', 'goal', 'is', 'to', 'minimize', 'the', 'number', 'of', 'reticulation', 'events', 'it', 'is', 'a', 'variant', 'of', 'the', 'wellstudied', 'hybridization', 'number', 'problem', 'with', 'a', 'more', 'generous', 'view', 'on', 'which', 'gene', 'trees', 'are', 'consistent', 'with', 'a', 'given', 'species', 'network', 'we', 'show', 'that', 'these', 'seemingly', 'different', 'problems', 'are', 'in', 'fact', 'closely', 'related', 'and', 'can', 'surprisingly', 'both', 'be', 'solved', 'in', 'polynomial', 'time', 'using', 'a', 'structure', 'we', 'call', 'beaded', 'trees', 'however', 'we', 'also', 'show', 'that', 'methods', 'based', 'on', 'these', 'problems', 'have', 'to', 'be', 'used', 'with', 'care', 'because', 'the', 'optimal', 'species', 'phylogenies', 'always', 'have', 'a', 'restricted', 'form', 'to', 'mitigate', 'this', 'problem', 'we', 'introduce', 'a', 'new', 'variant', 'of', 'unrestricted', 'minimal', 'episodes', 'inference', 'that', 'minimizes', 'the', 'duplication', 'episode', 'depth', 'we', 'prove', 'that', 'this', 'new', 'variant', 'of', 'the', 'problem', 'can', 'also', 'be', 'solved', 'in', 'polynomial', 'time']] | [-0.09035251857566642, 0.10138514689237312, -0.036909638840765896, 0.12753363811930615, -0.0900760467056239, -0.12865782485024077, 0.09059028021523342, 0.3824615936348404, -0.327007752082846, -0.2992176500144572, 0.08353047355602311, -0.2601564369627819, -0.18398551817011574, 0.13022452739296833, -0.13254690436637345, 0.003843811925518628, 0.13084124950894518, 0.0448404037942525, 0.007652633179514557, -0.264854949142037, 0.3085881047364738, 0.02630836747649715, 0.2323465242864933, 0.010368536731480185, 0.1178088570036138, -0.020207674222309954, -0.014209524165964932, 0.04912663129094205, -0.12619253068080888, 0.1235833472278698, 0.28427093102065804, 0.22419189669052364, 0.3190109267671129, -0.44606311865834797, -0.20100668396301352, 0.18054291853964652, 0.15512956932731475, 0.16219459386184756, -0.02901855804981351, -0.17652691547772376, 0.10178196306817305, -0.14362354733157848, -0.04645200941884881, 0.011125595821742561, -0.02303066629925428, 0.0028197441557925623, -0.2749696204695819, 0.06854530433074747, 0.016684509597826695, 0.05201370378839221, -0.03054086842286234, -0.12053053969616331, 0.0002744462462547033, 0.10417412841863534, 0.04228673331104309, 0.03194974821509686, 0.05864323475420619, -0.08974126587027981, -0.17187652824410565, 0.3746468430555961, -0.03400082518639052, -0.210474724298712, 0.20773089690255406, -0.07651439373457922, -0.23546468176325594, 0.10022540543462344, 0.17727009769571847, 0.1544426403183868, -0.17996796083795177, 0.027587369272478627, -0.0777470638676308, 0.15325189273408502, 0.08545811672960431, -0.03310704304598236, 0.19070942459795578, 0.19902876041748602, 0.10841321955538458, 0.1670729511283599, -0.07822961827677086, -0.10842204510103821, -0.20061582335887324, -0.11117017202547207, -0.1415823591672838, 0.0013063840820017644, -0.08343697306431508, -0.17758682311696994, 0.3886395852668616, 0.16056750229237024, 0.24133107194829967, 0.11329423079260395, 0.2558561983565543, 0.08409760721423776, 0.08828172892566033, 0.08195584155517914, 0.10307287225828186, 0.08639723874610547, 0.030964360626387424, -0.21516625283936663, 0.17266395907615117, 0.09156694490876463] |
1,802.00318 | The Igusa local zeta functions of superelliptic curves | Let $K$ be a local field and $f(x)\in K[x]$ be a non-constant polynomial. The
local zeta function $Z_f(s, \chi)$ was first introduced by Weil, then studied
in detail by Igusa. When ${\rm char}(K)=0$, Igusa proved that $Z_f(s, \chi)$ is
a rational function of $q^{-s}$ by using the resolution of singularities. Later
on, Denef gave another proof of this remarkable result. However, if ${\rm
char}(K)>0$, the question of rationality of $Z_f(s, \chi)$ is still kept open.
Actually, there are only a few known results so far. In this paper, we
investigate the local zeta functions of two-variable polynomial $g(x, y)$,
where $g(x, y)=0$ is the superelliptic curve with coefficients in a
non-archimedean local field of positive characteristic. By using the notable
Igusa's stationary phase formula and with the help of some results due to Denef
and Z${\rm \acute{u}}$${\rm\tilde{n}}$iga-Galindo, and developing a detailed
analysis, we prove the rationality of these local zeta functions and also
describe explicitly all their candidate poles.
| math.NT | let k be a local field and fxin kx be a nonconstant polynomial the local zeta function z_fs chi was first introduced by weil then studied in detail by igusa when rm chark0 igusa proved that z_fs chi is a rational function of qs by using the resolution of singularities later on denef gave another proof of this remarkable result however if rm chark0 the question of rationality of z_fs chi is still kept open actually there are only a few known results so far in this paper we investigate the local zeta functions of twovariable polynomial gx y where gx y0 is the superelliptic curve with coefficients in a nonarchimedean local field of positive characteristic by using the notable igusas stationary phase formula and with the help of some results due to denef and zrm acuteurmtildenigagalindo and developing a detailed analysis we prove the rationality of these local zeta functions and also describe explicitly all their candidate poles | [['let', 'k', 'be', 'a', 'local', 'field', 'and', 'fxin', 'kx', 'be', 'a', 'nonconstant', 'polynomial', 'the', 'local', 'zeta', 'function', 'z_fs', 'chi', 'was', 'first', 'introduced', 'by', 'weil', 'then', 'studied', 'in', 'detail', 'by', 'igusa', 'when', 'rm', 'chark0', 'igusa', 'proved', 'that', 'z_fs', 'chi', 'is', 'a', 'rational', 'function', 'of', 'qs', 'by', 'using', 'the', 'resolution', 'of', 'singularities', 'later', 'on', 'denef', 'gave', 'another', 'proof', 'of', 'this', 'remarkable', 'result', 'however', 'if', 'rm', 'chark0', 'the', 'question', 'of', 'rationality', 'of', 'z_fs', 'chi', 'is', 'still', 'kept', 'open', 'actually', 'there', 'are', 'only', 'a', 'few', 'known', 'results', 'so', 'far', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'local', 'zeta', 'functions', 'of', 'twovariable', 'polynomial', 'gx', 'y', 'where', 'gx', 'y0', 'is', 'the', 'superelliptic', 'curve', 'with', 'coefficients', 'in', 'a', 'nonarchimedean', 'local', 'field', 'of', 'positive', 'characteristic', 'by', 'using', 'the', 'notable', 'igusas', 'stationary', 'phase', 'formula', 'and', 'with', 'the', 'help', 'of', 'some', 'results', 'due', 'to', 'denef', 'and', 'zrm', 'acuteurmtildenigagalindo', 'and', 'developing', 'a', 'detailed', 'analysis', 'we', 'prove', 'the', 'rationality', 'of', 'these', 'local', 'zeta', 'functions', 'and', 'also', 'describe', 'explicitly', 'all', 'their', 'candidate', 'poles']] | [-0.18985029056232092, 0.05576641226328815, -0.13562501456788917, 0.08126873230411305, -0.07806461196557819, -0.14411726695355737, 0.027132222081882335, 0.29646516266231765, -0.29413278152741773, -0.240790137355039, 0.07135822383820077, -0.2191247684008713, -0.17045338685282424, 0.21487490014656435, -0.06656334346419648, 0.01199502296321377, -0.023280351262103437, 0.10047024035166148, -0.06624555086445864, -0.34505327057411683, 0.36078423098458384, -0.01959441324896356, 0.1324996315237559, 0.08330400645308479, 0.08351380626606178, 0.024070546361824048, -0.009603421547880419, -0.019212298095226288, -0.18326237859209754, 0.07120656139693293, 0.28338509379838933, 0.09315790069330766, 0.2636254611071435, -0.35228099891491516, -0.16313557505395404, 0.16956505942515016, 0.13443256545917992, -0.03907297856374821, -0.008172801485774402, -0.23810835065956734, 0.15109514124408552, -0.12404038627407973, -0.17531922037854697, -0.09067346083436491, 0.07791591554443954, 0.06743021354099878, -0.26750616031357005, 0.05020943877439728, 0.08881959519525871, 0.15384228145585785, -0.048121834436101435, -0.1534641849678717, -0.032592038224639866, 0.03712300113288102, 0.05435950412412021, 0.141993295256184, 0.0532015473139767, -0.1461916451041787, -0.0669210666257894, 0.3004326989072599, -0.08034827647718919, -0.17173249368361326, 0.10145599950551457, -0.21286082381966134, -0.14561201652211336, 0.110180965490651, 0.037407024533641114, 0.18891271654386782, -0.08272177736539042, 0.1964632118149525, -0.1160744277147364, 0.12100565635165954, 0.1331631443242224, -0.03935071864589766, 0.16244749831554445, 0.006156147176199416, 0.0038357111448539963, 0.1400056619630372, -0.0033650983808727205, -0.016459172915761607, -0.32026290398421164, -0.18928406277341367, -0.15828461713920924, 0.13513023423324222, -0.0840502062312709, -0.1349995557124479, 0.4075201510251323, 0.054478351742948725, 0.21572473094963668, 0.08453184751133565, 0.22371282499383757, 0.1546687963109204, 0.03431632597503382, 0.06290382884525328, 0.14812055944345, 0.19606065081397095, 0.049739149796976884, -0.16130338356346835, 0.052004011085587026, 0.14798089015132548] |
1,802.00319 | State-Adaptive Coded Caching for Symmetric Broadcast Channels | Coded-caching delivery is considered over a symmetric noisy broadcast channel
whose state is unknown at the transmitter during the cache placement phase. In
particular, the delivery phase is modeled by a state-dependent broadcast
channel where the state remains constant over each transmission block and is
learned by the transmitter (and the receivers) only at the beginning of each
block. A state-adaptive coded caching scheme is proposed that improves either
on rate or decoding latency over two baseline schemes that are based on
standard coded caching.
| cs.IT math.IT | codedcaching delivery is considered over a symmetric noisy broadcast channel whose state is unknown at the transmitter during the cache placement phase in particular the delivery phase is modeled by a statedependent broadcast channel where the state remains constant over each transmission block and is learned by the transmitter and the receivers only at the beginning of each block a stateadaptive coded caching scheme is proposed that improves either on rate or decoding latency over two baseline schemes that are based on standard coded caching | [['codedcaching', 'delivery', 'is', 'considered', 'over', 'a', 'symmetric', 'noisy', 'broadcast', 'channel', 'whose', 'state', 'is', 'unknown', 'at', 'the', 'transmitter', 'during', 'the', 'cache', 'placement', 'phase', 'in', 'particular', 'the', 'delivery', 'phase', 'is', 'modeled', 'by', 'a', 'statedependent', 'broadcast', 'channel', 'where', 'the', 'state', 'remains', 'constant', 'over', 'each', 'transmission', 'block', 'and', 'is', 'learned', 'by', 'the', 'transmitter', 'and', 'the', 'receivers', 'only', 'at', 'the', 'beginning', 'of', 'each', 'block', 'a', 'stateadaptive', 'coded', 'caching', 'scheme', 'is', 'proposed', 'that', 'improves', 'either', 'on', 'rate', 'or', 'decoding', 'latency', 'over', 'two', 'baseline', 'schemes', 'that', 'are', 'based', 'on', 'standard', 'coded', 'caching']] | [-0.2739730818263654, 0.08023898659407028, -0.016580125073059684, -0.06320456635910973, -0.03348009533337539, -0.3231581661772604, 0.14134740301856905, 0.4356129844007747, -0.28781651785331114, -0.19520658508519687, 0.17677298827246496, -0.23092123591119335, -0.1130837488148938, 0.09227124983832861, -0.12311092389392711, 0.034636602903317125, 0.018638589947840956, 0.11907000547008854, -0.051532402994953805, -0.3512958384429415, 0.2826582826895728, 0.11474744258226738, 0.3395061706791499, -0.01705410014948852, 0.13908735831362373, 0.05624438652081326, -0.028904236930732925, -0.08830215882820387, -0.053525592046103805, -0.0014008945048165817, 0.32171982958624584, 0.1972592448915488, 0.2223112975424599, -0.382276437223135, -0.28123295845996055, 0.054995796543412974, 0.14922013408448992, 0.0896364131920217, -0.03216034989704245, -0.27680805378726553, 0.12374783267954453, -0.22431551252624818, 0.08518678803617756, 0.09985257090911978, -0.07209063582177762, 0.03441554376678098, -0.34809339113001314, -0.0012568620454874776, -0.03646322359175732, -0.0280406134690912, -0.04661520740150341, -0.13321639169451027, 0.027282614050255644, 0.14281979315481813, -0.0309581830182911, 0.05271863149079893, 0.08837753013219862, -0.07658458360293437, -0.11085107683071069, 0.36757744353685884, -0.028021005808287078, -0.2168807576388298, 0.10369135025705743, -0.04928047045887936, -0.036138548280134616, 0.23132565322088167, 0.23678025611609751, 0.07601442997942545, -0.15421757360343777, 0.03296697634089339, -0.047560328993962946, 0.22897682884857723, 0.1354038612750758, 0.11655493143812887, 0.13384079334459134, 0.20532526601094842, 0.14508559978068142, 0.1239453857720253, -0.11746083023691815, -0.1947937059837083, -0.23754819813517056, -0.09969061492232695, -0.27775043192031307, -0.018415119343747694, -0.10988644521560109, -0.0468844413934719, 0.36990243244036675, 0.062057364477022064, 0.13714066362895427, 0.1119854500062675, 0.4365255312905425, 0.06624330818608758, 0.04566189107052716, 0.18550586494772384, 0.14425556607810514, 0.0719448919574331, 0.12548341274045274, -0.21164134371238538, 0.18604425468947738, 0.01779061746561811] |
1,802.0032 | Enabling the Adoption of Processing-in-Memory: Challenges, Mechanisms,
Future Research Directions | Poor DRAM technology scaling over the course of many years has caused
DRAM-based main memory to increasingly become a larger system bottleneck. A
major reason for the bottleneck is that data stored within DRAM must be moved
across a pin-limited memory channel to the CPU before any computation can take
place. This requires a high latency and energy overhead, and the data often
cannot benefit from caching in the CPU, making it difficult to amortize the
overhead.
Modern 3D-stacked DRAM architectures include a logic layer, where compute
logic can be integrated underneath multiple layers of DRAM cell arrays within
the same chip. Architects can take advantage of the logic layer to perform
processing-in-memory (PIM), or near-data processing. In a PIM architecture, the
logic layer within DRAM has access to the high internal bandwidth available
within 3D-stacked DRAM (which is much greater than the bandwidth available
between DRAM and the CPU). Thus, PIM architectures can effectively free up
valuable memory channel bandwidth while reducing system energy consumption.
A number of important issues arise when we add compute logic to DRAM. In
particular, the logic does not have low-latency access to common CPU structures
that are essential for modern application execution, such as the virtual memory
and cache coherence mechanisms. To ease the widespread adoption of PIM, we
ideally would like to maintain traditional virtual memory abstractions and the
shared memory programming model. This requires efficient mechanisms that can
provide logic in DRAM with access to CPU structures without having to
communicate frequently with the CPU. To this end, we propose and evaluate two
general-purpose solutions that minimize unnecessary off-chip communication for
PIM architectures. We show that both mechanisms improve the performance and
energy consumption of many important memory-intensive applications.
| cs.AR | poor dram technology scaling over the course of many years has caused drambased main memory to increasingly become a larger system bottleneck a major reason for the bottleneck is that data stored within dram must be moved across a pinlimited memory channel to the cpu before any computation can take place this requires a high latency and energy overhead and the data often cannot benefit from caching in the cpu making it difficult to amortize the overhead modern 3dstacked dram architectures include a logic layer where compute logic can be integrated underneath multiple layers of dram cell arrays within the same chip architects can take advantage of the logic layer to perform processinginmemory pim or neardata processing in a pim architecture the logic layer within dram has access to the high internal bandwidth available within 3dstacked dram which is much greater than the bandwidth available between dram and the cpu thus pim architectures can effectively free up valuable memory channel bandwidth while reducing system energy consumption a number of important issues arise when we add compute logic to dram in particular the logic does not have lowlatency access to common cpu structures that are essential for modern application execution such as the virtual memory and cache coherence mechanisms to ease the widespread adoption of pim we ideally would like to maintain traditional virtual memory abstractions and the shared memory programming model this requires efficient mechanisms that can provide logic in dram with access to cpu structures without having to communicate frequently with the cpu to this end we propose and evaluate two generalpurpose solutions that minimize unnecessary offchip communication for pim architectures we show that both mechanisms improve the performance and energy consumption of many important memoryintensive applications | [['poor', 'dram', 'technology', 'scaling', 'over', 'the', 'course', 'of', 'many', 'years', 'has', 'caused', 'drambased', 'main', 'memory', 'to', 'increasingly', 'become', 'a', 'larger', 'system', 'bottleneck', 'a', 'major', 'reason', 'for', 'the', 'bottleneck', 'is', 'that', 'data', 'stored', 'within', 'dram', 'must', 'be', 'moved', 'across', 'a', 'pinlimited', 'memory', 'channel', 'to', 'the', 'cpu', 'before', 'any', 'computation', 'can', 'take', 'place', 'this', 'requires', 'a', 'high', 'latency', 'and', 'energy', 'overhead', 'and', 'the', 'data', 'often', 'can', 'not', 'benefit', 'from', 'caching', 'in', 'the', 'cpu', 'making', 'it', 'difficult', 'to', 'amortize', 'the', 'overhead', 'modern', '3dstacked', 'dram', 'architectures', 'include', 'a', 'logic', 'layer', 'where', 'compute', 'logic', 'can', 'be', 'integrated', 'underneath', 'multiple', 'layers', 'of', 'dram', 'cell', 'arrays', 'within', 'the', 'same', 'chip', 'architects', 'can', 'take', 'advantage', 'of', 'the', 'logic', 'layer', 'to', 'perform', 'processinginmemory', 'pim', 'or', 'neardata', 'processing', 'in', 'a', 'pim', 'architecture', 'the', 'logic', 'layer', 'within', 'dram', 'has', 'access', 'to', 'the', 'high', 'internal', 'bandwidth', 'available', 'within', '3dstacked', 'dram', 'which', 'is', 'much', 'greater', 'than', 'the', 'bandwidth', 'available', 'between', 'dram', 'and', 'the', 'cpu', 'thus', 'pim', 'architectures', 'can', 'effectively', 'free', 'up', 'valuable', 'memory', 'channel', 'bandwidth', 'while', 'reducing', 'system', 'energy', 'consumption', 'a', 'number', 'of', 'important', 'issues', 'arise', 'when', 'we', 'add', 'compute', 'logic', 'to', 'dram', 'in', 'particular', 'the', 'logic', 'does', 'not', 'have', 'lowlatency', 'access', 'to', 'common', 'cpu', 'structures', 'that', 'are', 'essential', 'for', 'modern', 'application', 'execution', 'such', 'as', 'the', 'virtual', 'memory', 'and', 'cache', 'coherence', 'mechanisms', 'to', 'ease', 'the', 'widespread', 'adoption', 'of', 'pim', 'we', 'ideally', 'would', 'like', 'to', 'maintain', 'traditional', 'virtual', 'memory', 'abstractions', 'and', 'the', 'shared', 'memory', 'programming', 'model', 'this', 'requires', 'efficient', 'mechanisms', 'that', 'can', 'provide', 'logic', 'in', 'dram', 'with', 'access', 'to', 'cpu', 'structures', 'without', 'having', 'to', 'communicate', 'frequently', 'with', 'the', 'cpu', 'to', 'this', 'end', 'we', 'propose', 'and', 'evaluate', 'two', 'generalpurpose', 'solutions', 'that', 'minimize', 'unnecessary', 'offchip', 'communication', 'for', 'pim', 'architectures', 'we', 'show', 'that', 'both', 'mechanisms', 'improve', 'the', 'performance', 'and', 'energy', 'consumption', 'of', 'many', 'important', 'memoryintensive', 'applications']] | [-0.185893123629891, 0.05617080381085139, -0.022681413470612217, 0.04782026442788063, -0.13270954158926745, -0.21825082512966926, 0.11337375117566101, 0.425953857626559, -0.31493938589442727, -0.3733302176066597, 0.1222946772807821, -0.21372284823963936, -0.07510771131880271, 0.19785535044502467, -0.13803168192508666, 0.08504109545396608, 0.09435855364478761, 0.018502677085153765, -0.03431583983074739, -0.2643780075688685, 0.2095997187296032, 0.10750195182481548, 0.3149921845696453, 0.06398769780369346, 0.07673160376927829, -0.03523079381971507, 0.022142682994955167, -0.06896395989557884, -0.010227331263321402, 0.14258412955839755, 0.32912754948524203, 0.15390590935648005, 0.346926505248929, -0.5704625585219927, -0.19183995573136295, 0.0622014444347264, 0.15997592360589705, 0.053550582041579115, 0.006147363801978322, -0.18318326868918827, 0.1417433548825405, -0.25327568985651144, -0.012292587917828415, -0.10064313461730813, -0.009945363457114177, -0.0022568788491399675, -0.2301925669825222, -0.03315356020337074, 0.04589377788902817, 0.003202475100503458, 0.010748043456664568, -0.11113137603549855, 0.014006083813405389, 0.16081187556412463, -0.034758566408628316, 0.01770388655010417, 0.1918823953528772, -0.09942151519718816, -0.14081241109751216, 0.3677956412688622, 0.04034233995293511, -0.16721108670430518, 0.18319742505142736, -0.05268929491083125, -0.13245382910180423, 0.11180990660068346, 0.21512316754847738, -0.01536371994815353, -0.1550230856056866, 0.06680996075232946, 0.08121930988272652, 0.2642157996694247, 0.09965551009130043, 0.14880430645724926, 0.17476687903965488, 0.249229246360806, 0.06452797931180815, 0.15165066237791003, -0.08732816203620233, -0.13258906124893757, -0.19892742632934338, -0.20235265150161771, -0.17403685755481194, 0.020156272066237255, -0.08180219933077144, -0.141185176432676, 0.34758585876180503, 0.21822524277700317, 0.11668273106180196, 0.11342298730465296, 0.4314934905754247, 0.06532026001857755, 0.29789181636361817, 0.16641733526517377, 0.12134928940374973, 0.006818882128249647, 0.21879361702667666, -0.17524365235941433, 0.1008493908270288, -0.05531197440561502] |
1,802.00321 | Ruled strips with asymptotically diverging twisting | We consider the Dirichlet Laplacian in a two-dimensional strip composed of
segments translated along a straight line with respect to a rotation angle with
velocity diverging at infinity. We show that this model exhibits a "raise of
dimension" at infinity leading to an essential spectrum determined by an
asymptotic three-dimensional tube of annular cross-section. If the
cross-section of the asymptotic tube is a disk, we also prove the existence of
discrete eigenvalues below the essential spectrum.
| math.SP math-ph math.AP math.DG math.MP | we consider the dirichlet laplacian in a twodimensional strip composed of segments translated along a straight line with respect to a rotation angle with velocity diverging at infinity we show that this model exhibits a raise of dimension at infinity leading to an essential spectrum determined by an asymptotic threedimensional tube of annular crosssection if the crosssection of the asymptotic tube is a disk we also prove the existence of discrete eigenvalues below the essential spectrum | [['we', 'consider', 'the', 'dirichlet', 'laplacian', 'in', 'a', 'twodimensional', 'strip', 'composed', 'of', 'segments', 'translated', 'along', 'a', 'straight', 'line', 'with', 'respect', 'to', 'a', 'rotation', 'angle', 'with', 'velocity', 'diverging', 'at', 'infinity', 'we', 'show', 'that', 'this', 'model', 'exhibits', 'a', 'raise', 'of', 'dimension', 'at', 'infinity', 'leading', 'to', 'an', 'essential', 'spectrum', 'determined', 'by', 'an', 'asymptotic', 'threedimensional', 'tube', 'of', 'annular', 'crosssection', 'if', 'the', 'crosssection', 'of', 'the', 'asymptotic', 'tube', 'is', 'a', 'disk', 'we', 'also', 'prove', 'the', 'existence', 'of', 'discrete', 'eigenvalues', 'below', 'the', 'essential', 'spectrum']] | [-0.16458084293347047, 0.10654137715870379, -0.0752438107922085, 0.009771956222769069, -0.03952900532289947, -0.1239250510575642, -0.021737606436210245, 0.3575470099764827, -0.24366057737681426, -0.2062305431348872, 0.09772168015172754, -0.291378073565858, -0.07000517541248548, 0.16448326931812948, -0.02606189502158055, 0.053660582726527205, 0.05782798445464945, 0.11001961405456409, -0.05732199595322048, -0.13635264619829526, 0.33528313297459755, 0.03630727112881447, 0.24770090432139114, 0.07335638852888032, 0.08827607781705937, -0.013376301087095942, 0.00727076739942851, 0.03776477463543415, -0.20866239638618075, 0.0983658682403314, 0.16746106435005603, -0.011063182138298688, 0.20498648155358082, -0.4026894204097947, -0.16703339997299113, 0.10774747894978837, 0.22080416717615567, 0.024972658199993402, 0.013566335877648703, -0.2607623887566948, 0.12116466261183009, -0.10111080385487232, -0.2910646101594658, 0.0381731451121404, 0.0235236307585422, -0.0008593606318371664, -0.23211260519823745, 0.068470687295638, 0.09429158581616848, 0.07655387850919444, -0.05431582766438001, -0.06597940218144734, -0.0584309951304213, 0.07912467581091302, 0.09212776551660347, -0.005921867486138485, 0.09022349248468679, -0.09757178195592899, -0.06715040011208896, 0.3303144798111661, -0.0945445659423345, -0.21611759029321165, 0.13226861050842623, -0.1906277927766113, -0.07487295493238459, 0.18712280900217593, 0.1679692398879285, 0.09094101415049456, -0.05673828025618078, 0.1307139986433628, -0.09413710474281718, 0.18394552988588417, 0.12974526429561115, -0.045267503059126045, 0.2532195258934639, 0.15444741249819727, 0.12740287558469726, 0.20733357539498493, -0.13461623048121846, -0.05780285724291676, -0.3728185234787433, -0.16633641776187638, -0.15921128794894016, 0.08619270781300177, -0.1047585373866911, -0.25963567123797376, 0.3945259983700357, 0.06622185609548499, 0.3160743106211732, 0.08482234114413395, 0.278996302378609, 0.1580687158152853, 0.04192939150686327, 0.10471786871111315, 0.19767726028926277, 0.17889432744184314, 0.08985750772990286, -0.22083902504221586, 0.0008902761068097071, 0.08909393355593477] |
1,802.00322 | The entropy of a thermodynamic graph | We introduce an algorithmic model of heat conduction, the thermodynamic
graph. The thermodynamic graph is analogous to meshes in the finite difference
method in the sense that the calculation of temperature is carried out at the
vertices of the graph, and the edges indicate the direct heat exchange between
the vertices. Recurrence relations of heat conduction in graph are derived
without using of differential equations and based on the coefficients of
thermal conductivity and heat capacity. This approach seems to be more direct
and flexible from the point of view of algorithmic modeling of thermodynamic
process than the derivation of difference schemes from differential equations.
We introduce also the notion of entropy of thermodynamic graph. We find the
maximum length of the time step at which the entropy does not decrease in the
general case. As a result, this give us the accurate boundary of the model
stability.
| cs.CE | we introduce an algorithmic model of heat conduction the thermodynamic graph the thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of the graph and the edges indicate the direct heat exchange between the vertices recurrence relations of heat conduction in graph are derived without using of differential equations and based on the coefficients of thermal conductivity and heat capacity this approach seems to be more direct and flexible from the point of view of algorithmic modeling of thermodynamic process than the derivation of difference schemes from differential equations we introduce also the notion of entropy of thermodynamic graph we find the maximum length of the time step at which the entropy does not decrease in the general case as a result this give us the accurate boundary of the model stability | [['we', 'introduce', 'an', 'algorithmic', 'model', 'of', 'heat', 'conduction', 'the', 'thermodynamic', 'graph', 'the', 'thermodynamic', 'graph', 'is', 'analogous', 'to', 'meshes', 'in', 'the', 'finite', 'difference', 'method', 'in', 'the', 'sense', 'that', 'the', 'calculation', 'of', 'temperature', 'is', 'carried', 'out', 'at', 'the', 'vertices', 'of', 'the', 'graph', 'and', 'the', 'edges', 'indicate', 'the', 'direct', 'heat', 'exchange', 'between', 'the', 'vertices', 'recurrence', 'relations', 'of', 'heat', 'conduction', 'in', 'graph', 'are', 'derived', 'without', 'using', 'of', 'differential', 'equations', 'and', 'based', 'on', 'the', 'coefficients', 'of', 'thermal', 'conductivity', 'and', 'heat', 'capacity', 'this', 'approach', 'seems', 'to', 'be', 'more', 'direct', 'and', 'flexible', 'from', 'the', 'point', 'of', 'view', 'of', 'algorithmic', 'modeling', 'of', 'thermodynamic', 'process', 'than', 'the', 'derivation', 'of', 'difference', 'schemes', 'from', 'differential', 'equations', 'we', 'introduce', 'also', 'the', 'notion', 'of', 'entropy', 'of', 'thermodynamic', 'graph', 'we', 'find', 'the', 'maximum', 'length', 'of', 'the', 'time', 'step', 'at', 'which', 'the', 'entropy', 'does', 'not', 'decrease', 'in', 'the', 'general', 'case', 'as', 'a', 'result', 'this', 'give', 'us', 'the', 'accurate', 'boundary', 'of', 'the', 'model', 'stability']] | [-0.11618966268724762, 0.06687335414283774, -0.10265337198192405, 0.024429623074214563, -0.07538901769077859, -0.08894151873647461, 0.1080818321592036, 0.32395057884875583, -0.2986179870880536, -0.2786113915310518, 0.06128917119113376, -0.3125264737062861, -0.11455623940501765, 0.18468316269698679, -0.03787880310335675, 0.0437108043744858, 0.0685997835181125, 0.06772900867980679, -0.07059894705260475, -0.19072177509696228, 0.3288798286277499, 0.055770706259519666, 0.26133590337908447, 0.11399545947190474, 0.09772145097156533, -0.007348488578950432, -0.050263988365406624, 0.06220749452257076, -0.17893697498599265, 0.10785533257797864, 0.2307310675670443, 0.058238328868724605, 0.22004388383514173, -0.4399103239946369, -0.22472959072517887, 0.11198795468521279, 0.08329927568509546, 0.1084832383840458, 0.012451031314806125, -0.19432567833840997, 0.06631313609525662, -0.13709691728267037, -0.08728688175953622, -0.06364210647832905, -0.003272219397429679, 0.005802979721133974, -0.2522160888907525, 0.11992586311247873, 0.1051325015346142, 0.06111337775616227, -0.04145090346463729, -0.11454390264289277, -0.0581338022524063, 0.11844067149040466, 0.011728863415703165, -0.01052374007948045, 0.10201750423859905, -0.10855995093761767, -0.09749526671854451, 0.36413998857165714, -0.05944485680998155, -0.1988554368412273, 0.15291318513383786, -0.14423591741738287, -0.11384655493059875, 0.12150684713914588, 0.14014921506011002, 0.1516166915267555, -0.1775977444658811, 0.07257744044575186, -0.025554028181579418, 0.13283244390736768, 0.05368804081179503, 0.023084317424060852, 0.17260406783001647, 0.15574305785215786, 0.10534162387075657, 0.1900735644779382, -0.04629152750508306, -0.11655587251486911, -0.3292360332215557, -0.1989134562561073, -0.19623774639330804, 0.05805528088407103, -0.17080935730513916, -0.20267643096441454, 0.3840139516616693, 0.19297875550802093, 0.17657468386774733, 0.06245501067983364, 0.27741549265998844, 0.1745450423198211, 0.0425095207850776, 0.11523616551169874, 0.20120850511876917, 0.18262217545998283, 0.13204294084445448, -0.274392703576391, 0.06766565391208625, 0.13844837282935307] |
1,802.00323 | Correlation and Prediction of Evaluation Metrics in Information
Retrieval | Because researchers typically do not have the time or space to present more
than a few evaluation metrics in any published study, it can be difficult to
assess relative effectiveness of prior methods for unreported metrics when
baselining a new method or conducting a systematic meta-review. While sharing
of study data would help alleviate this, recent attempts to encourage
consistent sharing have been largely unsuccessful. Instead, we propose to
enable relative comparisons with prior work across arbitrary metrics by
predicting unreported metrics given one or more reported metrics. In addition,
we further investigate prediction of high-cost evaluation measures using
low-cost measures as a potential strategy for reducing evaluation cost. We
begin by assessing the correlation between 23 IR metrics using 8 TREC test
collections. Measuring prediction error wrt. R-square and Kendall's tau, we
show that accurate prediction of MAP, P@10, and RBP can be achieved using only
2-3 other metrics. With regard to lowering evaluation cost, we show that
RBP(p=0.95) can be predicted with high accuracy using measures with only
evaluation depth of 30. Taken together, our findings provide a valuable
proof-of-concept which we expect to spur follow-on work by others in proposing
more sophisticated models for metric prediction.
| cs.IR | because researchers typically do not have the time or space to present more than a few evaluation metrics in any published study it can be difficult to assess relative effectiveness of prior methods for unreported metrics when baselining a new method or conducting a systematic metareview while sharing of study data would help alleviate this recent attempts to encourage consistent sharing have been largely unsuccessful instead we propose to enable relative comparisons with prior work across arbitrary metrics by predicting unreported metrics given one or more reported metrics in addition we further investigate prediction of highcost evaluation measures using lowcost measures as a potential strategy for reducing evaluation cost we begin by assessing the correlation between 23 ir metrics using 8 trec test collections measuring prediction error wrt rsquare and kendalls tau we show that accurate prediction of map p10 and rbp can be achieved using only 23 other metrics with regard to lowering evaluation cost we show that rbpp095 can be predicted with high accuracy using measures with only evaluation depth of 30 taken together our findings provide a valuable proofofconcept which we expect to spur followon work by others in proposing more sophisticated models for metric prediction | [['because', 'researchers', 'typically', 'do', 'not', 'have', 'the', 'time', 'or', 'space', 'to', 'present', 'more', 'than', 'a', 'few', 'evaluation', 'metrics', 'in', 'any', 'published', 'study', 'it', 'can', 'be', 'difficult', 'to', 'assess', 'relative', 'effectiveness', 'of', 'prior', 'methods', 'for', 'unreported', 'metrics', 'when', 'baselining', 'a', 'new', 'method', 'or', 'conducting', 'a', 'systematic', 'metareview', 'while', 'sharing', 'of', 'study', 'data', 'would', 'help', 'alleviate', 'this', 'recent', 'attempts', 'to', 'encourage', 'consistent', 'sharing', 'have', 'been', 'largely', 'unsuccessful', 'instead', 'we', 'propose', 'to', 'enable', 'relative', 'comparisons', 'with', 'prior', 'work', 'across', 'arbitrary', 'metrics', 'by', 'predicting', 'unreported', 'metrics', 'given', 'one', 'or', 'more', 'reported', 'metrics', 'in', 'addition', 'we', 'further', 'investigate', 'prediction', 'of', 'highcost', 'evaluation', 'measures', 'using', 'lowcost', 'measures', 'as', 'a', 'potential', 'strategy', 'for', 'reducing', 'evaluation', 'cost', 'we', 'begin', 'by', 'assessing', 'the', 'correlation', 'between', '23', 'ir', 'metrics', 'using', '8', 'trec', 'test', 'collections', 'measuring', 'prediction', 'error', 'wrt', 'rsquare', 'and', 'kendalls', 'tau', 'we', 'show', 'that', 'accurate', 'prediction', 'of', 'map', 'p10', 'and', 'rbp', 'can', 'be', 'achieved', 'using', 'only', '23', 'other', 'metrics', 'with', 'regard', 'to', 'lowering', 'evaluation', 'cost', 'we', 'show', 'that', 'rbpp095', 'can', 'be', 'predicted', 'with', 'high', 'accuracy', 'using', 'measures', 'with', 'only', 'evaluation', 'depth', 'of', '30', 'taken', 'together', 'our', 'findings', 'provide', 'a', 'valuable', 'proofofconcept', 'which', 'we', 'expect', 'to', 'spur', 'followon', 'work', 'by', 'others', 'in', 'proposing', 'more', 'sophisticated', 'models', 'for', 'metric', 'prediction']] | [-0.05678275055451921, 0.019180611063458138, -0.07005142483676811, 0.08580542378529737, -0.0789137016781935, -0.1797403956956296, 0.10403034069476592, 0.4518107087080922, -0.17636295419799003, -0.3823050700429112, 0.09966881840426306, -0.2945549194418797, -0.15356852977908206, 0.22277946308704394, -0.11737696651952585, 0.07846464413792045, 0.12083248933306848, 0.004633241313223896, -0.12520814450067289, -0.2686561823474488, 0.30613801034397886, 0.11151926460290196, 0.28474277144091, 0.0792793888619847, 0.03993587326693508, -0.03351954735505084, -0.12257318452560352, 0.06358890142982633, -0.12477214055435998, 0.15456717487688015, 0.26460185019156296, 0.17165610631998401, 0.3099457025281013, -0.38495237713284564, -0.24425283699023603, 0.135600906855549, 0.13824735232864063, 0.0793538149499165, -0.033633558733922056, -0.30694618477307334, 0.11652944045320078, -0.18990974222201704, -0.06458849743281425, -0.16402366003162708, -0.01731606881749214, -0.011001183030505976, -0.24261298624450586, 0.035089020873655126, -0.006124864259103873, 0.09371042886579578, -0.058497025812458664, -0.13582787430972199, 0.04244406975340098, 0.16103590356795744, 0.06735566817929572, 0.08428519757022385, 0.10407919281002398, -0.09166311629447554, -0.16928648872734894, 0.36808155323708, -0.09613826081271089, -0.22732142505889777, 0.20355686056192476, -0.10656104145590405, -0.12629250413032644, 0.08528236565369739, 0.19847425339200223, 0.10423373411917551, -0.16718362604723266, -0.03546562395822915, 0.02043929791567151, 0.2016519244961356, 0.07336774050267507, 0.009485662108816522, 0.170659387079679, 0.1815394943572976, 0.050008750761708604, 0.10505418713066982, -0.0788161372413125, -0.04227539691650732, -0.22611796056541303, -0.15908887111774417, -0.1289645301347429, 0.027676738518824674, -0.08083105882887864, -0.12037935346421419, 0.36873299137082405, 0.2054832736823962, 0.19847175218823432, 0.09164573925778369, 0.29245067712135914, 0.0428750170183114, 0.1059252773881937, 0.07269159677400809, 0.23514834181358568, 0.001694678798120356, 0.0687074636784147, -0.13284974250733156, 0.12687265421463778, -0.0008072447081124692] |
1,802.00324 | One-class Collective Anomaly Detection based on Long Short-Term Memory
Recurrent Neural Networks | Intrusion detection for computer network systems has been becoming one of the
most critical tasks for network administrators today. It has an important role
for organizations, governments and our society due to the valuable resources
hosted on computer networks. Traditional misuse detection strategies are unable
to detect new and unknown intrusion types. In contrast, anomaly detection in
network security aims to distinguish between illegal or malicious events and
normal behavior of network systems. Anomaly detection can be considered as a
classification problem where it builds models of normal network behavior, of
which it uses to detect new patterns that significantly deviate from the model.
Most of the current approaches on anomaly detection is based on the learning of
normal behavior and anomalous actions. They do not include memory that is they
do not take into account previous events classify new ones. In this paper, we
propose a one class collective anomaly detection model based on neural network
learning. Normally a Long Short Term Memory Recurrent Neural Network (LSTM RNN)
is trained only on normal data, and it is capable of predicting several time
steps ahead of an input. In our approach, a LSTM RNN is trained on normal time
series data before performing a prediction for each time step. Instead of
considering each time-step separately, the observation of prediction errors
from a certain number of time-steps is now proposed as a new idea for detecting
collective anomalies. The prediction errors of a certain number of the latest
time-steps above a threshold will indicate a collective anomaly. The model is
evaluated on a time series version of the KDD 1999 dataset. The experiments
demonstrate that the proposed model is capable to detect collective anomaly
efficiently
| cs.LG stat.ML | intrusion detection for computer network systems has been becoming one of the most critical tasks for network administrators today it has an important role for organizations governments and our society due to the valuable resources hosted on computer networks traditional misuse detection strategies are unable to detect new and unknown intrusion types in contrast anomaly detection in network security aims to distinguish between illegal or malicious events and normal behavior of network systems anomaly detection can be considered as a classification problem where it builds models of normal network behavior of which it uses to detect new patterns that significantly deviate from the model most of the current approaches on anomaly detection is based on the learning of normal behavior and anomalous actions they do not include memory that is they do not take into account previous events classify new ones in this paper we propose a one class collective anomaly detection model based on neural network learning normally a long short term memory recurrent neural network lstm rnn is trained only on normal data and it is capable of predicting several time steps ahead of an input in our approach a lstm rnn is trained on normal time series data before performing a prediction for each time step instead of considering each timestep separately the observation of prediction errors from a certain number of timesteps is now proposed as a new idea for detecting collective anomalies the prediction errors of a certain number of the latest timesteps above a threshold will indicate a collective anomaly the model is evaluated on a time series version of the kdd 1999 dataset the experiments demonstrate that the proposed model is capable to detect collective anomaly efficiently | [['intrusion', 'detection', 'for', 'computer', 'network', 'systems', 'has', 'been', 'becoming', 'one', 'of', 'the', 'most', 'critical', 'tasks', 'for', 'network', 'administrators', 'today', 'it', 'has', 'an', 'important', 'role', 'for', 'organizations', 'governments', 'and', 'our', 'society', 'due', 'to', 'the', 'valuable', 'resources', 'hosted', 'on', 'computer', 'networks', 'traditional', 'misuse', 'detection', 'strategies', 'are', 'unable', 'to', 'detect', 'new', 'and', 'unknown', 'intrusion', 'types', 'in', 'contrast', 'anomaly', 'detection', 'in', 'network', 'security', 'aims', 'to', 'distinguish', 'between', 'illegal', 'or', 'malicious', 'events', 'and', 'normal', 'behavior', 'of', 'network', 'systems', 'anomaly', 'detection', 'can', 'be', 'considered', 'as', 'a', 'classification', 'problem', 'where', 'it', 'builds', 'models', 'of', 'normal', 'network', 'behavior', 'of', 'which', 'it', 'uses', 'to', 'detect', 'new', 'patterns', 'that', 'significantly', 'deviate', 'from', 'the', 'model', 'most', 'of', 'the', 'current', 'approaches', 'on', 'anomaly', 'detection', 'is', 'based', 'on', 'the', 'learning', 'of', 'normal', 'behavior', 'and', 'anomalous', 'actions', 'they', 'do', 'not', 'include', 'memory', 'that', 'is', 'they', 'do', 'not', 'take', 'into', 'account', 'previous', 'events', 'classify', 'new', 'ones', 'in', 'this', 'paper', 'we', 'propose', 'a', 'one', 'class', 'collective', 'anomaly', 'detection', 'model', 'based', 'on', 'neural', 'network', 'learning', 'normally', 'a', 'long', 'short', 'term', 'memory', 'recurrent', 'neural', 'network', 'lstm', 'rnn', 'is', 'trained', 'only', 'on', 'normal', 'data', 'and', 'it', 'is', 'capable', 'of', 'predicting', 'several', 'time', 'steps', 'ahead', 'of', 'an', 'input', 'in', 'our', 'approach', 'a', 'lstm', 'rnn', 'is', 'trained', 'on', 'normal', 'time', 'series', 'data', 'before', 'performing', 'a', 'prediction', 'for', 'each', 'time', 'step', 'instead', 'of', 'considering', 'each', 'timestep', 'separately', 'the', 'observation', 'of', 'prediction', 'errors', 'from', 'a', 'certain', 'number', 'of', 'timesteps', 'is', 'now', 'proposed', 'as', 'a', 'new', 'idea', 'for', 'detecting', 'collective', 'anomalies', 'the', 'prediction', 'errors', 'of', 'a', 'certain', 'number', 'of', 'the', 'latest', 'timesteps', 'above', 'a', 'threshold', 'will', 'indicate', 'a', 'collective', 'anomaly', 'the', 'model', 'is', 'evaluated', 'on', 'a', 'time', 'series', 'version', 'of', 'the', 'kdd', '1999', 'dataset', 'the', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'model', 'is', 'capable', 'to', 'detect', 'collective', 'anomaly', 'efficiently']] | [-0.12605581076561168, 0.04540756500982368, -0.06796905797747174, 0.07369925993007713, -0.10964870810161122, -0.20026689141654266, 0.0587196723155474, 0.37332290408986907, -0.2557628488202553, -0.3257279909137164, 0.11578810298536629, -0.2982960769334401, -0.1918786434556315, 0.19777157574131246, -0.09258078568771606, 0.06218272969077512, 0.10063959035897811, 0.10232615671251756, -0.001346227545684702, -0.26938374619111155, 0.281698608263904, 0.06313730824351783, 0.33398134388934664, 0.019577282155424515, 0.0992772018321311, -0.033318261750383486, -0.0498118415510964, -0.01162658691443962, -0.006682297154582838, 0.09659549949115181, 0.2932625902186233, 0.16466177746892946, 0.3126637772345443, -0.44718832695122124, -0.25972452927274225, 0.1310576567341062, 0.13574654634051603, 0.1163026136833958, -0.0038354059186941143, -0.32989781967390486, 0.08820071461623613, -0.18980017471173122, -0.02896459374255435, -0.1193137890478911, 0.017151743398231625, -0.03371600377698049, -0.24919614646728086, 0.04971292564596297, 0.0662117453929837, 0.04018359136360642, -0.03331169080149881, -0.08155490733965129, 0.03949629751683383, 0.1778242777878071, 0.057626187195509514, 0.021234970072507332, 0.1568349720982951, -0.1742110735869804, -0.15973702316093719, 0.3618671764672117, -0.05821211162657792, -0.16907484436647074, 0.20142783322305957, -0.03884100882520138, -0.1875064303249147, 0.11177650206840374, 0.2391868369771876, 0.10710820300065138, -0.17809110647477341, -0.026933811443675848, -0.034457004478227506, 0.19123014610122993, 0.012860198888901464, -0.028339694390191475, 0.215518986341432, 0.27039247701226565, 0.044067211592615854, 0.07911446812836466, -0.14155503517610324, -0.07313203425835293, -0.24575678813664742, -0.12684696504758494, -0.181093227064965, -0.005874844524057576, -0.03917382760964372, -0.15741698633720377, 0.41539598878764183, 0.2208721364313789, 0.19648548202018556, 0.10078686054158156, 0.32643805027440925, 0.05140946120266396, 0.15532193391446128, 0.08967188286470433, 0.20038225579987162, 0.01425132707653331, 0.1295405037743761, -0.17284544718756772, 0.14912614320047382, 0.053814117668826184] |
1,802.00325 | Common factors in automatic and Sturmian sequences | In this short note we show that a k-automatic sequence and a Sturmian
sequence cannot have arbitrarily large factors in common.
| math.CO cs.FL | in this short note we show that a kautomatic sequence and a sturmian sequence cannot have arbitrarily large factors in common | [['in', 'this', 'short', 'note', 'we', 'show', 'that', 'a', 'kautomatic', 'sequence', 'and', 'a', 'sturmian', 'sequence', 'can', 'not', 'have', 'arbitrarily', 'large', 'factors', 'in', 'common']] | [-0.18790356103669514, 0.19650406174531038, -0.13190873331305655, 0.14502648464721543, -0.030779205834154378, -0.0909768426367505, 0.05812563748225908, 0.4799536402252587, -0.34852479330518027, -0.21821241859685292, 0.08923899891405282, -0.22923649881373753, -0.22775766998529434, 0.17467630840837955, -0.19314076796184632, 0.0008329813982444731, 0.183252662780102, 0.08100960005752066, -0.026938351241617718, -0.26341198960488493, 0.3292176831852306, -0.10160279671915552, 0.16236084208569743, 0.03941802820190787, 0.07292675095694987, -0.048061393963342365, 0.01923277491534298, 0.01992226273498752, -0.10742769383101734, 0.08757975832982497, 0.3251535404812206, 0.15230423076586289, 0.34296481108123605, -0.37373234500939195, -0.15442515863105655, 0.1990695417943326, 0.25476668448060413, 0.16638814793391662, -0.07363789893729104, -0.14680629917843777, 0.19959795246408743, -0.20637179279318926, -0.05715291993692517, -0.08699459815397859, 0.10539371308616617, 0.15939053943888706, -0.24017196184616874, -0.012533218430524523, 0.17634413528933443, 0.04021635698154569, 0.03385426214134151, -0.08709111729298126, 0.146234463815662, 0.16276890873401004, 0.08132804701612754, 0.11315504874272103, -0.030137188457460565, -0.04379643390314992, -0.08229613668200644, 0.3366571798581969, -0.1729736663401127, -0.22877179448683324, 0.17213485469851134, -0.23278280245986852, -0.2438922995193438, 0.12938262335956097, 0.1264855963474309, 0.14940496606074952, -0.12941432917829265, 0.06646858472959138, -0.13391239365393465, 0.263400031931021, 0.11827949324453418, 0.07175977420146493, 0.19393643728372725, 0.0973367346027358, -0.008764724744568493, 0.13562290156683462, -0.008937334874644876, 0.03215480815957893, -0.29157322831451893, -0.11522449070418422, -0.1933001015673984, 0.13108168704374376, -0.09197254387849667, -0.20405153218995442, 0.35065248828719964, 0.12839927575127644, 0.2455498188607056, 0.1464268590577624, 0.1970780056647279, 0.0909630170261318, 0.1004888450896198, 0.07001248611645265, 0.11656273664398627, -0.017856883647089653, 0.009785458784211765, -0.14164122371849688, 0.08387597909578207, 0.0683741552374241] |
1,802.00326 | Late-time acceleration with steep exponential potentials | In this letter, we study the cosmological dynamics of steeper potential than
exponential. Our analysis shows that a simple extension of an exponential
potential allows to capture late-time cosmic acceleration and retain the
tracker behavior. We also perform statefinder and $Om$ diagnostics to
distinguish dark energy models among themselves and with $\Lambda$CDM. In
addition, to put the observational constraints on the model parameters, we
modify the publicly available CosmoMC code and use an integrated data base of
baryon acoustic oscillation, latest Type Ia supernova from Joint Light Curves
sample and the local Hubble constant value measured by the Hubble Space
Telescope.
| gr-qc | in this letter we study the cosmological dynamics of steeper potential than exponential our analysis shows that a simple extension of an exponential potential allows to capture latetime cosmic acceleration and retain the tracker behavior we also perform statefinder and om diagnostics to distinguish dark energy models among themselves and with lambdacdm in addition to put the observational constraints on the model parameters we modify the publicly available cosmomc code and use an integrated data base of baryon acoustic oscillation latest type ia supernova from joint light curves sample and the local hubble constant value measured by the hubble space telescope | [['in', 'this', 'letter', 'we', 'study', 'the', 'cosmological', 'dynamics', 'of', 'steeper', 'potential', 'than', 'exponential', 'our', 'analysis', 'shows', 'that', 'a', 'simple', 'extension', 'of', 'an', 'exponential', 'potential', 'allows', 'to', 'capture', 'latetime', 'cosmic', 'acceleration', 'and', 'retain', 'the', 'tracker', 'behavior', 'we', 'also', 'perform', 'statefinder', 'and', 'om', 'diagnostics', 'to', 'distinguish', 'dark', 'energy', 'models', 'among', 'themselves', 'and', 'with', 'lambdacdm', 'in', 'addition', 'to', 'put', 'the', 'observational', 'constraints', 'on', 'the', 'model', 'parameters', 'we', 'modify', 'the', 'publicly', 'available', 'cosmomc', 'code', 'and', 'use', 'an', 'integrated', 'data', 'base', 'of', 'baryon', 'acoustic', 'oscillation', 'latest', 'type', 'ia', 'supernova', 'from', 'joint', 'light', 'curves', 'sample', 'and', 'the', 'local', 'hubble', 'constant', 'value', 'measured', 'by', 'the', 'hubble', 'space', 'telescope']] | [-0.04998734837287281, 0.0484797610180328, -0.12159538448391723, 0.13480095966779027, -0.17713754501488835, -0.15171991855293365, 0.029534210612315058, 0.35212692972457055, -0.23484158674531644, -0.33046267082047937, 0.029559266769631515, -0.2861845948029422, -0.047423749387559326, 0.2399829520940744, 0.006294419355621321, 0.011965759979136804, 0.077153896682407, -0.025941049901418167, -0.055721608458529456, -0.2914510801305423, 0.30798506740443776, 0.1571407501982285, 0.27644232956123177, -0.05788768198119827, 0.08212904270051398, -0.0678022051492872, -0.12173122713471403, -0.006915600342493928, -0.25006192026114943, 0.06897233020846207, 0.15702922439256983, 0.20411073659445242, 0.16545601308779181, -0.4204284826677268, -0.2512410161083122, 0.1816255636467128, 0.19029806103409813, 0.10490344011104934, -0.04947724589722987, -0.26334234882183005, 0.004197939082353127, -0.18773567343896053, -0.1391887186454738, -0.039118014764741506, -0.02594906306078676, 0.02067901119866436, -0.2500400827312381, 0.10313348945358188, -0.0639969626496924, 0.014827498631312115, -0.1305929809620853, -0.05850278932398351, -0.014015228952059873, 0.0529168937401385, 0.060097435589575456, 0.040643468352800034, 0.09259640677638425, -0.12145263143114303, -0.03307040488476505, 0.36299279507360244, -0.14612360673539898, -0.07530528793369631, 0.15113090220285524, -0.14338243453496016, -0.1327617205863837, 0.03955353849502926, 0.19432449851664577, 0.03957233352051808, -0.1670961519657164, 0.12154000925331257, 0.044029542466275176, 0.21214500181192514, 0.02816770942236232, 0.021364942136336475, 0.21244558255363366, 0.1565822406307711, 0.010876428907608041, 0.07002991056622992, -0.15766435960771075, -0.03324451015819565, -0.3469242513880576, -0.12064545052955941, -0.14457999455908516, 0.02457106546706308, -0.15810729029728446, -0.1440310573924591, 0.4015333602656749, 0.14947382118184083, 0.22141942717042742, 0.07255174150565953, 0.3381569645192363, 0.02260190786650902, 0.06947607539437416, 0.08445743403883332, 0.3067057947028834, 0.09307117503606668, 0.13645111666623466, -0.27146152841010235, 0.015822460061160497, 0.012220814807967531] |
1,802.00327 | Accuracy of Flight Altitude Measured with Low-Cost GNSS, Radar and
Barometer Sensors: Implications for Airborne Radiometric Surveys | Flight height is a fundamental parameter for correcting the gamma signal
produced by terrestrial radionuclides measured during airborne surveys. The
frontiers of radiometric measurements with UAV require light and accurate
altimeters flying at some 10 m from the ground. We equipped an aircraft with
seven altimetric sensors (three low-cost GNSS receivers, one inertial
measurement unit, one radar altimeter and two barometers) and analyzed $\sim$ 3
h of data collected over the sea in the (35-2194) m altitude range. At low
altitudes (H $<$ 70 m) radar and barometric altimeters provide the best
performances, while GNSS data are used only for barometer calibration as they
are affected by a large noise due to the multipath from the sea. The $\sim$ 1 m
median standard deviation at 50 m altitude affects the estimation of the ground
radioisotope abundances with an uncertainty less than 1.3%. The GNSS
double-difference post-processing enhanced significantly the data quality for H
$>$ 80 m in terms of both altitude median standard deviation and agreement
between the reconstructed and measured GPS antennas distances. Flying at 100 m
the estimated uncertainty on the ground total activity due to the uncertainty
on the flight height is of the order of 2%.
| physics.ins-det astro-ph.IM physics.app-ph | flight height is a fundamental parameter for correcting the gamma signal produced by terrestrial radionuclides measured during airborne surveys the frontiers of radiometric measurements with uav require light and accurate altimeters flying at some 10 m from the ground we equipped an aircraft with seven altimetric sensors three lowcost gnss receivers one inertial measurement unit one radar altimeter and two barometers and analyzed sim 3 h of data collected over the sea in the 352194 m altitude range at low altitudes h 70 m radar and barometric altimeters provide the best performances while gnss data are used only for barometer calibration as they are affected by a large noise due to the multipath from the sea the sim 1 m median standard deviation at 50 m altitude affects the estimation of the ground radioisotope abundances with an uncertainty less than 13 the gnss doubledifference postprocessing enhanced significantly the data quality for h 80 m in terms of both altitude median standard deviation and agreement between the reconstructed and measured gps antennas distances flying at 100 m the estimated uncertainty on the ground total activity due to the uncertainty on the flight height is of the order of 2 | [['flight', 'height', 'is', 'a', 'fundamental', 'parameter', 'for', 'correcting', 'the', 'gamma', 'signal', 'produced', 'by', 'terrestrial', 'radionuclides', 'measured', 'during', 'airborne', 'surveys', 'the', 'frontiers', 'of', 'radiometric', 'measurements', 'with', 'uav', 'require', 'light', 'and', 'accurate', 'altimeters', 'flying', 'at', 'some', '10', 'm', 'from', 'the', 'ground', 'we', 'equipped', 'an', 'aircraft', 'with', 'seven', 'altimetric', 'sensors', 'three', 'lowcost', 'gnss', 'receivers', 'one', 'inertial', 'measurement', 'unit', 'one', 'radar', 'altimeter', 'and', 'two', 'barometers', 'and', 'analyzed', 'sim', '3', 'h', 'of', 'data', 'collected', 'over', 'the', 'sea', 'in', 'the', '352194', 'm', 'altitude', 'range', 'at', 'low', 'altitudes', 'h', '70', 'm', 'radar', 'and', 'barometric', 'altimeters', 'provide', 'the', 'best', 'performances', 'while', 'gnss', 'data', 'are', 'used', 'only', 'for', 'barometer', 'calibration', 'as', 'they', 'are', 'affected', 'by', 'a', 'large', 'noise', 'due', 'to', 'the', 'multipath', 'from', 'the', 'sea', 'the', 'sim', '1', 'm', 'median', 'standard', 'deviation', 'at', '50', 'm', 'altitude', 'affects', 'the', 'estimation', 'of', 'the', 'ground', 'radioisotope', 'abundances', 'with', 'an', 'uncertainty', 'less', 'than', '13', 'the', 'gnss', 'doubledifference', 'postprocessing', 'enhanced', 'significantly', 'the', 'data', 'quality', 'for', 'h', '80', 'm', 'in', 'terms', 'of', 'both', 'altitude', 'median', 'standard', 'deviation', 'and', 'agreement', 'between', 'the', 'reconstructed', 'and', 'measured', 'gps', 'antennas', 'distances', 'flying', 'at', '100', 'm', 'the', 'estimated', 'uncertainty', 'on', 'the', 'ground', 'total', 'activity', 'due', 'to', 'the', 'uncertainty', 'on', 'the', 'flight', 'height', 'is', 'of', 'the', 'order', 'of', '2']] | [-0.1129669275429404, 0.18840066831673577, 0.014549455000800366, 0.04488760123459375, 0.01478430582566795, -0.12078434711307934, 0.0333483965535249, 0.3655481588437545, -0.21241947285336804, -0.43368161862183896, 0.13207273493753746, -0.3436903626021302, -0.010896742234614735, 0.2514515837728122, -0.0898131439034656, 0.07520115144826396, 0.10526003054704289, 0.03884854195274208, -0.04972856180125857, -0.1816547712197109, 0.20127009922324926, 0.13475550055427818, 0.24873467247781098, -0.021285719285738105, 0.15127800564858968, -0.006051973766428704, -0.06526183815820295, -0.029935216977812196, -0.1087742593728614, 0.08830205929389566, 0.252423369734339, 0.11717875983936674, 0.19324664518294132, -0.372297861428613, -0.19348093520906962, 0.08867851990436641, 0.08821578056137826, -0.020911344679842264, -0.004833447208808621, -0.3264451076535565, 0.055124909120459795, -0.1744181349830778, -0.12263278523073959, 0.06297592138776517, 0.026155594014087503, 0.004396099298752901, -0.26722196766593476, 0.035260248749887535, -0.06000285485981517, 0.15225984864602132, -0.06288131643846935, -0.18386196219647416, -0.03889647913783104, 0.1631909704895462, 0.01207934851919738, 0.049793646620985656, 0.17735519941791664, -0.0733796703315587, -0.018417316132548208, 0.4079890555360031, -0.11076222448730046, -0.12188453075822861, 0.17234655316771788, -0.20041579979338817, -0.061305549081262886, 0.2055691503408859, 0.19419853647277519, 0.05153709883820646, -0.12747852747062488, 0.009896082313742003, 0.02728290896570519, 0.18130900055569196, 0.11445992897687556, 0.03944114721655621, 0.1820215282733647, 0.14973108720851644, 0.12780771860128212, 0.008693153990138019, -0.27339722908681674, -0.004095731969514139, -0.2519042947423426, -0.10237533170829363, -0.18791672012445573, 0.043477770613449415, -0.11664844417011445, -0.023086872265427088, 0.32303324470068423, 0.1536303359221629, 0.18286484025646838, 0.07122247981451622, 0.3713667127208746, 0.034084869966229274, 0.059511980363785535, 0.09436962157499748, 0.2679269323631829, 0.09512123404716959, 0.12389484900869524, -0.19435318313272937, 0.077108669059104, -0.040497774544691105] |
1,802.00328 | Analysis of Motion Planning by Sampling in Subspaces of Progressively
Increasing Dimension | Despite the performance advantages of modern sampling-based motion planners,
solving high dimensional planning problems in near real-time remains a
challenge. Applications include hyper-redundant manipulators, snake-like and
humanoid robots. Based on the intuition that many of these problem instances do
not require the robots to exercise every degree of freedom independently, we
introduce an enhancement to popular sampling-based planning algorithms aimed at
circumventing the exponential dependence on dimensionality. We propose
beginning the search in a lower dimensional subspace of the configuration space
in the hopes that a simple solution will be found quickly. After a certain
number of samples are generated, if no solution is found, we increase the
dimension of the search subspace by one and continue sampling in the higher
dimensional subspace. In the worst case, the search subspace expands to include
the full configuration space - making the completeness properties identical to
the underlying sampling-based planer. Our experiments comparing the enhanced
and traditional version of RRT, RRT-Connect, and BidirectionalT-RRT on both a
planar hyper-redundant manipulator and the Baxter humanoid robot indicate that
a solution is typically found much faster using this approach and the run time
appears to be less sensitive to the dimension of the full configuration space.
We explore important implementation issues in the sampling process and discuss
its limitations.
| cs.RO | despite the performance advantages of modern samplingbased motion planners solving high dimensional planning problems in near realtime remains a challenge applications include hyperredundant manipulators snakelike and humanoid robots based on the intuition that many of these problem instances do not require the robots to exercise every degree of freedom independently we introduce an enhancement to popular samplingbased planning algorithms aimed at circumventing the exponential dependence on dimensionality we propose beginning the search in a lower dimensional subspace of the configuration space in the hopes that a simple solution will be found quickly after a certain number of samples are generated if no solution is found we increase the dimension of the search subspace by one and continue sampling in the higher dimensional subspace in the worst case the search subspace expands to include the full configuration space making the completeness properties identical to the underlying samplingbased planer our experiments comparing the enhanced and traditional version of rrt rrtconnect and bidirectionaltrrt on both a planar hyperredundant manipulator and the baxter humanoid robot indicate that a solution is typically found much faster using this approach and the run time appears to be less sensitive to the dimension of the full configuration space we explore important implementation issues in the sampling process and discuss its limitations | [['despite', 'the', 'performance', 'advantages', 'of', 'modern', 'samplingbased', 'motion', 'planners', 'solving', 'high', 'dimensional', 'planning', 'problems', 'in', 'near', 'realtime', 'remains', 'a', 'challenge', 'applications', 'include', 'hyperredundant', 'manipulators', 'snakelike', 'and', 'humanoid', 'robots', 'based', 'on', 'the', 'intuition', 'that', 'many', 'of', 'these', 'problem', 'instances', 'do', 'not', 'require', 'the', 'robots', 'to', 'exercise', 'every', 'degree', 'of', 'freedom', 'independently', 'we', 'introduce', 'an', 'enhancement', 'to', 'popular', 'samplingbased', 'planning', 'algorithms', 'aimed', 'at', 'circumventing', 'the', 'exponential', 'dependence', 'on', 'dimensionality', 'we', 'propose', 'beginning', 'the', 'search', 'in', 'a', 'lower', 'dimensional', 'subspace', 'of', 'the', 'configuration', 'space', 'in', 'the', 'hopes', 'that', 'a', 'simple', 'solution', 'will', 'be', 'found', 'quickly', 'after', 'a', 'certain', 'number', 'of', 'samples', 'are', 'generated', 'if', 'no', 'solution', 'is', 'found', 'we', 'increase', 'the', 'dimension', 'of', 'the', 'search', 'subspace', 'by', 'one', 'and', 'continue', 'sampling', 'in', 'the', 'higher', 'dimensional', 'subspace', 'in', 'the', 'worst', 'case', 'the', 'search', 'subspace', 'expands', 'to', 'include', 'the', 'full', 'configuration', 'space', 'making', 'the', 'completeness', 'properties', 'identical', 'to', 'the', 'underlying', 'samplingbased', 'planer', 'our', 'experiments', 'comparing', 'the', 'enhanced', 'and', 'traditional', 'version', 'of', 'rrt', 'rrtconnect', 'and', 'bidirectionaltrrt', 'on', 'both', 'a', 'planar', 'hyperredundant', 'manipulator', 'and', 'the', 'baxter', 'humanoid', 'robot', 'indicate', 'that', 'a', 'solution', 'is', 'typically', 'found', 'much', 'faster', 'using', 'this', 'approach', 'and', 'the', 'run', 'time', 'appears', 'to', 'be', 'less', 'sensitive', 'to', 'the', 'dimension', 'of', 'the', 'full', 'configuration', 'space', 'we', 'explore', 'important', 'implementation', 'issues', 'in', 'the', 'sampling', 'process', 'and', 'discuss', 'its', 'limitations']] | [-0.11032912391237915, 0.07008273434394999, -0.05935221224504892, 0.042204435108402015, -0.12126856923261482, -0.12373928714956525, 0.0400158943935684, 0.39733178985199696, -0.25499002695443845, -0.3183777500998299, 0.13606154483870408, -0.23674281814271794, -0.15068560151080163, 0.20451773676465546, -0.10530463646535042, 0.06900236048963018, 0.11967804224915662, 0.02966061083353915, -0.06292412447290635, -0.2693843600490649, 0.25702181261885065, 0.05890250620805606, 0.2764760925893602, -0.00950395132037196, 0.13834380436694702, 0.043059527862461214, 0.010018622333552898, 0.03454614648738775, -0.10268986852943786, 0.11968002745053591, 0.2702636826170591, 0.15490792500610762, 0.31752956119137554, -0.40857150412166277, -0.1779871485503566, 0.12645943367300239, 0.1686494364952317, 0.11444124021844165, -0.03399821605427929, -0.2886603403828801, 0.07503102466745197, -0.13573991304505365, -0.1545308118797004, -0.1039829274773612, -0.003968996059518518, -0.036744356541982236, -0.23284301347206873, 0.00025759183445875095, 0.05743935635150849, 0.04031616331787587, -0.04292952692529345, -0.11702351941164794, 0.021113958523854753, 0.1029914051188894, 0.022696280550900276, 0.03913352459247382, 0.12863216360010654, -0.1575758958628765, -0.17877717270298404, 0.40285938583261705, 0.015487325584234775, -0.22730250454333145, 0.22531092776927902, -0.1269223048650431, -0.1336427112527297, 0.136862712543796, 0.2016638427830569, 0.15033028269173437, -0.11955159160589694, 0.1026763113664204, 0.0035068660772423136, 0.15925553066541775, 0.040840600809425046, -0.0055104825417247585, 0.14274868954569958, 0.21615326000632332, 0.13794140105617875, 0.13169851686304682, -0.06646692541752995, -0.12475083380902433, -0.23374317719311155, -0.15886085187958088, -0.16577455030868427, -0.017181036326600972, -0.10730007586003784, -0.13427262607619236, 0.36332282640769165, 0.20759077413630328, 0.18949160856120112, 0.05230064322965501, 0.31970440612157, 0.0798345717831014, 0.06826986194525643, 0.12189159360515885, 0.21459251277935076, 0.02609935742671127, 0.09891443234376328, -0.21367881173390965, 0.06382351724720858, 0.06248637627950817] |
1,802.00329 | A special class of solutions in $F(R)$-gravity | We consider a special class of vacuum $F(R)$-modified gravity models. The
form of their Lagrangian is such that the field equations are trivially
satisfied when the Ricci scalar is constant. There are many interesting
$F(R)$-models for inflation and dark energy that fall in this class. However,
little is known outside the domain of cosmology therefore we aim to explore the
class of solutions that are static and spherically symmetric. After some
general considerations, we investigate in more detail black hole solutions,
traversable wormhole metrics and, finally, configurations that can match the
anomalous rotation curves of galaxies.
| gr-qc astro-ph.CO hep-th | we consider a special class of vacuum frmodified gravity models the form of their lagrangian is such that the field equations are trivially satisfied when the ricci scalar is constant there are many interesting frmodels for inflation and dark energy that fall in this class however little is known outside the domain of cosmology therefore we aim to explore the class of solutions that are static and spherically symmetric after some general considerations we investigate in more detail black hole solutions traversable wormhole metrics and finally configurations that can match the anomalous rotation curves of galaxies | [['we', 'consider', 'a', 'special', 'class', 'of', 'vacuum', 'frmodified', 'gravity', 'models', 'the', 'form', 'of', 'their', 'lagrangian', 'is', 'such', 'that', 'the', 'field', 'equations', 'are', 'trivially', 'satisfied', 'when', 'the', 'ricci', 'scalar', 'is', 'constant', 'there', 'are', 'many', 'interesting', 'frmodels', 'for', 'inflation', 'and', 'dark', 'energy', 'that', 'fall', 'in', 'this', 'class', 'however', 'little', 'is', 'known', 'outside', 'the', 'domain', 'of', 'cosmology', 'therefore', 'we', 'aim', 'to', 'explore', 'the', 'class', 'of', 'solutions', 'that', 'are', 'static', 'and', 'spherically', 'symmetric', 'after', 'some', 'general', 'considerations', 'we', 'investigate', 'in', 'more', 'detail', 'black', 'hole', 'solutions', 'traversable', 'wormhole', 'metrics', 'and', 'finally', 'configurations', 'that', 'can', 'match', 'the', 'anomalous', 'rotation', 'curves', 'of', 'galaxies']] | [-0.17699666561505487, 0.10781625818829828, -0.06504524508636678, 0.16656487839888237, -0.1363238529981269, -0.1776472829951672, -0.06639573585319643, 0.36733799943855655, -0.17747243251263475, -0.2819728286315997, 0.1344469425821444, -0.2582805218626163, -0.14675123538957754, 0.18855171961088976, -0.07808117716194829, 0.0237607702826305, 0.0037928596405739277, 0.047852545811717086, -0.07924456849286798, -0.25563421717621776, 0.4333487428569545, 0.011746704277660077, 0.21380162865777189, 0.013290868329931982, 0.06668310793853986, -0.09025415509192196, 0.0216434150885713, 0.06729789440093252, -0.20028483360905133, 0.04282093515697246, 0.21417359022768778, 0.1559419048911271, 0.20848142390847593, -0.3990500657237135, -0.24201610782377733, 0.17952853104725364, 0.13138486504127891, 0.1736903679460132, -0.10642772212743996, -0.2498316174702874, 0.10714948015568855, -0.16264128615148365, -0.1663206062409396, -0.08153139915763556, 0.038752281787310494, 0.012824229603817608, -0.18572944510500142, 0.07059653079583465, 0.050833706540288404, -0.04161513954750262, -0.12149529742600862, -0.05973384426185172, -0.015260641351536227, 0.058745522560457175, 0.13947798276179432, -0.0017177198121013741, 0.13389252230505613, -0.18711322223862226, -0.055150253563624574, 0.41518878055891645, -0.0790913536214551, -0.2211885645131891, 0.14910849894901426, -0.16578697502457848, -0.14065393315589367, 0.06797042639785407, 0.14370278968999628, 0.1879122242438219, -0.16064961689289703, 0.17014651943281933, -0.05001621068125436, 0.11528072010393468, 0.09804128475661855, 0.031159252027161227, 0.30031172671200085, 0.06386799559550127, 0.04762408607772765, 0.13253916676452113, 0.0030229239394733063, -0.14239219199225772, -0.3786126271588728, -0.1468138445149331, -0.10347730640690618, 0.07499719919481625, -0.13248712356971737, -0.17193633350446666, 0.3786346033521113, 0.09860077199118678, 0.12306960785159997, 0.0697817358886823, 0.22534425529496124, 0.0718555114872288, 0.03269138961331919, 0.12517614965569615, 0.31467737009279517, 0.10754853408191896, 0.10171048433160952, -0.1742776915483167, -0.03352640601224266, 0.030102113077494625] |
1,802.0033 | An efficient algorithm for global interval solution of nonlinear
algebraic equations and its GPGPU implementation | Solving nonlinear algebraic equations is a classic mathematics problem, and
common in scientific researches and engineering applications. There are many
numeric, symbolic and numeric-symbolic methods of solving (real) solutions.
Unlucky, these methods are constrained by some factors, e.g., high complexity,
slow serial calculation, and the notorious intermediate expression expansion.
Especially when the count of variables is larger than six, the efficiency is
decreasing drastically. In this paper, according to the property of physical
world, we pay attention to nonlinear algebraic equations whose variables are in
fixed constraints, and get meaningful real solutions. Combining with
parallelism of GPGPU, we present an efficient algorithm, by searching the
solution space globally and solving the nonlinear algebraic equations with real
interval solutions. Furthermore, we realize the Hansen-Sengupta method on
GPGPU. The experiments show that our method can solve many nonlinear algebraic
equations, and the results are accurate and more efficient compared to
traditional serial methods.
| cs.NA cs.DC cs.SC | solving nonlinear algebraic equations is a classic mathematics problem and common in scientific researches and engineering applications there are many numeric symbolic and numericsymbolic methods of solving real solutions unlucky these methods are constrained by some factors eg high complexity slow serial calculation and the notorious intermediate expression expansion especially when the count of variables is larger than six the efficiency is decreasing drastically in this paper according to the property of physical world we pay attention to nonlinear algebraic equations whose variables are in fixed constraints and get meaningful real solutions combining with parallelism of gpgpu we present an efficient algorithm by searching the solution space globally and solving the nonlinear algebraic equations with real interval solutions furthermore we realize the hansensengupta method on gpgpu the experiments show that our method can solve many nonlinear algebraic equations and the results are accurate and more efficient compared to traditional serial methods | [['solving', 'nonlinear', 'algebraic', 'equations', 'is', 'a', 'classic', 'mathematics', 'problem', 'and', 'common', 'in', 'scientific', 'researches', 'and', 'engineering', 'applications', 'there', 'are', 'many', 'numeric', 'symbolic', 'and', 'numericsymbolic', 'methods', 'of', 'solving', 'real', 'solutions', 'unlucky', 'these', 'methods', 'are', 'constrained', 'by', 'some', 'factors', 'eg', 'high', 'complexity', 'slow', 'serial', 'calculation', 'and', 'the', 'notorious', 'intermediate', 'expression', 'expansion', 'especially', 'when', 'the', 'count', 'of', 'variables', 'is', 'larger', 'than', 'six', 'the', 'efficiency', 'is', 'decreasing', 'drastically', 'in', 'this', 'paper', 'according', 'to', 'the', 'property', 'of', 'physical', 'world', 'we', 'pay', 'attention', 'to', 'nonlinear', 'algebraic', 'equations', 'whose', 'variables', 'are', 'in', 'fixed', 'constraints', 'and', 'get', 'meaningful', 'real', 'solutions', 'combining', 'with', 'parallelism', 'of', 'gpgpu', 'we', 'present', 'an', 'efficient', 'algorithm', 'by', 'searching', 'the', 'solution', 'space', 'globally', 'and', 'solving', 'the', 'nonlinear', 'algebraic', 'equations', 'with', 'real', 'interval', 'solutions', 'furthermore', 'we', 'realize', 'the', 'hansensengupta', 'method', 'on', 'gpgpu', 'the', 'experiments', 'show', 'that', 'our', 'method', 'can', 'solve', 'many', 'nonlinear', 'algebraic', 'equations', 'and', 'the', 'results', 'are', 'accurate', 'and', 'more', 'efficient', 'compared', 'to', 'traditional', 'serial', 'methods']] | [-0.10716237244118106, 0.027785468622420966, -0.061518751022299666, 0.078510509102274, -0.1408077249891006, -0.17349885576935922, 0.0019812643084200035, 0.36170417722314596, -0.28805261280937683, -0.3335674163454131, 0.1526911392872028, -0.27790694210628336, -0.19426070333727255, 0.26516536270712043, -0.05841898748138607, 0.11066892331203558, 0.10160153328234818, 0.0020329500954823208, -0.1089116233704149, -0.29152184792938046, 0.28594589703435064, -0.004164102940426377, 0.267853055293078, 0.010429831612355157, 0.1281848403948653, -0.040041215458470544, -0.07252486971685125, 0.04258805324710029, -0.08802335079933787, 0.16293362221108662, 0.3145788408137683, 0.1690299200962904, 0.3099842713833255, -0.45861858888310475, -0.17005138297959063, 0.10229137671123816, 0.16007944118048317, 0.12818568825546728, -0.034094104368021655, -0.24588015764301654, 0.0977876634093239, -0.11532136048159043, -0.09538906122008557, -0.15212309355503761, 0.01443407566742909, 0.04669109078814845, -0.2523513594329757, 0.04314603723879379, 0.016780044720976946, 0.058133061206430796, -0.06769446020433367, -0.1166652518812092, 0.04581999072911305, 0.06609250554731334, 0.05606941980834825, 0.005870703589046161, 0.07960242305213473, -0.13950529177485646, -0.14199170578058634, 0.3969977971997687, 0.007392439751666283, -0.26367210285525594, 0.19797597396543568, -0.07255412372229184, -0.14555763605132, 0.13359568347910655, 0.18909296759829275, 0.16039987591145272, -0.11995280372346485, 0.12700035513672453, -0.0065022568662194595, 0.14996887066545303, 0.06118625526053943, -0.00929885010560037, 0.10994513227210549, 0.1517482179630354, 0.049685720445731996, 0.1059181451588094, 0.021663029432834296, -0.1620858580299072, -0.2273781009505959, -0.13197300516390445, -0.13288737307208898, 0.014344794169418364, -0.14401621456748662, -0.1703740642593561, 0.37299575978865057, 0.16894526016154646, 0.13849091235760774, 0.0707020055449524, 0.3434336430724435, 0.19010710337858697, 0.0490244264662072, 0.1090767319445442, 0.16951196387370318, 0.10973353244070488, 0.12216612762590283, -0.2071744947422346, 0.04525726648272584, 0.06180509324841851] |
1,802.00331 | Uncertainties in the heliosheath ion temperatures | The Voyager plasma observations show that the physics of the heliosheath is
rather complex, and especially that the temperature derived from observation
differs from expectations. To explain this fact the temperature in the
heliosheath should be based on $\kappa$ distributions instead of Maxwellians
because the former allows for much higher temperature. Here we show an easy way
to calculate the $\kappa$ temperatures when those estimated from the data are
given as Maxwellian temperatures. We use the moments of the Maxwellian and
$\kappa$ distributions to estimate the $\kappa$ temperature. Moreover, we show
that the pressure (temperature) given by a truncated $\kappa$ distribution is
similar to that given by a Maxwellian and only starts to increase for higher
truncation velocities. We deduce a simple formula to convert the Maxwellian to
$\kappa$ pressure or temperature. We apply this result to the Voyager-2
observations in the heliosheath.
| physics.space-ph astro-ph.SR | the voyager plasma observations show that the physics of the heliosheath is rather complex and especially that the temperature derived from observation differs from expectations to explain this fact the temperature in the heliosheath should be based on kappa distributions instead of maxwellians because the former allows for much higher temperature here we show an easy way to calculate the kappa temperatures when those estimated from the data are given as maxwellian temperatures we use the moments of the maxwellian and kappa distributions to estimate the kappa temperature moreover we show that the pressure temperature given by a truncated kappa distribution is similar to that given by a maxwellian and only starts to increase for higher truncation velocities we deduce a simple formula to convert the maxwellian to kappa pressure or temperature we apply this result to the voyager2 observations in the heliosheath | [['the', 'voyager', 'plasma', 'observations', 'show', 'that', 'the', 'physics', 'of', 'the', 'heliosheath', 'is', 'rather', 'complex', 'and', 'especially', 'that', 'the', 'temperature', 'derived', 'from', 'observation', 'differs', 'from', 'expectations', 'to', 'explain', 'this', 'fact', 'the', 'temperature', 'in', 'the', 'heliosheath', 'should', 'be', 'based', 'on', 'kappa', 'distributions', 'instead', 'of', 'maxwellians', 'because', 'the', 'former', 'allows', 'for', 'much', 'higher', 'temperature', 'here', 'we', 'show', 'an', 'easy', 'way', 'to', 'calculate', 'the', 'kappa', 'temperatures', 'when', 'those', 'estimated', 'from', 'the', 'data', 'are', 'given', 'as', 'maxwellian', 'temperatures', 'we', 'use', 'the', 'moments', 'of', 'the', 'maxwellian', 'and', 'kappa', 'distributions', 'to', 'estimate', 'the', 'kappa', 'temperature', 'moreover', 'we', 'show', 'that', 'the', 'pressure', 'temperature', 'given', 'by', 'a', 'truncated', 'kappa', 'distribution', 'is', 'similar', 'to', 'that', 'given', 'by', 'a', 'maxwellian', 'and', 'only', 'starts', 'to', 'increase', 'for', 'higher', 'truncation', 'velocities', 'we', 'deduce', 'a', 'simple', 'formula', 'to', 'convert', 'the', 'maxwellian', 'to', 'kappa', 'pressure', 'or', 'temperature', 'we', 'apply', 'this', 'result', 'to', 'the', 'voyager2', 'observations', 'in', 'the', 'heliosheath']] | [-0.03866949965493506, 0.1858952096428346, -0.12567018402310517, 0.07579799234489357, -0.06839500826301535, -0.08721484259174733, 0.04050171312101029, 0.3625771230855188, -0.2673410543149428, -0.28254473444165573, 0.04951680743565353, -0.27742555141752223, -0.02540204779389868, 0.2051162759438027, -0.03839888653906805, -0.020734406555058447, -0.0025033980406091345, 0.06707892657527896, -0.07977102792714365, -0.18452849496364385, 0.3167797000093672, 0.10347097125425414, 0.2562525095711169, 0.062228160828899044, 0.05369452195701196, -0.0536532630570806, 0.024687348389542185, 0.055475032083214734, -0.1876217590583288, 0.07701690171982024, 0.2041020910972013, 0.07883684525377821, 0.18484860353279287, -0.3933887151102503, -0.2505791713060303, 0.058820277646223044, 0.11185432822358879, 0.10395251018796246, 0.0010837232179115885, -0.21141697366077167, 0.05985295292237526, -0.15966094178440687, -0.19221880395063914, -0.07821532196554166, 0.041869106878350666, 0.02157876745739079, -0.3050131697819887, 0.11427292162454784, 0.08230940817848786, 0.04053286838074951, -0.11100706933562846, -0.15876087313517928, -0.05070493242156308, 0.05589612588140677, 0.09446910468184135, 0.038454384966330094, 0.14676692530226249, -0.11434988757974787, -0.012304932807923875, 0.3788668309253725, -0.11588385922612844, -0.11406841249875985, 0.19642433628986974, -0.24902846767742942, -0.09689667042983058, 0.138069703699565, 0.11975726856397452, 0.10693343300567744, -0.13469384558113387, 0.06000688312440081, -0.04132154877004507, 0.17824312407601547, 0.0765573207608105, -0.03966142218625108, 0.18151986712941548, 0.07448143618982415, 0.056068142618775574, 0.13579249151386452, -0.12687126279749966, -0.058020075947580324, -0.2771677408706058, -0.14360303007647512, -0.20626867723397233, 0.06233735586568661, -0.10032931748760125, -0.1427281309388109, 0.32106371662885574, 0.2363179538731131, 0.25971157072515755, 0.07441022182599856, 0.3110069363456141, 0.18873986357520173, 0.02968560285879286, 0.11497146646830846, 0.23893294153878322, 0.14431496041703162, 0.11177658037139246, -0.18110323596543834, 0.07473158477186843, 0.021891926722686535] |
1,802.00332 | Elements of Effective Deep Reinforcement Learning towards Tactical
Driving Decision Making | Tactical driving decision making is crucial for autonomous driving systems
and has attracted considerable interest in recent years. In this paper, we
propose several practical components that can speed up deep reinforcement
learning algorithms towards tactical decision making tasks: 1) non-uniform
action skipping as a more stable alternative to action-repetition frame
skipping, 2) a counter-based penalty for lanes on which ego vehicle has less
right-of-road, and 3) heuristic inference-time action masking for apparently
undesirable actions. We evaluate the proposed components in a realistic driving
simulator and compare them with several baselines. Results show that the
proposed scheme provides superior performance in terms of safety, efficiency,
and comfort.
| cs.AI cs.LG | tactical driving decision making is crucial for autonomous driving systems and has attracted considerable interest in recent years in this paper we propose several practical components that can speed up deep reinforcement learning algorithms towards tactical decision making tasks 1 nonuniform action skipping as a more stable alternative to actionrepetition frame skipping 2 a counterbased penalty for lanes on which ego vehicle has less rightofroad and 3 heuristic inferencetime action masking for apparently undesirable actions we evaluate the proposed components in a realistic driving simulator and compare them with several baselines results show that the proposed scheme provides superior performance in terms of safety efficiency and comfort | [['tactical', 'driving', 'decision', 'making', 'is', 'crucial', 'for', 'autonomous', 'driving', 'systems', 'and', 'has', 'attracted', 'considerable', 'interest', 'in', 'recent', 'years', 'in', 'this', 'paper', 'we', 'propose', 'several', 'practical', 'components', 'that', 'can', 'speed', 'up', 'deep', 'reinforcement', 'learning', 'algorithms', 'towards', 'tactical', 'decision', 'making', 'tasks', '1', 'nonuniform', 'action', 'skipping', 'as', 'a', 'more', 'stable', 'alternative', 'to', 'actionrepetition', 'frame', 'skipping', '2', 'a', 'counterbased', 'penalty', 'for', 'lanes', 'on', 'which', 'ego', 'vehicle', 'has', 'less', 'rightofroad', 'and', '3', 'heuristic', 'inferencetime', 'action', 'masking', 'for', 'apparently', 'undesirable', 'actions', 'we', 'evaluate', 'the', 'proposed', 'components', 'in', 'a', 'realistic', 'driving', 'simulator', 'and', 'compare', 'them', 'with', 'several', 'baselines', 'results', 'show', 'that', 'the', 'proposed', 'scheme', 'provides', 'superior', 'performance', 'in', 'terms', 'of', 'safety', 'efficiency', 'and', 'comfort']] | [-0.1333203378521527, 0.0433265803847462, -0.07870978920310293, 0.02474533711515722, -0.10738534414697261, -0.19179700700388777, 0.07586973455978469, 0.4928407284120719, -0.20119863250958067, -0.3153091821802913, 0.11230294441671244, -0.2136029473417217, -0.19047962419156517, 0.22963433248168302, -0.18699376114716523, 0.08960256957936855, 0.10660142040190597, 0.027396088505962066, -0.040921512115303246, -0.25816777797327156, 0.2519188521851209, 0.048569775866954365, 0.30815771514815943, 0.0427117837437739, 0.1431964330419543, -0.01141380470778261, -0.007052642523887612, 0.00028190456685565766, -0.02129239143784313, 0.14583437528594265, 0.3101380135775322, 0.1636127557915946, 0.3909912994220143, -0.4104929236340381, -0.26496553731461364, 0.09765136468091182, 0.15310011774833712, 0.06113530085754714, -0.06227013371577154, -0.3119112377409779, 0.09867672186699651, -0.23443918181139797, -0.06573082271165082, -0.16475469556171446, 0.06370408206823326, -0.015020448590318362, -0.28177590809729214, -0.04762605243872496, 0.07078345200667778, 0.060377769278628486, -0.050725060657021544, -0.1282104922547227, 0.058531106108178695, 0.1767395205751416, 0.058064839451219, 0.04531694500751439, 0.1601557012702826, -0.18926584777537278, -0.1889263378456235, 0.4047131221031859, -0.029065035460960297, -0.17251632418261753, 0.25087953257773604, 0.0006124649551652727, -0.15796727684459516, 0.11994921897671053, 0.21455142462537402, 0.11602746891744789, -0.1288906899646723, -0.02065431672325801, 0.003625100644837533, 0.1265850558788294, 0.07125293174315067, 0.006439965271524021, 0.16175105097437545, 0.2614468663221314, 0.1406363308993778, 0.12424370459103513, -0.09568651782021681, -0.14364755269849583, -0.1923824315003696, -0.12166217187685625, -0.09378388551995158, -0.0051295941784268335, -0.11448890354340187, -0.07051236668734678, 0.3627443370266216, 0.2596643941964777, 0.14663890435670812, 0.09174186071890983, 0.383953985784735, 0.0685423143596078, 0.061989525767664116, 0.10505621357865277, 0.22095052239462912, 0.014640475543481963, 0.11644308113359979, -0.17663839461636685, 0.09728208395009418, 0.026394741492168534] |
1,802.00333 | Elliptic problems with boundary operators of higher orders in
H\"ormander-Roitberg spaces | We investigate elliptic boundary-value problems for which the maximum of the
orders of the boundary operators is equal to or greater than the order of the
elliptic differential equation. We prove that the operator corresponding to an
arbitrary problem of this kind is bounded and Fredholm between appropriate
Hilbert spaces which form certain two-sided scales and are built on the base of
isotropic H\"ormander spaces. The differentiation order for these spaces is
given by an arbitrary real number and positive function which varies slowly at
infinity in the sense of Karamata. We establish a local a priori estimate for
the generalized solutions to the problem and investigate their local regularity
(up to the boundary) on these scales. As an application, we find sufficient
conditions under which the solutions have continuous classical derivatives of a
given order.
| math.AP | we investigate elliptic boundaryvalue problems for which the maximum of the orders of the boundary operators is equal to or greater than the order of the elliptic differential equation we prove that the operator corresponding to an arbitrary problem of this kind is bounded and fredholm between appropriate hilbert spaces which form certain twosided scales and are built on the base of isotropic hormander spaces the differentiation order for these spaces is given by an arbitrary real number and positive function which varies slowly at infinity in the sense of karamata we establish a local a priori estimate for the generalized solutions to the problem and investigate their local regularity up to the boundary on these scales as an application we find sufficient conditions under which the solutions have continuous classical derivatives of a given order | [['we', 'investigate', 'elliptic', 'boundaryvalue', 'problems', 'for', 'which', 'the', 'maximum', 'of', 'the', 'orders', 'of', 'the', 'boundary', 'operators', 'is', 'equal', 'to', 'or', 'greater', 'than', 'the', 'order', 'of', 'the', 'elliptic', 'differential', 'equation', 'we', 'prove', 'that', 'the', 'operator', 'corresponding', 'to', 'an', 'arbitrary', 'problem', 'of', 'this', 'kind', 'is', 'bounded', 'and', 'fredholm', 'between', 'appropriate', 'hilbert', 'spaces', 'which', 'form', 'certain', 'twosided', 'scales', 'and', 'are', 'built', 'on', 'the', 'base', 'of', 'isotropic', 'hormander', 'spaces', 'the', 'differentiation', 'order', 'for', 'these', 'spaces', 'is', 'given', 'by', 'an', 'arbitrary', 'real', 'number', 'and', 'positive', 'function', 'which', 'varies', 'slowly', 'at', 'infinity', 'in', 'the', 'sense', 'of', 'karamata', 'we', 'establish', 'a', 'local', 'a', 'priori', 'estimate', 'for', 'the', 'generalized', 'solutions', 'to', 'the', 'problem', 'and', 'investigate', 'their', 'local', 'regularity', 'up', 'to', 'the', 'boundary', 'on', 'these', 'scales', 'as', 'an', 'application', 'we', 'find', 'sufficient', 'conditions', 'under', 'which', 'the', 'solutions', 'have', 'continuous', 'classical', 'derivatives', 'of', 'a', 'given', 'order']] | [-0.13934220720479704, 0.09057907709329276, -0.05704778533168685, 0.10041252846028381, -0.09507168705150594, -0.07985610515221625, -0.026013673426966893, 0.31234231110497873, -0.3215804589802728, -0.2561936529681963, 0.17242873757940663, -0.2623034436187214, -0.11688251639348249, 0.18323098997386886, -0.062059751275228336, 0.087002801208976, 0.007452675958013381, 0.10743390224353574, -0.13613060516859954, -0.2610719246646006, 0.44347596117158367, -0.0294737768237931, 0.21908188981058843, 0.054314461852995655, 0.14869540902102873, -0.0233073739834842, -0.010774709933149792, -0.009384128658840543, -0.18148046077139418, 0.14885393940836794, 0.22790879081688165, 0.04015101892497007, 0.3080180747407105, -0.4213030636242098, -0.1838128897909294, 0.18043267149957554, 0.11217370520342443, 0.03582402348847074, 0.02461390055181897, -0.27265729174456177, 0.12793215429358978, -0.11523546613684363, -0.1806150621696896, -0.06206690938116106, 0.022052635363412693, 0.05754868100013803, -0.3442635349586935, 0.052955054119914115, 0.07313611387850388, 0.05398928310366019, -0.13215236165064304, -0.06596565867349614, -0.003498607126804178, 0.10725319608215667, 0.038203866113155314, 0.014649805043625426, 0.042101664961699176, -0.09944887765210725, -0.07612566682869595, 0.33858686673150207, -0.051954461978204886, -0.2824326237040462, 0.16880460712812184, -0.15660383419120028, -0.06585227868259501, 0.08713855521123418, 0.16304911061546162, 0.19004102766869918, -0.09406790370121598, 0.10848805126015042, -0.05388631658142378, 0.1371769493664889, 0.11981900935129755, 0.027964645835762733, 0.09938644965843517, 0.08098799822619185, 0.19064672029857962, 0.1518753776566454, -0.007125855341334553, -0.09710510016927454, -0.3661624062532449, -0.17956778484136415, -0.14824488806976555, 0.08576678884599138, -0.14924587766419042, -0.21244189214399634, 0.3739852083843503, 0.11805948933290304, 0.19794555527144386, 0.09731270011637688, 0.21677181173992507, 0.21448014201022864, 0.03344780711203759, 0.07539876891122035, 0.17460432579494356, 0.1356835524270804, 0.09480778466197937, -0.18500480123261429, 0.04832966482225696, 0.1391080055758828] |
1,802.00334 | Centralized and distributed cognitive task processing in the human
connectome | A key question in modern neuroscience is how cognitive changes in a human
brain can be quantified and captured by functional connectomes (FC) . A
systematic approach to measure pairwise functional distance at different brain
states is lacking. This would provide a straight-forward way to quantify
differences in cognitive processing across tasks; also, it would help in
relating these differences in task-based FCs to the underlying structural
network. Here we propose a framework, based on the concept of Jensen-Shannon
divergence, to map the task-rest connectivity distance between tasks and
resting-state FC. We show how this information theoretical measure allows for
quantifying connectivity changes in distributed and centralized processing in
functional networks. We study resting-state and seven tasks from the Human
Connectome Project dataset to obtain the most distant links across tasks. We
investigate how these changes are associated to different functional brain
networks, and use the proposed measure to infer changes in the information
processing regimes. Furthermore, we show how the FC distance from resting state
is shaped by structural connectivity, and to what extent this relationship
depends on the task. This framework provides a well grounded mathematical
quantification of connectivity changes associated to cognitive processing in
large-scale brain networks.
| q-bio.NC | a key question in modern neuroscience is how cognitive changes in a human brain can be quantified and captured by functional connectomes fc a systematic approach to measure pairwise functional distance at different brain states is lacking this would provide a straightforward way to quantify differences in cognitive processing across tasks also it would help in relating these differences in taskbased fcs to the underlying structural network here we propose a framework based on the concept of jensenshannon divergence to map the taskrest connectivity distance between tasks and restingstate fc we show how this information theoretical measure allows for quantifying connectivity changes in distributed and centralized processing in functional networks we study restingstate and seven tasks from the human connectome project dataset to obtain the most distant links across tasks we investigate how these changes are associated to different functional brain networks and use the proposed measure to infer changes in the information processing regimes furthermore we show how the fc distance from resting state is shaped by structural connectivity and to what extent this relationship depends on the task this framework provides a well grounded mathematical quantification of connectivity changes associated to cognitive processing in largescale brain networks | [['a', 'key', 'question', 'in', 'modern', 'neuroscience', 'is', 'how', 'cognitive', 'changes', 'in', 'a', 'human', 'brain', 'can', 'be', 'quantified', 'and', 'captured', 'by', 'functional', 'connectomes', 'fc', 'a', 'systematic', 'approach', 'to', 'measure', 'pairwise', 'functional', 'distance', 'at', 'different', 'brain', 'states', 'is', 'lacking', 'this', 'would', 'provide', 'a', 'straightforward', 'way', 'to', 'quantify', 'differences', 'in', 'cognitive', 'processing', 'across', 'tasks', 'also', 'it', 'would', 'help', 'in', 'relating', 'these', 'differences', 'in', 'taskbased', 'fcs', 'to', 'the', 'underlying', 'structural', 'network', 'here', 'we', 'propose', 'a', 'framework', 'based', 'on', 'the', 'concept', 'of', 'jensenshannon', 'divergence', 'to', 'map', 'the', 'taskrest', 'connectivity', 'distance', 'between', 'tasks', 'and', 'restingstate', 'fc', 'we', 'show', 'how', 'this', 'information', 'theoretical', 'measure', 'allows', 'for', 'quantifying', 'connectivity', 'changes', 'in', 'distributed', 'and', 'centralized', 'processing', 'in', 'functional', 'networks', 'we', 'study', 'restingstate', 'and', 'seven', 'tasks', 'from', 'the', 'human', 'connectome', 'project', 'dataset', 'to', 'obtain', 'the', 'most', 'distant', 'links', 'across', 'tasks', 'we', 'investigate', 'how', 'these', 'changes', 'are', 'associated', 'to', 'different', 'functional', 'brain', 'networks', 'and', 'use', 'the', 'proposed', 'measure', 'to', 'infer', 'changes', 'in', 'the', 'information', 'processing', 'regimes', 'furthermore', 'we', 'show', 'how', 'the', 'fc', 'distance', 'from', 'resting', 'state', 'is', 'shaped', 'by', 'structural', 'connectivity', 'and', 'to', 'what', 'extent', 'this', 'relationship', 'depends', 'on', 'the', 'task', 'this', 'framework', 'provides', 'a', 'well', 'grounded', 'mathematical', 'quantification', 'of', 'connectivity', 'changes', 'associated', 'to', 'cognitive', 'processing', 'in', 'largescale', 'brain', 'networks']] | [-0.09743577880653168, 0.03569083283490718, -0.10798242324351738, 0.11904897109424281, -0.09386451599291629, -0.11446895076413498, 0.0631211901708586, 0.435568992852826, -0.33220716053443594, -0.33641096856915437, 0.028568653281039625, -0.2598806689749854, -0.29080998632060884, 0.15089773425757133, -0.14176158047036616, 0.04531962341085697, 0.0642321760380509, 0.07344255512983025, -0.042006707375144794, -0.17087447958306945, 0.2988978780851925, 0.036836816395416555, 0.3485212715958819, 0.06842844014413504, 0.05742993974641337, -0.032204817533681186, -0.04477188231028391, 0.02538013951605976, -0.13686843507339932, 0.22706969565967824, 0.3387962339041435, 0.23141755794546556, 0.34494343689746326, -0.4776978607599934, -0.2557854702028286, 0.10243515097277446, 0.115420969022024, 0.06997921663769191, 0.023529038989135637, -0.3116799330037802, 0.09461527160719281, -0.11421304879677152, -0.00696658175391606, -0.11690462458081487, 0.0027495751068033654, -0.015803088338791647, -0.22904230627428854, 0.10532062515399461, -0.02071826872380563, 0.12860054750174207, -0.04252535206497402, -0.02685168633975954, 0.02930615118333148, 0.2540243913894613, 0.0036767708762922803, 0.06003370699578558, 0.21101392908351063, -0.12645010724357997, -0.14252364982949625, 0.3024678477133163, 0.008417281061128684, -0.20084444397702964, 0.22832538213961842, -0.11300784661293481, -0.20030064816643117, 0.023364642174030194, 0.21324016266229628, 0.026038600668085343, -0.2268518299344137, 0.011354759757082458, 0.02044049632086447, 0.20343350027711365, 0.038475706773537274, 0.03694505642187038, 0.16441125914482682, 0.20630719017877122, 0.05138495042590857, 0.16058443479399864, -0.10656373356433699, -0.08415365339764817, -0.2209517521162828, -0.11417451993717502, -0.18470795188367253, 0.01130925928303652, -0.08440570776645362, -0.11540523332760039, 0.42092369792211537, 0.2020740635255634, 0.196376956769999, 0.06713903452842403, 0.2935164710024673, 0.018568921244510383, 0.08720188177451774, 0.06665946585784732, 0.16264085394490246, 0.12348290495433364, 0.12930319473768273, -0.23441853099784843, 0.11870383635407897, -0.022065478000899242] |
1,802.00335 | A note on perturbations of $C_0$-semigroups | This article deals with a variation of constants type inequality for
semigroups acting consistently on a scale of Banach spaces. This inequality can
be characterized by a corresponding (easy to verify) inequality for their
generators. The results have applications to heat kernel estimates and provide
a unified perspective to estimates of these type. Moreover, bi-continuous
semigroups can be treated as well.
| math.FA math.AP | this article deals with a variation of constants type inequality for semigroups acting consistently on a scale of banach spaces this inequality can be characterized by a corresponding easy to verify inequality for their generators the results have applications to heat kernel estimates and provide a unified perspective to estimates of these type moreover bicontinuous semigroups can be treated as well | [['this', 'article', 'deals', 'with', 'a', 'variation', 'of', 'constants', 'type', 'inequality', 'for', 'semigroups', 'acting', 'consistently', 'on', 'a', 'scale', 'of', 'banach', 'spaces', 'this', 'inequality', 'can', 'be', 'characterized', 'by', 'a', 'corresponding', 'easy', 'to', 'verify', 'inequality', 'for', 'their', 'generators', 'the', 'results', 'have', 'applications', 'to', 'heat', 'kernel', 'estimates', 'and', 'provide', 'a', 'unified', 'perspective', 'to', 'estimates', 'of', 'these', 'type', 'moreover', 'bicontinuous', 'semigroups', 'can', 'be', 'treated', 'as', 'well']] | [-0.04231432899756388, 0.09930784675315572, -0.07389044008584174, 0.14269546441901781, -0.11372432447817238, -0.13709146459586918, 0.02995611596699865, 0.3929924699859541, -0.3229546391206687, -0.2646771349379274, 0.20459074023576668, -0.2668061861615689, -0.11250198882867078, 0.29411793216207965, -0.12277234455601113, 0.038156843209852936, 0.04598264050379884, 0.028952334775135195, -0.1277162204840083, -0.20771567876542324, 0.3487810253577887, 0.009133417800557419, 0.21784880720689648, 0.09154540183190561, 0.08686351198245024, -0.04081159838490554, -0.02616880798987189, 0.06513995847466295, -0.18616897137988297, 0.18609628729430622, 0.29016783931216256, 0.06125736094583742, 0.2777268631292171, -0.397781783256863, -0.21429444899874145, 0.1532128841662016, 0.11659586124244284, 0.022354355410646006, -0.047465757033634995, -0.3072690076927548, 0.06608518316853242, -0.1584115706567393, -0.18084709894400638, -0.1633180878354145, -0.03792134153305507, 0.06539757638314708, -0.34618229527392835, 0.10456638984748574, 0.10696064448938324, 0.05425062656524728, -0.09665816341389398, -0.05941869625363682, 0.03930877923553229, 0.09816377881731166, 0.032017484505767704, 0.0034526797148902886, 0.11491067628147172, -0.02615666313890795, -0.15123195191997973, 0.3299973519122014, -0.02984816947432815, -0.2510590925202018, 0.1533774035013296, -0.09630761780302788, -0.13304095338175043, 0.03837537628094681, 0.1736508913826747, 0.12360040116749826, -0.1568597768143308, 0.12167456131485734, -0.06388958374068873, 0.1106899811077069, 0.044600563261230464, 0.0777275771146915, 0.08184870204231778, 0.1026667297252866, 0.1013752631881259, 0.16520670581547942, 0.06408643445045856, -0.055647643682829366, -0.35300815484074294, -0.21199937154096168, -0.190363472510801, 0.10438094651860902, -0.11704529300460889, -0.16769255977123976, 0.342154080872653, 0.06180733449176931, 0.1958223269702714, 0.09548812219109691, 0.16847422193796907, 0.13140133325369327, 0.07431487827256444, 0.03232311596330561, 0.17451469013925458, 0.19118727919584538, 0.10378669780969131, -0.11876299154379817, 0.06932489530442924, 0.1783635911577549] |
1,802.00336 | Weighted polygamy inequalities of multiparty entanglement in arbitrary
dimensional quantum systems | We provide a generalization for the polygamy constraint of multiparty
entanglement in arbitrary dimensional quantum systems. By using the
$\beta$th-power of entanglement of assistance for $0\leq \beta \leq1$ and the
Hamming weight of the binary vector related with the distribution of
subsystems, we establish a class of weighted polygamy inequalities of
multiparty entanglement in arbitrary dimensional quantum systems. We further
show that our class of weighted polygamy inequalities can even be improved to
be tighter inequalities with some conditions on the assisted entanglement of
bipartite subsystems.
| quant-ph | we provide a generalization for the polygamy constraint of multiparty entanglement in arbitrary dimensional quantum systems by using the betathpower of entanglement of assistance for 0leq beta leq1 and the hamming weight of the binary vector related with the distribution of subsystems we establish a class of weighted polygamy inequalities of multiparty entanglement in arbitrary dimensional quantum systems we further show that our class of weighted polygamy inequalities can even be improved to be tighter inequalities with some conditions on the assisted entanglement of bipartite subsystems | [['we', 'provide', 'a', 'generalization', 'for', 'the', 'polygamy', 'constraint', 'of', 'multiparty', 'entanglement', 'in', 'arbitrary', 'dimensional', 'quantum', 'systems', 'by', 'using', 'the', 'betathpower', 'of', 'entanglement', 'of', 'assistance', 'for', '0leq', 'beta', 'leq1', 'and', 'the', 'hamming', 'weight', 'of', 'the', 'binary', 'vector', 'related', 'with', 'the', 'distribution', 'of', 'subsystems', 'we', 'establish', 'a', 'class', 'of', 'weighted', 'polygamy', 'inequalities', 'of', 'multiparty', 'entanglement', 'in', 'arbitrary', 'dimensional', 'quantum', 'systems', 'we', 'further', 'show', 'that', 'our', 'class', 'of', 'weighted', 'polygamy', 'inequalities', 'can', 'even', 'be', 'improved', 'to', 'be', 'tighter', 'inequalities', 'with', 'some', 'conditions', 'on', 'the', 'assisted', 'entanglement', 'of', 'bipartite', 'subsystems']] | [-0.16814057896023288, 0.1633052852278685, -0.06798841687028899, 0.07634133551927173, 0.040052463762763446, -0.2702874367180116, 0.049493008945137265, 0.3046711983707021, -0.25039652870858414, -0.2528056440327097, 0.09250725929844467, -0.26888438700972234, -0.11080634744070908, 0.24804902642088777, -0.07340676650843199, 0.14699548658202677, 0.07545894433004673, 0.056273871066172, -0.12276599546346595, -0.3201873049578246, 0.3956284508656929, -0.016745597072055234, 0.21582083005786817, 0.08980561263640137, 0.059418472297051377, 0.0846855926382191, 0.042545412453439305, 0.05547262835590278, -0.17831150482396718, 0.20514153998126003, 0.2723389462156988, 0.20040938370477626, 0.24727681372314692, -0.3645932891351335, -0.210238612596603, 0.18599282981389587, 0.09208993661929579, 0.10030266330303515, -0.003703553524032673, -0.32438767802874174, 0.020250891499659595, -0.20198004684027504, -0.11384522054234848, -0.0938621553044547, -0.02646304513601696, 0.01619210102978875, -0.3462327154681963, 0.15088332488256342, 0.10321104153990746, 0.07141013179909136, -0.050146331090260954, -0.042020462201360395, 0.03304673149250448, 0.09135063167332727, -0.11249627852264572, -0.026808727165574538, 0.04579819354831296, -0.09419126457154668, -0.19290635171620285, 0.2849767930367414, -0.020076808322440177, -0.23792818354114015, 0.15334514045731767, -0.13006907017244135, -0.2020923521479263, -0.029066866921151385, 0.16859289115733084, 0.13342693768551245, -0.11219420449479538, 0.08176353816970197, -0.07143012829782332, 0.16774832257891403, 0.0525960257057758, 0.20839929660672651, 0.14889921581043916, 0.03924270121051985, 0.1603494224302909, 0.2904454635921866, -0.010656557799152592, -0.13391299712307314, -0.3146633425289217, -0.28488881192444004, -0.24758741150555366, 0.09789218196426244, -0.20299489777791999, -0.09955389276146889, 0.348094364825417, 0.06793418505694718, 0.1232575279835146, 0.130034475209301, 0.18311076365849552, 0.1259951472734375, 0.07007823972688879, 0.07563260527437224, 0.20725349003538107, 0.18500224030028808, 0.026702179973397185, -0.2221651730415247, 0.062379438544089415, 0.11393688748426298] |
1,802.00337 | Biomedical Signals Reconstruction Under the Compressive Sensing Approach | The paper analyses the possibility to recover different biomedical signals if
limited number of samples is available. Having in mind that monitoring of
health condition is done by measuring and observing key parameters such as
heart activity through electrocardiogram or anatomy and body processes through
magnetic resonance imaging, it is important to keep the quality of the
reconstructed signal as better as possible. To recover the signal from limited
set of available coefficients, the Compressive Sensing approach and
optimization algorithms are used. The theory is verified by the experimental
results.
| eess.SP cs.MM | the paper analyses the possibility to recover different biomedical signals if limited number of samples is available having in mind that monitoring of health condition is done by measuring and observing key parameters such as heart activity through electrocardiogram or anatomy and body processes through magnetic resonance imaging it is important to keep the quality of the reconstructed signal as better as possible to recover the signal from limited set of available coefficients the compressive sensing approach and optimization algorithms are used the theory is verified by the experimental results | [['the', 'paper', 'analyses', 'the', 'possibility', 'to', 'recover', 'different', 'biomedical', 'signals', 'if', 'limited', 'number', 'of', 'samples', 'is', 'available', 'having', 'in', 'mind', 'that', 'monitoring', 'of', 'health', 'condition', 'is', 'done', 'by', 'measuring', 'and', 'observing', 'key', 'parameters', 'such', 'as', 'heart', 'activity', 'through', 'electrocardiogram', 'or', 'anatomy', 'and', 'body', 'processes', 'through', 'magnetic', 'resonance', 'imaging', 'it', 'is', 'important', 'to', 'keep', 'the', 'quality', 'of', 'the', 'reconstructed', 'signal', 'as', 'better', 'as', 'possible', 'to', 'recover', 'the', 'signal', 'from', 'limited', 'set', 'of', 'available', 'coefficients', 'the', 'compressive', 'sensing', 'approach', 'and', 'optimization', 'algorithms', 'are', 'used', 'the', 'theory', 'is', 'verified', 'by', 'the', 'experimental', 'results']] | [-0.06098965826547808, 0.08271668260503147, -0.040752297112097345, 0.03510870041532649, -0.08880742447864678, -0.13562505560823612, 0.03116271952684555, 0.36786070364630885, -0.29357518708954256, -0.35920789761261807, 0.18039051896452696, -0.2750834550915493, -0.16589956882978893, 0.23287477339359208, -0.06817997224732406, 0.11520832401131176, 0.09902645944514209, 0.057718377539681065, 0.005359696598801141, -0.20805351725882953, 0.2534558348538768, 0.08809330953905979, 0.3092382248491049, 0.02370398560952809, 0.10001317305076453, 0.05038457569769687, -0.06698881808099233, 0.011583289659271637, -0.08597561074719932, 0.1019556995222552, 0.3258588779717684, 0.21548595513892602, 0.25849849397523533, -0.4417390902009275, -0.24134353740761677, 0.09347664159205225, 0.13161899599751148, 0.07969769924465153, -0.06581194657935864, -0.29261745332429806, 0.12441062532468802, -0.09548430778086185, -0.08428117769718584, -0.0975671279658046, -0.018785316134906478, 0.00019429611533673273, -0.29260219904697604, 0.10640369331878093, -0.012479605774084726, 0.10085185054275725, -0.08184845393730535, -0.10544726960878405, -0.0036913029099297193, 0.21623732180386368, 0.08858622561933266, 0.051974998311036164, 0.19250025770937404, -0.13843914605677127, -0.1058666842782663, 0.3768604592704732, -0.023958461723911265, -0.16824982998271784, 0.20900077147719762, -0.14008876299485565, -0.09333118320856658, 0.12712125508632097, 0.1889041661375409, 0.09391318725473764, -0.18173245193643703, 0.03369549822075189, 0.01689635898090071, 0.17559434117542372, 0.0481211749681582, 0.040348075583784115, 0.1505984602832339, 0.18492968504627547, 0.02233337482644452, 0.13624990897822298, -0.10285126554469268, 0.007850656600850117, -0.24480737945672848, -0.10345585690293875, -0.24277326909618246, 0.0007537902565672994, -0.034804718340779396, -0.09859119981087537, 0.3939981587179419, 0.2080218752535681, 0.17775752653057378, -0.02869352550349302, 0.39772280992733106, 0.05454504812773343, 0.08707502871337865, -0.02055385479082664, 0.23898724182250186, 0.13648711912489186, 0.09636421312267582, -0.18913803004737323, 0.12410882155721387, -0.018012956341004208] |
1,802.00338 | On the rattleback dynamics | In this paper we present some relevant dynamical properties of an idealized
conservative model of the rattleback, from the Poisson dynamics point of view.
In the first half of the article, along with a dynamical study of the orbits,
using a Hamilton-Poisson realization of the dynamical system, we provide a
geometric characterization of the space of orbits in terms of Whitney
stratifications associated to the image of the energy-Casimir mapping. In the
second half of the article we provide an explicit method to stabilize
asymptotically any arbitrary fixed orbit/cycle of the rattleback system and to
keep unchanged the geometry of the model space.
| math.DS math-ph math.MP | in this paper we present some relevant dynamical properties of an idealized conservative model of the rattleback from the poisson dynamics point of view in the first half of the article along with a dynamical study of the orbits using a hamiltonpoisson realization of the dynamical system we provide a geometric characterization of the space of orbits in terms of whitney stratifications associated to the image of the energycasimir mapping in the second half of the article we provide an explicit method to stabilize asymptotically any arbitrary fixed orbitcycle of the rattleback system and to keep unchanged the geometry of the model space | [['in', 'this', 'paper', 'we', 'present', 'some', 'relevant', 'dynamical', 'properties', 'of', 'an', 'idealized', 'conservative', 'model', 'of', 'the', 'rattleback', 'from', 'the', 'poisson', 'dynamics', 'point', 'of', 'view', 'in', 'the', 'first', 'half', 'of', 'the', 'article', 'along', 'with', 'a', 'dynamical', 'study', 'of', 'the', 'orbits', 'using', 'a', 'hamiltonpoisson', 'realization', 'of', 'the', 'dynamical', 'system', 'we', 'provide', 'a', 'geometric', 'characterization', 'of', 'the', 'space', 'of', 'orbits', 'in', 'terms', 'of', 'whitney', 'stratifications', 'associated', 'to', 'the', 'image', 'of', 'the', 'energycasimir', 'mapping', 'in', 'the', 'second', 'half', 'of', 'the', 'article', 'we', 'provide', 'an', 'explicit', 'method', 'to', 'stabilize', 'asymptotically', 'any', 'arbitrary', 'fixed', 'orbitcycle', 'of', 'the', 'rattleback', 'system', 'and', 'to', 'keep', 'unchanged', 'the', 'geometry', 'of', 'the', 'model', 'space']] | [-0.1647335352357842, 0.0578473730257589, -0.11359079809877656, 0.025611652174334535, -0.02433043844568744, -0.041182935140871756, 0.04715648046626216, 0.3020151616804594, -0.2785874361300147, -0.26560449267865394, 0.1200819775854767, -0.2193946905397609, -0.17318155419300585, 0.19100946028643817, -0.07515838496642661, 0.03720564517539506, 0.025892574353800976, 0.06949466405557377, -0.11407907589283936, -0.22999034585732528, 0.3850620117600021, 0.06299982254630794, 0.18685982616472185, -0.02829415991094292, 0.1412133286049699, 0.016158735311097083, -0.024987016850169384, 0.010395572264564643, -0.18420702168334493, 0.16071438712670522, 0.1645134130753029, 0.07746896350884117, 0.2338771337378478, -0.41102962367528795, -0.17543031272076653, 0.10247271970900543, 0.11847899141082284, 0.1362771655743321, -0.032826359228541456, -0.2674425235565971, 0.08554000723376579, -0.16397453771045833, -0.20791807748815594, -0.04605977714755664, -0.01868718175911436, 0.03755001679254586, -0.21717398524211318, 0.02514207827876888, 0.12120713026053957, 0.10192465048977266, -0.12592050719860137, -0.0327173828389313, -0.03540725413454222, 0.15792602284208818, 0.02431199157510099, 0.02511981590970547, 0.0893197744199093, -0.11035534126601894, -0.09120600650488746, 0.41745462951560813, -0.05816265156917164, -0.2206806972184602, 0.16980257583325545, -0.16597422608630916, -0.136803458814564, 0.13781661634999967, 0.18178631086130717, 0.13818457422266697, -0.1463537634688192, 0.1080373333779611, -0.07282524822535467, 0.12012497189725228, 0.02058105241945561, 0.023390631191432476, 0.20492483137686754, 0.1778884571429123, 0.1009268924484358, 0.18354831519536674, -0.06560357663764473, -0.12349544317625902, -0.3581678567855966, -0.192713111209884, -0.1316128863642613, 0.03461264739470447, -0.08695112869549228, -0.2154270661446978, 0.43702076829275954, 0.18292362755164504, 0.23046047094405867, 0.04260573259271754, 0.28030049030249027, 0.1073602606387188, -0.023652692088017277, 0.033115065305073764, 0.21533162685199048, 0.1357978091611728, 0.0620980439844596, -0.20726489652816762, -0.001185611128925766, 0.09381944422299664] |
1,802.00339 | A Simple Adaptive Step-size Choice for Iterative Optimization Methods | We suggest a simple adaptive step-size procedure, which does not require any
line-search, for a general class of nonlinear optimization methods and prove
convergence of a general method under mild assumptions. In particular, the goal
function may be non-smooth and non-convex. Unlike the descent line-search
methods, it does not require monotone decrease of the goal function values
along the iteration points and reduces the implementation cost of each
iteration essentially. The key element of this procedure consists in inserting
a majorant step-size sequence such that the next element is taken only if the
current iterate does not give a sufficient descent. Its applications yield in
particular a new gradient projection method for smooth constrained optimization
problems and a new projection type method for minimization of the gap function
of a general variational inequality. Preliminary results of computational
experiments confirm efficiency of the proposed modification.
| math.OC | we suggest a simple adaptive stepsize procedure which does not require any linesearch for a general class of nonlinear optimization methods and prove convergence of a general method under mild assumptions in particular the goal function may be nonsmooth and nonconvex unlike the descent linesearch methods it does not require monotone decrease of the goal function values along the iteration points and reduces the implementation cost of each iteration essentially the key element of this procedure consists in inserting a majorant stepsize sequence such that the next element is taken only if the current iterate does not give a sufficient descent its applications yield in particular a new gradient projection method for smooth constrained optimization problems and a new projection type method for minimization of the gap function of a general variational inequality preliminary results of computational experiments confirm efficiency of the proposed modification | [['we', 'suggest', 'a', 'simple', 'adaptive', 'stepsize', 'procedure', 'which', 'does', 'not', 'require', 'any', 'linesearch', 'for', 'a', 'general', 'class', 'of', 'nonlinear', 'optimization', 'methods', 'and', 'prove', 'convergence', 'of', 'a', 'general', 'method', 'under', 'mild', 'assumptions', 'in', 'particular', 'the', 'goal', 'function', 'may', 'be', 'nonsmooth', 'and', 'nonconvex', 'unlike', 'the', 'descent', 'linesearch', 'methods', 'it', 'does', 'not', 'require', 'monotone', 'decrease', 'of', 'the', 'goal', 'function', 'values', 'along', 'the', 'iteration', 'points', 'and', 'reduces', 'the', 'implementation', 'cost', 'of', 'each', 'iteration', 'essentially', 'the', 'key', 'element', 'of', 'this', 'procedure', 'consists', 'in', 'inserting', 'a', 'majorant', 'stepsize', 'sequence', 'such', 'that', 'the', 'next', 'element', 'is', 'taken', 'only', 'if', 'the', 'current', 'iterate', 'does', 'not', 'give', 'a', 'sufficient', 'descent', 'its', 'applications', 'yield', 'in', 'particular', 'a', 'new', 'gradient', 'projection', 'method', 'for', 'smooth', 'constrained', 'optimization', 'problems', 'and', 'a', 'new', 'projection', 'type', 'method', 'for', 'minimization', 'of', 'the', 'gap', 'function', 'of', 'a', 'general', 'variational', 'inequality', 'preliminary', 'results', 'of', 'computational', 'experiments', 'confirm', 'efficiency', 'of', 'the', 'proposed', 'modification']] | [-0.08254205423226166, -0.022015941693906724, -0.11640594806198755, 0.04823358064135795, -0.1129727503511175, -0.19877333921936546, 0.06516759904479841, 0.3918682762887329, -0.3121672376421177, -0.25522306230333114, 0.1275654658699447, -0.17783179154826534, -0.15895467649938333, 0.2158731994891746, -0.14337056052883984, 0.09767070316886223, 0.1437173298262577, 0.0037854075231330674, -0.15087024996116977, -0.2807481362841726, 0.28075513268979396, 0.014730059079334347, 0.2710758360157747, 0.04806923019795148, 0.15788974626533067, 0.01859938912740391, 0.00055689581656932, 0.04525735544545265, -0.09195501891074148, 0.10515690989591854, 0.22227666516038072, 0.18638822933846516, 0.399077855839601, -0.39082791847694254, -0.18593892377814175, 0.16084154477155405, 0.14834820953385336, 0.1007190694500524, -0.09621682602866916, -0.1789262657370677, 0.0904796793195904, -0.09960370583495307, -0.1349443505524606, -0.1033436767191031, -0.07553509398066025, 0.0786716201950589, -0.37339898254463655, 0.054969188564832114, 0.09245569359983266, 0.023340434663825564, -0.060355187265183, -0.15428387687117923, 0.04205353392737581, 0.038881910363367446, 0.038010975357287355, 0.07881337309178586, 0.1388121781185166, -0.0752738595975744, -0.09112742784216404, 0.34562327740584603, -0.048130349270650186, -0.26667643850669265, 0.14097317823648658, -0.058993779038751706, -0.18900662770708246, 0.15105326595302257, 0.15526617347212676, 0.2201624504264651, -0.11441302908092944, 0.1101197172328183, -0.03364563585718214, 0.16221537151270443, 0.00247322725772392, -0.031909831586542876, 0.08130564176179986, 0.14706384271590245, 0.23025060326714689, 0.09501076302209792, -0.04531841186770988, -0.09904223236824489, -0.37726201248976093, -0.17578948161745858, -0.21301978115742612, -0.0009516095885070778, -0.12676865439627566, -0.1792301077253392, 0.3938778231644796, 0.11909307789836829, 0.16938873067394727, 0.1126699724967087, 0.3086767182814785, 0.1440177014361931, 0.09626535025179489, 0.09218015524675138, 0.2140456615985992, 0.09832256562690923, 0.09678213429449695, -0.24701992075359966, 0.0997378624322462, 0.15747140532605247] |
1,802.0034 | A blind search for a common signal in gravitational wave detectors | We propose a blind, template-free method for the extraction of a common
signal between the Hanford and Livingston detectors and apply it especially to
the GW150914 event. We construct a log-likelihood method that maximizes the
cross-correlation between each detector and the common signal and minimizes the
cross-correlation between the residuals. The reliability of this method is
tested using simulations with an injected common signal. Finally, our method is
used to assess the quality of theoretical gravitational wave templates for
GW150914.
| astro-ph.IM | we propose a blind templatefree method for the extraction of a common signal between the hanford and livingston detectors and apply it especially to the gw150914 event we construct a loglikelihood method that maximizes the crosscorrelation between each detector and the common signal and minimizes the crosscorrelation between the residuals the reliability of this method is tested using simulations with an injected common signal finally our method is used to assess the quality of theoretical gravitational wave templates for gw150914 | [['we', 'propose', 'a', 'blind', 'templatefree', 'method', 'for', 'the', 'extraction', 'of', 'a', 'common', 'signal', 'between', 'the', 'hanford', 'and', 'livingston', 'detectors', 'and', 'apply', 'it', 'especially', 'to', 'the', 'gw150914', 'event', 'we', 'construct', 'a', 'loglikelihood', 'method', 'that', 'maximizes', 'the', 'crosscorrelation', 'between', 'each', 'detector', 'and', 'the', 'common', 'signal', 'and', 'minimizes', 'the', 'crosscorrelation', 'between', 'the', 'residuals', 'the', 'reliability', 'of', 'this', 'method', 'is', 'tested', 'using', 'simulations', 'with', 'an', 'injected', 'common', 'signal', 'finally', 'our', 'method', 'is', 'used', 'to', 'assess', 'the', 'quality', 'of', 'theoretical', 'gravitational', 'wave', 'templates', 'for', 'gw150914']] | [-0.08694284372177208, -0.014546417583005677, -0.10882444456219673, 0.11267264802736462, -0.06747218673408498, -0.08467911580228246, 0.033240014303009956, 0.3830186131410301, -0.21365183205343782, -0.31299913600669244, 0.06655288800830021, -0.33996671295026315, -0.19005477194441484, 0.2274414591753157, 0.00025539396738167853, 0.09704267336055636, 0.08996161945397034, 0.005389801593264565, -0.10691418783681002, -0.21085236595536117, 0.2694997391896322, 0.1347152112517506, 0.30551534965634347, -0.008897508663358167, 0.15897131451929453, 0.035714918305166064, -0.08281001029536128, -0.03846406361844856, -0.0929114035888233, 0.10121722787152976, 0.2638642010366311, 0.2475855772732757, 0.24810881119919942, -0.35235973342787474, -0.17503214575117454, 0.1325349237944465, 0.06934553317259998, 0.10017624095598876, -0.07153085828758776, -0.3315789388027042, 0.10023733823327348, -0.17438133619725704, -0.03282136874659045, -0.00039374633925035594, -0.023087389871943743, 0.05967630830127746, -0.30724014570005237, 0.10007814824348316, -0.0210345714178402, -0.04342283071018756, -0.027310507031506857, -0.06986659570538904, 0.009233985203900374, 0.12525498305476504, 0.041726545855635774, 0.08528976545785553, 0.09726820473297267, -0.05189879568351898, -0.11598641636082903, 0.34756740868324415, -0.10564447712749825, -0.2071881306357682, 0.17228807997889817, -0.10616611960576847, -0.10854625108186156, 0.11865727051626891, 0.2066266730427742, 0.09303978732787073, -0.1750700389209669, -0.032204856717726216, 0.046057735674730794, 0.24425758470315487, 0.07787642577895895, -0.01660214285366237, 0.2526958811446093, 0.2025841456721537, 0.047225400875322524, 0.1753786322355154, -0.25887107953312805, 0.029213787322805728, -0.29450941775430695, -0.1338289792998694, -0.2187707268865779, -0.0470186471235138, -0.10475102520940709, -0.1525801292504184, 0.4225834815297276, 0.253112843807321, 0.1427123713947367, 0.07714653065777384, 0.38289175131358205, 0.10416476367681753, 0.03530677935341373, 0.03177681037923321, 0.30641572615131735, 0.10075356281595305, 0.062104011070914567, -0.21792717514326795, 0.06734572774730622, 0.029015600634738802] |
1,802.00341 | A note on the strong convergence of partial sums with respect to
Vilenkin system | In this paper we investigate some strong convergence theorems for partial
sums with respect to Vilenkin system.
| math.CA math.FA | in this paper we investigate some strong convergence theorems for partial sums with respect to vilenkin system | [['in', 'this', 'paper', 'we', 'investigate', 'some', 'strong', 'convergence', 'theorems', 'for', 'partial', 'sums', 'with', 'respect', 'to', 'vilenkin', 'system']] | [-0.16654600230429104, -0.015050260459675509, -0.05963142040897818, 0.08082623622955426, -0.03481172945569543, -0.060535980881575274, 0.03597786305609214, 0.35640298838124557, -0.2967377401450101, -0.15709017501007216, 0.15410198177457513, -0.3145883914959781, -0.14284828414811807, 0.18838809386772268, -0.1841493112528149, 0.0988005999037448, 0.04272971450186828, 0.021364268285277134, -0.14659498522386832, -0.2891529601697317, 0.38757170868270535, -0.007470465319998124, 0.18551929360803435, 0.08838612893048454, 0.061930297545212155, 0.008322273613885045, -0.06533389127648928, 0.028127536725472, -0.23412225253003485, 0.12186519949532607, 0.20941202802693143, 0.05134989901938859, 0.36081917408634634, -0.3927670417024809, -0.09979648712803335, 0.1778831836384009, 0.14166320318027453, 0.08756962144637809, -0.01841732333688175, -0.30437235183575573, 0.17696348205208778, -0.17604222258224206, -0.1932927416089703, -0.15351859069264986, -0.03956831038436469, 0.1404099148862502, -0.26531627686584697, 0.052616841817165125, 0.14819292483084343, 0.08345831844353062, -0.05941243946333142, -0.052974261966643524, 0.14213404127889695, 0.02658157343702281, 0.16169774997979403, 0.039869076188872844, -0.0519605455098345, -0.06665691797731116, -0.11443252751932424, 0.3337902001598302, -0.11378602740382228, -0.23146001578253858, 0.19521458600373828, -0.20726600990575902, -0.2866063882761142, 0.05861050449311733, 0.21691464512225458, 0.14361174777150154, -0.15025272340897253, 0.107090527903946, -0.08753802123315194, 0.09383757456260569, 0.147675912717686, 0.1508620946722872, 0.08152001307291143, 0.05898315043133848, 0.14337139439714305, 0.2146551490158719, 0.07979404104544836, -0.10218754210783278, -0.32268019195865183, -0.19923337828367949, -0.055883445941350036, 0.06950538802672834, -0.09484787813476835, -0.19239257013096528, 0.33990210719297037, 0.20300403045599952, 0.14729784253765554, 0.17277275732554057, 0.22542534631622188, 0.18423592529314406, -0.10469708241084043, 0.006480935276212061, 0.1697696151352241, 0.28428306310054136, 0.10555239032734842, -0.18104492105981884, 0.03193818284746479, 0.168914771748378] |
1,802.00342 | Adaptive wireless power transfer in mobile Ad Hoc networks | We investigate the interesting impact of mobility on the problem of efficient
wireless power transfer in ad hoc networks. We consider a set of mobile agents
(consuming energy to perform certain sensing and communication tasks), and a
single static charger (with finite energy) which can recharge the agents when
they get in its range. In particular, we focus on the problem of efficiently
computing the appropriate range of the charger with the goal of prolonging the
network lifetime. We first demonstrate (under the realistic assumption of fixed
energy supplies) the limitations of any fixed charging range and, therefore,
the need for (and power of) a dynamic selection of the charging range, by
adapting to the behavior of the mobile agents which is revealed in an online
manner. We investigate the complexity of optimizing the selection of such an
adaptive charging range, by showing that two simplified offline optimization
problems (closely related to the online one) are NP-hard. To effectively
address the involved performance trade-offs, we finally present a variety of
adaptive heuristics, assuming different levels of agent information regarding
their mobility and energy.
| cs.NI cs.MA | we investigate the interesting impact of mobility on the problem of efficient wireless power transfer in ad hoc networks we consider a set of mobile agents consuming energy to perform certain sensing and communication tasks and a single static charger with finite energy which can recharge the agents when they get in its range in particular we focus on the problem of efficiently computing the appropriate range of the charger with the goal of prolonging the network lifetime we first demonstrate under the realistic assumption of fixed energy supplies the limitations of any fixed charging range and therefore the need for and power of a dynamic selection of the charging range by adapting to the behavior of the mobile agents which is revealed in an online manner we investigate the complexity of optimizing the selection of such an adaptive charging range by showing that two simplified offline optimization problems closely related to the online one are nphard to effectively address the involved performance tradeoffs we finally present a variety of adaptive heuristics assuming different levels of agent information regarding their mobility and energy | [['we', 'investigate', 'the', 'interesting', 'impact', 'of', 'mobility', 'on', 'the', 'problem', 'of', 'efficient', 'wireless', 'power', 'transfer', 'in', 'ad', 'hoc', 'networks', 'we', 'consider', 'a', 'set', 'of', 'mobile', 'agents', 'consuming', 'energy', 'to', 'perform', 'certain', 'sensing', 'and', 'communication', 'tasks', 'and', 'a', 'single', 'static', 'charger', 'with', 'finite', 'energy', 'which', 'can', 'recharge', 'the', 'agents', 'when', 'they', 'get', 'in', 'its', 'range', 'in', 'particular', 'we', 'focus', 'on', 'the', 'problem', 'of', 'efficiently', 'computing', 'the', 'appropriate', 'range', 'of', 'the', 'charger', 'with', 'the', 'goal', 'of', 'prolonging', 'the', 'network', 'lifetime', 'we', 'first', 'demonstrate', 'under', 'the', 'realistic', 'assumption', 'of', 'fixed', 'energy', 'supplies', 'the', 'limitations', 'of', 'any', 'fixed', 'charging', 'range', 'and', 'therefore', 'the', 'need', 'for', 'and', 'power', 'of', 'a', 'dynamic', 'selection', 'of', 'the', 'charging', 'range', 'by', 'adapting', 'to', 'the', 'behavior', 'of', 'the', 'mobile', 'agents', 'which', 'is', 'revealed', 'in', 'an', 'online', 'manner', 'we', 'investigate', 'the', 'complexity', 'of', 'optimizing', 'the', 'selection', 'of', 'such', 'an', 'adaptive', 'charging', 'range', 'by', 'showing', 'that', 'two', 'simplified', 'offline', 'optimization', 'problems', 'closely', 'related', 'to', 'the', 'online', 'one', 'are', 'nphard', 'to', 'effectively', 'address', 'the', 'involved', 'performance', 'tradeoffs', 'we', 'finally', 'present', 'a', 'variety', 'of', 'adaptive', 'heuristics', 'assuming', 'different', 'levels', 'of', 'agent', 'information', 'regarding', 'their', 'mobility', 'and', 'energy']] | [-0.167614716334813, 0.053510397382728156, -0.019552027512023028, 0.04079686658764818, -0.06509636378913222, -0.1452382080577558, 0.10259499695645696, 0.4176352969901967, -0.29740680107857037, -0.3662728634128561, 0.10071899396331747, -0.2160467255677356, -0.13989984922752272, 0.1658945532332434, -0.10404791760441588, 0.06966826435187425, 0.05365524355759793, 0.05507009532404402, -0.01769030332511871, -0.24610088402379934, 0.3370805781161606, 0.09110848984268845, 0.30769289247411724, 0.0907127994549705, 0.09718408798188215, 0.05553470602350646, -0.008568667344363467, 0.027957724979213474, -0.12191082076494782, 0.1544961892259231, 0.2840038112827826, 0.14160471124309904, 0.34843904285340527, -0.450673168687954, -0.23522161601284325, 0.13898459520078674, 0.1282906399605938, 0.07321354038402682, -0.04110366263798351, -0.23528808134205925, 0.11225981685165011, -0.2010287351456542, -0.057821618120791646, -0.0468463680778167, -0.025236675374227694, 0.06705954528663083, -0.3046249202427154, -0.01068684436849069, -0.007267936463645899, 0.031123774763593664, -0.0901436764076403, -0.08181720794066583, 0.046832012725088114, 0.18599738664826496, 0.03889442560065136, -0.06938774431126875, 0.1602757434676213, -0.1535539352385928, -0.12136375434477839, 0.4011586026945075, 0.01144099721012006, -0.19008508406050217, 0.18807710224668409, -0.043406488885339656, -0.11492668678780478, 0.10395992546828331, 0.21474571684833432, 0.13312727629838134, -0.16078420072487654, 0.056607816371840265, 0.0004985227371703406, 0.14883218289485273, 0.031429913187592896, 0.052909357134822775, 0.16297138674958236, 0.22265271923652358, 0.13591312923687485, 0.1383758892440059, -0.06510470691009786, -0.11110953937152329, -0.22616747773603582, -0.11571364047112645, -0.19749042042658302, 0.05036291825366232, -0.10598120003227142, -0.11433900308495011, 0.40897563305464596, 0.1859452613690471, 0.18661003057842393, 0.06956846718014793, 0.3286586722226742, 0.11040253405367938, 0.02322598852731206, 0.11209688430570595, 0.200108890905162, 0.0011441535011056016, 0.15174770214253924, -0.2584469760055628, 0.0671817475975659, -0.024388803292544243] |
1,802.00343 | Gravitational Starlight Deflection Measurements during the 21 August
2017 Total Solar Eclipse | Precise starlight positions near the sun were measured during the 21 August
2017 total solar eclipse in order to measure their gravitational deflections.
The equipment, procedures, and analysis are described in detail. A portable
refractor, a CCD camera, and a computerized mount were set up in Wyoming.
Detailed calibrations were necessary to improve accuracy and precision.
Nighttime measurements taken just before the eclipse provided cubic optical
distortion corrections. Calibrations based on star field images 7.4 deg on both
sides of the sun taken during totality gave linear and quadratic plate
constants. A total of 45 images of the sky surrounding the Sun were acquired
during the middle part of totality, with an integrated exposure of 22 seconds.
The deflection analysis depended on accurate star positions from the USNO's
UCAC5 star catalog. The final result was a deflection coefficient L = 1.752
arcsec, compared to the theoretical value of L = 1.751 arcsec, with an
uncertainty of only 3%.
| astro-ph.IM gr-qc | precise starlight positions near the sun were measured during the 21 august 2017 total solar eclipse in order to measure their gravitational deflections the equipment procedures and analysis are described in detail a portable refractor a ccd camera and a computerized mount were set up in wyoming detailed calibrations were necessary to improve accuracy and precision nighttime measurements taken just before the eclipse provided cubic optical distortion corrections calibrations based on star field images 74 deg on both sides of the sun taken during totality gave linear and quadratic plate constants a total of 45 images of the sky surrounding the sun were acquired during the middle part of totality with an integrated exposure of 22 seconds the deflection analysis depended on accurate star positions from the usnos ucac5 star catalog the final result was a deflection coefficient l 1752 arcsec compared to the theoretical value of l 1751 arcsec with an uncertainty of only 3 | [['precise', 'starlight', 'positions', 'near', 'the', 'sun', 'were', 'measured', 'during', 'the', '21', 'august', '2017', 'total', 'solar', 'eclipse', 'in', 'order', 'to', 'measure', 'their', 'gravitational', 'deflections', 'the', 'equipment', 'procedures', 'and', 'analysis', 'are', 'described', 'in', 'detail', 'a', 'portable', 'refractor', 'a', 'ccd', 'camera', 'and', 'a', 'computerized', 'mount', 'were', 'set', 'up', 'in', 'wyoming', 'detailed', 'calibrations', 'were', 'necessary', 'to', 'improve', 'accuracy', 'and', 'precision', 'nighttime', 'measurements', 'taken', 'just', 'before', 'the', 'eclipse', 'provided', 'cubic', 'optical', 'distortion', 'corrections', 'calibrations', 'based', 'on', 'star', 'field', 'images', '74', 'deg', 'on', 'both', 'sides', 'of', 'the', 'sun', 'taken', 'during', 'totality', 'gave', 'linear', 'and', 'quadratic', 'plate', 'constants', 'a', 'total', 'of', '45', 'images', 'of', 'the', 'sky', 'surrounding', 'the', 'sun', 'were', 'acquired', 'during', 'the', 'middle', 'part', 'of', 'totality', 'with', 'an', 'integrated', 'exposure', 'of', '22', 'seconds', 'the', 'deflection', 'analysis', 'depended', 'on', 'accurate', 'star', 'positions', 'from', 'the', 'usnos', 'ucac5', 'star', 'catalog', 'the', 'final', 'result', 'was', 'a', 'deflection', 'coefficient', 'l', '1752', 'arcsec', 'compared', 'to', 'the', 'theoretical', 'value', 'of', 'l', '1751', 'arcsec', 'with', 'an', 'uncertainty', 'of', 'only', '3']] | [-0.06674391102466372, 0.07909692547963781, -0.06083177701155129, 0.03435214208739419, -0.08600177147215413, -0.07778459506695189, 0.04937861456438118, 0.4030714612454176, -0.15386478259498554, -0.43229593985503717, 0.14072426306158906, -0.33646573883391195, -0.02000916237161765, 0.21089078444281534, -0.11146574068454004, 0.030792895168997348, 0.11944498751432665, 0.010515190408595146, -0.07606110715217167, -0.30083067188820534, 0.15687716545747413, 0.12706200989984698, 0.20591797628289749, -0.0154445038086945, 0.09905249865410189, 0.02688137407624914, -0.1304095927505724, -0.02386971084521182, -0.1320673273215371, 0.04920680011592565, 0.17992318456883602, 0.09229105354076432, 0.1758422520672602, -0.3967583588054103, -0.13584766478968724, 5.300953804004577e-05, 0.06951478447825198, 0.008513442879062026, 0.013891378235853007, -0.33240080449670073, 0.015384516242756358, -0.12249273920521861, -0.13135368386583943, 0.06599613182967709, 0.0733733745945257, -0.0016003418864021378, -0.24739894167550147, 0.06388127900539867, -0.017278391645560342, 0.18345681028590807, -0.11902231747404703, -0.14103491726000944, -0.047196273969846866, 0.1587241968951158, -0.0191548430691323, 0.09949934281513936, 0.17776373028454762, -0.07671803937804314, -0.03554982831551423, 0.3739595469808386, -0.06461494819602868, -0.03084184824218673, 0.11297493129292684, -0.20759260684492126, -0.10189101822043378, 0.21745316894694922, 0.18151768777038782, 0.10788932206454657, -0.18691255960974001, 0.01948747750706858, 0.025689107386936104, 0.23318515099104373, 0.1312097577348111, -0.005089345727596552, 0.2488676800843208, 0.09476436307548636, 0.0207012680960038, 0.08643326810636227, -0.2604748078216348, -0.00677112951694477, -0.28458354254102997, -0.07807659021824703, -0.11003623212417288, 0.05219938093871479, -0.09459977242457229, -0.07979637165628975, 0.35887764047590953, 0.10842739747416588, 0.16724835468396063, 0.01004676699878708, 0.3097896996434898, 0.04662718234457932, 0.07503837133051768, 0.041901268251240256, 0.34881671449289686, 0.1554231070177329, 0.17143633684383766, -0.18103848930237995, 0.022015841365341217, 0.05741601231237573] |
1,802.00344 | On the geodesics of homogeneous Finsler spaces with some special
$(\alpha, \beta)$-metrics | In this paper, we study geodesics and geodesic vectors for homogeneous
exponential Finsler space and homogeneous infinite series Finsler space.
Further, we find necessary and sufficient condition for a non-zero vector in
these homogeneous spaces to be a geodesic vector.
| math.DG | in this paper we study geodesics and geodesic vectors for homogeneous exponential finsler space and homogeneous infinite series finsler space further we find necessary and sufficient condition for a nonzero vector in these homogeneous spaces to be a geodesic vector | [['in', 'this', 'paper', 'we', 'study', 'geodesics', 'and', 'geodesic', 'vectors', 'for', 'homogeneous', 'exponential', 'finsler', 'space', 'and', 'homogeneous', 'infinite', 'series', 'finsler', 'space', 'further', 'we', 'find', 'necessary', 'and', 'sufficient', 'condition', 'for', 'a', 'nonzero', 'vector', 'in', 'these', 'homogeneous', 'spaces', 'to', 'be', 'a', 'geodesic', 'vector']] | [-0.19568097535520793, 0.17817181055434048, -0.05951062222011387, 0.14425843116187026, -0.1919722031801939, -0.10099958231585333, -0.017527889637858608, 0.43047414822503927, -0.30048444448038936, -0.1325339955277741, 0.11368581600836478, -0.21347393961623312, -0.194037422304973, 0.14962941382545977, -0.04836033913306892, 0.09155073799192906, 0.08670157315209508, 0.09244693485088647, -0.14275435123126953, -0.31371140070259573, 0.4691608770051971, -0.007796778040938079, 0.2566917444579303, 0.00478013907559216, 0.17985641558188944, 0.008000431954860688, -0.032725677633425224, 0.09483234083600109, -0.26035429812036454, 0.10308167564217001, 0.2474115584976971, 0.11943967856932432, 0.22658306984230875, -0.38841856736689806, -0.21023529071826488, 0.2695590574643575, 0.16475427746772767, 0.019930502818897366, -0.007037328905425966, -0.2842848599422723, 0.11293421832378954, -0.06216057608835399, -0.1821896977722645, -0.14545448906719685, 0.06640613037161529, 0.005713945435127243, -0.27349103924352675, 0.032830208213999866, 0.1404877700842917, 0.10883922661887482, -0.20603177237790077, 0.008830713434144854, 0.03270229612244293, 0.012548248516395688, 0.01354298354126513, 0.0828593282669317, -0.007823011209256946, 0.02127977931522764, -0.03970142649486661, 0.36234315829351543, -0.14522771686315536, -0.392771917488426, 0.08716095334384591, -0.1787017101421952, -0.14096560794860125, 0.06597398690646514, 0.2460184727795422, 0.14777510811109096, -0.12951731921639292, 0.1441640060118516, -0.06806555730290711, -0.006507996399886906, 0.11927419253624975, 0.00046877849381417037, 0.1534018201753497, 0.04657060864847153, 0.16197902977000922, 0.1520441519882297, 0.0053090378642082214, -0.06899079764698399, -0.4259404994547367, -0.3211654733866453, -0.12760369358584284, 0.10836654613958671, -0.1787074952142575, -0.23081465009599925, 0.33926748738158496, 0.006774313165806234, 0.19545528525486588, 0.08762665372341871, 0.2114744970574975, 0.03233668191096513, -0.04627145560225472, 0.15539422335332348, 0.17141677108593284, 0.16758470507338644, 0.07638802869478241, -0.07720693182200193, -0.05251533458940685, 0.12949346246896312] |
1,802.00345 | The Energy Deposition on the ILC Realistic Undulator Wall | Since the undulator wall is being bombarded by photon produced in the ILC
helical undulator, masks were installed inside the undulator to protect the
superconducting undulator as well as the vacuum. The photon energy spectrum was
used to calculate the incident power. HUSR software was used to simulate the
photon energy spectrum per meter inside the undulator. The influence of adding
masks inside the undulator on the photon polarisation and energy spectrum was
also studied.
| physics.acc-ph | since the undulator wall is being bombarded by photon produced in the ilc helical undulator masks were installed inside the undulator to protect the superconducting undulator as well as the vacuum the photon energy spectrum was used to calculate the incident power husr software was used to simulate the photon energy spectrum per meter inside the undulator the influence of adding masks inside the undulator on the photon polarisation and energy spectrum was also studied | [['since', 'the', 'undulator', 'wall', 'is', 'being', 'bombarded', 'by', 'photon', 'produced', 'in', 'the', 'ilc', 'helical', 'undulator', 'masks', 'were', 'installed', 'inside', 'the', 'undulator', 'to', 'protect', 'the', 'superconducting', 'undulator', 'as', 'well', 'as', 'the', 'vacuum', 'the', 'photon', 'energy', 'spectrum', 'was', 'used', 'to', 'calculate', 'the', 'incident', 'power', 'husr', 'software', 'was', 'used', 'to', 'simulate', 'the', 'photon', 'energy', 'spectrum', 'per', 'meter', 'inside', 'the', 'undulator', 'the', 'influence', 'of', 'adding', 'masks', 'inside', 'the', 'undulator', 'on', 'the', 'photon', 'polarisation', 'and', 'energy', 'spectrum', 'was', 'also', 'studied']] | [-0.09511306450224004, 0.23161309547218922, -0.08237511603589598, 0.06665175222961635, -0.02494417305884732, -0.15746361823324617, -0.04166518495971891, 0.4298571436854734, -0.20272550752034058, -0.37162091361509786, 0.03248072944650728, -0.3173085511095721, 0.11732765605887147, 0.2537082500906812, 0.0048722368790893944, 0.08443499788188853, 0.006073953785203598, 0.006105322831285161, 0.05389127370624526, -0.15479956310544465, 0.24879001346542626, 0.24844017095008009, 0.3392899740688704, 0.07578436889987741, 0.1211433234951786, 0.04817883133875659, 0.019909672759240493, -0.08547209138428238, -0.048839158277857946, 0.009890157270018716, 0.22499115793411997, -0.0022264422811064367, 0.15402695224494548, -0.43193298429754134, -0.18956748276596536, 0.0902613165687669, 0.09812381916452904, 0.0610773947618499, -0.001474732654232129, -0.24613207238852172, 0.051800370694616356, -0.21804579440504313, -0.17370200320146978, 0.04626550394538287, -0.07440125692723873, 0.06352987346818319, -0.1906346838411598, -0.07318855361183917, -0.04076187729259726, -0.019192489291969185, -0.031360449785416994, -0.04035808830647855, -0.09518398566649773, 0.059391797123778914, 0.05195292957265534, 0.056327881458265755, 0.22985602980731307, -0.11293997279544538, -0.10560850386281272, 0.37212404628863205, -0.012308561595509181, -0.08953593028205875, -0.00145799812634249, -0.18345453229581787, 0.04877954274038407, 0.22349492373020463, 0.1857297212338528, 0.07217870500391803, -0.09330017424213725, 0.02565978148974151, 0.024890918876170308, 0.24080453184118644, 0.21724244588482622, 0.015964701658467185, 0.22988498923242898, 0.1583662853400047, -0.0023506905229107753, 0.28820617793983705, -0.22994829808374415, 0.02543086403779484, -0.3334149975908568, -0.10217404171723772, -0.23998830093045695, 0.04204130716263191, 0.02923352881102678, -0.14137661475939928, 0.48754710183050987, 0.074493461867442, 0.07752148074576178, -0.10048513786514869, 0.4069001147573864, 0.09928492515511508, 0.1588391620521056, 0.03766854119336081, 0.35675539584780064, 0.14976063463836908, 0.18528325843775795, -0.2160733924058543, 0.015279806023967024, 0.014048127630549306] |
1,802.00346 | Stability and $L_1/\ell_1$-to-$L_1/\ell_1$ performance analysis of
uncertain impulsive linear positive systems with applications to the interval
observation of impulsive and switched systems with constant delays | Solutions to the interval observation problem for delayed impulsive and
switched systems with $L_1$-performance are provided. The approach is based on
first obtaining stability and $L_1/\ell_1$-to-$L_1/\ell_1$ performance analysis
conditions for uncertain linear positive impulsive systems in linear fractional
form with norm-bounded uncertainties using a scaled small-gain argument
involving time-varying $D$-scalings. Both range and minimum dwell-time
conditions are formulated -- the case of constant and maximum dwell-times can
be directly obtained as corollaries. The conditions are stated as
timer/clock-dependent conditions taking the form of infinite-dimensional linear
programs that can be relaxed into finite-dimensional ones using polynomial
optimization techniques. It is notably shown that under certain conditions, the
scalings can be eliminated from the stability conditions to yield equivalent
stability conditions on the so-called "worst-case system", which is obtained by
replacing the uncertainties by the identity matrix. These conditions are then
applied to the special case of linear positive systems with delays, where the
delays are considered as uncertainties. As before, under certain conditions,
the scalings can be eliminated from the conditions to obtain conditions on the
worst-case system, coinciding here with the zero-delay system -- a result that
is consistent with all the existing ones in the literature on linear positive
systems with delays. Finally, the case of switched systems with delays is
considered. The approach also encompasses standard continuous-time and
discrete-time systems, possibly with delays and the results are flexible enough
to be extended to cope with multiple delays, time-varying delays,
distributed/neutral delays and any other types of uncertain systems that can be
represented as a feedback interconnection of a known system with an
uncertainty.
| math.OC cs.SY | solutions to the interval observation problem for delayed impulsive and switched systems with l_1performance are provided the approach is based on first obtaining stability and l_1ell_1tol_1ell_1 performance analysis conditions for uncertain linear positive impulsive systems in linear fractional form with normbounded uncertainties using a scaled smallgain argument involving timevarying dscalings both range and minimum dwelltime conditions are formulated the case of constant and maximum dwelltimes can be directly obtained as corollaries the conditions are stated as timerclockdependent conditions taking the form of infinitedimensional linear programs that can be relaxed into finitedimensional ones using polynomial optimization techniques it is notably shown that under certain conditions the scalings can be eliminated from the stability conditions to yield equivalent stability conditions on the socalled worstcase system which is obtained by replacing the uncertainties by the identity matrix these conditions are then applied to the special case of linear positive systems with delays where the delays are considered as uncertainties as before under certain conditions the scalings can be eliminated from the conditions to obtain conditions on the worstcase system coinciding here with the zerodelay system a result that is consistent with all the existing ones in the literature on linear positive systems with delays finally the case of switched systems with delays is considered the approach also encompasses standard continuoustime and discretetime systems possibly with delays and the results are flexible enough to be extended to cope with multiple delays timevarying delays distributedneutral delays and any other types of uncertain systems that can be represented as a feedback interconnection of a known system with an uncertainty | [['solutions', 'to', 'the', 'interval', 'observation', 'problem', 'for', 'delayed', 'impulsive', 'and', 'switched', 'systems', 'with', 'l_1performance', 'are', 'provided', 'the', 'approach', 'is', 'based', 'on', 'first', 'obtaining', 'stability', 'and', 'l_1ell_1tol_1ell_1', 'performance', 'analysis', 'conditions', 'for', 'uncertain', 'linear', 'positive', 'impulsive', 'systems', 'in', 'linear', 'fractional', 'form', 'with', 'normbounded', 'uncertainties', 'using', 'a', 'scaled', 'smallgain', 'argument', 'involving', 'timevarying', 'dscalings', 'both', 'range', 'and', 'minimum', 'dwelltime', 'conditions', 'are', 'formulated', 'the', 'case', 'of', 'constant', 'and', 'maximum', 'dwelltimes', 'can', 'be', 'directly', 'obtained', 'as', 'corollaries', 'the', 'conditions', 'are', 'stated', 'as', 'timerclockdependent', 'conditions', 'taking', 'the', 'form', 'of', 'infinitedimensional', 'linear', 'programs', 'that', 'can', 'be', 'relaxed', 'into', 'finitedimensional', 'ones', 'using', 'polynomial', 'optimization', 'techniques', 'it', 'is', 'notably', 'shown', 'that', 'under', 'certain', 'conditions', 'the', 'scalings', 'can', 'be', 'eliminated', 'from', 'the', 'stability', 'conditions', 'to', 'yield', 'equivalent', 'stability', 'conditions', 'on', 'the', 'socalled', 'worstcase', 'system', 'which', 'is', 'obtained', 'by', 'replacing', 'the', 'uncertainties', 'by', 'the', 'identity', 'matrix', 'these', 'conditions', 'are', 'then', 'applied', 'to', 'the', 'special', 'case', 'of', 'linear', 'positive', 'systems', 'with', 'delays', 'where', 'the', 'delays', 'are', 'considered', 'as', 'uncertainties', 'as', 'before', 'under', 'certain', 'conditions', 'the', 'scalings', 'can', 'be', 'eliminated', 'from', 'the', 'conditions', 'to', 'obtain', 'conditions', 'on', 'the', 'worstcase', 'system', 'coinciding', 'here', 'with', 'the', 'zerodelay', 'system', 'a', 'result', 'that', 'is', 'consistent', 'with', 'all', 'the', 'existing', 'ones', 'in', 'the', 'literature', 'on', 'linear', 'positive', 'systems', 'with', 'delays', 'finally', 'the', 'case', 'of', 'switched', 'systems', 'with', 'delays', 'is', 'considered', 'the', 'approach', 'also', 'encompasses', 'standard', 'continuoustime', 'and', 'discretetime', 'systems', 'possibly', 'with', 'delays', 'and', 'the', 'results', 'are', 'flexible', 'enough', 'to', 'be', 'extended', 'to', 'cope', 'with', 'multiple', 'delays', 'timevarying', 'delays', 'distributedneutral', 'delays', 'and', 'any', 'other', 'types', 'of', 'uncertain', 'systems', 'that', 'can', 'be', 'represented', 'as', 'a', 'feedback', 'interconnection', 'of', 'a', 'known', 'system', 'with', 'an', 'uncertainty']] | [-0.1545589954710508, 0.09002273655439007, -0.05065408128930992, 0.05116841043472818, -0.04725990418710564, -0.1843876528712495, 0.00915253117618563, 0.3732490154198017, -0.2969153620755704, -0.29544493764216556, 0.2139133279457284, -0.2044929307966688, -0.14117391972058965, 0.25087921020336623, -0.0974611162592462, 0.10319624363459184, 0.07851908735699895, 0.03616314346255922, -0.0869105298942056, -0.2679117919368193, 0.33060466748564826, 0.03390482366139199, 0.208868507878826, -0.0018736224620631904, 0.0958456266973738, -0.012756344024813914, 0.021513809940900453, 0.08651687332488553, -0.08606244632877254, 0.04649861391982092, 0.24928615974305673, 0.11465305886222338, 0.2541838268433109, -0.4226386254480065, -0.2452131456013249, 0.1158225284839706, 0.08672759925013465, 0.08950365669149977, 0.0008315622080983811, -0.3233446884050229, 0.09515624173173262, -0.12837253465288312, -0.10945702127592508, -0.03506494449837812, -0.020591335762797515, 0.08461609171543866, -0.3540154765107373, 0.08519257655150217, 0.0648992148466235, -0.0027688514556764633, -0.11569606512965447, -0.10272002385741068, -0.02003631389216166, 0.11658070209010164, 0.028933108744550812, -0.05036860023933831, 0.10098562595053655, -0.060561457089357826, -0.11215843272380993, 0.3872779023422058, -0.058854815493520105, -0.2504847815635708, 0.19598392796677414, -0.0799727689216722, -0.12037931451332112, 0.13239282811044303, 0.1864529482807329, 0.0974607233629497, -0.19156936119317777, 0.05950027170646106, -0.01753216453416403, 0.16081001593229585, 0.056442909148456746, 0.06970925320096877, 0.13683734533319236, 0.11915879053345253, 0.13186898449970078, 0.14700163775965186, 0.005977826992540743, -0.1305757863483168, -0.3099425414980068, -0.056030863716200266, -0.11989522345008531, 0.020380510234313677, -0.08718175165019722, -0.11440078920471326, 0.31489856247501374, 0.11061993805608575, 0.19376380181539254, 0.11832799560971587, 0.2790370386675029, 0.21353933228271862, 0.0387796457963382, 0.056660144259546734, 0.23008848195976772, 0.15051533942211912, 0.09460956190330114, -0.20956646035291804, 0.11667334791020194, 0.030815204150628214] |
1,802.00347 | Solving Minimum k-supplier in Adleman-Lipton model | In this paper, we consider an algorithm for solving the minimum k supplier
problem using the Adleman Lipton model. The procedure works in polynomial steps
for the minimum k supplier problem of an undirected graph with n vertices,
which is an NP hard combinatorial optimization problem.
| cs.DS | in this paper we consider an algorithm for solving the minimum k supplier problem using the adleman lipton model the procedure works in polynomial steps for the minimum k supplier problem of an undirected graph with n vertices which is an np hard combinatorial optimization problem | [['in', 'this', 'paper', 'we', 'consider', 'an', 'algorithm', 'for', 'solving', 'the', 'minimum', 'k', 'supplier', 'problem', 'using', 'the', 'adleman', 'lipton', 'model', 'the', 'procedure', 'works', 'in', 'polynomial', 'steps', 'for', 'the', 'minimum', 'k', 'supplier', 'problem', 'of', 'an', 'undirected', 'graph', 'with', 'n', 'vertices', 'which', 'is', 'an', 'np', 'hard', 'combinatorial', 'optimization', 'problem']] | [-0.14935459658179595, 0.014445057440911036, -0.04257003541873849, 0.02071180348487004, -0.09793329996097347, -0.20114374241751173, 0.08107277791714296, 0.3696152067480042, -0.37081119677294855, -0.3915667764984233, 0.0499756191705313, -0.28194720387134864, -0.15589741925435627, 0.1013763656222221, -0.09795696275187252, 0.09925950116113476, 0.10063400351867566, 0.03352701242851174, 0.046719602691471504, -0.3383918237327041, 0.2560917381804598, 0.06404352013993522, 0.16212086972740034, 0.07576149064824796, 0.10640915574343957, 0.08724128513637444, 0.058566162990325174, 0.023534869744806834, -0.1635636076402, 0.0682848186065119, 0.3267727604530671, 0.21402473296241267, 0.32330154044472653, -0.41737584595608973, -0.11977257433792819, 0.22554301948327085, 0.13721071770819632, 0.0656908165901373, 0.01810866540156143, -0.13975390395068604, 0.1143782564651464, -0.0992550703332476, -0.052310169593471546, 0.09844458174041432, 0.05953376788807952, -0.10580673315764769, -0.3408693978562951, -0.03376350598409772, 0.09116659964353818, 0.04707337144519324, -0.04275964328047374, -0.20307763173933263, 0.12429142905318219, 0.061971655449546546, -0.017273723613470793, 0.0738734503823292, 0.019339256110074726, -0.12413519215466373, -0.23178554069169838, 0.3703563285222196, 0.020940529202799433, -0.1759586694508629, 0.02997628635848346, 0.052115207760716264, -0.20589369855335224, 0.13291279246787663, 0.1756551449753992, 0.2462681537575048, -0.19206553964328993, 0.16800529564447378, -0.15664688574717098, 0.12113437884608688, 0.06067320060632799, -0.11641135716648854, 0.08280840715008747, 0.18815984139623848, 0.20841358016933437, 0.24588118922775207, 0.03006970263896105, -0.03801649719800638, -0.2527681359130403, -0.09651461166694113, -0.2364876054065383, -0.008237995500878795, -0.16649449269449257, -0.17157714384729447, 0.36735183745622635, 0.10475182602101046, 0.18428707195688848, 0.1181415484676583, 0.31150245666503906, 0.1658640718087554, -0.07593711312738774, 0.18356122277960504, 0.0958267605215635, 0.11506111569621641, 0.06889133951019334, -0.2614336184165238, 0.08496584170801647, 0.1637068683605479] |
1,802.00348 | One categorization of microtonal scales | This study considers rational approximations of musical constant
$\beta=\log_2(3/2)$, which defines perfect fifth. This constant has been the
subject of the numerous studies, and this paper determines quality of rational
approximations in regards to absolute error. We analysed convergents and
secondary convergents (some of these are the best Huygens approximations).
Especially, we determined quality of the secondary convergents which are not
the best Huygens approximations - in this paper we called them non-convergents
approximations. Some of the microtonal scales have been positioned and
determined by using non-convergents approximation of music constant which
defines perfect fifth.
| math.GM | this study considers rational approximations of musical constant betalog_232 which defines perfect fifth this constant has been the subject of the numerous studies and this paper determines quality of rational approximations in regards to absolute error we analysed convergents and secondary convergents some of these are the best huygens approximations especially we determined quality of the secondary convergents which are not the best huygens approximations in this paper we called them nonconvergents approximations some of the microtonal scales have been positioned and determined by using nonconvergents approximation of music constant which defines perfect fifth | [['this', 'study', 'considers', 'rational', 'approximations', 'of', 'musical', 'constant', 'betalog_232', 'which', 'defines', 'perfect', 'fifth', 'this', 'constant', 'has', 'been', 'the', 'subject', 'of', 'the', 'numerous', 'studies', 'and', 'this', 'paper', 'determines', 'quality', 'of', 'rational', 'approximations', 'in', 'regards', 'to', 'absolute', 'error', 'we', 'analysed', 'convergents', 'and', 'secondary', 'convergents', 'some', 'of', 'these', 'are', 'the', 'best', 'huygens', 'approximations', 'especially', 'we', 'determined', 'quality', 'of', 'the', 'secondary', 'convergents', 'which', 'are', 'not', 'the', 'best', 'huygens', 'approximations', 'in', 'this', 'paper', 'we', 'called', 'them', 'nonconvergents', 'approximations', 'some', 'of', 'the', 'microtonal', 'scales', 'have', 'been', 'positioned', 'and', 'determined', 'by', 'using', 'nonconvergents', 'approximation', 'of', 'music', 'constant', 'which', 'defines', 'perfect', 'fifth']] | [-0.18668145814316942, 0.052075908345344306, -0.05782650908516659, 0.06424498290928839, -0.09896097924038358, -0.10188994127335949, 0.04218616701693243, 0.35851215374666257, -0.26680785278370095, -0.28787741466210437, 0.09602790344045958, -0.24695139157248067, -0.18185771961317776, 0.1799953728300202, -0.09555094136477826, 0.080194369245034, 0.003368188724290211, 0.052841884073811574, -0.057581175690527064, -0.3112247549330017, 0.30967446804752796, 0.07699880772781978, 0.23334258135694724, 0.039041316034374655, 0.11383823030577092, -0.043897668728707255, -0.09005780601976338, 0.014065682785687865, -0.2074371384182346, 0.1662422483275225, 0.26113629140021216, 0.11687683999272329, 0.2918436191566698, -0.3630756448729189, -0.14686019390125524, 0.12939377054687243, 0.16334413066711073, 0.06563519480622855, -0.006940941285382915, -0.20783835187922794, 0.1126456886253596, -0.1372348031049574, -0.1405905146502946, -0.061862696995856344, -0.03602385843827666, 0.1265897171157361, -0.234477245960139, 0.03539663463943525, 0.05653335355672535, 0.07424742213685762, -0.07978928244703419, -0.15424540950046792, 0.07977680048833673, 0.17419595180263558, 0.07291389737728533, 0.010093341348692775, 0.04096904248101534, -0.09944549075501798, -0.06959607968219443, 0.4270049877014461, -0.07837752674470891, -0.20496271387865808, 0.12474304484587245, -0.15846252601573263, -0.1349693831864867, 0.1402304190732948, 0.1515137750020885, 0.11593404158458605, -0.1554835598485974, 0.10988623714189628, -0.06514999632222149, 0.14494201677575053, 0.1841054138430691, 0.009586909345791235, 0.16848785004445485, 0.09844832152005407, 0.012770448281726503, 0.09824653170429744, -0.009388150425006092, -0.07911813304155738, -0.27545369764441974, -0.1294218739187652, -0.1848460570550882, 0.01798678520356259, -0.07518565141455819, -0.20974647435922544, 0.3771762129963263, 0.0976668314824065, 0.14336038925326788, 0.04722648462316451, 0.31535051722120455, 0.1425991981791762, 0.014774567972111342, 0.054685695424348445, 0.3093967867668483, 0.11028842019828057, 0.04546079859342221, -0.15738797161195958, 0.13005341481478824, 0.0993406692683533] |
1,802.00349 | NLO QCD corrections to Higgs boson plus jet production with full
top-quark mass dependence | We present the next-to-leading order QCD corrections to the production of a
Higgs boson in association with one jet at the LHC including the full top-quark
mass dependence. The mass of the bottom quark is neglected. The two-loop
integrals appearing in the virtual contribution are calculated numerically
using the method of Sector Decomposition. We study the Higgs boson transverse
momentum distribution, focusing on the high $p_{t,\mathrm{H}}$ region, where
the top-quark loop is resolved. We find that the next-to-leading order QCD
corrections are large but that the ratio of the next-to-leading order to
leading order result is similar to that obtained by computing in the limit of
large top-quark mass.
| hep-ph hep-ex | we present the nexttoleading order qcd corrections to the production of a higgs boson in association with one jet at the lhc including the full topquark mass dependence the mass of the bottom quark is neglected the twoloop integrals appearing in the virtual contribution are calculated numerically using the method of sector decomposition we study the higgs boson transverse momentum distribution focusing on the high p_tmathrmh region where the topquark loop is resolved we find that the nexttoleading order qcd corrections are large but that the ratio of the nexttoleading order to leading order result is similar to that obtained by computing in the limit of large topquark mass | [['we', 'present', 'the', 'nexttoleading', 'order', 'qcd', 'corrections', 'to', 'the', 'production', 'of', 'a', 'higgs', 'boson', 'in', 'association', 'with', 'one', 'jet', 'at', 'the', 'lhc', 'including', 'the', 'full', 'topquark', 'mass', 'dependence', 'the', 'mass', 'of', 'the', 'bottom', 'quark', 'is', 'neglected', 'the', 'twoloop', 'integrals', 'appearing', 'in', 'the', 'virtual', 'contribution', 'are', 'calculated', 'numerically', 'using', 'the', 'method', 'of', 'sector', 'decomposition', 'we', 'study', 'the', 'higgs', 'boson', 'transverse', 'momentum', 'distribution', 'focusing', 'on', 'the', 'high', 'p_tmathrmh', 'region', 'where', 'the', 'topquark', 'loop', 'is', 'resolved', 'we', 'find', 'that', 'the', 'nexttoleading', 'order', 'qcd', 'corrections', 'are', 'large', 'but', 'that', 'the', 'ratio', 'of', 'the', 'nexttoleading', 'order', 'to', 'leading', 'order', 'result', 'is', 'similar', 'to', 'that', 'obtained', 'by', 'computing', 'in', 'the', 'limit', 'of', 'large', 'topquark', 'mass']] | [-0.10528204292145178, 0.19180023551194203, -0.08192162260982311, 0.1462637638248486, -0.0628727290874209, -0.04399213042644853, 0.01170337334042415, 0.31736688033022264, -0.1606193749251327, -0.26302554706732434, 0.023393959321159247, -0.31998966158264214, 0.025274314714975103, 0.11143501226507835, 0.07544024745449726, 0.12298039717198764, 0.07698184720680325, 0.013754920714914246, -0.0633752085462523, -0.2694972744782852, 0.3690198591944796, 0.022056448678658518, 0.17769037613955638, 0.18235076612068546, 0.08113253787504854, 0.01769810018595308, -0.07192373132339627, -0.05317673671783672, -0.1284236999484468, 0.08550913391216589, 0.18078456951803268, -0.04834311988842846, 0.13969405658254228, -0.29628548095071755, -0.06591990022463035, 0.0879526146756554, 0.16806625258781155, 0.13616500589651642, -0.039581439118289076, -0.2342689953037296, 0.14528220341782327, -0.2737303430007564, -0.13108307074354444, -0.09009202568429625, -0.07249499089515733, -0.08243420923827216, -0.3182285731934287, 0.09481425785149138, -0.08438162091274366, -0.013979990222853504, 0.05158135256971474, -0.16327805639054901, -0.10308566413112674, 0.0888253652697636, 0.15588851443155566, 0.09224277069599204, 0.15077968043516632, -0.24689064881574638, -0.18468655217050886, 0.43809009486533423, -0.09600208565286637, -0.16693946683382685, 0.10422398903217443, -0.29084510190188195, -0.15183212837480284, 0.16183306156933583, 0.23219365777051146, 0.12148097215632098, -0.1789950509728105, 0.16754405063370037, 0.006407373209690882, 0.15206782777224565, 0.05777001681875576, 0.04581943280882789, 0.19238650751369143, 0.17444801803557547, -0.02406980965665921, 0.09751631457496572, -0.12180300209352195, -0.13214155229205196, -0.4550566309373136, -0.110217633864118, -0.11105262065474461, 0.02809349556574253, -0.1282674212728765, -0.1516072158874185, 0.39148394760020355, 0.15834163729946507, 0.2608765318226587, 0.04484778863412363, 0.35878773157579685, 0.2022848091065599, 0.12958559228745462, 0.07518402361569719, 0.34363522808308955, 0.18149435025407, 0.15092323602746344, -0.287990878840598, -0.002532398259198224, 0.1451409697636134] |
1,802.0035 | An $L^2$-identity and pinned distance problem | Let $\mu$ be a Frostman measure on $E\subset\mathbb{R}^d$. The spherical
average decay $$\int_{S^{d-1}}|\widehat{\mu}(r\omega)|^2\,d\omega\lesssim
r^{-\beta} $$ was originally used to attack Falconer distance conjecture, via
Mattila's integral. In this paper we consider the pinned distance problem, a
stronger version of Falconer distance problem, and show that spherical average
decay implies the same dimensional threshold on both of them. In particular,
with the best known spherical average estimates, we improve Peres-Schlag's
result on pinned distance problem significantly.
The idea is to reduce the pinned distance problem to an integral where
spherical averages apply. The key ingredient is the following identity. Using a
group action argument, we show that for any Schwartz function $f$ on
$\mathbb{R}^d$ and any $x\in\mathbb{R}^d$, $$\int_0^\infty
|\omega_t*f(x)|^2\,t^{d-1}dt\,=\int_0^\infty|\widehat{\omega_r}*f(x)|^2\,r^{d-1}dr,$$
where $\omega_r$ is the normalized surface measure on $r S^{d-1}$. An
interesting remark is that the right hand side can be easily seen equal to
$$c_d\int\left|D_x^{-\frac{d-1}{2}}e^{-2\pi i
t\sqrt{-\Delta}}f(x)\right|^2\,dt=c_d'\int\left|D_x^{-\frac{d-2}{2}}e^{2\pi i
t\Delta}f(x)\right|^2\,dt.$$ An alternative derivation of Mattila's integral
via group actions is also given in the Appendix.
| math.CA math.AP math.CO math.MG | let mu be a frostman measure on esubsetmathbbrd the spherical average decay int_sd1widehatmuromega2domegalesssim rbeta was originally used to attack falconer distance conjecture via mattilas integral in this paper we consider the pinned distance problem a stronger version of falconer distance problem and show that spherical average decay implies the same dimensional threshold on both of them in particular with the best known spherical average estimates we improve peresschlags result on pinned distance problem significantly the idea is to reduce the pinned distance problem to an integral where spherical averages apply the key ingredient is the following identity using a group action argument we show that for any schwartz function f on mathbbrd and any xinmathbbrd int_0infty omega_tfx2td1dtint_0inftywidehatomega_rfx2rd1dr where omega_r is the normalized surface measure on r sd1 an interesting remark is that the right hand side can be easily seen equal to c_dintleftd_xfracd12e2pi i tsqrtdeltafxright2dtc_dintleftd_xfracd22e2pi i tdeltafxright2dt an alternative derivation of mattilas integral via group actions is also given in the appendix | [['let', 'mu', 'be', 'a', 'frostman', 'measure', 'on', 'esubsetmathbbrd', 'the', 'spherical', 'average', 'decay', 'int_sd1widehatmuromega2domegalesssim', 'rbeta', 'was', 'originally', 'used', 'to', 'attack', 'falconer', 'distance', 'conjecture', 'via', 'mattilas', 'integral', 'in', 'this', 'paper', 'we', 'consider', 'the', 'pinned', 'distance', 'problem', 'a', 'stronger', 'version', 'of', 'falconer', 'distance', 'problem', 'and', 'show', 'that', 'spherical', 'average', 'decay', 'implies', 'the', 'same', 'dimensional', 'threshold', 'on', 'both', 'of', 'them', 'in', 'particular', 'with', 'the', 'best', 'known', 'spherical', 'average', 'estimates', 'we', 'improve', 'peresschlags', 'result', 'on', 'pinned', 'distance', 'problem', 'significantly', 'the', 'idea', 'is', 'to', 'reduce', 'the', 'pinned', 'distance', 'problem', 'to', 'an', 'integral', 'where', 'spherical', 'averages', 'apply', 'the', 'key', 'ingredient', 'is', 'the', 'following', 'identity', 'using', 'a', 'group', 'action', 'argument', 'we', 'show', 'that', 'for', 'any', 'schwartz', 'function', 'f', 'on', 'mathbbrd', 'and', 'any', 'xinmathbbrd', 'int_0infty', 'omega_tfx2td1dtint_0inftywidehatomega_rfx2rd1dr', 'where', 'omega_r', 'is', 'the', 'normalized', 'surface', 'measure', 'on', 'r', 'sd1', 'an', 'interesting', 'remark', 'is', 'that', 'the', 'right', 'hand', 'side', 'can', 'be', 'easily', 'seen', 'equal', 'to', 'c_dintleftd_xfracd12e2pi', 'i', 'tsqrtdeltafxright2dtc_dintleftd_xfracd22e2pi', 'i', 'tdeltafxright2dt', 'an', 'alternative', 'derivation', 'of', 'mattilas', 'integral', 'via', 'group', 'actions', 'is', 'also', 'given', 'in', 'the', 'appendix']] | [-0.10798258883997229, 0.07278763270255839, -0.11869672383923249, 0.08184821403342163, -0.08939504610955905, -0.15409261562748794, 0.024097827515286056, 0.34262881483764024, -0.2843150871503315, -0.21831854412949103, 0.10527554778219052, -0.2727717473097501, -0.1372104728843566, 0.19691366643294883, -0.11709809675367822, 0.00241175259516877, 0.021583837035829855, 0.09529432807426164, -0.06930403569327656, -0.25199763976470535, 0.33319577619664753, 0.028944445017630317, 0.23788891866755713, 0.07611622606407091, 0.07484827319954991, 0.048602874111977355, -3.818594880259721e-05, 0.010286941992379962, -0.19472250929853996, 0.10944792190210739, 0.1665636136057152, 0.1017747107555105, 0.2541888406660384, -0.3619094117111556, -0.15602704240928647, 0.17093171331524304, 0.16547958734949494, 0.01560023784708635, -0.003468750630672962, -0.2943728582245434, 0.0938790266980991, -0.13185033907485047, -0.16570770098371015, 0.03016285901995981, 0.08192692850093553, 0.015662378498062398, -0.29140288808685577, 0.07742081516830897, 0.08343594663651885, 0.03093555084708485, -0.06931504696477087, -0.11752715919190532, 0.02423143038039754, 0.09454866143679068, 0.03930224264618958, 0.1335899009173558, 0.101797699074077, -0.02140040236146517, -0.07714716974456029, 0.34287573556730133, -0.08729793527015266, -0.23484786686333264, 0.1358683696194629, -0.1361902478346779, -0.11030109321615499, 0.07322476844760814, 0.13736973049053863, 0.148107830179962, -0.101500057458142, 0.13609080930658657, -0.1010173716505242, 0.17485779046324218, 0.10485453471826141, -0.021228958923773023, 0.11448609287506503, 0.09558556921880954, 0.14418133674041148, 0.14301370007021555, -0.06670523111009229, -0.04054153179393927, -0.31862430741185926, -0.18256553678601317, -0.22681979150926565, 0.1043342905940086, -0.1041055093428556, -0.12290195323479404, 0.29366893194924304, 0.11010663848552722, 0.20235014675243662, 0.0988543210313863, 0.2437940722800032, 0.1478723997345111, 0.030325221800939387, 0.10003768802756906, 0.167982641589727, 0.1295202384913447, -0.0038624690863404685, -0.18728503466351698, 0.040208237741000144, 0.17201647079389565] |
1,802.00351 | A transverse knot invariant from Z2-equivariant Heegaard Floer
cohomology | We define an invariant of based transverse links, as a well-defined element
inside the equivariant Heegaard Floer cohomology of its branched double cover,
defined by Lipschitz, Hendricks, and Sarkar. We prove the naturality and
functoriality of equivariant Heegaard Floer cohomology for branched double
covers of $S^3$ along based knots, and then prove that our transverse link
invariant $c_{\mathbb{Z}_{2}}(\xi_{K})$ is an well-defined element which is
always nonvanishing and functorial under certain classes of symplectic
cobordisms, and describe its behavior under negative stabilization. It follows
that we can use properties of $c_{\mathbb{Z}_{2}}(\xi_{K})$ to give a condition
on transverse knots K which implies the vanishing/nonvanishing of the contact
class $c(\xi_{K})$.
| math.GT | we define an invariant of based transverse links as a welldefined element inside the equivariant heegaard floer cohomology of its branched double cover defined by lipschitz hendricks and sarkar we prove the naturality and functoriality of equivariant heegaard floer cohomology for branched double covers of s3 along based knots and then prove that our transverse link invariant c_mathbbz_2xi_k is an welldefined element which is always nonvanishing and functorial under certain classes of symplectic cobordisms and describe its behavior under negative stabilization it follows that we can use properties of c_mathbbz_2xi_k to give a condition on transverse knots k which implies the vanishingnonvanishing of the contact class cxi_k | [['we', 'define', 'an', 'invariant', 'of', 'based', 'transverse', 'links', 'as', 'a', 'welldefined', 'element', 'inside', 'the', 'equivariant', 'heegaard', 'floer', 'cohomology', 'of', 'its', 'branched', 'double', 'cover', 'defined', 'by', 'lipschitz', 'hendricks', 'and', 'sarkar', 'we', 'prove', 'the', 'naturality', 'and', 'functoriality', 'of', 'equivariant', 'heegaard', 'floer', 'cohomology', 'for', 'branched', 'double', 'covers', 'of', 's3', 'along', 'based', 'knots', 'and', 'then', 'prove', 'that', 'our', 'transverse', 'link', 'invariant', 'c_mathbbz_2xi_k', 'is', 'an', 'welldefined', 'element', 'which', 'is', 'always', 'nonvanishing', 'and', 'functorial', 'under', 'certain', 'classes', 'of', 'symplectic', 'cobordisms', 'and', 'describe', 'its', 'behavior', 'under', 'negative', 'stabilization', 'it', 'follows', 'that', 'we', 'can', 'use', 'properties', 'of', 'c_mathbbz_2xi_k', 'to', 'give', 'a', 'condition', 'on', 'transverse', 'knots', 'k', 'which', 'implies', 'the', 'vanishingnonvanishing', 'of', 'the', 'contact', 'class', 'cxi_k']] | [-0.2548696119338274, 0.08886518318785888, -0.16093674171896813, 0.11460774846926548, -0.1132140661436088, -0.18322538631488977, -0.02510685220957526, 0.3665868463446793, -0.34874975467914515, -0.23419458270796295, 0.057813296340930374, -0.17525378477226183, -0.16711682222277216, 0.1614183565393741, -0.18907236894683063, -0.00046385291769413407, 0.0826241886559693, 0.05619470919346781, -0.127747362619718, -0.20984161242523944, 0.4316994827647594, -0.06182314213580063, 0.20328283049979978, 0.1705921734445864, 0.16149795207294446, 0.021993237192679232, -0.010681227455367742, 0.0006561380838161534, -0.2450038876893955, 0.0914294539399228, 0.2730173718645373, -0.02610823455112941, 0.0931920167962903, -0.32960237804981113, -0.09922243171208764, 0.14340639390159868, 0.13126763363269348, -0.028643026579515014, 0.0061069922069612054, -0.271815474000443, 0.13577019560684278, -0.16755216476932458, -0.1693484869749439, -0.09447700967921795, 0.014163296172413433, 0.0741926248352613, -0.17524616280570626, -0.02770694668938234, 0.09744946691162377, 0.13262005491200293, 0.00968261239417259, -0.06607848285127757, -0.10527759507633022, 0.12852322973889632, 0.03926507540463099, 0.07861343098496928, 0.1645631953775521, -0.10668554423304583, -0.1338792441783527, 0.35068639624610687, -0.10261509542181654, -0.24594693880492044, 0.10962571629133185, -0.08978732541040743, -0.23627727983284344, 0.1955915168741519, 0.0026848644416019754, 0.16439604848279682, -0.023437476332652047, 0.154685988296072, -0.12130939548166053, 0.07167392317205667, 0.0904161001451639, -0.009555756204842943, 0.1454007468159193, 0.04820988306242213, 0.15955011434491398, 0.17755926426644753, -0.04827688795116558, -0.10052767298319965, -0.35641082557081016, -0.26316604768694607, -0.097544104839648, 0.1849328304044179, -0.09023734910831249, -0.23282824246013917, 0.4282967737034976, 0.01092660425737211, 0.19083714587342682, 0.19758705788594896, 0.24282648126612807, 0.0078119865473974676, 0.06297131453358763, 0.05339160726577478, 0.13450291114000296, 0.24151368013546956, -0.015227034837188362, -0.12793200089849388, -0.029544402949186494, 0.24889071799986498] |
1,802.00352 | The socio-economic impact of a breakthrough in the particle
accelerators' technology: a research agenda | Preliminary evidence on the long--run trajectory of the accelerator industry
suggests that it may be close to the maturity phase of its cycle. If this is
the case, how can we measure the benefits of an uncertain breakthrough in
acceleration technology? Who are the main stakeholders interested by such a
breakthrough? We identify these subjects and sketch some avenues for answering
these questions. We thus present a model for the social Cost-Benefit Analysis
(CBA) of research infrastructures and illustrate the results of its
implementation for assessing the benefits of accelerators in basic science and
hadrontherapy. Lastly, we move from the social CBA of single research
infrastructures to modeling a major change in the accelerator technology and
hence in the industry. A research agenda on the potential impacts of a
technological breakthrough is presented.
| physics.soc-ph physics.acc-ph | preliminary evidence on the longrun trajectory of the accelerator industry suggests that it may be close to the maturity phase of its cycle if this is the case how can we measure the benefits of an uncertain breakthrough in acceleration technology who are the main stakeholders interested by such a breakthrough we identify these subjects and sketch some avenues for answering these questions we thus present a model for the social costbenefit analysis cba of research infrastructures and illustrate the results of its implementation for assessing the benefits of accelerators in basic science and hadrontherapy lastly we move from the social cba of single research infrastructures to modeling a major change in the accelerator technology and hence in the industry a research agenda on the potential impacts of a technological breakthrough is presented | [['preliminary', 'evidence', 'on', 'the', 'longrun', 'trajectory', 'of', 'the', 'accelerator', 'industry', 'suggests', 'that', 'it', 'may', 'be', 'close', 'to', 'the', 'maturity', 'phase', 'of', 'its', 'cycle', 'if', 'this', 'is', 'the', 'case', 'how', 'can', 'we', 'measure', 'the', 'benefits', 'of', 'an', 'uncertain', 'breakthrough', 'in', 'acceleration', 'technology', 'who', 'are', 'the', 'main', 'stakeholders', 'interested', 'by', 'such', 'a', 'breakthrough', 'we', 'identify', 'these', 'subjects', 'and', 'sketch', 'some', 'avenues', 'for', 'answering', 'these', 'questions', 'we', 'thus', 'present', 'a', 'model', 'for', 'the', 'social', 'costbenefit', 'analysis', 'cba', 'of', 'research', 'infrastructures', 'and', 'illustrate', 'the', 'results', 'of', 'its', 'implementation', 'for', 'assessing', 'the', 'benefits', 'of', 'accelerators', 'in', 'basic', 'science', 'and', 'hadrontherapy', 'lastly', 'we', 'move', 'from', 'the', 'social', 'cba', 'of', 'single', 'research', 'infrastructures', 'to', 'modeling', 'a', 'major', 'change', 'in', 'the', 'accelerator', 'technology', 'and', 'hence', 'in', 'the', 'industry', 'a', 'research', 'agenda', 'on', 'the', 'potential', 'impacts', 'of', 'a', 'technological', 'breakthrough', 'is', 'presented']] | [-0.08573496286736283, 0.07392574339604821, -0.06143656695835797, 0.033139544172401544, -0.0766907130697168, -0.11357309540761705, 0.08009268767620556, 0.39314618857955574, -0.2652424115029381, -0.30299466799356434, 0.12537305371107577, -0.2915154634729812, -0.19157584358174773, 0.25581985954160247, -0.11193248143951808, 0.026851004969041543, 0.08940854198754505, 0.002859566087617462, -0.006933903918580565, -0.2722559967743499, 0.2719257148192789, 0.10694969292814122, 0.3035443616589825, 0.14212878281250596, 0.052563933242476525, -0.043227260431652904, -0.047148123996234255, -0.03297778243493093, -0.10486840512245742, 0.18566651064622447, 0.3176815882465221, 0.2402831188305036, 0.3963309116801597, -0.42014080795802566, -0.19361588714952419, 0.07613324942294844, 0.11499674165537371, 0.06766930515628442, -0.0925525851045294, -0.28165524887775345, 0.04704663979110161, -0.1858771173055879, -0.1699293301846916, -0.05591256994249901, 0.03866965701554979, 0.046465630033858736, -0.2006054730189586, -0.04597795086639716, 0.05139162989081185, 0.08243648047537956, -0.047712767011787095, -0.13636433074768997, 0.05220847745615065, 0.1883793634299497, 0.07463834964393645, 0.025501228781431018, 0.14456961308325872, -0.18140449128953978, -0.16532762982809035, 0.3928630019825204, 0.016814865530783634, -0.1155620783819516, 0.17531757362018852, -0.12900632256650738, -0.18153967155857867, 0.01997489083726379, 0.2392864820750472, 0.04829692952614978, -0.14895125227119016, 0.06304448756872487, 0.007317250538477324, 0.12588780491325752, 0.018325695925553265, -0.026239524353855757, 0.24189182446527302, 0.25520135195491683, 0.09519978516553074, 0.09243762522631262, -0.018306832217884466, -0.10195888358140294, -0.2906168486110698, -0.19692264917600705, -0.1301191924542497, 0.03495026694325585, -0.05275696900076254, -0.1172176797531153, 0.42403687026939896, 0.20594871912547213, 0.10894720177901418, -0.016265037494074357, 0.32074130748055485, 0.04057509129993001, 0.052852986046092065, 0.06917141620559912, 0.2301925424168226, 0.0367962284262215, 0.17374363153668723, -0.17700426862925234, 0.10884752722555086, -0.026085305594860164] |
1,802.00353 | Creeping motion of a solid particle inside a spherical elastic cavity | On the basis of the linear hydrodynamic equations, we present an analytical
theory for the low-Reynolds-number motion of a solid particle moving inside a
larger spherical elastic cavity which can be seen as a model system for a fluid
vesicle. In the particular situation where the particle is concentric with the
cavity, we use the stream function technique to find exact analytical solutions
of the fluid motion equations on both sides of the elastic cavity. In this
particular situation, we find that the solution of the hydrodynamic equations
is solely determined by membrane shear properties and that bending does not
play a role. For an arbitrary position of the solid particle within the
spherical cavity, we employ the image solution technique to compute the
axisymmetric flow field induced by a point force (Stokeslet). We then obtain
analytical expressions of the leading order mobility function describing the
fluid-mediated hydrodynamic interactions between the particle and confining
elastic cavity. In the quasi-steady limit of vanishing frequency, we find that
the particle self-mobility function is higher than that predicted inside a
rigid no-slip cavity. Considering the cavity motion, we find that the
pair-mobility function is determined only by membrane shear properties. Our
analytical predictions are supplemented and validated by fully-resolved
boundary integral simulations where a very good agreement is obtained over the
whole range of applied forcing frequencies.
| physics.flu-dyn physics.bio-ph | on the basis of the linear hydrodynamic equations we present an analytical theory for the lowreynoldsnumber motion of a solid particle moving inside a larger spherical elastic cavity which can be seen as a model system for a fluid vesicle in the particular situation where the particle is concentric with the cavity we use the stream function technique to find exact analytical solutions of the fluid motion equations on both sides of the elastic cavity in this particular situation we find that the solution of the hydrodynamic equations is solely determined by membrane shear properties and that bending does not play a role for an arbitrary position of the solid particle within the spherical cavity we employ the image solution technique to compute the axisymmetric flow field induced by a point force stokeslet we then obtain analytical expressions of the leading order mobility function describing the fluidmediated hydrodynamic interactions between the particle and confining elastic cavity in the quasisteady limit of vanishing frequency we find that the particle selfmobility function is higher than that predicted inside a rigid noslip cavity considering the cavity motion we find that the pairmobility function is determined only by membrane shear properties our analytical predictions are supplemented and validated by fullyresolved boundary integral simulations where a very good agreement is obtained over the whole range of applied forcing frequencies | [['on', 'the', 'basis', 'of', 'the', 'linear', 'hydrodynamic', 'equations', 'we', 'present', 'an', 'analytical', 'theory', 'for', 'the', 'lowreynoldsnumber', 'motion', 'of', 'a', 'solid', 'particle', 'moving', 'inside', 'a', 'larger', 'spherical', 'elastic', 'cavity', 'which', 'can', 'be', 'seen', 'as', 'a', 'model', 'system', 'for', 'a', 'fluid', 'vesicle', 'in', 'the', 'particular', 'situation', 'where', 'the', 'particle', 'is', 'concentric', 'with', 'the', 'cavity', 'we', 'use', 'the', 'stream', 'function', 'technique', 'to', 'find', 'exact', 'analytical', 'solutions', 'of', 'the', 'fluid', 'motion', 'equations', 'on', 'both', 'sides', 'of', 'the', 'elastic', 'cavity', 'in', 'this', 'particular', 'situation', 'we', 'find', 'that', 'the', 'solution', 'of', 'the', 'hydrodynamic', 'equations', 'is', 'solely', 'determined', 'by', 'membrane', 'shear', 'properties', 'and', 'that', 'bending', 'does', 'not', 'play', 'a', 'role', 'for', 'an', 'arbitrary', 'position', 'of', 'the', 'solid', 'particle', 'within', 'the', 'spherical', 'cavity', 'we', 'employ', 'the', 'image', 'solution', 'technique', 'to', 'compute', 'the', 'axisymmetric', 'flow', 'field', 'induced', 'by', 'a', 'point', 'force', 'stokeslet', 'we', 'then', 'obtain', 'analytical', 'expressions', 'of', 'the', 'leading', 'order', 'mobility', 'function', 'describing', 'the', 'fluidmediated', 'hydrodynamic', 'interactions', 'between', 'the', 'particle', 'and', 'confining', 'elastic', 'cavity', 'in', 'the', 'quasisteady', 'limit', 'of', 'vanishing', 'frequency', 'we', 'find', 'that', 'the', 'particle', 'selfmobility', 'function', 'is', 'higher', 'than', 'that', 'predicted', 'inside', 'a', 'rigid', 'noslip', 'cavity', 'considering', 'the', 'cavity', 'motion', 'we', 'find', 'that', 'the', 'pairmobility', 'function', 'is', 'determined', 'only', 'by', 'membrane', 'shear', 'properties', 'our', 'analytical', 'predictions', 'are', 'supplemented', 'and', 'validated', 'by', 'fullyresolved', 'boundary', 'integral', 'simulations', 'where', 'a', 'very', 'good', 'agreement', 'is', 'obtained', 'over', 'the', 'whole', 'range', 'of', 'applied', 'forcing', 'frequencies']] | [-0.14787643702376435, 0.12326987609633631, -0.1136047442736786, 0.007770385936185319, -0.04406531836554807, -0.10744500258338771, -0.017559860609123592, 0.3398392100311217, -0.2457033588975069, -0.2656165581886723, 0.058401940708011225, -0.23970925465151335, -0.13330804097131477, 0.18886877648297482, 0.005761618707765592, 0.06023088720810067, 0.0641030676675395, 0.02778813106436116, -0.03734117151283759, -0.11961093548909828, 0.27984959870328957, 0.03927776784985326, 0.26012064259183326, 0.03867013667227833, 0.13253914863785862, 0.009848412825834072, 0.01711309275041068, 0.07516398567323838, -0.2116753112618101, 0.07349013054668571, 0.18631855610146886, -0.003662911439148177, 0.21961334193682497, -0.4900751196463326, -0.21357107291779748, 0.045881492139804844, 0.17615367869335127, 0.15349127947566948, -0.05602611724108491, -0.23335050070766425, 0.04394724787562154, -0.1787577404507569, -0.1919106082807827, -0.035633745116813643, 0.027215864478681136, 0.052344712836202234, -0.2784285030398418, 0.12311445387604181, 0.0426078410736019, 0.04301456341155634, -0.12278263821956768, -0.04754544244237228, -0.02775708888241622, 0.10767634476204486, 0.04900654906409078, 0.037631014164487296, 0.20009184738903837, -0.17253879046204798, -0.030344989834702574, 0.40125435880535015, -0.08589131706353978, -0.27044971182970456, 0.17508638269750268, -0.16542632188897446, -0.010343874656038159, 0.15955247754339194, 0.15671773276075587, 0.11003278863349156, -0.14499530182001763, 0.06364527699692449, -0.0745341552865284, 0.17360091457067028, 0.09784279582735118, -0.0546923902254548, 0.21619694251941318, 0.15832667746664292, 0.030617882194097286, 0.16414896195835485, -0.09762234435402206, -0.12654436272818462, -0.33169387302041287, -0.12287131443476287, -0.1812030251078665, 0.01669456927857027, -0.12895065763255584, -0.19440868505210215, 0.34683018550276756, 0.10193114051071461, 0.15965351277139103, 0.04943298872811803, 0.3014363652847741, 0.1457865876665372, 0.0379941260398482, 0.06989995514283821, 0.3165807209651185, 0.13487266012608806, 0.08346388350537381, -0.2770284420746196, 0.0001334859906429691, 0.0915152547199146] |
1,802.00354 | Hadron Collider Searches for Diboson Resonances | This review covers results of searches for new elementary particles that
decay into boson pairs (dibosons), performed at the CERN Large Hadron Collider
in proton-proton collision data collected by the ATLAS and CMS experiments at
7-, 8-, and 13-TeV center-of-mass energy until the year 2017. The available
experimental results of the analysis of final states including most of the
possible two-object combinations of W and Z bosons, photons, Higgs bosons, and
gluons place stringent constraints on a variety of theoretical ideas that
extend the standard model, pushing into the multi-TeV region the scale of
allowed new physics phenomena.
| hep-ex hep-ph | this review covers results of searches for new elementary particles that decay into boson pairs dibosons performed at the cern large hadron collider in protonproton collision data collected by the atlas and cms experiments at 7 8 and 13tev centerofmass energy until the year 2017 the available experimental results of the analysis of final states including most of the possible twoobject combinations of w and z bosons photons higgs bosons and gluons place stringent constraints on a variety of theoretical ideas that extend the standard model pushing into the multitev region the scale of allowed new physics phenomena | [['this', 'review', 'covers', 'results', 'of', 'searches', 'for', 'new', 'elementary', 'particles', 'that', 'decay', 'into', 'boson', 'pairs', 'dibosons', 'performed', 'at', 'the', 'cern', 'large', 'hadron', 'collider', 'in', 'protonproton', 'collision', 'data', 'collected', 'by', 'the', 'atlas', 'and', 'cms', 'experiments', 'at', '7', '8', 'and', '13tev', 'centerofmass', 'energy', 'until', 'the', 'year', '2017', 'the', 'available', 'experimental', 'results', 'of', 'the', 'analysis', 'of', 'final', 'states', 'including', 'most', 'of', 'the', 'possible', 'twoobject', 'combinations', 'of', 'w', 'and', 'z', 'bosons', 'photons', 'higgs', 'bosons', 'and', 'gluons', 'place', 'stringent', 'constraints', 'on', 'a', 'variety', 'of', 'theoretical', 'ideas', 'that', 'extend', 'the', 'standard', 'model', 'pushing', 'into', 'the', 'multitev', 'region', 'the', 'scale', 'of', 'allowed', 'new', 'physics', 'phenomena']] | [-0.037480481924032985, 0.2548744591067032, -0.0865805481455992, 0.11232007275292726, -0.05860912381690376, -0.15292014403753362, 0.042806521010566125, 0.24963343246098685, -0.19524496658919, -0.3387228545105579, 0.03219655201394985, -0.3479478519067776, 0.08343331215900787, 0.21305854615460776, 0.11684791016486255, 0.11192073009323747, 0.19288152910540907, -0.04706507734954357, -0.011021104964964586, -0.30408457192540056, 0.2688130553911573, 0.09737047583472971, 0.2382488253868508, 0.12381375327288192, 0.1195371747361401, 0.07022604933816332, -0.08197832765171723, -0.09383597341841277, -0.15561613822145012, 0.10016114283436243, 0.24036452366153196, 0.11202432133960633, 0.16541056234237492, -0.38651469371718716, -0.089179287118153, 0.12168798731563955, 0.14651730726948198, 0.07206265914386936, -0.08620304322198072, -0.3592861471887754, 0.07088434722331562, -0.2175627191722089, -0.09091336313844184, 0.007427133223022886, 0.0182683463065828, -0.06124274559052927, -0.27593930660062754, 0.0521229649323742, -0.0316796327789067, 0.06667430390014636, -0.0303115128534751, -0.20666904919495693, -0.06363330337656092, -0.014773642791587174, 0.09762133583687815, 0.01970848420216721, 0.172382571734488, -0.19745441864254143, -0.2308201969468168, 0.3469409413483678, -0.021484864086901048, -0.07464962002906796, 0.2698613361322454, -0.20298413268043375, -0.17996642566571125, 0.176973846817047, 0.3073796676661895, 0.035095322235696474, -0.18857422914850164, 0.17496590034760612, -0.0392247238861663, 0.15445900973103635, 0.058970183312265695, 0.06967333601360039, 0.2158279456364523, 0.22628963967709212, -0.012791763100183892, 0.06636224614993232, -0.11886370699016416, -0.06051048466862103, -0.48040456252590735, -0.09470150407821852, -0.11400657292569474, -0.007818300825809794, -0.0032990751485102716, 0.005144873491431378, 0.39145711834580466, 0.11118454570800057, 0.30302673066034913, -0.0009324668516994131, 0.2575646695129725, 0.029377974332215225, 0.09136331017391652, 0.016351472123553357, 0.3281772543120255, 0.0912895629168203, 0.18268590105450427, -0.14994039760940536, -0.071956252555686, 0.053961693874693344] |
1,802.00355 | A Dynamic Game Approach for Demand-Side Management: Scheduling Energy
Storage with Forecasting Errors | Smart metering infrastructure allows for two-way communication and power
transfer. Based on this promising technology, we propose a demand-side
management (DSM) scheme for a residential neighbourhood of prosumers. Its core
is a discrete time dynamic game to schedule individually owned home energy
storage. The system model includes an advanced battery model, local generation
of renewable energy, and forecasting errors for demand and generation. We
derive a closed-form solution for the best-response problem of a player and
construct an iterative algorithm to solve the game. Empirical analysis shows
exponential convergence towards the Nash equilibrium. A comparison to a DSM
scheme with a static game, reveals the advantages of the dynamic game approach.
We provide an extensive analysis on the influence of the forecasting error on
the outcome of the game. A key result demonstrates that our approach is robust
even in the worst-case scenario. This grants considerable gains for the utility
company organising the DSM scheme and its participants.
| cs.GT | smart metering infrastructure allows for twoway communication and power transfer based on this promising technology we propose a demandside management dsm scheme for a residential neighbourhood of prosumers its core is a discrete time dynamic game to schedule individually owned home energy storage the system model includes an advanced battery model local generation of renewable energy and forecasting errors for demand and generation we derive a closedform solution for the bestresponse problem of a player and construct an iterative algorithm to solve the game empirical analysis shows exponential convergence towards the nash equilibrium a comparison to a dsm scheme with a static game reveals the advantages of the dynamic game approach we provide an extensive analysis on the influence of the forecasting error on the outcome of the game a key result demonstrates that our approach is robust even in the worstcase scenario this grants considerable gains for the utility company organising the dsm scheme and its participants | [['smart', 'metering', 'infrastructure', 'allows', 'for', 'twoway', 'communication', 'and', 'power', 'transfer', 'based', 'on', 'this', 'promising', 'technology', 'we', 'propose', 'a', 'demandside', 'management', 'dsm', 'scheme', 'for', 'a', 'residential', 'neighbourhood', 'of', 'prosumers', 'its', 'core', 'is', 'a', 'discrete', 'time', 'dynamic', 'game', 'to', 'schedule', 'individually', 'owned', 'home', 'energy', 'storage', 'the', 'system', 'model', 'includes', 'an', 'advanced', 'battery', 'model', 'local', 'generation', 'of', 'renewable', 'energy', 'and', 'forecasting', 'errors', 'for', 'demand', 'and', 'generation', 'we', 'derive', 'a', 'closedform', 'solution', 'for', 'the', 'bestresponse', 'problem', 'of', 'a', 'player', 'and', 'construct', 'an', 'iterative', 'algorithm', 'to', 'solve', 'the', 'game', 'empirical', 'analysis', 'shows', 'exponential', 'convergence', 'towards', 'the', 'nash', 'equilibrium', 'a', 'comparison', 'to', 'a', 'dsm', 'scheme', 'with', 'a', 'static', 'game', 'reveals', 'the', 'advantages', 'of', 'the', 'dynamic', 'game', 'approach', 'we', 'provide', 'an', 'extensive', 'analysis', 'on', 'the', 'influence', 'of', 'the', 'forecasting', 'error', 'on', 'the', 'outcome', 'of', 'the', 'game', 'a', 'key', 'result', 'demonstrates', 'that', 'our', 'approach', 'is', 'robust', 'even', 'in', 'the', 'worstcase', 'scenario', 'this', 'grants', 'considerable', 'gains', 'for', 'the', 'utility', 'company', 'organising', 'the', 'dsm', 'scheme', 'and', 'its', 'participants']] | [-0.1528920674581623, -0.041387990001118244, -0.12419643119431419, 0.06871128658862796, -0.054289774088000384, -0.18398511140088586, 0.1643582750701263, 0.3766029539129025, -0.2711254506227501, -0.31442039768223334, 0.09881078237829777, -0.26648976388720785, -0.14447265019628538, 0.17790388410669292, -0.13176115276841116, 0.06739912836007844, 0.07672469353648138, 0.022449942621957993, 0.045068531799648856, -0.241835073279099, 0.2646023845123245, 0.10526756467032423, 0.3629345565568656, 0.0495972546418728, 0.1329344831483698, -0.0034247273354514065, -0.029024486939858974, 0.0005112901783866596, -0.08097759622490494, 0.14349508769824937, 0.2743535059963978, 0.18549842352365864, 0.413658208576255, -0.43117631440746446, -0.20765546362705622, 0.11033601409024736, 0.07708714485368869, 0.082751591707568, -0.09922827910587687, -0.25108694658862263, 0.08175668161129579, -0.26484431842890205, -0.10230788752389482, -0.07251136447155636, -0.03430203184532591, 0.033188802453901475, -0.3643431641173231, -0.013875762181565802, 0.010094691421600837, 0.058908104513406376, -0.09777535838141295, -0.09156102923414068, 0.009560561996790333, 0.1559831090050431, 0.013248805712637361, -0.04068278816316418, 0.12939166472974245, -0.10215396760326304, -0.17487785693175525, 0.40122661402425436, -0.017031982019425757, -0.16076533582733496, 0.10726044264097427, -0.011423699304320013, -0.1117832107061249, 0.0846544084318949, 0.22775302174253553, 0.10249538849921355, -0.15627254991308798, 0.039753651162064224, -0.029047416867924076, 0.19096969890325696, -0.024503798455388956, 0.008807616243492576, 0.1792648846189244, 0.2730920241285068, 0.212588518132939, 0.12956773108932412, -0.0511036568042775, -0.1968172329943627, -0.24430429377840668, -0.16372416170809087, -0.17504744518613088, 0.01763611579390502, -0.11200538371891135, -0.15141028602006315, 0.40697111169713396, 0.16680882786860382, 0.05637055152107643, 0.10958593025143389, 0.4015339330027375, 0.11777707856057118, -0.0011502979452208957, 0.12384255451703395, 0.1744388650595859, 0.017012716434554116, 0.22133058557711258, -0.25652762749409186, 0.1004777668063128, 0.05394221887897252] |
1,802.00356 | Superintegrability of Generalized Toda Models on Symmetric Spaces | In this paper we prove superintegrability of Hamiltonian systems generated by
functions on $K\backslash G/K$, restriced to a symplectic leaf of the Poisson
variety $G/K$, where $G$ is a simple Lie group with the standard Poisson Lie
structure, $K$ is the subgroup of fixed points with respect to the Cartan
involution.
| math-ph math.MP | in this paper we prove superintegrability of hamiltonian systems generated by functions on kbackslash gk restriced to a symplectic leaf of the poisson variety gk where g is a simple lie group with the standard poisson lie structure k is the subgroup of fixed points with respect to the cartan involution | [['in', 'this', 'paper', 'we', 'prove', 'superintegrability', 'of', 'hamiltonian', 'systems', 'generated', 'by', 'functions', 'on', 'kbackslash', 'gk', 'restriced', 'to', 'a', 'symplectic', 'leaf', 'of', 'the', 'poisson', 'variety', 'gk', 'where', 'g', 'is', 'a', 'simple', 'lie', 'group', 'with', 'the', 'standard', 'poisson', 'lie', 'structure', 'k', 'is', 'the', 'subgroup', 'of', 'fixed', 'points', 'with', 'respect', 'to', 'the', 'cartan', 'involution']] | [-0.22331856605688147, 0.056700174160319944, -0.08931000821073265, -0.017334248968765287, -0.1630817614450101, -0.12796928384797832, 0.03385813740839926, 0.37340230494737625, -0.34727459853770687, -0.20709907322523968, 0.040496032682758774, -0.2473986240505588, -0.15725598263316878, 0.18158485722618506, -0.15166791740293598, -0.03630562886303546, 0.0906177708952158, 0.19028293548663164, -0.1416953933772211, -0.25394487855316816, 0.4381647431382946, -0.016219012101418247, 0.17142019619453042, -0.07850891300568394, 0.1505444603332994, -0.03641223544072287, 0.01590389120118583, -0.047991045348930596, -0.0894659026799833, 0.07687268062841658, 0.2849827765797575, -0.007472227377743989, 0.16192466453831716, -0.29933688358641136, -0.16183533304937037, 0.22290274763808532, 0.11974144142632391, -0.03712546270267636, -0.007764686079348857, -0.28533496492195365, 0.15992237788205052, -0.173521594993551, -0.1725677219402118, -0.01297215449021143, 0.05837604765068082, 0.013194913574147458, -0.2154375050073106, -0.005429567760039194, 0.09730393676927276, 0.157977438933563, -0.0071571972129829955, -0.132361821143194, -0.08966680500181574, 0.021041226208063903, -0.05397765668036014, 0.08804708072806106, 0.10712292188705475, -0.020707015856625696, -0.11763289340716951, 0.4712816792193289, -0.058201237732325405, -0.28348499741040023, 0.13890549053858017, -0.2018867791904246, -0.20688165077830062, 0.10226104897903461, 0.09527275409987744, 0.12399854861638125, -0.10006221016873514, 0.23399172056758522, -0.12530918242227213, 0.017954759984551108, 0.06289895289741895, -0.0944486905035435, 0.09735061199970398, 0.14106234780275353, 0.1298350266856598, 0.08277108735751872, 0.029037092935622615, -0.03170718117525764, -0.3620566166206902, -0.17643638393458197, -0.12883344434165195, 0.16636211589417038, -0.13599353616911114, -0.16700587014430293, 0.4077468355934994, 0.040505994147821967, 0.20131503103994855, 0.0912492731814364, 0.17771257938561486, 0.1275092937307907, 0.049923994131021054, 0.11234641705146607, 0.04437160588727862, 0.2713076116964586, -0.09454649784054388, -0.1717989290973135, -0.09594525014251179, 0.1879465860296406] |
1,802.00357 | Stability of the spiral spin liquid in MnSc$_2$S$_4$ | We investigate the stability of the spiral spin liquid phase in MnSc$_2$S$_4$
against thermal and quantum fluctuations as well as against perturbing effects
of longer-range interactions. Employing $ab~initio$ density functional theory
(DFT) calculations we propose a realistic Hamiltonian for MnSc$_2$S$_4$,
featuring second ($J_2$) and third $(J_3)$ neighbor Heisenberg interactions on
the diamond lattice that are considerably larger than previously assumed. We
argue that the combination of strong $J_2$ and $J_3$ couplings reproduces the
correct magnetic Bragg peak position measured experimentally. Calculating the
spin-structure factor within the pseudofermion functional-renormalization group
technique we find that close to the magnetic phase transition the sizable $J_3$
couplings induce a strong spiral selection effect, in agreement with
experiments. With increasing temperature the spiral selection becomes weaker
such that in a window around three to five times the ordering temperature an
approximate spiral spin liquid is realized in MnSc$_2$S$_4$.
| cond-mat.str-el cond-mat.mtrl-sci | we investigate the stability of the spiral spin liquid phase in mnsc_2s_4 against thermal and quantum fluctuations as well as against perturbing effects of longerrange interactions employing abinitio density functional theory dft calculations we propose a realistic hamiltonian for mnsc_2s_4 featuring second j_2 and third j_3 neighbor heisenberg interactions on the diamond lattice that are considerably larger than previously assumed we argue that the combination of strong j_2 and j_3 couplings reproduces the correct magnetic bragg peak position measured experimentally calculating the spinstructure factor within the pseudofermion functionalrenormalization group technique we find that close to the magnetic phase transition the sizable j_3 couplings induce a strong spiral selection effect in agreement with experiments with increasing temperature the spiral selection becomes weaker such that in a window around three to five times the ordering temperature an approximate spiral spin liquid is realized in mnsc_2s_4 | [['we', 'investigate', 'the', 'stability', 'of', 'the', 'spiral', 'spin', 'liquid', 'phase', 'in', 'mnsc_2s_4', 'against', 'thermal', 'and', 'quantum', 'fluctuations', 'as', 'well', 'as', 'against', 'perturbing', 'effects', 'of', 'longerrange', 'interactions', 'employing', 'abinitio', 'density', 'functional', 'theory', 'dft', 'calculations', 'we', 'propose', 'a', 'realistic', 'hamiltonian', 'for', 'mnsc_2s_4', 'featuring', 'second', 'j_2', 'and', 'third', 'j_3', 'neighbor', 'heisenberg', 'interactions', 'on', 'the', 'diamond', 'lattice', 'that', 'are', 'considerably', 'larger', 'than', 'previously', 'assumed', 'we', 'argue', 'that', 'the', 'combination', 'of', 'strong', 'j_2', 'and', 'j_3', 'couplings', 'reproduces', 'the', 'correct', 'magnetic', 'bragg', 'peak', 'position', 'measured', 'experimentally', 'calculating', 'the', 'spinstructure', 'factor', 'within', 'the', 'pseudofermion', 'functionalrenormalization', 'group', 'technique', 'we', 'find', 'that', 'close', 'to', 'the', 'magnetic', 'phase', 'transition', 'the', 'sizable', 'j_3', 'couplings', 'induce', 'a', 'strong', 'spiral', 'selection', 'effect', 'in', 'agreement', 'with', 'experiments', 'with', 'increasing', 'temperature', 'the', 'spiral', 'selection', 'becomes', 'weaker', 'such', 'that', 'in', 'a', 'window', 'around', 'three', 'to', 'five', 'times', 'the', 'ordering', 'temperature', 'an', 'approximate', 'spiral', 'spin', 'liquid', 'is', 'realized', 'in', 'mnsc_2s_4']] | [-0.2013858609318792, 0.2097906906680986, -0.025239572011780415, 0.08338066207287623, -0.03271773370953513, -0.12239729404174002, 0.05466604870038999, 0.41503625764334445, -0.22693859870401276, -0.28712681318226624, 0.02252749566966012, -0.32447102631796415, -0.12809446427485788, 0.12087339745722973, 0.1279267365814672, -0.024917868907156755, -0.038866808760950576, 0.006336058194840878, -0.14260092833076118, -0.18327210811097963, 0.2480766320843774, 0.04705430141856737, 0.25655803531670657, 0.04121966413746942, 0.04581595485551204, 0.05760787877018078, 0.089411031518748, 0.034005164509822786, -0.18006571189153606, 0.013943892824922649, 0.20045210414362782, -0.09321912701740126, 0.19533993193591145, -0.4214528018893989, -0.18125261172970336, 0.053805285945049366, 0.11717800732905334, 0.16215136313391193, -0.06125364479121857, -0.30993375242491006, 0.040828130932682206, -0.2047831496050824, -0.15599445110673912, -0.1467790215105658, -0.026607540065527593, -0.014960207819404133, -0.27728646568639176, 0.1444290561567087, 0.036537771085342785, 0.07842132510918866, -0.044628889073657106, -0.13372671293278396, -0.07178240779190469, 0.05019704080317956, 0.048158359285903125, 0.09560136012667396, 0.16438651694850603, -0.09944578959331127, -0.10204705720583737, 0.38725692725045163, -0.10948086383108552, -0.09806824206295882, 0.14560880394600018, -0.18049689889705123, -0.1261420589379809, 0.12809150750276593, 0.09138992933792547, 0.0531112603895681, -0.1053477650619781, 0.06083538994384916, -0.003626765590652981, 0.21866058304899333, 0.019332378614090488, 0.031318360180001704, 0.2182050626298649, 0.17853395154447177, 0.06650156339525547, 0.12859349918771457, -0.1316024436546542, -0.15051332999571737, -0.2319108220735486, -0.06140635164211091, -0.19884504274871778, 0.010449430965847158, -0.13811635126289665, -0.15711489157311775, 0.35192451615568615, 0.16778186565055184, 0.17105263695907844, -0.013909423307345157, 0.25603134193274024, 0.08130241426947514, 0.09785878893748766, 0.03396189154427446, 0.3083230405127708, 0.18828375015119223, 0.024432700734034602, -0.30469860374852914, 0.06827818610849724, 0.039537246478393566] |
1,802.00358 | Strongly Magnetized Sources: QED and X-ray Polarization | Radiative corrections of quantum electrodynamics cause a vacuum threaded by
magnetic field to be birefringent. This means that radiation of different
polarizations travels at different speeds. Even in the strong magnetic fields
of astrophysical sources the difference in speed is small; however, it has
profound consequences for the extent of polarization expected from strongly
magnetized sources. We demonstrate how the birefringence arises from first
principles, show how birefringence affects the polarization state of radiation
and present recent calculations for the expected polarization from magnetars
and X-ray pulsars.
| astro-ph.HE | radiative corrections of quantum electrodynamics cause a vacuum threaded by magnetic field to be birefringent this means that radiation of different polarizations travels at different speeds even in the strong magnetic fields of astrophysical sources the difference in speed is small however it has profound consequences for the extent of polarization expected from strongly magnetized sources we demonstrate how the birefringence arises from first principles show how birefringence affects the polarization state of radiation and present recent calculations for the expected polarization from magnetars and xray pulsars | [['radiative', 'corrections', 'of', 'quantum', 'electrodynamics', 'cause', 'a', 'vacuum', 'threaded', 'by', 'magnetic', 'field', 'to', 'be', 'birefringent', 'this', 'means', 'that', 'radiation', 'of', 'different', 'polarizations', 'travels', 'at', 'different', 'speeds', 'even', 'in', 'the', 'strong', 'magnetic', 'fields', 'of', 'astrophysical', 'sources', 'the', 'difference', 'in', 'speed', 'is', 'small', 'however', 'it', 'has', 'profound', 'consequences', 'for', 'the', 'extent', 'of', 'polarization', 'expected', 'from', 'strongly', 'magnetized', 'sources', 'we', 'demonstrate', 'how', 'the', 'birefringence', 'arises', 'from', 'first', 'principles', 'show', 'how', 'birefringence', 'affects', 'the', 'polarization', 'state', 'of', 'radiation', 'and', 'present', 'recent', 'calculations', 'for', 'the', 'expected', 'polarization', 'from', 'magnetars', 'and', 'xray', 'pulsars']] | [-0.1309835901955576, 0.2347939408801753, -0.04589284000243863, 0.07783013237533214, -0.09015694134279914, -0.040597119042114625, 0.004990586689833937, 0.4045925195189728, -0.26953118184217434, -0.3106962314796174, 0.0046449672543154704, -0.2800485076404166, -0.09338148105782511, 0.258337154607128, 0.02354397270400291, -0.012559900301155346, 0.02098852132671866, -0.039410470385404156, -0.030075397492311466, -0.15522176094470952, 0.3434473868973296, 0.08083256126793593, 0.29339503562184926, 0.06634044385483039, 0.10312871847986832, -0.04800225517059537, 0.012728436453931633, 0.07397256373031728, -0.05901488779293675, 0.011653672957300455, 0.17818191960111432, 0.0890942163572743, 0.16962538890797516, -0.4870850379610884, -0.24221126972858248, 0.06419026994028654, 0.07839398036025808, 0.16992549371274038, -0.09697499682681218, -0.27087940170360064, 0.020967381974232608, -0.1357781807410306, -0.16331840299027062, -0.04061009285265002, 0.02218517509219504, 0.01834144626728034, -0.21815229015660353, 0.08082968467611006, 0.0277504879277435, 0.026935024627791477, -0.04744185883038003, -0.08741042800461767, -0.0045694041322788285, 0.08020742590292945, 0.12157113656091194, 0.05550685764194049, 0.17364705482968826, -0.19226194701917554, -0.1411589951596983, 0.4204600779018525, -0.08993206985680194, -0.09036240329559164, 0.12713561718748217, -0.2584766975668227, -0.10039525378318824, 0.1696817999713701, 0.19239543561406178, 0.14236400432713414, -0.07951536505408156, 0.06663380278108491, 0.024674985033256568, 0.18783938238161735, 0.08535634149829376, 0.09892763906083572, 0.3286480877184491, 0.09245662462506872, -0.023280624867598902, 0.1643719274119806, -0.12850417766249042, -0.03329611910057479, -0.28509414598517036, -0.10661232429717121, -0.13996332845832596, 0.15026728353923421, -0.0961268392519292, -0.12516397686177416, 0.374239299703261, 0.2147002463796358, 0.0750432296217173, -0.0521024305095104, 0.33797127176504366, 0.1087539060223291, 0.05674006752990957, 0.1028193745590832, 0.410602650391045, 0.186101216140428, 0.12830736305853674, -0.2722749121931392, 0.0703938531852595, -0.07405776873059657] |
1,802.00359 | Attacking the Nintendo 3DS Boot ROMs | We demonstrate attacks on the boot ROMs of the Nintendo 3DS in order to
exfiltrate secret information from normally protected areas of memory and gain
persistent early code execution on devices which have not previously been
compromised. The attack utilizes flaws in the RSA signature verification
implementation of one of the boot ROMs in order to overflow ASN.1 length fields
and cause invalid firmware images to appear valid to the signature parser. This
is then used to load a custom firmware image which overwrites the data-abort
vector with a custom data abort handler, then induces a data-abort exception in
order to reliably redirect boot ROM code flow at boot time. This executes a
payload which, due to its reliable early execution by a privileged processor,
is able to function as a persistent exploit of the system in order to
exfiltrate secret information (such as encryption keys) from normally protected
areas of memory.
| cs.CR | we demonstrate attacks on the boot roms of the nintendo 3ds in order to exfiltrate secret information from normally protected areas of memory and gain persistent early code execution on devices which have not previously been compromised the attack utilizes flaws in the rsa signature verification implementation of one of the boot roms in order to overflow asn1 length fields and cause invalid firmware images to appear valid to the signature parser this is then used to load a custom firmware image which overwrites the dataabort vector with a custom data abort handler then induces a dataabort exception in order to reliably redirect boot rom code flow at boot time this executes a payload which due to its reliable early execution by a privileged processor is able to function as a persistent exploit of the system in order to exfiltrate secret information such as encryption keys from normally protected areas of memory | [['we', 'demonstrate', 'attacks', 'on', 'the', 'boot', 'roms', 'of', 'the', 'nintendo', '3ds', 'in', 'order', 'to', 'exfiltrate', 'secret', 'information', 'from', 'normally', 'protected', 'areas', 'of', 'memory', 'and', 'gain', 'persistent', 'early', 'code', 'execution', 'on', 'devices', 'which', 'have', 'not', 'previously', 'been', 'compromised', 'the', 'attack', 'utilizes', 'flaws', 'in', 'the', 'rsa', 'signature', 'verification', 'implementation', 'of', 'one', 'of', 'the', 'boot', 'roms', 'in', 'order', 'to', 'overflow', 'asn1', 'length', 'fields', 'and', 'cause', 'invalid', 'firmware', 'images', 'to', 'appear', 'valid', 'to', 'the', 'signature', 'parser', 'this', 'is', 'then', 'used', 'to', 'load', 'a', 'custom', 'firmware', 'image', 'which', 'overwrites', 'the', 'dataabort', 'vector', 'with', 'a', 'custom', 'data', 'abort', 'handler', 'then', 'induces', 'a', 'dataabort', 'exception', 'in', 'order', 'to', 'reliably', 'redirect', 'boot', 'rom', 'code', 'flow', 'at', 'boot', 'time', 'this', 'executes', 'a', 'payload', 'which', 'due', 'to', 'its', 'reliable', 'early', 'execution', 'by', 'a', 'privileged', 'processor', 'is', 'able', 'to', 'function', 'as', 'a', 'persistent', 'exploit', 'of', 'the', 'system', 'in', 'order', 'to', 'exfiltrate', 'secret', 'information', 'such', 'as', 'encryption', 'keys', 'from', 'normally', 'protected', 'areas', 'of', 'memory']] | [-0.1621312411253651, 0.02185989356910189, -0.099112668922171, 0.041454611519972484, -0.10614880582938592, -0.2268394080704699, 0.08300353046817084, 0.3450367802303905, -0.3077507752118011, -0.34181350201989213, 0.1759791023059127, -0.2659661582112312, -0.07594079024003197, 0.1922930254849295, -0.1469381654728204, 0.10724871980608441, 0.01975951760929699, 0.043131577277866505, -0.009994136649960031, -0.28111717286209265, 0.23833949397628507, 0.09429149577704568, 0.26947849565030385, -0.000571841897132496, 0.09200150066443409, -0.017946551288478076, -0.023897490828918913, -0.07447143062949181, -0.03254818801457683, 0.0708895934590449, 0.32236682014229395, 0.15610795928010096, 0.2541967085803238, -0.4647420534243186, -0.164509806620966, 0.062050138709601015, 0.12535664859615886, 0.14487372240905338, -0.008743712748400866, -0.2940478327847086, 0.15737438779945176, -0.2556137026504924, -0.04719976035713141, -0.08400870060548186, -0.008148782354934762, -0.002321769818663597, -0.2402366464243581, -0.03359441447071731, 0.047664352400849264, 0.0453342827471594, 0.03212834342179122, -0.0026082415560570857, -0.03823487591696903, 0.16588309405371546, 0.017527857904012005, 0.061983465308633946, 0.17188831930359205, -0.10344205926172435, -0.13077356986313438, 0.39450327418744563, -0.04196551375556737, -0.1500710164788567, 0.14980123920210947, -0.022818799627323947, -0.09763986787293107, 0.15605151784916718, 0.22478889672706526, 0.054654822970430054, -0.14132394069805743, -0.009083555496763438, 0.05758398777494828, 0.2803897028664748, 0.08373204401577823, 0.05483523073295752, 0.19006976917386054, 0.13540542604401706, 0.05009305151334653, 0.14440704385749994, -0.10274407049951453, -0.06166094953194261, -0.2479826544597745, -0.18015472744281094, -0.18582358324279388, -0.0013649137922523854, -0.02654806597449351, -0.15876043296729525, 0.38269136669735115, 0.2254521819204092, 0.1263191828574054, 0.02499355051899329, 0.42730322680746513, -0.0019110337225720286, 0.19279613704265405, 0.1651658815611154, 0.1345780654406796, 0.026905014913063498, 0.14790225836758814, -0.16794744142331183, 0.1568701423390303, 0.028004619802037875] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.