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.0986 | CCP: Conflicts Check Protocol for Bitcoin Block Security | In this work, we present our early stage results on a Conflicts Check
Protocol (CCP) that enables preventing potential attacks on bitcoin system.
Based on the observation and discovery of a common symptom that many attacks
may generate, CCP refines the current bitcoin systems by proposing a novel
arbitration mechanism that is capable to determine the approval or abandon of
certain transactions involved in confliction. This work examines the security
issue of bitcoin from a new perspective, which may extend to a larger scope of
attack analysis and prevention
| cs.CR | in this work we present our early stage results on a conflicts check protocol ccp that enables preventing potential attacks on bitcoin system based on the observation and discovery of a common symptom that many attacks may generate ccp refines the current bitcoin systems by proposing a novel arbitration mechanism that is capable to determine the approval or abandon of certain transactions involved in confliction this work examines the security issue of bitcoin from a new perspective which may extend to a larger scope of attack analysis and prevention | [['in', 'this', 'work', 'we', 'present', 'our', 'early', 'stage', 'results', 'on', 'a', 'conflicts', 'check', 'protocol', 'ccp', 'that', 'enables', 'preventing', 'potential', 'attacks', 'on', 'bitcoin', 'system', 'based', 'on', 'the', 'observation', 'and', 'discovery', 'of', 'a', 'common', 'symptom', 'that', 'many', 'attacks', 'may', 'generate', 'ccp', 'refines', 'the', 'current', 'bitcoin', 'systems', 'by', 'proposing', 'a', 'novel', 'arbitration', 'mechanism', 'that', 'is', 'capable', 'to', 'determine', 'the', 'approval', 'or', 'abandon', 'of', 'certain', 'transactions', 'involved', 'in', 'confliction', 'this', 'work', 'examines', 'the', 'security', 'issue', 'of', 'bitcoin', 'from', 'a', 'new', 'perspective', 'which', 'may', 'extend', 'to', 'a', 'larger', 'scope', 'of', 'attack', 'analysis', 'and', 'prevention']] | [-0.1846615696781095, 0.009484244086727333, -0.09857110296025495, 0.04664735750719026, -0.13162542396130855, -0.2027566977671944, 0.1842940523461805, 0.274537764918687, -0.23662453765321648, -0.2855172995268629, 0.15062154646900094, -0.24182203516698955, -0.19212127719963953, 0.17809618545664746, -0.15959285935282372, 0.03221498655804088, 0.05493288858678569, -0.02368516549520362, 0.00041131411281445724, -0.27903867538055677, 0.3426385927681152, 0.09039364073404603, 0.318190389951126, 0.10841197155813655, 0.0696711275527735, 0.0299348433415688, -0.052676491617235574, -0.03128178669872244, -0.07970789659713079, 0.14118209743893215, 0.26892665031449764, 0.23620700067448105, 0.3986937100842093, -0.43711146329309836, -0.19270538044910293, 0.09137450467292847, 0.1054101618519576, 0.1369760011210305, -0.06036529842675192, -0.30018514137338387, 0.10926315103647079, -0.2585773851324836, -0.12049434644306141, -0.0943870342367988, -0.013495133175341978, -0.023015637074340803, -0.23207869850559515, 0.006715860228273976, 0.07380273633144713, 0.024010644310017985, -0.017816204504434312, -0.0339000278945196, 0.04237249718842965, 0.08531238795310427, 0.06706937625114753, -0.024625194296920987, 0.16659200762848506, -0.09443991961614281, -0.2064393089765034, 0.35689611094637536, 0.0009534326125279049, -0.08342499006539583, 0.18487030378375413, -0.016856728103325776, -0.19544965363097158, 0.06427370380149798, 0.20698030961133287, 0.10243147532269228, -0.19256453956948238, -0.020657082952904315, -0.03804401678734281, 0.20699869600919943, 0.05461093584556928, 0.0032876397148193267, 0.21639719003225477, 0.20972183415812723, 0.08390749666481435, 0.12854316195190538, -0.03884912098318422, -0.117816925745358, -0.2527816542162654, -0.14288217569452846, -0.1393883620425431, 0.029923618400961246, -0.0016225075693879528, -0.14516852153569795, 0.43038676035580004, 0.271903392777705, 0.16060252653518586, 0.05289637438136707, 0.3548560310364439, -0.0064496098523122375, 0.08519379344632787, 0.07639654722912342, 0.21028938096571254, -0.0207541667715008, 0.14006639220176287, -0.17398660240977418, 0.21761733704257044, 0.027097031332845432] |
1,802.09861 | Pressure-induced dimerization and valence bond crystal formation in the
Kitaev-Heisenberg magnet alpha-RuCl3 | Magnetization and high-resolution x-ray diffraction measurements of the
Kitaev-Heisenberg material alpha-RuCl3 reveal a pressure-induced
crystallographic and magnetic phase transition at a hydrostatic pressure of
p=0.2 GPa. This structural transition into a triclinic phase is characterized
by a very strong dimerization of the Ru-Ru bonds, accompanied by a collapse of
the magnetic susceptibility. Ab initio quantum-chemistry calculations disclose
a pressure-induced enhancement of the direct 4d-4d bonding on particular Ru-Ru
links, causing a sharp increase of the antiferromagnetic exchange interactions.
These combined experimental and computational data show that the Kitaev spin
liquid phase in alpha-RuCl3 strongly competes with the crystallization of spin
singlets into a valence bond solid.
| cond-mat.str-el | magnetization and highresolution xray diffraction measurements of the kitaevheisenberg material alpharucl3 reveal a pressureinduced crystallographic and magnetic phase transition at a hydrostatic pressure of p02 gpa this structural transition into a triclinic phase is characterized by a very strong dimerization of the ruru bonds accompanied by a collapse of the magnetic susceptibility ab initio quantumchemistry calculations disclose a pressureinduced enhancement of the direct 4d4d bonding on particular ruru links causing a sharp increase of the antiferromagnetic exchange interactions these combined experimental and computational data show that the kitaev spin liquid phase in alpharucl3 strongly competes with the crystallization of spin singlets into a valence bond solid | [['magnetization', 'and', 'highresolution', 'xray', 'diffraction', 'measurements', 'of', 'the', 'kitaevheisenberg', 'material', 'alpharucl3', 'reveal', 'a', 'pressureinduced', 'crystallographic', 'and', 'magnetic', 'phase', 'transition', 'at', 'a', 'hydrostatic', 'pressure', 'of', 'p02', 'gpa', 'this', 'structural', 'transition', 'into', 'a', 'triclinic', 'phase', 'is', 'characterized', 'by', 'a', 'very', 'strong', 'dimerization', 'of', 'the', 'ruru', 'bonds', 'accompanied', 'by', 'a', 'collapse', 'of', 'the', 'magnetic', 'susceptibility', 'ab', 'initio', 'quantumchemistry', 'calculations', 'disclose', 'a', 'pressureinduced', 'enhancement', 'of', 'the', 'direct', '4d4d', 'bonding', 'on', 'particular', 'ruru', 'links', 'causing', 'a', 'sharp', 'increase', 'of', 'the', 'antiferromagnetic', 'exchange', 'interactions', 'these', 'combined', 'experimental', 'and', 'computational', 'data', 'show', 'that', 'the', 'kitaev', 'spin', 'liquid', 'phase', 'in', 'alpharucl3', 'strongly', 'competes', 'with', 'the', 'crystallization', 'of', 'spin', 'singlets', 'into', 'a', 'valence', 'bond', 'solid']] | [-0.21890260682086504, 0.26703759827651086, -0.05385856259048783, -0.003624668610947473, -0.037478373385965824, -0.13255280203496417, 0.1779755150256235, 0.4050251605610053, -0.2711447015582096, -0.2542694153707652, -0.017114359208027875, -0.35813189670443535, -0.12417628184581796, 0.07807563980376082, 0.15042904167480411, -0.02331093442404554, 0.010268967931291886, -0.04989475674173307, -0.1851567947882272, -0.16286152937536827, 0.24439911017460483, 0.01930396128445864, 0.28426661076290266, 0.1275982227309474, 0.014834860057037855, 0.013665184737848383, 0.13591481150804266, 0.03459001270433267, -0.19501228882699728, 0.01756028388848617, 0.24561805512223925, -0.13421140912299354, 0.13668485738869224, -0.46575450805415003, -0.2359111175916734, -0.032258921194200714, 0.06892223354606401, 0.12533893077856018, -0.11196949655145762, -0.3065492587075347, -0.004803466690438134, -0.16612124428862618, -0.0886854096720483, -0.15526611247055588, -0.06982455788446325, -0.0045146668243909345, -0.2647983121552638, 0.14954510749362054, 0.08635206089266353, 0.16047710790790873, -0.1409841902154897, -0.09614254327718214, -0.12803889924571626, 0.0026278438578758922, 0.05083789120184346, 0.12020747796964965, 0.15829952747804954, -0.1012652628367678, -0.13601581511486854, 0.41052313845249866, -2.003442496061325e-05, 0.03760368559243424, 0.15682899134588382, -0.19240571806384693, -0.13678664556216627, 0.25677802142731493, 0.058171030799193044, 0.013911451896031697, -0.09949845645488017, 0.02107717816085954, 0.03406363327410959, 0.24682699896040416, 0.033208208451313635, -0.003952734331999506, 0.26243587101233146, 0.21837995462452195, 0.01937311583952535, 0.17760112012426058, -0.13576147622162743, -0.09132528457613219, -0.18178504950233867, -0.19240064178371713, -0.2277905345362212, 0.04922591839872655, -0.12208227780245666, -0.20419891953823113, 0.3425676167366051, 0.08374995836721999, 0.14390002052698816, -0.09105098111821072, 0.20676047043497897, 0.01570761563766393, 0.06196974716371014, -0.018536635156349457, 0.2678929670226006, 0.2310358212772934, 0.12732712353712747, -0.361552635691173, 0.1285932653494889, 0.009126682521864063] |
1,802.09862 | Accurate measurement of a 96% input coupling into a cavity using
polarization tomography | Pillar microcavities are excellent light-matter interfaces providing an
electromagnetic confinement in small mode volumes with high quality factors.
They also allow the efficient injection and extraction of photons, into and
from the cavity, with potentially near-unity input and output-coupling
efficiencies. Optimizing the input and output coupling is essential, in
particular, in the development of solid-state quantum networks where artificial
atoms are manipulated with single incoming photons. Here we propose a technique
to accurately measure input and output coupling efficiencies using polarization
tomography of the light reflected by the cavity. We use the residual
birefringence of pillar microcavities to distinguish the light coupled to the
cavity from the uncoupled light: the former participates to rotating the
polarization of the reflected beam, while the latter decreases the polarization
purity. Applying this technique to a micropillar cavity, we measure a $53 \pm2
\% $ output coupling and a $96 \pm 1\%$ input coupling with unprecedented
precision.
| quant-ph cond-mat.mes-hall | pillar microcavities are excellent lightmatter interfaces providing an electromagnetic confinement in small mode volumes with high quality factors they also allow the efficient injection and extraction of photons into and from the cavity with potentially nearunity input and outputcoupling efficiencies optimizing the input and output coupling is essential in particular in the development of solidstate quantum networks where artificial atoms are manipulated with single incoming photons here we propose a technique to accurately measure input and output coupling efficiencies using polarization tomography of the light reflected by the cavity we use the residual birefringence of pillar microcavities to distinguish the light coupled to the cavity from the uncoupled light the former participates to rotating the polarization of the reflected beam while the latter decreases the polarization purity applying this technique to a micropillar cavity we measure a 53 pm2 output coupling and a 96 pm 1 input coupling with unprecedented precision | [['pillar', 'microcavities', 'are', 'excellent', 'lightmatter', 'interfaces', 'providing', 'an', 'electromagnetic', 'confinement', 'in', 'small', 'mode', 'volumes', 'with', 'high', 'quality', 'factors', 'they', 'also', 'allow', 'the', 'efficient', 'injection', 'and', 'extraction', 'of', 'photons', 'into', 'and', 'from', 'the', 'cavity', 'with', 'potentially', 'nearunity', 'input', 'and', 'outputcoupling', 'efficiencies', 'optimizing', 'the', 'input', 'and', 'output', 'coupling', 'is', 'essential', 'in', 'particular', 'in', 'the', 'development', 'of', 'solidstate', 'quantum', 'networks', 'where', 'artificial', 'atoms', 'are', 'manipulated', 'with', 'single', 'incoming', 'photons', 'here', 'we', 'propose', 'a', 'technique', 'to', 'accurately', 'measure', 'input', 'and', 'output', 'coupling', 'efficiencies', 'using', 'polarization', 'tomography', 'of', 'the', 'light', 'reflected', 'by', 'the', 'cavity', 'we', 'use', 'the', 'residual', 'birefringence', 'of', 'pillar', 'microcavities', 'to', 'distinguish', 'the', 'light', 'coupled', 'to', 'the', 'cavity', 'from', 'the', 'uncoupled', 'light', 'the', 'former', 'participates', 'to', 'rotating', 'the', 'polarization', 'of', 'the', 'reflected', 'beam', 'while', 'the', 'latter', 'decreases', 'the', 'polarization', 'purity', 'applying', 'this', 'technique', 'to', 'a', 'micropillar', 'cavity', 'we', 'measure', 'a', '53', 'pm2', 'output', 'coupling', 'and', 'a', '96', 'pm', '1', 'input', 'coupling', 'with', 'unprecedented', 'precision']] | [-0.10609576280308974, 0.2020282000512392, -0.03300967205790741, -0.017241636079902582, -0.023080399374027324, -0.18640332754133948, 0.05179682904268485, 0.42813476049248744, -0.26251290857002435, -0.3560617907182468, 0.019749409484442645, -0.2801504567487548, -0.05533257914423351, 0.2030083752446962, -0.008688617809151379, 0.08866188588509002, 0.04479428759887075, -0.044193271434995414, 0.007888558292175513, -0.14996014246778772, 0.25332095449642333, 0.08291372375189641, 0.35895228843260185, 0.038307921956324126, 0.14720026264776667, 0.008624394177551696, 0.032654047750911075, -0.03799289885587645, -0.05670793472931085, 0.1632336293815925, 0.2129653248155724, 0.06135436757899426, 0.22738929055261098, -0.42604187533062027, -0.16272529924291476, 0.06929101728655349, 0.1549429827992687, 0.16040829234657847, -0.07062746918087962, -0.2770027515342743, -0.004361110785667668, -0.10419735815630461, -0.10855882064075462, -0.04414488270027649, -0.03857500010188546, 0.009454249316481072, -0.2842843482573054, 0.027959522436371394, 0.01586531994506618, 0.009734232108176545, -0.005270504176814035, -0.026580130266617763, -0.03188882229559814, 0.12409719660113387, -0.03627640701713201, 0.05083029531867595, 0.19433080546545567, -0.15355835960166442, -0.09679003726052651, 0.3686982871878226, -0.11568731836980789, -0.18208995911705966, 0.1514596999692268, -0.19070167702681304, -0.011652392168708194, 0.17623031465028297, 0.198010665148694, 0.06977992585631988, -0.10345943802844314, -0.0037364188746691045, 0.03969159138247075, 0.24886224728497053, 0.11627844624862765, 0.14014466159471267, 0.24916466744308244, 0.1842314828455522, -0.021759682927058627, 0.1948907155865828, -0.12382182829018022, -0.022330977430486964, -0.2603631665597096, -0.14186237944098842, -0.15784976833761324, 0.07438233859886396, -0.11965191635368345, -0.09928890191857388, 0.40348807643383544, 0.1407573559731615, 0.16995223037149165, -0.028530930187429814, 0.3633917941656334, 0.12198009626286117, 0.08316988112337098, 0.03985483898466687, 0.34241650655668304, 0.19265996135265523, 0.08713963724185546, -0.27411441640644674, -0.007604579522971384, -0.057419402201024705] |
1,802.09863 | A unifying framework for the modelling and analysis of STR DNA samples
arising in forensic casework | This paper presents a new framework for analysing forensic DNA samples using
probabilistic genotyping. Specifically it presents a mathematical framework for
specifying and combining the steps in producing forensic casework
electropherograms of short tandem repeat loci from DNA samples. It is
applicable to both high and low template DNA samples, that is, samples
containing either high or low amounts DNA. A specific model is developed within
the framework, by way of particular modelling assumptions and approximations,
and its interpretive power presented on examples using simulated data and data
from a publicly available dataset. The framework relies heavily on the use of
univariate and multivariate probability generating functions. It is shown that
these provide a succinct and elegant mathematical scaffolding to model the key
steps in the process. A significant development in this paper is that of new
numerical methods for accurately and efficiently evaluating the probability
distribution of amplicons arising from the polymerase chain reaction process,
which is modelled as a discrete multi-type branching process. Source code in
the scripting languages Python, R and Julia is provided for illustration of
these methods. These new developments will be of general interest to persons
working outside the province of forensic DNA interpretation that this paper
focuses on.
| stat.AP q-bio.QM | this paper presents a new framework for analysing forensic dna samples using probabilistic genotyping specifically it presents a mathematical framework for specifying and combining the steps in producing forensic casework electropherograms of short tandem repeat loci from dna samples it is applicable to both high and low template dna samples that is samples containing either high or low amounts dna a specific model is developed within the framework by way of particular modelling assumptions and approximations and its interpretive power presented on examples using simulated data and data from a publicly available dataset the framework relies heavily on the use of univariate and multivariate probability generating functions it is shown that these provide a succinct and elegant mathematical scaffolding to model the key steps in the process a significant development in this paper is that of new numerical methods for accurately and efficiently evaluating the probability distribution of amplicons arising from the polymerase chain reaction process which is modelled as a discrete multitype branching process source code in the scripting languages python r and julia is provided for illustration of these methods these new developments will be of general interest to persons working outside the province of forensic dna interpretation that this paper focuses on | [['this', 'paper', 'presents', 'a', 'new', 'framework', 'for', 'analysing', 'forensic', 'dna', 'samples', 'using', 'probabilistic', 'genotyping', 'specifically', 'it', 'presents', 'a', 'mathematical', 'framework', 'for', 'specifying', 'and', 'combining', 'the', 'steps', 'in', 'producing', 'forensic', 'casework', 'electropherograms', 'of', 'short', 'tandem', 'repeat', 'loci', 'from', 'dna', 'samples', 'it', 'is', 'applicable', 'to', 'both', 'high', 'and', 'low', 'template', 'dna', 'samples', 'that', 'is', 'samples', 'containing', 'either', 'high', 'or', 'low', 'amounts', 'dna', 'a', 'specific', 'model', 'is', 'developed', 'within', 'the', 'framework', 'by', 'way', 'of', 'particular', 'modelling', 'assumptions', 'and', 'approximations', 'and', 'its', 'interpretive', 'power', 'presented', 'on', 'examples', 'using', 'simulated', 'data', 'and', 'data', 'from', 'a', 'publicly', 'available', 'dataset', 'the', 'framework', 'relies', 'heavily', 'on', 'the', 'use', 'of', 'univariate', 'and', 'multivariate', 'probability', 'generating', 'functions', 'it', 'is', 'shown', 'that', 'these', 'provide', 'a', 'succinct', 'and', 'elegant', 'mathematical', 'scaffolding', 'to', 'model', 'the', 'key', 'steps', 'in', 'the', 'process', 'a', 'significant', 'development', 'in', 'this', 'paper', 'is', 'that', 'of', 'new', 'numerical', 'methods', 'for', 'accurately', 'and', 'efficiently', 'evaluating', 'the', 'probability', 'distribution', 'of', 'amplicons', 'arising', 'from', 'the', 'polymerase', 'chain', 'reaction', 'process', 'which', 'is', 'modelled', 'as', 'a', 'discrete', 'multitype', 'branching', 'process', 'source', 'code', 'in', 'the', 'scripting', 'languages', 'python', 'r', 'and', 'julia', 'is', 'provided', 'for', 'illustration', 'of', 'these', 'methods', 'these', 'new', 'developments', 'will', 'be', 'of', 'general', 'interest', 'to', 'persons', 'working', 'outside', 'the', 'province', 'of', 'forensic', 'dna', 'interpretation', 'that', 'this', 'paper', 'focuses', 'on']] | [-0.03572030171298869, 0.03863131300450357, -0.08769494860890144, 0.08604445743733724, -0.08559948963446397, -0.15723997399247452, 0.0774132814834707, 0.36979271576502454, -0.2620651555092384, -0.2862888183718657, 0.11282126892668505, -0.2560279558483493, -0.1482093124570526, 0.237636751447366, -0.09295784596093547, 0.06706315105610901, 0.11371757434658232, -0.021178428148571172, 0.021035270799663577, -0.2193241365797197, 0.289503678325655, 0.09279258288077864, 0.3029132569585379, 0.024309539285205378, 0.11457489958882112, 0.011246885654662609, -0.07635648517102442, -0.009545987366936078, -0.12344031614624078, 0.19375965802635833, 0.30873118138954264, 0.2244919078885669, 0.2822407649445999, -0.4338201062032478, -0.19380591575549366, 0.06162755647657083, 0.15133593581142088, 0.14666076444201262, -0.09225835382890449, -0.2660236596432286, 0.08885827974425446, -0.17926387409120342, -0.06930389858590548, -0.10133559460954013, 0.022230244133763833, 0.045199313486341895, -0.2698292879469912, 0.04942076510005612, 0.044842134870872116, 0.12114135570385877, -0.004909077783653915, -0.12336372582221349, 0.02018058775266742, 0.13230633550647683, 0.0462201052031756, 0.027373952992681607, 0.14070690917216389, -0.0924494834137423, -0.09932592001745898, 0.35815414616052865, -0.0214590097688522, -0.20405996803025367, 0.2027171859403561, -0.08921745527928293, -0.19773280263567963, 0.12196628927874069, 0.19146273286577187, 0.1351216772283592, -0.22245417702623516, 0.09071719775652039, 0.0013290826532551471, 0.17269877737186, 0.04266204318207433, -0.054036495017570296, 0.1991228248864668, 0.22175599713056512, -0.020080961906762028, 0.15561531772597365, -0.07764044717609353, -0.09433910382144592, -0.2968929335703233, -0.17071304933436776, -0.17905884193183452, -0.0009523648026801061, -0.06571093288998693, -0.1878742290546321, 0.3855675634170207, 0.15412082065600038, 0.15089318862723589, 0.0840330906687407, 0.3237466102251418, 0.05944489061264047, 0.06119276864988291, 0.024405405365898476, 0.08637523305215462, 0.054933997344764354, 0.08591549667100623, -0.12808257002738993, 0.12856076639739103, 0.018020329583783214] |
1,802.09864 | Option Pricing Models Driven by the Space-Time Fractional Diffusion:
Series Representation and Applications | In this paper, we focus on option pricing models based on space-time
fractional diffusion. We briefly revise recent results which show that the
option price can be represented in the terms of rapidly converging
double-series and apply these results to the data from real markets. We focus
on estimation of model parameters from the market data and estimation of
implied volatility within the space-time fractional option pricing models.
| q-fin.MF | in this paper we focus on option pricing models based on spacetime fractional diffusion we briefly revise recent results which show that the option price can be represented in the terms of rapidly converging doubleseries and apply these results to the data from real markets we focus on estimation of model parameters from the market data and estimation of implied volatility within the spacetime fractional option pricing models | [['in', 'this', 'paper', 'we', 'focus', 'on', 'option', 'pricing', 'models', 'based', 'on', 'spacetime', 'fractional', 'diffusion', 'we', 'briefly', 'revise', 'recent', 'results', 'which', 'show', 'that', 'the', 'option', 'price', 'can', 'be', 'represented', 'in', 'the', 'terms', 'of', 'rapidly', 'converging', 'doubleseries', 'and', 'apply', 'these', 'results', 'to', 'the', 'data', 'from', 'real', 'markets', 'we', 'focus', 'on', 'estimation', 'of', 'model', 'parameters', 'from', 'the', 'market', 'data', 'and', 'estimation', 'of', 'implied', 'volatility', 'within', 'the', 'spacetime', 'fractional', 'option', 'pricing', 'models']] | [-0.0334785056697643, 0.0055421571356847, -0.08937719949137639, 0.11330403916037861, -0.10624780826380148, -0.10772705534199144, 0.08025253969689776, 0.4221718848737724, -0.2648471235571539, -0.24834281699868904, 0.22339889864944032, -0.27231510316350444, -0.16732140208649285, 0.2396998456918963, -0.1590648267644129, 0.0182415833696723, 0.02728707829545088, -0.007527582501472139, 0.0036168658921002027, -0.2706625612301971, 0.3459523589870728, 0.036655462346971035, 0.25910271756241426, 0.02768170284381246, 0.11228011759778704, -0.027707254277843544, -0.10903213348458796, 0.0008916551493765676, -0.20748833668649774, 0.1854275484870681, 0.22858994375190592, 0.07088907603311408, 0.26388655213967843, -0.4779122125576524, -0.20889578087885372, 0.0969921042183962, 0.0733246324063443, 0.06845517447457977, -0.027574747648459914, -0.2958831594544737, -0.03372040731996736, -0.23689247718464365, -0.07920919996960198, -0.09502037422841086, -0.015727600466240856, 0.045851025874178636, -0.29901710201931353, 0.08356595368069761, 0.013537842670784277, -0.01943503479047007, -0.08951762995703201, -0.16069790087503327, 0.002254169646595769, 0.062364526935305226, 0.14539512165870025, -0.06636607675018776, 0.0894719458404271, -0.13730450307690156, -0.19507732038618997, 0.37509928125997677, -0.142505026422441, -0.23968926545999505, 0.09876334819572923, -0.1835670725798563, -0.14576888718532727, 0.04337471319526872, 0.24502999334157827, 0.10612314849105828, -0.1619882570264642, 0.10511887745815329, -0.05083987314034911, 0.14534438009414932, 0.015576668224050938, -0.009794380577445468, 0.1902799405678011, 0.2083902702673667, 0.07061639877364916, 0.09540692245526075, -0.09342342963346335, -0.1962436261751196, -0.2869232888059581, -0.10610298793215085, -0.17752188526313095, 0.026810015168260124, -0.1574320874227423, -0.1243235789348974, 0.3895637633224182, 0.2532763369586867, 0.1375009743633735, 0.08509076634757495, 0.2825787999626139, 0.18126425457953968, -0.03199916556203628, 0.11765999806469635, 0.15369052535799496, -0.013282777686767718, 0.1555582697653924, -0.15486274597830796, 0.13004940035513274, 0.04333010379581109] |
1,802.09865 | Observation of a Group of Dark Rogue Waves in a Telecommunication
Optical Fiber | Over the past decade, the rogue wave debate has stimulated the comparison of
predictions and observations among different branches of wave physics,
particularly between hydrodynamics and optics, in situations where analogous
dynamical behaviors can be identified, thanks to the use of common universal
models. Although the scalar nonlinear Schroedinger equation (NLSE) has
constantly played a central role for rogue wave investigations, moving beyond
the standard NLSE model is relevant and needful for describing more general
classes of physical systems and applications. In this direction, the coupled
NLSEs are known to play a pivotal role for the understanding of the complex
wave dynamics in hydrodynamics and optics. Benefiting from the advanced
technology of high-speed telecommunication-grade components, and relying on a
careful design of the nonlinear propagation of orthogonally-polarized optical
pump waves in a randomly birefringent telecom fiber, this work explores, both
theoretically and experimentally, the rogue wave dynamics governed by such
coupled NLSEs. We report, for the first time, the evidence of a group of three
dark rogue waves, the so-called dark three-sister rogue waves, where
experiments, numerics, and analytics show a very good consistency.
| physics.optics | over the past decade the rogue wave debate has stimulated the comparison of predictions and observations among different branches of wave physics particularly between hydrodynamics and optics in situations where analogous dynamical behaviors can be identified thanks to the use of common universal models although the scalar nonlinear schroedinger equation nlse has constantly played a central role for rogue wave investigations moving beyond the standard nlse model is relevant and needful for describing more general classes of physical systems and applications in this direction the coupled nlses are known to play a pivotal role for the understanding of the complex wave dynamics in hydrodynamics and optics benefiting from the advanced technology of highspeed telecommunicationgrade components and relying on a careful design of the nonlinear propagation of orthogonallypolarized optical pump waves in a randomly birefringent telecom fiber this work explores both theoretically and experimentally the rogue wave dynamics governed by such coupled nlses we report for the first time the evidence of a group of three dark rogue waves the socalled dark threesister rogue waves where experiments numerics and analytics show a very good consistency | [['over', 'the', 'past', 'decade', 'the', 'rogue', 'wave', 'debate', 'has', 'stimulated', 'the', 'comparison', 'of', 'predictions', 'and', 'observations', 'among', 'different', 'branches', 'of', 'wave', 'physics', 'particularly', 'between', 'hydrodynamics', 'and', 'optics', 'in', 'situations', 'where', 'analogous', 'dynamical', 'behaviors', 'can', 'be', 'identified', 'thanks', 'to', 'the', 'use', 'of', 'common', 'universal', 'models', 'although', 'the', 'scalar', 'nonlinear', 'schroedinger', 'equation', 'nlse', 'has', 'constantly', 'played', 'a', 'central', 'role', 'for', 'rogue', 'wave', 'investigations', 'moving', 'beyond', 'the', 'standard', 'nlse', 'model', 'is', 'relevant', 'and', 'needful', 'for', 'describing', 'more', 'general', 'classes', 'of', 'physical', 'systems', 'and', 'applications', 'in', 'this', 'direction', 'the', 'coupled', 'nlses', 'are', 'known', 'to', 'play', 'a', 'pivotal', 'role', 'for', 'the', 'understanding', 'of', 'the', 'complex', 'wave', 'dynamics', 'in', 'hydrodynamics', 'and', 'optics', 'benefiting', 'from', 'the', 'advanced', 'technology', 'of', 'highspeed', 'telecommunicationgrade', 'components', 'and', 'relying', 'on', 'a', 'careful', 'design', 'of', 'the', 'nonlinear', 'propagation', 'of', 'orthogonallypolarized', 'optical', 'pump', 'waves', 'in', 'a', 'randomly', 'birefringent', 'telecom', 'fiber', 'this', 'work', 'explores', 'both', 'theoretically', 'and', 'experimentally', 'the', 'rogue', 'wave', 'dynamics', 'governed', 'by', 'such', 'coupled', 'nlses', 'we', 'report', 'for', 'the', 'first', 'time', 'the', 'evidence', 'of', 'a', 'group', 'of', 'three', 'dark', 'rogue', 'waves', 'the', 'socalled', 'dark', 'threesister', 'rogue', 'waves', 'where', 'experiments', 'numerics', 'and', 'analytics', 'show', 'a', 'very', 'good', 'consistency']] | [-0.17037950236296567, 0.11657865559759008, -0.08971494883247702, 0.057888268922317444, -0.09189374122901686, -0.12132117781944184, -0.040257645057863556, 0.3430688452528237, -0.23007461346000188, -0.2529261915120654, 0.09443655222331962, -0.2811145522212098, -0.2170675332468658, 0.24833190557674842, 0.05395061697473156, 0.0908408046662961, 0.041025946520596414, -0.015051700238772964, -0.012707252449747483, -0.1641472862281192, 0.31702650019996237, 0.05736540704658562, 0.29629945354843207, -0.00014321085393101304, 0.10572117651239611, 0.02601615897319689, -0.03552246173257827, -0.05279107697456461, -0.11588661713975963, 0.07795534116377274, 0.26903674170301073, 0.07703677872144668, 0.29077871424749824, -0.48636741018956425, -0.29729182395449544, 0.06950229759760466, 0.16125675537214093, 0.13292273687413678, -0.10237798758420727, -0.3199066108727193, -0.00653803489071184, -0.1295490298921672, -0.16253426805481438, -0.035531529161444565, 0.038758414620942955, 0.06422933596339854, -0.22286902479878576, 0.06801725781278346, 0.03334536340524529, 0.024816658366554684, -0.029395118499031432, -0.04241803282255225, -0.037116404420665494, 0.08422169177844138, 0.03397963027716717, -0.006004386517516041, 0.0741990155484118, -0.21587717082545899, -0.11423020788460744, 0.4397074312258225, -0.07359424010328539, -0.15493963072383468, 0.20395306375896005, -0.12371285513710553, -0.08755918131670454, 0.12716418165959173, 0.21694605803030165, 0.10662709840235639, -0.11940795267614854, 0.03069732485947987, -0.03315215139318153, 0.16503249780929924, 0.10994798148173716, 0.08895948058624936, 0.2738911330362188, 0.22581054565911232, -0.012501540312719094, 0.07983154635863625, -0.05428780753237124, -0.1416859405964695, -0.28370098916783026, -0.13457415792400243, -0.13137502848569835, 0.008322274778118218, -0.06055641352201577, -0.120206509169273, 0.4217094214694513, 0.1767961562324602, 0.09548781993594226, -0.01768155020705148, 0.2642325555322344, 0.1354059987185922, 0.029908008588181174, 0.04172652163082263, 0.3066593943020472, 0.15562359594284547, 0.14380897074531007, -0.2126859741062847, 0.01702288443805998, 0.020743735935436665] |
1,802.09866 | Non-Abelian gauge field optics | The concept of gauge field is a cornerstone of modern physics and the
synthetic gauge field has emerged as a new way to manipulate particles in many
disciplines. In optics, several schemes of Abelian synthetic gauge fields have
been proposed. Here, we introduce a new platform for realizing synthetic SU(2)
non-Abelian gauge fields acting on two-dimensional optical waves in a wide
class of anisotropic materials and discover novel phenomena. We show that a
virtual non-Abelian Lorentz force arising from material anisotropy can induce
light beams to travel along Zitterbewegung trajectories even in homogeneous
media. We further design an optical non-Abelian Aharonov-Bohm system which
results in the exotic spin density interference effect. We can extract the
Wilson loop of an arbitrary closed optical path from a series of gauge fixed
points in the interference fringes. Our scheme offers a new route to study
SU(2) gauge field related physics using optics.
| physics.optics quant-ph | the concept of gauge field is a cornerstone of modern physics and the synthetic gauge field has emerged as a new way to manipulate particles in many disciplines in optics several schemes of abelian synthetic gauge fields have been proposed here we introduce a new platform for realizing synthetic su2 nonabelian gauge fields acting on twodimensional optical waves in a wide class of anisotropic materials and discover novel phenomena we show that a virtual nonabelian lorentz force arising from material anisotropy can induce light beams to travel along zitterbewegung trajectories even in homogeneous media we further design an optical nonabelian aharonovbohm system which results in the exotic spin density interference effect we can extract the wilson loop of an arbitrary closed optical path from a series of gauge fixed points in the interference fringes our scheme offers a new route to study su2 gauge field related physics using optics | [['the', 'concept', 'of', 'gauge', 'field', 'is', 'a', 'cornerstone', 'of', 'modern', 'physics', 'and', 'the', 'synthetic', 'gauge', 'field', 'has', 'emerged', 'as', 'a', 'new', 'way', 'to', 'manipulate', 'particles', 'in', 'many', 'disciplines', 'in', 'optics', 'several', 'schemes', 'of', 'abelian', 'synthetic', 'gauge', 'fields', 'have', 'been', 'proposed', 'here', 'we', 'introduce', 'a', 'new', 'platform', 'for', 'realizing', 'synthetic', 'su2', 'nonabelian', 'gauge', 'fields', 'acting', 'on', 'twodimensional', 'optical', 'waves', 'in', 'a', 'wide', 'class', 'of', 'anisotropic', 'materials', 'and', 'discover', 'novel', 'phenomena', 'we', 'show', 'that', 'a', 'virtual', 'nonabelian', 'lorentz', 'force', 'arising', 'from', 'material', 'anisotropy', 'can', 'induce', 'light', 'beams', 'to', 'travel', 'along', 'zitterbewegung', 'trajectories', 'even', 'in', 'homogeneous', 'media', 'we', 'further', 'design', 'an', 'optical', 'nonabelian', 'aharonovbohm', 'system', 'which', 'results', 'in', 'the', 'exotic', 'spin', 'density', 'interference', 'effect', 'we', 'can', 'extract', 'the', 'wilson', 'loop', 'of', 'an', 'arbitrary', 'closed', 'optical', 'path', 'from', 'a', 'series', 'of', 'gauge', 'fixed', 'points', 'in', 'the', 'interference', 'fringes', 'our', 'scheme', 'offers', 'a', 'new', 'route', 'to', 'study', 'su2', 'gauge', 'field', 'related', 'physics', 'using', 'optics']] | [-0.18767371048038237, 0.23416573563946141, -0.13453168499177234, 0.05204555483913086, -0.13942082155177107, -0.14578521326996835, -0.004926817097869895, 0.41377150034844473, -0.25364008746516187, -0.29422420456430454, 0.008082221677814354, -0.223667826128486, -0.20847473503246702, 0.2361706013997529, -0.029725565812581737, 0.050207915530702564, -0.012914708121710975, -0.009579021806316724, -0.040686308373478336, -0.21087659328657157, 0.29468999403347607, -0.01827798753776806, 0.33309598595541495, 0.046743938543102485, 0.11567066485064585, 0.037163134606480096, -0.011607748527984579, 0.030078673697758043, -0.07280973191147447, 0.1024831348831684, 0.21099317788096433, 0.016393896637659444, 0.20236414418605214, -0.43889787864415036, -0.2695066952365357, 0.08687986341936377, 0.14381549046718634, 0.19188101397242846, -0.139554461899476, -0.3290238981291452, -0.014470026131419327, -0.15847841404603433, -0.167570361405011, -0.12666925146703878, -0.015907838909367988, -0.029379375558659035, -0.2628053761706156, -0.006056328344740123, -0.03189552374240386, 0.10679167584963799, -0.02879586671447794, -0.059576205917846584, 0.014031014694275971, 0.08712393070114839, 0.032837439795655995, 0.057321368367411196, 0.12289293083024755, -0.19060522855584502, -0.2196810793494118, 0.4493438019198459, -0.08186735552985647, -0.17076735677910132, 0.18336457686323748, -0.12364470683844547, -0.11834570259518372, 0.12881509310052372, 0.22552178481956256, 0.10468761189825108, -0.1401083235653905, 0.12700666905921454, -0.07645197043073482, 0.10482552751348723, 0.043541722635632295, 0.09225801000334072, 0.2744703187133852, 0.1251009315996112, 0.059462787709652055, 0.14461516293200147, -0.08354626448462474, -0.08688593710203898, -0.3143255469082986, -0.20043606354523724, -0.16477729385756207, 0.09932378894989707, -0.060843161493031955, -0.173946828340749, 0.4040395570661818, 0.18208881137555077, 0.11175416808594144, -0.06307383054701748, 0.2651201908620412, 0.06410990333209601, 0.0958661274240671, 0.015187915039542537, 0.22610967625057538, 0.18139943793015992, 0.09638361679390073, -0.2131599788053974, -0.11707349956948185, 0.07308625695983186] |
1,802.09867 | The Whitehead exact sequence and the classification problem of homotopy
types | This paper defines an invariant associated to Whitehead's certain exact
sequence of a simply connected CW-complex which is much more elementary - and
less powerful - than the boundary invariant of Baues. Nevertheless, in good
cases, it classifies the homotopy types of CW-complexes.
| math.AT | this paper defines an invariant associated to whiteheads certain exact sequence of a simply connected cwcomplex which is much more elementary and less powerful than the boundary invariant of baues nevertheless in good cases it classifies the homotopy types of cwcomplexes | [['this', 'paper', 'defines', 'an', 'invariant', 'associated', 'to', 'whiteheads', 'certain', 'exact', 'sequence', 'of', 'a', 'simply', 'connected', 'cwcomplex', 'which', 'is', 'much', 'more', 'elementary', 'and', 'less', 'powerful', 'than', 'the', 'boundary', 'invariant', 'of', 'baues', 'nevertheless', 'in', 'good', 'cases', 'it', 'classifies', 'the', 'homotopy', 'types', 'of', 'cwcomplexes']] | [-0.166865236793145, 0.10792397902234992, -0.0913524612693525, 0.16986165095756695, -0.1301050873518717, -0.19421841025852213, 0.006920868332111617, 0.3487119968162804, -0.2961714440025389, -0.23077452808573115, 0.08667190169359035, -0.21173914258436458, -0.17927459122686898, 0.21715742113386713, -0.19588307575209113, -0.027446430866470244, 0.04958060790398499, 0.1396309630718173, -0.07810835215467506, -0.2319407573923832, 0.37651754254702385, 0.0029970936295462816, 0.24675965861521346, -0.005071257615870819, 0.09585442550752948, -0.017551407524634424, -0.03707839927931384, 0.044398482999984085, -0.14423546388961103, 0.17676836664493129, 0.2728976050232787, 0.04904764361406972, 0.18752289188616886, -0.3434026611105698, -0.1443230223546668, 0.19188834027182766, 0.1806017330779535, 0.027775224420332874, 0.01925782672315552, -0.2782993470432191, 0.1834974519272403, -0.17972551105350892, -0.11828273244020415, -0.05816354831998668, 0.08779620129342486, -0.040924814717117244, -0.18808979809102488, 0.007694827438127704, 0.1283589825829173, 0.09440845332858039, -0.024908357742810396, -0.049511564850080306, -0.051054773545574125, 0.11361162234438447, 0.0013744686559842127, 0.11027173550299756, 0.09254707115497894, -0.10231439877733044, -0.06012784410268068, 0.39467421161556027, 0.01818440448338018, -0.22840751346382426, 0.23886784338733044, -0.09368878034534069, -0.20834994257041595, 0.19846133001875588, 0.007694135601745873, 0.20695391951537714, -0.1153412904709623, 0.0845264750405033, -0.11051037696065245, 0.1357131987446692, 0.09733254339818548, 0.003866490181081179, 0.13248882440441265, 0.1499442123330948, 0.1457111663213454, 0.15279743002682197, 0.09356114139252274, -0.08904782109311782, -0.31900096157702, -0.19402379752420706, -0.12367916108881373, 0.13781856581932161, -0.08952564590506926, -0.22456467774037908, 0.42321700430134446, 0.09422655219621048, 0.167047083854857, 0.12617589438209173, 0.26864541421939686, 0.08494793986560913, 0.07442919305730157, 0.045491959615724116, 0.10965204894792561, 0.17712611018498314, -0.012959024982481467, -0.08279025124204231, -0.001795900769804309, 0.1744082328272847] |
1,802.09868 | Field-driven transition in the Ba$_{1-x}$K$_x$Fe$_2$As$_2$
superconductor with splayed columnar defects | Through 2.6 GeV U irradiations, we have induced bimodal splayed columnar
defects in Ba$_{1-x}$K$_x$Fe$_2$As$_2$ single crystals with splay angles, $\pm
5 ^\circ$, $\pm 10 ^\circ$, $\pm 15 ^\circ$, and $\pm 20 ^\circ$. Critical
current densities through magnetization measurements were carefully evaluated,
where a splay angle of $\pm 5 ^\circ$ brought about the highest $J_\mathrm{c}$.
Mageto-optical images close to $T_\mathrm{c}$ indicates highly anisotropic
discontinuity lines in the remnant state, and with anisotropy increasing with
greater splay angles. Moreover, amongst those with splayed columnar defects,
anomalous non-monotonic field dependences of $J_\mathrm{c}$ and $S$ with an
extrema at some fraction of the matching field are observed. We discuss that
such $J_\mathrm{c}$ enhancement arises from a field-driven coupling transition
in which intervortex interactions reorganize the vortex structure to be
accommodated into columnar defects, thereby increasing pinning at higher
fields.
| cond-mat.supr-con | through 26 gev u irradiations we have induced bimodal splayed columnar defects in ba_1xk_xfe_2as_2 single crystals with splay angles pm 5 circ pm 10 circ pm 15 circ and pm 20 circ critical current densities through magnetization measurements were carefully evaluated where a splay angle of pm 5 circ brought about the highest j_mathrmc magetooptical images close to t_mathrmc indicates highly anisotropic discontinuity lines in the remnant state and with anisotropy increasing with greater splay angles moreover amongst those with splayed columnar defects anomalous nonmonotonic field dependences of j_mathrmc and s with an extrema at some fraction of the matching field are observed we discuss that such j_mathrmc enhancement arises from a fielddriven coupling transition in which intervortex interactions reorganize the vortex structure to be accommodated into columnar defects thereby increasing pinning at higher fields | [['through', '26', 'gev', 'u', 'irradiations', 'we', 'have', 'induced', 'bimodal', 'splayed', 'columnar', 'defects', 'in', 'ba_1xk_xfe_2as_2', 'single', 'crystals', 'with', 'splay', 'angles', 'pm', '5', 'circ', 'pm', '10', 'circ', 'pm', '15', 'circ', 'and', 'pm', '20', 'circ', 'critical', 'current', 'densities', 'through', 'magnetization', 'measurements', 'were', 'carefully', 'evaluated', 'where', 'a', 'splay', 'angle', 'of', 'pm', '5', 'circ', 'brought', 'about', 'the', 'highest', 'j_mathrmc', 'magetooptical', 'images', 'close', 'to', 't_mathrmc', 'indicates', 'highly', 'anisotropic', 'discontinuity', 'lines', 'in', 'the', 'remnant', 'state', 'and', 'with', 'anisotropy', 'increasing', 'with', 'greater', 'splay', 'angles', 'moreover', 'amongst', 'those', 'with', 'splayed', 'columnar', 'defects', 'anomalous', 'nonmonotonic', 'field', 'dependences', 'of', 'j_mathrmc', 'and', 's', 'with', 'an', 'extrema', 'at', 'some', 'fraction', 'of', 'the', 'matching', 'field', 'are', 'observed', 'we', 'discuss', 'that', 'such', 'j_mathrmc', 'enhancement', 'arises', 'from', 'a', 'fielddriven', 'coupling', 'transition', 'in', 'which', 'intervortex', 'interactions', 'reorganize', 'the', 'vortex', 'structure', 'to', 'be', 'accommodated', 'into', 'columnar', 'defects', 'thereby', 'increasing', 'pinning', 'at', 'higher', 'fields']] | [-0.18186602418992057, 0.28347560276597505, 0.025419859079654508, -0.016146506978643695, -0.0402060691927518, -0.15507368714402694, 0.0814641588124266, 0.4158595368203554, -0.2663963446254606, -0.35018786049878864, 0.0015047853890764735, -0.36639490236403116, -0.06675070329610981, 0.1417613601722101, 0.04508003576158254, -0.026573029979229418, -0.06423862315818611, -0.034006350929153835, -0.13087202772780374, -0.16422006214531, 0.21170353553772195, 0.003922726486378641, 0.2986678471927767, 0.04629679344361648, 0.05660596609840156, -0.01602085164414524, 0.10717407086822413, 0.029739527160357406, -0.20736709404798656, -0.01381544231909758, 0.20895910332563208, -0.061589076363571936, 0.1305063789234316, -0.3924857362750362, -0.10552689833166912, 0.08077745565948244, 0.1642087557172375, 0.02967166190240671, -0.013848886124914818, -0.3081419540972296, 0.12209959740493335, -0.10978338720516732, -0.16793580601728564, -0.026762432734127532, 0.051164362120873004, 0.007738485074004353, -0.25072408475046076, 0.1612016031042492, 0.021475459945930253, 0.13821785110865595, -0.045149150655479794, -0.20491127689966737, -0.11097386842524049, 0.01627365747160876, 0.061020899442399835, 0.17925312733555684, 0.17122062701217608, -0.13532956133930207, -0.08834591050243089, 0.3432468945931977, -0.05732430698030364, -0.0808215018243654, 0.08530248585504605, -0.21963868937246614, -0.0935902547598608, 0.24669059997410583, 0.08601376220041802, 0.07164191296185131, -0.06592404275981417, 0.020390649147613196, 0.03617964519549217, 0.2035852692875344, 0.14865093229602633, 0.012033520507932043, 0.26227837531660586, 0.11949496355547166, 0.03516945293791759, 0.11968946616024599, -0.1500387931895901, -0.03944521211782721, -0.22640867147650293, -0.08663258891128726, -0.0803967767061471, 0.08460791011466019, -0.17678107509231838, -0.11608116955968982, 0.31368092885379917, 0.10234056776667487, 0.24914142282122795, -0.007685378856076025, 0.16681727278741326, 0.0671362569199444, 0.09812432026087459, 0.0630305973576632, 0.24629596440897344, 0.185346296239547, 0.10883487147928925, -0.21454922143724373, 0.08224611382222553, -0.06088065784146537] |
1,802.09869 | On the solution of the variational optimisation in the rational
inattention framework | I analyse the solution method for the variational optimisation problem in the
rational inattention framework proposed by Christopher A. Sims. The solution,
in general, does not exist, although it may exist in exceptional cases. I show
that the solution does not exist for the quadratic and the logarithmic
objective functions analysed by Sims (2003, 2006). For a linear-quadratic
objective function a solution can be constructed under restrictions on all but
one of its parameters. This approach is, therefore, unlikely to be applicable
to a wider set of economic models.
| econ.EM | i analyse the solution method for the variational optimisation problem in the rational inattention framework proposed by christopher a sims the solution in general does not exist although it may exist in exceptional cases i show that the solution does not exist for the quadratic and the logarithmic objective functions analysed by sims 2003 2006 for a linearquadratic objective function a solution can be constructed under restrictions on all but one of its parameters this approach is therefore unlikely to be applicable to a wider set of economic models | [['i', 'analyse', 'the', 'solution', 'method', 'for', 'the', 'variational', 'optimisation', 'problem', 'in', 'the', 'rational', 'inattention', 'framework', 'proposed', 'by', 'christopher', 'a', 'sims', 'the', 'solution', 'in', 'general', 'does', 'not', 'exist', 'although', 'it', 'may', 'exist', 'in', 'exceptional', 'cases', 'i', 'show', 'that', 'the', 'solution', 'does', 'not', 'exist', 'for', 'the', 'quadratic', 'and', 'the', 'logarithmic', 'objective', 'functions', 'analysed', 'by', 'sims', '2003', '2006', 'for', 'a', 'linearquadratic', 'objective', 'function', 'a', 'solution', 'can', 'be', 'constructed', 'under', 'restrictions', 'on', 'all', 'but', 'one', 'of', 'its', 'parameters', 'this', 'approach', 'is', 'therefore', 'unlikely', 'to', 'be', 'applicable', 'to', 'a', 'wider', 'set', 'of', 'economic', 'models']] | [-0.06242204037641458, -0.0018810847188147266, -0.10660059235236619, 0.11117489113252652, -0.08893685134420737, -0.17460741970709034, 0.040064044350698026, 0.3681502261439736, -0.2555654993544992, -0.2779663477218553, 0.13979858156748828, -0.20977010920622877, -0.20660283345352398, 0.2171624404577057, -0.12801687673696976, 0.07612091846426614, 0.07664329778361187, 0.0021528363688273376, -0.05305298935920209, -0.2841064522168442, 0.3014213678066022, 0.0015238597675153378, 0.2547108922493801, 0.07123797349147813, 0.10958625131098323, 0.000887976164061032, 0.022887366928495047, 0.058415135681468784, -0.1292471276767705, 0.07864713862281962, 0.28083141286403046, 0.2134266238125941, 0.3158448396690106, -0.36784723015460236, -0.21350054393700335, 0.14159034859137923, 0.11538812482017982, 0.08257018528313617, -0.02629511939032066, -0.20477991579414417, 0.08256779036228283, -0.17437185915291645, -0.1490428122022095, -0.09397868496193185, 0.008526157260757316, 0.02121097541131665, -0.3124050736280807, 0.04457704674745543, 0.07867050749050934, -0.008761464997477243, -0.11718946108934626, -0.09760768792534436, 1.050859789123361e-05, 0.05886537128545375, 0.03745751820368629, 0.028684571410236316, 0.05386466547595651, -0.09826099755650575, -0.10280622407438213, 0.37938872589782047, -0.04215788936472676, -0.26986160060505937, 0.17687594478170315, -0.10646782769151869, -0.1639336155036862, 0.11558576401197508, 0.13709106373736699, 0.17222873600241675, -0.17156001627235934, 0.14394195571350812, -0.07889167545363307, 0.1561345334748183, 0.055623746906103715, -0.049261558512513515, 0.16097578008690577, 0.08024824873460562, 0.10689084711510771, 0.07963780590772546, 0.013663924500618256, -0.10429838796020642, -0.3034794868880443, -0.12603937975769297, -0.18670644781819096, 0.03901673417199623, -0.03345074653190566, -0.16589611669311696, 0.393465668036278, 0.1256617907437318, 0.15763384785000864, 0.042369549131292976, 0.22900187466921432, 0.14978339738527108, 0.07732828446465094, 0.08861246783537476, 0.27642092326907125, 0.04642816709898663, 0.07997024408280012, -0.18408672509877158, 0.10663732179974238, 0.0802165036393183] |
1,802.0987 | Single photon emission from graphene quantum dots at room temperature | In the field of condensed matter, graphene plays a central role as an
emerging material for nanoelectronics. Nevertheless, graphene is a semimetal,
which constitutes a severe limitation for some future applications. Therefore,
a lot of efforts are being made to develop semiconductor materials whose
structure is compatible with the graphene lattice. In this perspective, little
pieces of graphene represent a promising alternative. In particular, their
electronic, optical and spin properties can be in principle controlled by
designing their size, shape and edges. As an example, graphene nanoribbons with
zigzag edges have localized spin polarized states. Likewise, singlet-triplet
energy splitting can be chosen by designing the structure of graphene quantum
dots. Moreover, bottom-up molecular synthesis put these potentialities at our
fingertips. Here, we report on a single emitter study that directly addresses
the intrinsic properties of a single graphene quantum dot. In particular, we
show that graphene quantum dots emit single photons at room temperature with a
high purity, a high brightness and a good photostability. These results pave
the way to the development of new quantum systems based on these nanoscale
pieces of graphene.
| cond-mat.mes-hall | in the field of condensed matter graphene plays a central role as an emerging material for nanoelectronics nevertheless graphene is a semimetal which constitutes a severe limitation for some future applications therefore a lot of efforts are being made to develop semiconductor materials whose structure is compatible with the graphene lattice in this perspective little pieces of graphene represent a promising alternative in particular their electronic optical and spin properties can be in principle controlled by designing their size shape and edges as an example graphene nanoribbons with zigzag edges have localized spin polarized states likewise singlettriplet energy splitting can be chosen by designing the structure of graphene quantum dots moreover bottomup molecular synthesis put these potentialities at our fingertips here we report on a single emitter study that directly addresses the intrinsic properties of a single graphene quantum dot in particular we show that graphene quantum dots emit single photons at room temperature with a high purity a high brightness and a good photostability these results pave the way to the development of new quantum systems based on these nanoscale pieces of graphene | [['in', 'the', 'field', 'of', 'condensed', 'matter', 'graphene', 'plays', 'a', 'central', 'role', 'as', 'an', 'emerging', 'material', 'for', 'nanoelectronics', 'nevertheless', 'graphene', 'is', 'a', 'semimetal', 'which', 'constitutes', 'a', 'severe', 'limitation', 'for', 'some', 'future', 'applications', 'therefore', 'a', 'lot', 'of', 'efforts', 'are', 'being', 'made', 'to', 'develop', 'semiconductor', 'materials', 'whose', 'structure', 'is', 'compatible', 'with', 'the', 'graphene', 'lattice', 'in', 'this', 'perspective', 'little', 'pieces', 'of', 'graphene', 'represent', 'a', 'promising', 'alternative', 'in', 'particular', 'their', 'electronic', 'optical', 'and', 'spin', 'properties', 'can', 'be', 'in', 'principle', 'controlled', 'by', 'designing', 'their', 'size', 'shape', 'and', 'edges', 'as', 'an', 'example', 'graphene', 'nanoribbons', 'with', 'zigzag', 'edges', 'have', 'localized', 'spin', 'polarized', 'states', 'likewise', 'singlettriplet', 'energy', 'splitting', 'can', 'be', 'chosen', 'by', 'designing', 'the', 'structure', 'of', 'graphene', 'quantum', 'dots', 'moreover', 'bottomup', 'molecular', 'synthesis', 'put', 'these', 'potentialities', 'at', 'our', 'fingertips', 'here', 'we', 'report', 'on', 'a', 'single', 'emitter', 'study', 'that', 'directly', 'addresses', 'the', 'intrinsic', 'properties', 'of', 'a', 'single', 'graphene', 'quantum', 'dot', 'in', 'particular', 'we', 'show', 'that', 'graphene', 'quantum', 'dots', 'emit', 'single', 'photons', 'at', 'room', 'temperature', 'with', 'a', 'high', 'purity', 'a', 'high', 'brightness', 'and', 'a', 'good', 'photostability', 'these', 'results', 'pave', 'the', 'way', 'to', 'the', 'development', 'of', 'new', 'quantum', 'systems', 'based', 'on', 'these', 'nanoscale', 'pieces', 'of', 'graphene']] | [-0.14077304135856178, 0.16628344369303744, -0.06157822158369843, -0.023577472352885903, -0.04560151206343384, -0.18557340497120647, 0.05206259433243363, 0.45648288137643883, -0.2655084774090463, -0.29543469446007686, 0.03144535615232915, -0.2833331817756002, -0.1493165549852521, 0.23441830809410338, -0.02133566798368955, 0.059706579777412117, 0.05301393358208968, -0.08136306338153941, -0.04469203385119529, -0.18888006589069214, 0.25583909555216844, 0.05393136115384076, 0.3213254553544254, 0.10252775174044275, 0.048834328060089006, -0.006263436429435387, 0.10886283172642477, 0.009907591166784581, -0.12039728463985186, 0.1656576840130425, 0.2775962174738474, -0.060422445222249495, 0.2616241540568096, -0.4988460947516496, -0.21507010982199776, 0.028208409084626233, 0.13632991872145794, 0.18255408538907827, -0.1496745418192839, -0.26040955305064056, 0.09425480384094914, -0.12101686789917396, -0.12491805555992355, -0.06087278470817103, -0.011825759692051772, -0.02781932077018807, -0.1583684588606601, 0.014732310459847846, 0.02181127978743145, 0.041132897275889736, -0.015338825554151655, -0.11628092566641736, -0.03832170813035665, 0.09801739272813353, -0.04091572890098652, 0.030722472248548318, 0.22000112798591348, -0.16130404599243775, -0.16511881523563163, 0.40736120704399503, -0.025516811144568594, -0.14795561229465934, 0.16439159470230705, -0.13182442168877256, -0.13231915950967485, 0.08955370192099667, 0.12817174989892088, 0.09437113298538505, -0.15103262952945204, 0.07964939108458803, -0.03025898089095869, 0.16667196147571542, 0.05226235062076265, 0.17624220387180053, 0.3481732710699915, 0.21707214466447983, 0.06318452445987571, 0.14365631442152613, -0.07670596351533238, -0.019664938923518133, -0.22753028868211675, -0.23106109931857488, -0.22692174396133455, 0.13393825971718837, -0.06226992630122961, -0.20804114690754036, 0.4127040819376302, 0.12893125719299703, 0.17914242724351503, -0.05246454779040979, 0.2663476617105872, 0.11150776972531078, 0.07992189047407643, -0.013141472780894812, 0.24286778770597858, 0.1475000089090115, 0.08000463016659247, -0.20697621572174324, 0.04745941622557281, -0.047992415530050334] |
1,802.09871 | On the random version of the Erd\H{o}s matching conjecture | The Kneser hypergraph ${\rm KG}^r_{n,k}$ is an $r$-uniform hypergraph with
vertex set consisting of all $k$-subsets of $\{1,\ldots,n\}$ and any collection
of $r$ vertices forms an edge if their corresponding $k$-sets are pairwise
disjoint. The random Kneser hypergraph ${\rm KG}^r_{n,k}(p)$ is a spanning
subhypergraph of ${\rm KG}^r_{n,k}$ in which each edge of ${\rm KG}^r_{n,k}$ is
retained independently of each other with probability $p$. The independence
number of random subgraphs of ${\rm KG}^2_{n,k}$ was recently addressed in a
series of works by Bollob{\'a}s, Narayanan, and Raigorodskii (2016), Balogh,
Bollob{\'a}s, and Narayanan (2015), Das and Tran (2016), and Devlin and Kahn
(2016). It was proved that the random counterpart of the Erd\H{o}s-Ko-Rado
theorem continues to be valid even for very small values of $p$. In this paper,
generalizing this result, we will investigate the independence number of random
Kneser hypergraphs ${\rm KG}^r_{n,k}(p)$. Broadly speaking, when $k$ is much
smaller that $n$, we will prove that the random analogue of the Erd\H{o}s
matching conjecture is true even for extremely small values of $p$.
| math.CO | the kneser hypergraph rm kgr_nk is an runiform hypergraph with vertex set consisting of all ksubsets of 1ldotsn and any collection of r vertices forms an edge if their corresponding ksets are pairwise disjoint the random kneser hypergraph rm kgr_nkp is a spanning subhypergraph of rm kgr_nk in which each edge of rm kgr_nk is retained independently of each other with probability p the independence number of random subgraphs of rm kg2_nk was recently addressed in a series of works by bollobas narayanan and raigorodskii 2016 balogh bollobas and narayanan 2015 das and tran 2016 and devlin and kahn 2016 it was proved that the random counterpart of the erdhoskorado theorem continues to be valid even for very small values of p in this paper generalizing this result we will investigate the independence number of random kneser hypergraphs rm kgr_nkp broadly speaking when k is much smaller that n we will prove that the random analogue of the erdhos matching conjecture is true even for extremely small values of p | [['the', 'kneser', 'hypergraph', 'rm', 'kgr_nk', 'is', 'an', 'runiform', 'hypergraph', 'with', 'vertex', 'set', 'consisting', 'of', 'all', 'ksubsets', 'of', '1ldotsn', 'and', 'any', 'collection', 'of', 'r', 'vertices', 'forms', 'an', 'edge', 'if', 'their', 'corresponding', 'ksets', 'are', 'pairwise', 'disjoint', 'the', 'random', 'kneser', 'hypergraph', 'rm', 'kgr_nkp', 'is', 'a', 'spanning', 'subhypergraph', 'of', 'rm', 'kgr_nk', 'in', 'which', 'each', 'edge', 'of', 'rm', 'kgr_nk', 'is', 'retained', 'independently', 'of', 'each', 'other', 'with', 'probability', 'p', 'the', 'independence', 'number', 'of', 'random', 'subgraphs', 'of', 'rm', 'kg2_nk', 'was', 'recently', 'addressed', 'in', 'a', 'series', 'of', 'works', 'by', 'bollobas', 'narayanan', 'and', 'raigorodskii', '2016', 'balogh', 'bollobas', 'and', 'narayanan', '2015', 'das', 'and', 'tran', '2016', 'and', 'devlin', 'and', 'kahn', '2016', 'it', 'was', 'proved', 'that', 'the', 'random', 'counterpart', 'of', 'the', 'erdhoskorado', 'theorem', 'continues', 'to', 'be', 'valid', 'even', 'for', 'very', 'small', 'values', 'of', 'p', 'in', 'this', 'paper', 'generalizing', 'this', 'result', 'we', 'will', 'investigate', 'the', 'independence', 'number', 'of', 'random', 'kneser', 'hypergraphs', 'rm', 'kgr_nkp', 'broadly', 'speaking', 'when', 'k', 'is', 'much', 'smaller', 'that', 'n', 'we', 'will', 'prove', 'that', 'the', 'random', 'analogue', 'of', 'the', 'erdhos', 'matching', 'conjecture', 'is', 'true', 'even', 'for', 'extremely', 'small', 'values', 'of', 'p']] | [-0.17795198004558144, 0.16946573144036026, -0.047006875355110826, 0.022484576682341342, -0.04957251258037356, -0.13046411026959273, 0.029056661048376686, 0.31459599878100386, -0.22391835549644318, -0.3243405123168311, 0.06307271113184404, -0.3306336304248614, -0.09798145554721333, 0.0953905503433871, -0.14374510543028185, 0.04786066377201645, 0.07855586062679179, 0.058639945789150535, 0.071652227037878, -0.3524802402279014, 0.2539562731083617, -0.0025323168374598026, 0.20768874469605914, 0.06271772889916734, 0.019311116823185998, 0.07980704918245685, -0.016512188998735453, 0.08095062160808368, -0.1726982675440429, 0.08801158449152507, 0.2682873841616359, 0.18234448411911502, 0.2807182969682547, -0.3358463682290391, -0.13233424713680836, 0.20556691587069464, 0.09547550842749426, 0.05302098817865263, 0.039236085308457624, -0.2636044592602201, 0.19312466402448356, -0.14050895839660282, -0.10415260523490338, 0.02946234643683735, 0.1776023889633726, 0.00890995943021164, -0.32902635912220163, 0.005014977322509849, 0.160361084582127, 0.04780215008397508, 0.07494411086916071, -0.20087677451742655, -0.04726044710652611, 0.04254682859947978, -0.05283987067263932, 0.08956856874704182, 0.016698878851764083, -0.07769187911503377, -0.14883309698674874, 0.33330217458823896, -0.03203465935426304, -0.08312432759536811, 0.12610781344820757, -0.1500198724603383, -0.2092188623508001, 0.10202165102762877, 0.07707540410660567, 0.1600860913581473, -0.07928264364279339, 0.17887028965731544, -0.20724106369068823, 0.10018573103876538, 0.1860760240009088, 0.011556244380589777, 0.10639816133238106, 0.08431530333298023, 0.12190429260182833, 0.14744854517840691, -0.0033114351421953685, 0.03525481837330364, -0.25605170940419275, -0.11058171893889365, -0.2668763740747011, 0.11179915210652917, -0.16007435200676318, -0.1567116742729243, 0.33770383937082377, 0.11325288419219026, 0.22075815835451507, 0.11847911183006994, 0.18724763627915855, 0.06645155998154793, -0.015325236601294973, 0.17568709438453506, 0.12896754969253643, 0.24104039138323258, -0.031752820143543456, -0.1014678911039471, 0.06171915526024952, 0.14925564263094532] |
1,802.09872 | Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range | Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb independently within the given lower and upper bounds. However, contrarily to classical linear programming, an interval program cannot always be converted into a desired form without affecting its properties, due to the so-called dependency problem.
In this paper, we discuss the common transformations used in linear programming, such as imposing non-negativity on free variables or splitting equations into inequalities, and their effects on interval programs. Specifically, we examine changes in the set of all optimal solutions, optimal values and the optimal value range. Since some of the considered properties do not holds in the general case, we also study a special class of interval programs, in which uncertainty only affects the objective function and the right-hand-side vector. For this class, we obtain stronger results. | math.OC | interval linear programming provides a tool for solving realworld optimization problems under intervalvalued uncertainty instead of approximating or estimating crisp input data the coefficients of an interval program may perturb independently within the given lower and upper bounds however contrarily to classical linear programming an interval program cannot always be converted into a desired form without affecting its properties due to the socalled dependency problem in this paper we discuss the common transformations used in linear programming such as imposing nonnegativity on free variables or splitting equations into inequalities and their effects on interval programs specifically we examine changes in the set of all optimal solutions optimal values and the optimal value range since some of the considered properties do not holds in the general case we also study a special class of interval programs in which uncertainty only affects the objective function and the righthandside vector for this class we obtain stronger results | [['interval', 'linear', 'programming', 'provides', 'a', 'tool', 'for', 'solving', 'realworld', 'optimization', 'problems', 'under', 'intervalvalued', 'uncertainty', 'instead', 'of', 'approximating', 'or', 'estimating', 'crisp', 'input', 'data', 'the', 'coefficients', 'of', 'an', 'interval', 'program', 'may', 'perturb', 'independently', 'within', 'the', 'given', 'lower', 'and', 'upper', 'bounds', 'however', 'contrarily', 'to', 'classical', 'linear', 'programming', 'an', 'interval', 'program', 'can', 'not', 'always', 'be', 'converted', 'into', 'a', 'desired', 'form', 'without', 'affecting', 'its', 'properties', 'due', 'to', 'the', 'socalled', 'dependency', 'problem', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'common', 'transformations', 'used', 'in', 'linear', 'programming', 'such', 'as', 'imposing', 'nonnegativity', 'on', 'free', 'variables', 'or', 'splitting', 'equations', 'into', 'inequalities', 'and', 'their', 'effects', 'on', 'interval', 'programs', 'specifically', 'we', 'examine', 'changes', 'in', 'the', 'set', 'of', 'all', 'optimal', 'solutions', 'optimal', 'values', 'and', 'the', 'optimal', 'value', 'range', 'since', 'some', 'of', 'the', 'considered', 'properties', 'do', 'not', 'holds', 'in', 'the', 'general', 'case', 'we', 'also', 'study', 'a', 'special', 'class', 'of', 'interval', 'programs', 'in', 'which', 'uncertainty', 'only', 'affects', 'the', 'objective', 'function', 'and', 'the', 'righthandside', 'vector', 'for', 'this', 'class', 'we', 'obtain', 'stronger', 'results']] | [-0.10968845794277807, 0.03861912106663259, -0.054346322009880696, 0.11996880800222919, -0.13715238364173038, -0.12497817279110032, 0.07569030193657043, 0.35365170002464325, -0.328462317742167, -0.32199181549010736, 0.1646996493301084, -0.2317948513288772, -0.1098098430211746, 0.21829062617428963, -0.07870470205351951, 0.10723906935900525, 0.06008238625156904, 0.02568488308799363, -0.12252719724520801, -0.2433355339164395, 0.3061452700606277, 0.001959255193510363, 0.22832191731750726, 0.03351649499400669, 0.11932608358141396, 0.07329730982845274, 0.009786617242160343, 0.06567708041759268, -0.14523041136412612, 0.10698442884890791, 0.2788727929094626, 0.18257631042131012, 0.326207825211027, -0.410900178868624, -0.16773487615038551, 0.15435142778461017, 0.10601525422666341, 0.08837859308151828, 0.006579212287831451, -0.22827094697032965, 0.06945023718440245, -0.09217784066324032, -0.08231811409575805, -0.048245749220011694, -0.0072913141500565316, 0.004928681976161897, -0.31634736519246814, 0.03829218147213631, 0.09068882124678743, 0.03837672161265096, -0.09089842060310466, -0.14711317934261095, 0.0005536232489131151, 0.10882286371422871, 0.03433369423803543, -0.00653493937946135, 0.10243494468290479, -0.09617683803061805, -0.10046655470280037, 0.3820620182481024, -0.07763994350323393, -0.2780002177963334, 0.14277796429852324, -0.1184730971292142, -0.18639829350004514, 0.08483004358882505, 0.24161116047912548, 0.14424911436714952, -0.16087136576102384, 0.11062335933017875, -0.058327494756503576, 0.17860321916880145, 0.0717898253306386, 0.05747951516138029, 0.1611690794313026, 0.09720679249374135, 0.11349898759696272, 0.17957692868301584, 0.006781480196983583, -0.10517720279073522, -0.31402372771934156, -0.12056641745110673, -0.1431058515892214, -0.006841846089622366, -0.1002032731791147, -0.17235825562233767, 0.3677217157362329, 0.14804192960690407, 0.17111201777344479, 0.11367299143119805, 0.24518446307028494, 0.19253020264788515, 0.052760731706756256, 0.10111557311348376, 0.19916654003186962, 0.09915773391483292, 0.07174805248336445, -0.19649989037293822, 0.13720002814586604, 0.059658282520549916] |
1,802.09873 | Quantum space and quantum completeness | Motivated by the question whether quantum gravity can "smear out" the
classical singularity we analyze a certain quantum space and its
quantum-mechanical completeness. Classical singularity is understood as a
geodesic incompleteness, while quantum completeness requires a unique unitary
time evolution for test fields propagating on an underlying background. Here
the crucial point is that quantum completeness renders the Hamiltonian (or
spatial part of the wave operator) to be essentially self-adjoint in order to
generate a unique time evolution. We examine a model of quantum space which
consists of a noncommutative BTZ black hole probed by a test scalar field. We
show that the quantum gravity (noncommutative) effect is to enlarge the domain
of BTZ parameters for which the relevant wave operator is essentially
self-adjoint. This means that the corresponding quantum space is quantum
complete for a larger range of BTZ parameters rendering the conclusion that in
the quantum space one observes the effect of "smearing out" the singularity.
| hep-th gr-qc math-ph math.MP quant-ph | motivated by the question whether quantum gravity can smear out the classical singularity we analyze a certain quantum space and its quantummechanical completeness classical singularity is understood as a geodesic incompleteness while quantum completeness requires a unique unitary time evolution for test fields propagating on an underlying background here the crucial point is that quantum completeness renders the hamiltonian or spatial part of the wave operator to be essentially selfadjoint in order to generate a unique time evolution we examine a model of quantum space which consists of a noncommutative btz black hole probed by a test scalar field we show that the quantum gravity noncommutative effect is to enlarge the domain of btz parameters for which the relevant wave operator is essentially selfadjoint this means that the corresponding quantum space is quantum complete for a larger range of btz parameters rendering the conclusion that in the quantum space one observes the effect of smearing out the singularity | [['motivated', 'by', 'the', 'question', 'whether', 'quantum', 'gravity', 'can', 'smear', 'out', 'the', 'classical', 'singularity', 'we', 'analyze', 'a', 'certain', 'quantum', 'space', 'and', 'its', 'quantummechanical', 'completeness', 'classical', 'singularity', 'is', 'understood', 'as', 'a', 'geodesic', 'incompleteness', 'while', 'quantum', 'completeness', 'requires', 'a', 'unique', 'unitary', 'time', 'evolution', 'for', 'test', 'fields', 'propagating', 'on', 'an', 'underlying', 'background', 'here', 'the', 'crucial', 'point', 'is', 'that', 'quantum', 'completeness', 'renders', 'the', 'hamiltonian', 'or', 'spatial', 'part', 'of', 'the', 'wave', 'operator', 'to', 'be', 'essentially', 'selfadjoint', 'in', 'order', 'to', 'generate', 'a', 'unique', 'time', 'evolution', 'we', 'examine', 'a', 'model', 'of', 'quantum', 'space', 'which', 'consists', 'of', 'a', 'noncommutative', 'btz', 'black', 'hole', 'probed', 'by', 'a', 'test', 'scalar', 'field', 'we', 'show', 'that', 'the', 'quantum', 'gravity', 'noncommutative', 'effect', 'is', 'to', 'enlarge', 'the', 'domain', 'of', 'btz', 'parameters', 'for', 'which', 'the', 'relevant', 'wave', 'operator', 'is', 'essentially', 'selfadjoint', 'this', 'means', 'that', 'the', 'corresponding', 'quantum', 'space', 'is', 'quantum', 'complete', 'for', 'a', 'larger', 'range', 'of', 'btz', 'parameters', 'rendering', 'the', 'conclusion', 'that', 'in', 'the', 'quantum', 'space', 'one', 'observes', 'the', 'effect', 'of', 'smearing', 'out', 'the', 'singularity']] | [-0.13617740782870044, 0.13787617948787845, -0.10726694452069417, 0.12317144796266986, -0.10677736577625045, -0.12066349967919243, 0.00309742958199445, 0.2901292386217208, -0.25064944790063215, -0.22866866223608392, 0.07740990279899627, -0.265955659083409, -0.12650507565475763, 0.18532479643384053, -0.04463889803206902, 0.08411609071536767, 0.04195368147743984, 0.06748993592218885, -0.11157490443909847, -0.23821866957402987, 0.3983640625035461, 0.07888546471316013, 0.2217659046711353, 0.015640427243506796, 0.1252681542529807, 0.0286876855866064, 0.013041078602258541, 0.036693712162248836, -0.12301852321344328, 0.03359615380133066, 0.23618760908499972, 0.10607233340336199, 0.2668959206718763, -0.37870243617298105, -0.25770973104724215, 0.1018091365488694, 0.137215780253416, 0.1528087346578795, -0.03230555668838699, -0.3198646315391164, 0.07224183582960145, -0.13001067835625402, -0.17106719037423593, -0.0740568055609194, 0.021444892031111152, -0.10407636257528056, -0.21328051390953043, 0.07720774200839238, 0.10387099094326384, 0.010995982559633594, -0.022440402287418094, 0.006195060929424966, -0.023790742647893066, 0.10512064735234208, -0.01160864527204628, 0.04781604872108732, 0.13325410944857646, -0.11520792414173425, -0.13804024699972234, 0.4042817842616122, -0.05827261750878106, -0.23123011280652844, 0.12732500605627045, -0.18706457264414883, -0.06740261086769685, 0.09107169662189635, 0.08823271246355828, 0.14617667425588904, -0.13853494761676727, 0.1922566581077585, -0.01163930764264881, 0.17446997839035733, 0.08189266465038439, 0.08829278777105899, 0.281543111046953, 0.10368470617723238, 0.08600980146564072, 0.15715764872243487, -0.050734332239526454, -0.1667596065745795, -0.3765296854691792, -0.20733674380285783, -0.2037238648457488, 0.13799146526619127, -0.11279547920579877, -0.20619772214301024, 0.39406453278004133, 0.16501248441562882, 0.1730395678896457, -0.002169725536722454, 0.24932148645976795, 0.1403717943120901, 0.03620594698063369, 0.0469370341293891, 0.25058009319856195, 0.13246050091825803, 0.07615384766743577, -0.2541600707962614, -0.036004328496070416, 0.09125438743842695] |
1,802.09874 | Search for excited muons at the future SPPC-based muon-proton colliders | We have investigated the production potential of the spin-1/2 excited muons,
predicted by the preonic models, at the four SPPC (Super Proton-Proton
Collider)-based muon-proton colliders in different center-of-mass energies. For
the signal process \mu p\rightarrow\mu^{\star}X\rightarrow\mu\gamma X, the
production cross-section and the decay width values of the excited muons have
been calculated. The pseudorapidity and transverse momentum distributions of
the final state particles of muons and photons have been obtained to be
determine the kinematical cuts best suited for discovery of the excited muons.
By applying these cuts we have gotten the discovery, observation and exclusion
mass limits of the excited muons for two compositeness scale values. It is
shown that the discovery limits on the excited muons in case the compositeness
scale equals to 100 TeV are 2.7, 3.9, 3.1 and 6.7 TeV for center-of-mass
energies of 10.3, 14.2, 14.6 and 20.2 TeV, respectively.
| hep-ph | we have investigated the production potential of the spin12 excited muons predicted by the preonic models at the four sppc super protonproton colliderbased muonproton colliders in different centerofmass energies for the signal process mu prightarrowmustarxrightarrowmugamma x the production crosssection and the decay width values of the excited muons have been calculated the pseudorapidity and transverse momentum distributions of the final state particles of muons and photons have been obtained to be determine the kinematical cuts best suited for discovery of the excited muons by applying these cuts we have gotten the discovery observation and exclusion mass limits of the excited muons for two compositeness scale values it is shown that the discovery limits on the excited muons in case the compositeness scale equals to 100 tev are 27 39 31 and 67 tev for centerofmass energies of 103 142 146 and 202 tev respectively | [['we', 'have', 'investigated', 'the', 'production', 'potential', 'of', 'the', 'spin12', 'excited', 'muons', 'predicted', 'by', 'the', 'preonic', 'models', 'at', 'the', 'four', 'sppc', 'super', 'protonproton', 'colliderbased', 'muonproton', 'colliders', 'in', 'different', 'centerofmass', 'energies', 'for', 'the', 'signal', 'process', 'mu', 'prightarrowmustarxrightarrowmugamma', 'x', 'the', 'production', 'crosssection', 'and', 'the', 'decay', 'width', 'values', 'of', 'the', 'excited', 'muons', 'have', 'been', 'calculated', 'the', 'pseudorapidity', 'and', 'transverse', 'momentum', 'distributions', 'of', 'the', 'final', 'state', 'particles', 'of', 'muons', 'and', 'photons', 'have', 'been', 'obtained', 'to', 'be', 'determine', 'the', 'kinematical', 'cuts', 'best', 'suited', 'for', 'discovery', 'of', 'the', 'excited', 'muons', 'by', 'applying', 'these', 'cuts', 'we', 'have', 'gotten', 'the', 'discovery', 'observation', 'and', 'exclusion', 'mass', 'limits', 'of', 'the', 'excited', 'muons', 'for', 'two', 'compositeness', 'scale', 'values', 'it', 'is', 'shown', 'that', 'the', 'discovery', 'limits', 'on', 'the', 'excited', 'muons', 'in', 'case', 'the', 'compositeness', 'scale', 'equals', 'to', '100', 'tev', 'are', '27', '39', '31', 'and', '67', 'tev', 'for', 'centerofmass', 'energies', 'of', '103', '142', '146', 'and', '202', 'tev', 'respectively']] | [-0.0635460154698849, 0.2794959602122019, -0.03282166070832344, 0.15857953490928586, 0.011132821631194516, -0.10279933938600279, 0.007494922958548878, 0.3395409532948853, -0.16707239385980827, -0.3887009873409866, 0.011788226527298664, -0.3671808202679341, 0.14012597403586743, 0.1546101478446223, 0.13970664431425658, 0.09382930579224856, 0.11468101353742756, 0.00927805208675954, -0.023527990197486054, -0.22331576478517765, 0.2525458491197299, 0.09755046292488183, 0.2322289312740306, 0.15042139472231478, 0.09624942836687099, 0.011922981318125463, -0.016286776807335028, -0.09565404943236104, -0.1485792975130404, 0.06222758400807535, 0.21258681236597457, 0.04844404209870845, 0.11612466632525299, -0.30486204456277455, -0.08819007837715057, 0.13953294092463656, 0.1694714666891296, 0.051315234861681824, -0.03464693553058652, -0.3519574911447594, 0.10581109836254712, -0.1926298774909098, -0.12706226604450102, -0.005852224542987305, 0.047091652626184734, -0.03521145938837028, -0.2579476116159996, 0.10416148683720536, -0.06026908842898853, 0.06342448963347327, -0.06687050637255025, -0.24917168420954391, -0.07472340663621475, -0.005911921339851993, 0.10571189791471307, 0.028030751909873097, 0.1789200403239135, -0.12464868296523923, -0.21625418663741305, 0.3529520109035335, -0.03818453632545872, -0.15607514897836827, 0.19831002394463607, -0.22249179525900034, -0.11480528158884677, 0.2280562408463834, 0.24273215788839894, 0.1025986705415791, -0.2203396937542862, 0.10025147201210079, 0.012607688960208968, 0.12977581608135227, 0.13586350560344598, 0.07099999807338667, 0.1857334353238136, 0.21105070433651024, -0.01236065294124655, 0.0536112748143439, -0.2090679221815866, -0.025299464903264696, -0.359540804399998, -0.10776921203302975, -0.13014953518188657, 0.07351540562931214, -0.03351897300140431, -0.01077682742180622, 0.37819843972427447, 0.08490973636626031, 0.2710863252339715, -0.01334345540995677, 0.23732393134020632, 0.12345649964351962, 0.06351730269803242, 0.07856644520705397, 0.3861570219294383, 0.1760875675208554, 0.12414892044543595, -0.18580986056281448, -6.179053375458384e-05, 0.013230395923414223] |
1,802.09875 | Ion heating and magnetic flux pile-up in a magnetic reconnection
experiment with super-Alfvenic plasma inflows | This work presents a magnetic reconnection experiment in which the kinetic,
magnetic and thermal properties of the plasma each play an important role in
the overall energy balance and structure of the generated reconnection layer.
Magnetic reconnection occurs during the interaction of continuous and steady
flows of super-Alfvenic, magnetized, aluminum plasma, which collide in a
geometry with two-dimensional symmetry, producing a stable and long-lasting
reconnection layer. Optical Thomson scattering measurements show that when the
layer forms, ions inside the layer are more strongly heated than electrons,
reaching temperatures of Ti~ZTe>300 eV - much greater than can be expected from
strong shock and viscous heating alone. Later in time, as the plasma density in
the layer increases, the electron and ion temperatures are found to
equilibrate, and a constant plasma temperature is achieved through a balance of
the heating mechanisms and radiative losses of the plasma. Measurements from
Faraday rotation polarimetry also indicate the presence of significant magnetic
field pile-up occurring at the boundary of the reconnection region, which is
consistent with the super-Alfvenic velocity of the inflows.
| physics.plasm-ph | this work presents a magnetic reconnection experiment in which the kinetic magnetic and thermal properties of the plasma each play an important role in the overall energy balance and structure of the generated reconnection layer magnetic reconnection occurs during the interaction of continuous and steady flows of superalfvenic magnetized aluminum plasma which collide in a geometry with twodimensional symmetry producing a stable and longlasting reconnection layer optical thomson scattering measurements show that when the layer forms ions inside the layer are more strongly heated than electrons reaching temperatures of tizte300 ev much greater than can be expected from strong shock and viscous heating alone later in time as the plasma density in the layer increases the electron and ion temperatures are found to equilibrate and a constant plasma temperature is achieved through a balance of the heating mechanisms and radiative losses of the plasma measurements from faraday rotation polarimetry also indicate the presence of significant magnetic field pileup occurring at the boundary of the reconnection region which is consistent with the superalfvenic velocity of the inflows | [['this', 'work', 'presents', 'a', 'magnetic', 'reconnection', 'experiment', 'in', 'which', 'the', 'kinetic', 'magnetic', 'and', 'thermal', 'properties', 'of', 'the', 'plasma', 'each', 'play', 'an', 'important', 'role', 'in', 'the', 'overall', 'energy', 'balance', 'and', 'structure', 'of', 'the', 'generated', 'reconnection', 'layer', 'magnetic', 'reconnection', 'occurs', 'during', 'the', 'interaction', 'of', 'continuous', 'and', 'steady', 'flows', 'of', 'superalfvenic', 'magnetized', 'aluminum', 'plasma', 'which', 'collide', 'in', 'a', 'geometry', 'with', 'twodimensional', 'symmetry', 'producing', 'a', 'stable', 'and', 'longlasting', 'reconnection', 'layer', 'optical', 'thomson', 'scattering', 'measurements', 'show', 'that', 'when', 'the', 'layer', 'forms', 'ions', 'inside', 'the', 'layer', 'are', 'more', 'strongly', 'heated', 'than', 'electrons', 'reaching', 'temperatures', 'of', 'tizte300', 'ev', 'much', 'greater', 'than', 'can', 'be', 'expected', 'from', 'strong', 'shock', 'and', 'viscous', 'heating', 'alone', 'later', 'in', 'time', 'as', 'the', 'plasma', 'density', 'in', 'the', 'layer', 'increases', 'the', 'electron', 'and', 'ion', 'temperatures', 'are', 'found', 'to', 'equilibrate', 'and', 'a', 'constant', 'plasma', 'temperature', 'is', 'achieved', 'through', 'a', 'balance', 'of', 'the', 'heating', 'mechanisms', 'and', 'radiative', 'losses', 'of', 'the', 'plasma', 'measurements', 'from', 'faraday', 'rotation', 'polarimetry', 'also', 'indicate', 'the', 'presence', 'of', 'significant', 'magnetic', 'field', 'pileup', 'occurring', 'at', 'the', 'boundary', 'of', 'the', 'reconnection', 'region', 'which', 'is', 'consistent', 'with', 'the', 'superalfvenic', 'velocity', 'of', 'the', 'inflows']] | [-0.13122844706755132, 0.26828646136522627, -0.01035722207011921, 0.045548459121824376, -0.010841145467545305, -0.09994939246614064, -0.00773903743496963, 0.3865724681849991, -0.26963612116074986, -0.3206076567992568, 0.037766496179226255, -0.2606151504814625, -0.009855278441682458, 0.2043804281337985, 0.06022183149371163, -0.019402812626212837, 0.05906658194027841, -0.02102100628095546, -0.02540713292080909, -0.15345589962405418, 0.27867237694162345, 0.16445618174704058, 0.26966276191441074, 0.1014083734979587, 0.06710314559883306, -0.09963596085485603, 0.02527083705844624, 0.04470618724124506, -0.10971391879433733, 0.022158018637980732, 0.17446846521093642, -0.01891753601309444, 0.23867875957728496, -0.5283240276468651, -0.27700458543641227, -0.007315787864582879, 0.1641317445997681, 0.07295723052495824, -0.0836334880645154, -0.20359294896147082, -0.0007446709787473083, -0.1412408591640581, -0.10797743827636753, 0.0189171135718269, 0.011142031715384552, 0.023978562911174128, -0.32989549237070603, 0.1397788743500132, 0.09870797110987561, 0.06874170589127711, -0.12303421892109327, -0.028514385920550143, -0.11073453353984015, 0.05195999795787169, 0.09596408396161028, 0.08679077644433295, 0.2499986775518794, -0.18096962513002965, -0.0299367104736822, 0.36782973791871754, -0.031759631943257, -0.07377960950867939, 0.2151892693393997, -0.24134274576923678, -0.04378285872833138, 0.24180633473875268, 0.16909441871435515, 0.0997157599138362, -0.1020656495592058, -0.020407139545838747, -0.03438313478870051, 0.1312437109480587, 0.08988838615295078, 0.005589291230509324, 0.27368404895067217, 0.17958729889443412, 0.03839758160923209, 0.14719685000309254, -0.15222508330571666, -0.0440129602833518, -0.2808980165688055, -0.15337172575827157, -0.12038737064892692, 0.05874276604253932, -0.08697592503989914, -0.1656849922426045, 0.3690497521736792, 0.17969796915937747, 0.17986929138856275, -0.08933685931909298, 0.32588127057467187, 0.1354941739228421, 0.05502602483678077, 0.17530512140099225, 0.3084100792290909, 0.1984183505709682, 0.1662768249772489, -0.2748817067792905, 0.0837614660044866, 0.030184341790154577] |
1,802.09876 | Parameter diagnostics of phases and phase transition learning by neural
networks | We present an analysis of neural network-based machine learning schemes for
phases and phase transitions in theoretical condensed matter research, focusing
on neural networks with a single hidden layer. Such shallow neural networks
were previously found to be efficient in classifying phases and locating phase
transitions of various basic model systems. In order to rationalize the
emergence of the classification process and for identifying any underlying
physical quantities, it is feasible to examine the weight matrices and the
convolutional filter kernels that result from the learning process of such
shallow networks. Furthermore, we demonstrate how the learning-by-confusing
scheme can be used, in combination with a simple threshold-value classification
method, to diagnose the learning parameters of neural networks. In particular,
we study the classification process of both fully-connected and convolutional
neural networks for the two-dimensional Ising model with extended domain wall
configurations included in the low-temperature regime. Moreover, we consider
the two-dimensional XY model and contrast the performance of the
learning-by-confusing scheme and convolutional neural networks trained on bare
spin configurations to the case of preprocessed samples with respect to vortex
configurations. We discuss these findings in relation to similar recent
investigations and possible further applications.
| cond-mat.stat-mech | we present an analysis of neural networkbased machine learning schemes for phases and phase transitions in theoretical condensed matter research focusing on neural networks with a single hidden layer such shallow neural networks were previously found to be efficient in classifying phases and locating phase transitions of various basic model systems in order to rationalize the emergence of the classification process and for identifying any underlying physical quantities it is feasible to examine the weight matrices and the convolutional filter kernels that result from the learning process of such shallow networks furthermore we demonstrate how the learningbyconfusing scheme can be used in combination with a simple thresholdvalue classification method to diagnose the learning parameters of neural networks in particular we study the classification process of both fullyconnected and convolutional neural networks for the twodimensional ising model with extended domain wall configurations included in the lowtemperature regime moreover we consider the twodimensional xy model and contrast the performance of the learningbyconfusing scheme and convolutional neural networks trained on bare spin configurations to the case of preprocessed samples with respect to vortex configurations we discuss these findings in relation to similar recent investigations and possible further applications | [['we', 'present', 'an', 'analysis', 'of', 'neural', 'networkbased', 'machine', 'learning', 'schemes', 'for', 'phases', 'and', 'phase', 'transitions', 'in', 'theoretical', 'condensed', 'matter', 'research', 'focusing', 'on', 'neural', 'networks', 'with', 'a', 'single', 'hidden', 'layer', 'such', 'shallow', 'neural', 'networks', 'were', 'previously', 'found', 'to', 'be', 'efficient', 'in', 'classifying', 'phases', 'and', 'locating', 'phase', 'transitions', 'of', 'various', 'basic', 'model', 'systems', 'in', 'order', 'to', 'rationalize', 'the', 'emergence', 'of', 'the', 'classification', 'process', 'and', 'for', 'identifying', 'any', 'underlying', 'physical', 'quantities', 'it', 'is', 'feasible', 'to', 'examine', 'the', 'weight', 'matrices', 'and', 'the', 'convolutional', 'filter', 'kernels', 'that', 'result', 'from', 'the', 'learning', 'process', 'of', 'such', 'shallow', 'networks', 'furthermore', 'we', 'demonstrate', 'how', 'the', 'learningbyconfusing', 'scheme', 'can', 'be', 'used', 'in', 'combination', 'with', 'a', 'simple', 'thresholdvalue', 'classification', 'method', 'to', 'diagnose', 'the', 'learning', 'parameters', 'of', 'neural', 'networks', 'in', 'particular', 'we', 'study', 'the', 'classification', 'process', 'of', 'both', 'fullyconnected', 'and', 'convolutional', 'neural', 'networks', 'for', 'the', 'twodimensional', 'ising', 'model', 'with', 'extended', 'domain', 'wall', 'configurations', 'included', 'in', 'the', 'lowtemperature', 'regime', 'moreover', 'we', 'consider', 'the', 'twodimensional', 'xy', 'model', 'and', 'contrast', 'the', 'performance', 'of', 'the', 'learningbyconfusing', 'scheme', 'and', 'convolutional', 'neural', 'networks', 'trained', 'on', 'bare', 'spin', 'configurations', 'to', 'the', 'case', 'of', 'preprocessed', 'samples', 'with', 'respect', 'to', 'vortex', 'configurations', 'we', 'discuss', 'these', 'findings', 'in', 'relation', 'to', 'similar', 'recent', 'investigations', 'and', 'possible', 'further', 'applications']] | [-0.07610151099197537, 0.0595661038369902, -0.032402071738033555, 0.05140614174932997, -0.038161537168586314, -0.17645112249980835, 0.039221206465299474, 0.4611294412364562, -0.27971938560464576, -0.2754028533251282, 0.07385300915545183, -0.24782750636707837, -0.24969878990305006, 0.17538751830215915, -0.041272358289764575, 0.11530155364016537, 0.0706193483104774, 0.013586865587664457, -0.08466771667402402, -0.262154449562028, 0.3308818443110795, 0.016203593858032644, 0.3462836839607917, 0.013809496757554976, 0.06937440708376623, -0.03866602936614072, 0.009164298205481222, -0.00745680652714024, -0.11963070283085624, 0.12251630756041247, 0.2708180188492406, 0.0909237959155386, 0.23684565396009324, -0.45878638384359266, -0.2829873216235986, 0.13076365128169223, 0.1397354442269716, 0.14869700714234568, -0.0032333571986479606, -0.31218108277607826, 0.08623353084048328, -0.17220333055108009, -0.0547492422022818, -0.15024099826890355, -0.03134440277062822, 0.019943005928932205, -0.2615131125591385, 0.028126842400524765, 0.08684806072172553, 0.04073722518660361, -0.0644710619047449, -0.09916053074448428, 0.000830089424198377, 0.1344310834974749, 0.003238718858028733, 0.04922901544947914, 0.11298979221464833, -0.21435380858019926, -0.16873561031873882, 0.33751191339979414, -0.04413150457852074, -0.18612722237594426, 0.2173412090705824, -0.05827221268085244, -0.16377803619616316, 0.0741752998631758, 0.2519333151261283, 0.10232842832435078, -0.14267763192765415, 0.00021207709020624557, -0.026251608699870605, 0.16364570686043103, -0.00031511477815608185, 0.003796784277559103, 0.20327582636612837, 0.276555108838996, -0.017870742825228565, 0.16634840454086466, -0.13431036714852476, -0.11190078060675053, -0.21858805329732908, -0.10971624624956651, -0.18195873591442555, -0.014403925742347687, -0.09263505327968839, -0.15729850590165975, 0.42956506426355645, 0.19693578943770262, 0.21835663402801705, 0.06715270335431948, 0.27781178816439933, 0.0657007866272276, 0.10861493762058672, 0.07927199280675268, 0.2093874770895733, 0.1298179006492622, 0.12597040183997402, -0.17852291483359295, 0.04342675450864893, 0.06408879752173864] |
1,802.09877 | Blockchain Abstract Data Type | The presented work continues the line of recent distributed computing
communityefforts dedicated to the theoretical aspects of blockchains. This
paper is the rst tospecify blockchains as a composition of abstract data types
all together with a hierarchyof consistency criteria that formally
characterizes the histories admissible for distributedprograms that use them.
Our work is based on an original oracle-based constructionthat, along with new
consistency deffnitions, captures the eventual convergence processin blockchain
systems. The paper presents as well some results on implementability ofthe
presented abstractions and a mapping of representative existing blockchains
fromboth academia and industry in our framework.
| cs.DC | the presented work continues the line of recent distributed computing communityefforts dedicated to the theoretical aspects of blockchains this paper is the rst tospecify blockchains as a composition of abstract data types all together with a hierarchyof consistency criteria that formally characterizes the histories admissible for distributedprograms that use them our work is based on an original oraclebased constructionthat along with new consistency deffnitions captures the eventual convergence processin blockchain systems the paper presents as well some results on implementability ofthe presented abstractions and a mapping of representative existing blockchains fromboth academia and industry in our framework | [['the', 'presented', 'work', 'continues', 'the', 'line', 'of', 'recent', 'distributed', 'computing', 'communityefforts', 'dedicated', 'to', 'the', 'theoretical', 'aspects', 'of', 'blockchains', 'this', 'paper', 'is', 'the', 'rst', 'tospecify', 'blockchains', 'as', 'a', 'composition', 'of', 'abstract', 'data', 'types', 'all', 'together', 'with', 'a', 'hierarchyof', 'consistency', 'criteria', 'that', 'formally', 'characterizes', 'the', 'histories', 'admissible', 'for', 'distributedprograms', 'that', 'use', 'them', 'our', 'work', 'is', 'based', 'on', 'an', 'original', 'oraclebased', 'constructionthat', 'along', 'with', 'new', 'consistency', 'deffnitions', 'captures', 'the', 'eventual', 'convergence', 'processin', 'blockchain', 'systems', 'the', 'paper', 'presents', 'as', 'well', 'some', 'results', 'on', 'implementability', 'ofthe', 'presented', 'abstractions', 'and', 'a', 'mapping', 'of', 'representative', 'existing', 'blockchains', 'fromboth', 'academia', 'and', 'industry', 'in', 'our', 'framework']] | [-0.10691030303714796, -0.02475498370266804, -0.10275354842758841, 0.036220978351775554, -0.09245915884255534, -0.094627893762663, 0.06202299998193565, 0.36141429108877976, -0.26797902897621195, -0.2831513041837348, 0.1314015016360726, -0.2637901578305496, -0.12717007735433677, 0.1898321120430612, -0.1480996642468704, 0.094721849123016, 0.0721465831519001, -0.012657096609473228, -0.052332882169220184, -0.28292911986096037, 0.3408980629937206, 0.06313143394266565, 0.3296155955642462, 0.06034952838801676, 0.07407461998389206, 0.0029051189517809283, -0.06553314491175115, 0.012736632188575136, -0.13843507645991243, 0.2074952789944493, 0.2801628847865181, 0.22232771264389156, 0.31199577380903065, -0.40544903013441297, -0.167777602133962, 0.0353692960459739, 0.12339850663621392, 0.07892241570581164, -0.08555302287762363, -0.28879210577449865, 0.09582323921430443, -0.2071216668571449, -0.10858464502832955, -0.09866219895969455, -0.0013911123258165186, 0.06094906414962477, -0.23061369164950318, -0.012196003324869606, 0.11507794546196237, 0.0618261017345099, -0.05972097620574964, -0.09660536352958944, 0.017047717435181967, 0.14228792808846466, 0.04977302553339137, 0.004082033612454931, 0.10158245445539554, -0.07313594267858813, -0.16972126483451574, 0.38015617980725236, -0.027333557057297894, -0.1432273379462357, 0.22810823891518844, -0.005389622477297153, -0.2209687822394901, 0.0179657839448838, 0.1588906653949784, 0.09628525087609888, -0.1923595913323677, 0.10297020556431057, -0.07741958804221617, 0.15165693278734882, -0.01103455446427688, 0.04497014274303284, 0.1793486311747175, 0.21263339494148062, 0.06349615358954502, 0.12792061317660328, 0.026939487619933464, -0.14251579992059205, -0.32147606905135845, -0.16956505758894813, -0.139927478632631, -0.04304496464319527, -0.05832026325030407, -0.16366535256642642, 0.4127893162270387, 0.20207226518541574, 0.17189647171956798, 0.13059128651964583, 0.37546621904604965, 0.03831414848876496, 0.05294383384781314, 0.07924876431934536, 0.1819637080450775, 0.09071105511935053, 0.1703887864999059, -0.14553171382285654, 0.11923894232475302, 0.04329275970554186] |
1,802.09878 | Clustering of Series via Dynamic Mode Decomposition and the Matrix
Pencil Method | In this paper, a new algorithm for extracting features from sequences of
multidimensional observations is presented. The independently developed Dynamic
Mode Decomposition and Matrix Pencil methods provide a least-squares
model-based approach for estimating complex frequencies present in signals as
well as their corresponding amplitudes. Unlike other feature extraction methods
such as Fourier Transform or Autoregression which have to be computed for each
sequence individually, the least-squares approach considers the whole dataset
at once. It invokes order reduction methods to extract a small number of
features best describing all given data, and indicate which frequencies
correspond to which sequences. As an illustrative example, the new method is
applied to regions of different grain orientation in a Transmission Electron
Microscopy image.
| math.NA | in this paper a new algorithm for extracting features from sequences of multidimensional observations is presented the independently developed dynamic mode decomposition and matrix pencil methods provide a leastsquares modelbased approach for estimating complex frequencies present in signals as well as their corresponding amplitudes unlike other feature extraction methods such as fourier transform or autoregression which have to be computed for each sequence individually the leastsquares approach considers the whole dataset at once it invokes order reduction methods to extract a small number of features best describing all given data and indicate which frequencies correspond to which sequences as an illustrative example the new method is applied to regions of different grain orientation in a transmission electron microscopy image | [['in', 'this', 'paper', 'a', 'new', 'algorithm', 'for', 'extracting', 'features', 'from', 'sequences', 'of', 'multidimensional', 'observations', 'is', 'presented', 'the', 'independently', 'developed', 'dynamic', 'mode', 'decomposition', 'and', 'matrix', 'pencil', 'methods', 'provide', 'a', 'leastsquares', 'modelbased', 'approach', 'for', 'estimating', 'complex', 'frequencies', 'present', 'in', 'signals', 'as', 'well', 'as', 'their', 'corresponding', 'amplitudes', 'unlike', 'other', 'feature', 'extraction', 'methods', 'such', 'as', 'fourier', 'transform', 'or', 'autoregression', 'which', 'have', 'to', 'be', 'computed', 'for', 'each', 'sequence', 'individually', 'the', 'leastsquares', 'approach', 'considers', 'the', 'whole', 'dataset', 'at', 'once', 'it', 'invokes', 'order', 'reduction', 'methods', 'to', 'extract', 'a', 'small', 'number', 'of', 'features', 'best', 'describing', 'all', 'given', 'data', 'and', 'indicate', 'which', 'frequencies', 'correspond', 'to', 'which', 'sequences', 'as', 'an', 'illustrative', 'example', 'the', 'new', 'method', 'is', 'applied', 'to', 'regions', 'of', 'different', 'grain', 'orientation', 'in', 'a', 'transmission', 'electron', 'microscopy', 'image']] | [-0.029710488706952382, 0.02522627636802504, -0.10052554148538899, 0.05973979665706044, -0.0789737989969489, -0.16489772912224426, 0.009853000216041262, 0.39872411735543684, -0.3059136663649638, -0.3156613892946048, 0.13240133189232314, -0.25386823629256056, -0.1663567914740973, 0.2271811021394057, -0.04302192490720073, 0.0785088235827382, 0.06834663520762775, 0.02522458560092711, -0.03959449598597003, -0.19182060032245554, 0.2790092638646792, 0.038444599551500896, 0.2897663529758819, -0.053053422877956335, 0.11552339211642398, 0.033574855213343094, -0.07497047629410855, -0.00804940307857234, -0.07027749433143049, 0.123795874346392, 0.3177324990358423, 0.16740337416467047, 0.2544474471712626, -0.3881664232354799, -0.22652542225609557, 0.08217542066371866, 0.17156419024348823, 0.13389394393272916, -0.028271854062713368, -0.24811937891635574, 0.07517020180508369, -0.11524310620685554, -0.08420178383400961, -0.13416194791529923, -0.008944735071864449, 0.021432967942615015, -0.3257807960553768, 0.07800042441020869, 0.01931450198924936, 0.06585218950576822, -0.08287706243866241, -0.15543518011544308, 0.0336532648359308, 0.14236824973408102, 0.04071384233602581, 0.03434633644407287, 0.11583962547005851, -0.07467755046281807, -0.12273907361692991, 0.375421276016693, -0.058429960013727245, -0.2233545511722283, 0.16711217773092144, -0.1001139538550452, -0.13856824336792617, 0.160433070335005, 0.19241929628706278, 0.14962859699960424, -0.16741996185713204, -0.0077764322504816, -0.022512237643118667, 0.1669220870161163, 0.08717607568260752, 0.0124542126588586, 0.18537712495523592, 0.17059489821686463, 0.04898345249532839, 0.12928068065700835, -0.1446716254420516, -0.02261209982044275, -0.24658402580789393, -0.11189409706960707, -0.21481740294868604, -0.051895828181956, -0.09298151501375172, -0.19971013502335222, 0.4134448780012982, 0.15659588717213763, 0.24814504761436657, 0.032440410065073366, 0.3494561323817788, 0.12221491219624564, 0.090143851528899, 0.040666320752509, 0.1532693413720161, 0.10236432589981861, 0.08006351779238517, -0.17839014555030197, 0.05065431731983926, 0.09852319975782718] |
1,802.09879 | L0TV: A Sparse Optimization Method for Impulse Noise Image Restoration | Total Variation (TV) is an effective and popular prior model in the field of
regularization-based image processing. This paper focuses on total variation
for removing impulse noise in image restoration. This type of noise frequently
arises in data acquisition and transmission due to many reasons, e.g. a faulty
sensor or analog-to-digital converter errors. Removing this noise is an
important task in image restoration. State-of-the-art methods such as Adaptive
Outlier Pursuit(AOP) \cite{yan2013restoration}, which is based on TV with
$\ell_{02}$-norm data fidelity, only give sub-optimal performance. In this
paper, we propose a new sparse optimization method, called $\ell_0TV$-PADMM,
which solves the TV-based restoration problem with $\ell_0$-norm data fidelity.
To effectively deal with the resulting non-convex non-smooth optimization
problem, we first reformulate it as an equivalent biconvex Mathematical Program
with Equilibrium Constraints (MPEC), and then solve it using a proximal
Alternating Direction Method of Multipliers (PADMM). Our $\ell_0TV$-PADMM
method finds a desirable solution to the original $\ell_0$-norm optimization
problem and is proven to be convergent under mild conditions. We apply
$\ell_0TV$-PADMM to the problems of image denoising and deblurring in the
presence of impulse noise. Our extensive experiments demonstrate that
$\ell_0TV$-PADMM outperforms state-of-the-art image restoration methods.
| cs.NA eess.IV math.OC | total variation tv is an effective and popular prior model in the field of regularizationbased image processing this paper focuses on total variation for removing impulse noise in image restoration this type of noise frequently arises in data acquisition and transmission due to many reasons eg a faulty sensor or analogtodigital converter errors removing this noise is an important task in image restoration stateoftheart methods such as adaptive outlier pursuitaop citeyan2013restoration which is based on tv with ell_02norm data fidelity only give suboptimal performance in this paper we propose a new sparse optimization method called ell_0tvpadmm which solves the tvbased restoration problem with ell_0norm data fidelity to effectively deal with the resulting nonconvex nonsmooth optimization problem we first reformulate it as an equivalent biconvex mathematical program with equilibrium constraints mpec and then solve it using a proximal alternating direction method of multipliers padmm our ell_0tvpadmm method finds a desirable solution to the original ell_0norm optimization problem and is proven to be convergent under mild conditions we apply ell_0tvpadmm to the problems of image denoising and deblurring in the presence of impulse noise our extensive experiments demonstrate that ell_0tvpadmm outperforms stateoftheart image restoration methods | [['total', 'variation', 'tv', 'is', 'an', 'effective', 'and', 'popular', 'prior', 'model', 'in', 'the', 'field', 'of', 'regularizationbased', 'image', 'processing', 'this', 'paper', 'focuses', 'on', 'total', 'variation', 'for', 'removing', 'impulse', 'noise', 'in', 'image', 'restoration', 'this', 'type', 'of', 'noise', 'frequently', 'arises', 'in', 'data', 'acquisition', 'and', 'transmission', 'due', 'to', 'many', 'reasons', 'eg', 'a', 'faulty', 'sensor', 'or', 'analogtodigital', 'converter', 'errors', 'removing', 'this', 'noise', 'is', 'an', 'important', 'task', 'in', 'image', 'restoration', 'stateoftheart', 'methods', 'such', 'as', 'adaptive', 'outlier', 'pursuitaop', 'citeyan2013restoration', 'which', 'is', 'based', 'on', 'tv', 'with', 'ell_02norm', 'data', 'fidelity', 'only', 'give', 'suboptimal', 'performance', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'sparse', 'optimization', 'method', 'called', 'ell_0tvpadmm', 'which', 'solves', 'the', 'tvbased', 'restoration', 'problem', 'with', 'ell_0norm', 'data', 'fidelity', 'to', 'effectively', 'deal', 'with', 'the', 'resulting', 'nonconvex', 'nonsmooth', 'optimization', 'problem', 'we', 'first', 'reformulate', 'it', 'as', 'an', 'equivalent', 'biconvex', 'mathematical', 'program', 'with', 'equilibrium', 'constraints', 'mpec', 'and', 'then', 'solve', 'it', 'using', 'a', 'proximal', 'alternating', 'direction', 'method', 'of', 'multipliers', 'padmm', 'our', 'ell_0tvpadmm', 'method', 'finds', 'a', 'desirable', 'solution', 'to', 'the', 'original', 'ell_0norm', 'optimization', 'problem', 'and', 'is', 'proven', 'to', 'be', 'convergent', 'under', 'mild', 'conditions', 'we', 'apply', 'ell_0tvpadmm', 'to', 'the', 'problems', 'of', 'image', 'denoising', 'and', 'deblurring', 'in', 'the', 'presence', 'of', 'impulse', 'noise', 'our', 'extensive', 'experiments', 'demonstrate', 'that', 'ell_0tvpadmm', 'outperforms', 'stateoftheart', 'image', 'restoration', 'methods']] | [-0.07004943943435424, -0.07028758187424453, -0.08013061988167465, 0.05973089346171994, -0.09967467660746096, -0.17287007501642954, 0.013709306468617318, 0.43802409784280155, -0.3193737734844418, -0.3165578807998253, 0.17135203621766873, -0.23548955274010566, -0.20758045356058957, 0.1564754746563267, -0.22199345768527373, 0.12085708129268728, 0.1141514596676356, 0.015720082427938716, -0.12628162929077485, -0.27768706290149375, 0.25972088753417333, 0.04388179436424061, 0.3051822988071332, 0.017206057889913945, 0.16234652101687205, 0.030221982957109025, -0.021588709891013996, 0.011203861486558851, -0.024299480692723974, 0.1056598185947606, 0.31306981972394216, 0.18345201136544348, 0.32809118514537416, -0.40469470398598595, -0.21847963164879108, 0.12493507791506617, 0.12380463412226067, 0.09473666196909586, -0.09899285305659042, -0.28040755456313493, 0.0826015577430984, -0.10507367941992063, 0.005194474006757924, -0.12148197179562167, -0.06046419409900217, -0.017071819637509946, -0.3609817267199488, 0.1152610880345731, 0.06443028363987412, 0.01933532791996473, -0.07360564696136862, -0.1449994807964877, 0.0790638906317518, 0.053504658442627834, 0.07087455443045321, 0.07871166459946452, 0.13650912655223357, -0.13982794670829254, -0.1148138812926941, 0.38081362034733357, -0.041343005973919246, -0.24249651888385415, 0.15017904893029482, 0.021416558659831553, -0.15969276268182225, 0.16160136578898682, 0.20384406486256537, 0.15055443651899145, -0.18233271280646715, 0.052721482555467734, -0.03811678236938621, 0.18332800436397328, 0.06983058958093782, 0.007154245196694606, 0.08452909156974209, 0.21948569379961363, 0.17955220507574268, 0.1897230720283819, -0.1441962564731703, -0.03885617415469728, -0.22020359345601478, -0.0839217957819959, -0.1997543525857557, -0.02940666844737471, -0.060351532631121745, -0.16557805004872775, 0.38381699384435225, 0.23300512551305522, 0.1633967167746864, 0.049164171478907136, 0.4249409245915319, 0.11965957264121818, 0.039407696447750294, 0.07476611793696832, 0.15208612632521085, 0.09016523294665507, 0.11176223490681303, -0.2485882414161767, 0.02387174875567373, 0.07539587986631024] |
1,802.0988 | Dificuldades na aprendizagem de F\'isica sob a \'otica dos resultados do
Enem / Physics learning difficulties from the perspective of ENEM results | The results of the National High School Examination (ENEM) are an important
tool for a diagnosis of educational deficiencies at the end of a training
cycle. This exam is a relevant source of data for the evaluation of what is
learned by high school students. In this paper, thirteen selected questions are
presented, from the Natural Sciences exam in the period between 2009 and 2014,
questions that were classified as "physics questions", in which the
alternatives reveal well-delimited non-scientific conceptions described in the
literature. From the students' performance on these items, observations about
the learning process in physics in basic education are made. This study reveals
that there are some permanent difficulties in understanding basic concepts of
mechanics, thermal phenomena and geometric optics. Many of these questions
point to the presence and even predominant role of non-scientific conceptions
described in the research literature in physics teaching. Even knowing how
difficult it is to modify these conceptions, the results reveal that, despite
all the research effort in physics teaching since the 1980s, there was little
impact of the results in the learning process, and only a few changes
incorporating this knowlege in the didactic materials and in the teacher
training courses. (Paper in Portuguese.)
| physics.ed-ph | the results of the national high school examination enem are an important tool for a diagnosis of educational deficiencies at the end of a training cycle this exam is a relevant source of data for the evaluation of what is learned by high school students in this paper thirteen selected questions are presented from the natural sciences exam in the period between 2009 and 2014 questions that were classified as physics questions in which the alternatives reveal welldelimited nonscientific conceptions described in the literature from the students performance on these items observations about the learning process in physics in basic education are made this study reveals that there are some permanent difficulties in understanding basic concepts of mechanics thermal phenomena and geometric optics many of these questions point to the presence and even predominant role of nonscientific conceptions described in the research literature in physics teaching even knowing how difficult it is to modify these conceptions the results reveal that despite all the research effort in physics teaching since the 1980s there was little impact of the results in the learning process and only a few changes incorporating this knowlege in the didactic materials and in the teacher training courses paper in portuguese | [['the', 'results', 'of', 'the', 'national', 'high', 'school', 'examination', 'enem', 'are', 'an', 'important', 'tool', 'for', 'a', 'diagnosis', 'of', 'educational', 'deficiencies', 'at', 'the', 'end', 'of', 'a', 'training', 'cycle', 'this', 'exam', 'is', 'a', 'relevant', 'source', 'of', 'data', 'for', 'the', 'evaluation', 'of', 'what', 'is', 'learned', 'by', 'high', 'school', 'students', 'in', 'this', 'paper', 'thirteen', 'selected', 'questions', 'are', 'presented', 'from', 'the', 'natural', 'sciences', 'exam', 'in', 'the', 'period', 'between', '2009', 'and', '2014', 'questions', 'that', 'were', 'classified', 'as', 'physics', 'questions', 'in', 'which', 'the', 'alternatives', 'reveal', 'welldelimited', 'nonscientific', 'conceptions', 'described', 'in', 'the', 'literature', 'from', 'the', 'students', 'performance', 'on', 'these', 'items', 'observations', 'about', 'the', 'learning', 'process', 'in', 'physics', 'in', 'basic', 'education', 'are', 'made', 'this', 'study', 'reveals', 'that', 'there', 'are', 'some', 'permanent', 'difficulties', 'in', 'understanding', 'basic', 'concepts', 'of', 'mechanics', 'thermal', 'phenomena', 'and', 'geometric', 'optics', 'many', 'of', 'these', 'questions', 'point', 'to', 'the', 'presence', 'and', 'even', 'predominant', 'role', 'of', 'nonscientific', 'conceptions', 'described', 'in', 'the', 'research', 'literature', 'in', 'physics', 'teaching', 'even', 'knowing', 'how', 'difficult', 'it', 'is', 'to', 'modify', 'these', 'conceptions', 'the', 'results', 'reveal', 'that', 'despite', 'all', 'the', 'research', 'effort', 'in', 'physics', 'teaching', 'since', 'the', '1980s', 'there', 'was', 'little', 'impact', 'of', 'the', 'results', 'in', 'the', 'learning', 'process', 'and', 'only', 'a', 'few', 'changes', 'incorporating', 'this', 'knowlege', 'in', 'the', 'didactic', 'materials', 'and', 'in', 'the', 'teacher', 'training', 'courses', 'paper', 'in', 'portuguese']] | [-0.014698102497403501, 0.10910636742461281, -0.09234935079590592, 0.11136040525833427, -0.10865631477105071, -0.13323267815763704, 0.0397629455183771, 0.362389647245112, -0.23950017636900048, -0.3981587478872573, 0.1037745877989743, -0.2830513087285701, -0.1884669328735459, 0.22099491510837624, -0.14172523247658986, 0.0017008440670474331, 0.09999170081717616, 0.02349840997750548, -0.03643939990923731, -0.3286212409196259, 0.29871242688646044, 0.10562805943467682, 0.2904906561229341, 0.05663391322619051, 0.05742849435226181, -0.02025457678851441, -0.06696883713354536, -0.012969105488316405, -0.10796066761730178, 0.13032159509370247, 0.40591679480719833, 0.19775455188937485, 0.38988111230618516, -0.4108533609086777, -0.1789351896253774, 0.03012979339974204, 0.07196388935375184, 0.08397717283846175, -0.07054993170278959, -0.27466218534045583, 0.014561818343803913, -0.11808875839901387, -0.0949153499239779, -0.04094984367061037, 0.0017071544805928917, -0.020929481784610245, -0.16061177072207453, 0.01235150812189573, 0.09774379802886213, 0.1755856204741072, -0.04547275318233942, -0.1663887830345089, 0.0482778053737642, 0.1975191199349811, 0.10224995137702923, 0.005983332024499921, 0.117891566525905, -0.2147578746357029, -0.16083923737878109, 0.40239460023101603, 0.0337278899836981, -0.12383598940548404, 0.21287205091926573, -0.15164067658208458, -0.17953852401115, 0.06592651228374331, 0.198770506918375, 0.05751344769971796, -0.16769109455935455, 0.06234465113077094, -0.023107033464965402, 0.1345093451758171, 0.0646093139669277, -0.0005750714312538062, 0.22538107491471795, 0.18936777498001361, -0.05319544827792618, 0.07305947480386694, -0.0077063164450136, -0.11702736182424175, -0.29081881500430184, -0.16601149268456422, -0.15037248852618942, 0.01470223039165047, -0.0023599515992791926, -0.11935885182332874, 0.3920582002547505, 0.19965538152926923, 0.12987579133864124, -0.054809433374079036, 0.24377698654142937, 0.03267000198317, 0.03775295574313991, 0.06886912112142707, 0.25393278661586277, 0.07361233517375433, 0.1980062105582271, -0.14934531474540166, 0.10761861371580686, -0.0017394842767262703] |
1,802.09881 | Recent Belle results related to $\pi-K$ interactions | We report the recent results related to $\pi-K$ interactions based on the
data collected by the Belle experiment at the KEKB collider. This includes the
branching fraction and $CP$ asymmetry measurements of $B^+\to K^+K^-\pi^+$
decay, search for the $\Lambda_c^+\to\phi p\pi^0$, $\Lambda_c^+\to P_s^+\pi^0$
decays, branching fraction measurement of $\Lambda_c^+\to K^-\pi^+p\pi^0$,
first observation of doubly Cabibbo-suppressed decay $\Lambda_c^+\to
K^+\pi^-p$, and the measurement of CKM angle $\phi_3$ ($\gamma$) with a
model-independent Dalitz plot analysis of $B^{\pm}\to DK^{\pm},D\to
K_S^0\pi^+\pi^-$ decay.
| hep-ex | we report the recent results related to pik interactions based on the data collected by the belle experiment at the kekb collider this includes the branching fraction and cp asymmetry measurements of bto kkpi decay search for the lambda_ctophi ppi0 lambda_cto p_spi0 decays branching fraction measurement of lambda_cto kpippi0 first observation of doubly cabibbosuppressed decay lambda_cto kpip and the measurement of ckm angle phi_3 gamma with a modelindependent dalitz plot analysis of bpmto dkpmdto k_s0pipi decay | [['we', 'report', 'the', 'recent', 'results', 'related', 'to', 'pik', 'interactions', 'based', 'on', 'the', 'data', 'collected', 'by', 'the', 'belle', 'experiment', 'at', 'the', 'kekb', 'collider', 'this', 'includes', 'the', 'branching', 'fraction', 'and', 'cp', 'asymmetry', 'measurements', 'of', 'bto', 'kkpi', 'decay', 'search', 'for', 'the', 'lambda_ctophi', 'ppi0', 'lambda_cto', 'p_spi0', 'decays', 'branching', 'fraction', 'measurement', 'of', 'lambda_cto', 'kpippi0', 'first', 'observation', 'of', 'doubly', 'cabibbosuppressed', 'decay', 'lambda_cto', 'kpip', 'and', 'the', 'measurement', 'of', 'ckm', 'angle', 'phi_3', 'gamma', 'with', 'a', 'modelindependent', 'dalitz', 'plot', 'analysis', 'of', 'bpmto', 'dkpmdto', 'k_s0pipi', 'decay']] | [-0.10506575523512056, 0.25238080059292994, -0.0860231895843355, 0.05572174169116794, -0.09745165013248892, -0.15421104272317193, 0.1691335478418009, 0.20022319617030554, -0.16453518765047193, -0.20196647959927175, -0.029152767538182335, -0.46982534289079375, 0.04945212150987697, 0.16393268549470358, 0.17588051102341037, 0.195126316420836, 0.18049929094539113, -0.07014096814067397, -0.039502006020932776, -0.12752370940751, 0.17670085685397818, 0.05142743198188302, 0.2224039951505216, 0.09681663632852165, -0.08438291947185125, 0.034853966479279, -0.16278312446498502, -0.1433767528617627, -0.22684214842084743, 0.02941372184312507, 0.19022761657834053, 0.19815510516979873, 0.005265014488505174, -0.2561984902235029, 0.10649651891156418, 0.22479952519682989, 0.1834141655939899, 0.016244590563112744, -0.06646809351553962, -0.5104346430464967, 0.07578285902177226, -0.15386594966219816, -0.0015372051602254991, -0.08541814075808411, 0.06832277647232356, -0.12952127012947243, -0.398988281363902, 0.1607003747804524, -0.1534658176696872, 0.060493598867539466, 0.06342238189703593, -0.30914096932296886, 0.06588501508079775, -0.051567843336969205, 0.14420494321121335, 0.0575518445366968, 0.20845877295615126, -0.046155431419483396, -0.23277383255580925, 0.3384383812623277, -0.10238782181950726, -0.09962296129000207, 0.011020087601923167, -0.32094130581499986, -0.22266639678496614, 0.1943871803065022, 0.29175822556733266, 0.033883604846180304, -0.20168545426265017, 0.1142786030246149, -0.03221298938885025, 0.18305069657221232, 0.08414337704953266, 0.05679721591917619, 0.09540146492080355, 0.2473186530325919, -0.053630143620890296, 0.036411106449309484, -0.14339383756295357, -0.006994570005838185, -0.4595643795822581, -0.1351460560794269, -0.014342642893172698, 0.10091707461405137, -0.0009774523528056755, -0.04851605335556685, 0.3571223330314029, -0.046037190772388895, 0.3542081579081204, 0.06385338186184326, 0.33361773722333044, 0.05011661543450255, 0.007017944376893367, -0.019261697775481767, 0.3739696405190107, 0.23438349001632672, 0.16693326035093464, -0.37421273766723395, 0.1410212676082291, -0.008574202242115997] |
1,802.09882 | Electron and hole contributions to normal-state transport in the
superconducting system Sn$_{1-x}$In$_x$Te | Indium-doped SnTe has been of interest because the system can exhibit both
topological surface states and bulk superconductivity. While the enhancement of
the superconducting transition temperature is established, the character of the
electronic states induced by indium doping remains poorly understood. We report
a study of magneto-transport in a series of Sn$_{1-x}$In$_x$Te single crystals
with $0.1\le x \le 0.45$. From measurements of the Hall effect, we find that
the dominant carrier type changes from hole-like to electron-like at
$x\sim0.25$; one would expect electron-like carriers if the In ions have a
valence of $+3$. For single crystals with $x = 0.45$, corresponding to the
highest superconducting transition temperature, pronounced Shubnikov-de Haas
oscillations are observed in the normal state. In measurements of
magnetoresistance, we find evidence for weak anti-localization (WAL). We
attribute both the quantum oscillations and the WAL to bulk Dirac-like hole
pockets, previously observed in photoemission studies, which coexist with the
dominant electron-like carriers.
| cond-mat.supr-con | indiumdoped snte has been of interest because the system can exhibit both topological surface states and bulk superconductivity while the enhancement of the superconducting transition temperature is established the character of the electronic states induced by indium doping remains poorly understood we report a study of magnetotransport in a series of sn_1xin_xte single crystals with 01le x le 045 from measurements of the hall effect we find that the dominant carrier type changes from holelike to electronlike at xsim025 one would expect electronlike carriers if the in ions have a valence of 3 for single crystals with x 045 corresponding to the highest superconducting transition temperature pronounced shubnikovde haas oscillations are observed in the normal state in measurements of magnetoresistance we find evidence for weak antilocalization wal we attribute both the quantum oscillations and the wal to bulk diraclike hole pockets previously observed in photoemission studies which coexist with the dominant electronlike carriers | [['indiumdoped', 'snte', 'has', 'been', 'of', 'interest', 'because', 'the', 'system', 'can', 'exhibit', 'both', 'topological', 'surface', 'states', 'and', 'bulk', 'superconductivity', 'while', 'the', 'enhancement', 'of', 'the', 'superconducting', 'transition', 'temperature', 'is', 'established', 'the', 'character', 'of', 'the', 'electronic', 'states', 'induced', 'by', 'indium', 'doping', 'remains', 'poorly', 'understood', 'we', 'report', 'a', 'study', 'of', 'magnetotransport', 'in', 'a', 'series', 'of', 'sn_1xin_xte', 'single', 'crystals', 'with', '01le', 'x', 'le', '045', 'from', 'measurements', 'of', 'the', 'hall', 'effect', 'we', 'find', 'that', 'the', 'dominant', 'carrier', 'type', 'changes', 'from', 'holelike', 'to', 'electronlike', 'at', 'xsim025', 'one', 'would', 'expect', 'electronlike', 'carriers', 'if', 'the', 'in', 'ions', 'have', 'a', 'valence', 'of', '3', 'for', 'single', 'crystals', 'with', 'x', '045', 'corresponding', 'to', 'the', 'highest', 'superconducting', 'transition', 'temperature', 'pronounced', 'shubnikovde', 'haas', 'oscillations', 'are', 'observed', 'in', 'the', 'normal', 'state', 'in', 'measurements', 'of', 'magnetoresistance', 'we', 'find', 'evidence', 'for', 'weak', 'antilocalization', 'wal', 'we', 'attribute', 'both', 'the', 'quantum', 'oscillations', 'and', 'the', 'wal', 'to', 'bulk', 'diraclike', 'hole', 'pockets', 'previously', 'observed', 'in', 'photoemission', 'studies', 'which', 'coexist', 'with', 'the', 'dominant', 'electronlike', 'carriers']] | [-0.19414453783783278, 0.25543563563214294, -0.043060350152173715, 0.03211486528973757, -0.006735124582375743, -0.1841543845397322, 0.12558399699934708, 0.3338209236972034, -0.23343413044379926, -0.3011239228929442, -0.05007277012536131, -0.4099010390866744, -0.11080567649332806, 0.19536036584108124, 0.008642609972172833, 0.0019048839396993188, -0.03376145711425986, -0.05089549218016481, -0.15980200426221067, -0.18750495836138725, 0.3124683037259322, 0.0012615427419261419, 0.3457218331290948, 0.09856826472662904, 0.03279035572976634, -0.0435587946726867, 0.1357885481587513, 0.041101395910740586, -0.1473888960842822, -0.018595548291063767, 0.31706901649503333, -0.16761644655918262, 0.1770644071603831, -0.4068828016844284, -0.2275301437751439, -0.009014528526581432, 0.14549952550595135, 0.14118984578817617, -0.10923223698965127, -0.2927589060150479, 0.0733136554849089, -0.10976868685285904, -0.07584689605650247, -0.06772739786385118, -0.016707099582019606, -0.08846430036493602, -0.19185087921735094, 0.18979686325550765, 0.04850817883025708, 0.07704827839533161, -0.11851969192809376, -0.14899352671024021, -0.11680974631149423, 0.045984752203558424, 0.07710530702484232, 0.029744275978852163, 0.1572692704478533, -0.08767104869873851, -0.13525372605439961, 0.3098620044919172, -0.08517460500374191, -0.027012389251276067, 0.1615201269711466, -0.31035760882935537, -0.08804075480254955, 0.21028204337620227, 0.08820223786307524, 0.0781155880969508, -0.09978195415858768, 0.08895473119321794, -0.039143476359497165, 0.18369806471194974, 0.05631210875856739, 0.13788456564438284, 0.2944969278576441, 0.18477526947696643, 0.007283719945438574, 0.08081355211508803, -0.19752052877907103, 0.05804189619926834, -0.2010294442849332, -0.18455241024677985, -0.21049873379831152, 0.12983267211146945, -0.012745239793156017, -0.22248436181536435, 0.39745638286082174, 0.11371737548554513, 0.216550726437402, -0.0876698157004093, 0.17948847194891546, 0.09901421380958422, 0.06987541437602456, 0.04212745735237963, 0.2761874590559225, 0.15335400960879939, 0.12942311854107844, -0.30343632190794634, 0.11673076149676681, -0.02463266800623387] |
1,802.09883 | Reproducible Floating-Point Aggregation in RDBMSs | Industry-grade database systems are expected to produce the same result if
the same query is repeatedly run on the same input. However, the numerous
sources of non-determinism in modern systems make reproducible results
difficult to achieve. This is particularly true if floating-point numbers are
involved, where the order of the operations affects the final result.
As part of a larger effort to extend database engines with data
representations more suitable for machine learning and scientific applications,
in this paper we explore the problem of making relational GroupBy over
floating-point formats bit-reproducible, i.e., ensuring any execution of the
operator produces the same result up to every single bit. To that aim, we first
propose a numeric data type that can be used as drop-in replacement for other
number formats and is---unlike standard floating-point formats---associative.
We use this data type to make state-of-the-art GroupBy operators reproducible,
but this approach incurs a slowdown between 4x and 12x compared to the same
operator using conventional database number formats. We thus explore how to
modify existing GroupBy algorithms to make them bit-reproducible and efficient.
By using vectorized summation on batches and carefully balancing batch size,
cache footprint, and preprocessing costs, we are able to reduce the slowdown
due to reproducibility to a factor between 1.9x and 2.4x of aggregation in
isolation and to a mere 2.7% of end-to-end query performance even on
aggregation-intensive queries in MonetDB. We thereby provide a solid basis for
supporting more reproducible operations directly in relational engines.
This document is an extended version of an article currently in print for the
proceedings of ICDE'18 with the same title and by the same authors. The main
additions are more implementation details and experiments.
| cs.DB | industrygrade database systems are expected to produce the same result if the same query is repeatedly run on the same input however the numerous sources of nondeterminism in modern systems make reproducible results difficult to achieve this is particularly true if floatingpoint numbers are involved where the order of the operations affects the final result as part of a larger effort to extend database engines with data representations more suitable for machine learning and scientific applications in this paper we explore the problem of making relational groupby over floatingpoint formats bitreproducible ie ensuring any execution of the operator produces the same result up to every single bit to that aim we first propose a numeric data type that can be used as dropin replacement for other number formats and isunlike standard floatingpoint formatsassociative we use this data type to make stateoftheart groupby operators reproducible but this approach incurs a slowdown between 4x and 12x compared to the same operator using conventional database number formats we thus explore how to modify existing groupby algorithms to make them bitreproducible and efficient by using vectorized summation on batches and carefully balancing batch size cache footprint and preprocessing costs we are able to reduce the slowdown due to reproducibility to a factor between 19x and 24x of aggregation in isolation and to a mere 27 of endtoend query performance even on aggregationintensive queries in monetdb we thereby provide a solid basis for supporting more reproducible operations directly in relational engines this document is an extended version of an article currently in print for the proceedings of icde18 with the same title and by the same authors the main additions are more implementation details and experiments | [['industrygrade', 'database', 'systems', 'are', 'expected', 'to', 'produce', 'the', 'same', 'result', 'if', 'the', 'same', 'query', 'is', 'repeatedly', 'run', 'on', 'the', 'same', 'input', 'however', 'the', 'numerous', 'sources', 'of', 'nondeterminism', 'in', 'modern', 'systems', 'make', 'reproducible', 'results', 'difficult', 'to', 'achieve', 'this', 'is', 'particularly', 'true', 'if', 'floatingpoint', 'numbers', 'are', 'involved', 'where', 'the', 'order', 'of', 'the', 'operations', 'affects', 'the', 'final', 'result', 'as', 'part', 'of', 'a', 'larger', 'effort', 'to', 'extend', 'database', 'engines', 'with', 'data', 'representations', 'more', 'suitable', 'for', 'machine', 'learning', 'and', 'scientific', 'applications', 'in', 'this', 'paper', 'we', 'explore', 'the', 'problem', 'of', 'making', 'relational', 'groupby', 'over', 'floatingpoint', 'formats', 'bitreproducible', 'ie', 'ensuring', 'any', 'execution', 'of', 'the', 'operator', 'produces', 'the', 'same', 'result', 'up', 'to', 'every', 'single', 'bit', 'to', 'that', 'aim', 'we', 'first', 'propose', 'a', 'numeric', 'data', 'type', 'that', 'can', 'be', 'used', 'as', 'dropin', 'replacement', 'for', 'other', 'number', 'formats', 'and', 'isunlike', 'standard', 'floatingpoint', 'formatsassociative', 'we', 'use', 'this', 'data', 'type', 'to', 'make', 'stateoftheart', 'groupby', 'operators', 'reproducible', 'but', 'this', 'approach', 'incurs', 'a', 'slowdown', 'between', '4x', 'and', '12x', 'compared', 'to', 'the', 'same', 'operator', 'using', 'conventional', 'database', 'number', 'formats', 'we', 'thus', 'explore', 'how', 'to', 'modify', 'existing', 'groupby', 'algorithms', 'to', 'make', 'them', 'bitreproducible', 'and', 'efficient', 'by', 'using', 'vectorized', 'summation', 'on', 'batches', 'and', 'carefully', 'balancing', 'batch', 'size', 'cache', 'footprint', 'and', 'preprocessing', 'costs', 'we', 'are', 'able', 'to', 'reduce', 'the', 'slowdown', 'due', 'to', 'reproducibility', 'to', 'a', 'factor', 'between', '19x', 'and', '24x', 'of', 'aggregation', 'in', 'isolation', 'and', 'to', 'a', 'mere', '27', 'of', 'endtoend', 'query', 'performance', 'even', 'on', 'aggregationintensive', 'queries', 'in', 'monetdb', 'we', 'thereby', 'provide', 'a', 'solid', 'basis', 'for', 'supporting', 'more', 'reproducible', 'operations', 'directly', 'in', 'relational', 'engines', 'this', 'document', 'is', 'an', 'extended', 'version', 'of', 'an', 'article', 'currently', 'in', 'print', 'for', 'the', 'proceedings', 'of', 'icde18', 'with', 'the', 'same', 'title', 'and', 'by', 'the', 'same', 'authors', 'the', 'main', 'additions', 'are', 'more', 'implementation', 'details', 'and', 'experiments']] | [-0.08142665348058059, 0.031212621051500637, -0.045073445058343084, 0.07093303080097857, -0.10296519539826973, -0.13243422328642654, 0.09958549195223233, 0.4021363602985035, -0.28404530819844115, -0.3577999654039741, 0.11075790881179273, -0.2633835223266347, -0.09651472578333183, 0.23607835525138812, -0.13141429635569116, 0.0693884235535833, 0.10925051840542106, 0.02642353794251738, -0.07851782574317026, -0.3236504964801398, 0.2744718016327401, 0.08207856799983843, 0.27299510141495953, 0.010835947515866296, 0.04215942299109884, 0.006908742612735792, -0.054284513542767275, -0.01025437535548752, -0.050969861762397074, 0.149235918155702, 0.2977740233433856, 0.18912499530410223, 0.28940705491145224, -0.46013946906525893, -0.11756377683867784, 0.09201290102929555, 0.12851038271730597, 0.11213845269415866, -0.018848416501687924, -0.23376655016687106, 0.13496555426412007, -0.19085949733938007, -0.036066223584877495, -0.1297325641475618, 0.01941669925327667, 0.012594785014129726, -0.2708099094608968, 0.0004902923098680648, 0.07009091690648347, 0.04547713265838948, -0.010131804759360173, -0.10781175650889054, 0.04385567079975524, 0.13747960688503968, 0.007796300691129132, 0.05286268725737252, 0.12277065199863335, -0.12696813018145886, -0.1660729571675289, 0.41760940506715666, -0.03749063442757523, -0.18446638290516354, 0.1919281875020401, -0.07449957434257323, -0.14184729426802897, 0.09281337193213403, 0.19054812279275873, 0.08453471821986816, -0.14834126865237274, 0.03957059092438695, 0.006796060138466683, 0.2332237484394996, 0.08784405983497642, 0.04329377312551845, 0.12697034493342718, 0.18976025018798695, 0.05696834855395454, 0.15501690968003293, -0.03378930626701648, -0.07321251201274043, -0.249608785120601, -0.1792749946416271, -0.1587082606799562, -0.0036844748950732704, -0.08064926462110386, -0.1653370325834575, 0.35548888954672625, 0.2215712194398723, 0.18312659220791166, 0.09848831152882088, 0.3548327319544147, 0.048401599297172984, 0.1422253690558401, 0.12012364537031812, 0.14458299167708238, 0.021654435983774336, 0.1529186880414967, -0.13604947185397825, 0.09538878085769036, 0.030252636196726763] |
1,802.09884 | Live Blog Corpus for Summarization | Live blogs are an increasingly popular news format to cover breaking news and
live events in online journalism. Online news websites around the world are
using this medium to give their readers a minute by minute update on an event.
Good summaries enhance the value of the live blogs for a reader but are often
not available. In this paper, we study a way of collecting corpora for
automatic live blog summarization. In an empirical evaluation using well-known
state-of-the-art summarization systems, we show that live blogs corpus poses
new challenges in the field of summarization. We make our tools publicly
available to reconstruct the corpus to encourage the research community and
replicate our results.
| cs.CL | live blogs are an increasingly popular news format to cover breaking news and live events in online journalism online news websites around the world are using this medium to give their readers a minute by minute update on an event good summaries enhance the value of the live blogs for a reader but are often not available in this paper we study a way of collecting corpora for automatic live blog summarization in an empirical evaluation using wellknown stateoftheart summarization systems we show that live blogs corpus poses new challenges in the field of summarization we make our tools publicly available to reconstruct the corpus to encourage the research community and replicate our results | [['live', 'blogs', 'are', 'an', 'increasingly', 'popular', 'news', 'format', 'to', 'cover', 'breaking', 'news', 'and', 'live', 'events', 'in', 'online', 'journalism', 'online', 'news', 'websites', 'around', 'the', 'world', 'are', 'using', 'this', 'medium', 'to', 'give', 'their', 'readers', 'a', 'minute', 'by', 'minute', 'update', 'on', 'an', 'event', 'good', 'summaries', 'enhance', 'the', 'value', 'of', 'the', 'live', 'blogs', 'for', 'a', 'reader', 'but', 'are', 'often', 'not', 'available', 'in', 'this', 'paper', 'we', 'study', 'a', 'way', 'of', 'collecting', 'corpora', 'for', 'automatic', 'live', 'blog', 'summarization', 'in', 'an', 'empirical', 'evaluation', 'using', 'wellknown', 'stateoftheart', 'summarization', 'systems', 'we', 'show', 'that', 'live', 'blogs', 'corpus', 'poses', 'new', 'challenges', 'in', 'the', 'field', 'of', 'summarization', 'we', 'make', 'our', 'tools', 'publicly', 'available', 'to', 'reconstruct', 'the', 'corpus', 'to', 'encourage', 'the', 'research', 'community', 'and', 'replicate', 'our', 'results']] | [-0.07356814872228394, 0.02025402737962666, -0.05342256320280987, 0.11881240536846842, -0.20971486186853758, -0.09380413265490349, 0.05433548475603426, 0.4772222778645524, -0.2162383185585209, -0.34141131103234856, 0.10235854426170127, -0.42729303778328914, -0.13704203082281247, 0.23487941332553564, -0.11830256452881976, -0.022187994196684213, 0.16725689776470526, 0.09654316348187103, 0.013577202586212048, -0.3861781601761386, 0.2569841758823921, 0.059828061512426325, 0.353203116948798, 0.04691996283241009, 0.04648528119810579, -0.022875792465352436, -0.15741700038881645, -0.060965603871042266, -0.10138276933209629, 0.18106330117504849, 0.4064439147049071, 0.27193907244343374, 0.3484427977287978, -0.41062122394673917, -0.14204864305538012, 0.05114927159197498, 0.15398020791543418, 0.1366781710568926, -0.08746827793360704, -0.38224302429967283, 0.0816758870629169, -0.21325790040652481, -0.014155765505213486, -0.13890211699783736, 0.03528083491715064, 0.0025180332799719877, -0.20893014468693813, 0.036215908998999284, -0.021937399269326738, 0.13293656775433765, 0.01121488884663242, -0.07929962800750345, 0.05884780458546358, 0.20085621030445686, 0.11630907091883975, 0.05634633161478855, 0.170508706758387, -0.16740084925805332, -0.15919405119003435, 0.40115914657189133, -0.05624760175123811, -0.15063858905545713, 0.1576706783707139, 0.0028772617714773667, -0.1757597875119628, 0.07440427595774006, 0.30494851026716724, 0.0920197665037816, -0.21322344840716637, -0.03370837060624341, -0.08756055513176282, 0.2468899557726425, 0.0738726063435407, -0.035390246340906935, 0.2095996274596505, 0.24858513637854343, -0.012526457181625199, 0.07660006669047698, -0.005857279317927335, -0.04165132558626825, -0.21831511393528463, -0.13035214419493027, -0.15021429140235118, 0.0012938900619159093, -0.06694924619366423, -0.19782964925980195, 0.3671313901105079, 0.27835139521936836, 0.13831912418990805, 0.04884591449374791, 0.30913787959715383, -0.08253712988542311, 0.08416619379555382, 0.11600087437852237, 0.13116234446173175, -0.1027203302793695, 0.27641192690179306, -0.0525319498979993, 0.050582085339875335, -0.009180734973613238] |
1,802.09885 | The Determinant of an Elliptic Sylvesteresque Matrix | We evaluate the determinant of a matrix whose entries are elliptic
hypergeometric terms and whose form is reminiscent of Sylvester matrices. A
hypergeometric determinant evaluation of a matrix of this type has appeared in
the context of approximation theory, in the work of Feng, Krattenthaler and Xu.
Our determinant evaluation is an elliptic extension of their evaluation, which
has two additional parameters (in addition to the base $q$ and nome $p$ found
in elliptic hypergeometric terms). We also extend the evaluation to a formula
transforming an elliptic determinant into a multiple of another elliptic
determinant. This transformation has two further parameters. The proofs of the
determinant evaluation and the transformation formula require an elliptic
determinant lemma due to Warnaar, and the application of two $C_n$ elliptic
formulas that extend Frenkel and Turaev's $_{10}V_9$ summation formula and
$_{12}V_{11}$ transformation formula, results due to Warnaar, Rosengren, Rains,
and Coskun and Gustafson.
| math.CA | we evaluate the determinant of a matrix whose entries are elliptic hypergeometric terms and whose form is reminiscent of sylvester matrices a hypergeometric determinant evaluation of a matrix of this type has appeared in the context of approximation theory in the work of feng krattenthaler and xu our determinant evaluation is an elliptic extension of their evaluation which has two additional parameters in addition to the base q and nome p found in elliptic hypergeometric terms we also extend the evaluation to a formula transforming an elliptic determinant into a multiple of another elliptic determinant this transformation has two further parameters the proofs of the determinant evaluation and the transformation formula require an elliptic determinant lemma due to warnaar and the application of two c_n elliptic formulas that extend frenkel and turaevs _10v_9 summation formula and _12v_11 transformation formula results due to warnaar rosengren rains and coskun and gustafson | [['we', 'evaluate', 'the', 'determinant', 'of', 'a', 'matrix', 'whose', 'entries', 'are', 'elliptic', 'hypergeometric', 'terms', 'and', 'whose', 'form', 'is', 'reminiscent', 'of', 'sylvester', 'matrices', 'a', 'hypergeometric', 'determinant', 'evaluation', 'of', 'a', 'matrix', 'of', 'this', 'type', 'has', 'appeared', 'in', 'the', 'context', 'of', 'approximation', 'theory', 'in', 'the', 'work', 'of', 'feng', 'krattenthaler', 'and', 'xu', 'our', 'determinant', 'evaluation', 'is', 'an', 'elliptic', 'extension', 'of', 'their', 'evaluation', 'which', 'has', 'two', 'additional', 'parameters', 'in', 'addition', 'to', 'the', 'base', 'q', 'and', 'nome', 'p', 'found', 'in', 'elliptic', 'hypergeometric', 'terms', 'we', 'also', 'extend', 'the', 'evaluation', 'to', 'a', 'formula', 'transforming', 'an', 'elliptic', 'determinant', 'into', 'a', 'multiple', 'of', 'another', 'elliptic', 'determinant', 'this', 'transformation', 'has', 'two', 'further', 'parameters', 'the', 'proofs', 'of', 'the', 'determinant', 'evaluation', 'and', 'the', 'transformation', 'formula', 'require', 'an', 'elliptic', 'determinant', 'lemma', 'due', 'to', 'warnaar', 'and', 'the', 'application', 'of', 'two', 'c_n', 'elliptic', 'formulas', 'that', 'extend', 'frenkel', 'and', 'turaevs', '_10v_9', 'summation', 'formula', 'and', '_12v_11', 'transformation', 'formula', 'results', 'due', 'to', 'warnaar', 'rosengren', 'rains', 'and', 'coskun', 'and', 'gustafson']] | [-0.16013521759737773, 0.011521003205416491, -0.11324162828433956, 0.056617109300065284, -0.10247911644998837, -0.1262813026582621, 0.012875119611979588, 0.2761362362637285, -0.23985176162819402, -0.2672233686348222, 0.09913676654655687, -0.29447464732220396, -0.2205275380480531, 0.21892704729406112, -0.09815121988395804, 0.06263228394468692, 0.046927299613221174, 0.045392845741573824, -0.1814053209948454, -0.27371754633841683, 0.3339093427733845, -0.0329124444743266, 0.19885220805283738, 0.11189664644189179, 0.06831983446042884, 0.04838826879544335, -0.06824240594082889, -0.10351993199563711, -0.10160089937233203, 0.16433633791402336, 0.2704288169326311, 0.06825857473587668, 0.2130677727101421, -0.34852310416691407, -0.1116576767526567, 0.14104508795473422, 0.16675877897383495, 0.027184048002881527, 0.0007312920045208286, -0.23986382614443633, 0.04069647924798365, -0.22695381918645188, -0.17744993207649, -0.0893395937006996, 0.04494927153054222, 0.04147388754299263, -0.31601737001659097, 0.03282673616512192, 0.11954255246657979, 0.07743770028842059, -0.015123209046086649, -0.19335396818791492, 0.035533677504989446, 0.05186597170383745, 0.06367267079877893, 0.03686200430289515, 0.0404174699089364, -0.09826285514237817, -0.11072156563514492, 0.314145891335667, -0.04221220733283239, -0.22877482378326758, 0.047647939148560366, -0.06824090214905555, -0.13680676026961994, 0.13033317743857215, 0.11235031668361076, 0.15008951325246409, -0.11586207511985826, 0.12559924644026338, -0.11725231867938025, 0.09104475262889487, 0.15859271109897038, -0.05546011432464159, 0.06256701044952245, -0.0008277638840514261, -0.030397093395476003, 0.16931584879686754, 0.03397789966579325, -0.12037471630232963, -0.3168021361945304, -0.2518309669669818, -0.17466063881963506, 0.11434900777326343, -0.12534646675015432, -0.2019995536176941, 0.4069534147841025, 0.08204267909309852, 0.18948297286280305, 0.08688621106006936, 0.21165443430072628, 0.19643305602182187, 0.07103396473118935, 0.009123987533982742, 0.1031394720115271, 0.24873341613675695, 0.09176045833265635, -0.2028150293988654, 0.031228903259427565, 0.25185215720793586] |
1,802.09886 | Complete two-loop QCD contributions to the lightest Higgs-boson mass in
the MSSM with complex parameters | Higher-order corrections to the MSSM Higgs-boson masses are desirable for
accurate predictions currently testable at the LHC. By comparing the prediction
with the measured value of the discovered Higgs signal, viable parameter
regions can be inferred. For an improved theory accuracy, we compute all
two-loop corrections involving the strong coupling for the Higgs-boson mass
spectrum of the MSSM with complex parameters. Apart from the dependence on the
strong coupling, these contributions depend on the weak coupling and Yukawa
couplings, leading to terms of $\mathcal{O}{\left(\alpha\alpha_s\right)}$ and
$\mathcal{O}{\left(\sqrt{\alpha_{q_1}}\sqrt{\alpha_{q_2}}\alpha_s\right)}$,
($q_{1,2}=t,b,c,s,u,d$). The full dependence on the external momentum and all
relevant mass scales is taken into account. The calculation is performed in the
Feynman-diagrammatic approach which is flexible in the choice of the employed
renormalization scheme. For the phenomenological results presented here, a
renormalization scheme consistent with higher-order corrections included in the
code $\texttt{FeynHiggs}$ is adopted. For the evaluation of the results, a
total of $513$ two-loop two-point integrals with up to five different mass
scales are computed fully numerically using the program $\texttt{SecDec}$. A
comparison with existing results in the limit of real parameters and/or
vanishing external momentum is carried out, and the impact on the lightest
Higgs-boson mass is discussed, including the dependence on complex phases. The
new results will be included in the public code $\texttt{FeynHiggs}$.
| hep-ph | higherorder corrections to the mssm higgsboson masses are desirable for accurate predictions currently testable at the lhc by comparing the prediction with the measured value of the discovered higgs signal viable parameter regions can be inferred for an improved theory accuracy we compute all twoloop corrections involving the strong coupling for the higgsboson mass spectrum of the mssm with complex parameters apart from the dependence on the strong coupling these contributions depend on the weak coupling and yukawa couplings leading to terms of mathcaloleftalphaalpha_sright and mathcaloleftsqrtalpha_q_1sqrtalpha_q_2alpha_sright q_12tbcsud the full dependence on the external momentum and all relevant mass scales is taken into account the calculation is performed in the feynmandiagrammatic approach which is flexible in the choice of the employed renormalization scheme for the phenomenological results presented here a renormalization scheme consistent with higherorder corrections included in the code textttfeynhiggs is adopted for the evaluation of the results a total of 513 twoloop twopoint integrals with up to five different mass scales are computed fully numerically using the program textttsecdec a comparison with existing results in the limit of real parameters andor vanishing external momentum is carried out and the impact on the lightest higgsboson mass is discussed including the dependence on complex phases the new results will be included in the public code textttfeynhiggs | [['higherorder', 'corrections', 'to', 'the', 'mssm', 'higgsboson', 'masses', 'are', 'desirable', 'for', 'accurate', 'predictions', 'currently', 'testable', 'at', 'the', 'lhc', 'by', 'comparing', 'the', 'prediction', 'with', 'the', 'measured', 'value', 'of', 'the', 'discovered', 'higgs', 'signal', 'viable', 'parameter', 'regions', 'can', 'be', 'inferred', 'for', 'an', 'improved', 'theory', 'accuracy', 'we', 'compute', 'all', 'twoloop', 'corrections', 'involving', 'the', 'strong', 'coupling', 'for', 'the', 'higgsboson', 'mass', 'spectrum', 'of', 'the', 'mssm', 'with', 'complex', 'parameters', 'apart', 'from', 'the', 'dependence', 'on', 'the', 'strong', 'coupling', 'these', 'contributions', 'depend', 'on', 'the', 'weak', 'coupling', 'and', 'yukawa', 'couplings', 'leading', 'to', 'terms', 'of', 'mathcaloleftalphaalpha_sright', 'and', 'mathcaloleftsqrtalpha_q_1sqrtalpha_q_2alpha_sright', 'q_12tbcsud', 'the', 'full', 'dependence', 'on', 'the', 'external', 'momentum', 'and', 'all', 'relevant', 'mass', 'scales', 'is', 'taken', 'into', 'account', 'the', 'calculation', 'is', 'performed', 'in', 'the', 'feynmandiagrammatic', 'approach', 'which', 'is', 'flexible', 'in', 'the', 'choice', 'of', 'the', 'employed', 'renormalization', 'scheme', 'for', 'the', 'phenomenological', 'results', 'presented', 'here', 'a', 'renormalization', 'scheme', 'consistent', 'with', 'higherorder', 'corrections', 'included', 'in', 'the', 'code', 'textttfeynhiggs', 'is', 'adopted', 'for', 'the', 'evaluation', 'of', 'the', 'results', 'a', 'total', 'of', '513', 'twoloop', 'twopoint', 'integrals', 'with', 'up', 'to', 'five', 'different', 'mass', 'scales', 'are', 'computed', 'fully', 'numerically', 'using', 'the', 'program', 'textttsecdec', 'a', 'comparison', 'with', 'existing', 'results', 'in', 'the', 'limit', 'of', 'real', 'parameters', 'andor', 'vanishing', 'external', 'momentum', 'is', 'carried', 'out', 'and', 'the', 'impact', 'on', 'the', 'lightest', 'higgsboson', 'mass', 'is', 'discussed', 'including', 'the', 'dependence', 'on', 'complex', 'phases', 'the', 'new', 'results', 'will', 'be', 'included', 'in', 'the', 'public', 'code', 'textttfeynhiggs']] | [-0.10880051609150679, 0.13194397828418966, -0.05193599588611111, 0.12453616475840187, -0.06221239233964984, -0.10478529970398841, 0.01878025853305721, 0.3329257344583243, -0.18067064606540678, -0.3108444169717226, 0.06682720784051784, -0.27534334938797467, -0.04311446833450629, 0.22900533057169392, 0.06275174995875513, 0.0765060979459997, 0.07375046659265382, 0.00393525967791782, -0.08745678624946554, -0.2509221803459541, 0.32764423082314675, 0.07676243629605281, 0.220810043120335, 0.13323807194477544, 0.0716832895216286, -0.0006015419359824111, -0.0886476641819584, -0.003974992777484487, -0.146697277807244, 0.07621865866695891, 0.1856709916423567, 0.03270593035377492, 0.17525302707481216, -0.3507611442111292, -0.15986647144979182, 0.05916435780276309, 0.1267855101800963, 0.11655035693547688, -0.03236038936356979, -0.2875705156079933, 0.07109180943796604, -0.20522996580408323, -0.11663415000328074, -0.11483174713080274, -0.03570886893760202, -0.04577276010048699, -0.3333834773193131, 0.08425836449402235, -0.0702888506161541, 0.019118945370208612, -0.03386078172424843, -0.17126160005836766, -0.07590006800139991, 0.14033428227467426, 0.10990080669003907, 0.023328333005818696, 0.13754204281041277, -0.15188414157139804, -0.10382720347129265, 0.4139171132377463, -0.09740512797945039, -0.20265360489704004, 0.1506519876958644, -0.13880898331558025, -0.14754732904235288, 0.1449160599896579, 0.17858940451120395, 0.11854457313550157, -0.1534460976561707, 0.13817736201366093, 0.017045764604260494, 0.17331514806587706, 0.00974691386624538, 0.04986863630771075, 0.19225940041085882, 0.1574647205454552, -0.019519423702973344, 0.07506514820193362, -0.07347210865568826, -0.12407796112996228, -0.3763310010764607, -0.07352498267882422, -0.11457529520936627, -0.0016035994071126828, -0.13234867569567627, -0.11462726490572095, 0.41054035943969486, 0.1789961998336641, 0.20626584074530258, 0.060662601946497266, 0.32833467275431416, 0.13895040649573653, 0.13894928433989473, 0.03282061677188876, 0.3207376780656149, 0.12449532066458696, 0.059830555378213385, -0.26981327012247175, 0.04155509149708416, 0.06339772975507174] |
1,802.09887 | Phylogeny of the Milky Way's inner disk and bulge populations:
Implications for gas accretion, (the lack of) inside-out thick disk
formation, and quenching | We show that the bulge and the disk of the Milky Way (MW) at R$\lesssim$7~kpc
are well described by a unique chemical evolution and a two-phase
star-formation history (SFH). We argue that the populations within this inner
disk, not the entire disk, are the same, and that the outer Lindblad resonance
(OLR) of the bar plays a key role in explaining this uniformity. In our model
of a two-phase star formation history, the metallicity, [$\alpha$/Fe] and
[$\alpha$/H] distributions, and age-metallicity relation are all compatible
with the observations of both the inner disk and bulge. The dip at
[Fe/H]$\sim$0 dex seen in the metallicity distributions of the bulge and inner
disk reflects the quenching episode in the SFH of the inner MW at age $\sim$8
Gyr, and the common evolution of the bulge and inner disk stars. We show that
at z$\le$1.5, when the MW was starting to quench, transitioning between the end
of the $\alpha$-enhanced thick disk formation to the start of the thin disk,
and yet was still gas rich, the gas accretion rate could not have been
significant. The [$\alpha$/Fe] abundance ratio before and after this quenching
phase would be different, which is not observed. The present analysis suggests
that Milky Way history, and in particular at the transition from the thick to
the thin disk -- the epoch of the quenching -- must have been driven by a
decrease of the star formation efficiency. We argue that the decline in the
intensity of gas accretion, the formation of the bar, and the quenching of the
SFR at the same epoch may be causally connected thus explaining their temporal
coincidence (abridged).
| astro-ph.GA | we show that the bulge and the disk of the milky way mw at rlesssim7kpc are well described by a unique chemical evolution and a twophase starformation history sfh we argue that the populations within this inner disk not the entire disk are the same and that the outer lindblad resonance olr of the bar plays a key role in explaining this uniformity in our model of a twophase star formation history the metallicity alphafe and alphah distributions and agemetallicity relation are all compatible with the observations of both the inner disk and bulge the dip at fehsim0 dex seen in the metallicity distributions of the bulge and inner disk reflects the quenching episode in the sfh of the inner mw at age sim8 gyr and the common evolution of the bulge and inner disk stars we show that at zle15 when the mw was starting to quench transitioning between the end of the alphaenhanced thick disk formation to the start of the thin disk and yet was still gas rich the gas accretion rate could not have been significant the alphafe abundance ratio before and after this quenching phase would be different which is not observed the present analysis suggests that milky way history and in particular at the transition from the thick to the thin disk the epoch of the quenching must have been driven by a decrease of the star formation efficiency we argue that the decline in the intensity of gas accretion the formation of the bar and the quenching of the sfr at the same epoch may be causally connected thus explaining their temporal coincidence abridged | [['we', 'show', 'that', 'the', 'bulge', 'and', 'the', 'disk', 'of', 'the', 'milky', 'way', 'mw', 'at', 'rlesssim7kpc', 'are', 'well', 'described', 'by', 'a', 'unique', 'chemical', 'evolution', 'and', 'a', 'twophase', 'starformation', 'history', 'sfh', 'we', 'argue', 'that', 'the', 'populations', 'within', 'this', 'inner', 'disk', 'not', 'the', 'entire', 'disk', 'are', 'the', 'same', 'and', 'that', 'the', 'outer', 'lindblad', 'resonance', 'olr', 'of', 'the', 'bar', 'plays', 'a', 'key', 'role', 'in', 'explaining', 'this', 'uniformity', 'in', 'our', 'model', 'of', 'a', 'twophase', 'star', 'formation', 'history', 'the', 'metallicity', 'alphafe', 'and', 'alphah', 'distributions', 'and', 'agemetallicity', 'relation', 'are', 'all', 'compatible', 'with', 'the', 'observations', 'of', 'both', 'the', 'inner', 'disk', 'and', 'bulge', 'the', 'dip', 'at', 'fehsim0', 'dex', 'seen', 'in', 'the', 'metallicity', 'distributions', 'of', 'the', 'bulge', 'and', 'inner', 'disk', 'reflects', 'the', 'quenching', 'episode', 'in', 'the', 'sfh', 'of', 'the', 'inner', 'mw', 'at', 'age', 'sim8', 'gyr', 'and', 'the', 'common', 'evolution', 'of', 'the', 'bulge', 'and', 'inner', 'disk', 'stars', 'we', 'show', 'that', 'at', 'zle15', 'when', 'the', 'mw', 'was', 'starting', 'to', 'quench', 'transitioning', 'between', 'the', 'end', 'of', 'the', 'alphaenhanced', 'thick', 'disk', 'formation', 'to', 'the', 'start', 'of', 'the', 'thin', 'disk', 'and', 'yet', 'was', 'still', 'gas', 'rich', 'the', 'gas', 'accretion', 'rate', 'could', 'not', 'have', 'been', 'significant', 'the', 'alphafe', 'abundance', 'ratio', 'before', 'and', 'after', 'this', 'quenching', 'phase', 'would', 'be', 'different', 'which', 'is', 'not', 'observed', 'the', 'present', 'analysis', 'suggests', 'that', 'milky', 'way', 'history', 'and', 'in', 'particular', 'at', 'the', 'transition', 'from', 'the', 'thick', 'to', 'the', 'thin', 'disk', 'the', 'epoch', 'of', 'the', 'quenching', 'must', 'have', 'been', 'driven', 'by', 'a', 'decrease', 'of', 'the', 'star', 'formation', 'efficiency', 'we', 'argue', 'that', 'the', 'decline', 'in', 'the', 'intensity', 'of', 'gas', 'accretion', 'the', 'formation', 'of', 'the', 'bar', 'and', 'the', 'quenching', 'of', 'the', 'sfr', 'at', 'the', 'same', 'epoch', 'may', 'be', 'causally', 'connected', 'thus', 'explaining', 'their', 'temporal', 'coincidence', 'abridged']] | [-0.05684239982428384, 0.09671311463323186, -0.12079273966582381, 0.08258223919799107, -0.04865215164861197, -0.008753693148271362, 0.009778366401555267, 0.4321210683643151, -0.2355939845359926, -0.3279099580623321, 0.048571382033067004, -0.2278170828610214, -0.016620235173153315, 0.15603855367030586, -0.060668116618719285, -0.0345275319123175, 0.021305078848650846, -0.07021663541629312, -0.06647475543709945, -0.2716636463996273, 0.3273129894210498, 0.0762770652437388, 0.13861029781748666, -0.013196013304891426, 0.029784638637506557, -0.12687525164627872, -0.036984771135421264, -0.05637789601738106, -0.1839875401954541, 0.03183779485263938, 0.22310888495577721, 0.11344626519495427, 0.22932240323844685, -0.4134305846571589, -0.2157335220297465, 0.04418990802482021, 0.2290292718906456, 0.054166491054356405, -0.12150352660900177, -0.18732300502380161, 0.07132626045495272, -0.19471238541274347, -0.1613814662985587, 0.11775150901808251, 0.04151560373451394, -0.013507704292215518, -0.21008800041910483, 0.16050877044656758, 0.10439529923987992, 0.06864556328935632, -0.09627658120919463, -0.06437561844315713, -0.10982600083477351, 0.11904984526998631, 0.019743342375219453, 0.09334798148874916, 0.23681241239997933, -0.13962567287737004, -0.0007643255512855613, 0.366645639479063, -0.1008590030424825, 0.004088093627438839, 0.22575926339712493, -0.282439861219001, -0.13721357383626276, 0.09173853012191048, 0.11671465456115653, 0.0766996468726629, -0.14485015278907343, 0.03228640850612641, -0.020954861452476357, 0.18442246950850058, 0.08169277705453726, 0.013623444540704141, 0.3665446060591937, 0.15056469621060334, 0.03848088945352486, 0.07016202760252184, -0.15327196179562486, -0.11887111468848759, -0.24424772432035724, -0.13775043045657118, -0.08438795941895735, 0.050820887849547594, -0.1423761584517896, -0.1082116646949313, 0.3656130136136633, 0.06646338451059479, 0.29455953955462677, 0.03330787245545592, 0.31697770570745387, 0.09288682026046662, 0.1277693235271944, 0.14529500458886457, 0.31267421519898103, 0.16666869636722353, 0.0983005743179472, -0.31300500699461425, 0.1799209421524889, -0.030857946054745854] |
1,802.09888 | Fixed Point Approximation of Suzuki Generalized Nonexpansive Mappings
via New Faster Iteration Process | In this paper we propose a new iteration process, called the K iteration
process, for approximation of fixed points. We show that our iteration process
is faster than the existing leading iteration processes like Picard-S iteration
process, Thakur New iteration process and Vatan Twostep iteration process for
contraction mappings. We support our analytic proof by a numerical example.
Stability of K iteration process and data dependence result for contraction
mappings by employing K iteration process is also discussed. Finally we prove
some weak and strong convergence theorems for the Suzuki generalized
nonexpansive mappings in the setting of uniformly convex Banach space. Our
results are extension, improvement and generalization of many known results in
the literature of fixed point theory.
| math.FA | in this paper we propose a new iteration process called the k iteration process for approximation of fixed points we show that our iteration process is faster than the existing leading iteration processes like picards iteration process thakur new iteration process and vatan twostep iteration process for contraction mappings we support our analytic proof by a numerical example stability of k iteration process and data dependence result for contraction mappings by employing k iteration process is also discussed finally we prove some weak and strong convergence theorems for the suzuki generalized nonexpansive mappings in the setting of uniformly convex banach space our results are extension improvement and generalization of many known results in the literature of fixed point theory | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'iteration', 'process', 'called', 'the', 'k', 'iteration', 'process', 'for', 'approximation', 'of', 'fixed', 'points', 'we', 'show', 'that', 'our', 'iteration', 'process', 'is', 'faster', 'than', 'the', 'existing', 'leading', 'iteration', 'processes', 'like', 'picards', 'iteration', 'process', 'thakur', 'new', 'iteration', 'process', 'and', 'vatan', 'twostep', 'iteration', 'process', 'for', 'contraction', 'mappings', 'we', 'support', 'our', 'analytic', 'proof', 'by', 'a', 'numerical', 'example', 'stability', 'of', 'k', 'iteration', 'process', 'and', 'data', 'dependence', 'result', 'for', 'contraction', 'mappings', 'by', 'employing', 'k', 'iteration', 'process', 'is', 'also', 'discussed', 'finally', 'we', 'prove', 'some', 'weak', 'and', 'strong', 'convergence', 'theorems', 'for', 'the', 'suzuki', 'generalized', 'nonexpansive', 'mappings', 'in', 'the', 'setting', 'of', 'uniformly', 'convex', 'banach', 'space', 'our', 'results', 'are', 'extension', 'improvement', 'and', 'generalization', 'of', 'many', 'known', 'results', 'in', 'the', 'literature', 'of', 'fixed', 'point', 'theory']] | [-0.09200539608963397, 0.022748964936511608, -0.11364935775201361, 0.0494221625552452, -0.06775085725860686, -0.146172958833142, 0.15491839753025594, 0.3787119474355914, -0.32566719700997115, -0.18629362115620815, 0.1414728060045804, -0.27160964407684174, -0.1801689873535593, 0.2092096894948172, -0.07853755487536057, 0.09714980976765647, 0.09473125989541036, -0.0016921896002247553, -0.0636435246638985, -0.28634807741966006, 0.33891663669819844, 0.054226628390234746, 0.21614926490744873, 0.005573276031230178, 0.11797622582746059, 0.004637152046559989, -0.026459127838699883, -0.030764765431175102, -0.13091181696153162, 0.10111840705567297, 0.2714551091663727, 0.15585910149129936, 0.3462122618807715, -0.36032139228954285, -0.18791087142371832, 0.08873620186051932, 0.16563774350670582, 0.05589766006040223, -0.10559286722842948, -0.2305230340928215, 0.1305143827261372, -0.11789024582899668, -0.12422754030044683, -0.14730729699181785, -0.041702960547404126, 0.02702109712105589, -0.3524854624596964, 0.026611224448595962, 0.1934704723417712, 0.07854320829748392, -0.05357149368794752, -0.13596417524992732, 0.035354111220358926, 0.023225321274000305, 0.05653305169969734, 0.08619285541970063, 0.14208918606799817, 0.0025612804823468963, -0.15314593301506854, 0.30137229371158514, -0.08078698175795428, -0.17303298474798182, 0.17221357953585997, -0.12363758021104737, -0.20787081485144607, 0.12421428818772194, 0.14090895485118257, 0.21501102012204507, -0.1344415945149645, 0.14490200704190598, -0.045510755268809926, 0.06988016112258524, 0.09760209985719133, -0.04562580074817568, 0.008906341617645211, 0.13421323029480936, 0.14694128562686495, 0.1689691237416588, 0.016242526765098842, -0.16401127516487693, -0.3666544338500425, -0.17652491325152522, -0.15350522979029588, -0.004951758333677505, -0.1797402226478605, -0.12141204626933366, 0.3215601061267324, 0.1500964283223162, 0.20837300574062628, 0.1427458631688682, 0.2544612160320355, 0.18080684647429734, -0.014099503268620797, 0.09465266840861124, 0.16676353561000296, 0.13637678705140197, 0.07584766979806688, -0.14644307530575096, 0.04278831385044741, 0.22499672019611575] |
1,802.09889 | Lifting accessible model structures | A Quillen model structure is presented by an interacting pair of weak
factorization systems. We prove that in the world of locally presentable
categories, any weak factorization system with accessible functorial
factorizations can be lifted along either a left or a right adjoint. It follows
that accessible model structures on locally presentable categories - ones
admitting accessible functorial factorizations, a class that includes all
combinatorial model structures but others besides - can be lifted along either
a left or a right adjoint if and only if an essential "acyclicity" condition
holds. A similar result was claimed in a paper of Hess-Kedziorek-Riehl-Shipley,
but the proof given there was incorrect. In this note, we explain this error
and give a correction, and also provide a new statement and a different proof
of the theorem which is more tractable for homotopy-theoretic applications.
| math.CT math.AT | a quillen model structure is presented by an interacting pair of weak factorization systems we prove that in the world of locally presentable categories any weak factorization system with accessible functorial factorizations can be lifted along either a left or a right adjoint it follows that accessible model structures on locally presentable categories ones admitting accessible functorial factorizations a class that includes all combinatorial model structures but others besides can be lifted along either a left or a right adjoint if and only if an essential acyclicity condition holds a similar result was claimed in a paper of hesskedziorekriehlshipley but the proof given there was incorrect in this note we explain this error and give a correction and also provide a new statement and a different proof of the theorem which is more tractable for homotopytheoretic applications | [['a', 'quillen', 'model', 'structure', 'is', 'presented', 'by', 'an', 'interacting', 'pair', 'of', 'weak', 'factorization', 'systems', 'we', 'prove', 'that', 'in', 'the', 'world', 'of', 'locally', 'presentable', 'categories', 'any', 'weak', 'factorization', 'system', 'with', 'accessible', 'functorial', 'factorizations', 'can', 'be', 'lifted', 'along', 'either', 'a', 'left', 'or', 'a', 'right', 'adjoint', 'it', 'follows', 'that', 'accessible', 'model', 'structures', 'on', 'locally', 'presentable', 'categories', 'ones', 'admitting', 'accessible', 'functorial', 'factorizations', 'a', 'class', 'that', 'includes', 'all', 'combinatorial', 'model', 'structures', 'but', 'others', 'besides', 'can', 'be', 'lifted', 'along', 'either', 'a', 'left', 'or', 'a', 'right', 'adjoint', 'if', 'and', 'only', 'if', 'an', 'essential', 'acyclicity', 'condition', 'holds', 'a', 'similar', 'result', 'was', 'claimed', 'in', 'a', 'paper', 'of', 'hesskedziorekriehlshipley', 'but', 'the', 'proof', 'given', 'there', 'was', 'incorrect', 'in', 'this', 'note', 'we', 'explain', 'this', 'error', 'and', 'give', 'a', 'correction', 'and', 'also', 'provide', 'a', 'new', 'statement', 'and', 'a', 'different', 'proof', 'of', 'the', 'theorem', 'which', 'is', 'more', 'tractable', 'for', 'homotopytheoretic', 'applications']] | [-0.14036196664657088, 0.08399523427108173, -0.1251221308244995, 0.14180609602344169, -0.116510650367298, -0.22862890826004065, 0.0089047563744637, 0.3792109660913839, -0.33358245069736286, -0.20762828849803874, 0.10429270365806159, -0.21431782997815924, -0.13169049214133444, 0.18564355976174257, -0.12427063649931155, -0.06750561698230312, 0.10272888742003809, 0.07719084007433541, -0.06545848084817193, -0.2466389392348527, 0.3521180844194639, -0.016859095827813315, 0.20878481494454557, 0.07831902982434258, 0.11595281514147406, -0.001878932976122836, -0.004448501484790433, 0.04942818357855739, -0.11399593723244299, 0.12782243249710198, 0.26314804737921804, 0.09457931366084855, 0.2256416838585317, -0.37902163365609287, -0.1288988185911234, 0.15002126417547354, 0.1403163907576955, 0.09466537518635638, -0.06343897291844769, -0.3035749269868521, 0.15044292836340473, -0.21422561959993533, -0.1169134939863237, -0.10260962472324643, 0.03617640145753017, -0.043014604324365366, -0.2761163329915315, 0.002262357100014068, 0.16246761665474074, 0.06972077989485115, -0.04312894744319184, -0.06436470831891604, -0.016274756962957326, 0.07915222718421479, -0.0012118367209469022, 0.032660220992778814, 0.07490596154992304, -0.10967662802774131, -0.10793889774119153, 0.3764237080399385, -0.03775334735024337, -0.2309200494440601, 0.20254705806591494, -0.08519916402891635, -0.16363663452348726, 0.10974428261911004, 0.03338769712718204, 0.1577278096708195, -0.1180732785454465, 0.16334171093116953, -0.14248505289502003, 0.16105175714063294, 0.08793016388902769, 0.001960864048455465, 0.17796988965368227, 0.10473641994244912, 0.10684005272067974, 0.11023167997208315, 0.06820168554173399, -0.03622955094803782, -0.3437771310838049, -0.18029988138689934, -0.11148965687179417, 0.10346349552021232, -0.035538465626493286, -0.20792459967624916, 0.3782185923088999, 0.13025743851561428, 0.20192640681617538, 0.11211216882742626, 0.27642246998969794, 0.08885420520570786, 0.05446753097588525, 0.06124485717223519, 0.16729641351027086, 0.16826905534253456, 0.028153340931406572, -0.0334311747300329, 0.07092117286725517, 0.13510360687231535] |
1,802.0989 | Dynamical quantum phase transition for mixed states in open systems | Based on a kinematic approach in defining a geometric phase for a density
matrix, we define the generalized Loschmidt overlap amplitude (GLOA) for an
open system for arbitrary quantum evolution. The GLOA reduces to the Loschmidt
overlap amplitude (LOA) with a modified dynamic phase for unitary evolution of
a pure state, with the argument of the GLOA well-defined by the geometric
phase, thus possessing similar physical interpretation to that of the LOA. The
rate function for the GLOA exhibits non-analyticity at a critical time, which
corresponds to the dynamical quantum phase transition. We observe that the
dynamical quantum phase transition related to GLOA is not destroyed under a
finite temperature and weak enough dissipation. In particular, we find that a
new type of dynamical quantum phase transition emerges in a dissipation system.
The proposed GLOA provides a powerful tool in the investigation of a dynamical
quantum phase transition in an arbitrary quantum system, which not only can
characterize the robustness of the dynamical quantum phase transition but also
can be used to search for new transitions.
| quant-ph | based on a kinematic approach in defining a geometric phase for a density matrix we define the generalized loschmidt overlap amplitude gloa for an open system for arbitrary quantum evolution the gloa reduces to the loschmidt overlap amplitude loa with a modified dynamic phase for unitary evolution of a pure state with the argument of the gloa welldefined by the geometric phase thus possessing similar physical interpretation to that of the loa the rate function for the gloa exhibits nonanalyticity at a critical time which corresponds to the dynamical quantum phase transition we observe that the dynamical quantum phase transition related to gloa is not destroyed under a finite temperature and weak enough dissipation in particular we find that a new type of dynamical quantum phase transition emerges in a dissipation system the proposed gloa provides a powerful tool in the investigation of a dynamical quantum phase transition in an arbitrary quantum system which not only can characterize the robustness of the dynamical quantum phase transition but also can be used to search for new transitions | [['based', 'on', 'a', 'kinematic', 'approach', 'in', 'defining', 'a', 'geometric', 'phase', 'for', 'a', 'density', 'matrix', 'we', 'define', 'the', 'generalized', 'loschmidt', 'overlap', 'amplitude', 'gloa', 'for', 'an', 'open', 'system', 'for', 'arbitrary', 'quantum', 'evolution', 'the', 'gloa', 'reduces', 'to', 'the', 'loschmidt', 'overlap', 'amplitude', 'loa', 'with', 'a', 'modified', 'dynamic', 'phase', 'for', 'unitary', 'evolution', 'of', 'a', 'pure', 'state', 'with', 'the', 'argument', 'of', 'the', 'gloa', 'welldefined', 'by', 'the', 'geometric', 'phase', 'thus', 'possessing', 'similar', 'physical', 'interpretation', 'to', 'that', 'of', 'the', 'loa', 'the', 'rate', 'function', 'for', 'the', 'gloa', 'exhibits', 'nonanalyticity', 'at', 'a', 'critical', 'time', 'which', 'corresponds', 'to', 'the', 'dynamical', 'quantum', 'phase', 'transition', 'we', 'observe', 'that', 'the', 'dynamical', 'quantum', 'phase', 'transition', 'related', 'to', 'gloa', 'is', 'not', 'destroyed', 'under', 'a', 'finite', 'temperature', 'and', 'weak', 'enough', 'dissipation', 'in', 'particular', 'we', 'find', 'that', 'a', 'new', 'type', 'of', 'dynamical', 'quantum', 'phase', 'transition', 'emerges', 'in', 'a', 'dissipation', 'system', 'the', 'proposed', 'gloa', 'provides', 'a', 'powerful', 'tool', 'in', 'the', 'investigation', 'of', 'a', 'dynamical', 'quantum', 'phase', 'transition', 'in', 'an', 'arbitrary', 'quantum', 'system', 'which', 'not', 'only', 'can', 'characterize', 'the', 'robustness', 'of', 'the', 'dynamical', 'quantum', 'phase', 'transition', 'but', 'also', 'can', 'be', 'used', 'to', 'search', 'for', 'new', 'transitions']] | [-0.16599403689906467, 0.20947699207135884, -0.16641644780280662, 0.05868016226569042, -0.01678314118180424, -0.1297543480580895, 0.07861409307224676, 0.2951966820083643, -0.25438628338848834, -0.24574585320607928, 0.0828751415134651, -0.20849527279179628, -0.18626347365947862, 0.17341862645778086, -0.007903304612475702, 0.0771612972206309, -0.001127084256784821, 0.05651457935428797, -0.14944840121262876, -0.1499413037566807, 0.3239519242719821, 0.021145628056150268, 0.2674066855318167, 0.036592337122618286, 0.08264997045890513, 0.00034021342104427856, 0.06424468832185747, 0.021931525859558446, -0.1463654834673517, 0.00840643379805525, 0.21995885606685822, 0.08665161811619658, 0.21738231786928902, -0.36660485600904474, -0.22618071714466417, 0.10303428250666581, 0.13522304991387168, 0.1452339560267071, -0.058023993971635886, -0.3089300886600871, 0.04084481501062824, -0.1612617278124989, -0.1656426153997679, -0.09412999473517464, 0.017301653157284654, -0.03787123289128596, -0.2715049243521538, 0.09935566604475422, 0.06621483124680791, 0.04124767867721279, -0.027261254969000056, -0.0008872479884303175, -0.004594668611058627, 0.1283251392543951, -0.07035392679244978, 0.06352117818261666, 0.10721625883227469, -0.11956374838932375, -0.1004333261040632, 0.3665073220406405, -0.08202244654570347, -0.13697543513394936, 0.18658820154087152, -0.15175336389008656, -0.14219085940964182, 0.16171678742235104, 0.12878747669376686, 0.07897109880948185, -0.13040178509386766, 0.0648399452299848, 0.02877524246617792, 0.2022747634506562, 0.003590416140716777, 0.08749729043020951, 0.2264282451003303, 0.1403304598101055, 0.07076170680755406, 0.19154466359428957, -0.07966496916990516, -0.2049613089223964, -0.3006819010743956, -0.18272805127939631, -0.1954459895734379, 0.07557889212479164, -0.10145804770176751, -0.2133017819247801, 0.4072754084005613, 0.1469660559226792, 0.19818236780437556, 0.02493813572106195, 0.2392232323565457, 0.1738623765122611, 0.03717534496999261, 0.03698003521111042, 0.25153077674489893, 0.14467324339784682, 0.11580588915140569, -0.29522703131343325, 0.05941205716887701, 0.08524553024934986] |
1,802.09891 | Unitary Representation of Symplectic Group for Phase Point Operators on
Discrete Phase Space | The phase point operator $\Delta(q,p)$ is the quantum mechanical counterpart
of the classical phase point $(q,p)$. The discrete form of $\Delta(q,p)$ was
formulated for an odd number of lattice points by Cohendet et al. and for an
even number of lattice points by Leonhardt. Both versions have symplectic
covariance, which is of fundamental importance in quantum mechanics. However,
an explicit form of the projective representation of the symplectic group that
appears in the covariance relation is not yet known. We show in this paper the
existence and uniqueness of the representation, and describe a method to
construct it using the Euclidean algorithm.
| quant-ph math-ph math.MP | the phase point operator deltaqp is the quantum mechanical counterpart of the classical phase point qp the discrete form of deltaqp was formulated for an odd number of lattice points by cohendet et al and for an even number of lattice points by leonhardt both versions have symplectic covariance which is of fundamental importance in quantum mechanics however an explicit form of the projective representation of the symplectic group that appears in the covariance relation is not yet known we show in this paper the existence and uniqueness of the representation and describe a method to construct it using the euclidean algorithm | [['the', 'phase', 'point', 'operator', 'deltaqp', 'is', 'the', 'quantum', 'mechanical', 'counterpart', 'of', 'the', 'classical', 'phase', 'point', 'qp', 'the', 'discrete', 'form', 'of', 'deltaqp', 'was', 'formulated', 'for', 'an', 'odd', 'number', 'of', 'lattice', 'points', 'by', 'cohendet', 'et', 'al', 'and', 'for', 'an', 'even', 'number', 'of', 'lattice', 'points', 'by', 'leonhardt', 'both', 'versions', 'have', 'symplectic', 'covariance', 'which', 'is', 'of', 'fundamental', 'importance', 'in', 'quantum', 'mechanics', 'however', 'an', 'explicit', 'form', 'of', 'the', 'projective', 'representation', 'of', 'the', 'symplectic', 'group', 'that', 'appears', 'in', 'the', 'covariance', 'relation', 'is', 'not', 'yet', 'known', 'we', 'show', 'in', 'this', 'paper', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'representation', 'and', 'describe', 'a', 'method', 'to', 'construct', 'it', 'using', 'the', 'euclidean', 'algorithm']] | [-0.11995354579245247, 0.08626898716934057, -0.11315658896018078, 0.03848564183330255, -0.05607260353540504, -0.09202572709355171, 0.03531182497984149, 0.33457311504695675, -0.2816094281151891, -0.2630547084615077, 0.09299952099284176, -0.23576634456080817, -0.22426286883799745, 0.17264197422836972, -0.09379911607149805, 0.05962668932826802, 0.018212548616148606, 0.06797352256161152, -0.09052242388450864, -0.24619559954741213, 0.340044565591039, 0.02815722005377238, 0.2644766707360597, 0.005866966675966978, 0.11283726937663142, 0.04913214637925572, 0.005076947004193127, 0.002881093328763353, -0.0790387144348138, 0.08649271513602816, 0.24514405970406342, 0.08712291112630674, 0.23302131017098332, -0.3872334484084703, -0.18843346322416374, 0.15537768660117826, 0.12593013032208114, 0.10916690831187892, -0.047443218188046817, -0.26843976025760063, 0.08338745927788538, -0.12526539566069103, -0.1575546757696141, -0.0973199960162764, 0.02479408810025837, -0.02346290626429427, -0.22443791770717442, 0.06550691425708113, 0.10035635270915999, 0.08864477640110077, -0.05355610425519471, -0.09326491935990087, -0.00012810325416007844, 0.09843965724922053, -0.02002170212834262, 0.05847066582300433, 0.032092794260738584, -0.11490996712864847, -0.13952485762425873, 0.41881524295647543, 0.011244088494320317, -0.22838298651841607, 0.13986661948152992, -0.11615850609533562, -0.12497035621453335, 0.12021871504954773, 0.10602202980161303, 0.09881614397353686, -0.12139242588678412, 0.17298504944699403, -0.09353283994674387, 0.12882961128379614, 0.04495170532430679, 0.023972741083822923, 0.15117860908820616, 0.0984241298911632, 0.08063860540278256, 0.12607350661465438, -0.05711097121215656, -0.1361742954093751, -0.31715546885855717, -0.2081764141480337, -0.24309129364521123, 0.07856221113479028, -0.0953938349809712, -0.18724665965073475, 0.37089123220487247, 0.1005156209506786, 0.19403566235657965, 0.04413613837585775, 0.22540843126244178, 0.14748541109890925, 0.010614010357841997, 0.09316628399169036, 0.22190321919203984, 0.1765874437111808, 0.02721123109654625, -0.2216564071420027, -0.006355543777641684, 0.17171020469268655] |
1,802.09892 | New explicit solutions to the $p$-Laplace equation based on
isoparametric foliations | In contrast to an infinite family of explicit examples of two-dimensional
$p$-harmonic functions obtained by G.Aronsson in the late 80s, there is very
little known about the higher-dimensional case. In this paper, we show how to
use isoparametric polynomials to produce diverse examples of $p$-harmonic and
biharmonic functions. Remarkably, for some distinguished values of $p$ and the
ambient dimension $n$ this yields first examples of rational and algebraic
$p$-harmonic functions. Moreover, we show that there are no $p$-harmonic
polynomials of the isoparametric type. This supports a negative answer to a
question proposed in 1980 by J. Lewis.
| math.AP math.DG | in contrast to an infinite family of explicit examples of twodimensional pharmonic functions obtained by garonsson in the late 80s there is very little known about the higherdimensional case in this paper we show how to use isoparametric polynomials to produce diverse examples of pharmonic and biharmonic functions remarkably for some distinguished values of p and the ambient dimension n this yields first examples of rational and algebraic pharmonic functions moreover we show that there are no pharmonic polynomials of the isoparametric type this supports a negative answer to a question proposed in 1980 by j lewis | [['in', 'contrast', 'to', 'an', 'infinite', 'family', 'of', 'explicit', 'examples', 'of', 'twodimensional', 'pharmonic', 'functions', 'obtained', 'by', 'garonsson', 'in', 'the', 'late', '80s', 'there', 'is', 'very', 'little', 'known', 'about', 'the', 'higherdimensional', 'case', 'in', 'this', 'paper', 'we', 'show', 'how', 'to', 'use', 'isoparametric', 'polynomials', 'to', 'produce', 'diverse', 'examples', 'of', 'pharmonic', 'and', 'biharmonic', 'functions', 'remarkably', 'for', 'some', 'distinguished', 'values', 'of', 'p', 'and', 'the', 'ambient', 'dimension', 'n', 'this', 'yields', 'first', 'examples', 'of', 'rational', 'and', 'algebraic', 'pharmonic', 'functions', 'moreover', 'we', 'show', 'that', 'there', 'are', 'no', 'pharmonic', 'polynomials', 'of', 'the', 'isoparametric', 'type', 'this', 'supports', 'a', 'negative', 'answer', 'to', 'a', 'question', 'proposed', 'in', '1980', 'by', 'j', 'lewis']] | [-0.12612298196472693, 0.05491803949447179, -0.0486931737298922, 0.09858492833397274, -0.07390600834332872, -0.13016456775949337, -0.006642315380304353, 0.37674319942986284, -0.2486351748909025, -0.2321708212257363, 0.0700710518140113, -0.29104879534376477, -0.22002673607736747, 0.2281194586539641, -0.13401244895067066, 0.0469484781826092, 0.03920683919568546, 0.03996010569001859, -0.10401158803302717, -0.31967852072557434, 0.4022914355458245, -0.01988401619261519, 0.17235167394301243, 0.076230109577106, 0.11032974435511278, -0.04741154847336778, -0.03305182423112759, 0.021092150437956054, -0.18062829846356485, 0.12050100371561712, 0.33007116939794895, 0.11085346040636068, 0.2555513084322835, -0.3676629057348085, -0.18555946897443695, 0.18586891013668114, 0.12238904887150663, 0.034384384081931785, -0.0793236175183362, -0.23008851120782006, 0.06625914916730835, -0.09634401943185367, -0.209768782791798, -0.10185457616656397, 0.07303284518032645, 0.028919034816984397, -0.2576987320110978, 0.037835954295587726, 0.14999585745196478, 0.1135192493966315, -0.04678928987959807, -0.1307099948741476, -0.026985229570224572, 0.08778486607843661, 0.058938036008603, 0.05691856737151587, 0.00026204373959141475, -0.07710650205020404, -0.09885227010818198, 0.3286514653561123, -0.05322387798999747, -0.25877802957666063, 0.19884932518471032, -0.1622524286309878, -0.17119952863140497, 0.09231505627394654, 0.12121386938573171, 0.14737381126421192, -0.0759627354997671, 0.15463572913540702, -0.1297350949559283, 0.12360988547394906, 0.17187188255775254, -0.033264792855334235, 0.08308834993901353, 0.034198283159639686, 0.05504838054184802, 0.19117940740519165, 0.04723704898303064, -0.040988009238693245, -0.3277345091143313, -0.16898209021019284, -0.1846141631443364, 0.12943871972432439, -0.10362365781429617, -0.19504524048049157, 0.375501716004995, 0.08564673255508144, 0.19502735894639045, 0.10449922044062987, 0.20794913844777815, 0.08679924503182217, -0.005644348018298236, 0.09635992662515491, 0.18826287369696124, 0.1496868154160135, 0.07378652958626238, -0.13088418141160219, -0.008680418924389718, 0.13692031035801241] |
1,802.09893 | Universality and Optimality in the Information-Disturbance Tradeoff | We investigate the tradeoff between the quality of an approximate version of
a given measurement and the disturbance it induces in the measured quantum
system. We prove that if the target measurement is a non-degenerate von Neumann
measurement, then the optimal tradeoff can always be achieved within a
two-parameter family of quantum devices that is independent of the chosen
distance measures. This form of almost universal optimality holds under mild
assumptions on the distance measures such as convexity and basis-independence,
which are satisfied for all the usual cases that are based on norms, transport
cost functions, relative entropies, fidelities, etc. for both worst-case and
average-case analysis. We analyze the case of the cb-norm (or diamond norm)
more generally for which we show dimension-independence of the derived optimal
tradeoff for general von Neumann measurements. A SDP solution is provided for
general POVMs and shown to exist for arbitrary convex semialgebraic distance
measures.
| quant-ph math-ph math.MP | we investigate the tradeoff between the quality of an approximate version of a given measurement and the disturbance it induces in the measured quantum system we prove that if the target measurement is a nondegenerate von neumann measurement then the optimal tradeoff can always be achieved within a twoparameter family of quantum devices that is independent of the chosen distance measures this form of almost universal optimality holds under mild assumptions on the distance measures such as convexity and basisindependence which are satisfied for all the usual cases that are based on norms transport cost functions relative entropies fidelities etc for both worstcase and averagecase analysis we analyze the case of the cbnorm or diamond norm more generally for which we show dimensionindependence of the derived optimal tradeoff for general von neumann measurements a sdp solution is provided for general povms and shown to exist for arbitrary convex semialgebraic distance measures | [['we', 'investigate', 'the', 'tradeoff', 'between', 'the', 'quality', 'of', 'an', 'approximate', 'version', 'of', 'a', 'given', 'measurement', 'and', 'the', 'disturbance', 'it', 'induces', 'in', 'the', 'measured', 'quantum', 'system', 'we', 'prove', 'that', 'if', 'the', 'target', 'measurement', 'is', 'a', 'nondegenerate', 'von', 'neumann', 'measurement', 'then', 'the', 'optimal', 'tradeoff', 'can', 'always', 'be', 'achieved', 'within', 'a', 'twoparameter', 'family', 'of', 'quantum', 'devices', 'that', 'is', 'independent', 'of', 'the', 'chosen', 'distance', 'measures', 'this', 'form', 'of', 'almost', 'universal', 'optimality', 'holds', 'under', 'mild', 'assumptions', 'on', 'the', 'distance', 'measures', 'such', 'as', 'convexity', 'and', 'basisindependence', 'which', 'are', 'satisfied', 'for', 'all', 'the', 'usual', 'cases', 'that', 'are', 'based', 'on', 'norms', 'transport', 'cost', 'functions', 'relative', 'entropies', 'fidelities', 'etc', 'for', 'both', 'worstcase', 'and', 'averagecase', 'analysis', 'we', 'analyze', 'the', 'case', 'of', 'the', 'cbnorm', 'or', 'diamond', 'norm', 'more', 'generally', 'for', 'which', 'we', 'show', 'dimensionindependence', 'of', 'the', 'derived', 'optimal', 'tradeoff', 'for', 'general', 'von', 'neumann', 'measurements', 'a', 'sdp', 'solution', 'is', 'provided', 'for', 'general', 'povms', 'and', 'shown', 'to', 'exist', 'for', 'arbitrary', 'convex', 'semialgebraic', 'distance', 'measures']] | [-0.1345898303342983, 0.07636547605594388, -0.09279102555340311, 0.10002482334927966, 0.0031744634825736284, -0.18911358470718065, 0.06317116672483583, 0.365231196678554, -0.29248263862294455, -0.22901620017985502, 0.11731748717759426, -0.2782921465206891, -0.11397151227264354, 0.24145782391075044, -0.12862962062625835, 0.11596089343850811, 0.0793123702177157, 0.06765284737106413, -0.1349099254705167, -0.24419177279497187, 0.34276936736345914, 0.02088884059029321, 0.30262447459002334, 0.07756612416473217, 0.12835205800210436, 0.01474748324447622, 0.04176545281584064, 0.06444641380812148, -0.18153849153076104, 0.12089016580760169, 0.24417593399994075, 0.18867274001585124, 0.26406442279616993, -0.36984449772474665, -0.1539039461547509, 0.16508334555042287, 0.07515400771982968, 0.04935755507089198, -0.03441576816578163, -0.2604498356937741, 0.09254690964395801, -0.1292441957552607, -0.0851888927987117, -0.0782467026092733, 0.018045723155761757, 0.015245998864993454, -0.34465244598686695, 0.09101199780125172, 0.07757635760300521, 0.0458426431256036, -0.07190643796512934, -0.07725301986637835, 0.019666166339690486, 0.11146820746983091, -0.009541523821341494, 0.002719365647062659, 0.11397689766560992, -0.05463826330844313, -0.1054594688800474, 0.34422949005034753, -0.028932116744108498, -0.26809003240118423, 0.13954328778975952, -0.14962461875285954, -0.10358745565482726, 0.01885633713255326, 0.13207733598692964, 0.11254564523076017, -0.14936496906603375, 0.0965986909577623, -0.07116872316226364, 0.15628813068072, 0.10409176559342692, 0.11249355926256006, 0.0927592444450905, 0.09034773463926589, 0.1797450358661202, 0.15972947526567927, -0.016045599930609267, -0.11554446710273623, -0.33690341040492056, -0.17729733852669596, -0.2189244602054047, 0.08099486253612365, -0.14189981555993048, -0.1577574896880348, 0.3331474090848739, 0.10040694101713597, 0.15629304559901358, 0.11700377402361482, 0.26380794287969667, 0.1488756155145044, 0.013931167783836523, 0.11604469773359596, 0.2538294069468975, 0.12930632216079782, 0.00498160595074296, -0.20739411209981579, 0.10900142371033629, 0.07375459998846054] |
1,802.09894 | On Hasse--Schmidt derivations: the action of substitution maps | We study the action of substitution maps between power series rings as an
additional algebraic structure on the groups of Hasse--Schmidt derivations.
This structure appears as a counterpart of the module structure on classical
derivations.
| math.AG math.AC | we study the action of substitution maps between power series rings as an additional algebraic structure on the groups of hasseschmidt derivations this structure appears as a counterpart of the module structure on classical derivations | [['we', 'study', 'the', 'action', 'of', 'substitution', 'maps', 'between', 'power', 'series', 'rings', 'as', 'an', 'additional', 'algebraic', 'structure', 'on', 'the', 'groups', 'of', 'hasseschmidt', 'derivations', 'this', 'structure', 'appears', 'as', 'a', 'counterpart', 'of', 'the', 'module', 'structure', 'on', 'classical', 'derivations']] | [-0.21601782688604934, -0.058915176544854016, -0.11942600485469614, 0.04980790091878069, -0.11691014867808137, -0.031874103139021566, 0.02125206728066717, 0.37099011348826544, -0.38022241145372393, -0.21055156593876226, 0.1227250545984134, -0.27219702675938606, -0.20019392208861453, 0.19459763879754713, -0.0455559892313821, -0.08602396813886506, 0.0019953566470316477, 0.13110989237736378, -0.13344093742115157, -0.20574494078422764, 0.3861616422023092, 0.14712459249421955, 0.21095625034400395, -0.049297493509948255, 0.10393450401191201, 0.0143573640845716, -0.041997991768377166, 0.013380131125450135, -0.1163881157990545, 0.1453645797047232, 0.18722367648567473, 0.05282052967564336, 0.18705789102906628, -0.39560892432928085, -0.18640243469604423, 0.03760244215705565, 0.09507907487984214, 0.04992067930953843, -0.030985618495781506, -0.24987739825155586, 0.06590106894395181, -0.22624386747234634, -0.05515418827001538, -0.09734117105212395, 0.031198607039238727, 0.003449314400287611, -0.19053454634434144, 0.019415905140340327, 0.1522505661472678, 0.19560607067708458, -0.1121611359130059, -0.08080318607057312, -0.010132536677909748, 0.12405838142814381, -0.025898233614861967, -0.04961428785297487, 0.1335570601613394, -0.12199944012266184, -0.17199801222554276, 0.38421276094658036, -0.06252762334687369, -0.18186055411185537, 0.20005753082888467, -0.17789931797555514, -0.1565251306231533, 0.07090933692774602, 0.1188726327248982, 0.12726484338220742, -0.07943224912742153, 0.17518112986747708, -0.12421572543680667, 0.17100679339574917, 0.06651028745940753, 0.048307900769369944, 0.18239078617521695, 0.10226947462984494, 0.07136323116719723, 0.1770417400768825, 0.025418441370129587, -0.05940819089966161, -0.36825438932116544, -0.1964407398365438, -0.07573388676558222, 0.12419974271075002, -0.07480612775044782, -0.19949044109588224, 0.42217146360448427, 0.05303085832690288, 0.2172498000120478, 0.04599598489169564, 0.2662855467626027, 0.1075552557395505, 0.13474591800144742, -0.004781408874051912, 0.07874452961342675, 0.2621591503066676, -0.0049995309806295804, -0.19548229937042508, 0.01552108224215252, 0.18484996727534703] |
1,802.09895 | Extending Continuum Models for Atom Probe Simulation | This work describes extensions to existing level-set algorithms developed for
application within the field of Atom Probe Tomography (APT). We present a new
simulation tool for the simulation of 3D tomographic volumes, using advanced
level set methods. By combining narrow-band, B-Tree and particle-tracing
approaches from level-set methods, we demonstrate a practical tool for
simulating shape changes to APT samples under applied electrostatic fields, in
three dimensions. This work builds upon our previous studies by allowing for
non-axially symmetric solutions, with minimal loss in computational speed,
whilst retaining numerical accuracy.
| physics.comp-ph cond-mat.mtrl-sci | this work describes extensions to existing levelset algorithms developed for application within the field of atom probe tomography apt we present a new simulation tool for the simulation of 3d tomographic volumes using advanced level set methods by combining narrowband btree and particletracing approaches from levelset methods we demonstrate a practical tool for simulating shape changes to apt samples under applied electrostatic fields in three dimensions this work builds upon our previous studies by allowing for nonaxially symmetric solutions with minimal loss in computational speed whilst retaining numerical accuracy | [['this', 'work', 'describes', 'extensions', 'to', 'existing', 'levelset', 'algorithms', 'developed', 'for', 'application', 'within', 'the', 'field', 'of', 'atom', 'probe', 'tomography', 'apt', 'we', 'present', 'a', 'new', 'simulation', 'tool', 'for', 'the', 'simulation', 'of', '3d', 'tomographic', 'volumes', 'using', 'advanced', 'level', 'set', 'methods', 'by', 'combining', 'narrowband', 'btree', 'and', 'particletracing', 'approaches', 'from', 'levelset', 'methods', 'we', 'demonstrate', 'a', 'practical', 'tool', 'for', 'simulating', 'shape', 'changes', 'to', 'apt', 'samples', 'under', 'applied', 'electrostatic', 'fields', 'in', 'three', 'dimensions', 'this', 'work', 'builds', 'upon', 'our', 'previous', 'studies', 'by', 'allowing', 'for', 'nonaxially', 'symmetric', 'solutions', 'with', 'minimal', 'loss', 'in', 'computational', 'speed', 'whilst', 'retaining', 'numerical', 'accuracy']] | [-0.013416630221234465, 0.004683104957538572, -0.0654838475456927, 0.029170361524765296, -0.035477848834654484, -0.13720950549891728, 0.040037302427332506, 0.4032178724618544, -0.2019319773297122, -0.3434205892580477, 0.0896624382452997, -0.2342085348950191, -0.145863282145001, 0.2663418473675847, -0.062468196151629934, 0.15889874029645315, 0.08042388012505729, -0.0699256352646361, -0.07412968239408325, -0.24029266913103955, 0.28861289007314056, 0.06274038342235144, 0.32259927837135777, 0.019860048722131814, 0.1051378790765408, 0.035853884092913096, -0.07722388797397302, 0.08497402694245632, -0.15349103368564762, 0.16495640414433926, 0.2649040541933077, 0.15022786685255018, 0.2757140215729702, -0.4529005553658036, -0.2838149403766941, 0.015247846948279237, 0.15524070105642418, 0.17906843467657876, -0.12371678952000696, -0.3001038744537668, 0.05828305387827144, -0.1446858128765598, -0.14678062324475666, -0.16745961335254833, -0.03716713148539632, 0.0019326889993284237, -0.3000435156731824, 0.056542134065900675, -0.016664734918528913, 0.08756310105408457, -0.04692314076766541, -0.09932104042639946, 0.08758764722998338, 0.09265859975659457, -0.0035748440052636647, 0.04041655582477688, 0.13331518627025865, -0.11765368224587291, -0.16017893621359358, 0.3518783852553249, -0.07009068681773814, -0.2303389449476857, 0.2280394889795306, -0.06444502842549066, -0.13011278270807286, 0.14950567453475247, 0.17827788325005464, 0.1391066406557167, -0.12330877164574551, 0.11645076209507269, 0.04134863601806997, 0.1799511251777982, 0.05469886387370273, -0.03686479243862612, 0.14692128418193368, 0.23194954508852045, 0.0427987983725457, 0.15075120841555129, -0.10215909326242664, -0.0824815780241889, -0.2462118839030154, -0.14399295225633646, -0.14997686641502447, -0.020989524078851737, -0.05689933921977089, -0.13299972479316322, 0.4336414006962018, 0.23574577460319482, 0.08552901289129461, 0.07449005060532893, 0.395082406276329, 0.049348269965114676, 0.04125285977021453, 0.06460871912581338, 0.19356256127833726, 0.1095561839862388, 0.11487475492652845, -0.16894144233347932, 0.006730845190097832, 0.08800436124015092] |
1,802.09896 | Current fluctuations in periodically driven systems | Small nonequelibrium systems driven by an external periodic protocol can be
described by Markov processes with time-periodic transition rates. In general,
current fluctuations in such small systems are large and may play a crucial
role. We develop a theoretical formalism to evaluate the rate of such large
deviations in periodically driven systems. We show that the scaled cumulant
generating function that characterizes current fluctuations is given by a
maximal Floquet exponent. Comparing deterministic protocols with stochastic
protocols, we show that, with respect to large deviations, systems driven by a
stochastic protocol with an infinitely large number of jumps are equivalent to
systems driven by deterministic protocols. Our results are illustrated with
three case studies: a two-state model for a heat engine, a three-state model
for a molecular pump, and a biased random walk with a time-periodic affinity.
| cond-mat.stat-mech | small nonequelibrium systems driven by an external periodic protocol can be described by markov processes with timeperiodic transition rates in general current fluctuations in such small systems are large and may play a crucial role we develop a theoretical formalism to evaluate the rate of such large deviations in periodically driven systems we show that the scaled cumulant generating function that characterizes current fluctuations is given by a maximal floquet exponent comparing deterministic protocols with stochastic protocols we show that with respect to large deviations systems driven by a stochastic protocol with an infinitely large number of jumps are equivalent to systems driven by deterministic protocols our results are illustrated with three case studies a twostate model for a heat engine a threestate model for a molecular pump and a biased random walk with a timeperiodic affinity | [['small', 'nonequelibrium', 'systems', 'driven', 'by', 'an', 'external', 'periodic', 'protocol', 'can', 'be', 'described', 'by', 'markov', 'processes', 'with', 'timeperiodic', 'transition', 'rates', 'in', 'general', 'current', 'fluctuations', 'in', 'such', 'small', 'systems', 'are', 'large', 'and', 'may', 'play', 'a', 'crucial', 'role', 'we', 'develop', 'a', 'theoretical', 'formalism', 'to', 'evaluate', 'the', 'rate', 'of', 'such', 'large', 'deviations', 'in', 'periodically', 'driven', 'systems', 'we', 'show', 'that', 'the', 'scaled', 'cumulant', 'generating', 'function', 'that', 'characterizes', 'current', 'fluctuations', 'is', 'given', 'by', 'a', 'maximal', 'floquet', 'exponent', 'comparing', 'deterministic', 'protocols', 'with', 'stochastic', 'protocols', 'we', 'show', 'that', 'with', 'respect', 'to', 'large', 'deviations', 'systems', 'driven', 'by', 'a', 'stochastic', 'protocol', 'with', 'an', 'infinitely', 'large', 'number', 'of', 'jumps', 'are', 'equivalent', 'to', 'systems', 'driven', 'by', 'deterministic', 'protocols', 'our', 'results', 'are', 'illustrated', 'with', 'three', 'case', 'studies', 'a', 'twostate', 'model', 'for', 'a', 'heat', 'engine', 'a', 'threestate', 'model', 'for', 'a', 'molecular', 'pump', 'and', 'a', 'biased', 'random', 'walk', 'with', 'a', 'timeperiodic', 'affinity']] | [-0.1905530175906332, 0.19767634467044606, -0.02038196724949076, 0.056433766680557336, 0.03379116284529172, -0.19628672655124, 0.056423438435612136, 0.36896790796890855, -0.27896713180577054, -0.24739017091590487, 0.07477274803215336, -0.27302328115740027, -0.1627694150665775, 0.2711743197424392, -0.04649291651816491, 0.09678026741226751, 0.050586515852688425, -0.03602565068285912, -0.004356856262722217, -0.17540982236524166, 0.3092080102822579, 0.04482314915923566, 0.26450745361131234, -0.01468578404883909, 0.10081079798435573, -0.01526843456496649, 0.0034899141841485876, 0.06519358073402305, -0.11456686920422833, 0.0699577460592777, 0.20450535992516533, 0.03319734035005026, 0.3004426311920671, -0.4227354624719523, -0.2284738536348895, 0.14074098723700873, 0.12784523306618212, 0.18026206733809566, -0.08788262723999865, -0.293107885223649, 0.07773900402860497, -0.20479990614865742, -0.15190134195590338, -0.1022732943032786, 0.02672887295279104, 0.12780744587892995, -0.33222408179469365, 0.08877351715380107, 0.06927201832192675, 0.05976707997786648, -0.012609512846478644, -0.030502840499085485, 0.006583007293931373, 0.1017170722993529, -0.007312395452198175, 0.017741624490179887, 0.1866606917910223, -0.09514349751872728, -0.19587200799929527, 0.33898865000810474, -0.13621970003313275, -0.23854237946258816, 0.18015186025706284, -0.11722596018123166, -0.13011171780047281, 0.1295086249421515, 0.16557937863912872, 0.1024228085845928, -0.18380068384987466, 0.04638795764618836, -0.016179574222084794, 0.18153030667385525, -0.022638869180809706, -0.0004951632320572732, 0.21054938555393807, 0.17976115511812488, 0.06472386069499943, 0.17607873476620572, 0.0041478071772657775, -0.2030618088593816, -0.2709752019179766, -0.09017520422193069, -0.19514457140843766, 0.08998484318748096, -0.09023148447993341, -0.17108046092086143, 0.3408945521668476, 0.16802514990644446, 0.21493431057452278, 0.0611972137926119, 0.25508772874908414, 0.20029347457474453, 0.01188064378905384, 0.0946614353246439, 0.17101013113621294, 0.11908207592205144, 0.09756767551195533, -0.20323640398804427, 0.099411681849126, 0.032168435081771085] |
1,802.09897 | Multiple structural transitions in interacting networks | Many real-world systems can be modeled as interconnected multilayer networks,
namely a set of networks interacting with each other. Here we present a
perturbative approach to study the properties of a general class of
interconnected networks as inter-network interactions are established. We
reveal multiple structural transitions for the algebraic connectivity of such
systems, between regimes in which each network layer keeps its independent
identity or drives diffusive processes over the whole system, thus generalizing
previous results reporting a single transition point. Furthermore we show that,
at first order in perturbation theory, the growth of the algebraic connectivity
of each layer depends only on the degree configuration of the interaction
network (projected on the respective Fiedler vector), and not on the actual
interaction topology. Our findings can have important implications in the
design of robust interconnected networked system, particularly in the presence
of network layers whose integrity is more crucial for the functioning of the
entire system. We finally show results of perturbation theory applied to the
adjacency matrix of the interconnected network, which can be useful to
characterize percolation processes on such systems.
| physics.soc-ph cond-mat.dis-nn cs.SI | many realworld systems can be modeled as interconnected multilayer networks namely a set of networks interacting with each other here we present a perturbative approach to study the properties of a general class of interconnected networks as internetwork interactions are established we reveal multiple structural transitions for the algebraic connectivity of such systems between regimes in which each network layer keeps its independent identity or drives diffusive processes over the whole system thus generalizing previous results reporting a single transition point furthermore we show that at first order in perturbation theory the growth of the algebraic connectivity of each layer depends only on the degree configuration of the interaction network projected on the respective fiedler vector and not on the actual interaction topology our findings can have important implications in the design of robust interconnected networked system particularly in the presence of network layers whose integrity is more crucial for the functioning of the entire system we finally show results of perturbation theory applied to the adjacency matrix of the interconnected network which can be useful to characterize percolation processes on such systems | [['many', 'realworld', 'systems', 'can', 'be', 'modeled', 'as', 'interconnected', 'multilayer', 'networks', 'namely', 'a', 'set', 'of', 'networks', 'interacting', 'with', 'each', 'other', 'here', 'we', 'present', 'a', 'perturbative', 'approach', 'to', 'study', 'the', 'properties', 'of', 'a', 'general', 'class', 'of', 'interconnected', 'networks', 'as', 'internetwork', 'interactions', 'are', 'established', 'we', 'reveal', 'multiple', 'structural', 'transitions', 'for', 'the', 'algebraic', 'connectivity', 'of', 'such', 'systems', 'between', 'regimes', 'in', 'which', 'each', 'network', 'layer', 'keeps', 'its', 'independent', 'identity', 'or', 'drives', 'diffusive', 'processes', 'over', 'the', 'whole', 'system', 'thus', 'generalizing', 'previous', 'results', 'reporting', 'a', 'single', 'transition', 'point', 'furthermore', 'we', 'show', 'that', 'at', 'first', 'order', 'in', 'perturbation', 'theory', 'the', 'growth', 'of', 'the', 'algebraic', 'connectivity', 'of', 'each', 'layer', 'depends', 'only', 'on', 'the', 'degree', 'configuration', 'of', 'the', 'interaction', 'network', 'projected', 'on', 'the', 'respective', 'fiedler', 'vector', 'and', 'not', 'on', 'the', 'actual', 'interaction', 'topology', 'our', 'findings', 'can', 'have', 'important', 'implications', 'in', 'the', 'design', 'of', 'robust', 'interconnected', 'networked', 'system', 'particularly', 'in', 'the', 'presence', 'of', 'network', 'layers', 'whose', 'integrity', 'is', 'more', 'crucial', 'for', 'the', 'functioning', 'of', 'the', 'entire', 'system', 'we', 'finally', 'show', 'results', 'of', 'perturbation', 'theory', 'applied', 'to', 'the', 'adjacency', 'matrix', 'of', 'the', 'interconnected', 'network', 'which', 'can', 'be', 'useful', 'to', 'characterize', 'percolation', 'processes', 'on', 'such', 'systems']] | [-0.1903538282959381, 0.06996187970775072, -0.028219126352259146, 0.01768825084411239, -0.022854274571389773, -0.1302511304275952, 0.036790434486751795, 0.3680165789466697, -0.3065492739580327, -0.2729951771067791, 0.10271992773972859, -0.2634386088052775, -0.23420928989771164, 0.16529336776151804, -0.0005867787893820819, 0.04465667000568416, 0.05063828926462212, 0.07507051530998973, -0.027122400487935974, -0.2253856643249298, 0.3657050466042806, 0.029918004379511042, 0.28588412221027487, 0.046520592887819706, 0.06622242338477018, 0.011539111852829085, 0.021709912937500925, 0.05890587271226804, -0.068855290945126, 0.13423398958106877, 0.25051881646281976, 0.10198326899998159, 0.2777764950700796, -0.46935236509991146, -0.25654374494642285, 0.08289203388601175, 0.15901674486218337, 0.09192236280704905, 0.014586401679231836, -0.3037199857517507, 0.09900176920291912, -0.15673915338595945, -0.1024151954499628, -0.08560584173690466, -0.022884921103339294, 0.062472366153445764, -0.26955893682093296, 0.03097668298789875, 0.057501779957941625, 0.04080887505138303, -0.05064380955513404, -0.07714746158526793, -0.06165773967596514, 0.18898891166356377, -0.022552726799215043, -0.022808734651990844, 0.15348789808365818, -0.12873988092083055, -0.12553631176897248, 0.35442808826703354, -0.014023544188891665, -0.17677137031871318, 0.22100562245020125, -0.10576500945732181, -0.17142265621073993, 0.08033999242906362, 0.23747597920550592, 0.10227226649151473, -0.14135751602000715, 0.04615165941023441, -0.04550434455092325, 0.17323740547643135, 0.004050085579345379, 0.05411924989486897, 0.18726443366244272, 0.2384319806654678, 0.07544882589273022, 0.1390353223182327, -0.039663387915435055, -0.1310636989449156, -0.2670993598338975, -0.11654604141615697, -0.17674276111342135, 0.041669015015702554, -0.14210304119641692, -0.1840449327328166, 0.4299981283186808, 0.17559538643471287, 0.20470357358282626, 0.04170766533123421, 0.2654249127260842, 0.08899277571184482, 0.08187165671369173, 0.05841475912456304, 0.23064500225651907, 0.14610183464434465, 0.09592128311388215, -0.16877442841479157, 0.12578529354103438, 0.040589674345416125] |
1,802.09898 | Field theoretic renormalization study of interaction corrections to the
universal ac conductivity of graphene | The two-loop interaction correction coefficient to the universal ac
conductivity of disorder-free intrinsic graphene is computed with the help of a
field theoretic renormalization study using the BPHZ prescription. Non-standard
Ward identities imply that divergent subgraphs (related to Fermi velocity
renormalization) contribute to the renormalized optical conductivity.
Proceeding either via density-density or via current-current correlation
functions, a single well-defined value is obtained: $\mathcal{C}= (19-6\pi)/12)
= 0.01$ in agreement with the result first obtained by Mishchenko and which is
compatible with experimental uncertainties.
| cond-mat.mes-hall hep-ph hep-th | the twoloop interaction correction coefficient to the universal ac conductivity of disorderfree intrinsic graphene is computed with the help of a field theoretic renormalization study using the bphz prescription nonstandard ward identities imply that divergent subgraphs related to fermi velocity renormalization contribute to the renormalized optical conductivity proceeding either via densitydensity or via currentcurrent correlation functions a single welldefined value is obtained mathcalc 196pi12 001 in agreement with the result first obtained by mishchenko and which is compatible with experimental uncertainties | [['the', 'twoloop', 'interaction', 'correction', 'coefficient', 'to', 'the', 'universal', 'ac', 'conductivity', 'of', 'disorderfree', 'intrinsic', 'graphene', 'is', 'computed', 'with', 'the', 'help', 'of', 'a', 'field', 'theoretic', 'renormalization', 'study', 'using', 'the', 'bphz', 'prescription', 'nonstandard', 'ward', 'identities', 'imply', 'that', 'divergent', 'subgraphs', 'related', 'to', 'fermi', 'velocity', 'renormalization', 'contribute', 'to', 'the', 'renormalized', 'optical', 'conductivity', 'proceeding', 'either', 'via', 'densitydensity', 'or', 'via', 'currentcurrent', 'correlation', 'functions', 'a', 'single', 'welldefined', 'value', 'is', 'obtained', 'mathcalc', '196pi12', '001', 'in', 'agreement', 'with', 'the', 'result', 'first', 'obtained', 'by', 'mishchenko', 'and', 'which', 'is', 'compatible', 'with', 'experimental', 'uncertainties']] | [-0.15655681837233715, 0.15007638643728569, -0.10137419943930581, 0.05296460245008348, -0.0760582953458652, -0.16210991299012675, 0.06494902599952183, 0.35709234644891696, -0.25300458234269174, -0.23325357339344918, 0.016547770173929166, -0.3302056660759263, -0.13410847591876518, 0.18185925936850253, 0.014267824334092438, 0.05523591918754391, 0.044245453039184215, -0.014863315678667277, -0.11513610687979962, -0.19699575126869603, 0.34263302882318386, 0.031033892143750564, 0.28299389203020836, 0.13451986156287604, 0.0383327342744451, 0.046190842340001835, -0.0600352990149986, 0.07671903449809178, -0.14808949852349543, 0.09113545754225924, 0.2186062906679581, -0.07844210065668449, 0.14648996632313355, -0.37285171013791113, -0.17077917566493853, 0.029163672897266225, 0.13702225380111485, 0.10382498247054173, -0.02156995579134673, -0.2707110273069702, 0.02658001822856022, -0.1950754882331239, -0.16280387816659642, -0.11372295815963299, -0.03456786797469249, -0.06133535352128092, -0.2735953631810844, 0.17480240351869725, -0.06567388986004516, 0.04419901102082804, -0.0537142788991332, -0.12412391815596494, -0.057752478547627106, 0.09731801509333309, 0.07128884777484927, 0.1356050787406275, 0.1665280356828589, -0.1616551938961493, -0.0911175818175252, 0.36711415118770674, -0.11687342275399715, -0.153712358197663, 0.10339672711561435, -0.16085457752342336, -0.09658745173364877, 0.1447366659063846, 0.04207389707735274, 0.05727721088915132, -0.2039104269584641, 0.10754936564699165, -0.032063122879480946, 0.13491535245848355, 0.0507061158772558, 0.023576654056432743, 0.1702026216313243, 0.04428148578736, -0.012352208892116323, 0.12031609988771379, 0.00032894760370254516, -0.04398770672851242, -0.3353162399260327, -0.09340100183908362, -0.2082605685456656, 0.11308535920106806, -0.12771449735719215, -0.20592771820811323, 0.37668135077692566, 0.16932778764748946, 0.20006286846473814, 0.0867406460638449, 0.2740867555025034, 0.20175849593942985, 0.1424353128997609, 0.03890085577731952, 0.24922325790394098, 0.1872971314820461, 0.06584925628267228, -0.30967285242513753, 0.02580641522654332, 0.16285554770147428] |
1,802.09899 | A Kolmogorov-Smirnov type test for two inter-dependent random variables | Consider $n$ iid random variables, where $\xi_1, \ldots, \xi_n$ are $n$
realisations of a random variable $\xi$ and $\zeta_1, \ldots, \zeta_n$ are $n$
realisations of a random variable $\zeta$. The distribution of each realisation
of $\xi$, that is the distribution of \emph{one} $\xi_i$, depends on the value
of the corresponding $\zeta_i$, that is the probability $P\left(\xi_i\leq
x\right)=F(x,\zeta_i)$. We develop a statistical test to see if the $\xi_1,
\ldots, \xi_n$ are distributed according to the distribution function
$F(x,\zeta_i)$. We call this new statistical test the condition
Kolmogorov-Smirnov test.
| math.PR math.ST physics.data-an stat.AP stat.TH | consider n iid random variables where xi_1 ldots xi_n are n realisations of a random variable xi and zeta_1 ldots zeta_n are n realisations of a random variable zeta the distribution of each realisation of xi that is the distribution of emphone xi_i depends on the value of the corresponding zeta_i that is the probability pleftxi_ileq xrightfxzeta_i we develop a statistical test to see if the xi_1 ldots xi_n are distributed according to the distribution function fxzeta_i we call this new statistical test the condition kolmogorovsmirnov test | [['consider', 'n', 'iid', 'random', 'variables', 'where', 'xi_1', 'ldots', 'xi_n', 'are', 'n', 'realisations', 'of', 'a', 'random', 'variable', 'xi', 'and', 'zeta_1', 'ldots', 'zeta_n', 'are', 'n', 'realisations', 'of', 'a', 'random', 'variable', 'zeta', 'the', 'distribution', 'of', 'each', 'realisation', 'of', 'xi', 'that', 'is', 'the', 'distribution', 'of', 'emphone', 'xi_i', 'depends', 'on', 'the', 'value', 'of', 'the', 'corresponding', 'zeta_i', 'that', 'is', 'the', 'probability', 'pleftxi_ileq', 'xrightfxzeta_i', 'we', 'develop', 'a', 'statistical', 'test', 'to', 'see', 'if', 'the', 'xi_1', 'ldots', 'xi_n', 'are', 'distributed', 'according', 'to', 'the', 'distribution', 'function', 'fxzeta_i', 'we', 'call', 'this', 'new', 'statistical', 'test', 'the', 'condition', 'kolmogorovsmirnov', 'test']] | [-0.20058359088198768, 0.23676324779184402, -0.0956286870142711, 0.01737739706073799, -0.017064936680807954, -0.1962622157464336, 0.023067798066352094, 0.3393795902707747, -0.2650481489974828, -0.1924313598401135, 0.040599443816712925, -0.31087788611295675, -0.06333898951803955, 0.12902528776820482, -0.041828194622039086, 0.047882718610621634, -0.03962047727933774, 0.10525629362313166, -0.01587353603515242, -0.28508112235050204, 0.2986893145758326, -0.032922736036458185, 0.24420577522722028, -0.12707026081071013, 0.10700080577018005, 0.01327864024122911, -0.006309437632028546, -0.04617647404051067, -0.19278562755321868, 0.025597075953902232, 0.15294598442103183, 0.14638238692367894, 0.3204439143162398, -0.30253760111407335, -0.11300669123773419, 0.22095935128717906, 0.1719319889310836, -0.060868267668411136, 0.0667946822206778, -0.23835778404914199, 0.12271027296637407, -0.09830906879921843, -0.14736050329658956, -0.013472653271275618, 0.09566993378324523, 0.13764203930761487, -0.4576371359261906, 0.09966998603028644, 0.03537138630746908, 0.0313023412877339, 0.053774788382551855, -0.23172414358261795, 0.016733980693277858, 0.07001039018255792, 0.0648758325079966, 0.0673406339760515, 0.10866547124238596, -0.05242801405395204, -0.0629045673912125, 0.357245162761371, -0.046437938819595036, -0.26758713576765286, 0.04038450364134319, -0.18643522421119824, -0.20208463101049087, 0.015937939219708954, 0.15990630179155796, 0.1583525478573782, -0.10701376123220793, 0.156250428063989, -0.1225140455085022, 0.16825073331572293, 0.0427910189443667, 0.01148584753363615, 0.15426484903409368, 0.06716733969127138, 0.029648669360626843, 0.12601393771668276, -0.10736677548681785, -0.08352010355641444, -0.4157191506986107, -0.14952958078079281, -0.29928802024750484, 0.1466295380322706, -0.2368678824830221, -0.18980810361071712, 0.308271187069338, 0.19082525470072315, 0.2853213436402647, 0.15447776816740988, 0.15636005260568622, 0.14520869332010902, -0.06645164799383133, 0.06795389394808028, 0.030813488189042323, 0.17243327235060169, -0.026949675592948637, -0.12803960111480028, 0.09956599085126072, 0.06621353861243863] |
1,802.099 | Query-Free Attacks on Industry-Grade Face Recognition Systems under
Resource Constraints | To launch black-box attacks against a Deep Neural Network (DNN) based Face
Recognition (FR) system, one needs to build \textit{substitute} models to
simulate the target model, so the adversarial examples discovered from
substitute models could also mislead the target model. Such
\textit{transferability} is achieved in recent studies through querying the
target model to obtain data for training the substitute models. A real-world
target, likes the FR system of law enforcement, however, is less accessible to
the adversary. To attack such a system, a substitute model with similar quality
as the target model is needed to identify their common defects. This is hard
since the adversary often does not have the enough resources to train such a
powerful model (hundreds of millions of images and rooms of GPUs are needed to
train a commercial FR system).
We found in our research, however, that a resource-constrained adversary
could still effectively approximate the target model's capability to recognize
\textit{specific} individuals, by training \textit{biased} substitute models on
additional images of those victims whose identities the attacker want to cover
or impersonate. This is made possible by a new property we discovered, called
\textit{Nearly Local Linearity} (NLL), which models the observation that an
ideal DNN model produces the image representations (embeddings) whose distances
among themselves truthfully describe the human perception of the differences
among the input images. By simulating this property around the victim's images,
we significantly improve the transferability of black-box impersonation attacks
by nearly 50\%. Particularly, we successfully attacked a commercial system
trained over 20 million images, using 4 million images and 1/5 of the training
time but achieving 62\% transferability in an impersonation attack and 89\% in
a dodging attack.
| cs.LG cs.CV | to launch blackbox attacks against a deep neural network dnn based face recognition fr system one needs to build textitsubstitute models to simulate the target model so the adversarial examples discovered from substitute models could also mislead the target model such textittransferability is achieved in recent studies through querying the target model to obtain data for training the substitute models a realworld target likes the fr system of law enforcement however is less accessible to the adversary to attack such a system a substitute model with similar quality as the target model is needed to identify their common defects this is hard since the adversary often does not have the enough resources to train such a powerful model hundreds of millions of images and rooms of gpus are needed to train a commercial fr system we found in our research however that a resourceconstrained adversary could still effectively approximate the target models capability to recognize textitspecific individuals by training textitbiased substitute models on additional images of those victims whose identities the attacker want to cover or impersonate this is made possible by a new property we discovered called textitnearly local linearity nll which models the observation that an ideal dnn model produces the image representations embeddings whose distances among themselves truthfully describe the human perception of the differences among the input images by simulating this property around the victims images we significantly improve the transferability of blackbox impersonation attacks by nearly 50 particularly we successfully attacked a commercial system trained over 20 million images using 4 million images and 15 of the training time but achieving 62 transferability in an impersonation attack and 89 in a dodging attack | [['to', 'launch', 'blackbox', 'attacks', 'against', 'a', 'deep', 'neural', 'network', 'dnn', 'based', 'face', 'recognition', 'fr', 'system', 'one', 'needs', 'to', 'build', 'textitsubstitute', 'models', 'to', 'simulate', 'the', 'target', 'model', 'so', 'the', 'adversarial', 'examples', 'discovered', 'from', 'substitute', 'models', 'could', 'also', 'mislead', 'the', 'target', 'model', 'such', 'textittransferability', 'is', 'achieved', 'in', 'recent', 'studies', 'through', 'querying', 'the', 'target', 'model', 'to', 'obtain', 'data', 'for', 'training', 'the', 'substitute', 'models', 'a', 'realworld', 'target', 'likes', 'the', 'fr', 'system', 'of', 'law', 'enforcement', 'however', 'is', 'less', 'accessible', 'to', 'the', 'adversary', 'to', 'attack', 'such', 'a', 'system', 'a', 'substitute', 'model', 'with', 'similar', 'quality', 'as', 'the', 'target', 'model', 'is', 'needed', 'to', 'identify', 'their', 'common', 'defects', 'this', 'is', 'hard', 'since', 'the', 'adversary', 'often', 'does', 'not', 'have', 'the', 'enough', 'resources', 'to', 'train', 'such', 'a', 'powerful', 'model', 'hundreds', 'of', 'millions', 'of', 'images', 'and', 'rooms', 'of', 'gpus', 'are', 'needed', 'to', 'train', 'a', 'commercial', 'fr', 'system', 'we', 'found', 'in', 'our', 'research', 'however', 'that', 'a', 'resourceconstrained', 'adversary', 'could', 'still', 'effectively', 'approximate', 'the', 'target', 'models', 'capability', 'to', 'recognize', 'textitspecific', 'individuals', 'by', 'training', 'textitbiased', 'substitute', 'models', 'on', 'additional', 'images', 'of', 'those', 'victims', 'whose', 'identities', 'the', 'attacker', 'want', 'to', 'cover', 'or', 'impersonate', 'this', 'is', 'made', 'possible', 'by', 'a', 'new', 'property', 'we', 'discovered', 'called', 'textitnearly', 'local', 'linearity', 'nll', 'which', 'models', 'the', 'observation', 'that', 'an', 'ideal', 'dnn', 'model', 'produces', 'the', 'image', 'representations', 'embeddings', 'whose', 'distances', 'among', 'themselves', 'truthfully', 'describe', 'the', 'human', 'perception', 'of', 'the', 'differences', 'among', 'the', 'input', 'images', 'by', 'simulating', 'this', 'property', 'around', 'the', 'victims', 'images', 'we', 'significantly', 'improve', 'the', 'transferability', 'of', 'blackbox', 'impersonation', 'attacks', 'by', 'nearly', '50', 'particularly', 'we', 'successfully', 'attacked', 'a', 'commercial', 'system', 'trained', 'over', '20', 'million', 'images', 'using', '4', 'million', 'images', 'and', '15', 'of', 'the', 'training', 'time', 'but', 'achieving', '62', 'transferability', 'in', 'an', 'impersonation', 'attack', 'and', '89', 'in', 'a', 'dodging', 'attack']] | [-0.0684545559837609, -0.000132759254244105, -0.04938335273919743, 0.11193921529319506, -0.1059581050444599, -0.24714977100095797, 0.07318711477406868, 0.39656477411287827, -0.26263179877199805, -0.3950788586540318, 0.09211914849743902, -0.31043504884862255, -0.14174181381803375, 0.17233212390358496, -0.1335896572143764, 0.08604776501167744, 0.06787252512797987, 0.05844750950767935, -0.007556296664336185, -0.32663166198040267, 0.26918350448473716, 0.07858517077815849, 0.28494771186308426, -0.01789017895154737, 0.09318351147239243, -0.05485340287557534, 0.009017113331814498, -0.028391938429921115, -0.029803792129907393, 0.12715352079408898, 0.3013804485339272, 0.20256765958923, 0.3129703348695263, -0.4326432870512047, -0.22034208905361183, 0.12963789978299986, 0.1125273456176122, 0.12983248721349358, -0.04043618705756485, -0.3394128193817828, 0.11261243586029325, -0.21205518356287312, -0.07045811535995249, -0.10723632147395813, -0.006608462039613243, -0.012282865969702983, -0.27118815309555705, -0.03115242470951108, 0.06763388050699627, 0.061273700409251584, -0.0365287084320062, -0.04471268657818368, -0.009812864640406965, 0.1708574148275354, 0.04057616530533798, 0.04499922881342962, 0.17072035305115868, -0.1982682872590892, -0.10874150387282677, 0.3842200784203716, -0.02289193525531708, -0.18335143520476316, 0.209797549718179, -0.037215634454689894, -0.11441428850374215, 0.13036686345238083, 0.22809853987775117, 0.12021968843754498, -0.1839235934706903, -0.0015820912688871635, -0.04972506247054881, 0.23254802785754108, 0.04561405324192902, -0.011753548280380312, 0.1781841166366076, 0.19151679028657984, 0.019806750455611956, 0.14126409162108824, -0.12936386620649734, -0.025826119641464668, -0.21592107732463015, -0.10091255792274205, -0.18778066037029997, 0.044598773154295765, -0.06807454672093877, -0.13344102861065904, 0.3916023415598623, 0.23537487393047238, 0.2003535566588816, 0.0864459439935572, 0.3481132911258947, -0.019255758543761495, 0.15524654446473352, 0.09815749733951011, 0.21158283800799263, -0.015927486950633944, 0.09569723732025796, -0.10856428270351019, 0.14751445815596564, 0.005021212808446679] |
1,802.09901 | Learning to recognize touch gestures: recurrent vs. convolutional
features and dynamic sampling | We propose a fully automatic method for learning gestures on big touch
devices in a potentially multi-user context. The goal is to learn general
models capable of adapting to different gestures, user styles and hardware
variations (e.g. device sizes, sampling frequencies and regularities).
Based on deep neural networks, our method features a novel dynamic sampling
and temporal normalization component, transforming variable length gestures
into fixed length representations while preserving finger/surface contact
transitions, that is, the topology of the signal. This sequential
representation is then processed with a convolutional model capable, unlike
recurrent networks, of learning hierarchical representations with different
levels of abstraction.
To demonstrate the interest of the proposed method, we introduce a new touch
gestures dataset with 6591 gestures performed by 27 people, which is, up to our
knowledge, the first of its kind: a publicly available multi-touch gesture
dataset for interaction.
We also tested our method on a standard dataset of symbolic touch gesture
recognition, the MMG dataset, outperforming the state of the art and reporting
close to perfect performance.
| cs.LG stat.ML | we propose a fully automatic method for learning gestures on big touch devices in a potentially multiuser context the goal is to learn general models capable of adapting to different gestures user styles and hardware variations eg device sizes sampling frequencies and regularities based on deep neural networks our method features a novel dynamic sampling and temporal normalization component transforming variable length gestures into fixed length representations while preserving fingersurface contact transitions that is the topology of the signal this sequential representation is then processed with a convolutional model capable unlike recurrent networks of learning hierarchical representations with different levels of abstraction to demonstrate the interest of the proposed method we introduce a new touch gestures dataset with 6591 gestures performed by 27 people which is up to our knowledge the first of its kind a publicly available multitouch gesture dataset for interaction we also tested our method on a standard dataset of symbolic touch gesture recognition the mmg dataset outperforming the state of the art and reporting close to perfect performance | [['we', 'propose', 'a', 'fully', 'automatic', 'method', 'for', 'learning', 'gestures', 'on', 'big', 'touch', 'devices', 'in', 'a', 'potentially', 'multiuser', 'context', 'the', 'goal', 'is', 'to', 'learn', 'general', 'models', 'capable', 'of', 'adapting', 'to', 'different', 'gestures', 'user', 'styles', 'and', 'hardware', 'variations', 'eg', 'device', 'sizes', 'sampling', 'frequencies', 'and', 'regularities', 'based', 'on', 'deep', 'neural', 'networks', 'our', 'method', 'features', 'a', 'novel', 'dynamic', 'sampling', 'and', 'temporal', 'normalization', 'component', 'transforming', 'variable', 'length', 'gestures', 'into', 'fixed', 'length', 'representations', 'while', 'preserving', 'fingersurface', 'contact', 'transitions', 'that', 'is', 'the', 'topology', 'of', 'the', 'signal', 'this', 'sequential', 'representation', 'is', 'then', 'processed', 'with', 'a', 'convolutional', 'model', 'capable', 'unlike', 'recurrent', 'networks', 'of', 'learning', 'hierarchical', 'representations', 'with', 'different', 'levels', 'of', 'abstraction', 'to', 'demonstrate', 'the', 'interest', 'of', 'the', 'proposed', 'method', 'we', 'introduce', 'a', 'new', 'touch', 'gestures', 'dataset', 'with', '6591', 'gestures', 'performed', 'by', '27', 'people', 'which', 'is', 'up', 'to', 'our', 'knowledge', 'the', 'first', 'of', 'its', 'kind', 'a', 'publicly', 'available', 'multitouch', 'gesture', 'dataset', 'for', 'interaction', 'we', 'also', 'tested', 'our', 'method', 'on', 'a', 'standard', 'dataset', 'of', 'symbolic', 'touch', 'gesture', 'recognition', 'the', 'mmg', 'dataset', 'outperforming', 'the', 'state', 'of', 'the', 'art', 'and', 'reporting', 'close', 'to', 'perfect', 'performance']] | [-0.07845863991291725, 0.02608483384788167, -0.07645739582149388, 0.02576198039388513, -0.15730504308519502, -0.2196205875656584, 0.05016376273652092, 0.44165027904057363, -0.2602853767018308, -0.3301886809902669, 0.04920729228407036, -0.2838415414182066, -0.17944646241519144, 0.21170203062455165, -0.1265631702657767, 0.07369802724699387, 0.14529409125577986, 0.08999518638719091, -0.0373801763852982, -0.25333936975544524, 0.30364557447821466, 0.015153561131749574, 0.33760384821648876, 0.002594444140987961, 0.17828737924757757, -0.014836980013601613, -0.027841340113235146, -0.04931703169710324, -0.046274806700154325, 0.19075467705312021, 0.3059960440337042, 0.18160462877386363, 0.30235825901393565, -0.39341496344116567, -0.21939405825871386, 0.04161888246876542, 0.10901912330737956, 0.09965565449582707, -0.04528236230059216, -0.40332621916562145, 0.108116602273903, -0.1745809458301005, 0.008912764339961727, -0.11123871318015613, -0.004204360923419396, -0.028930434222232376, -0.2699162739421628, 0.004047366541133627, 0.06490077105982567, 0.11176753086609799, -0.05218375734727876, -0.09562822202511938, 0.04380957963971737, 0.19520129852149395, 6.358229762150182e-06, 0.02290966772959072, 0.15869425547347343, -0.17084712349014541, -0.15315274027317807, 0.3403414417363224, -0.04644772338501194, -0.22969929817846121, 0.21618270519739616, -0.024654908312691584, -0.16099031467252134, 0.10170840327382873, 0.24423791094525168, 0.1309448883076313, -0.1663792832531253, -0.0033840905284040677, -0.021585174934252313, 0.23100220819265305, 0.06489827263316042, -0.023535914265357328, 0.18156165293722865, 0.28488569327613766, 0.007682364722659365, 0.1343507375132445, -0.13568141147336374, -0.04111608350581397, -0.20048201384161712, -0.09040948638028046, -0.18827336270645348, -0.05347584704568947, -0.11589569873169707, -0.14350410517720757, 0.4491829574652757, 0.23363950138922499, 0.18267488019943934, 0.14639016001945504, 0.3769359048020247, 0.017572443860811752, 0.13840225498377187, 0.07945661056699635, 0.12606621349205901, -0.012171969629214173, 0.13817969568438654, -0.17469834855060523, 0.07675844953090431, 0.05943123685629706] |
1,802.09902 | Attention-Based Guided Structured Sparsity of Deep Neural Networks | Network pruning is aimed at imposing sparsity in a neural network
architecture by increasing the portion of zero-valued weights for reducing its
size regarding energy-efficiency consideration and increasing evaluation speed.
In most of the conducted research efforts, the sparsity is enforced for network
pruning without any attention to the internal network characteristics such as
unbalanced outputs of the neurons or more specifically the distribution of the
weights and outputs of the neurons. That may cause severe accuracy drop due to
uncontrolled sparsity. In this work, we propose an attention mechanism that
simultaneously controls the sparsity intensity and supervised network pruning
by keeping important information bottlenecks of the network to be active. On
CIFAR-10, the proposed method outperforms the best baseline method by 6% and
reduced the accuracy drop by 2.6x at the same level of sparsity.
| cs.LG stat.ML | network pruning is aimed at imposing sparsity in a neural network architecture by increasing the portion of zerovalued weights for reducing its size regarding energyefficiency consideration and increasing evaluation speed in most of the conducted research efforts the sparsity is enforced for network pruning without any attention to the internal network characteristics such as unbalanced outputs of the neurons or more specifically the distribution of the weights and outputs of the neurons that may cause severe accuracy drop due to uncontrolled sparsity in this work we propose an attention mechanism that simultaneously controls the sparsity intensity and supervised network pruning by keeping important information bottlenecks of the network to be active on cifar10 the proposed method outperforms the best baseline method by 6 and reduced the accuracy drop by 26x at the same level of sparsity | [['network', 'pruning', 'is', 'aimed', 'at', 'imposing', 'sparsity', 'in', 'a', 'neural', 'network', 'architecture', 'by', 'increasing', 'the', 'portion', 'of', 'zerovalued', 'weights', 'for', 'reducing', 'its', 'size', 'regarding', 'energyefficiency', 'consideration', 'and', 'increasing', 'evaluation', 'speed', 'in', 'most', 'of', 'the', 'conducted', 'research', 'efforts', 'the', 'sparsity', 'is', 'enforced', 'for', 'network', 'pruning', 'without', 'any', 'attention', 'to', 'the', 'internal', 'network', 'characteristics', 'such', 'as', 'unbalanced', 'outputs', 'of', 'the', 'neurons', 'or', 'more', 'specifically', 'the', 'distribution', 'of', 'the', 'weights', 'and', 'outputs', 'of', 'the', 'neurons', 'that', 'may', 'cause', 'severe', 'accuracy', 'drop', 'due', 'to', 'uncontrolled', 'sparsity', 'in', 'this', 'work', 'we', 'propose', 'an', 'attention', 'mechanism', 'that', 'simultaneously', 'controls', 'the', 'sparsity', 'intensity', 'and', 'supervised', 'network', 'pruning', 'by', 'keeping', 'important', 'information', 'bottlenecks', 'of', 'the', 'network', 'to', 'be', 'active', 'on', 'cifar10', 'the', 'proposed', 'method', 'outperforms', 'the', 'best', 'baseline', 'method', 'by', '6', 'and', 'reduced', 'the', 'accuracy', 'drop', 'by', '26x', 'at', 'the', 'same', 'level', 'of', 'sparsity']] | [-0.0891016543361783, 0.04623617656173284, 0.006007938659476007, 0.01721742379852324, -0.09684985254973393, -0.16262765967643217, 0.11024068264455042, 0.42285656794796095, -0.2635856451242409, -0.3369032072642928, 0.08651747699631789, -0.23288872439276448, -0.20792430090574165, 0.12669675964485472, -0.13547618939500192, 0.10450878671091392, 0.11174347852048573, 0.0522794962846948, -0.05908097952573478, -0.31347289699068126, 0.2963263904350563, 0.13985191342448267, 0.36121586458038485, 0.03763581508674713, 0.13182752435600645, -0.01776206423785291, -0.036937992580693815, -0.014043701941024183, -0.009772608019535682, 0.15376637224792777, 0.2564105757046491, 0.17281407037551297, 0.3859372951419038, -0.4481305221424383, -0.2548028783485814, 0.10934863098801169, 0.12675787491367801, 0.08291513424859766, 0.014452469175975077, -0.30706670672738895, 0.12750153507872977, -0.15408569583258427, -0.018207525053773734, -0.08363561894443325, -0.033324541979441964, 0.006378544247983133, -0.29074495380936083, 0.03855844458688379, 0.09815505411653944, 0.042288790450102705, -0.012422104273676215, -0.1373194984951303, -0.035393146469312554, 0.15843070128432693, 0.05800343124086366, 0.06283813692061813, 0.16715201878961286, -0.22452907289570087, -0.09344831049555283, 0.31974431401913, -0.033804837455082795, -0.22415564579526237, 0.1607091818141806, -0.04695184502120623, -0.13796031712691353, 0.15380293468307868, 0.24142746046623764, 0.014240660574561095, -0.11716817989123657, 0.007205366602112704, 0.0032679012100047923, 0.18983570459942498, 0.10783384207581334, 0.030944346244830417, 0.11694365484222277, 0.2818625438136651, 0.10279245525324608, 0.14906806924452265, -0.13315383598691208, -0.03145490371902911, -0.21101096154683652, -0.05639054427293184, -0.20688564532354256, -0.0425010064329185, -0.15959576851823573, -0.07391334220643758, 0.44341231295701994, 0.18613719013314145, 0.2327148788197733, 0.1154104747932733, 0.34072926196077946, 0.053943361406495305, 0.14907731668790802, 0.10863183920874316, 0.1925919553340303, 0.04055929607078296, 0.10468184150351376, -0.26039669829119433, 0.16462453863213716, 0.03189929655191543] |
1,802.09903 | $\epsilon'/\epsilon$ Anomaly and Neutron EDM in $SU(2)_L\times
SU(2)_R\times U(1)_{B-L}$ model with Charge Symmetry | The Standard Model prediction for $\epsilon'/\epsilon$ based on recent
lattice QCD results exhibits a tension with the experimental data. We solve
this tension through $W_R^+$ gauge boson exchange in the $SU(2)_L\times
SU(2)_R\times U(1)_{B-L}$ model with `charge symmetry', whose theoretical
motivation is to attribute the chiral structure of the Standard Model to the
spontaneous breaking of $SU(2)_R\times U(1)_{B-L}$ gauge group and charge
symmetry. We show that $M_{W_R}<58$ TeV is required to account for the
$\epsilon'/\epsilon$ anomaly in this model. Next, we make a prediction for the
neutron EDM in the same model and study a correlation between
$\epsilon'/\epsilon$ and the neutron EDM. We confirm that the model can solve
the $\epsilon'/\epsilon$ anomaly without conflicting the current bound on the
neutron EDM, and further reveal that almost all parameter regions in which the
$\epsilon'/\epsilon$ anomaly is explained will be covered by future neutron EDM
searches, which leads us to anticipate the discovery of the neutron EDM.
| hep-ph | the standard model prediction for epsilonepsilon based on recent lattice qcd results exhibits a tension with the experimental data we solve this tension through w_r gauge boson exchange in the su2_ltimes su2_rtimes u1_bl model with charge symmetry whose theoretical motivation is to attribute the chiral structure of the standard model to the spontaneous breaking of su2_rtimes u1_bl gauge group and charge symmetry we show that m_w_r58 tev is required to account for the epsilonepsilon anomaly in this model next we make a prediction for the neutron edm in the same model and study a correlation between epsilonepsilon and the neutron edm we confirm that the model can solve the epsilonepsilon anomaly without conflicting the current bound on the neutron edm and further reveal that almost all parameter regions in which the epsilonepsilon anomaly is explained will be covered by future neutron edm searches which leads us to anticipate the discovery of the neutron edm | [['the', 'standard', 'model', 'prediction', 'for', 'epsilonepsilon', 'based', 'on', 'recent', 'lattice', 'qcd', 'results', 'exhibits', 'a', 'tension', 'with', 'the', 'experimental', 'data', 'we', 'solve', 'this', 'tension', 'through', 'w_r', 'gauge', 'boson', 'exchange', 'in', 'the', 'su2_ltimes', 'su2_rtimes', 'u1_bl', 'model', 'with', 'charge', 'symmetry', 'whose', 'theoretical', 'motivation', 'is', 'to', 'attribute', 'the', 'chiral', 'structure', 'of', 'the', 'standard', 'model', 'to', 'the', 'spontaneous', 'breaking', 'of', 'su2_rtimes', 'u1_bl', 'gauge', 'group', 'and', 'charge', 'symmetry', 'we', 'show', 'that', 'm_w_r58', 'tev', 'is', 'required', 'to', 'account', 'for', 'the', 'epsilonepsilon', 'anomaly', 'in', 'this', 'model', 'next', 'we', 'make', 'a', 'prediction', 'for', 'the', 'neutron', 'edm', 'in', 'the', 'same', 'model', 'and', 'study', 'a', 'correlation', 'between', 'epsilonepsilon', 'and', 'the', 'neutron', 'edm', 'we', 'confirm', 'that', 'the', 'model', 'can', 'solve', 'the', 'epsilonepsilon', 'anomaly', 'without', 'conflicting', 'the', 'current', 'bound', 'on', 'the', 'neutron', 'edm', 'and', 'further', 'reveal', 'that', 'almost', 'all', 'parameter', 'regions', 'in', 'which', 'the', 'epsilonepsilon', 'anomaly', 'is', 'explained', 'will', 'be', 'covered', 'by', 'future', 'neutron', 'edm', 'searches', 'which', 'leads', 'us', 'to', 'anticipate', 'the', 'discovery', 'of', 'the', 'neutron', 'edm']] | [-0.10686115553188655, 0.1894658029694232, -0.039235428793224954, 0.12092645610971803, -0.10805130058144724, -0.1247244634835987, 0.08855298539666227, 0.3425672567431249, -0.2366337191703078, -0.31799963902182926, 0.051873855292036204, -0.3069712551846321, -0.07541947563184924, 0.11260669264528486, 0.026054019254504467, 0.03284009119946193, 0.020416804315412745, 0.06738431131607225, -0.09213420643404223, -0.21778321187208777, 0.2545853060323234, 0.056755935742818064, 0.2771882367825586, 0.15310333417789415, 0.03633947047219289, -0.005855404336638505, -0.0037369444278476673, -0.04246987585660095, -0.08586180904548991, 0.10527177974946943, 0.1714916592950817, 0.06618075626689235, 0.0663524718812113, -0.43232375164546705, -0.1952168047915097, 0.13537941756810434, 0.10915097306951199, 0.13592522599722193, -0.09132583740203842, -0.332392309725382, 0.08817188138122445, -0.23091214771680776, -0.08417543422984677, -0.107056763563366, -0.04880001026150935, -0.09500868882363041, -0.35522732567658427, 0.0992973655937057, 0.0005529322083187259, -0.0009978459965364606, -0.06932513756994037, -0.14527363927572284, 0.01665903469912854, 0.008453610691004525, 0.18586214063567372, 0.09277613476996183, 0.12757407519905492, -0.1795590378745806, -0.18497652067076964, 0.41580392467923266, -0.07794121418489156, -0.14785464226992595, 0.10219633260900093, -0.18746958147990062, -0.20701740635863317, 0.08557475859670614, 0.15511061459950176, 0.06784764779549018, -0.1658181106565928, 0.1447007132471947, -0.08897737907306626, 0.1988227732146305, -0.0035074276962238395, -0.028845966400980364, 0.2865421964963472, 0.2407089570184159, 0.05181558575371609, 0.04644146920075287, -0.10163759024132019, -0.09015269986859042, -0.3641880759391081, -0.11061388227877092, -0.10347946890054599, 0.05231010884935268, -0.07805526650585295, -0.06774161217332471, 0.3571217502680382, 0.20751174525936056, 0.2137698590621547, 0.027119998363595382, 0.28193578328876423, 0.07939311369547462, 0.14330233301544332, -0.017483055722455378, 0.3151342066315313, 0.12067242000964196, 0.053966526304268174, -0.31050123627072357, 0.02169899393582193, 0.09778387167375364] |
1,802.09904 | Algorithmic Causal Deconvolution of Intertwined Programs and Networks by
Generative Mechanism | Complex data usually results from the interaction of objects produced by
different generating mechanisms. Here we introduce a universal, unsupervised
and parameter-free model-oriented approach, based upon the seminal concept of
algorithmic probability, that decomposes an observation into its most likely
algorithmic generative sources. Our approach uses a causal calculus to infer
model representations. We demonstrate its ability to deconvolve interacting
mechanisms regardless of whether the resultant objects are strings, space-time
evolution diagrams, images or networks. While this is mostly a conceptual
contribution and a novel framework, we provide numerical evidence evaluating
the ability of our methods to separate data from observations produced by
discrete dynamical systems such as cellular automata and complex networks. We
think that these separating techniques can contribute to tackling the challenge
of causation, thus complementing other statistically oriented approaches.
| cs.AI nlin.CG | complex data usually results from the interaction of objects produced by different generating mechanisms here we introduce a universal unsupervised and parameterfree modeloriented approach based upon the seminal concept of algorithmic probability that decomposes an observation into its most likely algorithmic generative sources our approach uses a causal calculus to infer model representations we demonstrate its ability to deconvolve interacting mechanisms regardless of whether the resultant objects are strings spacetime evolution diagrams images or networks while this is mostly a conceptual contribution and a novel framework we provide numerical evidence evaluating the ability of our methods to separate data from observations produced by discrete dynamical systems such as cellular automata and complex networks we think that these separating techniques can contribute to tackling the challenge of causation thus complementing other statistically oriented approaches | [['complex', 'data', 'usually', 'results', 'from', 'the', 'interaction', 'of', 'objects', 'produced', 'by', 'different', 'generating', 'mechanisms', 'here', 'we', 'introduce', 'a', 'universal', 'unsupervised', 'and', 'parameterfree', 'modeloriented', 'approach', 'based', 'upon', 'the', 'seminal', 'concept', 'of', 'algorithmic', 'probability', 'that', 'decomposes', 'an', 'observation', 'into', 'its', 'most', 'likely', 'algorithmic', 'generative', 'sources', 'our', 'approach', 'uses', 'a', 'causal', 'calculus', 'to', 'infer', 'model', 'representations', 'we', 'demonstrate', 'its', 'ability', 'to', 'deconvolve', 'interacting', 'mechanisms', 'regardless', 'of', 'whether', 'the', 'resultant', 'objects', 'are', 'strings', 'spacetime', 'evolution', 'diagrams', 'images', 'or', 'networks', 'while', 'this', 'is', 'mostly', 'a', 'conceptual', 'contribution', 'and', 'a', 'novel', 'framework', 'we', 'provide', 'numerical', 'evidence', 'evaluating', 'the', 'ability', 'of', 'our', 'methods', 'to', 'separate', 'data', 'from', 'observations', 'produced', 'by', 'discrete', 'dynamical', 'systems', 'such', 'as', 'cellular', 'automata', 'and', 'complex', 'networks', 'we', 'think', 'that', 'these', 'separating', 'techniques', 'can', 'contribute', 'to', 'tackling', 'the', 'challenge', 'of', 'causation', 'thus', 'complementing', 'other', 'statistically', 'oriented', 'approaches']] | [-0.060311769765514625, 0.06719382388853815, -0.13393991077808956, 0.10086098358147126, -0.12455177103008207, -0.12453887515781882, 0.07180216281037581, 0.3888144958624266, -0.28838071210005256, -0.3124752363043004, 0.04010027898055382, -0.26591628161083936, -0.21530671486161873, 0.18582264218073255, -0.07689795527551183, 0.01749670871312877, 0.07054905058672525, -0.026745822002080137, -0.02500277266074392, -0.20614586486060985, 0.34031580924844246, 0.0369070212468785, 0.31041015160122987, 0.025056028738617897, 0.11579779203091853, -0.027857838527656588, -0.10183857811993002, 0.021749649357918958, -0.07581377660042056, 0.17931387741888935, 0.2863660462947275, 0.21618059613913493, 0.2681337124265422, -0.4461189598769398, -0.24663973163946398, 0.10427071204359986, 0.15617594005596033, 0.13149324019222444, -0.037800868878603205, -0.3187121906128705, 0.07816514485477141, -0.14109689087424904, -0.0761360468962615, -0.11697940807877094, -0.011613528162794174, -0.019024369352815772, -0.22811286823992105, 0.03597960073879003, 0.10453499598700826, 0.03484341675849786, -0.08045037900608845, -0.0957794308424332, 0.02276741337955446, 0.1425689070790138, 0.019413649252461817, 0.022988403679915052, 0.13904094097337552, -0.13657648511812148, -0.20676622522952862, 0.3684307920249333, -0.01417802231074696, -0.19689467915550882, 0.2532426740368478, -0.04013475133596282, -0.1764158084953582, 0.12457664546913895, 0.20077537404219234, 0.12440606231426582, -0.18395328764712676, 0.029914948272193202, -0.006339360620210269, 0.1682524703595353, -0.0020293120217782664, 0.019028604300202506, 0.24361978608045265, 0.20512370386377984, -0.017780675104630172, 0.12386836149577486, -0.06915221203738277, -0.10633198344988987, -0.2406592316141254, -0.10928237461528734, -0.160189791034585, 0.024805370882797734, -0.07425495467459016, -0.1602587237270528, 0.38128464733411493, 0.21806873481272532, 0.19838850390007615, 0.0860129443165335, 0.3430960439705759, 0.055187089938085694, 0.06731680639375254, 0.05850808413811308, 0.17029349146414324, 0.10362451407302142, 0.06985918040513377, -0.1491852669934637, 0.09232130088962447, 0.05971208246270741] |
1,802.09905 | Instance Optimal Decoding and the Restricted Isometry Property | In this paper, we address the question of information preservation in
ill-posed, non-linear inverse problems, assuming that the measured data is
close to a low-dimensional model set. We provide necessary and sufficient
conditions for the existence of a so-called instance optimal decoder, i.e.,
that is robust to noise and modelling error. Inspired by existing results in
compressive sensing, our analysis is based on a (Lower) Restricted Isometry
Property (LRIP), formulated in a non-linear fashion. We also provide sufficient
conditions for non-uniform recovery with random measurement operators, with a
new formulation of the LRIP. We finish by describing typical strategies to
prove the LRIP in both linear and non-linear cases, and illustrate our results
by studying the invertibility of a one-layer neural net with random weights.
| cs.IT cs.LG math.IT | in this paper we address the question of information preservation in illposed nonlinear inverse problems assuming that the measured data is close to a lowdimensional model set we provide necessary and sufficient conditions for the existence of a socalled instance optimal decoder ie that is robust to noise and modelling error inspired by existing results in compressive sensing our analysis is based on a lower restricted isometry property lrip formulated in a nonlinear fashion we also provide sufficient conditions for nonuniform recovery with random measurement operators with a new formulation of the lrip we finish by describing typical strategies to prove the lrip in both linear and nonlinear cases and illustrate our results by studying the invertibility of a onelayer neural net with random weights | [['in', 'this', 'paper', 'we', 'address', 'the', 'question', 'of', 'information', 'preservation', 'in', 'illposed', 'nonlinear', 'inverse', 'problems', 'assuming', 'that', 'the', 'measured', 'data', 'is', 'close', 'to', 'a', 'lowdimensional', 'model', 'set', 'we', 'provide', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'existence', 'of', 'a', 'socalled', 'instance', 'optimal', 'decoder', 'ie', 'that', 'is', 'robust', 'to', 'noise', 'and', 'modelling', 'error', 'inspired', 'by', 'existing', 'results', 'in', 'compressive', 'sensing', 'our', 'analysis', 'is', 'based', 'on', 'a', 'lower', 'restricted', 'isometry', 'property', 'lrip', 'formulated', 'in', 'a', 'nonlinear', 'fashion', 'we', 'also', 'provide', 'sufficient', 'conditions', 'for', 'nonuniform', 'recovery', 'with', 'random', 'measurement', 'operators', 'with', 'a', 'new', 'formulation', 'of', 'the', 'lrip', 'we', 'finish', 'by', 'describing', 'typical', 'strategies', 'to', 'prove', 'the', 'lrip', 'in', 'both', 'linear', 'and', 'nonlinear', 'cases', 'and', 'illustrate', 'our', 'results', 'by', 'studying', 'the', 'invertibility', 'of', 'a', 'onelayer', 'neural', 'net', 'with', 'random', 'weights']] | [-0.08874238805659115, 0.05730265787616372, -0.05332605711743236, 0.06154136351495981, -0.07229820842854678, -0.16835101842135192, 0.042081534950993954, 0.37196682158112526, -0.2892393144108355, -0.25691445129737256, 0.1690509779928252, -0.20836466721072794, -0.210982582045719, 0.190221176719293, -0.13123959815409034, 0.12004857043921947, 0.08313261315971612, 0.012446987972129136, -0.1039775853380561, -0.23866007666662337, 0.3202630609795451, 0.0545026473402977, 0.28878831601142885, 0.030081332795321943, 0.13069828944350592, 0.026502194358035924, -0.03134292429313064, 0.036254849269156696, -0.13815978594555053, 0.14076996993646027, 0.25698628173768523, 0.1309015049109439, 0.3025837913304567, -0.4211126340702176, -0.21711266727000475, 0.11944336443021894, 0.0911789736226201, 0.11733573154360057, -0.08192097742017358, -0.2851569653451443, 0.14921160670369862, -0.08643517173826694, -0.08103043230623007, -0.10179367621615529, -0.02396863856911659, 0.011979026785120368, -0.3647266625147313, 0.093098908563843, 0.13440102329850198, 0.047436735688475895, -0.11394589330628514, -0.07325691995024682, 0.047172668555751446, 0.08401847882941366, 0.00510883079469204, -0.018660565768368543, 0.05999652120191604, -0.12941812706924974, -0.10986928868386894, 0.3605960803106427, -0.06404195773927494, -0.2502716173827648, 0.1586838305722922, -0.08329718868806958, -0.1386914836447686, 0.0793372336179018, 0.20220534539222718, 0.109949986115098, -0.1606542823165655, 0.06938928230665624, -0.08343625443056225, 0.14216076612472534, 0.03140220248326659, 0.03700386292859912, 0.11748446199158206, 0.18789600479323418, 0.12703314933087675, 0.17552526674699037, -0.0396052521225065, -0.06436843108944595, -0.29964686776697635, -0.0955710991229862, -0.16527504843845964, 0.031167861313559114, -0.08654023880092428, -0.1426504769846797, 0.3798850800096989, 0.1774403559938073, 0.21805723190307616, 0.09482790554873645, 0.2931502440199256, 0.13468691715982278, 0.01002447228692472, 0.09150108054187149, 0.21205618569254875, 0.15709058903716505, 0.07910515679139644, -0.18901302246376872, 0.05366877764463425, 0.08709091459214688] |
1,802.09906 | Streamer propagation in the atmosphere of Titan and other N2:CH4
mixtures compared to N2:O2 mixtures | Streamers, thin, ionized plasma channels, form the early stages of lightning
discharges. Here we approach the study of extraterrestrial lightning by
studying the formation and propagation of streamer discharges in various
nitrogen-methane and nitrogen-oxygen mixtures with levels of nitrogen from 20%
to 98.4%. We present the friction force and breakdown fields Ek in various
N2:O2 (Earth-like) and N2:CH4 (Titan-like) mixtures. The strength of the
friction force is larger in N2:CH4 mixtures whereas the breakdown field in
mixtures with methane is half as large as in mixtures with oxygen. We use a 2.5
dimensional Monte Carlo particle-in-cell code with cylindrical symmetry to
simulate the development of electron avalanches from an initial electron-ion
patch in ambient electric fields between 1.5Ek and 3Ek. We compare the electron
density, the electric field, the front velocities as well as the occurrence of
avalanche-to-streamer transition between mixtures with methane and with oxygen.
Whereas we observe the formation of streamers in oxygen in all considered
cases, we observe streamer inceptions in methane for small percentages of
nitrogen or for large electric fields only. For large percentages of nitrogen
or for small fields, ionization is not efficient enough to form a streamer
channel within the length of the simulation domain. In oxygen, positive and
negative streamers move faster for small percentages of nitrogen. In mixtures
with methane, electron or streamer fronts move 10-100 times slower than in
mixtures with oxygen; the higher the percentage of methane, the faster the
fronts move.
| physics.ao-ph physics.plasm-ph | streamers thin ionized plasma channels form the early stages of lightning discharges here we approach the study of extraterrestrial lightning by studying the formation and propagation of streamer discharges in various nitrogenmethane and nitrogenoxygen mixtures with levels of nitrogen from 20 to 984 we present the friction force and breakdown fields ek in various n2o2 earthlike and n2ch4 titanlike mixtures the strength of the friction force is larger in n2ch4 mixtures whereas the breakdown field in mixtures with methane is half as large as in mixtures with oxygen we use a 25 dimensional monte carlo particleincell code with cylindrical symmetry to simulate the development of electron avalanches from an initial electronion patch in ambient electric fields between 15ek and 3ek we compare the electron density the electric field the front velocities as well as the occurrence of avalanchetostreamer transition between mixtures with methane and with oxygen whereas we observe the formation of streamers in oxygen in all considered cases we observe streamer inceptions in methane for small percentages of nitrogen or for large electric fields only for large percentages of nitrogen or for small fields ionization is not efficient enough to form a streamer channel within the length of the simulation domain in oxygen positive and negative streamers move faster for small percentages of nitrogen in mixtures with methane electron or streamer fronts move 10100 times slower than in mixtures with oxygen the higher the percentage of methane the faster the fronts move | [['streamers', 'thin', 'ionized', 'plasma', 'channels', 'form', 'the', 'early', 'stages', 'of', 'lightning', 'discharges', 'here', 'we', 'approach', 'the', 'study', 'of', 'extraterrestrial', 'lightning', 'by', 'studying', 'the', 'formation', 'and', 'propagation', 'of', 'streamer', 'discharges', 'in', 'various', 'nitrogenmethane', 'and', 'nitrogenoxygen', 'mixtures', 'with', 'levels', 'of', 'nitrogen', 'from', '20', 'to', '984', 'we', 'present', 'the', 'friction', 'force', 'and', 'breakdown', 'fields', 'ek', 'in', 'various', 'n2o2', 'earthlike', 'and', 'n2ch4', 'titanlike', 'mixtures', 'the', 'strength', 'of', 'the', 'friction', 'force', 'is', 'larger', 'in', 'n2ch4', 'mixtures', 'whereas', 'the', 'breakdown', 'field', 'in', 'mixtures', 'with', 'methane', 'is', 'half', 'as', 'large', 'as', 'in', 'mixtures', 'with', 'oxygen', 'we', 'use', 'a', '25', 'dimensional', 'monte', 'carlo', 'particleincell', 'code', 'with', 'cylindrical', 'symmetry', 'to', 'simulate', 'the', 'development', 'of', 'electron', 'avalanches', 'from', 'an', 'initial', 'electronion', 'patch', 'in', 'ambient', 'electric', 'fields', 'between', '15ek', 'and', '3ek', 'we', 'compare', 'the', 'electron', 'density', 'the', 'electric', 'field', 'the', 'front', 'velocities', 'as', 'well', 'as', 'the', 'occurrence', 'of', 'avalanchetostreamer', 'transition', 'between', 'mixtures', 'with', 'methane', 'and', 'with', 'oxygen', 'whereas', 'we', 'observe', 'the', 'formation', 'of', 'streamers', 'in', 'oxygen', 'in', 'all', 'considered', 'cases', 'we', 'observe', 'streamer', 'inceptions', 'in', 'methane', 'for', 'small', 'percentages', 'of', 'nitrogen', 'or', 'for', 'large', 'electric', 'fields', 'only', 'for', 'large', 'percentages', 'of', 'nitrogen', 'or', 'for', 'small', 'fields', 'ionization', 'is', 'not', 'efficient', 'enough', 'to', 'form', 'a', 'streamer', 'channel', 'within', 'the', 'length', 'of', 'the', 'simulation', 'domain', 'in', 'oxygen', 'positive', 'and', 'negative', 'streamers', 'move', 'faster', 'for', 'small', 'percentages', 'of', 'nitrogen', 'in', 'mixtures', 'with', 'methane', 'electron', 'or', 'streamer', 'fronts', 'move', '10100', 'times', 'slower', 'than', 'in', 'mixtures', 'with', 'oxygen', 'the', 'higher', 'the', 'percentage', 'of', 'methane', 'the', 'faster', 'the', 'fronts', 'move']] | [-0.07129747499398761, 0.23760182095527455, 0.005619187491061557, 0.02780991393980813, 0.07525452312489017, -0.09824916226554568, 0.029923169410928395, 0.40871227097486246, -0.1883123381877271, -0.32955674715183614, 0.058807490903814715, -0.26491893691738616, -0.054011345109237094, 0.15168760386745625, 0.011110183983422941, -0.014186339992873309, 0.02340297251078887, -0.04521130690323737, -0.027561777146110515, -0.20862170044105782, 0.2371359279045655, 0.08953040042704269, 0.23175559611599736, 0.06229930091649294, 0.055957887725984805, -0.07076362293104038, 0.024900662800798022, 0.008588499580896075, -0.11828718533595885, 0.04353845255261585, 0.23034313110685556, 0.03598220822789722, 0.2259993282745459, -0.5099765751276071, -0.22544775892659522, 0.060621786444152496, 0.13370122731675027, 0.130388985129715, -0.09617503717230602, -0.2139823036385747, 0.014173640938037458, -0.16266304620408586, -0.1605649526297514, 0.011640007998950841, 0.04187402139543047, 0.08594733423713845, -0.27911339138322433, 0.13362370955389963, 0.018109565771462693, 0.1271251786809352, -0.12129220400326454, -0.151954558226006, -0.05064550540096933, 0.07906594641111447, 0.07412821093149592, -0.0014575146720255529, 0.24457603002782957, -0.15206325853071903, -0.033428274957412275, 0.39625184063040536, -0.14457026363024927, -0.12086115769666284, 0.2885901494728922, -0.2597800221653927, -0.06734501400492378, 0.2488689381871842, 0.17840365645233072, 0.11705890717767492, -0.10462489830400451, -0.013654621460566986, -0.024826715605924327, 0.1396013242114304, 0.1516432818387314, -0.02912705472060049, 0.24742250451074616, 0.17841390252481176, 0.04669851282789536, 0.13861317878604687, -0.17169175844173878, -0.06084968419178162, -0.2119825105977526, -0.20450334695261754, -0.09637124779753528, 0.0250405138564524, -0.06528097159037721, -0.20784431357257568, 0.3247610104246801, 0.12723970806158633, 0.16376696329978646, -0.029353240919651604, 0.29291962805016264, 0.041353650287404155, 0.05297510966095103, 0.09488288464050099, 0.21600981979403927, 0.17645466548318295, 0.12312356817655651, -0.23517952643103993, 0.08523152895886138, 0.016127561396105262] |
1,802.09907 | Nonlinear absorption study in four and five energy level systems | Nonlinear absorption in four and five energy level systems have been studied
with the aid of steady-state rate equation approach. We report on the
tunability of saturable and reverse saturable absorption as a function of
spectroscopic parameters (lifetimes and absorption cross-sections). Detailed
information is given on the estimation of spectroscopic parameters in the
nonlinear absorption spectroscopy. The exhaustive graphical analysis of this
article can provide the brief idea about transmittance curves of the nonlinear
absorption to the experimentalists. In four and five level cascade models,
simultaneously saturable and reverse saturable absorption can be generated.
| physics.optics | nonlinear absorption in four and five energy level systems have been studied with the aid of steadystate rate equation approach we report on the tunability of saturable and reverse saturable absorption as a function of spectroscopic parameters lifetimes and absorption crosssections detailed information is given on the estimation of spectroscopic parameters in the nonlinear absorption spectroscopy the exhaustive graphical analysis of this article can provide the brief idea about transmittance curves of the nonlinear absorption to the experimentalists in four and five level cascade models simultaneously saturable and reverse saturable absorption can be generated | [['nonlinear', 'absorption', 'in', 'four', 'and', 'five', 'energy', 'level', 'systems', 'have', 'been', 'studied', 'with', 'the', 'aid', 'of', 'steadystate', 'rate', 'equation', 'approach', 'we', 'report', 'on', 'the', 'tunability', 'of', 'saturable', 'and', 'reverse', 'saturable', 'absorption', 'as', 'a', 'function', 'of', 'spectroscopic', 'parameters', 'lifetimes', 'and', 'absorption', 'crosssections', 'detailed', 'information', 'is', 'given', 'on', 'the', 'estimation', 'of', 'spectroscopic', 'parameters', 'in', 'the', 'nonlinear', 'absorption', 'spectroscopy', 'the', 'exhaustive', 'graphical', 'analysis', 'of', 'this', 'article', 'can', 'provide', 'the', 'brief', 'idea', 'about', 'transmittance', 'curves', 'of', 'the', 'nonlinear', 'absorption', 'to', 'the', 'experimentalists', 'in', 'four', 'and', 'five', 'level', 'cascade', 'models', 'simultaneously', 'saturable', 'and', 'reverse', 'saturable', 'absorption', 'can', 'be', 'generated']] | [-0.08105220427201625, 0.035696049973844214, -0.04886522244889923, 0.015914784047128434, -0.08679911782568757, -0.1521894049761381, 0.028748296330029025, 0.4497089649134494, -0.2465610278056974, -0.3257316810455411, 0.08273434467202528, -0.3283658252256189, -0.1253794489745447, 0.24158255494338401, 0.034344726014248234, 0.09369078844270491, 0.02066780167057159, -0.055813280372333, -0.015576396390121984, -0.22092945201748468, 0.2785900765435493, 0.05550678660894962, 0.25423837004308686, 0.0582354183189888, 0.07353828674023773, 0.025439205889074886, -0.04188298845683482, -0.011956772925530343, -0.153178261820861, 0.1203644001866354, 0.24023659681045095, 0.07653989126915707, 0.25458631570391516, -0.37038095931502735, -0.2666866064487778, 0.026074852536808937, 0.1701248912239804, 0.154855486659452, -0.06597197994322299, -0.2534218350118224, 0.019693217240273952, -0.1353678529527276, -0.13151716599439053, -0.048736449241875965, -0.02715697684919739, 0.07287732516712647, -0.24735310724242887, 0.0636844329159469, 0.018624453399171854, 0.11730681062537304, -0.09233100142111962, -0.08467098765887637, -0.06972550747400903, 0.04294628615273123, -0.03423320802245686, -0.09538922380925989, 0.12784417243575322, -0.1561103620085905, -0.11838280724638954, 0.3640852256460076, -0.13222165780260842, -0.10143039716368026, 0.14729842131070675, -0.13834875780454975, -0.09254418291706354, 0.20941966601667253, 0.21467844324008106, 0.10816799865124073, -0.16771303208425958, 0.021205424501416967, -0.013480131697662651, 0.22182211030195367, 0.07013687865184422, 0.13424813267873956, 0.1797371564694294, 0.18251194509657773, -0.03614416606773801, 0.11254461252061214, -0.11161956189576774, 0.020176302839783913, -0.27918628303017073, -0.15228431047425864, -0.11446222148221383, 0.09836378801698262, -0.05876574234741596, -0.12423485148935876, 0.4519816296214753, 0.1301995581313175, 0.19009447590685746, -0.00764048231537751, 0.3191655394125809, 0.21531212366399097, 0.011614003862710075, -0.026811754509331064, 0.297724555276255, 0.16275151153441836, 0.09842239200395156, -0.2311660998273007, 0.0644049287892561, 0.007064589787215153] |
1,802.09908 | A remark about a theorem of Skandalis | Georges Skandalis exhibited in his work on $K$-nuclearity the first class of
$C^*$-algebras $A$ for which the canonical map $K_*(A\otimes_{max}A)\to
K_*(A\otimes_{min}A)$ is not an isomorphism. We show that it is the injectivity
that fails (even rationally) in his examples.
| math.OA math.KT | georges skandalis exhibited in his work on knuclearity the first class of calgebras a for which the canonical map k_aotimes_maxato k_aotimes_mina is not an isomorphism we show that it is the injectivity that fails even rationally in his examples | [['georges', 'skandalis', 'exhibited', 'in', 'his', 'work', 'on', 'knuclearity', 'the', 'first', 'class', 'of', 'calgebras', 'a', 'for', 'which', 'the', 'canonical', 'map', 'k_aotimes_maxato', 'k_aotimes_mina', 'is', 'not', 'an', 'isomorphism', 'we', 'show', 'that', 'it', 'is', 'the', 'injectivity', 'that', 'fails', 'even', 'rationally', 'in', 'his', 'examples']] | [-0.10952307940978143, 0.04952417414016155, -0.11838796719287832, 0.0831755939224321, -0.09356903962584005, -0.14307071872624672, -0.024780123106514413, 0.3771708302406801, -0.30036447257993537, -0.2038507635653433, 0.10602695281462123, -0.27630724675125545, -0.2339319158345461, 0.24283799984388882, -0.2371990589890629, -0.05337105794913239, 0.06582161349554856, 0.11267662291518515, -0.061577768037144175, -0.34105613274085855, 0.38798032315551406, 0.03017566663523515, 0.20499612422039112, 0.1143572410930776, 0.10307922028005123, -0.01873252667590148, 0.037845578510314226, 0.027265191104056105, -0.11212676643440823, 0.09925456163990828, 0.27105544900728595, 0.12716870363025615, 0.28017430482173544, -0.32844587852539714, -0.15490041789598763, 0.19364167033280763, 0.03320831658008198, 0.06208075552907152, -0.038683663448965594, -0.2563722259882424, 0.07785382738115408, -0.17175858434186214, -0.09934438862385125, -0.10949865423349871, 0.08125467298345433, -0.03200480424695545, -0.19930138129792693, -0.0405826305763589, 0.23223259484317774, 0.05658189246120552, -0.07553258372677697, -0.001293741709863146, -0.01225635843972365, 0.10032181688843088, -0.008889666926633153, 0.04425470423625989, 0.0798866218343998, -0.07679977557725376, -0.10926246883658071, 0.3676500121752421, -0.04390489806731542, -0.1768614523526695, 0.15987417818461028, -0.1628671180870798, -0.23294674913631752, 0.0824510474792785, -0.007241215453379684, 0.1887154972355347, -0.07010270841419697, 0.1678776419462843, -0.17150547220889065, 0.13424692834572247, 0.06345805637021032, -0.09777456770340602, 0.0951879666859491, 0.06879123033852214, 0.0954586099057148, 0.11020323269379635, 0.05121643860022434, -0.04016307234350178, -0.33623241058861214, -0.23290627416119808, -0.19724377617239952, 0.14239242963352203, -0.0012016405170369479, -0.14727477905237013, 0.41308625963413054, 0.12352319708507922, 0.17871314408775005, 0.1340243230709651, 0.234000692040556, 0.03512263142814239, 0.0432056352082226, 0.07702768661288752, 0.24850338542213044, 0.16906688129529357, 0.06722449660042508, -0.1377832921118372, 0.034689749397026994, 0.17591357769237626] |
1,802.09909 | Optimal Solution of Nonlinear Fuzzy Optimization Problem under Linear
Order Relation | Multi-variable nonlinear fuzzy optimization problem is considered under
linear order relation on fuzzy numbers. Using gH-differentiability of a
fuzzy-valued function $\tilde{f}$, new necessary and sufficient optimality
conditions are proposed. The optimality conditions are obtained without putting
additional conditions on fuzzy-valued functions like, convexity,
quasi-convexity, pseudo-convexity. Optimum solution of the fuzzy optimization
problem is obtained based on the optimality conditions. Illustrations and a
case study are given to explain the numerical applications of the proposed
results. Comparison of optimality conditions from existing literature is given.
| math.GM | multivariable nonlinear fuzzy optimization problem is considered under linear order relation on fuzzy numbers using ghdifferentiability of a fuzzyvalued function tildef new necessary and sufficient optimality conditions are proposed the optimality conditions are obtained without putting additional conditions on fuzzyvalued functions like convexity quasiconvexity pseudoconvexity optimum solution of the fuzzy optimization problem is obtained based on the optimality conditions illustrations and a case study are given to explain the numerical applications of the proposed results comparison of optimality conditions from existing literature is given | [['multivariable', 'nonlinear', 'fuzzy', 'optimization', 'problem', 'is', 'considered', 'under', 'linear', 'order', 'relation', 'on', 'fuzzy', 'numbers', 'using', 'ghdifferentiability', 'of', 'a', 'fuzzyvalued', 'function', 'tildef', 'new', 'necessary', 'and', 'sufficient', 'optimality', 'conditions', 'are', 'proposed', 'the', 'optimality', 'conditions', 'are', 'obtained', 'without', 'putting', 'additional', 'conditions', 'on', 'fuzzyvalued', 'functions', 'like', 'convexity', 'quasiconvexity', 'pseudoconvexity', 'optimum', 'solution', 'of', 'the', 'fuzzy', 'optimization', 'problem', 'is', 'obtained', 'based', 'on', 'the', 'optimality', 'conditions', 'illustrations', 'and', 'a', 'case', 'study', 'are', 'given', 'to', 'explain', 'the', 'numerical', 'applications', 'of', 'the', 'proposed', 'results', 'comparison', 'of', 'optimality', 'conditions', 'from', 'existing', 'literature', 'is', 'given']] | [-0.14391817358962025, -0.05010668030681919, -0.07998852183234441, 0.13460373525165514, -0.1373594550455146, -0.1379105614341167, 0.02993201332290219, 0.37409510445522975, -0.23208132176098964, -0.26981347133349404, 0.22799009311360768, -0.20338453384991512, -0.17893616527498488, 0.20052366499530982, -0.12335341620113117, 0.16888644381325288, 0.07107664103316794, 0.02573543843106333, -0.11884494207754552, -0.29555655733390473, 0.33644967328712166, 0.0006036595385297235, 0.2903620681714222, 0.07869196755752664, 0.13265330852738705, -0.03036474404191733, 0.026795616235965526, 0.04696780688926039, -0.21467228193419524, 0.07295054956675923, 0.22163577010035965, 0.19794591866343855, 0.3178801773542381, -0.4188084597755448, -0.1469747959804463, 0.10934989655906537, 0.03473182857956692, -0.03016593599557338, -0.0638705525818668, -0.29196828313968537, 0.12604923403389887, -0.058086712799786805, -0.11754681349518788, -0.10305781440293214, -0.06871345728433814, 0.09723873787380037, -0.4025827114391758, 0.05635160961011649, 0.05533177985147719, 0.0786015909075378, -0.14685222768527736, -0.1394677729940558, -0.001962420188384243, 0.04592014365010413, 0.03537208587211747, -0.028633979746667915, 0.09496905462232878, -0.09221825709409383, -0.1057596042842032, 0.352256126555962, 0.022108069064196604, -0.30816939226295575, 0.1912794089511441, -0.0359382115512054, -0.1264655456165727, 0.09083683810656867, 0.1297004695712443, 0.14464060137755272, -0.17306180605777058, 0.11312600177942764, -0.09852020652874945, 0.12206615974386055, 0.13625671912590603, 0.052170407144824064, 0.07727748753239277, 0.14433493805174008, 0.16274043598986535, 0.22244644189444202, 0.03415323138315545, -0.15033786939120436, -0.3656473798138729, -0.08123025592102344, -0.15975849744471082, -0.02174133003453713, -0.12998026957229084, -0.10232873034315655, 0.3507087671321379, 0.12480878125292709, 0.13612837503041444, 0.10157281191772725, 0.26995470995330306, 0.18199891135508914, 0.006250452575644097, 0.026737346072647585, 0.20806110807391534, 0.18541601479771624, 0.08550961698049185, -0.19033664036317763, 0.08136573210583035, 0.14931899186852107] |
1,802.0991 | Symplectic invariants for parabolic orbits and cusp singularities of integrable systems with two degrees of freedom | We discuss normal forms and symplectic invariants of parabolic orbits and cuspidal tori in integrable Hamiltonian systems with two degrees of freedom. Such singularities appear in many integrable systems in geometry and mathematical physics and can be considered as the simplest example of degenerate singularities. We also suggest some new techniques which apparently can be used for studying symplectic invariants of degenerate singularities of more general type. | math.SG math.DG math.DS | we discuss normal forms and symplectic invariants of parabolic orbits and cuspidal tori in integrable hamiltonian systems with two degrees of freedom such singularities appear in many integrable systems in geometry and mathematical physics and can be considered as the simplest example of degenerate singularities we also suggest some new techniques which apparently can be used for studying symplectic invariants of degenerate singularities of more general type | [['we', 'discuss', 'normal', 'forms', 'and', 'symplectic', 'invariants', 'of', 'parabolic', 'orbits', 'and', 'cuspidal', 'tori', 'in', 'integrable', 'hamiltonian', 'systems', 'with', 'two', 'degrees', 'of', 'freedom', 'such', 'singularities', 'appear', 'in', 'many', 'integrable', 'systems', 'in', 'geometry', 'and', 'mathematical', 'physics', 'and', 'can', 'be', 'considered', 'as', 'the', 'simplest', 'example', 'of', 'degenerate', 'singularities', 'we', 'also', 'suggest', 'some', 'new', 'techniques', 'which', 'apparently', 'can', 'be', 'used', 'for', 'studying', 'symplectic', 'invariants', 'of', 'degenerate', 'singularities', 'of', 'more', 'general', 'type']] | [-0.21616392455293115, 0.09025051044439202, -0.11678269160772438, 0.15210285290742098, -0.10168358812859254, -0.22447354235311054, -0.0828821490859307, 0.2789601682643615, -0.2963970681068613, -0.2281391736008783, 0.11713598418195467, -0.23765938229330663, -0.23405474251998004, 0.24734879828252787, -0.1249922729069506, 0.0625447887482483, 0.060216868546471666, 0.008597205679710788, -0.15346910051111853, -0.2594039754580651, 0.42531289684641826, -0.06616423135873542, 0.13314141430405538, 0.03268494304102748, 0.07087091603941882, -0.0023490911863966665, 0.031107396186232122, 0.004529870129120883, -0.13031320733977342, 0.09981390375491064, 0.35097248157236116, 0.031023572956614974, 0.14191748394366743, -0.4297992221649681, -0.20442401111098146, 0.12640580356315667, 0.20196358163132153, 0.12320524467148387, -0.003220616691483449, -0.27409908244970127, 0.0030408673876298788, -0.16227597721032241, -0.29822749544435473, -0.13692562558007107, -0.03119741916767697, 0.054697531317152194, -0.1559227336052138, 0.07567631102596242, 0.12468649617938408, 0.12502705361416092, -0.03738065838202167, -0.10160854801973467, -0.0726057518231891, 0.05275526095126102, 0.010647006193870929, -0.06686312341784585, 0.07114780405249599, -0.12979208689822413, -0.14563204534351826, 0.4023049425319838, -0.02966376605666062, -0.28453258073318805, 0.2208282693859134, -0.1381429287869094, -0.21876878449484818, 0.11251484649950888, 0.1551644006160213, 0.14336263581609993, -0.09540382195820114, 0.11935061274388277, 0.0012856488943155577, 0.023002863931122112, 0.1027798657236037, 0.07016347192745628, 0.23450067341883682, 0.06653443172768649, 0.044953371737840406, 0.08021042959889703, -0.0015498094170340406, -0.14111269458627967, -0.32336406348578967, -0.20089505005405464, -0.08075002925609474, 0.141076272603736, -0.07032133903573337, -0.1691396973832552, 0.43714545372484337, 0.05437173571875458, 0.180989698270586, -0.013966118796978757, 0.17595228185849404, 0.09546644425318479, 0.056686915332145656, 0.07346095625830662, 0.20638207198553302, 0.17320213933934026, -0.023587558449788104, -0.13045484558227402, -0.07766738126780699, 0.10841126696540238] |
1,802.09911 | Discovering Bayesian Market Views for Intelligent Asset Allocation | Along with the advance of opinion mining techniques, public mood has been
found to be a key element for stock market prediction. However, how market
participants' behavior is affected by public mood has been rarely discussed.
Consequently, there has been little progress in leveraging public mood for the
asset allocation problem, which is preferred in a trusted and interpretable
way. In order to address the issue of incorporating public mood analyzed from
social media, we propose to formalize public mood into market views, because
market views can be integrated into the modern portfolio theory. In our
framework, the optimal market views will maximize returns in each period with a
Bayesian asset allocation model. We train two neural models to generate the
market views, and benchmark the model performance on other popular asset
allocation strategies. Our experimental results suggest that the formalization
of market views significantly increases the profitability (5% to 10% annually)
of the simulated portfolio at a given risk level.
| q-fin.CP cs.AI | along with the advance of opinion mining techniques public mood has been found to be a key element for stock market prediction however how market participants behavior is affected by public mood has been rarely discussed consequently there has been little progress in leveraging public mood for the asset allocation problem which is preferred in a trusted and interpretable way in order to address the issue of incorporating public mood analyzed from social media we propose to formalize public mood into market views because market views can be integrated into the modern portfolio theory in our framework the optimal market views will maximize returns in each period with a bayesian asset allocation model we train two neural models to generate the market views and benchmark the model performance on other popular asset allocation strategies our experimental results suggest that the formalization of market views significantly increases the profitability 5 to 10 annually of the simulated portfolio at a given risk level | [['along', 'with', 'the', 'advance', 'of', 'opinion', 'mining', 'techniques', 'public', 'mood', 'has', 'been', 'found', 'to', 'be', 'a', 'key', 'element', 'for', 'stock', 'market', 'prediction', 'however', 'how', 'market', 'participants', 'behavior', 'is', 'affected', 'by', 'public', 'mood', 'has', 'been', 'rarely', 'discussed', 'consequently', 'there', 'has', 'been', 'little', 'progress', 'in', 'leveraging', 'public', 'mood', 'for', 'the', 'asset', 'allocation', 'problem', 'which', 'is', 'preferred', 'in', 'a', 'trusted', 'and', 'interpretable', 'way', 'in', 'order', 'to', 'address', 'the', 'issue', 'of', 'incorporating', 'public', 'mood', 'analyzed', 'from', 'social', 'media', 'we', 'propose', 'to', 'formalize', 'public', 'mood', 'into', 'market', 'views', 'because', 'market', 'views', 'can', 'be', 'integrated', 'into', 'the', 'modern', 'portfolio', 'theory', 'in', 'our', 'framework', 'the', 'optimal', 'market', 'views', 'will', 'maximize', 'returns', 'in', 'each', 'period', 'with', 'a', 'bayesian', 'asset', 'allocation', 'model', 'we', 'train', 'two', 'neural', 'models', 'to', 'generate', 'the', 'market', 'views', 'and', 'benchmark', 'the', 'model', 'performance', 'on', 'other', 'popular', 'asset', 'allocation', 'strategies', 'our', 'experimental', 'results', 'suggest', 'that', 'the', 'formalization', 'of', 'market', 'views', 'significantly', 'increases', 'the', 'profitability', '5', 'to', '10', 'annually', 'of', 'the', 'simulated', 'portfolio', 'at', 'a', 'given', 'risk', 'level']] | [-0.06061459280209188, 0.01903320413215884, -0.13246022240021585, 0.1254251224772646, -0.13104205251735004, -0.184688329939609, 0.09651686950740028, 0.4739616140607536, -0.27304387750879205, -0.28584917530349474, 0.15598631759466292, -0.30665890877973867, -0.15032365775568793, 0.17947731841274578, -0.1745304216671249, 0.04207629723451245, 0.07006962178419604, 0.02394055433987831, 0.07978926676033377, -0.3750136516039601, 0.27456643520015644, 0.05700818374926537, 0.3676622104165809, 0.05500330015878129, 0.09800579769058537, -0.008782875920813647, -0.0865082849095133, 0.027042980589296505, -0.09119827005462121, 0.17751690601533776, 0.3804871643909374, 0.2040260605707834, 0.432819510723308, -0.4239860007666653, -0.18234619680323538, 0.0888286573343812, 0.08760573045691904, 0.050190824942275745, -0.001300550971949554, -0.30487702411501116, 0.04135407600081844, -0.2637346029883216, -0.04607500011240196, -0.09470237958424302, 0.004030286577408729, -0.036473392465177876, -0.2822504809403919, 0.034825264580362704, -0.03824280144542641, 0.08426286836634882, -0.05800935229530951, -0.13662878593418354, -0.027239013657043253, 0.19574458836375372, 0.16468278452918883, -0.009007513117998179, 0.1624239721944301, -0.16404764428235857, -0.23409041810364273, 0.3911582170002255, -0.0455984104698038, -0.15564647734147838, 0.08721743759219043, -0.06967505119214563, -0.1346497769268325, 0.07303410468576765, 0.24229956680101847, -0.0036903755184008466, -0.20740366615181477, -0.01100790462697428, -0.08396328830808077, 0.24842371457539822, 0.049513092351302225, -0.024356569050701323, 0.22909695586415227, 0.23395088023176383, 0.07893182278714889, 0.10633580757396134, -0.04190425477598025, -0.1766218851893122, -0.1590805557796512, -0.09740163986961595, -0.12293133180681037, 0.01718617567896658, -0.12176944932344323, -0.11915827965977029, 0.3947853453931694, 0.22104545883683963, 0.0811728601638945, 0.05071301210125018, 0.3209280772770969, 0.054967421386101695, 0.03788245191064776, 0.11794689506211359, 0.1768645029233028, -0.06261678972109423, 0.19498843356015402, -0.13674976061545138, 0.23301241452001636, -0.011412242984237231] |
1,802.09912 | A novel connection between scalar field theories and quantum mechanics | This work deals with scalar field theories and supersymmetric quantum
mechanics. The investigation is inspired by a recent result, which shows how to
use the reconstruction mechanism to describe two distinct field theories from
the very same quantum mechanics potential, and by an older work, which
describes the deformation procedure that offers an interesting way to generate
and solve new scalar field theories, starting from a given model of current
interest. We use the procedure to unveil a new route, from which one can
describe families of scalar field theories that engender the very same quantum
mechanics potential. The approach can be applied algorithmically, and
implemented to generate models that give rise to distinct quantum mechanics
systems as well.
| physics.gen-ph | this work deals with scalar field theories and supersymmetric quantum mechanics the investigation is inspired by a recent result which shows how to use the reconstruction mechanism to describe two distinct field theories from the very same quantum mechanics potential and by an older work which describes the deformation procedure that offers an interesting way to generate and solve new scalar field theories starting from a given model of current interest we use the procedure to unveil a new route from which one can describe families of scalar field theories that engender the very same quantum mechanics potential the approach can be applied algorithmically and implemented to generate models that give rise to distinct quantum mechanics systems as well | [['this', 'work', 'deals', 'with', 'scalar', 'field', 'theories', 'and', 'supersymmetric', 'quantum', 'mechanics', 'the', 'investigation', 'is', 'inspired', 'by', 'a', 'recent', 'result', 'which', 'shows', 'how', 'to', 'use', 'the', 'reconstruction', 'mechanism', 'to', 'describe', 'two', 'distinct', 'field', 'theories', 'from', 'the', 'very', 'same', 'quantum', 'mechanics', 'potential', 'and', 'by', 'an', 'older', 'work', 'which', 'describes', 'the', 'deformation', 'procedure', 'that', 'offers', 'an', 'interesting', 'way', 'to', 'generate', 'and', 'solve', 'new', 'scalar', 'field', 'theories', 'starting', 'from', 'a', 'given', 'model', 'of', 'current', 'interest', 'we', 'use', 'the', 'procedure', 'to', 'unveil', 'a', 'new', 'route', 'from', 'which', 'one', 'can', 'describe', 'families', 'of', 'scalar', 'field', 'theories', 'that', 'engender', 'the', 'very', 'same', 'quantum', 'mechanics', 'potential', 'the', 'approach', 'can', 'be', 'applied', 'algorithmically', 'and', 'implemented', 'to', 'generate', 'models', 'that', 'give', 'rise', 'to', 'distinct', 'quantum', 'mechanics', 'systems', 'as', 'well']] | [-0.057609803755493724, 0.13237472673894704, -0.15463327859066614, 0.06791495165138059, -0.0881935941963261, -0.21629073965057982, -0.025008350176376707, 0.3043334733757402, -0.2700745503989463, -0.3337903776589562, 0.0264469963251887, -0.21454974979224825, -0.2370604849068307, 0.21944661269222676, -0.07416647026988388, 0.028485957337465107, 0.028579215785222396, 0.030059705198812885, -0.03621671640459925, -0.22543452952464088, 0.31278650922027706, 0.03321998538997244, 0.26342317447097613, 0.02863830639472028, 0.09888905107959353, -0.0028623648363502088, 0.018494815025635127, 0.057252759215648936, -0.11987693528462535, 0.16100684818694322, 0.22777525013246785, 0.13823916426930233, 0.23305125565839416, -0.4463753014521188, -0.261762813801932, 0.07489946546784344, 0.1404249421594774, 0.205225143203279, -0.0807976332579215, -0.28267204874202984, 0.05198729513291301, -0.18987963492629908, -0.1683367553847928, -0.1397038512088421, -0.023918712269045225, -0.0703223513433428, -0.22528552166147142, 0.02783223008345656, 0.031249263230906876, 0.025866426840549756, -0.039179249213443006, -0.05538717727568157, 0.056919602976579754, 0.1146937297586696, 0.07414801666579608, 0.08982726732394149, 0.11365554729640923, -0.15702068706203504, -0.19415203380758458, 0.4070866035078378, -0.046385418099327745, -0.1823215951689151, 0.21828628818997564, -0.07108080644598778, -0.13729169364126415, 0.07932068343751696, 0.16417695963833512, 0.1262356754501953, -0.1715059812736361, 0.11491265751131881, -0.001415379556725506, 0.1432271870479238, 0.02543915911898518, 0.01841027318977383, 0.2841307927752618, 0.08539526630584307, 0.03435444735194079, 0.14567980531333094, 0.010233662036411902, -0.1742255998415356, -0.3421187068437453, -0.16813129861252146, -0.1566885852806677, 0.09181278817230414, -0.029613705617551764, -0.1767822870702929, 0.4247919047611351, 0.21129013223870963, 0.20041042594473904, 0.034303477989752314, 0.23930058972675258, 0.1119884808475402, 0.0705291628588124, 0.00560994929547946, 0.22912590065579705, 0.17337824335760055, 0.09909641007039727, -0.17072397132185013, -0.03476010253330098, 0.06815778993132736] |
1,802.09913 | Multi-task Learning of Pairwise Sequence Classification Tasks Over
Disparate Label Spaces | We combine multi-task learning and semi-supervised learning by inducing a
joint embedding space between disparate label spaces and learning transfer
functions between label embeddings, enabling us to jointly leverage unlabelled
data and auxiliary, annotated datasets. We evaluate our approach on a variety
of sequence classification tasks with disparate label spaces. We outperform
strong single and multi-task baselines and achieve a new state-of-the-art for
topic-based sentiment analysis.
| cs.CL cs.NE stat.ML | we combine multitask learning and semisupervised learning by inducing a joint embedding space between disparate label spaces and learning transfer functions between label embeddings enabling us to jointly leverage unlabelled data and auxiliary annotated datasets we evaluate our approach on a variety of sequence classification tasks with disparate label spaces we outperform strong single and multitask baselines and achieve a new stateoftheart for topicbased sentiment analysis | [['we', 'combine', 'multitask', 'learning', 'and', 'semisupervised', 'learning', 'by', 'inducing', 'a', 'joint', 'embedding', 'space', 'between', 'disparate', 'label', 'spaces', 'and', 'learning', 'transfer', 'functions', 'between', 'label', 'embeddings', 'enabling', 'us', 'to', 'jointly', 'leverage', 'unlabelled', 'data', 'and', 'auxiliary', 'annotated', 'datasets', 'we', 'evaluate', 'our', 'approach', 'on', 'a', 'variety', 'of', 'sequence', 'classification', 'tasks', 'with', 'disparate', 'label', 'spaces', 'we', 'outperform', 'strong', 'single', 'and', 'multitask', 'baselines', 'and', 'achieve', 'a', 'new', 'stateoftheart', 'for', 'topicbased', 'sentiment', 'analysis']] | [0.028149887986452966, -0.03686440216772484, -0.03596106823886547, 0.11863710370733205, -0.20619774508910874, -0.21105783711413317, 0.08458747616157669, 0.5521193840964274, -0.2912292504739581, -0.3628599722728585, -0.02421366216995838, -0.3168451022215639, -0.1572517342759635, 0.1973347124065075, -0.16635638657449323, 0.056033978205188316, 0.20564301774808855, 0.02024446568931594, -0.14134299482755136, -0.29497491838904377, 0.40164669039729756, -0.051439659035002645, 0.4115027758208188, 0.0033394885531654863, 0.22789551230733085, 0.02191406030518313, -0.06537216689762179, -0.032428171369688105, -0.04970033595225576, 0.2990883190579938, 0.40162079956269625, 0.275646136417477, 0.35930741308821423, -0.31357120949365763, -0.27470466442349734, 0.16034787433631154, 0.10866692927524899, 0.09328381285608471, 0.013345725719718206, -0.4285603892058134, 0.04146096667726383, -0.16772857540336467, 0.1885011451897409, -0.2914750894785605, -0.07696225459574524, -0.023397530316177643, -0.36428586215796793, 0.00786268758361764, 0.09067244438285177, 0.07324070165949789, -0.09740177268064475, -0.10849307773098575, 0.08063329888550057, 0.22930718892761928, 0.027571191178691206, 0.09868774862226212, 0.09859926484271207, -0.16658330510472297, -0.23569582305340606, 0.2453040645006254, -0.09069390499004812, -0.24548176872177105, 0.24667041197729608, 0.03827355509257001, -0.2130088473275078, 0.04386601958310965, 0.32261944628518185, 0.13826727151701396, -0.10767370250753382, 0.0003160699014904711, -0.06199363202816158, 0.1797427893898478, 0.0696606083109862, -0.011842215631270048, 0.14929278043917182, 0.31491136215062754, 0.04278070844399432, 0.14921811521476644, -0.1454726732089043, -0.05974001529675937, -0.16664880871151885, -0.0789060218182082, -0.1959887207062407, -0.04783286879043744, -0.21008528148024308, -0.1278995405600378, 0.3725117519638981, 0.23302676930854266, 0.24865234964597743, 0.17829451890605869, 0.3162503312341869, -0.0725020163773672, 0.10868041088564717, 0.12218468868664015, 0.09171851464744771, 0.0219819293195156, 0.1151829608363297, -0.1620943479691491, 0.025342388089153577, 0.05882207863738365] |
1,802.09914 | High-Dimensional Vector Semantics | In this paper we explore the "vector semantics" problem from the perspective
of "almost orthogonal" property of high-dimensional random vectors. We show
that this intriguing property can be used to "memorize" random vectors by
simply adding them, and we provide an efficient probabilistic solution to the
set membership problem. Also, we discuss several applications to word context
vector embeddings, document sentences similarity, and spam filtering.
| cs.CL cs.AI cs.LG stat.ML | in this paper we explore the vector semantics problem from the perspective of almost orthogonal property of highdimensional random vectors we show that this intriguing property can be used to memorize random vectors by simply adding them and we provide an efficient probabilistic solution to the set membership problem also we discuss several applications to word context vector embeddings document sentences similarity and spam filtering | [['in', 'this', 'paper', 'we', 'explore', 'the', 'vector', 'semantics', 'problem', 'from', 'the', 'perspective', 'of', 'almost', 'orthogonal', 'property', 'of', 'highdimensional', 'random', 'vectors', 'we', 'show', 'that', 'this', 'intriguing', 'property', 'can', 'be', 'used', 'to', 'memorize', 'random', 'vectors', 'by', 'simply', 'adding', 'them', 'and', 'we', 'provide', 'an', 'efficient', 'probabilistic', 'solution', 'to', 'the', 'set', 'membership', 'problem', 'also', 'we', 'discuss', 'several', 'applications', 'to', 'word', 'context', 'vector', 'embeddings', 'document', 'sentences', 'similarity', 'and', 'spam', 'filtering']] | [-0.08542845362009337, 0.05934291025825167, -0.06251462997438816, 0.11754282667444875, -0.1968972354840774, -0.11974491855451981, 0.106411053156122, 0.4806614660299741, -0.40894195231107566, -0.24607240715995432, 0.07218567267812502, -0.28689764973779136, -0.21566203222251856, 0.13478611862430206, -0.11427850207457176, 0.10277711558513916, 0.09586132102860855, 0.05856025503061783, -0.05749848695256962, -0.309985711124654, 0.3459036243148148, -0.011134099587798119, 0.29852085480323204, -0.03110965097752901, 0.13590454140391486, 0.04791332171656765, -0.06270846545409697, 0.0268719470844819, -0.08789697673156087, 0.19663201766446806, 0.33573263516792884, 0.2592136649558177, 0.3045184869462481, -0.3696632535913243, -0.17972946371883153, 0.15396508336640322, 0.1565232964774343, 0.15334251893755907, -0.032427437574817586, -0.3448594950999205, 0.14069645509410364, -0.16619759554473254, -0.06193404120321457, -0.15801566501076406, 0.002436591355273357, -0.02686266123961944, -0.24394835431415302, -0.0015390924003440888, 0.1473024249363404, 0.029314647493167565, -0.045137998361427054, -0.08590351072354958, 0.08646048066349557, 0.10243016893688876, 0.06874353418556543, 0.03644985478514662, 0.06231230260231174, -0.08939571528910445, -0.18391112627533193, 0.38297731343370217, -0.06594006043428985, -0.2794418079635272, 0.16296847002724044, -0.03233597409696533, -0.15406336488488775, 0.022107823178745233, 0.2282652139950257, 0.07329158433354818, -0.18353712945245207, 0.04903321417872436, -0.11264927703887224, 0.16663781828605212, 0.0922787977525821, 0.059674871650237875, 0.18678422686285698, 0.1186496822306743, 0.06863589897895088, 0.19245879030249152, -0.03892005134347038, -0.025257703067304998, -0.23291054054235036, -0.14996239486365365, -0.15838011642201588, 0.0071453247398424605, -0.14319494661758653, -0.17506851284549788, 0.4149442253777614, 0.25888167113925403, 0.24342238382937817, 0.07691675324279529, 0.27254657610677757, 0.07773892362087141, 0.006382377015856596, 0.09605333970214885, 0.10415740899043158, 0.09902562774144687, 0.08331721442966507, -0.08936690451362385, 0.06935581696721224, 0.11530788460603127] |
1,802.09915 | Asymptotically flat Einstein-Maxwell fields are inheriting | We prove that Maxwell fields of asymptotically flat solutions of the
Einstein-Maxwell equations inherit the stationarity of the metric.
| math.AP gr-qc math.DG | we prove that maxwell fields of asymptotically flat solutions of the einsteinmaxwell equations inherit the stationarity of the metric | [['we', 'prove', 'that', 'maxwell', 'fields', 'of', 'asymptotically', 'flat', 'solutions', 'of', 'the', 'einsteinmaxwell', 'equations', 'inherit', 'the', 'stationarity', 'of', 'the', 'metric']] | [-0.23503259118450315, 0.048819074983169376, -0.12685611848964504, 0.09813922432888496, -0.1258487668084471, -0.1303799270015014, -0.11401342228055, 0.2187774093135407, -0.18584019886819939, -0.20719050132595984, 0.11248078841814085, -0.2780090864551695, -0.16050103375394092, 0.08969131234641138, -0.057425532391981074, 0.058993730497987645, 0.0227160759662327, 0.03367828852251956, -0.13001772265048012, -0.3200242556631565, 0.4526979340926597, -0.00916070157760068, 0.3720976935797616, -0.09207783247295179, 0.2566960050087226, -0.08250711252912879, 0.026099571884658775, 0.11975655096926187, -0.18058064444133043, 0.04430630538416536, 0.20348298824147174, 0.13710794209404603, 0.1823477082346615, -0.4355104949913527, -0.19489635389886403, 0.10057069498457406, 0.0920373983681202, 0.13860349881609804, -0.049883609796923245, -0.3405707420683221, 0.12708448461796107, -0.06939321751461218, -0.2808110489951153, -0.09405430386725225, -0.05609523090778997, 0.07276846527269012, -0.21540187397285512, 0.07899694541763318, 0.15258847920248578, -0.048711416801731834, -0.24568770943503632, -0.023354919284190003, -0.06786909973935078, 0.0342712130789694, 0.224820359352682, -0.04904895508661866, 0.06821771505239763, -0.15142142066830083, -0.07882516887529116, 0.3436076899892406, -0.16335393253125643, -0.34449578096207817, 0.11878396021692376, -0.14765308336599878, -0.05826473216477193, 0.12026946501512277, 0.13506841304172812, 0.2568461335215129, -0.14009797063313031, 0.31815005838871, -0.07410888452278941, 0.07800788775478538, 0.15190293429125296, 0.05257032593516143, 0.15428930697472473, 0.018191103088228328, 0.14082743546092197, 0.15819792025477478, 0.03976145749421496, -0.16799298624851203, -0.40985767857024547, -0.21163084897163667, -0.13501199011347795, 0.21068210130263315, -0.2584506372283948, -0.33098296767198726, 0.35937003046274185, 0.14015453808793896, 0.023810184707767086, 0.18087991194701508, 0.13710631214474378, 0.11280930738307927, 0.024671233896362155, 0.21366628141779648, 0.33360265827688734, 0.1994802949852065, 0.15843404613827405, -0.19516130296611472, -0.11522189922336686, 0.11663142023117919] |
1,802.09916 | Short Distance Modification of a Gravitational System and its Optical
Analog | Motivated by developments in string theory, such as T-duality, it has been
proposed that the geometry of spacetime should have an intrinsic minimal length
associated with it. This would modify the short distance behavior of quantum
systems studied on such a geometry, and an optical analog for such a short
distance modification of quantum system has also been realized by using
non-paraxial nonlinear optics. As general relativity can be viewed as an
effective field theory obtained from string, it is expected that this would
also modify the short distance behavior of general relativity. Now the
Newtonian approximation is a valid short distance approximation to general
relativity, and Schrodinger-Newton equation can be obtained as a
non-relativistic semi-classical limit of such a theory, we will analyze the
short distance modification of Schrodinger-Newton equation from an intrinsic
minimal length in the geometry of spacetime. As an optical analog of the
Schrodinger-Newton equation has been constructed, it is possible to optically
realize this system. So, this system is important, and we will numerical
analyze the solutions for this system. It will be observed that the usual
Runge-Kutta method cannot be used to analyze this system. However, we will use
a propose and use a new numerical method, which we will call as the two step
Runge-Kutta method, for analyzing this system.
| physics.gen-ph hep-th | motivated by developments in string theory such as tduality it has been proposed that the geometry of spacetime should have an intrinsic minimal length associated with it this would modify the short distance behavior of quantum systems studied on such a geometry and an optical analog for such a short distance modification of quantum system has also been realized by using nonparaxial nonlinear optics as general relativity can be viewed as an effective field theory obtained from string it is expected that this would also modify the short distance behavior of general relativity now the newtonian approximation is a valid short distance approximation to general relativity and schrodingernewton equation can be obtained as a nonrelativistic semiclassical limit of such a theory we will analyze the short distance modification of schrodingernewton equation from an intrinsic minimal length in the geometry of spacetime as an optical analog of the schrodingernewton equation has been constructed it is possible to optically realize this system so this system is important and we will numerical analyze the solutions for this system it will be observed that the usual rungekutta method cannot be used to analyze this system however we will use a propose and use a new numerical method which we will call as the two step rungekutta method for analyzing this system | [['motivated', 'by', 'developments', 'in', 'string', 'theory', 'such', 'as', 'tduality', 'it', 'has', 'been', 'proposed', 'that', 'the', 'geometry', 'of', 'spacetime', 'should', 'have', 'an', 'intrinsic', 'minimal', 'length', 'associated', 'with', 'it', 'this', 'would', 'modify', 'the', 'short', 'distance', 'behavior', 'of', 'quantum', 'systems', 'studied', 'on', 'such', 'a', 'geometry', 'and', 'an', 'optical', 'analog', 'for', 'such', 'a', 'short', 'distance', 'modification', 'of', 'quantum', 'system', 'has', 'also', 'been', 'realized', 'by', 'using', 'nonparaxial', 'nonlinear', 'optics', 'as', 'general', 'relativity', 'can', 'be', 'viewed', 'as', 'an', 'effective', 'field', 'theory', 'obtained', 'from', 'string', 'it', 'is', 'expected', 'that', 'this', 'would', 'also', 'modify', 'the', 'short', 'distance', 'behavior', 'of', 'general', 'relativity', 'now', 'the', 'newtonian', 'approximation', 'is', 'a', 'valid', 'short', 'distance', 'approximation', 'to', 'general', 'relativity', 'and', 'schrodingernewton', 'equation', 'can', 'be', 'obtained', 'as', 'a', 'nonrelativistic', 'semiclassical', 'limit', 'of', 'such', 'a', 'theory', 'we', 'will', 'analyze', 'the', 'short', 'distance', 'modification', 'of', 'schrodingernewton', 'equation', 'from', 'an', 'intrinsic', 'minimal', 'length', 'in', 'the', 'geometry', 'of', 'spacetime', 'as', 'an', 'optical', 'analog', 'of', 'the', 'schrodingernewton', 'equation', 'has', 'been', 'constructed', 'it', 'is', 'possible', 'to', 'optically', 'realize', 'this', 'system', 'so', 'this', 'system', 'is', 'important', 'and', 'we', 'will', 'numerical', 'analyze', 'the', 'solutions', 'for', 'this', 'system', 'it', 'will', 'be', 'observed', 'that', 'the', 'usual', 'rungekutta', 'method', 'can', 'not', 'be', 'used', 'to', 'analyze', 'this', 'system', 'however', 'we', 'will', 'use', 'a', 'propose', 'and', 'use', 'a', 'new', 'numerical', 'method', 'which', 'we', 'will', 'call', 'as', 'the', 'two', 'step', 'rungekutta', 'method', 'for', 'analyzing', 'this', 'system']] | [-0.12670476486641538, 0.08646525015474837, -0.15198549325364308, 0.11622884786429329, -0.08409095144992985, -0.15078926476256904, -0.04217235398651827, 0.36295581021593937, -0.2965238816062108, -0.27110940456356203, 0.10852197056461058, -0.23809786917590495, -0.18858529107299113, 0.2292028535328327, -0.0886980495522431, 0.06144803252344558, 0.032703427798670096, 0.03968374332500656, -0.0946387111141513, -0.2100443203865183, 0.2828318024665083, 0.09457242255496424, 0.22586904750461903, 0.02663114892293212, 0.11651189622699941, 0.005437505491282962, 0.03791197528635416, 0.0829736641864506, -0.12523441484201045, 0.09476012236293439, 0.22792808972448622, 0.10871262767954533, 0.2509359837971081, -0.4300542525571147, -0.25650521868908216, 0.07344568396038419, 0.18169903831231757, 0.2044568784078882, -0.04233938775403391, -0.2707929768932795, 0.0701730160230617, -0.20528967227410833, -0.1812820525737394, -0.08822192193581424, 0.03889686420374046, -0.0012718968508859088, -0.19677695074682594, 0.025756146552798405, 0.0557352558393544, -9.77643793277921e-05, -0.018891773227209207, -0.048285544559427906, 0.055552691319495986, 0.10483566298867243, 0.03908188588951433, 0.05689308527854929, 0.067477008861857, -0.07697101771177878, -0.10809506421669497, 0.4130794150421584, -0.09339813949377916, -0.2212514547084313, 0.1674477206019753, -0.08277054365997741, -0.09751354091706763, 0.07754441207582387, 0.178203017307753, 0.14541348218148864, -0.19066453446130002, 0.11610323879889153, -0.04263119557295678, 0.17748081587348988, 0.06079758734895139, 0.06115794211274671, 0.20912218008856845, 0.17003326343560438, 0.0537331764417521, 0.11959206885786368, -0.06665382323089192, -0.09104974532031045, -0.3384287653623337, -0.16500311553822147, -0.19010144706020868, 0.12444575017200914, -0.07213060104329815, -0.149113626526925, 0.33206519713505694, 0.15792136898460807, 0.13207749269236255, 0.018774893033903502, 0.2791833526224171, 0.1829045369800334, 0.07200865399032626, 0.03822220169400813, 0.28693148684730635, 0.11766633722790167, 0.10769229809275119, -0.20891388632392366, 0.015826385718163683, 0.10926962439013525] |
1,802.09917 | Extraction of V2V Encountering Scenarios from Naturalistic Driving
Database | It is necessary to thoroughly evaluate the effectiveness and safety of
Connected Vehicles (CVs) algorithm before their release and deployment. Current
evaluation approach mainly relies on simulation platform with the
single-vehicle driving model. The main drawback of it is the lack of network
realism. To overcome this problem, we extract naturalistic V2V encounters data
from the database, and then separate the primary vehicle encounter category by
clustering. A fast mining algorithm is proposed that can be applied to parallel
query for further process acceleration. 4,500 encounters are mined from a 275
GB database collected in the Safety Pilot Model Program in Ann Arbor Michigan,
USA. K-means and Dynamic Time Warping (DTW) are used in clustering. Results
show this method can quickly mine and cluster primary driving scenarios from a
large database. Our results separate the car-following, intersection and
by-passing, which are the primary category of the vehicle encounter. We
anticipate the work in the essay can become a general method to effectively
extract vehicle encounters from any existing database that contains vehicular
GPS information. What's more, the naturalistic data of different vehicle
encounters can be applied in Connected Vehicles evaluation.
| cs.LG cs.CV | it is necessary to thoroughly evaluate the effectiveness and safety of connected vehicles cvs algorithm before their release and deployment current evaluation approach mainly relies on simulation platform with the singlevehicle driving model the main drawback of it is the lack of network realism to overcome this problem we extract naturalistic v2v encounters data from the database and then separate the primary vehicle encounter category by clustering a fast mining algorithm is proposed that can be applied to parallel query for further process acceleration 4500 encounters are mined from a 275 gb database collected in the safety pilot model program in ann arbor michigan usa kmeans and dynamic time warping dtw are used in clustering results show this method can quickly mine and cluster primary driving scenarios from a large database our results separate the carfollowing intersection and bypassing which are the primary category of the vehicle encounter we anticipate the work in the essay can become a general method to effectively extract vehicle encounters from any existing database that contains vehicular gps information whats more the naturalistic data of different vehicle encounters can be applied in connected vehicles evaluation | [['it', 'is', 'necessary', 'to', 'thoroughly', 'evaluate', 'the', 'effectiveness', 'and', 'safety', 'of', 'connected', 'vehicles', 'cvs', 'algorithm', 'before', 'their', 'release', 'and', 'deployment', 'current', 'evaluation', 'approach', 'mainly', 'relies', 'on', 'simulation', 'platform', 'with', 'the', 'singlevehicle', 'driving', 'model', 'the', 'main', 'drawback', 'of', 'it', 'is', 'the', 'lack', 'of', 'network', 'realism', 'to', 'overcome', 'this', 'problem', 'we', 'extract', 'naturalistic', 'v2v', 'encounters', 'data', 'from', 'the', 'database', 'and', 'then', 'separate', 'the', 'primary', 'vehicle', 'encounter', 'category', 'by', 'clustering', 'a', 'fast', 'mining', 'algorithm', 'is', 'proposed', 'that', 'can', 'be', 'applied', 'to', 'parallel', 'query', 'for', 'further', 'process', 'acceleration', '4500', 'encounters', 'are', 'mined', 'from', 'a', '275', 'gb', 'database', 'collected', 'in', 'the', 'safety', 'pilot', 'model', 'program', 'in', 'ann', 'arbor', 'michigan', 'usa', 'kmeans', 'and', 'dynamic', 'time', 'warping', 'dtw', 'are', 'used', 'in', 'clustering', 'results', 'show', 'this', 'method', 'can', 'quickly', 'mine', 'and', 'cluster', 'primary', 'driving', 'scenarios', 'from', 'a', 'large', 'database', 'our', 'results', 'separate', 'the', 'carfollowing', 'intersection', 'and', 'bypassing', 'which', 'are', 'the', 'primary', 'category', 'of', 'the', 'vehicle', 'encounter', 'we', 'anticipate', 'the', 'work', 'in', 'the', 'essay', 'can', 'become', 'a', 'general', 'method', 'to', 'effectively', 'extract', 'vehicle', 'encounters', 'from', 'any', 'existing', 'database', 'that', 'contains', 'vehicular', 'gps', 'information', 'whats', 'more', 'the', 'naturalistic', 'data', 'of', 'different', 'vehicle', 'encounters', 'can', 'be', 'applied', 'in', 'connected', 'vehicles', 'evaluation']] | [-0.10543342482629477, 0.01624100277488316, -0.1101743799597515, 0.07433421646807178, -0.11209053650351339, -0.13827297694392895, 0.051098992396146056, 0.3835233014763186, -0.28142584325549636, -0.3675140475413125, 0.11057223153613066, -0.29291359304793574, -0.14643373112439326, 0.21175327678211034, -0.13678769770960666, 0.053815840579275236, 0.15556367488553455, 0.03983549040889269, 0.04386802024551128, -0.268103068018038, 0.29110490238588105, 0.024222272217861916, 0.3233463144763128, 0.02624018710400713, 0.062407328113362096, -0.006669031864791912, -0.046342161846788306, -0.004459161380624497, -0.03799894363167512, 0.1283036745876368, 0.3152871113662657, 0.2411484738591274, 0.29079316060524435, -0.4395214084021159, -0.1815321429730638, 0.0793582729658259, 0.14459357895202152, 0.1021870958281828, -0.01678564885706261, -0.36532066811464337, 0.11157238195086584, -0.2132207973149458, -0.06898573921552222, -0.060591301508247854, 0.010232088901102544, 0.03134618898314473, -0.2671239790555678, 0.01921255085127134, -0.0016456280908498325, 0.06445601303130388, -0.07564739275625662, -0.055949462541550594, 0.0029627123565756177, 0.18782478622405938, 0.05034565189837993, 0.07348890779785028, 0.18379584144261715, -0.09170174950585964, -0.12610888914817847, 0.40371708070957346, 0.008497629417596679, -0.13178357082468115, 0.21177982657804692, -0.05097976746772857, -0.13897213885364565, 0.11370949345199685, 0.2517973463835293, 0.10512465810231668, -0.21603741665909948, 0.002349402699742074, -0.0022321670708295546, 0.15243713100881953, 0.057041356074133596, -0.0730825528462638, 0.16962766245399652, 0.2184900658474745, 0.0694765914145759, 0.11860821742907558, -0.13808391940730966, -0.1024525334813485, -0.22845927324562676, -0.09746354348271301, -0.19020882048153956, -0.012199101184102657, -0.08585250721218089, -0.08649211939375259, 0.3607649503079684, 0.26357784069780454, 0.14281246134472128, 0.050502003166260884, 0.37081641298473667, 0.031244966292778325, 0.09848976367471837, 0.12693587439012174, 0.18548804714932646, 0.0032652556675633318, 0.15458426809085435, -0.1863398776022031, 0.09776963927709546, 0.034446337484558553] |
1,802.09918 | Centrality and transverse momentum dependent suppression of
$\Upsilon(1S)$ and $\Upsilon(2S)$ in p$-$Pb and Pb$-$Pb collisions at the
CERN Large Hadron Collider | Deconfined QCD matter in heavy-ion collisions has been a topic of paramount
interest for many years. Quarkonia suppression in heavy-ion collisions at the
Relativistic Heavy Ion Collider (RHIC) and Large Hadron Collider (LHC)
experiments indicate the quark-gluon plasma (QGP) formation in such collisions.
Recent experiments at LHC has given some indications of hot matter effect in
asymmetric p$-$Pb nuclear collisions. Here, we employ a theoretical model to
investigate the bottomonium suppression in Pb$-$Pb at $\sqrt{s_{NN}}=2.76$,
$5.02$ TeV, and in p$-$Pb at $\sqrt{s_{NN}}=5.02$ TeV center-of-mass energies
under a QGP formation scenario. Our present formulation is based on a unified
model consisting of suppression due to color screening, gluonic dissociation
along with the collisional damping. Regeneration due to correlated $Q\bar Q$
pairs has also been taken into account in the current work. We obtain here the
net bottomonium suppression in terms of survival probability under the combined
effect of suppression plus regeneration in the deconfined QGP medium. We mainly
concentrate here on the centrality, $N_\text{part}$ and transverse momentum,
$(p_{t})$ dependence of $\Upsilon(1S)$ and $ \Upsilon(2S)$ states suppression
in Pb$-$Pb and p$-$Pb collisions at mid-rapidity. We compare our model
predictions for $\Upsilon(1S)$ and $\Upsilon(2S)$ suppression to the
corresponding experimental data obtained at the LHC. We find that the
experimental observations on $p_t$ and $N_\text{part}$ dependent suppression
agree reasonably well with our model predictions.
| hep-ph | deconfined qcd matter in heavyion collisions has been a topic of paramount interest for many years quarkonia suppression in heavyion collisions at the relativistic heavy ion collider rhic and large hadron collider lhc experiments indicate the quarkgluon plasma qgp formation in such collisions recent experiments at lhc has given some indications of hot matter effect in asymmetric ppb nuclear collisions here we employ a theoretical model to investigate the bottomonium suppression in pbpb at sqrts_nn276 502 tev and in ppb at sqrts_nn502 tev centerofmass energies under a qgp formation scenario our present formulation is based on a unified model consisting of suppression due to color screening gluonic dissociation along with the collisional damping regeneration due to correlated qbar q pairs has also been taken into account in the current work we obtain here the net bottomonium suppression in terms of survival probability under the combined effect of suppression plus regeneration in the deconfined qgp medium we mainly concentrate here on the centrality n_textpart and transverse momentum p_t dependence of upsilon1s and upsilon2s states suppression in pbpb and ppb collisions at midrapidity we compare our model predictions for upsilon1s and upsilon2s suppression to the corresponding experimental data obtained at the lhc we find that the experimental observations on p_t and n_textpart dependent suppression agree reasonably well with our model predictions | [['deconfined', 'qcd', 'matter', 'in', 'heavyion', 'collisions', 'has', 'been', 'a', 'topic', 'of', 'paramount', 'interest', 'for', 'many', 'years', 'quarkonia', 'suppression', 'in', 'heavyion', 'collisions', 'at', 'the', 'relativistic', 'heavy', 'ion', 'collider', 'rhic', 'and', 'large', 'hadron', 'collider', 'lhc', 'experiments', 'indicate', 'the', 'quarkgluon', 'plasma', 'qgp', 'formation', 'in', 'such', 'collisions', 'recent', 'experiments', 'at', 'lhc', 'has', 'given', 'some', 'indications', 'of', 'hot', 'matter', 'effect', 'in', 'asymmetric', 'ppb', 'nuclear', 'collisions', 'here', 'we', 'employ', 'a', 'theoretical', 'model', 'to', 'investigate', 'the', 'bottomonium', 'suppression', 'in', 'pbpb', 'at', 'sqrts_nn276', '502', 'tev', 'and', 'in', 'ppb', 'at', 'sqrts_nn502', 'tev', 'centerofmass', 'energies', 'under', 'a', 'qgp', 'formation', 'scenario', 'our', 'present', 'formulation', 'is', 'based', 'on', 'a', 'unified', 'model', 'consisting', 'of', 'suppression', 'due', 'to', 'color', 'screening', 'gluonic', 'dissociation', 'along', 'with', 'the', 'collisional', 'damping', 'regeneration', 'due', 'to', 'correlated', 'qbar', 'q', 'pairs', 'has', 'also', 'been', 'taken', 'into', 'account', 'in', 'the', 'current', 'work', 'we', 'obtain', 'here', 'the', 'net', 'bottomonium', 'suppression', 'in', 'terms', 'of', 'survival', 'probability', 'under', 'the', 'combined', 'effect', 'of', 'suppression', 'plus', 'regeneration', 'in', 'the', 'deconfined', 'qgp', 'medium', 'we', 'mainly', 'concentrate', 'here', 'on', 'the', 'centrality', 'n_textpart', 'and', 'transverse', 'momentum', 'p_t', 'dependence', 'of', 'upsilon1s', 'and', 'upsilon2s', 'states', 'suppression', 'in', 'pbpb', 'and', 'ppb', 'collisions', 'at', 'midrapidity', 'we', 'compare', 'our', 'model', 'predictions', 'for', 'upsilon1s', 'and', 'upsilon2s', 'suppression', 'to', 'the', 'corresponding', 'experimental', 'data', 'obtained', 'at', 'the', 'lhc', 'we', 'find', 'that', 'the', 'experimental', 'observations', 'on', 'p_t', 'and', 'n_textpart', 'dependent', 'suppression', 'agree', 'reasonably', 'well', 'with', 'our', 'model', 'predictions']] | [-0.026731757973384573, 0.26082095796971677, -0.19478364784661764, 0.134709942771747, 0.022986501678569266, -0.07570346216905062, -0.07923744231054228, 0.3561205436224671, -0.1427336054509633, -0.252276046120787, -0.09260782783773418, -0.395165190959698, 0.11204697809620126, 0.10207327204377956, 0.07807174500622298, 0.1302018317002718, 0.16055294368990175, -0.005354383881692881, -0.014870937978973736, -0.22188682882880714, 0.2696290175572939, 0.13050702583155335, 0.2501148123434451, 0.2711980150917919, 0.03373877471366038, 0.04916810478853512, -0.017980174159367472, -0.003004137756192385, -0.150792907214702, -0.00664833721507566, 0.30224164416715843, 4.7283576690851285e-06, 0.16733188637357937, -0.39148112279299185, -0.16980294749293834, 0.11882340567628746, 0.15291102190574282, 0.14302494532968765, -0.12672301517856907, -0.26614574400163743, 0.13581517837584428, -0.2872496763856648, -0.09584929364505883, -0.061545899002302486, 0.008922604701511528, -0.0475565557619004, -0.3294045395307141, 0.17052591597056974, -0.049262578403003104, 0.09463730745748979, -0.044374783437265315, -0.2173637719484701, -0.06878970275616027, -0.0819105898419748, 0.07868462549756412, 0.11717699363840463, 0.2137675114378937, -0.18355870694740672, -0.20582556394970716, 0.4069361219684419, -0.012937878751829607, -0.0689880137935655, 0.2148229126790836, -0.2375712457078947, -0.1758270389825684, 0.1568853283198933, 0.3204493272802941, 0.058672985176823726, -0.1517940849282664, 0.03218875408250218, -0.030129842688733515, 0.14019400231122184, 0.0977684284972886, 0.15189416605349818, 0.19821446187385958, 0.2544979033066751, -0.06988491977221592, 0.09405666500146312, -0.1003552630759529, -0.09200274731462064, -0.4330069993167571, -0.014339536241336501, -0.09476291886254397, 0.029383129738462604, -0.04459525693744074, -0.020439694977905515, 0.3677013842856775, 0.1356247732521845, 0.32582930689805173, -0.061891605378528336, 0.30974873714999523, 0.05934610307061424, 0.005052054164023245, 0.12716369576936642, 0.29246606881112036, 0.18125351338081708, 0.2434242463407009, -0.3340325565109259, 0.050076127803425165, 0.05237289214906491] |
1,802.09919 | Linear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$ | In this paper, we construct an infinite family of five-weight codes from
trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The
trace codes have the algebraic structure of abelian codes. Their Lee weight is
computed by using character sums. Combined with Pless power moments and
Newton's Identities, the weight distribution of the Gray image of trace codes
was present. Their support structure is determined. An application to secret
sharing schemes is given.
| cs.IT math.IT | in this paper we construct an infinite family of fiveweight codes from trace codes over the ring rmathbbf_2umathbbf_2 where u20 the trace codes have the algebraic structure of abelian codes their lee weight is computed by using character sums combined with pless power moments and newtons identities the weight distribution of the gray image of trace codes was present their support structure is determined an application to secret sharing schemes is given | [['in', 'this', 'paper', 'we', 'construct', 'an', 'infinite', 'family', 'of', 'fiveweight', 'codes', 'from', 'trace', 'codes', 'over', 'the', 'ring', 'rmathbbf_2umathbbf_2', 'where', 'u20', 'the', 'trace', 'codes', 'have', 'the', 'algebraic', 'structure', 'of', 'abelian', 'codes', 'their', 'lee', 'weight', 'is', 'computed', 'by', 'using', 'character', 'sums', 'combined', 'with', 'pless', 'power', 'moments', 'and', 'newtons', 'identities', 'the', 'weight', 'distribution', 'of', 'the', 'gray', 'image', 'of', 'trace', 'codes', 'was', 'present', 'their', 'support', 'structure', 'is', 'determined', 'an', 'application', 'to', 'secret', 'sharing', 'schemes', 'is', 'given']] | [-0.1918689205744107, 0.04100334698631113, -0.10511840654300972, 0.05539290280028863, -0.027855180158004374, -0.1604566144835676, -0.023930881829919214, 0.3767281345577097, -0.38543440107728394, -0.230355790908068, 0.11582273614599409, -0.2606024590491409, -0.10537159053320197, 0.17363434822731455, -0.09762759113185843, 0.042742711590261946, 0.0052315269426350865, 0.07252944238536374, -0.1408650315740526, -0.3455913443918484, 0.39701626916140526, 0.17259526877126224, 0.22807675933229252, -0.009064035162224735, 0.07951977973620236, -0.007828607906023381, -0.09947275863566869, -0.06255247311430498, -0.159251203806415, 0.16422684126677858, 0.25418751934398964, 0.140259802210289, 0.16467614495523378, -0.3433799022598795, -0.18509130876160448, 0.10456141534353226, 0.11674517238328994, 0.12207012702251824, -0.07735533816871089, -0.18991564487067747, 0.1410746169604466, -0.2530768953368697, -0.06209000010489368, -0.05432460809939764, 0.002307727618116728, 0.05607065382662793, -0.28932970765696076, -0.011073116095028293, 0.034375458050676634, 0.15786657753912076, -0.0678360782839148, -0.1456780356705897, 0.055625470073132864, 0.1376728103955237, -0.03454749765937072, 0.029739365689981152, 0.0355935871722439, -0.09124457790322837, -0.13625830928729454, 0.3542853108907289, -0.05205588662688634, -0.18785082581116896, 0.056137870977514645, -0.07882555759787349, -0.07933923379767319, 0.13986147677814456, 0.13906018740274537, 0.1350187109914464, -0.06924018281033184, 0.1633432058176406, -0.12925211254271193, 0.15474191665137843, 0.11673829363475383, 0.06076369880580566, 0.17116604626841161, -0.01613988080652247, -0.010317440036090721, 0.20698344327089652, -0.047266285086024394, -0.054017660581887186, -0.2539900628797395, -0.16424491600146596, -0.2247971667790077, 0.06856229356621248, -0.09970982749532403, -0.19319123458641935, 0.41824791181675147, 0.07024150173192922, 0.15365074176183888, 0.11475612729473013, 0.24357712533797177, 0.07747440714336618, 0.1571127612629092, 0.1557802523020655, 0.08267515108094249, 0.2371444543987565, -0.032658473324542206, -0.1845403196663976, 0.06570735876530436, 0.18491789240809814] |
1,802.0992 | Dimensional coupling induced current reversal in two-dimensional driven
lattices | We show that the direction of directed particle transport in a two
dimensional ac-driven lattice can be dynamically reversed by changing the
structure of the lattice in the direction perpendicular to the applied driving
force. These structural changes introduce dimensional coupling effects, the
strength of which governs the timescale of the current reversals. The
underlying mechanism is based on the fact that dimensional coupling allows the
particles to explore regions of phase space which are inaccessible otherwise.
The experimental realization for cold atoms in ac-driven optical lattices is
discussed.
| cond-mat.quant-gas cond-mat.stat-mech physics.atom-ph | we show that the direction of directed particle transport in a two dimensional acdriven lattice can be dynamically reversed by changing the structure of the lattice in the direction perpendicular to the applied driving force these structural changes introduce dimensional coupling effects the strength of which governs the timescale of the current reversals the underlying mechanism is based on the fact that dimensional coupling allows the particles to explore regions of phase space which are inaccessible otherwise the experimental realization for cold atoms in acdriven optical lattices is discussed | [['we', 'show', 'that', 'the', 'direction', 'of', 'directed', 'particle', 'transport', 'in', 'a', 'two', 'dimensional', 'acdriven', 'lattice', 'can', 'be', 'dynamically', 'reversed', 'by', 'changing', 'the', 'structure', 'of', 'the', 'lattice', 'in', 'the', 'direction', 'perpendicular', 'to', 'the', 'applied', 'driving', 'force', 'these', 'structural', 'changes', 'introduce', 'dimensional', 'coupling', 'effects', 'the', 'strength', 'of', 'which', 'governs', 'the', 'timescale', 'of', 'the', 'current', 'reversals', 'the', 'underlying', 'mechanism', 'is', 'based', 'on', 'the', 'fact', 'that', 'dimensional', 'coupling', 'allows', 'the', 'particles', 'to', 'explore', 'regions', 'of', 'phase', 'space', 'which', 'are', 'inaccessible', 'otherwise', 'the', 'experimental', 'realization', 'for', 'cold', 'atoms', 'in', 'acdriven', 'optical', 'lattices', 'is', 'discussed']] | [-0.1810691669384499, 0.26500723834327433, -0.04216037240674656, 0.007817079179679578, -0.07351339166837462, -0.10552236693649647, 0.019478432072870686, 0.40243771718291754, -0.3446761295513323, -0.23457327317655757, 0.054908091423436584, -0.19599381342724495, -0.13728307687750693, 0.17477334027696567, 0.035239834600034055, -0.013600768040070373, 0.019086776364050553, 0.0037284571300731616, -0.015103865336375625, -0.20758042921406333, 0.31673267792931264, 0.03314281157165598, 0.309723550767711, 0.049913168382527455, 0.08138459057578545, 0.019769760664929165, 0.039286604810380536, 0.05381924465260719, -0.1405317260515209, 0.11191643852411227, 0.17018167592919944, -0.04385202657954579, 0.1978637346124088, -0.4688548291248552, -0.22719439979265915, 0.07987457364431341, 0.15119862987063407, 0.15542962022774506, -0.0556890746327431, -0.2694546935054358, -0.0029462757677342116, -0.09441889408096839, -0.14864170525924125, -0.06711134201784232, 0.015002827997204293, 0.03883393881109993, -0.2763877334995352, 0.07194222635955791, 0.06115979556350058, 0.04360887107931161, -0.06669804595968047, -0.04678323090055518, -0.03313199564647139, 0.09158492443057593, 0.02837528543170081, 0.04287886868618178, 0.1829030076303425, -0.131586053317692, -0.1455465169058422, 0.4153036055772492, -0.056178020148569444, -0.19595384293267232, 0.21919982795331502, -0.16016181014750278, -0.083978595845192, 0.11594946765121114, 0.1597929485770089, 0.07380698247697581, -0.11620920451339649, 0.10204571529469464, -0.040853902671402424, 0.1661079731884967, 0.031667183283808, 0.03897846647240012, 0.23429466991716724, 0.17100906486654383, 0.08134817593113593, 0.17545353417059803, -0.11278513063718512, -0.15313663394347335, -0.266195571510477, -0.13062848625286075, -0.17919814608614432, 0.035360410961249235, -0.07903407426718413, -0.14165589446986743, 0.42266258243157456, 0.20306923406347738, 0.21093862527311685, -0.07006701397015634, 0.26395893693258043, 0.12439964585048094, 0.0791523284697382, 0.030652933442714008, 0.29337318804575485, 0.1423819509538916, 0.07801572007932857, -0.29354896482205795, 0.06445105719083156, 0.08247449651643048] |
1,802.09921 | Approximating the Region of Multi-Task Coordination via the Optimal
Lyapunov-Like Barrier Function | We consider the multi-task coordination problem for multi-agent systems under
the following objectives: 1. collision avoidance; 2. connectivity maintenance;
3. convergence to desired destinations. The paper focuses on the safety
guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of
initial states from which all trajectories converge to the desired
configuration, while at the same time achieve the multi-task coordination and
avoid unsafe sets. In contrast to estimating the domain of attraction via
Lyapunov functions, the main underlying idea is to employ the sublevel sets of
Lyapunov-like barrier functions to approximate the SG-RMTC. Rather than using
fixed Lyapunov-like barrier functions, a systematic way is proposed to search
an optimal Lyapunov-like barrier function such that the under-estimate of
SG-RMTC is maximized. Numerical examples illustrate the effectiveness of the
proposed method.
| cs.SY | we consider the multitask coordination problem for multiagent systems under the following objectives 1 collision avoidance 2 connectivity maintenance 3 convergence to desired destinations the paper focuses on the safety guaranteed region of multitask coordination sgrmtc ie the set of initial states from which all trajectories converge to the desired configuration while at the same time achieve the multitask coordination and avoid unsafe sets in contrast to estimating the domain of attraction via lyapunov functions the main underlying idea is to employ the sublevel sets of lyapunovlike barrier functions to approximate the sgrmtc rather than using fixed lyapunovlike barrier functions a systematic way is proposed to search an optimal lyapunovlike barrier function such that the underestimate of sgrmtc is maximized numerical examples illustrate the effectiveness of the proposed method | [['we', 'consider', 'the', 'multitask', 'coordination', 'problem', 'for', 'multiagent', 'systems', 'under', 'the', 'following', 'objectives', '1', 'collision', 'avoidance', '2', 'connectivity', 'maintenance', '3', 'convergence', 'to', 'desired', 'destinations', 'the', 'paper', 'focuses', 'on', 'the', 'safety', 'guaranteed', 'region', 'of', 'multitask', 'coordination', 'sgrmtc', 'ie', 'the', 'set', 'of', 'initial', 'states', 'from', 'which', 'all', 'trajectories', 'converge', 'to', 'the', 'desired', 'configuration', 'while', 'at', 'the', 'same', 'time', 'achieve', 'the', 'multitask', 'coordination', 'and', 'avoid', 'unsafe', 'sets', 'in', 'contrast', 'to', 'estimating', 'the', 'domain', 'of', 'attraction', 'via', 'lyapunov', 'functions', 'the', 'main', 'underlying', 'idea', 'is', 'to', 'employ', 'the', 'sublevel', 'sets', 'of', 'lyapunovlike', 'barrier', 'functions', 'to', 'approximate', 'the', 'sgrmtc', 'rather', 'than', 'using', 'fixed', 'lyapunovlike', 'barrier', 'functions', 'a', 'systematic', 'way', 'is', 'proposed', 'to', 'search', 'an', 'optimal', 'lyapunovlike', 'barrier', 'function', 'such', 'that', 'the', 'underestimate', 'of', 'sgrmtc', 'is', 'maximized', 'numerical', 'examples', 'illustrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.13002378448064245, 0.006501007403807477, -0.06727825434762956, 0.09118326732711939, -0.030975778498722947, -0.11630353269116707, 0.09871705686005713, 0.366414296946149, -0.295679854044994, -0.28905127184147866, 0.0704906816087129, -0.24714619984539846, -0.11979345597016315, 0.1287232159308425, -0.09042435842579728, 0.12736192399043908, 0.05615466353375205, 0.01659266039180432, -0.046494910361736204, -0.23874419853145387, 0.36609635840516624, 0.048375531265786455, 0.29860952383181616, 0.055581652607620775, 0.10716253819030731, 0.026516498201174746, 0.04143746069798521, -0.01770544173232056, -0.11664760947010215, 0.13354227951476927, 0.28439169442606005, 0.17603470454021364, 0.3638035197879455, -0.4077221850319513, -0.16929528876496552, 0.14009318228038534, 0.15385374120732612, 0.06629653839672403, -0.016990515221155775, -0.2807286413162658, 0.12866660394676954, -0.13464814166415684, -0.13556943435669522, -0.06413762385834211, -0.03902719758609815, 0.08437858498790626, -0.33889033415087666, 0.00974037836110869, 0.04332550065303149, 0.04596155303595371, -0.10742298382796463, -0.11267505743533604, -0.017364180919374955, 0.12757516140840197, 0.040877812041164654, 0.04351839867182249, 0.16416466456310924, -0.09641119216834086, -0.1442331397010721, 0.3440313029586691, 0.036989649305956676, -0.22837021006560027, 0.20030809340406527, -0.08903589679375869, -0.09209823041302405, 0.13333839528053248, 0.20573154366719573, 0.14028489942727393, -0.16629544273379815, 0.06130938912703937, 0.004918415545189912, 0.15091912288854056, 0.09489057958848024, -0.006849296632865372, 0.09887528619837276, 0.1952098493492267, 0.20502944254179217, 0.15698322746180748, -0.05168355035942134, -0.16395515285056922, -0.3093818722711515, -0.08889249721614197, -0.19805636088085873, -0.033618280140668616, -0.10534181072665, -0.14003111651643765, 0.3831665694655836, 0.1638233451634761, 0.17328824520890795, 0.15174662480906895, 0.3134591180773437, 0.121576984080079, 0.05347244739315884, 0.08964328094233953, 0.19829854624735754, 0.035925978572692634, 0.06575982223261263, -0.2527034749230009, 0.12589746648662312, 0.06655643148665395] |
1,802.09922 | Universal voltage scaling due to self-averaging of the quantum
corrections in graphene | The differential conductance of graphene is shown to exhibit a zero-bias
anomaly at low temperatures, arising from a suppression of the quantum
corrections due to weak localization and electron interactions. A simple
rescaling of these data, free of any adjustable parameters, shows that this
anomaly exhibits a universal, temperature- ($T$) independent form. According to
this, the differential conductance is approximately constant at small voltages
($V<k_BT/e$), while at larger voltages it increases logarithmically with the
applied bias, reflecting a quenching of the quantum corrections. For
theoretical insight into the origins of this behavior, we formulate a model for
weak-localization in the presence of nonlinear transport. According to this,
the voltage applied under nonequilibrium induces unavoidable dephasing, arising
from a self-averaging of the diffusing electron waves responsible for
transport. By establishing the manner in which the quantum corrections are
suppressed in graphene, our study will be of broad relevance to the
investigation of nonequilibrium transport in mesoscopic systems in general.
This includes systems implemented from conventional metals and semiconductors,
as well as those realized using other two-dimensional semiconductors and
topological insulators.
| cond-mat.mes-hall cond-mat.dis-nn | the differential conductance of graphene is shown to exhibit a zerobias anomaly at low temperatures arising from a suppression of the quantum corrections due to weak localization and electron interactions a simple rescaling of these data free of any adjustable parameters shows that this anomaly exhibits a universal temperature t independent form according to this the differential conductance is approximately constant at small voltages vk_bte while at larger voltages it increases logarithmically with the applied bias reflecting a quenching of the quantum corrections for theoretical insight into the origins of this behavior we formulate a model for weaklocalization in the presence of nonlinear transport according to this the voltage applied under nonequilibrium induces unavoidable dephasing arising from a selfaveraging of the diffusing electron waves responsible for transport by establishing the manner in which the quantum corrections are suppressed in graphene our study will be of broad relevance to the investigation of nonequilibrium transport in mesoscopic systems in general this includes systems implemented from conventional metals and semiconductors as well as those realized using other twodimensional semiconductors and topological insulators | [['the', 'differential', 'conductance', 'of', 'graphene', 'is', 'shown', 'to', 'exhibit', 'a', 'zerobias', 'anomaly', 'at', 'low', 'temperatures', 'arising', 'from', 'a', 'suppression', 'of', 'the', 'quantum', 'corrections', 'due', 'to', 'weak', 'localization', 'and', 'electron', 'interactions', 'a', 'simple', 'rescaling', 'of', 'these', 'data', 'free', 'of', 'any', 'adjustable', 'parameters', 'shows', 'that', 'this', 'anomaly', 'exhibits', 'a', 'universal', 'temperature', 't', 'independent', 'form', 'according', 'to', 'this', 'the', 'differential', 'conductance', 'is', 'approximately', 'constant', 'at', 'small', 'voltages', 'vk_bte', 'while', 'at', 'larger', 'voltages', 'it', 'increases', 'logarithmically', 'with', 'the', 'applied', 'bias', 'reflecting', 'a', 'quenching', 'of', 'the', 'quantum', 'corrections', 'for', 'theoretical', 'insight', 'into', 'the', 'origins', 'of', 'this', 'behavior', 'we', 'formulate', 'a', 'model', 'for', 'weaklocalization', 'in', 'the', 'presence', 'of', 'nonlinear', 'transport', 'according', 'to', 'this', 'the', 'voltage', 'applied', 'under', 'nonequilibrium', 'induces', 'unavoidable', 'dephasing', 'arising', 'from', 'a', 'selfaveraging', 'of', 'the', 'diffusing', 'electron', 'waves', 'responsible', 'for', 'transport', 'by', 'establishing', 'the', 'manner', 'in', 'which', 'the', 'quantum', 'corrections', 'are', 'suppressed', 'in', 'graphene', 'our', 'study', 'will', 'be', 'of', 'broad', 'relevance', 'to', 'the', 'investigation', 'of', 'nonequilibrium', 'transport', 'in', 'mesoscopic', 'systems', 'in', 'general', 'this', 'includes', 'systems', 'implemented', 'from', 'conventional', 'metals', 'and', 'semiconductors', 'as', 'well', 'as', 'those', 'realized', 'using', 'other', 'twodimensional', 'semiconductors', 'and', 'topological', 'insulators']] | [-0.15144129952231392, 0.17642031378751055, -0.06416325466910094, 0.04699757740390749, 0.001473801308625451, -0.18155383582624576, 0.047528247055963854, 0.31271600815875644, -0.2886211752860148, -0.28794679089104025, 0.011655265708019684, -0.2943853154527337, -0.13987114706882434, 0.22464431751011923, -0.01696799276919847, 0.03788289262682953, -0.011884671578372127, -0.020977224640906632, -0.07914354277495425, -0.18345557754922115, 0.29714955553265937, 0.04387409883103951, 0.3015553385249517, 0.10667812655348947, 0.07984274704325839, -0.0028251645657537358, 0.03957232310658378, 0.08410829448151295, -0.11944791621528075, 0.0483480532172272, 0.26929099696133746, -0.09085521571900797, 0.21949733631056537, -0.4222798257741784, -0.2378830688068999, 0.02993832504719475, 0.12224422215897422, 0.17748471652098335, -0.07750926286065846, -0.2642857644555232, 0.06410053841183695, -0.1366137301214458, -0.1120997844041545, -0.07228059118896137, -0.005829227081070957, -0.0007688466729622418, -0.2623396795923204, 0.13488780303722184, 0.06896706778370368, 0.056122975034136956, -0.035409739468602486, -0.08336064504038312, -0.016084807945854877, 0.10421289100976834, 0.04426306212684558, 0.002291418997874337, 0.19469320086050737, -0.13965829117668352, -0.10963745024892387, 0.40385628147364666, -0.08667538604918826, -0.13165264856985906, 0.18918615600010485, -0.1676847734567029, -0.08464398396052969, 0.16185013589899191, 0.14240894818631408, 0.07661609466219049, -0.17075879859811302, 0.09525257297134251, 0.020860498145829593, 0.12283845278408295, 0.023113528997741974, 0.08473045458092375, 0.24696113921053123, 0.17567083425819874, 0.061120463624136166, 0.14902052663108387, -0.07082186110077028, -0.07992534281874306, -0.3057149644899234, -0.13445941477312884, -0.17665690366895556, 0.13355711815365998, -0.05368560910451532, -0.196513111096659, 0.4100689240351968, 0.17943984622219472, 0.21883164827575843, 0.012521201853896753, 0.268710525342776, 0.18975907485092353, 0.11374287898495292, 0.028074098698463907, 0.22089683981298397, 0.1639030296708656, 0.12370124843175617, -0.2951280563556997, 0.07830773020330607, -0.004206239873689882] |
1,802.09923 | Coadjoint orbits of Lie groupoids | For a Lie groupoid $\mathcal{G}$ with Lie algebroid $A$, we realize the
symplectic leaves of the Lie-Poisson structure on $A^*$ as orbits of the affine
coadjoint action of the Lie groupoid $\mathcal{J}\mathcal{G}\ltimes T^*M$ on
$A^*$, which coincide with the groupoid orbits of the symplectic groupoid
$T^*\mathcal{G}$ over $A^*$. It is also shown that there is a fiber bundle
structure on each symplectic leaf. In the case of gauge groupoids, a symplectic
leaf is the universal phase space for a classical particle in a Yang-Mills
field.
| math.DG math-ph math.MP | for a lie groupoid mathcalg with lie algebroid a we realize the symplectic leaves of the liepoisson structure on a as orbits of the affine coadjoint action of the lie groupoid mathcaljmathcalgltimes tm on a which coincide with the groupoid orbits of the symplectic groupoid tmathcalg over a it is also shown that there is a fiber bundle structure on each symplectic leaf in the case of gauge groupoids a symplectic leaf is the universal phase space for a classical particle in a yangmills field | [['for', 'a', 'lie', 'groupoid', 'mathcalg', 'with', 'lie', 'algebroid', 'a', 'we', 'realize', 'the', 'symplectic', 'leaves', 'of', 'the', 'liepoisson', 'structure', 'on', 'a', 'as', 'orbits', 'of', 'the', 'affine', 'coadjoint', 'action', 'of', 'the', 'lie', 'groupoid', 'mathcaljmathcalgltimes', 'tm', 'on', 'a', 'which', 'coincide', 'with', 'the', 'groupoid', 'orbits', 'of', 'the', 'symplectic', 'groupoid', 'tmathcalg', 'over', 'a', 'it', 'is', 'also', 'shown', 'that', 'there', 'is', 'a', 'fiber', 'bundle', 'structure', 'on', 'each', 'symplectic', 'leaf', 'in', 'the', 'case', 'of', 'gauge', 'groupoids', 'a', 'symplectic', 'leaf', 'is', 'the', 'universal', 'phase', 'space', 'for', 'a', 'classical', 'particle', 'in', 'a', 'yangmills', 'field']] | [-0.24822807016765633, 0.09351186199584999, -0.11636155071746872, 0.05050391159076468, -0.16702019651027689, -0.0905046555864434, 0.0007047438657427408, 0.40443615368511304, -0.31324771289006775, -0.14911680862711496, 0.07030920024978064, -0.20826932019273559, -0.19617301571261453, 0.2003561758144523, -0.1806997323678021, -0.04508879155422707, 0.1327417933056692, 0.2208123313268669, -0.16929362269668244, -0.19520917798235385, 0.47810407072664746, 0.017671318180544907, 0.208912246849343, -0.04041065324479377, 0.23114230755312615, -0.03732838751523789, 0.06421163004924016, -0.01299645514430826, -0.08169874857807131, 0.06879628964711025, 0.2897811369319637, -0.017340856020798885, 0.15425004980089255, -0.32842496542417143, -0.15667365137936481, 0.1265946406848639, 0.09528630176357117, -0.0023936560133427202, -0.020065523907037294, -0.33941358205278865, 0.060820757484355246, -0.18702193957203664, -0.1304843836051625, -0.04786506995379207, 0.08065210406932172, -0.05631064935531243, -0.14096476090651186, -0.06763303369958323, 0.11470049764422408, 0.11772250899124935, -0.07719809261251645, -0.016661511072103518, -0.15577200607183467, 0.03965810958453151, -0.06080061271057341, 0.10836393553875835, 0.20104696637535668, -0.04604476241462202, -0.1373538423823305, 0.4905738803636597, -0.05219556491664914, -0.3076964633157813, 0.1028021540358124, -0.1577546506115875, -0.22870959518813944, 0.16026402166090817, 0.07394547588248031, 0.1354086190933384, -0.016748290229869265, 0.23087866679507207, -0.13252679274294032, 0.0033373625006481826, 0.07690041255295636, -0.03303322888888329, 0.16424009672938342, 0.1991405620924141, 0.15524825785892554, 0.039501983021576724, 0.010407960454720151, -0.08618913225111473, -0.35755087785333034, -0.2647063719271402, -0.06640652964362898, 0.16345251880092435, -0.1193782065108598, -0.209397423991033, 0.4409414182125355, 0.050216232406126944, 0.2303668293170631, 0.13576577564684608, 0.22209107361913447, 0.07750139443809728, 0.11763987529753561, 0.06704273141628828, 0.16310046264811992, 0.2831204480278384, -0.05343064292283527, -0.15089151810248752, -0.14513867154874535, 0.20932183033192014] |
1,802.09924 | Introduction to the SP theory of intelligence | This article provides a brief introduction to the "Theory of Intelligence"
and its realisation in the "SP Computer Model". The overall goal of the SP
programme of research, in accordance with long-established principles in
science, has been the simplification and integration of observations and
concepts across artificial intelligence, mainstream computing, mathematics, and
human learning, perception, and cognition. In broad terms, the SP system is a
brain-like system that takes in "New" information through its senses and stores
some or all of it as "Old" information. A central idea in the system is the
powerful concept of "SP-multiple-alignment", borrowed and adapted from
bioinformatics. This the key to the system's versatility in aspects of
intelligence, in the representation of diverse kinds of knowledge, and in the
seamless integration of diverse aspects of intelligence and diverse kinds of
knowledge, in any combination. There are many potential benefits and
applications of the SP system. It is envisaged that the system will be
developed as the "SP Machine", which will initially be a software virtual
machine, hosted on a high-performance computer, a vehicle for further research
and a step towards the development of an industrial-strength SP Machine.
| cs.AI | this article provides a brief introduction to the theory of intelligence and its realisation in the sp computer model the overall goal of the sp programme of research in accordance with longestablished principles in science has been the simplification and integration of observations and concepts across artificial intelligence mainstream computing mathematics and human learning perception and cognition in broad terms the sp system is a brainlike system that takes in new information through its senses and stores some or all of it as old information a central idea in the system is the powerful concept of spmultiplealignment borrowed and adapted from bioinformatics this the key to the systems versatility in aspects of intelligence in the representation of diverse kinds of knowledge and in the seamless integration of diverse aspects of intelligence and diverse kinds of knowledge in any combination there are many potential benefits and applications of the sp system it is envisaged that the system will be developed as the sp machine which will initially be a software virtual machine hosted on a highperformance computer a vehicle for further research and a step towards the development of an industrialstrength sp machine | [['this', 'article', 'provides', 'a', 'brief', 'introduction', 'to', 'the', 'theory', 'of', 'intelligence', 'and', 'its', 'realisation', 'in', 'the', 'sp', 'computer', 'model', 'the', 'overall', 'goal', 'of', 'the', 'sp', 'programme', 'of', 'research', 'in', 'accordance', 'with', 'longestablished', 'principles', 'in', 'science', 'has', 'been', 'the', 'simplification', 'and', 'integration', 'of', 'observations', 'and', 'concepts', 'across', 'artificial', 'intelligence', 'mainstream', 'computing', 'mathematics', 'and', 'human', 'learning', 'perception', 'and', 'cognition', 'in', 'broad', 'terms', 'the', 'sp', 'system', 'is', 'a', 'brainlike', 'system', 'that', 'takes', 'in', 'new', 'information', 'through', 'its', 'senses', 'and', 'stores', 'some', 'or', 'all', 'of', 'it', 'as', 'old', 'information', 'a', 'central', 'idea', 'in', 'the', 'system', 'is', 'the', 'powerful', 'concept', 'of', 'spmultiplealignment', 'borrowed', 'and', 'adapted', 'from', 'bioinformatics', 'this', 'the', 'key', 'to', 'the', 'systems', 'versatility', 'in', 'aspects', 'of', 'intelligence', 'in', 'the', 'representation', 'of', 'diverse', 'kinds', 'of', 'knowledge', 'and', 'in', 'the', 'seamless', 'integration', 'of', 'diverse', 'aspects', 'of', 'intelligence', 'and', 'diverse', 'kinds', 'of', 'knowledge', 'in', 'any', 'combination', 'there', 'are', 'many', 'potential', 'benefits', 'and', 'applications', 'of', 'the', 'sp', 'system', 'it', 'is', 'envisaged', 'that', 'the', 'system', 'will', 'be', 'developed', 'as', 'the', 'sp', 'machine', 'which', 'will', 'initially', 'be', 'a', 'software', 'virtual', 'machine', 'hosted', 'on', 'a', 'highperformance', 'computer', 'a', 'vehicle', 'for', 'further', 'research', 'and', 'a', 'step', 'towards', 'the', 'development', 'of', 'an', 'industrialstrength', 'sp', 'machine']] | [-0.07836394921872833, 0.05163285689477514, -0.11092571025173038, 0.02551309421417152, -0.09015856895605541, -0.10866612981741575, 0.009957371605682084, 0.3472701424186688, -0.2958082565160088, -0.33539465419870085, 0.11269951013224053, -0.25291132896831403, -0.21323197452029632, 0.24188225693678903, -0.10651537686972387, 0.03604641293312048, 0.0630627528274266, 0.05258037813290642, -0.006289264181121716, -0.2303096179957672, 0.2692404104425957, 0.039448107390406086, 0.33203338139510047, 0.04607764749997417, 0.09728965292445808, 0.01659913477487862, -0.022765762961337938, -0.011620226979294684, -0.05344683392662421, 0.24819054328062432, 0.3332667324097135, 0.25621409015120516, 0.3871361026881721, -0.43841964910440734, -0.20821316082137808, 0.032454870414495934, 0.12395384933748307, 0.08761721973475654, -0.059533009647528265, -0.2937820579622584, 0.07199602653894144, -0.188638481725963, -0.11199612929168797, -0.07027654271848324, 0.054045117623538405, 0.009106647210129834, -0.2018530699569203, -0.0650808138173093, 0.07655848817612138, 0.12529996851643826, -0.04622874174743077, -0.12082282498086369, 0.03872672195365916, 0.1809730431301451, 0.03088105725751049, 0.04988635244964578, 0.14269506486793443, -0.17518523536059952, -0.18811024268308937, 0.4183740318053114, -0.027875625494262934, -0.14194361225182875, 0.23680633844634644, -0.043409121737215686, -0.17527704335705266, 0.06414937277212349, 0.21351508484148854, 0.042066098544356556, -0.16657436259958835, 0.09668842225892625, 0.01955291543506983, 0.14331475042138267, -0.005461631584132373, 0.03471546509444558, 0.25085967818655425, 0.24339149016350586, 0.03431043321484973, 0.08727034653234661, -0.03451088915032905, -0.1536897244736435, -0.258479923514542, -0.21431654314291101, -0.17847350457956263, 0.005766483707017027, -0.04590740321724888, -0.12391031706578913, 0.3900746631790172, 0.18043040519358386, 0.10143982465817783, -0.011267667262801529, 0.3213206075219662, 0.05926964253416353, 0.09465883497035385, 0.05762098487027731, 0.18777906094541827, 0.07412047717349692, 0.1953334057537829, -0.15748072665365148, 0.048396313822638065, -0.005345876778461312] |
1,802.09925 | The Finite Difference Method, for the heat equation on Sierpi\'{n}ski
simplices | In the sequel, we extend our previous work on the Minkowski Curve to
Sierpi\'{n}ski simplices (Gasket and Tetrahedron), in the case of the heat
equation. First, we build the finite difference scheme. Then, we give a
theoretical study of the error, compute the scheme error, give stability
conditions, and prove the convergence of the scheme. Contrary to existing work,
we do not call for approximations of the eigenvalues.
| math.NA | in the sequel we extend our previous work on the minkowski curve to sierpinski simplices gasket and tetrahedron in the case of the heat equation first we build the finite difference scheme then we give a theoretical study of the error compute the scheme error give stability conditions and prove the convergence of the scheme contrary to existing work we do not call for approximations of the eigenvalues | [['in', 'the', 'sequel', 'we', 'extend', 'our', 'previous', 'work', 'on', 'the', 'minkowski', 'curve', 'to', 'sierpinski', 'simplices', 'gasket', 'and', 'tetrahedron', 'in', 'the', 'case', 'of', 'the', 'heat', 'equation', 'first', 'we', 'build', 'the', 'finite', 'difference', 'scheme', 'then', 'we', 'give', 'a', 'theoretical', 'study', 'of', 'the', 'error', 'compute', 'the', 'scheme', 'error', 'give', 'stability', 'conditions', 'and', 'prove', 'the', 'convergence', 'of', 'the', 'scheme', 'contrary', 'to', 'existing', 'work', 'we', 'do', 'not', 'call', 'for', 'approximations', 'of', 'the', 'eigenvalues']] | [-0.1068700926433153, -0.00921984005938558, -0.12538260478964625, 0.061536412261536014, -0.06903252692769885, -0.0749818759436226, 0.0854853139642407, 0.36039554240072474, -0.23241783244370975, -0.20844815538593514, 0.10547683975207345, -0.28197501186171875, -0.1617884591961389, 0.18596548110636993, -0.12744680168928907, 0.0764290465055691, 0.0664793681969647, 0.04667670781011967, -0.1135240319006912, -0.33470117955413814, 0.3583535427118049, 0.007318099495023489, 0.2821995695635183, 0.0903482921558487, 0.0735556543667746, -0.051643318236422014, -0.024398332523346385, -0.02370035245685893, -0.2580881801926914, 0.13537589062402464, 0.1809739498010672, 0.06947812294546406, 0.23499449355500368, -0.4267709009787616, -0.1870010357541854, 0.14751963036028695, 0.13574691964587307, 0.138485350057154, 0.004279835658106843, -0.21974723618683023, 0.09668675422504105, -0.1478972156148623, -0.16010387914994842, -0.09168927108540255, -0.049602836870369225, 0.027096339052899137, -0.2397551071309649, 0.07713132552624516, 0.1368060143705567, 0.040773591519716906, -0.07793012185378329, -0.11306486982742653, 0.039156747807282954, 0.09370854782515808, 0.0025644169928615585, -0.011240621703430353, 0.04983449960127473, -0.003980656791314045, -0.13055431668180972, 0.37510986390578394, -0.07083404903738376, -0.2634613082798965, 0.09612453389255439, -0.16748206046245553, -0.1303432031726355, 0.07417178504607257, 0.19063002629862988, 0.15931346937192276, -0.09054402377018157, 0.12137641135760692, -0.08136237987919766, 0.11090566969805342, 0.0707807319567484, 0.015295653268420958, 0.04480096088338863, 0.1301014062071986, 0.1361817835645257, 0.18506350244998054, -0.04117357164881576, -0.10573167293606435, -0.3667616021052441, -0.1948025735807331, -0.17810039100346758, 0.033172168628773174, -0.08039043195201563, -0.20507007242892594, 0.3793170353597709, 0.21483435358523445, 0.19276000293629134, 0.1378978243412669, 0.2754048180273351, 0.10317179547821391, -0.02598741206833545, 0.11325686924871714, 0.2187466583255788, 0.1463124538114404, 0.0861358722904697, -0.22018408889690524, -0.0018525546115330037, 0.1899439367082189] |
1,802.09926 | The Pleiades apex and its kinematical structure | A study of cluster characteristics and internal kinematical structure of the
middle-aged Pleiades open star cluster is presented. The individual star apexes
and various cluster kinematical parameters including the velocity ellipsoid
parameters are determined using both Hipparcos and Gaia data. Modern
astrometric parameters were taken from the Gaia Data Release 1 (DR1) in
combination with the Radial Velocity Experiment Fifth Data Release (DR5). The
necessary set of parameters including parallaxes, proper motions and radial
velocities are used for n=17 stars from Gaia DR1+RAVE DR5 and for n=19 stars
from the Hipparcos catalog using SIMBAD data base. Single stars are used to
improve accuracy by eliminating orbital movements. RAVE DR5 measurements were
taken only for the stars with the radial velocity errors not exceeding
$2$~km/s. For the Pleiades stars taken from Gaia, we found mean heliocentric
distance as $136.8 \pm 6.4$~pc, and the apex position is calculated as:
$A_{CP}=92^\circ.52\pm1^\circ.72$, $D_{CP}=-42^\circ.28\pm2^\circ.56$ by the
convergent point method and $A_0=95^\circ.59\pm2^\circ.30$ and
$D_0=-50^\circ.90\pm2^\circ.04$ using AD-diagram method (n=17 in both cases).
The results are compared with those obtained historically before the Gaia
mission era.
| astro-ph.SR | a study of cluster characteristics and internal kinematical structure of the middleaged pleiades open star cluster is presented the individual star apexes and various cluster kinematical parameters including the velocity ellipsoid parameters are determined using both hipparcos and gaia data modern astrometric parameters were taken from the gaia data release 1 dr1 in combination with the radial velocity experiment fifth data release dr5 the necessary set of parameters including parallaxes proper motions and radial velocities are used for n17 stars from gaia dr1rave dr5 and for n19 stars from the hipparcos catalog using simbad data base single stars are used to improve accuracy by eliminating orbital movements rave dr5 measurements were taken only for the stars with the radial velocity errors not exceeding 2kms for the pleiades stars taken from gaia we found mean heliocentric distance as 1368 pm 64pc and the apex position is calculated as a_cp92circ52pm1circ72 d_cp42circ28pm2circ56 by the convergent point method and a_095circ59pm2circ30 and d_050circ90pm2circ04 using addiagram method n17 in both cases the results are compared with those obtained historically before the gaia mission era | [['a', 'study', 'of', 'cluster', 'characteristics', 'and', 'internal', 'kinematical', 'structure', 'of', 'the', 'middleaged', 'pleiades', 'open', 'star', 'cluster', 'is', 'presented', 'the', 'individual', 'star', 'apexes', 'and', 'various', 'cluster', 'kinematical', 'parameters', 'including', 'the', 'velocity', 'ellipsoid', 'parameters', 'are', 'determined', 'using', 'both', 'hipparcos', 'and', 'gaia', 'data', 'modern', 'astrometric', 'parameters', 'were', 'taken', 'from', 'the', 'gaia', 'data', 'release', '1', 'dr1', 'in', 'combination', 'with', 'the', 'radial', 'velocity', 'experiment', 'fifth', 'data', 'release', 'dr5', 'the', 'necessary', 'set', 'of', 'parameters', 'including', 'parallaxes', 'proper', 'motions', 'and', 'radial', 'velocities', 'are', 'used', 'for', 'n17', 'stars', 'from', 'gaia', 'dr1rave', 'dr5', 'and', 'for', 'n19', 'stars', 'from', 'the', 'hipparcos', 'catalog', 'using', 'simbad', 'data', 'base', 'single', 'stars', 'are', 'used', 'to', 'improve', 'accuracy', 'by', 'eliminating', 'orbital', 'movements', 'rave', 'dr5', 'measurements', 'were', 'taken', 'only', 'for', 'the', 'stars', 'with', 'the', 'radial', 'velocity', 'errors', 'not', 'exceeding', '2kms', 'for', 'the', 'pleiades', 'stars', 'taken', 'from', 'gaia', 'we', 'found', 'mean', 'heliocentric', 'distance', 'as', '1368', 'pm', '64pc', 'and', 'the', 'apex', 'position', 'is', 'calculated', 'as', 'a_cp92circ52pm1circ72', 'd_cp42circ28pm2circ56', 'by', 'the', 'convergent', 'point', 'method', 'and', 'a_095circ59pm2circ30', 'and', 'd_050circ90pm2circ04', 'using', 'addiagram', 'method', 'n17', 'in', 'both', 'cases', 'the', 'results', 'are', 'compared', 'with', 'those', 'obtained', 'historically', 'before', 'the', 'gaia', 'mission', 'era']] | [-0.018788171567537478, 0.10023775823926281, -0.0933104768757605, 0.05369888787016229, -0.15395885716295904, -0.020132872561940497, 0.07623322630945828, 0.42092556343005416, -0.1989493000168593, -0.39981498454877157, 0.06286465917844652, -0.3479053250878875, 0.045336488383816695, 0.28392700787786157, -0.06472458276483747, 0.05998601936272275, 0.21768070226916444, -0.008845414890096201, -0.017440661330494964, -0.3034100087566508, 0.26802568205997174, 0.029058929835037703, 0.14875507975481886, -0.14875057732961441, 0.07664199468930938, -0.08327696590932163, -0.1482737639385183, 0.0397043118185335, -0.20439458052949075, 0.04510079398860185, 0.1981528584711929, 0.1611948650912722, 0.2006953038555728, -0.29731700426697383, -0.15314502898625462, -0.011741789428201335, 0.16845533787817504, 0.08112867149956353, -0.020398666665546204, -0.37273582662265115, 0.07309165062268444, -0.17345919287954156, -0.21469405606901001, -0.031965109846440326, 0.07228554781983819, 0.10854528156348793, -0.2273799385926523, 0.13504473648336307, -0.05462240968961595, 0.19409400623629403, -0.19795712524186276, -0.21232840260191227, -0.09994965653203779, 0.1784355847766808, -0.01572267410797421, 0.11061326467584578, 0.11955043386221367, -0.06961695570771022, -0.024636436123754938, 0.471055230572384, -0.06482929336887441, -0.04861450889362268, 0.11969410125928664, -0.17831596344905465, -0.1478716137012935, 0.06912893597417843, 0.15404482298715813, 0.08351267145045255, -0.24512686020026137, 0.0016251962634664008, 0.06259560119088368, 0.1793640703386668, 0.10077648217740812, 0.03225065287126348, 0.2337844248708577, 0.059860630674363924, 0.015393232030124125, 0.042466556088323566, -0.31479023829815983, -0.03162102130029285, -0.2702614008748566, -0.061969902876993284, -0.14774516173121002, 0.0005435359676004992, -0.15792615322208262, -0.06853650888286487, 0.2826161757935307, 0.10802096252367772, 0.1606506363200078, 0.0100485922126045, 0.31365736692119933, 0.020960189263307085, 0.1279403958251776, 0.13255801607108517, 0.31490532398953686, 0.15435494111213638, 0.12139626906378663, -0.21650031729388916, 0.06768566906576083, 0.03137656869856935] |
1,802.09927 | Analytical expression for end-to-end- auto correlation function of a
long chain polymer molecule in solution | A diffusion-like theory for real time end-to-end distance of a long polymer
chain in dilute solution is formulated. We give a detailed analytical
expression for the end-to-end distance auto-correlation function of a long
chain polymer in solution. The physical problem of dynamics of end-to-end
distance can be modeled mathematically with the use of a Smoluchowski-like
equation. Using this equation analytical expression for end-to-end distance
auto-correlation function is derived. We find that this auto-correlation
function varies with several parameters such as length of the polymer (N), bond
length (b) and the relaxation time ${\tau_R}$.
| cond-mat.soft | a diffusionlike theory for real time endtoend distance of a long polymer chain in dilute solution is formulated we give a detailed analytical expression for the endtoend distance autocorrelation function of a long chain polymer in solution the physical problem of dynamics of endtoend distance can be modeled mathematically with the use of a smoluchowskilike equation using this equation analytical expression for endtoend distance autocorrelation function is derived we find that this autocorrelation function varies with several parameters such as length of the polymer n bond length b and the relaxation time tau_r | [['a', 'diffusionlike', 'theory', 'for', 'real', 'time', 'endtoend', 'distance', 'of', 'a', 'long', 'polymer', 'chain', 'in', 'dilute', 'solution', 'is', 'formulated', 'we', 'give', 'a', 'detailed', 'analytical', 'expression', 'for', 'the', 'endtoend', 'distance', 'autocorrelation', 'function', 'of', 'a', 'long', 'chain', 'polymer', 'in', 'solution', 'the', 'physical', 'problem', 'of', 'dynamics', 'of', 'endtoend', 'distance', 'can', 'be', 'modeled', 'mathematically', 'with', 'the', 'use', 'of', 'a', 'smoluchowskilike', 'equation', 'using', 'this', 'equation', 'analytical', 'expression', 'for', 'endtoend', 'distance', 'autocorrelation', 'function', 'is', 'derived', 'we', 'find', 'that', 'this', 'autocorrelation', 'function', 'varies', 'with', 'several', 'parameters', 'such', 'as', 'length', 'of', 'the', 'polymer', 'n', 'bond', 'length', 'b', 'and', 'the', 'relaxation', 'time', 'tau_r']] | [-0.1940916095289492, 0.06853647283729046, -0.11195798153157836, 0.0739916834419453, -0.010143810082026708, -0.16272889503768534, -0.003262235068275483, 0.4046516395824891, -0.3280012711321795, -0.2502824900989791, 0.05168105597026967, -0.24039235022119296, -0.17468559045234436, 0.1654026873049236, 0.05513922835610086, 0.11148312739947791, 0.05678045044913487, 0.0527142646562268, -0.09791523308032543, -0.1686763040200677, 0.18681887367499933, 0.048732291005792155, 0.24167499871503922, 0.06296656851566607, 0.1666411866323762, 0.05725785701846083, 0.03624864061292942, 0.030225651318668036, -0.22964950481228472, 0.07697346353758207, 0.21171369294195325, 0.1122570905774351, 0.23685754034467923, -0.4327169896794423, -0.24740349232489545, 0.06291814954070155, 0.20323254077404898, 0.13153859151787656, 0.014048387051149401, -0.23309579526915425, 0.021825034812253008, -0.17398363042382464, -0.14337562137754054, 0.01552963498804558, 0.11346534966060551, 0.08426320550322372, -0.2914377004709295, 0.15350321621724194, -0.014870472713023103, 0.055656683420942675, -0.07595372850435876, -0.07779435417865233, 0.05293069542535851, 0.16204112333556017, 0.06460136061744584, 0.07872522910756449, 0.12003644282544051, -0.07762016530739524, -0.032070283087030534, 0.3241014034957975, -0.14154982745086633, -0.26560675698302444, 0.11076842853048395, -0.06380795030504145, -0.08369347818135735, 0.1418424799377399, 0.1532463867978383, 0.13331677144773865, -0.20990657783363775, 0.0721309302288348, -0.04483981138115288, 0.21621280954900368, 0.05857091336961715, 0.025493378710297127, 0.1588223495230239, 0.2350992093523664, 0.04314400474991529, 0.19962249692624576, -0.06583787442775824, -0.1302180016633644, -0.2845345373035118, -0.18009321978415854, -0.25205886445098347, 0.12189053899298112, -0.15566165039240087, -0.20508449915195665, 0.35227012435995764, 0.10713523081743602, 0.21740423068304054, 0.21927902138521593, 0.27926573397651794, 0.16618117808129, 0.020605334033814048, 0.030841120148217806, 0.16267391184084518, 0.09562000065981861, 0.08861416253832079, -0.2482184108136402, 0.10291327279742046, 0.1271190912292529] |
1,802.09928 | Distributed synthesis of chains with one-way biphotonic control | An example of a one-way distributed computation is given in which the use of
entangled states of two photons to synchronize processes gives a benefit. The
process of assembling polymer chains at two remote points is considered; the
quality of the assembly is determined when they are superimposed on each other.
The effect of using entangled states is almost 14 percents.
| quant-ph | an example of a oneway distributed computation is given in which the use of entangled states of two photons to synchronize processes gives a benefit the process of assembling polymer chains at two remote points is considered the quality of the assembly is determined when they are superimposed on each other the effect of using entangled states is almost 14 percents | [['an', 'example', 'of', 'a', 'oneway', 'distributed', 'computation', 'is', 'given', 'in', 'which', 'the', 'use', 'of', 'entangled', 'states', 'of', 'two', 'photons', 'to', 'synchronize', 'processes', 'gives', 'a', 'benefit', 'the', 'process', 'of', 'assembling', 'polymer', 'chains', 'at', 'two', 'remote', 'points', 'is', 'considered', 'the', 'quality', 'of', 'the', 'assembly', 'is', 'determined', 'when', 'they', 'are', 'superimposed', 'on', 'each', 'other', 'the', 'effect', 'of', 'using', 'entangled', 'states', 'is', 'almost', '14', 'percents']] | [-0.18995475734309217, 0.21962235236877278, -0.06201757360097082, 0.0026502628844638342, 0.01611778341600152, -0.17753303883078156, 0.03952934478455391, 0.3903115583492107, -0.27803019315126487, -0.28222164875049083, 0.09809345199886832, -0.30694907586105535, -0.048699513001397986, 0.22050723964806462, -0.0019320673457171279, 0.012680145026352561, 0.08134465559278845, 0.05133667199673955, -0.014992595384981423, -0.2741372613388984, 0.2967126978137607, 0.04080503835480233, 0.2866302643307164, 0.0018697385752543074, 0.1250845252795786, 0.016054951242308636, -0.008122673181847472, -0.02975784544451315, -0.053523978913111274, 0.13366826320425837, 0.23355804400167382, 0.10457264059452248, 0.26770416607500097, -0.41271248605621397, -0.15623077594476645, 0.09774629370935384, 0.14251750427466192, 0.14843440841173478, -0.04104640555652011, -0.24623968046097483, 0.06413950993236704, -0.12154420117893425, -0.10221151406037025, 0.011862868595807279, 0.003293536565281817, 0.005241037071606175, -0.2649606845540101, 0.052119111917057974, 0.04497510130654593, 0.03126393283763137, -0.0050895593327576994, -0.06491853876924905, -0.04610240382340844, 0.19608512582480678, -0.030986317052204376, -0.018665374821571053, 0.18631971182423782, -0.11674662207665502, -0.1636766162700951, 0.3764114235756827, -0.01765329230454613, -0.2006352826219136, 0.20263801032646758, -0.08539157366899193, -0.11420169748274274, 0.1442767708394371, 0.13245984005024197, 0.10791823636648841, -0.13334083437779345, 0.019893529153138887, -0.025790667604105394, 0.17884606639014894, 0.07052591979717378, 0.07974021933728555, 0.22248317303563483, 0.16261181497534158, 0.08593289757177966, 0.20633179008231697, -0.054448064733449306, -0.10199343850530806, -0.2670290303649381, -0.1710344605132571, -0.23922395680221867, 0.04516435188210768, -0.0427944217426855, -0.1764236008901088, 0.3958565086721763, 0.07021134194047725, 0.207131212386379, 0.021169716112514135, 0.27737344810586484, 0.0996977894826502, 0.05860178424503471, 0.056309651018532574, 0.2605149043021632, 0.12194644143904147, 0.04799044424797729, -0.16694452944517013, 0.08442468990067967, -0.004466904556287117] |
1,802.09929 | Optical Kerr spatiotemporal dark extreme waves | We study the existence and propagation of multidimensional dark
non-diffractive and non-dispersive spatiotemporal optical wave-packets in
nonlinear Kerr media. We report analytically and confirm numerically the
properties of spatiotemporal dark lines, X solitary waves and lump solutions of
the (2 + 1)D nonlinear Schrodinger equation (NLSE). Dark lines, X waves and
lumps represent holes of light on a continuous wave background. These solitary
waves are derived by exploiting the connection between the (2 + 1)D NLSE and a
well-known equation of hydrodynamics, namely the (2+1)D Kadomtsev-Petviashvili
(KP) equation. This finding opens a novel path for the excitation and control
of spatiotemporal optical solitary and rogue waves, of hydrodynamic nature.
| nlin.PS | we study the existence and propagation of multidimensional dark nondiffractive and nondispersive spatiotemporal optical wavepackets in nonlinear kerr media we report analytically and confirm numerically the properties of spatiotemporal dark lines x solitary waves and lump solutions of the 2 1d nonlinear schrodinger equation nlse dark lines x waves and lumps represent holes of light on a continuous wave background these solitary waves are derived by exploiting the connection between the 2 1d nlse and a wellknown equation of hydrodynamics namely the 21d kadomtsevpetviashvili kp equation this finding opens a novel path for the excitation and control of spatiotemporal optical solitary and rogue waves of hydrodynamic nature | [['we', 'study', 'the', 'existence', 'and', 'propagation', 'of', 'multidimensional', 'dark', 'nondiffractive', 'and', 'nondispersive', 'spatiotemporal', 'optical', 'wavepackets', 'in', 'nonlinear', 'kerr', 'media', 'we', 'report', 'analytically', 'and', 'confirm', 'numerically', 'the', 'properties', 'of', 'spatiotemporal', 'dark', 'lines', 'x', 'solitary', 'waves', 'and', 'lump', 'solutions', 'of', 'the', '2', '1d', 'nonlinear', 'schrodinger', 'equation', 'nlse', 'dark', 'lines', 'x', 'waves', 'and', 'lumps', 'represent', 'holes', 'of', 'light', 'on', 'a', 'continuous', 'wave', 'background', 'these', 'solitary', 'waves', 'are', 'derived', 'by', 'exploiting', 'the', 'connection', 'between', 'the', '2', '1d', 'nlse', 'and', 'a', 'wellknown', 'equation', 'of', 'hydrodynamics', 'namely', 'the', '21d', 'kadomtsevpetviashvili', 'kp', 'equation', 'this', 'finding', 'opens', 'a', 'novel', 'path', 'for', 'the', 'excitation', 'and', 'control', 'of', 'spatiotemporal', 'optical', 'solitary', 'and', 'rogue', 'waves', 'of', 'hydrodynamic', 'nature']] | [-0.22615427748848485, 0.11040027700277551, -0.08071340784587175, 0.10286423618683295, -0.11719091147811056, -0.12244200706917131, -0.05589357424945196, 0.34163001887326205, -0.2548735880458327, -0.2150070100900865, 0.048048513979546584, -0.32174281962977497, -0.20095968435879658, 0.17150607079519917, 0.12190327520926143, 0.11074023399606486, 0.026500669162215613, -0.0999021063271527, -0.020602284739159534, -0.1364724663495321, 0.3556535256391165, -0.03506180808975178, 0.2626943333753359, -0.005478206915328297, 0.1451419999683711, 0.007902186655517772, -0.0351062880254516, -0.07462711287575348, -0.17149693126764112, 0.05953131946865643, 0.21526015985095612, 0.05310023844973228, 0.18935727363095453, -0.4823248796600187, -0.3446658620628241, 0.052349443547427654, 0.2080614965846414, 0.18816456785338503, -0.08071756911807841, -0.3933765889171546, -0.011310869279517749, -0.09181772033187831, -0.23480946215948909, -0.031566286772907334, 0.06752311232908864, 0.1582873255802127, -0.1924513190305818, 0.17070750111200472, 0.0444451531081974, -0.04002467850136144, -0.12161351964922151, 0.006511039287722278, -0.11316299946352004, -0.03979223242865127, 0.021457702576537195, -0.05181072679974974, -0.00456193907003606, -0.20149335541292399, -0.1039687852784839, 0.4302280846217247, -0.11432240175727372, -0.20331754075868108, 0.17779567847071895, -0.13414846383830506, 0.0016894412572956948, 0.2075861517348649, 0.22035366627083064, 0.1244891950790988, -0.10567080947596615, 0.03331254496213014, -0.07544408438313278, 0.20212233954361666, 0.16323830363575684, 0.08006118241889036, 0.2566268214949534, 0.18152586168774934, 0.0019202825317385598, 0.0859191943815187, -0.08409186851920857, -0.057739906587472585, -0.29704660346413847, -0.12745177304420063, -0.11302501130326886, 0.059784958731338475, -0.09554906676754042, -0.16945811229644814, 0.4412936845393938, 0.11751428947166026, 0.07613205150744626, 0.019441808961227398, 0.21654334271976874, 0.18095076601151552, -0.11044802019703333, 0.08797726533854398, 0.26551951595068535, 0.20784612350104917, 0.17607824468254069, -0.2773333325999502, -0.10653182981257266, 0.10453077198210756] |
1,802.0993 | Quantization and isotropic submanifolds | We introduce the notion of an isotropic quantum state associated with a
Bohr-Sommerfeld manifold in the context of Berezin-Toeplitz quantization of
general prequantized symplectic manifolds, and we study its semi-classical
properties using the off-diagonal expansion of the Bergman kernel. We then show
how these results extend to the case of non-compact orbifolds, and give an
application to relative Poincar\'e series in the theory of automorphic forms.
| math.DG | we introduce the notion of an isotropic quantum state associated with a bohrsommerfeld manifold in the context of berezintoeplitz quantization of general prequantized symplectic manifolds and we study its semiclassical properties using the offdiagonal expansion of the bergman kernel we then show how these results extend to the case of noncompact orbifolds and give an application to relative poincare series in the theory of automorphic forms | [['we', 'introduce', 'the', 'notion', 'of', 'an', 'isotropic', 'quantum', 'state', 'associated', 'with', 'a', 'bohrsommerfeld', 'manifold', 'in', 'the', 'context', 'of', 'berezintoeplitz', 'quantization', 'of', 'general', 'prequantized', 'symplectic', 'manifolds', 'and', 'we', 'study', 'its', 'semiclassical', 'properties', 'using', 'the', 'offdiagonal', 'expansion', 'of', 'the', 'bergman', 'kernel', 'we', 'then', 'show', 'how', 'these', 'results', 'extend', 'to', 'the', 'case', 'of', 'noncompact', 'orbifolds', 'and', 'give', 'an', 'application', 'to', 'relative', 'poincare', 'series', 'in', 'the', 'theory', 'of', 'automorphic', 'forms']] | [-0.1546888758611837, 0.06435519936326961, -0.12165571043662952, 0.09973366452719677, -0.09328695925686395, -0.051424118647859854, -0.02295927783989376, 0.34294435134947754, -0.2732693876393817, -0.16104224229683028, 0.09824688775309671, -0.24141491300454646, -0.226309874144411, 0.17180385463165515, -0.1471308023866379, 0.02179996566899883, 0.0444797222135645, 0.10914947482700826, -0.1809841713190756, -0.26530651870592864, 0.46217477088088565, 0.047374935917711504, 0.24147944650824435, 0.06669590998243427, 0.09791242661109816, 0.009623519003842815, -0.009767814962701364, -0.053287340786703156, -0.1736535158812661, 0.17181889385436522, 0.23906680228626073, 0.05267046414541476, 0.19087742216828646, -0.4485587118701501, -0.1608820227609778, 0.1357865756885572, 0.11591533115698081, 0.05014089717543825, -0.0019025785114729042, -0.3267953704837992, 0.04598450345325877, -0.18840391856307784, -0.20210892857743823, -0.16326030970297076, -0.03739811756619901, -0.012278789446237639, -0.19506960950622504, 0.04827466788419494, 0.1224883754009418, 0.05042116403241049, -0.12802881409703387, -0.05556513537532848, 0.018771139259280808, 0.08254734112768236, 0.017339066404736404, 0.011772494200461855, 0.08441189960858812, -0.07607772638739059, -0.1515559529194213, 0.33378193403283757, -0.10918204041875222, -0.2763627886377049, 0.09457984325391325, -0.16292823017857067, -0.16981722149207737, 0.04238813474181701, 0.12292975688240293, 0.1763555807146159, -0.052501539840842736, 0.18559276790774398, -0.045501309503434284, 0.025135958581372644, 0.06319410243833606, 0.02728935685026403, 0.11078278602199686, 0.08453242939713439, 0.07453077730271175, 0.1892934017250258, -0.05523836474502318, -0.14587844769950165, -0.37487624167944444, -0.21300450609432478, -0.13881509340452877, 0.16245915592563423, -0.14242741504329554, -0.2212691118686714, 0.40804051661468815, 0.07539139450245509, 0.22977175610139966, 0.11026806524023414, 0.2105058700297818, 0.1094764685611043, -0.00047261244617402554, 0.0516320056507759, 0.17689488731522227, 0.2678883361884139, 0.04635353734942548, -0.19517081354349625, -0.1109928787883484, 0.19221646029671485] |
1,802.09931 | Super-Rigidity and non-linearity for lattices in products | We prove a super-rigidity result for algebraic representations over complete
fields of irreducible lattices in product of groups and lattices with dense
commensurator groups. We derive some criteria for non-linearity of such groups.
| math.GR | we prove a superrigidity result for algebraic representations over complete fields of irreducible lattices in product of groups and lattices with dense commensurator groups we derive some criteria for nonlinearity of such groups | [['we', 'prove', 'a', 'superrigidity', 'result', 'for', 'algebraic', 'representations', 'over', 'complete', 'fields', 'of', 'irreducible', 'lattices', 'in', 'product', 'of', 'groups', 'and', 'lattices', 'with', 'dense', 'commensurator', 'groups', 'we', 'derive', 'some', 'criteria', 'for', 'nonlinearity', 'of', 'such', 'groups']] | [-0.20997733464746765, 0.07422618765496847, -0.13217339760652094, 0.052767076388452995, -0.07689070289559437, -0.0729979677266921, 0.05170926660525076, 0.45927273188576556, -0.29411902086047287, -0.18809604091626225, 0.13553303692870858, -0.21419066687424979, -0.1437468399491274, 0.258371608338855, -0.09514775176560789, -0.06349884442081957, 0.05481280815420729, 0.08571245797881574, -0.10888905433768575, -0.34826120790658577, 0.42458034058411914, -0.13896991583434018, 0.2241036416116086, 0.04896348031858603, 0.1206525970024593, 0.061163609621651245, -0.04693489250811664, -0.03316276385025545, -0.16826383777978746, 0.15222204008111448, 0.3275111914809906, 0.04043573711885873, 0.16969065186849824, -0.34589162378600147, -0.20791377159625743, 0.23352929688707896, 0.11056654454406464, 0.0945024083678921, -0.0495818628238119, -0.3127452606956164, 0.0935662290307157, -0.20460790226405318, -0.1566693898516171, -0.13366119430936646, 0.08286667283567967, 0.07475394524182334, -0.2800301220832449, 0.023859552135973267, 0.13014122930171929, 0.21327057486456452, -0.10849295538201024, -0.1028696924666733, 0.04034049298162713, 0.1264023087410764, -0.08305327176596179, -0.08065065414165005, 0.04109305232255296, -0.14360935353871548, -0.13217538008184143, 0.4318260803367152, -0.04608293018783584, -0.1788139608829762, 0.21502646273284248, -0.15383701319947388, -0.24469205006166841, 0.1006596700401243, 0.1886468306183815, 0.09436621720140631, 0.01343180885482015, 0.1301424253827215, -0.14964810764473496, 0.053329786268119336, 0.09433944077428544, 0.07723091170191765, 0.06957839293913408, 0.06811998498089837, 0.14294671679310728, 0.1799681616918833, 0.14700337984796727, 0.055388085445332705, -0.3282687206837264, -0.21319549043916844, -0.06068818174500131, 0.12528030594077075, -0.15146025651175118, -0.17908120631578972, 0.38826406397151225, 0.03628597484732216, 0.14183160273188894, 0.15933917366871328, 0.14222688651220364, 0.025829519229856403, 0.06834769359986902, 0.09610508332932086, 0.058256499290247586, 0.30574123042099405, -0.14468115829566325, -0.057738533949084354, -0.11998526409099047, 0.21525093661903433] |
1,802.09932 | VR-SGD: A Simple Stochastic Variance Reduction Method for Machine
Learning | In this paper, we propose a simple variant of the original SVRG, called
variance reduced stochastic gradient descent (VR-SGD). Unlike the choices of
snapshot and starting points in SVRG and its proximal variant, Prox-SVRG, the
two vectors of VR-SGD are set to the average and last iterate of the previous
epoch, respectively. The settings allow us to use much larger learning rates,
and also make our convergence analysis more challenging. We also design two
different update rules for smooth and non-smooth objective functions,
respectively, which means that VR-SGD can tackle non-smooth and/or non-strongly
convex problems directly without any reduction techniques. Moreover, we analyze
the convergence properties of VR-SGD for strongly convex problems, which show
that VR-SGD attains linear convergence. Different from its counterparts that
have no convergence guarantees for non-strongly convex problems, we also
provide the convergence guarantees of VR-SGD for this case, and empirically
verify that VR-SGD with varying learning rates achieves similar performance to
its momentum accelerated variant that has the optimal convergence rate
$\mathcal{O}(1/T^2)$. Finally, we apply VR-SGD to solve various machine
learning problems, such as convex and non-convex empirical risk minimization,
and leading eigenvalue computation. Experimental results show that VR-SGD
converges significantly faster than SVRG and Prox-SVRG, and usually outperforms
state-of-the-art accelerated methods, e.g., Katyusha.
| cs.LG cs.CV math.OC stat.ML | in this paper we propose a simple variant of the original svrg called variance reduced stochastic gradient descent vrsgd unlike the choices of snapshot and starting points in svrg and its proximal variant proxsvrg the two vectors of vrsgd are set to the average and last iterate of the previous epoch respectively the settings allow us to use much larger learning rates and also make our convergence analysis more challenging we also design two different update rules for smooth and nonsmooth objective functions respectively which means that vrsgd can tackle nonsmooth andor nonstrongly convex problems directly without any reduction techniques moreover we analyze the convergence properties of vrsgd for strongly convex problems which show that vrsgd attains linear convergence different from its counterparts that have no convergence guarantees for nonstrongly convex problems we also provide the convergence guarantees of vrsgd for this case and empirically verify that vrsgd with varying learning rates achieves similar performance to its momentum accelerated variant that has the optimal convergence rate mathcalo1t2 finally we apply vrsgd to solve various machine learning problems such as convex and nonconvex empirical risk minimization and leading eigenvalue computation experimental results show that vrsgd converges significantly faster than svrg and proxsvrg and usually outperforms stateoftheart accelerated methods eg katyusha | [['in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'variant', 'of', 'the', 'original', 'svrg', 'called', 'variance', 'reduced', 'stochastic', 'gradient', 'descent', 'vrsgd', 'unlike', 'the', 'choices', 'of', 'snapshot', 'and', 'starting', 'points', 'in', 'svrg', 'and', 'its', 'proximal', 'variant', 'proxsvrg', 'the', 'two', 'vectors', 'of', 'vrsgd', 'are', 'set', 'to', 'the', 'average', 'and', 'last', 'iterate', 'of', 'the', 'previous', 'epoch', 'respectively', 'the', 'settings', 'allow', 'us', 'to', 'use', 'much', 'larger', 'learning', 'rates', 'and', 'also', 'make', 'our', 'convergence', 'analysis', 'more', 'challenging', 'we', 'also', 'design', 'two', 'different', 'update', 'rules', 'for', 'smooth', 'and', 'nonsmooth', 'objective', 'functions', 'respectively', 'which', 'means', 'that', 'vrsgd', 'can', 'tackle', 'nonsmooth', 'andor', 'nonstrongly', 'convex', 'problems', 'directly', 'without', 'any', 'reduction', 'techniques', 'moreover', 'we', 'analyze', 'the', 'convergence', 'properties', 'of', 'vrsgd', 'for', 'strongly', 'convex', 'problems', 'which', 'show', 'that', 'vrsgd', 'attains', 'linear', 'convergence', 'different', 'from', 'its', 'counterparts', 'that', 'have', 'no', 'convergence', 'guarantees', 'for', 'nonstrongly', 'convex', 'problems', 'we', 'also', 'provide', 'the', 'convergence', 'guarantees', 'of', 'vrsgd', 'for', 'this', 'case', 'and', 'empirically', 'verify', 'that', 'vrsgd', 'with', 'varying', 'learning', 'rates', 'achieves', 'similar', 'performance', 'to', 'its', 'momentum', 'accelerated', 'variant', 'that', 'has', 'the', 'optimal', 'convergence', 'rate', 'mathcalo1t2', 'finally', 'we', 'apply', 'vrsgd', 'to', 'solve', 'various', 'machine', 'learning', 'problems', 'such', 'as', 'convex', 'and', 'nonconvex', 'empirical', 'risk', 'minimization', 'and', 'leading', 'eigenvalue', 'computation', 'experimental', 'results', 'show', 'that', 'vrsgd', 'converges', 'significantly', 'faster', 'than', 'svrg', 'and', 'proxsvrg', 'and', 'usually', 'outperforms', 'stateoftheart', 'accelerated', 'methods', 'eg', 'katyusha']] | [-0.030716008051219462, -0.02633666787875825, -0.09835504392010458, 0.10275035112445648, -0.09435500924555701, -0.1828128831368051, 0.047638018762594776, 0.4446712371104499, -0.32037758466266275, -0.237225229475362, 0.1497259071201496, -0.2568591023710641, -0.175323716268995, 0.24193645660814486, -0.14015669814011852, 0.10225199760438018, 0.12040191966512254, -0.01312139963396406, -0.17300411727520054, -0.35129097107748847, 0.2458227040284006, 0.02581167403880382, 0.287473640724366, 0.015563250876936403, 0.1317501812165104, -0.02053725089138133, 0.03694039288937208, 0.06522164453025997, -0.10238669632980545, 0.1555450671044976, 0.2613133161549309, 0.21945720438903385, 0.38332617666982294, -0.40084537526851066, -0.1579790750661036, 0.17660686858087493, 0.1754908554833722, 0.06807862320562834, -0.06425107712558031, -0.20305358784821365, 0.11178891024157922, -0.11450233462636479, -0.05837419582976465, -0.1684327093732842, -0.08409486119033831, 0.079469820784748, -0.3251726603064169, 0.08746560094903143, 0.07576926522687719, 0.0008163030201382044, -0.07644621316180898, -0.18504594453013365, 0.043124447640757915, 0.031009167408276545, 0.10516864469199125, 0.059483782692397964, 0.14890517229125189, -0.08924817543200543, -0.16933375687904334, 0.3298151396687307, -0.06998997724134058, -0.22767528599118658, 0.23164315232962512, -0.053352158924377564, -0.16367765474601081, 0.1301429497176095, 0.2273261363720566, 0.2048785624984968, -0.12183599130130199, 0.0660107910380204, -0.03694817897057134, 0.10764275526134387, 0.0545614600954711, 0.017900664737541674, 0.01327290907435333, 0.13989151086804177, 0.20457561056209844, 0.1509161112088104, -0.050203119306580016, -0.15384514815993963, -0.2319273219519611, -0.10562546054150855, -0.15940199701369487, -0.011785603215824367, -0.17509683173327512, -0.12695430611866262, 0.3686566372540151, 0.19099541764002312, 0.17316360967737873, 0.1936635414381293, 0.3362289694088854, 0.10326751857127328, 0.016781767355679184, 0.17430928095275064, 0.23612895137663822, 0.09066218562406358, 0.08015929874390337, -0.2573432090149693, 0.09110684858737558, 0.10582611777120088] |
1,802.09933 | Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient
Optimization | In this paper, we propose a novel sufficient decrease technique for
stochastic variance reduced gradient descent methods such as SVRG and SAGA. In
order to make sufficient decrease for stochastic optimization, we design a new
sufficient decrease criterion, which yields sufficient decrease versions of
stochastic variance reduction algorithms such as SVRG-SD and SAGA-SD as a
byproduct. We introduce a coefficient to scale current iterate and to satisfy
the sufficient decrease property, which takes the decisions to shrink, expand
or even move in the opposite direction, and then give two specific update rules
of the coefficient for Lasso and ridge regression. Moreover, we analyze the
convergence properties of our algorithms for strongly convex problems, which
show that our algorithms attain linear convergence rates. We also provide the
convergence guarantees of our algorithms for non-strongly convex problems. Our
experimental results further verify that our algorithms achieve significantly
better performance than their counterparts.
| stat.ML cs.DS cs.LG math.OC | in this paper we propose a novel sufficient decrease technique for stochastic variance reduced gradient descent methods such as svrg and saga in order to make sufficient decrease for stochastic optimization we design a new sufficient decrease criterion which yields sufficient decrease versions of stochastic variance reduction algorithms such as svrgsd and sagasd as a byproduct we introduce a coefficient to scale current iterate and to satisfy the sufficient decrease property which takes the decisions to shrink expand or even move in the opposite direction and then give two specific update rules of the coefficient for lasso and ridge regression moreover we analyze the convergence properties of our algorithms for strongly convex problems which show that our algorithms attain linear convergence rates we also provide the convergence guarantees of our algorithms for nonstrongly convex problems our experimental results further verify that our algorithms achieve significantly better performance than their counterparts | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'sufficient', 'decrease', 'technique', 'for', 'stochastic', 'variance', 'reduced', 'gradient', 'descent', 'methods', 'such', 'as', 'svrg', 'and', 'saga', 'in', 'order', 'to', 'make', 'sufficient', 'decrease', 'for', 'stochastic', 'optimization', 'we', 'design', 'a', 'new', 'sufficient', 'decrease', 'criterion', 'which', 'yields', 'sufficient', 'decrease', 'versions', 'of', 'stochastic', 'variance', 'reduction', 'algorithms', 'such', 'as', 'svrgsd', 'and', 'sagasd', 'as', 'a', 'byproduct', 'we', 'introduce', 'a', 'coefficient', 'to', 'scale', 'current', 'iterate', 'and', 'to', 'satisfy', 'the', 'sufficient', 'decrease', 'property', 'which', 'takes', 'the', 'decisions', 'to', 'shrink', 'expand', 'or', 'even', 'move', 'in', 'the', 'opposite', 'direction', 'and', 'then', 'give', 'two', 'specific', 'update', 'rules', 'of', 'the', 'coefficient', 'for', 'lasso', 'and', 'ridge', 'regression', 'moreover', 'we', 'analyze', 'the', 'convergence', 'properties', 'of', 'our', 'algorithms', 'for', 'strongly', 'convex', 'problems', 'which', 'show', 'that', 'our', 'algorithms', 'attain', 'linear', 'convergence', 'rates', 'we', 'also', 'provide', 'the', 'convergence', 'guarantees', 'of', 'our', 'algorithms', 'for', 'nonstrongly', 'convex', 'problems', 'our', 'experimental', 'results', 'further', 'verify', 'that', 'our', 'algorithms', 'achieve', 'significantly', 'better', 'performance', 'than', 'their', 'counterparts']] | [-0.03132402167240208, 0.004305438424863324, -0.09627412325652265, 0.09726913047661828, -0.11280468060962252, -0.16836908906603837, 0.0733514004819586, 0.4196603559964412, -0.3063988955439748, -0.27533120785311266, 0.14827172576868278, -0.2153491361406506, -0.18466157203688086, 0.20634253068694947, -0.12292912225490688, 0.0806747139525927, 0.10133253368926612, 0.0004637167473226106, -0.13110563549609552, -0.35339904244756326, 0.2181797748733614, 0.06404636013384506, 0.2896994776910523, 0.05981602119218961, 0.12487421016443034, -0.013695522327907383, 0.014105809865066328, 0.07404724919438563, -0.15136974128452838, 0.12306024056129358, 0.24541606862299345, 0.18285869082083572, 0.3446987243495076, -0.4122631564434316, -0.15640505882470893, 0.15571966532907272, 0.182513422429258, 0.1067734919103001, -0.06456970870085815, -0.19268801548625217, 0.12351744269914422, -0.13537052429495128, -0.10739056847366579, -0.16920179311765005, -0.07429661791350038, 0.08421729917785883, -0.35895181205312443, 0.0930735769355591, 0.12004894780221621, 0.020971057628205902, -0.06180381864573605, -0.15539600954995164, 0.05989816561309822, 0.071107041048251, 0.06903023622785318, 0.031343255695459, 0.12631798805464436, -0.08992400078096653, -0.1646708996684882, 0.33260679897235557, -0.07999404202535122, -0.22372897486579982, 0.1838738610778229, -0.06081563275231904, -0.16781969207521477, 0.12264649876758356, 0.265119071672293, 0.15678252214314164, -0.1059721460175776, 0.0030581459329885154, -0.01299950696930692, 0.12299434892279473, 0.02497083819439836, 0.045186384049294565, 0.061957623655404394, 0.1493549340851353, 0.2338920152947508, 0.1611244705068325, -0.04267486271360335, -0.08383307507658075, -0.2936272446972293, -0.17236351545245662, -0.11409271502005239, -0.024863254669046885, -0.14223977773734667, -0.17101035140788284, 0.3640734480907889, 0.2150354709593631, 0.219321735109072, 0.17733394049620885, 0.31067808847748546, 0.12855025922456392, 0.04569858606948794, 0.1247833621109257, 0.2373267905110166, 0.12742652559048823, 0.10221165338707333, -0.24413993406247952, 0.10528758772950922, 0.08947574547995385] |
1,802.09934 | A boundary regularity result for minimizers of variational integrals
with nonstandard growth | We prove global Lipschitz regularity for a wide class of convex variational
integrals among all functions in $W^{1,1}$ with prescribed (sufficiently
regular) boundary values, which are not assumed to satisfy any geometrical
constraint (as for example bounded slope condition). Furthermore, we do not
assume any restrictive assumption on the geometry of the domain and the result
is valid for all sufficiently smooth domains. The result is achieved with a
suitable approximation of the functional together with a new construction of
appropriate barrier functions.
| math.AP | we prove global lipschitz regularity for a wide class of convex variational integrals among all functions in w11 with prescribed sufficiently regular boundary values which are not assumed to satisfy any geometrical constraint as for example bounded slope condition furthermore we do not assume any restrictive assumption on the geometry of the domain and the result is valid for all sufficiently smooth domains the result is achieved with a suitable approximation of the functional together with a new construction of appropriate barrier functions | [['we', 'prove', 'global', 'lipschitz', 'regularity', 'for', 'a', 'wide', 'class', 'of', 'convex', 'variational', 'integrals', 'among', 'all', 'functions', 'in', 'w11', 'with', 'prescribed', 'sufficiently', 'regular', 'boundary', 'values', 'which', 'are', 'not', 'assumed', 'to', 'satisfy', 'any', 'geometrical', 'constraint', 'as', 'for', 'example', 'bounded', 'slope', 'condition', 'furthermore', 'we', 'do', 'not', 'assume', 'any', 'restrictive', 'assumption', 'on', 'the', 'geometry', 'of', 'the', 'domain', 'and', 'the', 'result', 'is', 'valid', 'for', 'all', 'sufficiently', 'smooth', 'domains', 'the', 'result', 'is', 'achieved', 'with', 'a', 'suitable', 'approximation', 'of', 'the', 'functional', 'together', 'with', 'a', 'new', 'construction', 'of', 'appropriate', 'barrier', 'functions']] | [-0.1420704054545207, 0.06889676655003105, -0.07595010107405574, 0.09243047366715429, -0.130441584355052, -0.16219699693035827, 0.01838776828855815, 0.36665391621280863, -0.27264308983302976, -0.2536702599062259, 0.13360381826719112, -0.18139878121844258, -0.1167972553184772, 0.2165985010039757, -0.08870110789830067, 0.09993414924615371, 0.07791243054825499, 0.049160678882196725, -0.1061433958764895, -0.22611702700336295, 0.3976724305784846, -0.08760936883648476, 0.2323983959763883, 0.10338991586994155, 0.12676854388990316, 0.029502534750759243, 0.028319171944027204, 0.05161025617496077, -0.18758081659360462, 0.10862582663343434, 0.24173536250951239, 0.08900803606115641, 0.2875848123018282, -0.4240433061158801, -0.22841584356747152, 0.17228835376809878, 0.07604791754744498, 0.06075310952125499, -0.021073862189337253, -0.21628258872148862, 0.15586771440119987, -0.09676160022661269, -0.2049350541208433, -0.07632887972720775, -0.012555528465793076, 0.09321351335888886, -0.375182007624577, 0.0496670005629849, 0.11860134740954781, 0.05479551560009818, -0.14591885046999767, -0.09607323706823301, -0.024143427409826362, 0.06966309240143971, 0.023307729203882348, 0.07708754948289863, 0.07004555738362742, -0.09738913737868621, -0.00549792541550046, 0.329748271571764, -0.05066296631745231, -0.3304656158953187, 0.1867101937532425, -0.1735007401488452, -0.1530897337101759, 0.09992902828604881, 0.09221088014408407, 0.1710305537198143, -0.13545376436044293, 0.1722325648914697, -0.060006029885654975, 0.14100032089928904, 0.10121838415759694, 0.036570643590965186, 0.09650772219770644, 0.06627875898055823, 0.19078173617697713, 0.10746853800872004, 0.01149815435350188, -0.09443576978407352, -0.41474862322660094, -0.10086670276710304, -0.2032777504961803, 0.06682422486202601, -0.13297455730909027, -0.2361163486535829, 0.3157720782356449, 0.04641473803287709, 0.20301420002592258, 0.1541303856233808, 0.2109329733010157, 0.14348873259157435, 0.09072427025782955, 0.09357681080519435, 0.1875296017401908, 0.10069421925077057, 0.04784196189952543, -0.09362749397440488, 0.10668750466352486, 0.08688966136657864] |
1,802.09935 | Single reference atomic based MW interferometry using EIT | Recently atomic based MW electrometry is experimentally demonstrated and
interferometry has been proposed. The proposed interferometry bypasses the
conventional, electrical circuit based MW interferometry in much superior
fashion. However, this scheme requires three different references for
characterizing the unknown MW field. In this work we theoretically study a
scheme to develop an atomic based MW interferometry having only one referenced
MW field. This scheme involves magnetic sublevels in the Rydberg states and
hence will be suitable in even isotope of Yb or alkaline earth element where
there is no complicacy due to absence of the hyperfine levels. Further, the
wavelengths to excite the Rydberg states, are very close and hence cancels the
Doppler shift more effectively which increases the amplitude sensitivity. We
characterize this system for the phase and the amplitude of the unknown MW
field w.r.t to the known field and compare it to the previously studied
systems.
| physics.atom-ph | recently atomic based mw electrometry is experimentally demonstrated and interferometry has been proposed the proposed interferometry bypasses the conventional electrical circuit based mw interferometry in much superior fashion however this scheme requires three different references for characterizing the unknown mw field in this work we theoretically study a scheme to develop an atomic based mw interferometry having only one referenced mw field this scheme involves magnetic sublevels in the rydberg states and hence will be suitable in even isotope of yb or alkaline earth element where there is no complicacy due to absence of the hyperfine levels further the wavelengths to excite the rydberg states are very close and hence cancels the doppler shift more effectively which increases the amplitude sensitivity we characterize this system for the phase and the amplitude of the unknown mw field wrt to the known field and compare it to the previously studied systems | [['recently', 'atomic', 'based', 'mw', 'electrometry', 'is', 'experimentally', 'demonstrated', 'and', 'interferometry', 'has', 'been', 'proposed', 'the', 'proposed', 'interferometry', 'bypasses', 'the', 'conventional', 'electrical', 'circuit', 'based', 'mw', 'interferometry', 'in', 'much', 'superior', 'fashion', 'however', 'this', 'scheme', 'requires', 'three', 'different', 'references', 'for', 'characterizing', 'the', 'unknown', 'mw', 'field', 'in', 'this', 'work', 'we', 'theoretically', 'study', 'a', 'scheme', 'to', 'develop', 'an', 'atomic', 'based', 'mw', 'interferometry', 'having', 'only', 'one', 'referenced', 'mw', 'field', 'this', 'scheme', 'involves', 'magnetic', 'sublevels', 'in', 'the', 'rydberg', 'states', 'and', 'hence', 'will', 'be', 'suitable', 'in', 'even', 'isotope', 'of', 'yb', 'or', 'alkaline', 'earth', 'element', 'where', 'there', 'is', 'no', 'complicacy', 'due', 'to', 'absence', 'of', 'the', 'hyperfine', 'levels', 'further', 'the', 'wavelengths', 'to', 'excite', 'the', 'rydberg', 'states', 'are', 'very', 'close', 'and', 'hence', 'cancels', 'the', 'doppler', 'shift', 'more', 'effectively', 'which', 'increases', 'the', 'amplitude', 'sensitivity', 'we', 'characterize', 'this', 'system', 'for', 'the', 'phase', 'and', 'the', 'amplitude', 'of', 'the', 'unknown', 'mw', 'field', 'wrt', 'to', 'the', 'known', 'field', 'and', 'compare', 'it', 'to', 'the', 'previously', 'studied', 'systems']] | [-0.12437710830095425, 0.15589490381623633, -0.04178219043171486, 0.03988761881575212, -0.025904562673531473, -0.157542295143562, 0.07289083187178885, 0.41865603555295916, -0.21884275211738674, -0.31260746892272634, 0.02858020199425015, -0.22126678993447205, -0.09049747209693934, 0.2230282207884876, -0.04384279066092662, 0.04676463644687288, 0.016360625931426783, 0.013782050433832951, -0.04009526584303711, -0.20721862800859822, 0.268869113167622, 0.09584960765740205, 0.29168480536522895, 0.010034632478916162, 0.11878375763488883, -0.05240084286433066, 0.011619974143261946, -0.032670854641174946, -0.06745496575997488, 0.1004354203933208, 0.24521463240710767, 0.05597641283482615, 0.23093368405023137, -0.4250804281516655, -0.20803811707584238, 0.10657619503940255, 0.14619326128032864, 0.18145730692304898, -0.055903464998295564, -0.2882166660604747, 0.05021905314139519, -0.15188635041232448, -0.144728145934956, -0.09338715893996728, 0.055895818265255644, 0.006679782594359052, -0.2599971462985048, 0.019855533493682742, 0.025529029256840412, 0.09198102359408261, -0.03939211394675579, -0.11318149979814661, 0.04856874356423882, 0.08399204512258891, -0.011699870054931002, 0.0699075112257757, 0.13248487263351577, -0.08226441189086668, -0.08140634501831152, 0.40771978398835335, -0.0840352727426688, -0.11924777749132968, 0.18091832525317078, -0.16720155999536399, -0.0859349627542149, 0.12098189511625851, 0.0831208936807171, 0.11846847749768279, -0.14639138088033005, 0.054705383543576416, -0.0052522577556177365, 0.2315907644932284, 0.13373348891193904, 0.11270789339795483, 0.17825271980836987, 0.14383001034651455, 0.07879713147200607, 0.1231334526650293, -0.14312255753808328, -0.07988559532866536, -0.17964886888748388, -0.12004061940289731, -0.18194917208087202, 0.008189275603571505, 0.003612440649433395, -0.09899244426648963, 0.39499117642729265, 0.18845056138328603, 0.1629415493618974, -0.0525966337590944, 0.37954106349246325, 0.14030559462923053, 0.08959618661213647, 0.02886519579506303, 0.32705897939190065, 0.17593335863706228, 0.10831930229717211, -0.2845727994769019, 0.04185145037135462, -0.021306670535154438] |
1,802.09936 | Finite-time Singularity formation for Strong Solutions to the
axi-symmetric $3D$ Euler Equations | For all $\epsilon>0$, we prove the existence of finite-energy strong
solutions to the axi-symmetric $3D$ Euler equations on the domains $
\{(x,y,z)\in\mathbb{R}^3: (1+\epsilon|z|)^2\leq x^2+y^2\}$ which become
singular in finite time. We further show that solutions with 0 swirl are
necessarily globally regular. The proof of singularity formation relies on the
use of approximate solutions at exactly the critical regularity level which
satisfy a $1D$ system which has solutions which blow-up in finite time. The
construction bears similarity to our previous result on the Boussinesq system
\cite{EJB} though a number of modifications must be made due to anisotropy and
since our domains are not scale-invariant. This seems to be the first
construction of singularity formation for finite-energy strong solutions to the
actual $3D$ Euler system.
| math.AP physics.flu-dyn | for all epsilon0 we prove the existence of finiteenergy strong solutions to the axisymmetric 3d euler equations on the domains xyzinmathbbr3 1epsilonz2leq x2y2 which become singular in finite time we further show that solutions with 0 swirl are necessarily globally regular the proof of singularity formation relies on the use of approximate solutions at exactly the critical regularity level which satisfy a 1d system which has solutions which blowup in finite time the construction bears similarity to our previous result on the boussinesq system citeejb though a number of modifications must be made due to anisotropy and since our domains are not scaleinvariant this seems to be the first construction of singularity formation for finiteenergy strong solutions to the actual 3d euler system | [['for', 'all', 'epsilon0', 'we', 'prove', 'the', 'existence', 'of', 'finiteenergy', 'strong', 'solutions', 'to', 'the', 'axisymmetric', '3d', 'euler', 'equations', 'on', 'the', 'domains', 'xyzinmathbbr3', '1epsilonz2leq', 'x2y2', 'which', 'become', 'singular', 'in', 'finite', 'time', 'we', 'further', 'show', 'that', 'solutions', 'with', '0', 'swirl', 'are', 'necessarily', 'globally', 'regular', 'the', 'proof', 'of', 'singularity', 'formation', 'relies', 'on', 'the', 'use', 'of', 'approximate', 'solutions', 'at', 'exactly', 'the', 'critical', 'regularity', 'level', 'which', 'satisfy', 'a', '1d', 'system', 'which', 'has', 'solutions', 'which', 'blowup', 'in', 'finite', 'time', 'the', 'construction', 'bears', 'similarity', 'to', 'our', 'previous', 'result', 'on', 'the', 'boussinesq', 'system', 'citeejb', 'though', 'a', 'number', 'of', 'modifications', 'must', 'be', 'made', 'due', 'to', 'anisotropy', 'and', 'since', 'our', 'domains', 'are', 'not', 'scaleinvariant', 'this', 'seems', 'to', 'be', 'the', 'first', 'construction', 'of', 'singularity', 'formation', 'for', 'finiteenergy', 'strong', 'solutions', 'to', 'the', 'actual', '3d', 'euler', 'system']] | [-0.17503111052016418, 0.02227563029543186, -0.11073172357476627, 0.06145815239287913, -0.08401779118382062, -0.14006724883026134, -0.03008851349974672, 0.2868278440864136, -0.2649714361876249, -0.23299349323303128, 0.15446360984933563, -0.27482335177483036, -0.10216242868336849, 0.17897110140571992, -0.03104741304802398, 0.08959673751766482, 0.08299560203837851, 0.0170703724201303, -0.0779164666950237, -0.2640338388814901, 0.3878063282230869, -0.028497124020941556, 0.271394156330886, 0.07502984262343186, 0.07864506363015002, -0.06660687991922411, 0.04676295501800875, 0.03059000416736429, -0.16649095299684025, 0.05761957064581414, 0.23861171357954541, 0.056248065871962655, 0.24007530991608897, -0.4445143994254371, -0.22090089166837668, 0.12146922406197215, 0.17604490692804878, 0.16697842591675, -0.03271457474523534, -0.2713007575580074, 0.1526152119949984, -0.10466108298860491, -0.2046443743708854, -0.0925452635390684, 0.02349127527947227, 0.07111196062372377, -0.2617022157763131, 0.061831792952337615, 0.11136560885158057, 0.014176386470595995, -0.12834112748969345, -0.03304642499133479, -0.04844563709339127, 0.08097249932664757, 0.07740284444880671, 0.042729889018664834, 0.014623491698876024, -0.11951832310878671, -0.06156149891709598, 0.36788684922309284, -0.048807082839387776, -0.2665158799849451, 0.22118905962755284, -0.16725518715490276, -0.13293323737258714, 0.16262581860646605, 0.13233371460422252, 0.13857648318711047, -0.059734926900515954, 0.10953868520882679, -0.0629905426564316, 0.1760032615158707, 0.10650236238725483, 0.004656575732709219, 0.1879903577811395, 0.10762412282250201, 0.13767661478680868, 0.08955545748855608, -0.015167129969146724, -0.1337999217173395, -0.3311090311772811, -0.1434799632411644, -0.17621520329169774, 0.10292431269978503, -0.09288440205067067, -0.2617511274137845, 0.3715550310676917, 0.1360905683754633, 0.16495132623240352, 0.09962286879696573, 0.24537024494105328, 0.13806920650143487, 0.0515366331480133, 0.10386212663725018, 0.2433046782175855, 0.07434378041264912, 0.13040854982488478, -0.2156668844477584, 0.05217970292627191, 0.1645578336281081] |
1,802.09937 | Injectivity of sections of close-to-convex harmonic mappings with convex
analytic part | In this article, we determine two point distortion theorem and sharp
coefficient estimates for the families of close-to-convex harmonic mappings
whose analytic part is a convex function of order $\alpha$. By making use of
these results, we determine the radius of univalence of sections of these
families in terms of zeros of certain equation. Lower bound for the radius of
univalence has been obtained explicitly for the case $\alpha = 1/2$. Comparison
of radius of univalence of the sections have been shown by providing a table of
numerical estimates for the special choices of $\alpha$.
| math.CV | in this article we determine two point distortion theorem and sharp coefficient estimates for the families of closetoconvex harmonic mappings whose analytic part is a convex function of order alpha by making use of these results we determine the radius of univalence of sections of these families in terms of zeros of certain equation lower bound for the radius of univalence has been obtained explicitly for the case alpha 12 comparison of radius of univalence of the sections have been shown by providing a table of numerical estimates for the special choices of alpha | [['in', 'this', 'article', 'we', 'determine', 'two', 'point', 'distortion', 'theorem', 'and', 'sharp', 'coefficient', 'estimates', 'for', 'the', 'families', 'of', 'closetoconvex', 'harmonic', 'mappings', 'whose', 'analytic', 'part', 'is', 'a', 'convex', 'function', 'of', 'order', 'alpha', 'by', 'making', 'use', 'of', 'these', 'results', 'we', 'determine', 'the', 'radius', 'of', 'univalence', 'of', 'sections', 'of', 'these', 'families', 'in', 'terms', 'of', 'zeros', 'of', 'certain', 'equation', 'lower', 'bound', 'for', 'the', 'radius', 'of', 'univalence', 'has', 'been', 'obtained', 'explicitly', 'for', 'the', 'case', 'alpha', '12', 'comparison', 'of', 'radius', 'of', 'univalence', 'of', 'the', 'sections', 'have', 'been', 'shown', 'by', 'providing', 'a', 'table', 'of', 'numerical', 'estimates', 'for', 'the', 'special', 'choices', 'of', 'alpha']] | [-0.13134247589326326, 0.03385334231573692, -0.057486365655773974, 0.07605671841017109, -0.03464607034433395, -0.08020594736878225, 0.025282888273223045, 0.33050030080522314, -0.20422186436963843, -0.2762414007348583, 0.11514490407624065, -0.28876946315892593, -0.12214635399744865, 0.2535414298639653, -0.04277736023861043, 0.1048280915364306, 0.004593255830572006, 0.06899704323447448, -0.1115988292533191, -0.25035365005370547, 0.3884695590711496, 0.010935906162287326, 0.14677379951574543, 0.12062953868286407, 0.0540254702494341, -0.00788069171694781, -0.05268099596922068, -0.012884507436265654, -0.2737955542261455, 0.17876755940465336, 0.21447288966242303, 0.09684575593316967, 0.2776313767312689, -0.3260045566972583, -0.17247245017875065, 0.11979254905847793, 0.12816137514830112, 0.019023839864840218, -0.02128842098519523, -0.2149377984088905, 0.09810496625574702, -0.1536190289052877, -0.21738878256106314, -0.06414534354166306, 0.07184103198666522, 0.11847172685443087, -0.2912662345816956, 0.06704333681982268, 0.1242870565781251, 0.08575072620519773, -0.10806073381149388, -0.17441675960868994, 0.008420631715512656, 0.11778771136689217, 0.05634813721321444, 0.005797089757447309, 0.06890032309642498, -0.08945654738109876, -0.058736352131706956, 0.3389238511271616, -0.042257843892080114, -0.23480645018292867, 0.10358052469908874, -0.17938754921580882, -0.13786210368407217, 0.12923978145873333, 0.13388186618388492, 0.16674397039187558, -0.12313895995054949, 0.13129349945526708, -0.08026482604389534, 0.14305644888744165, 0.1705303717047927, 0.022404203359830253, 0.15325273066125017, 0.07892275479760893, 0.08669552423723756, 0.15763041270807623, -0.04744491447258661, -0.0752437654486362, -0.3698493278724082, -0.15575993332242163, -0.1557308621308271, 0.040890181442088586, -0.14296609435730212, -0.17564212735909523, 0.3826541518990664, 0.05393135774771663, 0.20367993916226354, 0.0851712499973067, 0.2168461208112855, 0.1731904240899739, 0.045401528690684034, 0.011959045134643291, 0.26292282500442987, 0.1808843634839348, 0.009079974268543277, -0.13649963658362468, 0.05035488594179735, 0.17057148354286525] |
1,802.09938 | Gelfand-Tsetlin varieties for Yangians | S. Ovsienko proved that the Gelfand-Tsetlin variety for $\mathfrak{gl}_n$ is
equidimensional (i.e., all its irreducible components have the same dimension)
of dimension $\frac{n(n-1)}{2}$. This result is known as Ovsienko's Theorem and
it has important consequences in Representation Theory of Algebras. In this
paper, we will study the Gelfand-Tsetlin varieties for restricted Yangian
$Y_p(\mathfrak{gl}_n)$ and the equidimensionality for $Y_p(\mathfrak{gl}_3)$.
| math.RT math.AG | s ovsienko proved that the gelfandtsetlin variety for mathfrakgl_n is equidimensional ie all its irreducible components have the same dimension of dimension fracnn12 this result is known as ovsienkos theorem and it has important consequences in representation theory of algebras in this paper we will study the gelfandtsetlin varieties for restricted yangian y_pmathfrakgl_n and the equidimensionality for y_pmathfrakgl_3 | [['s', 'ovsienko', 'proved', 'that', 'the', 'gelfandtsetlin', 'variety', 'for', 'mathfrakgl_n', 'is', 'equidimensional', 'ie', 'all', 'its', 'irreducible', 'components', 'have', 'the', 'same', 'dimension', 'of', 'dimension', 'fracnn12', 'this', 'result', 'is', 'known', 'as', 'ovsienkos', 'theorem', 'and', 'it', 'has', 'important', 'consequences', 'in', 'representation', 'theory', 'of', 'algebras', 'in', 'this', 'paper', 'we', 'will', 'study', 'the', 'gelfandtsetlin', 'varieties', 'for', 'restricted', 'yangian', 'y_pmathfrakgl_n', 'and', 'the', 'equidimensionality', 'for', 'y_pmathfrakgl_3']] | [-0.14631596166132527, 0.06664098325100812, -0.09230034642598846, 0.06275552997196263, -0.06404677120630037, -0.1567834367890927, -0.07698699558492411, 0.3264049100943587, -0.31527511345391923, -0.15466663048348644, 0.133103973117911, -0.2141136882318692, -0.18961681918325748, 0.18955418263477358, -0.16158302969680252, -0.013547184810423376, 0.0670855948955498, 0.11891664425546133, -0.06334958624687384, -0.2964841157536615, 0.4021801945245401, -0.03373723011887209, 0.25376223329539327, 0.07168471571904692, 0.12628589116714217, 0.06377216812900521, -0.008665657365186649, -0.056891377879814665, -0.13145841055785157, 0.14583098590373994, 0.36426143002781003, 0.12344001156531952, 0.1791834391653538, -0.3101893623444167, -0.13504896715960718, 0.22185717477590183, 0.19766296581788498, 0.06808288659561765, 0.01825434500351548, -0.2347378582778302, 0.11349331954155456, -0.22188961488956754, -0.22892732417041606, -0.09016865077851847, 0.1337831714656204, -0.04737339942208068, -0.21411915912546894, -0.01218472234904766, 0.18786992698230526, 0.14202865196222608, -0.06013567474967038, -0.14644234304909, -0.06109934276477857, 0.09763723102567548, -0.0109385488639501, 0.030877361425452613, 0.02762221536514434, -0.10799568968571045, -0.16161032542586326, 0.35821574497967956, 0.02238861346109347, -0.2157137727534229, 0.17950714323669673, -0.1631122576919469, -0.23236972317946228, 0.07725591510957615, 0.08678433395583521, 0.1254224167290059, -0.05791896410625089, 0.2327421209499748, -0.17475695334036243, -0.011930024285208096, 0.13745587153190916, 0.04499298152090474, 0.09929671027295461, 0.11748343993147665, 0.05570765709893418, 0.12373091532764109, 0.014463160779665817, 0.012686644985594533, -0.3314495383338495, -0.1968015595762567, -0.14277353060050782, 0.13321093154901809, -0.09091441911507651, -0.14071904640983451, 0.40026612298732456, 0.11713894044303082, 0.1382179328833114, 0.11098105818117884, 0.20540632937442171, 0.09804590944497084, 0.09519327171993526, 0.05543203746730631, 0.15654555102810264, 0.26280059926211835, -0.0061506432565775785, -0.11734565345739777, 0.03834723359058526, 0.2321190601892092] |
1,802.09939 | 2D materials coated plasmonic structures for SERS applications | Two-dimensional (2D) materials, such as graphene and hexagonal boron nitride,
are new kind of materials that can serve as substrates for surface enhanced
Raman spectroscopy (SERS). When combined with traditional metallic plasmonic
structures, the hybrid 2D materials/metal SERS platform brings extra benefits,
including higher SERS enhancement factors, oxidation protection of metal
surface, and protection of molecules from photo-induced damage. This
perspective gives an overview of recent progress in 2D materials coated
plasmonic structure in SERS application. This paper focuses on the fabrication
of the hybrid 2D materials/metal SERS platform and their applications for Raman
enhancement.
| cond-mat.mtrl-sci | twodimensional 2d materials such as graphene and hexagonal boron nitride are new kind of materials that can serve as substrates for surface enhanced raman spectroscopy sers when combined with traditional metallic plasmonic structures the hybrid 2d materialsmetal sers platform brings extra benefits including higher sers enhancement factors oxidation protection of metal surface and protection of molecules from photoinduced damage this perspective gives an overview of recent progress in 2d materials coated plasmonic structure in sers application this paper focuses on the fabrication of the hybrid 2d materialsmetal sers platform and their applications for raman enhancement | [['twodimensional', '2d', 'materials', 'such', 'as', 'graphene', 'and', 'hexagonal', 'boron', 'nitride', 'are', 'new', 'kind', 'of', 'materials', 'that', 'can', 'serve', 'as', 'substrates', 'for', 'surface', 'enhanced', 'raman', 'spectroscopy', 'sers', 'when', 'combined', 'with', 'traditional', 'metallic', 'plasmonic', 'structures', 'the', 'hybrid', '2d', 'materialsmetal', 'sers', 'platform', 'brings', 'extra', 'benefits', 'including', 'higher', 'sers', 'enhancement', 'factors', 'oxidation', 'protection', 'of', 'metal', 'surface', 'and', 'protection', 'of', 'molecules', 'from', 'photoinduced', 'damage', 'this', 'perspective', 'gives', 'an', 'overview', 'of', 'recent', 'progress', 'in', '2d', 'materials', 'coated', 'plasmonic', 'structure', 'in', 'sers', 'application', 'this', 'paper', 'focuses', 'on', 'the', 'fabrication', 'of', 'the', 'hybrid', '2d', 'materialsmetal', 'sers', 'platform', 'and', 'their', 'applications', 'for', 'raman', 'enhancement']] | [-0.09451953681956937, 0.08727936005681097, 0.0011757881560873601, -0.09222796263350976, -0.048242753904853615, -0.19557138417236586, 0.0564703976908218, 0.48610613394969254, -0.23500222834928702, -0.2859339564838397, -0.017860386405460615, -0.33936679685708654, -0.32324594929213485, 0.26247536397028354, -0.04509530958008542, 0.0895000100696756, 0.009244190904522134, -0.18454061923248152, -0.06525773391558198, -0.1658164279382696, 0.2334057839777601, 0.08826978252299371, 0.42674204046207087, 0.1668713491645351, -0.01756282438403897, 0.004685856477026978, 0.08646932375987851, -0.057090137573209424, -0.12007049560806306, 0.213635815127242, 0.30454758690890443, -0.10199217691076218, 0.21286183874303055, -0.5497165681714172, -0.29036059530992664, -0.07258268624484059, 0.13212374739238733, 0.17396469241989557, -0.19795070840571558, -0.2584680079392368, 0.04602398324171982, -0.12297843788720426, -0.11022782445414572, -0.09273342123775873, -0.06982076923132584, -0.019016061819368792, -0.20706163527837063, -0.019456997253401304, 0.04235297087479823, 0.14531649995635273, -0.08992165553894255, -0.15848442548585515, -0.06010197036929669, 0.06561568146477634, 0.011709546109521261, -0.03156315004052494, 0.2703667950718814, -0.1407798988399126, -0.14525469161710272, 0.4305101600425538, -0.08467746664699848, -0.07381551813143956, 0.21849538421606324, -0.0976701316233444, -0.05709248753164404, 0.22836708071170955, 0.19241177889528455, 0.08597058983099076, -0.1503631527773768, 0.06254630628535124, 0.02884578025869785, 0.16519489543392293, 0.12466705697137982, 0.2020857154531905, 0.25533161991055536, 0.3209134983574791, 0.0121192167943684, 0.15308690681973453, -0.10462951386016944, 0.09332351016020903, -0.16438753524374577, -0.2892860757908033, -0.1768210687304056, 0.09869651546481475, -0.054732392341310346, -0.24900326703584963, 0.3708430950840314, 0.05531293288454093, 0.08664380652349322, -0.10510332382569511, 0.31561827899697886, 0.02118155176711259, 0.09149983276673142, -0.11882426293807165, 0.25523859326557446, 0.14052843775159568, 0.10438932714732213, -0.2053760928026731, 0.060423884286685416, -0.007174540916958483] |
1,802.0994 | Self-dual formulation of gravity in topological M-theory | Inspired by the low wave-length limit of topological M-theory, which
re-constructs the theory of $3+1$D gravity in the self-dual variables'
formulation, and by the realization that in Loop Quantum Gravity the holonomy
of a flat connection can be non-trivial if and only if a non-trivial
(space-like) line defect is localized inside the loop, we argue that
non-trivial gravitational holonomies can be put in correspondence with
space-like M-branes. This suggests the existence of a new duality, which we
call $H$ duality, interconnecting topological M-theory with Loop Quantum
Gravity. We spell some arguments to show that fundamental S-strings are serious
candidates to be considered in order to instantiate this correspondence to
classes of LQG states. In particular, we consider the case of the holonomy
flowers in LQG, and show that for this type of states the action of the
Hamiltonian constraint, from the M-theory side, corresponds to a linear
combination of appearance and disappearance of a SNS1- strings. Consequently,
these processes can be reinterpreted, respectively, as enucleations or decays
into open or closed strings.
| hep-th gr-qc | inspired by the low wavelength limit of topological mtheory which reconstructs the theory of 31d gravity in the selfdual variables formulation and by the realization that in loop quantum gravity the holonomy of a flat connection can be nontrivial if and only if a nontrivial spacelike line defect is localized inside the loop we argue that nontrivial gravitational holonomies can be put in correspondence with spacelike mbranes this suggests the existence of a new duality which we call h duality interconnecting topological mtheory with loop quantum gravity we spell some arguments to show that fundamental sstrings are serious candidates to be considered in order to instantiate this correspondence to classes of lqg states in particular we consider the case of the holonomy flowers in lqg and show that for this type of states the action of the hamiltonian constraint from the mtheory side corresponds to a linear combination of appearance and disappearance of a sns1 strings consequently these processes can be reinterpreted respectively as enucleations or decays into open or closed strings | [['inspired', 'by', 'the', 'low', 'wavelength', 'limit', 'of', 'topological', 'mtheory', 'which', 'reconstructs', 'the', 'theory', 'of', '31d', 'gravity', 'in', 'the', 'selfdual', 'variables', 'formulation', 'and', 'by', 'the', 'realization', 'that', 'in', 'loop', 'quantum', 'gravity', 'the', 'holonomy', 'of', 'a', 'flat', 'connection', 'can', 'be', 'nontrivial', 'if', 'and', 'only', 'if', 'a', 'nontrivial', 'spacelike', 'line', 'defect', 'is', 'localized', 'inside', 'the', 'loop', 'we', 'argue', 'that', 'nontrivial', 'gravitational', 'holonomies', 'can', 'be', 'put', 'in', 'correspondence', 'with', 'spacelike', 'mbranes', 'this', 'suggests', 'the', 'existence', 'of', 'a', 'new', 'duality', 'which', 'we', 'call', 'h', 'duality', 'interconnecting', 'topological', 'mtheory', 'with', 'loop', 'quantum', 'gravity', 'we', 'spell', 'some', 'arguments', 'to', 'show', 'that', 'fundamental', 'sstrings', 'are', 'serious', 'candidates', 'to', 'be', 'considered', 'in', 'order', 'to', 'instantiate', 'this', 'correspondence', 'to', 'classes', 'of', 'lqg', 'states', 'in', 'particular', 'we', 'consider', 'the', 'case', 'of', 'the', 'holonomy', 'flowers', 'in', 'lqg', 'and', 'show', 'that', 'for', 'this', 'type', 'of', 'states', 'the', 'action', 'of', 'the', 'hamiltonian', 'constraint', 'from', 'the', 'mtheory', 'side', 'corresponds', 'to', 'a', 'linear', 'combination', 'of', 'appearance', 'and', 'disappearance', 'of', 'a', 'sns1', 'strings', 'consequently', 'these', 'processes', 'can', 'be', 'reinterpreted', 'respectively', 'as', 'enucleations', 'or', 'decays', 'into', 'open', 'or', 'closed', 'strings']] | [-0.17263247421563785, 0.17759221530872116, -0.09463882329376748, 0.09395624245737387, -0.09421047213426709, -0.18060280256160705, 0.02393846034441562, 0.3025236629258246, -0.24973451175324662, -0.24272917534745458, 0.09360720252910265, -0.2413751431189742, -0.17250426023779714, 0.14664856442277865, -0.10836488029715666, -0.005202296283647154, 0.024889712322492305, 0.06300002805469833, -0.10487570226490056, -0.2231492835259583, 0.35447290295338224, -0.004003965738091684, 0.24292846653092454, 0.06790609025677456, 0.09073039904688333, -0.03459460664259479, 0.02975178882686322, 0.07584864351644936, -0.10173228857628919, 0.10714944308904721, 0.26532692110893374, 0.09129021029319055, 0.15080510379647363, -0.4494341908232171, -0.234493359967449, 0.07992576442923419, 0.14811793771936121, 0.12850617319648566, -0.017373019487723795, -0.31587843639230545, 0.09436175019546418, -0.13818721450898333, -0.1375519361859463, -0.04900156553922849, 0.007569113669134456, -0.09196714612726982, -0.19365791823665374, 0.043568613373443, 0.06523610012517614, -0.0036200410686433315, -0.03157060878928585, -0.02070708206948444, -0.0596954885060133, 0.10417484091980571, 0.06514676441865581, 0.06344638314764925, 0.07618075576693525, -0.14553685193556257, -0.17937967747714392, 0.3549455412988656, -0.05678796047033444, -0.22719307283914963, 0.14661689147287044, -0.13690822482379097, -0.1770714575730639, 0.07206353493180875, 0.12774548886795722, 0.11951254399151669, -0.10080556692548659, 0.1652910658118753, -0.05417872229921659, 0.11373580866782601, 0.10444703808649493, 0.07463473570188672, 0.30154467237143384, 0.087839394438593, 0.059205882907046016, 0.15999206186123413, -0.051855521273837815, -0.13363002827280812, -0.41570908853993616, -0.18211272448720134, -0.11569111757862145, 0.12820326929812778, -0.09844238905355984, -0.1945560672513303, 0.35998501994002324, 0.10081652742838101, 0.19062810384299186, 0.04119177911149547, 0.206733263544077, 0.10919750969823913, 0.07188116505462401, 0.07604267701028554, 0.2532413634259775, 0.145777556171762, -0.0026872822699362973, -0.23132529438572477, -0.08090657824388645, 0.14153118382797703] |
1,802.09941 | Demystifying Parallel and Distributed Deep Learning: An In-Depth
Concurrency Analysis | Deep Neural Networks (DNNs) are becoming an important tool in modern
computing applications. Accelerating their training is a major challenge and
techniques range from distributed algorithms to low-level circuit design. In
this survey, we describe the problem from a theoretical perspective, followed
by approaches for its parallelization. We present trends in DNN architectures
and the resulting implications on parallelization strategies. We then review
and model the different types of concurrency in DNNs: from the single operator,
through parallelism in network inference and training, to distributed deep
learning. We discuss asynchronous stochastic optimization, distributed system
architectures, communication schemes, and neural architecture search. Based on
those approaches, we extrapolate potential directions for parallelism in deep
learning.
| cs.LG cs.CV cs.DC cs.NE | deep neural networks dnns are becoming an important tool in modern computing applications accelerating their training is a major challenge and techniques range from distributed algorithms to lowlevel circuit design in this survey we describe the problem from a theoretical perspective followed by approaches for its parallelization we present trends in dnn architectures and the resulting implications on parallelization strategies we then review and model the different types of concurrency in dnns from the single operator through parallelism in network inference and training to distributed deep learning we discuss asynchronous stochastic optimization distributed system architectures communication schemes and neural architecture search based on those approaches we extrapolate potential directions for parallelism in deep learning | [['deep', 'neural', 'networks', 'dnns', 'are', 'becoming', 'an', 'important', 'tool', 'in', 'modern', 'computing', 'applications', 'accelerating', 'their', 'training', 'is', 'a', 'major', 'challenge', 'and', 'techniques', 'range', 'from', 'distributed', 'algorithms', 'to', 'lowlevel', 'circuit', 'design', 'in', 'this', 'survey', 'we', 'describe', 'the', 'problem', 'from', 'a', 'theoretical', 'perspective', 'followed', 'by', 'approaches', 'for', 'its', 'parallelization', 'we', 'present', 'trends', 'in', 'dnn', 'architectures', 'and', 'the', 'resulting', 'implications', 'on', 'parallelization', 'strategies', 'we', 'then', 'review', 'and', 'model', 'the', 'different', 'types', 'of', 'concurrency', 'in', 'dnns', 'from', 'the', 'single', 'operator', 'through', 'parallelism', 'in', 'network', 'inference', 'and', 'training', 'to', 'distributed', 'deep', 'learning', 'we', 'discuss', 'asynchronous', 'stochastic', 'optimization', 'distributed', 'system', 'architectures', 'communication', 'schemes', 'and', 'neural', 'architecture', 'search', 'based', 'on', 'those', 'approaches', 'we', 'extrapolate', 'potential', 'directions', 'for', 'parallelism', 'in', 'deep', 'learning']] | [-0.10081651433281143, -0.02871684265706439, -0.055386120143036045, 0.06075330324503675, -0.08158239493505996, -0.19601026471099703, 0.0528556393610575, 0.49147789363275496, -0.34110583909051984, -0.3301961064551091, 0.07546503394188588, -0.2159703636517454, -0.24300054972174398, 0.2281425352118452, -0.11540710689548991, 0.13359815871961855, 0.12420660277354743, -0.04725079076862976, -0.08229722649577939, -0.2799529285382545, 0.29319324457442, 0.055452878725063465, 0.34390701580049243, -0.0065574808405679565, 0.10380344550210059, -0.040739728824088446, -0.029122992688299792, -0.04789305674504456, -0.06706396823446675, 0.20800427380405986, 0.33029304859800296, 0.2585209188778607, 0.36930341342169987, -0.493987737141811, -0.18950879842598448, 0.09016433925155484, 0.18648119615120282, 0.14002860385593713, -0.05092826889411203, -0.28807640117348027, 0.07878352577079153, -0.17837025948979876, 0.016711274599002904, -0.14141984920327863, -0.030614974855428988, 0.0264103396861046, -0.22102133290670617, -0.037142043361407626, 0.05181983347753422, 0.09647663895106107, -0.05585140195417855, -0.15361306066277616, 0.10838102832796019, 0.1079698671594981, -0.003228670128073805, 0.02837925663283258, 0.15266252105459244, -0.19184439909325815, -0.2007967725318546, 0.3253043768764065, -0.012659707433429727, -0.1606621633716777, 0.19947318424952723, 0.06342551110949564, -0.2200553681652405, 0.02590288214994137, 0.32361214516455666, 0.08989861549956626, -0.1883635111684143, 0.0788345758454964, 0.0810550515899402, 0.1306414162564467, -0.010873156599700451, 0.01698557458197077, 0.20818350957747417, 0.3304859014869292, 0.04731971090414414, 0.12990327596280463, -0.10096166691979752, -0.1587495296711527, -0.20754012525931262, -0.08839841228868943, -0.15017675638827904, -0.02924394383903985, -0.10207435260708096, -0.13354230770971953, 0.38445324021015775, 0.24494384562294408, 0.166328946081513, 0.13134902236133553, 0.4016276012632277, 0.033491415114615834, 0.15556373060149908, 0.17854945975551872, 0.18538613231717854, 0.06993214495422874, 0.22262782615348042, -0.15468532809468902, 0.041327428995844046, 0.025072262193517464] |
1,802.09942 | Fermion Self-energy and Pseudovector Condensate in NJL Model with
External Magnetic Field | In this paper, we aim to study the complete self-energy in the fermion
propagator within two-flavor NJL model in the case of finite temperature,
chemical potential and external magnetic field. Through Fierz transformation we
prove that the self-energy is not simply proportional to dynamical mass in the
presence of chemical potential, moreover, it contains four kinds of condensates
after introducing external magnetic field. We find out the appropriate and
complete form of self-energy and establish new gap equations. We take two of
the four condensates (scalar and pseudovector condensates) to make an
approximation and simplify the gap equations. The numerical results show that
not only the dynamical mass get quantitative modification, but also the
properties of Nambu phase and Wigner phase are significantly different with
classic results. Instead of classic Wigner phase with zero dynamic mass in the
massless NJL model, we propose a new phase - quasi-Wigner phase in this
article, it has small but nonzero dynamic mass, with increasing chemical
potential, eventually Nambu phase will turn into quasi-Wigner phase with
first-order phase transition, therefore the chiral symmetry can never be fully
restored but be partially restored. Furthermore, we prove that pseudovector
condensate in self-energy can generate energy splitting in dispersion relation,
it will cause minor differences of particle numbers with the split energy
levels.
| hep-th | in this paper we aim to study the complete selfenergy in the fermion propagator within twoflavor njl model in the case of finite temperature chemical potential and external magnetic field through fierz transformation we prove that the selfenergy is not simply proportional to dynamical mass in the presence of chemical potential moreover it contains four kinds of condensates after introducing external magnetic field we find out the appropriate and complete form of selfenergy and establish new gap equations we take two of the four condensates scalar and pseudovector condensates to make an approximation and simplify the gap equations the numerical results show that not only the dynamical mass get quantitative modification but also the properties of nambu phase and wigner phase are significantly different with classic results instead of classic wigner phase with zero dynamic mass in the massless njl model we propose a new phase quasiwigner phase in this article it has small but nonzero dynamic mass with increasing chemical potential eventually nambu phase will turn into quasiwigner phase with firstorder phase transition therefore the chiral symmetry can never be fully restored but be partially restored furthermore we prove that pseudovector condensate in selfenergy can generate energy splitting in dispersion relation it will cause minor differences of particle numbers with the split energy levels | [['in', 'this', 'paper', 'we', 'aim', 'to', 'study', 'the', 'complete', 'selfenergy', 'in', 'the', 'fermion', 'propagator', 'within', 'twoflavor', 'njl', 'model', 'in', 'the', 'case', 'of', 'finite', 'temperature', 'chemical', 'potential', 'and', 'external', 'magnetic', 'field', 'through', 'fierz', 'transformation', 'we', 'prove', 'that', 'the', 'selfenergy', 'is', 'not', 'simply', 'proportional', 'to', 'dynamical', 'mass', 'in', 'the', 'presence', 'of', 'chemical', 'potential', 'moreover', 'it', 'contains', 'four', 'kinds', 'of', 'condensates', 'after', 'introducing', 'external', 'magnetic', 'field', 'we', 'find', 'out', 'the', 'appropriate', 'and', 'complete', 'form', 'of', 'selfenergy', 'and', 'establish', 'new', 'gap', 'equations', 'we', 'take', 'two', 'of', 'the', 'four', 'condensates', 'scalar', 'and', 'pseudovector', 'condensates', 'to', 'make', 'an', 'approximation', 'and', 'simplify', 'the', 'gap', 'equations', 'the', 'numerical', 'results', 'show', 'that', 'not', 'only', 'the', 'dynamical', 'mass', 'get', 'quantitative', 'modification', 'but', 'also', 'the', 'properties', 'of', 'nambu', 'phase', 'and', 'wigner', 'phase', 'are', 'significantly', 'different', 'with', 'classic', 'results', 'instead', 'of', 'classic', 'wigner', 'phase', 'with', 'zero', 'dynamic', 'mass', 'in', 'the', 'massless', 'njl', 'model', 'we', 'propose', 'a', 'new', 'phase', 'quasiwigner', 'phase', 'in', 'this', 'article', 'it', 'has', 'small', 'but', 'nonzero', 'dynamic', 'mass', 'with', 'increasing', 'chemical', 'potential', 'eventually', 'nambu', 'phase', 'will', 'turn', 'into', 'quasiwigner', 'phase', 'with', 'firstorder', 'phase', 'transition', 'therefore', 'the', 'chiral', 'symmetry', 'can', 'never', 'be', 'fully', 'restored', 'but', 'be', 'partially', 'restored', 'furthermore', 'we', 'prove', 'that', 'pseudovector', 'condensate', 'in', 'selfenergy', 'can', 'generate', 'energy', 'splitting', 'in', 'dispersion', 'relation', 'it', 'will', 'cause', 'minor', 'differences', 'of', 'particle', 'numbers', 'with', 'the', 'split', 'energy', 'levels']] | [-0.1519997271741632, 0.2324228783293091, -0.11023759447406371, 0.0632836319511583, -0.07346494341334112, -0.11410509622006049, 0.0620990568842349, 0.3738309700388548, -0.23373967428193537, -0.2870846640453999, 0.01767824789899033, -0.24905116503495117, -0.1544639053646215, 0.07592687441826647, 0.00838867837758085, 0.005413657707313812, 0.00985229060237924, 0.042460910256865415, -0.11439488104674532, -0.22767347150731312, 0.3536532443536575, -0.022824642287437306, 0.2468048098475434, 0.12038018358654753, 0.034420447291394825, -0.0026573435793262584, 0.025610300192479476, 0.030098212809236937, -0.09449860950397886, -0.04170117293224605, 0.19527733677045203, 0.02162433454420331, 0.2059814336341481, -0.424007402819603, -0.20699399691075088, 0.1220215535105401, 0.1684359077101595, 0.15296964104027422, -0.0793892074468394, -0.27962917620695177, 0.041171621561570226, -0.19115790180742828, -0.19089980925281727, -0.14692063858775897, -0.03976551981447914, -0.033929291908185236, -0.2505554843786021, 0.11531978993516531, 0.04203187995130023, 0.014924508415509102, -0.0839225847176601, -0.1303706177185441, -0.05645417997526914, 0.08275923813086783, 0.0501073976567145, 0.05704402430362047, 0.09316401043625921, -0.13246046077029586, -0.037163176126020075, 0.39345383437480347, -0.0930956136245757, -0.18837750587005947, 0.1352531059244431, -0.17408361642643116, -0.11435890087078131, 0.13110520547082605, 0.13051023845409238, 0.06589378698317463, -0.19122955060975497, 0.08718848871554487, 0.004501377565916194, 0.17420329245587074, 0.05814302584892789, 0.024455191022824757, 0.22786506052713754, 0.1306929100304842, 0.018650299434138592, 0.1460484689892118, -0.033594789749098034, -0.1597331777572372, -0.3098144217935759, -0.14307963293977083, -0.1359850802632092, 0.025907596457495116, -0.09202371813251291, -0.17866538751350586, 0.401965647583914, 0.1792250493281456, 0.17712067754202804, 0.014427355219891597, 0.2910911629398808, 0.15600722792536714, 0.08336221516392259, 0.0418815529656185, 0.2708497361821491, 0.15948851295248714, 0.11804888908383111, -0.26484911903565705, -0.04737453703703575, 0.09176874348980396] |
1,802.09943 | Spotting Stellar Activity Cycles in Gaia Astrometry | Astrometry from Gaia will measure the positions of stellar photometric
centroids to unprecedented precision. We show that the precision of Gaia
astrometry is sufficient to detect starspot-induced centroid jitter for nearby
stars in the Tycho-Gaia Astrometric Solution (TGAS) sample with magnetic
activity similar to the young G-star KIC 7174505 or the active M4 dwarf GJ
1243, but is insufficient to measure centroid jitter for stars with Sun-like
spot distributions. We simulate Gaia observations of stars with 10 year
activity cycles to search for evidence of activity cycles, and find that Gaia
astrometry alone likely can not detect activity cycles for stars in the TGAS
sample, even if they have spot distributions like KIC 7174505. We review the
activity of the nearby low-mass stars in the TGAS sample for which we
anticipate significant detections of spot-induced jitter.
| astro-ph.SR | astrometry from gaia will measure the positions of stellar photometric centroids to unprecedented precision we show that the precision of gaia astrometry is sufficient to detect starspotinduced centroid jitter for nearby stars in the tychogaia astrometric solution tgas sample with magnetic activity similar to the young gstar kic 7174505 or the active m4 dwarf gj 1243 but is insufficient to measure centroid jitter for stars with sunlike spot distributions we simulate gaia observations of stars with 10 year activity cycles to search for evidence of activity cycles and find that gaia astrometry alone likely can not detect activity cycles for stars in the tgas sample even if they have spot distributions like kic 7174505 we review the activity of the nearby lowmass stars in the tgas sample for which we anticipate significant detections of spotinduced jitter | [['astrometry', 'from', 'gaia', 'will', 'measure', 'the', 'positions', 'of', 'stellar', 'photometric', 'centroids', 'to', 'unprecedented', 'precision', 'we', 'show', 'that', 'the', 'precision', 'of', 'gaia', 'astrometry', 'is', 'sufficient', 'to', 'detect', 'starspotinduced', 'centroid', 'jitter', 'for', 'nearby', 'stars', 'in', 'the', 'tychogaia', 'astrometric', 'solution', 'tgas', 'sample', 'with', 'magnetic', 'activity', 'similar', 'to', 'the', 'young', 'gstar', 'kic', '7174505', 'or', 'the', 'active', 'm4', 'dwarf', 'gj', '1243', 'but', 'is', 'insufficient', 'to', 'measure', 'centroid', 'jitter', 'for', 'stars', 'with', 'sunlike', 'spot', 'distributions', 'we', 'simulate', 'gaia', 'observations', 'of', 'stars', 'with', '10', 'year', 'activity', 'cycles', 'to', 'search', 'for', 'evidence', 'of', 'activity', 'cycles', 'and', 'find', 'that', 'gaia', 'astrometry', 'alone', 'likely', 'can', 'not', 'detect', 'activity', 'cycles', 'for', 'stars', 'in', 'the', 'tgas', 'sample', 'even', 'if', 'they', 'have', 'spot', 'distributions', 'like', 'kic', '7174505', 'we', 'review', 'the', 'activity', 'of', 'the', 'nearby', 'lowmass', 'stars', 'in', 'the', 'tgas', 'sample', 'for', 'which', 'we', 'anticipate', 'significant', 'detections', 'of', 'spotinduced', 'jitter']] | [-0.0739205357424894, 0.13093283052431115, -0.0995333691113698, 0.1125847620337006, -0.1709217779588566, -0.03303088739152942, 0.1384114580812739, 0.45577164302899764, -0.15207865246251892, -0.4276438047275392, 0.06396155395812647, -0.3495987949253463, -0.010280667407153202, 0.21355249749413177, -0.1976048323784524, -0.016611569536087074, 0.25546658116934906, -0.0026873485949724467, 0.007979822589202658, -0.27205586798989506, 0.21761232699309266, 0.06024467639291464, 0.06124771980624368, -0.1549346861116755, 0.03485757248378845, -0.14940187395828317, -0.11171874629660274, -0.03808922722324062, -0.16036551535260296, 0.022899219672431918, 0.253579500499668, 0.19053146070036203, 0.19269190961495042, -0.29172391888478977, -0.18259572961242565, 0.11457098079428299, 0.1758787238678492, 0.04052234493211648, -0.05498512542055948, -0.3147432251638775, 0.11907751992025148, -0.16494397477441425, -0.20588428162754194, -0.03693120164880112, 0.153870092595427, 0.08410967592108272, -0.2319467612785468, 0.09813087378062113, 0.02954447963761527, 0.19021782199782666, -0.1854022883987332, -0.11366256323656929, -0.0676200570045178, 0.13608033352343837, -0.011984953002608033, 0.10970607118458668, 0.10476782704953716, -0.08333504775455639, -0.04389354494164017, 0.41817365140556845, -0.1283079302650807, 0.012621839994689755, 0.16414060575692957, -0.2770093650654403, -0.20645090381253456, 0.08803087057295575, 0.19285648716474646, 0.14440861455018897, -0.2216712636664621, -0.11742270685803603, 0.048544605929793705, 0.25595432551883496, 0.06395315771588861, 0.08989309463927996, 0.34802640791037187, 0.10804994868587202, 0.12408660144246281, 0.023995347939598472, -0.3712909593274678, 0.006651847126351586, -0.20796178288691775, -0.07113425256753925, -0.10253679304932758, 0.06557951908076005, -0.13603621821339265, -0.11821974288592282, 0.33201963052765204, 0.17193407864212545, 0.11587871859760594, 0.034967667933157295, 0.3373607491879766, 0.04332038795413908, 0.1250733885125243, 0.11674675981361252, 0.37759856499536937, 0.15316337923025852, 0.07044814237907751, -0.2635188722798823, 0.07933627217730034, -0.009924689061077895] |
1,802.09944 | The Development of Darwin's Origin of Species | From 1837, when he returned to England aboard the $\textit{HMS Beagle}$, to
1860, just after publication of $\textit{The Origin of Species}$, Charles
Darwin kept detailed notes of each book he read or wanted to read. His notes
and manuscripts provide information about decades of individual scientific
practice. Previously, we trained topic models on the full texts of each
reading, and applied information-theoretic measures to detect that changes in
his reading patterns coincided with the boundaries of his three major
intellectual projects in the period 1837-1860. In this new work we apply the
reading model to five additional documents, four of them by Darwin: the first
edition of $\textit{The Origin of Species}$, two private essays stating
intermediate forms of his theory in 1842 and 1844, a third essay of disputed
dating, and Alfred Russel Wallace's essay, which Darwin received in 1858. We
address three historical inquiries, previously treated qualitatively: 1) the
mythology of "Darwin's Delay," that despite completing an extensive draft in
1844, Darwin waited until 1859 to publish $\textit{The Origin of Species}$ due
to external pressures; 2) the relationship between Darwin and Wallace's
contemporaneous theories, especially in light of their joint presentation; and
3) dating of the "Outline and Draft" which was rediscovered in 1975 and
postulated first as an 1839 draft preceding the Sketch of 1842, then as an
interstitial draft between the 1842 and 1844 essays.
| cs.CL cs.DL | from 1837 when he returned to england aboard the textithms beagle to 1860 just after publication of textitthe origin of species charles darwin kept detailed notes of each book he read or wanted to read his notes and manuscripts provide information about decades of individual scientific practice previously we trained topic models on the full texts of each reading and applied informationtheoretic measures to detect that changes in his reading patterns coincided with the boundaries of his three major intellectual projects in the period 18371860 in this new work we apply the reading model to five additional documents four of them by darwin the first edition of textitthe origin of species two private essays stating intermediate forms of his theory in 1842 and 1844 a third essay of disputed dating and alfred russel wallaces essay which darwin received in 1858 we address three historical inquiries previously treated qualitatively 1 the mythology of darwins delay that despite completing an extensive draft in 1844 darwin waited until 1859 to publish textitthe origin of species due to external pressures 2 the relationship between darwin and wallaces contemporaneous theories especially in light of their joint presentation and 3 dating of the outline and draft which was rediscovered in 1975 and postulated first as an 1839 draft preceding the sketch of 1842 then as an interstitial draft between the 1842 and 1844 essays | [['from', '1837', 'when', 'he', 'returned', 'to', 'england', 'aboard', 'the', 'textithms', 'beagle', 'to', '1860', 'just', 'after', 'publication', 'of', 'textitthe', 'origin', 'of', 'species', 'charles', 'darwin', 'kept', 'detailed', 'notes', 'of', 'each', 'book', 'he', 'read', 'or', 'wanted', 'to', 'read', 'his', 'notes', 'and', 'manuscripts', 'provide', 'information', 'about', 'decades', 'of', 'individual', 'scientific', 'practice', 'previously', 'we', 'trained', 'topic', 'models', 'on', 'the', 'full', 'texts', 'of', 'each', 'reading', 'and', 'applied', 'informationtheoretic', 'measures', 'to', 'detect', 'that', 'changes', 'in', 'his', 'reading', 'patterns', 'coincided', 'with', 'the', 'boundaries', 'of', 'his', 'three', 'major', 'intellectual', 'projects', 'in', 'the', 'period', '18371860', 'in', 'this', 'new', 'work', 'we', 'apply', 'the', 'reading', 'model', 'to', 'five', 'additional', 'documents', 'four', 'of', 'them', 'by', 'darwin', 'the', 'first', 'edition', 'of', 'textitthe', 'origin', 'of', 'species', 'two', 'private', 'essays', 'stating', 'intermediate', 'forms', 'of', 'his', 'theory', 'in', '1842', 'and', '1844', 'a', 'third', 'essay', 'of', 'disputed', 'dating', 'and', 'alfred', 'russel', 'wallaces', 'essay', 'which', 'darwin', 'received', 'in', '1858', 'we', 'address', 'three', 'historical', 'inquiries', 'previously', 'treated', 'qualitatively', '1', 'the', 'mythology', 'of', 'darwins', 'delay', 'that', 'despite', 'completing', 'an', 'extensive', 'draft', 'in', '1844', 'darwin', 'waited', 'until', '1859', 'to', 'publish', 'textitthe', 'origin', 'of', 'species', 'due', 'to', 'external', 'pressures', '2', 'the', 'relationship', 'between', 'darwin', 'and', 'wallaces', 'contemporaneous', 'theories', 'especially', 'in', 'light', 'of', 'their', 'joint', 'presentation', 'and', '3', 'dating', 'of', 'the', 'outline', 'and', 'draft', 'which', 'was', 'rediscovered', 'in', '1975', 'and', 'postulated', 'first', 'as', 'an', '1839', 'draft', 'preceding', 'the', 'sketch', 'of', '1842', 'then', 'as', 'an', 'interstitial', 'draft', 'between', 'the', '1842', 'and', '1844', 'essays']] | [-0.057054510062062844, 0.08541418063531339, -0.09282161383008775, 0.09167179889694697, -0.1113993617164103, -0.15500998179906303, 0.10313534208591946, 0.3027777713682272, -0.20937550388533102, -0.36013811083090186, 0.09710672166635308, -0.33909006828063093, -0.14534255088949824, 0.13479951299537402, -0.14580964870375904, -0.06216266957746275, 0.05346076920282392, 0.03593477771158508, -0.013366447953276534, -0.36842563870029144, 0.24859608658429738, 0.11274687844674737, 0.21691937555674365, 0.037760938440482505, 0.10177356682917921, 0.006450352972925567, -0.14529300700789174, -0.07060943792504053, -0.11727173314245667, 0.10521737185070024, 0.2751990974953933, 0.21386779582465842, 0.323415072601849, -0.42794434279945176, -0.10950832573317848, 0.017472770021799786, 0.09000651590913468, 0.08563490440570379, 0.025631107520507814, -0.34299641490946897, -0.010081462387976328, -0.20557357695064946, -0.10264204952474869, 0.029707280234887008, 0.10509075893427089, -0.006346211622394951, -0.10841090221058956, 0.03282253509176178, 0.08256306018437201, 0.15038369100672744, -0.06098833485028451, -0.17539148836446086, 0.022862843239877736, 0.19566035388200853, 0.1075366626821244, 0.05292245473319137, 0.061240657398567856, -0.0917487746564078, -0.14313762739148256, 0.3740529040651462, -0.0691161406828107, -0.03783204751418887, 0.15174343933395637, -0.11423992088828977, -0.16829635162705936, 0.08561046222231013, 0.12160265394610113, 0.05557941094832083, -0.20463342676321672, 0.02333747288722141, -0.027011606195266512, 0.16379938319951823, 0.16979268898639366, -0.05751403272090134, 0.21731886221765565, 0.09163433353703024, -0.07143815148994481, 0.07684635228541292, -0.05707643076221652, -0.08667619415122059, -0.2687722789108201, -0.18903889014582415, -0.1457772970516894, 0.05036595280733438, 0.0554742041504061, -0.14250404707803102, 0.3723712589290916, 0.18225035948480017, 0.10309674885882213, -0.022360489695473055, 0.22830674570647225, -0.007992490931348134, 0.012785696103951, 0.049354634023131394, 0.22308400828819885, 0.08203159822501341, 0.20958195088649648, -0.0950371763046699, 0.08685788160305372, 0.09626123847942634] |
1,802.09945 | Which sets are sets of lengths in all numerical monoids ? | We explicitly determine those sets of nonnegative integers which occur as
sets of lengths in all numerical monoids.
| math.AC | we explicitly determine those sets of nonnegative integers which occur as sets of lengths in all numerical monoids | [['we', 'explicitly', 'determine', 'those', 'sets', 'of', 'nonnegative', 'integers', 'which', 'occur', 'as', 'sets', 'of', 'lengths', 'in', 'all', 'numerical', 'monoids']] | [-0.18609567348741823, 0.1396971521899104, 0.034934821642107435, 0.14072631646154654, 0.0023455998808559445, -0.09517020924896416, -0.0118152956581778, 0.3744871850228972, -0.37715236180358463, -0.17898011450759238, 0.07536782830720767, -0.3324619714791576, -0.11971018132236269, 0.23744448812471497, -0.00931595897095071, 0.03644544289757808, 0.06862646641416682, 0.053341057151556015, -0.062156258461376034, -0.34114785202675396, 0.39996318684683907, -0.10986867557383245, 0.14984940002775854, 0.03231275174766779, 0.05241341537071599, -0.05040738904305423, -0.05847183072991255, 0.09437498571868572, -0.20964706652901238, 0.03462111673757641, 0.38500113640394473, 0.14350400008778605, 0.21141843828890058, -0.42799855023622513, -0.13778671880977023, 0.24463034110764661, 0.12483659738467799, 0.06382925185607746, 0.06831971261029442, -0.18180109369051126, 0.19285742400421035, -0.13783077626592583, -0.11156585196860963, -0.11732110908875863, 0.10154037053386371, 0.12846992816776037, -0.29633738607582116, 0.001757893685458435, 0.04543872793308563, 0.10783951131937404, -0.09857784666948849, -0.24500032524681753, -0.01764906880756219, 0.16193023727585873, 0.018887012576063473, -0.10562220443454054, 0.04324637255113986, 0.03274716447210974, -0.1761278503399808, 0.3603603200883501, 0.030505834975176387, -0.2461346917423523, 0.14703208787573707, -0.15519874377383125, -0.14370033289823267, 0.163871001245247, 0.1199809503224161, 0.18207851755950186, -0.0684500601556566, 0.12395374808046553, -0.2055459548201826, 0.0720087881717417, 0.2331422796058986, 0.09433591634862953, 0.1842673265685638, -0.014803307751814524, 0.005119690050681432, 0.13341046228177017, 0.07093324760595958, -0.025730066958607897, -0.3678061008039448, -0.04826366125295559, -0.1776306171862719, 0.08197030207763116, -0.13079252337209052, -0.27941216414587366, 0.32833742412428063, 0.1747534606191847, 0.21533669282992682, 0.15824462450756174, 0.21844519095288384, 0.030409778306622885, 0.08139810876713859, 0.05163674889546302, 0.003677596752014425, 0.13864697474572393, -0.07015031089799272, -0.13984105622188914, 0.0171733723125524, 0.18422639364790586] |
1,802.09946 | Jacobi-Trudi type formula for character of irreducible representations
of $\frak{gl}(m|1)$ | We prove a determinantal type formula to compute the irreducible characters
of the general Lie superalgebra $\mathfrak{gl}(m|1)$ in terms of the characters
of the symmetric powers of the fundamental representation and their duals. This
formula was conjectured by J. van der Jeugt and E. Moens for the Lie
superalgebra $\frak{gl}(m|n)$ and generalizes the well-known Jacobi-Trudi
formula.
| math.RT | we prove a determinantal type formula to compute the irreducible characters of the general lie superalgebra mathfrakglm1 in terms of the characters of the symmetric powers of the fundamental representation and their duals this formula was conjectured by j van der jeugt and e moens for the lie superalgebra frakglmn and generalizes the wellknown jacobitrudi formula | [['we', 'prove', 'a', 'determinantal', 'type', 'formula', 'to', 'compute', 'the', 'irreducible', 'characters', 'of', 'the', 'general', 'lie', 'superalgebra', 'mathfrakglm1', 'in', 'terms', 'of', 'the', 'characters', 'of', 'the', 'symmetric', 'powers', 'of', 'the', 'fundamental', 'representation', 'and', 'their', 'duals', 'this', 'formula', 'was', 'conjectured', 'by', 'j', 'van', 'der', 'jeugt', 'and', 'e', 'moens', 'for', 'the', 'lie', 'superalgebra', 'frakglmn', 'and', 'generalizes', 'the', 'wellknown', 'jacobitrudi', 'formula']] | [-0.1629480087991666, 0.01714698697119106, -0.06492510294817665, 0.05359421341671367, -0.14196541712239938, -0.14401602497565802, -0.007636123319604882, 0.23513965901953202, -0.27560203293924807, -0.2093012103534959, 0.03180450780308564, -0.23718576502330876, -0.22363657183531258, 0.200939376735025, -0.1042582478236269, -0.06004200420445866, -0.012983155993020369, 0.10507782231326457, -0.13292889731625715, -0.2623663722985872, 0.3524524238374498, 0.007226497624759321, 0.24798150808837144, 0.068524531537184, 0.14107583786136713, 0.07533840504819872, -0.021949024939978565, -0.12360724715377998, -0.1830148996474842, 0.1887706120852036, 0.32222369378777566, 0.012289262182700137, 0.14791546751641566, -0.33277865947672614, -0.06267111855386584, 0.1711048923122386, 0.12359090496061577, 0.05842318865298121, 0.062392889448717515, -0.29957377451851414, 0.07743845258287534, -0.2766821781061245, -0.17406924183618416, -0.056833514771251765, 0.13484707940369844, 0.02659895826407053, -0.22891032681972892, 0.07790278619224275, 0.17122231717048972, 0.07365818245819321, -0.10196490481461364, -0.17722639466282325, -0.021668040676525346, 0.0633554252261227, -0.05648688832297921, -0.01421497995896196, 0.0535152285290813, -0.13086423836217295, -0.1627837145632064, 0.3620707594824058, -0.008043639858779325, -0.18135143378404556, 0.10943950209076758, -0.16813140570324053, -0.14779247381482963, 0.0655552653975233, 0.01709267549772954, 0.16959574194280086, -0.0708337377032472, 0.2562879364801726, -0.10646734859619755, -0.07321376430465737, 0.17182118607753957, -0.029630654667185067, 0.15153749375086692, -0.028742902791472496, -0.0508616024421321, 0.17450148405300248, 0.04869530260286949, -0.02149318965772788, -0.33414031036361985, -0.247906562872231, -0.18836033953077816, 0.14389319911478432, -0.1341378158553939, -0.16487254802551535, 0.3746091957997393, 0.04026271851250419, 0.14696294034796734, 0.1622573698318943, 0.13116914675036376, 0.1850352832806055, 0.1144438028568402, 0.05614760039477713, 0.13544533913955092, 0.30156387858248007, -0.006618161599531218, -0.17487069366810223, -0.039461231656820965, 0.3167118149361125] |
1,802.09947 | Measuring granular flow through a funnel with a force sensor | This paper presents an apparatus to measure the flow of granular matter
through a funnel with a force sensor. In addition to being easily reproducible,
our proposed method enhances measurement accuracy from the popular method that
uses a stopwatch. We notice, however, that our proposed setup induces an
unwelcome force that confounds force sensor readings. This issue is discussed,
and its significance on measurement accuracy is evaluated through theoretical
and experimental work.
| cond-mat.soft | this paper presents an apparatus to measure the flow of granular matter through a funnel with a force sensor in addition to being easily reproducible our proposed method enhances measurement accuracy from the popular method that uses a stopwatch we notice however that our proposed setup induces an unwelcome force that confounds force sensor readings this issue is discussed and its significance on measurement accuracy is evaluated through theoretical and experimental work | [['this', 'paper', 'presents', 'an', 'apparatus', 'to', 'measure', 'the', 'flow', 'of', 'granular', 'matter', 'through', 'a', 'funnel', 'with', 'a', 'force', 'sensor', 'in', 'addition', 'to', 'being', 'easily', 'reproducible', 'our', 'proposed', 'method', 'enhances', 'measurement', 'accuracy', 'from', 'the', 'popular', 'method', 'that', 'uses', 'a', 'stopwatch', 'we', 'notice', 'however', 'that', 'our', 'proposed', 'setup', 'induces', 'an', 'unwelcome', 'force', 'that', 'confounds', 'force', 'sensor', 'readings', 'this', 'issue', 'is', 'discussed', 'and', 'its', 'significance', 'on', 'measurement', 'accuracy', 'is', 'evaluated', 'through', 'theoretical', 'and', 'experimental', 'work']] | [-0.08388654377389078, 0.0641135443620442, -0.1320074909211447, -0.047836296932978764, -0.08019993231735295, -0.14244096382107171, 0.04890587536728061, 0.40132227452057934, -0.2325132887538833, -0.3134312175938653, 0.04246889230530036, -0.2874903524837767, -0.18529572921235943, 0.23449445671738228, -0.1359510311546425, 0.07224564342808056, 0.11300906581648935, 0.040871745311758585, 0.005341755835818023, -0.20385783882941017, 0.27169409497744507, 0.11904493019553936, 0.3437950565744864, 0.11918544811972727, 0.1721340837215798, -0.0006232652683845825, -0.02665520470489153, 0.06375093915913668, -0.09813175649701912, 0.12325175591589262, 0.22583508697829935, 0.11002250192298864, 0.2536655069497, -0.40093995035729474, -0.2047548532848143, 0.07974670956739122, 0.09386415261542425, 0.11393209833962221, -0.12786268019408453, -0.3224880247014678, 0.07547421624056166, -0.19567302461817032, -0.08098430837142384, -0.13558675470348033, -0.013795057318121608, -0.02926391775286498, -0.2780543375605096, 0.08870164650337149, 0.03380931722414163, 0.062199774961401194, -0.04140513460313539, -0.04796755898536907, 0.07242669666367066, 0.07893605414493424, 0.05771947713542937, 0.07116733858775762, 0.2225469147411382, -0.07407236778979293, -0.10075529592318667, 0.3900768745483624, -0.0691543907030589, -0.21103657743757745, 0.1856945203875916, -0.05544525131537941, -0.09420032347164427, 0.08739015428970258, 0.1604941747047835, 0.09422955382615328, -0.18235526299880198, -0.005655073808156885, -0.030897898832336068, 0.21552013046554444, 0.018476430404310424, -0.05211549803708396, 0.14929178095836607, 0.24544249244758654, 0.07577212739528881, 0.14402771400960368, -0.12723230230039917, -0.06489860628628069, -0.2936021621959905, -0.14629985934071657, -0.19338525041368687, -0.04002429669263721, -0.030638028996488882, -0.11276088213910246, 0.3681037748853366, 0.2636802589598422, 0.1844651769174056, 0.024635173988321588, 0.42338143739228445, 0.0490217587179763, 0.06634870211160483, 0.020849693527755637, 0.29039055235302336, 0.09021871864226544, 0.13554220677017131, -0.21157786174767856, 0.08836326127897741, -0.0012560208431548541] |
1,802.09948 | Computation of Hopf Galois structures on low degree separable extensions
and classification of those for degrees $p^2$ and $2p$ | A Hopf Galois structure on a finite field extension $L/K$ is a pair
$(H,\mu)$, where $H$ is a finite cocommutative $K$-Hopf algebra and $\mu$ a
Hopf action. In this paper we present a program written in the computational
algebra system Magma which gives all Hopf Galois structures on separable field
extensions of degree up to eleven and several properties of those. Besides, we
exhibit several results on Hopf Galois structures inspired by the program
output. We prove that if $(H,\mu)$ is an almost classically Hopf Galois
structure, then it is the unique Hopf Galois structure with underlying Hopf
algebra $H$, up to isomorphism. For $p$ an odd prime, we prove that a separable
extension of degree $p^2$ may have only one type of Hopf Galois structure and
determine those of cyclic type; we determine as well the Hopf Galois structures
on separable extensions of degree $2p$. We highlight the richness of the
results obtained for extensions of degree 8 by computing an explicit example
and presenting some tables which summarizes these results.
| math.GR | a hopf galois structure on a finite field extension lk is a pair hmu where h is a finite cocommutative khopf algebra and mu a hopf action in this paper we present a program written in the computational algebra system magma which gives all hopf galois structures on separable field extensions of degree up to eleven and several properties of those besides we exhibit several results on hopf galois structures inspired by the program output we prove that if hmu is an almost classically hopf galois structure then it is the unique hopf galois structure with underlying hopf algebra h up to isomorphism for p an odd prime we prove that a separable extension of degree p2 may have only one type of hopf galois structure and determine those of cyclic type we determine as well the hopf galois structures on separable extensions of degree 2p we highlight the richness of the results obtained for extensions of degree 8 by computing an explicit example and presenting some tables which summarizes these results | [['a', 'hopf', 'galois', 'structure', 'on', 'a', 'finite', 'field', 'extension', 'lk', 'is', 'a', 'pair', 'hmu', 'where', 'h', 'is', 'a', 'finite', 'cocommutative', 'khopf', 'algebra', 'and', 'mu', 'a', 'hopf', 'action', 'in', 'this', 'paper', 'we', 'present', 'a', 'program', 'written', 'in', 'the', 'computational', 'algebra', 'system', 'magma', 'which', 'gives', 'all', 'hopf', 'galois', 'structures', 'on', 'separable', 'field', 'extensions', 'of', 'degree', 'up', 'to', 'eleven', 'and', 'several', 'properties', 'of', 'those', 'besides', 'we', 'exhibit', 'several', 'results', 'on', 'hopf', 'galois', 'structures', 'inspired', 'by', 'the', 'program', 'output', 'we', 'prove', 'that', 'if', 'hmu', 'is', 'an', 'almost', 'classically', 'hopf', 'galois', 'structure', 'then', 'it', 'is', 'the', 'unique', 'hopf', 'galois', 'structure', 'with', 'underlying', 'hopf', 'algebra', 'h', 'up', 'to', 'isomorphism', 'for', 'p', 'an', 'odd', 'prime', 'we', 'prove', 'that', 'a', 'separable', 'extension', 'of', 'degree', 'p2', 'may', 'have', 'only', 'one', 'type', 'of', 'hopf', 'galois', 'structure', 'and', 'determine', 'those', 'of', 'cyclic', 'type', 'we', 'determine', 'as', 'well', 'the', 'hopf', 'galois', 'structures', 'on', 'separable', 'extensions', 'of', 'degree', '2p', 'we', 'highlight', 'the', 'richness', 'of', 'the', 'results', 'obtained', 'for', 'extensions', 'of', 'degree', '8', 'by', 'computing', 'an', 'explicit', 'example', 'and', 'presenting', 'some', 'tables', 'which', 'summarizes', 'these', 'results']] | [-0.2086619938301399, 0.07834888632681024, -0.08778004394844174, 0.07379152319802859, -0.15591751411151097, -0.1444287331596147, -0.03212046697749323, 0.3403733382001519, -0.40071011070421964, -0.23887897950467155, 0.11215723470918737, -0.22192214311068054, -0.1759863299829344, 0.21780858656068652, -0.08996865490917116, -0.0494581239452304, 0.05445477251656527, 0.1746558643549919, -0.07812860945231541, -0.2908528433127199, 0.3680186868363688, -0.023584577311804994, 0.15457523915223603, 0.020069628651727664, 0.10163306664854158, 0.017197282225445865, -0.005128354979354108, 0.011974817899943785, -0.1892067649822884, 0.0698563098889873, 0.311245052795045, 0.08683451933537198, 0.2283635993195741, -0.3396548321930865, -0.10236376512177738, 0.16779544024571214, 0.1322467910981369, 0.06458610428908709, -0.043594877842034016, -0.2540599126751172, 0.12516475136142743, -0.22518742683669823, -0.11984971400112086, -0.10790751097442279, 0.0653228648880031, -0.011439461981184607, -0.23409405889579765, -0.03919082230937039, 0.10970169530306986, 0.22055991258753768, -0.06099437296033165, -0.11786669576851933, -0.06094916808002, 0.04497492200759954, -0.05625190741252587, 0.0289811015150748, 0.0909092479038897, -0.10895097093672904, -0.17225683895806068, 0.3409754305070829, -0.04610139052897995, -0.18059786101586597, 0.14859369917851223, -0.16439188805105553, -0.18606604349821113, 0.13466413558709847, 0.07281358733361717, 0.10403826583155193, -0.02612995852440119, 0.20268535281688538, -0.1511572138622923, 0.11008210135975766, 0.08773563139487145, 0.0016956983762251776, 0.1103629887531793, 0.0963832414817325, 0.07968257112749365, 0.14242019372596948, 0.011043709593312002, -0.04736387462904785, -0.3592599388645139, -0.16189908714380202, -0.06787530543772656, 0.10490591549801878, -0.08036533377077809, -0.1608358359906476, 0.4472972253813993, 0.08679906717233554, 0.16686398246011502, 0.08096666444434113, 0.183714832233395, 0.04203221467689091, 0.10403078281304387, 0.0671330612172443, 0.14229117962345617, 0.26529882457323894, -0.027825859748909988, -0.16015318161158196, -0.04192507863153032, 0.1852456571095688] |
1,802.09949 | Tool Demonstration: FSolidM for Designing Secure Ethereum Smart
Contracts | Blockchain-based distributed computing platforms enable the trusted execution
of computation - defined in the form of smart contracts - without trusted
agents. Smart contracts are envisioned to have a variety of applications,
ranging from financial to IoT asset tracking. Unfortunately, the development of
smart contracts has proven to be extremely error prone. In practice, contracts
are riddled with security vulnerabilities comprising a critical issue since
bugs are by design non-fixable and contracts may handle financial assets of
significant value. To facilitate the development of secure smart contracts, we
have created the FSolidM framework, which allows developers to define contracts
as finite state machines (FSMs) with rigorous and clear semantics. FSolidM
provides an easy-to-use graphical editor for specifying FSMs, a code generator
for creating Ethereum smart contracts, and a set of plugins that developers may
add to their FSMs to enhance security and functionality.
| cs.CR cs.FL cs.SE | blockchainbased distributed computing platforms enable the trusted execution of computation defined in the form of smart contracts without trusted agents smart contracts are envisioned to have a variety of applications ranging from financial to iot asset tracking unfortunately the development of smart contracts has proven to be extremely error prone in practice contracts are riddled with security vulnerabilities comprising a critical issue since bugs are by design nonfixable and contracts may handle financial assets of significant value to facilitate the development of secure smart contracts we have created the fsolidm framework which allows developers to define contracts as finite state machines fsms with rigorous and clear semantics fsolidm provides an easytouse graphical editor for specifying fsms a code generator for creating ethereum smart contracts and a set of plugins that developers may add to their fsms to enhance security and functionality | [['blockchainbased', 'distributed', 'computing', 'platforms', 'enable', 'the', 'trusted', 'execution', 'of', 'computation', 'defined', 'in', 'the', 'form', 'of', 'smart', 'contracts', 'without', 'trusted', 'agents', 'smart', 'contracts', 'are', 'envisioned', 'to', 'have', 'a', 'variety', 'of', 'applications', 'ranging', 'from', 'financial', 'to', 'iot', 'asset', 'tracking', 'unfortunately', 'the', 'development', 'of', 'smart', 'contracts', 'has', 'proven', 'to', 'be', 'extremely', 'error', 'prone', 'in', 'practice', 'contracts', 'are', 'riddled', 'with', 'security', 'vulnerabilities', 'comprising', 'a', 'critical', 'issue', 'since', 'bugs', 'are', 'by', 'design', 'nonfixable', 'and', 'contracts', 'may', 'handle', 'financial', 'assets', 'of', 'significant', 'value', 'to', 'facilitate', 'the', 'development', 'of', 'secure', 'smart', 'contracts', 'we', 'have', 'created', 'the', 'fsolidm', 'framework', 'which', 'allows', 'developers', 'to', 'define', 'contracts', 'as', 'finite', 'state', 'machines', 'fsms', 'with', 'rigorous', 'and', 'clear', 'semantics', 'fsolidm', 'provides', 'an', 'easytouse', 'graphical', 'editor', 'for', 'specifying', 'fsms', 'a', 'code', 'generator', 'for', 'creating', 'ethereum', 'smart', 'contracts', 'and', 'a', 'set', 'of', 'plugins', 'that', 'developers', 'may', 'add', 'to', 'their', 'fsms', 'to', 'enhance', 'security', 'and', 'functionality']] | [-0.17811472949106247, 0.006105450272298185, -0.08345252802994635, 0.048019105209303754, -0.16023920734546016, -0.25662097902303294, 0.08310048882464928, 0.38941032860228525, -0.26319533132295225, -0.33353869024930255, 0.1511041702120565, -0.27167075661054696, -0.06454756398286138, 0.21292190161600177, -0.17772428159514675, 0.09682929317932576, 0.01423459956921371, -0.053357745590619746, 0.02004367339291743, -0.27461684426858224, 0.25283440305668464, 0.04588095742344324, 0.2993874534698469, 0.07846134063189052, 0.05297295479103923, -0.02784064711470689, -0.020943711416995418, -0.03218160777219704, -0.0459629305258464, 0.18260734511007157, 0.4314247069348182, 0.25644073743107065, 0.41241064609161443, -0.4885823548771441, -0.12343199509195983, 0.09090277490239325, 0.1113332888128103, 0.04219645804176772, -0.0337242515474957, -0.31775009517690966, 0.13406275619719443, -0.3553133882964695, -0.15399128092685715, -0.15952440480302488, 0.023543122923001647, 0.03839827057173742, -0.26670358466383604, -0.11753434772337122, 0.0024754523141642232, 0.1026986364678513, 0.03554654077119527, -0.03438779789222671, -0.06994191582614023, 0.17003485552268102, 0.037277675619614974, -0.05997289949529139, 0.21734159288462251, -0.09832899486646056, -0.18670410717438374, 0.3594100431339549, 0.050722764558824046, -0.13916446028410323, 0.15692332893876093, 0.0732802025474874, -0.1437247595018042, 0.04896928207682712, 0.2633591562176922, 0.03186761683318764, -0.2092240298233394, 0.05749406482749951, 0.06768603048819516, 0.1900419863805707, 0.049057019044578605, 0.034634077183000045, 0.2528617799265443, 0.19536748196821593, 0.10729721977841108, 0.10886282750787879, 0.03702529342385138, -0.17216119036436014, -0.2549328180005042, -0.21521047040088367, -0.13160848912583398, 0.012057607511191495, -0.10121210624555325, -0.23764738045366748, 0.33379940276000913, 0.2274895608242202, 0.05042494622923966, 0.08001852716801555, 0.363983113150711, 0.0318534839916018, 0.14656519897481693, 0.1663451387230972, 0.12211067891080997, -0.037797252399780386, 0.2237137630215979, -0.07524409560470044, 0.22242687933612615, -0.035033490734973124] |
1,802.0995 | Dynamic magnetism in the disordered hexagonal double perovskite
BaTi$_{1/2}$Mn$_{1/2}$O$_{3}$ | Magnetic frustration and disorder are key ingredients to prevent the onset of
magnetic order. In the disordered hexagonal double perovskite
BaTi$_{1/2}$Mn$_{1/2}$O$_{3}$, Mn$^{4+}$ cations, with $S=3/2$ spins, can
either form highly correlated states of magnetic trimers or dimers or remain as
weakly interacting orphan spins. At low temperature ($T$), the dimer response
is negligible, and magnetism is dominated by the trimers and orphans. To
explore the role of magnetic frustration, disorder and possibly of quantum
fluctuations, the low-$T$ magnetic properties of the remaining magnetic degrees
of freedom of BaTi$_{1/2}$Mn$_{1/2}$O$_{3}$ are investigated. Heat-capacity
data and magnetic susceptibility display no evidence for a phase transition to
a magnetically ordered phase but indicate the formation of a correlated spin
state. The low-temperature spin dynamics of this state is then explored by
$\mu$SR experiments. The zero field $\mu^{+}$ relaxation rate data show no
static magnetism down to $T=19$ mK and longitudinal field experiments support
as well that dynamic magnetism persists at low $T$. Our results are interpreted
in terms of a spin glass state which stems from a disordered lattice of orphans
spins and trimers. A spin liquid state in BaTi$_{1/2}$Mn$_{1/2}$O$_{3}$,
however, is not excluded and is also discussed.
| cond-mat.str-el | magnetic frustration and disorder are key ingredients to prevent the onset of magnetic order in the disordered hexagonal double perovskite bati_12mn_12o_3 mn4 cations with s32 spins can either form highly correlated states of magnetic trimers or dimers or remain as weakly interacting orphan spins at low temperature t the dimer response is negligible and magnetism is dominated by the trimers and orphans to explore the role of magnetic frustration disorder and possibly of quantum fluctuations the lowt magnetic properties of the remaining magnetic degrees of freedom of bati_12mn_12o_3 are investigated heatcapacity data and magnetic susceptibility display no evidence for a phase transition to a magnetically ordered phase but indicate the formation of a correlated spin state the lowtemperature spin dynamics of this state is then explored by musr experiments the zero field mu relaxation rate data show no static magnetism down to t19 mk and longitudinal field experiments support as well that dynamic magnetism persists at low t our results are interpreted in terms of a spin glass state which stems from a disordered lattice of orphans spins and trimers a spin liquid state in bati_12mn_12o_3 however is not excluded and is also discussed | [['magnetic', 'frustration', 'and', 'disorder', 'are', 'key', 'ingredients', 'to', 'prevent', 'the', 'onset', 'of', 'magnetic', 'order', 'in', 'the', 'disordered', 'hexagonal', 'double', 'perovskite', 'bati_12mn_12o_3', 'mn4', 'cations', 'with', 's32', 'spins', 'can', 'either', 'form', 'highly', 'correlated', 'states', 'of', 'magnetic', 'trimers', 'or', 'dimers', 'or', 'remain', 'as', 'weakly', 'interacting', 'orphan', 'spins', 'at', 'low', 'temperature', 't', 'the', 'dimer', 'response', 'is', 'negligible', 'and', 'magnetism', 'is', 'dominated', 'by', 'the', 'trimers', 'and', 'orphans', 'to', 'explore', 'the', 'role', 'of', 'magnetic', 'frustration', 'disorder', 'and', 'possibly', 'of', 'quantum', 'fluctuations', 'the', 'lowt', 'magnetic', 'properties', 'of', 'the', 'remaining', 'magnetic', 'degrees', 'of', 'freedom', 'of', 'bati_12mn_12o_3', 'are', 'investigated', 'heatcapacity', 'data', 'and', 'magnetic', 'susceptibility', 'display', 'no', 'evidence', 'for', 'a', 'phase', 'transition', 'to', 'a', 'magnetically', 'ordered', 'phase', 'but', 'indicate', 'the', 'formation', 'of', 'a', 'correlated', 'spin', 'state', 'the', 'lowtemperature', 'spin', 'dynamics', 'of', 'this', 'state', 'is', 'then', 'explored', 'by', 'musr', 'experiments', 'the', 'zero', 'field', 'mu', 'relaxation', 'rate', 'data', 'show', 'no', 'static', 'magnetism', 'down', 'to', 't19', 'mk', 'and', 'longitudinal', 'field', 'experiments', 'support', 'as', 'well', 'that', 'dynamic', 'magnetism', 'persists', 'at', 'low', 't', 'our', 'results', 'are', 'interpreted', 'in', 'terms', 'of', 'a', 'spin', 'glass', 'state', 'which', 'stems', 'from', 'a', 'disordered', 'lattice', 'of', 'orphans', 'spins', 'and', 'trimers', 'a', 'spin', 'liquid', 'state', 'in', 'bati_12mn_12o_3', 'however', 'is', 'not', 'excluded', 'and', 'is', 'also', 'discussed']] | [-0.2003568642611913, 0.324353428761542, 0.016575045518807528, 0.05782370991553612, -0.014820042731163581, -0.1403365416941953, 0.06382790788499274, 0.3742848679845788, -0.2514444834498098, -0.27444995237519176, 0.06531008376353468, -0.33676794319672837, -0.08251080342049989, 0.11962389666347083, 0.0924850467312091, -0.03428044418093854, -0.03545739025612045, 0.02182115248005991, -0.09264468101450943, -0.20907575933301112, 0.2571734706964974, 0.02397699935239327, 0.27392380069413214, 0.10351491813396689, 0.04408796033077902, -9.762011612429447e-06, 0.14589495669819952, 0.04611302239186678, -0.11997198941056003, 0.003420524109219748, 0.24997573199960374, -0.06995424368063506, 0.15801270240101695, -0.4348406117822322, -0.20289136717556833, 0.03581250153035501, 0.1409045801901249, 0.14875409255445138, -0.06973848958903583, -0.2733441660463925, 0.02541977930579997, -0.11307694507071499, -0.1494572075616722, -0.16113630904979312, -0.02251689477233197, 0.008780111781214652, -0.2715835574493484, 0.17327970310973037, 0.12227521229417726, 0.12797313818189593, -0.0996057191688433, -0.12924131227551586, -0.09367930041098026, 0.06298172115780336, 0.06304498485855989, 0.09944630529462677, 0.17943266559795468, -0.1412498699465152, -0.15145112325547783, 0.34714156836175275, -0.024971985974656323, -0.07687643529564027, 0.19523426029619942, -0.21841817406323, -0.1153213182997112, 0.19012375891967148, 0.1111144532507151, 0.09815802624852386, -0.12006158526769609, 0.05459552265964113, 0.016622661749745922, 0.21587609250780157, -0.01619553866618572, 0.09390530876092824, 0.30710957150368656, 0.18806605872016438, 0.026183410629284445, 0.1636041993930571, -0.1115182913892624, -0.12067897440193548, -0.1811195230591543, -0.142611972776424, -0.23341078014765895, 0.0612429101272881, -0.06159000864586092, -0.1858216031867358, 0.34304276714941545, 0.11390920876113238, 0.1740752688786687, -0.07105782738353904, 0.20575531943432374, 0.032671577740609456, 0.05441433166336153, 0.05782729841854403, 0.24227757693614005, 0.22094412855851972, 0.10093558693218246, -0.31280247910913156, 0.08440551377674468, -0.021697463328798888] |
1,802.09951 | Detecting superconductivity in the high pressure hydrides and metallic
hydrogen from optical properties | We present a new technique for measuring the critical temperature Tc in the
high pressure, high Tc electron-phonon-driven superconducting hydrides. This
technique does not require connecting leads to the sample. In the multiphonon
region of the absorption spectrum, the reflectance mirrors the temperature
variation of the superconducting order parameter. For an appropriately chosen
value of photon energy of order twice the gap plus 1.5 times the maximum phonon
energy, the temperature dependence of the reflectance varies much more rapidly
below T=Tc than above. It increases with increasing temperature in the
superconducting state while it decreases in the normal state. Examining the
temperature dependence of the reflectance at a fixed photon energy, there is a
cusp at T=Tc which provides a measurement of the critical temperature. We
discuss these issues within the context of the recently observed metallic phase
of hydrogen.
| cond-mat.supr-con | we present a new technique for measuring the critical temperature tc in the high pressure high tc electronphonondriven superconducting hydrides this technique does not require connecting leads to the sample in the multiphonon region of the absorption spectrum the reflectance mirrors the temperature variation of the superconducting order parameter for an appropriately chosen value of photon energy of order twice the gap plus 15 times the maximum phonon energy the temperature dependence of the reflectance varies much more rapidly below ttc than above it increases with increasing temperature in the superconducting state while it decreases in the normal state examining the temperature dependence of the reflectance at a fixed photon energy there is a cusp at ttc which provides a measurement of the critical temperature we discuss these issues within the context of the recently observed metallic phase of hydrogen | [['we', 'present', 'a', 'new', 'technique', 'for', 'measuring', 'the', 'critical', 'temperature', 'tc', 'in', 'the', 'high', 'pressure', 'high', 'tc', 'electronphonondriven', 'superconducting', 'hydrides', 'this', 'technique', 'does', 'not', 'require', 'connecting', 'leads', 'to', 'the', 'sample', 'in', 'the', 'multiphonon', 'region', 'of', 'the', 'absorption', 'spectrum', 'the', 'reflectance', 'mirrors', 'the', 'temperature', 'variation', 'of', 'the', 'superconducting', 'order', 'parameter', 'for', 'an', 'appropriately', 'chosen', 'value', 'of', 'photon', 'energy', 'of', 'order', 'twice', 'the', 'gap', 'plus', '15', 'times', 'the', 'maximum', 'phonon', 'energy', 'the', 'temperature', 'dependence', 'of', 'the', 'reflectance', 'varies', 'much', 'more', 'rapidly', 'below', 'ttc', 'than', 'above', 'it', 'increases', 'with', 'increasing', 'temperature', 'in', 'the', 'superconducting', 'state', 'while', 'it', 'decreases', 'in', 'the', 'normal', 'state', 'examining', 'the', 'temperature', 'dependence', 'of', 'the', 'reflectance', 'at', 'a', 'fixed', 'photon', 'energy', 'there', 'is', 'a', 'cusp', 'at', 'ttc', 'which', 'provides', 'a', 'measurement', 'of', 'the', 'critical', 'temperature', 'we', 'discuss', 'these', 'issues', 'within', 'the', 'context', 'of', 'the', 'recently', 'observed', 'metallic', 'phase', 'of', 'hydrogen']] | [-0.1352074237317584, 0.2230929609024001, -0.058523033996842964, 0.011551393976555668, -0.014814155705594759, -0.09787441930137307, 0.13993532359583316, 0.35552687653534704, -0.22462393902242184, -0.34743218321567604, 0.030942052210808445, -0.3339017053208441, -0.021938005547715928, 0.1900913932045801, 0.012255268201370986, 0.048153844212942755, -0.07019397038497406, 0.059032453626072665, -0.14009176586962324, -0.1769857707654508, 0.31788853702567543, 0.10567858461089594, 0.33143672015410747, 0.11926163917930006, 0.06994032238027174, -0.01637833349895831, 0.07028532206422562, 0.01180824270244125, -0.15142156740168122, 0.014683111617676646, 0.26745396515810127, -0.003997576416289206, 0.24718096774915677, -0.3421075242843622, -0.2270002734693263, 0.09806996786618512, 0.10180871294084401, 0.10384424586643017, -0.03271596704112624, -0.19199280889383216, 0.027877926334015115, -0.12062077462612886, -0.1694558801233313, -0.025893086627822557, -0.010234335095708747, -0.035724098251867877, -0.22272420890307684, 0.11112070040402117, 0.03271001679554796, 0.07241060711416623, -0.0683578426996581, -0.13759002601727843, -0.05911656971618855, 0.05513114325715591, 0.04061625437415708, 0.062012690980416195, 0.18022591513543887, -0.14196968428194254, 0.013915439191602652, 0.31347819374834035, -0.08823274396305063, -0.02435165207511444, 0.14567677335639437, -0.19111231912811882, -0.0640038255639391, 0.21891722026475363, 0.1045749379127628, 0.08621654907415668, -0.09758973504892356, 0.04520765080270793, 0.03977859157921492, 0.24323136127292574, 0.07503218887702114, 0.06829086795496159, 0.22231879878601582, 0.2203268163951395, 0.07757436136695013, 0.15489454139292025, -0.1391118096695248, -0.032616159034450705, -0.2797796603513332, -0.178521016284341, -0.18772020528642394, 0.015006857892442261, -0.12463442632918441, -0.17744653824743606, 0.41672825334566854, 0.16433346962971654, 0.23987605416035052, -2.1346682253823005e-05, 0.2861102724769454, 0.1994133763578084, 0.10172664049490214, 0.08550463346161431, 0.2902868809613982, 0.1333455059328954, 0.17445221044987494, -0.2874460117321917, 0.06298056566792963, -0.03735504434075501] |
1,802.09952 | The Price of Stability of Weighted Congestion Games | We give exponential lower bounds on the Price of Stability (PoS) of weighted
congestion games with polynomial cost functions. In particular, for any
positive integer $d$ we construct rather simple games with cost functions of
degree at most $d$ which have a PoS of at least $\varOmega(\Phi_d)^{d+1}$,
where $\Phi_d\sim d/\ln d$ is the unique positive root of equation
$x^{d+1}=(x+1)^d$. This almost closes the huge gap between $\varTheta(d)$ and
$\Phi_d^{d+1}$. Our bound extends also to network congestion games. We further
show that the PoS remains exponential even for singleton games. More generally,
we provide a lower bound of $\varOmega((1+1/\alpha)^d/d)$ on the PoS of
$\alpha$-approximate Nash equilibria for singleton games. All our lower bounds
hold for mixed and correlated equilibria as well.
On the positive side, we give a general upper bound on the PoS of
$\alpha$-approximate Nash equilibria, which is sensitive to the range $W$ of
the player weights and the approximation parameter $\alpha$. We do this by
explicitly constructing a novel approximate potential function, based on
Faulhaber's formula, that generalizes Rosenthal's potential in a continuous,
analytic way. From the general theorem, we deduce two interesting corollaries.
First, we derive the existence of an approximate pure Nash equilibrium with PoS
at most $(d+3)/2$; the equilibrium's approximation parameter ranges from
$\varTheta(1)$ to $d+1$ in a smooth way with respect to $W$. Secondly, we show
that for unweighted congestion games, the PoS of $\alpha$-approximate Nash
equilibria is at most $(d+1)/\alpha$.
| cs.GT | we give exponential lower bounds on the price of stability pos of weighted congestion games with polynomial cost functions in particular for any positive integer d we construct rather simple games with cost functions of degree at most d which have a pos of at least varomegaphi_dd1 where phi_dsim dln d is the unique positive root of equation xd1x1d this almost closes the huge gap between varthetad and phi_dd1 our bound extends also to network congestion games we further show that the pos remains exponential even for singleton games more generally we provide a lower bound of varomega11alphadd on the pos of alphaapproximate nash equilibria for singleton games all our lower bounds hold for mixed and correlated equilibria as well on the positive side we give a general upper bound on the pos of alphaapproximate nash equilibria which is sensitive to the range w of the player weights and the approximation parameter alpha we do this by explicitly constructing a novel approximate potential function based on faulhabers formula that generalizes rosenthals potential in a continuous analytic way from the general theorem we deduce two interesting corollaries first we derive the existence of an approximate pure nash equilibrium with pos at most d32 the equilibriums approximation parameter ranges from vartheta1 to d1 in a smooth way with respect to w secondly we show that for unweighted congestion games the pos of alphaapproximate nash equilibria is at most d1alpha | [['we', 'give', 'exponential', 'lower', 'bounds', 'on', 'the', 'price', 'of', 'stability', 'pos', 'of', 'weighted', 'congestion', 'games', 'with', 'polynomial', 'cost', 'functions', 'in', 'particular', 'for', 'any', 'positive', 'integer', 'd', 'we', 'construct', 'rather', 'simple', 'games', 'with', 'cost', 'functions', 'of', 'degree', 'at', 'most', 'd', 'which', 'have', 'a', 'pos', 'of', 'at', 'least', 'varomegaphi_dd1', 'where', 'phi_dsim', 'dln', 'd', 'is', 'the', 'unique', 'positive', 'root', 'of', 'equation', 'xd1x1d', 'this', 'almost', 'closes', 'the', 'huge', 'gap', 'between', 'varthetad', 'and', 'phi_dd1', 'our', 'bound', 'extends', 'also', 'to', 'network', 'congestion', 'games', 'we', 'further', 'show', 'that', 'the', 'pos', 'remains', 'exponential', 'even', 'for', 'singleton', 'games', 'more', 'generally', 'we', 'provide', 'a', 'lower', 'bound', 'of', 'varomega11alphadd', 'on', 'the', 'pos', 'of', 'alphaapproximate', 'nash', 'equilibria', 'for', 'singleton', 'games', 'all', 'our', 'lower', 'bounds', 'hold', 'for', 'mixed', 'and', 'correlated', 'equilibria', 'as', 'well', 'on', 'the', 'positive', 'side', 'we', 'give', 'a', 'general', 'upper', 'bound', 'on', 'the', 'pos', 'of', 'alphaapproximate', 'nash', 'equilibria', 'which', 'is', 'sensitive', 'to', 'the', 'range', 'w', 'of', 'the', 'player', 'weights', 'and', 'the', 'approximation', 'parameter', 'alpha', 'we', 'do', 'this', 'by', 'explicitly', 'constructing', 'a', 'novel', 'approximate', 'potential', 'function', 'based', 'on', 'faulhabers', 'formula', 'that', 'generalizes', 'rosenthals', 'potential', 'in', 'a', 'continuous', 'analytic', 'way', 'from', 'the', 'general', 'theorem', 'we', 'deduce', 'two', 'interesting', 'corollaries', 'first', 'we', 'derive', 'the', 'existence', 'of', 'an', 'approximate', 'pure', 'nash', 'equilibrium', 'with', 'pos', 'at', 'most', 'd32', 'the', 'equilibriums', 'approximation', 'parameter', 'ranges', 'from', 'vartheta1', 'to', 'd1', 'in', 'a', 'smooth', 'way', 'with', 'respect', 'to', 'w', 'secondly', 'we', 'show', 'that', 'for', 'unweighted', 'congestion', 'games', 'the', 'pos', 'of', 'alphaapproximate', 'nash', 'equilibria', 'is', 'at', 'most', 'd1alpha']] | [-0.12132246980337218, 0.05176230509077241, -0.11097553246835215, 0.10317990218604321, -0.048996743541371464, -0.19261948923291317, 0.13133698625987844, 0.34595229112189907, -0.2582430292190864, -0.28663980964584285, 0.06429253642849729, -0.26958286115931795, -0.1452334150832532, 0.15228097912191077, -0.0653360969415095, 0.03765297318901064, 0.03298601971694332, 0.06806215629744813, -0.02667558671764082, -0.26519873206592004, 0.34807185872542223, -0.003494339499317495, 0.1985056700931605, 0.10348577863762079, 0.09227789197192861, -0.03517633431605144, 0.034228486179550786, 0.02636808075827691, -0.19406048069526277, 0.11441299905508741, 0.2711895467835912, 0.15118587463251154, 0.3040289450667654, -0.35362960506383134, -0.13824696820276963, 0.18511794879731466, 0.10375491677831601, 0.10183731911619644, -0.022356076602026688, -0.23039919222656893, 0.13130724872261734, -0.14640288553678618, -0.11236331097837858, -0.06812871582625465, 0.049320167625033905, 0.033227095088885356, -0.3215422132574343, 0.05514856712410431, 0.10057750463150522, 0.03775146465780161, -0.08865527003995496, -0.20216742021750242, -0.01897395285200689, 0.11830563209589635, -0.02308372729598416, 0.03240327781180707, 0.04557577958370655, -0.15568467424098595, -0.17383461486942592, 0.3345777588406706, -0.12818795528086224, -0.2053677447878852, 0.16218850512086647, -0.12451295222553167, -0.14981696293247734, 0.09728094056682211, 0.18322799218706146, 0.1699286271930383, -0.0569707798382171, 0.10692400100629913, -0.13642424983845558, 0.16015699743052367, 0.12880896780527487, 0.0486011712140492, 0.09116347979529407, 0.10225571350772576, 0.2341503202132399, 0.16268075101382645, 0.015540271744047741, -0.136193173331337, -0.3071601648016126, -0.1136440970101454, -0.14359857874936505, 0.0687297062972432, -0.14864818310619238, -0.19366174413128115, 0.36083108469882, 0.08245063973650947, 0.15009075256289336, 0.17037525491142677, 0.2538440285364953, 0.13617617026591625, -0.03573535375321155, 0.1734188737174981, 0.20734412575959518, 0.07238611642969772, 0.060978673435125405, -0.18084778523540268, 0.1252650328744243, 0.10309294674039722] |
1,802.09953 | Quantum Thermodynamic Force and Flow | Why do quantum evolutions occur and why do they stop at certain points? In
classical thermodynamics affinity was introduced to predict in which direction
an irreversible process proceeds. In this paper the quantum mechanical
counterpart of classical affinity is found. It is shown that the quantum
version of affinity can predict in which direction a process evolves. A new
version of the second law of thermodynamics is derived through quantum affinity
for energy-incoherent state interconversion under thermal operations. we will
also see that the quantum affinity can be a good candidate to be responsible,
as a force, for driving the flow and backflow of information in Markovian and
non-Markovian evolutions. Finally we show that the rate of quantum coherence
can be interpreted as the pure quantum mechanical contribution of the total
thermodynamic force and flow. Thus It is seen that, from a thermodynamic point
of view, any interaction from the outside with the system or any measurement on
the system may be represented by a quantum affinity.
| quant-ph | why do quantum evolutions occur and why do they stop at certain points in classical thermodynamics affinity was introduced to predict in which direction an irreversible process proceeds in this paper the quantum mechanical counterpart of classical affinity is found it is shown that the quantum version of affinity can predict in which direction a process evolves a new version of the second law of thermodynamics is derived through quantum affinity for energyincoherent state interconversion under thermal operations we will also see that the quantum affinity can be a good candidate to be responsible as a force for driving the flow and backflow of information in markovian and nonmarkovian evolutions finally we show that the rate of quantum coherence can be interpreted as the pure quantum mechanical contribution of the total thermodynamic force and flow thus it is seen that from a thermodynamic point of view any interaction from the outside with the system or any measurement on the system may be represented by a quantum affinity | [['why', 'do', 'quantum', 'evolutions', 'occur', 'and', 'why', 'do', 'they', 'stop', 'at', 'certain', 'points', 'in', 'classical', 'thermodynamics', 'affinity', 'was', 'introduced', 'to', 'predict', 'in', 'which', 'direction', 'an', 'irreversible', 'process', 'proceeds', 'in', 'this', 'paper', 'the', 'quantum', 'mechanical', 'counterpart', 'of', 'classical', 'affinity', 'is', 'found', 'it', 'is', 'shown', 'that', 'the', 'quantum', 'version', 'of', 'affinity', 'can', 'predict', 'in', 'which', 'direction', 'a', 'process', 'evolves', 'a', 'new', 'version', 'of', 'the', 'second', 'law', 'of', 'thermodynamics', 'is', 'derived', 'through', 'quantum', 'affinity', 'for', 'energyincoherent', 'state', 'interconversion', 'under', 'thermal', 'operations', 'we', 'will', 'also', 'see', 'that', 'the', 'quantum', 'affinity', 'can', 'be', 'a', 'good', 'candidate', 'to', 'be', 'responsible', 'as', 'a', 'force', 'for', 'driving', 'the', 'flow', 'and', 'backflow', 'of', 'information', 'in', 'markovian', 'and', 'nonmarkovian', 'evolutions', 'finally', 'we', 'show', 'that', 'the', 'rate', 'of', 'quantum', 'coherence', 'can', 'be', 'interpreted', 'as', 'the', 'pure', 'quantum', 'mechanical', 'contribution', 'of', 'the', 'total', 'thermodynamic', 'force', 'and', 'flow', 'thus', 'it', 'is', 'seen', 'that', 'from', 'a', 'thermodynamic', 'point', 'of', 'view', 'any', 'interaction', 'from', 'the', 'outside', 'with', 'the', 'system', 'or', 'any', 'measurement', 'on', 'the', 'system', 'may', 'be', 'represented', 'by', 'a', 'quantum', 'affinity']] | [-0.09759526568147948, 0.18746784050938048, -0.13813695793477707, 0.06539725042127528, -0.0054272251394409015, -0.1603297293354499, 0.05661162716148601, 0.3526080083382507, -0.3205167139285659, -0.2635176543914993, 0.055612575886238094, -0.25503975504739995, -0.16630621990104802, 0.19749482945505395, -0.05819657762922032, 0.036049845375973416, 0.06258060257034713, 0.09568293919192111, -0.032322582410766285, -0.19999336798013334, 0.2783289683578783, 0.08594955130850515, 0.27089784572080494, 0.08976010787574272, 0.09554165994737253, -0.011858038769765612, 0.05676265511274652, 0.06749675840967621, -0.09357653050602789, 0.0720594484984583, 0.2227320587434329, 0.10538722988476146, 0.250476496535387, -0.4199786979525563, -0.23917332472257227, 0.09321865515716105, 0.12752566601890308, 0.15851919605896012, -0.04898881007347772, -0.2572767778120217, 0.05493042454213263, -0.1721786721062521, -0.11309308764883821, -0.08476695988372147, -0.0049278305928329436, -0.003003993094057204, -0.23086336669680405, 0.10830290193640744, 0.10251499294353851, 0.005623387184038937, -0.05966701697142997, -0.022150949265033634, -0.017261869964156164, 0.15495472105853933, -0.017341268510089245, 0.030648372410263598, 0.19199327652129422, -0.1323900322460693, -0.15908351557116102, 0.4154208257418485, -0.06497412551571727, -0.191473883812327, 0.19634846258341862, -0.1185535890224154, -0.10422856259967637, 0.09616318617173168, 0.13200034712390774, 0.08061678074560645, -0.1726921432853553, 0.0563248292169904, 0.0061192192664616795, 0.1812247034744009, 0.04348721968694534, 0.031175779347049903, 0.24003677462867226, 0.09834911085171513, 0.07700623534563704, 0.16197440887980882, -0.0601236639636939, -0.17496209828805806, -0.31550622333531236, -0.23330270050441376, -0.2017924531085237, 0.14067655677117508, -0.04390754647158838, -0.1427020618784261, 0.3420762720248516, 0.1458165428000895, 0.1938959854032216, -0.0008787981666489897, 0.2448997558865988, 0.15748770032127118, 0.06561238269590919, 0.05954287212386907, 0.2605379873000265, 0.11244849616616785, 0.10614294762700706, -0.23544655210518767, 0.1116455054073314, 0.06681059626862407] |
1,802.09954 | Price Impact Under Heterogeneous Beliefs and Restricted Participation | We consider a financial market in which traders potentially face restrictions
in trading some of the available securities. Traders are heterogeneous with
respect to their beliefs and risk profiles, and the market is assumed thin:
traders strategically trade against their price impacts. We prove existence and
uniqueness of a corresponding equilibrium, and provide an efficient algorithm
to numerically obtain the equilibrium prices and allocations given market's
inputs. We find that restrictions may increase the market's welfare if traders
have different views regarding the covariance matrix of securities returns. The
latter heterogeneity regarding covariance matrix disagreement is essential in
modelling; for instance, when traders agree on the covariance matrix,
restricting participation in some securities for some traders leaves
equilibrium prices unaltered in the unrestricted securities, a certainly
undesirable model effect.
| q-fin.EC | we consider a financial market in which traders potentially face restrictions in trading some of the available securities traders are heterogeneous with respect to their beliefs and risk profiles and the market is assumed thin traders strategically trade against their price impacts we prove existence and uniqueness of a corresponding equilibrium and provide an efficient algorithm to numerically obtain the equilibrium prices and allocations given markets inputs we find that restrictions may increase the markets welfare if traders have different views regarding the covariance matrix of securities returns the latter heterogeneity regarding covariance matrix disagreement is essential in modelling for instance when traders agree on the covariance matrix restricting participation in some securities for some traders leaves equilibrium prices unaltered in the unrestricted securities a certainly undesirable model effect | [['we', 'consider', 'a', 'financial', 'market', 'in', 'which', 'traders', 'potentially', 'face', 'restrictions', 'in', 'trading', 'some', 'of', 'the', 'available', 'securities', 'traders', 'are', 'heterogeneous', 'with', 'respect', 'to', 'their', 'beliefs', 'and', 'risk', 'profiles', 'and', 'the', 'market', 'is', 'assumed', 'thin', 'traders', 'strategically', 'trade', 'against', 'their', 'price', 'impacts', 'we', 'prove', 'existence', 'and', 'uniqueness', 'of', 'a', 'corresponding', 'equilibrium', 'and', 'provide', 'an', 'efficient', 'algorithm', 'to', 'numerically', 'obtain', 'the', 'equilibrium', 'prices', 'and', 'allocations', 'given', 'markets', 'inputs', 'we', 'find', 'that', 'restrictions', 'may', 'increase', 'the', 'markets', 'welfare', 'if', 'traders', 'have', 'different', 'views', 'regarding', 'the', 'covariance', 'matrix', 'of', 'securities', 'returns', 'the', 'latter', 'heterogeneity', 'regarding', 'covariance', 'matrix', 'disagreement', 'is', 'essential', 'in', 'modelling', 'for', 'instance', 'when', 'traders', 'agree', 'on', 'the', 'covariance', 'matrix', 'restricting', 'participation', 'in', 'some', 'securities', 'for', 'some', 'traders', 'leaves', 'equilibrium', 'prices', 'unaltered', 'in', 'the', 'unrestricted', 'securities', 'a', 'certainly', 'undesirable', 'model', 'effect']] | [-0.10687480723059396, 0.08168728177107658, -0.11500103282922691, 0.18513401335848914, -0.12588566059766468, -0.16387396522025152, 0.15560600965991328, 0.4573512391309983, -0.2708369920304579, -0.21546558490250434, 0.18184265829988236, -0.3515730314859182, -0.13077034702336834, 0.08142881125551035, -0.15864030293427234, 0.003687250687805719, 0.032790543192044594, -0.009098142948382454, 0.05564637818056079, -0.33666912495707296, 0.29734003033431233, 0.06348624432463083, 0.28055489501828335, 0.03037075242099836, 0.11318543893393389, 0.006615166852878797, -0.04477648697288115, 0.005193293112683897, -0.13861174442853405, 0.11473706731565528, 0.32858073724390463, 0.11939144116653086, 0.3953602046799637, -0.49165160314706985, -0.11067301177964799, 0.17209340008553262, 0.012556023856032958, 0.03812798319380846, 0.03777876463466028, -0.23811115567074265, 0.004625209825575467, -0.2591987654436813, -0.11689991158137257, -0.12546881992016132, 0.01941278922667568, 0.027564923721861975, -0.33602452584110964, 0.05019817962726333, 0.0269202853538558, 0.04819228985642855, -0.11032358115510077, -0.14543733259215375, -0.059102449768273405, 0.14631906385617438, 0.17912117475752048, -0.17072127937057682, 0.182629910765158, -0.15653151371913362, -0.18366783694183642, 0.37524811525706403, -0.008414316468496713, -0.19561850036270628, 0.08448424354888671, -0.16026517461765152, -0.10321093242716535, 0.09814450164260559, 0.18000073481509968, -0.014076593909557013, -0.16173194956574535, 0.07083229832269988, -0.09886287128220694, 0.19082364344846658, 0.09935884263958464, 0.029276711534160053, 0.182103739503605, 0.09842398589975092, 0.18475936199971582, 0.09493644001294477, 0.06056779805866842, -0.19544038940365463, -0.2175703527326443, -0.06210150448388831, -0.15177963393227767, 0.07611492107254128, -0.22411083281814037, -0.19705002198299004, 0.3591501900363107, 0.17499262050187664, 0.11168067526278021, 0.1402749492409603, 0.2665619983287283, 0.0995103987655783, -0.07813760565680473, 0.14092297939125217, 0.1787783851512697, -0.0009173473502083342, 0.12306868056994556, -0.1727334310204989, 0.2856306592183, -0.054411400824265425] |
1,802.09955 | Stress-testing the VBF approximation in multijet final states | We consider electro-weak Higgs plus three jets production at NLO QCD beyond
strict VBF acceptance cuts. We investigate, for the first time, how accurate
the VBF approximation is in these regions and within perturbative
uncertainties, by a detailed comparison of full and approximate calculations.
We find that a rapidity gap between the tagging jets guarantees a good
approximation, while an invariant mass cut alone is not sufficient, which needs
to be confronted with experimental choices. We also find that a significant
part of the QCD corrections can be attributed to Higgs-Strahlungs-type
topologies.
| hep-ph | we consider electroweak higgs plus three jets production at nlo qcd beyond strict vbf acceptance cuts we investigate for the first time how accurate the vbf approximation is in these regions and within perturbative uncertainties by a detailed comparison of full and approximate calculations we find that a rapidity gap between the tagging jets guarantees a good approximation while an invariant mass cut alone is not sufficient which needs to be confronted with experimental choices we also find that a significant part of the qcd corrections can be attributed to higgsstrahlungstype topologies | [['we', 'consider', 'electroweak', 'higgs', 'plus', 'three', 'jets', 'production', 'at', 'nlo', 'qcd', 'beyond', 'strict', 'vbf', 'acceptance', 'cuts', 'we', 'investigate', 'for', 'the', 'first', 'time', 'how', 'accurate', 'the', 'vbf', 'approximation', 'is', 'in', 'these', 'regions', 'and', 'within', 'perturbative', 'uncertainties', 'by', 'a', 'detailed', 'comparison', 'of', 'full', 'and', 'approximate', 'calculations', 'we', 'find', 'that', 'a', 'rapidity', 'gap', 'between', 'the', 'tagging', 'jets', 'guarantees', 'a', 'good', 'approximation', 'while', 'an', 'invariant', 'mass', 'cut', 'alone', 'is', 'not', 'sufficient', 'which', 'needs', 'to', 'be', 'confronted', 'with', 'experimental', 'choices', 'we', 'also', 'find', 'that', 'a', 'significant', 'part', 'of', 'the', 'qcd', 'corrections', 'can', 'be', 'attributed', 'to', 'higgsstrahlungstype', 'topologies']] | [-0.07208847244024523, 0.1207525826618651, -0.13337614853958507, 0.19476194148832052, -0.06055298395413947, -0.09150661261250767, 0.07884579402609514, 0.41035517939663196, -0.19114126638089726, -0.27588772481041296, 0.023052259382873693, -0.27510086401969525, -0.0020637058839713643, 0.09901331236923706, 0.01122956081027431, 0.08077146135434345, 0.13448762337441791, -0.01926316934954989, -0.11939594610645385, -0.2115101231860795, 0.3019577393738123, 0.057197055216510216, 0.20136590668890667, 0.1502735308463593, 0.06836023456212338, 0.001739961223722855, -0.056392034100609126, 0.03903922326044067, -0.15039607832943228, 0.0397072056318623, 0.24444797622797254, 0.05013191737848651, 0.206311183041, -0.3679645071727234, -0.12004952169545405, 0.11724960927309079, 0.17121092658899315, 0.11823242038084132, -0.041351400346464506, -0.2492264698152072, 0.1539311579538632, -0.22044933783811527, -0.07891552847717981, -0.1440518990691219, -0.048789298305144675, -0.05126834478661684, -0.3568027844488785, 0.061659596471824674, -0.0344362633179996, 0.0003316390607474055, 0.013932614825195172, -0.12070235498454217, -0.050270387245301196, 0.07904509986126489, 0.08821168199378568, 0.0852180997544265, 0.12864958167915325, -0.19077197881479452, -0.1874059712243072, 0.43067941871973187, -0.029990175667290505, -0.19370235526258803, 0.15213580266828394, -0.1817788949599592, -0.18265658715269067, 0.15974729670055599, 0.2083851641023552, 0.0833982615322284, -0.17110717017715285, 0.11295311022831311, 0.0002594425427410137, 0.17702209059875662, 0.04078956307833093, 0.05185658919399829, 0.1839452702449737, 0.1764616224976195, 0.04143818964219683, 0.07523373066918454, -0.05691478515407173, -0.10471386242923993, -0.44558080828206226, -0.09864036198612686, -0.0711221458584807, 0.03543263258541049, -0.10262781815509987, -0.11848881391931203, 0.3633220456233555, 0.1392039484549109, 0.25122453718558774, 0.043408535282731385, 0.35724482957560283, 0.11704788793704811, 0.08327146701432847, 0.11266976156384571, 0.3293941872110296, 0.12410549063409505, 0.08326611517171202, -0.21378573280974075, 0.049742381201013104, 0.061598476416503005] |
1,802.09956 | Introduction to hierarchical tiling dynamical systems | This paper is about the tiling dynamical systems approach to the study of
aperiodic order. We compare and contrast four related types of systems:
ordinary (one-dimensional) symbolic systems, one-dimensional tiling systems,
multidimensional $Z^d$-systems, and multidimensional tiling systems.
Aperiodically ordered structures are often hierarchical in nature, and there
are a number of different yet related ways to define them. We will focus on
what we are calling "supertile construction methods": symbolic substitution in
one and many dimensions, S-adic sequences, self-similar and pseudo-self-similar
tilings, and fusion rules. The techniques of dynamical analysis of these
systems are discussed and a number of results are surveyed. We conclude with a
discussion of the spectral theory of supertile systems from both the dynamical
and diffraction perspectives.
| math.DS | this paper is about the tiling dynamical systems approach to the study of aperiodic order we compare and contrast four related types of systems ordinary onedimensional symbolic systems onedimensional tiling systems multidimensional zdsystems and multidimensional tiling systems aperiodically ordered structures are often hierarchical in nature and there are a number of different yet related ways to define them we will focus on what we are calling supertile construction methods symbolic substitution in one and many dimensions sadic sequences selfsimilar and pseudoselfsimilar tilings and fusion rules the techniques of dynamical analysis of these systems are discussed and a number of results are surveyed we conclude with a discussion of the spectral theory of supertile systems from both the dynamical and diffraction perspectives | [['this', 'paper', 'is', 'about', 'the', 'tiling', 'dynamical', 'systems', 'approach', 'to', 'the', 'study', 'of', 'aperiodic', 'order', 'we', 'compare', 'and', 'contrast', 'four', 'related', 'types', 'of', 'systems', 'ordinary', 'onedimensional', 'symbolic', 'systems', 'onedimensional', 'tiling', 'systems', 'multidimensional', 'zdsystems', 'and', 'multidimensional', 'tiling', 'systems', 'aperiodically', 'ordered', 'structures', 'are', 'often', 'hierarchical', 'in', 'nature', 'and', 'there', 'are', 'a', 'number', 'of', 'different', 'yet', 'related', 'ways', 'to', 'define', 'them', 'we', 'will', 'focus', 'on', 'what', 'we', 'are', 'calling', 'supertile', 'construction', 'methods', 'symbolic', 'substitution', 'in', 'one', 'and', 'many', 'dimensions', 'sadic', 'sequences', 'selfsimilar', 'and', 'pseudoselfsimilar', 'tilings', 'and', 'fusion', 'rules', 'the', 'techniques', 'of', 'dynamical', 'analysis', 'of', 'these', 'systems', 'are', 'discussed', 'and', 'a', 'number', 'of', 'results', 'are', 'surveyed', 'we', 'conclude', 'with', 'a', 'discussion', 'of', 'the', 'spectral', 'theory', 'of', 'supertile', 'systems', 'from', 'both', 'the', 'dynamical', 'and', 'diffraction', 'perspectives']] | [-0.1611082953627871, 0.13150475650415325, -0.0608644266456303, 0.10249513146240546, -0.044684132897615934, -0.11691280561518863, 0.04002520185699608, 0.3846537933035308, -0.29557023071410027, -0.27156386647310826, 0.16407802736997104, -0.3099602626464447, -0.2250080338225332, 0.2067562304124111, -0.06604869347926573, 0.09027105384944555, 0.04408305110175069, 0.00891094102657267, -0.06812971883195162, -0.26287135504530507, 0.37313890028666674, -0.027751837919677506, 0.23824900463066934, -0.03249299518192703, 0.03567645392388481, -0.0007823278243113466, -0.09009780864693037, 0.06791140270975082, -0.1429823179897547, 0.17842446273572335, 0.2323512895142331, 0.12863100709651887, 0.21258266652081192, -0.3875612522467595, -0.20400508017912156, 0.09010101285833522, 0.13740517687494672, 0.12424156072494738, -0.03239708278081654, -0.2512588617665803, 0.09715653306847642, -0.160522993990541, -0.11656599120870859, -0.133850705575104, 0.008838016499458038, 0.09884078847440038, -0.20162008138483062, 0.029865201116547363, 0.1403173805302999, 0.11120244569512976, -0.07949642959528234, -0.10708956526467155, 0.00432913922376421, 0.10297979052890749, 0.006483914222012611, -0.049951944709559826, 0.07203239753955834, -0.07090767209433771, -0.2137841001082556, 0.41874222969245006, 0.06418335964676275, -0.19495131804787813, 0.30051958822340025, -0.13761214582453005, -0.19410455868649884, 0.10601926501057729, 0.17584336737656042, 0.11786913252709542, -0.15966487895822576, 0.07742900432496769, -0.0408005760376099, 0.18774742056652824, 0.08224290221569543, 0.05950756396065239, 0.23598196825497791, 0.18519564816227355, 0.023306094678881884, 0.1571475126009685, -0.006530061524856382, -0.16359526486754292, -0.22031935470319597, -0.11385265914082504, -0.10028809389811666, 0.019032763897347413, -0.061983153927374725, -0.18507872910058798, 0.3594056025084828, 0.16976060386074066, 0.16687008297142275, 0.022426046325410363, 0.2434820947335141, 0.11026240353856016, 0.021559421377092162, -0.004191901076960714, 0.10537265529640864, 0.13051378381039416, 0.08757960545525205, -0.16767412591666891, -0.029330582921432348, 0.11050547436936249] |
1,802.09957 | Convolutional Neural Networks for Toxic Comment Classification | Flood of information is produced in a daily basis through the global Internet
usage arising from the on-line interactive communications among users. While
this situation contributes significantly to the quality of human life,
unfortunately it involves enormous dangers, since on-line texts with high
toxicity can cause personal attacks, on-line harassment and bullying behaviors.
This has triggered both industrial and research community in the last few years
while there are several tries to identify an efficient model for on-line toxic
comment prediction. However, these steps are still in their infancy and new
approaches and frameworks are required. On parallel, the data explosion that
appears constantly, makes the construction of new machine learning
computational tools for managing this information, an imperative need.
Thankfully advances in hardware, cloud computing and big data management allow
the development of Deep Learning approaches appearing very promising
performance so far. For text classification in particular the use of
Convolutional Neural Networks (CNN) have recently been proposed approaching
text analytics in a modern manner emphasizing in the structure of words in a
document. In this work, we employ this approach to discover toxic comments in a
large pool of documents provided by a current Kaggle's competition regarding
Wikipedia's talk page edits. To justify this decision we choose to compare CNNs
against the traditional bag-of-words approach for text analysis combined with a
selection of algorithms proven to be very effective in text classification. The
reported results provide enough evidence that CNN enhance toxic comment
classification reinforcing research interest towards this direction.
| cs.CL cs.LG | flood of information is produced in a daily basis through the global internet usage arising from the online interactive communications among users while this situation contributes significantly to the quality of human life unfortunately it involves enormous dangers since online texts with high toxicity can cause personal attacks online harassment and bullying behaviors this has triggered both industrial and research community in the last few years while there are several tries to identify an efficient model for online toxic comment prediction however these steps are still in their infancy and new approaches and frameworks are required on parallel the data explosion that appears constantly makes the construction of new machine learning computational tools for managing this information an imperative need thankfully advances in hardware cloud computing and big data management allow the development of deep learning approaches appearing very promising performance so far for text classification in particular the use of convolutional neural networks cnn have recently been proposed approaching text analytics in a modern manner emphasizing in the structure of words in a document in this work we employ this approach to discover toxic comments in a large pool of documents provided by a current kaggles competition regarding wikipedias talk page edits to justify this decision we choose to compare cnns against the traditional bagofwords approach for text analysis combined with a selection of algorithms proven to be very effective in text classification the reported results provide enough evidence that cnn enhance toxic comment classification reinforcing research interest towards this direction | [['flood', 'of', 'information', 'is', 'produced', 'in', 'a', 'daily', 'basis', 'through', 'the', 'global', 'internet', 'usage', 'arising', 'from', 'the', 'online', 'interactive', 'communications', 'among', 'users', 'while', 'this', 'situation', 'contributes', 'significantly', 'to', 'the', 'quality', 'of', 'human', 'life', 'unfortunately', 'it', 'involves', 'enormous', 'dangers', 'since', 'online', 'texts', 'with', 'high', 'toxicity', 'can', 'cause', 'personal', 'attacks', 'online', 'harassment', 'and', 'bullying', 'behaviors', 'this', 'has', 'triggered', 'both', 'industrial', 'and', 'research', 'community', 'in', 'the', 'last', 'few', 'years', 'while', 'there', 'are', 'several', 'tries', 'to', 'identify', 'an', 'efficient', 'model', 'for', 'online', 'toxic', 'comment', 'prediction', 'however', 'these', 'steps', 'are', 'still', 'in', 'their', 'infancy', 'and', 'new', 'approaches', 'and', 'frameworks', 'are', 'required', 'on', 'parallel', 'the', 'data', 'explosion', 'that', 'appears', 'constantly', 'makes', 'the', 'construction', 'of', 'new', 'machine', 'learning', 'computational', 'tools', 'for', 'managing', 'this', 'information', 'an', 'imperative', 'need', 'thankfully', 'advances', 'in', 'hardware', 'cloud', 'computing', 'and', 'big', 'data', 'management', 'allow', 'the', 'development', 'of', 'deep', 'learning', 'approaches', 'appearing', 'very', 'promising', 'performance', 'so', 'far', 'for', 'text', 'classification', 'in', 'particular', 'the', 'use', 'of', 'convolutional', 'neural', 'networks', 'cnn', 'have', 'recently', 'been', 'proposed', 'approaching', 'text', 'analytics', 'in', 'a', 'modern', 'manner', 'emphasizing', 'in', 'the', 'structure', 'of', 'words', 'in', 'a', 'document', 'in', 'this', 'work', 'we', 'employ', 'this', 'approach', 'to', 'discover', 'toxic', 'comments', 'in', 'a', 'large', 'pool', 'of', 'documents', 'provided', 'by', 'a', 'current', 'kaggles', 'competition', 'regarding', 'wikipedias', 'talk', 'page', 'edits', 'to', 'justify', 'this', 'decision', 'we', 'choose', 'to', 'compare', 'cnns', 'against', 'the', 'traditional', 'bagofwords', 'approach', 'for', 'text', 'analysis', 'combined', 'with', 'a', 'selection', 'of', 'algorithms', 'proven', 'to', 'be', 'very', 'effective', 'in', 'text', 'classification', 'the', 'reported', 'results', 'provide', 'enough', 'evidence', 'that', 'cnn', 'enhance', 'toxic', 'comment', 'classification', 'reinforcing', 'research', 'interest', 'towards', 'this', 'direction']] | [-0.06418473765719682, 0.02930233387660701, -0.05776159443962388, 0.08038073080941104, -0.15301261563599108, -0.17301145837269724, 0.06998673946596683, 0.4249953908789903, -0.24324191166367382, -0.32595749882422387, 0.1148165218308568, -0.3067298684120178, -0.18840849703131243, 0.19326133976806886, -0.15386449679893122, 0.05418583957664669, 0.12274584621191025, 0.04793633895379026, -0.02359998714271933, -0.31555453601386396, 0.26265162419946864, 0.07732726735051255, 0.3622144261449575, 0.07744129068078473, 0.044857411767705344, -0.02597872081073001, -0.11724520927353296, -0.043907039122655984, -0.07440497343830066, 0.20203669692692347, 0.3978926654681563, 0.22372160449717193, 0.38011591958688223, -0.45543899093568324, -0.2130005177826388, 0.08409383671637624, 0.17922795405983924, 0.1302247866038233, -0.08980263709044084, -0.31161793585959824, 0.08402993684308603, -0.20914700791344512, -0.037726838329806923, -0.13069747808139073, 0.02780276930704713, -0.02409404871240258, -0.2041446399630513, -0.004154653307632543, 0.05398274485510774, 0.10074232489988208, -0.0043999895332381125, -0.10686318273469805, 0.06086449827440083, 0.166652916344814, 0.12223550808196887, 0.03983748858422041, 0.14687743128323927, -0.20460332603100687, -0.14853934739809482, 0.3875293197054416, -0.01208857109863311, -0.14382145691197365, 0.20801147244079038, -0.006567900659516453, -0.203071157630533, 0.09947729450836777, 0.23216295123426245, 0.055089873528108, -0.18597377205383964, 0.021352634615730493, 0.017552824220620097, 0.16412803039141, 0.05833091479726136, 0.010330844424664974, 0.20944710135180503, 0.25832165151368824, 0.022120431834831835, 0.09362163252616301, -0.06139558929414488, -0.07646146712824703, -0.1789241903531365, -0.12963303758308758, -0.15645560174435377, 0.0028704927507787943, -0.06778819873620523, -0.1566777769252658, 0.36737403577566147, 0.24003764780703932, 0.1630756807923317, 0.04193932179454714, 0.3383310233019292, -0.006426475118845702, 0.11923160486575216, 0.10563503632508218, 0.1899854734344408, 0.0035879199700430036, 0.21966206854768097, -0.1260123134921305, 0.13211611506901683, 0.0030571832628920673] |
1,802.09958 | Use of Two-Mode Circuitry and Optimal Energy-Efficient Power Control
Under Target Delay-Outage Constraints | An accurate energy efficiency analytical model based on a two-mode circuitry
was recently proposed; and the model showed that the use of this circuitry can
significantly improve a system's energy efficiency. In this paper, we use this
analytical model to develop a new power control scheme, a scheme that is
capable of allocating a minimum transmission power precisely within the
delay-outage probability constraint. Precision brings substantial benefits as
numerical results show that the energy efficiency using our scheme is much
higher than other schemes. Results further suggest that data rate values affect
energy efficiency non-uniformly, i.e., there exists a specific data rate value
that achieves maximum energy efficiency.
| eess.SP | an accurate energy efficiency analytical model based on a twomode circuitry was recently proposed and the model showed that the use of this circuitry can significantly improve a systems energy efficiency in this paper we use this analytical model to develop a new power control scheme a scheme that is capable of allocating a minimum transmission power precisely within the delayoutage probability constraint precision brings substantial benefits as numerical results show that the energy efficiency using our scheme is much higher than other schemes results further suggest that data rate values affect energy efficiency nonuniformly ie there exists a specific data rate value that achieves maximum energy efficiency | [['an', 'accurate', 'energy', 'efficiency', 'analytical', 'model', 'based', 'on', 'a', 'twomode', 'circuitry', 'was', 'recently', 'proposed', 'and', 'the', 'model', 'showed', 'that', 'the', 'use', 'of', 'this', 'circuitry', 'can', 'significantly', 'improve', 'a', 'systems', 'energy', 'efficiency', 'in', 'this', 'paper', 'we', 'use', 'this', 'analytical', 'model', 'to', 'develop', 'a', 'new', 'power', 'control', 'scheme', 'a', 'scheme', 'that', 'is', 'capable', 'of', 'allocating', 'a', 'minimum', 'transmission', 'power', 'precisely', 'within', 'the', 'delayoutage', 'probability', 'constraint', 'precision', 'brings', 'substantial', 'benefits', 'as', 'numerical', 'results', 'show', 'that', 'the', 'energy', 'efficiency', 'using', 'our', 'scheme', 'is', 'much', 'higher', 'than', 'other', 'schemes', 'results', 'further', 'suggest', 'that', 'data', 'rate', 'values', 'affect', 'energy', 'efficiency', 'nonuniformly', 'ie', 'there', 'exists', 'a', 'specific', 'data', 'rate', 'value', 'that', 'achieves', 'maximum', 'energy', 'efficiency']] | [-0.12188417893937892, 0.020558194137804634, -0.07017097949412548, 0.032652056175585906, -0.05195975801217611, -0.14455314757543858, 0.1334510187422253, 0.37762005727833, -0.2134110200977712, -0.3332911762495146, 0.05735001877420237, -0.23536374273761693, -0.14475142038039243, 0.2833115323899417, -0.10136162980429449, 0.06870715454971543, 0.1275160612055549, 0.026080595208676876, -0.053411353791253294, -0.23928833961555804, 0.2574402414201931, 0.18556792755542253, 0.39673182356205805, 0.0944554628804326, 0.12830042032119646, -0.0462564927142079, 0.032442253600392074, 0.014996301520753789, -0.13247893166819133, 0.1395057112741698, 0.22865648623081614, 0.16326412779744714, 0.32097866724210755, -0.39995357635672446, -0.3015100100396753, 0.12111180578789639, 0.12057476640243463, 0.09155434365944799, -0.12160609560453815, -0.14979417785933172, 0.1231486226396454, -0.238881612379811, -0.0994974395122241, -0.10884723192376206, -0.03773870698555752, 0.04934061272932148, -0.3290056687934945, 0.11758559946557162, 0.02973238579687421, -0.015005606580180702, -0.051924150941583015, -0.11007534695737478, -0.009999288515515488, 0.08032347989285847, -0.02446464265597536, 0.01658211019821465, 0.11560159661651899, -0.1065481654476133, -0.1391779438385533, 0.34193071998931746, -0.054865610456612625, -0.21900048043095954, 0.12894850841042138, -0.08156817709958111, -0.07762764966227459, 0.1814102928188664, 0.17738058019636405, 0.10468291545597215, -0.13257511906946698, 0.03805762550877666, -0.017439774403572774, 0.2626987003928257, 0.00906024907965696, 0.061613646960689, 0.13840758205926115, 0.21096249977212952, 0.09727092742643974, 0.13570081697899797, -0.08751624824988001, -0.09701487244348284, -0.23470619107010188, -0.1521850965271167, -0.17291003300946345, 0.0057443380075575855, -0.10275719926627332, -0.01684530469140521, 0.40203447407680803, 0.2127536498572024, 0.17392017622478306, 0.11007591330713627, 0.38783590619008196, 0.17402250450363177, 0.05997316131402773, 0.12106380191269434, 0.25346504745970444, 0.04276014769803388, 0.0978973267898524, -0.24967040803231713, 0.029065925602076784, 0.008158953916453928] |
1,802.09959 | Valuation, Liquidity Price, and Stability of Cryptocurrencies | Cryptocurrencies are examined through the asset flow equations and
experimental asset markets. Since tangible value of a typical cryptocurrency is
non-existent, the theory suggests that price will gravitate toward liquidity
value, i.e., the total amount of cash available for purchase of the asset
divided by the number of units. Thus it is unlikely that cryptocurrencies in
their current form will be stable in the absence of a mechanism of a link to
value.
| q-fin.MF cs.CR | cryptocurrencies are examined through the asset flow equations and experimental asset markets since tangible value of a typical cryptocurrency is nonexistent the theory suggests that price will gravitate toward liquidity value ie the total amount of cash available for purchase of the asset divided by the number of units thus it is unlikely that cryptocurrencies in their current form will be stable in the absence of a mechanism of a link to value | [['cryptocurrencies', 'are', 'examined', 'through', 'the', 'asset', 'flow', 'equations', 'and', 'experimental', 'asset', 'markets', 'since', 'tangible', 'value', 'of', 'a', 'typical', 'cryptocurrency', 'is', 'nonexistent', 'the', 'theory', 'suggests', 'that', 'price', 'will', 'gravitate', 'toward', 'liquidity', 'value', 'ie', 'the', 'total', 'amount', 'of', 'cash', 'available', 'for', 'purchase', 'of', 'the', 'asset', 'divided', 'by', 'the', 'number', 'of', 'units', 'thus', 'it', 'is', 'unlikely', 'that', 'cryptocurrencies', 'in', 'their', 'current', 'form', 'will', 'be', 'stable', 'in', 'the', 'absence', 'of', 'a', 'mechanism', 'of', 'a', 'link', 'to', 'value']] | [-0.16398103532623753, 0.1068965777888741, -0.09807867905099506, 0.09218742740212953, -0.10397220431023264, -0.1284094539930253, 0.11647297637632806, 0.37332315823343926, -0.3000751516641411, -0.2659496573893966, 0.1775054179597646, -0.2966418332637173, -0.07447686255590556, 0.1969134545349197, -0.1169422789754295, -0.03410711443077211, 0.041977345710620284, 0.028123749241437, 0.07348880109900277, -0.2783716803301789, 0.2921781367877473, 0.07608321111662032, 0.2855362723555977, 0.064927245132236, 0.10301963755325096, -0.06646307189757489, -0.03827672090687572, 0.038343295914261305, -0.10929220171795986, 0.14925533049574044, 0.30233134587665333, 0.11721058529227564, 0.37186974066322387, -0.45486695615396106, -0.13604620948740065, 0.13952048254288632, 0.04135685847204638, 0.024873333778997808, -0.001155337918396682, -0.21689522612125497, 0.056766551262252544, -0.2548015017623771, -0.11945424389017567, -0.05073710765421697, 0.06860142385536065, 0.007875822395188352, -0.2563222527044685, 0.08962145827276861, -0.014714315138144852, 0.015267418034068525, -0.06344560139544614, -0.10559356174342437, -0.0927584313289964, 0.11393835951178653, 0.1508640973567197, -0.06789351573328756, 0.1831397994306602, -0.20205938335099857, -0.11645730894237552, 0.39875779081493207, -0.05080985654247542, -0.12588633843123503, 0.06626858390000177, -0.1312979967460955, -0.08349572053842552, 0.12346026786182025, 0.14577111312226482, 0.012520714777789703, -0.17306118472543072, 0.017881585552184907, -0.07387887440264633, 0.19006765205476892, 0.010972390659408618, 0.017961479155729487, 0.2818357428561335, 0.1474534008549909, 0.14489052555051773, 0.08287849111246481, 0.004517746170702046, -0.2084580723272815, -0.28722699274060204, -0.17383835980132833, -0.16989562793137275, 0.1069682805212087, -0.11846681469266003, -0.16242836706646502, 0.35364086659025556, 0.16478190166646078, 0.12347004456726247, 0.047552848904559464, 0.2903891175423991, 0.12969649063857042, 0.05557310374211265, 0.10460697982319925, 0.23903171462963704, -0.019629116827137257, 0.18126713648463968, -0.14655185134105436, 0.23201276611996025, 0.010030617248522092] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.