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.0196 | The performances of R GPU implementations of the GMRES method | Although the performance of commodity computers has improved drastically with
the introduction of multicore processors and GPU computing, the standard R
distribution is still based on single-threaded model of computation, using only
a small fraction of the computational power available now for most desktops and
laptops. Modern statistical software packages rely on high performance
implementations of the linear algebra routines there are at the core of several
important leading edge statistical methods. In this paper we present a GPU
implementation of the GMRES iterative method for solving linear systems. We
compare the performance of this implementation with a pure single threaded
version of the CPU. We also investigate the performance of our implementation
using different GPU packages available now for R such as gmatrix, gputools or
gpuR which are based on CUDA or OpenCL frameworks.
| cs.DC | although the performance of commodity computers has improved drastically with the introduction of multicore processors and gpu computing the standard r distribution is still based on singlethreaded model of computation using only a small fraction of the computational power available now for most desktops and laptops modern statistical software packages rely on high performance implementations of the linear algebra routines there are at the core of several important leading edge statistical methods in this paper we present a gpu implementation of the gmres iterative method for solving linear systems we compare the performance of this implementation with a pure single threaded version of the cpu we also investigate the performance of our implementation using different gpu packages available now for r such as gmatrix gputools or gpur which are based on cuda or opencl frameworks | [['although', 'the', 'performance', 'of', 'commodity', 'computers', 'has', 'improved', 'drastically', 'with', 'the', 'introduction', 'of', 'multicore', 'processors', 'and', 'gpu', 'computing', 'the', 'standard', 'r', 'distribution', 'is', 'still', 'based', 'on', 'singlethreaded', 'model', 'of', 'computation', 'using', 'only', 'a', 'small', 'fraction', 'of', 'the', 'computational', 'power', 'available', 'now', 'for', 'most', 'desktops', 'and', 'laptops', 'modern', 'statistical', 'software', 'packages', 'rely', 'on', 'high', 'performance', 'implementations', 'of', 'the', 'linear', 'algebra', 'routines', 'there', 'are', 'at', 'the', 'core', 'of', 'several', 'important', 'leading', 'edge', 'statistical', 'methods', 'in', 'this', 'paper', 'we', 'present', 'a', 'gpu', 'implementation', 'of', 'the', 'gmres', 'iterative', 'method', 'for', 'solving', 'linear', 'systems', 'we', 'compare', 'the', 'performance', 'of', 'this', 'implementation', 'with', 'a', 'pure', 'single', 'threaded', 'version', 'of', 'the', 'cpu', 'we', 'also', 'investigate', 'the', 'performance', 'of', 'our', 'implementation', 'using', 'different', 'gpu', 'packages', 'available', 'now', 'for', 'r', 'such', 'as', 'gmatrix', 'gputools', 'or', 'gpur', 'which', 'are', 'based', 'on', 'cuda', 'or', 'opencl', 'frameworks']] | [-0.11788288491280903, -0.03620626456349304, -0.07426483916552891, -0.013942056409909594, -0.06875580996695094, -0.1998439635206154, 0.016467303449911225, 0.42459259016257256, -0.25009974178812583, -0.36255998368886183, 0.15776187687660603, -0.23729397221013232, -0.08178703089531764, 0.29041709919124004, -0.030869509980802012, 0.10864089359091665, 0.161337372510785, 0.01986430180294061, -0.12138000483225499, -0.3106176370012581, 0.22100740729277968, 0.09901977144181728, 0.2822368399247079, 0.04312114785880523, 0.07216138970627646, -0.03559004430330001, -0.029311357188577716, -0.0013695512092987397, -0.04943543779698754, 0.18265134424778207, 0.22597115207813623, 0.1868364715325485, 0.30369118393811967, -0.48607655614614487, -0.11186925751766316, 0.03871212854344202, 0.15311456565689155, 0.04937765713259438, -0.07396165820633419, -0.19412419888850904, 0.10179121074917957, -0.2505750541708299, -0.049773993208668287, -0.099574970368548, -0.024581226779330046, 0.04817843190709451, -0.21024180498478331, 0.03429911678978172, -0.008992106995993484, 0.09823725205194905, 0.04583087729012657, -0.18927319212011376, 0.06255183367345735, 0.07322965862047404, -0.035510178013788744, 0.013463590511197882, 0.18115673042637737, -0.13029178918542383, -0.1696630177207123, 0.41959721142692225, -0.04127939621728838, -0.19895658174991832, 0.20377740898708763, -0.02910136938431209, -0.18909113649874085, 0.0565247739546169, 0.2307803445544682, 0.09002547788817114, -0.13770601490890622, 0.1495598496587359, 0.024613587954256656, 0.20581174159380503, 0.024162769268609975, 0.03283746630177462, 0.1527303080109501, 0.25674524979492563, -0.017983916992211323, 0.14102645883602755, -0.06981484838446281, -0.12946993306181148, -0.23125083403507793, -0.17776072948393798, -0.20825924166597257, -0.019665625853169905, -0.09910238698046983, -0.2147449476021181, 0.3854879065647833, 0.2044155507215432, 0.07951114858899798, 0.10731509400626182, 0.43536110171922165, 0.06389246748224657, 0.16707418893098033, 0.21746736242877027, 0.14865831025925122, 0.04252305224929985, 0.12290107750393366, -0.19481294339564734, 0.028400126399990535, 0.016273705428816322] |
1,802.01961 | Exact Solution for Partition function of General Ising Model in Magnetic
Fields and Bayesian Networks | We propose a method for generalizing the Ising model in magnetic fields and
calculating the partition function (exact solution) for the Ising model of an
arbitrary shape. Specifically, the partition function is calculated using
matrices that are created automatically based on the structure of the system.
By generalizing this method, it becomes possible to calculate the partition
function of various crystal systems (network shapes) in magnetic fields when N
(scale) is infinite. Furthermore, we also connect this method for finding the
solution to the Ising model in magnetic fields to a method for finding the
solution to Bayesian networks in information statistical mechanics (applied to
data mining, machine learning, and combinatorial optimization).
| physics.gen-ph | we propose a method for generalizing the ising model in magnetic fields and calculating the partition function exact solution for the ising model of an arbitrary shape specifically the partition function is calculated using matrices that are created automatically based on the structure of the system by generalizing this method it becomes possible to calculate the partition function of various crystal systems network shapes in magnetic fields when n scale is infinite furthermore we also connect this method for finding the solution to the ising model in magnetic fields to a method for finding the solution to bayesian networks in information statistical mechanics applied to data mining machine learning and combinatorial optimization | [['we', 'propose', 'a', 'method', 'for', 'generalizing', 'the', 'ising', 'model', 'in', 'magnetic', 'fields', 'and', 'calculating', 'the', 'partition', 'function', 'exact', 'solution', 'for', 'the', 'ising', 'model', 'of', 'an', 'arbitrary', 'shape', 'specifically', 'the', 'partition', 'function', 'is', 'calculated', 'using', 'matrices', 'that', 'are', 'created', 'automatically', 'based', 'on', 'the', 'structure', 'of', 'the', 'system', 'by', 'generalizing', 'this', 'method', 'it', 'becomes', 'possible', 'to', 'calculate', 'the', 'partition', 'function', 'of', 'various', 'crystal', 'systems', 'network', 'shapes', 'in', 'magnetic', 'fields', 'when', 'n', 'scale', 'is', 'infinite', 'furthermore', 'we', 'also', 'connect', 'this', 'method', 'for', 'finding', 'the', 'solution', 'to', 'the', 'ising', 'model', 'in', 'magnetic', 'fields', 'to', 'a', 'method', 'for', 'finding', 'the', 'solution', 'to', 'bayesian', 'networks', 'in', 'information', 'statistical', 'mechanics', 'applied', 'to', 'data', 'mining', 'machine', 'learning', 'and', 'combinatorial', 'optimization']] | [-0.08062238382158934, 0.054591469661188184, -0.09802003125826429, 0.09509467080767665, -0.06444299851344633, -0.1346943067474058, 0.014915749702985133, 0.3819376898297508, -0.2935837368381077, -0.3349858846423948, 0.05952224142051169, -0.24787149489358334, -0.18475983782263938, 0.17750301889983738, 0.020423733346563364, 0.08933611409988121, 0.01676873958370249, 0.04201900616629116, -0.07275813233348215, -0.2271151705291621, 0.32548899286692695, 0.018999837763008794, 0.32972716470248997, 0.039779909824054424, 0.10716929380370337, 0.05208365785282305, 0.04150826931332371, 0.04274028394866036, -0.12048198282959025, 0.13838070960316276, 0.2287622711217929, 0.14730203429020808, 0.24541989536165992, -0.40586946585348677, -0.20059887332562149, 0.13682210992556065, 0.15306244236541847, 0.16431042196096055, -0.029870658236697118, -0.2455635551429753, 0.09691620754269284, -0.1517301008238324, -0.11612009928129348, -0.11868535311077721, 0.0022619282140762414, 0.00532091487964083, -0.3259396473362618, 0.03964220633263592, 0.03155450737748262, 0.05420755827591555, -0.11678081101958274, -0.0911856169373745, 0.028027469788087598, 0.10834098908864169, 0.03965122518898819, 0.08144735700313634, 0.11479879750238199, -0.17542183622468396, -0.13582674177035056, 0.34243143325771336, -0.008305701111177248, -0.26143739650225534, 0.11484645664001748, -0.08855599281793859, -0.17302785493250536, 0.10198192093438203, 0.191396389226741, 0.14043241156780692, -0.16466070704869448, 0.09584364397181032, -0.04428624195445861, 0.12983717992028687, -0.005436350820153686, -0.059525804520360125, 0.18646862219611648, 0.1754871122102486, 0.04962150557964508, 0.22741143440777836, -0.06989802430484815, -0.1325055212785498, -0.2425329086441447, -0.13977340640745492, -0.252263337340472, 0.01727064765457596, -0.1315208628820983, -0.2358487559415932, 0.41408147423395086, 0.21852293535734393, 0.185151063005573, 0.08200076827571527, 0.286540650421687, 0.11890784934179724, 0.07122933914901555, 0.07470607882506945, 0.17398151923719393, 0.15926509727432858, 0.09187911928581473, -0.19983327741751314, 0.026921019922675832, 0.12612556850737228] |
1,802.01962 | Crystals as a Source of Gamma Quanta | Conditions for the appearance of a nuclear exciton in a crystal consisting of
excited and unexcited nuclei of a given type are determined. The total
probabilities for spontaneous -emission by a single excited nucleus or by an
arbitrary number of excited nuclei in the crystal are derived. It is shown that
the formation of a nuclear exciton is connected with an increase of the width
of the emitting level and with the concentration of the radiation in a narrow
solid angle.
| cond-mat.other quant-ph | conditions for the appearance of a nuclear exciton in a crystal consisting of excited and unexcited nuclei of a given type are determined the total probabilities for spontaneous emission by a single excited nucleus or by an arbitrary number of excited nuclei in the crystal are derived it is shown that the formation of a nuclear exciton is connected with an increase of the width of the emitting level and with the concentration of the radiation in a narrow solid angle | [['conditions', 'for', 'the', 'appearance', 'of', 'a', 'nuclear', 'exciton', 'in', 'a', 'crystal', 'consisting', 'of', 'excited', 'and', 'unexcited', 'nuclei', 'of', 'a', 'given', 'type', 'are', 'determined', 'the', 'total', 'probabilities', 'for', 'spontaneous', 'emission', 'by', 'a', 'single', 'excited', 'nucleus', 'or', 'by', 'an', 'arbitrary', 'number', 'of', 'excited', 'nuclei', 'in', 'the', 'crystal', 'are', 'derived', 'it', 'is', 'shown', 'that', 'the', 'formation', 'of', 'a', 'nuclear', 'exciton', 'is', 'connected', 'with', 'an', 'increase', 'of', 'the', 'width', 'of', 'the', 'emitting', 'level', 'and', 'with', 'the', 'concentration', 'of', 'the', 'radiation', 'in', 'a', 'narrow', 'solid', 'angle']] | [-0.08547011812154295, 0.22826177069527834, -0.016433157904604156, 0.03023980617419713, 0.03657980372749821, -0.0815580456322174, 0.05230254052137887, 0.390330814514999, -0.21225787044997202, -0.2951305244623879, 0.02507306710259276, -0.2696227832800812, -0.003574066171652557, 0.16284231107716482, 0.05245186577056661, -0.029891517139787292, -0.008597184590604386, 0.06645325156227674, -0.041824868589892615, -0.13476301418088468, 0.3369924866444903, 0.047131580898515234, 0.24173193620402872, 0.08637128937797245, 0.09505205072554541, -0.006750807114359405, 0.04562707465532937, -0.003999237982947149, -0.1000194349790597, 0.1491582920619597, 0.21525333826372653, 0.04276532340485079, 0.24098705273282564, -0.40261455657489503, -0.19586554198111925, 0.07283368042129794, 0.13867316413440822, 0.14814410949079895, -0.09998742466717729, -0.3022624308726302, 0.03544313458288893, -0.16070656669556083, -0.19219847796139894, 0.031103817504589206, 0.0579107913510575, 0.06334972287884649, -0.26773759672119296, 0.0727856568618459, 0.028557836128410275, 0.017669428875784814, -0.1085871269374534, -0.08631495055153299, -0.07632943647511212, 0.08393650647701213, 0.01698618032107199, 0.022801505938175214, 0.1958768046748491, -0.1638235053985822, -0.09309196512410302, 0.38848918737889626, -0.041862690142919254, -0.1331144130661549, 0.1269759030317037, -0.16920875696994273, -0.07531310723128694, 0.27039007543597693, 0.11963773258806516, 0.1470906130026704, -0.0904627063392121, 0.016787674724998206, -0.0628244585507078, 0.218633634371706, 0.06123018553365528, 0.0820104150549957, 0.2267409874080324, 0.1986878480716252, 0.008112846028611616, 0.15677548934602076, -0.15353492606017324, -0.060162089535115676, -0.2926465208975621, -0.14594592696435196, -0.1929607290464143, 0.07188013701895136, -0.022813826776037775, -0.15723232023617725, 0.4106861885499071, -0.04952099979107762, 0.22072455720447096, -0.03847490083196281, 0.23624433643747994, 0.12526359601682166, 0.05248384876751605, 0.033908814594241575, 0.2945029667440664, 0.19408924852923296, 0.009397505909020517, -0.3085008343267772, 0.07975554735296303, 0.001570654193652265] |
1,802.01963 | Derivation of Van der Waal's equation of state in microcanonical
ensemble formulation | The Van der Waal's equation of state for a (slightly) non-ideal classical gas
is usually derived in the context of classical statistical mechanics by using
the canonical ensemble. We use the hard sphere potential with no short range
interaction and derive Van der Waal's equation of state in microcanonical
ensemble formulation.
| physics.gen-ph | the van der waals equation of state for a slightly nonideal classical gas is usually derived in the context of classical statistical mechanics by using the canonical ensemble we use the hard sphere potential with no short range interaction and derive van der waals equation of state in microcanonical ensemble formulation | [['the', 'van', 'der', 'waals', 'equation', 'of', 'state', 'for', 'a', 'slightly', 'nonideal', 'classical', 'gas', 'is', 'usually', 'derived', 'in', 'the', 'context', 'of', 'classical', 'statistical', 'mechanics', 'by', 'using', 'the', 'canonical', 'ensemble', 'we', 'use', 'the', 'hard', 'sphere', 'potential', 'with', 'no', 'short', 'range', 'interaction', 'and', 'derive', 'van', 'der', 'waals', 'equation', 'of', 'state', 'in', 'microcanonical', 'ensemble', 'formulation']] | [-0.08645875793174092, 0.07865850316981475, -0.1115424361299066, 0.06892067710092913, 0.0010517247605557536, -0.1710367239920386, 0.004203264948491957, 0.26022182894395846, -0.2510538520268621, -0.2954721141825704, -0.0833399227509896, -0.307976942125927, -0.1729495024911183, 0.19333602404495812, 0.012859232468055743, 0.10078959503010207, 0.0707032324714294, -0.04184301131788422, -0.10282485780543556, -0.228071702689882, 0.36393106399177044, 0.08279143767340072, 0.23955964463233365, 0.02030835313466834, 0.09746864925631706, 0.11731982976198196, 0.09796077900511377, 0.048817461379347185, -0.23293278628375894, 0.10681791335125179, 0.2186434653498616, -0.0508140677440108, 0.3213359774912105, -0.45525034111650553, -0.2585384983605906, 0.06339607119341106, 0.08009083839315995, 0.1905252541616267, 0.007735066499341936, -0.27883561583710653, -0.035705500396765205, -0.2761662483544034, -0.11228165232380122, -0.08341565452443034, 0.0036879763847180442, 0.10348112665701147, -0.14611357255090102, 0.21137401716801904, 0.0914148357514219, 0.008140385278738012, -0.10356880032329582, -0.13398580685915315, 0.06360083511647056, 0.04317990627468509, -0.10780699670260005, -0.015611362593321531, 0.18647733649385034, -0.15821014916268633, 0.016558801618349904, 0.43294083224792107, -0.07032210266619336, -0.15661699147712366, 0.22188568122082336, -0.03529965341565948, -0.08095441465539967, 0.0964964627123931, 0.01922834306663158, 0.02111113149964926, -0.1922607189592193, 0.1553803888667722, 0.029087269715234346, 0.19351653725493187, 0.12996693165498038, -0.027098396713114984, 0.23002214310348362, 0.07202641759067774, -0.001842491000014193, 0.15004041230342552, -0.04972316668021912, -0.24378937124913813, -0.24869529756845213, -0.19974012524985216, -0.27596074602037085, 0.13578627621024555, -0.08922227227337905, -0.2670417548723373, 0.2553456084181865, 0.08806996594192278, 0.11733776491646673, 0.03381557063217841, 0.2622241016166906, 0.13377747303970597, -0.06482580523280536, 0.021808540681377053, 0.32944374815469574, 0.18490200300299214, 0.11924249697111401, -0.220504593743267, -0.016527472228250083, 0.18056847370576626] |
1,802.01964 | Synthesis of nanocrystalline d-MoN by thermal annealing of amorphous
thin films grown on (100) Si by reactive DC sputtering at room temperature | We report on the synthesis and characterization of nanocrystalline delta-MoN
by crystallization of amorphous thin films grown on (100) Si by reactive
sputtering at room temperature. Films with chemical composition MoN were grown
using a deposition pressure of 5mTorr with a reactive mixture of
Ar/(Ar+N2)=0.5. The as-grown films display mostly amorphous structure.
Nanocrystalline delta-MoN phase is obtained after annealing at temperatures
above 600 {\deg}C. The superconducting critical temperature Tc depends on film
thickness. Thick films (170 nm) annealed at 700 {\deg}C for 30 min display a Tc
= 11.2 K (close to the one reported for bulk specimens: 13 K), which is
gradually suppressed to 7.2 K for 40 nm thick delta-MoN films. Our results
provide a simple method to synthesize superconducting nitride thin films on
silicon wafers with Tc above the ones observed for conventional superconductors
such as Nb.
| cond-mat.mtrl-sci | we report on the synthesis and characterization of nanocrystalline deltamon by crystallization of amorphous thin films grown on 100 si by reactive sputtering at room temperature films with chemical composition mon were grown using a deposition pressure of 5mtorr with a reactive mixture of ararn205 the asgrown films display mostly amorphous structure nanocrystalline deltamon phase is obtained after annealing at temperatures above 600 degc the superconducting critical temperature tc depends on film thickness thick films 170 nm annealed at 700 degc for 30 min display a tc 112 k close to the one reported for bulk specimens 13 k which is gradually suppressed to 72 k for 40 nm thick deltamon films our results provide a simple method to synthesize superconducting nitride thin films on silicon wafers with tc above the ones observed for conventional superconductors such as nb | [['we', 'report', 'on', 'the', 'synthesis', 'and', 'characterization', 'of', 'nanocrystalline', 'deltamon', 'by', 'crystallization', 'of', 'amorphous', 'thin', 'films', 'grown', 'on', '100', 'si', 'by', 'reactive', 'sputtering', 'at', 'room', 'temperature', 'films', 'with', 'chemical', 'composition', 'mon', 'were', 'grown', 'using', 'a', 'deposition', 'pressure', 'of', '5mtorr', 'with', 'a', 'reactive', 'mixture', 'of', 'ararn205', 'the', 'asgrown', 'films', 'display', 'mostly', 'amorphous', 'structure', 'nanocrystalline', 'deltamon', 'phase', 'is', 'obtained', 'after', 'annealing', 'at', 'temperatures', 'above', '600', 'degc', 'the', 'superconducting', 'critical', 'temperature', 'tc', 'depends', 'on', 'film', 'thickness', 'thick', 'films', '170', 'nm', 'annealed', 'at', '700', 'degc', 'for', '30', 'min', 'display', 'a', 'tc', '112', 'k', 'close', 'to', 'the', 'one', 'reported', 'for', 'bulk', 'specimens', '13', 'k', 'which', 'is', 'gradually', 'suppressed', 'to', '72', 'k', 'for', '40', 'nm', 'thick', 'deltamon', 'films', 'our', 'results', 'provide', 'a', 'simple', 'method', 'to', 'synthesize', 'superconducting', 'nitride', 'thin', 'films', 'on', 'silicon', 'wafers', 'with', 'tc', 'above', 'the', 'ones', 'observed', 'for', 'conventional', 'superconductors', 'such', 'as', 'nb']] | [-0.03789915193388932, 0.2687724065987298, -0.00513271757666647, -0.14423334216325115, 0.04289218145137707, -0.1981954772312561, 0.1535624649960303, 0.4915556379587111, -0.21229766649245047, -0.3586583009710277, 0.03884814838355366, -0.34862574158630666, 0.037054830004739824, 0.21756690039374207, 0.04121762418411638, 0.05473732880663371, -0.08952660630898972, -0.1490908402944898, -0.13300212301708159, -0.2591559222209383, 0.22165204873512478, 0.055074203592881454, 0.3662279425392838, 0.08232050169306895, 0.022045031118539782, -0.11100005173127772, 0.19561655824514526, -0.016755929505656453, -0.24706784275149668, -0.02522833541589687, 0.28115142276680544, -0.1663286206720356, 0.14044373488413972, -0.4473212657183626, -0.25813396159817814, -0.08118831879547696, 0.05999999588532169, 0.05257824359411318, -0.10316302284707118, -0.19290932826697826, 0.17147128248628038, -0.02932008339540802, -0.0766751197945109, -0.009131963487143499, -0.024102405447811975, -0.08277591219321437, -0.22373953438448943, 0.06439108713563994, 0.06190433509539078, 0.22121839852745298, -0.1039037752699406, -0.2425509325042112, -0.1231234472765023, -0.08456776316964278, -0.03521825930266811, 0.04812491431077738, 0.3357109937640111, -0.02062209579332249, -0.022010089468421673, 0.29790574687458304, -0.0783671813160453, 0.09877333256082922, 0.19374072100341755, -0.1509945729108405, -0.016315013268812947, 0.2797664404221314, 0.08566109146531943, 0.17359470427427168, -0.15959666109258092, 0.032495302525026054, 0.03806688207249245, 0.2923112441207806, 0.19282444808496177, 0.01018851305048804, 0.1899419859711108, 0.311207833162842, -0.04589664211401539, 0.18194350338265652, -0.13523185702829357, 0.04851568312499754, -0.14374413965592828, -0.2210148752082384, -0.15400654322936805, 0.12027309787711196, -0.15577481835254173, -0.22105285340332065, 0.3172380544829869, 0.11396406409432636, 0.1834887838616532, -0.022380117835973247, 0.18519181432542356, -0.01314527049565511, 0.10772871118494357, 0.025580658653859785, 0.2578034741994347, 0.20783174094186593, 0.20769438960264017, -0.18312161059601464, 0.15099338371898083, -0.05773636024533669] |
1,802.01965 | Hydrodynamic Limit for an Anharmonic Chain under Boundary Tension | We study the hydrodynamic limit for the isothermal dynamics of an anharmonic
chain under hyperbolic space-time scaling under varying tension. The
temperature is kept constant by a contact with a heat bath, realised via a
stochastic momentum-preserving noise added to the dynamics. The noise is
designed to be large at the microscopic level, but vanishing in the macroscopic
scale. Boundary conditions are also considered: one end of the chain is kept
fixed, while a time-varying tension is applied to the other end. We show that
the volume stretch and momentum converge (in an appropriate sense) to a weak
solution of a system of hyperbolic conservation laws (isothermal Euler
equations in Lagrangian coordinates) with boundary conditions. This result
includes the shock regime of the system. This is proven by adapting the theory
of compensated compactness to a stochastic setting, as developed by J. Fritz in
\cite{Fritz1} for thesame model without boundary conditions. Finally, changing
the external tension allows us to define thermodynamic isothermal
transformations between equilibrium states. We use this to deduce the first and
the second principle of Thermodynamics for our model.
| math.PR | we study the hydrodynamic limit for the isothermal dynamics of an anharmonic chain under hyperbolic spacetime scaling under varying tension the temperature is kept constant by a contact with a heat bath realised via a stochastic momentumpreserving noise added to the dynamics the noise is designed to be large at the microscopic level but vanishing in the macroscopic scale boundary conditions are also considered one end of the chain is kept fixed while a timevarying tension is applied to the other end we show that the volume stretch and momentum converge in an appropriate sense to a weak solution of a system of hyperbolic conservation laws isothermal euler equations in lagrangian coordinates with boundary conditions this result includes the shock regime of the system this is proven by adapting the theory of compensated compactness to a stochastic setting as developed by j fritz in citefritz1 for thesame model without boundary conditions finally changing the external tension allows us to define thermodynamic isothermal transformations between equilibrium states we use this to deduce the first and the second principle of thermodynamics for our model | [['we', 'study', 'the', 'hydrodynamic', 'limit', 'for', 'the', 'isothermal', 'dynamics', 'of', 'an', 'anharmonic', 'chain', 'under', 'hyperbolic', 'spacetime', 'scaling', 'under', 'varying', 'tension', 'the', 'temperature', 'is', 'kept', 'constant', 'by', 'a', 'contact', 'with', 'a', 'heat', 'bath', 'realised', 'via', 'a', 'stochastic', 'momentumpreserving', 'noise', 'added', 'to', 'the', 'dynamics', 'the', 'noise', 'is', 'designed', 'to', 'be', 'large', 'at', 'the', 'microscopic', 'level', 'but', 'vanishing', 'in', 'the', 'macroscopic', 'scale', 'boundary', 'conditions', 'are', 'also', 'considered', 'one', 'end', 'of', 'the', 'chain', 'is', 'kept', 'fixed', 'while', 'a', 'timevarying', 'tension', 'is', 'applied', 'to', 'the', 'other', 'end', 'we', 'show', 'that', 'the', 'volume', 'stretch', 'and', 'momentum', 'converge', 'in', 'an', 'appropriate', 'sense', 'to', 'a', 'weak', 'solution', 'of', 'a', 'system', 'of', 'hyperbolic', 'conservation', 'laws', 'isothermal', 'euler', 'equations', 'in', 'lagrangian', 'coordinates', 'with', 'boundary', 'conditions', 'this', 'result', 'includes', 'the', 'shock', 'regime', 'of', 'the', 'system', 'this', 'is', 'proven', 'by', 'adapting', 'the', 'theory', 'of', 'compensated', 'compactness', 'to', 'a', 'stochastic', 'setting', 'as', 'developed', 'by', 'j', 'fritz', 'in', 'citefritz1', 'for', 'thesame', 'model', 'without', 'boundary', 'conditions', 'finally', 'changing', 'the', 'external', 'tension', 'allows', 'us', 'to', 'define', 'thermodynamic', 'isothermal', 'transformations', 'between', 'equilibrium', 'states', 'we', 'use', 'this', 'to', 'deduce', 'the', 'first', 'and', 'the', 'second', 'principle', 'of', 'thermodynamics', 'for', 'our', 'model']] | [-0.1596216913750035, 0.14195899744225454, -0.1000693473753967, 0.0528743105325642, -0.054829972731824245, -0.1571401889109212, 0.04422152849642344, 0.30103516010619, -0.2869719650843361, -0.2735127886572019, 0.10386955513855577, -0.23756099940486347, -0.08752628022840875, 0.15675089410789186, -0.05658122706638639, 0.07041699420506371, 0.024661175115548526, 0.028273103568311884, -0.06222172544060599, -0.1990921920826607, 0.34543310271997973, 0.06589595272169751, 0.26755883372777906, 0.043261339395945037, 0.14098328853267866, -0.02854655010275831, 0.024936601769137944, 0.07245569770322155, -0.17058583051732448, 0.05225337092547281, 0.1922550006886656, 0.001534369370246625, 0.24711830989401068, -0.43272361078541416, -0.2418148375067407, 0.08581519235460633, 0.08587356267827537, 0.12707740442894236, -0.007289415485391558, -0.25926893218085995, 0.051800026717847884, -0.1337444163673655, -0.20946246151200068, -0.0769058083395026, -0.01211000858029114, 0.019251041292812347, -0.2714757098924389, 0.09154296395332213, 0.09025050778307267, 0.03678549892006658, -0.09209237341770327, -0.027470874311968436, -0.03334048937347548, 0.11460364700516285, 0.0575503196351189, 0.012357959765149794, 0.15147958658198254, -0.10091938751039625, -0.025018515073673708, 0.37326984665773355, -0.12116194216859943, -0.2714208282622925, 0.1951647010929008, -0.11963599070505296, -0.1297720458451144, 0.12291443084870872, 0.12502608717115626, 0.10437345241829342, -0.19881776067330528, 0.11131028831455321, 6.490077460647782e-05, 0.14620503160114612, 0.07929766993424263, -0.0638178189038119, 0.17193933153391214, 0.14851806696133885, 0.11033638786731638, 0.1801136153456189, -0.041985685920383965, -0.13722195736909523, -0.3390161068029496, -0.1472198986885709, -0.1690068710183735, 0.08754580684819192, -0.1020181416789551, -0.16689620196088656, 0.3115317545321806, 0.1527156606069043, 0.18189568702357908, 0.07394734715260771, 0.2698340163507, 0.1572191597673867, 0.020184735108928455, 0.0888255555105514, 0.24181413439550123, 0.16575582273232425, 0.13299996326728955, -0.2515716662359339, 0.03668751489391643, 0.10043526193363726] |
1,802.01966 | Strong Electric Field in 2D Graphene: The Integer Quantum Hall regime
from a different (many-body) perspective | We investigate the emerging consequences of an applied strong in-plane
electric field on a macroscopically large graphene sheet subjected to a
perpendicular magnetic field, by determining in exact analytical form various
many-body thermodynamic properties and the Hall coefficient. The results
suggest exotic possibilities that necessitate very careful experimental
investigation. In this alternate form of Quantum Hall Effect, non-linear
phenomena related to the global magnetization, energy and Hall conductivity
(the latter depending on the strengths of magnetic B- and electric E-fields)
emerge without using perturbation methods, to all orders of E-field and B-field
strengths. Interestingly enough, when the value of the electric field is
sufficiently strong, fractional quantization also emerges, whose topological
stability has to be verified.
| physics.gen-ph | we investigate the emerging consequences of an applied strong inplane electric field on a macroscopically large graphene sheet subjected to a perpendicular magnetic field by determining in exact analytical form various manybody thermodynamic properties and the hall coefficient the results suggest exotic possibilities that necessitate very careful experimental investigation in this alternate form of quantum hall effect nonlinear phenomena related to the global magnetization energy and hall conductivity the latter depending on the strengths of magnetic b and electric efields emerge without using perturbation methods to all orders of efield and bfield strengths interestingly enough when the value of the electric field is sufficiently strong fractional quantization also emerges whose topological stability has to be verified | [['we', 'investigate', 'the', 'emerging', 'consequences', 'of', 'an', 'applied', 'strong', 'inplane', 'electric', 'field', 'on', 'a', 'macroscopically', 'large', 'graphene', 'sheet', 'subjected', 'to', 'a', 'perpendicular', 'magnetic', 'field', 'by', 'determining', 'in', 'exact', 'analytical', 'form', 'various', 'manybody', 'thermodynamic', 'properties', 'and', 'the', 'hall', 'coefficient', 'the', 'results', 'suggest', 'exotic', 'possibilities', 'that', 'necessitate', 'very', 'careful', 'experimental', 'investigation', 'in', 'this', 'alternate', 'form', 'of', 'quantum', 'hall', 'effect', 'nonlinear', 'phenomena', 'related', 'to', 'the', 'global', 'magnetization', 'energy', 'and', 'hall', 'conductivity', 'the', 'latter', 'depending', 'on', 'the', 'strengths', 'of', 'magnetic', 'b', 'and', 'electric', 'efields', 'emerge', 'without', 'using', 'perturbation', 'methods', 'to', 'all', 'orders', 'of', 'efield', 'and', 'bfield', 'strengths', 'interestingly', 'enough', 'when', 'the', 'value', 'of', 'the', 'electric', 'field', 'is', 'sufficiently', 'strong', 'fractional', 'quantization', 'also', 'emerges', 'whose', 'topological', 'stability', 'has', 'to', 'be', 'verified']] | [-0.2036483730309932, 0.18690334109638132, -0.042986569328008796, 0.02486781919864809, -0.08525272517802258, -0.13357191597882273, 0.028718565449174813, 0.3543500860607059, -0.2693250181458505, -0.2937351358925988, 0.03553884390717501, -0.20263226703612197, -0.1479449542721027, 0.22428149216133972, 0.04173664559192698, 0.026535207293285377, -0.02040502213718543, -3.60274751638544e-05, -0.06045122803710722, -0.19152172873045542, 0.2902022209650724, 0.008595814995652321, 0.33395680859042653, 0.11026114303666841, 0.05204760382586191, -0.007654850730463734, 0.07954995214521628, 0.1333251504452321, -0.14772980548031198, 0.051755320604444995, 0.19151041982896178, -0.08125612192289454, 0.222392478305445, -0.4928544099715635, -0.1665816225978578, 0.04135633752970346, 0.10249810503868001, 0.1655461773886506, -0.06999263217359589, -0.3002362011225316, 0.07011160463574423, -0.13012216100268514, -0.15467649469842557, -0.15497941075792088, 0.040180476204741036, 0.0005507416830494486, -0.27473688480476366, 0.07706548045324121, 0.053519519609961146, 0.09790058269422373, -0.12053430171940348, -0.12387068133704879, -0.03562401674370731, 0.07806406919929752, 0.11909577168387778, 0.04845210481916779, 0.1830488416679396, -0.2000743601499286, -0.12180454133817091, 0.3479562023582322, -0.061488347477279603, -0.16552404057362985, 0.16094620894753084, -0.18192580713617518, -0.08306820196067465, 0.14555411984349184, 0.1225286100525409, 0.07793816960625478, -0.10180618962263467, 0.11925753936420419, 0.004942106711276774, 0.12691390242604217, 0.039458142448987425, 0.07666615071979448, 0.2703094423571923, 0.10427023635691449, 0.07054582240204488, 0.15944258342416764, -0.10099639153912872, -0.07484061855035995, -0.2682771444208278, -0.14361991813097247, -0.17716383258912488, 0.1517007897993357, -0.0978838343635916, -0.2110956793978152, 0.4068023485476793, 0.19872726243519193, 0.16872059667266198, -0.07842506702330991, 0.27817868636037896, 0.16820008858861724, 0.053988337057646656, 0.03619426174454616, 0.2920535047907896, 0.2349584266113856, 0.13031734538200343, -0.31196702445520025, 0.04096623847927448, 0.02337146385829767] |
1,802.01967 | A Note On Conformal Vector Fields Of $(\alpha,\beta)$-Spaces | In this paper, we characterize conformal vector fields of any (regular or
singular) $(\alpha,\beta)$-space with some PDEs. Further, we show some
properties of conformal vector fields of a class of singular
$(\alpha,\beta)$-spaces satisfying certain geometric conditions.
| math.DG | in this paper we characterize conformal vector fields of any regular or singular alphabetaspace with some pdes further we show some properties of conformal vector fields of a class of singular alphabetaspaces satisfying certain geometric conditions | [['in', 'this', 'paper', 'we', 'characterize', 'conformal', 'vector', 'fields', 'of', 'any', 'regular', 'or', 'singular', 'alphabetaspace', 'with', 'some', 'pdes', 'further', 'we', 'show', 'some', 'properties', 'of', 'conformal', 'vector', 'fields', 'of', 'a', 'class', 'of', 'singular', 'alphabetaspaces', 'satisfying', 'certain', 'geometric', 'conditions']] | [-0.21080260708307227, 0.1450321454451316, -0.04890616610646248, 0.021496852662595402, -0.1661211258874068, -0.1321988298635309, -0.07357324043793294, 0.34438498090538716, -0.28289201897051597, -0.13072229276359495, 0.13962901151131113, -0.20219319976038402, -0.24300216384775317, 0.1611960565399689, -0.09643602347932756, 0.10595150444553131, 0.022050990360892482, 0.13129255084398514, -0.18415718634302417, -0.2806048920998971, 0.47373911779787803, -0.10059131097255482, 0.19819894484761688, 0.035953466563821875, 0.14125580511366329, -0.0008979962892933852, -0.0007238410827186373, 0.07812523239085244, -0.1985024888223658, 0.12625816778745502, 0.23288158606737852, 0.10800031722626752, 0.25489950449102455, -0.3893988130407201, -0.22565515846427944, 0.20763698551389906, 0.05514243875061058, 0.07314094836409721, -0.03873719725136956, -0.2758486589623822, 0.17388516266105902, -0.059957269630912274, -0.22998131004472575, -0.11191050237458613, -0.065306134444351, 0.06394076375808153, -0.2884865548047755, 0.023146601937090356, 0.1548970594497708, 0.13179241485583285, -0.12962201519662309, -0.0574770650645304, -0.025974139648800094, 0.00806002121599805, 0.04450759384781122, 0.0010268913788927926, 0.07047468767915335, -0.18259740065938482, -0.10193301551043987, 0.3304785205077173, -0.06361925777875715, -0.29564919862120104, 0.160495155542675, -0.16710436703740722, -0.20812506950460374, 0.06441770606519033, 0.17744227079674602, 0.17248844603697458, -0.1316607042422725, 0.1887719312734488, -0.08902830775413248, 0.027814411868651707, 0.1211705081578758, 0.07737599711658226, 0.1537725440511066, 0.015259594979902936, 0.10382482800115314, 0.1735248510570576, 0.005180794461112883, -0.04337908850154943, -0.40953197586350143, -0.19985764970382056, -0.09273106630684601, 0.14883471514460528, -0.17861893822232056, -0.2603628013489975, 0.4244144257778923, 0.13853439482611268, 0.2219319529314008, 0.09659147000638768, 0.15519074324725401, 0.1071970568348964, 0.029305398878124025, 0.08521007311840852, 0.16263466192079554, 0.19346909338815343, 0.05513934837007481, -0.10658838405571361, -0.0763210683233208, 0.11285442902913524] |
1,802.01968 | Gradient forms and strong solidity of free quantum groups | Consider the free orthogonal quantum groups $O_N^+(F)$ and free unitary
quantum groups $U_N^+(F)$ with $N \geq 3$. In the case $F = {\rm id}_N$ it was
proved both by Isono and Fima-Vergnioux that the associated finite von Neumann
algebra $L_\infty(O_N^+)$ is strongly solid. Moreover, Isono obtains strong
solidity also for $L_\infty(U_N^+)$ . In this paper we prove for general $F \in
GL_N(\mathbb{C})$ that the von Neumann algebras $L_\infty(O_N^+(F))$ and
$L_\infty(U_N^+(F))$ are strongly solid. A crucial part in our proof is the
study of coarse properties of gradient bimodules associated with Dirichlet
forms on these algebras and constructions of derivations due to
Cipriani--Sauvageot.
| math.OA math.QA | consider the free orthogonal quantum groups o_nf and free unitary quantum groups u_nf with n geq 3 in the case f rm id_n it was proved both by isono and fimavergnioux that the associated finite von neumann algebra l_inftyo_n is strongly solid moreover isono obtains strong solidity also for l_inftyu_n in this paper we prove for general f in gl_nmathbbc that the von neumann algebras l_inftyo_nf and l_inftyu_nf are strongly solid a crucial part in our proof is the study of coarse properties of gradient bimodules associated with dirichlet forms on these algebras and constructions of derivations due to ciprianisauvageot | [['consider', 'the', 'free', 'orthogonal', 'quantum', 'groups', 'o_nf', 'and', 'free', 'unitary', 'quantum', 'groups', 'u_nf', 'with', 'n', 'geq', '3', 'in', 'the', 'case', 'f', 'rm', 'id_n', 'it', 'was', 'proved', 'both', 'by', 'isono', 'and', 'fimavergnioux', 'that', 'the', 'associated', 'finite', 'von', 'neumann', 'algebra', 'l_inftyo_n', 'is', 'strongly', 'solid', 'moreover', 'isono', 'obtains', 'strong', 'solidity', 'also', 'for', 'l_inftyu_n', 'in', 'this', 'paper', 'we', 'prove', 'for', 'general', 'f', 'in', 'gl_nmathbbc', 'that', 'the', 'von', 'neumann', 'algebras', 'l_inftyo_nf', 'and', 'l_inftyu_nf', 'are', 'strongly', 'solid', 'a', 'crucial', 'part', 'in', 'our', 'proof', 'is', 'the', 'study', 'of', 'coarse', 'properties', 'of', 'gradient', 'bimodules', 'associated', 'with', 'dirichlet', 'forms', 'on', 'these', 'algebras', 'and', 'constructions', 'of', 'derivations', 'due', 'to', 'ciprianisauvageot']] | [-0.12924017885359385, 0.14787411082896493, -0.06111795713584269, 0.011654491142009294, -0.03693108194537701, -0.1642948374582795, -0.054808530632296314, 0.34086889056088304, -0.2927850633058497, -0.17138030466132909, 0.12888830343902272, -0.2601079067155238, -0.12917605234980983, 0.21864812651909488, -0.12381256244555917, -0.0028060928728151067, 0.08125587268272459, 0.1058788367507038, -0.11166839592499278, -0.25745194646159325, 0.39773376306058256, -0.006714931075831735, 0.24818071533214822, 0.06441302271559834, 0.0627691478027852, 0.023677177667137114, -0.025206052147412814, 0.0049593757177072186, -0.17833271821518304, 0.12414044806713699, 0.28463072692274405, 0.038729266916972496, 0.26556239849937857, -0.3894998483880553, -0.14240621686011792, 0.1382322695146325, 0.10896919827447624, 0.026080951054570495, -0.02542829820861219, -0.26495426510440645, 0.10955105061262285, -0.19667696586299327, -0.10766544870992181, -0.06662705208184899, 0.06635875342994609, -0.01023464097255861, -0.25133733953642207, 0.09623181866700961, 0.13570476595752984, 0.0990327272804514, -0.09555810440071327, -0.09680770521217416, -0.03584219650765981, 0.06744654651390769, -0.06035722447784558, 0.0023063078888201265, 0.0722561394257511, -0.08450217662449246, -0.10090741957788185, 0.3577979076653719, -0.017843153167475936, -0.22114813638230166, 0.19781708085824365, -0.18636525310676105, -0.157985770979756, 0.0330496808784383, 0.055412553210732754, 0.12674269441174724, -0.0525225984553496, 0.2048508378662049, -0.10690009913417281, 0.09509914693853228, 0.07354155949427076, -0.008186908450693654, 0.0963016512918897, 0.03962275969685726, 0.10157290343395485, 0.16228953623262946, 0.057526418209446456, -0.06179824423405432, -0.34338980744923314, -0.21827890010931159, -0.13595038684966262, 0.10820837528069294, -0.08616728789200606, -0.18431589229192624, 0.3221091585564277, 0.0781755070402337, 0.13736908863328637, 0.09891238723511017, 0.18967786315147595, 0.1025141582896893, 0.056004733493131016, 0.0807357533304121, 0.12614533467398537, 0.2612002961342573, 0.009861730579887667, -0.20694752434088337, -0.0009973455841342609, 0.1731137960663526] |
1,802.01969 | The heavy windlass: Buckling and coiling of an elastic rod inside a
liquid drop in the presence of gravity | A liquid drop sitting on an elastic rod may act as a winch, or windlass, and
pull the rod inside itself and coil it. This windlass effect has been shown to
be generated by surface tension forces and to work best for small systems. Here
we study the case where the drop is large enough so that its weight interferes
with surface tension and modifies the windlass mechanics.
| cond-mat.soft | a liquid drop sitting on an elastic rod may act as a winch or windlass and pull the rod inside itself and coil it this windlass effect has been shown to be generated by surface tension forces and to work best for small systems here we study the case where the drop is large enough so that its weight interferes with surface tension and modifies the windlass mechanics | [['a', 'liquid', 'drop', 'sitting', 'on', 'an', 'elastic', 'rod', 'may', 'act', 'as', 'a', 'winch', 'or', 'windlass', 'and', 'pull', 'the', 'rod', 'inside', 'itself', 'and', 'coil', 'it', 'this', 'windlass', 'effect', 'has', 'been', 'shown', 'to', 'be', 'generated', 'by', 'surface', 'tension', 'forces', 'and', 'to', 'work', 'best', 'for', 'small', 'systems', 'here', 'we', 'study', 'the', 'case', 'where', 'the', 'drop', 'is', 'large', 'enough', 'so', 'that', 'its', 'weight', 'interferes', 'with', 'surface', 'tension', 'and', 'modifies', 'the', 'windlass', 'mechanics']] | [-0.09548846750540714, 0.19219942754738012, -0.08772160648368299, -0.018956282371244228, -0.11167811607147622, -0.1654072140192832, 0.03759470753207365, 0.3540527848800754, -0.27544804020812186, -0.28190594130907864, 0.09781979997505379, -0.3000996382907033, -0.17042975741616614, 0.16714840978452497, -0.07379495869527626, 0.014261306605048422, 0.031381680657539296, 0.051960346247891295, 0.005137649529120501, -0.1777588584295967, 0.2838974759335328, 0.11038113416939535, 0.2949958460864282, 0.12771245067500892, 0.11898154644158614, -0.0015172248172080692, 0.07356688158367486, 0.1130953116397209, -0.134558890505051, 0.04192037900964565, 0.16135040772667922, -0.017411323219729477, 0.21617507992093177, -0.4819454322569072, -0.21831957376835978, 0.10074387355159749, 0.11708065733546391, 0.14424810070982752, -0.027257012889843762, -0.23665513662169413, 0.06007817364297807, -0.18285431764910326, -0.14285557206911856, -0.025492585414801452, 0.06585305711076431, 0.004539645608661778, -0.20259287123404005, 0.02008577505373122, 0.08606372457956347, 0.007496225503821145, -0.06643630997175076, -0.0632737912100685, -0.044494753528852016, 0.12402063007261056, 0.09027583737213932, 0.10782484076437815, 0.24099621082217815, -0.14039318616543076, -0.0019579570267952103, 0.38614862335517125, -0.05770597633604398, -0.23317182028104605, 0.20286717877024785, -0.12223101994844482, -0.05027554634109359, 0.12022512154105831, 0.16513208327951895, 0.07216362118625137, -0.09336240971734856, 0.068568441499819, -0.031319400742444596, 0.19132937157444438, 0.12024522211183519, -0.08723172565292128, 0.24798242657390587, 0.19644113068523653, 0.06465750557425268, 0.15261336357627228, -0.11110142847482006, -0.02974127311608754, -0.2783861170139383, -0.17184904872385018, -0.16301722730071666, 0.028328472282737494, 0.011429683630601229, -0.17851600032907514, 0.2866888662033221, 0.045551908026134375, 0.22026508409694276, 0.013737570753351868, 0.2751129189341822, 0.07102618290296317, 0.12132366808980484, 0.03975911667871782, 0.2927947582074386, 0.09834481491227909, 0.0508084857959629, -0.22896069995648063, 0.07511586631410276, 0.00442561911254683] |
1,802.0197 | A Deep Reinforcement Learning Based Approach for Cost- and Energy-Aware
Multi-Flow Mobile Data Offloading | With the rapid increase in demand for mobile data, mobile network operators
are trying to expand wireless network capacity by deploying wireless local area
network (LAN) hotspots on to which they can offload their mobile traffic.
However, these network-centric methods usually do not fulfill the interests of
mobile users (MUs). Taking into consideration many issues such as different
applications' deadlines, monetary cost and energy consumption, how the MU
decides whether to offload their traffic to a complementary wireless LAN is an
important issue. Previous studies assume the MU's mobility pattern is known in
advance, which is not always true. In this paper, we study the MU's policy to
minimize his monetary cost and energy consumption without known MU mobility
pattern. We propose to use a kind of reinforcement learning technique called
deep Q-network (DQN) for MU to learn the optimal offloading policy from past
experiences. In the proposed DQN based offloading algorithm, MU's mobility
pattern is no longer needed. Furthermore, MU's state of remaining data is
directly fed into the convolution neural network in DQN without discretization.
Therefore, not only does the discretization error present in previous work
disappear, but also it makes the proposed algorithm has the ability to
generalize the past experiences, which is especially effective when the number
of states is large. Extensive simulations are conducted to validate our
proposed offloading algorithms.
| cs.NI | with the rapid increase in demand for mobile data mobile network operators are trying to expand wireless network capacity by deploying wireless local area network lan hotspots on to which they can offload their mobile traffic however these networkcentric methods usually do not fulfill the interests of mobile users mus taking into consideration many issues such as different applications deadlines monetary cost and energy consumption how the mu decides whether to offload their traffic to a complementary wireless lan is an important issue previous studies assume the mus mobility pattern is known in advance which is not always true in this paper we study the mus policy to minimize his monetary cost and energy consumption without known mu mobility pattern we propose to use a kind of reinforcement learning technique called deep qnetwork dqn for mu to learn the optimal offloading policy from past experiences in the proposed dqn based offloading algorithm mus mobility pattern is no longer needed furthermore mus state of remaining data is directly fed into the convolution neural network in dqn without discretization therefore not only does the discretization error present in previous work disappear but also it makes the proposed algorithm has the ability to generalize the past experiences which is especially effective when the number of states is large extensive simulations are conducted to validate our proposed offloading algorithms | [['with', 'the', 'rapid', 'increase', 'in', 'demand', 'for', 'mobile', 'data', 'mobile', 'network', 'operators', 'are', 'trying', 'to', 'expand', 'wireless', 'network', 'capacity', 'by', 'deploying', 'wireless', 'local', 'area', 'network', 'lan', 'hotspots', 'on', 'to', 'which', 'they', 'can', 'offload', 'their', 'mobile', 'traffic', 'however', 'these', 'networkcentric', 'methods', 'usually', 'do', 'not', 'fulfill', 'the', 'interests', 'of', 'mobile', 'users', 'mus', 'taking', 'into', 'consideration', 'many', 'issues', 'such', 'as', 'different', 'applications', 'deadlines', 'monetary', 'cost', 'and', 'energy', 'consumption', 'how', 'the', 'mu', 'decides', 'whether', 'to', 'offload', 'their', 'traffic', 'to', 'a', 'complementary', 'wireless', 'lan', 'is', 'an', 'important', 'issue', 'previous', 'studies', 'assume', 'the', 'mus', 'mobility', 'pattern', 'is', 'known', 'in', 'advance', 'which', 'is', 'not', 'always', 'true', 'in', 'this', 'paper', 'we', 'study', 'the', 'mus', 'policy', 'to', 'minimize', 'his', 'monetary', 'cost', 'and', 'energy', 'consumption', 'without', 'known', 'mu', 'mobility', 'pattern', 'we', 'propose', 'to', 'use', 'a', 'kind', 'of', 'reinforcement', 'learning', 'technique', 'called', 'deep', 'qnetwork', 'dqn', 'for', 'mu', 'to', 'learn', 'the', 'optimal', 'offloading', 'policy', 'from', 'past', 'experiences', 'in', 'the', 'proposed', 'dqn', 'based', 'offloading', 'algorithm', 'mus', 'mobility', 'pattern', 'is', 'no', 'longer', 'needed', 'furthermore', 'mus', 'state', 'of', 'remaining', 'data', 'is', 'directly', 'fed', 'into', 'the', 'convolution', 'neural', 'network', 'in', 'dqn', 'without', 'discretization', 'therefore', 'not', 'only', 'does', 'the', 'discretization', 'error', 'present', 'in', 'previous', 'work', 'disappear', 'but', 'also', 'it', 'makes', 'the', 'proposed', 'algorithm', 'has', 'the', 'ability', 'to', 'generalize', 'the', 'past', 'experiences', 'which', 'is', 'especially', 'effective', 'when', 'the', 'number', 'of', 'states', 'is', 'large', 'extensive', 'simulations', 'are', 'conducted', 'to', 'validate', 'our', 'proposed', 'offloading', 'algorithms']] | [-0.14606748000097772, 0.033991503100906914, -0.043938679173588756, 0.03928887224394, -0.13877235875568456, -0.21040022699783245, 0.1436623582052481, 0.45096138934294383, -0.27869840809027663, -0.32478324630608163, 0.09014933956890471, -0.2652658299717586, -0.16219389824507138, 0.15293139833646516, -0.1737095574889746, 0.08700828732508752, 0.09090724060906925, 0.06642031336358438, -0.011776473502525024, -0.3017153276730743, 0.2542320619057864, 0.0994271153194778, 0.36903177135934434, 0.06645851341593596, 0.0408098026830703, -0.0216783318709996, -0.02153340118005872, -0.03345344279789263, -0.06325632718495197, 0.1162440804234292, 0.33505479770402113, 0.1897977831111186, 0.3766979457024071, -0.49240501693967315, -0.24791003501767087, 0.1385896693283899, 0.16526822359197668, 0.036185295584404635, -0.022111456902801162, -0.28658975169476536, 0.1455899940012023, -0.22418397461788522, -0.041455942702919454, -0.0745103819337156, -0.0024233479901320403, 0.026747586634010077, -0.2957775774805082, -0.02037467208561591, -0.002980285459715459, -0.002559095099568367, -0.052192887507586015, -0.08175490328214234, 0.014192423504880734, 0.19953244863297895, 0.08965834515479704, 0.026705042024453483, 0.16685504384338856, -0.12749198593095773, -0.1358597730514076, 0.3622926989528868, 0.02188961835578084, -0.17994682877738444, 0.17434901900485986, -0.049729309963683285, -0.11311837115014593, 0.12959725864128105, 0.23460746789299367, 0.09068570640765958, -0.19197435619911024, 0.03885998471898751, -0.003002023987679018, 0.16505984149666297, 0.03437319764194803, 0.04911022986544089, 0.14512396990011137, 0.22830035354114242, 0.12795013726663051, 0.07247488964762952, -0.08128378855167992, -0.13405995232260062, -0.1739785501278109, -0.1264085331155608, -0.2151768883690238, 0.04725502960506775, -0.05114506270827001, -0.0691670772555517, 0.3515704082987375, 0.19902540758717804, 0.16033470256047117, 0.11878459166890631, 0.37698548928213615, 0.08096484447105064, 0.1306698186012606, 0.16059764361836845, 0.1665482057310227, 0.0006846962491464284, 0.2278585322490997, -0.21204643498330067, 0.09397102183972796, 0.009819385336918963] |
1,802.01971 | Supersymmetric dynamics and zeta-functions | Boson, fermion, and super oscillators and (statistical) mechanism of
cosmological constant; finite approximation of the zeta-function and fermion
factorization of the bosonic statistical sum considered.
| physics.gen-ph hep-th | boson fermion and super oscillators and statistical mechanism of cosmological constant finite approximation of the zetafunction and fermion factorization of the bosonic statistical sum considered | [['boson', 'fermion', 'and', 'super', 'oscillators', 'and', 'statistical', 'mechanism', 'of', 'cosmological', 'constant', 'finite', 'approximation', 'of', 'the', 'zetafunction', 'and', 'fermion', 'factorization', 'of', 'the', 'bosonic', 'statistical', 'sum', 'considered']] | [-0.17188050761818885, 0.2526654323190451, -0.09119031094014644, 0.1567744369804859, -0.07831523761153221, -0.22546107679605484, 0.11985855132341384, 0.25881375759840014, -0.21591428250074388, -0.20281344622373582, 0.004013810753822327, -0.24483133636415005, -0.07327975258231163, 0.052816478423774245, 0.11100983299314976, 0.1615800043940544, 0.004731578454375267, 0.06707789614796639, -0.08978898741304875, -0.31854504004120826, 0.350202419757843, 0.003085494078695774, 0.27664125245064497, 0.06671243995428085, 0.1703795076161623, 0.02157224331051111, -0.05198807999491692, -0.09155319318175316, -0.09187041357159614, 0.05811092860996723, 0.20871698101982475, 0.017012500148266555, 0.1949967509228736, -0.3317738413438201, -0.20477396581321955, 0.138257614672184, 0.22292218662798405, 0.04332821413874626, -0.0018550901487469672, -0.24308133469894527, 0.06867895513772965, -0.2592864352092147, -0.09798760920763015, -0.09896922952495515, -0.07647420650348068, -0.04918153502047062, -0.2813483116682619, 0.14710377829149365, 0.01047869235277176, 0.07834366977214813, -0.030075340857729317, -0.22163117971271276, 0.056708098351955415, 0.0009988290071487427, 0.15099597930908204, -0.03379919301718473, 0.11916378140449524, -0.1932128694653511, -0.13916460275650025, 0.4452666339278221, -0.15479156255722046, -0.21722048357129098, 0.14012603476643562, -0.16501498728990555, -0.12973591586574912, 0.042211273461580275, 0.09387436099350452, 0.0883220037817955, -0.14735059659928085, 0.23304743706481532, -0.05335685059428215, 0.09207529626786709, 0.08217134524136782, 0.07392893388867378, 0.26198668450117113, 0.10268367018550634, -0.0066696592420339585, 0.08670717980712653, -0.017628280576318503, -0.2108893549442291, -0.3849303871393204, -0.15619578391313552, -0.2247282786667347, 0.10598604634404182, -0.21424686678976287, -0.2687777601927519, 0.37425889760255815, 0.07389663070440293, 0.09720277775079011, 0.06332962326705456, 0.2533517493493855, 0.18655777163803577, 0.03574420289136469, 0.002632740791887045, 0.19464561593718827, 0.3070905676484108, 0.03673999547958374, -0.3085870701353997, -0.1359861292131245, 0.21025910820811988] |
1,802.01972 | What makes a theory of infinitesimals useful? A view by Klein and
Fraenkel | Felix Klein and Abraham Fraenkel each formulated a criterion for a theory of
infinitesimals to be successful, in terms of the feasibility of implementation
of the Mean Value Theorem. We explore the evolution of the idea over the past
century, and the role of Abraham Robinson's framework therein.
| math.HO math.CA math.LO | felix klein and abraham fraenkel each formulated a criterion for a theory of infinitesimals to be successful in terms of the feasibility of implementation of the mean value theorem we explore the evolution of the idea over the past century and the role of abraham robinsons framework therein | [['felix', 'klein', 'and', 'abraham', 'fraenkel', 'each', 'formulated', 'a', 'criterion', 'for', 'a', 'theory', 'of', 'infinitesimals', 'to', 'be', 'successful', 'in', 'terms', 'of', 'the', 'feasibility', 'of', 'implementation', 'of', 'the', 'mean', 'value', 'theorem', 'we', 'explore', 'the', 'evolution', 'of', 'the', 'idea', 'over', 'the', 'past', 'century', 'and', 'the', 'role', 'of', 'abraham', 'robinsons', 'framework', 'therein']] | [-0.1052938075736165, 0.00641856630439482, -0.13463197332263613, 0.06505771346079807, -0.0918478809374695, -0.03791999787790701, 0.05593184555133727, 0.2564310837769881, -0.23621043182599047, -0.33038986659206176, 0.0679101952482597, -0.1986657101660967, -0.18051878359013548, 0.19469638529699296, -0.10121051307457189, 0.021268978576131303, -0.008550112989420692, 0.021637742252399523, -0.04195415952320521, -0.3227590393313828, 0.3098564870597329, 0.0950573030228649, 0.2842494328894342, 0.0988285714192898, 0.1504157313803868, 0.10803131966774042, -0.08121977190603502, 0.017236196125547092, -0.12151261139661074, 0.14037392870523036, 0.23885331551233926, 0.1962943316126863, 0.3805866433152308, -0.41327246837317944, -0.16596335692641637, 0.061165730333110936, 0.05823805677937344, 0.07547066711898272, 0.0009336916652197639, -0.27804039081092924, 0.07528943006764166, -0.19273921977825617, -0.18819444960293671, -0.022191758383996785, 0.06118682348945489, -0.03579986415570602, -0.16223768851098916, 0.08967855658071737, 0.1039426502538845, 0.06934748024286819, -0.07201026865125944, -0.08738392544910312, 0.01748112872398148, 0.0905842363620953, 0.05487836117390543, 0.025758145765090983, 0.07408636755765959, -0.13952322389620045, -0.18103670404525474, 0.3827696131969181, -0.049782625787581004, -0.16681362261685231, 0.0870361789711751, -0.08797025622334331, -0.06200992867040137, 0.035459892397436, 0.12715331996635845, 0.14426152217977992, -0.12022159230158043, 0.1241371043700686, -0.0898655461690699, 0.024956640622500952, 0.1289129581224794, -0.0034234055565320887, 0.20124592455492044, 0.12669396540150046, -0.012390522189283123, 0.060062899814511184, 0.01258815200223277, -0.1567617531400174, -0.34853585173065466, -0.27443141393208254, -0.16742732220639786, 0.0446486364089651, -0.049314506969797854, -0.14571219640007863, 0.4048821337443466, 0.14053476384530464, 0.14234199456404895, 0.019719073451900233, 0.2788502097052212, 0.12913956143893301, 0.03546873947683101, 0.05087498730669419, 0.2591508239856921, 0.2182333353557624, 0.13777621605307408, -0.19126360631586672, 0.043279315442002066, 0.19145674015938616] |
1,802.01973 | Shorted operators and minus order | Let $\mathcal{H}$ be a Hilbert space, $L(\mathcal{H})$ the algebra of bounded
linear operators on $\mathcal{H}$ and $W \in L(\mathcal{H})$ a positive
operator. Given a closed subspace $\mathcal{S}$ of $\mathcal{H}$, we
characterize the shorted operator $W_{/ \mathcal{S}}$ of $W$ to $\mathcal{S}$
as the maximum and as the infimum of certain sets, for the minus order
$\stackrel{-}{\leq}.$ Also, given $A \in L(\mathcal{H})$ with closed range, we
study the following operator approximation problem considering the minus order:
$$ min_{\stackrel{-}{\leq}} \ \{(AX-I)^*W(AX-I) : X \in L(\mathcal{H}), \mbox{
subject to } N(A^*W)\subseteq N(X) \}. $$
We show that, under certain conditions, the shorted operator $W_{/R(A)}$ (of
$W$ to the range of $A$) is the minimum of this problem and we characterize the
set of solutions.
| math.FA | let mathcalh be a hilbert space lmathcalh the algebra of bounded linear operators on mathcalh and w in lmathcalh a positive operator given a closed subspace mathcals of mathcalh we characterize the shorted operator w_ mathcals of w to mathcals as the maximum and as the infimum of certain sets for the minus order stackrelleq also given a in lmathcalh with closed range we study the following operator approximation problem considering the minus order min_stackrelleq axiwaxi x in lmathcalh mbox subject to nawsubseteq nx we show that under certain conditions the shorted operator w_ra of w to the range of a is the minimum of this problem and we characterize the set of solutions | [['let', 'mathcalh', 'be', 'a', 'hilbert', 'space', 'lmathcalh', 'the', 'algebra', 'of', 'bounded', 'linear', 'operators', 'on', 'mathcalh', 'and', 'w', 'in', 'lmathcalh', 'a', 'positive', 'operator', 'given', 'a', 'closed', 'subspace', 'mathcals', 'of', 'mathcalh', 'we', 'characterize', 'the', 'shorted', 'operator', 'w_', 'mathcals', 'of', 'w', 'to', 'mathcals', 'as', 'the', 'maximum', 'and', 'as', 'the', 'infimum', 'of', 'certain', 'sets', 'for', 'the', 'minus', 'order', 'stackrelleq', 'also', 'given', 'a', 'in', 'lmathcalh', 'with', 'closed', 'range', 'we', 'study', 'the', 'following', 'operator', 'approximation', 'problem', 'considering', 'the', 'minus', 'order', 'min_stackrelleq', 'axiwaxi', 'x', 'in', 'lmathcalh', 'mbox', 'subject', 'to', 'nawsubseteq', 'nx', 'we', 'show', 'that', 'under', 'certain', 'conditions', 'the', 'shorted', 'operator', 'w_ra', 'of', 'w', 'to', 'the', 'range', 'of', 'a', 'is', 'the', 'minimum', 'of', 'this', 'problem', 'and', 'we', 'characterize', 'the', 'set', 'of', 'solutions']] | [-0.1762199080633846, 0.11449504355815324, -0.006412995318797502, 0.016115118381143972, -0.03413832800632173, -0.0874312399505553, 0.0350276235321706, 0.318013482818126, -0.3570778495886109, -0.1771440205883912, 0.11460419848074459, -0.3214552093720572, -0.07152637338096446, 0.16112501436675136, -0.0867465845309198, 0.0583176048387858, 0.07179156007583845, 0.13061644760045138, -0.12485389937011694, -0.22269394721158525, 0.39084249631374735, -0.07094748592088845, 0.14524936857209964, 0.05659626519720239, 0.15732198824513366, 0.014696908979253336, 0.039581715061583304, 0.02164010015416848, -0.19274109450244312, 0.09146340274971655, 0.259554834545336, 0.14137045230547135, 0.3150244617665356, -0.3388235562226989, -0.13428425010801717, 0.25931177700615743, 0.11736525986661119, -0.07587575202977115, 0.04378228629833426, -0.267226957318119, 0.12093154292722995, -0.1490502059946514, -0.11231645489619536, -0.003602001807567748, 0.08076941707933491, -0.027814003226177938, -0.3603435443714261, 0.0062533214114161885, 0.08613564007153565, 0.025059755823828956, -0.09513537069697948, -0.1265500211918896, -0.07389334005684677, 0.05282373543701727, -0.04480345709122379, 0.09790155913532626, 0.03789063629863614, -0.04753722303165969, -0.07173425018448722, 0.36499611108817837, -0.11850126359601167, -0.26779141488739033, 0.05738908795809204, -0.23328031534329058, -0.07486935795485888, 0.05955318741669709, 0.1517219219293276, 0.17704003649679098, -0.09274526962333104, 0.24854637913416477, -0.1342538738707927, 0.05931257064962252, 0.08612051859328693, 0.06337141059339046, 0.07914546853016045, 0.09042074119682762, 0.16024470560739495, 0.17571908645226028, 0.014953650211629628, -0.00839017953469672, -0.42936258295720275, -0.1623904745433141, -0.1584752182687887, 0.1301516375504434, -0.10262316148688445, -0.19403040844269775, 0.41499188594435427, 0.07084076675501737, 0.250187309848314, 0.057123007132163776, 0.16504950616720387, 0.1902698376947559, 0.019559078479439697, 0.08231484478932213, 0.07613088163462552, 0.17554023852571846, 0.020394371564246037, -0.2113372360864146, 0.0004925060424615036, 0.14951873087702552] |
1,802.01974 | Classification of $A_{\mathfrak{q}}(\lambda)$ modules by their Dirac
cohomology for type $D$, $G_2$ and $\mathfrak{sp}(2n,\mathbb{R})$ | Let $G$ be a connected real reductive group with maximal compact subgroup $K$
of the same rank as $G$. In the recent paper of Huang, Pand\v{z}i\'{c} and
Vogan, it was shown that the admissible $\Theta$--stable parabolic subalgebras
$\mathfrak{q}$ of $\mathfrak{g}$ are in one-to-one correspodence with the faces
of $W \rho$ intersecting the $\mathfrak{k}$--dominant Weyl chamber and that
$A_{\mathfrak{q}}(0)$--modules can be classified by their Dirac cohomology in
geometric terms. They described in detail the cases when $\mathfrak{g}_0$ is of
type $A$, $B$, $F$ and $C$ except for $\mathfrak{g}_0 = \mathfrak{sp}(2n,
\mathbb{R})$. We will describe faces corresponding to
$A_{\mathfrak{q}}(0)$--modules for $\mathfrak{g}_0 = \mathfrak{sp}(2n,
\mathbb{R})$ and for $\mathfrak{g}_0$ of type $D$ and $G_2$.
| math.RT | let g be a connected real reductive group with maximal compact subgroup k of the same rank as g in the recent paper of huang pandvzic and vogan it was shown that the admissible thetastable parabolic subalgebras mathfrakq of mathfrakg are in onetoone correspodence with the faces of w rho intersecting the mathfrakkdominant weyl chamber and that a_mathfrakq0modules can be classified by their dirac cohomology in geometric terms they described in detail the cases when mathfrakg_0 is of type a b f and c except for mathfrakg_0 mathfraksp2n mathbbr we will describe faces corresponding to a_mathfrakq0modules for mathfrakg_0 mathfraksp2n mathbbr and for mathfrakg_0 of type d and g_2 | [['let', 'g', 'be', 'a', 'connected', 'real', 'reductive', 'group', 'with', 'maximal', 'compact', 'subgroup', 'k', 'of', 'the', 'same', 'rank', 'as', 'g', 'in', 'the', 'recent', 'paper', 'of', 'huang', 'pandvzic', 'and', 'vogan', 'it', 'was', 'shown', 'that', 'the', 'admissible', 'thetastable', 'parabolic', 'subalgebras', 'mathfrakq', 'of', 'mathfrakg', 'are', 'in', 'onetoone', 'correspodence', 'with', 'the', 'faces', 'of', 'w', 'rho', 'intersecting', 'the', 'mathfrakkdominant', 'weyl', 'chamber', 'and', 'that', 'a_mathfrakq0modules', 'can', 'be', 'classified', 'by', 'their', 'dirac', 'cohomology', 'in', 'geometric', 'terms', 'they', 'described', 'in', 'detail', 'the', 'cases', 'when', 'mathfrakg_0', 'is', 'of', 'type', 'a', 'b', 'f', 'and', 'c', 'except', 'for', 'mathfrakg_0', 'mathfraksp2n', 'mathbbr', 'we', 'will', 'describe', 'faces', 'corresponding', 'to', 'a_mathfrakq0modules', 'for', 'mathfrakg_0', 'mathfraksp2n', 'mathbbr', 'and', 'for', 'mathfrakg_0', 'of', 'type', 'd', 'and', 'g_2']] | [-0.17970294110329213, 0.10529928472085605, -0.026282489872895755, -0.029905215021034773, -0.11377740698830727, -0.18689394146741295, -0.021473360703496907, 0.3807856968890589, -0.27603528355337825, -0.18947163043328777, 0.10071671733525224, -0.2536907681787852, -0.11753281391485451, 0.187723238630077, -0.15406570945364925, -0.05284389761240723, 0.041448853130882174, 0.15027825108084542, -0.07605519152331489, -0.3028757724678144, 0.36495049301391613, -0.09739632443345797, 0.19114202971104532, 0.009182965115402252, 0.07075752449992041, -0.00920426440335667, 0.0019386668472389618, 0.018459466806636834, -0.12945866820364943, 0.08966840852428085, 0.3268210479022505, 0.060145754438753314, 0.17319185882717228, -0.3361433985589359, -0.11968073084090765, 0.2200795397377358, 0.16671021541025347, -0.06925513278334759, 0.01910083689010487, -0.3329582240504141, 0.15821709986798502, -0.18149656722268376, -0.18127513795535868, -0.04282988717134755, 0.15185571330389044, -0.006394523786954009, -0.2638596420337518, 0.03382610646972003, 0.07244918876005194, 0.08014993205702362, -0.028085956287283737, -0.15950417515481463, -0.12010424456988963, 0.07249721237642986, -0.05155579730322083, 0.08959852003765544, 0.054886289867751584, -0.08195380700411849, -0.10816963645181833, 0.42071315506920937, -0.05551589210965456, -0.20898685882387397, 0.13817907783847588, -0.19536159187107563, -0.12325564694429676, 0.07123174070819424, 0.08767641195131895, 0.15102207690702366, -0.04929178519593664, 0.23723930224073578, -0.13629202510660085, -0.030787897233564693, 0.08325711858252852, -0.04801456540679702, 0.11593352135297699, 0.06360722363863786, 0.04774624161543146, 0.07580762934790422, 0.03045053778287883, 0.07988764443031798, -0.38808316719503355, -0.18571290391264483, -0.1312173023582615, 0.14540754997198327, -0.08033201924920902, -0.13089542469774293, 0.4024462891348566, 0.0008007363537147355, 0.19681089606959945, 0.05900040447998505, 0.126397947082296, 0.06379851611675874, 0.060948293635402266, 0.09369205109760514, 0.09881164780997026, 0.2294947564301905, -0.05012420586605843, -0.1788655171269336, -0.035993345309039936, 0.17604062600115028] |
1,802.01975 | Domain walls and Dzyaloshinskii-Moriya interaction in epitaxial
Co/Ir(111) and Pt/Co/Ir(111) | We use spin-polarized scanning tunneling microscopy and density functional
theory (DFT) to study domain walls (DWs) and the Dzyaloshinskii-Moriya
interaction (DMI) in epitaxial films of Co/Ir(111) and Pt/Co/Ir(111). Our
measurements reveal DWs with fixed rotational sense on one monolayer of Co on
Ir, with a wall width around 2.7 nm. With Pt islands on top, we observe that
the DWs occur mostly in the uncovered Co/Ir areas, suggesting that the wall
energy density is higher in the Pt/Co/Ir(111). From DFT we find an interfacial
DMI that stabilizes N\'{e}el-type DWs with clockwise rotational sense. The
calculated DW widths are in good agreement with the experimental observations.
The total DMI nearly doubles from Co/Ir(111) to Pt/Co/Ir(111), however, in the
latter case the DMI is almost entirely due to the Pt with only a minor Ir
contribution. Therefore a simple additive effect, where both interfaces
contribute significantly to the total DMI, is not observed for one atomic Co
layer.
| cond-mat.mes-hall | we use spinpolarized scanning tunneling microscopy and density functional theory dft to study domain walls dws and the dzyaloshinskiimoriya interaction dmi in epitaxial films of coir111 and ptcoir111 our measurements reveal dws with fixed rotational sense on one monolayer of co on ir with a wall width around 27 nm with pt islands on top we observe that the dws occur mostly in the uncovered coir areas suggesting that the wall energy density is higher in the ptcoir111 from dft we find an interfacial dmi that stabilizes neeltype dws with clockwise rotational sense the calculated dw widths are in good agreement with the experimental observations the total dmi nearly doubles from coir111 to ptcoir111 however in the latter case the dmi is almost entirely due to the pt with only a minor ir contribution therefore a simple additive effect where both interfaces contribute significantly to the total dmi is not observed for one atomic co layer | [['we', 'use', 'spinpolarized', 'scanning', 'tunneling', 'microscopy', 'and', 'density', 'functional', 'theory', 'dft', 'to', 'study', 'domain', 'walls', 'dws', 'and', 'the', 'dzyaloshinskiimoriya', 'interaction', 'dmi', 'in', 'epitaxial', 'films', 'of', 'coir111', 'and', 'ptcoir111', 'our', 'measurements', 'reveal', 'dws', 'with', 'fixed', 'rotational', 'sense', 'on', 'one', 'monolayer', 'of', 'co', 'on', 'ir', 'with', 'a', 'wall', 'width', 'around', '27', 'nm', 'with', 'pt', 'islands', 'on', 'top', 'we', 'observe', 'that', 'the', 'dws', 'occur', 'mostly', 'in', 'the', 'uncovered', 'coir', 'areas', 'suggesting', 'that', 'the', 'wall', 'energy', 'density', 'is', 'higher', 'in', 'the', 'ptcoir111', 'from', 'dft', 'we', 'find', 'an', 'interfacial', 'dmi', 'that', 'stabilizes', 'neeltype', 'dws', 'with', 'clockwise', 'rotational', 'sense', 'the', 'calculated', 'dw', 'widths', 'are', 'in', 'good', 'agreement', 'with', 'the', 'experimental', 'observations', 'the', 'total', 'dmi', 'nearly', 'doubles', 'from', 'coir111', 'to', 'ptcoir111', 'however', 'in', 'the', 'latter', 'case', 'the', 'dmi', 'is', 'almost', 'entirely', 'due', 'to', 'the', 'pt', 'with', 'only', 'a', 'minor', 'ir', 'contribution', 'therefore', 'a', 'simple', 'additive', 'effect', 'where', 'both', 'interfaces', 'contribute', 'significantly', 'to', 'the', 'total', 'dmi', 'is', 'not', 'observed', 'for', 'one', 'atomic', 'co', 'layer']] | [-0.14661895357036067, 0.1351562932825552, -0.029865685684074248, 0.0028073734478335586, -0.0589340226588674, -0.09395670339725186, 0.06502228234206665, 0.4592706814722775, -0.25534151461846255, -0.31967914013748433, -0.0019013817647363168, -0.2973038157230461, -0.09514746759328749, 0.15783738038145828, 0.03502283925069617, -0.04517258188155081, 0.012225087367711806, -0.06332509233026656, -0.033216880889936025, -0.1982150361458858, 0.24937609551427584, -0.029478382282926666, 0.3102571732884684, 0.11714590983707215, 0.005423219390697293, -0.009377051097969828, 0.07052013970905455, 0.023880278628150172, -0.18850175106958236, 0.08436321814441691, 0.22961706131153933, -0.1544345475146668, 0.14713427647585411, -0.4923375397164665, -0.18179310422145772, -0.011389581023945243, 0.14633315088916812, 0.16048025451721504, -0.060876063548947694, -0.26893238791464164, 0.09713758952694933, -0.12202105169220791, -0.08383622940315248, -0.04006570831467337, 0.018499267278481033, -0.007554012507218383, -0.2387111442399441, 0.11660509632126272, 0.039799413317209716, 0.08997663375377268, -0.11465777002438274, -0.1331899946437568, -0.15787315855328865, 0.039282095951161215, 0.1003472664024584, 0.12239027528814947, 0.19318449683789793, -0.11985045808817973, -0.10817520030586703, 0.3425788233032474, -0.08392973316156051, -0.13757301472103248, 0.18873910624352466, -0.2099144726329447, -0.052064288398492836, 0.15467158926336408, 0.06396331291875572, 0.10778678083102908, -0.10004008972303724, 0.09920995243312489, -0.006493008063573923, 0.25892286118748903, 0.09814360943114893, 0.04001250938324722, 0.2324310083323243, 0.14985219741167574, 0.08628463287128728, 0.10905655842975943, -0.14665112429897167, -0.08858535619597736, -0.2141900297992125, -0.1374709677743399, -0.21863160683779506, 0.025933034638001118, -0.08823558845069311, -0.1773610590207209, 0.3321450733422459, 0.14057698487243675, 0.18007948518694414, -0.020728175735476053, 0.26010616841822765, 0.06867860021884553, 0.12106269764012427, 0.04113729540130136, 0.28598021957781405, 0.16286766852022377, 0.1564828251040988, -0.26114927298788515, 0.08274568917755909, -0.03150126757251413] |
1,802.01976 | Boundary representations of $\lambda$-harmonic and polyharmonic
functions on trees | On a countable tree $T$, allowing vertices with infinite degree, we consider
an arbitrary stochastic irreducible nearest neighbour transition operator $P$.
We provide a boundary integral representation for general eigenfunctions of $P$
with eigenvalue $\lambda \in \mathbb{C}$. This is possible whenever $\lambda$
is in the resolvent set of $P$ as a self-adjoint operator on a suitable
$\ell^2$-space and the on-diagonal elements of the resolvent ("Green function")
do not vanish at $\lambda$. We show that when $P$ is invariant under a
transitive (not necessarily fixed-point-free) group action, the latter
condition holds for all $\lambda \ne 0$ in the resolvent set. These results
extend and complete previous results by Cartier, by Fig\`a-Talamanca and
Steger, and by Woess. For those eigenvalues, we also provide an integral
representation of $\lambda$-polyharmonic functions of any order $n$, that is,
functions $f: T \to \mathbb{C}$ for which $(\lambda \cdot I - P)^n f=0$. This
is a far-reaching extension of work of Cohen et al., who provided such a
representation for simple random walk on a homogeneous tree and eigenvalue
$\lambda =1$. Finally, we explain the (much simpler) analogous results for
"forward only" transition operators, sometimes also called martingales on
trees.
| math.FA math.PR | on a countable tree t allowing vertices with infinite degree we consider an arbitrary stochastic irreducible nearest neighbour transition operator p we provide a boundary integral representation for general eigenfunctions of p with eigenvalue lambda in mathbbc this is possible whenever lambda is in the resolvent set of p as a selfadjoint operator on a suitable ell2space and the ondiagonal elements of the resolvent green function do not vanish at lambda we show that when p is invariant under a transitive not necessarily fixedpointfree group action the latter condition holds for all lambda ne 0 in the resolvent set these results extend and complete previous results by cartier by figatalamanca and steger and by woess for those eigenvalues we also provide an integral representation of lambdapolyharmonic functions of any order n that is functions f t to mathbbc for which lambda cdot i pn f0 this is a farreaching extension of work of cohen et al who provided such a representation for simple random walk on a homogeneous tree and eigenvalue lambda 1 finally we explain the much simpler analogous results for forward only transition operators sometimes also called martingales on trees | [['on', 'a', 'countable', 'tree', 't', 'allowing', 'vertices', 'with', 'infinite', 'degree', 'we', 'consider', 'an', 'arbitrary', 'stochastic', 'irreducible', 'nearest', 'neighbour', 'transition', 'operator', 'p', 'we', 'provide', 'a', 'boundary', 'integral', 'representation', 'for', 'general', 'eigenfunctions', 'of', 'p', 'with', 'eigenvalue', 'lambda', 'in', 'mathbbc', 'this', 'is', 'possible', 'whenever', 'lambda', 'is', 'in', 'the', 'resolvent', 'set', 'of', 'p', 'as', 'a', 'selfadjoint', 'operator', 'on', 'a', 'suitable', 'ell2space', 'and', 'the', 'ondiagonal', 'elements', 'of', 'the', 'resolvent', 'green', 'function', 'do', 'not', 'vanish', 'at', 'lambda', 'we', 'show', 'that', 'when', 'p', 'is', 'invariant', 'under', 'a', 'transitive', 'not', 'necessarily', 'fixedpointfree', 'group', 'action', 'the', 'latter', 'condition', 'holds', 'for', 'all', 'lambda', 'ne', '0', 'in', 'the', 'resolvent', 'set', 'these', 'results', 'extend', 'and', 'complete', 'previous', 'results', 'by', 'cartier', 'by', 'figatalamanca', 'and', 'steger', 'and', 'by', 'woess', 'for', 'those', 'eigenvalues', 'we', 'also', 'provide', 'an', 'integral', 'representation', 'of', 'lambdapolyharmonic', 'functions', 'of', 'any', 'order', 'n', 'that', 'is', 'functions', 'f', 't', 'to', 'mathbbc', 'for', 'which', 'lambda', 'cdot', 'i', 'pn', 'f0', 'this', 'is', 'a', 'farreaching', 'extension', 'of', 'work', 'of', 'cohen', 'et', 'al', 'who', 'provided', 'such', 'a', 'representation', 'for', 'simple', 'random', 'walk', 'on', 'a', 'homogeneous', 'tree', 'and', 'eigenvalue', 'lambda', '1', 'finally', 'we', 'explain', 'the', 'much', 'simpler', 'analogous', 'results', 'for', 'forward', 'only', 'transition', 'operators', 'sometimes', 'also', 'called', 'martingales', 'on', 'trees']] | [-0.13584473006623357, 0.11890883344657548, -0.07131996824111986, 0.065045732156202, -0.11855177631552674, -0.14602972355818278, 0.04106093734490538, 0.370903079388173, -0.25822189395610046, -0.1730989340962352, 0.055548407743366335, -0.29331097169534154, -0.14038625790026824, 0.1515249559199315, -0.05202577868721595, 0.0360722228786663, 0.0673104954417795, 0.11987981546553783, -0.03682160795892981, -0.22940131372061412, 0.35933496177588636, -0.015501176489909228, 0.15259514082541786, 0.04618553927162123, 0.08676929891501603, 0.03495317839490446, 0.012846866025479119, -0.009203493841127248, -0.18616369957583773, 0.07336916424131854, 0.2634703691485093, 0.09877889348978275, 0.2615201764102829, -0.3530629347568672, -0.14969679023580332, 0.19683848160417064, 0.1429869454248355, 0.017069188510925558, 0.006887268633459155, -0.27505826714546666, 0.12837188110907416, -0.1357353947928794, -0.16673836071583392, -0.06500127435919191, 0.1185764540844646, 0.011615359743959025, -0.3602478651685248, 0.027646884895358725, 0.15450367498652715, 0.06467861930447581, -0.030041270592176404, -0.17494794300230415, -0.010139906438263624, 0.047795534052573585, -0.05587117152325319, 0.06642537149478142, 0.04366881121440153, -0.053559434497238774, -0.10004265822813307, 0.32799711820583694, -0.09580867973517773, -0.24898765708908047, 0.1270867260320014, -0.18802094221127366, -0.17102551994551168, 0.09559666854819578, 0.0815817701262667, 0.17462800052752228, -0.08265493246887529, 0.23173875334813554, -0.10695366703378233, 0.09902700922255846, 0.1017444575891683, -0.003061913474352638, 0.07933882204662568, 0.06753391813315256, 0.12398485555681155, 0.09908176467288285, 0.04131747933447753, -0.026604627755985252, -0.36442524291280853, -0.15665653777112695, -0.19506037051277847, 0.11827838764247166, -0.13333328903957553, -0.18091259410506802, 0.35240672196898803, 0.10156428061891347, 0.22730454438071895, 0.13246023734774146, 0.19914881658348205, 0.15141991876191338, 0.0365807444960075, 0.09952162051708192, 0.10427795248106123, 0.15998546041940387, 0.02203307776944712, -0.16797786524862443, 0.021244852915161143, 0.16993284702399059] |
1,802.01977 | Roots of Polynomials and The Derangement Problem | We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest
results in probability which says that the probability that a random
permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends
to infinity. Our proof stems from the connection between permutations and
polynomials over finite fields and is based on an independence argument, which
is trivial in the polynomial world.
| math.NT math.PR | we present a new killingaflywithasledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on n elements has no fixed points tends to e1 as n tends to infinity our proof stems from the connection between permutations and polynomials over finite fields and is based on an independence argument which is trivial in the polynomial world | [['we', 'present', 'a', 'new', 'killingaflywithasledgehammer', 'proof', 'of', 'one', 'of', 'the', 'oldest', 'results', 'in', 'probability', 'which', 'says', 'that', 'the', 'probability', 'that', 'a', 'random', 'permutation', 'on', 'n', 'elements', 'has', 'no', 'fixed', 'points', 'tends', 'to', 'e1', 'as', 'n', 'tends', 'to', 'infinity', 'our', 'proof', 'stems', 'from', 'the', 'connection', 'between', 'permutations', 'and', 'polynomials', 'over', 'finite', 'fields', 'and', 'is', 'based', 'on', 'an', 'independence', 'argument', 'which', 'is', 'trivial', 'in', 'the', 'polynomial', 'world']] | [-0.14311654304037802, 0.13240720376984427, -0.13084922748384997, 0.01615580224824953, -0.071302938307781, -0.12226364946400281, 0.09439685764027672, 0.2857953979255399, -0.2399542812636355, -0.23205571814469295, 0.04982365135583677, -0.2938604820519686, -0.15443597411649534, 0.17815184201754164, -0.11637685216555838, -0.00690745422616601, 0.015659229626180604, 0.12022298068040982, -0.05537025976627774, -0.2735236650914885, 0.34176858755381545, -0.0019788110330409836, 0.2561873332160758, 0.03984099012450315, 0.11489835125121317, 0.007239262809889624, -0.022345167313687853, -0.02257079271657858, -0.08921602583109234, 0.06513589902897365, 0.24844742732238956, 0.14468992389447521, 0.28534640349971596, -0.3776371376006864, -0.10228566316072829, 0.1764951385121094, 0.1700489639551961, 0.09793666084806318, -0.02041698125322, -0.2419406875851564, 0.1452611264103325, -0.1058507223642664, -0.16445632114482578, -0.003880286487401463, 0.06847000267225667, 0.0292719648568891, -0.28750891202071216, -0.03257925893558422, 0.1405940595523134, 0.07415915584715549, 0.030482630878395867, -0.15476732401293702, 0.009743202394020045, 0.10991512475447962, 0.08810895971691934, 0.06631663764710538, 0.0387723150633974, -0.050225763574417215, -0.1533588317106478, 0.35829890496097505, -0.053810974954103585, -0.1930483330215793, 0.19746027692235657, -0.14976687108719489, -0.1582529565130244, 0.12040043336673989, 0.11272120621288195, 0.13367119073518552, -0.029531619540648535, 0.15744957498645817, -0.13742657212424092, 0.18273096173652448, 0.10916230009752326, -0.010278324380124104, 0.13834588977624662, 0.06861784397915471, 0.13796250531595433, 0.11739452147958218, -0.035879678987839725, -0.13108569945325144, -0.3551047421642579, -0.1722002869660173, -0.2735382554892567, 0.1255233380215941, -0.1697062597590957, -0.2055683886501356, 0.35915454203495756, 0.13097709768044297, 0.23111389293262619, 0.13802139422114124, 0.2586102296190802, 0.11004703812068328, 0.04655495074985083, 0.06373239509412088, 0.13674270124465693, 0.19902368045586627, 0.01806361402668699, -0.13286355710806674, 0.08927569631487131, 0.1472562523340457] |
1,802.01978 | A hierarchy of models for simulating experimental results from a 3D
heterogeneous porous medium | In this work we examine the dispersion of conservative tracers (bromide and
fluorescein) in an experimentally-constructed three-dimensional dual-porosity
porous medium. The medium is highly heterogeneous ($\sigma_Y^2=5.7$), and
consists of spherical, low-hydraulic-conductivity inclusions embedded in a
high-hydraulic-conductivity matrix. The bi-modal medium was saturated with
tracers, and then flushed with tracer-free fluid while the effluent
breakthrough curves were measured. The focus for this work is to examine a
hierarchy of four models (in the absence of adjustable parameters) with
decreasing complexity to assess their ability to accurately represent the
measured breakthrough curves. The most information-rich model was (1) a direct
numerical simulation of the system in which the geometry, boundary and initial
conditions, and medium properties were fully independently characterized
experimentally with high fidelity. The reduced models included; (2) a
simplified numerical model identical to the fully-resolved direct numerical
simulation (DNS) model, but using a domain that was one-tenth the size; (3) an
upscaled mobile-immobile model that allowed for a time-dependent mass-transfer
coefficient; and, (4) an upscaled mobile-immobile model that assumed a
space-time constant mass-transfer coefficient. The results illustrated that all
four models provided accurate representations of the experimental breakthrough
curves as measured by global RMS error. The primary component of error induced
in the upscaled models appeared to arise from the neglect of convection within
the inclusions. Interestingly, these results suggested that the conventional
convection-dispersion equation, when applied in a way that resolves the
heterogeneities, yields models with high fidelity without requiring the
imposition of a more complex non-Fickian model.
| physics.flu-dyn | in this work we examine the dispersion of conservative tracers bromide and fluorescein in an experimentallyconstructed threedimensional dualporosity porous medium the medium is highly heterogeneous sigma_y257 and consists of spherical lowhydraulicconductivity inclusions embedded in a highhydraulicconductivity matrix the bimodal medium was saturated with tracers and then flushed with tracerfree fluid while the effluent breakthrough curves were measured the focus for this work is to examine a hierarchy of four models in the absence of adjustable parameters with decreasing complexity to assess their ability to accurately represent the measured breakthrough curves the most informationrich model was 1 a direct numerical simulation of the system in which the geometry boundary and initial conditions and medium properties were fully independently characterized experimentally with high fidelity the reduced models included 2 a simplified numerical model identical to the fullyresolved direct numerical simulation dns model but using a domain that was onetenth the size 3 an upscaled mobileimmobile model that allowed for a timedependent masstransfer coefficient and 4 an upscaled mobileimmobile model that assumed a spacetime constant masstransfer coefficient the results illustrated that all four models provided accurate representations of the experimental breakthrough curves as measured by global rms error the primary component of error induced in the upscaled models appeared to arise from the neglect of convection within the inclusions interestingly these results suggested that the conventional convectiondispersion equation when applied in a way that resolves the heterogeneities yields models with high fidelity without requiring the imposition of a more complex nonfickian model | [['in', 'this', 'work', 'we', 'examine', 'the', 'dispersion', 'of', 'conservative', 'tracers', 'bromide', 'and', 'fluorescein', 'in', 'an', 'experimentallyconstructed', 'threedimensional', 'dualporosity', 'porous', 'medium', 'the', 'medium', 'is', 'highly', 'heterogeneous', 'sigma_y257', 'and', 'consists', 'of', 'spherical', 'lowhydraulicconductivity', 'inclusions', 'embedded', 'in', 'a', 'highhydraulicconductivity', 'matrix', 'the', 'bimodal', 'medium', 'was', 'saturated', 'with', 'tracers', 'and', 'then', 'flushed', 'with', 'tracerfree', 'fluid', 'while', 'the', 'effluent', 'breakthrough', 'curves', 'were', 'measured', 'the', 'focus', 'for', 'this', 'work', 'is', 'to', 'examine', 'a', 'hierarchy', 'of', 'four', 'models', 'in', 'the', 'absence', 'of', 'adjustable', 'parameters', 'with', 'decreasing', 'complexity', 'to', 'assess', 'their', 'ability', 'to', 'accurately', 'represent', 'the', 'measured', 'breakthrough', 'curves', 'the', 'most', 'informationrich', 'model', 'was', '1', 'a', 'direct', 'numerical', 'simulation', 'of', 'the', 'system', 'in', 'which', 'the', 'geometry', 'boundary', 'and', 'initial', 'conditions', 'and', 'medium', 'properties', 'were', 'fully', 'independently', 'characterized', 'experimentally', 'with', 'high', 'fidelity', 'the', 'reduced', 'models', 'included', '2', 'a', 'simplified', 'numerical', 'model', 'identical', 'to', 'the', 'fullyresolved', 'direct', 'numerical', 'simulation', 'dns', 'model', 'but', 'using', 'a', 'domain', 'that', 'was', 'onetenth', 'the', 'size', '3', 'an', 'upscaled', 'mobileimmobile', 'model', 'that', 'allowed', 'for', 'a', 'timedependent', 'masstransfer', 'coefficient', 'and', '4', 'an', 'upscaled', 'mobileimmobile', 'model', 'that', 'assumed', 'a', 'spacetime', 'constant', 'masstransfer', 'coefficient', 'the', 'results', 'illustrated', 'that', 'all', 'four', 'models', 'provided', 'accurate', 'representations', 'of', 'the', 'experimental', 'breakthrough', 'curves', 'as', 'measured', 'by', 'global', 'rms', 'error', 'the', 'primary', 'component', 'of', 'error', 'induced', 'in', 'the', 'upscaled', 'models', 'appeared', 'to', 'arise', 'from', 'the', 'neglect', 'of', 'convection', 'within', 'the', 'inclusions', 'interestingly', 'these', 'results', 'suggested', 'that', 'the', 'conventional', 'convectiondispersion', 'equation', 'when', 'applied', 'in', 'a', 'way', 'that', 'resolves', 'the', 'heterogeneities', 'yields', 'models', 'with', 'high', 'fidelity', 'without', 'requiring', 'the', 'imposition', 'of', 'a', 'more', 'complex', 'nonfickian', 'model']] | [-0.08967603062789259, 0.10199889096156205, -0.05972935602455994, 0.03588460954557721, -0.023054334988487968, -0.1259585177380239, -0.000578000168066947, 0.35403658215094497, -0.23914856569115225, -0.3289304067507202, 0.09029989161695365, -0.2627061210963645, -0.12038252019388562, 0.18737135763249432, -0.038164347798492634, 0.07464527982285192, 0.06714760802624893, -0.025509666166663048, -0.06257166975051348, -0.22613978243783622, 0.28058986843074, 0.06285867888318497, 0.2498871186099479, 0.01181531174648783, 0.10691904072810746, -0.04662146879682677, -0.04724811093782079, 0.05446339564765861, -0.14159211960668847, 0.10191225467744157, 0.19545067838584362, 0.048307766009183455, 0.21420917565715902, -0.44358107108055567, -0.2884918471947772, 0.07268862085754182, 0.1380943341732577, 0.10095384109951172, -0.052393008849246775, -0.2528862912263415, 0.07820005809846085, -0.17661752363325792, -0.16505652338691792, -0.030683730886061005, 0.013711417126210613, 0.0233860753949542, -0.27851224268322866, 0.12025190004791467, 0.037168450707209456, 0.03955997162260912, -0.09907002484621365, -0.10367121092003574, -0.041967127468329646, 0.1104381536973167, 0.015384533067919896, 0.007837325462941157, 0.11340867075877487, -0.15149428015967656, -0.056769113835338274, 0.38872962273128425, -0.09008387166244043, -0.21515165964609065, 0.21011856872657383, -0.14005366476145362, -0.07484904954539527, 0.15493160079007226, 0.1596760003953988, 0.10174860974578302, -0.15727605334505365, 0.02979069525508187, -0.049463749134533656, 0.2185680256335356, 0.03223254383779265, -0.034731400969587725, 0.15578008377387997, 0.19174742839852954, -0.012822096943165417, 0.11563208168123393, -0.07635445514269396, -0.09334380296633843, -0.2645450687503496, -0.12822950339569267, -0.156216708563341, 0.019788815425287303, -0.1202442754387478, -0.14777032699562426, 0.3598049001599597, 0.13475552994619916, 0.19721888731628534, 0.03140298946168458, 0.2928142939721054, 0.09530731552680993, 0.041442753451995155, 0.0704285446171162, 0.2549506714835824, 0.15575603392538556, 0.10081852993682609, -0.22116274187828072, 0.09917676397081879, 0.029450153884067826] |
1,802.01979 | Nonlinear Schrodinger equation and classical-field description of the
Lamb-Retherford experiment | I show that Lamb-Retherford experiment can be fully described within the
framework of classical field theory without using concepts such as the discrete
states of the atom and jump-like electron transitions between them. The rate of
stimulated decay of the metastable state of a hydrogen atom in an external
periodic electric field is determined. The dependence of this rate on the
frequency and amplitude of the external electric field, as well as on the
parameters of the atom, has been obtained. It is shown that the maximum value
of the stimulated decay rate of the metastable state of a hydrogen atom is
achieved at an external electric field frequency equal to the frequency shift
corresponding to either the fine structure of the hydrogen atom or the Lamb
shift.
| physics.gen-ph | i show that lambretherford experiment can be fully described within the framework of classical field theory without using concepts such as the discrete states of the atom and jumplike electron transitions between them the rate of stimulated decay of the metastable state of a hydrogen atom in an external periodic electric field is determined the dependence of this rate on the frequency and amplitude of the external electric field as well as on the parameters of the atom has been obtained it is shown that the maximum value of the stimulated decay rate of the metastable state of a hydrogen atom is achieved at an external electric field frequency equal to the frequency shift corresponding to either the fine structure of the hydrogen atom or the lamb shift | [['i', 'show', 'that', 'lambretherford', 'experiment', 'can', 'be', 'fully', 'described', 'within', 'the', 'framework', 'of', 'classical', 'field', 'theory', 'without', 'using', 'concepts', 'such', 'as', 'the', 'discrete', 'states', 'of', 'the', 'atom', 'and', 'jumplike', 'electron', 'transitions', 'between', 'them', 'the', 'rate', 'of', 'stimulated', 'decay', 'of', 'the', 'metastable', 'state', 'of', 'a', 'hydrogen', 'atom', 'in', 'an', 'external', 'periodic', 'electric', 'field', 'is', 'determined', 'the', 'dependence', 'of', 'this', 'rate', 'on', 'the', 'frequency', 'and', 'amplitude', 'of', 'the', 'external', 'electric', 'field', 'as', 'well', 'as', 'on', 'the', 'parameters', 'of', 'the', 'atom', 'has', 'been', 'obtained', 'it', 'is', 'shown', 'that', 'the', 'maximum', 'value', 'of', 'the', 'stimulated', 'decay', 'rate', 'of', 'the', 'metastable', 'state', 'of', 'a', 'hydrogen', 'atom', 'is', 'achieved', 'at', 'an', 'external', 'electric', 'field', 'frequency', 'equal', 'to', 'the', 'frequency', 'shift', 'corresponding', 'to', 'either', 'the', 'fine', 'structure', 'of', 'the', 'hydrogen', 'atom', 'or', 'the', 'lamb', 'shift']] | [-0.11383983387527474, 0.20319805769217714, -0.01734227294424974, 0.005217891263474864, 0.00668213976635121, -0.0846861316492473, 0.10144056223321882, 0.3818156310159156, -0.2865075299912316, -0.2898629147588737, 0.04796629122231068, -0.24935854791744252, -0.05408900809899618, 0.17354970757380186, 0.042377477520930136, 0.028247486040964137, -0.0022326118173444363, 0.11420107781007065, -0.01819568340424595, -0.161021710366128, 0.310667591671804, 0.09274574956585338, 0.2953424135399029, 0.06578879699653645, 0.09190662998310108, -0.01779857434068374, 0.05064611178712817, 0.00813931254963354, -0.07765068205526762, 0.08497993436625491, 0.1855040895624277, 0.07551323530249532, 0.23818389571447834, -0.457827248104562, -0.2035929251198224, 0.08778180253112644, 0.1138963630454116, 0.1756613015483214, -0.05289302878338462, -0.3121984307690868, 0.004494020880353967, -0.15207203023509658, -0.15568665401757087, -0.03671942869069304, 0.054394082910579254, 0.05525651097473666, -0.2870254866457104, 0.0649242412012921, 0.041736049772841545, 0.06133029213923169, -0.10807059587558776, -0.08974506625700301, -0.036791419241885386, 0.0998770429470437, 0.05847424581302257, 0.06865405484916658, 0.1903910426290955, -0.1400345738878195, -0.1087099568199689, 0.3695159882424385, -0.14613489717919761, -0.12272794739463308, 0.13150673948492356, -0.15512021498270626, -0.023349700143604768, 0.16326292481009416, 0.09936439580702054, 0.10175081927651965, -0.09200355048450884, 0.0995629658019303, 0.007985374717936507, 0.21632099893002762, 0.11240699479363742, 0.05278111500005553, 0.20102402195334435, 0.13345710882242387, 0.050869145947618516, 0.12597531595681685, -0.11259148267256353, -0.09377086481563454, -0.27353250047587974, -0.15430622236568511, -0.2111346264201121, 0.07510659249690105, -0.02528241329884164, -0.1686409390795019, 0.39671919952095375, 0.07675399904562835, 0.18914880365221284, -0.07627252017800498, 0.29205603075881054, 0.2128671517744147, 0.04499794009662285, -0.004003579607306737, 0.3073985474422486, 0.17693407509996606, 0.0804793799193356, -0.31451847886402656, 0.044456194734244836, 0.01607173636526339] |
1,802.0198 | Layered structure and leveled function of a human brain | The anatomically layered structure of a human brain results in leveled
functions. In all these levels of different functions, comparison, feedback and
imitation are the universal and crucial mechanisms. Languages, symbols and
tools play key roles in the development of human brain and entire civilization.
| q-bio.NC physics.bio-ph | the anatomically layered structure of a human brain results in leveled functions in all these levels of different functions comparison feedback and imitation are the universal and crucial mechanisms languages symbols and tools play key roles in the development of human brain and entire civilization | [['the', 'anatomically', 'layered', 'structure', 'of', 'a', 'human', 'brain', 'results', 'in', 'leveled', 'functions', 'in', 'all', 'these', 'levels', 'of', 'different', 'functions', 'comparison', 'feedback', 'and', 'imitation', 'are', 'the', 'universal', 'and', 'crucial', 'mechanisms', 'languages', 'symbols', 'and', 'tools', 'play', 'key', 'roles', 'in', 'the', 'development', 'of', 'human', 'brain', 'and', 'entire', 'civilization']] | [-0.09665339914047055, 0.10658290690949393, -0.0598745495132688, 0.13774021091974445, -0.06354832054995414, -0.10726535372022125, 0.023712817331155142, 0.38299423704544705, -0.24695023246523407, -0.28201877598961195, 0.03120280343056139, -0.2491764043768247, -0.313916857375039, 0.23050522377921476, -0.06715577933937311, 0.06786542025705179, 0.05892965116848548, 0.0038306318482177124, 0.024362918600026102, -0.2092199371041109, 0.3652394425537851, 0.03589858727322685, 0.31508651386118597, 0.018865441013541488, 0.06930956056134568, -0.027440940075191773, -0.05577286231435007, -0.06104416066728946, -0.11710079266017095, 0.18195003352852332, 0.4126711041149166, 0.2202662095013592, 0.3663792010448459, -0.5326154400904973, -0.21934994715783332, 0.04006618993977706, 0.1280720310803089, 0.05421860880321926, -0.026454430808209712, -0.2810749502852559, 0.08184795112918235, -0.13669284731149672, -0.02235427498817444, -0.06007605302664969, -0.007765215697387854, 0.04432807557414991, -0.21259939710661355, 0.025832141170717984, 0.08132214446862539, 0.14741303270889652, -0.13875146043072972, -0.11209666927396837, -0.021934565063565968, 0.34773025697925025, 0.001970668928697705, 0.03673815357809265, 0.18856589773462878, -0.23119842565308016, -0.18692095550811952, 0.2981877054191298, 0.08109614824255308, -0.19123058244585991, 0.24232482587297757, -0.15312443876432047, -0.14372594819093745, 0.05913545300977097, 0.19481954756192862, 0.07661046375417047, -0.16269879742758347, 0.038382837440197666, 0.02561540115210745, 0.1786333238085111, 0.06867133055089249, 0.07798074984716044, 0.1884976100590494, 0.1801101120809714, -0.028393771727052, 0.064678514847118, 0.012851595330155558, -0.12405103299663299, -0.267483484165536, -0.1543428433438142, -0.0685143863187275, -0.0485525739139929, -0.1384578131747225, -0.17904625694370932, 0.42950499057769775, 0.08806675606303745, 0.14560580699601108, 0.033849725127220155, 0.2564795793344577, 0.00519682297276126, 0.1614390119496319, 0.042151153015179764, 0.13803510299573343, 0.05514895001219378, 0.11031257626083162, -0.1843996664509177, 0.1887577178267141, 0.029887041289152372] |
1,802.01981 | Revisited Swanson's Hamiltonian | We notice new Hermitian counterpart of Swanson's Hamiltonian.
| quant-ph | we notice new hermitian counterpart of swansons hamiltonian | [['we', 'notice', 'new', 'hermitian', 'counterpart', 'of', 'swansons', 'hamiltonian']] | [-0.2502339689859322, 0.01916626321950129, -0.0664576752377408, 0.1302853043058089, -0.1903548804777009, -0.207433320581913, -0.018353735761983053, 0.46940325519868303, -0.2082470575613635, -0.1941238652382578, -0.0037949434481561184, -0.26939145422407557, -0.3602483368345669, 0.13114068657159805, -0.14404786817197288, 0.07336637590612684, 0.18948541688067572, 0.10786623933485576, -0.2765652909874916, -0.17364093767745153, 0.388113939336368, -0.007124388324362891, 0.07835289569837707, 0.02243690033044134, 0.04308708970035825, 0.09614214141454015, 0.02628596712435995, -0.10463372085775648, -0.09603001144049424, 0.003371453710964748, 0.09291114072714533, 0.09462604831371989, 0.08726870015795742, -0.34602158090897966, -0.19250034115144185, 0.24193024475659644, 0.08160575213176864, 0.15412608374442374, -0.018329217098653316, -0.3542369476386479, -0.04048216023615429, -0.2293310360983014, -0.24959236170564378, -0.12218146132571357, 0.03851630059736116, -0.08802256520305361, -0.10134830964463097, 0.04557658705328192, 0.13270108827522822, 0.08860891405493021, -0.09936403908899852, -0.21008227073720523, 0.07241917135460037, -0.008669477488313402, -0.008207071040357863, -0.040280663541385105, -0.01016833573313696, 0.012637554002659661, -0.16416662026728904, 0.43667401373386383, -0.19858939829282463, -0.15876641630062036, 0.10651982203125954, -0.07874206067728144, -0.23303650665496076, 0.11958416019167219, 0.12757547412599837, 0.1570278855838946, -0.1768339719357235, 0.20589610295636313, -0.102127058165414, 0.1349452446613993, -0.06185739527323416, 0.14322772435843945, 0.11239968399916377, 0.014554957726172038, 0.16106382544551576, 0.2340582013130188, 0.02865440451673099, -0.23900158463844232, -0.32041465810367037, -0.2615041621029377, -0.2586656180875642, 0.2930697575211525, -0.07255571016243526, -0.18465558226619447, 0.44800212553569246, 0.1269664934703282, 0.13798853009939194, 0.06906570587307215, 0.1119616377566542, 0.20281389142785752, 0.0794024568583284, 0.18672422585742815, 0.3106238373688289, 0.20715878371681487, 0.04791222007146904, -0.1475454866886139, -0.23340082028880715, 0.1447684965096414] |
1,802.01982 | Intertwining wave operators, Fourier restriction, and Wiener theorems | We review some of the literature on intertwining wave operators, as far as it
relates to Tosio Kato's stationary method based on the resolvent. Techniques
from Fourier restriction and Wiener algebras are emphasized.
| math.AP | we review some of the literature on intertwining wave operators as far as it relates to tosio katos stationary method based on the resolvent techniques from fourier restriction and wiener algebras are emphasized | [['we', 'review', 'some', 'of', 'the', 'literature', 'on', 'intertwining', 'wave', 'operators', 'as', 'far', 'as', 'it', 'relates', 'to', 'tosio', 'katos', 'stationary', 'method', 'based', 'on', 'the', 'resolvent', 'techniques', 'from', 'fourier', 'restriction', 'and', 'wiener', 'algebras', 'are', 'emphasized']] | [-0.04030047283705437, 0.04249268417444193, -0.12491799095137553, 0.12853698082494014, -0.18311163617269785, -0.06851212688806382, -0.00905764757683783, 0.35546688893527695, -0.2980624262074178, -0.14838146536865018, 0.20350374161463344, -0.31502782259926654, -0.23334549977020783, 0.28212269516943983, -0.11026326527423931, 0.1362611853207151, 0.021746971475129776, 0.09133176990982259, -0.11851569756188175, -0.18729421581056985, 0.4306734615767544, -0.006411329680827983, 0.26179453177434026, 0.028236923555871755, 0.08558985650200736, 0.00984023648285956, -0.116388935338226, -0.0948615362303275, -0.16363414320530315, 0.09336078291138013, 0.25102415551064594, 0.11335475361821326, 0.27718850123611366, -0.4335301553435398, -0.1551584763678186, 0.10126093986698172, 0.18654088420567638, 0.06080486410946557, -0.0055518999314782295, -0.32663237540559337, -0.00040555357312162715, -0.1395483220165426, -0.1236772124345104, -0.12091043489900502, 0.008166153809394349, 0.09361913077759021, -0.2323079024526206, 0.06160718020559712, 0.10826387377738049, 0.08834465477389819, -0.0928287198202628, -0.17726176082523484, -0.018847384800513584, 0.05078745085858938, 0.05583304669143575, 0.0038113400735186806, 0.12142834043356054, -0.008143214762888172, -0.14190972472230592, 0.2996133021784551, -0.06361345393639622, -0.23291244411445927, 0.16409714088888105, -0.14163362251763995, -0.15842767203734678, 0.04552259138136199, 0.09094411851556013, 0.14244287082868995, -0.14281843935675692, 0.1820359674095402, -0.06302970261127815, 0.03100639968320276, 0.14187851453651534, 0.09594573695777041, 0.06599794999893868, 0.08717034559584025, 0.11219979478328516, 0.12599014861960756, 0.011857241293358984, -0.09228750515842077, -0.3566350065397494, -0.12230149580335076, -0.23438617462913194, 0.08493497702566498, -0.04653040560934284, -0.20460376436963226, 0.37026094018735667, 0.20151007226244969, 0.14393393384913603, 0.054242503829300404, 0.24495922627322603, 0.19555854576526943, 0.07351319243510564, 0.039349609929503815, 0.18889508151650344, 0.28472761609450437, 0.1297026047708862, -0.1332840687687029, -0.02676580043396715, 0.2785516825758598] |
1,802.01983 | Storage-Latency Trade-off in Cache-Aided Fog Radio Access Networks | A fog radio access network (F-RAN) is studied, in which $K_T$ edge nodes
(ENs) connected to a cloud server via orthogonal fronthaul links, serve $K_R$
users through a wireless Gaussian interference channel. Both the ENs and the
users have finite-capacity cache memories, which are filled before the user
demands are revealed. While a centralized placement phase is used for the ENs,
which model static base stations, a decentralized placement is leveraged for
the mobile users. An achievable transmission scheme is presented, which employs
a combination of interference alignment, zero-forcing and interference
cancellation techniques in the delivery phase, and the \textit{normalized
delivery time} (NDT), which captures the worst-case latency, is analyzed.
| cs.IT math.IT | a fog radio access network fran is studied in which k_t edge nodes ens connected to a cloud server via orthogonal fronthaul links serve k_r users through a wireless gaussian interference channel both the ens and the users have finitecapacity cache memories which are filled before the user demands are revealed while a centralized placement phase is used for the ens which model static base stations a decentralized placement is leveraged for the mobile users an achievable transmission scheme is presented which employs a combination of interference alignment zeroforcing and interference cancellation techniques in the delivery phase and the textitnormalized delivery time ndt which captures the worstcase latency is analyzed | [['a', 'fog', 'radio', 'access', 'network', 'fran', 'is', 'studied', 'in', 'which', 'k_t', 'edge', 'nodes', 'ens', 'connected', 'to', 'a', 'cloud', 'server', 'via', 'orthogonal', 'fronthaul', 'links', 'serve', 'k_r', 'users', 'through', 'a', 'wireless', 'gaussian', 'interference', 'channel', 'both', 'the', 'ens', 'and', 'the', 'users', 'have', 'finitecapacity', 'cache', 'memories', 'which', 'are', 'filled', 'before', 'the', 'user', 'demands', 'are', 'revealed', 'while', 'a', 'centralized', 'placement', 'phase', 'is', 'used', 'for', 'the', 'ens', 'which', 'model', 'static', 'base', 'stations', 'a', 'decentralized', 'placement', 'is', 'leveraged', 'for', 'the', 'mobile', 'users', 'an', 'achievable', 'transmission', 'scheme', 'is', 'presented', 'which', 'employs', 'a', 'combination', 'of', 'interference', 'alignment', 'zeroforcing', 'and', 'interference', 'cancellation', 'techniques', 'in', 'the', 'delivery', 'phase', 'and', 'the', 'textitnormalized', 'delivery', 'time', 'ndt', 'which', 'captures', 'the', 'worstcase', 'latency', 'is', 'analyzed']] | [-0.36919769182119844, 0.022768703478504904, -0.02843121879247077, -0.00441974147603155, -0.0876190765128565, -0.28777286441945427, 0.20115796255947457, 0.40753631755162817, -0.26863843551196087, -0.2481933781415771, 0.06925221056455251, -0.26909637392643804, -0.15193293134707514, 0.04108967427207037, -0.10487901792143804, 0.043884196337910554, 0.02374807760734757, 0.06313289437494284, 0.04307127919970849, -0.26144617729299113, 0.23327654144735238, 0.13325658093266393, 0.4284978545860413, 0.05833733476561691, 0.018349832743021804, 0.03335556490859444, -0.05333579099767013, -0.026052129951544926, -0.05353245686167219, 0.039814989358067106, 0.3751765262301362, 0.19251630706456277, 0.22629695636468058, -0.47562600561169854, -0.2448833327400797, 0.03915958488872702, 0.1765722764630315, -0.012090600795249259, -0.04318913287235373, -0.3108987035229802, 0.14177882726893787, -0.25786505009628696, 0.01683674113175601, 0.06554955370519139, -0.10674923291182094, 0.0755647686432936, -0.38428656053686633, -0.05960689000614466, -0.06954954021157475, -0.00931551668861317, -8.978935838634267e-05, -0.06989098030544065, 0.019437174778431654, 0.19652835639415805, -0.03157181054494694, -0.0016707222003045433, 0.1336225260971883, -0.06709217394642326, -0.13766615872843824, 0.406005684811827, 0.07412686076767128, -0.18613517766715873, 0.10919996011423357, -0.0022549897757008536, -0.0810777454320854, 0.18062723704630834, 0.24083781843885368, 0.03401581783898585, -0.21504101070891554, 0.024688392413519493, -0.020584684052214093, 0.1373195888478856, 0.12643276664231895, 0.1365665719073283, 0.18253258175703638, 0.21234836826664866, 0.17056341689088544, 0.1122816235015015, -0.13193791499788607, -0.12488205082406965, -0.1710807065534995, -0.11523650823280625, -0.26739522660954285, -0.015278898875886968, -0.11000567784390322, -0.07276767648653973, 0.335042569144524, 0.0475908613533055, 0.09576785364487303, 0.09917239741947707, 0.4842918036044191, 0.08663249775925395, 0.10329383168660036, 0.2138825292664862, 0.13508303686997794, 0.09244278536408866, 0.21386815532151485, -0.19840237305503886, 0.10461628517358128, -0.007099249814594284] |
1,802.01984 | Nonlinear waves in magnetized quark matter and the reduced Ostrovsky
equation | We study nonlinear waves in a nonrelativistic ideal and cold quark gluon
plasma immersed in a strong uniform magnetic field. In the context of
nonrelativistic hydrodynamics with an external magnetic field we derive a
nonlinear wave equation for baryon density perturbations, which can be written
as a reduced Ostrovsky equation. We find analytical solutions and identify the
effects of the magnetic field.
| nucl-th hep-ph | we study nonlinear waves in a nonrelativistic ideal and cold quark gluon plasma immersed in a strong uniform magnetic field in the context of nonrelativistic hydrodynamics with an external magnetic field we derive a nonlinear wave equation for baryon density perturbations which can be written as a reduced ostrovsky equation we find analytical solutions and identify the effects of the magnetic field | [['we', 'study', 'nonlinear', 'waves', 'in', 'a', 'nonrelativistic', 'ideal', 'and', 'cold', 'quark', 'gluon', 'plasma', 'immersed', 'in', 'a', 'strong', 'uniform', 'magnetic', 'field', 'in', 'the', 'context', 'of', 'nonrelativistic', 'hydrodynamics', 'with', 'an', 'external', 'magnetic', 'field', 'we', 'derive', 'a', 'nonlinear', 'wave', 'equation', 'for', 'baryon', 'density', 'perturbations', 'which', 'can', 'be', 'written', 'as', 'a', 'reduced', 'ostrovsky', 'equation', 'we', 'find', 'analytical', 'solutions', 'and', 'identify', 'the', 'effects', 'of', 'the', 'magnetic', 'field']] | [-0.18662088818382472, 0.1901121076533004, -0.08764452754610008, 0.09099948551926401, -0.07798598241060972, -0.04929303927647491, -0.071691979594048, 0.2941700774695604, -0.22621340948652716, -0.2715712311985572, 0.02477805599037017, -0.22623206888355554, -0.062281613230645176, 0.1392576830018492, 0.07103950250893831, 0.03703435567478018, 0.0030243813300565364, 0.037156662505660805, -0.06910209298404234, -0.1710572099245544, 0.32565963809047976, 0.00033087112129695956, 0.21615134317788384, 0.053757380063254985, 0.09791023862518129, -0.019495158313563275, 0.021501121674514106, 0.10319218704957635, -0.15528122082257817, -0.010808227238275351, 0.2071403791081637, 0.001407278818078339, 0.23167555384908714, -0.5181828097951028, -0.2759281276056783, 0.04964945921223731, 0.14802434145953627, 0.21679052800473367, -0.1065583819853923, -0.2953349001735689, 0.006714738845344513, -0.19061687660794105, -0.22299145120045832, -0.10035172178440037, 0.01615420205240709, 0.072105803076298, -0.35037518674207313, 0.13150239596143365, 0.02157714932165559, 0.009580222078629078, -0.11852864266162919, -0.052373787853866816, -0.017816135509600563, -0.017072621687886216, 0.0592285085229143, 0.11883243998407476, 0.1391559682125526, -0.2505924090622894, -0.05081331256716963, 0.39724711364796084, -0.17586974720019968, -0.22701452612396208, 0.1372926154459316, -0.1654298648598694, -0.07726819385143538, 0.11866130944972317, 0.24128763794508432, 0.1059185091270915, -0.18976427806210855, 0.12465293702271377, -0.06781956919392894, 0.1430503711885502, 0.08515298916327377, 0.01677841512155869, 0.25333437948457654, 0.13692192897020328, -0.012127925957282704, 0.15458886981603778, -0.04996039713883112, -0.04195009415683847, -0.325363525219502, -0.16867843612788186, -0.11686286348248681, 0.09013250791688351, -0.09805725007496338, -0.2255967367560633, 0.38434999179275287, 0.1636152244698737, 0.09284042604192491, -0.058507171532725014, 0.30341499022418456, 0.22605656575404048, -0.026707058832530054, 0.1568658075806114, 0.2738931075624761, 0.2659904796089376, 0.14285148623129051, -0.2794678363077823, -0.11110441634551652, 0.08586102440547679] |
1,802.01985 | Microscopic modeling of gas-surface scattering. II. Application to argon
atom adsorption on a platinum (111) surface | A new combination of first principle molecular dynamics (MD) simulations with
a rate equation model presented in the preceding paper (paper I) is applied to
analyze in detail the scattering of argon atoms from a platinum (111) surface.
The combined model is based on a classification of all atom trajectories
according to their energies into trapped, quasi-trapped and scattering states.
The number of particles in each of the three classes obeys coupled rate
equations. The coefficients in the rate equations are the transition
probabilities between these states which are obtained from MD simulations.
While these rates are generally time-dependent, after a characteristic time
scale $t_E$ of several tens of picoseconds they become stationary allowing for
a rather simple analysis. Here, we investigate this time scale by analyzing in
detail the temporal evolution of the energy distribution functions of the
adsorbate atoms. We separately study the energy loss distribution function of
the atoms and the distribution function of in-plane and perpendicular energy
components. Further, we compute the sticking probability of argon atoms as a
function of incident energy, angle and lattice temperature. Our model is
important for plasma-surface modeling as it allows to extend accurate
simulations to longer time scales.
| physics.plasm-ph | a new combination of first principle molecular dynamics md simulations with a rate equation model presented in the preceding paper paper i is applied to analyze in detail the scattering of argon atoms from a platinum 111 surface the combined model is based on a classification of all atom trajectories according to their energies into trapped quasitrapped and scattering states the number of particles in each of the three classes obeys coupled rate equations the coefficients in the rate equations are the transition probabilities between these states which are obtained from md simulations while these rates are generally timedependent after a characteristic time scale t_e of several tens of picoseconds they become stationary allowing for a rather simple analysis here we investigate this time scale by analyzing in detail the temporal evolution of the energy distribution functions of the adsorbate atoms we separately study the energy loss distribution function of the atoms and the distribution function of inplane and perpendicular energy components further we compute the sticking probability of argon atoms as a function of incident energy angle and lattice temperature our model is important for plasmasurface modeling as it allows to extend accurate simulations to longer time scales | [['a', 'new', 'combination', 'of', 'first', 'principle', 'molecular', 'dynamics', 'md', 'simulations', 'with', 'a', 'rate', 'equation', 'model', 'presented', 'in', 'the', 'preceding', 'paper', 'paper', 'i', 'is', 'applied', 'to', 'analyze', 'in', 'detail', 'the', 'scattering', 'of', 'argon', 'atoms', 'from', 'a', 'platinum', '111', 'surface', 'the', 'combined', 'model', 'is', 'based', 'on', 'a', 'classification', 'of', 'all', 'atom', 'trajectories', 'according', 'to', 'their', 'energies', 'into', 'trapped', 'quasitrapped', 'and', 'scattering', 'states', 'the', 'number', 'of', 'particles', 'in', 'each', 'of', 'the', 'three', 'classes', 'obeys', 'coupled', 'rate', 'equations', 'the', 'coefficients', 'in', 'the', 'rate', 'equations', 'are', 'the', 'transition', 'probabilities', 'between', 'these', 'states', 'which', 'are', 'obtained', 'from', 'md', 'simulations', 'while', 'these', 'rates', 'are', 'generally', 'timedependent', 'after', 'a', 'characteristic', 'time', 'scale', 't_e', 'of', 'several', 'tens', 'of', 'picoseconds', 'they', 'become', 'stationary', 'allowing', 'for', 'a', 'rather', 'simple', 'analysis', 'here', 'we', 'investigate', 'this', 'time', 'scale', 'by', 'analyzing', 'in', 'detail', 'the', 'temporal', 'evolution', 'of', 'the', 'energy', 'distribution', 'functions', 'of', 'the', 'adsorbate', 'atoms', 'we', 'separately', 'study', 'the', 'energy', 'loss', 'distribution', 'function', 'of', 'the', 'atoms', 'and', 'the', 'distribution', 'function', 'of', 'inplane', 'and', 'perpendicular', 'energy', 'components', 'further', 'we', 'compute', 'the', 'sticking', 'probability', 'of', 'argon', 'atoms', 'as', 'a', 'function', 'of', 'incident', 'energy', 'angle', 'and', 'lattice', 'temperature', 'our', 'model', 'is', 'important', 'for', 'plasmasurface', 'modeling', 'as', 'it', 'allows', 'to', 'extend', 'accurate', 'simulations', 'to', 'longer', 'time', 'scales']] | [-0.10144830524398425, 0.1664003807087265, -0.08751539678205197, 0.05194840447897625, 0.031627347386306404, -0.09536723654287815, 0.04919240771103697, 0.3862428471642598, -0.2720900894067807, -0.2950931708024225, 0.03407019102915504, -0.2861376593800422, -0.07664867312455521, 0.17967233759697396, 0.06262012888576798, 0.06613180271891558, 0.055855771014232884, 0.002883727044503593, -0.07142009979977398, -0.20444758309416436, 0.29060937688643834, 0.09691019048773913, 0.2652441008769949, 0.058286141821805706, 0.09841002721161624, -0.006855665883938571, -0.003065957423959433, 0.0024271002960325238, -0.15099612715181393, 0.09103424566500731, 0.20919049921066468, 0.0490879717320391, 0.24962542483105732, -0.4836626872701112, -0.21413144189396396, 0.07367280470768935, 0.12609136493726816, 0.1448053557001026, -0.03369815384760855, -0.2351732567226486, 0.017026539194636307, -0.13863009978530358, -0.13937493939720205, -0.04116655107302095, 0.040327032815065965, 0.08216444265633241, -0.2512753478739289, 0.12372678370757881, 0.015905281346310023, 0.03852461715083775, -0.10362187631506632, -0.09362906917237007, -0.025227644470234838, 0.08533368678471008, 0.048918637095473186, 0.005235536455705612, 0.15663810635989428, -0.10307253761352718, -0.06705572112608495, 0.39482644413733603, -0.08061663628480954, -0.18394839790785433, 0.19143044506199658, -0.15444855062740306, -0.0769440477512702, 0.1634564443360359, 0.1978716059966977, 0.1580592524494283, -0.16451723101881133, 0.05056509343163115, -0.02131873390276977, 0.17744389210064807, 0.07573938857174324, 0.030503645763924375, 0.19242618451054072, 0.17270420876333967, 0.018822548333834798, 0.13272208340838085, -0.13246044911205507, -0.12134507697908647, -0.2904227173526832, -0.16764740073805073, -0.18519489357222207, 0.0592016729979013, -0.0718489921761176, -0.11375922626165215, 0.42952937341234343, 0.14592851238587318, 0.21292438531228944, 0.045063183091267306, 0.27918422943093446, 0.1385151976105247, 0.028824377410703494, 0.03995208746762993, 0.1999454724827042, 0.14098451610879234, 0.07023806597021919, -0.24191736899803032, 0.058250305151576226, 0.0505131913545593] |
1,802.01986 | The observational constraint on constant-roll inflation | We discuss the constant-roll inflation with constant $\epsilon_2$ and
constant $\bar\eta$. By using the method of Bessel function approximation, the
analytical expressions for the scalar and tensor power spectra, the scalar and
tensor spectral tilts, and the tensor to scalar ratio are derived up to the
first order of $\epsilon_1$. The model with constant $\epsilon_2$ is ruled out
by the observations at the $3\sigma$ confidence level, and the model with
constant $\bar\eta$ is consistent with the observations at the $1\sigma$
confidence level. The potential for the model with constant $\bar\eta$ is also
obtained from the Hamilton-Jacobi equation. Although the observations constrain
the constant-roll inflation to be slow-roll inflation, the $n_s-r$ results from
the constant-roll inflation are not the same as those from the slow-roll
inflation even when $\bar\eta\sim 0.01$.
| gr-qc astro-ph.CO hep-th | we discuss the constantroll inflation with constant epsilon_2 and constant bareta by using the method of bessel function approximation the analytical expressions for the scalar and tensor power spectra the scalar and tensor spectral tilts and the tensor to scalar ratio are derived up to the first order of epsilon_1 the model with constant epsilon_2 is ruled out by the observations at the 3sigma confidence level and the model with constant bareta is consistent with the observations at the 1sigma confidence level the potential for the model with constant bareta is also obtained from the hamiltonjacobi equation although the observations constrain the constantroll inflation to be slowroll inflation the n_sr results from the constantroll inflation are not the same as those from the slowroll inflation even when baretasim 001 | [['we', 'discuss', 'the', 'constantroll', 'inflation', 'with', 'constant', 'epsilon_2', 'and', 'constant', 'bareta', 'by', 'using', 'the', 'method', 'of', 'bessel', 'function', 'approximation', 'the', 'analytical', 'expressions', 'for', 'the', 'scalar', 'and', 'tensor', 'power', 'spectra', 'the', 'scalar', 'and', 'tensor', 'spectral', 'tilts', 'and', 'the', 'tensor', 'to', 'scalar', 'ratio', 'are', 'derived', 'up', 'to', 'the', 'first', 'order', 'of', 'epsilon_1', 'the', 'model', 'with', 'constant', 'epsilon_2', 'is', 'ruled', 'out', 'by', 'the', 'observations', 'at', 'the', '3sigma', 'confidence', 'level', 'and', 'the', 'model', 'with', 'constant', 'bareta', 'is', 'consistent', 'with', 'the', 'observations', 'at', 'the', '1sigma', 'confidence', 'level', 'the', 'potential', 'for', 'the', 'model', 'with', 'constant', 'bareta', 'is', 'also', 'obtained', 'from', 'the', 'hamiltonjacobi', 'equation', 'although', 'the', 'observations', 'constrain', 'the', 'constantroll', 'inflation', 'to', 'be', 'slowroll', 'inflation', 'the', 'n_sr', 'results', 'from', 'the', 'constantroll', 'inflation', 'are', 'not', 'the', 'same', 'as', 'those', 'from', 'the', 'slowroll', 'inflation', 'even', 'when', 'baretasim', '001']] | [-0.1030809094736469, 0.15688901384055498, -0.06419324786838843, 0.0785917657731261, -0.06565747894637752, -0.1748209577781381, -0.0019042680360144004, 0.30795438688073773, -0.21612839293084107, -0.31018886709352955, 0.09841441326352651, -0.2624235249313642, -0.09442614281942951, 0.14019803598239378, 0.049502627764013596, 0.0532980282004587, 0.02095810425817035, 0.04539262938487809, -0.04427569903964468, -0.25390615162905306, 0.32100021643418586, 0.133485031175951, 0.18984220551283215, 0.009845577587839216, 0.058558645294851885, -0.11056069967889925, 0.021643197411322035, -0.035208480039727874, -0.23323537745818612, 0.06479019578182488, 0.15852958698269504, 0.08845633605596959, 0.1814702592091635, -0.3645550887886202, -0.19209975866033346, 0.11156019451300381, 0.09177339065354317, 0.09803994766480173, 0.04439597114833305, -0.287415289261844, 0.08200564722096715, -0.1485684306753683, -0.12313997202909377, -0.0722670458490029, -0.04511553418706171, -0.03179348590128939, -0.32506186246246216, 0.1494288901847085, -0.04804276216600556, -0.017862214477645466, -0.1245343473055982, -0.14267974267568206, -0.05338065892647137, 0.03951292127317174, 0.1526307474987334, 0.06620768151924494, 0.09251424700414645, -0.1507424562551023, -0.012675931989178935, 0.4056220424827188, -0.2083053382457365, -0.17578458248317474, 0.04410031889710808, -0.20531662185749155, -0.1380021349141316, 0.07628036939240701, 0.07146411866415292, 0.08268340830483112, -0.10782967718716918, 0.1682987039798718, 0.07772133293656225, 0.14562563829531427, 0.10485833333950723, -0.05110233086452354, 0.2618112874115468, 0.05578562385016994, 0.005924353357841028, 0.09438031089757715, -0.07997868758320692, -0.10664278071635636, -0.4142674140603049, -0.0596876674608211, -0.17338207692137075, 0.042421980835683826, -0.23740106275670314, -0.13010191003559157, 0.41194181537866825, 0.12103046581614763, 0.24475659205336342, 0.1521087490436912, 0.3072951305366587, 0.19250993145305983, 0.040196035743065295, 0.06903657990915235, 0.3637138466583565, 0.1428435009711393, 0.10602627121625119, -0.19178508504228375, 0.0016729194758227095, 0.03274694264109712] |
1,802.01987 | A hierarchical model of non-homogeneous Poisson processes for Twitter
retweets | We present a hierarchical model of non-homogeneous Poisson processes (NHPP)
for information diffusion on online social media, in particular Twitter
retweets. The retweets of each original tweet are modelled by a NHPP, for which
the intensity function is a product of time-decaying components and another
component that depends on the follower count of the original tweet author. The
latter allows us to explain or predict the ultimate retweet count by a network
centrality-related covariate. The inference algorithm enables the Bayes factor
to be computed, in order to facilitate model selection. Finally, the model is
applied to the retweet data sets of two hashtags.
| stat.AP cs.SI stat.CO | we present a hierarchical model of nonhomogeneous poisson processes nhpp for information diffusion on online social media in particular twitter retweets the retweets of each original tweet are modelled by a nhpp for which the intensity function is a product of timedecaying components and another component that depends on the follower count of the original tweet author the latter allows us to explain or predict the ultimate retweet count by a network centralityrelated covariate the inference algorithm enables the bayes factor to be computed in order to facilitate model selection finally the model is applied to the retweet data sets of two hashtags | [['we', 'present', 'a', 'hierarchical', 'model', 'of', 'nonhomogeneous', 'poisson', 'processes', 'nhpp', 'for', 'information', 'diffusion', 'on', 'online', 'social', 'media', 'in', 'particular', 'twitter', 'retweets', 'the', 'retweets', 'of', 'each', 'original', 'tweet', 'are', 'modelled', 'by', 'a', 'nhpp', 'for', 'which', 'the', 'intensity', 'function', 'is', 'a', 'product', 'of', 'timedecaying', 'components', 'and', 'another', 'component', 'that', 'depends', 'on', 'the', 'follower', 'count', 'of', 'the', 'original', 'tweet', 'author', 'the', 'latter', 'allows', 'us', 'to', 'explain', 'or', 'predict', 'the', 'ultimate', 'retweet', 'count', 'by', 'a', 'network', 'centralityrelated', 'covariate', 'the', 'inference', 'algorithm', 'enables', 'the', 'bayes', 'factor', 'to', 'be', 'computed', 'in', 'order', 'to', 'facilitate', 'model', 'selection', 'finally', 'the', 'model', 'is', 'applied', 'to', 'the', 'retweet', 'data', 'sets', 'of', 'two', 'hashtags']] | [-0.06755531977807336, 0.03731522704109404, -0.079596009612193, 0.1352723994949723, -0.15700384426642866, -0.1316738824095285, 0.10701539981699384, 0.3976469436550842, -0.28535083409252704, -0.2943588585510631, 0.06073883544041903, -0.3241181405212367, -0.16548739106613486, 0.13504730743429094, -0.05905096525298979, -0.00581724988296628, 0.03741480666669268, 0.13262796289670994, 0.04008914473895714, -0.3128022550075662, 0.3345231276425515, 0.07357775563301117, 0.31975653112007707, 0.005187278458227714, 0.12493652530703876, 0.03367055593715871, -0.11393082043265595, -0.009500710340445022, -0.10552964419591315, 0.15435071340670772, 0.26399485976891773, 0.17552665983527607, 0.3086146226097994, -0.37063480530153303, -0.21868142760450057, 0.08397597850610812, 0.11905449708608691, 0.09809727188971296, 0.06076060736999281, -0.3151997669472122, 0.04917272616762156, -0.20158397113732016, -0.05173360519385075, -0.06230630826971987, -0.011982338557786801, 0.05417830079300877, -0.3070791352485471, 0.0964271257695395, 0.041609555126770455, 0.012260020555307468, -0.03134618233489877, -0.05382518385258485, -0.023287433751986598, 0.16729523541232316, 0.06397319511241079, -0.002325481270649927, 0.16905902936945066, -0.1251518917406964, -0.16070269735292622, 0.37162787341238823, -0.06085313471004495, -0.2058153783117293, 0.12352562569282657, -0.06840246706726212, -0.15082103391543178, 0.09788696913906902, 0.25024324850471436, 0.05923006868482951, -0.1768882617664834, -0.028424422108846735, -0.0779384608773113, 0.19694249491052082, 0.05999293044556444, -0.08010075943014931, 0.14643737173858373, 0.2013244819199648, 0.055133231839563986, 0.12680775481253387, -0.10162437244720172, -0.07479450578159909, -0.23580795275412647, -0.13563841915525057, -0.18096610157312276, 0.03276700467126919, -0.15776515669430785, -0.17673956881295524, 0.4232902769547175, 0.16892641576408757, 0.22501773683938617, 0.059558451943802555, 0.26933138819374874, 0.09651342802224498, 0.05568019025297105, 0.06737532035685052, 0.11816005691356372, 0.08718461135867983, 0.12601280387710123, -0.1358559959472212, 0.1523257888734852, 0.06318243474964344] |
1,802.01988 | The Geometrical Structure of Phase Space of the Controlled Hamiltonian
System with Symmetry | In this paper, from the viewpoint of completeness of Marsden-Weinstein
reduction, we illustrate how to give the definitions of a controlled
Hamiltonian (CH) system and a reducible controlled Hamiltonian system with
symmetry; and how to describe the dynamics of a CH system and the controlled
Hamiltonian equivalence; as well as how to give the regular point reduction and
the regular orbit reduction for a CH system with symmetry, by analyzing
carefully the geometrical and topological structures of the phase space and the
reduced phase space of the corresponding Hamiltonian system. We also introduce
briefly some recent developments in the study of reduction theory for the CH
systems with symmetries and applications. These research work reveal the deeply
internal relationships of the geometrical structures of phase spaces, the
dynamical vector fields and controls of the CH systems.
| math.SG math.DG math.DS | in this paper from the viewpoint of completeness of marsdenweinstein reduction we illustrate how to give the definitions of a controlled hamiltonian ch system and a reducible controlled hamiltonian system with symmetry and how to describe the dynamics of a ch system and the controlled hamiltonian equivalence as well as how to give the regular point reduction and the regular orbit reduction for a ch system with symmetry by analyzing carefully the geometrical and topological structures of the phase space and the reduced phase space of the corresponding hamiltonian system we also introduce briefly some recent developments in the study of reduction theory for the ch systems with symmetries and applications these research work reveal the deeply internal relationships of the geometrical structures of phase spaces the dynamical vector fields and controls of the ch systems | [['in', 'this', 'paper', 'from', 'the', 'viewpoint', 'of', 'completeness', 'of', 'marsdenweinstein', 'reduction', 'we', 'illustrate', 'how', 'to', 'give', 'the', 'definitions', 'of', 'a', 'controlled', 'hamiltonian', 'ch', 'system', 'and', 'a', 'reducible', 'controlled', 'hamiltonian', 'system', 'with', 'symmetry', 'and', 'how', 'to', 'describe', 'the', 'dynamics', 'of', 'a', 'ch', 'system', 'and', 'the', 'controlled', 'hamiltonian', 'equivalence', 'as', 'well', 'as', 'how', 'to', 'give', 'the', 'regular', 'point', 'reduction', 'and', 'the', 'regular', 'orbit', 'reduction', 'for', 'a', 'ch', 'system', 'with', 'symmetry', 'by', 'analyzing', 'carefully', 'the', 'geometrical', 'and', 'topological', 'structures', 'of', 'the', 'phase', 'space', 'and', 'the', 'reduced', 'phase', 'space', 'of', 'the', 'corresponding', 'hamiltonian', 'system', 'we', 'also', 'introduce', 'briefly', 'some', 'recent', 'developments', 'in', 'the', 'study', 'of', 'reduction', 'theory', 'for', 'the', 'ch', 'systems', 'with', 'symmetries', 'and', 'applications', 'these', 'research', 'work', 'reveal', 'the', 'deeply', 'internal', 'relationships', 'of', 'the', 'geometrical', 'structures', 'of', 'phase', 'spaces', 'the', 'dynamical', 'vector', 'fields', 'and', 'controls', 'of', 'the', 'ch', 'systems']] | [-0.1485318822943715, 0.12148306926503531, -0.06484325883417007, 0.046393377592561166, -0.02980293589301736, -0.08860294891757589, 0.05810357189929003, 0.3206656027194934, -0.31588014371022033, -0.29807722820516896, 0.11987782116150758, -0.22781765393858008, -0.20817463346825474, 0.16416843397104564, -0.05039892923634719, 0.038355066336568114, 0.055377669574227184, 0.010581831896321519, -0.13186713356713775, -0.22386815442860097, 0.38507978514398394, 0.040549595895058965, 0.24668017611838877, 0.014675150933565901, 0.1032480466631515, 0.029063343691043828, 0.008397946507423459, 0.040125758992764854, -0.14517207153703032, 0.16723625687882304, 0.20740473623086206, 0.11282215854974792, 0.17480414715143577, -0.4027169708861038, -0.21790651501129, 0.049259609419523794, 0.11268946882474291, 0.12378111072672147, -0.014260678983512609, -0.32033360874800776, 0.04771084776353639, -0.1600407635628739, -0.1650706167137661, -0.12259151230169021, 0.04285268195535002, 0.029163518549038973, -0.1749642016023726, 0.01541575645451838, 0.1192314626847185, 0.11263751577216145, -0.09614395853286088, -0.05925560462278286, -0.0762979259067352, 0.1109287779100294, 0.024875381697818416, 0.021232855754479876, 0.10914810357430457, -0.10464951341375983, -0.11688302220393192, 0.43368860523161645, -0.03886502568339518, -0.20313015870530815, 0.20884130780776852, -0.11377101661705905, -0.1589290092815645, 0.093931869172272, 0.16427288506084176, 0.08740313485374346, -0.13116392553510034, 0.1143791080240215, 0.002066099187633132, 0.13167407414691887, 0.012437479849562378, 0.07899932433878455, 0.15148813014863716, 0.14293400818646393, 0.08845281338332878, 0.16526247944121303, -0.03228382347836433, -0.11496707366270986, -0.3211857460932258, -0.1897059122840052, -0.10423283289042849, 0.03284518471371163, -0.06655291189449866, -0.1380072964786771, 0.40875237600138303, 0.13646862060704734, 0.2232518236303483, -0.005190411339486565, 0.23175173408269664, 0.14249711956568611, 0.011797800030121031, 0.011816079461234896, 0.21092121830823837, 0.1771655602411449, 0.10454779719550382, -0.2622559707704247, -0.015798190676244248, 0.09301190454211525] |
1,802.01989 | Tropical implementation of the Analytical Hierarchy Process decision
method | We apply methods and techniques of tropical optimization to develop a new
theoretical and computational framework for the implementation of the Analytic
Hierarchy Process in multi-criteria problems of rating alternatives from
pairwise comparison data. In this framework, we first consider the minimax
Chebyshev approximation of pairwise comparison matrices by consistent matrices
in the logarithmic scale. Recasting this approximation problem as a problem of
tropical pseudo-quadratic programming we then write out a closed-form solution
to it. This solution might be either a unique score vector (up to a positive
factor) or a set of different score vectors. To handle the problem when the
solution is not unique, we develop tropical optimization techniques of
maximizing and minimizing the Hilbert seminorm to find those vectors from the
solution set that are the most and least differentiating between the
alternatives with the highest and lowest scores, and thus are well
representative of the entire solution set.
| math.OC | we apply methods and techniques of tropical optimization to develop a new theoretical and computational framework for the implementation of the analytic hierarchy process in multicriteria problems of rating alternatives from pairwise comparison data in this framework we first consider the minimax chebyshev approximation of pairwise comparison matrices by consistent matrices in the logarithmic scale recasting this approximation problem as a problem of tropical pseudoquadratic programming we then write out a closedform solution to it this solution might be either a unique score vector up to a positive factor or a set of different score vectors to handle the problem when the solution is not unique we develop tropical optimization techniques of maximizing and minimizing the hilbert seminorm to find those vectors from the solution set that are the most and least differentiating between the alternatives with the highest and lowest scores and thus are well representative of the entire solution set | [['we', 'apply', 'methods', 'and', 'techniques', 'of', 'tropical', 'optimization', 'to', 'develop', 'a', 'new', 'theoretical', 'and', 'computational', 'framework', 'for', 'the', 'implementation', 'of', 'the', 'analytic', 'hierarchy', 'process', 'in', 'multicriteria', 'problems', 'of', 'rating', 'alternatives', 'from', 'pairwise', 'comparison', 'data', 'in', 'this', 'framework', 'we', 'first', 'consider', 'the', 'minimax', 'chebyshev', 'approximation', 'of', 'pairwise', 'comparison', 'matrices', 'by', 'consistent', 'matrices', 'in', 'the', 'logarithmic', 'scale', 'recasting', 'this', 'approximation', 'problem', 'as', 'a', 'problem', 'of', 'tropical', 'pseudoquadratic', 'programming', 'we', 'then', 'write', 'out', 'a', 'closedform', 'solution', 'to', 'it', 'this', 'solution', 'might', 'be', 'either', 'a', 'unique', 'score', 'vector', 'up', 'to', 'a', 'positive', 'factor', 'or', 'a', 'set', 'of', 'different', 'score', 'vectors', 'to', 'handle', 'the', 'problem', 'when', 'the', 'solution', 'is', 'not', 'unique', 'we', 'develop', 'tropical', 'optimization', 'techniques', 'of', 'maximizing', 'and', 'minimizing', 'the', 'hilbert', 'seminorm', 'to', 'find', 'those', 'vectors', 'from', 'the', 'solution', 'set', 'that', 'are', 'the', 'most', 'and', 'least', 'differentiating', 'between', 'the', 'alternatives', 'with', 'the', 'highest', 'and', 'lowest', 'scores', 'and', 'thus', 'are', 'well', 'representative', 'of', 'the', 'entire', 'solution', 'set']] | [-0.06890187516048747, -0.03300254924014505, -0.07655088194970679, 0.09395987294830152, -0.084157327563796, -0.13621096701995397, 0.08717378621747086, 0.3559892850883587, -0.33677410183391704, -0.28822752545698005, 0.1318513409718626, -0.3006615802020717, -0.16898593626377223, 0.1528878926259686, -0.057650617476993876, 0.08800817758808414, 0.07257585823581873, 0.02046423898029484, -0.12059062595424046, -0.2649017948501033, 0.3282783935581775, 0.032285541896463224, 0.25693126549135503, 0.029546896119044458, 0.1390214273116343, -0.02672361905953087, -0.013080900247012707, 0.04313170194233719, -0.10415300453644848, 0.1606910012480129, 0.3138225366833228, 0.2338087070445334, 0.3322534746073775, -0.3869449204802023, -0.13457040715423463, 0.14419925015260415, 0.10995690113448195, 0.09124428229743468, 0.0016665658454018597, -0.22833788092248142, 0.09346479506501437, -0.1541819666607281, -0.08102948272809092, -0.1070007769709551, -0.027681060012822088, 0.002481316730968262, -0.327701361669154, 0.056696583459454, 0.014525814387046634, 0.023889206224243696, -0.09633944330179427, -0.1556801578722355, 0.056472386003741507, 0.0845047853908909, 0.062179857154804175, 0.04423705151068708, 0.06052179149302997, -0.10653140657661042, -0.1312838087661045, 0.3769330541774827, -0.05195059583217555, -0.2524028485135396, 0.167198162074017, -0.1035746927863281, -0.10921673532452826, 0.11962382110620015, 0.2000455431376682, 0.15558467248430183, -0.1743022408682009, 0.06818857487968144, -0.07430958858764682, 0.12334542876526125, 0.06574743899737338, -0.03213503911923142, 0.16763845068941774, 0.159200093174341, 0.1320805719342867, 0.13034136749506856, -0.01493454773873581, -0.09914681010138195, -0.2880520259005655, -0.15944983435819218, -0.17838808026556907, 0.010346316273027793, -0.1385300506641981, -0.19239701879039212, 0.4017619344430338, 0.13770308093731537, 0.20457753036048656, 0.1115128328582566, 0.29669501661249487, 0.1386093843430947, 0.03738904563023856, 0.09612191011700288, 0.18550243567963326, 0.10391805184956052, 0.02948149110460164, -0.16598787973175363, 0.04461249013700964, 0.10832170850143914] |
1,802.0199 | An Experimental Investigation of Preference Misrepresentation in the
Residency Match | The development and deployment of matching procedures that incentivize
truthful preference reporting is considered one of the major successes of
market design research. In this study, we test the degree to which these
procedures succeed in eliminating preference misrepresentation. We administered
an online experiment to 1,714 medical students immediately after their
participation in the medical residency match--a leading field application of
strategy-proof market design. When placed in an analogous, incentivized
matching task, we find that 23% of participants misrepresent their preferences.
We explore the factors that predict preference misrepresentation, including
cognitive ability, strategic positioning, overconfidence, expectations, advice,
and trust. We discuss the implications of this behavior for the design of
allocation mechanisms and the social welfare in markets that use them.
| econ.EM | the development and deployment of matching procedures that incentivize truthful preference reporting is considered one of the major successes of market design research in this study we test the degree to which these procedures succeed in eliminating preference misrepresentation we administered an online experiment to 1714 medical students immediately after their participation in the medical residency matcha leading field application of strategyproof market design when placed in an analogous incentivized matching task we find that 23 of participants misrepresent their preferences we explore the factors that predict preference misrepresentation including cognitive ability strategic positioning overconfidence expectations advice and trust we discuss the implications of this behavior for the design of allocation mechanisms and the social welfare in markets that use them | [['the', 'development', 'and', 'deployment', 'of', 'matching', 'procedures', 'that', 'incentivize', 'truthful', 'preference', 'reporting', 'is', 'considered', 'one', 'of', 'the', 'major', 'successes', 'of', 'market', 'design', 'research', 'in', 'this', 'study', 'we', 'test', 'the', 'degree', 'to', 'which', 'these', 'procedures', 'succeed', 'in', 'eliminating', 'preference', 'misrepresentation', 'we', 'administered', 'an', 'online', 'experiment', 'to', '1714', 'medical', 'students', 'immediately', 'after', 'their', 'participation', 'in', 'the', 'medical', 'residency', 'matcha', 'leading', 'field', 'application', 'of', 'strategyproof', 'market', 'design', 'when', 'placed', 'in', 'an', 'analogous', 'incentivized', 'matching', 'task', 'we', 'find', 'that', '23', 'of', 'participants', 'misrepresent', 'their', 'preferences', 'we', 'explore', 'the', 'factors', 'that', 'predict', 'preference', 'misrepresentation', 'including', 'cognitive', 'ability', 'strategic', 'positioning', 'overconfidence', 'expectations', 'advice', 'and', 'trust', 'we', 'discuss', 'the', 'implications', 'of', 'this', 'behavior', 'for', 'the', 'design', 'of', 'allocation', 'mechanisms', 'and', 'the', 'social', 'welfare', 'in', 'markets', 'that', 'use', 'them']] | [-0.09938617579423445, 0.019839546981138708, -0.05343944761778944, 0.10678094835886501, -0.15760697401705975, -0.1615939323544071, 0.1396720143812439, 0.45894599972246597, -0.22493273770044103, -0.33009623335905314, 0.08970190554641741, -0.2656214603507691, -0.18865066630119257, 0.11195914884490415, -0.13264326631160808, -0.0020051943984898653, 0.029741627418182114, 0.019401349825784564, 0.05312044879283048, -0.3431938854325178, 0.2928221507098002, 0.09979263804699025, 0.34100378457118163, 0.06778037854785884, 0.03328418710907875, 0.05469977994130016, -0.029692452362438372, -0.0038231882754490086, -0.13437473610614056, 0.15377018496024708, 0.38200860910794954, 0.23896316760258118, 0.4208121985073917, -0.4260581983368813, -0.08456770618915681, 0.12248167538368875, 0.07130770953872419, 0.041972071908930056, -0.07829831759945667, -0.27267492983551805, 0.026669521279217415, -0.22661300269371643, -0.10022736313437258, -0.0668145430155006, -0.029160854101665933, 0.011842733318340187, -0.29195666755068556, -0.01209644573809933, 0.0462912383281495, 0.09412231467941329, -0.07256910639953576, -0.13551972898912484, 0.04344177474306265, 0.21885875069410232, 0.12090635483445646, -0.06619452255054507, 0.1685323395558502, -0.22200085973744244, -0.2390682464465499, 0.4098859818667666, 0.040680854288814974, -0.0986512966400151, 0.12528816799917988, -0.09629428844652639, -0.15492362480549035, 0.06323726533735094, 0.24595149730578497, 0.03736648959067288, -0.1691590059373753, -0.027727444136172747, -0.03885019249629137, 0.1690911321385094, 0.08113266741048761, -0.01987559746177328, 0.18570638469743642, 0.18684506493866876, 0.09675336877761548, 0.07665822123877766, 0.011310171914885344, -0.09263401115236204, -0.2408286208029036, -0.14526123847535327, -0.09228019323199987, 0.04620665907167083, -0.10112112113200071, -0.11839851740870841, 0.369995186397852, 0.24118990739874835, 0.10382662096237841, 0.06346822335396332, 0.2822295806470735, 0.023302722483688643, 0.03190182141328523, 0.07000732039099497, 0.23543979747852017, -0.034760044960782305, 0.14456151094872596, -0.220725042631942, 0.1811549945364991, -0.0643258891645665] |
1,802.01991 | Dynamics of Wealth Inequality | We study an agent-based model of evolution of wealth distribution in a
macro-economic system. The evolution is driven by multiplicative stochastic
fluctuations governed by the law of proportionate growth and interactions
between agents. We are mainly interested in interactions increasing wealth
inequality that is in a local implementation of the accumulated advantage
principle. Such interactions destabilise the system. They are confronted in the
model with a global regulatory mechanism which reduces wealth inequality. There
are different scenarios emerging as a net effect of these two competing
mechanisms. When the effect of the global regulation (economic interventionism)
is too weak the system is unstable and it never reaches equilibrium. When the
effect is sufficiently strong the system evolves towards a limiting stationary
distribution with a Pareto tail. In between there is a critical phase. In this
phase the system may evolve towards a steady state with a multimodal wealth
distribution. The corresponding cumulative density function has a
characteristic stairway pattern which reflects the effect of economic
stratification. The stairs represent wealth levels of economic classes
separated by wealth gaps. As we show, the pattern is typical for macro-economic
systems with a limited economic freedom. One can find such a multimodal pattern
in empirical data, for instance, in the highest percentile of wealth
distribution for the population in urban areas of China.
| physics.soc-ph cond-mat.stat-mech q-fin.GN | we study an agentbased model of evolution of wealth distribution in a macroeconomic system the evolution is driven by multiplicative stochastic fluctuations governed by the law of proportionate growth and interactions between agents we are mainly interested in interactions increasing wealth inequality that is in a local implementation of the accumulated advantage principle such interactions destabilise the system they are confronted in the model with a global regulatory mechanism which reduces wealth inequality there are different scenarios emerging as a net effect of these two competing mechanisms when the effect of the global regulation economic interventionism is too weak the system is unstable and it never reaches equilibrium when the effect is sufficiently strong the system evolves towards a limiting stationary distribution with a pareto tail in between there is a critical phase in this phase the system may evolve towards a steady state with a multimodal wealth distribution the corresponding cumulative density function has a characteristic stairway pattern which reflects the effect of economic stratification the stairs represent wealth levels of economic classes separated by wealth gaps as we show the pattern is typical for macroeconomic systems with a limited economic freedom one can find such a multimodal pattern in empirical data for instance in the highest percentile of wealth distribution for the population in urban areas of china | [['we', 'study', 'an', 'agentbased', 'model', 'of', 'evolution', 'of', 'wealth', 'distribution', 'in', 'a', 'macroeconomic', 'system', 'the', 'evolution', 'is', 'driven', 'by', 'multiplicative', 'stochastic', 'fluctuations', 'governed', 'by', 'the', 'law', 'of', 'proportionate', 'growth', 'and', 'interactions', 'between', 'agents', 'we', 'are', 'mainly', 'interested', 'in', 'interactions', 'increasing', 'wealth', 'inequality', 'that', 'is', 'in', 'a', 'local', 'implementation', 'of', 'the', 'accumulated', 'advantage', 'principle', 'such', 'interactions', 'destabilise', 'the', 'system', 'they', 'are', 'confronted', 'in', 'the', 'model', 'with', 'a', 'global', 'regulatory', 'mechanism', 'which', 'reduces', 'wealth', 'inequality', 'there', 'are', 'different', 'scenarios', 'emerging', 'as', 'a', 'net', 'effect', 'of', 'these', 'two', 'competing', 'mechanisms', 'when', 'the', 'effect', 'of', 'the', 'global', 'regulation', 'economic', 'interventionism', 'is', 'too', 'weak', 'the', 'system', 'is', 'unstable', 'and', 'it', 'never', 'reaches', 'equilibrium', 'when', 'the', 'effect', 'is', 'sufficiently', 'strong', 'the', 'system', 'evolves', 'towards', 'a', 'limiting', 'stationary', 'distribution', 'with', 'a', 'pareto', 'tail', 'in', 'between', 'there', 'is', 'a', 'critical', 'phase', 'in', 'this', 'phase', 'the', 'system', 'may', 'evolve', 'towards', 'a', 'steady', 'state', 'with', 'a', 'multimodal', 'wealth', 'distribution', 'the', 'corresponding', 'cumulative', 'density', 'function', 'has', 'a', 'characteristic', 'stairway', 'pattern', 'which', 'reflects', 'the', 'effect', 'of', 'economic', 'stratification', 'the', 'stairs', 'represent', 'wealth', 'levels', 'of', 'economic', 'classes', 'separated', 'by', 'wealth', 'gaps', 'as', 'we', 'show', 'the', 'pattern', 'is', 'typical', 'for', 'macroeconomic', 'systems', 'with', 'a', 'limited', 'economic', 'freedom', 'one', 'can', 'find', 'such', 'a', 'multimodal', 'pattern', 'in', 'empirical', 'data', 'for', 'instance', 'in', 'the', 'highest', 'percentile', 'of', 'wealth', 'distribution', 'for', 'the', 'population', 'in', 'urban', 'areas', 'of', 'china']] | [-0.15084763924956968, 0.13486436742989688, -0.1257168013534985, 0.1023921769592894, -0.01974739595188772, -0.10364774441065853, 0.043889553123472695, 0.3346299351975492, -0.3109808203054073, -0.30263223460360883, 0.09296777417413363, -0.3089700931317458, -0.14635966287832283, 0.1642292626946314, -0.0376997057206592, 0.009752883398310031, 0.01796044192179085, 0.01232706553453673, 0.02017281207545197, -0.2020379859830793, 0.3405945774510112, 0.04293615554701792, 0.32177246915661306, 0.011805984191064932, 0.1110625631313082, -0.040924501855173, 0.012814316331923484, 0.03820033636452847, -0.09635484782829652, 0.09185378280676663, 0.23190585571473046, 0.14932625911721628, 0.3608130876604281, -0.41245358495985807, -0.22246152293532406, 0.14907937211550126, 0.13170229244036877, 0.09600488225648766, -0.05160476596237662, -0.23913811939475063, 0.0215462953868624, -0.21078702761391901, -0.15987786266008672, -0.03349066990614788, 0.04985214022868504, 0.07509809451153264, -0.286135897717596, 0.1085927801878621, 0.050685827282776194, 0.09033886480174924, -0.07167638737504205, -0.08884606249343399, -0.07679819956009348, 0.14677461965693178, 0.07549181681862059, -0.004950695361763443, 0.13711350130716757, -0.18959372428981544, -0.08394444758523273, 0.3496996671786387, -0.05693119809299401, -0.16825912639362628, 0.16920764487636483, -0.18078891713742049, -0.12207279518272167, 0.13094491153938448, 0.1849521784609945, 0.039970576697935245, -0.1598728430893572, 0.04231520716396488, -0.03557192986739638, 0.15718186175297588, -0.0008900248292476348, 0.03397249685468569, 0.24428071282787, 0.21779874299406224, 0.11218887194672165, 0.13689783312057116, -0.04464358592365515, -0.19099195170445904, -0.25805919963577295, -0.10500256633641172, -0.15396931777244696, 0.05599085260905563, -0.11668453769762065, -0.14327431149933845, 0.36847187462794384, 0.1087709840623126, 0.17845321075403936, 0.02687105182855981, 0.2494884962641281, 0.13827043729536576, 0.030671912222063023, 0.06673761384857214, 0.21717254645892814, 0.04623742994839606, 0.13066187738674825, -0.20490961201004174, 0.1893704214333195, -0.012209058570203511] |
1,802.01992 | Stable solutions to some elliptic problems: minimal cones, the
Allen-Cahn equation, and blow-up solutions | These notes record the lectures for the CIME Summer Course taught by the
first author in Cetraro during the week of June 19-23, 2017. The notes contain
the proofs of several results on the classification of stable solutions to some
nonlinear elliptic equations. The results are crucial steps within the
regularity theory of minimizers to such problems. We focus our attention on
three different equations, emphasizing that the techniques and ideas in the
three settings are quite similar.
The first topic is the stability of minimal cones. We prove the minimality of
the Simons cone in high dimensions, and we give almost all details in the proof
of J. Simons on the flatness of stable minimal cones in low dimensions.
Its semilinear analogue is a conjecture on the Allen-Cahn equation posed by
E. De Giorgi in 1978. This is our second problem, for which we discuss some
results, as well as an open problem in high dimensions on the saddle-shaped
solution vanishing on the Simons cone.
The third problem was raised by H. Brezis around 1996 and concerns the
boundedness of stable solutions to reaction-diffusion equations in bounded
domains. We present proofs on their regularity in low dimensions and discuss
the main open problem in this topic.
Moreover, we briefly comment on related results for harmonic maps, free
boundary problems, and nonlocal minimal surfaces.
| math.AP | these notes record the lectures for the cime summer course taught by the first author in cetraro during the week of june 1923 2017 the notes contain the proofs of several results on the classification of stable solutions to some nonlinear elliptic equations the results are crucial steps within the regularity theory of minimizers to such problems we focus our attention on three different equations emphasizing that the techniques and ideas in the three settings are quite similar the first topic is the stability of minimal cones we prove the minimality of the simons cone in high dimensions and we give almost all details in the proof of j simons on the flatness of stable minimal cones in low dimensions its semilinear analogue is a conjecture on the allencahn equation posed by e de giorgi in 1978 this is our second problem for which we discuss some results as well as an open problem in high dimensions on the saddleshaped solution vanishing on the simons cone the third problem was raised by h brezis around 1996 and concerns the boundedness of stable solutions to reactiondiffusion equations in bounded domains we present proofs on their regularity in low dimensions and discuss the main open problem in this topic moreover we briefly comment on related results for harmonic maps free boundary problems and nonlocal minimal surfaces | [['these', 'notes', 'record', 'the', 'lectures', 'for', 'the', 'cime', 'summer', 'course', 'taught', 'by', 'the', 'first', 'author', 'in', 'cetraro', 'during', 'the', 'week', 'of', 'june', '1923', '2017', 'the', 'notes', 'contain', 'the', 'proofs', 'of', 'several', 'results', 'on', 'the', 'classification', 'of', 'stable', 'solutions', 'to', 'some', 'nonlinear', 'elliptic', 'equations', 'the', 'results', 'are', 'crucial', 'steps', 'within', 'the', 'regularity', 'theory', 'of', 'minimizers', 'to', 'such', 'problems', 'we', 'focus', 'our', 'attention', 'on', 'three', 'different', 'equations', 'emphasizing', 'that', 'the', 'techniques', 'and', 'ideas', 'in', 'the', 'three', 'settings', 'are', 'quite', 'similar', 'the', 'first', 'topic', 'is', 'the', 'stability', 'of', 'minimal', 'cones', 'we', 'prove', 'the', 'minimality', 'of', 'the', 'simons', 'cone', 'in', 'high', 'dimensions', 'and', 'we', 'give', 'almost', 'all', 'details', 'in', 'the', 'proof', 'of', 'j', 'simons', 'on', 'the', 'flatness', 'of', 'stable', 'minimal', 'cones', 'in', 'low', 'dimensions', 'its', 'semilinear', 'analogue', 'is', 'a', 'conjecture', 'on', 'the', 'allencahn', 'equation', 'posed', 'by', 'e', 'de', 'giorgi', 'in', '1978', 'this', 'is', 'our', 'second', 'problem', 'for', 'which', 'we', 'discuss', 'some', 'results', 'as', 'well', 'as', 'an', 'open', 'problem', 'in', 'high', 'dimensions', 'on', 'the', 'saddleshaped', 'solution', 'vanishing', 'on', 'the', 'simons', 'cone', 'the', 'third', 'problem', 'was', 'raised', 'by', 'h', 'brezis', 'around', '1996', 'and', 'concerns', 'the', 'boundedness', 'of', 'stable', 'solutions', 'to', 'reactiondiffusion', 'equations', 'in', 'bounded', 'domains', 'we', 'present', 'proofs', 'on', 'their', 'regularity', 'in', 'low', 'dimensions', 'and', 'discuss', 'the', 'main', 'open', 'problem', 'in', 'this', 'topic', 'moreover', 'we', 'briefly', 'comment', 'on', 'related', 'results', 'for', 'harmonic', 'maps', 'free', 'boundary', 'problems', 'and', 'nonlocal', 'minimal', 'surfaces']] | [-0.12686670149092347, 0.06619668029614852, -0.054256701829477345, 0.08516130749558215, -0.06651589966350002, -0.11180939004069453, -0.014244230496842647, 0.279348881635607, -0.25089337258499916, -0.28716035525264616, 0.19802115148195298, -0.3016451229746703, -0.16440084304278052, 0.20803823774622288, -0.1551063107981463, 0.06644003609185997, 0.05714034490665654, -0.0027862648868384504, -0.06835219502785808, -0.3488698755209043, 0.378032781433311, 0.004911705252847501, 0.23413394333394016, 0.12129301188230913, 0.10758599555941016, 0.0007316015024636206, -0.04241313521924894, -0.015384810211669122, -0.20423491700697533, 0.13536943678004068, 0.2641133194972229, 0.07870808517483445, 0.29237964146471185, -0.42310316317889374, -0.17644353156356374, 0.04607072170100374, 0.06205076518693074, 0.09426321179125807, -0.02932574661203294, -0.29114377670755076, 0.08663947616046894, -0.06486632845813542, -0.1872354375310741, -0.0418069711314664, 0.01923037556948007, 0.017888496685872366, -0.16421231581963575, 0.07750891477293667, 0.12617337809570017, 0.08248494484411951, -0.12940529908727122, -0.12331950928741467, -0.003698250629115916, 0.06755352709192916, 0.06935846113317114, -0.013168374381556143, 0.01579554029324624, -0.11267360292341826, -0.15415319846319367, 0.35622559183944497, -0.06766445053991836, -0.19914993338586232, 0.18693867661516247, -0.12605647034693643, -0.18061164176664793, 0.06720043136738241, 0.1790783357189087, 0.18422603052892686, -0.09371946361560342, 0.15714123700308846, -0.07245227397548401, 0.10534409963137088, 0.1288153415132131, -0.029495274916241345, 0.13132416891208518, 0.12357156560340497, 0.10406845797634949, 0.117447254173125, -0.0009005563822159145, -0.09637012166993893, -0.35755071508486125, -0.15787879212127467, -0.14858885099965846, 0.057628552799412446, -0.06172525966050151, -0.15207260028260602, 0.4182129999847218, 0.13772272245426262, 0.1693635137531341, 0.03371786551724654, 0.2120326063777611, 0.11447914311013717, -0.027038376218115445, 0.07731727362365096, 0.22215320718818735, 0.14071833045246812, 0.16521949220415472, -0.16019654251704196, -0.006975177372493947, 0.17044880632413748] |
1,802.01993 | Elastoviscoplastic flow in porous media | We investigate the elastoviscoplastic flow through porous media by numerical
simulations. We solve the Navier-Stokes equations combined with the
elastoviscoplastic model proposed by Saramito for the stress tensor evolution.
In this model, the material behaves as a viscoelastic solid when unyielded, and
as a viscoelastic Oldroyd-B fluid for stresses higher than the yield stress.
The porous media is made of a symmetric array of cylinders, and we solve the
flow in one periodic cell. We find that the solution is time-dependent even at
low Reynolds numbers as we observe oscillations in time of the unyielded region
especially at high Bingham numbers. The volume of the unyielded region slightly
decreases with the Reynolds number and strongly increases with the Bingham
number; up to 70% of the total volume is unyielded for the highest Bingham
numbers considered here. The flow is mainly shear dominated in the yielded
region, while shear and elongational flow are equally distributed in the
unyielded region. We compute the relation between the pressure drop and the
flow rate in the porous medium and present an empirical closure as function of
the Bingham and Reynolds numbers. The apparent permeability, normalized with
the case of Newtonian fluids, is shown to be greater than 1 at low Bingham
numbers, corresponding to lower pressure drops due to the flow elasticity, and
smaller than 1 for high Bingham numbers, indicating larger dissipation in the
flow owing to the presence of the yielded regions. Finally we investigate the
effect of the Weissenberg number on the distribution of the unyielded regions
and on the pressure gradient.
| physics.flu-dyn | we investigate the elastoviscoplastic flow through porous media by numerical simulations we solve the navierstokes equations combined with the elastoviscoplastic model proposed by saramito for the stress tensor evolution in this model the material behaves as a viscoelastic solid when unyielded and as a viscoelastic oldroydb fluid for stresses higher than the yield stress the porous media is made of a symmetric array of cylinders and we solve the flow in one periodic cell we find that the solution is timedependent even at low reynolds numbers as we observe oscillations in time of the unyielded region especially at high bingham numbers the volume of the unyielded region slightly decreases with the reynolds number and strongly increases with the bingham number up to 70 of the total volume is unyielded for the highest bingham numbers considered here the flow is mainly shear dominated in the yielded region while shear and elongational flow are equally distributed in the unyielded region we compute the relation between the pressure drop and the flow rate in the porous medium and present an empirical closure as function of the bingham and reynolds numbers the apparent permeability normalized with the case of newtonian fluids is shown to be greater than 1 at low bingham numbers corresponding to lower pressure drops due to the flow elasticity and smaller than 1 for high bingham numbers indicating larger dissipation in the flow owing to the presence of the yielded regions finally we investigate the effect of the weissenberg number on the distribution of the unyielded regions and on the pressure gradient | [['we', 'investigate', 'the', 'elastoviscoplastic', 'flow', 'through', 'porous', 'media', 'by', 'numerical', 'simulations', 'we', 'solve', 'the', 'navierstokes', 'equations', 'combined', 'with', 'the', 'elastoviscoplastic', 'model', 'proposed', 'by', 'saramito', 'for', 'the', 'stress', 'tensor', 'evolution', 'in', 'this', 'model', 'the', 'material', 'behaves', 'as', 'a', 'viscoelastic', 'solid', 'when', 'unyielded', 'and', 'as', 'a', 'viscoelastic', 'oldroydb', 'fluid', 'for', 'stresses', 'higher', 'than', 'the', 'yield', 'stress', 'the', 'porous', 'media', 'is', 'made', 'of', 'a', 'symmetric', 'array', 'of', 'cylinders', 'and', 'we', 'solve', 'the', 'flow', 'in', 'one', 'periodic', 'cell', 'we', 'find', 'that', 'the', 'solution', 'is', 'timedependent', 'even', 'at', 'low', 'reynolds', 'numbers', 'as', 'we', 'observe', 'oscillations', 'in', 'time', 'of', 'the', 'unyielded', 'region', 'especially', 'at', 'high', 'bingham', 'numbers', 'the', 'volume', 'of', 'the', 'unyielded', 'region', 'slightly', 'decreases', 'with', 'the', 'reynolds', 'number', 'and', 'strongly', 'increases', 'with', 'the', 'bingham', 'number', 'up', 'to', '70', 'of', 'the', 'total', 'volume', 'is', 'unyielded', 'for', 'the', 'highest', 'bingham', 'numbers', 'considered', 'here', 'the', 'flow', 'is', 'mainly', 'shear', 'dominated', 'in', 'the', 'yielded', 'region', 'while', 'shear', 'and', 'elongational', 'flow', 'are', 'equally', 'distributed', 'in', 'the', 'unyielded', 'region', 'we', 'compute', 'the', 'relation', 'between', 'the', 'pressure', 'drop', 'and', 'the', 'flow', 'rate', 'in', 'the', 'porous', 'medium', 'and', 'present', 'an', 'empirical', 'closure', 'as', 'function', 'of', 'the', 'bingham', 'and', 'reynolds', 'numbers', 'the', 'apparent', 'permeability', 'normalized', 'with', 'the', 'case', 'of', 'newtonian', 'fluids', 'is', 'shown', 'to', 'be', 'greater', 'than', '1', 'at', 'low', 'bingham', 'numbers', 'corresponding', 'to', 'lower', 'pressure', 'drops', 'due', 'to', 'the', 'flow', 'elasticity', 'and', 'smaller', 'than', '1', 'for', 'high', 'bingham', 'numbers', 'indicating', 'larger', 'dissipation', 'in', 'the', 'flow', 'owing', 'to', 'the', 'presence', 'of', 'the', 'yielded', 'regions', 'finally', 'we', 'investigate', 'the', 'effect', 'of', 'the', 'weissenberg', 'number', 'on', 'the', 'distribution', 'of', 'the', 'unyielded', 'regions', 'and', 'on', 'the', 'pressure', 'gradient']] | [-0.14017172801944142, 0.18306058788713506, -0.05642527719923796, -0.008535316097550094, -0.01670161216215302, -0.07260794485381876, -0.01467421919447728, 0.2951706822245167, -0.2760888969919716, -0.3109118707334766, 0.0929480899488016, -0.2870510285720229, -0.09595539815804491, 0.1869515469414182, -0.026514247434701807, 0.05756212687657143, -0.007239033811940597, 0.019972929357139107, -0.022504484581832702, -0.18388195741706742, 0.281567232776881, 0.050981026604914895, 0.31354356879869905, 0.05689985596512158, 0.1083912387991754, -0.07026757342167772, -0.009013420381010152, 0.12707300743338867, -0.18905884542459367, 0.0433951774182228, 0.1955881975313577, -0.008394741515915554, 0.2542816176213539, -0.44688781099393965, -0.24079471969541302, 0.06685764060284083, 0.12603813240057207, 0.08097442796615024, 0.001121246000716033, -0.1875596143690368, 0.09644410776583334, -0.181158814790587, -0.1375624547946455, -0.032346082411822866, 0.0560886750338026, 0.0628767721478093, -0.2530084254255948, 0.18411019892754177, 0.011628568505581754, 0.07023202715194762, -0.10203523532165071, -0.1147081870612545, -0.04267380996428143, 0.06495949546996808, 0.10696709637368958, 0.0018482209039995304, 0.1571693152498203, -0.21757001930158226, 0.034442532195064886, 0.4121658356072238, -0.05346481994599274, -0.22477104904201742, 0.2044260901148216, -0.19357269206979813, -0.021020086946597214, 0.1896310617430852, 0.21144922731014398, 0.10856842718337878, -0.050757060725915765, -0.014650655843210049, -0.06743007328791115, 0.1654022881783581, 0.094457477146688, -0.0754774376624622, 0.1585039735299338, 0.1883044465847958, 0.06948851722722443, 0.19159068584245129, -0.12493388529401273, -0.09210416871937924, -0.28223264418327465, -0.18327398177307958, -0.17476470255395934, 0.01846024375050687, -0.15783224973168286, -0.16426977023444264, 0.31306515560270504, 0.08423923924744416, 0.1914575618273095, 0.09065428827531062, 0.28099665601039303, 0.11271333245094865, 0.05060066946003085, 0.13929510253768126, 0.2871871491240409, 0.18490333505279313, 0.1764153372236671, -0.23662550947628916, 0.05820489106431174, 0.05876770720888789] |
1,802.01994 | Resolutions and homological dimensions of DG-modules | Recently, Yekutieli introduced projective dimension and injective dimension
of DG-modules by generalizing the characterization of projective dimension and
injective dimension of ordinary modules by vanishing of Ext-group. In this
paper, we introduce DG-version of projective resolution and injective
resolution for DG-modules over a connective DG-algebra which are different from
known DG-version of projective and injective resolutions. An important feature
of these resolutions is that, roughly speaking, the "length" of these
resolutions give projective or injective dimensions. We show that these
resolutions allows us to investigate basic properties of projective and
injective dimensions of DG-modules. As an application we introduce the global
dimension of a connective DG-algebra and show that finiteness of global
dimension is derived invariant.
| math.RA math.AC math.RT | recently yekutieli introduced projective dimension and injective dimension of dgmodules by generalizing the characterization of projective dimension and injective dimension of ordinary modules by vanishing of extgroup in this paper we introduce dgversion of projective resolution and injective resolution for dgmodules over a connective dgalgebra which are different from known dgversion of projective and injective resolutions an important feature of these resolutions is that roughly speaking the length of these resolutions give projective or injective dimensions we show that these resolutions allows us to investigate basic properties of projective and injective dimensions of dgmodules as an application we introduce the global dimension of a connective dgalgebra and show that finiteness of global dimension is derived invariant | [['recently', 'yekutieli', 'introduced', 'projective', 'dimension', 'and', 'injective', 'dimension', 'of', 'dgmodules', 'by', 'generalizing', 'the', 'characterization', 'of', 'projective', 'dimension', 'and', 'injective', 'dimension', 'of', 'ordinary', 'modules', 'by', 'vanishing', 'of', 'extgroup', 'in', 'this', 'paper', 'we', 'introduce', 'dgversion', 'of', 'projective', 'resolution', 'and', 'injective', 'resolution', 'for', 'dgmodules', 'over', 'a', 'connective', 'dgalgebra', 'which', 'are', 'different', 'from', 'known', 'dgversion', 'of', 'projective', 'and', 'injective', 'resolutions', 'an', 'important', 'feature', 'of', 'these', 'resolutions', 'is', 'that', 'roughly', 'speaking', 'the', 'length', 'of', 'these', 'resolutions', 'give', 'projective', 'or', 'injective', 'dimensions', 'we', 'show', 'that', 'these', 'resolutions', 'allows', 'us', 'to', 'investigate', 'basic', 'properties', 'of', 'projective', 'and', 'injective', 'dimensions', 'of', 'dgmodules', 'as', 'an', 'application', 'we', 'introduce', 'the', 'global', 'dimension', 'of', 'a', 'connective', 'dgalgebra', 'and', 'show', 'that', 'finiteness', 'of', 'global', 'dimension', 'is', 'derived', 'invariant']] | [-0.14045246946216935, 0.052632241234389594, -0.03543632518369378, 0.06772870101185777, -0.027356733821267097, -0.16601165096487916, -0.12515665852084853, 0.3627201115810557, -0.3489337754190752, -0.19707353661457697, 0.10817141927627585, -0.15250415829525496, -0.15761270097317992, 0.1769828209633073, -0.19502177237320625, -0.0028348169616309172, 0.009750139991458701, 0.07961589268310681, -0.09176046897354945, -0.3025779908057302, 0.47858611111970323, 0.020386637188494205, 0.2155390343579807, 0.06720699116652995, 0.22030477044826144, 0.03058149430261549, -0.08520304476188724, 0.07077406175238521, -0.23225293894140855, 0.18630654436307387, 0.33774480517757566, 0.12478409210432387, 0.12834327249673375, -0.33945579284377264, -0.17418665369041264, 0.19424596551924192, 0.12775930246795741, 0.003288479023276044, 0.04866474667939831, -0.2400755128055288, 0.11002658155191232, -0.18309232633430184, -0.1434632129150263, -0.11802670569567565, 0.07184182694426884, -0.01970451578024056, -0.22884320813280187, 0.031307158266651654, 0.14851207927424917, 0.18071270811681947, -0.05633681494254505, -0.0575097088718362, -0.1002287041975937, 0.09982062090727452, -0.07018360702664052, -0.02423798640487356, 0.057218789801066906, -0.10447005067927469, -0.16111716849467994, 0.31413008404176745, -0.037970862400374915, -0.18582804166924274, 0.21760154543893837, -0.1755573828255333, -0.10647229733876884, 0.15374042478128613, 0.04798827960825803, 0.16384495316551215, 0.029799871979967543, 0.2021478758032205, -0.14453959640671024, 0.15070703393665322, 0.17225392155855762, 0.0908772139784496, 0.09203768934719592, 0.12344032259282182, 0.11524652320842602, 0.13319556544159064, -0.0635315234325581, 0.021464546925894785, -0.33347692950056834, -0.2269550712019401, -0.08996122923941073, 0.2193818782995406, -0.09780525542277917, -0.12915739478347332, 0.40614635923779324, 0.14401892350431075, 0.23197463205443664, 0.1639654464261982, 0.2856714089356134, -0.011348933787207659, 0.05644990315072631, 0.002814288835220954, 0.12348382827915709, 0.22187901558783396, -0.03699511826843056, -0.09633122417021935, -0.056844086584373656, 0.2526171691634022] |
1,802.01995 | Topological defects in the Liouville field theories with different
cosmological constants | We construct topological defects in the Liouville field theory producing jump
in the value of cosmological constant. We construct them using the
Cardy-Lewellen equation for the two-point function with defect. We show that
there are continuous and discrete families of such kind of defects. For the
continuous family of defects we also find the Lagrangian description and check
its agreement with the solution of the Cardy-Lewellen equation using the heavy
asymptotic semiclasscial limit.
| hep-th | we construct topological defects in the liouville field theory producing jump in the value of cosmological constant we construct them using the cardylewellen equation for the twopoint function with defect we show that there are continuous and discrete families of such kind of defects for the continuous family of defects we also find the lagrangian description and check its agreement with the solution of the cardylewellen equation using the heavy asymptotic semiclasscial limit | [['we', 'construct', 'topological', 'defects', 'in', 'the', 'liouville', 'field', 'theory', 'producing', 'jump', 'in', 'the', 'value', 'of', 'cosmological', 'constant', 'we', 'construct', 'them', 'using', 'the', 'cardylewellen', 'equation', 'for', 'the', 'twopoint', 'function', 'with', 'defect', 'we', 'show', 'that', 'there', 'are', 'continuous', 'and', 'discrete', 'families', 'of', 'such', 'kind', 'of', 'defects', 'for', 'the', 'continuous', 'family', 'of', 'defects', 'we', 'also', 'find', 'the', 'lagrangian', 'description', 'and', 'check', 'its', 'agreement', 'with', 'the', 'solution', 'of', 'the', 'cardylewellen', 'equation', 'using', 'the', 'heavy', 'asymptotic', 'semiclasscial', 'limit']] | [-0.1181647737944269, 0.0870120477709562, -0.08794426767487232, 0.0742879118770361, -0.02376739338856854, -0.09452529581365725, 0.009045088387808877, 0.3513772152109097, -0.25252721977279813, -0.2572860965020444, 0.0767079955190165, -0.30280237206040994, -0.1542750679415791, 0.15555536665328562, 0.006197009005979316, 0.07708478070817862, 0.0029305753247072437, 0.046066042520616156, -0.10971238252655795, -0.21898510830145176, 0.3665672497862108, -0.04972702350263318, 0.24815013008638706, 0.04478097523320211, 0.11865799750954117, 0.0062257242580390955, -0.010185714817465576, 0.03043890417846915, -0.2232705094467423, 0.10283512540467799, 0.2032442046329379, 0.05510281285347596, 0.17988748562662568, -0.4122631960127452, -0.21362965258016978, 0.1236111555082647, 0.10328334375373917, 0.1774414339396235, -0.09387747415226616, -0.25951109994968324, 0.10590164346639577, -0.14255811916887506, -0.21474320440208666, -0.09817955363541842, -0.009387403319124132, 0.050577275474134785, -0.24435323465947215, 0.10230462135362745, 0.015846223455585846, 0.03262242238509328, -0.10389750779523475, -0.05773579552514504, -0.06375458771490479, 0.08970725883359779, 0.07473363934008226, 0.0254594664063866, 0.07739248862872793, -0.1470998042224817, -0.09172484313125072, 0.3528510639515756, -0.13121917365399532, -0.22310684333644706, 0.14424143170089498, -0.13764563978534855, -0.18396310387051676, 0.07953620608896017, 0.08775998062090566, 0.13441288851624936, -0.1077449743265975, 0.15053671327808693, -0.03399424725658681, 0.12870321717362035, 0.08022547396512268, 0.04259749997974523, 0.19327362614033156, 0.10586495524310596, 0.05766234335119594, 0.1581130980526748, -0.04534453223020872, -0.11896016836574633, -0.38184197063315406, -0.1984010240165134, -0.162605191517162, 0.08387245954818105, -0.13921261434275847, -0.24910361617675994, 0.3804628302228369, 0.13489453611920957, 0.16476085174139843, 0.0891874956911149, 0.16591523138627615, 0.19650948273451768, 0.011868947565121806, 0.07154422671827551, 0.20462067297672573, 0.13851939373943087, 0.04845267316096858, -0.22753096837550402, -0.014270075715676409, 0.13205591268990546] |
1,802.01996 | When acting as a reproductive barrier for sympatric speciation, hybrid
sterility can only be primary | In many animals parental gametes unite to form a zygote that develops into an
adult with gonads that, in turn, produce gametes. Interruption of this germinal
cycle by prezygotic or postzygotic reproductive barriers can result in two
independent cycles, each with the potential to evolve into a new species. When
the speciation process is complete, members of each species are fully
reproductively isolated from those of the other. During speciation a primary
barrier may be supported and eventually superceded by a later appearing
secondary barrier. For those holding certain cases of prezygotic isolation to
be primary (e.g. elephant cannot copulate with mouse), the onus is to show that
they had not been preceded over evolutionary time by periods of postzygotic
hybrid inviability (genically determined) or sterility (genically or
chromosomally determined). Likewise, the onus is upon those holding cases of
hybrid inviability to be primary (e.g. Dobzhansky-Muller epistatic
incompatibilities), to show that they had not been preceded by periods, however
brief, of hybrid sterility. The latter, when acting as a sympatric barrier
causing reproductive isolation, can only be primary. In many cases, hybrid
sterility may result from incompatibilities between parental chromosomes that
attempt to pair during meiosis in the gonad of their offspring
(Winge-Crowther-Bateson incompatibilities). While WCB incompatibilities have
long been observed on a microscopic scale, there is growing evidence for a role
of dispersed finer DNA sequence differences.
| q-bio.PE | in many animals parental gametes unite to form a zygote that develops into an adult with gonads that in turn produce gametes interruption of this germinal cycle by prezygotic or postzygotic reproductive barriers can result in two independent cycles each with the potential to evolve into a new species when the speciation process is complete members of each species are fully reproductively isolated from those of the other during speciation a primary barrier may be supported and eventually superceded by a later appearing secondary barrier for those holding certain cases of prezygotic isolation to be primary eg elephant cannot copulate with mouse the onus is to show that they had not been preceded over evolutionary time by periods of postzygotic hybrid inviability genically determined or sterility genically or chromosomally determined likewise the onus is upon those holding cases of hybrid inviability to be primary eg dobzhanskymuller epistatic incompatibilities to show that they had not been preceded by periods however brief of hybrid sterility the latter when acting as a sympatric barrier causing reproductive isolation can only be primary in many cases hybrid sterility may result from incompatibilities between parental chromosomes that attempt to pair during meiosis in the gonad of their offspring wingecrowtherbateson incompatibilities while wcb incompatibilities have long been observed on a microscopic scale there is growing evidence for a role of dispersed finer dna sequence differences | [['in', 'many', 'animals', 'parental', 'gametes', 'unite', 'to', 'form', 'a', 'zygote', 'that', 'develops', 'into', 'an', 'adult', 'with', 'gonads', 'that', 'in', 'turn', 'produce', 'gametes', 'interruption', 'of', 'this', 'germinal', 'cycle', 'by', 'prezygotic', 'or', 'postzygotic', 'reproductive', 'barriers', 'can', 'result', 'in', 'two', 'independent', 'cycles', 'each', 'with', 'the', 'potential', 'to', 'evolve', 'into', 'a', 'new', 'species', 'when', 'the', 'speciation', 'process', 'is', 'complete', 'members', 'of', 'each', 'species', 'are', 'fully', 'reproductively', 'isolated', 'from', 'those', 'of', 'the', 'other', 'during', 'speciation', 'a', 'primary', 'barrier', 'may', 'be', 'supported', 'and', 'eventually', 'superceded', 'by', 'a', 'later', 'appearing', 'secondary', 'barrier', 'for', 'those', 'holding', 'certain', 'cases', 'of', 'prezygotic', 'isolation', 'to', 'be', 'primary', 'eg', 'elephant', 'can', 'not', 'copulate', 'with', 'mouse', 'the', 'onus', 'is', 'to', 'show', 'that', 'they', 'had', 'not', 'been', 'preceded', 'over', 'evolutionary', 'time', 'by', 'periods', 'of', 'postzygotic', 'hybrid', 'inviability', 'genically', 'determined', 'or', 'sterility', 'genically', 'or', 'chromosomally', 'determined', 'likewise', 'the', 'onus', 'is', 'upon', 'those', 'holding', 'cases', 'of', 'hybrid', 'inviability', 'to', 'be', 'primary', 'eg', 'dobzhanskymuller', 'epistatic', 'incompatibilities', 'to', 'show', 'that', 'they', 'had', 'not', 'been', 'preceded', 'by', 'periods', 'however', 'brief', 'of', 'hybrid', 'sterility', 'the', 'latter', 'when', 'acting', 'as', 'a', 'sympatric', 'barrier', 'causing', 'reproductive', 'isolation', 'can', 'only', 'be', 'primary', 'in', 'many', 'cases', 'hybrid', 'sterility', 'may', 'result', 'from', 'incompatibilities', 'between', 'parental', 'chromosomes', 'that', 'attempt', 'to', 'pair', 'during', 'meiosis', 'in', 'the', 'gonad', 'of', 'their', 'offspring', 'wingecrowtherbateson', 'incompatibilities', 'while', 'wcb', 'incompatibilities', 'have', 'long', 'been', 'observed', 'on', 'a', 'microscopic', 'scale', 'there', 'is', 'growing', 'evidence', 'for', 'a', 'role', 'of', 'dispersed', 'finer', 'dna', 'sequence', 'differences']] | [-0.10843481545929204, 0.21651785594513057, -0.08685788050233069, 0.060764159595857396, -0.050469974217280236, -0.16238184262130578, 0.06234976632404141, 0.3916474758233314, -0.2499459577449174, -0.29676384974577974, 0.08963236274906773, -0.2439493408916116, -0.14073491919764572, 0.15901069386163727, -0.12196970228105783, -0.0724055090516975, 0.09700881608454934, 0.03929155268071389, 0.05455764878795228, -0.24622799034484408, 0.2646984070481267, 0.029832362550818784, 0.20380849930119108, 0.019342905234291472, 0.04798622980914925, -0.025582057155076075, 0.007496293166398325, 0.015182629036784915, -0.08048418531573341, 0.07110088490881025, 0.2501059409908273, 0.14836511508669487, 0.3150593842885097, -0.4868079773404381, -0.2238201873101802, 0.1595133401411162, 0.19885057549624682, 0.11042944110972298, -0.03552675340218808, -0.22840376199138435, 0.10267628393432295, -0.17040829971983013, -0.09358592006081545, 0.011962507155046544, 0.045001733967695724, 0.06328401840205929, -0.23215703023385934, 0.08630831023328937, 0.05177740582518957, 0.06742011219982735, -0.05223358587510037, -0.13394525461957196, -0.09628954618661241, 0.19449908204075075, 0.08934845064160817, 0.013993361237755214, 0.1435023644939065, -0.10681069676462687, -0.10868104695850475, 0.3356137364552441, 0.0029204034712165595, -0.13396272222717842, 0.2249729803789788, -0.1348904185505076, -0.1445634081282399, 0.14582949251052924, 0.12637883516621184, 0.06641739020124078, -0.16775798563996266, -0.02989506464139347, 0.028943501658398995, 0.15200706833910027, 0.13971080408346923, -0.008905459974828939, 0.27436381456103515, 0.15403113630282778, 0.026223194011783395, 0.0810634342681045, -0.02999929035061293, -0.12309664024743887, -0.19454525161365216, -0.13850057436449623, -0.10837759857637469, 0.07203827414004164, -0.022021476691522615, -0.15812122239837084, 0.3441931740751236, 0.06945352207985707, 0.20189288924024865, 0.030952428170183503, 0.23862195152006196, 0.059651774188784076, 0.1500414234063514, 0.014880364094014194, 0.1951245613152754, 0.04260456443510272, 0.06389127332262103, -0.1798075211996382, 0.1812386451162059, 0.021642110819547353] |
1,802.01997 | Strong Algorithms for the Ordinal Matroid Secretary Problem | In the ordinal Matroid Secretary Problem (MSP), elements from a weighted
matroid are presented in random order to an algorithm that must incrementally
select a large weight independent set. However, the algorithm can only compare
pairs of revealed elements without using its numerical value. An algorithm is
$\alpha$ probability-competitive if every element from the optimum appears with
probability $1/\alpha$ in the output. We present a technique to design
algorithms with strong probability-competitive ratios, improving the guarantees
for almost every matroid class considered in the literature: e.g., we get
ratios of 4 for graphic matroids (improving on $2e$ by Korula and P\'al [ICALP
2009]) and of 5.19 for laminar matroids (improving on 9.6 by Ma et al. [THEOR
COMPUT SYST 2016]). We also obtain new results for superclasses of $k$ column
sparse matroids, for hypergraphic matroids, certain gammoids and graph packing
matroids, and a $1+O(\sqrt{\log \rho/\rho})$ probability-competitive algorithm
for uniform matroids of rank $\rho$ based on Kleinberg's $1+O(\sqrt{1/\rho})$
utility-competitive algorithm [SODA 2005] for that class. Our second
contribution are algorithms for the ordinal MSP on arbitrary matroids of rank
$\rho$. We devise an $O(\log \rho)$ probability-competitive algorithm and an
$O(\log\log \rho)$ ordinal-competitive algorithm, a weaker notion of
competitiveness but stronger than the utility variant. These are based on the
$O(\log\log \rho)$ utility-competitive algorithm by Feldman et al.~[SODA 2015].
| cs.DS | in the ordinal matroid secretary problem msp elements from a weighted matroid are presented in random order to an algorithm that must incrementally select a large weight independent set however the algorithm can only compare pairs of revealed elements without using its numerical value an algorithm is alpha probabilitycompetitive if every element from the optimum appears with probability 1alpha in the output we present a technique to design algorithms with strong probabilitycompetitive ratios improving the guarantees for almost every matroid class considered in the literature eg we get ratios of 4 for graphic matroids improving on 2e by korula and pal icalp 2009 and of 519 for laminar matroids improving on 96 by ma et al theor comput syst 2016 we also obtain new results for superclasses of k column sparse matroids for hypergraphic matroids certain gammoids and graph packing matroids and a 1osqrtlog rhorho probabilitycompetitive algorithm for uniform matroids of rank rho based on kleinbergs 1osqrt1rho utilitycompetitive algorithm soda 2005 for that class our second contribution are algorithms for the ordinal msp on arbitrary matroids of rank rho we devise an olog rho probabilitycompetitive algorithm and an ologlog rho ordinalcompetitive algorithm a weaker notion of competitiveness but stronger than the utility variant these are based on the ologlog rho utilitycompetitive algorithm by feldman et alsoda 2015 | [['in', 'the', 'ordinal', 'matroid', 'secretary', 'problem', 'msp', 'elements', 'from', 'a', 'weighted', 'matroid', 'are', 'presented', 'in', 'random', 'order', 'to', 'an', 'algorithm', 'that', 'must', 'incrementally', 'select', 'a', 'large', 'weight', 'independent', 'set', 'however', 'the', 'algorithm', 'can', 'only', 'compare', 'pairs', 'of', 'revealed', 'elements', 'without', 'using', 'its', 'numerical', 'value', 'an', 'algorithm', 'is', 'alpha', 'probabilitycompetitive', 'if', 'every', 'element', 'from', 'the', 'optimum', 'appears', 'with', 'probability', '1alpha', 'in', 'the', 'output', 'we', 'present', 'a', 'technique', 'to', 'design', 'algorithms', 'with', 'strong', 'probabilitycompetitive', 'ratios', 'improving', 'the', 'guarantees', 'for', 'almost', 'every', 'matroid', 'class', 'considered', 'in', 'the', 'literature', 'eg', 'we', 'get', 'ratios', 'of', '4', 'for', 'graphic', 'matroids', 'improving', 'on', '2e', 'by', 'korula', 'and', 'pal', 'icalp', '2009', 'and', 'of', '519', 'for', 'laminar', 'matroids', 'improving', 'on', '96', 'by', 'ma', 'et', 'al', 'theor', 'comput', 'syst', '2016', 'we', 'also', 'obtain', 'new', 'results', 'for', 'superclasses', 'of', 'k', 'column', 'sparse', 'matroids', 'for', 'hypergraphic', 'matroids', 'certain', 'gammoids', 'and', 'graph', 'packing', 'matroids', 'and', 'a', '1osqrtlog', 'rhorho', 'probabilitycompetitive', 'algorithm', 'for', 'uniform', 'matroids', 'of', 'rank', 'rho', 'based', 'on', 'kleinbergs', '1osqrt1rho', 'utilitycompetitive', 'algorithm', 'soda', '2005', 'for', 'that', 'class', 'our', 'second', 'contribution', 'are', 'algorithms', 'for', 'the', 'ordinal', 'msp', 'on', 'arbitrary', 'matroids', 'of', 'rank', 'rho', 'we', 'devise', 'an', 'olog', 'rho', 'probabilitycompetitive', 'algorithm', 'and', 'an', 'ologlog', 'rho', 'ordinalcompetitive', 'algorithm', 'a', 'weaker', 'notion', 'of', 'competitiveness', 'but', 'stronger', 'than', 'the', 'utility', 'variant', 'these', 'are', 'based', 'on', 'the', 'ologlog', 'rho', 'utilitycompetitive', 'algorithm', 'by', 'feldman', 'et', 'alsoda', '2015']] | [-0.11046338707574983, 0.07731445672203482, -0.03439769945747409, 0.019870970270737687, -0.09092802767116594, -0.16440840992388003, 0.10661345854251518, 0.3933839180517249, -0.2559025713123416, -0.3437945883582077, 0.050996107737157466, -0.2488914031857598, -0.15409922495570422, 0.1820137371856419, -0.1281601549148277, 0.06960726126789014, 0.05349636965285616, 0.01982061876540218, -0.03190726271093386, -0.3480341149726055, 0.24439182201338605, 0.05956557882680465, 0.20003803559938685, 0.016365279143420158, 0.08405824666577988, 0.0707485734449779, -0.023958747451727706, 0.04906709577393899, -0.16773555915885752, 0.10590737110381214, 0.25991607089173846, 0.20423671587226747, 0.2526505747721729, -0.33044946147873777, -0.09537500611471092, 0.1302023320679522, 0.09036444718360523, 0.050708285419786815, -0.001546861510613483, -0.24625799564867593, 0.14591922792407433, -0.1449346915428125, -0.05049293696156469, -0.04527787509865637, 0.09707861434628579, 0.017594390788768812, -0.37325920609942687, 0.020715593308363756, 0.1087848589627593, 0.03980639173485939, -0.03367369948506744, -0.2495372080623715, 0.04238191885118907, 0.025139011870804837, -0.05809120351550174, 0.11760830829776293, 0.039617125477346096, -0.06819520014011571, -0.20062958616961976, 0.33530045520531904, -0.024659676022479482, -0.14228008683965104, 0.13237756928561423, -0.07181033289933939, -0.22436047174804513, 0.15090051136681396, 0.1865419611330387, 0.14179990852336616, -0.07233556877420023, 0.12115217589412405, -0.1764322307260963, 0.17368392815797698, 0.11598261605652482, -0.0067292163810600035, 0.0802729761904388, 0.11146755545219116, 0.14064860538914975, 0.14304913823510482, -0.0015612061595338975, -0.014435779390209994, -0.21838130652727958, -0.1316586010990073, -0.17366093894912557, 0.014112564604905968, -0.1774315833026776, -0.1449758628498039, 0.3240737422651907, 0.10729253050756433, 0.17616651210836268, 0.17220193565099265, 0.24666266153473848, 0.05757686813998917, -0.024010599334834595, 0.21923341959167572, 0.1907445229623043, 0.18398596862688554, 0.061341998354924654, -0.13997071951650353, 0.11069482274343022, 0.1810980633152781] |
1,802.01998 | From cool to hot F-stars: the influence of two ionization regions in the
acoustic oscillations | The high-precision data available from the Kepler satellite allows us to
venture in the study of the complex outer convective envelopes of solar-type
stars. We use a seismic diagnostic, specialized for investigating the outer
layers of solar-type stars, to infer the impact of the ionization processes on
the oscillation spectrum, for a sample of Kepler stars. These stars, of
spectral type F, cover all of the observational seismic domain of the acoustic
oscillation spectrum in solar-type stars. They also cover the range between a
cool F-dwarf (\sim 6000 K) and a hotter F-star (\sim 6400 K). Our study reveals
the existence of two relevant ionization regions. One of these regions, which
is located closer to the surface of the star, is commonly associated with the
second ionization of helium, although other chemical species also contribute to
ionization. The second region, located deeper in the envelope, is linked with
the ionization of heavy elements. Specifically, in this study, we analyze the
elements carbon, nitrogen, oxygen, neon, and iron. Both regions can be related
to the K electronic shell. We show that, while for cooler stars like the Sun,
the influence of this second region on the oscillation frequencies is small; in
hotter stars, its influence becomes comparable to the influence of the region
of the second ionization of helium. This can guide us in the study of the outer
layers of F-stars, specifically with the understanding of phenomena related to
rotation and magnetic activity in these stars.
| astro-ph.SR | the highprecision data available from the kepler satellite allows us to venture in the study of the complex outer convective envelopes of solartype stars we use a seismic diagnostic specialized for investigating the outer layers of solartype stars to infer the impact of the ionization processes on the oscillation spectrum for a sample of kepler stars these stars of spectral type f cover all of the observational seismic domain of the acoustic oscillation spectrum in solartype stars they also cover the range between a cool fdwarf sim 6000 k and a hotter fstar sim 6400 k our study reveals the existence of two relevant ionization regions one of these regions which is located closer to the surface of the star is commonly associated with the second ionization of helium although other chemical species also contribute to ionization the second region located deeper in the envelope is linked with the ionization of heavy elements specifically in this study we analyze the elements carbon nitrogen oxygen neon and iron both regions can be related to the k electronic shell we show that while for cooler stars like the sun the influence of this second region on the oscillation frequencies is small in hotter stars its influence becomes comparable to the influence of the region of the second ionization of helium this can guide us in the study of the outer layers of fstars specifically with the understanding of phenomena related to rotation and magnetic activity in these stars | [['the', 'highprecision', 'data', 'available', 'from', 'the', 'kepler', 'satellite', 'allows', 'us', 'to', 'venture', 'in', 'the', 'study', 'of', 'the', 'complex', 'outer', 'convective', 'envelopes', 'of', 'solartype', 'stars', 'we', 'use', 'a', 'seismic', 'diagnostic', 'specialized', 'for', 'investigating', 'the', 'outer', 'layers', 'of', 'solartype', 'stars', 'to', 'infer', 'the', 'impact', 'of', 'the', 'ionization', 'processes', 'on', 'the', 'oscillation', 'spectrum', 'for', 'a', 'sample', 'of', 'kepler', 'stars', 'these', 'stars', 'of', 'spectral', 'type', 'f', 'cover', 'all', 'of', 'the', 'observational', 'seismic', 'domain', 'of', 'the', 'acoustic', 'oscillation', 'spectrum', 'in', 'solartype', 'stars', 'they', 'also', 'cover', 'the', 'range', 'between', 'a', 'cool', 'fdwarf', 'sim', '6000', 'k', 'and', 'a', 'hotter', 'fstar', 'sim', '6400', 'k', 'our', 'study', 'reveals', 'the', 'existence', 'of', 'two', 'relevant', 'ionization', 'regions', 'one', 'of', 'these', 'regions', 'which', 'is', 'located', 'closer', 'to', 'the', 'surface', 'of', 'the', 'star', 'is', 'commonly', 'associated', 'with', 'the', 'second', 'ionization', 'of', 'helium', 'although', 'other', 'chemical', 'species', 'also', 'contribute', 'to', 'ionization', 'the', 'second', 'region', 'located', 'deeper', 'in', 'the', 'envelope', 'is', 'linked', 'with', 'the', 'ionization', 'of', 'heavy', 'elements', 'specifically', 'in', 'this', 'study', 'we', 'analyze', 'the', 'elements', 'carbon', 'nitrogen', 'oxygen', 'neon', 'and', 'iron', 'both', 'regions', 'can', 'be', 'related', 'to', 'the', 'k', 'electronic', 'shell', 'we', 'show', 'that', 'while', 'for', 'cooler', 'stars', 'like', 'the', 'sun', 'the', 'influence', 'of', 'this', 'second', 'region', 'on', 'the', 'oscillation', 'frequencies', 'is', 'small', 'in', 'hotter', 'stars', 'its', 'influence', 'becomes', 'comparable', 'to', 'the', 'influence', 'of', 'the', 'region', 'of', 'the', 'second', 'ionization', 'of', 'helium', 'this', 'can', 'guide', 'us', 'in', 'the', 'study', 'of', 'the', 'outer', 'layers', 'of', 'fstars', 'specifically', 'with', 'the', 'understanding', 'of', 'phenomena', 'related', 'to', 'rotation', 'and', 'magnetic', 'activity', 'in', 'these', 'stars']] | [-0.06341611365295523, 0.16347787417357834, -0.03101180858014017, 0.07414039455087311, -0.07919854279493958, -0.025731287522779065, 0.08875710501835295, 0.34116936782450696, -0.2107625011074531, -0.3346663903732731, 0.0346903349921236, -0.3074101180594052, -0.03200622648000717, 0.21028884338798018, -0.03554636220449139, -0.05763342603591528, 0.07599521204649387, 0.03753868332587001, -0.04804450675903827, -0.22117683772239985, 0.32721719603485816, 0.05202279691735843, 0.1548203628927155, -0.004772430796903081, -0.018811064696117357, -0.1285160381150076, -0.0498010977266008, -0.03847520791204283, -0.15955428886942483, 0.11291345842353, 0.2442505477768619, 0.10703083884720577, 0.23370286360443607, -0.39355973090275026, -0.24106980775051365, 0.06356606099516063, 0.1751006944720232, 0.055839520605087914, -0.02643301920270608, -0.23647028961544478, 0.06507234209419675, -0.14419703695324923, -0.15929561637519912, 0.019976814852921458, 0.029614560643014144, 0.041792197104465835, -0.2538026874445803, 0.05718534955791788, 0.059065305614631955, 0.09498733603130512, -0.1109293436494796, -0.12360436197870024, -0.06977789032905234, 0.13480103586429382, 0.0215443378840611, 0.015292424496596421, 0.1645944712804706, -0.11485581208735977, 0.033112428367811794, 0.39805512238536184, -0.09639797402579882, -0.0342153226710644, 0.22540366112129626, -0.24543363005452887, -0.13741567685283962, 0.16191292533601778, 0.17153919059631786, 0.16929536879846327, -0.13393964743567252, 0.001156721199054377, -0.016988536117956178, 0.16698858447583975, 0.0877405912918228, 0.05445570728128276, 0.2891325525593058, 0.17285013430263485, 0.051557964368958056, 0.11441310548495191, -0.22855171399797708, -0.05655544674037236, -0.24220784945882917, -0.15216724791117314, -0.08253127603340427, 0.006850303799989141, -0.09289318083472431, -0.17362082910125817, 0.39818132718020816, 0.13272642083887232, 0.1914418824187412, -0.0517073540330289, 0.2949488424181151, 0.08153612239331734, 0.09780993283682737, 0.09709044814495961, 0.2923626519959208, 0.2146523795469202, 0.11010611227740026, -0.3086974856011168, 0.07780232261374169, -0.00235358318238239] |
1,802.01999 | Equivalent Descriptions of the Loewner Energy | Loewner's equation provides a way to encode a simply connected domain or
equivalently its uniformizing conformal map via a real-valued driving function
of its boundary. The first main result of the present paper is that the
Dirichlet energy of this driving function (also known as the Loewner energy) is
equal to the Dirichlet energy of the log-derivative of the (appropriately
defined) uniformizing conformal map.
This description of the Loewner energy then enables to tie direct links with
regularized determinants and Teichm\"uller theory: We show that for smooth
simple loops, the Loewner energy can be expressed in terms of the
zeta-regularized determinants of a certain Neumann jump operator. We also show
that the family of finite Loewner energy loops coincides with the
Weil-Petersson class of quasicircles, and that the Loewner energy equals to a
multiple of the universal Liouville action introduced by Takhtajan and Teo,
which is a K\"ahler potential for the Weil-Petersson metric on the
Weil-Petersson Teichm\"uller space.
| math.CV math-ph math.MP math.PR | loewners equation provides a way to encode a simply connected domain or equivalently its uniformizing conformal map via a realvalued driving function of its boundary the first main result of the present paper is that the dirichlet energy of this driving function also known as the loewner energy is equal to the dirichlet energy of the logderivative of the appropriately defined uniformizing conformal map this description of the loewner energy then enables to tie direct links with regularized determinants and teichmuller theory we show that for smooth simple loops the loewner energy can be expressed in terms of the zetaregularized determinants of a certain neumann jump operator we also show that the family of finite loewner energy loops coincides with the weilpetersson class of quasicircles and that the loewner energy equals to a multiple of the universal liouville action introduced by takhtajan and teo which is a kahler potential for the weilpetersson metric on the weilpetersson teichmuller space | [['loewners', 'equation', 'provides', 'a', 'way', 'to', 'encode', 'a', 'simply', 'connected', 'domain', 'or', 'equivalently', 'its', 'uniformizing', 'conformal', 'map', 'via', 'a', 'realvalued', 'driving', 'function', 'of', 'its', 'boundary', 'the', 'first', 'main', 'result', 'of', 'the', 'present', 'paper', 'is', 'that', 'the', 'dirichlet', 'energy', 'of', 'this', 'driving', 'function', 'also', 'known', 'as', 'the', 'loewner', 'energy', 'is', 'equal', 'to', 'the', 'dirichlet', 'energy', 'of', 'the', 'logderivative', 'of', 'the', 'appropriately', 'defined', 'uniformizing', 'conformal', 'map', 'this', 'description', 'of', 'the', 'loewner', 'energy', 'then', 'enables', 'to', 'tie', 'direct', 'links', 'with', 'regularized', 'determinants', 'and', 'teichmuller', 'theory', 'we', 'show', 'that', 'for', 'smooth', 'simple', 'loops', 'the', 'loewner', 'energy', 'can', 'be', 'expressed', 'in', 'terms', 'of', 'the', 'zetaregularized', 'determinants', 'of', 'a', 'certain', 'neumann', 'jump', 'operator', 'we', 'also', 'show', 'that', 'the', 'family', 'of', 'finite', 'loewner', 'energy', 'loops', 'coincides', 'with', 'the', 'weilpetersson', 'class', 'of', 'quasicircles', 'and', 'that', 'the', 'loewner', 'energy', 'equals', 'to', 'a', 'multiple', 'of', 'the', 'universal', 'liouville', 'action', 'introduced', 'by', 'takhtajan', 'and', 'teo', 'which', 'is', 'a', 'kahler', 'potential', 'for', 'the', 'weilpetersson', 'metric', 'on', 'the', 'weilpetersson', 'teichmuller', 'space']] | [-0.17160358695207234, 0.10315505279628914, -0.10540116784351442, 0.08279552131292964, -0.12312971910202428, -0.08974919530056134, 0.0009064439203755199, 0.31312161599008864, -0.323142316938036, -0.20383247719558922, 0.08878708902018474, -0.24029075163947064, -0.1802557871184795, 0.1811919196234733, -0.09431740118756513, 0.0724553143969572, 0.04352816207401817, 0.11189404986150374, -0.09262382310573483, -0.20965594047373987, 0.4334451988416052, 0.023129999510873155, 0.2193640415981129, 0.10708138333556914, 0.16098018835852795, -0.018868793728997153, -0.002540880713989086, -0.0016981387966610137, -0.1791294318974929, 0.16490108241279952, 0.21932057453366585, 0.0797464531298161, 0.24451981840914563, -0.3736138225450546, -0.21465165997764002, 0.16068995213858148, 0.11568109484837402, 0.004345730196867327, 0.024429887820542142, -0.2673318473374636, 0.05551577594626365, -0.1336070323080013, -0.1888417044766483, -0.0565348133338686, 0.008073106597478301, 0.05427038961508653, -0.2523741059364822, 0.06787289487738811, 0.08805995747665109, 0.011146281327156327, -0.10267418834139133, -0.04525273956087288, -0.08017194519833296, 0.10184466992387006, 0.04717727605094308, 0.12559536922888098, 0.09591740192668631, -0.07062182066331417, -0.09901781810176428, 0.33034100762348845, -0.10115873669215207, -0.25776667582885, 0.11231465185506127, -0.14025290290120682, -0.11148282607333569, 0.09473608921671027, 0.09206074520597776, 0.13605548183233301, -0.1472900272464922, 0.18778554277230775, -0.047635919920646266, 0.0768636903059492, 0.11183041278744422, -0.030933403642848134, 0.14673641290444928, 0.08297999029908376, 0.10903712245340966, 0.19579847726331365, 0.00037061344077692754, -0.11484847494413564, -0.3663164994327935, -0.22077859298891941, -0.20561371805423376, 0.11511931129837338, -0.15357374638063712, -0.23408407794570998, 0.4136612543783186, 0.04957415051430411, 0.2085825424211076, 0.15720928880707302, 0.24119128724795919, 0.1603510189746931, 0.06135671289602318, 0.08174989869983136, 0.1414733544062776, 0.17895549858030216, 0.0653527892692769, -0.2109063361842138, -0.015642147119263115, 0.1854960658569832] |
1,802.02 | Finite subgroups of the extended modular group | We show that in the extended modular group PGL(2,Z) there are exactly seven
finite subgroups up to conjugacy; three subgroups of size 2, one subgroup each
of size 3, 4, and 6, and the trivial subgroup of size 1.
| math.GR | we show that in the extended modular group pgl2z there are exactly seven finite subgroups up to conjugacy three subgroups of size 2 one subgroup each of size 3 4 and 6 and the trivial subgroup of size 1 | [['we', 'show', 'that', 'in', 'the', 'extended', 'modular', 'group', 'pgl2z', 'there', 'are', 'exactly', 'seven', 'finite', 'subgroups', 'up', 'to', 'conjugacy', 'three', 'subgroups', 'of', 'size', '2', 'one', 'subgroup', 'each', 'of', 'size', '3', '4', 'and', '6', 'and', 'the', 'trivial', 'subgroup', 'of', 'size', '1']] | [-0.17099538455024743, 0.15618077107967857, -0.02294568669719574, 0.025508187376917936, -0.022461396236068163, -0.15180720670674092, 0.0389701401671538, 0.38433569039289767, -0.3181103568476362, -0.315203296737029, 0.1792598879412533, -0.3127097800994913, -0.025711159627789106, 0.1730560157985355, -0.06865888313414195, -0.03429379751189397, -0.026427320467355925, 0.14022260962221295, -0.08122171809634146, -0.3276744759999789, 0.35506448871456087, -0.17233643241417715, 0.2083412952428588, -0.034045058087660715, 0.050671724698100336, -0.04789194681992134, -0.023583186647066705, -0.010699143012364706, -0.05653921694540305, 0.07008107816084073, 0.24284119041970906, 0.06098022281926555, 0.23584860945359254, -0.3343937077965492, -0.09383621148000924, 0.20743600747142082, 0.18439340086367267, -0.012168766954579415, -0.04384382190899207, -0.19233117566014138, 0.16534122119012934, -0.23852972471370146, -0.19109035297655141, 0.010740213239422211, 0.14798775635277614, -0.07213901155270062, -0.16337946105079773, -0.013710135164169164, 0.06661754932541114, 0.1374761367407747, -0.030242187603830527, -0.17465175998707613, -0.03210610989481211, 0.181081080236114, 0.00104224915878895, 0.004342424062391122, 0.09749969755275509, -0.06722951318638828, -0.12104161059818207, 0.4177680554298254, -0.01896070505086428, -0.17377121369235027, 0.18691232781379652, -0.2510530061255663, -0.25994284607422274, 0.1955368425219487, 0.08040835068393977, 0.08309377381243767, -0.015038640501025395, 0.15035589596626756, -0.1314432768103404, 0.20736006961371273, 0.07853022433865146, -0.08641517660222374, 0.00869563656548659, 0.11246425039970721, 0.06595494371289626, 0.129514957849796, 0.007403774855610652, 0.11272119202961524, -0.35917310187449825, -0.1749409781022666, -0.07258364947464986, 0.09442732473596549, -0.1858561212332764, -0.12862405515252015, 0.48727995644395167, 0.0874320884139683, 0.13095375716399688, 0.12284014586550303, 0.1281554063376135, -0.023234605383223448, 0.14043854002673656, 0.20732966769868746, 0.09605782756056541, 0.14062804578302, -0.23574240906880453, -0.18204515002285823, -0.10563305613751976, 0.11334869034442072] |
1,802.02001 | Testing modified gravity with globular clusters: the case of NGC 2419 | The dynamics of globular clusters has been studied in great detail in the
context of general relativity as well as with modifications of gravity that
strongly depart from the standard paradigm such as MOND. However, at present
there are no studies that aim to test the impact that less extreme
modifications of gravity (e.g. models constructed as alternatives to dark
energy) have on the behaviour of globular clusters. This Letter presents fits
to the velocity dispersion profile of the cluster NGC 2419 under the symmetron
modified gravity model. The data shows an increase in the velocity dispersion
towards the centre of the cluster which could be difficult to explain within
general relativity. By finding the best fitting solution associated with the
symmetron model, we show that this tension does not exist in modified gravity.
However, the best fitting parameters give a model that is inconsistent with the
dynamics of the Solar System. Exploration of different screening mechanisms
should give us the chance to understand if it is possible to maintain the
appealing properties of the symmetron model when it comes to globular clusters
and at the same time recover the Solar System dynamics properly.
| astro-ph.CO astro-ph.GA gr-qc | the dynamics of globular clusters has been studied in great detail in the context of general relativity as well as with modifications of gravity that strongly depart from the standard paradigm such as mond however at present there are no studies that aim to test the impact that less extreme modifications of gravity eg models constructed as alternatives to dark energy have on the behaviour of globular clusters this letter presents fits to the velocity dispersion profile of the cluster ngc 2419 under the symmetron modified gravity model the data shows an increase in the velocity dispersion towards the centre of the cluster which could be difficult to explain within general relativity by finding the best fitting solution associated with the symmetron model we show that this tension does not exist in modified gravity however the best fitting parameters give a model that is inconsistent with the dynamics of the solar system exploration of different screening mechanisms should give us the chance to understand if it is possible to maintain the appealing properties of the symmetron model when it comes to globular clusters and at the same time recover the solar system dynamics properly | [['the', 'dynamics', 'of', 'globular', 'clusters', 'has', 'been', 'studied', 'in', 'great', 'detail', 'in', 'the', 'context', 'of', 'general', 'relativity', 'as', 'well', 'as', 'with', 'modifications', 'of', 'gravity', 'that', 'strongly', 'depart', 'from', 'the', 'standard', 'paradigm', 'such', 'as', 'mond', 'however', 'at', 'present', 'there', 'are', 'no', 'studies', 'that', 'aim', 'to', 'test', 'the', 'impact', 'that', 'less', 'extreme', 'modifications', 'of', 'gravity', 'eg', 'models', 'constructed', 'as', 'alternatives', 'to', 'dark', 'energy', 'have', 'on', 'the', 'behaviour', 'of', 'globular', 'clusters', 'this', 'letter', 'presents', 'fits', 'to', 'the', 'velocity', 'dispersion', 'profile', 'of', 'the', 'cluster', 'ngc', '2419', 'under', 'the', 'symmetron', 'modified', 'gravity', 'model', 'the', 'data', 'shows', 'an', 'increase', 'in', 'the', 'velocity', 'dispersion', 'towards', 'the', 'centre', 'of', 'the', 'cluster', 'which', 'could', 'be', 'difficult', 'to', 'explain', 'within', 'general', 'relativity', 'by', 'finding', 'the', 'best', 'fitting', 'solution', 'associated', 'with', 'the', 'symmetron', 'model', 'we', 'show', 'that', 'this', 'tension', 'does', 'not', 'exist', 'in', 'modified', 'gravity', 'however', 'the', 'best', 'fitting', 'parameters', 'give', 'a', 'model', 'that', 'is', 'inconsistent', 'with', 'the', 'dynamics', 'of', 'the', 'solar', 'system', 'exploration', 'of', 'different', 'screening', 'mechanisms', 'should', 'give', 'us', 'the', 'chance', 'to', 'understand', 'if', 'it', 'is', 'possible', 'to', 'maintain', 'the', 'appealing', 'properties', 'of', 'the', 'symmetron', 'model', 'when', 'it', 'comes', 'to', 'globular', 'clusters', 'and', 'at', 'the', 'same', 'time', 'recover', 'the', 'solar', 'system', 'dynamics', 'properly']] | [-0.06762069283226102, 0.06040672436376047, -0.1322900632362736, 0.11788659804433431, -0.1033636662333762, -0.1316753687869911, -0.0036827798815175276, 0.3477271077818401, -0.22973550367409112, -0.3667553387889543, 0.04171705801104743, -0.24044129292759084, -0.1249504236590847, 0.1815521804251007, -0.06435814613237152, -0.0021385165464286645, 0.04768810296592005, 0.028917729069680435, -0.03352932864650076, -0.2502823550105287, 0.2981990598797433, 0.11906377325607367, 0.23432658462468342, -0.014831784060380911, 0.06633210015187961, -0.05125869609074686, 0.011501534304283943, 0.048053644449910934, -0.14345914421135172, 0.05748902429969376, 0.20209257961479246, 0.13576417343484565, 0.24321499355161352, -0.4164751348440948, -0.2746287449935125, 0.09279914691890638, 0.16700030471455996, 0.11752022062152259, -0.06882773988433759, -0.24103378458908692, 0.07215534653916676, -0.16397876063957043, -0.19871408035066554, -0.019791876124314118, 0.024433484492996305, 0.0076003805674209265, -0.20194131273958718, 0.11817741256744899, 0.017259047288068367, -0.006154232928481375, -0.09161933643752997, -0.09458236011662088, -0.01836153860659982, 0.11024007676892371, 0.09347670587720637, 0.042748924552405386, 0.13100867287361437, -0.1374441552355156, -0.05374209946453495, 0.4699979252614004, -0.07655339292970668, -0.14599944152281208, 0.22743776307162858, -0.17074936152719075, -0.17619314054315238, 0.054312177546101514, 0.14364876646126054, 0.07229142875942286, -0.1782591289036683, 0.08898927826649203, -0.036656856047200786, 0.17761624905943257, 0.04441412793563621, 0.02007958613403295, 0.2789902627544919, 0.14563535243217574, 0.042404097294886166, 0.08989102194102519, -0.08820153981088373, -0.10913389322099507, -0.2789000665490544, -0.10632971621186894, -0.11397660984873734, 0.007259325844493152, -0.0991166536527483, -0.16182478710159315, 0.35366845457963453, 0.1812858175841573, 0.17632216299984835, 0.046947596566487566, 0.27916124627503, 0.08957587286095452, 0.11461004863022682, 0.06706396651636694, 0.3207343507092446, 0.11104069144186593, 0.06872612359146252, -0.26595640994882036, 0.08300046325594033, -0.010296295632214583] |
1,802.02002 | On the structure of random graphs with constant $r$-balls | We continue the study of the properties of graphs in which the ball of radius
$r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in
some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$.
This is a natural extension of the study of regular graphs. More precisely, if
$F$ is a vertex-transitive graph and $r \in \mathbb{N}$, we say a graph $G$ is
{\em $r$-locally $F$} if the ball of radius $r$ around each vertex of $G$
induces a graph isomorphic to the graph induced by the ball of radius $r$
around any vertex of $F$. We consider the following random graph model: for
each $n \in \mathbb{N}$, we let $G_n = G_n(F,r)$ be a graph chosen uniformly at
random from the set of all unlabelled, $n$-vertex graphs that are $r$-locally
$F$. We investigate the properties possessed by the random graph $G_n$ with
high probability, for various natural choices of $F$ and $r$.
We prove that if $F$ is a Cayley graph of a torsion-free group of polynomial
growth, and $r$ is sufficiently large depending on $F$, then the random graph
$G_n = G_n(F,r)$ has largest component of order at most $n^{5/6}$ with high
probability, and has at least $\exp(n^{\delta})$ automorphisms with high
probability, where $\delta>0$ depends upon $F$ alone. Both properties are in
stark contrast to random $d$-regular graphs, which correspond to the case where
$F$ is the infinite $d$-regular tree. We also show that, under the same
hypotheses, the number of unlabelled, $n$-vertex graphs that are $r$-locally
$F$ grows like a stretched exponential in $n$, again in contrast with
$d$-regular graphs. In the case where $F$ is the standard Cayley graph of
$\mathbb{Z}^d$, we obtain a much more precise enumeration result, and more
precise results on the properties of the random graph $G_n(F,r)$. Our proofs
use a mixture of results and techniques from geometry, group theory and
combinatorics.
| math.CO math.GR math.PR | we continue the study of the properties of graphs in which the ball of radius r around each vertex induces a graph isomorphic to the ball of radius r in some fixed vertextransitive graph f for various choices of f and r this is a natural extension of the study of regular graphs more precisely if f is a vertextransitive graph and r in mathbbn we say a graph g is em rlocally f if the ball of radius r around each vertex of g induces a graph isomorphic to the graph induced by the ball of radius r around any vertex of f we consider the following random graph model for each n in mathbbn we let g_n g_nfr be a graph chosen uniformly at random from the set of all unlabelled nvertex graphs that are rlocally f we investigate the properties possessed by the random graph g_n with high probability for various natural choices of f and r we prove that if f is a cayley graph of a torsionfree group of polynomial growth and r is sufficiently large depending on f then the random graph g_n g_nfr has largest component of order at most n56 with high probability and has at least expndelta automorphisms with high probability where delta0 depends upon f alone both properties are in stark contrast to random dregular graphs which correspond to the case where f is the infinite dregular tree we also show that under the same hypotheses the number of unlabelled nvertex graphs that are rlocally f grows like a stretched exponential in n again in contrast with dregular graphs in the case where f is the standard cayley graph of mathbbzd we obtain a much more precise enumeration result and more precise results on the properties of the random graph g_nfr our proofs use a mixture of results and techniques from geometry group theory and combinatorics | [['we', 'continue', 'the', 'study', 'of', 'the', 'properties', 'of', 'graphs', 'in', 'which', 'the', 'ball', 'of', 'radius', 'r', 'around', 'each', 'vertex', 'induces', 'a', 'graph', 'isomorphic', 'to', 'the', 'ball', 'of', 'radius', 'r', 'in', 'some', 'fixed', 'vertextransitive', 'graph', 'f', 'for', 'various', 'choices', 'of', 'f', 'and', 'r', 'this', 'is', 'a', 'natural', 'extension', 'of', 'the', 'study', 'of', 'regular', 'graphs', 'more', 'precisely', 'if', 'f', 'is', 'a', 'vertextransitive', 'graph', 'and', 'r', 'in', 'mathbbn', 'we', 'say', 'a', 'graph', 'g', 'is', 'em', 'rlocally', 'f', 'if', 'the', 'ball', 'of', 'radius', 'r', 'around', 'each', 'vertex', 'of', 'g', 'induces', 'a', 'graph', 'isomorphic', 'to', 'the', 'graph', 'induced', 'by', 'the', 'ball', 'of', 'radius', 'r', 'around', 'any', 'vertex', 'of', 'f', 'we', 'consider', 'the', 'following', 'random', 'graph', 'model', 'for', 'each', 'n', 'in', 'mathbbn', 'we', 'let', 'g_n', 'g_nfr', 'be', 'a', 'graph', 'chosen', 'uniformly', 'at', 'random', 'from', 'the', 'set', 'of', 'all', 'unlabelled', 'nvertex', 'graphs', 'that', 'are', 'rlocally', 'f', 'we', 'investigate', 'the', 'properties', 'possessed', 'by', 'the', 'random', 'graph', 'g_n', 'with', 'high', 'probability', 'for', 'various', 'natural', 'choices', 'of', 'f', 'and', 'r', 'we', 'prove', 'that', 'if', 'f', 'is', 'a', 'cayley', 'graph', 'of', 'a', 'torsionfree', 'group', 'of', 'polynomial', 'growth', 'and', 'r', 'is', 'sufficiently', 'large', 'depending', 'on', 'f', 'then', 'the', 'random', 'graph', 'g_n', 'g_nfr', 'has', 'largest', 'component', 'of', 'order', 'at', 'most', 'n56', 'with', 'high', 'probability', 'and', 'has', 'at', 'least', 'expndelta', 'automorphisms', 'with', 'high', 'probability', 'where', 'delta0', 'depends', 'upon', 'f', 'alone', 'both', 'properties', 'are', 'in', 'stark', 'contrast', 'to', 'random', 'dregular', 'graphs', 'which', 'correspond', 'to', 'the', 'case', 'where', 'f', 'is', 'the', 'infinite', 'dregular', 'tree', 'we', 'also', 'show', 'that', 'under', 'the', 'same', 'hypotheses', 'the', 'number', 'of', 'unlabelled', 'nvertex', 'graphs', 'that', 'are', 'rlocally', 'f', 'grows', 'like', 'a', 'stretched', 'exponential', 'in', 'n', 'again', 'in', 'contrast', 'with', 'dregular', 'graphs', 'in', 'the', 'case', 'where', 'f', 'is', 'the', 'standard', 'cayley', 'graph', 'of', 'mathbbzd', 'we', 'obtain', 'a', 'much', 'more', 'precise', 'enumeration', 'result', 'and', 'more', 'precise', 'results', 'on', 'the', 'properties', 'of', 'the', 'random', 'graph', 'g_nfr', 'our', 'proofs', 'use', 'a', 'mixture', 'of', 'results', 'and', 'techniques', 'from', 'geometry', 'group', 'theory', 'and', 'combinatorics']] | [-0.1622274288868228, 0.14253268811389025, -0.06682448223074072, -0.004179732479476311, -0.08882747147058408, -0.14548637973191805, 0.025046780644665485, 0.38729699853589594, -0.26863730507438616, -0.2560856936817592, 0.08262501505374484, -0.33039537418775167, -0.13176161070063983, 0.12643480113386235, -0.0908691743263515, 0.010331236221910458, 0.08865745481003454, 0.1712808948573126, -0.0058772223972114205, -0.2642380655176762, 0.30573366684662295, -0.020702763848136404, 0.161908929612741, 0.03773774983655349, 0.061193438579882437, 0.03316465230758856, 0.013796146756444786, 0.06708240274250024, -0.20874144736122224, 0.06861219539961341, 0.2316674166298221, 0.11932510346442438, 0.2842730237443672, -0.36992482985134084, -0.15986956036178088, 0.24855070914690017, 0.09890744508585975, 0.003409779154624837, 0.008493919391231095, -0.21725411031798966, 0.16690305715700895, -0.11694650485215685, -0.10740288418770733, 0.012871331272976873, 0.12840866139512272, 0.043403007995810275, -0.3237469492073442, -0.017873575616295632, 0.13512612769050122, 0.0529919698148453, 0.07519643489622121, -0.14298555314912212, -0.06964467376502985, 0.0949600450827186, -0.040522250725557624, 0.1108670858194745, 0.0907360621193082, -0.09689811150480027, -0.10599170436145432, 0.37944446271580134, -0.08422044356820715, -0.1754249135044085, 0.11137476376378673, -0.21880816932195868, -0.20847551205307482, 0.09217321528328135, 0.13304677813039809, 0.17204740780031402, -0.06171104882820214, 0.22008373942137754, -0.10932786833668788, 0.13081947692870338, 0.11490073292133032, -0.008402706582181722, 0.12627665312957798, 0.10994378032893697, 0.1513181154533655, 0.18263843569637842, 0.019625364930245175, 0.02130202833663295, -0.30146876706364506, -0.07138524224238965, -0.25241470919616954, 0.09262878372469516, -0.22439397406827694, -0.20776087982886576, 0.39732422130300277, 0.0967311978427092, 0.21728663076941349, 0.12027164909744022, 0.17549399858269887, 0.05597507780793755, 0.01801518868777276, 0.1559451773341204, 0.06305027032969888, 0.19180472037324658, -0.04958399559836835, -0.1329011890246633, 0.05216175430863978, 0.13689129531038688] |
1,802.02003 | Are gravitational wave ringdown echoes always equal-interval ? | Gravitational wave (GW) ringdown waveforms may contain "echoes" that encode
new physics in the strong gravity regime. It is commonly assumed that the new
physics gives rise to the GW echoes whose intervals are constant. We point out
that this assumption is not always applicable. In particular, if the
post-merger object is initially a wormhole, which slowly pinches off and
eventually collapses into a black hole, the late-time ringdown waveform exhibit
a series of echoes whose intervals are increasing with time. We also assess how
this affects the ability of Advanced LIGO/Virgo to detect these new signals.
| gr-qc astro-ph.CO hep-th | gravitational wave gw ringdown waveforms may contain echoes that encode new physics in the strong gravity regime it is commonly assumed that the new physics gives rise to the gw echoes whose intervals are constant we point out that this assumption is not always applicable in particular if the postmerger object is initially a wormhole which slowly pinches off and eventually collapses into a black hole the latetime ringdown waveform exhibit a series of echoes whose intervals are increasing with time we also assess how this affects the ability of advanced ligovirgo to detect these new signals | [['gravitational', 'wave', 'gw', 'ringdown', 'waveforms', 'may', 'contain', 'echoes', 'that', 'encode', 'new', 'physics', 'in', 'the', 'strong', 'gravity', 'regime', 'it', 'is', 'commonly', 'assumed', 'that', 'the', 'new', 'physics', 'gives', 'rise', 'to', 'the', 'gw', 'echoes', 'whose', 'intervals', 'are', 'constant', 'we', 'point', 'out', 'that', 'this', 'assumption', 'is', 'not', 'always', 'applicable', 'in', 'particular', 'if', 'the', 'postmerger', 'object', 'is', 'initially', 'a', 'wormhole', 'which', 'slowly', 'pinches', 'off', 'and', 'eventually', 'collapses', 'into', 'a', 'black', 'hole', 'the', 'latetime', 'ringdown', 'waveform', 'exhibit', 'a', 'series', 'of', 'echoes', 'whose', 'intervals', 'are', 'increasing', 'with', 'time', 'we', 'also', 'assess', 'how', 'this', 'affects', 'the', 'ability', 'of', 'advanced', 'ligovirgo', 'to', 'detect', 'these', 'new', 'signals']] | [-0.14067819008643298, 0.1597845727270565, -0.1598618745842238, 0.12227102208968982, -0.13988849622456684, -0.14374170822485052, -0.002832114314852455, 0.33953563471507164, -0.22067249355088805, -0.23033935267156586, 0.09442798062419691, -0.28818783092975003, -0.1746659462925853, 0.23326085767103838, -0.019520096845694425, -0.00941808279795745, 0.07354528019108723, 0.025190471940357045, -0.09688651222332391, -0.2225128718406999, 0.2870903300870325, 0.08453478301232009, 0.20038842318637162, -0.04019262389635149, 0.06347330899779521, -0.022763051548684687, -0.011678490893358422, -0.011897463908361406, -0.11168839069455082, -0.008299017632284115, 0.2682786870978235, 0.1952779267136891, 0.23785748887691915, -0.45702253721808034, -0.23484196171126107, 0.11653749246303875, 0.14906307235936223, 0.1853076851789926, -0.045315553607015883, -0.30824964543439676, 0.07821997140351798, -0.21951554601858417, -0.10932901448848628, -0.031230270759365762, 0.09381786294427902, 0.034676356711568906, -0.21674196856557248, 0.08504082188076224, 0.07195321108051336, -0.139662260201654, -0.024759307152053975, 0.003313912875643096, 0.02397073401599047, 0.07515396290583555, 0.09372139096826546, 0.07232143823057413, 0.15727830214963592, -0.07801340649998986, -0.07669189594417196, 0.34501373699443777, -0.06785039775092731, -0.15685074031352997, 0.20838568118861733, -0.24710823310366303, -0.10900187777048073, 0.2169589703019286, 0.17332480596522465, 0.13046506355449403, -0.11604030759640269, 0.04148898590488129, 0.06108177119170522, 0.24406623225041052, 0.13925703685039403, 0.0820523637860591, 0.3917398004955852, 0.10892240563647572, 0.015871821451432927, 0.11432193958959014, -0.10791847349646184, -0.036959758162805716, -0.32135876597171725, -0.07567718614507274, -0.1671277423936528, 0.0817394151679989, -0.0942508538501738, -0.20306643622821755, 0.4014011535783942, 0.14452427167315804, 0.13252314211819896, 0.02204128137139181, 0.2607794938412178, 0.11884227905004795, 0.02746916027768448, 0.07503321927674499, 0.354054729732656, 0.07408366053720418, 0.09543989273508262, -0.18393124834653565, 0.036740693110089324, 0.0005770932532578092] |
1,802.02004 | Complete complex hypersurfaces in the ball come in foliations | In this paper we prove that every smooth complete closed complex hypersurface
in the open unit ball $\mathbb{B}_n$ of $\mathbb{C}^n$ $(n\ge 2)$ is a level
set of a noncritical holomorphic function on $\mathbb{B}_n$ all of whose level
sets are complete. This shows that $\mathbb{B}_n$ admits a nonsingular
holomorphic foliation by smooth complete closed complex hypersurfaces and, what
is the main point, that every hypersurface in $\mathbb{B}_n$ of this type can
be embedded into such a foliation. We establish a more general result in which
neither completeness nor smoothness of the given hypersurface is required.
Furthermore, we obtain a similar result for complex submanifolds of arbitrary
positive codimension and prove the existence of a nonsingular holomorphic
submersion foliation of $\mathbb{B}_n$ by smooth complete closed complex
submanifolds of any pure codimension $q\in\{1,\ldots,n-1\}$.
| math.CV math.DG | in this paper we prove that every smooth complete closed complex hypersurface in the open unit ball mathbbb_n of mathbbcn nge 2 is a level set of a noncritical holomorphic function on mathbbb_n all of whose level sets are complete this shows that mathbbb_n admits a nonsingular holomorphic foliation by smooth complete closed complex hypersurfaces and what is the main point that every hypersurface in mathbbb_n of this type can be embedded into such a foliation we establish a more general result in which neither completeness nor smoothness of the given hypersurface is required furthermore we obtain a similar result for complex submanifolds of arbitrary positive codimension and prove the existence of a nonsingular holomorphic submersion foliation of mathbbb_n by smooth complete closed complex submanifolds of any pure codimension qin1ldotsn1 | [['in', 'this', 'paper', 'we', 'prove', 'that', 'every', 'smooth', 'complete', 'closed', 'complex', 'hypersurface', 'in', 'the', 'open', 'unit', 'ball', 'mathbbb_n', 'of', 'mathbbcn', 'nge', '2', 'is', 'a', 'level', 'set', 'of', 'a', 'noncritical', 'holomorphic', 'function', 'on', 'mathbbb_n', 'all', 'of', 'whose', 'level', 'sets', 'are', 'complete', 'this', 'shows', 'that', 'mathbbb_n', 'admits', 'a', 'nonsingular', 'holomorphic', 'foliation', 'by', 'smooth', 'complete', 'closed', 'complex', 'hypersurfaces', 'and', 'what', 'is', 'the', 'main', 'point', 'that', 'every', 'hypersurface', 'in', 'mathbbb_n', 'of', 'this', 'type', 'can', 'be', 'embedded', 'into', 'such', 'a', 'foliation', 'we', 'establish', 'a', 'more', 'general', 'result', 'in', 'which', 'neither', 'completeness', 'nor', 'smoothness', 'of', 'the', 'given', 'hypersurface', 'is', 'required', 'furthermore', 'we', 'obtain', 'a', 'similar', 'result', 'for', 'complex', 'submanifolds', 'of', 'arbitrary', 'positive', 'codimension', 'and', 'prove', 'the', 'existence', 'of', 'a', 'nonsingular', 'holomorphic', 'submersion', 'foliation', 'of', 'mathbbb_n', 'by', 'smooth', 'complete', 'closed', 'complex', 'submanifolds', 'of', 'any', 'pure', 'codimension', 'qin1ldotsn1']] | [-0.2329357652988126, 0.03238353425954548, -0.07494375580387522, 0.06605940263776124, -0.07548894657024233, -0.14630095046302377, -0.057089041292219776, 0.32492050730673844, -0.24340252552268116, -0.11302354550277886, 0.09908866191683553, -0.23142186185532762, -0.18325947594735048, 0.17922802288590592, -0.17218573849518284, 0.006008284390261469, 0.09461567231432297, 0.1145287257539787, -0.10131400527230414, -0.2874595217060211, 0.4845205512071072, -0.11341943664028663, 0.1556443245503907, 0.10981786552845507, 0.16367379484279443, 0.008018297468160475, 0.05834771959876367, 0.036666605943748945, -0.18092564793655336, 0.12789752389405415, 0.2909672799151997, 0.15294593307658916, 0.22797609042816672, -0.38660432406035145, -0.1971821575281174, 0.2616634338538256, 0.1331914031712064, -0.023388702426892668, -0.005303429927547867, -0.2612186377189418, 0.1423642597704505, -0.03122316429377064, -0.2681294116209615, -0.08648753291097029, 0.0486862302411261, -0.019918769101662806, -0.22666372859836087, 0.02352459855781969, 0.188977134190211, 0.13567606461515955, -0.08475390848046703, -0.030529392456325393, -0.1104473558691323, 0.04976797100994014, -0.08013087291046689, 0.19332021574242503, 0.08594612821182164, -0.024416331218035763, -0.07687152512804714, 0.3294703472665576, -0.08537754182552182, -0.3208674939219342, 0.10419974168545978, -0.20845429642602456, -0.16192390227892486, 0.1677179258648855, 0.12467292553651356, 0.197872292734105, -0.09831170434522074, 0.22867960880542998, -0.10801174173983492, 0.09066681506391074, 0.14967845151085377, -0.05410201912123147, 0.15795730162130364, 0.13166976037846748, 0.15745994990128417, 0.11317853344145931, 0.03542083928310998, -0.034495228305892196, -0.43895972508561704, -0.2500360415627559, -0.11974927232431089, 0.23925256955763596, -0.16527279512212223, -0.23938899859786034, 0.39615129792066506, -0.03409761612397409, 0.24054302473718575, 0.11182106080259262, 0.2556603887703183, 0.037749534789693916, 0.006748786427138388, 0.12976909620875074, 0.1251268438027464, 0.12670760330123207, -0.04279173930110627, -0.05137003809682909, -0.03305766949170204, 0.13010888122917377] |
1,802.02005 | AGN feedback and the origin and fate of the hot gas in early-type
galaxies | A recent determination of the relationships between the X-ray luminosity of
the ISM (Lx) and the stellar and total mass, for a sample of nearby early-type
galaxies (ETGs), is used to investigate the origin of the hot gas, via a
comparison with the results of hydrodynamical simulations of the ISM evolution
for a large set of isolated ETGs. After the epoch of major galaxy formation
(after z~2), the ISM is replenished by stellar mass losses and SN ejecta, at
the rate predicted by stellar evolution, and is depleted by star formation; it
is heated by the thermalization of stellar motions, SNe explosions and the
mechanical (from winds) and radiative AGN feedback. The models agree well with
the observed relations, even for the largely different Lx values at the same
mass, thanks to the sensitivity of the gas flow to many galaxy properties; this
holds for models including AGN feedback, and those without. Therefore, the mass
input from the stellar population is able to account for a major part of the
observed Lx; and AGN feedback, while very important to maintain massive ETGs in
a time-averaged quasi-steady state, keeping low star formation and the black
hole mass, does not dramatically alter the gas content originating in stellar
recycled material. These conclusions are based on theoretical predictions for
the stellar population contributions in mass and energy, and on a
self-consistent modeling of AGN feedback.
| astro-ph.GA astro-ph.CO | a recent determination of the relationships between the xray luminosity of the ism lx and the stellar and total mass for a sample of nearby earlytype galaxies etgs is used to investigate the origin of the hot gas via a comparison with the results of hydrodynamical simulations of the ism evolution for a large set of isolated etgs after the epoch of major galaxy formation after z2 the ism is replenished by stellar mass losses and sn ejecta at the rate predicted by stellar evolution and is depleted by star formation it is heated by the thermalization of stellar motions sne explosions and the mechanical from winds and radiative agn feedback the models agree well with the observed relations even for the largely different lx values at the same mass thanks to the sensitivity of the gas flow to many galaxy properties this holds for models including agn feedback and those without therefore the mass input from the stellar population is able to account for a major part of the observed lx and agn feedback while very important to maintain massive etgs in a timeaveraged quasisteady state keeping low star formation and the black hole mass does not dramatically alter the gas content originating in stellar recycled material these conclusions are based on theoretical predictions for the stellar population contributions in mass and energy and on a selfconsistent modeling of agn feedback | [['a', 'recent', 'determination', 'of', 'the', 'relationships', 'between', 'the', 'xray', 'luminosity', 'of', 'the', 'ism', 'lx', 'and', 'the', 'stellar', 'and', 'total', 'mass', 'for', 'a', 'sample', 'of', 'nearby', 'earlytype', 'galaxies', 'etgs', 'is', 'used', 'to', 'investigate', 'the', 'origin', 'of', 'the', 'hot', 'gas', 'via', 'a', 'comparison', 'with', 'the', 'results', 'of', 'hydrodynamical', 'simulations', 'of', 'the', 'ism', 'evolution', 'for', 'a', 'large', 'set', 'of', 'isolated', 'etgs', 'after', 'the', 'epoch', 'of', 'major', 'galaxy', 'formation', 'after', 'z2', 'the', 'ism', 'is', 'replenished', 'by', 'stellar', 'mass', 'losses', 'and', 'sn', 'ejecta', 'at', 'the', 'rate', 'predicted', 'by', 'stellar', 'evolution', 'and', 'is', 'depleted', 'by', 'star', 'formation', 'it', 'is', 'heated', 'by', 'the', 'thermalization', 'of', 'stellar', 'motions', 'sne', 'explosions', 'and', 'the', 'mechanical', 'from', 'winds', 'and', 'radiative', 'agn', 'feedback', 'the', 'models', 'agree', 'well', 'with', 'the', 'observed', 'relations', 'even', 'for', 'the', 'largely', 'different', 'lx', 'values', 'at', 'the', 'same', 'mass', 'thanks', 'to', 'the', 'sensitivity', 'of', 'the', 'gas', 'flow', 'to', 'many', 'galaxy', 'properties', 'this', 'holds', 'for', 'models', 'including', 'agn', 'feedback', 'and', 'those', 'without', 'therefore', 'the', 'mass', 'input', 'from', 'the', 'stellar', 'population', 'is', 'able', 'to', 'account', 'for', 'a', 'major', 'part', 'of', 'the', 'observed', 'lx', 'and', 'agn', 'feedback', 'while', 'very', 'important', 'to', 'maintain', 'massive', 'etgs', 'in', 'a', 'timeaveraged', 'quasisteady', 'state', 'keeping', 'low', 'star', 'formation', 'and', 'the', 'black', 'hole', 'mass', 'does', 'not', 'dramatically', 'alter', 'the', 'gas', 'content', 'originating', 'in', 'stellar', 'recycled', 'material', 'these', 'conclusions', 'are', 'based', 'on', 'theoretical', 'predictions', 'for', 'the', 'stellar', 'population', 'contributions', 'in', 'mass', 'and', 'energy', 'and', 'on', 'a', 'selfconsistent', 'modeling', 'of', 'agn', 'feedback']] | [-0.030981187474590742, 0.12184452991089623, -0.04863838436371037, 0.13775335289016044, -0.06257914783983042, -0.03484111049830721, 0.057181741923880605, 0.4030897062641151, -0.15063351496315464, -0.35585631577474675, 0.05667705922477863, -0.2824962185209031, 0.017337873026102395, 0.20707259653738283, -0.014298451841600111, -0.001827991871072425, 0.06347670908846716, -0.0835569389003875, -0.060987377241966394, -0.27275480443144073, 0.3681825742633323, 0.09595843767024705, 0.1480961476055231, -0.012321528769901087, 0.09573076972145796, -0.10637657170897502, -0.09008123713609731, -0.03168228616464305, -0.15391978518515503, 0.016020838507693983, 0.2016636344943467, 0.12664519643194266, 0.24917918809384493, -0.3978661461209852, -0.24298433750739384, 0.06019052517688673, 0.18767844349876495, 0.07767646765067435, -0.12488159635766602, -0.20599916754370748, 0.04606981136573173, -0.2180923962371488, -0.14558323586744995, 0.08056297219872217, 0.029942504238188748, 0.039298352638540784, -0.2381116512285722, 0.16299835913578764, 0.0504724076855727, 0.03309081628635638, -0.13645932326446578, -0.050001445156120664, -0.13691527699722492, 0.1073855148946489, 0.04553327906439241, 0.05900779076859933, 0.22841368167528658, -0.19732844923594806, 0.005722646906586556, 0.4405372676937359, -0.03212235150617901, -0.017812633766503685, 0.26194786682327537, -0.2148293572385667, -0.13934476372428592, 0.14079315644179086, 0.1786762260438489, 0.06947113110913176, -0.1701907119141683, -0.01017472002786235, -0.012266612021605772, 0.1967023185279686, -0.02249769730079951, 0.05598507806117313, 0.345255788997747, 0.13431589094899868, -0.007791024604902587, 0.056606956111299324, -0.130848870688953, -0.04357219737721607, -0.20646391590005428, -0.08602797634626642, -0.13622632207437257, 0.11844575089300383, -0.1401898354517847, -0.09721689512712303, 0.3516207228972705, 0.08709561346492184, 0.2373918193223854, 0.06562476494381654, 0.3279279395717132, 0.09453431831464294, 0.11547243038939055, 0.14753117969717253, 0.31341537365746075, 0.21873991544246033, 0.08800120766631905, -0.32611073085893716, 0.11354372946692004, 0.03445965236410145] |
1,802.02006 | An Adaptive Genetic Algorithm for Solving N-Queens Problem | In this paper a Metaheuristic approach for solving the N-Queens Problem is
introduced to find the best possible solution in a reasonable amount of time.
Genetic Algorithm is used with a novel fitness function as the Metaheuristic.
The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a
way so that no queen is in conflict with the others. Chromosome representation
and genetic operations like Mutation and Crossover are described in detail.
Results show that this approach yields promising and satisfactory results in
less time compared to that obtained from the previous approaches for several
large values of N.
| cs.NE | in this paper a metaheuristic approach for solving the nqueens problem is introduced to find the best possible solution in a reasonable amount of time genetic algorithm is used with a novel fitness function as the metaheuristic the aim of nqueens problem is to place n queens on an n x n chessboard in a way so that no queen is in conflict with the others chromosome representation and genetic operations like mutation and crossover are described in detail results show that this approach yields promising and satisfactory results in less time compared to that obtained from the previous approaches for several large values of n | [['in', 'this', 'paper', 'a', 'metaheuristic', 'approach', 'for', 'solving', 'the', 'nqueens', 'problem', 'is', 'introduced', 'to', 'find', 'the', 'best', 'possible', 'solution', 'in', 'a', 'reasonable', 'amount', 'of', 'time', 'genetic', 'algorithm', 'is', 'used', 'with', 'a', 'novel', 'fitness', 'function', 'as', 'the', 'metaheuristic', 'the', 'aim', 'of', 'nqueens', 'problem', 'is', 'to', 'place', 'n', 'queens', 'on', 'an', 'n', 'x', 'n', 'chessboard', 'in', 'a', 'way', 'so', 'that', 'no', 'queen', 'is', 'in', 'conflict', 'with', 'the', 'others', 'chromosome', 'representation', 'and', 'genetic', 'operations', 'like', 'mutation', 'and', 'crossover', 'are', 'described', 'in', 'detail', 'results', 'show', 'that', 'this', 'approach', 'yields', 'promising', 'and', 'satisfactory', 'results', 'in', 'less', 'time', 'compared', 'to', 'that', 'obtained', 'from', 'the', 'previous', 'approaches', 'for', 'several', 'large', 'values', 'of', 'n']] | [-0.08747071363383306, 0.054446372516669624, -0.08380751994456041, 0.06864406933232632, -0.04532308382737749, -0.16680503084833892, 0.07439208456934518, 0.37948193737604424, -0.24191893486060062, -0.34335438068956137, 0.04722399420499195, -0.26086243362394423, -0.2072278656469623, 0.1897905940225102, -0.10038613900542259, 0.04825481355647702, 0.08708606999508052, 0.06370880820278851, 0.000149200263516626, -0.289687165164582, 0.25456604050507525, 0.04597400999759799, 0.23623110072792702, 0.0008481667016826148, 0.0943805109973083, -0.041676624247558275, -0.012966160021089721, 0.04588442297546931, -0.10975759301024636, 0.09453424665294939, 0.28611185011576934, 0.18126871979373665, 0.30320635296509796, -0.4103406316091148, -0.15582642938808827, 0.13012167503442265, 0.1705609572708677, 0.11993736256230271, -0.06205235933555501, -0.22686873060071244, 0.09272440933657564, -0.12219046422649386, -0.09818666273692869, -0.039527362440976335, 0.06627216102239096, -0.010057589083136816, -0.2826024861479143, 0.03214990550581858, 0.032299590622127616, 0.02326183281136009, -0.048600449521129706, -0.196544804329158, 0.0588329344952725, 0.1105500662716914, 0.06385531705224289, 0.10290158786020188, 0.04620838390206391, -0.10173850177725742, -0.15369779620987345, 0.37515438156738384, -0.05565531034338868, -0.2035312722502979, 0.1862902764015708, -0.09773584763203168, -0.1646776192048389, 0.1222017713611559, 0.12819726176489638, 0.17372748541935645, -0.161772271153684, 0.0921763334240581, -0.07494632035652, 0.17693014214483072, 0.05296127811372983, -0.018611063276865642, 0.10185610169087941, 0.2151954930170246, 0.1258870029431012, 0.12066299387886417, -0.03732678585659431, -0.12841744623465445, -0.23960679777423446, -0.1616684788012139, -0.1909581955109354, 0.014255124891071388, -0.09062296550741247, -0.14433874128351235, 0.35300705719844633, 0.17190636343428128, 0.2321722312259432, 0.09762682385450527, 0.27339663600136155, 0.07705382428479048, 0.0684393526511794, 0.057145349611088914, 0.14376084343090934, 0.04797470833192456, 0.09332104424840577, -0.22658727569988807, 0.09378969523493412, 0.08568308682989259] |
1,802.02007 | Not Yet for Us: the Nascent Black Hole | In the second half of the last century the "frozen star" or "collapsed star"
models of black hole formation were largely abandoned. The result is that later
models appear to either assume that black hole event horizons already exist
(such as in Hawking's 1975 paper on radiation from black holes), bypass the
relative frames altogether (such as in Mirabel's 2017 paper on the formation of
stellar black holes), or use coordinate systems that essentially ignore the
remote viewer's point of view (Kruskal 1960).
This paper attempts to re-establish the concept of a "nascent black hole" as
the correct approach for modelling black holes from remote reference frames. It
uses, and only needs to use, Schwarzschild metrics and presents some example
scenarios to demonstrate the concepts through worked examples. Alternatives
such as Eddington-Finkelstein coordinates and Penrose's local collapsing frames
are not disputed; the Schwarzschild metrics must still be valid outside the
event horizon and this paper is largely concerned with "remote viewers" for
various meanings of "remote".
For most astrophysical or cosmological questions the difference between
"actual" and "nascent" black holes is largely irrelevant as they behave
similarly for most practical purposes. However the difference becomes critical
for effects that require an event horizon to interact with the remote viewer,
such as Hawking-Zel'dovich radiation and the related information problems
outlined by Susskind. That is: if there are no possible observable paths from a
nascent event horizon to any remote viewer then there also cannot be any
evaporation to the remote viewer
| physics.pop-ph | in the second half of the last century the frozen star or collapsed star models of black hole formation were largely abandoned the result is that later models appear to either assume that black hole event horizons already exist such as in hawkings 1975 paper on radiation from black holes bypass the relative frames altogether such as in mirabels 2017 paper on the formation of stellar black holes or use coordinate systems that essentially ignore the remote viewers point of view kruskal 1960 this paper attempts to reestablish the concept of a nascent black hole as the correct approach for modelling black holes from remote reference frames it uses and only needs to use schwarzschild metrics and presents some example scenarios to demonstrate the concepts through worked examples alternatives such as eddingtonfinkelstein coordinates and penroses local collapsing frames are not disputed the schwarzschild metrics must still be valid outside the event horizon and this paper is largely concerned with remote viewers for various meanings of remote for most astrophysical or cosmological questions the difference between actual and nascent black holes is largely irrelevant as they behave similarly for most practical purposes however the difference becomes critical for effects that require an event horizon to interact with the remote viewer such as hawkingzeldovich radiation and the related information problems outlined by susskind that is if there are no possible observable paths from a nascent event horizon to any remote viewer then there also cannot be any evaporation to the remote viewer | [['in', 'the', 'second', 'half', 'of', 'the', 'last', 'century', 'the', 'frozen', 'star', 'or', 'collapsed', 'star', 'models', 'of', 'black', 'hole', 'formation', 'were', 'largely', 'abandoned', 'the', 'result', 'is', 'that', 'later', 'models', 'appear', 'to', 'either', 'assume', 'that', 'black', 'hole', 'event', 'horizons', 'already', 'exist', 'such', 'as', 'in', 'hawkings', '1975', 'paper', 'on', 'radiation', 'from', 'black', 'holes', 'bypass', 'the', 'relative', 'frames', 'altogether', 'such', 'as', 'in', 'mirabels', '2017', 'paper', 'on', 'the', 'formation', 'of', 'stellar', 'black', 'holes', 'or', 'use', 'coordinate', 'systems', 'that', 'essentially', 'ignore', 'the', 'remote', 'viewers', 'point', 'of', 'view', 'kruskal', '1960', 'this', 'paper', 'attempts', 'to', 'reestablish', 'the', 'concept', 'of', 'a', 'nascent', 'black', 'hole', 'as', 'the', 'correct', 'approach', 'for', 'modelling', 'black', 'holes', 'from', 'remote', 'reference', 'frames', 'it', 'uses', 'and', 'only', 'needs', 'to', 'use', 'schwarzschild', 'metrics', 'and', 'presents', 'some', 'example', 'scenarios', 'to', 'demonstrate', 'the', 'concepts', 'through', 'worked', 'examples', 'alternatives', 'such', 'as', 'eddingtonfinkelstein', 'coordinates', 'and', 'penroses', 'local', 'collapsing', 'frames', 'are', 'not', 'disputed', 'the', 'schwarzschild', 'metrics', 'must', 'still', 'be', 'valid', 'outside', 'the', 'event', 'horizon', 'and', 'this', 'paper', 'is', 'largely', 'concerned', 'with', 'remote', 'viewers', 'for', 'various', 'meanings', 'of', 'remote', 'for', 'most', 'astrophysical', 'or', 'cosmological', 'questions', 'the', 'difference', 'between', 'actual', 'and', 'nascent', 'black', 'holes', 'is', 'largely', 'irrelevant', 'as', 'they', 'behave', 'similarly', 'for', 'most', 'practical', 'purposes', 'however', 'the', 'difference', 'becomes', 'critical', 'for', 'effects', 'that', 'require', 'an', 'event', 'horizon', 'to', 'interact', 'with', 'the', 'remote', 'viewer', 'such', 'as', 'hawkingzeldovich', 'radiation', 'and', 'the', 'related', 'information', 'problems', 'outlined', 'by', 'susskind', 'that', 'is', 'if', 'there', 'are', 'no', 'possible', 'observable', 'paths', 'from', 'a', 'nascent', 'event', 'horizon', 'to', 'any', 'remote', 'viewer', 'then', 'there', 'also', 'can', 'not', 'be', 'any', 'evaporation', 'to', 'the', 'remote', 'viewer']] | [-0.09137914454504609, 0.09709715149623677, -0.07666840101685748, 0.13900425326150195, -0.11062567700055918, -0.1553998899732129, 0.0222886816077645, 0.35137368707233163, -0.2164943776847084, -0.3192810618391552, 0.1474748431937769, -0.3225152502621872, -0.10917826030257506, 0.20246643573700274, -0.12941433688304033, 0.008129914769955188, 0.05868653496671244, 0.06245767379490038, -0.06997794781724574, -0.24264822144016443, 0.3587108205636717, 0.11892095157768144, 0.2253256905823946, 0.010153724492179701, 0.08842129392519474, 0.02063074146947229, -0.02958456868956606, 0.03886800689106605, -0.1133098804790082, 0.03307639956114305, 0.2843168461932878, 0.21958715332999623, 0.26541549813406295, -0.44229786771248625, -0.23265287916299449, 0.0897274943551116, 0.17349294724139708, 0.1484695767444263, -0.10562331396263526, -0.26813170046313667, 0.07187492710614883, -0.22103694709668675, -0.10189922369388213, -0.005188213756221934, 0.06277571680271123, -0.03709439658812326, -0.18438439113770547, 0.08609334595889942, 0.07785276597638424, -0.0183288562653893, -0.09699960091865685, -0.017621481850047607, -0.02656014656309547, 0.17731051103316667, 0.12657310006332145, 0.041306707296701876, 0.19012886617729163, -0.08114297943606778, -0.1258120787569348, 0.38762376797067594, 0.02070305500568515, -0.16940391702010824, 0.2265167129955378, -0.16223158466117268, -0.11323646183993413, 0.07019949218526625, 0.13047758350569574, 0.1835180239052508, -0.1690888424636796, 0.05740365050976206, 0.017954641687552852, 0.16314152327081446, 0.13850264020084616, 0.05736690785045769, 0.3697161483569033, 0.09117268377832739, 0.033439417502442635, 0.09189062165451727, -0.059344705299896945, -0.08474798949110887, -0.297478161536692, -0.15473561089048274, -0.173026073984914, 0.049141129989473405, -0.08168774333571638, -0.1852244479286234, 0.2913971285758368, 0.16585262915321503, 0.1781621151061422, -0.01753365744024994, 0.28524644406874483, 0.02790364684877416, 0.05445242207064892, 0.12070172321589956, 0.29492545555250804, 0.05025349715659133, 0.15957198388608973, -0.1332973378249229, 0.050429890975571164, 0.05883272387738149] |
1,802.02008 | Applications of involutive Heegaard Floer homology | We use Heegaard Floer homology to define an invariant of homology cobordism.
This invariant is isomorphic to a summand of the reduced Heegaard Floer
homology of a rational homology sphere equipped with a spin structure and is
analogous to Stoffregen's connected Seiberg-Witten Floer homology. We use this
invariant to study the structure of the homology cobordism group and, along the
way, compute the involutive correction terms for certain families of
three-manifolds.
| math.GT | we use heegaard floer homology to define an invariant of homology cobordism this invariant is isomorphic to a summand of the reduced heegaard floer homology of a rational homology sphere equipped with a spin structure and is analogous to stoffregens connected seibergwitten floer homology we use this invariant to study the structure of the homology cobordism group and along the way compute the involutive correction terms for certain families of threemanifolds | [['we', 'use', 'heegaard', 'floer', 'homology', 'to', 'define', 'an', 'invariant', 'of', 'homology', 'cobordism', 'this', 'invariant', 'is', 'isomorphic', 'to', 'a', 'summand', 'of', 'the', 'reduced', 'heegaard', 'floer', 'homology', 'of', 'a', 'rational', 'homology', 'sphere', 'equipped', 'with', 'a', 'spin', 'structure', 'and', 'is', 'analogous', 'to', 'stoffregens', 'connected', 'seibergwitten', 'floer', 'homology', 'we', 'use', 'this', 'invariant', 'to', 'study', 'the', 'structure', 'of', 'the', 'homology', 'cobordism', 'group', 'and', 'along', 'the', 'way', 'compute', 'the', 'involutive', 'correction', 'terms', 'for', 'certain', 'families', 'of', 'threemanifolds']] | [-0.31891059000045063, 0.013909047384887734, -0.20030272006988525, 0.15967102751684642, -0.12030250036290714, -0.1934994211753032, -0.07592161341038134, 0.321399937437049, -0.4129924015807254, -0.2647593962693853, 0.052733632576252736, -0.22856332249939443, -0.21511286735933807, 0.06843558230570385, -0.2685501351287322, -0.010318284681332963, 0.09866093765678151, 0.12056160923093558, -0.1516465251999242, -0.2047029343234109, 0.4669748528727463, -0.04240395841853959, 0.11867065392434598, 0.1386122434400022, 0.11495399828335004, -0.028480647969990967, -0.030956132683370795, -0.0451352683827281, -0.2833169137925974, 0.17182997517686868, 0.35867600520806653, -0.11851127331278154, 0.0031699681471634125, -0.3294156488696379, -0.02700234265731914, 0.19053636388853193, 0.13129028100520374, -0.04062907827485885, 0.018561059522575567, -0.31244326720812493, 0.12280694119898336, -0.2671955942841513, -0.13987719507089683, -0.1337373688417886, 0.009791805555245706, -0.01754331024297114, -0.0981823436732936, -0.10518784138507077, 0.005523525963404349, 0.17775108650592822, -0.01890090495747115, -0.02140169421077839, -0.09137616389697152, 0.18171249399892986, 0.038860788495678984, 0.15625777131811316, 0.19469692579337528, -0.085224217605511, -0.1756765882617661, 0.40385547410031514, -0.11699539795517921, -0.32219861993300064, 0.0777462899618383, -0.07581173287970679, -0.33175269909469146, 0.23537507530833993, -0.05261021871119738, 0.15613060678754534, 0.019305274760284062, 0.20362597344542988, -0.09239892552473715, 0.08975787383304643, 0.0706662995341633, -0.07153949245278324, 0.17571290750056506, 0.03138278178604586, 0.1964314372544842, 0.19759352149641407, -0.02988748092736517, -0.12250429726804474, -0.2687664081475564, -0.3202936911556338, -0.11349492057093552, 0.24985104634958719, -0.11440895077996954, -0.245762877139662, 0.45881492580686295, 0.023749177610235556, 0.1199691833129951, 0.25709952555064647, 0.33127868091354945, -0.02803774561200823, 0.11015635300427676, 0.017740655204813396, 0.05240786988953394, 0.30422276684216093, -0.07970181216618845, -0.11140678483726722, -0.09690786761514443, 0.38924975491661046] |
1,802.02009 | The nonparametric LAN expansion for discretely observed diffusions | Consider a scalar reflected diffusion $(X_t:t\geq 0)$, where the unknown
drift function $b$ is modelled nonparametrically. We show that in the low
frequency sampling case, when the sample consists of
$(X_0,X_\Delta,...,X_{n\Delta})$ for some fixed sampling distance $\Delta>0$,
the model satisfies the local asymptotic normality (LAN) property, assuming
that $b$ satisfies some mild regularity assumptions. This is established by
using the connections of diffusion processes to elliptic and parabolic PDEs.
The key tools will be regularity estimates from the theory of parabolic PDEs as
well as a detailed analysis of the spectral properties of the elliptic
differential operator related to $(X_t:t\geq 0)$.
| math.ST stat.TH | consider a scalar reflected diffusion x_ttgeq 0 where the unknown drift function b is modelled nonparametrically we show that in the low frequency sampling case when the sample consists of x_0x_deltax_ndelta for some fixed sampling distance delta0 the model satisfies the local asymptotic normality lan property assuming that b satisfies some mild regularity assumptions this is established by using the connections of diffusion processes to elliptic and parabolic pdes the key tools will be regularity estimates from the theory of parabolic pdes as well as a detailed analysis of the spectral properties of the elliptic differential operator related to x_ttgeq 0 | [['consider', 'a', 'scalar', 'reflected', 'diffusion', 'x_ttgeq', '0', 'where', 'the', 'unknown', 'drift', 'function', 'b', 'is', 'modelled', 'nonparametrically', 'we', 'show', 'that', 'in', 'the', 'low', 'frequency', 'sampling', 'case', 'when', 'the', 'sample', 'consists', 'of', 'x_0x_deltax_ndelta', 'for', 'some', 'fixed', 'sampling', 'distance', 'delta0', 'the', 'model', 'satisfies', 'the', 'local', 'asymptotic', 'normality', 'lan', 'property', 'assuming', 'that', 'b', 'satisfies', 'some', 'mild', 'regularity', 'assumptions', 'this', 'is', 'established', 'by', 'using', 'the', 'connections', 'of', 'diffusion', 'processes', 'to', 'elliptic', 'and', 'parabolic', 'pdes', 'the', 'key', 'tools', 'will', 'be', 'regularity', 'estimates', 'from', 'the', 'theory', 'of', 'parabolic', 'pdes', 'as', 'well', 'as', 'a', 'detailed', 'analysis', 'of', 'the', 'spectral', 'properties', 'of', 'the', 'elliptic', 'differential', 'operator', 'related', 'to', 'x_ttgeq', '0']] | [-0.12464314960874617, 0.06274315402843059, -0.09321674084290862, 0.09084291088511236, -0.08520699746906757, -0.17840354669839142, -0.0013394529896322638, 0.3089248126139864, -0.3495830415189266, -0.22456352435052396, 0.14955942211556247, -0.27805125780403617, -0.10955596436047926, 0.17252484334399923, -0.08983516939450055, 0.09111796481534838, 0.04432621016632766, 0.04273698986042291, -0.07650276453234256, -0.18966913148178718, 0.36010279558598995, -0.011611488722264767, 0.20473100461065769, -0.023497678698113304, 0.11912909606937319, 0.03612484931945801, -0.04252660444006324, -0.015759873017668725, -0.20188056941216928, 0.06382755706086755, 0.21784686487866567, 0.06373927398584783, 0.30660853021778167, -0.3469894673951057, -0.23071431159041822, 0.10560992498882114, 0.1233050115662627, 0.008181152609176933, -0.035619594401214275, -0.2659037802950479, 0.1210128926835023, -0.0831464359164238, -0.22021481221483555, -0.03125915606040507, -0.0061995964497327805, 0.11789736251113936, -0.3499537847470492, 0.12439680258743464, 0.11015285983798094, 0.07729124219156802, -0.06047783822752535, -0.12338095187209547, -0.058370283341500906, 0.06616917664257926, 0.07545241883723065, -0.019360416866838932, 0.09969108232762665, -0.11477494412800297, -0.06253197024343535, 0.315700086504221, -0.1148094142973423, -0.25245981429005043, 0.14731937049888075, -0.17778356246184557, -0.12897696482483298, 0.09692939365748315, 0.15307103871367872, 0.14630789877846836, -0.16744023959341575, 0.18290456534567057, -0.06246253055520356, 0.12279493719339371, 0.0644980183057487, 0.021409462876617907, 0.059992992407642304, 0.14212369253626092, 0.12781146000023, 0.09097115022013895, -0.05325240691658109, -0.07515036380966195, -0.38837492260150613, -0.1323431613948196, -0.16884241917636245, 0.12301147452672012, -0.1455314796602761, -0.17065069334581495, 0.3436122066760436, 0.12649265837855636, 0.2006921849306673, 0.07217945458600297, 0.22893395350314677, 0.18621257632737978, -0.002255272701149806, 0.07597307941352482, 0.176062673512497, 0.21986742530483752, 0.10369258599821478, -0.1978501199814491, 0.10635963836219162, 0.09879969661589712] |
1,802.0201 | Effects of interaction imbalance in a strongly repulsive one-dimensional
Bose gas | We calculate the spatial distributions and the dynamics of a few-body
two-component strongly interacting Bose gas confined to an effectively
one-dimensional trapping potential. We describe the densities for each
component in the trap for different interaction and population imbalances. We
calculate the time evolution of the system and show that, for a certain ratio
of interactions, the minority population travels through the system as an
effective wave packet.
| cond-mat.quant-gas quant-ph | we calculate the spatial distributions and the dynamics of a fewbody twocomponent strongly interacting bose gas confined to an effectively onedimensional trapping potential we describe the densities for each component in the trap for different interaction and population imbalances we calculate the time evolution of the system and show that for a certain ratio of interactions the minority population travels through the system as an effective wave packet | [['we', 'calculate', 'the', 'spatial', 'distributions', 'and', 'the', 'dynamics', 'of', 'a', 'fewbody', 'twocomponent', 'strongly', 'interacting', 'bose', 'gas', 'confined', 'to', 'an', 'effectively', 'onedimensional', 'trapping', 'potential', 'we', 'describe', 'the', 'densities', 'for', 'each', 'component', 'in', 'the', 'trap', 'for', 'different', 'interaction', 'and', 'population', 'imbalances', 'we', 'calculate', 'the', 'time', 'evolution', 'of', 'the', 'system', 'and', 'show', 'that', 'for', 'a', 'certain', 'ratio', 'of', 'interactions', 'the', 'minority', 'population', 'travels', 'through', 'the', 'system', 'as', 'an', 'effective', 'wave', 'packet']] | [-0.16354796269254568, 0.19527956028511706, -0.07202628610042773, 0.0882978861713234, 0.06191493926898522, -0.12303824540611137, 0.01228134534047807, 0.3593301529831746, -0.26028087646152603, -0.2559110687716919, 0.019273201015654624, -0.2877928651869297, -0.08403034435639925, 0.10914928586605717, 0.08592454186531112, 0.005858375284279806, 0.02350750583333566, 0.007706362966393285, -0.039882837174980736, -0.19713160143617323, 0.3589708981487681, 0.054972614634179455, 0.26810977922971635, 0.07978814084301977, 0.10776534808032653, 0.07144443206626046, 0.058551805600633514, -0.01144814315964194, -0.11908532900323575, 0.06963447612189852, 0.1432528010208283, 0.07112910040921312, 0.24755034892244593, -0.4477644970311838, -0.25748169220819633, 0.09616438500062727, 0.221590985872728, 0.16290952419341706, -0.06835614828913308, -0.27583554613075273, -0.0799643662347294, -0.23987259973278818, -0.21750604777651675, -0.05550864288713509, 0.07945691688698442, 0.10758619382292689, -0.25844949374988896, 0.08378387098705656, 0.01733578336151207, 0.007397719412384664, -0.12415175202905256, -0.039073616146411305, -0.014489921186502804, 0.14121831709738164, -0.028370840697521892, -0.015767524032579625, 0.15992613053908022, -0.1677757202183677, -0.0373873098356211, 0.4023162937887451, -0.13448857583845145, -0.18440247061388457, 0.24955201948828556, -0.17557385759017266, -0.06423103032798014, 0.14336587718742735, 0.2356864915572634, 0.09037135166855638, -0.16731727276654804, 0.005798974095823188, -0.0392559984121523, 0.1755320447328439, -0.0062000208623323805, 0.01948029695160906, 0.2532379264011979, 0.1746785976608996, 0.061147850965533185, 0.16083666267256966, -0.14015137991073595, -0.1406780204954831, -0.24310984880225184, -0.16237027554170175, -0.18258649672497995, 0.015614992453372585, -0.05774997418463018, -0.16581899713149623, 0.42323102893800857, 0.15250794987043584, 0.21714544472942018, 0.04735766589189606, 0.2772187478703392, 0.18114515958757907, 0.012555140817044851, 0.07767176226137534, 0.20996520123855375, 0.12219887143274878, 0.05783403199508458, -0.3221574481576681, 0.0068356378469616175, 0.006507575422908892] |
1,802.02011 | Multi-frequency phase retrieval from noisy data | The phase retrieval from multi-frequency intensity (power) observations is
considered. The object to be reconstructed is complex-valued. A novel algorithm
is presented that accomplishes both the object phase (absolute phase) retrieval
and denoising for Poissonian and Gaussian measurements. The algorithm is
derived from the maximum likelihood formulation with Block Matching 3D (BM3D)
sparsity priors. These priors result in two filtering: one is in the complex
domain for complex-valued multi-frequency object images and another one in the
real domain for the object phase. The algorithm is iterative with alternating
projections between the object and measurement variables. The simulation
experiments are produced for Fourier transform image formation and random phase
modulations of the object, then the observations are random object diffraction
patterns. The results demonstrate the success of the algorithm for
reconstruction of the complex phase objects with the high-accuracy performance
even for very noisy data.
| eess.SP | the phase retrieval from multifrequency intensity power observations is considered the object to be reconstructed is complexvalued a novel algorithm is presented that accomplishes both the object phase absolute phase retrieval and denoising for poissonian and gaussian measurements the algorithm is derived from the maximum likelihood formulation with block matching 3d bm3d sparsity priors these priors result in two filtering one is in the complex domain for complexvalued multifrequency object images and another one in the real domain for the object phase the algorithm is iterative with alternating projections between the object and measurement variables the simulation experiments are produced for fourier transform image formation and random phase modulations of the object then the observations are random object diffraction patterns the results demonstrate the success of the algorithm for reconstruction of the complex phase objects with the highaccuracy performance even for very noisy data | [['the', 'phase', 'retrieval', 'from', 'multifrequency', 'intensity', 'power', 'observations', 'is', 'considered', 'the', 'object', 'to', 'be', 'reconstructed', 'is', 'complexvalued', 'a', 'novel', 'algorithm', 'is', 'presented', 'that', 'accomplishes', 'both', 'the', 'object', 'phase', 'absolute', 'phase', 'retrieval', 'and', 'denoising', 'for', 'poissonian', 'and', 'gaussian', 'measurements', 'the', 'algorithm', 'is', 'derived', 'from', 'the', 'maximum', 'likelihood', 'formulation', 'with', 'block', 'matching', '3d', 'bm3d', 'sparsity', 'priors', 'these', 'priors', 'result', 'in', 'two', 'filtering', 'one', 'is', 'in', 'the', 'complex', 'domain', 'for', 'complexvalued', 'multifrequency', 'object', 'images', 'and', 'another', 'one', 'in', 'the', 'real', 'domain', 'for', 'the', 'object', 'phase', 'the', 'algorithm', 'is', 'iterative', 'with', 'alternating', 'projections', 'between', 'the', 'object', 'and', 'measurement', 'variables', 'the', 'simulation', 'experiments', 'are', 'produced', 'for', 'fourier', 'transform', 'image', 'formation', 'and', 'random', 'phase', 'modulations', 'of', 'the', 'object', 'then', 'the', 'observations', 'are', 'random', 'object', 'diffraction', 'patterns', 'the', 'results', 'demonstrate', 'the', 'success', 'of', 'the', 'algorithm', 'for', 'reconstruction', 'of', 'the', 'complex', 'phase', 'objects', 'with', 'the', 'highaccuracy', 'performance', 'even', 'for', 'very', 'noisy', 'data']] | [-0.07323095517737481, 0.05578691647194015, -0.10201762950358291, 0.036171370898147065, -0.08932503909778057, -0.13640762431411227, -0.0001765033003822383, 0.46930984531839687, -0.281911660089261, -0.31839930455640164, 0.1519068354658278, -0.2692561211426639, -0.1689814484432443, 0.18923856598323457, -0.07799949247985044, 0.11316630060900934, 0.1219409152286567, 0.01674400267398192, -0.09390186520694341, -0.22985199012651314, 0.2787765773084377, 0.030314790181970846, 0.286417609701554, -0.0668559276447114, 0.12227517096471274, 0.013476483194002261, -0.07767781835476247, -0.03078882725417821, -0.02520929659360465, 0.09301960728609832, 0.2604609145718213, 0.16831778356895988, 0.17670280201451127, -0.36017648316919804, -0.2361684460969021, 0.10613797664215478, 0.11387219992967504, 0.10043855848359978, -0.0770530120628084, -0.3574975081460757, 0.08022717374519238, -0.07102846463547191, -0.01539357181172818, -0.07719087671850705, -0.019076082508642383, 0.008572495371077416, -0.3503068048869156, 0.08321345826374858, 0.0656380482157854, 0.02753998143372074, -0.08957276087474181, -0.09873633209887582, 0.054075636247742094, 0.11965353864232181, -0.009280673464268653, 0.07355998963854897, 0.11752479823513164, -0.17250550020900038, -0.11709038036254545, 0.37922913065671715, -0.03495901317930677, -0.2128217805584427, 0.15521412528242864, -0.14224922119723893, -0.1220466254485978, 0.17673882561050253, 0.16420903604658735, 0.13994601672877455, -0.11510876917357867, 0.02707808275065165, -0.02883426372298143, 0.18346265634884024, 0.05234503812809837, 0.005224325897870585, 0.19077610635981224, 0.17030912955750763, 0.07329822211047737, 0.15643996778332317, -0.21352665296904483, -0.06564868854992609, -0.23733879087053034, -0.1146987190489502, -0.27838341721023124, -0.08165066605255965, -0.16955073840361162, -0.15374170124091002, 0.40761433182827506, 0.15474103431269112, 0.22400053835008293, 0.06506377128728975, 0.3768347124569118, 0.1040548195976751, 0.014682591571019858, 0.024228001715123862, 0.2053914185703939, 0.11968315033138627, 0.11656433023098442, -0.18687450299007147, 0.05495978432635537, 0.08329504462663964] |
1,802.02012 | Strong pseudo-amenability of some Banach algebras | In this paper we introduce a new notion of strong pseudo-amenability for
Banach algebras. We study strong pseudo-amenability of some Matrix algebras.
Using this tool, we characterize strong pseudo-amenability of $\ell^{1}(S)$,
provided that $S$ is a uniformly locally finite semigroup. As an application we
show that for a Brandt semigroup $S=M^{0}(G,I)$, $\ell^{1}(S)$ is strong
pseudo-amenable if and only if $G$ is amenable and $I$ is finite. We give some
examples to show the differences of strong pseudo-amenability and other
classical notions of amenability.
| math.FA | in this paper we introduce a new notion of strong pseudoamenability for banach algebras we study strong pseudoamenability of some matrix algebras using this tool we characterize strong pseudoamenability of ell1s provided that s is a uniformly locally finite semigroup as an application we show that for a brandt semigroup sm0gi ell1s is strong pseudoamenable if and only if g is amenable and i is finite we give some examples to show the differences of strong pseudoamenability and other classical notions of amenability | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'notion', 'of', 'strong', 'pseudoamenability', 'for', 'banach', 'algebras', 'we', 'study', 'strong', 'pseudoamenability', 'of', 'some', 'matrix', 'algebras', 'using', 'this', 'tool', 'we', 'characterize', 'strong', 'pseudoamenability', 'of', 'ell1s', 'provided', 'that', 's', 'is', 'a', 'uniformly', 'locally', 'finite', 'semigroup', 'as', 'an', 'application', 'we', 'show', 'that', 'for', 'a', 'brandt', 'semigroup', 'sm0gi', 'ell1s', 'is', 'strong', 'pseudoamenable', 'if', 'and', 'only', 'if', 'g', 'is', 'amenable', 'and', 'i', 'is', 'finite', 'we', 'give', 'some', 'examples', 'to', 'show', 'the', 'differences', 'of', 'strong', 'pseudoamenability', 'and', 'other', 'classical', 'notions', 'of', 'amenability']] | [-0.1410635731001271, 0.11433442560093415, -0.08904563887726243, 0.10051594110398848, -0.11737242515948487, -0.1293967130718889, -0.0014085544985946176, 0.4363503172630217, -0.364730898836037, -0.11613826283321875, 0.1357353955632212, -0.27801736102939195, -0.1677929596498427, 0.2034258085314366, -0.145796352168318, -0.06134491416103229, 0.07862329891905552, 0.0727347470876738, -0.08906611251054196, -0.22810191770720228, 0.3969137494611304, -0.01839058292552647, 0.17982125445836927, 0.13628141325898468, 0.11023913259850815, -0.005376744214672505, -0.01730863711932992, 0.07728016359458972, -0.19698868716428788, 0.08978579961410837, 0.2462219633020052, 0.12967501840236165, 0.32836041086148926, -0.3438915220520845, -0.11227295270030636, 0.18854467737738315, 0.059050457376032706, 0.019679605072114345, -0.1201779589215975, -0.27796280113753025, 0.20665764551973198, -0.23036672125667015, -0.08822350401896983, -0.1366806873943793, 0.08341890320227277, 0.02506188183693533, -0.3054624146827292, 0.0014632133392208234, 0.1913830298226236, 0.11768219421231528, -0.02616498686895683, -0.04526522140041357, -0.004531221807843483, 0.07434192546870469, -0.041488644292169224, -0.000953795845484043, 0.04130697984634558, -0.03769503228604884, -0.11610504529416198, 0.33876055878836936, -0.0886452958305798, -0.15765544976016915, 0.21314608747503017, -0.18424678033944675, -0.19141004779716816, 0.020231266195102165, 0.050740626152241376, 0.1682515023049058, -0.07806106396700914, 0.21203541105809032, -0.16944796166087434, 0.11072539050904352, -0.00974187577461324, 0.0687761524714893, 0.06571323579324909, 0.10084072351398901, 0.14400511905664531, 0.18112438669635506, 0.06325940692388429, 0.04002013576512293, -0.38462950267669993, -0.19284508837296105, -0.12441962909396374, 0.11793838792321522, -0.07431001769802562, -0.2063411309656392, 0.34963684498968467, 0.16137605629756296, 0.13938832092212466, 0.09864702269934662, 0.18666339420611266, 0.08743674179578836, -0.008233307957331218, 0.09994196142183571, 0.15378685706229767, 0.2513811325245514, -0.019282821702157577, -0.16028664960162486, -0.0015465158730654455, 0.18140646744315037] |
1,802.02013 | Denoising, deconvolving and decomposing multi-domain photon
observations- The D4PO algorithm | Astronomical imaging based on photon count data is a non-trivial task. In
this context we show how to denoise, deconvolve, and decompose multi-domain
photon observations. The primary objective is to incorporate accurate and well
motivated likelihood and prior models in order to give reliable estimates about
morphologically different but superimposed photon flux components present in
the data set. Thereby we denoise and deconvolve photon counts, while
simultaneously decomposing them into diffuse, point-like and uninteresting
background radiation fluxes. The decomposition is based on a probabilistic
hierarchical Bayesian parameter model within the framework of information field
theory (IFT). In contrast to its predecessor D$^3$PO, D$^4$PO reconstructs
multi-domain components. Thereby each component is defined over its own direct
product of multiple independent domains, for example location and energy.
D$^4$PO has the capability to reconstruct correlation structures over each of
the sub-domains of a component separately. Thereby the inferred correlations
implicitly define the morphologically different source components, except for
the spatial correlations of the point-like flux. Point-like source fluxes are
spatially uncorrelated by definition. The capabilities of the algorithm are
demonstrated by means of a synthetic, but realistic, mock data set, providing
spectral and spatial information about each detected photon. D$^4$PO
successfully denoised, deconvolved, and decomposed a photon count image into
diffuse, point-like and background flux, each being functions of location as
well as energy. Moreover, uncertainty estimates of the reconstructed fields as
well as of their correlation structure are provided employing their posterior
density function and accounting for the manifolds the domains reside on.
| astro-ph.IM | astronomical imaging based on photon count data is a nontrivial task in this context we show how to denoise deconvolve and decompose multidomain photon observations the primary objective is to incorporate accurate and well motivated likelihood and prior models in order to give reliable estimates about morphologically different but superimposed photon flux components present in the data set thereby we denoise and deconvolve photon counts while simultaneously decomposing them into diffuse pointlike and uninteresting background radiation fluxes the decomposition is based on a probabilistic hierarchical bayesian parameter model within the framework of information field theory ift in contrast to its predecessor d3po d4po reconstructs multidomain components thereby each component is defined over its own direct product of multiple independent domains for example location and energy d4po has the capability to reconstruct correlation structures over each of the subdomains of a component separately thereby the inferred correlations implicitly define the morphologically different source components except for the spatial correlations of the pointlike flux pointlike source fluxes are spatially uncorrelated by definition the capabilities of the algorithm are demonstrated by means of a synthetic but realistic mock data set providing spectral and spatial information about each detected photon d4po successfully denoised deconvolved and decomposed a photon count image into diffuse pointlike and background flux each being functions of location as well as energy moreover uncertainty estimates of the reconstructed fields as well as of their correlation structure are provided employing their posterior density function and accounting for the manifolds the domains reside on | [['astronomical', 'imaging', 'based', 'on', 'photon', 'count', 'data', 'is', 'a', 'nontrivial', 'task', 'in', 'this', 'context', 'we', 'show', 'how', 'to', 'denoise', 'deconvolve', 'and', 'decompose', 'multidomain', 'photon', 'observations', 'the', 'primary', 'objective', 'is', 'to', 'incorporate', 'accurate', 'and', 'well', 'motivated', 'likelihood', 'and', 'prior', 'models', 'in', 'order', 'to', 'give', 'reliable', 'estimates', 'about', 'morphologically', 'different', 'but', 'superimposed', 'photon', 'flux', 'components', 'present', 'in', 'the', 'data', 'set', 'thereby', 'we', 'denoise', 'and', 'deconvolve', 'photon', 'counts', 'while', 'simultaneously', 'decomposing', 'them', 'into', 'diffuse', 'pointlike', 'and', 'uninteresting', 'background', 'radiation', 'fluxes', 'the', 'decomposition', 'is', 'based', 'on', 'a', 'probabilistic', 'hierarchical', 'bayesian', 'parameter', 'model', 'within', 'the', 'framework', 'of', 'information', 'field', 'theory', 'ift', 'in', 'contrast', 'to', 'its', 'predecessor', 'd3po', 'd4po', 'reconstructs', 'multidomain', 'components', 'thereby', 'each', 'component', 'is', 'defined', 'over', 'its', 'own', 'direct', 'product', 'of', 'multiple', 'independent', 'domains', 'for', 'example', 'location', 'and', 'energy', 'd4po', 'has', 'the', 'capability', 'to', 'reconstruct', 'correlation', 'structures', 'over', 'each', 'of', 'the', 'subdomains', 'of', 'a', 'component', 'separately', 'thereby', 'the', 'inferred', 'correlations', 'implicitly', 'define', 'the', 'morphologically', 'different', 'source', 'components', 'except', 'for', 'the', 'spatial', 'correlations', 'of', 'the', 'pointlike', 'flux', 'pointlike', 'source', 'fluxes', 'are', 'spatially', 'uncorrelated', 'by', 'definition', 'the', 'capabilities', 'of', 'the', 'algorithm', 'are', 'demonstrated', 'by', 'means', 'of', 'a', 'synthetic', 'but', 'realistic', 'mock', 'data', 'set', 'providing', 'spectral', 'and', 'spatial', 'information', 'about', 'each', 'detected', 'photon', 'd4po', 'successfully', 'denoised', 'deconvolved', 'and', 'decomposed', 'a', 'photon', 'count', 'image', 'into', 'diffuse', 'pointlike', 'and', 'background', 'flux', 'each', 'being', 'functions', 'of', 'location', 'as', 'well', 'as', 'energy', 'moreover', 'uncertainty', 'estimates', 'of', 'the', 'reconstructed', 'fields', 'as', 'well', 'as', 'of', 'their', 'correlation', 'structure', 'are', 'provided', 'employing', 'their', 'posterior', 'density', 'function', 'and', 'accounting', 'for', 'the', 'manifolds', 'the', 'domains', 'reside', 'on']] | [-0.05226958594046092, 0.05187244828979659, -0.08027539125818062, 0.11329221013011374, -0.0877048954974296, -0.10151252554417903, 0.011144127500562583, 0.4272220986709741, -0.249491882582837, -0.37462101877477777, 0.08450029893366405, -0.28037711616560995, -0.053578902870802525, 0.1669162904826991, -0.017601225273757876, 0.028374882286926546, 0.04103916728928448, 0.011655825620658132, -0.030628499291109966, -0.1859511439475153, 0.31631052837822127, 0.0707470476256305, 0.2980497394784899, 0.005462846815200204, 0.14506268982990717, 0.04091809574418156, -0.1255423700192524, 0.004420358965922874, -0.045089419879690854, 0.11807507351857138, 0.24011104925233506, 0.15958595444724605, 0.20581887722056197, -0.4054339643256123, -0.2571916354660583, 0.10240987190412983, 0.15802700725194824, 0.05516551434529938, 0.0003073557039520581, -0.3136537521038635, 0.02832414472032249, -0.12190395097741746, -0.08526391608536658, -0.07155967445717568, -0.0046076192232999075, 0.029249735527896354, -0.2659204594488998, 0.11141103890769005, 0.012516016175829437, 0.015407006575380902, -0.08657903155586515, -0.10865278728862861, -0.05323063672253068, 0.1612308159362955, 0.019096926686287194, 0.046859542432007385, 0.15352196833749573, -0.13007627363851018, -0.08297829237977364, 0.33792340499650414, -0.04918103076589936, -0.21500771596983254, 0.14870513677856778, -0.11576596038616392, -0.1272610364708144, 0.17097030890886616, 0.15523067858456022, 0.09502023485196064, -0.17072263892496048, 0.03739044709878777, -0.006772020318734634, 0.20604608970299082, 0.05628595182364176, 0.05121611090250818, 0.25184934576268336, 0.12390470242246511, 0.05279197378295211, 0.1491077300430131, -0.18093690944594829, -0.052798287756555526, -0.2684307350144922, -0.08926516862077577, -0.2015950721651464, -0.0012169557139351667, -0.10489447992058486, -0.17022331844480984, 0.42448390425049304, 0.13056790249782105, 0.22175284437844492, 0.049276335046170246, 0.3554058295676477, 0.08766929299277959, 0.06640255359113699, 0.06629431206873058, 0.18521359110315075, 0.1476509786235072, 0.058278276716183644, -0.14278056527640062, 0.0417079978522314, -0.00231743003408688] |
1,802.02014 | Lee-Yang zeros in lattice QCD for searching phase transition points | We report Lee-Yang zeros behavior at finite temperature and density. The
quark number densities, <n>, are calculated at the pure imaginary chemical
potential, where no sign problem occurs. Then, the canonical partition
functions, Z_C(n,T,V), up to some maximal values of n are estimated through
fitting theoretically motivated functions to <n>, which are used to compute the
Lee-Yang zeros. We study the temperature dependence of the distributions of the
Lee-Yang zeros around the pseudo-critical temperature region T/T_c = 0.84 -
1.35. In the distributions of the Lee-Yang zeros, we observe the Roberge-Weiss
phase transition at T/T_c >= 1.20. We discuss the dependence of the behaviors
of Lee-Yang zeros on the maximal value of n, so that we can estimate a reliable
infinite volume limit.
| hep-lat | we report leeyang zeros behavior at finite temperature and density the quark number densities n are calculated at the pure imaginary chemical potential where no sign problem occurs then the canonical partition functions z_cntv up to some maximal values of n are estimated through fitting theoretically motivated functions to n which are used to compute the leeyang zeros we study the temperature dependence of the distributions of the leeyang zeros around the pseudocritical temperature region tt_c 084 135 in the distributions of the leeyang zeros we observe the robergeweiss phase transition at tt_c 120 we discuss the dependence of the behaviors of leeyang zeros on the maximal value of n so that we can estimate a reliable infinite volume limit | [['we', 'report', 'leeyang', 'zeros', 'behavior', 'at', 'finite', 'temperature', 'and', 'density', 'the', 'quark', 'number', 'densities', 'n', 'are', 'calculated', 'at', 'the', 'pure', 'imaginary', 'chemical', 'potential', 'where', 'no', 'sign', 'problem', 'occurs', 'then', 'the', 'canonical', 'partition', 'functions', 'z_cntv', 'up', 'to', 'some', 'maximal', 'values', 'of', 'n', 'are', 'estimated', 'through', 'fitting', 'theoretically', 'motivated', 'functions', 'to', 'n', 'which', 'are', 'used', 'to', 'compute', 'the', 'leeyang', 'zeros', 'we', 'study', 'the', 'temperature', 'dependence', 'of', 'the', 'distributions', 'of', 'the', 'leeyang', 'zeros', 'around', 'the', 'pseudocritical', 'temperature', 'region', 'tt_c', '084', '135', 'in', 'the', 'distributions', 'of', 'the', 'leeyang', 'zeros', 'we', 'observe', 'the', 'robergeweiss', 'phase', 'transition', 'at', 'tt_c', '120', 'we', 'discuss', 'the', 'dependence', 'of', 'the', 'behaviors', 'of', 'leeyang', 'zeros', 'on', 'the', 'maximal', 'value', 'of', 'n', 'so', 'that', 'we', 'can', 'estimate', 'a', 'reliable', 'infinite', 'volume', 'limit']] | [-0.1551576693064901, 0.19502509378499405, -0.11812042414030734, 0.07348113314506888, -0.02892256187306357, -0.07678843180437674, 0.1317939621048095, 0.33225360774912505, -0.17327485871775186, -0.256025172824807, 0.059035072728263666, -0.37535287550173135, -0.09334496269247126, 0.1154100415570771, 0.08615140514541221, 0.10938974141112447, -0.07152552827957924, 0.0968607399150917, -0.17198629280309655, -0.23035067341000842, 0.2970404065401927, -0.024287356179160606, 0.2681017141757893, 0.15723340542000883, 0.03656544049560022, -0.015525337551258692, 0.04530483515181837, -0.04709583595238563, -0.20222218794497013, -0.019736955796384074, 0.24475399676090137, 0.02268777572855103, 0.20247141810274927, -0.32815337404921774, -0.1644103188955953, 0.23028754168816162, 0.17938167808436545, 0.03616873178036273, 0.00391105207430684, -0.19004278434362232, 0.07933267593927223, -0.10158767672686078, -0.25021706684883843, -0.05308349780785311, 0.04774398576984761, 0.02296871826162233, -0.29246343086872784, 0.11371886586973898, -0.034235319200934484, 0.12455857611660447, 0.002037176345827199, -0.20435915866224957, -0.04893289134150935, 0.10044370356853269, 0.045790178427363146, -0.001635785200907027, 0.166962820343955, -0.1265704219920185, -0.04435307810380429, 0.29560419658840703, -0.07170692335485536, -0.15238007338044524, 0.12205077212562143, -0.256731037079834, -0.13233522263535558, 0.1467517003839632, 0.11108523581916575, 0.13248142335532592, -0.09265271211121262, 0.12331378507230259, -0.04241418871273357, 0.15447337964565314, 0.11277389651978341, -0.02056303570348331, 0.24987299907796023, 0.05888962954627115, 0.0026436086094492124, 0.18466596802287666, -0.09744463766095456, -0.1502677778901235, -0.33551971375269174, -0.10530131019871025, -0.24655416543485925, 0.05968716839610153, -0.17549280730306518, -0.20251374277814502, 0.40717587857937615, 0.19468019918358626, 0.2890720936800392, 0.09347253579728525, 0.19974933309136195, 0.18683483200773848, 0.024110180501896544, 0.07753001698958022, 0.15942653760577144, 0.1638254597861351, 0.08261909021236816, -0.28252334562286796, 0.027887661821999345, 0.1016943332985701] |
1,802.02015 | Compact ADI method for solving two-dimensional Riesz space fractional
diffusion equation | In this paper, a compact alternating direction implicit (ADI) method has been
developed for solving two-dimensional Riesz space fractional diffusion
equation. The precision of the discretization method used in spatial directions
is twice the order of the corresponding fractional derivatives. It is proved
that the proposed method is unconditionally stable via the matrix analysis
method and the maximum error in achieving convergence is discussed. Several
numerical examples are considered aiming to demonstrate the validity and
applicability of the proposed technique.
| math.NA cs.NA | in this paper a compact alternating direction implicit adi method has been developed for solving twodimensional riesz space fractional diffusion equation the precision of the discretization method used in spatial directions is twice the order of the corresponding fractional derivatives it is proved that the proposed method is unconditionally stable via the matrix analysis method and the maximum error in achieving convergence is discussed several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed technique | [['in', 'this', 'paper', 'a', 'compact', 'alternating', 'direction', 'implicit', 'adi', 'method', 'has', 'been', 'developed', 'for', 'solving', 'twodimensional', 'riesz', 'space', 'fractional', 'diffusion', 'equation', 'the', 'precision', 'of', 'the', 'discretization', 'method', 'used', 'in', 'spatial', 'directions', 'is', 'twice', 'the', 'order', 'of', 'the', 'corresponding', 'fractional', 'derivatives', 'it', 'is', 'proved', 'that', 'the', 'proposed', 'method', 'is', 'unconditionally', 'stable', 'via', 'the', 'matrix', 'analysis', 'method', 'and', 'the', 'maximum', 'error', 'in', 'achieving', 'convergence', 'is', 'discussed', 'several', 'numerical', 'examples', 'are', 'considered', 'aiming', 'to', 'demonstrate', 'the', 'validity', 'and', 'applicability', 'of', 'the', 'proposed', 'technique']] | [-0.08957006612472469, -0.001502303704910446, -0.09927785677136854, 0.06140510700788582, -0.07698334310553037, -0.09780357224517502, -0.020275796590431126, 0.4000332019524649, -0.272891946695745, -0.2670745411189273, 0.16157343937811675, -0.21520457838196308, -0.1538059427170083, 0.2389212421607226, -0.03493867114011664, 0.1583820097737771, 0.04375131887500174, 0.003480736375786364, -0.08726851036481094, -0.3032959418487735, 0.2683127598837018, 0.023280986049212516, 0.32573008267208936, 0.048098947596736254, 0.1672529127798043, -0.05734181128209457, -0.0630379225127399, 0.01624148855880776, -0.11316895104364448, 0.15787556808500086, 0.24061112967319787, 0.050072515489591754, 0.35278537636622787, -0.33806469936462236, -0.2242449653625954, 0.0810042722034268, 0.17233597551094135, 0.091319078032393, -0.08507199917221442, -0.2938359759747982, 0.13483664016821423, -0.14459489253349603, -0.1780340614495799, -0.14259925561782438, -0.0174418253795011, 0.033047939115203914, -0.2848519244696945, 0.10603340102097718, 0.07133426892396529, 0.012010593572631479, -0.060866084741428496, -0.13997094631195067, 0.030060569441411646, 0.054139837267575784, 0.05404311827151105, 0.015036860090913252, 0.01290899505474954, -0.020099409003159964, -0.13065556735091377, 0.368526803329587, -0.07201214988017454, -0.3183533160132356, 0.13836240902310237, -0.11593373727519066, -0.08154571934137493, 0.15344570185989143, 0.14852899068500847, 0.20634765615686773, -0.1292148259584792, 0.10583050686254865, -0.010838593530934304, 0.14373913094168528, 0.06844203634536825, -0.02517315770382993, 0.06416562143422197, 0.2164183229848277, 0.14359009510371834, 0.11884757350781001, -0.13253009035252034, -0.13602871308103204, -0.28785215311218054, -0.21685711740283295, -0.24159443060634658, -0.054971537755045576, -0.09317174116113165, -0.09432723731733858, 0.3995407407855964, 0.20031831667292863, 0.08146583858178928, 0.03315845878096298, 0.3300993419776205, 0.20085756548505743, 0.026317992043914273, 0.06898236461565829, 0.2163956552511081, 0.1987233636667952, 0.11945843077846803, -0.25203786515339743, 0.0704238965350669, 0.18523121766920667] |
1,802.02016 | Orthogonality of super-Jack polynomials and a Hilbert space
interpretation of deformed Calogero-Moser-Sutherland operators | We prove orthogonality and compute explicitly the (quadratic) norms for
super-Jack polynomials $SP_\lambda((z_1,\ldots,z_n),(w_1,\ldots,w_m);\theta)$
with respect to a natural positive semi-definite, but degenerate, Hermitian
product $\langle\cdot,\cdot\rangle_{n,m}^\prime$. In case $m=0$ (or $n=0$), our
product reduces to Macdonald's well-known inner product
$\langle\cdot,\cdot\rangle_n^\prime$, and we recover his corresponding
orthogonality results for the Jack polynomials
$P_\lambda((z_1,\ldots,z_n);\theta)$. From our main results, we readily infer
that the kernel of $\langle\cdot,\cdot\rangle_{n,m}^\prime$ is spanned by the
super-Jack polynomials indexed by a partition $\lambda$ not containing the
$m\times n$ rectangle $(m^n)$. As an application, we provide a Hilbert space
interpretation of the deformed trigonometric Calogero-Moser-Sutherland
operators of type $A(n-1,m-1)$.
| math.QA math-ph math.MP | we prove orthogonality and compute explicitly the quadratic norms for superjack polynomials sp_lambdaz_1ldotsz_nw_1ldotsw_mtheta with respect to a natural positive semidefinite but degenerate hermitian product langlecdotcdotrangle_nmprime in case m0 or n0 our product reduces to macdonalds wellknown inner product langlecdotcdotrangle_nprime and we recover his corresponding orthogonality results for the jack polynomials p_lambdaz_1ldotsz_ntheta from our main results we readily infer that the kernel of langlecdotcdotrangle_nmprime is spanned by the superjack polynomials indexed by a partition lambda not containing the mtimes n rectangle mn as an application we provide a hilbert space interpretation of the deformed trigonometric calogeromosersutherland operators of type an1m1 | [['we', 'prove', 'orthogonality', 'and', 'compute', 'explicitly', 'the', 'quadratic', 'norms', 'for', 'superjack', 'polynomials', 'sp_lambdaz_1ldotsz_nw_1ldotsw_mtheta', 'with', 'respect', 'to', 'a', 'natural', 'positive', 'semidefinite', 'but', 'degenerate', 'hermitian', 'product', 'langlecdotcdotrangle_nmprime', 'in', 'case', 'm0', 'or', 'n0', 'our', 'product', 'reduces', 'to', 'macdonalds', 'wellknown', 'inner', 'product', 'langlecdotcdotrangle_nprime', 'and', 'we', 'recover', 'his', 'corresponding', 'orthogonality', 'results', 'for', 'the', 'jack', 'polynomials', 'p_lambdaz_1ldotsz_ntheta', 'from', 'our', 'main', 'results', 'we', 'readily', 'infer', 'that', 'the', 'kernel', 'of', 'langlecdotcdotrangle_nmprime', 'is', 'spanned', 'by', 'the', 'superjack', 'polynomials', 'indexed', 'by', 'a', 'partition', 'lambda', 'not', 'containing', 'the', 'mtimes', 'n', 'rectangle', 'mn', 'as', 'an', 'application', 'we', 'provide', 'a', 'hilbert', 'space', 'interpretation', 'of', 'the', 'deformed', 'trigonometric', 'calogeromosersutherland', 'operators', 'of', 'type', 'an1m1']] | [-0.1217367496436602, 0.06776605163696497, -0.015774267149828776, 0.06646331521101616, -0.0863792428406336, -0.1379468987836072, 3.432492244868509e-05, 0.307660659915337, -0.307138548615659, -0.18827251949340046, 0.1231922047871155, -0.2667051911534321, -0.17123706918710502, 0.17147276344989495, -0.08561410877593262, 0.011857093767493321, 0.04977791467981954, 0.07272695273602812, -0.16288169052061294, -0.2835367765297653, 0.39668119610137037, -0.0014574719512815116, 0.15572110821883525, 0.0003078137048750475, 0.08239654822134844, 0.03477691724440784, -0.01773087085495072, -0.059164087924297636, -0.1359672506258639, 0.14007308801964066, 0.2666227358333286, 0.14162072945938206, 0.21506932069377233, -0.3562233253952957, -0.07643175491642568, 0.16265214384553495, 0.17510640514033135, 0.005719073414702409, 0.012793193784071713, -0.28926226712753295, 0.022785205810871578, -0.177946689373423, -0.20100740005352324, -0.11100015916951722, 0.020603639907353827, 0.009301985463788432, -0.34566605606326656, 0.04506150057779685, 0.10888756135658871, 0.043649889377286276, -0.09398700576025232, -0.20805125538339858, -0.01622439173340637, 0.06782870786014183, -0.026463151803009854, 0.02831712074112147, 0.04070273484353737, -0.016132293739706597, -0.11699953620254452, 0.34944680994076116, -0.05445918825302293, -0.2929141992923393, 0.10616175948031327, -0.1886537041294799, -0.1435688616500126, 0.08584102057921951, 0.08836886559623064, 0.12867845539804748, -0.02138683060684832, 0.17430739396036432, -0.150170691848372, 0.10451758947343595, 0.1509827064870987, 0.020307351449524523, 0.12751837522642667, -0.016799754773577053, 0.07258274670570128, 0.20063987002277406, 0.03887213410068584, -0.09960605313761099, -0.3232759941326735, -0.2039188032128638, -0.2387210852616737, 0.12185405137068066, -0.15431275235718087, -0.19270227853489177, 0.36713798698138006, 0.04672226673793248, 0.22199628446301226, 0.12451736138813117, 0.21027522474046675, 0.1609517321583905, 0.07829124460457473, 0.044547060420686596, 0.10259431808115414, 0.20163741907585533, 0.02666282540647894, -0.16662986394548687, -0.0013042227164792117, 0.18997767077939165] |
1,802.02017 | Crossed extensions and equivalences of topological 2-groupoids | We provide concrete models for generalized morphisms and Morita equivalences
of topological 2-groupoids by introducing the notions of crossings and crossed
extensions of groupoid crossed modules. A systematic study of these objects is
elaborated and an explicit description of how they do yield a groupoid and
geometric picture of weak 2-groupoid morphisms is presented. Specifically, we
construct a weak 3-category whose objects are crossed modules of topological
groupoids and in which weak 1-isomorphisms correspond to Morita equivalences in
the "category" of topological 2-groupoids.
| math.AT math.CT math.GR | we provide concrete models for generalized morphisms and morita equivalences of topological 2groupoids by introducing the notions of crossings and crossed extensions of groupoid crossed modules a systematic study of these objects is elaborated and an explicit description of how they do yield a groupoid and geometric picture of weak 2groupoid morphisms is presented specifically we construct a weak 3category whose objects are crossed modules of topological groupoids and in which weak 1isomorphisms correspond to morita equivalences in the category of topological 2groupoids | [['we', 'provide', 'concrete', 'models', 'for', 'generalized', 'morphisms', 'and', 'morita', 'equivalences', 'of', 'topological', '2groupoids', 'by', 'introducing', 'the', 'notions', 'of', 'crossings', 'and', 'crossed', 'extensions', 'of', 'groupoid', 'crossed', 'modules', 'a', 'systematic', 'study', 'of', 'these', 'objects', 'is', 'elaborated', 'and', 'an', 'explicit', 'description', 'of', 'how', 'they', 'do', 'yield', 'a', 'groupoid', 'and', 'geometric', 'picture', 'of', 'weak', '2groupoid', 'morphisms', 'is', 'presented', 'specifically', 'we', 'construct', 'a', 'weak', '3category', 'whose', 'objects', 'are', 'crossed', 'modules', 'of', 'topological', 'groupoids', 'and', 'in', 'which', 'weak', '1isomorphisms', 'correspond', 'to', 'morita', 'equivalences', 'in', 'the', 'category', 'of', 'topological', '2groupoids']] | [-0.19712611335534147, 0.10227699616016031, -0.08117156889766636, 0.15740578123311535, -0.11019339834953226, -0.15344588910002352, -0.012494638816328583, 0.42449445518233425, -0.39291959442766156, -0.22682628398988305, 0.048705356675427317, -0.2083462869191951, -0.14712657054840791, 0.15958232038637352, -0.20585912824949112, -0.059017417958097125, 0.07241402092821352, 0.05769304183585763, -0.13321290882559855, -0.19065318658675362, 0.4767953660793421, -0.003985039170025053, 0.24432805471303987, 0.03913769902229854, 0.10699733149078561, -0.026726564017646923, -0.03920525031323295, 0.055570717991852175, -0.19093076968082887, 0.15622477729168788, 0.3351903775635991, 0.044428310924913825, 0.13670225450683884, -0.408956986329541, -0.05964999185965919, 0.12147392254186476, 0.04717976837873277, 0.021795287738247526, -0.009412627996558823, -0.3895926415102511, 0.10363117313557645, -0.25707375031623353, -0.06519439785241536, -0.14707180755440055, 0.07278840184330986, 0.012511682591582762, -0.17805627861809803, -0.05995250133252362, 0.16658869106322527, 0.1639373066789675, -0.08269471121616889, 0.023561394338285913, -0.0909490696234038, 0.10976595621805911, -0.062490562993533366, -0.07831428626200139, 0.1372333612099926, -0.11335289478302002, -0.19209486876029475, 0.3674904120767989, -0.026593292288186892, -0.19936835802182917, 0.20841578817812773, -0.08556088738756754, -0.18496703420674837, 0.11808340779573816, 0.005718672693502612, 0.13775014804630745, -0.06177398630754352, 0.1587397481233915, -0.11122640400625221, 0.01052215812364366, 0.08224946493850793, 0.07332830681897155, 0.16511390590472375, 0.10044670457065832, 0.06466201330228459, 0.16294175791327, 0.05392021462662009, -0.03404561408068531, -0.39324038212255735, -0.2146000540304202, 0.03967505625857994, 0.1302307478106785, -0.046228383292079185, -0.2137979093439332, 0.4197608363337633, 0.14486797376558547, 0.189747111525432, 0.1302663727717406, 0.2071889300898808, 0.0574273791436742, 0.08491635867167355, -0.033601106462500446, 0.19928718771694637, 0.3240932528548533, -0.05495161581330183, -0.036102984838823717, -0.0666541925449742, 0.2502407034427473] |
1,802.02018 | Orthogonally Regularized Deep Networks For Image Super-resolution | Deep learning methods, in particular trained Convolutional Neural Networks
(CNNs) have recently been shown to produce compelling state-of-the-art results
for single image Super-Resolution (SR). Invariably, a CNN is learned to map the
low resolution (LR) image to its corresponding high resolution (HR) version in
the spatial domain. Aiming for faster inference and more efficient solutions
than solving the SR problem in the spatial domain, we propose a novel network
structure for learning the SR mapping function in an image transform domain,
specifically the Discrete Cosine Transform (DCT). As a first contribution, we
show that DCT can be integrated into the network structure as a Convolutional
DCT (CDCT) layer. We further extend the network to allow the CDCT layer to
become trainable (i.e. optimizable). Because this layer represents an image
transform, we enforce pairwise orthogonality constraints on the individual
basis functions/filters. This Orthogonally Regularized Deep SR network (ORDSR)
simplifies the SR task by taking advantage of image transform domain while
adapting the design of transform basis to the training image set.
| cs.CV | deep learning methods in particular trained convolutional neural networks cnns have recently been shown to produce compelling stateoftheart results for single image superresolution sr invariably a cnn is learned to map the low resolution lr image to its corresponding high resolution hr version in the spatial domain aiming for faster inference and more efficient solutions than solving the sr problem in the spatial domain we propose a novel network structure for learning the sr mapping function in an image transform domain specifically the discrete cosine transform dct as a first contribution we show that dct can be integrated into the network structure as a convolutional dct cdct layer we further extend the network to allow the cdct layer to become trainable ie optimizable because this layer represents an image transform we enforce pairwise orthogonality constraints on the individual basis functionsfilters this orthogonally regularized deep sr network ordsr simplifies the sr task by taking advantage of image transform domain while adapting the design of transform basis to the training image set | [['deep', 'learning', 'methods', 'in', 'particular', 'trained', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'recently', 'been', 'shown', 'to', 'produce', 'compelling', 'stateoftheart', 'results', 'for', 'single', 'image', 'superresolution', 'sr', 'invariably', 'a', 'cnn', 'is', 'learned', 'to', 'map', 'the', 'low', 'resolution', 'lr', 'image', 'to', 'its', 'corresponding', 'high', 'resolution', 'hr', 'version', 'in', 'the', 'spatial', 'domain', 'aiming', 'for', 'faster', 'inference', 'and', 'more', 'efficient', 'solutions', 'than', 'solving', 'the', 'sr', 'problem', 'in', 'the', 'spatial', 'domain', 'we', 'propose', 'a', 'novel', 'network', 'structure', 'for', 'learning', 'the', 'sr', 'mapping', 'function', 'in', 'an', 'image', 'transform', 'domain', 'specifically', 'the', 'discrete', 'cosine', 'transform', 'dct', 'as', 'a', 'first', 'contribution', 'we', 'show', 'that', 'dct', 'can', 'be', 'integrated', 'into', 'the', 'network', 'structure', 'as', 'a', 'convolutional', 'dct', 'cdct', 'layer', 'we', 'further', 'extend', 'the', 'network', 'to', 'allow', 'the', 'cdct', 'layer', 'to', 'become', 'trainable', 'ie', 'optimizable', 'because', 'this', 'layer', 'represents', 'an', 'image', 'transform', 'we', 'enforce', 'pairwise', 'orthogonality', 'constraints', 'on', 'the', 'individual', 'basis', 'functionsfilters', 'this', 'orthogonally', 'regularized', 'deep', 'sr', 'network', 'ordsr', 'simplifies', 'the', 'sr', 'task', 'by', 'taking', 'advantage', 'of', 'image', 'transform', 'domain', 'while', 'adapting', 'the', 'design', 'of', 'transform', 'basis', 'to', 'the', 'training', 'image', 'set']] | [-0.01706003805717835, -0.06334862784473422, -0.0811432463520891, 0.0532889780609487, -0.12118854530643762, -0.1769172280650945, -0.004459430143820593, 0.4956190530070474, -0.3449946463904736, -0.2590154593316726, 0.08329239943210619, -0.23028216361775097, -0.2049949951245483, 0.12865290198340473, -0.12206361004283248, 0.11849301736219786, 0.10152187816664038, 0.014044484851534018, -0.11926157800242282, -0.24041635370588896, 0.27973994717187056, 0.05429988997358638, 0.380310113707288, -0.036756082656737195, 0.15933667269187518, -0.015482300325824195, -0.015331322372139218, -0.04266244915302798, -0.01660442455688033, 0.19228746610657166, 0.284257266648024, 0.1792961053707334, 0.3038707349045449, -0.4760684427210545, -0.25730146232891427, 0.08272987837252398, 0.1988404187183064, 0.0921196054585884, -0.03252753555041483, -0.34026846812136124, 0.10714085318894316, -0.1223598807848182, 0.04987469789325204, -0.1409650609606922, -0.0238477302889104, -0.05001170506893029, -0.3110318175574529, 0.008077056988714689, 0.1098345900248983, 0.031238729734512336, -0.06960463455979185, -0.1191989211968696, 0.04094231492665832, 0.1320185195879046, -0.018599414940954045, 0.12228550778138059, 0.10431304852006934, -0.1825431033278849, -0.05844591199546626, 0.3447821767585554, -0.06676300596882356, -0.24902152339647332, 0.14392140156488462, -0.0650671818798565, -0.13563173793744385, 0.1377246532468574, 0.22641637465840833, 0.1031892811767308, -0.16030031226151792, 0.04280923187283165, -0.04094122076920424, 0.21287091308082623, 0.08555314925370222, 0.03144144105825977, 0.16479219361671235, 0.2568910141932744, 0.07489375830824341, 0.17012561258582218, -0.20751342266806436, -0.027104477072695653, -0.179253526806203, -0.13837694349356489, -0.2301152568276837, -0.04631265400381512, -0.10885019565878803, -0.13480074725766716, 0.42308850572388396, 0.17686709918990642, 0.2281579109391265, 0.11441130197259138, 0.32952038968453207, 0.11141681388142892, 0.1653938959857606, 0.05230906258210265, 0.1774212397096387, 0.06639497849742422, 0.1388676663613822, -0.15451652278383093, 0.010456338033910436, 0.1301605557091534] |
1,802.02019 | One-dimensional parameter-dependent boundary-value problems in H\"older
spaces | We study the most general class of linear boundary-value problems for systems
of $r$-th order ordinary differential equations whose solutions range over the
complex H\"older space $C^{n+r,\alpha}$, with $0\leq n\in\mathbb{Z}$ and
$0<\alpha\leq1$. We prove a constructive criterion under which the solution to
an arbitrary parameter-dependent problem from this class is continuous in
$C^{n+r,\alpha}$ with respect to the parameter. We also prove a two-sided
estimate for the degree of convergence of this solution to the solution of the
corresponding nonperturbed problem.
| math.CA | we study the most general class of linear boundaryvalue problems for systems of rth order ordinary differential equations whose solutions range over the complex holder space cnralpha with 0leq ninmathbbz and 0alphaleq1 we prove a constructive criterion under which the solution to an arbitrary parameterdependent problem from this class is continuous in cnralpha with respect to the parameter we also prove a twosided estimate for the degree of convergence of this solution to the solution of the corresponding nonperturbed problem | [['we', 'study', 'the', 'most', 'general', 'class', 'of', 'linear', 'boundaryvalue', 'problems', 'for', 'systems', 'of', 'rth', 'order', 'ordinary', 'differential', 'equations', 'whose', 'solutions', 'range', 'over', 'the', 'complex', 'holder', 'space', 'cnralpha', 'with', '0leq', 'ninmathbbz', 'and', '0alphaleq1', 'we', 'prove', 'a', 'constructive', 'criterion', 'under', 'which', 'the', 'solution', 'to', 'an', 'arbitrary', 'parameterdependent', 'problem', 'from', 'this', 'class', 'is', 'continuous', 'in', 'cnralpha', 'with', 'respect', 'to', 'the', 'parameter', 'we', 'also', 'prove', 'a', 'twosided', 'estimate', 'for', 'the', 'degree', 'of', 'convergence', 'of', 'this', 'solution', 'to', 'the', 'solution', 'of', 'the', 'corresponding', 'nonperturbed', 'problem']] | [-0.12666793873844048, -0.0034507538237868664, -0.036174127778324947, 0.02266344521045446, -0.09115201568541427, -0.1029634367292508, -0.012325408090897, 0.30097196793828446, -0.35992802600286755, -0.24080456778756343, 0.15711076949717095, -0.27027776648696417, -0.144720027704562, 0.221643449846082, -0.06216712131236608, 0.12367559988081503, 0.02357536965670685, 0.07372257770158541, -0.11727275528634588, -0.22895917918485326, 0.38855089606621707, -0.0661648669017431, 0.20271272486887681, -0.00694709848269271, 0.16809017321336284, -0.004561119408418353, 0.03546104517478783, 0.03137571417140022, -0.21242843962943134, 0.12296007937775591, 0.27851186914799303, 0.08345270655356729, 0.31030193773599773, -0.3323331843249691, -0.16773258346634415, 0.20791777120664334, 0.10802042547565623, 0.08166320959720999, -0.01752772125511024, -0.2589952394557305, 0.15256998541120154, -0.13010821955219562, -0.2134111683624677, -0.046503334234540276, 0.020483129610044833, 0.04778817407965947, -0.36402665260128486, 0.06355359590013858, 0.08064244796211521, 0.033677133110662304, -0.14253706195785737, -0.06098278189072003, 0.03091670287390932, 0.038974215515339986, 0.028826843117339872, 0.010227270737791864, -0.012294524844783621, -0.12719562319584954, -0.08290257536543486, 0.3672560629888605, -0.06625256987843806, -0.29550167242399394, 0.13630198267025825, -0.15184710644042262, -0.13381928979502752, 0.1281177844517888, 0.19056326169401216, 0.22518501816412959, -0.13289203541353345, 0.14989330134733628, -0.07715594138090427, 0.15233663577311793, 0.05848054882759849, 0.02803436472477654, 0.07847941480576992, 0.09917495196732955, 0.21143166400277272, 0.172373765703434, 0.005909097142135486, -0.12368012472796135, -0.34664976310271484, -0.19053440254468185, -0.12778239138424397, 0.08226449793586746, -0.14677534971773498, -0.20875196481266847, 0.4022795536961311, 0.1164032713486216, 0.1593254655957795, 0.13343316650776288, 0.19409038964658976, 0.214189088712327, -0.02696667741745328, 0.06722066118023716, 0.16807709911312813, 0.14694506782465255, 0.09367342161772868, -0.2044419560324735, 0.04499638844162035, 0.14368813169690278] |
1,802.0202 | Co/Ni multilayers for spintronics: high spin-polarization and tunable
magnetic anisotropy | In this paper we analyze in details the electronic properties of (Co/Ni)
multilayers, a model system for spintronics devices. We use magneto-optical
Kerr (MOKE), spin-polarized photoemission spectroscopy (SRPES), x-ray magnetic
circular dichroism (XMCD) and anomalous surface diffraction experiments to
investigate the electronic properties and perpendicular magnetic anisotropy
(PMA) in [Co(x)/Ni(y)] single-crystalline stacks grown by molecular beam
epitaxy.
| cond-mat.mtrl-sci | in this paper we analyze in details the electronic properties of coni multilayers a model system for spintronics devices we use magnetooptical kerr moke spinpolarized photoemission spectroscopy srpes xray magnetic circular dichroism xmcd and anomalous surface diffraction experiments to investigate the electronic properties and perpendicular magnetic anisotropy pma in coxniy singlecrystalline stacks grown by molecular beam epitaxy | [['in', 'this', 'paper', 'we', 'analyze', 'in', 'details', 'the', 'electronic', 'properties', 'of', 'coni', 'multilayers', 'a', 'model', 'system', 'for', 'spintronics', 'devices', 'we', 'use', 'magnetooptical', 'kerr', 'moke', 'spinpolarized', 'photoemission', 'spectroscopy', 'srpes', 'xray', 'magnetic', 'circular', 'dichroism', 'xmcd', 'and', 'anomalous', 'surface', 'diffraction', 'experiments', 'to', 'investigate', 'the', 'electronic', 'properties', 'and', 'perpendicular', 'magnetic', 'anisotropy', 'pma', 'in', 'coxniy', 'singlecrystalline', 'stacks', 'grown', 'by', 'molecular', 'beam', 'epitaxy']] | [-0.20305769725902273, 0.13253138290851244, -0.02622597340294825, -0.003912829051841982, -0.11034424020908773, -0.10190956618316704, 0.055746817547645024, 0.5650606760755181, -0.30120358226953875, -0.3115500629480396, -0.06436614537337196, -0.37856845817129525, -0.11831105507111975, 0.26498269781586714, 0.10413831863011833, 0.11866490489670209, -0.0588757195177355, -0.2707031369084559, -0.09450809361546167, -0.1682338991002845, 0.22858664800878614, 0.04552035732194781, 0.38365083766568986, 0.08749541673543197, 0.031922250826028176, 0.06348930657259189, 0.22253355316102638, 0.033689074276480824, -0.210815547616221, 0.07214229943513471, 0.23719833500217646, -0.24363898429354386, 0.109301253504652, -0.5678478250712422, -0.19070233085325786, -0.1142070282865981, 0.13108309202029236, 0.15010900579259864, -0.16588104798990702, -0.22919622688953364, 0.07473643734452448, -0.06443605045621682, -0.13478333416917718, -0.1956613066597908, -0.07378464132281286, 0.015389057578350471, -0.1922006304043212, 0.04256037697112853, 0.0262603989519578, 0.22082761778230114, -0.16727391781257342, -0.06380286760187508, -0.10474830090866558, -0.08402226802094706, 0.025447028770161393, 0.038436140648887625, 0.27000415010843426, -0.08711382009538024, -0.18717433879750647, 0.30689357557067914, -0.03262157758997221, 0.0027275700787348406, 0.04251160700888639, -0.32428974248302567, -0.11470176644590017, 0.09577617746046078, 0.17568083829246461, 0.20929853968222492, -0.20102266320360027, 0.11867642739629705, -0.016415250637302443, 0.251073998665171, 0.15865826686162368, 0.12032524213593986, 0.27987453471204, 0.1962162417912623, -0.025297542526719292, 0.18960180785506964, -0.24794500374368258, 0.16017835006433806, -0.042760001379065216, -0.19706391992180475, -0.2134300059821856, 0.14023238164372742, -0.02586259998029813, -0.2094184658749977, 0.38447738921968266, 0.19017840895269597, 0.09601019843414958, -0.19864118182366447, 0.38303383133773294, 0.005695950173373733, 0.01947181874753109, -0.03707878867862746, 0.2580122215107882, 0.29232105942459646, 0.22682429986473704, -0.3704377196596137, 0.11886806279653683, -0.055071311146353503] |
1,802.02021 | Of Local Operations and Physical Wires | In this work (multipartite) entanglement, discord and coherence are unified
as different aspects of a single underlying resource theory defined through
simple and operationally meaningful elemental operations. This is achieved by
revisiting the resource theory defining entanglement, Local Operations and
Classical Communication (LOCC), placing the focus on the underlying quantum
nature of the communication channels. Taking the natural elemental operations
in the resulting generalization of LOCC yields a resource theory that singles
out coherence in the wire connecting the spatially separated systems as an
operationally useful resource. The approach naturally allows to consider a
reduced setting as well, namely the one with only the wire connected to a
single quantum system, which leads to discord-like resources. The general form
of free operations in this latter setting is derived and presented as a closed
form. We discuss in what sense the present approach defines a resource theory
of quantum discord and in which situations such an interpretation is sound --
and why in general discord is not a resource. This unified and operationally
meaningful approach makes transparent many features of entanglement that in
LOCC might seem surprising, such as the possibility to use a particle to
entangle two parties, without it ever being entangled with either of them, or
that there exist different forms of multipartite entanglement.
| quant-ph | in this work multipartite entanglement discord and coherence are unified as different aspects of a single underlying resource theory defined through simple and operationally meaningful elemental operations this is achieved by revisiting the resource theory defining entanglement local operations and classical communication locc placing the focus on the underlying quantum nature of the communication channels taking the natural elemental operations in the resulting generalization of locc yields a resource theory that singles out coherence in the wire connecting the spatially separated systems as an operationally useful resource the approach naturally allows to consider a reduced setting as well namely the one with only the wire connected to a single quantum system which leads to discordlike resources the general form of free operations in this latter setting is derived and presented as a closed form we discuss in what sense the present approach defines a resource theory of quantum discord and in which situations such an interpretation is sound and why in general discord is not a resource this unified and operationally meaningful approach makes transparent many features of entanglement that in locc might seem surprising such as the possibility to use a particle to entangle two parties without it ever being entangled with either of them or that there exist different forms of multipartite entanglement | [['in', 'this', 'work', 'multipartite', 'entanglement', 'discord', 'and', 'coherence', 'are', 'unified', 'as', 'different', 'aspects', 'of', 'a', 'single', 'underlying', 'resource', 'theory', 'defined', 'through', 'simple', 'and', 'operationally', 'meaningful', 'elemental', 'operations', 'this', 'is', 'achieved', 'by', 'revisiting', 'the', 'resource', 'theory', 'defining', 'entanglement', 'local', 'operations', 'and', 'classical', 'communication', 'locc', 'placing', 'the', 'focus', 'on', 'the', 'underlying', 'quantum', 'nature', 'of', 'the', 'communication', 'channels', 'taking', 'the', 'natural', 'elemental', 'operations', 'in', 'the', 'resulting', 'generalization', 'of', 'locc', 'yields', 'a', 'resource', 'theory', 'that', 'singles', 'out', 'coherence', 'in', 'the', 'wire', 'connecting', 'the', 'spatially', 'separated', 'systems', 'as', 'an', 'operationally', 'useful', 'resource', 'the', 'approach', 'naturally', 'allows', 'to', 'consider', 'a', 'reduced', 'setting', 'as', 'well', 'namely', 'the', 'one', 'with', 'only', 'the', 'wire', 'connected', 'to', 'a', 'single', 'quantum', 'system', 'which', 'leads', 'to', 'discordlike', 'resources', 'the', 'general', 'form', 'of', 'free', 'operations', 'in', 'this', 'latter', 'setting', 'is', 'derived', 'and', 'presented', 'as', 'a', 'closed', 'form', 'we', 'discuss', 'in', 'what', 'sense', 'the', 'present', 'approach', 'defines', 'a', 'resource', 'theory', 'of', 'quantum', 'discord', 'and', 'in', 'which', 'situations', 'such', 'an', 'interpretation', 'is', 'sound', 'and', 'why', 'in', 'general', 'discord', 'is', 'not', 'a', 'resource', 'this', 'unified', 'and', 'operationally', 'meaningful', 'approach', 'makes', 'transparent', 'many', 'features', 'of', 'entanglement', 'that', 'in', 'locc', 'might', 'seem', 'surprising', 'such', 'as', 'the', 'possibility', 'to', 'use', 'a', 'particle', 'to', 'entangle', 'two', 'parties', 'without', 'it', 'ever', 'being', 'entangled', 'with', 'either', 'of', 'them', 'or', 'that', 'there', 'exist', 'different', 'forms', 'of', 'multipartite', 'entanglement']] | [-0.16262674242864514, 0.1440747760789913, -0.10860887436456113, 0.0789405912962244, -0.009738515824252782, -0.23427465613931417, 0.08007514372435506, 0.3431684615274588, -0.2853287674464978, -0.2832117769867182, 0.046777064832425566, -0.21522386978647054, -0.14037532765353314, 0.18656556411960357, -0.11410284354892927, 0.05874865463566641, 0.04913500936236233, 0.0655384011014343, -0.05130079180397483, -0.23411970399536713, 0.3135726500529969, 0.04552114988882961, 0.297451664152187, 0.03513464365089529, 0.0635036877854619, 0.02143534357269663, 0.000915699228806811, 0.036398608850445165, -0.0936162793938122, 0.1423559936905973, 0.3187605559955849, 0.19313445976653765, 0.26470689577765244, -0.4381030086817783, -0.21835579338461852, 0.12537366344138634, 0.1170778123364069, 0.1358880110593989, 0.0006055833365724877, -0.3029133878128473, -0.027035285998677272, -0.18587924793016078, -0.0731410261611779, -0.11465004976015798, 0.004781690322209237, -0.08652298740046316, -0.23133109519041556, 0.09308365711747388, 0.0739707883856216, 0.04956613267957352, 0.019740095374791686, -0.001028440739461329, 0.020214732212750892, 0.13754647332243622, -0.04291178739878761, -0.0035234865775808344, 0.13583431796625603, -0.11195499619339094, -0.15624673603113395, 0.39901767187686854, 0.0043133652779858474, -0.21447134609225876, 0.20920504198875278, -0.08191962138489756, -0.1459142829529768, 0.02453321175606445, 0.07182414620291702, 0.10392714019778163, -0.19364205437040952, 0.05462046711364501, -0.06447732804213152, 0.15552211518583517, 0.06631254480588575, 0.17939423073657118, 0.21590636766645624, 0.1274776645448752, 0.11089566173438026, 0.188250896304326, 0.012528692229060716, -0.18020110627701288, -0.32220892125827283, -0.22371798517442373, -0.21217425823709818, 0.08057273099595562, -0.06635733594160885, -0.13392271554574023, 0.3757549498035291, 0.11589867505542717, 0.1569886492521957, 0.02477834633616514, 0.31894693150250025, 0.09774892972998842, 0.07900890366737406, 0.07901112964853298, 0.20957477370921393, 0.1495824181431428, 0.07430145970307464, -0.18673545117841947, 0.06221295571994297, 0.0169162833954879] |
1,802.02022 | Measurement of the charged-hadron spectra and nuclear modification
factor in lead--lead collisions with the ATLAS detector | The ATLAS experiment at the Large Hadron Collider (LHC) measures charged
hadron spectra obtained in 2010 and 2011 lead-lead LHC data taking periods with
total integrated statistics of 0.15nb${}^{-1}$. The results are compared to the
$pp$ spectra of charged hadrons at the same centre-of-mass energy based on the
data sample with integrated luminosity of 4.2pb${}^{-1}$ obtained by the ATLAS
experiment in 2011 and 2013. This allows a detailed comparison of the two
collision systems in a wide transverse momentum ($0.5<p_{\mathrm{T}}<150$GeV)
and pseudorapidity ($|\eta|<2$) ranges in different centrality intervals of
Pb+Pb collision. The nuclear modification factor $R_{\mathrm{AA}}$ is presented
in detail as a function of centrality, $p_{\mathrm{T}}$ and $\eta$. It shows a
distinct $p_{\mathrm{T}}$-dependence with a pronounced minimum at about 7GeV.
Above 60GeV, it is consistent with a flat, centrality-dependent, value within
the uncertainties. The value is $0.55\pm0.01(stat.)\pm0.04(syst.)$ in the most
central collisions. The $R_{\mathrm{AA}}$ is observed to be consistent with
flat $|\eta|$ dependence over the whole transverse momentum range in all
centrality classes.
| hep-ex nucl-ex | the atlas experiment at the large hadron collider lhc measures charged hadron spectra obtained in 2010 and 2011 leadlead lhc data taking periods with total integrated statistics of 015nb1 the results are compared to the pp spectra of charged hadrons at the same centreofmass energy based on the data sample with integrated luminosity of 42pb1 obtained by the atlas experiment in 2011 and 2013 this allows a detailed comparison of the two collision systems in a wide transverse momentum 05p_mathrmt150gev and pseudorapidity eta2 ranges in different centrality intervals of pbpb collision the nuclear modification factor r_mathrmaa is presented in detail as a function of centrality p_mathrmt and eta it shows a distinct p_mathrmtdependence with a pronounced minimum at about 7gev above 60gev it is consistent with a flat centralitydependent value within the uncertainties the value is 055pm001statpm004syst in the most central collisions the r_mathrmaa is observed to be consistent with flat eta dependence over the whole transverse momentum range in all centrality classes | [['the', 'atlas', 'experiment', 'at', 'the', 'large', 'hadron', 'collider', 'lhc', 'measures', 'charged', 'hadron', 'spectra', 'obtained', 'in', '2010', 'and', '2011', 'leadlead', 'lhc', 'data', 'taking', 'periods', 'with', 'total', 'integrated', 'statistics', 'of', '015nb1', 'the', 'results', 'are', 'compared', 'to', 'the', 'pp', 'spectra', 'of', 'charged', 'hadrons', 'at', 'the', 'same', 'centreofmass', 'energy', 'based', 'on', 'the', 'data', 'sample', 'with', 'integrated', 'luminosity', 'of', '42pb1', 'obtained', 'by', 'the', 'atlas', 'experiment', 'in', '2011', 'and', '2013', 'this', 'allows', 'a', 'detailed', 'comparison', 'of', 'the', 'two', 'collision', 'systems', 'in', 'a', 'wide', 'transverse', 'momentum', '05p_mathrmt150gev', 'and', 'pseudorapidity', 'eta2', 'ranges', 'in', 'different', 'centrality', 'intervals', 'of', 'pbpb', 'collision', 'the', 'nuclear', 'modification', 'factor', 'r_mathrmaa', 'is', 'presented', 'in', 'detail', 'as', 'a', 'function', 'of', 'centrality', 'p_mathrmt', 'and', 'eta', 'it', 'shows', 'a', 'distinct', 'p_mathrmtdependence', 'with', 'a', 'pronounced', 'minimum', 'at', 'about', '7gev', 'above', '60gev', 'it', 'is', 'consistent', 'with', 'a', 'flat', 'centralitydependent', 'value', 'within', 'the', 'uncertainties', 'the', 'value', 'is', '055pm001statpm004syst', 'in', 'the', 'most', 'central', 'collisions', 'the', 'r_mathrmaa', 'is', 'observed', 'to', 'be', 'consistent', 'with', 'flat', 'eta', 'dependence', 'over', 'the', 'whole', 'transverse', 'momentum', 'range', 'in', 'all', 'centrality', 'classes']] | [-0.06747654021446463, 0.17061625853699597, -0.14862284281650628, 0.10399162655481126, 0.014933518296154805, -0.07874006313224664, -0.07742856854360693, 0.3630153938532583, -0.15998634085121058, -0.3595856354863654, -0.0318316111917301, -0.36105764194793594, 0.09702721883578203, 0.19131094511433305, 0.0263337569084325, 0.11222932474537387, 0.15241470879615768, 0.0008179646256509461, -0.06036993276174593, -0.19597141316184138, 0.2797913263858402, 0.15114855319497328, 0.2523436402029629, 0.11625759023454636, 0.09115391850760325, 0.07942380140943724, -0.050911803776987744, 0.060968744793252524, -0.15069453661990223, 0.05382612466541726, 0.3128743010066167, 0.032741639197249955, 0.17444722071183916, -0.2716453028457365, -0.09759276658532363, 0.12351107735870571, 0.09309173328359906, 0.039135339071596914, -0.03296491903801083, -0.26201018919178015, 0.10653442504028848, -0.24260868613985426, -0.11438555270065023, 0.02428848634745124, 0.07673189186644327, 0.01646243899919187, -0.2850300753842803, 0.16215511489419349, -0.061935412570763425, 0.11530007769742721, -0.04530073238921328, -0.20241571214238677, -0.09499415493558479, -0.002626192916620853, 0.07065044698906661, 0.07863556467589061, 0.17233482451484644, -0.1119341499612761, -0.16538773276666296, 0.3242956324586574, 0.008483324465165032, -0.10914014779691454, 0.19984703137439122, -0.24738459349492023, -0.11348598607509292, 0.17533495679904434, 0.258094885362212, 0.06563402090186277, -0.195487362120442, 0.06750763164423525, -0.03460967829347812, 0.18127225094793153, 0.08725166485697927, 0.046124325150806646, 0.1600405653066273, 0.2110560377823967, 0.009086906211450696, 0.07444054262839328, -0.12441031542117413, -0.09193299632059716, -0.4171884264796972, -0.0736899339136022, -0.1324537324157685, 0.017248865225812114, -0.0996577751441841, -0.023062672436567424, 0.4095299757451196, 0.05604772913694099, 0.37163950262968487, 0.0004534985184156678, 0.2481176217876469, 0.11347894396417763, 0.0846233082888427, 0.12297189793771625, 0.29549972908689254, 0.13364994187862908, 0.24942069767040048, -0.2109651201746509, 0.004317137035482292, 0.013540501772614691] |
1,802.02023 | Ramanujan series with a shift | We consider an extension of the Ramanujan series with a variable $x$. If we
let $x=x_0$, we call the resulting series: "Ramanujan series with the shift
$x_0$". Then, we relate these shifted series to some $q$-series and solve the
case of level $4$ with the shift $x_0=1/2$. Finally, we indicate a possible way
towards proving some patterns observed by the author corresponding to the
levels $\ell=1, 2, 3$ and the shift $x_0=1/2$.
| math.NT | we consider an extension of the ramanujan series with a variable x if we let xx_0 we call the resulting series ramanujan series with the shift x_0 then we relate these shifted series to some qseries and solve the case of level 4 with the shift x_012 finally we indicate a possible way towards proving some patterns observed by the author corresponding to the levels ell1 2 3 and the shift x_012 | [['we', 'consider', 'an', 'extension', 'of', 'the', 'ramanujan', 'series', 'with', 'a', 'variable', 'x', 'if', 'we', 'let', 'xx_0', 'we', 'call', 'the', 'resulting', 'series', 'ramanujan', 'series', 'with', 'the', 'shift', 'x_0', 'then', 'we', 'relate', 'these', 'shifted', 'series', 'to', 'some', 'qseries', 'and', 'solve', 'the', 'case', 'of', 'level', '4', 'with', 'the', 'shift', 'x_012', 'finally', 'we', 'indicate', 'a', 'possible', 'way', 'towards', 'proving', 'some', 'patterns', 'observed', 'by', 'the', 'author', 'corresponding', 'to', 'the', 'levels', 'ell1', '2', '3', 'and', 'the', 'shift', 'x_012']] | [-0.14472634033965212, 0.09524606403782465, -0.08927205252860274, 0.042851558595430106, -0.08831245164120836, -0.0937647054637117, 0.06648044008761644, 0.3794707771124584, -0.3404960754061384, -0.2488765978786562, 0.10843035572740649, -0.3222386218607426, -0.18145162891596556, 0.171044903172047, -0.06394255980758316, -0.01261939383111894, -0.00511891479337854, 0.08543659346178174, -0.09221576833515428, -0.2768208296337564, 0.3501364198114191, -0.0017187416420451232, 0.16788593169933716, 0.001087935854281698, 0.08689260421586888, -0.0047902605895485196, -0.023495137212531908, -0.016167932891819094, -0.14449039379001727, 0.1503308940046866, 0.2269495216863496, 0.08822828206632818, 0.2830563905515841, -0.3728429339859369, -0.13491113620610642, 0.1430804891511798, 0.13990410497145994, 0.057587049302778075, -0.017477459593542983, -0.2648650865968583, 0.10326441698375025, -0.15960315277001688, -0.1521191694973303, -0.0787335677338498, 0.03623457649456603, 0.03950630792283586, -0.2743413038152669, 0.016896661623780215, 0.060530217098338265, 0.0747667693000819, -0.047769416782206725, -0.16563371796094414, 0.04256709722935089, 0.09139538482663088, 0.05137219241587445, 0.04277201604439012, 0.007955235542197313, -0.05758696101672415, -0.11447903208567628, 0.3535186102081622, -0.09860584538047468, -0.15671162086405924, 0.09682828938322408, -0.23724690983737154, -0.19927495014188545, 0.07498670717967408, 0.08956935505515763, 0.11037483283185533, -0.020276528836361, 0.047312602399116645, -0.03906261854405914, 0.14421363973191806, 0.1466580820802067, -0.033546514476516416, 0.13573541372482265, 0.06755836268421263, 0.08077186871586102, 0.18687385731443232, -0.07997555293009749, -0.009262757752523092, -0.3433471385921751, -0.15487767193200333, -0.11390338047141475, 0.08445733111750867, -0.067439373302789, -0.12532576862057404, 0.4099527709452169, 0.11892602847157312, 0.25997393926871676, 0.13352433423445162, 0.17590292194592103, 0.2094565750764949, 0.011630735171326836, 0.06472692444388356, 0.0835880726085244, 0.14220448598332172, 0.06180334540882281, -0.16621013724777314, -0.006689601777387517, 0.09979729182752116] |
1,802.02024 | Nonlinear heat transport in ferromagnetic-quantum dot-superconducting
systems | We analyze the heat current traversing a quantum dot sandwiched between a
ferromagnetic and a superconducting electrode. The heat flow generated in
response to a voltage bias presents rectification as a function of the gate
potential applied to the quantum dot. Remarkably, in the thermally driven case
the heat shows a strong diode effect with large asymmetry ratios that can be
externally tuned with magnetic fields or spin-polarized tunneling. Our results
thus demonstrate the importance of hybrid systems as promising candidates for
thermal applications.
| cond-mat.mes-hall cond-mat.supr-con | we analyze the heat current traversing a quantum dot sandwiched between a ferromagnetic and a superconducting electrode the heat flow generated in response to a voltage bias presents rectification as a function of the gate potential applied to the quantum dot remarkably in the thermally driven case the heat shows a strong diode effect with large asymmetry ratios that can be externally tuned with magnetic fields or spinpolarized tunneling our results thus demonstrate the importance of hybrid systems as promising candidates for thermal applications | [['we', 'analyze', 'the', 'heat', 'current', 'traversing', 'a', 'quantum', 'dot', 'sandwiched', 'between', 'a', 'ferromagnetic', 'and', 'a', 'superconducting', 'electrode', 'the', 'heat', 'flow', 'generated', 'in', 'response', 'to', 'a', 'voltage', 'bias', 'presents', 'rectification', 'as', 'a', 'function', 'of', 'the', 'gate', 'potential', 'applied', 'to', 'the', 'quantum', 'dot', 'remarkably', 'in', 'the', 'thermally', 'driven', 'case', 'the', 'heat', 'shows', 'a', 'strong', 'diode', 'effect', 'with', 'large', 'asymmetry', 'ratios', 'that', 'can', 'be', 'externally', 'tuned', 'with', 'magnetic', 'fields', 'or', 'spinpolarized', 'tunneling', 'our', 'results', 'thus', 'demonstrate', 'the', 'importance', 'of', 'hybrid', 'systems', 'as', 'promising', 'candidates', 'for', 'thermal', 'applications']] | [-0.18516369388505285, 0.1520003107587053, -0.013228882691778597, -0.0011900276533976597, -0.011715719520690896, -0.18713936980237209, 0.08524325937365315, 0.3899912638146253, -0.2880485066811421, -0.31229155465206576, -0.01081487346008154, -0.2971387980117773, -0.09469508269103244, 0.298223430066303, 0.001270487860199951, 0.030970905580380487, 0.01979123871950876, -0.04833381589768188, -0.04648322686054079, -0.15001531793747008, 0.2541130752568798, 0.01682665516550298, 0.33588109720897463, 0.11600277305115014, 0.07252906742394857, -0.041455991593899115, 0.12866348472224282, 0.0884508285893216, -0.08834025935435161, 0.0415795929092426, 0.24024257889305728, -0.12605076656854225, 0.23576621573773168, -0.45176885906229947, -0.21966703152949257, 0.06068316536090736, 0.11199749943001994, 0.13935614369499186, -0.15202179450785652, -0.285499954016857, 0.04866499549132727, -0.15940084950056016, -0.07579354553793867, -0.07883828316005834, -0.018059182052855335, 0.05930950427621914, -0.31712818580369156, 0.09053505635044228, 0.04960705568997322, 0.006393470479885028, -0.009140856170450292, -0.0542309298069172, -0.039157283190260864, 0.07693163444422507, -0.01418954422253938, 0.05729961070409488, 0.2658354236267596, -0.16916041892615058, -0.15090450996510862, 0.2895234396703364, -0.14625810893873373, -0.1551398067621492, 0.15611080469430558, -0.15850829386839732, 0.003592060468647452, 0.06962273177591019, 0.12530760871734292, 0.10107202581795198, -0.18055552223120772, 0.0388142283769585, 0.051100283794637234, 0.16002572529361628, 0.022805050137408432, 0.04688972692071859, 0.3176681155316709, 0.21298222342461703, 0.05847432873477893, 0.24395558460881667, -0.13283775780638235, -0.06680996435794181, -0.26138592538024696, -0.19157005645268196, -0.20468618731025517, 0.1351662835278105, -0.043184059012197566, -0.21058301416979658, 0.4289353391366257, 0.1815399696074781, 0.1842305479748618, -0.08246791888571654, 0.3392965275173386, 0.17312273823162763, 0.08923571394933831, 0.053020297788039204, 0.23076466834616094, 0.2077583902476666, 0.16783659871933715, -0.3217239947989583, 0.049362311782758864, -0.05707051811207618] |
1,802.02025 | On some local cohomology spectral sequences | We introduce a formalism to produce several families of spectral sequences
involving the derived functors of the limit and colimit functors over a finite
partially ordered set. The first type of spectral sequences involves the left
derived functors of the colimit of the direct system that we obtain applying a
family of functors to a single module. For the second type we follow a
completely different strategy as we start with the inverse system that we
obtain by applying a covariant functor to an inverse system. The spectral
sequences involve the right derived functors of the corresponding limit. We
also have a version for contravariant functors. In all the introduced spectral
sequences we provide sufficient conditions to ensure their degeneration at
their second page. As a consequence we obtain some decomposition theorems that
greatly generalize the well-known decomposition formula for local cohomology
modules given by Hochster.
| math.AC math.AG | we introduce a formalism to produce several families of spectral sequences involving the derived functors of the limit and colimit functors over a finite partially ordered set the first type of spectral sequences involves the left derived functors of the colimit of the direct system that we obtain applying a family of functors to a single module for the second type we follow a completely different strategy as we start with the inverse system that we obtain by applying a covariant functor to an inverse system the spectral sequences involve the right derived functors of the corresponding limit we also have a version for contravariant functors in all the introduced spectral sequences we provide sufficient conditions to ensure their degeneration at their second page as a consequence we obtain some decomposition theorems that greatly generalize the wellknown decomposition formula for local cohomology modules given by hochster | [['we', 'introduce', 'a', 'formalism', 'to', 'produce', 'several', 'families', 'of', 'spectral', 'sequences', 'involving', 'the', 'derived', 'functors', 'of', 'the', 'limit', 'and', 'colimit', 'functors', 'over', 'a', 'finite', 'partially', 'ordered', 'set', 'the', 'first', 'type', 'of', 'spectral', 'sequences', 'involves', 'the', 'left', 'derived', 'functors', 'of', 'the', 'colimit', 'of', 'the', 'direct', 'system', 'that', 'we', 'obtain', 'applying', 'a', 'family', 'of', 'functors', 'to', 'a', 'single', 'module', 'for', 'the', 'second', 'type', 'we', 'follow', 'a', 'completely', 'different', 'strategy', 'as', 'we', 'start', 'with', 'the', 'inverse', 'system', 'that', 'we', 'obtain', 'by', 'applying', 'a', 'covariant', 'functor', 'to', 'an', 'inverse', 'system', 'the', 'spectral', 'sequences', 'involve', 'the', 'right', 'derived', 'functors', 'of', 'the', 'corresponding', 'limit', 'we', 'also', 'have', 'a', 'version', 'for', 'contravariant', 'functors', 'in', 'all', 'the', 'introduced', 'spectral', 'sequences', 'we', 'provide', 'sufficient', 'conditions', 'to', 'ensure', 'their', 'degeneration', 'at', 'their', 'second', 'page', 'as', 'a', 'consequence', 'we', 'obtain', 'some', 'decomposition', 'theorems', 'that', 'greatly', 'generalize', 'the', 'wellknown', 'decomposition', 'formula', 'for', 'local', 'cohomology', 'modules', 'given', 'by', 'hochster']] | [-0.12412769694442619, 0.02204861112382687, -0.11372913574251307, 0.09341554639682378, -0.06198610135590122, -0.09037236780668162, 0.04060816257388318, 0.349108549118782, -0.38300380200045564, -0.2296135847979825, 0.11771026638269501, -0.17875700703326114, -0.13661680372482907, 0.18717552133682758, -0.13826512243624214, -0.02025398268039045, 0.06434032778344946, 0.05967907396114068, -0.09019408582818171, -0.21740601607757837, 0.42456034393757835, -0.006977991105299698, 0.22831749666022927, 0.00674577698283765, 0.1313219729409081, 0.01839186343817321, -0.045987676561184944, -0.01981554362501898, -0.1565298910534519, 0.12986543894688, 0.26086518570480943, 0.12655638657790952, 0.20811424973382525, -0.3756171173275742, -0.1066348006604367, 0.1593870270665582, 0.11427775428515591, 0.09723330754946202, -0.028071171978858542, -0.2896632932330648, 0.14429903692527585, -0.22429114040338166, -0.10881455345174987, -0.10993895786878181, 0.01130172888403886, 0.04818558927995395, -0.28719150063211785, -0.0029290517832372617, 0.11594279654553696, 0.08021484720456885, -0.10657299315709978, -0.08849996649931274, -0.03646728698617128, 0.14798819015044973, -0.02735789612650055, -0.034181028403571415, 0.09223027508514486, -0.08654992587940946, -0.12349501749730274, 0.35718925258468465, -0.09758575633327693, -0.19938425249133054, 0.15150475221501075, -0.10132497176846923, -0.14920837859214883, 0.12941013180255279, 0.020686917772440062, 0.17947531777931608, -0.11735030084414637, 0.11112046382694556, -0.08851304167422326, 0.09624155776013862, 0.12407170776405359, 0.054254830454488936, 0.13617325108498335, 0.07684503542259336, 0.0610257805028471, 0.19781664903403248, -0.019800701545398324, -0.030435497961836318, -0.3327542128039792, -0.1657707898426103, -0.11706277135399183, 0.07957291304724282, -0.08713070340568203, -0.19164153894613664, 0.4204378917857954, 0.1299608671361555, 0.20581534003507193, 0.1708249063549997, 0.23180288175433517, 0.1423533423952256, 0.06816961804455886, -0.028535875606618515, 0.1588518696955536, 0.22693942961831615, 0.09261013489465345, -0.11065004360248105, -0.02499300245497031, 0.23548736086128] |
1,802.02026 | Brain-inspired photonic signal processor for periodic pattern generation
and chaotic system emulation | Reservoir computing is a bio-inspired computing paradigm for processing
time-dependent signals. Its hardware implementations have received much
attention because of their simplicity and remarkable performance on a series of
benchmark tasks. In previous experiments the output was uncoupled from the
system and in most cases simply computed offline on a post-processing computer.
However, numerical investigations have shown that feeding the output back into
the reservoir would open the possibility of long-horizon time series
forecasting. Here we present a photonic reservoir computer with output
feedback, and demonstrate its capacity to generate periodic time series and to
emulate chaotic systems. We study in detail the effect of experimental noise on
system performance. In the case of chaotic systems, this leads us to introduce
several metrics, based on standard signal processing techniques, to evaluate
the quality of the emulation. Our work significantly enlarges the range of
tasks that can be solved by hardware reservoir computers, and therefore the
range of applications they could potentially tackle. It also raises novel
questions in nonlinear dynamics and chaos theory.
| cs.NE | reservoir computing is a bioinspired computing paradigm for processing timedependent signals its hardware implementations have received much attention because of their simplicity and remarkable performance on a series of benchmark tasks in previous experiments the output was uncoupled from the system and in most cases simply computed offline on a postprocessing computer however numerical investigations have shown that feeding the output back into the reservoir would open the possibility of longhorizon time series forecasting here we present a photonic reservoir computer with output feedback and demonstrate its capacity to generate periodic time series and to emulate chaotic systems we study in detail the effect of experimental noise on system performance in the case of chaotic systems this leads us to introduce several metrics based on standard signal processing techniques to evaluate the quality of the emulation our work significantly enlarges the range of tasks that can be solved by hardware reservoir computers and therefore the range of applications they could potentially tackle it also raises novel questions in nonlinear dynamics and chaos theory | [['reservoir', 'computing', 'is', 'a', 'bioinspired', 'computing', 'paradigm', 'for', 'processing', 'timedependent', 'signals', 'its', 'hardware', 'implementations', 'have', 'received', 'much', 'attention', 'because', 'of', 'their', 'simplicity', 'and', 'remarkable', 'performance', 'on', 'a', 'series', 'of', 'benchmark', 'tasks', 'in', 'previous', 'experiments', 'the', 'output', 'was', 'uncoupled', 'from', 'the', 'system', 'and', 'in', 'most', 'cases', 'simply', 'computed', 'offline', 'on', 'a', 'postprocessing', 'computer', 'however', 'numerical', 'investigations', 'have', 'shown', 'that', 'feeding', 'the', 'output', 'back', 'into', 'the', 'reservoir', 'would', 'open', 'the', 'possibility', 'of', 'longhorizon', 'time', 'series', 'forecasting', 'here', 'we', 'present', 'a', 'photonic', 'reservoir', 'computer', 'with', 'output', 'feedback', 'and', 'demonstrate', 'its', 'capacity', 'to', 'generate', 'periodic', 'time', 'series', 'and', 'to', 'emulate', 'chaotic', 'systems', 'we', 'study', 'in', 'detail', 'the', 'effect', 'of', 'experimental', 'noise', 'on', 'system', 'performance', 'in', 'the', 'case', 'of', 'chaotic', 'systems', 'this', 'leads', 'us', 'to', 'introduce', 'several', 'metrics', 'based', 'on', 'standard', 'signal', 'processing', 'techniques', 'to', 'evaluate', 'the', 'quality', 'of', 'the', 'emulation', 'our', 'work', 'significantly', 'enlarges', 'the', 'range', 'of', 'tasks', 'that', 'can', 'be', 'solved', 'by', 'hardware', 'reservoir', 'computers', 'and', 'therefore', 'the', 'range', 'of', 'applications', 'they', 'could', 'potentially', 'tackle', 'it', 'also', 'raises', 'novel', 'questions', 'in', 'nonlinear', 'dynamics', 'and', 'chaos', 'theory']] | [-0.12534335173997554, 0.04317452964195282, -0.08190136882907179, 0.01999397433330601, -0.06191580584326576, -0.15663958432400502, 0.04405222442862443, 0.3870835755440283, -0.2776818663464601, -0.321695145623317, 0.1285271944062289, -0.24293987845969683, -0.18900186110912376, 0.3081775830757153, -0.09465765337745062, 0.10900432744327222, 0.12428413281914363, 0.013870995083953001, -0.05310648409622813, -0.282667816469898, 0.24433643854562345, 0.08676547218232572, 0.2953570552151435, 0.03355406974630721, 0.0802398104209862, -0.058747745019442944, -0.020009858771954055, -0.0222680048903285, -0.05743162501362796, 0.12194517495484859, 0.26233801855894096, 0.15989128142229223, 0.32656065042459037, -0.46889137187057495, -0.27059934767383026, 0.0901657081057043, 0.14746993353100482, 0.11810860842213336, -0.07345563979453348, -0.2817456238644704, 0.05132341175743869, -0.1786546396936769, -0.04114097922453603, -0.12282845947616922, 0.01819252057507031, -0.006326152251175295, -0.23029949312028342, 0.02193860901836602, 0.04578782432117753, 0.037520027843255525, -0.013884940930249202, -0.07293883306404975, 0.05056543390379648, 0.14998173228508088, -0.008347992573304888, -0.016462771223341197, 0.17402779932182305, -0.14426959450170768, -0.1582317160243287, 0.38934397756665773, -0.04793195564547457, -0.20678704653495136, 0.23847644534796433, -0.10775128953061955, -0.13582422205037034, 0.09353969158400173, 0.24938021417817563, 0.06638539037391317, -0.1489215282174204, 0.07015185083216864, 0.017479577104458747, 0.19081354245470805, 0.039047639818345276, 0.04147549305714107, 0.2097479605968541, 0.20632549410825865, 0.018227430167500294, 0.18994188217669616, -0.04534184696463023, -0.13094981018833363, -0.1930726118169784, -0.13587718364658813, -0.1953180276847988, 0.011234991551872148, -0.037602278836794206, -0.13531206809896087, 0.42380405537181165, 0.24023377755656838, 0.16996907970647332, 0.05291914925345279, 0.3527791329142718, 0.10421688688684771, 0.08407107365285342, 0.058596637067681104, 0.22067008712234762, 0.08860423863257115, 0.15388947279553192, -0.23196279122480704, 0.0517398187072377, -0.005418077625355796] |
1,802.02027 | A remark on symbolic powers | By an easy application of Skoda's theorem on ideal generation, a non-local
version of the Briancon-Skoda theorem is obtained. In particular, the symbolic
powers $I^{(p)}$ of a zero dimensional radical ideal $I$ generated by $r$
holomorphic functions on an $n$-dimensional Stein manifold are shown to satisfy
$I^{(p+q)}\subset I^p$ for $q=\min\{n,r-1\}$ and all natural $p$, which
contributes to the so-called containment problem.
| math.CV | by an easy application of skodas theorem on ideal generation a nonlocal version of the brianconskoda theorem is obtained in particular the symbolic powers ip of a zero dimensional radical ideal i generated by r holomorphic functions on an ndimensional stein manifold are shown to satisfy ipqsubset ip for qminnr1 and all natural p which contributes to the socalled containment problem | [['by', 'an', 'easy', 'application', 'of', 'skodas', 'theorem', 'on', 'ideal', 'generation', 'a', 'nonlocal', 'version', 'of', 'the', 'brianconskoda', 'theorem', 'is', 'obtained', 'in', 'particular', 'the', 'symbolic', 'powers', 'ip', 'of', 'a', 'zero', 'dimensional', 'radical', 'ideal', 'i', 'generated', 'by', 'r', 'holomorphic', 'functions', 'on', 'an', 'ndimensional', 'stein', 'manifold', 'are', 'shown', 'to', 'satisfy', 'ipqsubset', 'ip', 'for', 'qminnr1', 'and', 'all', 'natural', 'p', 'which', 'contributes', 'to', 'the', 'socalled', 'containment', 'problem']] | [-0.15304962985841084, 0.03575817884737231, -0.02930934162084329, 0.06763405390123253, -0.08034032847637594, -0.15140079556948552, -0.017857743395587145, 0.3000050608889531, -0.3355945290018946, -0.1667520588232299, 0.10953193575230633, -0.2468829413212962, -0.10834421282949841, 0.23429507077119108, -0.09410314358202583, 0.03189763131993428, 0.024768136410137354, 0.06800760222220067, -0.04528567521690817, -0.24627974563893879, 0.3954313519900128, 0.014239216673235267, 0.23415274501351988, 0.07034303399465852, 0.12266471224316096, 0.05212252742563516, -0.0187540842078121, 0.01348998912183915, -0.13609545428100658, 0.15072845936539755, 0.2647266886118105, 0.11004871424382269, 0.2534018604526833, -0.39519492841436193, -0.12861029616699127, 0.1638772258598168, 0.0885677282635312, 0.0023933809972762807, -0.009240866784732474, -0.2561165480321999, 0.1621023189923647, -0.1657171306531813, -0.20505053851500912, -0.07642338587507858, 0.07955840385471613, 0.010299789877134865, -0.3134364070591785, 0.0076705464398709395, 0.18149467409288478, 0.0919211185458353, -0.04443358951563931, -0.09418017537159434, -0.01779215083994224, 0.04138486445644649, -0.02391190143791422, 0.06829895908644391, 0.05060396801928942, -0.07983601125220124, -0.14340151670404663, 0.3640692524169966, -0.058818943684099845, -0.23296322589898008, 0.14701851168489558, -0.07274748249200441, -0.11435527751474815, 0.09418280027270065, 0.09394315099027956, 0.14076768395380448, -0.09210351117397264, 0.18082529138990724, -0.11443078764951077, 0.09147391146269895, 0.09071480606729954, -0.027654244023832982, 0.13401706937811006, 0.0722347424184051, 0.12927021738931033, 0.14494450437694284, 0.0025261535261899737, -0.06354342022233926, -0.30625803402419816, -0.20573836625001188, -0.19676715309408066, 0.15945491659991695, -0.09185883812423819, -0.16265755206873342, 0.3727851352670183, 0.08448943353190987, 0.13204517982647582, 0.05497156882508642, 0.26621995612158106, 0.1347334087999948, 0.05527838595779771, 0.08306887801894444, 0.11966107002759384, 0.18243390742405238, 0.04236573279219664, -0.13702390007911472, 0.01820354865887597, 0.1962021557472141] |
1,802.02028 | Suppressing spatio-temporal lasing instabilities with wave-chaotic
microcavities | Spatio-temporal instabilities are widespread phenomena resulting from
complexity and nonlinearity. In broad-area edge-emitting semiconductor lasers,
the nonlinear interactions of multiple spatial modes with the active medium can
result in filamentation and spatio-temporal chaos. These instabilities degrade
the laser performance and are extremely challenging to control. We demonstrate
a powerful approach to suppress spatio-temporal instabilities using
wave-chaotic or disordered cavities. The interference of many propagating waves
with random phases in such cavities disrupts the formation of self-organized
structures like filaments, resulting in stable lasing dynamics. Our method
provides a general and robust scheme to prevent the formation and growth of
nonlinear instabilities for a large variety of high-power lasers.
| physics.optics nlin.CD | spatiotemporal instabilities are widespread phenomena resulting from complexity and nonlinearity in broadarea edgeemitting semiconductor lasers the nonlinear interactions of multiple spatial modes with the active medium can result in filamentation and spatiotemporal chaos these instabilities degrade the laser performance and are extremely challenging to control we demonstrate a powerful approach to suppress spatiotemporal instabilities using wavechaotic or disordered cavities the interference of many propagating waves with random phases in such cavities disrupts the formation of selforganized structures like filaments resulting in stable lasing dynamics our method provides a general and robust scheme to prevent the formation and growth of nonlinear instabilities for a large variety of highpower lasers | [['spatiotemporal', 'instabilities', 'are', 'widespread', 'phenomena', 'resulting', 'from', 'complexity', 'and', 'nonlinearity', 'in', 'broadarea', 'edgeemitting', 'semiconductor', 'lasers', 'the', 'nonlinear', 'interactions', 'of', 'multiple', 'spatial', 'modes', 'with', 'the', 'active', 'medium', 'can', 'result', 'in', 'filamentation', 'and', 'spatiotemporal', 'chaos', 'these', 'instabilities', 'degrade', 'the', 'laser', 'performance', 'and', 'are', 'extremely', 'challenging', 'to', 'control', 'we', 'demonstrate', 'a', 'powerful', 'approach', 'to', 'suppress', 'spatiotemporal', 'instabilities', 'using', 'wavechaotic', 'or', 'disordered', 'cavities', 'the', 'interference', 'of', 'many', 'propagating', 'waves', 'with', 'random', 'phases', 'in', 'such', 'cavities', 'disrupts', 'the', 'formation', 'of', 'selforganized', 'structures', 'like', 'filaments', 'resulting', 'in', 'stable', 'lasing', 'dynamics', 'our', 'method', 'provides', 'a', 'general', 'and', 'robust', 'scheme', 'to', 'prevent', 'the', 'formation', 'and', 'growth', 'of', 'nonlinear', 'instabilities', 'for', 'a', 'large', 'variety', 'of', 'highpower', 'lasers']] | [-0.17949003684851858, 0.19849891387167629, -0.062338114796417626, 0.05073579543925546, -0.045730809275819746, -0.14046437030709866, -0.036102665219611176, 0.40596080370919985, -0.2988446455931774, -0.24989812467592182, 0.07793135193383528, -0.24110788195307745, -0.1974194881493329, 0.2298766190155961, -0.010078650101570896, 0.07403371158121715, 0.012393651094667061, -0.12816052744165063, 0.03805362135904876, -0.14250714399127495, 0.2880124252039456, 0.0666596248629503, 0.36849990323470494, -0.0029407896153214905, 0.08121846847805297, -0.05395131339362167, 0.03815382045124554, -0.016750611088894033, -0.08971802094257092, 0.06393138545401464, 0.26506733027485163, 0.02973676308088384, 0.31976965669525304, -0.5142805139292721, -0.3162449611958841, 0.041593170037096436, 0.18449941811289777, 0.18613905031923894, -0.11308608115736947, -0.2912278324969251, 0.040865308725861485, -0.12328670492300901, -0.1577661788367011, -0.08099590511820107, -0.05204953749974569, 0.09069987634224903, -0.3130026230312608, 0.0934762426186353, 0.06464464558478168, 0.016331790775034785, -0.005647871910628897, 0.05412275803542731, -0.043886248757459084, 0.06240654881414095, -0.011181206494155858, -0.024422214927013824, 0.17102347131111417, -0.17834691501532993, -0.12751098909022943, 0.38110636247115004, -0.04020606415535979, -0.1289087865346422, 0.3005203533426134, -0.16321249822862297, -0.0683898709723036, 0.22193897110237568, 0.254695189823569, 0.09033541590259928, -0.05595630479769574, -0.03361106839697135, 0.057770000839674915, 0.1696772694380747, 0.10421902094795196, 0.15566455644686897, 0.22394658539970233, 0.24928468375259805, 0.022984976021689363, 0.137119270792162, -0.07302254119336053, -0.08740979021294387, -0.19101416927178097, -0.050363387069578665, -0.09840588082550783, 0.01926540141155581, -0.0883487944518964, -0.2029594287181411, 0.3992006584250568, 0.16324312969313556, 0.12384615037848966, -0.047416051358191505, 0.31390385964402445, 0.07378516000096204, 0.06601028521200297, 0.056680867329877975, 0.26748138009484307, 0.15340279843830676, 0.08581387912164684, -0.25682432226690083, 0.02227469245014988, -0.01895784164123513] |
1,802.02029 | Ethics, Information, and Our "It-from-Bit" Universe | Using information technology, humans have brought about the Information
Revolution, which is changing the world faster and more profoundly than ever
before. How is this possible? An answer is suggested by comments of James Moor,
regarding Logical Malleability, in his classic paper, What Is Computer Ethics?,
1985. The present essay combines Moor's ideas with the hypothesis that all
physical entities, including spacetime and the universe as a whole, are dynamic
data structures. To show the usefulness of taking such an approach, in both
physics and information ethics, a suggested it from bit model of the universe
is briefly sketched, and relevant predictions are offered about the future of
computer and information ethics.
| physics.pop-ph physics.hist-ph | using information technology humans have brought about the information revolution which is changing the world faster and more profoundly than ever before how is this possible an answer is suggested by comments of james moor regarding logical malleability in his classic paper what is computer ethics 1985 the present essay combines moors ideas with the hypothesis that all physical entities including spacetime and the universe as a whole are dynamic data structures to show the usefulness of taking such an approach in both physics and information ethics a suggested it from bit model of the universe is briefly sketched and relevant predictions are offered about the future of computer and information ethics | [['using', 'information', 'technology', 'humans', 'have', 'brought', 'about', 'the', 'information', 'revolution', 'which', 'is', 'changing', 'the', 'world', 'faster', 'and', 'more', 'profoundly', 'than', 'ever', 'before', 'how', 'is', 'this', 'possible', 'an', 'answer', 'is', 'suggested', 'by', 'comments', 'of', 'james', 'moor', 'regarding', 'logical', 'malleability', 'in', 'his', 'classic', 'paper', 'what', 'is', 'computer', 'ethics', '1985', 'the', 'present', 'essay', 'combines', 'moors', 'ideas', 'with', 'the', 'hypothesis', 'that', 'all', 'physical', 'entities', 'including', 'spacetime', 'and', 'the', 'universe', 'as', 'a', 'whole', 'are', 'dynamic', 'data', 'structures', 'to', 'show', 'the', 'usefulness', 'of', 'taking', 'such', 'an', 'approach', 'in', 'both', 'physics', 'and', 'information', 'ethics', 'a', 'suggested', 'it', 'from', 'bit', 'model', 'of', 'the', 'universe', 'is', 'briefly', 'sketched', 'and', 'relevant', 'predictions', 'are', 'offered', 'about', 'the', 'future', 'of', 'computer', 'and', 'information', 'ethics']] | [-0.0577250753527291, 0.0931793674662913, -0.11195822186709847, 0.10797154513940248, -0.14392627732013352, -0.14344007410857426, 0.026611663067472233, 0.32135366633052137, -0.26172554143704474, -0.35319799938588403, 0.14978397015823117, -0.29633151669986546, -0.20404417026397173, 0.212250203964816, -0.12307608774946337, 0.012387178372591734, 0.029855775443138555, 0.0501546646701172, -0.013323098078607083, -0.315018990477256, 0.3234957386136687, 0.12165169365471229, 0.264006221226217, 0.07315817958442494, 0.07881950397443559, 0.005150406801216637, -0.0958383377364953, -0.003057801684397938, -0.12942599197315627, 0.1567711508832872, 0.2609644125976566, 0.27827975468244404, 0.32940698792559225, -0.44754827762621324, -0.2079357926600746, 0.02699834610185852, 0.11963552491839177, 0.13184107326898292, -0.022722986669837804, -0.34128077505374677, 0.034360866476552995, -0.17560954347469046, -0.1039362352374675, -0.06575662854343786, 0.048595766129437834, -0.05336513707879931, -0.15554848613568797, 0.02028247099120303, 0.08677705005227056, 0.07738690807101582, -0.020269531610080906, -0.10684229705449459, 0.016764041945862118, 0.1571690504601325, 0.05904336383776711, 0.04816991095763764, 0.14020206978810684, -0.15421536274828082, -0.17710798354320495, 0.4124336696196614, 0.030769521272174773, -0.14376632391940802, 0.1489509226105708, -0.1062256359021246, -0.09861548275408236, 0.03920550959342758, 0.09912349685639908, 0.05586785106736768, -0.18318621877447835, 0.07244454351842121, -0.032118050585268065, 0.1564888759416395, 0.08206877894865881, 0.05101028699677305, 0.2569907918971564, 0.1990036959011507, -0.011653801846218162, 0.06679457624808752, -0.00020208141774803932, -0.14794375734189608, -0.24826646314301928, -0.19411922069100132, -0.15648740261323318, 0.0515584765692308, -0.0584723168268673, -0.06553219534024331, 0.3408344800949895, 0.2299416019315166, 0.14325965454918332, 0.002736068227802337, 0.2979222356973748, 0.02092425157128933, 0.03592284370097332, 0.09045295602326016, 0.22425459433621395, 0.08715014652989339, 0.18009313848701172, -0.11214468622555225, 0.10253461056605115, -0.0010219260044063308] |
1,802.0203 | Note: On the dielectric constant of nanoconfined water | Investigations of dielectric properties of water in nanoconfinement are
highly relevant for various applications. Here, using a simple capacitor model,
we show that the low dielectric constant of nanoconfined water found in
molecular dynamics simulations can be largely explained by the so-called
dielectric dead-layer effect known for ferroelectric nanocapacitors.
| cond-mat.soft | investigations of dielectric properties of water in nanoconfinement are highly relevant for various applications here using a simple capacitor model we show that the low dielectric constant of nanoconfined water found in molecular dynamics simulations can be largely explained by the socalled dielectric deadlayer effect known for ferroelectric nanocapacitors | [['investigations', 'of', 'dielectric', 'properties', 'of', 'water', 'in', 'nanoconfinement', 'are', 'highly', 'relevant', 'for', 'various', 'applications', 'here', 'using', 'a', 'simple', 'capacitor', 'model', 'we', 'show', 'that', 'the', 'low', 'dielectric', 'constant', 'of', 'nanoconfined', 'water', 'found', 'in', 'molecular', 'dynamics', 'simulations', 'can', 'be', 'largely', 'explained', 'by', 'the', 'socalled', 'dielectric', 'deadlayer', 'effect', 'known', 'for', 'ferroelectric', 'nanocapacitors']] | [-0.13831336408549424, 0.17299233070973838, -0.027188105109546865, -0.008418688153829046, -0.012959194868536932, -0.12210755748674273, 0.02121081552943405, 0.4442075819385295, -0.2577561077718832, -0.27472055057177736, 0.06685535541773603, -0.21675157470970738, -0.22648803245428265, 0.23484019531716346, 0.02087149693991761, 0.04034055412119748, -0.035844056829049877, -0.10959499454771986, -0.025609752367611746, -0.13666760819793053, 0.20721952109692657, 0.02841025233572843, 0.25989075015508095, 0.17352485195353476, 0.03905193380327249, -0.08396223041095904, 0.06460280378577204, 0.11269527198556735, -0.14865397456252344, 0.052586071155873264, 0.2592940952638354, -0.06455955684793238, 0.2115971551713895, -0.520177456645333, -0.288918870102082, -0.022055567886053146, 0.11632825876586139, 0.14607526829504236, -0.11926915348336405, -0.21397854456183862, 0.036122318171915045, -0.12296129328113202, -0.16335779655610724, -0.10798474457780165, -0.025153838649240076, 0.0655738379941702, -0.18364826722868852, 0.10248417041872684, 0.01269797691885306, 0.06785066058973269, -0.12165998423243968, -0.16379044391214848, -0.020882148697155014, 0.051163250478269647, 0.014401367121870269, -0.04721618151026113, 0.2579875874371097, -0.14182917273850465, -0.06889663807743666, 0.42921882107549786, -0.08742977621756037, -0.18541970529726573, 0.18597335213016034, -0.1874142641638767, -0.0839276070307408, 0.18598428923560648, 0.14090820124410852, 0.13633126793049125, -0.230521060982529, 0.05033035498951106, -0.04804799087079508, 0.21471291845094184, 0.10781156143401655, 0.04428200390455978, 0.24790499226323195, 0.2400034132831711, -0.07975167678954194, 0.1929860891018785, -0.05070922424902721, -0.04689748123364181, -0.20552468383494688, -0.1533620854725643, -0.22042412719480237, 0.05760935285337725, -0.11028861790439304, -0.20507253961143446, 0.3254297683965795, 0.11234205899456022, 0.10412036152366473, -0.026677387424421554, 0.2676744478213012, 0.03950703175434349, 0.06238401841315232, 0.019724322649251138, 0.3224406953596947, 0.1505774769751469, 0.10991439789685668, -0.2820819240367534, 0.15474576663644035, -0.02346836791696901] |
1,802.02031 | Finite speed of propagation for the thin film equation in spherical
geometry | We show that a double degenerate thin film equation, which originated from
modeling of viscous coating flow on a spherical surface, has finite speed of
propagation for nonnegative strong solutions and hence there exists an
interface or free boundary separating the regions where solution $u>0$ and
$u=0$. Using local entropy estimates we also obtain an upper bound for the rate
of the interface propagation.
| math.AP | we show that a double degenerate thin film equation which originated from modeling of viscous coating flow on a spherical surface has finite speed of propagation for nonnegative strong solutions and hence there exists an interface or free boundary separating the regions where solution u0 and u0 using local entropy estimates we also obtain an upper bound for the rate of the interface propagation | [['we', 'show', 'that', 'a', 'double', 'degenerate', 'thin', 'film', 'equation', 'which', 'originated', 'from', 'modeling', 'of', 'viscous', 'coating', 'flow', 'on', 'a', 'spherical', 'surface', 'has', 'finite', 'speed', 'of', 'propagation', 'for', 'nonnegative', 'strong', 'solutions', 'and', 'hence', 'there', 'exists', 'an', 'interface', 'or', 'free', 'boundary', 'separating', 'the', 'regions', 'where', 'solution', 'u0', 'and', 'u0', 'using', 'local', 'entropy', 'estimates', 'we', 'also', 'obtain', 'an', 'upper', 'bound', 'for', 'the', 'rate', 'of', 'the', 'interface', 'propagation']] | [-0.16496639605611563, 0.10429455087114547, -0.09256941333296709, -0.008265980082796887, -0.05294128278183052, -0.1709872775390977, 0.030305949359899387, 0.32230310565500986, -0.3192169102403568, -0.21684144510072656, 0.13347210084612016, -0.3094942340394482, -0.08478520250719157, 0.2097310093631677, 0.003207033419130312, 0.04037856883951463, 0.04087068504304625, 0.016436232672276674, -0.081283618517773, -0.1337974376110651, 0.33962414572306443, -0.05236478593724314, 0.2983721704076743, 0.1377935930431704, 0.12350941015756689, -0.028116430541558657, 0.08254697576921899, 0.03177136753220111, -0.2622930499388758, 0.06872732709234697, 0.17622085124094156, 0.023513146523328032, 0.23972242398303933, -0.4912616806104779, -0.26007730851415545, 0.08035359253699426, 0.15635637719242368, 0.08474828032740334, -0.13688836738401733, -0.2612670187954791, 0.09394048723333981, -0.12132179076434113, -0.14453274750849232, 0.010545604323851876, 0.02480971088516526, 0.006060852654627524, -0.2860460844503905, 0.13642227589616596, 0.09812916956434492, 0.015128026232105185, -0.14076070359442383, -0.08325193219206994, -0.0922853916126769, 0.08962270383563009, 0.06895114028884564, 0.058015473776322324, 0.07373983394791139, -0.18170912917412352, -0.006303467715042643, 0.30710288164846133, -0.1270800586353289, -0.2430510903686809, 0.20660393335128902, -0.1303710953097834, -0.01396584101166809, 0.1604734123320668, 0.18951634268887574, 0.15928850596537814, -0.12407484852883499, 0.13975690891493286, -0.05826719480501197, 0.2178522139583947, 0.11988426645984873, -0.04434324631438358, 0.15724709918140434, 0.13697551129735075, 0.15336002282856498, 0.14096682862145826, -0.1077598440535894, -0.06528078656992875, -0.3472246484598145, -0.18081808759325213, -0.15471392059407663, 0.0611725069466047, -0.13608573221381448, -0.2783142592816148, 0.3077715961262584, 0.07408342371127219, 0.16932662384351715, 0.007998400500582648, 0.24918173857986403, 0.1794750333065167, -0.018866627986426465, 0.15904224614678242, 0.2206715524662286, 0.12058687233002274, 0.05506063266170713, -0.20465709833297296, 0.0692121455722372, 0.11392403673380613] |
1,802.02032 | Improving Variational Encoder-Decoders in Dialogue Generation | Variational encoder-decoders (VEDs) have shown promising results in dialogue
generation. However, the latent variable distributions are usually approximated
by a much simpler model than the powerful RNN structure used for encoding and
decoding, yielding the KL-vanishing problem and inconsistent training
objective. In this paper, we separate the training step into two phases: The
first phase learns to autoencode discrete texts into continuous embeddings,
from which the second phase learns to generalize latent representations by
reconstructing the encoded embedding. In this case, latent variables are
sampled by transforming Gaussian noise through multi-layer perceptrons and are
trained with a separate VED model, which has the potential of realizing a much
more flexible distribution. We compare our model with current popular models
and the experiment demonstrates substantial improvement in both metric-based
and human evaluations.
| cs.CL cs.AI cs.LG | variational encoderdecoders veds have shown promising results in dialogue generation however the latent variable distributions are usually approximated by a much simpler model than the powerful rnn structure used for encoding and decoding yielding the klvanishing problem and inconsistent training objective in this paper we separate the training step into two phases the first phase learns to autoencode discrete texts into continuous embeddings from which the second phase learns to generalize latent representations by reconstructing the encoded embedding in this case latent variables are sampled by transforming gaussian noise through multilayer perceptrons and are trained with a separate ved model which has the potential of realizing a much more flexible distribution we compare our model with current popular models and the experiment demonstrates substantial improvement in both metricbased and human evaluations | [['variational', 'encoderdecoders', 'veds', 'have', 'shown', 'promising', 'results', 'in', 'dialogue', 'generation', 'however', 'the', 'latent', 'variable', 'distributions', 'are', 'usually', 'approximated', 'by', 'a', 'much', 'simpler', 'model', 'than', 'the', 'powerful', 'rnn', 'structure', 'used', 'for', 'encoding', 'and', 'decoding', 'yielding', 'the', 'klvanishing', 'problem', 'and', 'inconsistent', 'training', 'objective', 'in', 'this', 'paper', 'we', 'separate', 'the', 'training', 'step', 'into', 'two', 'phases', 'the', 'first', 'phase', 'learns', 'to', 'autoencode', 'discrete', 'texts', 'into', 'continuous', 'embeddings', 'from', 'which', 'the', 'second', 'phase', 'learns', 'to', 'generalize', 'latent', 'representations', 'by', 'reconstructing', 'the', 'encoded', 'embedding', 'in', 'this', 'case', 'latent', 'variables', 'are', 'sampled', 'by', 'transforming', 'gaussian', 'noise', 'through', 'multilayer', 'perceptrons', 'and', 'are', 'trained', 'with', 'a', 'separate', 'ved', 'model', 'which', 'has', 'the', 'potential', 'of', 'realizing', 'a', 'much', 'more', 'flexible', 'distribution', 'we', 'compare', 'our', 'model', 'with', 'current', 'popular', 'models', 'and', 'the', 'experiment', 'demonstrates', 'substantial', 'improvement', 'in', 'both', 'metricbased', 'and', 'human', 'evaluations']] | [-0.007394495015862838, 0.08091574585310711, -0.07814207050882555, 0.08878120716774923, -0.11585746700478386, -0.19627108129983148, 0.03334183225772784, 0.4373596836126937, -0.27775087681339056, -0.3103261273498683, 0.052784964366447785, -0.2591498006756107, -0.18508089049863666, 0.16459184593535497, -0.07268318612590548, 0.08637476507068952, 0.07753933648228674, 0.02052231335312186, -0.08882724406746353, -0.26136183171071, 0.29126656511070625, 0.027029394493402206, 0.32468124267883425, -0.08751265330117398, 0.1375633386873402, -0.012774148093204396, -0.060470762770882876, -0.027090573146990718, -0.028220763943490188, 0.17278162300019964, 0.2945529410317813, 0.1435773440477864, 0.2985662761822978, -0.4317219441254847, -0.29617662753823193, 0.11227545731650419, 0.1478585714885835, 0.11253309780334722, -0.028912123492688787, -0.3437816569664653, 0.055674390314154096, -0.15251396067057874, 0.042621532639185354, -0.14615466207439123, -0.04784986713193646, -0.024320358501624516, -0.2960592630168589, 0.06136396279298635, 0.09325922066490203, 0.006280581851294914, -0.07635956515319818, -0.14392966724383507, -0.016355556723762793, 0.1314330967612449, 0.03440307896284661, 0.10394151220206431, 0.0631434830224192, -0.1480419064056157, -0.11497778620556459, 0.3627732460668614, -0.07391261012529049, -0.2521801494466242, 0.16654345276224058, -0.05633169917451568, -0.14466208119176385, 0.10631333607025156, 0.21297545679086863, 0.11198652342914842, -0.17810464711081916, -0.0065694939234120725, -0.02073989524289446, 0.17670185798724983, 0.03308575123534069, -0.019016591001792933, 0.16976447930909663, 0.24297431256448807, -0.002224561355849223, 0.2093567963844786, -0.08996689024421047, -0.14208589674717234, -0.23567919800592255, -0.10749484455734563, -0.2063804646167009, -0.021070995424015, -0.10587491880136257, -0.12986360496706906, 0.4378673002853008, 0.1991404212096186, 0.23325852018802665, 0.12150820764323134, 0.3254452647078176, 0.07333185694581114, 0.09207182989434101, 0.0866361321563753, 0.15308631123079694, 0.07567906381685084, 0.08258432210892323, -0.10596861997316953, 0.12738330526923347, 0.04158424644716546] |
1,802.02033 | Ways of Applying Artificial Intelligence in Software Engineering | As Artificial Intelligence (AI) techniques have become more powerful and
easier to use they are increasingly deployed as key components of modern
software systems. While this enables new functionality and often allows better
adaptation to user needs it also creates additional problems for software
engineers and exposes companies to new risks. Some work has been done to better
understand the interaction between Software Engineering and AI but we lack
methods to classify ways of applying AI in software systems and to analyse and
understand the risks this poses. Only by doing so can we devise tools and
solutions to help mitigate them. This paper presents the AI in SE Application
Levels (AI-SEAL) taxonomy that categorises applications according to their
point of AI application, the type of AI technology used and the automation
level allowed. We show the usefulness of this taxonomy by classifying 15 papers
from previous editions of the RAISE workshop. Results show that the taxonomy
allows classification of distinct AI applications and provides insights
concerning the risks associated with them. We argue that this will be important
for companies in deciding how to apply AI in their software applications and to
create strategies for its use.
| cs.SE | as artificial intelligence ai techniques have become more powerful and easier to use they are increasingly deployed as key components of modern software systems while this enables new functionality and often allows better adaptation to user needs it also creates additional problems for software engineers and exposes companies to new risks some work has been done to better understand the interaction between software engineering and ai but we lack methods to classify ways of applying ai in software systems and to analyse and understand the risks this poses only by doing so can we devise tools and solutions to help mitigate them this paper presents the ai in se application levels aiseal taxonomy that categorises applications according to their point of ai application the type of ai technology used and the automation level allowed we show the usefulness of this taxonomy by classifying 15 papers from previous editions of the raise workshop results show that the taxonomy allows classification of distinct ai applications and provides insights concerning the risks associated with them we argue that this will be important for companies in deciding how to apply ai in their software applications and to create strategies for its use | [['as', 'artificial', 'intelligence', 'ai', 'techniques', 'have', 'become', 'more', 'powerful', 'and', 'easier', 'to', 'use', 'they', 'are', 'increasingly', 'deployed', 'as', 'key', 'components', 'of', 'modern', 'software', 'systems', 'while', 'this', 'enables', 'new', 'functionality', 'and', 'often', 'allows', 'better', 'adaptation', 'to', 'user', 'needs', 'it', 'also', 'creates', 'additional', 'problems', 'for', 'software', 'engineers', 'and', 'exposes', 'companies', 'to', 'new', 'risks', 'some', 'work', 'has', 'been', 'done', 'to', 'better', 'understand', 'the', 'interaction', 'between', 'software', 'engineering', 'and', 'ai', 'but', 'we', 'lack', 'methods', 'to', 'classify', 'ways', 'of', 'applying', 'ai', 'in', 'software', 'systems', 'and', 'to', 'analyse', 'and', 'understand', 'the', 'risks', 'this', 'poses', 'only', 'by', 'doing', 'so', 'can', 'we', 'devise', 'tools', 'and', 'solutions', 'to', 'help', 'mitigate', 'them', 'this', 'paper', 'presents', 'the', 'ai', 'in', 'se', 'application', 'levels', 'aiseal', 'taxonomy', 'that', 'categorises', 'applications', 'according', 'to', 'their', 'point', 'of', 'ai', 'application', 'the', 'type', 'of', 'ai', 'technology', 'used', 'and', 'the', 'automation', 'level', 'allowed', 'we', 'show', 'the', 'usefulness', 'of', 'this', 'taxonomy', 'by', 'classifying', '15', 'papers', 'from', 'previous', 'editions', 'of', 'the', 'raise', 'workshop', 'results', 'show', 'that', 'the', 'taxonomy', 'allows', 'classification', 'of', 'distinct', 'ai', 'applications', 'and', 'provides', 'insights', 'concerning', 'the', 'risks', 'associated', 'with', 'them', 'we', 'argue', 'that', 'this', 'will', 'be', 'important', 'for', 'companies', 'in', 'deciding', 'how', 'to', 'apply', 'ai', 'in', 'their', 'software', 'applications', 'and', 'to', 'create', 'strategies', 'for', 'its', 'use']] | [-0.049592695499741976, 0.006282713177949568, -0.08938457657048847, 0.08431193549457824, -0.14647962340640688, -0.172806460724737, 0.05637821856775938, 0.39927330136601696, -0.25753324739587713, -0.3715756887376195, 0.11406872512153374, -0.26430781501440476, -0.2154198416040709, 0.2336156395911641, -0.15008367403282732, 0.05721194487328636, 0.0522726657315805, -0.006515085302425672, -0.009755242973457322, -0.2882356676958539, 0.3289471833876849, 0.04365905840777163, 0.30270253054367446, 0.07308964799796491, 0.0202379750404306, -0.01986674765871866, -0.06060129151027177, -0.01763575304206372, -0.11363721546624063, 0.2274591650584533, 0.38011263973265175, 0.25591740698487436, 0.3818063955939597, -0.44962716547460274, -0.1605192909837431, 0.08883859857510265, 0.18731024345326316, 0.0888092130892981, -0.02446910724917552, -0.28816750353594606, 0.09245789717164288, -0.23067570158143333, -0.1438568243473239, -0.1738474234952804, 0.017117826669916587, 0.018382672648309603, -0.20063528150017493, -0.07563883802090621, 0.056061483574511135, 0.09359066173916465, -0.015491849675462558, -0.12359975739547671, 0.04126189496169614, 0.22417625077612102, 0.08507561042247727, -0.0012459739902928983, 0.12628744578764298, -0.14408318137839854, -0.1699870050120106, 0.39193747890404035, 0.0393858382970019, -0.1593123070634476, 0.26754450915159117, -0.015095237605888302, -0.1918041483796944, 0.03389853144952139, 0.23114290856283518, 0.03209155755056078, -0.1819662850445874, 0.05845224818269141, 0.093218717523165, 0.1695669961859517, 0.0354290078583216, 0.006941016647624334, 0.21490499123618914, 0.17739495731208255, 0.0812259468312838, 0.10886794972874055, -0.026239318205256414, -0.07220024092543662, -0.1860310131740676, -0.18911343013281523, -0.0849504462260987, 0.03408503587485343, -0.009023063290636126, -0.12792257693251075, 0.3904311001622284, 0.27972632173571715, 0.1150824539883412, -0.0023239971916214916, 0.31893725279094604, 0.05344637468378036, 0.10066550654751547, 0.06673740324691921, 0.19493311388447035, 0.044596279817656966, 0.17463515391088738, -0.1323824636632255, 0.09302388579728847, -0.022251873794791814] |
1,802.02034 | Synchronicity and pure bending of piezoelectric bimorphs: a new approach
to kinetic energy harvesting | Kinetic energy harvesting with piezoelectric bimorphs has attracted
considerable research interest in recent years. Many works have been dedicated
to the modelling and optimisation of the cantilevered geometry to increase
power density, bandwidth, etc. The increased efficiency coming from the use of
trapezoidal beams has been recognised, but little has been done to produce the
same uniform strain within the most commonly available rectangular beams. This
work proposes a new approach via a smart compliant structure which permits to
deform a set of bimorphs in pure bending. Furthermore, since the deflections
are synchronous, the power signals produced are in phase and power conditioning
is simplified and made more efficient. The kinematic requirements for uniform
strain are discussed, the novel structure is proposed and modelled with finite
elements, a prototype is presented and characterised to support the modelling.
The proposed structure induces almost perfectly uniform strain in the
piezoelectric beams for all useful rotation angles, demonstrating that,
compared to a traditional cantilever, twice as many charges can be produced
when the same maximum strain is applied to the material. Synchronicity is also
experimentally verified for the prototype, as power signals resulting from
impact excitation are observed to be in phase. The principle of synchronous
pure bending via helper structures can be applied in general to increase the
performance of piezoelectric energy harvesters.
| physics.app-ph eess.SP | kinetic energy harvesting with piezoelectric bimorphs has attracted considerable research interest in recent years many works have been dedicated to the modelling and optimisation of the cantilevered geometry to increase power density bandwidth etc the increased efficiency coming from the use of trapezoidal beams has been recognised but little has been done to produce the same uniform strain within the most commonly available rectangular beams this work proposes a new approach via a smart compliant structure which permits to deform a set of bimorphs in pure bending furthermore since the deflections are synchronous the power signals produced are in phase and power conditioning is simplified and made more efficient the kinematic requirements for uniform strain are discussed the novel structure is proposed and modelled with finite elements a prototype is presented and characterised to support the modelling the proposed structure induces almost perfectly uniform strain in the piezoelectric beams for all useful rotation angles demonstrating that compared to a traditional cantilever twice as many charges can be produced when the same maximum strain is applied to the material synchronicity is also experimentally verified for the prototype as power signals resulting from impact excitation are observed to be in phase the principle of synchronous pure bending via helper structures can be applied in general to increase the performance of piezoelectric energy harvesters | [['kinetic', 'energy', 'harvesting', 'with', 'piezoelectric', 'bimorphs', 'has', 'attracted', 'considerable', 'research', 'interest', 'in', 'recent', 'years', 'many', 'works', 'have', 'been', 'dedicated', 'to', 'the', 'modelling', 'and', 'optimisation', 'of', 'the', 'cantilevered', 'geometry', 'to', 'increase', 'power', 'density', 'bandwidth', 'etc', 'the', 'increased', 'efficiency', 'coming', 'from', 'the', 'use', 'of', 'trapezoidal', 'beams', 'has', 'been', 'recognised', 'but', 'little', 'has', 'been', 'done', 'to', 'produce', 'the', 'same', 'uniform', 'strain', 'within', 'the', 'most', 'commonly', 'available', 'rectangular', 'beams', 'this', 'work', 'proposes', 'a', 'new', 'approach', 'via', 'a', 'smart', 'compliant', 'structure', 'which', 'permits', 'to', 'deform', 'a', 'set', 'of', 'bimorphs', 'in', 'pure', 'bending', 'furthermore', 'since', 'the', 'deflections', 'are', 'synchronous', 'the', 'power', 'signals', 'produced', 'are', 'in', 'phase', 'and', 'power', 'conditioning', 'is', 'simplified', 'and', 'made', 'more', 'efficient', 'the', 'kinematic', 'requirements', 'for', 'uniform', 'strain', 'are', 'discussed', 'the', 'novel', 'structure', 'is', 'proposed', 'and', 'modelled', 'with', 'finite', 'elements', 'a', 'prototype', 'is', 'presented', 'and', 'characterised', 'to', 'support', 'the', 'modelling', 'the', 'proposed', 'structure', 'induces', 'almost', 'perfectly', 'uniform', 'strain', 'in', 'the', 'piezoelectric', 'beams', 'for', 'all', 'useful', 'rotation', 'angles', 'demonstrating', 'that', 'compared', 'to', 'a', 'traditional', 'cantilever', 'twice', 'as', 'many', 'charges', 'can', 'be', 'produced', 'when', 'the', 'same', 'maximum', 'strain', 'is', 'applied', 'to', 'the', 'material', 'synchronicity', 'is', 'also', 'experimentally', 'verified', 'for', 'the', 'prototype', 'as', 'power', 'signals', 'resulting', 'from', 'impact', 'excitation', 'are', 'observed', 'to', 'be', 'in', 'phase', 'the', 'principle', 'of', 'synchronous', 'pure', 'bending', 'via', 'helper', 'structures', 'can', 'be', 'applied', 'in', 'general', 'to', 'increase', 'the', 'performance', 'of', 'piezoelectric', 'energy', 'harvesters']] | [-0.1186927198086861, 0.12932764682344683, -0.06789355959369031, 0.0030095403802423786, -0.10851666638967858, -0.1333794815478566, -0.011212104272318486, 0.4328742208869354, -0.2856677280984538, -0.3022860928287636, 0.08990565870174091, -0.23691670015479807, -0.10448443491679518, 0.23902726565491936, -0.06826358334986349, 0.08254775399561189, 0.031067436478062444, 0.007643412537107321, -0.03973865968295635, -0.1991201751688963, 0.2051988328386047, 0.12343103883864537, 0.36044704015940837, 0.036712514366274145, 0.08075204673201934, -0.01875163469948385, 0.0038226267203824707, 0.07348183933198962, -0.07960578357205077, 0.11251056302893273, 0.2685234857867706, 0.07776205060199821, 0.23641139543912965, -0.4596093562601738, -0.26104828892658427, 0.08977467218864726, 0.11505175688671858, 0.11435974445396005, -0.08661483623307745, -0.23038210352823207, 0.1061900786132675, -0.20012088832721864, -0.1226300003738504, -0.07319770572275416, 0.00727920285659974, 0.06048398261430533, -0.2629765965420323, 0.041982866924539945, 0.0208903495522671, 0.051614779693533806, -0.03650037171829441, -0.12535724907073714, -0.05683988252905576, 0.11398588306524102, 0.07255503200058354, 0.013814503430137964, 0.14140638335050854, -0.0835406029390673, -0.09535023585582773, 0.3916593135810844, -0.024069203040456254, -0.18744558614219398, 0.17092801439129326, -0.11265588282356591, -0.08775186535347355, 0.17735441275936079, 0.1896267919354651, 0.07731873787658876, -0.16813222007602974, 0.050584250032746546, 0.029254030703660526, 0.18361629705799565, 0.10700318538030976, 0.020559884083922952, 0.19937084009073522, 0.19633193206271693, 0.054524431856174754, 0.17602314364822097, -0.0877013790110747, -0.07546449250214177, -0.227846460752338, -0.11771305285173056, -0.19012028352329804, 0.025019087906305987, -0.027136239293018106, -0.12798129785890994, 0.39387831931027956, 0.10656797904666082, 0.1558025576914214, -0.01016118522727071, 0.318762131409558, 0.11414333531420655, 0.11742483107713328, 0.04033632634301164, 0.31645998987688184, 0.1421647591397236, 0.12320262985729259, -0.16904296939655689, 0.07997629704160114, -0.013672633783372978] |
1,802.02035 | Bayesian model calibration with interpolating polynomials based on
adaptively weighted Leja nodes | An efficient algorithm is proposed for Bayesian model calibration, which is
commonly used to estimate the model parameters of non-linear, computationally
expensive models using measurement data. The approach is based on Bayesian
statistics: using a prior distribution and a likelihood, the posterior
distribution is obtained through application of Bayes' law. Our novel algorithm
to accurately determine this posterior requires significantly fewer discrete
model evaluations than traditional Monte Carlo methods. The key idea is to
replace the expensive model by an interpolating surrogate model and to
construct the interpolating nodal set maximizing the accuracy of the posterior.
To determine such a nodal set an extension to weighted Leja nodes is
introduced, based on a new weighting function. We prove that the convergence of
the posterior has the same rate as the convergence of the model. If the
convergence of the posterior is measured in the Kullback-Leibler divergence,
the rate doubles. The algorithm and its theoretical properties are verified in
three different test cases: analytical cases that confirm the correctness of
the theoretical findings, Burgers' equation to show its applicability in
implicit problems, and finally the calibration of the closure parameters of a
turbulence model to show the effectiveness for computationally expensive
problems.
| math.NA cs.NA | an efficient algorithm is proposed for bayesian model calibration which is commonly used to estimate the model parameters of nonlinear computationally expensive models using measurement data the approach is based on bayesian statistics using a prior distribution and a likelihood the posterior distribution is obtained through application of bayes law our novel algorithm to accurately determine this posterior requires significantly fewer discrete model evaluations than traditional monte carlo methods the key idea is to replace the expensive model by an interpolating surrogate model and to construct the interpolating nodal set maximizing the accuracy of the posterior to determine such a nodal set an extension to weighted leja nodes is introduced based on a new weighting function we prove that the convergence of the posterior has the same rate as the convergence of the model if the convergence of the posterior is measured in the kullbackleibler divergence the rate doubles the algorithm and its theoretical properties are verified in three different test cases analytical cases that confirm the correctness of the theoretical findings burgers equation to show its applicability in implicit problems and finally the calibration of the closure parameters of a turbulence model to show the effectiveness for computationally expensive problems | [['an', 'efficient', 'algorithm', 'is', 'proposed', 'for', 'bayesian', 'model', 'calibration', 'which', 'is', 'commonly', 'used', 'to', 'estimate', 'the', 'model', 'parameters', 'of', 'nonlinear', 'computationally', 'expensive', 'models', 'using', 'measurement', 'data', 'the', 'approach', 'is', 'based', 'on', 'bayesian', 'statistics', 'using', 'a', 'prior', 'distribution', 'and', 'a', 'likelihood', 'the', 'posterior', 'distribution', 'is', 'obtained', 'through', 'application', 'of', 'bayes', 'law', 'our', 'novel', 'algorithm', 'to', 'accurately', 'determine', 'this', 'posterior', 'requires', 'significantly', 'fewer', 'discrete', 'model', 'evaluations', 'than', 'traditional', 'monte', 'carlo', 'methods', 'the', 'key', 'idea', 'is', 'to', 'replace', 'the', 'expensive', 'model', 'by', 'an', 'interpolating', 'surrogate', 'model', 'and', 'to', 'construct', 'the', 'interpolating', 'nodal', 'set', 'maximizing', 'the', 'accuracy', 'of', 'the', 'posterior', 'to', 'determine', 'such', 'a', 'nodal', 'set', 'an', 'extension', 'to', 'weighted', 'leja', 'nodes', 'is', 'introduced', 'based', 'on', 'a', 'new', 'weighting', 'function', 'we', 'prove', 'that', 'the', 'convergence', 'of', 'the', 'posterior', 'has', 'the', 'same', 'rate', 'as', 'the', 'convergence', 'of', 'the', 'model', 'if', 'the', 'convergence', 'of', 'the', 'posterior', 'is', 'measured', 'in', 'the', 'kullbackleibler', 'divergence', 'the', 'rate', 'doubles', 'the', 'algorithm', 'and', 'its', 'theoretical', 'properties', 'are', 'verified', 'in', 'three', 'different', 'test', 'cases', 'analytical', 'cases', 'that', 'confirm', 'the', 'correctness', 'of', 'the', 'theoretical', 'findings', 'burgers', 'equation', 'to', 'show', 'its', 'applicability', 'in', 'implicit', 'problems', 'and', 'finally', 'the', 'calibration', 'of', 'the', 'closure', 'parameters', 'of', 'a', 'turbulence', 'model', 'to', 'show', 'the', 'effectiveness', 'for', 'computationally', 'expensive', 'problems']] | [-0.028927411358173363, -0.02455022732476155, -0.11106727490970744, 0.12089926634326725, -0.08185013782682445, -0.1070951087543954, 0.07370582626743326, 0.37210215089393234, -0.2799069068408502, -0.3214726598229055, 0.09232328200900454, -0.24378892773790145, -0.1324372080641808, 0.21880038225657275, -0.06383221936342653, 0.13720249806690626, 0.08123325691118244, 0.014216782457996808, -0.09519081286604132, -0.27140991263721714, 0.2691706982236995, 0.09272626970676863, 0.32977937360928944, -0.016239519278514223, 0.12661260860654716, -0.014743141750040562, -0.027517658466037678, -0.025388704681429758, -0.1480165935931316, 0.14677188443297992, 0.19796424041252333, 0.18589377321594797, 0.32422560718448007, -0.38140132179974917, -0.21514734172665362, 0.11917800162061679, 0.15183819548472466, 0.08574019675895998, -0.005023711127001996, -0.25317514041295064, 0.08514872851749113, -0.17418291148687923, -0.11216030313878955, -0.12810624317979596, -0.04728502944533432, 0.05483540154522081, -0.3564778308636643, 0.10305610492556769, 0.008253388973277303, 0.0315551469519512, -0.037027215597854546, -0.12828367270311497, -0.008440643886048625, 0.08101799826842006, 0.058197239478725696, 0.030206260234302847, 0.09605480235218261, -0.11297527826344826, -0.1269023462571667, 0.3435021543606597, -0.035642872463210386, -0.2707991403485857, 0.14652947857350446, -0.06932162446901202, -0.11888770972475854, 0.12653573488571046, 0.16619440795974202, 0.15641245127161668, -0.16356951287664956, 0.058994430315388896, -0.045948587184822864, 0.15115248992117075, -0.025143678096211076, -0.06752792798649909, 0.12056699931964426, 0.1977128924110404, 0.06235823692610274, 0.14261881214744918, -0.1226286308461133, -0.1343815225913231, -0.2944595192869504, -0.13743221262627425, -0.26306667069983275, -0.031626188236205326, -0.14413884718090397, -0.19837809149731897, 0.3903429951259301, 0.24161758863214236, 0.18911987174862988, 0.12817038416304158, 0.3527284598879201, 0.1403622055226133, 0.022539172738568106, 0.09207900507672138, 0.2248125223961858, 0.1281011774232472, 0.008598778709602444, -0.20996855333475256, 0.1361421587765773, 0.08872399065615748] |
1,802.02036 | Influence of turbulent mixing on critical behavior of directed
percolation process : effect of compressibility | Universal behavior is a typical emergent feature of critical systems. A
paramount model of the non-equilibrium critical behavior is the directed bond
percolation process that exhibits an active- to-absorbing state phase
transition in the vicinity of a percolation threshold. Fluctuations of the
ambient environment might affect or destroy the universality properties
completely. In this work we assume that the random environment can be described
by means of compressible velocity fluctu- ations. Using field-theoretic models
and renormalization group methods we investigate large-scale and long-time
behavior. Altogether eleven universality classes are found, out of which four
are stable in the infrared limit and thus macroscopically accessible. In
contrast to the model without veloc- ity fluctuations a possible candidate for
a realistic three-dimensional case, a regime with relevant short-range noise,
is identified. Depending on the dimensionality of space and the structure of
the turbulent flow we calculate critical exponents of the directed percolation
process. In the limit of the purely transversal velocity field random force
critical exponents comply with the incompressible results obtained by previous
authors. We have found intriguing non-universal behavior related to the mutual
effect of compressibility and advection.
| cond-mat.stat-mech | universal behavior is a typical emergent feature of critical systems a paramount model of the nonequilibrium critical behavior is the directed bond percolation process that exhibits an active toabsorbing state phase transition in the vicinity of a percolation threshold fluctuations of the ambient environment might affect or destroy the universality properties completely in this work we assume that the random environment can be described by means of compressible velocity fluctu ations using fieldtheoretic models and renormalization group methods we investigate largescale and longtime behavior altogether eleven universality classes are found out of which four are stable in the infrared limit and thus macroscopically accessible in contrast to the model without veloc ity fluctuations a possible candidate for a realistic threedimensional case a regime with relevant shortrange noise is identified depending on the dimensionality of space and the structure of the turbulent flow we calculate critical exponents of the directed percolation process in the limit of the purely transversal velocity field random force critical exponents comply with the incompressible results obtained by previous authors we have found intriguing nonuniversal behavior related to the mutual effect of compressibility and advection | [['universal', 'behavior', 'is', 'a', 'typical', 'emergent', 'feature', 'of', 'critical', 'systems', 'a', 'paramount', 'model', 'of', 'the', 'nonequilibrium', 'critical', 'behavior', 'is', 'the', 'directed', 'bond', 'percolation', 'process', 'that', 'exhibits', 'an', 'active', 'toabsorbing', 'state', 'phase', 'transition', 'in', 'the', 'vicinity', 'of', 'a', 'percolation', 'threshold', 'fluctuations', 'of', 'the', 'ambient', 'environment', 'might', 'affect', 'or', 'destroy', 'the', 'universality', 'properties', 'completely', 'in', 'this', 'work', 'we', 'assume', 'that', 'the', 'random', 'environment', 'can', 'be', 'described', 'by', 'means', 'of', 'compressible', 'velocity', 'fluctu', 'ations', 'using', 'fieldtheoretic', 'models', 'and', 'renormalization', 'group', 'methods', 'we', 'investigate', 'largescale', 'and', 'longtime', 'behavior', 'altogether', 'eleven', 'universality', 'classes', 'are', 'found', 'out', 'of', 'which', 'four', 'are', 'stable', 'in', 'the', 'infrared', 'limit', 'and', 'thus', 'macroscopically', 'accessible', 'in', 'contrast', 'to', 'the', 'model', 'without', 'veloc', 'ity', 'fluctuations', 'a', 'possible', 'candidate', 'for', 'a', 'realistic', 'threedimensional', 'case', 'a', 'regime', 'with', 'relevant', 'shortrange', 'noise', 'is', 'identified', 'depending', 'on', 'the', 'dimensionality', 'of', 'space', 'and', 'the', 'structure', 'of', 'the', 'turbulent', 'flow', 'we', 'calculate', 'critical', 'exponents', 'of', 'the', 'directed', 'percolation', 'process', 'in', 'the', 'limit', 'of', 'the', 'purely', 'transversal', 'velocity', 'field', 'random', 'force', 'critical', 'exponents', 'comply', 'with', 'the', 'incompressible', 'results', 'obtained', 'by', 'previous', 'authors', 'we', 'have', 'found', 'intriguing', 'nonuniversal', 'behavior', 'related', 'to', 'the', 'mutual', 'effect', 'of', 'compressibility', 'and', 'advection']] | [-0.1673897531940364, 0.20194568452045072, -0.10184063199501965, 0.05218953398248867, -0.020250907042614556, -0.13045435405827016, 0.04547533478527781, 0.32265123318985944, -0.2552353687939905, -0.25163088286776214, 0.07309868503099066, -0.2806050668439893, -0.1718358857149098, 0.1533569986581482, 0.017435149224575168, 0.07845043994346133, -0.01916766108761001, 0.028699203727326247, -0.05273706607566896, -0.18643512418844127, 0.34430653683062623, 0.040469346818343924, 0.3170641930448392, 0.04154738343836519, 0.03870491237099212, -0.030132597687864495, 0.009950658291458123, 0.09060536657184017, -0.16562143723789904, 0.028519284628551973, 0.18930645536353843, -0.002854509356742104, 0.21754718865630948, -0.384232299307221, -0.2721041910530579, 0.11445673407300785, 0.17125120681775632, 0.11224600586912505, -0.009310789736768892, -0.28928982855887303, 0.05480241862010531, -0.14845852730720635, -0.18031516792603158, -0.07278515058519539, 0.01941716268731241, 0.025852703909960487, -0.24381819685266393, 0.13267093761924215, 0.07687219816024705, 0.0796395683290577, -0.06018333937672357, -0.06701634886864853, -0.022441013845094348, 0.14909777384356507, 0.04126505785019598, 0.002858367220308351, 0.1803615629718068, -0.19036220169440912, -0.10859087123084933, 0.3883523853215319, -0.04381656019619205, -0.15919921794025008, 0.22207613205111595, -0.16817014168707595, -0.13470524333677786, 0.15778227529854022, 0.16804883710073648, 0.09217179235902125, -0.13948584757701454, 0.07314553562904895, -0.017887262912887718, 0.14863201389740152, -0.014531867742608551, 0.00405866514030163, 0.2061105345173048, 0.174350491709887, 0.039775792110000326, 0.16951113839205656, -0.0716537126109645, -0.15689649410271686, -0.2857972623690242, -0.12249574643404533, -0.18410310258848533, 0.07144506689835771, -0.11396657103590944, -0.1860017636540516, 0.3666462118071454, 0.19988096189705196, 0.20734469309716938, 0.020874263480260606, 0.2170744159344023, 0.12348505556933902, 0.019761154430627984, 0.08357519599714226, 0.2641133141343392, 0.12362217287512957, 0.10571955422300004, -0.22205192310565341, 0.09786199394022665, 0.08563900163136823] |
1,802.02037 | Unsteady heat conduction processes in a harmonic crystal with a
substrate potential | An analytical model of high frequency oscillations of the kinetic and
potential energies in a one-dimensional harmonic crystal with a substrate
potential is obtained by introducing the nonlocal energies [1]. A
generalization of the kinetic temperature (nonlocal temperature) is adopted to
derive a closed equation determining the heat propagation processes in the
harmonic crystal with a substrate potential.
| cond-mat.stat-mech cond-mat.mes-hall | an analytical model of high frequency oscillations of the kinetic and potential energies in a onedimensional harmonic crystal with a substrate potential is obtained by introducing the nonlocal energies 1 a generalization of the kinetic temperature nonlocal temperature is adopted to derive a closed equation determining the heat propagation processes in the harmonic crystal with a substrate potential | [['an', 'analytical', 'model', 'of', 'high', 'frequency', 'oscillations', 'of', 'the', 'kinetic', 'and', 'potential', 'energies', 'in', 'a', 'onedimensional', 'harmonic', 'crystal', 'with', 'a', 'substrate', 'potential', 'is', 'obtained', 'by', 'introducing', 'the', 'nonlocal', 'energies', '1', 'a', 'generalization', 'of', 'the', 'kinetic', 'temperature', 'nonlocal', 'temperature', 'is', 'adopted', 'to', 'derive', 'a', 'closed', 'equation', 'determining', 'the', 'heat', 'propagation', 'processes', 'in', 'the', 'harmonic', 'crystal', 'with', 'a', 'substrate', 'potential']] | [-0.13982414168000606, 0.17180654951918203, -0.0582222657213951, 0.01419640164260335, -0.04819507845516863, -0.14706687043934805, 0.057043695726014414, 0.3533035796777955, -0.26466076125406884, -0.2548242624014102, -0.0076688007363278805, -0.2744161346284994, -0.07402716547347091, 0.184517757999229, 0.07310666598315382, 0.05239338074521772, 0.002287985707253342, 0.03387414018527187, -0.05447212028606185, -0.12489787925933969, 0.2823275954398359, 0.12647683186263875, 0.26356252687501497, 0.1311583509508135, 0.13639096829815414, -0.03286573209735597, 0.06950999474441953, 0.008297280151525447, -0.17986261342669202, 0.07802726953001372, 0.19199293736239958, -0.0788347283859962, 0.2695440812164853, -0.43782422197019233, -0.32838430832108034, 0.08003037835567675, 0.06738788796315805, 0.15924705953562054, -0.10932555948865824, -0.2324064338081998, -0.0485415473612475, -0.12258818019823782, -0.21519305964064753, -0.04068481364961842, -0.0019440019406892102, 0.08210989514943855, -0.2829138272088663, 0.14148690811647424, 0.053327110885032294, 0.04942080621122873, -0.11743077796337933, -0.09628915765065828, -0.07661590882544887, 0.02113033428884529, -0.016227592403020966, 0.04888781136833131, 0.13206606576668806, -0.1259067741238737, -0.07722464102673633, 0.3937472490401104, -0.13135470763844406, -0.23275420331428276, 0.1464574858546257, -0.13213351431678066, -0.018889362939858233, 0.1687871310217627, 0.1268638100551345, 0.06815195499501865, -0.23229196226697993, 0.10620951198808175, 0.05795433450136976, 0.15712053328300907, 0.08074307695416541, -0.028743942541166627, 0.19068114055673882, 0.21374231535170612, 0.01964854206568722, 0.1633894070982933, -0.0810745516470794, -0.07171071621043415, -0.3016393006747139, -0.15240876251382046, -0.20858921003849085, 0.08174807989391787, -0.12090520709246229, -0.2088194313491213, 0.43360183303694017, 0.07777310493562756, 0.1653753650727971, 0.013965275186788419, 0.25152744500544566, 0.22142340366503802, 0.03938092866205964, 0.024267068453903855, 0.2454908819837046, 0.22186668179046107, 0.13788114133660265, -0.2738358207099172, -0.051166469797267224, 0.06646248571382] |
1,802.02038 | Elastic Purcell effect | In this work, we introduce an elastic analog of the Purcell effect and show
theoretically that spherical nanoparticles can serve as tunable and robust
antennas for modifying the emission from localized elastic sources. This effect
can be qualitatively described by introducing elastic counterparts of the
familiar electromagnetic parameters: local density of elastic states, elastic
Purcell factor, and effective volume of elastic modes. To illustrate our
framework, we consider the example of a submicron gold sphere as a generic
elastic GHz antenna and find that shear and mixed modes of low orders in such
systems offer considerable elastic Purcell factors. This formalism opens
pathways towards extended control over dissipation of vibrations in various
optomechanical systems and contributes to closing the gap between classical and
quantum-mechanical treatments of phonons localized in elastic nanoresonators.
| physics.class-ph cond-mat.mes-hall physics.app-ph | in this work we introduce an elastic analog of the purcell effect and show theoretically that spherical nanoparticles can serve as tunable and robust antennas for modifying the emission from localized elastic sources this effect can be qualitatively described by introducing elastic counterparts of the familiar electromagnetic parameters local density of elastic states elastic purcell factor and effective volume of elastic modes to illustrate our framework we consider the example of a submicron gold sphere as a generic elastic ghz antenna and find that shear and mixed modes of low orders in such systems offer considerable elastic purcell factors this formalism opens pathways towards extended control over dissipation of vibrations in various optomechanical systems and contributes to closing the gap between classical and quantummechanical treatments of phonons localized in elastic nanoresonators | [['in', 'this', 'work', 'we', 'introduce', 'an', 'elastic', 'analog', 'of', 'the', 'purcell', 'effect', 'and', 'show', 'theoretically', 'that', 'spherical', 'nanoparticles', 'can', 'serve', 'as', 'tunable', 'and', 'robust', 'antennas', 'for', 'modifying', 'the', 'emission', 'from', 'localized', 'elastic', 'sources', 'this', 'effect', 'can', 'be', 'qualitatively', 'described', 'by', 'introducing', 'elastic', 'counterparts', 'of', 'the', 'familiar', 'electromagnetic', 'parameters', 'local', 'density', 'of', 'elastic', 'states', 'elastic', 'purcell', 'factor', 'and', 'effective', 'volume', 'of', 'elastic', 'modes', 'to', 'illustrate', 'our', 'framework', 'we', 'consider', 'the', 'example', 'of', 'a', 'submicron', 'gold', 'sphere', 'as', 'a', 'generic', 'elastic', 'ghz', 'antenna', 'and', 'find', 'that', 'shear', 'and', 'mixed', 'modes', 'of', 'low', 'orders', 'in', 'such', 'systems', 'offer', 'considerable', 'elastic', 'purcell', 'factors', 'this', 'formalism', 'opens', 'pathways', 'towards', 'extended', 'control', 'over', 'dissipation', 'of', 'vibrations', 'in', 'various', 'optomechanical', 'systems', 'and', 'contributes', 'to', 'closing', 'the', 'gap', 'between', 'classical', 'and', 'quantummechanical', 'treatments', 'of', 'phonons', 'localized', 'in', 'elastic', 'nanoresonators']] | [-0.1493742013819345, 0.1958285271891487, -0.060111247763777055, 0.026514303698764317, -0.040624020740261856, -0.11066867797528855, 0.0536110628936582, 0.39065949718880233, -0.274726941118742, -0.2852589757473187, -0.01962153005275079, -0.2703407210909285, -0.20638108096807087, 0.1886052344890155, 0.00519032784180175, 0.06944844260179076, 0.0011747644810745394, -0.0815323869011699, -0.016461552291369166, -0.11171290589379189, 0.2771150211462367, 0.07992833227857606, 0.3195583165715669, 0.08965435586443157, 0.0643774911526676, 0.05105517380728692, 0.03497750633431755, 0.042923995384320845, -0.12929081207886428, 0.14127900868517396, 0.2993559309544454, -0.03219340769183033, 0.2159848673596182, -0.4842419738931055, -0.24139684299717992, 0.04356733139760735, 0.1579626076916972, 0.16553808874024065, -0.00778526748985564, -0.26349444776944075, 0.013280541998625712, -0.18690831343712683, -0.16503209011977582, -0.10643414681411227, 0.008443382088777446, 0.008890146546008932, -0.2270309198438901, 0.11872007908501292, 0.06381813124913495, 0.03800428447576652, -0.10745457483931864, -0.09245809428536027, 0.020214527851603357, 0.04496152528725166, 0.03988321575439244, -0.0403062054311558, 0.2195142519425686, -0.11950848967313255, -0.12462594684298711, 0.39406385307577046, -0.06704070379260842, -0.17828719108187743, 0.16988303104970065, -0.09125839383874572, -0.0035316800051688694, 0.16545945245644633, 0.24099933898488757, 0.06585862852263315, -0.13563261428076545, 0.05253733275352687, 0.023692543858321, 0.162212171552717, 0.1197580399332952, 0.1019712082529796, 0.20349873603101223, 0.19926942400065542, 0.02268675249069929, 0.21831695469076753, -0.07777790965837647, -0.012888948920090463, -0.2901064234302301, -0.15251161971284216, -0.16662632613904946, 0.08304320966099737, -0.09525820613618342, -0.17030584822428405, 0.3481385306391211, 0.08515407653784962, 0.146476473310031, 0.024163247999656974, 0.29746169837561387, 0.09228100153112798, 0.09951312054403638, 0.04147946032986955, 0.3564702576268038, 0.15871730489293753, 0.05091533631722635, -0.26846664268630094, -0.0072684879414737225, -0.04234526983021496] |
1,802.02039 | Combined Oxy-fuel Magnetohydrodynamic Power Cycle | Oxy-fuel carbon capture in power plants is a relatively new concept aiming at
reducing carbon dioxide emissions from the plants. This is achieved by burning
the fossil fuel using oxygen as oxidizer with no nitrogen, thereby rendering
the exhaust gases very rich in carbon dioxide (after condensing water vapor by
cooling), which facilitates its capture for environmental or commercial
purposes. Despite the worldwide interest in oxy-fuel carbon capture, its
progress is at risk given the large energy needed to separate oxygen from air
in order to provide the oxidizer, thereby hindering further progress of this
concept toward large-scale applications. This paper focuses on alleviating this
drawback of oxy-fuel combustion by making it more attractive through combining
it with another concept, namely magnetohydrodynamic (MHD) power generators. The
end product is a power plant operating on a combined cycle composed of a
topping MHD ultra-high-temperature cycle with direct electricity extraction
from plasma, followed by a bottoming steam cycle with conventional
turbo-generators. Different design aspects and simplified technical analysis
for the MHD generator are presented.
| physics.app-ph | oxyfuel carbon capture in power plants is a relatively new concept aiming at reducing carbon dioxide emissions from the plants this is achieved by burning the fossil fuel using oxygen as oxidizer with no nitrogen thereby rendering the exhaust gases very rich in carbon dioxide after condensing water vapor by cooling which facilitates its capture for environmental or commercial purposes despite the worldwide interest in oxyfuel carbon capture its progress is at risk given the large energy needed to separate oxygen from air in order to provide the oxidizer thereby hindering further progress of this concept toward largescale applications this paper focuses on alleviating this drawback of oxyfuel combustion by making it more attractive through combining it with another concept namely magnetohydrodynamic mhd power generators the end product is a power plant operating on a combined cycle composed of a topping mhd ultrahightemperature cycle with direct electricity extraction from plasma followed by a bottoming steam cycle with conventional turbogenerators different design aspects and simplified technical analysis for the mhd generator are presented | [['oxyfuel', 'carbon', 'capture', 'in', 'power', 'plants', 'is', 'a', 'relatively', 'new', 'concept', 'aiming', 'at', 'reducing', 'carbon', 'dioxide', 'emissions', 'from', 'the', 'plants', 'this', 'is', 'achieved', 'by', 'burning', 'the', 'fossil', 'fuel', 'using', 'oxygen', 'as', 'oxidizer', 'with', 'no', 'nitrogen', 'thereby', 'rendering', 'the', 'exhaust', 'gases', 'very', 'rich', 'in', 'carbon', 'dioxide', 'after', 'condensing', 'water', 'vapor', 'by', 'cooling', 'which', 'facilitates', 'its', 'capture', 'for', 'environmental', 'or', 'commercial', 'purposes', 'despite', 'the', 'worldwide', 'interest', 'in', 'oxyfuel', 'carbon', 'capture', 'its', 'progress', 'is', 'at', 'risk', 'given', 'the', 'large', 'energy', 'needed', 'to', 'separate', 'oxygen', 'from', 'air', 'in', 'order', 'to', 'provide', 'the', 'oxidizer', 'thereby', 'hindering', 'further', 'progress', 'of', 'this', 'concept', 'toward', 'largescale', 'applications', 'this', 'paper', 'focuses', 'on', 'alleviating', 'this', 'drawback', 'of', 'oxyfuel', 'combustion', 'by', 'making', 'it', 'more', 'attractive', 'through', 'combining', 'it', 'with', 'another', 'concept', 'namely', 'magnetohydrodynamic', 'mhd', 'power', 'generators', 'the', 'end', 'product', 'is', 'a', 'power', 'plant', 'operating', 'on', 'a', 'combined', 'cycle', 'composed', 'of', 'a', 'topping', 'mhd', 'ultrahightemperature', 'cycle', 'with', 'direct', 'electricity', 'extraction', 'from', 'plasma', 'followed', 'by', 'a', 'bottoming', 'steam', 'cycle', 'with', 'conventional', 'turbogenerators', 'different', 'design', 'aspects', 'and', 'simplified', 'technical', 'analysis', 'for', 'the', 'mhd', 'generator', 'are', 'presented']] | [-0.04737645426569451, 0.14931907851287554, 0.0084734083023804, -0.01724450537292893, -0.012438533769799231, -0.1070172345932551, 0.07091302711298943, 0.3551617163845156, -0.23752261136145986, -0.297651560525217, 0.1433273800648749, -0.26779627528409444, -0.07017165514263021, 0.23302281677541076, -0.08547891441390977, 0.0221227623085552, 0.09167717457556072, -0.04881957159139982, -0.009315008716382219, -0.17787850457216067, 0.26071310569890416, 0.15205918128062149, 0.29906800880300755, 0.063824159288834, 0.08406530384293939, -0.06841475825023854, -0.06633510692430848, -0.029961215294952666, -0.0909790892539561, 0.14120998530863568, 0.2937500318994514, 0.11770226634052422, 0.29757677338819005, -0.5143584967012236, -0.2700568012309057, 0.07334356393097465, 0.08289030674547399, 0.09067933728640139, -0.10018783250106182, -0.1884040714120327, 0.03923416804982426, -0.22602884079599697, -0.13136028785936357, -0.04426685376740309, 0.0004506736922149475, 0.01405380623271832, -0.23989018062804687, 0.013741079403759812, 0.0515262075567607, 0.10392654895060557, -0.01792817814799147, -0.11403840406075913, -0.0726795925194957, 0.11633111115892214, 0.04639257480164428, -0.035004518359910544, 0.20763984908137648, -0.1268869859508112, -0.03487314410871391, 0.43137432906787687, -0.049046494615727146, -0.09861077576291544, 0.22299375168472177, -0.08385926136780067, -0.147553866607903, 0.21150055997756986, 0.14306567191592687, 0.06726916424775793, -0.1859701051653677, 0.01011822171772406, 0.023170126238341866, 0.1452516634416761, 0.10011792646241567, -0.016335612931013238, 0.27292157272317796, 0.2991426087497078, 0.08694597814485606, 0.1552164186530653, -0.06997306976183565, -0.06422164502275347, -0.19735665628879426, -0.15967386055526947, -0.10741616377590456, 0.07402024606584444, -0.0409759618373782, -0.13791281966349253, 0.37115514825081686, 0.12098196210179853, 0.10858653927739909, -0.026087175303871727, 0.3837427634789923, 0.06385019702834116, 0.0760715623105843, 0.05800192770768596, 0.21741057671716757, 0.12176379802245536, 0.17311351154186932, -0.23920659668131913, 0.11794304315651045, 0.05270514835344528] |
1,802.0204 | Multispectral Compressive Imaging Strategies using Fabry-P\'erot
Filtered Sensors | This paper introduces two acquisition device architectures for multispectral
compressive imaging. Unlike most existing methods, the proposed computational
imaging techniques do not include any dispersive element, as they use a
dedicated sensor which integrates narrowband Fabry-P\'erot spectral filters at
the pixel level. The first scheme leverages joint inpainting and
super-resolution to fill in those voxels that are missing due to the device's
limited pixel count. The second scheme, in link with compressed sensing,
introduces spatial random convolutions, but is more complex and may be affected
by diffraction. In both cases we solve the associated inverse problems by using
the same signal prior. Specifically, we propose a redundant analysis signal
prior in a convex formulation. Through numerical simulations, we explore
different realistic setups. Our objective is also to highlight some practical
guidelines and discuss their complexity trade-offs to integrate these schemes
into actual computational imaging systems. Our conclusion is that the second
technique performs best at high compression levels, in a properly sized and
calibrated setup. Otherwise, the first, simpler technique should be favored.
| cs.CV eess.IV | this paper introduces two acquisition device architectures for multispectral compressive imaging unlike most existing methods the proposed computational imaging techniques do not include any dispersive element as they use a dedicated sensor which integrates narrowband fabryperot spectral filters at the pixel level the first scheme leverages joint inpainting and superresolution to fill in those voxels that are missing due to the devices limited pixel count the second scheme in link with compressed sensing introduces spatial random convolutions but is more complex and may be affected by diffraction in both cases we solve the associated inverse problems by using the same signal prior specifically we propose a redundant analysis signal prior in a convex formulation through numerical simulations we explore different realistic setups our objective is also to highlight some practical guidelines and discuss their complexity tradeoffs to integrate these schemes into actual computational imaging systems our conclusion is that the second technique performs best at high compression levels in a properly sized and calibrated setup otherwise the first simpler technique should be favored | [['this', 'paper', 'introduces', 'two', 'acquisition', 'device', 'architectures', 'for', 'multispectral', 'compressive', 'imaging', 'unlike', 'most', 'existing', 'methods', 'the', 'proposed', 'computational', 'imaging', 'techniques', 'do', 'not', 'include', 'any', 'dispersive', 'element', 'as', 'they', 'use', 'a', 'dedicated', 'sensor', 'which', 'integrates', 'narrowband', 'fabryperot', 'spectral', 'filters', 'at', 'the', 'pixel', 'level', 'the', 'first', 'scheme', 'leverages', 'joint', 'inpainting', 'and', 'superresolution', 'to', 'fill', 'in', 'those', 'voxels', 'that', 'are', 'missing', 'due', 'to', 'the', 'devices', 'limited', 'pixel', 'count', 'the', 'second', 'scheme', 'in', 'link', 'with', 'compressed', 'sensing', 'introduces', 'spatial', 'random', 'convolutions', 'but', 'is', 'more', 'complex', 'and', 'may', 'be', 'affected', 'by', 'diffraction', 'in', 'both', 'cases', 'we', 'solve', 'the', 'associated', 'inverse', 'problems', 'by', 'using', 'the', 'same', 'signal', 'prior', 'specifically', 'we', 'propose', 'a', 'redundant', 'analysis', 'signal', 'prior', 'in', 'a', 'convex', 'formulation', 'through', 'numerical', 'simulations', 'we', 'explore', 'different', 'realistic', 'setups', 'our', 'objective', 'is', 'also', 'to', 'highlight', 'some', 'practical', 'guidelines', 'and', 'discuss', 'their', 'complexity', 'tradeoffs', 'to', 'integrate', 'these', 'schemes', 'into', 'actual', 'computational', 'imaging', 'systems', 'our', 'conclusion', 'is', 'that', 'the', 'second', 'technique', 'performs', 'best', 'at', 'high', 'compression', 'levels', 'in', 'a', 'properly', 'sized', 'and', 'calibrated', 'setup', 'otherwise', 'the', 'first', 'simpler', 'technique', 'should', 'be', 'favored']] | [-0.07556943931819392, 0.03695449277198728, -0.07226890497814024, 0.059816007299154914, -0.10378113986030651, -0.18984343537339413, 0.02467783453882365, 0.46393473361311965, -0.28183505076960785, -0.3199307142482328, 0.11813109327104976, -0.24170061107724905, -0.18289598859738926, 0.19273957651649531, -0.14214089209741423, 0.09104926141774325, 0.09199425009633765, -0.0478445877929385, -0.0819814189107055, -0.23804737831266715, 0.26486371667931835, 0.07019247642766706, 0.3260201281151934, -0.0047552389081976666, 0.09720096498865075, 0.007776253735592772, -0.08976330904214713, 0.012049999308167681, -0.08130212848364426, 0.13159978500099023, 0.3148324977689977, 0.1528763594155783, 0.30489335540746676, -0.46173717920275437, -0.26353351679641346, 0.06557671564248944, 0.16690239469612264, 0.1114739607716776, -0.053188027643529305, -0.2535964595638431, 0.09719234388698474, -0.13000645795083374, -0.02846404561909882, -0.09579716320015016, -0.09565961286102588, -0.0020068748988684893, -0.28877564398518013, 0.05417682100582001, 0.021691268463376802, 0.010975118357731255, -0.04258763461652672, -0.12172694644228571, 0.08132621658847511, 0.10789309634835152, -0.04407727801660883, -0.008316734683736244, 0.12375472106491726, -0.11146625146442066, -0.1138866170803408, 0.3679086914275251, 0.002442329002253582, -0.2332356477067456, 0.20158418567415132, -0.11097175108451891, -0.14791195663338194, 0.15668887884969784, 0.18110391971314693, 0.10445757338109647, -0.14984942424969716, 0.04195251435746649, 0.010906285347250112, 0.20638747137669755, 0.07323012066563603, 0.05279479743818607, 0.1514513185732282, 0.2046224067870506, 0.0867301139669665, 0.1354567609401689, -0.15615059498117462, -0.031859640472143284, -0.24751061877246536, -0.1190450809319972, -0.2087754170394185, -0.04966639666109833, -0.07765726665690315, -0.10911033995317651, 0.3602185106966722, 0.22834916532139235, 0.1746540840935888, 0.03666008904918146, 0.43137266104664074, 0.07420448479282998, 0.10835253698461975, 0.027128783296901368, 0.20414488120061733, 0.09090100424820954, 0.1347702400855763, -0.16516654660643987, 0.03351563599897344, 0.013133885865126645] |
1,802.02041 | A Survey on Sensor-based Threats to Internet-of-Things (IoT) Devices and
Applications | The concept of Internet of Things (IoT) has become more popular in the modern
era of technology than ever before. From small household devices to large
industrial machines, the vision of IoT has made it possible to connect the
devices with the physical world around them. This increasing popularity has
also made the IoT devices and applications in the center of attention among
attackers. Already, several types of malicious activities exist that attempt to
compromise the security and privacy of the IoT devices. One interesting
emerging threat vector is the attacks that abuse the use of sensors on IoT
devices. IoT devices are vulnerable to sensor-based threats due to the lack of
proper security measurements available to control use of sensors by apps. By
exploiting the sensors (e.g., accelerometer, gyroscope, microphone, light
sensor, etc.) on an IoT device, attackers can extract information from the
device, transfer malware to a device, or trigger a malicious activity to
compromise the device. In this survey, we explore various threats targeting IoT
devices and discuss how their sensors can be abused for malicious purposes.
Specifically, we present a detailed survey about existing sensor-based threats
to IoT devices and countermeasures that are developed specifically to secure
the sensors of IoT devices. Furthermore, we discuss security and privacy issues
of IoT devices in the context of sensor-based threats and conclude with future
research directions.
| cs.CR | the concept of internet of things iot has become more popular in the modern era of technology than ever before from small household devices to large industrial machines the vision of iot has made it possible to connect the devices with the physical world around them this increasing popularity has also made the iot devices and applications in the center of attention among attackers already several types of malicious activities exist that attempt to compromise the security and privacy of the iot devices one interesting emerging threat vector is the attacks that abuse the use of sensors on iot devices iot devices are vulnerable to sensorbased threats due to the lack of proper security measurements available to control use of sensors by apps by exploiting the sensors eg accelerometer gyroscope microphone light sensor etc on an iot device attackers can extract information from the device transfer malware to a device or trigger a malicious activity to compromise the device in this survey we explore various threats targeting iot devices and discuss how their sensors can be abused for malicious purposes specifically we present a detailed survey about existing sensorbased threats to iot devices and countermeasures that are developed specifically to secure the sensors of iot devices furthermore we discuss security and privacy issues of iot devices in the context of sensorbased threats and conclude with future research directions | [['the', 'concept', 'of', 'internet', 'of', 'things', 'iot', 'has', 'become', 'more', 'popular', 'in', 'the', 'modern', 'era', 'of', 'technology', 'than', 'ever', 'before', 'from', 'small', 'household', 'devices', 'to', 'large', 'industrial', 'machines', 'the', 'vision', 'of', 'iot', 'has', 'made', 'it', 'possible', 'to', 'connect', 'the', 'devices', 'with', 'the', 'physical', 'world', 'around', 'them', 'this', 'increasing', 'popularity', 'has', 'also', 'made', 'the', 'iot', 'devices', 'and', 'applications', 'in', 'the', 'center', 'of', 'attention', 'among', 'attackers', 'already', 'several', 'types', 'of', 'malicious', 'activities', 'exist', 'that', 'attempt', 'to', 'compromise', 'the', 'security', 'and', 'privacy', 'of', 'the', 'iot', 'devices', 'one', 'interesting', 'emerging', 'threat', 'vector', 'is', 'the', 'attacks', 'that', 'abuse', 'the', 'use', 'of', 'sensors', 'on', 'iot', 'devices', 'iot', 'devices', 'are', 'vulnerable', 'to', 'sensorbased', 'threats', 'due', 'to', 'the', 'lack', 'of', 'proper', 'security', 'measurements', 'available', 'to', 'control', 'use', 'of', 'sensors', 'by', 'apps', 'by', 'exploiting', 'the', 'sensors', 'eg', 'accelerometer', 'gyroscope', 'microphone', 'light', 'sensor', 'etc', 'on', 'an', 'iot', 'device', 'attackers', 'can', 'extract', 'information', 'from', 'the', 'device', 'transfer', 'malware', 'to', 'a', 'device', 'or', 'trigger', 'a', 'malicious', 'activity', 'to', 'compromise', 'the', 'device', 'in', 'this', 'survey', 'we', 'explore', 'various', 'threats', 'targeting', 'iot', 'devices', 'and', 'discuss', 'how', 'their', 'sensors', 'can', 'be', 'abused', 'for', 'malicious', 'purposes', 'specifically', 'we', 'present', 'a', 'detailed', 'survey', 'about', 'existing', 'sensorbased', 'threats', 'to', 'iot', 'devices', 'and', 'countermeasures', 'that', 'are', 'developed', 'specifically', 'to', 'secure', 'the', 'sensors', 'of', 'iot', 'devices', 'furthermore', 'we', 'discuss', 'security', 'and', 'privacy', 'issues', 'of', 'iot', 'devices', 'in', 'the', 'context', 'of', 'sensorbased', 'threats', 'and', 'conclude', 'with', 'future', 'research', 'directions']] | [-0.2157828085917955, 0.010851110758123565, -0.013997943540871666, 0.027278403303761592, -0.15307727686881104, -0.24496100464909287, 0.06757961963650591, 0.3659041235202989, -0.2482518385401355, -0.354811378217531, 0.14591019459501758, -0.3832602110842504, -0.16720287113250315, 0.24799366964113065, -0.20109210289982066, 0.08629810104653109, 0.0211384377877326, 0.010350394405816732, 0.04877076419392037, -0.2836142422615044, 0.31657151664452005, 0.03573427814786045, 0.36380169469569074, 0.09123058545631929, 0.04788059581991738, -0.03427750137052499, -0.027739309835995204, -0.04311160001037806, -0.07270996992025303, 0.17168441102349838, 0.39250484597460744, 0.23325907459145942, 0.37232039855556204, -0.5073419568545529, -0.20695922821515092, 0.09067809156125836, 0.15262328667519973, 0.09210537933017406, -0.10275600043059328, -0.3911578692945145, 0.18152949204152702, -0.29376457805598255, -0.12281661658900639, -0.060215998250018936, 0.051365961633181495, 0.06468569938289492, -0.14729619197743504, -0.10506836000307598, -0.057503397122082675, 0.09252861153187328, -0.010191730281931405, -0.03384645234817933, 0.0014955585900583844, 0.19913180335322722, 0.07693795970612484, -0.08410382493891295, 0.28521524930246206, -0.191051920177415, -0.15592704180693417, 0.3320409483358003, 0.08055588302963052, -0.1006792874908761, 0.16410831133058915, -0.010913782310876342, -0.13287675451168693, 0.030946930953640525, 0.25971389600288186, 0.0443707729619315, -0.22410933771007285, 0.01309188784420768, 0.08213103705049052, 0.16743559405930633, 0.03445783339689992, 0.12946671569513632, 0.23066931759954937, 0.21688025562999477, 0.15676804429753438, 0.09059054407101173, -0.09307320134955757, -0.0342776955275392, -0.18680260529467968, -0.1622826251193162, -0.17199829373337133, 0.06194009067359985, -0.05553520027470975, -0.1092650804734021, 0.36592070331078086, 0.298503232112955, 0.11626964848766332, -0.029506838749767395, 0.46053226095248473, -0.029282280048375884, 0.1784254924992606, 0.08334916441194844, 0.21124695601521812, 0.012659661208377465, 0.26711711427605334, -0.10244475554020283, 0.1430141700844264, -0.11363937493093033] |
1,802.02042 | Local to global principle for the moduli space of K3 surfaces | Recently S. Patrikis, J.F. Voloch and Y. Zarhin have proven, assuming several
well known conjectures, that the finite descent obstruction holds on the moduli
space of principally polarised abelian varieties. We show an analogous result
for K3 surfaces, under some technical restrictions. This is possible since
abelian varieties and K3s are quite well described by `Hodge-theoretical'
results. In particular the theorem we present can be interpreted as follows: a
family of $\ell$-adic representations that looks like the one induced by the
transcendental part of the $\ell$-adic cohomology of a K3 surface (defined over
a number field) determines a Hodge structure which in turn determines a K3
surface (which may be defined over a number field).
| math.NT math.AG | recently s patrikis jf voloch and y zarhin have proven assuming several well known conjectures that the finite descent obstruction holds on the moduli space of principally polarised abelian varieties we show an analogous result for k3 surfaces under some technical restrictions this is possible since abelian varieties and k3s are quite well described by hodgetheoretical results in particular the theorem we present can be interpreted as follows a family of elladic representations that looks like the one induced by the transcendental part of the elladic cohomology of a k3 surface defined over a number field determines a hodge structure which in turn determines a k3 surface which may be defined over a number field | [['recently', 's', 'patrikis', 'jf', 'voloch', 'and', 'y', 'zarhin', 'have', 'proven', 'assuming', 'several', 'well', 'known', 'conjectures', 'that', 'the', 'finite', 'descent', 'obstruction', 'holds', 'on', 'the', 'moduli', 'space', 'of', 'principally', 'polarised', 'abelian', 'varieties', 'we', 'show', 'an', 'analogous', 'result', 'for', 'k3', 'surfaces', 'under', 'some', 'technical', 'restrictions', 'this', 'is', 'possible', 'since', 'abelian', 'varieties', 'and', 'k3s', 'are', 'quite', 'well', 'described', 'by', 'hodgetheoretical', 'results', 'in', 'particular', 'the', 'theorem', 'we', 'present', 'can', 'be', 'interpreted', 'as', 'follows', 'a', 'family', 'of', 'elladic', 'representations', 'that', 'looks', 'like', 'the', 'one', 'induced', 'by', 'the', 'transcendental', 'part', 'of', 'the', 'elladic', 'cohomology', 'of', 'a', 'k3', 'surface', 'defined', 'over', 'a', 'number', 'field', 'determines', 'a', 'hodge', 'structure', 'which', 'in', 'turn', 'determines', 'a', 'k3', 'surface', 'which', 'may', 'be', 'defined', 'over', 'a', 'number', 'field']] | [-0.20098502615709668, 0.12001056231510239, -0.15091004852691423, 0.11707855795064698, -0.09304515332307504, -0.13750497154567554, -0.026056195712526854, 0.3007947986378618, -0.31802697466767355, -0.26157420486940636, 0.10490583481631525, -0.17532473300664644, -0.167490031975119, 0.2722498241528545, -0.17927635313700074, -0.03494484660256168, -0.00899372061147638, 0.06905059686902425, -0.06078306553612018, -0.3538814000765105, 0.39818416626557057, -0.058468016917290894, 0.2331251864483499, 0.09059534758106684, 0.08764855885149345, 0.023595868688805595, -0.015240477049804252, 0.003678925831184682, -0.09945728920220458, 0.10314843171407752, 0.3277143850963077, 0.05059597509427239, 0.15769114149329455, -0.3765189232223708, -0.19780277288626405, 0.18682636998128146, 0.11088520421497221, 0.05200246259691599, -0.018156167938697922, -0.23831241449098226, 0.06999550150788349, -0.1492388526018223, -0.19397859200025383, -0.09464566778472584, 0.038801469993980035, 0.04551621902855518, -0.19935324338477348, -0.0435472352511209, 0.10276343649779648, 0.13901798689494962, -0.06218638207722941, -0.1471371026345245, -0.10603360454754338, 0.02488694382507516, 0.052532452310475965, 0.09348391547353695, 0.09232338943680668, -0.1284548880836076, -0.09577856085708608, 0.35688825629641424, -0.11126200048981802, -0.18138542957603931, 0.11401912663131952, -0.1280117303861872, -0.15695455519320525, 0.14830037063878515, 0.05718992357344731, 0.20677724489739732, 0.00586965983763904, 0.1874132614613779, -0.17280763352451764, 0.07396756003651282, 0.13553975935134552, -0.014521885934569266, 0.16217275115296892, 0.09098117771487602, 0.06553658936780109, 0.11081051964150823, -0.026520569847248817, -0.03536076191458446, -0.36682108565355126, -0.17286010609696742, -0.14554268295456574, 0.17508322386799946, -0.03743443328497486, -0.15892165604492892, 0.38427909868161964, 0.023915379334484104, 0.2068950979443996, 0.0845773757658089, 0.18014682068732446, 0.05504232560709605, 0.06656701656908769, 0.06426083904933995, 0.144389053560925, 0.2147841127872791, -0.04118731907244934, -0.11627621347003657, 0.03038538175270609, 0.1703382252998974] |
1,802.02043 | Low frequency acoustic stop bands in cubic arrays of thick spherical
shells with holes | We analyse the propagation of pressure waves within a fluid filled with a
three-dimensional array of rigid coated spheres (shells). We first draw band
diagrams for corresponding Floquet-Bloch waves. We then dig a channel
terminated by a cavity within each rigid shell and observe the appearance of a
low frequency stop band. The underlying mechanism is that each holey shell now
acts as a Helmholtz resonator supporting a low frequency localized mode: Upon
resonance, pressure waves propagate with fast oscillations in the thin water
channel drilled in each shell and are localized in each fluid filled inner
cavity. The array of fluid filled shells is approximated by a simple mechanical
model of springs and masses allowing for asymptotic estimates of the low
frequency stop band. We finally propose a realistic design of periodic
macrocell with a large defect surrounded by 26 resonators connected by thin
straight rigid wires, which supports a localized mode in the low frequency stop
band.
| physics.class-ph | we analyse the propagation of pressure waves within a fluid filled with a threedimensional array of rigid coated spheres shells we first draw band diagrams for corresponding floquetbloch waves we then dig a channel terminated by a cavity within each rigid shell and observe the appearance of a low frequency stop band the underlying mechanism is that each holey shell now acts as a helmholtz resonator supporting a low frequency localized mode upon resonance pressure waves propagate with fast oscillations in the thin water channel drilled in each shell and are localized in each fluid filled inner cavity the array of fluid filled shells is approximated by a simple mechanical model of springs and masses allowing for asymptotic estimates of the low frequency stop band we finally propose a realistic design of periodic macrocell with a large defect surrounded by 26 resonators connected by thin straight rigid wires which supports a localized mode in the low frequency stop band | [['we', 'analyse', 'the', 'propagation', 'of', 'pressure', 'waves', 'within', 'a', 'fluid', 'filled', 'with', 'a', 'threedimensional', 'array', 'of', 'rigid', 'coated', 'spheres', 'shells', 'we', 'first', 'draw', 'band', 'diagrams', 'for', 'corresponding', 'floquetbloch', 'waves', 'we', 'then', 'dig', 'a', 'channel', 'terminated', 'by', 'a', 'cavity', 'within', 'each', 'rigid', 'shell', 'and', 'observe', 'the', 'appearance', 'of', 'a', 'low', 'frequency', 'stop', 'band', 'the', 'underlying', 'mechanism', 'is', 'that', 'each', 'holey', 'shell', 'now', 'acts', 'as', 'a', 'helmholtz', 'resonator', 'supporting', 'a', 'low', 'frequency', 'localized', 'mode', 'upon', 'resonance', 'pressure', 'waves', 'propagate', 'with', 'fast', 'oscillations', 'in', 'the', 'thin', 'water', 'channel', 'drilled', 'in', 'each', 'shell', 'and', 'are', 'localized', 'in', 'each', 'fluid', 'filled', 'inner', 'cavity', 'the', 'array', 'of', 'fluid', 'filled', 'shells', 'is', 'approximated', 'by', 'a', 'simple', 'mechanical', 'model', 'of', 'springs', 'and', 'masses', 'allowing', 'for', 'asymptotic', 'estimates', 'of', 'the', 'low', 'frequency', 'stop', 'band', 'we', 'finally', 'propose', 'a', 'realistic', 'design', 'of', 'periodic', 'macrocell', 'with', 'a', 'large', 'defect', 'surrounded', 'by', '26', 'resonators', 'connected', 'by', 'thin', 'straight', 'rigid', 'wires', 'which', 'supports', 'a', 'localized', 'mode', 'in', 'the', 'low', 'frequency', 'stop', 'band']] | [-0.19300244292010021, 0.20912294933182896, -0.002089019761404061, -0.02016652518233179, -0.07132895419420968, -0.18893626551055964, 0.08714532460168051, 0.4301680628468031, -0.23166772388156104, -0.24459924145291248, 0.0918474475554419, -0.25770767918149445, -0.08813374395827828, 0.11609099029106493, 0.003832494457100032, -0.0035218091472198473, 0.056024580074433214, -0.037640651296267764, -0.033147660551194405, -0.06457030006432496, 0.2662178997811422, 0.07249285408395266, 0.2731281445718974, -0.0016019169662920933, 0.08312652335185909, -0.036175424836388546, 0.04608238402039469, 0.018855803766223433, -0.14581839171044766, 0.06434702269371259, 0.24978284695099326, -0.05478653876737284, 0.2504508484172512, -0.514099060376204, -0.21984990312477704, -0.008360792917884746, 0.16729445691343467, 0.11435824196197023, -0.06414933356825474, -0.27476456160393525, 0.037644083769816275, -0.1873376473005416, -0.20292414430493735, 0.051543093667184035, -0.013493574379266784, 0.008275243266245479, -0.21885754897057097, 0.08216008005684619, 0.036763910333034375, 0.0098213824097934, -0.09989520778539795, -0.04965390562396145, -0.07866123704819607, 0.07245913128889862, -0.01097803897408874, -0.023966481346847875, 0.19089643478264692, -0.0917025060025366, -0.026746423595801653, 0.38119692212181555, -0.09834225803984141, -0.18353449094033092, 0.18762115231938822, -0.1621575582622032, 0.01712115280295037, 0.23538611978058172, 0.1829986613472256, 0.06289257214012199, -0.09276869009525673, 0.04816566525962872, -0.0433537852979681, 0.21511661746896477, 0.17407389902275455, -0.012913063455537055, 0.303478929799917, 0.23881272156429975, 0.017662282160383725, 0.18529056136806807, -0.1243381204241711, -0.012949878115605258, -0.2835951296308037, -0.13498798090050806, -0.18498164692010624, -0.013137741954470018, -0.09044071375774937, -0.23851001699624946, 0.3944128890076664, -0.0021487907945828616, 0.17251541522099437, -0.00284366916100723, 0.3002908715726398, 0.06308193228854768, 0.07321889285414052, 0.11897017611132103, 0.2838484679638707, 0.17246005416894625, 0.06515582374157237, -0.19681247869292684, -0.06953526975620142, 0.00605108119904667] |
1,802.02044 | Energy-level crossings and number-parity effects in a bosonic tunneling
model | An exactly solved bosonic tunneling model is studied along a line of the
coupling parameter space, which includes a quantum phase boundary line. The
entire energy spectrum is computed analytically, and found to exhibit multiple
energy level crossings in a region of the coupling parameter space. Several key
properties of the model are discussed, which exhibit a clear dependence on
whether the particle number is even or odd.
| cond-mat.quant-gas | an exactly solved bosonic tunneling model is studied along a line of the coupling parameter space which includes a quantum phase boundary line the entire energy spectrum is computed analytically and found to exhibit multiple energy level crossings in a region of the coupling parameter space several key properties of the model are discussed which exhibit a clear dependence on whether the particle number is even or odd | [['an', 'exactly', 'solved', 'bosonic', 'tunneling', 'model', 'is', 'studied', 'along', 'a', 'line', 'of', 'the', 'coupling', 'parameter', 'space', 'which', 'includes', 'a', 'quantum', 'phase', 'boundary', 'line', 'the', 'entire', 'energy', 'spectrum', 'is', 'computed', 'analytically', 'and', 'found', 'to', 'exhibit', 'multiple', 'energy', 'level', 'crossings', 'in', 'a', 'region', 'of', 'the', 'coupling', 'parameter', 'space', 'several', 'key', 'properties', 'of', 'the', 'model', 'are', 'discussed', 'which', 'exhibit', 'a', 'clear', 'dependence', 'on', 'whether', 'the', 'particle', 'number', 'is', 'even', 'or', 'odd']] | [-0.20754625371602528, 0.16782334592961193, -0.05133689246619778, 0.10115433545776314, -0.039356838309151286, -0.17552290456917355, 0.032868888102444434, 0.36187216469689326, -0.24410074855062275, -0.3204026485875468, 0.05338096641079413, -0.2339026731736821, -0.1045338672154364, 0.19051293968325755, 0.06350494892060798, 0.013765224330948995, 0.015435319256914012, 0.08242021657197791, -0.04662163197473787, -0.19405371262965834, 0.3130892769652693, 0.03998181824264226, 0.25965497885173294, 0.07037859325817622, 0.07707566677537911, -0.014460927409612957, 0.0347824472358779, 0.054895583772175835, -0.14403215239701025, 0.024462453589555535, 0.21266537756823442, 0.019798734300660297, 0.21694458007593365, -0.3654398203772657, -0.2506359137204366, 0.12079367348376442, 0.1699718341765487, 0.07599468548741083, -0.0128291643323952, -0.2317529449595467, 0.0003373670213691452, -0.12463350474889226, -0.16364098374341504, -0.03582556911415475, -0.011498037506552303, -0.03286967273486559, -0.24645797392997124, 0.06366295570863739, 0.027659925645874703, 0.05254645753816208, -0.055789668886812735, -0.06867772054273005, -0.08737634240156587, 0.09498693827909473, 0.012113741826878514, 0.013220804389514824, 0.0948454593993066, -0.1344252735348966, -0.08990260264288415, 0.37607104186078205, -0.032348394126850456, -0.20894769998267293, 0.1526828639154487, -0.1421599102083265, -0.09676646376165617, 0.19714743507724694, 0.11107883706469746, 0.1066448571954799, -0.10858726500780047, 0.16106586519077504, -0.0342133127628853, 0.197388400491464, 0.04768665905302281, 0.043741565019659256, 0.2156395230387502, 0.11707356798133868, 0.042191809851347524, 0.15612590328023276, -0.12201818543732823, -0.1761847258928944, -0.30929858008183897, -0.14522066797294161, -0.1998755500980598, 0.00892896143555203, -0.06958748295416145, -0.20716387522406876, 0.4393482698565897, 0.0882826162611737, 0.2725665350581574, -0.01329229973078541, 0.26649533762760896, 0.1859109055606977, 0.04243241511422264, 0.048409702948821874, 0.24513237730956033, 0.11082991922055097, 0.04690513503052952, -0.2538482519619934, 0.038593614686225707, 0.05592456703444066] |
1,802.02045 | On Some Universal Features of the Holographic Quantum Complexity of Bulk
Singularities | We perform a comparative study of the time dependence of the holographic
quantum complexity of some space like singular bulk gravitational backgrounds.
This is done by considering the two available notions of complexity, one that
relates it to the maximal spatial volume and the other that relates it to the
classical action of the Wheeler-de Witt patch. We calculate and compare the
leading and the next to leading terms and find some universal features. The
complexity decreases towards the singularity for both definitions, for all
types of singularities studied. In addition the leading terms have the same
quantitative behavior for both definitions in restricted number of cases and
the behaviour itself is different for different singular backgrounds. The
quantitative details of the next to leading terms, such as their specific form
of time dependence, are found not to be universal. They vary between the
different cases and between the different bulk definitions of complexity. We
also address some technical points inherent to the calculation.
| hep-th | we perform a comparative study of the time dependence of the holographic quantum complexity of some space like singular bulk gravitational backgrounds this is done by considering the two available notions of complexity one that relates it to the maximal spatial volume and the other that relates it to the classical action of the wheelerde witt patch we calculate and compare the leading and the next to leading terms and find some universal features the complexity decreases towards the singularity for both definitions for all types of singularities studied in addition the leading terms have the same quantitative behavior for both definitions in restricted number of cases and the behaviour itself is different for different singular backgrounds the quantitative details of the next to leading terms such as their specific form of time dependence are found not to be universal they vary between the different cases and between the different bulk definitions of complexity we also address some technical points inherent to the calculation | [['we', 'perform', 'a', 'comparative', 'study', 'of', 'the', 'time', 'dependence', 'of', 'the', 'holographic', 'quantum', 'complexity', 'of', 'some', 'space', 'like', 'singular', 'bulk', 'gravitational', 'backgrounds', 'this', 'is', 'done', 'by', 'considering', 'the', 'two', 'available', 'notions', 'of', 'complexity', 'one', 'that', 'relates', 'it', 'to', 'the', 'maximal', 'spatial', 'volume', 'and', 'the', 'other', 'that', 'relates', 'it', 'to', 'the', 'classical', 'action', 'of', 'the', 'wheelerde', 'witt', 'patch', 'we', 'calculate', 'and', 'compare', 'the', 'leading', 'and', 'the', 'next', 'to', 'leading', 'terms', 'and', 'find', 'some', 'universal', 'features', 'the', 'complexity', 'decreases', 'towards', 'the', 'singularity', 'for', 'both', 'definitions', 'for', 'all', 'types', 'of', 'singularities', 'studied', 'in', 'addition', 'the', 'leading', 'terms', 'have', 'the', 'same', 'quantitative', 'behavior', 'for', 'both', 'definitions', 'in', 'restricted', 'number', 'of', 'cases', 'and', 'the', 'behaviour', 'itself', 'is', 'different', 'for', 'different', 'singular', 'backgrounds', 'the', 'quantitative', 'details', 'of', 'the', 'next', 'to', 'leading', 'terms', 'such', 'as', 'their', 'specific', 'form', 'of', 'time', 'dependence', 'are', 'found', 'not', 'to', 'be', 'universal', 'they', 'vary', 'between', 'the', 'different', 'cases', 'and', 'between', 'the', 'different', 'bulk', 'definitions', 'of', 'complexity', 'we', 'also', 'address', 'some', 'technical', 'points', 'inherent', 'to', 'the', 'calculation']] | [-0.11037737739885725, 0.08348101608614188, -0.0843822183257832, 0.10407255417362093, -0.06790309267618307, -0.09128259946187538, 0.006422899860786501, 0.30594791310680347, -0.27604844578450954, -0.28332217796648873, 0.0963361403250374, -0.28361443753592763, -0.1495850216171409, 0.20295358061642818, -0.05014966045632164, 0.04258980384137675, -0.01520501773253583, 0.07707129211006004, -0.14060039616618647, -0.2624090905642001, 0.36678035425521976, 0.03890050556894006, 0.30032006977126, 0.07467104283888347, 0.07228618204343791, -0.02191294294997777, -0.06065965605979195, 0.05730989598808863, -0.1557710321153203, 0.09948843150547274, 0.23704568045952062, 0.11218055450604525, 0.23565324276072405, -0.4322154941491601, -0.1896367022631372, 0.11939149821267986, 0.12540547594516083, 0.10996655530932291, 0.017252479651488545, -0.22037698656729446, 0.09366139581869924, -0.15241732522731694, -0.13007876849534536, -0.0888265461842643, 0.01995893071331765, 0.013238491074306273, -0.18115625073338246, 0.05943133549536891, 0.04062764804878431, 0.025557363334838754, -0.050356771530038334, -0.09173323108428498, -0.00873164477241339, 0.19927449966496902, 0.10377389896467965, -0.005300784127207518, 0.10122386350512232, -0.14715584352606817, -0.11335337198929997, 0.3831527972758589, -0.031973805500012706, -0.21731102626725304, 0.22551686927199183, -0.15319345733605144, -0.138442589272461, 0.09114764097697534, 0.11859009483766673, 0.10627893856783374, -0.10963462880335567, 0.08921508394002846, 0.0053797012532879485, 0.10666950947673219, 0.11009017091596544, 0.11232502690073466, 0.1587367117899703, 0.10367029627697065, 0.029115819196194048, 0.16469765763670183, -0.05751703952143832, -0.12026085540731778, -0.34766359273457853, -0.178035382808913, -0.12811624880087924, 0.0024581064723706064, -0.14150111622403505, -0.18234706355759978, 0.4214732031658769, 0.1502814947897405, 0.2320676917613416, 0.07153669465901102, 0.2674743947629794, 0.11304040131636145, 0.05181471328676974, 0.040045403015072936, 0.2391428153437673, 0.08612889112910346, 0.09175122378212286, -0.25049441300400693, 0.06457252449231086, 0.05967440051679704] |
1,802.02046 | Neural Network Detection of Data Sequences in Communication Systems | We consider detection based on deep learning, and show it is possible to
train detectors that perform well without any knowledge of the underlying
channel models. Moreover, when the channel model is known, we demonstrate that
it is possible to train detectors that do not require channel state information
(CSI). In particular, a technique we call a sliding bidirectional recurrent
neural network (SBRNN) is proposed for detection where, after training, the
detector estimates the data in real-time as the signal stream arrives at the
receiver. We evaluate this algorithm, as well as other neural network (NN)
architectures, using the Poisson channel model, which is applicable to both
optical and molecular communication systems. In addition, we also evaluate the
performance of this detection method applied to data sent over a molecular
communication platform, where the channel model is difficult to model
analytically. We show that SBRNN is computationally efficient, and can perform
detection under various channel conditions without knowing the underlying
channel model. We also demonstrate that the bit error rate (BER) performance of
the proposed SBRNN detector is better than that of a Viterbi detector with
imperfect CSI as well as that of other NN detectors that have been previously
proposed. Finally, we show that the SBRNN can perform well in rapidly changing
channels, where the coherence time is on the order of a single symbol duration.
| eess.SP cs.IT cs.LG math.IT | we consider detection based on deep learning and show it is possible to train detectors that perform well without any knowledge of the underlying channel models moreover when the channel model is known we demonstrate that it is possible to train detectors that do not require channel state information csi in particular a technique we call a sliding bidirectional recurrent neural network sbrnn is proposed for detection where after training the detector estimates the data in realtime as the signal stream arrives at the receiver we evaluate this algorithm as well as other neural network nn architectures using the poisson channel model which is applicable to both optical and molecular communication systems in addition we also evaluate the performance of this detection method applied to data sent over a molecular communication platform where the channel model is difficult to model analytically we show that sbrnn is computationally efficient and can perform detection under various channel conditions without knowing the underlying channel model we also demonstrate that the bit error rate ber performance of the proposed sbrnn detector is better than that of a viterbi detector with imperfect csi as well as that of other nn detectors that have been previously proposed finally we show that the sbrnn can perform well in rapidly changing channels where the coherence time is on the order of a single symbol duration | [['we', 'consider', 'detection', 'based', 'on', 'deep', 'learning', 'and', 'show', 'it', 'is', 'possible', 'to', 'train', 'detectors', 'that', 'perform', 'well', 'without', 'any', 'knowledge', 'of', 'the', 'underlying', 'channel', 'models', 'moreover', 'when', 'the', 'channel', 'model', 'is', 'known', 'we', 'demonstrate', 'that', 'it', 'is', 'possible', 'to', 'train', 'detectors', 'that', 'do', 'not', 'require', 'channel', 'state', 'information', 'csi', 'in', 'particular', 'a', 'technique', 'we', 'call', 'a', 'sliding', 'bidirectional', 'recurrent', 'neural', 'network', 'sbrnn', 'is', 'proposed', 'for', 'detection', 'where', 'after', 'training', 'the', 'detector', 'estimates', 'the', 'data', 'in', 'realtime', 'as', 'the', 'signal', 'stream', 'arrives', 'at', 'the', 'receiver', 'we', 'evaluate', 'this', 'algorithm', 'as', 'well', 'as', 'other', 'neural', 'network', 'nn', 'architectures', 'using', 'the', 'poisson', 'channel', 'model', 'which', 'is', 'applicable', 'to', 'both', 'optical', 'and', 'molecular', 'communication', 'systems', 'in', 'addition', 'we', 'also', 'evaluate', 'the', 'performance', 'of', 'this', 'detection', 'method', 'applied', 'to', 'data', 'sent', 'over', 'a', 'molecular', 'communication', 'platform', 'where', 'the', 'channel', 'model', 'is', 'difficult', 'to', 'model', 'analytically', 'we', 'show', 'that', 'sbrnn', 'is', 'computationally', 'efficient', 'and', 'can', 'perform', 'detection', 'under', 'various', 'channel', 'conditions', 'without', 'knowing', 'the', 'underlying', 'channel', 'model', 'we', 'also', 'demonstrate', 'that', 'the', 'bit', 'error', 'rate', 'ber', 'performance', 'of', 'the', 'proposed', 'sbrnn', 'detector', 'is', 'better', 'than', 'that', 'of', 'a', 'viterbi', 'detector', 'with', 'imperfect', 'csi', 'as', 'well', 'as', 'that', 'of', 'other', 'nn', 'detectors', 'that', 'have', 'been', 'previously', 'proposed', 'finally', 'we', 'show', 'that', 'the', 'sbrnn', 'can', 'perform', 'well', 'in', 'rapidly', 'changing', 'channels', 'where', 'the', 'coherence', 'time', 'is', 'on', 'the', 'order', 'of', 'a', 'single', 'symbol', 'duration']] | [-0.11112993960535474, 0.029146804558400408, -0.07592453890160088, 0.05954752122062271, -0.063123346543317, -0.22453165918974297, 0.04785756810695458, 0.45733229363017147, -0.26327553415252514, -0.30366368937031224, 0.12221338132823026, -0.24739029658866005, -0.20178399522048276, 0.19548201517536334, -0.07240818913242399, 0.09607507445052521, 0.1187574338898194, 0.11604804903194965, -0.059100931230829906, -0.25986944380552723, 0.26713406586289273, 0.104074529797687, 0.32661491608255366, 0.030854923579593636, 0.12604882017020055, -0.0037686940188220155, 0.01319410283906213, -0.047144135900276676, -0.08068640921962994, 0.038174210460897584, 0.2682378102575014, 0.17763493931031732, 0.2278310167931414, -0.4401462280318666, -0.265990688682981, 0.10012791085104142, 0.1544954192461569, 0.12884547061436616, -0.02546439905977082, -0.29452555015322135, 0.13394432812867613, -0.21077407079252378, 0.005544642314708706, -0.06766842912968724, -0.042877891729688394, 0.012307365086967626, -0.3091962307220784, 0.04452711107544243, 0.05088010113911974, -0.01822341556788016, -0.03025874845265095, -0.09145642557419377, 0.02276097418840909, 0.14743190231419678, -0.004151106937658293, 0.03958149860861264, 0.12011215886068305, -0.15515830835868813, -0.12771523499344414, 0.33620909951824185, -0.08658704374377597, -0.23492244675361637, 0.18925472094019924, -0.08044812603061814, -0.08728773768022985, 0.11605696031815549, 0.2337937451784175, 0.10834527104561698, -0.1765120240815711, 0.007635304763029014, -0.025100620131168334, 0.22181145948591738, 0.023365992066011424, 0.057944560306565224, 0.12098534758272478, 0.2544089243254965, 0.07513262303792236, 0.15474244247042956, -0.20183195797357265, -0.08364068800511684, -0.26177956890068654, -0.13634853306973133, -0.2163087564565668, -0.0005861424413660443, -0.029634342208673402, -0.09214606291577548, 0.3581985020240777, 0.2286503981052188, 0.1830268332104933, 0.09592021267916515, 0.3818073670999332, 0.06647606970412075, 0.09845044985331497, 0.10154863286020833, 0.23285196805865163, 0.05421378647719842, 0.08312258142147147, -0.18357138211083995, 0.10896862890070821, -0.014256005988780426] |
1,802.02047 | Double symbolic joint entropy in nonlinear dynamic complexity analysis | Symbolizations, the base of symbolic dynamic analysis, are classified as
global static and local dynamic approaches which are combined by joint entropy
in our works for nonlinear dynamic complexity analysis. Two global static
methods, symbolic transformations of Wessel N. symbolic entropy and base-scale
entropy, and two local ones, namely symbolizations of permutation and
differential entropy, constitute four double symbolic joint entropies that have
accurate complexity detections in chaotic models, logistic and Henon map
series. In nonlinear dynamical analysis of different kinds of heart rate
variability, heartbeats of healthy young have higher complexity than those of
the healthy elderly, and congestive heart failure (CHF) patients are lowest in
heartbeats' joint entropy values. Each individual symbolic entropy is improved
by double symbolic joint entropy among which the combination of base-scale and
differential symbolizations have best complexity analysis. Test results prove
that double symbolic joint entropy is feasible in nonlinear dynamic complexity
analysis.
| physics.data-an nlin.CD | symbolizations the base of symbolic dynamic analysis are classified as global static and local dynamic approaches which are combined by joint entropy in our works for nonlinear dynamic complexity analysis two global static methods symbolic transformations of wessel n symbolic entropy and basescale entropy and two local ones namely symbolizations of permutation and differential entropy constitute four double symbolic joint entropies that have accurate complexity detections in chaotic models logistic and henon map series in nonlinear dynamical analysis of different kinds of heart rate variability heartbeats of healthy young have higher complexity than those of the healthy elderly and congestive heart failure chf patients are lowest in heartbeats joint entropy values each individual symbolic entropy is improved by double symbolic joint entropy among which the combination of basescale and differential symbolizations have best complexity analysis test results prove that double symbolic joint entropy is feasible in nonlinear dynamic complexity analysis | [['symbolizations', 'the', 'base', 'of', 'symbolic', 'dynamic', 'analysis', 'are', 'classified', 'as', 'global', 'static', 'and', 'local', 'dynamic', 'approaches', 'which', 'are', 'combined', 'by', 'joint', 'entropy', 'in', 'our', 'works', 'for', 'nonlinear', 'dynamic', 'complexity', 'analysis', 'two', 'global', 'static', 'methods', 'symbolic', 'transformations', 'of', 'wessel', 'n', 'symbolic', 'entropy', 'and', 'basescale', 'entropy', 'and', 'two', 'local', 'ones', 'namely', 'symbolizations', 'of', 'permutation', 'and', 'differential', 'entropy', 'constitute', 'four', 'double', 'symbolic', 'joint', 'entropies', 'that', 'have', 'accurate', 'complexity', 'detections', 'in', 'chaotic', 'models', 'logistic', 'and', 'henon', 'map', 'series', 'in', 'nonlinear', 'dynamical', 'analysis', 'of', 'different', 'kinds', 'of', 'heart', 'rate', 'variability', 'heartbeats', 'of', 'healthy', 'young', 'have', 'higher', 'complexity', 'than', 'those', 'of', 'the', 'healthy', 'elderly', 'and', 'congestive', 'heart', 'failure', 'chf', 'patients', 'are', 'lowest', 'in', 'heartbeats', 'joint', 'entropy', 'values', 'each', 'individual', 'symbolic', 'entropy', 'is', 'improved', 'by', 'double', 'symbolic', 'joint', 'entropy', 'among', 'which', 'the', 'combination', 'of', 'basescale', 'and', 'differential', 'symbolizations', 'have', 'best', 'complexity', 'analysis', 'test', 'results', 'prove', 'that', 'double', 'symbolic', 'joint', 'entropy', 'is', 'feasible', 'in', 'nonlinear', 'dynamic', 'complexity', 'analysis']] | [-0.09352902610938858, 0.05466505868763134, -0.07127886280618809, 0.09340473703058386, -0.04758778082936801, -0.18455734451040248, 0.043596052410508936, 0.28056855806829156, -0.2565267385436675, -0.26123828513270897, 0.11964501573852063, -0.2932594703837625, -0.17504327021054672, 0.22726516614391193, -0.10767285713321857, 0.15201177221742174, 0.06103483940761008, 0.06684501272173145, -0.06588738860965178, -0.2417183209846199, 0.29151124368434317, 0.013341548560011024, 0.3069356587539251, -0.07547177193761878, 0.07949859092351855, 0.004324845022622596, -0.10395175477370268, 0.04862459189560566, -0.10632401040011491, 0.13570201531291712, 0.32238615428938117, 0.2242391002411652, 0.2963277250339554, -0.3969690520064654, -0.22296083806636366, 0.09682822523550508, 0.08511528592695154, 0.062256507158619225, 0.045583225577453, -0.2535466098767781, 0.10970476573817683, -0.19087328377330826, -0.03809076556904443, -0.13695989982099147, 0.044983826609127024, 0.04778334470717488, -0.24353727233923367, 0.1664789422773882, 0.0766811091018246, 0.14730538346339017, -0.07940455311531755, -0.10320540016038797, -0.053254514056371174, 0.14670985407271497, 0.044701556810429574, -0.016888642246281175, 0.14311923794023618, -0.09018024191184826, -0.19976336412081444, 0.2584201725501869, -0.02853869741306266, -0.17403523221681197, 0.2224758769844885, -0.12842033357309127, -0.21179851905027455, 0.15404028617902785, 0.18163089053327772, 0.1155091241832722, -0.16022824238658556, 0.049618742621041254, 0.010472001750148027, 0.18076493024096094, 0.09987229121710502, 0.034858277841546645, 0.15773607125014974, 0.13404522009974196, 0.02231880825963123, 0.1586260111558855, -0.04454731309512706, -0.15613414243341903, -0.21679549554765626, -0.14544333380124314, -0.10748114568854657, 0.016422624156237707, -0.16984868635404995, -0.15771224741537654, 0.386391615646111, 0.06817028891748271, 0.1357596576075397, 0.10865852050325908, 0.3094767179038074, 0.11616076311455234, 0.0078294486927523, 0.07345229499608379, 0.1795283026829664, 0.09660867778143871, 0.07140583573286799, -0.2727896028915672, 0.08956665599032783, 0.13925918919109814] |
1,802.02048 | Clout, Activists and Budget: The Road to Presidency | Political campaigns involve, in the simplest case, two competing campaign
groups which try to obtain a majority of votes. We propose a novel mathematical
framework to study political campaign dynamics on social networks whose
constituents are either political activists or persuadable individuals.
Activists are convinced and do not change their opinion and they are able to
move around in the social network to motivate persuadable individuals to vote
according to their opinion. We describe the influence of the complex interplay
between the number of activists, political clout, budgets, and campaign costs
on the campaign result. We also identify situations where the choice of one
campaign group to send a certain number of activists already pre-determines
their victory. Moreover, we show that a candidate's advantage in terms of
political clout can overcome a substantial budget disadvantage or a lower
number of activists, as illustrated by the US presidential election 2016.
| physics.soc-ph | political campaigns involve in the simplest case two competing campaign groups which try to obtain a majority of votes we propose a novel mathematical framework to study political campaign dynamics on social networks whose constituents are either political activists or persuadable individuals activists are convinced and do not change their opinion and they are able to move around in the social network to motivate persuadable individuals to vote according to their opinion we describe the influence of the complex interplay between the number of activists political clout budgets and campaign costs on the campaign result we also identify situations where the choice of one campaign group to send a certain number of activists already predetermines their victory moreover we show that a candidates advantage in terms of political clout can overcome a substantial budget disadvantage or a lower number of activists as illustrated by the us presidential election 2016 | [['political', 'campaigns', 'involve', 'in', 'the', 'simplest', 'case', 'two', 'competing', 'campaign', 'groups', 'which', 'try', 'to', 'obtain', 'a', 'majority', 'of', 'votes', 'we', 'propose', 'a', 'novel', 'mathematical', 'framework', 'to', 'study', 'political', 'campaign', 'dynamics', 'on', 'social', 'networks', 'whose', 'constituents', 'are', 'either', 'political', 'activists', 'or', 'persuadable', 'individuals', 'activists', 'are', 'convinced', 'and', 'do', 'not', 'change', 'their', 'opinion', 'and', 'they', 'are', 'able', 'to', 'move', 'around', 'in', 'the', 'social', 'network', 'to', 'motivate', 'persuadable', 'individuals', 'to', 'vote', 'according', 'to', 'their', 'opinion', 'we', 'describe', 'the', 'influence', 'of', 'the', 'complex', 'interplay', 'between', 'the', 'number', 'of', 'activists', 'political', 'clout', 'budgets', 'and', 'campaign', 'costs', 'on', 'the', 'campaign', 'result', 'we', 'also', 'identify', 'situations', 'where', 'the', 'choice', 'of', 'one', 'campaign', 'group', 'to', 'send', 'a', 'certain', 'number', 'of', 'activists', 'already', 'predetermines', 'their', 'victory', 'moreover', 'we', 'show', 'that', 'a', 'candidates', 'advantage', 'in', 'terms', 'of', 'political', 'clout', 'can', 'overcome', 'a', 'substantial', 'budget', 'disadvantage', 'or', 'a', 'lower', 'number', 'of', 'activists', 'as', 'illustrated', 'by', 'the', 'us', 'presidential', 'election', '2016']] | [-0.12978126107379287, 0.08267661551533102, -0.06631220655427092, 0.07162709138514538, -0.19842480443937538, -0.1495539065716522, 0.15752904856225894, 0.39493032880000717, -0.20399163274385898, -0.3652260972909173, 0.08293612081586021, -0.3272115968541578, -0.18157336768713228, 0.1273776279456698, -0.13342447652399134, -0.05702021291327416, 0.05046025210228071, 0.04946199194710309, 0.08939024322027923, -0.367256621500718, 0.3043932509145281, 0.02676098807683202, 0.2717324476625745, 0.028506110802444876, 0.04481424133730482, 0.005914580286005322, -0.07212250465946905, 0.012013838534925662, -0.11846157274119672, 0.0886707605420276, 0.32333076646437453, 0.18774207041425223, 0.43048968400527426, -0.43642425807002855, -0.15194008757239905, 0.17878451753014915, 0.10353702735345886, 0.0688243266353447, 0.017642528840283653, -0.32113401047397583, 0.04492986967571739, -0.26536336602947236, -0.09545190962265898, -0.09349943773478878, 0.017373001861835824, 0.05542963077504264, -0.2018124188239477, 0.02952247168563883, 0.006398319661915049, 0.08775163801279248, -0.03987521838498156, -0.07874782724293317, -0.026048357927931004, 0.2366053217952298, 0.11802945363645752, -0.05225972398730679, 0.1545848605210329, -0.17204087781941607, -0.17269241100899418, 0.40732368316222617, 0.039570902553220676, -0.1377956492392359, 0.18174897973563484, -0.13073179819526112, -0.16057746788347457, 0.031485580376723186, 0.26337444217444783, 0.09555807742203086, -0.11405086560484867, -0.055815097636330975, -0.06313766652938346, 0.18043313582180714, 0.04751113818191803, -0.000251107294822023, 0.19760874985736243, 0.09155545686530013, 0.0943824346953382, 0.0887701073534736, -0.008574977182928904, -0.14810175378331725, -0.2025553439712139, -0.11846863320667525, -0.11486824859586246, 0.07309897647638802, -0.059927582281160956, -0.10600767991359845, 0.4065645257530569, 0.1340022113738062, 0.17593263462542233, 0.04072403442352174, 0.21812272065186075, -0.02411053528958539, 0.029716991447229064, 0.05190646470061877, 0.2316458887376246, 0.013892421272399575, 0.1333106578181998, -0.16904526128477992, 0.16213954550207776, 0.002243651401847094] |
1,802.02049 | A Distance Between Channels: the average error of mismatched channels | Two channels are equivalent if their maximum likelihood (ML) decoders
coincide for every code. We show that this equivalence relation partitions the
space of channels into a generalized hyperplane arrangement. With this, we
define a coding distance between channels in terms of their ML-decoders which
is meaningful from the decoding point of view, in the sense that the closer two
channels are, the larger is the probability of them sharing the same
ML-decoder. We give explicit formulas for these probabilities.
| cs.IT math.IT | two channels are equivalent if their maximum likelihood ml decoders coincide for every code we show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement with this we define a coding distance between channels in terms of their mldecoders which is meaningful from the decoding point of view in the sense that the closer two channels are the larger is the probability of them sharing the same mldecoder we give explicit formulas for these probabilities | [['two', 'channels', 'are', 'equivalent', 'if', 'their', 'maximum', 'likelihood', 'ml', 'decoders', 'coincide', 'for', 'every', 'code', 'we', 'show', 'that', 'this', 'equivalence', 'relation', 'partitions', 'the', 'space', 'of', 'channels', 'into', 'a', 'generalized', 'hyperplane', 'arrangement', 'with', 'this', 'we', 'define', 'a', 'coding', 'distance', 'between', 'channels', 'in', 'terms', 'of', 'their', 'mldecoders', 'which', 'is', 'meaningful', 'from', 'the', 'decoding', 'point', 'of', 'view', 'in', 'the', 'sense', 'that', 'the', 'closer', 'two', 'channels', 'are', 'the', 'larger', 'is', 'the', 'probability', 'of', 'them', 'sharing', 'the', 'same', 'mldecoder', 'we', 'give', 'explicit', 'formulas', 'for', 'these', 'probabilities']] | [-0.17391123740265194, 0.08679964683520106, -0.08584168000528827, 0.11283321486105426, -0.019795097458438996, -0.1923459086041802, 0.09848867495281574, 0.4059753057379753, -0.30349543589191175, -0.23082981606682715, 0.06218338761633883, -0.2679979629599704, -0.15602543685012138, 0.1564449485248098, -0.07391263337306625, 0.0165161734017042, 0.06994904498330867, 0.0774342001368029, -0.13594128038041675, -0.25555935682496056, 0.3582272083044816, 0.03661968873497338, 0.28846115601034117, 0.019579275188824304, 0.09065322591833627, 0.006361924368553819, -0.01591823694224541, -0.012537215759109061, -0.1526500293874937, 0.14760979305570707, 0.27708562294868994, 0.2022798922008429, 0.2121858457521273, -0.36294925455653215, -0.16140113685590526, 0.13728656072933704, 0.13804420383306792, 0.10286641527319518, 0.017738080171581645, -0.2475600733111302, 0.12031447876674625, -0.14900686072472197, -0.02753000610913986, 0.034677850745188504, 0.023643623524082776, 0.051725804089353636, -0.2651968634185883, 0.01868241822394805, 0.08064916783657211, 0.034322683550178625, -0.028472948777608763, -0.1400403648805924, 0.0006200596033476102, 0.16322431393946785, 0.002534462031550132, -0.007434591812153275, 0.04490862180738567, -0.07896377624591622, -0.11576957129186784, 0.3424443918734025, 0.020383214321321785, -0.2561978592346303, 0.1620356930563083, -0.12741261658569178, -0.09946501228170326, 0.14816305387275627, 0.15379523338141063, 0.09466898430568668, -0.13520406243892816, 0.056238351783786826, -0.0952149296227174, 0.11206097081967761, 0.09199596117608823, 0.09745553746007574, 0.20711280709395233, 0.06091546567562872, 0.08573488930526835, 0.1941310248027245, -0.07165616693143817, -0.10944264200635445, -0.3536315165842191, -0.20667982359345144, -0.14360073470295623, -0.005383383996116045, -0.14280927671979254, -0.13281675746353963, 0.3478527057808466, 0.15715335117270932, 0.22515449692041445, 0.1585082785026409, 0.27714666581820124, 0.11191046131380762, 0.06907873300429529, 0.11727829336618575, 0.2037049727096485, 0.14724058929520348, -0.022237777130869336, -0.13680997096264783, 0.08154100087733987, 0.08754412745101711] |
1,802.0205 | Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials | The theory of kernelization can be used to rigorously analyze data reduction
for graph coloring problems. Here, the aim is to reduce a q-Coloring input to
an equivalent but smaller input whose size is provably bounded in terms of
structural properties, such as the size of a minimum vertex cover. In this
paper we settle two open problems about data reduction for q-Coloring.
First, we obtain a kernel of bitsize $O(k^{q-1}\log{k})$ for q-Coloring
parameterized by Vertex Cover, for any q >= 3. This size bound is optimal up to
$k^{o(1)}$ factors assuming NP is not a subset of coNP/poly, and improves on
the previous-best kernel of size $O(k^q)$. We generalize this result for
deciding q-colorability of a graph G, to deciding the existence of a
homomorphism from G to an arbitrary fixed graph H. Furthermore, we can replace
the parameter vertex cover by the less restrictive parameter twin-cover. We
prove that H-Coloring parameterized by Twin-Cover has a kernel of size
$O(k^{\Delta(H)}\log k)$.
Our second result shows that 3-Coloring does not admit non-trivial
sparsification: assuming NP is not a subset of coNP/poly, the parameterization
by the number of vertices n admits no (generalized) kernel of size $O(n^{2-e})$
for any e > 0. Previously, such a lower bound was only known for coloring with
q >= 4 colors.
| cs.CC cs.DS | the theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems here the aim is to reduce a qcoloring input to an equivalent but smaller input whose size is provably bounded in terms of structural properties such as the size of a minimum vertex cover in this paper we settle two open problems about data reduction for qcoloring first we obtain a kernel of bitsize okq1logk for qcoloring parameterized by vertex cover for any q 3 this size bound is optimal up to ko1 factors assuming np is not a subset of conppoly and improves on the previousbest kernel of size okq we generalize this result for deciding qcolorability of a graph g to deciding the existence of a homomorphism from g to an arbitrary fixed graph h furthermore we can replace the parameter vertex cover by the less restrictive parameter twincover we prove that hcoloring parameterized by twincover has a kernel of size okdeltahlog k our second result shows that 3coloring does not admit nontrivial sparsification assuming np is not a subset of conppoly the parameterization by the number of vertices n admits no generalized kernel of size on2e for any e 0 previously such a lower bound was only known for coloring with q 4 colors | [['the', 'theory', 'of', 'kernelization', 'can', 'be', 'used', 'to', 'rigorously', 'analyze', 'data', 'reduction', 'for', 'graph', 'coloring', 'problems', 'here', 'the', 'aim', 'is', 'to', 'reduce', 'a', 'qcoloring', 'input', 'to', 'an', 'equivalent', 'but', 'smaller', 'input', 'whose', 'size', 'is', 'provably', 'bounded', 'in', 'terms', 'of', 'structural', 'properties', 'such', 'as', 'the', 'size', 'of', 'a', 'minimum', 'vertex', 'cover', 'in', 'this', 'paper', 'we', 'settle', 'two', 'open', 'problems', 'about', 'data', 'reduction', 'for', 'qcoloring', 'first', 'we', 'obtain', 'a', 'kernel', 'of', 'bitsize', 'okq1logk', 'for', 'qcoloring', 'parameterized', 'by', 'vertex', 'cover', 'for', 'any', 'q', '3', 'this', 'size', 'bound', 'is', 'optimal', 'up', 'to', 'ko1', 'factors', 'assuming', 'np', 'is', 'not', 'a', 'subset', 'of', 'conppoly', 'and', 'improves', 'on', 'the', 'previousbest', 'kernel', 'of', 'size', 'okq', 'we', 'generalize', 'this', 'result', 'for', 'deciding', 'qcolorability', 'of', 'a', 'graph', 'g', 'to', 'deciding', 'the', 'existence', 'of', 'a', 'homomorphism', 'from', 'g', 'to', 'an', 'arbitrary', 'fixed', 'graph', 'h', 'furthermore', 'we', 'can', 'replace', 'the', 'parameter', 'vertex', 'cover', 'by', 'the', 'less', 'restrictive', 'parameter', 'twincover', 'we', 'prove', 'that', 'hcoloring', 'parameterized', 'by', 'twincover', 'has', 'a', 'kernel', 'of', 'size', 'okdeltahlog', 'k', 'our', 'second', 'result', 'shows', 'that', '3coloring', 'does', 'not', 'admit', 'nontrivial', 'sparsification', 'assuming', 'np', 'is', 'not', 'a', 'subset', 'of', 'conppoly', 'the', 'parameterization', 'by', 'the', 'number', 'of', 'vertices', 'n', 'admits', 'no', 'generalized', 'kernel', 'of', 'size', 'on2e', 'for', 'any', 'e', '0', 'previously', 'such', 'a', 'lower', 'bound', 'was', 'only', 'known', 'for', 'coloring', 'with', 'q', '4', 'colors']] | [-0.13013171165228068, 0.09177387171283564, -0.05932804978306411, 0.043129372553500744, -0.13398914176505058, -0.15412412620415644, 0.08391662617491204, 0.3469393562869213, -0.2953467341539051, -0.33729730799483754, 0.08139260358154951, -0.2634428904635743, -0.10080054463441705, 0.14682476769001887, -0.11320996817777909, 0.05695402936211654, 0.08257280637155331, 0.07663492529564316, -0.02586123786112737, -0.2803472669261585, 0.30373808104500527, -0.03180797841300124, 0.14471819597861862, 0.09766909647178615, 0.07954381118595068, 0.0300809127600154, 0.007668979302980006, 0.07278611219842873, -0.18917433153747837, 0.04501985780939105, 0.2680520794348836, 0.18846170316516822, 0.2659212504336167, -0.35124011844219194, -0.17745112217907305, 0.2232484145893804, 0.13309958479921555, 0.06175405111696039, 0.023251128931241552, -0.1673139586867321, 0.17033295010970462, -0.11012249045251381, -0.11064210703729518, -0.019680011409911373, 0.10268693846827816, -0.034837891090483894, -0.31479037677580934, -0.014274020474182353, 0.146877692120948, 0.0018625918287961255, 0.013794414323776783, -0.17941330543364442, 0.02201631247243356, 0.0770509433145413, -0.06771592909492374, 0.10999966546937469, 0.03495312469479229, -0.14259341895868557, -0.1303233263127151, 0.35601628430719884, -0.047674443130381404, -0.20703276887070388, 0.11320219233166426, -0.10164108438461664, -0.17622243378178348, 0.1482638932431915, 0.1366306440882562, 0.14213957287193763, -0.0915372400367189, 0.1877806556097875, -0.14123299388045865, 0.19807122446585534, 0.11791866005708775, 0.006421499372836912, 0.04263247310050896, 0.15677407502108032, 0.18069110904554173, 0.17709152907724882, -0.002076182433492726, 0.013315415176163827, -0.3238519010355785, -0.10603302151929321, -0.24107482806845967, 0.09026284512552334, -0.16567060161552424, -0.1880414114444561, 0.38078390347460905, 0.10824016061877566, 0.22507451111672536, 0.11640727917796799, 0.23066378780363483, 0.12222103745277439, 0.0729051545217988, 0.17863647348824002, 0.15008030554745347, 0.12429464903793165, -0.045320967378626974, -0.20118540169330248, 0.0948336751277869, 0.12164380246949372] |
1,802.02051 | The shape of convective core overshooting from gravity-mode period
spacings | The evolution of stars born with a convective core is highly dependent on the
efficiency and extent of near core mixing processes, which effectively
increases both the core mass and main-sequence lifetime. We investigate to what
extent gravity-mode period spacings in slowly pulsating B-type stars observed
by the Kepler mission can be used to constrain both the shape and extent of
convective core overshoot and additional mixing in the radiative envelope. We
compute grids of 1D stellar structure and evolution models for two different
shapes of convective core overshooting and three shapes of radiative envelope
mixing. The models in these grids are compared to a set of benchmark models to
evaluate their capability of mimicking the dipole prograde g-modes of the
benchmark models. Through our model comparisons we find that at a central
hydrogen content of Xc = 0.5, dipole prograde g-modes in the period range 0.8-3
d are capable of differentiating between step and exponential diffusive
overshooting. This ability disappears towards the terminal age main-sequence at
Xc = 0.1. Furthermore, the g-modes behave the same for the three different
shapes of radiative envelope mixing considered. However, a constant envelope
mixing requires a diffusion coefficient near the convective core five times
higher than chemical mixing from internal gravity waves to obtain a surface
nitrogen excess of about 0.5 dex within the main-sequence lifetime. Within
estimated frequency errors of the Kepler mission, the ability of g-modes to
distinguish between step and exponential diffusive overshooting depends on the
evolutionary stage. Combining information from the average period spacing and
observed surface abundances, notably nitrogen, could potentially be used to
constrain the shape of mixing in the radiative envelope of massive stars.
| astro-ph.SR | the evolution of stars born with a convective core is highly dependent on the efficiency and extent of near core mixing processes which effectively increases both the core mass and mainsequence lifetime we investigate to what extent gravitymode period spacings in slowly pulsating btype stars observed by the kepler mission can be used to constrain both the shape and extent of convective core overshoot and additional mixing in the radiative envelope we compute grids of 1d stellar structure and evolution models for two different shapes of convective core overshooting and three shapes of radiative envelope mixing the models in these grids are compared to a set of benchmark models to evaluate their capability of mimicking the dipole prograde gmodes of the benchmark models through our model comparisons we find that at a central hydrogen content of xc 05 dipole prograde gmodes in the period range 083 d are capable of differentiating between step and exponential diffusive overshooting this ability disappears towards the terminal age mainsequence at xc 01 furthermore the gmodes behave the same for the three different shapes of radiative envelope mixing considered however a constant envelope mixing requires a diffusion coefficient near the convective core five times higher than chemical mixing from internal gravity waves to obtain a surface nitrogen excess of about 05 dex within the mainsequence lifetime within estimated frequency errors of the kepler mission the ability of gmodes to distinguish between step and exponential diffusive overshooting depends on the evolutionary stage combining information from the average period spacing and observed surface abundances notably nitrogen could potentially be used to constrain the shape of mixing in the radiative envelope of massive stars | [['the', 'evolution', 'of', 'stars', 'born', 'with', 'a', 'convective', 'core', 'is', 'highly', 'dependent', 'on', 'the', 'efficiency', 'and', 'extent', 'of', 'near', 'core', 'mixing', 'processes', 'which', 'effectively', 'increases', 'both', 'the', 'core', 'mass', 'and', 'mainsequence', 'lifetime', 'we', 'investigate', 'to', 'what', 'extent', 'gravitymode', 'period', 'spacings', 'in', 'slowly', 'pulsating', 'btype', 'stars', 'observed', 'by', 'the', 'kepler', 'mission', 'can', 'be', 'used', 'to', 'constrain', 'both', 'the', 'shape', 'and', 'extent', 'of', 'convective', 'core', 'overshoot', 'and', 'additional', 'mixing', 'in', 'the', 'radiative', 'envelope', 'we', 'compute', 'grids', 'of', '1d', 'stellar', 'structure', 'and', 'evolution', 'models', 'for', 'two', 'different', 'shapes', 'of', 'convective', 'core', 'overshooting', 'and', 'three', 'shapes', 'of', 'radiative', 'envelope', 'mixing', 'the', 'models', 'in', 'these', 'grids', 'are', 'compared', 'to', 'a', 'set', 'of', 'benchmark', 'models', 'to', 'evaluate', 'their', 'capability', 'of', 'mimicking', 'the', 'dipole', 'prograde', 'gmodes', 'of', 'the', 'benchmark', 'models', 'through', 'our', 'model', 'comparisons', 'we', 'find', 'that', 'at', 'a', 'central', 'hydrogen', 'content', 'of', 'xc', '05', 'dipole', 'prograde', 'gmodes', 'in', 'the', 'period', 'range', '083', 'd', 'are', 'capable', 'of', 'differentiating', 'between', 'step', 'and', 'exponential', 'diffusive', 'overshooting', 'this', 'ability', 'disappears', 'towards', 'the', 'terminal', 'age', 'mainsequence', 'at', 'xc', '01', 'furthermore', 'the', 'gmodes', 'behave', 'the', 'same', 'for', 'the', 'three', 'different', 'shapes', 'of', 'radiative', 'envelope', 'mixing', 'considered', 'however', 'a', 'constant', 'envelope', 'mixing', 'requires', 'a', 'diffusion', 'coefficient', 'near', 'the', 'convective', 'core', 'five', 'times', 'higher', 'than', 'chemical', 'mixing', 'from', 'internal', 'gravity', 'waves', 'to', 'obtain', 'a', 'surface', 'nitrogen', 'excess', 'of', 'about', '05', 'dex', 'within', 'the', 'mainsequence', 'lifetime', 'within', 'estimated', 'frequency', 'errors', 'of', 'the', 'kepler', 'mission', 'the', 'ability', 'of', 'gmodes', 'to', 'distinguish', 'between', 'step', 'and', 'exponential', 'diffusive', 'overshooting', 'depends', 'on', 'the', 'evolutionary', 'stage', 'combining', 'information', 'from', 'the', 'average', 'period', 'spacing', 'and', 'observed', 'surface', 'abundances', 'notably', 'nitrogen', 'could', 'potentially', 'be', 'used', 'to', 'constrain', 'the', 'shape', 'of', 'mixing', 'in', 'the', 'radiative', 'envelope', 'of', 'massive', 'stars']] | [-0.06792226409289878, 0.1969067410775123, -0.04675059417343658, 0.11067572888577411, -0.068424587731884, -0.07626692581570883, 0.08816944099827737, 0.37495863685161684, -0.23137389226695118, -0.36224344945715176, 0.0507444007760015, -0.23946290400783546, -0.011962251359785812, 0.16050287792155438, -0.02785500948567605, 0.016034486104626263, 0.11274474189638672, -0.03660320614268868, -0.07560881880446053, -0.18233588222410882, 0.29736648102466395, 0.04815597339715485, 0.1679712935263102, -0.023760464410230085, 0.006950716093263548, -0.15942911383488378, -0.03423525907419389, -0.07012340753588933, -0.14923390519457377, 0.05655966567544543, 0.1826349341678471, 0.09641514407754269, 0.21114717503128896, -0.4120040916385588, -0.25011503505801014, 0.05789110739884115, 0.19786641603148883, 0.07198202937201975, -0.007072113890477551, -0.211706966927707, 0.053299294712327326, -0.18469097013471386, -0.16048473487878084, 0.007843561639226433, 0.0759052530184567, 0.02249368412573687, -0.2878897765381819, 0.10800659558204327, 0.05168298654852138, 0.07223654361871962, -0.09063945136976131, -0.16628855572249132, -0.13719374278857224, 0.1310715254856378, 0.052351790225129924, 0.010827837578118846, 0.15822780836184602, -0.10709499486907537, 0.0016297280317698808, 0.41199675710716593, -0.1486725117507719, -0.11089938860116662, 0.2118609209538208, -0.20093560166002344, -0.08762097836734029, 0.13944447950774885, 0.2008244907807186, 0.14288983019440016, -0.11241801485121486, -0.01823767091580363, 0.07045020564439018, 0.20390602104463681, 0.11023925053650864, 0.02171999258596612, 0.3011197861068059, 0.21159116300227848, 0.01819948432334375, 0.05699510335925616, -0.20133288266420687, -0.125604519207179, -0.22405717629210456, -0.0972767362786133, -0.09588868583070007, 0.021120390076986583, -0.1471194452567653, -0.15424369416744582, 0.38393262877513695, 0.13703148815598662, 0.18549118018742866, 0.04025269447078429, 0.28156965120823757, 0.08986753425262473, 0.09070122242348219, 0.11035166331160892, 0.3050094227259304, 0.2218969336084927, 0.09075287108198213, -0.32800246961330454, 0.09820427383828496, 0.0054417453576351745] |
1,802.02052 | Entanglement-ergodic quantum systems equilibrate exponentially well | One of the outstanding problems in non-equilibrium physics is to precisely
understand when and how physically relevant observables in many-body systems
equilibrate under unitary time evolution. General equilibration results show
that equilibration is generic provided that the initial state has overlap with
sufficiently many energy levels. But results not referring to typicality which
show that natural initial states actually fulfill this condition are lacking.
In this work, we present stringent results for equilibration for systems in
which Renyi entanglement entropies in energy eigenstates with finite energy
density are extensive for at least some, not necessarily connected, sub-system.
Our results reverse the logic of common arguments, in that we derive
equilibration from a weak condition akin to the eigenstate thermalization
hypothesis, which is usually attributed to thermalization in systems that are
assumed to equilibrate in the first place. We put the findings into the context
of studies of many-body localization and many-body scars.
| quant-ph cond-mat.stat-mech | one of the outstanding problems in nonequilibrium physics is to precisely understand when and how physically relevant observables in manybody systems equilibrate under unitary time evolution general equilibration results show that equilibration is generic provided that the initial state has overlap with sufficiently many energy levels but results not referring to typicality which show that natural initial states actually fulfill this condition are lacking in this work we present stringent results for equilibration for systems in which renyi entanglement entropies in energy eigenstates with finite energy density are extensive for at least some not necessarily connected subsystem our results reverse the logic of common arguments in that we derive equilibration from a weak condition akin to the eigenstate thermalization hypothesis which is usually attributed to thermalization in systems that are assumed to equilibrate in the first place we put the findings into the context of studies of manybody localization and manybody scars | [['one', 'of', 'the', 'outstanding', 'problems', 'in', 'nonequilibrium', 'physics', 'is', 'to', 'precisely', 'understand', 'when', 'and', 'how', 'physically', 'relevant', 'observables', 'in', 'manybody', 'systems', 'equilibrate', 'under', 'unitary', 'time', 'evolution', 'general', 'equilibration', 'results', 'show', 'that', 'equilibration', 'is', 'generic', 'provided', 'that', 'the', 'initial', 'state', 'has', 'overlap', 'with', 'sufficiently', 'many', 'energy', 'levels', 'but', 'results', 'not', 'referring', 'to', 'typicality', 'which', 'show', 'that', 'natural', 'initial', 'states', 'actually', 'fulfill', 'this', 'condition', 'are', 'lacking', 'in', 'this', 'work', 'we', 'present', 'stringent', 'results', 'for', 'equilibration', 'for', 'systems', 'in', 'which', 'renyi', 'entanglement', 'entropies', 'in', 'energy', 'eigenstates', 'with', 'finite', 'energy', 'density', 'are', 'extensive', 'for', 'at', 'least', 'some', 'not', 'necessarily', 'connected', 'subsystem', 'our', 'results', 'reverse', 'the', 'logic', 'of', 'common', 'arguments', 'in', 'that', 'we', 'derive', 'equilibration', 'from', 'a', 'weak', 'condition', 'akin', 'to', 'the', 'eigenstate', 'thermalization', 'hypothesis', 'which', 'is', 'usually', 'attributed', 'to', 'thermalization', 'in', 'systems', 'that', 'are', 'assumed', 'to', 'equilibrate', 'in', 'the', 'first', 'place', 'we', 'put', 'the', 'findings', 'into', 'the', 'context', 'of', 'studies', 'of', 'manybody', 'localization', 'and', 'manybody', 'scars']] | [-0.10922462626599315, 0.1973433836767646, -0.15239140519406646, 0.11631676770124805, 0.023945477441884577, -0.16781188713349893, 0.001181022176751867, 0.3305879862256054, -0.23159625331754796, -0.24895725782813602, 0.07863644306474414, -0.2537456412775148, -0.09316283370227259, 0.16649477427525103, -0.029412079443174758, 0.07384051638961721, 0.11508336720458158, 0.049980570313269516, -0.07507463465720464, -0.25394507442404957, 0.336476632565456, 0.034801275971786755, 0.2710545925840147, 0.12900291170770192, 0.020632062563795205, -0.02314633630234503, 0.07931603894777302, 0.017238145622142934, -0.15178879970148715, 0.071262379991439, 0.2876078197732568, 0.11809800840503733, 0.27476725539829777, -0.48206922976839306, -0.22619003221322936, 0.10484149588247467, 0.13377368998389053, 0.14999414721464027, -0.031103093852595378, -0.2665080203196818, 0.056284538715293535, -0.14344085581404598, -0.1396532140574173, -0.11346173314316395, 0.03299441763910612, -0.013287600775871206, -0.26275358293328044, 0.1253429769146207, 0.10390573622211569, 0.02188190365038616, -0.07544232270715599, -0.04144513249737333, 0.002123277871808233, 0.09312941862280193, 0.051651073968969285, -0.026365458936963574, 0.1147507847850456, -0.10111556427957687, -0.09099565761310882, 0.3820051371800027, -0.003269660841109917, -0.20372226517524963, 0.26525401167792123, -0.18961296382507212, -0.20922429455248148, 0.10662489174635419, 0.1218551799324096, 0.08563125554907233, -0.16710252803721615, 0.05135570413595384, -0.031482115866597986, 0.15500940220418238, 0.023113386028470767, 0.10954478372839635, 0.20589574380612344, 0.11530639608023002, 0.07339586345838861, 0.12100027680188712, 0.01860620871976655, -0.17150850135581813, -0.3304980297229792, -0.13261990800751128, -0.23250969880456596, 0.09857933119871488, 0.005180749714590523, -0.13312947043940718, 0.37357266654419763, 0.22168262655797757, 0.18848664503495552, 0.04561536492225347, 0.25619066038512084, 0.13665238501868626, 0.047747101098617635, 0.08222865068972551, 0.23516649080499374, 0.11474293297597844, 0.06810608538676445, -0.24662075504678987, 0.07334386857875966, 0.04841631808085367] |
1,802.02053 | Syst\`eme de traduction automatique statistique Anglais-Arabe | Machine translation (MT) is the process of translating text written in a
source language into text in a target language. In this article, we present our
English-Arabic statistical machine translation system. First, we present the
general process for setting up a statistical machine translation system, then
we describe the tools as well as the different corpora we used to build our MT
system. Our system was evaluated in terms of the BLUE score (24.51%)
| cs.CL cs.LG | machine translation mt is the process of translating text written in a source language into text in a target language in this article we present our englisharabic statistical machine translation system first we present the general process for setting up a statistical machine translation system then we describe the tools as well as the different corpora we used to build our mt system our system was evaluated in terms of the blue score 2451 | [['machine', 'translation', 'mt', 'is', 'the', 'process', 'of', 'translating', 'text', 'written', 'in', 'a', 'source', 'language', 'into', 'text', 'in', 'a', 'target', 'language', 'in', 'this', 'article', 'we', 'present', 'our', 'englisharabic', 'statistical', 'machine', 'translation', 'system', 'first', 'we', 'present', 'the', 'general', 'process', 'for', 'setting', 'up', 'a', 'statistical', 'machine', 'translation', 'system', 'then', 'we', 'describe', 'the', 'tools', 'as', 'well', 'as', 'the', 'different', 'corpora', 'we', 'used', 'to', 'build', 'our', 'mt', 'system', 'our', 'system', 'was', 'evaluated', 'in', 'terms', 'of', 'the', 'blue', 'score', '2451']] | [-0.05205398445596566, 0.013518945213306594, -0.08396165366473331, 0.09014027670988022, -0.06398962450691977, -0.10422070308689128, 0.06637129967251944, 0.40238944461216797, -0.3048150284165466, -0.2919332880929515, 0.06731015721310836, -0.27118868355614106, -0.11388841575968105, 0.23449224633844318, -0.1161200374339682, 0.11249165615142398, 0.10926012649528079, 0.08019534693527464, -0.020832316820962808, -0.2638925467743664, 0.31929407724355524, -0.017829048220773, 0.32594260480884163, -0.01419859504125811, 0.13492507658697464, -0.02959061963987109, -0.001283596597007803, -0.05928648949122509, -0.08063318287148266, 0.18196621630970086, 0.3017506478480189, 0.23890377690612868, 0.262488535762689, -0.33334150764386394, -0.1584306166859696, 0.02753950413190634, 0.15483571377557678, 0.14060112195265656, -0.013255375361925847, -0.3175131800408299, 0.0970510735799483, -0.199520021928726, 0.00565483677830245, -0.12162762386976061, 0.001688660040648805, -0.01604490407516022, -0.21123953415017976, -0.0003837157368055872, 0.1758553241143582, 0.16862631418012283, -0.0390648681834038, -0.11634584314762489, 0.0880160050504413, 0.17962468007101198, 0.05858585790564256, 0.16543144930934384, 0.1321110911000712, -0.10735100182717212, -0.13626479828805738, 0.4321256269877021, -0.13966537572795878, -0.24256958067417145, 0.18498631989633715, -0.0495711128177071, -0.22348218498361372, -0.014014258326308147, 0.28984046319650636, 0.09058880826735215, -0.229606617103658, 0.040192842747814754, -0.02454794793487275, 0.23532663970380216, 0.03807402921626596, -0.08318719401486797, 0.176466709619539, 0.27145162565835024, -0.07630796761981942, 0.21408426097115954, -0.08039355270601525, -0.058314115211770344, -0.29181318396601724, -0.2063854890497955, -0.14621693178117778, -0.009919034477600173, -0.02041469273358785, -0.14551856502185803, 0.39028629826734196, 0.19721330888569355, 0.14761232944658478, 0.12135646917630692, 0.2697201827666848, 0.08673564904224682, 0.07000971136211946, 0.08070761208875558, 0.15636272243903698, 0.01203097399588473, 0.20631601422320348, -0.13824689256128025, 0.03406284107021182, 0.04099978237236674] |
1,802.02054 | Synergies of THESEUS with the SKA: a brief report | We present a short report on the main synergies between Theseus and SKA in
the study of high-redshift transients and we summarize a few more aspects where
Theseus and SKA can contribute to explore fundamental physics in the universe.
| astro-ph.HE | we present a short report on the main synergies between theseus and ska in the study of highredshift transients and we summarize a few more aspects where theseus and ska can contribute to explore fundamental physics in the universe | [['we', 'present', 'a', 'short', 'report', 'on', 'the', 'main', 'synergies', 'between', 'theseus', 'and', 'ska', 'in', 'the', 'study', 'of', 'highredshift', 'transients', 'and', 'we', 'summarize', 'a', 'few', 'more', 'aspects', 'where', 'theseus', 'and', 'ska', 'can', 'contribute', 'to', 'explore', 'fundamental', 'physics', 'in', 'the', 'universe']] | [-0.11209334515166493, 0.12600385469312853, -0.03975527471182151, 0.1510948903667621, -0.12740784944393313, -0.03305458724021147, 0.03360539585805665, 0.38379181682681424, -0.21809057862712786, -0.31526355292552555, 0.12319414746852066, -0.28179593943059444, -0.17850420581033596, 0.24754351956578782, -0.010298791126563, -0.10007694779107204, 0.04120160691822187, -0.10387716714579326, -0.06992174009195505, -0.25424927482620263, 0.26851913075034434, 0.13460860656908688, 0.17452749535919, 0.04663762899163442, 0.0928329646300811, -0.0916532207495318, -0.14755811250935763, -0.04483564974119266, -0.19458308113882175, 0.11564637023286942, 0.3065752125798892, 0.2516984711639965, 0.3087778182174915, -0.4481786953715178, -0.1792604115863259, 0.09968638447567056, 0.13226749705007443, 0.09235033201865661, -0.05889384813781362, -0.2894266177780735, 0.022314862440674543, -0.17679913490055463, -0.11270238287173785, -0.06372396356593339, -0.006663652710043467, 0.10974298631891799, -0.09634474768207814, 0.03166525853941074, -0.017098843287198972, 0.010847435673125662, -0.04491170797831355, -0.08913700091533172, 0.13758127548946783, 0.1473424240755729, 0.026870761783077166, 0.040339011824331604, 0.07129345583514525, -0.21464875808511025, -0.10554639775401507, 0.45136960786886704, -0.09095019565369838, -0.001048543920310644, 0.22891055141838315, -0.26915265806019306, -0.24915339993551755, -0.03902269698655567, 0.2512696387294011, 0.06430167456467946, -0.1331455833159196, 0.05097055882484151, 0.060778822439412274, 0.22749257412476417, -0.040646398726564184, 0.11908792160176791, 0.3626280294205898, 0.2649003973660561, 0.07717226156726098, 0.15396591810843882, -0.11145965524543172, 0.004677632751946266, -0.35471422091508525, -0.163283246043974, -0.11096084877275504, 0.1172411836301669, -0.02977262359621445, -0.059089793966939815, 0.45506207683147526, 0.22848082098584527, 0.13893323725996873, 0.002202185133519845, 0.2678945157915736, -0.061321594847891576, 0.013960838413391357, 0.00634529876212279, 0.3254802221766649, 0.07912047532124397, 0.1287405092197542, -0.19044933219750723, 0.02185086687453664, 0.0229048317250533] |
1,802.02055 | Universal flows and automorphisms of $\mathcal P(\omega)/\mathrm{fin}$ | We prove that for every countable discrete group $G$, there is a $G$-flow on
$\omega^*$ that has every $G$-flow of weight $\leq\! \aleph_1$ as a quotient.
It follows that, under the Continuum Hypothesis, there is a universal $G$-flow
of weight $\leq\!\mathfrak{c}$.
Applying Stone duality, we deduce that, under \mathsf{CH}, there is a trivial
automorphism $\tau$ of $\mathcal P(\omega)/\mathrm{fin}$ with every other
automorphism embedded in it, which means that every other automorphism of
$\mathcal P(\omega)/\mathrm{fin}$ can be written as the restriction of $\tau$
to a suitably chosen subalgebra.
| math.GN math.DS math.LO | we prove that for every countable discrete group g there is a gflow on omega that has every gflow of weight leq aleph_1 as a quotient it follows that under the continuum hypothesis there is a universal gflow of weight leqmathfrakc applying stone duality we deduce that under mathsfch there is a trivial automorphism tau of mathcal pomegamathrmfin with every other automorphism embedded in it which means that every other automorphism of mathcal pomegamathrmfin can be written as the restriction of tau to a suitably chosen subalgebra | [['we', 'prove', 'that', 'for', 'every', 'countable', 'discrete', 'group', 'g', 'there', 'is', 'a', 'gflow', 'on', 'omega', 'that', 'has', 'every', 'gflow', 'of', 'weight', 'leq', 'aleph_1', 'as', 'a', 'quotient', 'it', 'follows', 'that', 'under', 'the', 'continuum', 'hypothesis', 'there', 'is', 'a', 'universal', 'gflow', 'of', 'weight', 'leqmathfrakc', 'applying', 'stone', 'duality', 'we', 'deduce', 'that', 'under', 'mathsfch', 'there', 'is', 'a', 'trivial', 'automorphism', 'tau', 'of', 'mathcal', 'pomegamathrmfin', 'with', 'every', 'other', 'automorphism', 'embedded', 'in', 'it', 'which', 'means', 'that', 'every', 'other', 'automorphism', 'of', 'mathcal', 'pomegamathrmfin', 'can', 'be', 'written', 'as', 'the', 'restriction', 'of', 'tau', 'to', 'a', 'suitably', 'chosen', 'subalgebra']] | [-0.18388716374153904, 0.13903364338468582, -0.1541670159924598, 0.014206638757882285, -0.09427279727311716, -0.18773769602246052, 0.026186464221349785, 0.39881007226982285, -0.3650097397067362, -0.13376855930047377, 0.12175404435783137, -0.25097557219366234, -0.11894812638915721, 0.19000223805570776, -0.1250210934252079, -0.037735100547295244, 0.08773488295264542, 0.14887085512635254, -0.06788809111596839, -0.22976133808316218, 0.3498017671074541, -0.08360055073474844, 0.17466500118773962, 0.04260895837935442, 0.14074046380950936, -0.003391976080213984, 0.06893146876245737, 0.029720405693210307, -0.14901722032360945, 0.016956948888643335, 0.2830799594576958, 0.14461189206035452, 0.25963411551977816, -0.3142016980550363, -0.1744569656217382, 0.25067498365284074, 0.11827026902271125, -0.07286514746097271, -0.04772858974181526, -0.23665820797240095, 0.17091507622085156, -0.1783979253156022, -0.13858629675814882, -0.045470150043478326, 0.1544435727188275, -0.06896551911320005, -0.2856022386501233, -0.028310375487697974, 0.14315186869463928, 0.07691639413436253, -0.013570975027202318, -0.07320653947646774, -0.14242721289130195, 0.09235768497455865, -0.009851190125724921, 0.15356930958417556, 0.08439535030352306, -0.022941601041349628, -0.09684653263095588, 0.4020416383781204, -0.08734428417491949, -0.2381484213595589, 0.12017141251514356, -0.1713056367090238, -0.24518594684611475, 0.08111893107915032, -0.0037635716448892794, 0.12575287406244093, -0.006253336511907123, 0.224393988560353, -0.236752815400472, 0.16831170330711065, 0.098448363143862, -0.0007147088680150253, 0.10781902223381967, 0.12333596251361693, 0.145014338006842, 0.15309051539294333, 0.06313508594480698, 0.06671333779203928, -0.4021157198363826, -0.16847247006149874, -0.17576852650381625, 0.17938557891396895, -0.08784776492393576, -0.16279389517426135, 0.32568417159130886, 0.08094543644914493, 0.1389713687174316, 0.11870398005564875, 0.17599256822307194, 0.1164950215302053, 0.12174933436991912, 0.14760995744949296, 0.09651907125399226, 0.1758278147760956, -0.11460469543401684, -0.13661343221264405, 0.04304746437853845, 0.17909228219650686] |
1,802.02056 | Differential refraction, 2017 winter solstice timing and true ecliptic
obliquity measured at the meridian line of Santa Maria degli Angeli in Rome | The declination of the Sun along the year varies according to a sinusoid.
Around the solstices this curve is approximated by a parabola. In kinematics a
parabola is obtained with a constant acceleration. This acceleration has been
estimated in the days 21-29 December 2017, from the measurements taken at the
meridian line in the Basilica of Santa Maria degli Angeli in Rome made by
Francesco Bianchini in 1702 with purpose of measuring the variation of the
obliquity of the ecliptic. The parabola equation is fitted to the data to
obtain the solstice's instant with an accuracy of one hour. The departure of
the measures is within 4 arcsec (the daytime seeing during these solar
transits) from the ephemerides of IMCCE. The pipeline of the algorithm used to
obtain the angular data of the center of the Sun, starting from the ground
measurements affected by the atmospheric refraction, and corrected by the
Cassini equation, is described. Bianchini in 1703 reduced the error on the
solstices timings by using the difference in right ascension between the Sun
and a star observed at the same meridian line even in daytime (as he did with
Sirius in June-July 1703). The present one is an absolute measurement, without
stellar references. The meridian diameter is averagely measured 24 arcsec less
than the true value, with 20 arcsec of standard deviation, because of different
luminosity contrasts in the sky and in the Basilica. Conversely the center of
the image is much better defined (the contrast acts symmetrically without
moving the center of the image), allowing an accuracy to the nearest arcsecond
in the determination of the true obliquity.
| physics.pop-ph physics.hist-ph | the declination of the sun along the year varies according to a sinusoid around the solstices this curve is approximated by a parabola in kinematics a parabola is obtained with a constant acceleration this acceleration has been estimated in the days 2129 december 2017 from the measurements taken at the meridian line in the basilica of santa maria degli angeli in rome made by francesco bianchini in 1702 with purpose of measuring the variation of the obliquity of the ecliptic the parabola equation is fitted to the data to obtain the solstices instant with an accuracy of one hour the departure of the measures is within 4 arcsec the daytime seeing during these solar transits from the ephemerides of imcce the pipeline of the algorithm used to obtain the angular data of the center of the sun starting from the ground measurements affected by the atmospheric refraction and corrected by the cassini equation is described bianchini in 1703 reduced the error on the solstices timings by using the difference in right ascension between the sun and a star observed at the same meridian line even in daytime as he did with sirius in junejuly 1703 the present one is an absolute measurement without stellar references the meridian diameter is averagely measured 24 arcsec less than the true value with 20 arcsec of standard deviation because of different luminosity contrasts in the sky and in the basilica conversely the center of the image is much better defined the contrast acts symmetrically without moving the center of the image allowing an accuracy to the nearest arcsecond in the determination of the true obliquity | [['the', 'declination', 'of', 'the', 'sun', 'along', 'the', 'year', 'varies', 'according', 'to', 'a', 'sinusoid', 'around', 'the', 'solstices', 'this', 'curve', 'is', 'approximated', 'by', 'a', 'parabola', 'in', 'kinematics', 'a', 'parabola', 'is', 'obtained', 'with', 'a', 'constant', 'acceleration', 'this', 'acceleration', 'has', 'been', 'estimated', 'in', 'the', 'days', '2129', 'december', '2017', 'from', 'the', 'measurements', 'taken', 'at', 'the', 'meridian', 'line', 'in', 'the', 'basilica', 'of', 'santa', 'maria', 'degli', 'angeli', 'in', 'rome', 'made', 'by', 'francesco', 'bianchini', 'in', '1702', 'with', 'purpose', 'of', 'measuring', 'the', 'variation', 'of', 'the', 'obliquity', 'of', 'the', 'ecliptic', 'the', 'parabola', 'equation', 'is', 'fitted', 'to', 'the', 'data', 'to', 'obtain', 'the', 'solstices', 'instant', 'with', 'an', 'accuracy', 'of', 'one', 'hour', 'the', 'departure', 'of', 'the', 'measures', 'is', 'within', '4', 'arcsec', 'the', 'daytime', 'seeing', 'during', 'these', 'solar', 'transits', 'from', 'the', 'ephemerides', 'of', 'imcce', 'the', 'pipeline', 'of', 'the', 'algorithm', 'used', 'to', 'obtain', 'the', 'angular', 'data', 'of', 'the', 'center', 'of', 'the', 'sun', 'starting', 'from', 'the', 'ground', 'measurements', 'affected', 'by', 'the', 'atmospheric', 'refraction', 'and', 'corrected', 'by', 'the', 'cassini', 'equation', 'is', 'described', 'bianchini', 'in', '1703', 'reduced', 'the', 'error', 'on', 'the', 'solstices', 'timings', 'by', 'using', 'the', 'difference', 'in', 'right', 'ascension', 'between', 'the', 'sun', 'and', 'a', 'star', 'observed', 'at', 'the', 'same', 'meridian', 'line', 'even', 'in', 'daytime', 'as', 'he', 'did', 'with', 'sirius', 'in', 'junejuly', '1703', 'the', 'present', 'one', 'is', 'an', 'absolute', 'measurement', 'without', 'stellar', 'references', 'the', 'meridian', 'diameter', 'is', 'averagely', 'measured', '24', 'arcsec', 'less', 'than', 'the', 'true', 'value', 'with', '20', 'arcsec', 'of', 'standard', 'deviation', 'because', 'of', 'different', 'luminosity', 'contrasts', 'in', 'the', 'sky', 'and', 'in', 'the', 'basilica', 'conversely', 'the', 'center', 'of', 'the', 'image', 'is', 'much', 'better', 'defined', 'the', 'contrast', 'acts', 'symmetrically', 'without', 'moving', 'the', 'center', 'of', 'the', 'image', 'allowing', 'an', 'accuracy', 'to', 'the', 'nearest', 'arcsecond', 'in', 'the', 'determination', 'of', 'the', 'true', 'obliquity']] | [-0.07456073362717054, 0.08627383703016031, -0.08127145887032707, 0.037078972402410204, -0.047829447011721093, -0.07623352632064001, 0.03344878233654332, 0.36137927728069336, -0.2125165009015408, -0.36986359283826364, 0.1326651436893606, -0.3178080671752126, -0.021768897733173413, 0.20299069490197813, -0.12165193381694375, -0.007400462604935429, 0.07307569368061957, 0.04860282900427018, -0.07894735161955657, -0.23888118683473925, 0.2121110909096072, 0.11632994852437745, 0.17113424514504527, -0.018973067246473692, 0.11791588952060363, -0.004936920929136532, -0.06170174014854255, -0.04468646813491707, -0.12238344641890363, 0.07995005698214763, 0.18752096287091694, 0.10319317041593862, 0.21719633569817207, -0.35207851465818957, -0.12849565491688564, 0.05357125837001881, 0.09884060535758624, 0.021772735856982067, 0.02108363819444325, -0.32935251484580363, 0.0333365798460464, -0.11433358471651606, -0.18840335673271125, 0.12295632109834685, 0.05749528574313955, 0.005293488021376388, -0.2149615838257699, 0.09409661799655519, 0.01325430655577031, 0.16562324214719812, -0.09416469298234395, -0.13654754221494347, -0.06521858096679742, 0.1504792013373982, 0.03626091166303194, 0.1316586925263252, 0.11660942844393564, -0.07907170366592073, -0.056837151204218665, 0.4122852311912938, -0.10736265097946879, -0.08398302667860176, 0.097139564880627, -0.23787156510900542, -0.08604008861047618, 0.1624138024025614, 0.12966045132980808, 0.08398441902990711, -0.1292938000103287, 0.04289082132692374, -0.028357095241450407, 0.18853973931327078, 0.13044724897636148, -0.0702399758508642, 0.2376594261272305, 0.1106424252841986, 0.07379919523545077, 0.07263012450296652, -0.2647486437181684, -0.0604282481219135, -0.2518465682826386, -0.12379593175502555, -0.15443344962889693, 0.025540296618134638, -0.10493584886190913, -0.10257549579272467, 0.40042168990540494, 0.13930385212011884, 0.1985936313738696, 0.01570484431836809, 0.2925141617377388, 0.07998221812037772, 0.07941823527715221, 0.09248078930083442, 0.3270750398785426, 0.12183424394931713, 0.15466366724645533, -0.19618556761600392, 0.07608974394062018, 0.06023945800128403] |
1,802.02057 | Adaptive operation strategy for voltage stability enhancement in active
DMFCs | An adaptive operation strategy for on-demand control of active direct
methanol fuel cells (DMFCs) is proposed as an alternative method to enhance the
voltage stability. A simplified semi-empirical model is firstly developed to
describe I-V relationships based on uniform-designed experiments. It is then
embedded into multi-objective optimizations to construct the adaptive operation
strategy. Experimental studies are implemented on different DMFC systems to
validate the proposed semi-empirical model, control strategy and system
response to operational adjustments. Numerical simulations are also performed
to investigate the underlying mechanisms of the proposed adaptive operation
strategy. The results show that the adaptive operation strategy provides
possibilities for voltage stability enhancement without the sacrifice of energy
conversion efficiency. The adaptive operations are also found to be able to
extend the range of operating current density or to decrease the voltage
deviation according to one's requirements. Moreover, the response of DMFCs to
operational adjustments is quick, which further validates the effectiveness and
feasibility of the adaptive operation strategy in practical applications. The
proposed strategy contributes to a guideline for the better control of output
voltage from operating DMFC systems.
| physics.app-ph physics.flu-dyn | an adaptive operation strategy for ondemand control of active direct methanol fuel cells dmfcs is proposed as an alternative method to enhance the voltage stability a simplified semiempirical model is firstly developed to describe iv relationships based on uniformdesigned experiments it is then embedded into multiobjective optimizations to construct the adaptive operation strategy experimental studies are implemented on different dmfc systems to validate the proposed semiempirical model control strategy and system response to operational adjustments numerical simulations are also performed to investigate the underlying mechanisms of the proposed adaptive operation strategy the results show that the adaptive operation strategy provides possibilities for voltage stability enhancement without the sacrifice of energy conversion efficiency the adaptive operations are also found to be able to extend the range of operating current density or to decrease the voltage deviation according to ones requirements moreover the response of dmfcs to operational adjustments is quick which further validates the effectiveness and feasibility of the adaptive operation strategy in practical applications the proposed strategy contributes to a guideline for the better control of output voltage from operating dmfc systems | [['an', 'adaptive', 'operation', 'strategy', 'for', 'ondemand', 'control', 'of', 'active', 'direct', 'methanol', 'fuel', 'cells', 'dmfcs', 'is', 'proposed', 'as', 'an', 'alternative', 'method', 'to', 'enhance', 'the', 'voltage', 'stability', 'a', 'simplified', 'semiempirical', 'model', 'is', 'firstly', 'developed', 'to', 'describe', 'iv', 'relationships', 'based', 'on', 'uniformdesigned', 'experiments', 'it', 'is', 'then', 'embedded', 'into', 'multiobjective', 'optimizations', 'to', 'construct', 'the', 'adaptive', 'operation', 'strategy', 'experimental', 'studies', 'are', 'implemented', 'on', 'different', 'dmfc', 'systems', 'to', 'validate', 'the', 'proposed', 'semiempirical', 'model', 'control', 'strategy', 'and', 'system', 'response', 'to', 'operational', 'adjustments', 'numerical', 'simulations', 'are', 'also', 'performed', 'to', 'investigate', 'the', 'underlying', 'mechanisms', 'of', 'the', 'proposed', 'adaptive', 'operation', 'strategy', 'the', 'results', 'show', 'that', 'the', 'adaptive', 'operation', 'strategy', 'provides', 'possibilities', 'for', 'voltage', 'stability', 'enhancement', 'without', 'the', 'sacrifice', 'of', 'energy', 'conversion', 'efficiency', 'the', 'adaptive', 'operations', 'are', 'also', 'found', 'to', 'be', 'able', 'to', 'extend', 'the', 'range', 'of', 'operating', 'current', 'density', 'or', 'to', 'decrease', 'the', 'voltage', 'deviation', 'according', 'to', 'ones', 'requirements', 'moreover', 'the', 'response', 'of', 'dmfcs', 'to', 'operational', 'adjustments', 'is', 'quick', 'which', 'further', 'validates', 'the', 'effectiveness', 'and', 'feasibility', 'of', 'the', 'adaptive', 'operation', 'strategy', 'in', 'practical', 'applications', 'the', 'proposed', 'strategy', 'contributes', 'to', 'a', 'guideline', 'for', 'the', 'better', 'control', 'of', 'output', 'voltage', 'from', 'operating', 'dmfc', 'systems']] | [-0.08974397927002367, 0.006241724298461783, -0.09118811172490429, 0.026304104695793803, -0.07816114507136898, -0.1880333322833953, 0.1171500508168806, 0.42312925496247894, -0.25694472642677874, -0.33929944089900016, 0.11291883552548418, -0.18069707324686746, -0.1554139226937781, 0.250510084607987, -0.1044334797552844, 0.0850938952673622, 0.045130009481334776, -0.043567440713178265, -0.03666764670965397, -0.24251213708928884, 0.22086300216250995, 0.1506129089279839, 0.370787712323932, 0.022502126419323615, 0.10397834457228138, -0.019057797793527887, -0.023221614696449656, 0.010864440813117892, -0.11679891041661619, 0.10038714103307055, 0.2712423857613649, 0.13946923883059503, 0.3083658264182487, -0.4301142425265933, -0.2094832775183022, 0.052824680751330066, 0.08862633887657573, 0.07338630113498354, -0.07282326852658233, -0.22259572421476329, 0.11041623183302374, -0.20496410698312537, -0.12012442306995226, -0.12550028631926707, -0.02334725394761762, 0.0440007689293193, -0.3551649218945447, -0.020039555376366966, 0.01577368071000352, 0.012388737285613764, -0.08396566490767597, -0.10225033932222397, -0.01348234413389387, 0.12395807089252844, -0.03183279719656364, -0.033856593025588126, 0.2143824623309742, -0.06171286343492817, -0.17187866516926392, 0.34156068170953063, -0.02499532344095492, -0.20245282179493895, 0.19095112174338344, -0.03685025600508355, -0.06460078641012644, 0.13905930757690377, 0.20417099161978874, 0.0744072418912267, -0.16560520852757254, 0.013369682918084193, 0.052185429256882875, 0.17877716884308353, 0.009990952576005924, 0.02880592937399139, 0.15350761136830934, 0.2573842896530977, 0.1097353899424802, 0.1415281392557172, -0.07986497181950933, -0.10517351932279953, -0.2689228433616168, -0.12754415932980329, -0.12041766246307288, -0.035045532914211544, -0.037709476043504025, -0.0900515027593967, 0.41125778936099405, 0.2321090461405296, 0.1109649047838243, 0.04967280607033188, 0.3787511907226547, 0.1085771782025851, 0.08768283136061512, 0.020374369084335573, 0.2504824721280423, 0.08670725260845609, 0.134254313224937, -0.2959780211276869, 0.06980836961428796, 0.033844446832334944] |
1,802.02058 | Effect of spin relaxations on the spin mixing conductances for a bilayer
structure | The spin current can result in a spin-transfer torque in the
normal-metal(NM)|ferromagnetic-insulator(FMI) or
normal-metal(NM)|ferromagnetic-metal(FMM) bilayer. In the earlier study on this
issue, the spin relaxations were ignored or introduced phenomenologically. In
this paper, considering the FMM or FMI with spin relaxations described by a
non-Hermitian Hamiltonian, we derive an effective spin-transfer torque and an
effective spin mixing conductance in the non-Hermitian bilayer. The dependence
of the effective spin mixing conductance on the system parameters (such as
insulating gap, \textit{s-d} coupling, and layer thickness) as well as the
relations between the real part and the imaginary part of the effective spin
mixing conductance are given and discussed. We find that the effective spin
mixing conductance can be enhanced in the non-Hermitian system. This provides
us with the possibility to enhance the spin mixing conductance.
| cond-mat.mes-hall quant-ph | the spin current can result in a spintransfer torque in the normalmetalnmferromagneticinsulatorfmi or normalmetalnmferromagneticmetalfmm bilayer in the earlier study on this issue the spin relaxations were ignored or introduced phenomenologically in this paper considering the fmm or fmi with spin relaxations described by a nonhermitian hamiltonian we derive an effective spintransfer torque and an effective spin mixing conductance in the nonhermitian bilayer the dependence of the effective spin mixing conductance on the system parameters such as insulating gap textitsd coupling and layer thickness as well as the relations between the real part and the imaginary part of the effective spin mixing conductance are given and discussed we find that the effective spin mixing conductance can be enhanced in the nonhermitian system this provides us with the possibility to enhance the spin mixing conductance | [['the', 'spin', 'current', 'can', 'result', 'in', 'a', 'spintransfer', 'torque', 'in', 'the', 'normalmetalnmferromagneticinsulatorfmi', 'or', 'normalmetalnmferromagneticmetalfmm', 'bilayer', 'in', 'the', 'earlier', 'study', 'on', 'this', 'issue', 'the', 'spin', 'relaxations', 'were', 'ignored', 'or', 'introduced', 'phenomenologically', 'in', 'this', 'paper', 'considering', 'the', 'fmm', 'or', 'fmi', 'with', 'spin', 'relaxations', 'described', 'by', 'a', 'nonhermitian', 'hamiltonian', 'we', 'derive', 'an', 'effective', 'spintransfer', 'torque', 'and', 'an', 'effective', 'spin', 'mixing', 'conductance', 'in', 'the', 'nonhermitian', 'bilayer', 'the', 'dependence', 'of', 'the', 'effective', 'spin', 'mixing', 'conductance', 'on', 'the', 'system', 'parameters', 'such', 'as', 'insulating', 'gap', 'textitsd', 'coupling', 'and', 'layer', 'thickness', 'as', 'well', 'as', 'the', 'relations', 'between', 'the', 'real', 'part', 'and', 'the', 'imaginary', 'part', 'of', 'the', 'effective', 'spin', 'mixing', 'conductance', 'are', 'given', 'and', 'discussed', 'we', 'find', 'that', 'the', 'effective', 'spin', 'mixing', 'conductance', 'can', 'be', 'enhanced', 'in', 'the', 'nonhermitian', 'system', 'this', 'provides', 'us', 'with', 'the', 'possibility', 'to', 'enhance', 'the', 'spin', 'mixing', 'conductance']] | [-0.19544065646286912, 0.21138550189278402, -0.019857001281165666, 0.020694851890412508, -0.048057715827954636, -0.12305783237977565, 0.021593351891968142, 0.3473380683487608, -0.3034422740692145, -0.32284188316068574, 0.020967445945907527, -0.25606353178207997, -0.18867865699442915, 0.16962227665726806, 0.022587296073076153, 0.034842516213854535, -0.024990469793156358, -0.030441911830673463, -0.10496829887709887, -0.16780663556099393, 0.28917411999165554, 0.0168079471691931, 0.23172517144298962, 0.11712094752174866, 0.035123089616336214, 0.03837482917357151, 0.0890394279001039, 0.00962002258321256, -0.13374957326607012, 0.04569660901369257, 0.22236176639909053, -0.10230223398001595, 0.13327021516489845, -0.4491705865464138, -0.1717732501783202, 0.008648928997768018, 0.15997476118282622, 0.17362780913084974, -0.023637051102243192, -0.2814607075948752, -0.01970592275517815, -0.22282255630769576, -0.09953461963068409, -0.11204631242702026, 0.008102056367735144, -0.07490771568294985, -0.2775519852853515, 0.11222579256779841, 0.11112460504083375, 0.06234854667355086, -0.03669005607873315, -0.1565830413383638, -0.07244194656048851, 0.09091060573611949, 0.06751951488545378, 0.006540699259427781, 0.1644878722158552, -0.10364559102440893, -0.1211702871449178, 0.31365433530099973, -0.10730349604317649, -0.2213775667980427, 0.13625053558782993, -0.13571068840385733, -0.05496486272122569, 0.055344907040814406, 0.12065319173777377, 0.09353245776288836, -0.1602192908696091, 0.09898575738554274, -0.012554543327454848, 0.12526240982541828, 0.028585350876745148, 0.04817733295503577, 0.262244445421086, 0.21052897308832247, 0.09558471913257514, 0.14181319094095948, -0.09467991397677003, -0.0915968993230801, -0.22109214646585343, -0.14908929135764146, -0.23854939159155175, 0.11313373490968961, -0.0803045594548444, -0.15449760662647719, 0.45892911711494433, 0.1889433618990406, 0.2053849086634644, -0.00015598524162787518, 0.30331770591757734, 0.19848697138185975, 0.10086532205677386, 0.028140925889379765, 0.2850721674111053, 0.19706172119463503, 0.13186426392493358, -0.3557913663534035, 0.0806693906419491, 0.009534465321446306] |
1,802.02059 | One-sided continuity properties for the Schonmann projection | We consider the plus-phase of the two-dimensional Ising model below the
critical temperature. In $1989$ Schonmann proved that the projection of this
measure onto a one-dimensional line is not a Gibbs measure. After many years of
continued research which have revealed further properties of this measure, the
question whether or not it is a Gibbs measure in an almost sure sense remains
open.
In this paper we study the same measure by interpreting it as a temporal
process. One of our main results is that the Schonmann projection is almost
surely a regular $g$-measure. That is, it does possess the corresponding
one-sided notion of almost Gibbsianness. We further deduce strong one-sided
mixing properties which are of independent interest. Our proofs make use of
classical coupling techniques and some monotonicity properties which are known
to hold for one-sided, but not two-sided conditioning for FKG measures.
| math.PR | we consider the plusphase of the twodimensional ising model below the critical temperature in 1989 schonmann proved that the projection of this measure onto a onedimensional line is not a gibbs measure after many years of continued research which have revealed further properties of this measure the question whether or not it is a gibbs measure in an almost sure sense remains open in this paper we study the same measure by interpreting it as a temporal process one of our main results is that the schonmann projection is almost surely a regular gmeasure that is it does possess the corresponding onesided notion of almost gibbsianness we further deduce strong onesided mixing properties which are of independent interest our proofs make use of classical coupling techniques and some monotonicity properties which are known to hold for onesided but not twosided conditioning for fkg measures | [['we', 'consider', 'the', 'plusphase', 'of', 'the', 'twodimensional', 'ising', 'model', 'below', 'the', 'critical', 'temperature', 'in', '1989', 'schonmann', 'proved', 'that', 'the', 'projection', 'of', 'this', 'measure', 'onto', 'a', 'onedimensional', 'line', 'is', 'not', 'a', 'gibbs', 'measure', 'after', 'many', 'years', 'of', 'continued', 'research', 'which', 'have', 'revealed', 'further', 'properties', 'of', 'this', 'measure', 'the', 'question', 'whether', 'or', 'not', 'it', 'is', 'a', 'gibbs', 'measure', 'in', 'an', 'almost', 'sure', 'sense', 'remains', 'open', 'in', 'this', 'paper', 'we', 'study', 'the', 'same', 'measure', 'by', 'interpreting', 'it', 'as', 'a', 'temporal', 'process', 'one', 'of', 'our', 'main', 'results', 'is', 'that', 'the', 'schonmann', 'projection', 'is', 'almost', 'surely', 'a', 'regular', 'gmeasure', 'that', 'is', 'it', 'does', 'possess', 'the', 'corresponding', 'onesided', 'notion', 'of', 'almost', 'gibbsianness', 'we', 'further', 'deduce', 'strong', 'onesided', 'mixing', 'properties', 'which', 'are', 'of', 'independent', 'interest', 'our', 'proofs', 'make', 'use', 'of', 'classical', 'coupling', 'techniques', 'and', 'some', 'monotonicity', 'properties', 'which', 'are', 'known', 'to', 'hold', 'for', 'onesided', 'but', 'not', 'twosided', 'conditioning', 'for', 'fkg', 'measures']] | [-0.08549487940483512, 0.12323813263167728, -0.11630249652568694, 0.0785039357904336, -0.039342759323625506, -0.1394909827032133, 0.04793294186466145, 0.3987584277935378, -0.30352147397669876, -0.20916835317010438, 0.16947561713958068, -0.25474918798471874, -0.12337818170182889, 0.2117118140832371, -0.08909967669995723, 0.04679596925339942, 0.050860605511970663, 0.05134046807807017, -0.06254714105597378, -0.2522786733453403, 0.31574241577328505, 0.030861423093617172, 0.27141291750399593, 0.08557324967236368, 0.08186543170831628, -0.002365790089344853, -0.030458091706089624, 0.01740019043933574, -0.1634601941844591, 0.08276248457548502, 0.19328317322305866, 0.12739376423727206, 0.2990189124536994, -0.31247567153255734, -0.2104718478956631, 0.170471955674466, 0.11556456298274281, 0.05896061247335161, -0.03939160483606791, -0.255791551550733, 0.10314892254724213, -0.11565225119735081, -0.18797717840977377, -0.08354416300812932, 0.022673779369130002, 0.021850437070796643, -0.23674483390580342, 0.06434132686288624, 0.2000128973171219, 0.04653638608467121, -0.03674780715979844, -0.05437833258322069, 0.0018730496880240166, 0.1325369723828288, 0.04973273471928319, 0.035040372023619454, 0.07720546010178286, -0.07486164362586618, -0.12489085640087463, 0.341508633603661, -0.05603006157138339, -0.20629280281963047, 0.2106827449210646, -0.18268172462939747, -0.18019627050946016, 0.07944818556966533, 0.09183473123068159, 0.11297076278353123, -0.18378946987807854, 0.1109611127664778, -0.13443802189166573, 0.15263261106756673, 0.06982516423128285, 0.05017268869999822, 0.16586599624601772, 0.12631245253288506, 0.13771481404261715, 0.13844714178443215, -0.01884448602209454, -0.0992593885467785, -0.28932837047776977, -0.19574582203571406, -0.2029961369397653, 0.10530806016663359, -0.049293463082452485, -0.23515365034393915, 0.346984372542637, 0.1722308760700207, 0.19651361053705318, 0.07235117874619505, 0.2401331856991718, 0.12838411835995925, 0.02832227477794057, 0.088200156109642, 0.23008376540851427, 0.1680756972116008, 0.0563682166784611, -0.14209396298893343, 0.10598757853275621, 0.0793155215556857] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.