id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.03967 | A multi-wavelength study of the evolution of Early-Type Galaxies in
Groups: the ultraviolet view | ABRIDGED- The UV-optical color magnitude diagram (CMD) of rich galaxy groups
is characterised by a well developed Red Sequence (RS), a Blue Cloud (BC) and
the so-called Green Valley (GV). Loose, less evolved groups of galaxies likely
not virialized yet may lack a well defined RS. This is actually explained in
the framework of galaxy evolution. We are focussing on understanding galaxy
migration towards the RS, checking for signatures of such a transition in their
photometric and morphological properties. We report on the UV properties of a
sample of ETGs galaxies inhabiting the RS. The analysis of their structures, as
derived by fitting a Sersic law to their UV luminosity profiles, suggests the
presence of an underlying disk. This is the hallmark of dissipation processes
that still must have a role in the evolution of this class of galaxies. SPH
simulations with chemo-photometric implementations able to match the global
properties of our targets are used to derive their evolutionary paths through
UV-optical CDM, providing some fundamental information such as the crossing
time through the GV, which depends on their luminosity. The transition from the
BC to the RS takes several Gyrs, being about 3-5 Gyr for the the brightest
galaxies and more long for fainter ones, if it occurs. The photometric study of
nearby galaxy structures in UV is seriously hampered by either the limited FoV
of the cameras (e.g in HST) or by the low spatial resolution of the images (e.g
in the GALEX). Current missions equipped with telescopes and cameras sensitive
to UV wavelengths, such as Swift-UVOT and Astrosat-UVIT, provide a relatively
large FoV and better resolution than the GALEX. More powerful UV instruments
(size, resolution and FoV) are obviously bound to yield fundamental advances in
the accuracy and depth of the surface photometry and in the characterisation of
the galaxy environment.
| astro-ph.GA | abridged the uvoptical color magnitude diagram cmd of rich galaxy groups is characterised by a well developed red sequence rs a blue cloud bc and the socalled green valley gv loose less evolved groups of galaxies likely not virialized yet may lack a well defined rs this is actually explained in the framework of galaxy evolution we are focussing on understanding galaxy migration towards the rs checking for signatures of such a transition in their photometric and morphological properties we report on the uv properties of a sample of etgs galaxies inhabiting the rs the analysis of their structures as derived by fitting a sersic law to their uv luminosity profiles suggests the presence of an underlying disk this is the hallmark of dissipation processes that still must have a role in the evolution of this class of galaxies sph simulations with chemophotometric implementations able to match the global properties of our targets are used to derive their evolutionary paths through uvoptical cdm providing some fundamental information such as the crossing time through the gv which depends on their luminosity the transition from the bc to the rs takes several gyrs being about 35 gyr for the the brightest galaxies and more long for fainter ones if it occurs the photometric study of nearby galaxy structures in uv is seriously hampered by either the limited fov of the cameras eg in hst or by the low spatial resolution of the images eg in the galex current missions equipped with telescopes and cameras sensitive to uv wavelengths such as swiftuvot and astrosatuvit provide a relatively large fov and better resolution than the galex more powerful uv instruments size resolution and fov are obviously bound to yield fundamental advances in the accuracy and depth of the surface photometry and in the characterisation of the galaxy environment | [['abridged', 'the', 'uvoptical', 'color', 'magnitude', 'diagram', 'cmd', 'of', 'rich', 'galaxy', 'groups', 'is', 'characterised', 'by', 'a', 'well', 'developed', 'red', 'sequence', 'rs', 'a', 'blue', 'cloud', 'bc', 'and', 'the', 'socalled', 'green', 'valley', 'gv', 'loose', 'less', 'evolved', 'groups', 'of', 'galaxies', 'likely', 'not', 'virialized', 'yet', 'may', 'lack', 'a', 'well', 'defined', 'rs', 'this', 'is', 'actually', 'explained', 'in', 'the', 'framework', 'of', 'galaxy', 'evolution', 'we', 'are', 'focussing', 'on', 'understanding', 'galaxy', 'migration', 'towards', 'the', 'rs', 'checking', 'for', 'signatures', 'of', 'such', 'a', 'transition', 'in', 'their', 'photometric', 'and', 'morphological', 'properties', 'we', 'report', 'on', 'the', 'uv', 'properties', 'of', 'a', 'sample', 'of', 'etgs', 'galaxies', 'inhabiting', 'the', 'rs', 'the', 'analysis', 'of', 'their', 'structures', 'as', 'derived', 'by', 'fitting', 'a', 'sersic', 'law', 'to', 'their', 'uv', 'luminosity', 'profiles', 'suggests', 'the', 'presence', 'of', 'an', 'underlying', 'disk', 'this', 'is', 'the', 'hallmark', 'of', 'dissipation', 'processes', 'that', 'still', 'must', 'have', 'a', 'role', 'in', 'the', 'evolution', 'of', 'this', 'class', 'of', 'galaxies', 'sph', 'simulations', 'with', 'chemophotometric', 'implementations', 'able', 'to', 'match', 'the', 'global', 'properties', 'of', 'our', 'targets', 'are', 'used', 'to', 'derive', 'their', 'evolutionary', 'paths', 'through', 'uvoptical', 'cdm', 'providing', 'some', 'fundamental', 'information', 'such', 'as', 'the', 'crossing', 'time', 'through', 'the', 'gv', 'which', 'depends', 'on', 'their', 'luminosity', 'the', 'transition', 'from', 'the', 'bc', 'to', 'the', 'rs', 'takes', 'several', 'gyrs', 'being', 'about', '35', 'gyr', 'for', 'the', 'the', 'brightest', 'galaxies', 'and', 'more', 'long', 'for', 'fainter', 'ones', 'if', 'it', 'occurs', 'the', 'photometric', 'study', 'of', 'nearby', 'galaxy', 'structures', 'in', 'uv', 'is', 'seriously', 'hampered', 'by', 'either', 'the', 'limited', 'fov', 'of', 'the', 'cameras', 'eg', 'in', 'hst', 'or', 'by', 'the', 'low', 'spatial', 'resolution', 'of', 'the', 'images', 'eg', 'in', 'the', 'galex', 'current', 'missions', 'equipped', 'with', 'telescopes', 'and', 'cameras', 'sensitive', 'to', 'uv', 'wavelengths', 'such', 'as', 'swiftuvot', 'and', 'astrosatuvit', 'provide', 'a', 'relatively', 'large', 'fov', 'and', 'better', 'resolution', 'than', 'the', 'galex', 'more', 'powerful', 'uv', 'instruments', 'size', 'resolution', 'and', 'fov', 'are', 'obviously', 'bound', 'to', 'yield', 'fundamental', 'advances', 'in', 'the', 'accuracy', 'and', 'depth', 'of', 'the', 'surface', 'photometry', 'and', 'in', 'the', 'characterisation', 'of', 'the', 'galaxy', 'environment']] | [-0.06602843240957719, 0.07856223863906268, -0.10279441297111154, 0.10659720644734419, -0.09286266151606642, -0.07262335195230694, 0.03843862804616479, 0.45450656671728634, -0.1787095231091659, -0.36155574573296134, 0.09259181950209054, -0.2592249258472077, -0.07142539668855911, 0.20193739529090501, -0.0808697631980094, -0.015989246706150952, 0.05122081237874323, -0.07042904539875572, -0.04210427143249281, -0.2653946216915897, 0.285003157879293, 0.07002558199588514, 0.18453993468788196, -0.047496987514431425, 0.04693676952254212, -0.044146980962749854, -0.1032928736327545, 0.0005804048559133565, -0.14237783820320418, 0.06255823531262607, 0.23326144369608007, 0.14602895649019382, 0.23086749643652943, -0.3842209340363966, -0.22532308248575567, 0.07893086453168208, 0.2007896183614762, 0.02412325461478074, -0.05660400621329047, -0.2800441858682954, 0.07820206062204324, -0.13957471270944075, -0.15237697602092926, 0.05688319890683043, 0.029388875381255727, 0.03704580124475296, -0.18722155139199073, 0.09540956295763908, 0.02978883427221992, 0.12522905355583716, -0.07562274523632656, -0.07591792509482678, -0.08763481556244268, 0.1261705721704683, 0.005419884443362996, 0.050763182247152844, 0.1515062298933459, -0.20997856000957782, -0.032906591520328134, 0.42008288233869834, -0.03412475697289908, -0.025244339987045467, 0.25460261177723437, -0.17597422251176617, -0.1359779443330571, 0.11967931905755214, 0.129622529102328, 0.1165607287722577, -0.15708938705436762, 0.04650301102995673, 0.018844493377412803, 0.19502423701096303, 0.02831449707210826, 0.12591337528266666, 0.2768758571485408, 0.15698401487460084, 0.057160564510016505, 0.09021463641196047, -0.1843316568311061, -0.030167913104318354, -0.2330847149007883, -0.10092604239062074, -0.1590279609882411, 0.08754519105389623, -0.1278808423906865, -0.14213051887462683, 0.3863553209768196, 0.10910896210287307, 0.23180742577185529, 0.07868684149345709, 0.32045318580020477, 0.06769940493591499, 0.15411323229106075, 0.06737405132723621, 0.28058503308034155, 0.14042362281222745, 0.09207257546546713, -0.22316448910818082, 0.06713302616527912, 0.010348957258648556] |
1,803.03968 | Backward lasing of singly ionized nitrogen ions pumped by femtosecond
laser pulses | We report on the observation of backward lasing at 391.4 nm of nitrogen ions
pumped by linearly polarized intense femtosecond pulses at 800 nm. The strongly
enhanced spectral intensity at 391.4 nm, as well as the amplification of an
externally injected backward seeding pulse, confirm that the backward 391.4 nm
signal is due to optical amplification in the gas plasma. Compared to the
forward emission at 391.4 nm, the optimal backward emission is achieved at a
lower gas pressure around 10 mbar, which is due to asymmetry of the backward
and forward directions rooted in the traveling excitation geometry. This
method, using the widely available 800 nm femtosecond pulses as a pump laser,
provides a promising scheme for the generation of backward air laser, which
holds a unique potential for optical remote sensing.
| physics.optics | we report on the observation of backward lasing at 3914 nm of nitrogen ions pumped by linearly polarized intense femtosecond pulses at 800 nm the strongly enhanced spectral intensity at 3914 nm as well as the amplification of an externally injected backward seeding pulse confirm that the backward 3914 nm signal is due to optical amplification in the gas plasma compared to the forward emission at 3914 nm the optimal backward emission is achieved at a lower gas pressure around 10 mbar which is due to asymmetry of the backward and forward directions rooted in the traveling excitation geometry this method using the widely available 800 nm femtosecond pulses as a pump laser provides a promising scheme for the generation of backward air laser which holds a unique potential for optical remote sensing | [['we', 'report', 'on', 'the', 'observation', 'of', 'backward', 'lasing', 'at', '3914', 'nm', 'of', 'nitrogen', 'ions', 'pumped', 'by', 'linearly', 'polarized', 'intense', 'femtosecond', 'pulses', 'at', '800', 'nm', 'the', 'strongly', 'enhanced', 'spectral', 'intensity', 'at', '3914', 'nm', 'as', 'well', 'as', 'the', 'amplification', 'of', 'an', 'externally', 'injected', 'backward', 'seeding', 'pulse', 'confirm', 'that', 'the', 'backward', '3914', 'nm', 'signal', 'is', 'due', 'to', 'optical', 'amplification', 'in', 'the', 'gas', 'plasma', 'compared', 'to', 'the', 'forward', 'emission', 'at', '3914', 'nm', 'the', 'optimal', 'backward', 'emission', 'is', 'achieved', 'at', 'a', 'lower', 'gas', 'pressure', 'around', '10', 'mbar', 'which', 'is', 'due', 'to', 'asymmetry', 'of', 'the', 'backward', 'and', 'forward', 'directions', 'rooted', 'in', 'the', 'traveling', 'excitation', 'geometry', 'this', 'method', 'using', 'the', 'widely', 'available', '800', 'nm', 'femtosecond', 'pulses', 'as', 'a', 'pump', 'laser', 'provides', 'a', 'promising', 'scheme', 'for', 'the', 'generation', 'of', 'backward', 'air', 'laser', 'which', 'holds', 'a', 'unique', 'potential', 'for', 'optical', 'remote', 'sensing']] | [-0.09148449480053934, 0.21402214189277546, -0.04545725570095325, 0.0025117260266508544, 0.025587010726024557, -0.15997459791264587, 0.06090026132454325, 0.5110949093573972, -0.28850617821335345, -0.2855567415104829, 0.05905194128504639, -0.2888473143356439, 0.044840163582781874, 0.23992259714304282, 0.026401091570076637, 0.038257404745213296, 0.013849790826005707, -0.0785841631345955, 0.058918742305438095, -0.09992929171294646, 0.2161013923184526, 0.12431770955436491, 0.34182829951825444, 0.08327914833238251, 0.16414864505186005, -0.021375738269880526, 0.041535040475708204, -0.12141375145629833, -0.073396441152683, 0.08224060751989666, 0.25271036208404185, -0.014575789534640884, 0.27834355278654876, -0.4168996712739082, -0.23335983258973164, -0.006992607885145379, 0.16552107681737357, 0.14301471713811328, -0.11335016863116, -0.2721846857654365, 0.07531487289816141, -0.06455588121583364, -0.15455995173074474, 0.07027724027437598, 0.012729910195321966, 0.0477714144267646, -0.2744233288760192, 0.023755851264734913, 0.01692803237758773, 0.1056739998477182, -0.0017291437589416379, -0.0451048880717472, -0.06709410985266524, -0.017393374024309162, -0.012535757495482502, 0.08424453120118469, 0.19980803609928957, -0.08816306370212451, -0.10104134410297624, 0.3481685483716148, -0.16867671972770887, -0.017892905104821336, 0.1441368903208496, -0.19779967658109682, 0.017234821662944006, 0.290261467125729, 0.15320461980221248, 0.18169714567860715, -0.09884082488855697, -0.04704651456629101, -0.001323589866480237, 0.24768684275756428, 0.2160824675680159, 0.09313912950876288, 0.20070581375166102, 0.18761163910402728, 0.07767595638542023, 0.16118705157834784, -0.17916554249507985, -0.006119756182109503, -0.2626833751477315, -0.0840129421947741, -0.12208887905274567, 0.06421514383440179, -0.06294666397150281, -0.06379871834349587, 0.386733363479759, 0.14862188176581062, 0.10115521197396338, -0.02264926344317321, 0.3570661683727924, 0.1731919358017035, 0.033836107280917634, 0.04000713667811308, 0.3098332164879132, 0.20173248507457092, 0.19121279499906682, -0.27457953412243324, 0.04190478955318493, -0.032631161062509045] |
1,803.03969 | On a cheeger type inequality in Cayley graphs of finite groups | Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao
that if the Cayley graph $C(G,S)$ is an expander graph and is non-bipartite
then the spectrum of the adjacency operator $T$ is bounded away from $-1$. In
this article we are interested in explicit bounds for the spectrum of these
graphs. Specifically, we show that the non-trivial spectrum of the adjacency
operator lies in the interval $\left[-1+\frac{h(\mathbb{G})^{4}}{\gamma},
1-\frac{h(\mathbb{G})^{2}}{2d^{2}}\right]$, where $h(\mathbb{G})$ denotes the
(vertex) Cheeger constant of the $d$ regular graph $C(G,S)$ with respect to a
symmetric set $S$ of generators and $\gamma = 2^{9}d^{6}(d+1)^{2}$.
| math.GR | let g be a finite group it was remarked by breuillardgreenguralnicktao that if the cayley graph cgs is an expander graph and is nonbipartite then the spectrum of the adjacency operator t is bounded away from 1 in this article we are interested in explicit bounds for the spectrum of these graphs specifically we show that the nontrivial spectrum of the adjacency operator lies in the interval left1frachmathbbg4gamma 1frachmathbbg22d2right where hmathbbg denotes the vertex cheeger constant of the d regular graph cgs with respect to a symmetric set s of generators and gamma 29d6d12 | [['let', 'g', 'be', 'a', 'finite', 'group', 'it', 'was', 'remarked', 'by', 'breuillardgreenguralnicktao', 'that', 'if', 'the', 'cayley', 'graph', 'cgs', 'is', 'an', 'expander', 'graph', 'and', 'is', 'nonbipartite', 'then', 'the', 'spectrum', 'of', 'the', 'adjacency', 'operator', 't', 'is', 'bounded', 'away', 'from', '1', 'in', 'this', 'article', 'we', 'are', 'interested', 'in', 'explicit', 'bounds', 'for', 'the', 'spectrum', 'of', 'these', 'graphs', 'specifically', 'we', 'show', 'that', 'the', 'nontrivial', 'spectrum', 'of', 'the', 'adjacency', 'operator', 'lies', 'in', 'the', 'interval', 'left1frachmathbbg4gamma', '1frachmathbbg22d2right', 'where', 'hmathbbg', 'denotes', 'the', 'vertex', 'cheeger', 'constant', 'of', 'the', 'd', 'regular', 'graph', 'cgs', 'with', 'respect', 'to', 'a', 'symmetric', 'set', 's', 'of', 'generators', 'and', 'gamma', '29d6d12']] | [-0.14789123072424967, 0.16154483951294005, -0.047376125127474744, 0.028015149487810354, -0.11874161378135172, -0.11756138031611617, 0.01964798468175564, 0.39640570704019473, -0.3163415679938338, -0.25533160413262235, 0.11233279265573227, -0.36405579522356724, -0.13198810773430747, 0.12153800393276837, -0.08237249975542674, -0.01606299691006876, 0.087669398360938, 0.187323040753378, -0.03753355763371238, -0.19715521060776625, 0.36766354797219625, 0.00582839397117077, 0.15772124175819452, 0.09802947920129708, 0.06559955222490296, -0.013296481420735964, -0.001186268213152718, 0.03813738817233969, -0.17266541339141145, 0.09965457985951995, 0.25616240232994547, 0.11473844775909119, 0.22477714624255896, -0.34159308383136655, -0.15448385351494456, 0.23724118184842422, 0.11447595718076055, -0.02008175194849459, 0.02258903215628829, -0.2438842082759784, 0.18949281749723668, -0.1362767138759072, -0.07761532078716862, 0.036094680093647385, 0.10718292037673881, -0.001450558527885528, -0.2855696765146103, 0.02226383431573932, 0.11963734729738718, 0.04110743606291722, 0.04881877344222007, -0.12526291924832242, -0.0537424126948659, 0.09328407385606277, -0.04689592494252609, 0.06736141248093394, 0.028646848541213556, -0.05753053866818631, -0.11623777342002756, 0.3890424209720131, -0.05581198077062877, -0.16124161560967398, 0.047565171063427676, -0.197577824088839, -0.16133505881900032, 0.07164004524604659, 0.11110676271485144, 0.166283263856273, -0.07507522027479129, 0.25596462656204916, -0.11045446883091765, 0.11474400842850085, 0.052267981436773296, -0.01084567278131759, 0.08889311773367645, 0.08311503152153717, 0.16236044605932293, 0.1683529403382452, 0.024554509371309804, 0.013841277145351587, -0.32550349888088326, -0.08907360898780772, -0.2861908706260866, 0.08536568084428234, -0.1888977828892759, -0.20149362919006164, 0.4468396722726273, 0.073481494184123, 0.20045559627286505, 0.11037163785135562, 0.2018537980117155, 0.12244768426939975, 0.01740288458963375, 0.18896504744280423, 0.11571346993526715, 0.20290234209080174, -0.03108770368892825, -0.17835373785922282, 0.0189425043861141, 0.14888108415536327] |
1,803.0397 | A fractional spline collocation-Galerkin method for the time-fractional
diffusion equation | The aim of this paper is to numerically solve a diffusion differential
problem having time derivative of fractional order. To this end we propose a
collocation-Galerkin method that uses the fractional splines as approximating
functions. The main advantage is in that the derivatives of integer and
fractional order of the fractional splines can be expressed in a closed form
that involves just the generalized finite difference operator. This allows us
to construct an accurate and efficient numerical method. Several numerical
tests showing the effectiveness of the proposed method are presented.
| math.NA | the aim of this paper is to numerically solve a diffusion differential problem having time derivative of fractional order to this end we propose a collocationgalerkin method that uses the fractional splines as approximating functions the main advantage is in that the derivatives of integer and fractional order of the fractional splines can be expressed in a closed form that involves just the generalized finite difference operator this allows us to construct an accurate and efficient numerical method several numerical tests showing the effectiveness of the proposed method are presented | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'numerically', 'solve', 'a', 'diffusion', 'differential', 'problem', 'having', 'time', 'derivative', 'of', 'fractional', 'order', 'to', 'this', 'end', 'we', 'propose', 'a', 'collocationgalerkin', 'method', 'that', 'uses', 'the', 'fractional', 'splines', 'as', 'approximating', 'functions', 'the', 'main', 'advantage', 'is', 'in', 'that', 'the', 'derivatives', 'of', 'integer', 'and', 'fractional', 'order', 'of', 'the', 'fractional', 'splines', 'can', 'be', 'expressed', 'in', 'a', 'closed', 'form', 'that', 'involves', 'just', 'the', 'generalized', 'finite', 'difference', 'operator', 'this', 'allows', 'us', 'to', 'construct', 'an', 'accurate', 'and', 'efficient', 'numerical', 'method', 'several', 'numerical', 'tests', 'showing', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'are', 'presented']] | [-0.10374997215596644, 0.010185425521791493, -0.11178891787049099, 0.06779602617993323, -0.1334296754781115, -0.07539692511154192, -0.006639831038872094, 0.3475969252961405, -0.29070277834373914, -0.28867041949559463, 0.13146953343602127, -0.2363371429155552, -0.2048408397201323, 0.19558363289603692, -0.08146691398977647, 0.09810522192398484, 0.008718821047438999, 0.011385330197851309, -0.10334301562822854, -0.2614748633225982, 0.31401694233246735, -0.007875874959026578, 0.19950744399821826, 0.04135434033370085, 0.16521787661221926, -0.06334996387739195, -0.06672464457884682, 0.03261720151588153, -0.13379827664576122, 0.1833632375948194, 0.2559939766867777, 0.05321524208516217, 0.35876551234906306, -0.4106592000828365, -0.1710319939603129, 0.1253066698267135, 0.15026751183119885, 0.0885504297074977, -0.04037088505254033, -0.22955178551041008, 0.10209365098036072, -0.17213400294271747, -0.1725009163695105, -0.13173371529353134, -0.006039897874625546, 0.03175377517185184, -0.33641561834413686, 0.0988037781162041, 0.04445720091462135, -0.02503743406720041, -0.0412425055447181, -0.11705838266257824, 0.03333211174820749, 0.08332958899626738, -0.0044280536043761155, 0.012160009322583341, 0.006695341120024075, -0.04083501767586875, -0.15082995249272396, 0.36251920975451724, -0.08784557975831264, -0.3086264179914855, 0.132606843057392, -0.13951301997987908, -0.08967683756765857, 0.13441773406281826, 0.1772965474075146, 0.2024353388696909, -0.14954025109999636, 0.07422904140090968, -0.03453979488420353, 0.1576371579064747, 0.049509429409472124, -0.02793470856451084, 0.09347401389831238, 0.16562045823908253, 0.10979768870335617, 0.1954867276088387, -0.07188699356269802, -0.12827566178159766, -0.3461288189452686, -0.21567766457973336, -0.20087994244786794, -0.00908696511237139, -0.10046744440764639, -0.1685892404004764, 0.43004872615114276, 0.19773991985162825, 0.14187689392377487, 0.08468700979909535, 0.3182887667737734, 0.23049941634775004, 0.026332762257818634, 0.041596664508197746, 0.14009080969812243, 0.1313448048332769, 0.08496536867002423, -0.24446205866622497, 0.056718247813294285, 0.15399201609863994] |
1,803.03971 | Generalised fluxes, Yang-Baxter deformations and the O(d,d) structure of
non-abelian T-duality | Based on the construction of Poisson-Lie T-dual $\sigma$-models from a common
parent action we study a candidate for the non-abelian respectively Poisson-Lie
T-duality group. This group generalises the well-known abelian T-duality group
O(d,d) and we explore some of its subgroups, namely factorised dualities, B-
and $\beta$-shifts. The corresponding duality transformed $\sigma$-models are
constructed and interpreted as generalised (non-geometric) flux backgrounds.
We also comment on generalisations of results and techniques known from
abelian T-duality. This includes the Lie algebra cohomology interpretation of
the corresponding non-geometric flux backgrounds, remarks on a double field
theory based on non-abelian T-duality and an application to the investigation
of Yang-Baxter deformations. This will show that homogeneously Yang-Baxter
deformed $\sigma$-models are exactly the non-abelian T-duality $\beta$-shifts
when applied to principal chiral models.
| hep-th math-ph math.MP | based on the construction of poissonlie tdual sigmamodels from a common parent action we study a candidate for the nonabelian respectively poissonlie tduality group this group generalises the wellknown abelian tduality group odd and we explore some of its subgroups namely factorised dualities b and betashifts the corresponding duality transformed sigmamodels are constructed and interpreted as generalised nongeometric flux backgrounds we also comment on generalisations of results and techniques known from abelian tduality this includes the lie algebra cohomology interpretation of the corresponding nongeometric flux backgrounds remarks on a double field theory based on nonabelian tduality and an application to the investigation of yangbaxter deformations this will show that homogeneously yangbaxter deformed sigmamodels are exactly the nonabelian tduality betashifts when applied to principal chiral models | [['based', 'on', 'the', 'construction', 'of', 'poissonlie', 'tdual', 'sigmamodels', 'from', 'a', 'common', 'parent', 'action', 'we', 'study', 'a', 'candidate', 'for', 'the', 'nonabelian', 'respectively', 'poissonlie', 'tduality', 'group', 'this', 'group', 'generalises', 'the', 'wellknown', 'abelian', 'tduality', 'group', 'odd', 'and', 'we', 'explore', 'some', 'of', 'its', 'subgroups', 'namely', 'factorised', 'dualities', 'b', 'and', 'betashifts', 'the', 'corresponding', 'duality', 'transformed', 'sigmamodels', 'are', 'constructed', 'and', 'interpreted', 'as', 'generalised', 'nongeometric', 'flux', 'backgrounds', 'we', 'also', 'comment', 'on', 'generalisations', 'of', 'results', 'and', 'techniques', 'known', 'from', 'abelian', 'tduality', 'this', 'includes', 'the', 'lie', 'algebra', 'cohomology', 'interpretation', 'of', 'the', 'corresponding', 'nongeometric', 'flux', 'backgrounds', 'remarks', 'on', 'a', 'double', 'field', 'theory', 'based', 'on', 'nonabelian', 'tduality', 'and', 'an', 'application', 'to', 'the', 'investigation', 'of', 'yangbaxter', 'deformations', 'this', 'will', 'show', 'that', 'homogeneously', 'yangbaxter', 'deformed', 'sigmamodels', 'are', 'exactly', 'the', 'nonabelian', 'tduality', 'betashifts', 'when', 'applied', 'to', 'principal', 'chiral', 'models']] | [-0.15236131959781052, 0.12941339981474448, -0.07733013183623552, 0.1446045173415914, -0.18991656178981065, -0.16762622330337762, -0.012665079419501126, 0.3559665996655822, -0.22745133230090142, -0.21660731158964336, 0.1061755856666714, -0.24843678990006446, -0.22521319760009648, 0.15475378327071668, -0.1718859022036195, -0.035295925315935166, 0.0037290269546210765, 0.10042118402570487, -0.1809583999067545, -0.2762604746967554, 0.35205809589847925, -0.022078545305877925, 0.3243876797128469, -0.042487850986421105, 0.11429884339123965, 0.006812684264034033, -0.08010039526224136, -0.025675572119653226, -0.13475051973975496, 0.09274094222765415, 0.2625016741095169, 0.0192303780131042, 0.003069867055863142, -0.41174650240316985, -0.17631912700994873, 0.10066983094159514, 0.14848691941332073, 0.11393775982409715, -0.026867187205702067, -0.3840050872117281, 0.011800765234977006, -0.20280708712525666, -0.14379946467280388, -0.1384587367400527, 0.05292423787806183, -0.04259511495009065, -0.15819167404295878, 0.014772804727545007, 0.06830603887327015, 0.08393845857493579, -0.09519297285471112, -0.09857158308289946, -0.11666326259076595, 0.018819363693939523, 0.09653375371266157, 0.03361833098717034, 0.15831474936380982, -0.14307288024015724, -0.21339787772297858, 0.3760532700270414, -0.02735124813951552, -0.24079723369330167, 0.1198177510239184, -0.09675211188197136, -0.297604941368103, 0.06708647848665714, 0.056869514279067515, 0.1518298463486135, -0.08071855790785049, 0.2276476830295287, -0.1103145189359784, 0.04109615961369127, 0.07645050281286239, -0.0004957367470487952, 0.21820867596007884, 0.0714350495096296, 0.021943656377494337, 0.15934556358866395, 0.015450841534882784, -0.06773004011809826, -0.4607621769187972, -0.11274164204508998, -0.03288413671404123, 0.1799879092578776, -0.09405013912369031, -0.18096829622983931, 0.37956643402576445, 0.11973324232175946, 0.10696951913274824, 0.06400393223948776, 0.11643288899958133, 0.05946360581647605, 0.07968714276468382, 0.024177213887218385, 0.14207466293335894, 0.2972260830774903, -0.05892012796923518, -0.23643166420189662, -0.2406378602795303, 0.26723998195677995] |
1,803.03972 | Magnetic properties of RCoO$_3$ cobaltites (R = La, Pr, Nd, Sm, Eu).
Effects of hydrostatic and chemical pressure | We have investigated the temperature dependence of the magnetic
susceptibility $\chi(T)$ of rare-earth cobaltites RCoO$_3$ (R= La, Pr, Nd, Sm,
Eu) in the temperature range $4.2-300$ K and also the influence of hydrostatic
pressure up to 2 kbar on their susceptibility at fixed temperatures $T=78 $ and
300 K. The specific dependence $\chi(T)$ observed in LaCoO$_3$ and the
anomalously large pressure effect (d ln $\chi$/d$P\sim -100$ Mbar$^{-1}$ for $T
= 78$ K) are analyzed in the framework of a two-level model with energy levels
difference $\Delta$. The ground state of the system is assumed to be
nonmagnetic with the zero spin of Co$^{3+}$ ions, and magnetism at a finite
temperature is determined by the excited magnetic spin state. The results of
the analysis, supplemented by theoretical calculations of the electronic
structure of LaCoO$_3$, indicate a significant increase in $\Delta$ with a
decrease in the unit cell volume under the hydrostatic pressure. In the series
of RCoO$_3$ (R= Pr, Nd, Sm, Eu) compounds, the volume of crystal cell decreases
monotonically due to a decrease in the radius of R$^{3+}$ ions. This leads to
an increase in the relative energy $\Delta$ of the excited state (the chemical
pressure effect), which manifests itself in a decrease in the contribution of
cobalt ions to the magnetic susceptibility at a fixed temperature, and also in
a decrease in the hydrostatic pressure effect on the susceptibility of RCoO$_3$
compounds, which we have observed at $T=300$ K.
| cond-mat.str-el | we have investigated the temperature dependence of the magnetic susceptibility chit of rareearth cobaltites rcoo_3 r la pr nd sm eu in the temperature range 42300 k and also the influence of hydrostatic pressure up to 2 kbar on their susceptibility at fixed temperatures t78 and 300 k the specific dependence chit observed in lacoo_3 and the anomalously large pressure effect d ln chidpsim 100 mbar1 for t 78 k are analyzed in the framework of a twolevel model with energy levels difference delta the ground state of the system is assumed to be nonmagnetic with the zero spin of co3 ions and magnetism at a finite temperature is determined by the excited magnetic spin state the results of the analysis supplemented by theoretical calculations of the electronic structure of lacoo_3 indicate a significant increase in delta with a decrease in the unit cell volume under the hydrostatic pressure in the series of rcoo_3 r pr nd sm eu compounds the volume of crystal cell decreases monotonically due to a decrease in the radius of r3 ions this leads to an increase in the relative energy delta of the excited state the chemical pressure effect which manifests itself in a decrease in the contribution of cobalt ions to the magnetic susceptibility at a fixed temperature and also in a decrease in the hydrostatic pressure effect on the susceptibility of rcoo_3 compounds which we have observed at t300 k | [['we', 'have', 'investigated', 'the', 'temperature', 'dependence', 'of', 'the', 'magnetic', 'susceptibility', 'chit', 'of', 'rareearth', 'cobaltites', 'rcoo_3', 'r', 'la', 'pr', 'nd', 'sm', 'eu', 'in', 'the', 'temperature', 'range', '42300', 'k', 'and', 'also', 'the', 'influence', 'of', 'hydrostatic', 'pressure', 'up', 'to', '2', 'kbar', 'on', 'their', 'susceptibility', 'at', 'fixed', 'temperatures', 't78', 'and', '300', 'k', 'the', 'specific', 'dependence', 'chit', 'observed', 'in', 'lacoo_3', 'and', 'the', 'anomalously', 'large', 'pressure', 'effect', 'd', 'ln', 'chidpsim', '100', 'mbar1', 'for', 't', '78', 'k', 'are', 'analyzed', 'in', 'the', 'framework', 'of', 'a', 'twolevel', 'model', 'with', 'energy', 'levels', 'difference', 'delta', 'the', 'ground', 'state', 'of', 'the', 'system', 'is', 'assumed', 'to', 'be', 'nonmagnetic', 'with', 'the', 'zero', 'spin', 'of', 'co3', 'ions', 'and', 'magnetism', 'at', 'a', 'finite', 'temperature', 'is', 'determined', 'by', 'the', 'excited', 'magnetic', 'spin', 'state', 'the', 'results', 'of', 'the', 'analysis', 'supplemented', 'by', 'theoretical', 'calculations', 'of', 'the', 'electronic', 'structure', 'of', 'lacoo_3', 'indicate', 'a', 'significant', 'increase', 'in', 'delta', 'with', 'a', 'decrease', 'in', 'the', 'unit', 'cell', 'volume', 'under', 'the', 'hydrostatic', 'pressure', 'in', 'the', 'series', 'of', 'rcoo_3', 'r', 'pr', 'nd', 'sm', 'eu', 'compounds', 'the', 'volume', 'of', 'crystal', 'cell', 'decreases', 'monotonically', 'due', 'to', 'a', 'decrease', 'in', 'the', 'radius', 'of', 'r3', 'ions', 'this', 'leads', 'to', 'an', 'increase', 'in', 'the', 'relative', 'energy', 'delta', 'of', 'the', 'excited', 'state', 'the', 'chemical', 'pressure', 'effect', 'which', 'manifests', 'itself', 'in', 'a', 'decrease', 'in', 'the', 'contribution', 'of', 'cobalt', 'ions', 'to', 'the', 'magnetic', 'susceptibility', 'at', 'a', 'fixed', 'temperature', 'and', 'also', 'in', 'a', 'decrease', 'in', 'the', 'hydrostatic', 'pressure', 'effect', 'on', 'the', 'susceptibility', 'of', 'rcoo_3', 'compounds', 'which', 'we', 'have', 'observed', 'at', 't300', 'k']] | [-0.1490855751508053, 0.22955526949358634, 0.00029252027947345615, -0.02343661370706835, 0.02686395727388781, -0.09699165214733359, 0.13749728793571095, 0.323581193125795, -0.2631220230953041, -0.31847236514924576, 0.0024258574286184983, -0.38188750511781955, -0.013141817000659205, 0.12570498892958845, 0.06533586277866163, -0.023639833460314365, -0.06961943350638015, 0.08260304880017053, -0.11556086748865932, -0.2327149219315829, 0.25545612396475886, 0.07232089052644837, 0.2772191589470277, 0.1134290408924171, 0.030728030275899272, -0.04928879709108752, 0.12095487156081237, 0.07137131594396039, -0.14806996409305792, 0.007028453060885584, 0.21939643400717324, -0.02750420370944756, 0.21446759566637189, -0.3788275029117297, -0.1986134006516057, 0.028297934435575194, 0.08209838460097364, 0.0811273133203403, -0.05575714040083913, -0.2148880228392371, 0.08338376012815453, -0.13715369339402617, -0.15087730114010284, -0.074881798225231, 0.012215559492143115, -0.0010720151820404747, -0.2858922757350305, 0.1453273986868525, 0.05765871350071516, 0.17347365194994377, -0.13711762172661188, -0.2053026139096628, -0.0846639333355716, 0.02692979480481789, 0.08100076968033056, 0.09418349932949943, 0.16440267838097575, -0.05800796351749214, -0.020339065553612597, 0.3575755593087917, -0.11483044901033589, -0.053908779971937174, 0.13414697371924764, -0.24397019722070623, -0.09364262207807632, 0.18839249367538824, 0.14415246697076653, 0.10249442189641077, -0.10351259182015717, 0.11728899429904942, 0.011017133490151022, 0.20859160283305347, 0.04109773484455571, 0.02045029985218875, 0.1956019070940603, 0.15912098095669777, 0.009397089418479661, 0.13385960647152573, -0.12429445789230964, -0.03285144112379396, -0.2273295615182773, -0.17924336673748847, -0.16566098320301825, 0.03780783133685416, -0.11410513522494181, -0.1594386174803293, 0.3362576932831027, 0.1116592035578384, 0.20228176489806407, -0.05629824068031828, 0.21817678757422537, 0.0997769107355909, 0.07943146273332652, 0.07450959267328544, 0.22555460265242272, 0.20777766644671747, 0.1795652268949566, -0.3656676726117101, 0.08803192123904321, -0.023594342592616373] |
1,803.03973 | Gorenstein stable log surfaces with $(K_X+\Lambda)^2=p_g(X,\Lambda)-1$ | In this paper, we will give a complete classification of Gorenstein stable
log surfaces $(X,\Lambda)$ with $(K_X+\Lambda)^2=p_g(X,\Lambda)-1$, where
$p_g(X,\Lambda):=h^0(X,K_X+\Lambda)$. In particular, we classify Gorenstein
stable surfaces with $K_X^2=p_g-1$.
| math.AG | in this paper we will give a complete classification of gorenstein stable log surfaces xlambda with k_xlambda2p_gxlambda1 where p_gxlambdah0xk_xlambda in particular we classify gorenstein stable surfaces with k_x2p_g1 | [['in', 'this', 'paper', 'we', 'will', 'give', 'a', 'complete', 'classification', 'of', 'gorenstein', 'stable', 'log', 'surfaces', 'xlambda', 'with', 'k_xlambda2p_gxlambda1', 'where', 'p_gxlambdah0xk_xlambda', 'in', 'particular', 'we', 'classify', 'gorenstein', 'stable', 'surfaces', 'with', 'k_x2p_g1']] | [-0.15681213177740574, 0.0011322935670614242, -0.08014551199972629, 0.04176038262899965, -0.003657033499330282, -0.2611449068598449, -0.053007654282264415, 0.42425303146243093, -0.28278724912554026, -0.16407083824276925, 0.09907296775840223, -0.2537395615875721, -0.1759835044667125, 0.13161776047199963, -0.2926648712530732, -0.04544358514249325, 0.040052433907985685, 0.05699555769562721, -0.14476228050887585, -0.4687366817891598, 0.44670173823833464, -0.040863282904028894, 0.189371728124097, 0.05006688453257084, 0.07218524038791657, 0.021151111386716367, 0.034611419439315796, 0.057660330273211005, -0.322584553770721, 0.16555707208812237, 0.39654418647289275, 0.0018311632424592972, 0.12141988411545754, -0.3607210997119546, -0.09101584250107407, 0.2577170252799988, 0.17096562588587402, 0.06733229205012321, -0.05940437212586403, -0.16122003987431527, 0.1739429786428809, -0.13752676421776414, -0.18067062622867525, -0.13499603547155858, 0.07414491653442383, 0.021019468382000923, -0.22494822226464747, 0.03334872495383024, 0.09436859201639891, 0.14576373301446438, -0.0665735175460577, 0.00048750996589660647, -0.09252312287688255, 0.008202490489929914, -0.07689711943268776, -0.021673678159713744, -0.010745131932199002, -0.09463545688427985, -0.09276650123298168, 0.34871619686484334, -0.113545111566782, -0.19907355457544326, 0.1898660415224731, -0.19715704515576363, -0.14740573398768902, 0.13283907905220985, 0.14954100631177425, 0.2942779462039471, -0.029470386616885662, 0.14204191606491803, -0.11475211590528488, 0.0750808496773243, 0.12249962370842696, -0.01564678058028221, 0.13648712761700155, 0.25944828561507166, 0.09909502603113651, 0.13626646503806114, -0.07415690045803786, 0.05671421382576227, -0.3739818650484085, -0.2554601638764143, -0.036720057651400566, 0.16233598105609418, -0.02604684643447399, -0.22290752619504928, 0.41414138436317444, 0.07123667992651463, 0.26637960769236085, 0.13031975098885595, 0.21616891607642175, -0.04690164394676685, -0.061773724518716336, 0.12965573534369468, 0.1562502466328442, 0.10569116592407227, -0.041355794966220855, -0.024385393224656583, -0.06072264635935426, 0.1370088164880872] |
1,803.03974 | Formality conjecture for K3 surfaces | We give a proof of the formality conjecture of Kaledin and Lehn: on a complex
projective K3 surface, the DG algebra RHom(F,F) is formal for any sheaf F
polystable with respect to an ample line bundle. Our main tool is the
uniqueness of DG enhancement of the bounded derived category of coherent
sheaves. We also extend the formality result to derived objects that are
polystable with respect to a generic Bridgeland stability condition.
| math.AG | we give a proof of the formality conjecture of kaledin and lehn on a complex projective k3 surface the dg algebra rhomff is formal for any sheaf f polystable with respect to an ample line bundle our main tool is the uniqueness of dg enhancement of the bounded derived category of coherent sheaves we also extend the formality result to derived objects that are polystable with respect to a generic bridgeland stability condition | [['we', 'give', 'a', 'proof', 'of', 'the', 'formality', 'conjecture', 'of', 'kaledin', 'and', 'lehn', 'on', 'a', 'complex', 'projective', 'k3', 'surface', 'the', 'dg', 'algebra', 'rhomff', 'is', 'formal', 'for', 'any', 'sheaf', 'f', 'polystable', 'with', 'respect', 'to', 'an', 'ample', 'line', 'bundle', 'our', 'main', 'tool', 'is', 'the', 'uniqueness', 'of', 'dg', 'enhancement', 'of', 'the', 'bounded', 'derived', 'category', 'of', 'coherent', 'sheaves', 'we', 'also', 'extend', 'the', 'formality', 'result', 'to', 'derived', 'objects', 'that', 'are', 'polystable', 'with', 'respect', 'to', 'a', 'generic', 'bridgeland', 'stability', 'condition']] | [-0.22066637348487145, -0.04317328965549273, -0.11118256779284114, 0.07456557076592515, -0.15297213972856602, -0.17389992049558917, -0.03970065988445034, 0.3521605858501668, -0.3407175319734961, -0.2025264543820716, 0.09193764593348736, -0.14919829835869475, -0.12830575654515997, 0.22285958762384123, -0.25007670498841134, -0.03130423762680342, 0.07792504081670712, 0.03634781532713936, -0.06372579837463693, -0.26203329109800205, 0.504691993817687, -0.007336336485524144, 0.24971050002043033, 0.12725529060440344, 0.11918038981578623, -0.03568633601147061, 0.001023522707530194, -0.062217769976187914, -0.1659611831246366, 0.19601460641974378, 0.3093588832351897, 0.05172830607949032, 0.15478215238706777, -0.3314862049301155, -0.10374398080360454, 0.18828372723267725, 0.08351100554419746, 0.030236344422317214, -0.014573368859904198, -0.3041062780862881, 0.17842624376579705, -0.1647955224875154, -0.18437570859936792, -0.09190433800944851, 0.08832065771437353, 0.026342327072699036, -0.23589085776539934, -0.06279987315105649, 0.12749992991383705, 0.16510917668023872, -0.13613522548176762, -0.0424541395299861, -0.17517500525476257, 0.01660136804760744, -0.009649143741828285, 0.09092196967685595, 0.10280938979445232, -0.07286985299368906, -0.10703649333057304, 0.3555922226773368, -0.10242226919055814, -0.2484521167870197, 0.15460766209677482, -0.11841811740628651, -0.14954824353076723, 0.15785673808487546, 0.009781053212160865, 0.23171361427133283, 0.07969237078860816, 0.16652972703498867, -0.15941783934572917, 0.10357830950265957, 0.08106262871297076, -0.0018587375202009247, 0.07870717872800823, 0.13004111958434805, 0.09735250897938386, 0.09787057801279136, -0.0016078920614543473, -0.032911519164271236, -0.4008469587166069, -0.23935376662282376, -0.05683548444519854, 0.18119288654997945, -0.10176593740450496, -0.17179007292725146, 0.388210872207613, 0.08130514818347162, 0.2050658708386537, 0.1879408261609367, 0.24637501091799802, 0.055692906654763244, -0.005036039827650206, -0.024967473621169727, 0.186245020530704, 0.3058511213813391, -0.007732487199569328, -0.09348504039614151, -0.003930307478488733, 0.22599471979447117] |
1,803.03975 | Another generalization of the box-ball system with many kinds of balls | A cellular automaton that is a generalization of the box-ball system with
either many kinds of balls or finite carrier capacity is proposed and studied
through two discrete integrable systems: nonautonomous discrete KP lattice and
nonautonomous discrete two-dimensional Toda lattice. Applying reduction
technique and ultradiscretization procedure to these discrete systems, we
derive two types of time evolution equations of the proposed cellular
automaton, and particular solutions to the ultradiscrete equations.
| nlin.SI math-ph math.MP | a cellular automaton that is a generalization of the boxball system with either many kinds of balls or finite carrier capacity is proposed and studied through two discrete integrable systems nonautonomous discrete kp lattice and nonautonomous discrete twodimensional toda lattice applying reduction technique and ultradiscretization procedure to these discrete systems we derive two types of time evolution equations of the proposed cellular automaton and particular solutions to the ultradiscrete equations | [['a', 'cellular', 'automaton', 'that', 'is', 'a', 'generalization', 'of', 'the', 'boxball', 'system', 'with', 'either', 'many', 'kinds', 'of', 'balls', 'or', 'finite', 'carrier', 'capacity', 'is', 'proposed', 'and', 'studied', 'through', 'two', 'discrete', 'integrable', 'systems', 'nonautonomous', 'discrete', 'kp', 'lattice', 'and', 'nonautonomous', 'discrete', 'twodimensional', 'toda', 'lattice', 'applying', 'reduction', 'technique', 'and', 'ultradiscretization', 'procedure', 'to', 'these', 'discrete', 'systems', 'we', 'derive', 'two', 'types', 'of', 'time', 'evolution', 'equations', 'of', 'the', 'proposed', 'cellular', 'automaton', 'and', 'particular', 'solutions', 'to', 'the', 'ultradiscrete', 'equations']] | [-0.17507143727852964, 0.09891788584313223, -0.04634451802287783, 0.05985660690348595, -0.05471345303314073, -0.21966488385306937, 0.034181876799889974, 0.2989159905501375, -0.34899051966079114, -0.17349058009151902, 0.151292135872479, -0.2512515185666936, -0.2261462576620813, 0.17897045129377928, -0.044712767191231254, 0.16295794724885906, 0.059057046611061585, -0.007137453499516206, -0.08011836771121515, -0.27547269432938526, 0.2996325169157769, -0.06571328081855816, 0.2959735785344882, -0.02943376151711813, 0.1613328988065145, 0.005302692879922688, -0.013648233336529562, 0.010078671714290976, -0.13333003264571225, 0.06844882740240012, 0.252084751347346, 0.04964566363154777, 0.2110916736668774, -0.4401257088673966, -0.2819047371590776, 0.1553697666951588, 0.16871417824711119, 0.13019033377724035, -0.021593517740257084, -0.29584182063117626, 0.07372374291132604, -0.18491007000473994, -0.1745199333144618, -0.048861103717769895, 0.030046045154865298, 0.11812131862555231, -0.24994690559272256, 0.0469184379442595, 0.10952749229701501, 0.07840633537458157, -0.15663738627918064, -0.05922636436797413, -0.07161797663596059, 0.06438579384037958, -0.03169704684987664, -0.05160305345031832, 0.030695921591749147, -0.01728076837690813, -0.1758464018947312, 0.43466436729899477, -0.048411170043982564, -0.31121356447360343, 0.23190469421762308, -0.05686086017106261, -0.14600795934508953, 0.14977432252573117, 0.1671012258157134, 0.051585599953042606, -0.19634446609499198, 0.10553526561374643, -0.09171078604246889, 0.1532197916248281, 0.09153401300843272, 0.02575665309892169, 0.1292107256129384, 0.18401288543827832, 0.07210853470938414, 0.15069551531757627, 0.01984363458385425, -0.23386376997056815, -0.24089310246386697, -0.13718317180838702, -0.15011955409177713, 0.08521425298282079, -0.07725461363443173, -0.1927608887931066, 0.3938328726749335, 0.08588211630870189, 0.08409857100674084, 0.10300700697116554, 0.1943622225895524, 0.22234491016050534, 0.01588728411921433, 0.010965287465868251, 0.027835494918482643, 0.1948858903720975, 0.12392556745159838, -0.28887272624997423, -0.11332070436328649, 0.2676943059445226] |
1,803.03976 | Entanglement-assisted private communication over quantum broadcast
channels | We consider entanglement-assisted (EA) private communication over a quantum
broadcast channel, in which there is a single sender and multiple receivers. We
divide the receivers into two sets: the decoding set and the malicious set. The
decoding set and the malicious set can either be disjoint or can have a finite
intersection. For simplicity, we say that a single party Bob has access to the
decoding set and another party Eve has access to the malicious set, and both
Eve and Bob have access to the pre-shared entanglement with Alice. The goal of
the task is for Alice to communicate classical information reliably to Bob and
securely against Eve, and Bob can take advantage of pre-shared entanglement
with Alice. In this framework, we establish a lower bound on the one-shot EA
private capacity. When there exists a quantum channel mapping the state of the
decoding set to the state of the malicious set, such a broadcast channel is
said to be degraded. We establish an upper bound on the one-shot EA private
capacity in terms of smoothed min- and max-entropies for such channels. In the
limit of a large number of independent channel uses, we prove that the EA
private capacity of a degraded quantum broadcast channel is given by a
single-letter formula. Finally, we consider two specific examples of degraded
broadcast channels and find their capacities. In the first example, we consider
the scenario in which one part of Bob's laboratory is compromised by Eve. We
show that the capacity for this protocol is given by the conditional quantum
mutual information of a quantum broadcast channel, and so we thus provide an
operational interpretation to the dynamic counterpart of the conditional
quantum mutual information. In the second example, Eve and Bob have access to
mutually exclusive sets of outputs of a broadcast channel.
| quant-ph | we consider entanglementassisted ea private communication over a quantum broadcast channel in which there is a single sender and multiple receivers we divide the receivers into two sets the decoding set and the malicious set the decoding set and the malicious set can either be disjoint or can have a finite intersection for simplicity we say that a single party bob has access to the decoding set and another party eve has access to the malicious set and both eve and bob have access to the preshared entanglement with alice the goal of the task is for alice to communicate classical information reliably to bob and securely against eve and bob can take advantage of preshared entanglement with alice in this framework we establish a lower bound on the oneshot ea private capacity when there exists a quantum channel mapping the state of the decoding set to the state of the malicious set such a broadcast channel is said to be degraded we establish an upper bound on the oneshot ea private capacity in terms of smoothed min and maxentropies for such channels in the limit of a large number of independent channel uses we prove that the ea private capacity of a degraded quantum broadcast channel is given by a singleletter formula finally we consider two specific examples of degraded broadcast channels and find their capacities in the first example we consider the scenario in which one part of bobs laboratory is compromised by eve we show that the capacity for this protocol is given by the conditional quantum mutual information of a quantum broadcast channel and so we thus provide an operational interpretation to the dynamic counterpart of the conditional quantum mutual information in the second example eve and bob have access to mutually exclusive sets of outputs of a broadcast channel | [['we', 'consider', 'entanglementassisted', 'ea', 'private', 'communication', 'over', 'a', 'quantum', 'broadcast', 'channel', 'in', 'which', 'there', 'is', 'a', 'single', 'sender', 'and', 'multiple', 'receivers', 'we', 'divide', 'the', 'receivers', 'into', 'two', 'sets', 'the', 'decoding', 'set', 'and', 'the', 'malicious', 'set', 'the', 'decoding', 'set', 'and', 'the', 'malicious', 'set', 'can', 'either', 'be', 'disjoint', 'or', 'can', 'have', 'a', 'finite', 'intersection', 'for', 'simplicity', 'we', 'say', 'that', 'a', 'single', 'party', 'bob', 'has', 'access', 'to', 'the', 'decoding', 'set', 'and', 'another', 'party', 'eve', 'has', 'access', 'to', 'the', 'malicious', 'set', 'and', 'both', 'eve', 'and', 'bob', 'have', 'access', 'to', 'the', 'preshared', 'entanglement', 'with', 'alice', 'the', 'goal', 'of', 'the', 'task', 'is', 'for', 'alice', 'to', 'communicate', 'classical', 'information', 'reliably', 'to', 'bob', 'and', 'securely', 'against', 'eve', 'and', 'bob', 'can', 'take', 'advantage', 'of', 'preshared', 'entanglement', 'with', 'alice', 'in', 'this', 'framework', 'we', 'establish', 'a', 'lower', 'bound', 'on', 'the', 'oneshot', 'ea', 'private', 'capacity', 'when', 'there', 'exists', 'a', 'quantum', 'channel', 'mapping', 'the', 'state', 'of', 'the', 'decoding', 'set', 'to', 'the', 'state', 'of', 'the', 'malicious', 'set', 'such', 'a', 'broadcast', 'channel', 'is', 'said', 'to', 'be', 'degraded', 'we', 'establish', 'an', 'upper', 'bound', 'on', 'the', 'oneshot', 'ea', 'private', 'capacity', 'in', 'terms', 'of', 'smoothed', 'min', 'and', 'maxentropies', 'for', 'such', 'channels', 'in', 'the', 'limit', 'of', 'a', 'large', 'number', 'of', 'independent', 'channel', 'uses', 'we', 'prove', 'that', 'the', 'ea', 'private', 'capacity', 'of', 'a', 'degraded', 'quantum', 'broadcast', 'channel', 'is', 'given', 'by', 'a', 'singleletter', 'formula', 'finally', 'we', 'consider', 'two', 'specific', 'examples', 'of', 'degraded', 'broadcast', 'channels', 'and', 'find', 'their', 'capacities', 'in', 'the', 'first', 'example', 'we', 'consider', 'the', 'scenario', 'in', 'which', 'one', 'part', 'of', 'bobs', 'laboratory', 'is', 'compromised', 'by', 'eve', 'we', 'show', 'that', 'the', 'capacity', 'for', 'this', 'protocol', 'is', 'given', 'by', 'the', 'conditional', 'quantum', 'mutual', 'information', 'of', 'a', 'quantum', 'broadcast', 'channel', 'and', 'so', 'we', 'thus', 'provide', 'an', 'operational', 'interpretation', 'to', 'the', 'dynamic', 'counterpart', 'of', 'the', 'conditional', 'quantum', 'mutual', 'information', 'in', 'the', 'second', 'example', 'eve', 'and', 'bob', 'have', 'access', 'to', 'mutually', 'exclusive', 'sets', 'of', 'outputs', 'of', 'a', 'broadcast', 'channel']] | [-0.21401987805055747, 0.0696099630188799, -0.0928435682757194, 0.057968967683049606, -0.03572278901609886, -0.3122525455148302, 0.15727776903383384, 0.34702141067674874, -0.2979772049982689, -0.2592988086616012, 0.08550540936879483, -0.31108910054210454, -0.07727080360774907, 0.1321267885574152, -0.14108787992230837, 0.08636007125575193, 0.05108258240522302, 0.12832235474237869, 0.0188043121134366, -0.3030960893964603, 0.31289276375288244, 0.0477810724076239, 0.2571936738662005, 0.03885622308466976, 0.08934002362902423, 0.06553350190944529, 0.002411346401602618, -0.05326518799785462, -0.10679365814880121, 0.05657062397681569, 0.2967517925120008, 0.2395551274532265, 0.27836332897851734, -0.39156767674170334, -0.21031760858788498, 0.15426257557517506, 0.1083359139581597, 0.1315935836816942, -0.029939557384319703, -0.31833423126341875, 0.11220927127272405, -0.23361089921902595, 0.036560581257186926, -0.006385538282828699, -0.05474671824087732, -0.03351415511784389, -0.3375652093213591, -0.015486086378682797, 0.042085430598633955, 0.043984319204690495, 0.01410489867052284, -0.04548488215981419, 0.03934576582143659, 0.23886644315270564, -0.044511978165246546, 0.018592464817246718, 0.08088094667178475, -0.1114259867294765, -0.16489035561742066, 0.29349176637754826, -0.016263508144651207, -0.20898085339056133, 0.15916626932199793, -0.13731378988761303, -0.08531183764678549, 0.10562789304209505, 0.20984938015738552, 0.06962913805986509, -0.16400294208779087, 0.03961467244861476, -0.09242609539069235, 0.20028573122966153, 0.06939234741194493, 0.1672035515581037, 0.15605433101422692, 0.07971155121355734, 0.10719975026586326, 0.20528103986036608, -0.0905439714107687, -0.13649631179961083, -0.2917204505955803, -0.20364583023604754, -0.257911565542025, 0.06908947426611696, -0.06107634595173295, -0.08137172373857252, 0.34650807968634917, 0.1334551970486772, 0.16406828411900756, 0.06553208577296525, 0.38040278072424516, 0.04612263983596533, 0.022988926918754402, 0.2034360886270741, 0.20683351058764138, 0.1219757286591247, 0.05841381465564298, -0.1719570397254804, 0.1175383773056398, -0.0073128499421536135] |
1,803.03977 | Orbital Fingerprint of Topological Fermi Arcs in a Weyl Semimetal | The monopnictides TaAs and TaP are well-established Weyl semimetals. Yet, a
precise assignment of Fermi arcs, accomodating the predicted chiral charge of
the bulk Weyl points, has been difficult in these systems, and the topological
character of different surface features in the Fermi surface is not fully
understood. Here, employing a joint analysis from linear dichroism in
angle-resolved photoemission and first-principles calculations, we unveil the
orbital texture on the full Fermi surface of TaP(001). We observe pronounced
switches in the orbital texture at the projectedWeyl nodes, and show how they
facilitate a topological classification of the surface band structure. Our
findings establish a critical role of the orbital degrees of freedom in
mediating the surface-bulk connectivity in Weyl semimetals.
| cond-mat.str-el | the monopnictides taas and tap are wellestablished weyl semimetals yet a precise assignment of fermi arcs accomodating the predicted chiral charge of the bulk weyl points has been difficult in these systems and the topological character of different surface features in the fermi surface is not fully understood here employing a joint analysis from linear dichroism in angleresolved photoemission and firstprinciples calculations we unveil the orbital texture on the full fermi surface of tap001 we observe pronounced switches in the orbital texture at the projectedweyl nodes and show how they facilitate a topological classification of the surface band structure our findings establish a critical role of the orbital degrees of freedom in mediating the surfacebulk connectivity in weyl semimetals | [['the', 'monopnictides', 'taas', 'and', 'tap', 'are', 'wellestablished', 'weyl', 'semimetals', 'yet', 'a', 'precise', 'assignment', 'of', 'fermi', 'arcs', 'accomodating', 'the', 'predicted', 'chiral', 'charge', 'of', 'the', 'bulk', 'weyl', 'points', 'has', 'been', 'difficult', 'in', 'these', 'systems', 'and', 'the', 'topological', 'character', 'of', 'different', 'surface', 'features', 'in', 'the', 'fermi', 'surface', 'is', 'not', 'fully', 'understood', 'here', 'employing', 'a', 'joint', 'analysis', 'from', 'linear', 'dichroism', 'in', 'angleresolved', 'photoemission', 'and', 'firstprinciples', 'calculations', 'we', 'unveil', 'the', 'orbital', 'texture', 'on', 'the', 'full', 'fermi', 'surface', 'of', 'tap001', 'we', 'observe', 'pronounced', 'switches', 'in', 'the', 'orbital', 'texture', 'at', 'the', 'projectedweyl', 'nodes', 'and', 'show', 'how', 'they', 'facilitate', 'a', 'topological', 'classification', 'of', 'the', 'surface', 'band', 'structure', 'our', 'findings', 'establish', 'a', 'critical', 'role', 'of', 'the', 'orbital', 'degrees', 'of', 'freedom', 'in', 'mediating', 'the', 'surfacebulk', 'connectivity', 'in', 'weyl', 'semimetals']] | [-0.24064549199170154, 0.16077040689479974, -0.10046801801659486, 0.04553729444085501, -0.09530299008847812, -0.1356157041990604, 0.13064443494758418, 0.3749816827157624, -0.27163860640830845, -0.2980621926104411, -0.02774995346712824, -0.3365507100064021, -0.22140210761258808, 0.14241310188290066, 0.013743772159497708, 0.06516627581296568, -0.010787107655380527, -0.024219370546599485, -0.1700754866300501, -0.20492998818452987, 0.32201951928436756, 0.01860400075172512, 0.31820243838617307, 0.09753770110571486, 0.02180776459714159, 0.013337969724248108, 0.04759533939341831, 0.024532847850718815, -0.1254789334996484, 0.10969904016576007, 0.2765362451515164, -0.09051795558243766, 0.16637760457487252, -0.45395236084253615, -0.24681988506554028, -0.026779060466931418, 0.11973593355769403, 0.13756765988774788, -0.06542646420948431, -0.30490967337615216, 0.06750144323127137, -0.1436364058381281, -0.132111478692446, -0.1378898047364484, -0.027892918640381504, -0.05030086029939847, -0.11973731141611058, 0.08328995501829518, 0.03837918634546331, 0.14695045735002207, -0.10264257596418636, -0.107112120765333, -0.15279830985654813, 0.09877030556607577, 0.04491367916831285, 0.0010787942745269109, 0.08266640468460755, -0.13054417391431034, -0.14763537510775793, 0.4040760131409535, -0.011959409325296043, -0.12810722613532063, 0.18805139529733703, -0.20567233812235072, -0.13677996405973458, 0.14193591273700198, 0.13724635125129905, 0.11013786646842949, -0.10022910258535725, 0.10289495532862587, -0.056476659701916225, 0.12566228054412124, 0.0017255467529862355, 0.0958299219258066, 0.33379102999774307, 0.1695849903437317, 0.053049691268203095, 0.04866239247429702, -0.18745170295453414, 0.019259573090284202, -0.23708350330782244, -0.19953350720003757, -0.28478524084083545, 0.011537415422344955, -0.019520452910234243, -0.1927763871753063, 0.4900028738571315, 0.10273667423225716, 0.207580189117127, -0.06097474992155838, 0.21229182988102746, 0.08233991750559777, 0.09731026338492958, 0.06950367058619347, 0.2719466967177856, 0.1343760370499749, 0.07015545111951521, -0.2975934753851153, 0.06292893522235955, 0.04379432063756718] |
1,803.03978 | Approximate Range Queries for Clustering | We study the approximate range searching for three variants of the clustering
problem with a set $P$ of $n$ points in $d$-dimensional Euclidean space and
axis-parallel rectangular range queries: the $k$-median, $k$-means, and
$k$-center range-clustering query problems. We present data structures and
query algorithms that compute $(1+\varepsilon)$-approximations to the optimal
clusterings of $P\cap Q$ efficiently for a query consisting of an orthogonal
range $Q$, an integer $k$, and a value $\varepsilon>0$.
| cs.CG | we study the approximate range searching for three variants of the clustering problem with a set p of n points in ddimensional euclidean space and axisparallel rectangular range queries the kmedian kmeans and kcenter rangeclustering query problems we present data structures and query algorithms that compute 1varepsilonapproximations to the optimal clusterings of pcap q efficiently for a query consisting of an orthogonal range q an integer k and a value varepsilon0 | [['we', 'study', 'the', 'approximate', 'range', 'searching', 'for', 'three', 'variants', 'of', 'the', 'clustering', 'problem', 'with', 'a', 'set', 'p', 'of', 'n', 'points', 'in', 'ddimensional', 'euclidean', 'space', 'and', 'axisparallel', 'rectangular', 'range', 'queries', 'the', 'kmedian', 'kmeans', 'and', 'kcenter', 'rangeclustering', 'query', 'problems', 'we', 'present', 'data', 'structures', 'and', 'query', 'algorithms', 'that', 'compute', '1varepsilonapproximations', 'to', 'the', 'optimal', 'clusterings', 'of', 'pcap', 'q', 'efficiently', 'for', 'a', 'query', 'consisting', 'of', 'an', 'orthogonal', 'range', 'q', 'an', 'integer', 'k', 'and', 'a', 'value', 'varepsilon0']] | [-0.17509668338781512, 0.010518368107715989, -0.017054496785547112, 0.06437547120567359, -0.07440819264665036, -0.15169864644388287, 0.1199086699995514, 0.39625122472250335, -0.3264409336228658, -0.34354490102072, 0.06362823555475547, -0.32911306796726625, -0.07814039824150083, 0.1486013531291359, -0.026011149398982525, 0.12487076049749281, 0.043186513520121365, 0.03384843866773684, -0.07749462993749955, -0.2958034605942142, 0.28388175738214605, -0.046423374098056636, 0.1948438210832611, -0.018879489776429156, 0.07390780315544246, 0.05550232012821755, 0.0333706035842778, 0.06880092536202553, -0.1870519100942749, 0.11099439499814483, 0.346104018049131, 0.22861797273368903, 0.2902282594217801, -0.3120243342029272, -0.11001846453988216, 0.2222437422302827, 0.17571069469386844, 0.022526813041366323, -0.018213943060172696, -0.2430635817401426, 0.1220561774368857, -0.052814093474167545, -0.05225470472573185, -0.05416986468234952, 0.1370295586562912, -0.015077760853004498, -0.37256923942288883, -0.02910321837448528, 0.053490626829853415, 0.005488046635152169, -0.07380234533273221, -0.16832833502336708, 0.12995461656869403, 0.05299210464450675, -0.05955079725195824, 0.10049208383154597, 0.06555651230606395, -0.07345616088156968, -0.22453759580483318, 0.42863018800255276, 0.013298767782800215, -0.20096012167829339, 0.08851637344964793, -0.093319493568909, -0.12867425052895093, 0.11657778318630348, 0.24036498042479368, 0.1989751326995836, -0.0699375627404997, 0.178579697769109, -0.1323723142546877, 0.15415309896876275, 0.12500017773832234, -0.0029392456242316204, 0.12258540364113492, 0.14042074792087078, 0.14983113520962357, 0.18129980687583258, -0.07667720147316724, -0.048368762404671015, -0.2583016051687825, -0.11372345335729106, -0.23312356712585183, -0.03840421485832669, -0.27549677932369326, -0.23990329672438157, 0.3315044115166324, 0.11543325591884868, 0.25824049382772246, 0.14986056988914562, 0.2529573550998745, 0.03277606283446518, -0.02573940277912877, 0.173844551365875, 0.033957696942822406, 0.015325017352129372, 0.04668584491559107, -0.1903353341868226, -0.026026638421479245, 0.10783035424210026] |
1,803.03979 | Stability results for projective modules over Rees algebras | We provide a class of commutative Noetherian domains $R$ of dimension $d$
such that every finitely generated projective $R$-module $P$ of rank $d$ splits
off a free summand of rank one. On this class, we also show that $P$ is
cancellative. At the end we give some applications to the number of generators
of a module over the Rees algebras.
| math.AC math.KT | we provide a class of commutative noetherian domains r of dimension d such that every finitely generated projective rmodule p of rank d splits off a free summand of rank one on this class we also show that p is cancellative at the end we give some applications to the number of generators of a module over the rees algebras | [['we', 'provide', 'a', 'class', 'of', 'commutative', 'noetherian', 'domains', 'r', 'of', 'dimension', 'd', 'such', 'that', 'every', 'finitely', 'generated', 'projective', 'rmodule', 'p', 'of', 'rank', 'd', 'splits', 'off', 'a', 'free', 'summand', 'of', 'rank', 'one', 'on', 'this', 'class', 'we', 'also', 'show', 'that', 'p', 'is', 'cancellative', 'at', 'the', 'end', 'we', 'give', 'some', 'applications', 'to', 'the', 'number', 'of', 'generators', 'of', 'a', 'module', 'over', 'the', 'rees', 'algebras']] | [-0.2177979617845267, 0.06617441638372838, -0.06931864089953403, 0.006834396968285242, -0.051348069411081575, -0.21772258583611498, -0.052033578619981806, 0.3678745158016682, -0.4119051001966, -0.13743053233871858, 0.0814868306585898, -0.2649619545321912, -0.08005280210636556, 0.21984106398498018, -0.11810618478339166, -0.09329380900599063, 0.060324374629029384, 0.17782417184644145, -0.06118415423746531, -0.3539430205399791, 0.41456167901245256, -0.048952468597174933, 0.17662484712588292, 0.052536156649390854, 0.11511907249223441, 0.051346756106552975, -0.018881298306708535, 0.04152056934932868, -0.1753371472094538, 0.09905311755525568, 0.3605730644737681, 0.12679494040009257, 0.2740290509226421, -0.32984935016284, -0.09918925952321539, 0.2660945365826289, 0.11170785089489073, -0.0018620197350780168, -0.041382000799058, -0.18772936022529998, 0.18436562681260207, -0.27769872869054474, -0.13563229132754107, -0.054410242925708494, 0.1522687270034415, -0.03548157180969914, -0.304244150283436, -0.04661377549297564, 0.12563015641644598, 0.16105474753615756, -0.030622816050890834, -0.10938941122343143, -0.06535221728651473, 0.022605396067956463, -0.039432617699882634, -0.017040993055949607, 0.11464276509262467, -0.030197236248447248, -0.1357041272179534, 0.3179522869409993, -0.00889271916821599, -0.21608993289992212, 0.17190041657304392, -0.2199243275836731, -0.14080044475073616, 0.14094424325351915, 0.07634498731543621, 0.16751475456888631, 0.060689993544171254, 0.24886039358874162, -0.20383661319501697, 0.09990705968812108, 0.11595301739871502, 0.029701102323209248, 0.12757163125400742, 0.10091321212239564, 0.10073926136052856, 0.13684383945461984, 0.022646874162213258, 0.11428191456943751, -0.41211766190826893, -0.19981874303581815, -0.15831250503348807, 0.1860055798199028, -0.08509228245044748, -0.14795242610077064, 0.4545089669525623, 0.11770592213918765, 0.17233436616758505, 0.11715561652866503, 0.22296250435368467, -0.009982323848331968, 0.05955597137411436, 0.08740693225990981, 0.019567342624941374, 0.18883418145899972, -0.03245186852485252, -0.09021316388777147, -0.02735091159120202, 0.22175804489913087] |
1,803.0398 | Spectral methods for the spin-2 equation near the cylinder at spatial
infinity | We solve, numerically, the massless spin-2 equations, written in terms of a
gauge based on the properties of conformal geodesics, in a neighbourhood of
spatial infinity using spectral methods in both space and time. This strategy
allows us to compute the solutions to these equations up to the critical sets
where null infinity intersects with spatial infinity. Moreover, we use the
convergence rates of the numerical solutions to read-off their regularity
properties.
| gr-qc | we solve numerically the massless spin2 equations written in terms of a gauge based on the properties of conformal geodesics in a neighbourhood of spatial infinity using spectral methods in both space and time this strategy allows us to compute the solutions to these equations up to the critical sets where null infinity intersects with spatial infinity moreover we use the convergence rates of the numerical solutions to readoff their regularity properties | [['we', 'solve', 'numerically', 'the', 'massless', 'spin2', 'equations', 'written', 'in', 'terms', 'of', 'a', 'gauge', 'based', 'on', 'the', 'properties', 'of', 'conformal', 'geodesics', 'in', 'a', 'neighbourhood', 'of', 'spatial', 'infinity', 'using', 'spectral', 'methods', 'in', 'both', 'space', 'and', 'time', 'this', 'strategy', 'allows', 'us', 'to', 'compute', 'the', 'solutions', 'to', 'these', 'equations', 'up', 'to', 'the', 'critical', 'sets', 'where', 'null', 'infinity', 'intersects', 'with', 'spatial', 'infinity', 'moreover', 'we', 'use', 'the', 'convergence', 'rates', 'of', 'the', 'numerical', 'solutions', 'to', 'readoff', 'their', 'regularity', 'properties']] | [-0.1180915664234716, 0.047780322221418224, -0.11892475202007012, 0.06224001002879555, -0.09340149344643578, -0.09205821544552843, 0.030923227068140276, 0.3332249003514234, -0.2433736489361359, -0.21501437773177814, 0.09505530295589576, -0.29268596872720487, -0.10752889959581403, 0.14544901890783674, -0.020896314138857026, 0.12453503776891416, 0.027031800454197865, 0.059359911505857274, -0.12777126213768497, -0.28191786093844307, 0.35464801186592215, 0.016030705598596897, 0.2670274911344879, 0.01733742746162332, 0.14865380338596879, -0.039414940233756274, 0.005337956536095589, 0.026953367994590534, -0.2000342717898699, 0.11762208349278404, 0.22478831870830618, 0.12181338920426141, 0.2548042285747619, -0.44138564609198105, -0.16637744039245364, 0.11369811527482751, 0.2172829926195037, 0.10988364652601174, 0.016650198772873007, -0.274558523440242, 0.12169437071618934, -0.07154331555486554, -0.2416532695206115, -0.10777859462218152, -0.04307727771811187, 0.03721789958783322, -0.24487112537543806, 0.04530706466822368, 0.01781011479356999, 0.019062533172675304, -0.11371754378989055, -0.03237911065419515, -0.028218292275495414, 0.10969484556699172, 0.14992739244027892, -0.028509063963105694, 0.04826340491288445, -0.11069826037661794, -0.10278705983526176, 0.36116032544264776, -0.1080697282175404, -0.3301315694116056, 0.22953927485569794, -0.19383927354485625, -0.11374079271788812, 0.11924529144178247, 0.2022583292823078, 0.2103368536465698, -0.1340543847763911, 0.18585984040126075, 0.006850123146755828, 0.10898134781099442, 0.1326623595216208, 0.028534157059362367, 0.15146761579025123, 0.08446118200663477, 0.09001475603630145, 0.14888753020204604, -0.0586266238856802, -0.10510959513744132, -0.35520440914357704, -0.16914954989786363, -0.1292282075026176, 0.0801966003750244, -0.1689358755051621, -0.19282174934798807, 0.41041308413130334, 0.19941446949875777, 0.193140810329674, 0.10620079333117853, 0.2404969995841384, 0.1488199468391637, 0.04414298946843095, 0.12974400904365918, 0.18931295286812302, 0.16463780549303111, 0.1188851238936574, -0.23587842712489268, -0.05011128113579212, 0.1572461851950114] |
1,803.03981 | A Simple Algorithm for Estimating Distribution Parameters from
$n$-Dimensional Randomized Binary Responses | Randomized response is attractive for privacy preserving data collection
because the provided privacy can be quantified by means such as differential
privacy. However, recovering and analyzing statistics involving multiple
dependent randomized binary attributes can be difficult, posing a significant
barrier to use. In this work, we address this problem by identifying and
analyzing a family of response randomizers that change each binary attribute
independently with the same probability. Modes of Google's Rappor randomizer as
well as applications of two well-known classical randomized response methods,
Warner's original method and Simmons' unrelated question method, belong to this
family. We show that randomizers in this family transform multinomial
distribution parameters by an iterated Kronecker product of an invertible and
bisymmetric $2 \times 2$ matrix. This allows us to present a simple and
efficient algorithm for obtaining unbiased maximum likelihood parameter
estimates for $k$-way marginals from randomized responses and provide
theoretical bounds on the statistical efficiency achieved. We also describe the
efficiency - differential privacy tradeoff. Importantly, both randomization of
responses and the estimation algorithm are simple to implement, an aspect
critical to technologies for privacy protection and security.
| cs.CR | randomized response is attractive for privacy preserving data collection because the provided privacy can be quantified by means such as differential privacy however recovering and analyzing statistics involving multiple dependent randomized binary attributes can be difficult posing a significant barrier to use in this work we address this problem by identifying and analyzing a family of response randomizers that change each binary attribute independently with the same probability modes of googles rappor randomizer as well as applications of two wellknown classical randomized response methods warners original method and simmons unrelated question method belong to this family we show that randomizers in this family transform multinomial distribution parameters by an iterated kronecker product of an invertible and bisymmetric 2 times 2 matrix this allows us to present a simple and efficient algorithm for obtaining unbiased maximum likelihood parameter estimates for kway marginals from randomized responses and provide theoretical bounds on the statistical efficiency achieved we also describe the efficiency differential privacy tradeoff importantly both randomization of responses and the estimation algorithm are simple to implement an aspect critical to technologies for privacy protection and security | [['randomized', 'response', 'is', 'attractive', 'for', 'privacy', 'preserving', 'data', 'collection', 'because', 'the', 'provided', 'privacy', 'can', 'be', 'quantified', 'by', 'means', 'such', 'as', 'differential', 'privacy', 'however', 'recovering', 'and', 'analyzing', 'statistics', 'involving', 'multiple', 'dependent', 'randomized', 'binary', 'attributes', 'can', 'be', 'difficult', 'posing', 'a', 'significant', 'barrier', 'to', 'use', 'in', 'this', 'work', 'we', 'address', 'this', 'problem', 'by', 'identifying', 'and', 'analyzing', 'a', 'family', 'of', 'response', 'randomizers', 'that', 'change', 'each', 'binary', 'attribute', 'independently', 'with', 'the', 'same', 'probability', 'modes', 'of', 'googles', 'rappor', 'randomizer', 'as', 'well', 'as', 'applications', 'of', 'two', 'wellknown', 'classical', 'randomized', 'response', 'methods', 'warners', 'original', 'method', 'and', 'simmons', 'unrelated', 'question', 'method', 'belong', 'to', 'this', 'family', 'we', 'show', 'that', 'randomizers', 'in', 'this', 'family', 'transform', 'multinomial', 'distribution', 'parameters', 'by', 'an', 'iterated', 'kronecker', 'product', 'of', 'an', 'invertible', 'and', 'bisymmetric', '2', 'times', '2', 'matrix', 'this', 'allows', 'us', 'to', 'present', 'a', 'simple', 'and', 'efficient', 'algorithm', 'for', 'obtaining', 'unbiased', 'maximum', 'likelihood', 'parameter', 'estimates', 'for', 'kway', 'marginals', 'from', 'randomized', 'responses', 'and', 'provide', 'theoretical', 'bounds', 'on', 'the', 'statistical', 'efficiency', 'achieved', 'we', 'also', 'describe', 'the', 'efficiency', 'differential', 'privacy', 'tradeoff', 'importantly', 'both', 'randomization', 'of', 'responses', 'and', 'the', 'estimation', 'algorithm', 'are', 'simple', 'to', 'implement', 'an', 'aspect', 'critical', 'to', 'technologies', 'for', 'privacy', 'protection', 'and', 'security']] | [-0.08227735992646369, 0.014869301019683659, -0.048912220334257586, 0.10274245783933464, -0.10481499523799764, -0.19514913791205346, 0.09110017334274208, 0.36798178459532926, -0.31093827502221844, -0.33831776951851905, 0.10398827360235562, -0.2586158254188441, -0.16895970438042138, 0.20977560589548017, -0.1369377493303615, 0.12380498431399058, 0.032007366999006664, -0.006716786052801397, -0.050022285768146435, -0.27348195751263793, 0.3117489706434798, 0.05635034327288387, 0.30362111506834144, 0.0017146439141405574, 0.09219317085076571, 0.05665725775449817, -0.037995008604163355, 0.029672485966454235, -0.10705856293545785, 0.1322571650125809, 0.28907401574765396, 0.19921747813652693, 0.31007995623637175, -0.37025660719172876, -0.1439673771745846, 0.11979606904374446, 0.1537145323296907, 0.10563902760209526, -0.07983065423838122, -0.2611477142161705, 0.06317592034869589, -0.17730423267243706, -0.07717890317088676, -0.1453511985286032, 0.0036243094777678206, 0.010066776563759506, -0.34099908478435925, 0.07119675451502219, 0.05279630937173332, 0.056894148842436695, -0.009186311359351877, -0.11913064840285341, 0.0426739958544959, 0.11537904569419874, 0.02617985891086645, -0.0101192762911106, 0.11519440783752648, -0.09252420553200894, -0.15938006522505457, 0.3185433534974655, -0.025923194853548225, -0.2251006083723916, 0.13130726104429186, -0.06906458051732736, -0.15758812161355884, 0.10508928991121982, 0.20622675446093672, 0.10448475571888718, -0.1805191294804134, 0.04521993640301332, -0.03455871025156332, 0.15976274044308914, 0.06390268774830375, 0.03665823367286901, 0.14019069064133724, 0.14305979911526767, 0.09550772594603521, 0.14193894501515955, -0.044701784127773564, -0.0836395137877168, -0.2265113022867361, -0.1584456494546246, -0.1718721123542026, 0.03951331173054508, -0.1260414205496632, -0.161903977999082, 0.38579301705171704, 0.17411319254560376, 0.22140960014155492, 0.10143718164149529, 0.32214937582383024, 0.11799667293493397, 0.019023761897197736, 0.0877206507024401, 0.17589084387761975, 0.09263937522229723, 0.0586610694124511, -0.18285346889227141, 0.15186829888134626, 0.03894399289379553] |
1,803.03982 | Coexisting partial dynamical symmetries and multiple shapes | We present an algebraic procedure for constructing Hamiltonians with several
distinct partial dynamical symmetries (PDSs), of relevance to shape-coexistence
phenomena. The procedure relies on a spectrum generating algebra encompassing
several dynamical symmetry (DS) chains and a coherent state which assigns a
particular shape to each chain. The PDS Hamiltonian maintains the DS
solvability and quantum numbers in selected bands, associated with each shape,
and mixes other states. The procedure is demonstrated for a variety of multiple
quadrupole shapes in the framework of the interacting boson model of nuclei.
| nucl-th quant-ph | we present an algebraic procedure for constructing hamiltonians with several distinct partial dynamical symmetries pdss of relevance to shapecoexistence phenomena the procedure relies on a spectrum generating algebra encompassing several dynamical symmetry ds chains and a coherent state which assigns a particular shape to each chain the pds hamiltonian maintains the ds solvability and quantum numbers in selected bands associated with each shape and mixes other states the procedure is demonstrated for a variety of multiple quadrupole shapes in the framework of the interacting boson model of nuclei | [['we', 'present', 'an', 'algebraic', 'procedure', 'for', 'constructing', 'hamiltonians', 'with', 'several', 'distinct', 'partial', 'dynamical', 'symmetries', 'pdss', 'of', 'relevance', 'to', 'shapecoexistence', 'phenomena', 'the', 'procedure', 'relies', 'on', 'a', 'spectrum', 'generating', 'algebra', 'encompassing', 'several', 'dynamical', 'symmetry', 'ds', 'chains', 'and', 'a', 'coherent', 'state', 'which', 'assigns', 'a', 'particular', 'shape', 'to', 'each', 'chain', 'the', 'pds', 'hamiltonian', 'maintains', 'the', 'ds', 'solvability', 'and', 'quantum', 'numbers', 'in', 'selected', 'bands', 'associated', 'with', 'each', 'shape', 'and', 'mixes', 'other', 'states', 'the', 'procedure', 'is', 'demonstrated', 'for', 'a', 'variety', 'of', 'multiple', 'quadrupole', 'shapes', 'in', 'the', 'framework', 'of', 'the', 'interacting', 'boson', 'model', 'of', 'nuclei']] | [-0.16180382976943458, 0.1313769646884876, -0.09684214446778325, 0.06398123829355674, -0.07383782175284895, -0.15845970770566387, 0.019253473533105782, 0.35612073210491374, -0.2626605649605732, -0.26725045244463463, 0.04794886940825646, -0.25765411727215076, -0.10817952897526663, 0.18113249057469974, 0.010270179519218138, 0.06337750042174858, 0.03764223462415182, 0.04488585761282593, -0.08407676250631498, -0.15330316039299677, 0.3398437700975178, -0.004217625713367438, 0.27615579402878543, -0.037568511224394155, 0.11973012302240188, 0.06309680361829867, 0.019440321436956187, -0.010374133670914241, -0.08903872697952796, 0.11901152354800036, 0.2243345710819333, 0.1117017294428396, 0.2202151117909869, -0.37272209650836885, -0.1938898463727541, 0.09668510038913651, 0.1326276620599277, 0.15261166691859465, -0.05474883603297216, -0.3146419634365223, 0.05113868217449635, -0.2001887008293786, -0.15007306237451054, -0.10506779249011412, 0.007522866055792706, -0.0004783537667456337, -0.26859921642409806, 0.04128970386227593, 0.042494239229364954, 0.063128377038414, -0.09015941757983952, -0.10144344515786295, -0.06803624730144459, 0.07935801904585044, 0.018497827448300086, -0.02674282018481542, 0.11706250979147047, -0.10460154110015454, -0.17188946416453374, 0.38350666549310763, 0.017817629490640353, -0.19898713811893354, 0.18648113896878468, -0.07958757561970163, -0.20381749877494507, 0.14629457133229484, 0.12709297341379253, 0.13260972645895724, -0.11585434374369057, 0.11509449479754866, -0.02878355536218309, 0.14953019067814405, 0.00931778537448157, 0.07605022295716811, 0.2068096806337549, 0.1484617134159304, 0.03726634661540051, 0.15532324536219344, -0.06017146395871267, -0.17160164372233505, -0.31365369336576393, -0.11545506377429278, -0.13628484594466334, 0.020941661316266454, -0.0755005338179961, -0.1957938103851947, 0.47748881605961785, 0.08332903981732381, 0.2296685986591249, 0.03325843000228898, 0.20399482461454516, 0.10840313764162023, 0.04093882802937349, 0.02882256326053969, 0.15495582625523888, 0.1738583517911717, 0.005628171731421555, -0.2358652126647278, -0.01919008571845056, 0.10432679109825668] |
1,803.03983 | Void growth and coalescence in irradiated copper under deformation | A decrease of fracture toughness of irradiated materials is usually observed,
as reported for austenitic stainless steels in Light Water Reactors (LWRs) or
copper alloys for fusion applications. For a wide range of applications (e.g.
structural steels irradiated at low homologous temperature), void growth and
coalescence fracture mechanism has been shown to be still predominant. As a
consequence, a comprehensive study of the effects of irradiation-induced
hardening mechanisms on void growth and coalescence in irradiated materials is
required. The effects of irradiation on ductile fracture mechanisms - void
growth to coalescence - are assessed in this study based on model experiments.
Pure copper thin tensile samples have been irradiated with protons up to 0.01
dpa. Micron-scale holes drilled through the thickness of these samples
subjected to uniaxial loading conditions allow a detailed description of void
growth and coalescence. In this study, experimental data show that physical
mechanisms of micron-scale void growth and coalescence are similar between the
unirradiated and irradiated copper. However, an acceleration of void growth is
observed in the later case, resulting in earlier coalescence, which is
consistent with the decrease of fracture toughness reported in irradiated
materials. These results are qualitatively reproduced with numerical
simulations accounting for irradiation macroscopic hardening and decrease of
strain-hardening capability.
| cond-mat.mtrl-sci | a decrease of fracture toughness of irradiated materials is usually observed as reported for austenitic stainless steels in light water reactors lwrs or copper alloys for fusion applications for a wide range of applications eg structural steels irradiated at low homologous temperature void growth and coalescence fracture mechanism has been shown to be still predominant as a consequence a comprehensive study of the effects of irradiationinduced hardening mechanisms on void growth and coalescence in irradiated materials is required the effects of irradiation on ductile fracture mechanisms void growth to coalescence are assessed in this study based on model experiments pure copper thin tensile samples have been irradiated with protons up to 001 dpa micronscale holes drilled through the thickness of these samples subjected to uniaxial loading conditions allow a detailed description of void growth and coalescence in this study experimental data show that physical mechanisms of micronscale void growth and coalescence are similar between the unirradiated and irradiated copper however an acceleration of void growth is observed in the later case resulting in earlier coalescence which is consistent with the decrease of fracture toughness reported in irradiated materials these results are qualitatively reproduced with numerical simulations accounting for irradiation macroscopic hardening and decrease of strainhardening capability | [['a', 'decrease', 'of', 'fracture', 'toughness', 'of', 'irradiated', 'materials', 'is', 'usually', 'observed', 'as', 'reported', 'for', 'austenitic', 'stainless', 'steels', 'in', 'light', 'water', 'reactors', 'lwrs', 'or', 'copper', 'alloys', 'for', 'fusion', 'applications', 'for', 'a', 'wide', 'range', 'of', 'applications', 'eg', 'structural', 'steels', 'irradiated', 'at', 'low', 'homologous', 'temperature', 'void', 'growth', 'and', 'coalescence', 'fracture', 'mechanism', 'has', 'been', 'shown', 'to', 'be', 'still', 'predominant', 'as', 'a', 'consequence', 'a', 'comprehensive', 'study', 'of', 'the', 'effects', 'of', 'irradiationinduced', 'hardening', 'mechanisms', 'on', 'void', 'growth', 'and', 'coalescence', 'in', 'irradiated', 'materials', 'is', 'required', 'the', 'effects', 'of', 'irradiation', 'on', 'ductile', 'fracture', 'mechanisms', 'void', 'growth', 'to', 'coalescence', 'are', 'assessed', 'in', 'this', 'study', 'based', 'on', 'model', 'experiments', 'pure', 'copper', 'thin', 'tensile', 'samples', 'have', 'been', 'irradiated', 'with', 'protons', 'up', 'to', '001', 'dpa', 'micronscale', 'holes', 'drilled', 'through', 'the', 'thickness', 'of', 'these', 'samples', 'subjected', 'to', 'uniaxial', 'loading', 'conditions', 'allow', 'a', 'detailed', 'description', 'of', 'void', 'growth', 'and', 'coalescence', 'in', 'this', 'study', 'experimental', 'data', 'show', 'that', 'physical', 'mechanisms', 'of', 'micronscale', 'void', 'growth', 'and', 'coalescence', 'are', 'similar', 'between', 'the', 'unirradiated', 'and', 'irradiated', 'copper', 'however', 'an', 'acceleration', 'of', 'void', 'growth', 'is', 'observed', 'in', 'the', 'later', 'case', 'resulting', 'in', 'earlier', 'coalescence', 'which', 'is', 'consistent', 'with', 'the', 'decrease', 'of', 'fracture', 'toughness', 'reported', 'in', 'irradiated', 'materials', 'these', 'results', 'are', 'qualitatively', 'reproduced', 'with', 'numerical', 'simulations', 'accounting', 'for', 'irradiation', 'macroscopic', 'hardening', 'and', 'decrease', 'of', 'strainhardening', 'capability']] | [-0.03708125809150771, 0.19471096952577838, -0.062490372988963275, -0.004864290239652846, -0.015984166463519016, -0.09882182241985348, 0.0112692115351376, 0.4266199730927261, -0.18910689973726688, -0.3337669590806089, 0.05337408837101354, -0.3130794103643516, -0.08390142425962883, 0.20210265659034343, -0.008041192175502457, 0.08163558466405403, 0.04606755706822363, -0.09798338309089404, -0.05363260401276553, -0.23452273259598125, 0.22809605981427722, 0.11610333614233063, 0.3584374514340264, 0.08929345238862968, 0.009837416314701664, -0.06371100545213444, 0.05047703137189695, 0.048168283746373365, -0.21655790662842309, 0.024722450970751573, 0.23861437460362184, -0.02340170094379928, 0.19576347286744816, -0.5014395886805, -0.3005007915198803, 0.023927811896655618, 0.10532666185733056, 0.08751010686874662, -0.13701571154964678, -0.1732791221166802, 0.09575167741263058, -0.14629276072515585, -0.11235239737121978, -0.002667768245063177, 0.037725466664698795, 0.04676364753168167, -0.2587803757513828, 0.13189483912684385, 0.061963512950644985, 0.09626863656065814, -0.1317276154599357, -0.1103361127898097, -0.07586706444030492, 0.027862016472215877, 0.09070168579985365, -0.0023322993077383174, 0.26753180390678166, -0.10234746514342544, -0.05796510133006406, 0.41107267183592405, 0.03481868056171551, -0.07183807777558884, 0.23860518032934788, -0.18301431866385406, -0.09524601106645494, 0.21785181972266335, 0.21346521158134793, 0.08209832163822905, -0.17144586520224084, -0.032590531394674965, 0.05207358166211989, 0.1469465215133912, 0.13765936613923346, -0.029896193522414783, 0.23026759064551897, 0.31589128293392316, -0.07015755386318921, 0.15915348000296323, -0.082449856701466, -0.007149738611698877, -0.24365231791147735, -0.14000437025707668, -0.1657566561511286, 0.06432310117681216, -0.10218664999645226, -0.21873624061174668, 0.3292636425802257, 0.08952298338678324, 0.17488151083291487, -0.021296816775234553, 0.21181333531867272, -0.00370970661695138, 0.09163003428952723, -0.012443731732030467, 0.30025088956761287, 0.1551037630588725, 0.08069599218582792, -0.22918706653503382, 0.18295985510254778, -0.04294405237930577] |
1,803.03984 | Tuning turbine rotor design for very large wind farms | A new theoretical method is presented for future multi-scale aerodynamic
optimisation of very large wind farms. The new method combines a recent
two-scale coupled momentum analysis of ideal wind turbine arrays with the
classical blade-element-momentum (BEM) theory for turbine rotor design, making
it possible to explore some potentially important relationships between the
design of rotors and their performance in a very large wind farm. The details
of the original two-scale momentum model are described first, followed by the
new coupling procedure with the classical BEM theory and some example
solutions. The example solutions, obtained using a simplified but still
realistic NREL S809 airfoil performance curve, illustrate how the
aerodynamically optimal rotor design may change depending on the farm density.
It is also shown that the peak power of the rotors designed optimally for a
given farm (i.e. 'tuned' rotors) could be noticeably higher than that of the
rotors designed for a different farm (i.e. 'untuned' rotors) even if the blade
pitch angle is allowed to be adjusted optimally during the operation. The
results presented are for ideal very large wind farms and a possible future
extension of the present work for real large wind farms is also discussed
briefly.
| physics.flu-dyn | a new theoretical method is presented for future multiscale aerodynamic optimisation of very large wind farms the new method combines a recent twoscale coupled momentum analysis of ideal wind turbine arrays with the classical bladeelementmomentum bem theory for turbine rotor design making it possible to explore some potentially important relationships between the design of rotors and their performance in a very large wind farm the details of the original twoscale momentum model are described first followed by the new coupling procedure with the classical bem theory and some example solutions the example solutions obtained using a simplified but still realistic nrel s809 airfoil performance curve illustrate how the aerodynamically optimal rotor design may change depending on the farm density it is also shown that the peak power of the rotors designed optimally for a given farm ie tuned rotors could be noticeably higher than that of the rotors designed for a different farm ie untuned rotors even if the blade pitch angle is allowed to be adjusted optimally during the operation the results presented are for ideal very large wind farms and a possible future extension of the present work for real large wind farms is also discussed briefly | [['a', 'new', 'theoretical', 'method', 'is', 'presented', 'for', 'future', 'multiscale', 'aerodynamic', 'optimisation', 'of', 'very', 'large', 'wind', 'farms', 'the', 'new', 'method', 'combines', 'a', 'recent', 'twoscale', 'coupled', 'momentum', 'analysis', 'of', 'ideal', 'wind', 'turbine', 'arrays', 'with', 'the', 'classical', 'bladeelementmomentum', 'bem', 'theory', 'for', 'turbine', 'rotor', 'design', 'making', 'it', 'possible', 'to', 'explore', 'some', 'potentially', 'important', 'relationships', 'between', 'the', 'design', 'of', 'rotors', 'and', 'their', 'performance', 'in', 'a', 'very', 'large', 'wind', 'farm', 'the', 'details', 'of', 'the', 'original', 'twoscale', 'momentum', 'model', 'are', 'described', 'first', 'followed', 'by', 'the', 'new', 'coupling', 'procedure', 'with', 'the', 'classical', 'bem', 'theory', 'and', 'some', 'example', 'solutions', 'the', 'example', 'solutions', 'obtained', 'using', 'a', 'simplified', 'but', 'still', 'realistic', 'nrel', 's809', 'airfoil', 'performance', 'curve', 'illustrate', 'how', 'the', 'aerodynamically', 'optimal', 'rotor', 'design', 'may', 'change', 'depending', 'on', 'the', 'farm', 'density', 'it', 'is', 'also', 'shown', 'that', 'the', 'peak', 'power', 'of', 'the', 'rotors', 'designed', 'optimally', 'for', 'a', 'given', 'farm', 'ie', 'tuned', 'rotors', 'could', 'be', 'noticeably', 'higher', 'than', 'that', 'of', 'the', 'rotors', 'designed', 'for', 'a', 'different', 'farm', 'ie', 'untuned', 'rotors', 'even', 'if', 'the', 'blade', 'pitch', 'angle', 'is', 'allowed', 'to', 'be', 'adjusted', 'optimally', 'during', 'the', 'operation', 'the', 'results', 'presented', 'are', 'for', 'ideal', 'very', 'large', 'wind', 'farms', 'and', 'a', 'possible', 'future', 'extension', 'of', 'the', 'present', 'work', 'for', 'real', 'large', 'wind', 'farms', 'is', 'also', 'discussed', 'briefly']] | [-0.130848430726455, 0.129526168595808, -0.049292002312914675, 0.06330170338916673, -0.09052585628885908, -0.19558929640009082, 0.0020715869031846523, 0.3579019779235427, -0.26398763054660357, -0.3211790870704929, 0.12525707914264694, -0.2211897531618851, -0.14326555462232626, 0.282676574290697, -0.07693513103425124, 0.09837201983297982, 0.11839201441684709, -0.016044469521886807, -0.01809671073431045, -0.18892579835125714, 0.23891622392191234, 0.14360409059507423, 0.27043415079848265, 0.012014193578533412, 0.135641136161775, -0.04714225954257973, 0.019235595975657403, 0.04974129779245421, -0.12185849459272476, 0.11739839603657584, 0.22174355537195686, 0.08442268789708048, 0.2637727303042781, -0.4454984124418972, -0.17255527833488482, 0.03835833251658297, 0.1166574663865536, 0.06331235859874011, -0.05458105251672891, -0.21348028195558616, 0.048798608103752854, -0.24472811929337907, -0.17299437099301876, -0.0870817587332715, 0.003577880606263271, 0.07632877777767338, -0.29400435776501743, 0.005483868801056261, 0.009925952240314126, 0.061792201916852654, -0.030495987940924764, -0.11318041983197637, -0.03572013723867269, 0.10211490995255369, 0.046040266141801275, 0.0022379062965814838, 0.1717218133558278, -0.12775441568030452, -0.0543341816510523, 0.4028726189307452, 0.0020529302942145825, -0.22247544832073796, 0.18718483811480746, -0.15172586092006812, -0.09034949152962055, 0.09945434281900337, 0.19721029538762883, 0.09941220938979747, -0.15921469116678016, 0.011007383060713976, -0.03284821258491463, 0.16751648725109733, 0.037880473402636075, -0.06655300607335125, 0.22050899761932227, 0.2187153047886157, 0.07730202188036939, 0.16112516547888894, -0.1094277726030119, -0.11490196108565132, -0.27667811045867535, -0.10054729925113999, -0.15861652175503485, -0.00894963098536269, -0.1312910897257947, -0.13707906296456038, 0.4121144425814149, 0.18513861837499032, 0.13772405271281293, 0.024622499890776757, 0.3267006429767964, 0.11272915434163196, 0.053134148448485845, 0.10744758647379613, 0.2632939393982542, 0.0838615614318095, 0.14027966429871805, -0.23573308388660025, 0.06902238882446973, 0.04298928551148945] |
1,803.03985 | Regularity for diffuse reflection boundary problem to the stationary
linearized Boltzmann equation in a convex domain | We investigate the regularity issue for the diffuse reflection boundary
problem to the stationary linearized Boltzmann equation for hard sphere
potential, cutoff hard potential, or cutoff Maxwellian molecular gases in a
strictly convex bounded domain. We obtain pointwise estimates for first
derivatives of the solution provided the boundary temperature is bounded
differentiable and the solution is bounded. This result can be understood as a
stationary version of the velocity averaging lemma and mixture lemma.
| math.AP | we investigate the regularity issue for the diffuse reflection boundary problem to the stationary linearized boltzmann equation for hard sphere potential cutoff hard potential or cutoff maxwellian molecular gases in a strictly convex bounded domain we obtain pointwise estimates for first derivatives of the solution provided the boundary temperature is bounded differentiable and the solution is bounded this result can be understood as a stationary version of the velocity averaging lemma and mixture lemma | [['we', 'investigate', 'the', 'regularity', 'issue', 'for', 'the', 'diffuse', 'reflection', 'boundary', 'problem', 'to', 'the', 'stationary', 'linearized', 'boltzmann', 'equation', 'for', 'hard', 'sphere', 'potential', 'cutoff', 'hard', 'potential', 'or', 'cutoff', 'maxwellian', 'molecular', 'gases', 'in', 'a', 'strictly', 'convex', 'bounded', 'domain', 'we', 'obtain', 'pointwise', 'estimates', 'for', 'first', 'derivatives', 'of', 'the', 'solution', 'provided', 'the', 'boundary', 'temperature', 'is', 'bounded', 'differentiable', 'and', 'the', 'solution', 'is', 'bounded', 'this', 'result', 'can', 'be', 'understood', 'as', 'a', 'stationary', 'version', 'of', 'the', 'velocity', 'averaging', 'lemma', 'and', 'mixture', 'lemma']] | [-0.10462499915848712, 0.05558126369440878, -0.11048997396200493, 0.1140533210159078, -0.11732962433047392, -0.14947114240478826, 0.026032135519828345, 0.3634799296489438, -0.3613637730328215, -0.19722141984950853, 0.15527753385155135, -0.25255482706297944, -0.04935991929881778, 0.14001874685070376, -0.07675621152943554, 0.13844523086791505, 0.03686208038188114, 0.009236904289070013, -0.06125404632876854, -0.18917260266135674, 0.3397151809689161, -0.02389915326509524, 0.19400355087693882, 0.144960481900017, 0.10506680629190963, -0.012016700675106934, 0.021964029276844214, 0.006253396135729713, -0.1765196509124409, 0.09085306508712017, 0.21123847907811805, 0.033224335887368665, 0.3078762925217381, -0.4007120446578876, -0.25428795834650864, 0.132968120320977, 0.1487651112531878, 0.06661101891281637, -0.029516446607099293, -0.2718310785555356, 0.044357065589645424, -0.10116145867111816, -0.28591865195414506, -0.060963671487705734, -0.02817442879785557, 0.022992568291925097, -0.29740876767381624, 0.17160047252184232, 0.12811820230421586, 0.02727482550953691, -0.19463036435882788, -0.07966732518822961, 0.00042623236171297123, 0.020833540289360727, 0.03488882867355101, 0.07673402333229377, 0.13056202172427564, -0.10846191177119476, -0.03378902025822852, 0.3437055581425493, -0.10888675498033597, -0.2949542258236859, 0.16279662350142324, -0.1368646457464107, -0.07722335864437392, 0.13704042621208606, 0.14137988789258776, 0.17686601284564146, -0.1862222801994633, 0.1693209088391725, -0.07674666732939817, 0.16407619313513105, 0.16075084844881013, -0.008538373884417721, 0.12133157804507662, 0.1022735932099356, 0.16924438180049528, 0.182405982378908, -0.056525004838870185, -0.10750399042877394, -0.3366589969577822, -0.11750735493527877, -0.252726730094543, 0.08040812216397072, -0.11548819168230104, -0.24085468970037796, 0.30777936081427176, 0.07777456477964045, 0.1313307576221288, 0.130117927552075, 0.292755780187813, 0.23121769868334555, -0.044976273249532725, 0.1300484940120195, 0.19112581005272758, 0.16882652607494714, 0.12208176061913774, -0.1605021174418161, 0.02882415456445636, 0.16068078017014084] |
1,803.03986 | Hybrid Beamforming for 5G Millimeter-Wave Multi-Cell Networks | Multi-cell wireless systems usually suffer both intra-cell and inter-cell
interference, which can be mitigated via coordinated multipoint (CoMP)
techniques. Previous works on multi-cell analysis for the microwave band
generally consider fully digital beamforming that requires a complete
radio-frequency chain behind each antenna, which is less practical for
millimeter-wave (mmWave) systems where large amounts of antennas are necessary
to provide sufficient beamforming gain and to enable transmission and reception
of multiple data streams per user. This paper proposes four analog and digital
hybrid beamforming schemes for multi-cell multi-user multi-stream mmWave
communication, leveraging CoMP. Spectral efficiency performances of the
proposed hybrid beamforming approaches are investigated and compared using both
the 3rd Generation Partnership Project and NYUSIM channel models. Simulation
results show that CoMP based on maximizing signal-to-leakage-plus-noise ratio
can improve spectral efficiency as compared to the no-coordination case, and
spectral efficiency gaps between different beamforming approaches depend on the
interference level that is influenced by the cell radius and the number of
users per cell.
| cs.IT math.IT | multicell wireless systems usually suffer both intracell and intercell interference which can be mitigated via coordinated multipoint comp techniques previous works on multicell analysis for the microwave band generally consider fully digital beamforming that requires a complete radiofrequency chain behind each antenna which is less practical for millimeterwave mmwave systems where large amounts of antennas are necessary to provide sufficient beamforming gain and to enable transmission and reception of multiple data streams per user this paper proposes four analog and digital hybrid beamforming schemes for multicell multiuser multistream mmwave communication leveraging comp spectral efficiency performances of the proposed hybrid beamforming approaches are investigated and compared using both the 3rd generation partnership project and nyusim channel models simulation results show that comp based on maximizing signaltoleakageplusnoise ratio can improve spectral efficiency as compared to the nocoordination case and spectral efficiency gaps between different beamforming approaches depend on the interference level that is influenced by the cell radius and the number of users per cell | [['multicell', 'wireless', 'systems', 'usually', 'suffer', 'both', 'intracell', 'and', 'intercell', 'interference', 'which', 'can', 'be', 'mitigated', 'via', 'coordinated', 'multipoint', 'comp', 'techniques', 'previous', 'works', 'on', 'multicell', 'analysis', 'for', 'the', 'microwave', 'band', 'generally', 'consider', 'fully', 'digital', 'beamforming', 'that', 'requires', 'a', 'complete', 'radiofrequency', 'chain', 'behind', 'each', 'antenna', 'which', 'is', 'less', 'practical', 'for', 'millimeterwave', 'mmwave', 'systems', 'where', 'large', 'amounts', 'of', 'antennas', 'are', 'necessary', 'to', 'provide', 'sufficient', 'beamforming', 'gain', 'and', 'to', 'enable', 'transmission', 'and', 'reception', 'of', 'multiple', 'data', 'streams', 'per', 'user', 'this', 'paper', 'proposes', 'four', 'analog', 'and', 'digital', 'hybrid', 'beamforming', 'schemes', 'for', 'multicell', 'multiuser', 'multistream', 'mmwave', 'communication', 'leveraging', 'comp', 'spectral', 'efficiency', 'performances', 'of', 'the', 'proposed', 'hybrid', 'beamforming', 'approaches', 'are', 'investigated', 'and', 'compared', 'using', 'both', 'the', '3rd', 'generation', 'partnership', 'project', 'and', 'nyusim', 'channel', 'models', 'simulation', 'results', 'show', 'that', 'comp', 'based', 'on', 'maximizing', 'signaltoleakageplusnoise', 'ratio', 'can', 'improve', 'spectral', 'efficiency', 'as', 'compared', 'to', 'the', 'nocoordination', 'case', 'and', 'spectral', 'efficiency', 'gaps', 'between', 'different', 'beamforming', 'approaches', 'depend', 'on', 'the', 'interference', 'level', 'that', 'is', 'influenced', 'by', 'the', 'cell', 'radius', 'and', 'the', 'number', 'of', 'users', 'per', 'cell']] | [-0.2543889577558011, -0.0013052126289241845, 0.059340802012701276, -0.01322596334819222, -0.09603286318748293, -0.21719422653305953, 0.10367535761727112, 0.4089349900806369, -0.19964022937886142, -0.2903090878677221, 0.08363374637692798, -0.23335632304718465, -0.22045446088412535, 0.1680876918217558, -0.10935681112064624, 0.05212764361913511, 0.08216471646058683, -0.06868305467309885, -0.026851113780723586, -0.2386143899071433, 0.27397901259569657, 0.18706871773242767, 0.44489692660899444, 0.013798450115841044, 0.04893909008809894, 0.024980347698416422, -0.07608375530891166, -0.04515652366436696, -0.06286440790485537, 0.09800238622191512, 0.3724742109400127, 0.20908244278707347, 0.2694886742838095, -0.44659339443975943, -0.2907459259904162, 0.06893279385195332, 0.22750094328880494, 0.023589277983482145, -0.05768216818349758, -0.24200571956613134, 0.15878809971970587, -0.23636500497728033, 0.029903170143909478, 0.013988214978994227, -0.1564847709450089, 0.1019211305351353, -0.3880540189954142, 0.044900516597094174, -0.026588413359907765, 0.05820013563160175, -0.016278097141580083, -0.15825546499525692, 0.025451750276081354, 0.16057884442206058, -0.028672616057138153, -0.03767802883970787, 0.07020109030957057, -0.052667738292560294, -0.14524671934361075, 0.40204406733176223, 0.02464688933644168, -0.2401633173066341, 0.17328663610739714, -0.08856242456772354, -0.07250394133195558, 0.17848658036220716, 0.2700964111926747, 0.04837419228329335, -0.18475617598066751, 0.008142324503695156, 0.04531117863909997, 0.19306418494374225, 0.1195343101532256, 0.15216972980429821, 0.17245020496049596, 0.19991658270117585, 0.14059201881855748, 0.08116377242459961, -0.1645160249695268, -0.100273512740207, -0.15143101724018457, -0.09413137577221166, -0.23705305537872914, -0.010356705416609062, -0.06360322579002743, -0.04056673113222199, 0.3446644472970087, 0.13794768891886386, 0.08194935610115436, 0.08566822345443299, 0.4496902503464141, 0.11504527649455588, 0.08508000034195037, 0.08901144824577151, 0.2148100535197034, 0.11286010102650587, 0.18602393022853375, -0.24290558811274277, -0.044101430966955735, -0.03275146262064852] |
1,803.03987 | Contextualizing selection bias in Mendelian randomization: how bad is it
likely to be? | Selection bias affects Mendelian randomization investigations when selection
into the study sample depends on a collider between the genetic variant and
confounders of the risk factor-outcome association. However, the relative
importance of selection bias for Mendelian randomization compared to other
potential biases is unclear. We performed an extensive simulation study to
assess the impact of selection bias on a typical Mendelian randomization
investigation. Selection bias had a severe impact on bias and Type 1 error
rates in our simulation study, but only when selection effects were large. For
moderate effects of the risk factor on selection, bias was generally small and
Type 1 error rate inflation was not considerable. The magnitude of bias was
also affected by the strength of confounder-risk factor and confounder-outcome
associations, the structure of the causal diagram and selection frequency. The
use of inverse probability weighting ameliorated bias when the selection model
was correctly specified, but increased bias when selection bias was moderate
and the model was misspecified. Finally, we investigated whether selection bias
may explain a recently reported finding that lipoprotein(a) is not a causal
risk factor for cardiovascular mortality in individuals with previous coronary
heart disease.
| stat.AP | selection bias affects mendelian randomization investigations when selection into the study sample depends on a collider between the genetic variant and confounders of the risk factoroutcome association however the relative importance of selection bias for mendelian randomization compared to other potential biases is unclear we performed an extensive simulation study to assess the impact of selection bias on a typical mendelian randomization investigation selection bias had a severe impact on bias and type 1 error rates in our simulation study but only when selection effects were large for moderate effects of the risk factor on selection bias was generally small and type 1 error rate inflation was not considerable the magnitude of bias was also affected by the strength of confounderrisk factor and confounderoutcome associations the structure of the causal diagram and selection frequency the use of inverse probability weighting ameliorated bias when the selection model was correctly specified but increased bias when selection bias was moderate and the model was misspecified finally we investigated whether selection bias may explain a recently reported finding that lipoproteina is not a causal risk factor for cardiovascular mortality in individuals with previous coronary heart disease | [['selection', 'bias', 'affects', 'mendelian', 'randomization', 'investigations', 'when', 'selection', 'into', 'the', 'study', 'sample', 'depends', 'on', 'a', 'collider', 'between', 'the', 'genetic', 'variant', 'and', 'confounders', 'of', 'the', 'risk', 'factoroutcome', 'association', 'however', 'the', 'relative', 'importance', 'of', 'selection', 'bias', 'for', 'mendelian', 'randomization', 'compared', 'to', 'other', 'potential', 'biases', 'is', 'unclear', 'we', 'performed', 'an', 'extensive', 'simulation', 'study', 'to', 'assess', 'the', 'impact', 'of', 'selection', 'bias', 'on', 'a', 'typical', 'mendelian', 'randomization', 'investigation', 'selection', 'bias', 'had', 'a', 'severe', 'impact', 'on', 'bias', 'and', 'type', '1', 'error', 'rates', 'in', 'our', 'simulation', 'study', 'but', 'only', 'when', 'selection', 'effects', 'were', 'large', 'for', 'moderate', 'effects', 'of', 'the', 'risk', 'factor', 'on', 'selection', 'bias', 'was', 'generally', 'small', 'and', 'type', '1', 'error', 'rate', 'inflation', 'was', 'not', 'considerable', 'the', 'magnitude', 'of', 'bias', 'was', 'also', 'affected', 'by', 'the', 'strength', 'of', 'confounderrisk', 'factor', 'and', 'confounderoutcome', 'associations', 'the', 'structure', 'of', 'the', 'causal', 'diagram', 'and', 'selection', 'frequency', 'the', 'use', 'of', 'inverse', 'probability', 'weighting', 'ameliorated', 'bias', 'when', 'the', 'selection', 'model', 'was', 'correctly', 'specified', 'but', 'increased', 'bias', 'when', 'selection', 'bias', 'was', 'moderate', 'and', 'the', 'model', 'was', 'misspecified', 'finally', 'we', 'investigated', 'whether', 'selection', 'bias', 'may', 'explain', 'a', 'recently', 'reported', 'finding', 'that', 'lipoproteina', 'is', 'not', 'a', 'causal', 'risk', 'factor', 'for', 'cardiovascular', 'mortality', 'in', 'individuals', 'with', 'previous', 'coronary', 'heart', 'disease']] | [-0.07815206988387682, 0.040777846767788166, -0.05089774952478152, 0.16084232669388082, -0.1320509096667012, -0.15913543449912934, 0.15009608445193698, 0.4093316900048484, -0.2176489710084539, -0.32318822203694464, 0.11809968549951395, -0.22168363699630061, -0.13171391114790706, 0.1724453238953658, -0.12224732304333728, 0.008056269336907946, 0.06686767266860152, -0.005657758766245295, 7.244715333341601e-05, -0.3227424605816424, 0.28837844457829054, 0.16294777117907366, 0.3639393099187378, 0.018161965038706648, 0.06489831517698823, 0.04088651578368104, -0.09571668834603847, 0.08801670914931976, -0.13740092445991747, 0.008982075787165006, 0.20617404225173386, 0.11459141314039602, 0.42414213500129294, -0.3046164959766255, -0.22743153210575792, 0.14310015109863053, 0.11589643872030912, 0.13763611016923838, -0.06491563259376253, -0.2559748700921463, 0.07261969630626287, -0.1644274749181003, -0.050218644490628996, -0.019419423106344456, 0.005197041350951854, 0.0053333603520629965, -0.33548829314067335, 0.16900423461273487, 0.011314396549734854, 0.12111803437484071, -0.01929553756936196, -0.19031614862119858, -0.01028917470427993, 0.12073344694130975, 0.10940733792488166, 0.018697824159468662, 0.1896820458697472, -0.13607939326035928, -0.12162696491639585, 0.29663015403685733, 0.0010334034088102387, -0.19464045416865933, 0.17298688827221223, -0.1538840622116039, -0.13864566562350522, 0.10535199088143542, 0.21212743400556452, 0.02828603766442455, -0.19459459169624135, 0.014722574386433599, 0.0540686765130847, 0.20369920868208594, 0.032013891074073285, -0.04315620949714782, 0.12961034411366315, 0.2072708717042065, 0.023989175206070093, 0.09522250801989898, -0.15843279295145196, -0.04591603886752211, -0.274091313707028, -0.0658270142541485, -0.10823083496429621, 0.030161902532161045, -0.11128728032100356, -0.1596516347162059, 0.3823744699438202, 0.18823290921121022, 0.1647665988817375, 0.029762358704403517, 0.2884940016888419, 0.10749223601987011, 0.09063617012322944, -0.003989748862102019, 0.24533997548427036, 0.08920251155483284, -0.022478083609306115, -0.3041200621098161, 0.23346732585304517, -0.030647057073284932] |
1,803.03988 | Uniform and non-uniform thermal switching of magnetic particles | The pulse-noise approach to systems of classical spins weakly interacting
with the bath has been applied to study thermally-activated escape of magnetic
nanoparticles over the uniform and nonuniform energy barriers at intermediate
and low damping. The validity of approximating a single-domain particle by a
single spin is investigated. Barriers for a non-uniform escape of elongated
particles for the uniaxial model with transverse and longitudinal field have
been worked out. Pulse-noise computations have been done for finite magnetic
chains. The linear stability of the uniform barrier state has been
investigated. The crossover between uniform and nonuniform barrier states has
been studied with the help of the variational approach.
| cond-mat.stat-mech | the pulsenoise approach to systems of classical spins weakly interacting with the bath has been applied to study thermallyactivated escape of magnetic nanoparticles over the uniform and nonuniform energy barriers at intermediate and low damping the validity of approximating a singledomain particle by a single spin is investigated barriers for a nonuniform escape of elongated particles for the uniaxial model with transverse and longitudinal field have been worked out pulsenoise computations have been done for finite magnetic chains the linear stability of the uniform barrier state has been investigated the crossover between uniform and nonuniform barrier states has been studied with the help of the variational approach | [['the', 'pulsenoise', 'approach', 'to', 'systems', 'of', 'classical', 'spins', 'weakly', 'interacting', 'with', 'the', 'bath', 'has', 'been', 'applied', 'to', 'study', 'thermallyactivated', 'escape', 'of', 'magnetic', 'nanoparticles', 'over', 'the', 'uniform', 'and', 'nonuniform', 'energy', 'barriers', 'at', 'intermediate', 'and', 'low', 'damping', 'the', 'validity', 'of', 'approximating', 'a', 'singledomain', 'particle', 'by', 'a', 'single', 'spin', 'is', 'investigated', 'barriers', 'for', 'a', 'nonuniform', 'escape', 'of', 'elongated', 'particles', 'for', 'the', 'uniaxial', 'model', 'with', 'transverse', 'and', 'longitudinal', 'field', 'have', 'been', 'worked', 'out', 'pulsenoise', 'computations', 'have', 'been', 'done', 'for', 'finite', 'magnetic', 'chains', 'the', 'linear', 'stability', 'of', 'the', 'uniform', 'barrier', 'state', 'has', 'been', 'investigated', 'the', 'crossover', 'between', 'uniform', 'and', 'nonuniform', 'barrier', 'states', 'has', 'been', 'studied', 'with', 'the', 'help', 'of', 'the', 'variational', 'approach']] | [-0.12584565327150277, 0.20449012088824378, -0.08949514703442142, 0.04305500196506243, -0.016130056103830722, -0.1454812410966467, 0.01763779042445332, 0.41334796709957244, -0.22272937157339304, -0.30228959969854174, 0.048560167057330884, -0.2413434385208883, -0.0042532468171111336, 0.17390221265410116, 0.07347612897647876, 0.10156568447476096, 0.01631083850374567, 0.025385009046539526, -0.0419005581534633, -0.2203005726893093, 0.25505873314570093, 0.07079148183742137, 0.3197981916959876, 0.08259275797798046, 0.136140703684955, 0.020500966915686692, 0.07418774541850402, 0.0826089229025643, -0.15356817558651495, 0.052504863400147164, 0.18184794883339483, -0.06333054085784356, 0.2736038472677503, -0.4635362064761815, -0.27830480395981644, 0.0767691798038154, 0.19657615337207496, 0.1555171154143515, -0.08533979416933676, -0.2786012721883359, 0.08948989973673335, -0.17595552831940423, -0.16350456814621098, -0.07921673267836048, 0.03991043590396538, 0.08650486900418927, -0.23786040533020675, 0.09433239248415856, 0.0890252072533819, 0.1092732456538861, -0.06292238911596414, -0.11025897418714573, -0.025708590265337342, 0.09124795906245708, 0.07696193994873445, 0.020722936035925957, 0.15063821540483943, -0.09187380597104153, -0.11020912925895547, 0.3101993643931139, -0.039355898779712475, -0.20076755308937805, 0.1982847675702874, -0.1288740129175239, -0.07825953822156467, 0.19145116291800948, 0.158449364512741, 0.13272257016049088, -0.16296606925185594, 0.1500799864594211, -0.007171835052937478, 0.10456739080564997, 0.07396594216289852, -0.02041701855851668, 0.22012883819047815, 0.1821087835025843, 0.041344399411649066, 0.19748883816320015, -0.12394287519996863, -0.15904327525504838, -0.16555818676878917, -0.1428595956732632, -0.20465267552323987, 0.028803895227611065, -0.037446849328296034, -0.1843918174087444, 0.3757918491942164, 0.07756376565276552, 0.1446106573131597, -0.015850081800474463, 0.24420672139831792, 0.15697917180292517, 0.05773127419334427, 0.029237469223058112, 0.26666540474300143, 0.23071387009129415, 0.10176008881752979, -0.25212972872960165, 0.0658477505790853, 0.002163196400364983] |
1,803.03989 | Classical ground states, spin-wave and PCUT analysis of $\rm H_2SQ$
system | We study an organic Hydrogen bonded material $\rm{H_2SQ}$ analytically and
map out the phase diagram as well as low energy excitations in the relevant
parameter space. At zeroth order the dynamics is governed by plaquette
interaction (product of $\sigma_z$ over a plaquette) which defines a $Z_2$
gauge theory and a deconfinement phase satisfying "ice rules". The system is
studied under additional interactions such as an external Zeeman field (with
strength $K$) in $x$-direction, a inter-molecular interaction (with strength
$J_1$) and a dipole-dipole interaction with strength $J_2$ such that
$K>J_1>J_2$. The effect of dipole-dipole interaction removes the local $Z_2$
symmetry and gives rise to four global degenerate states with Ferroeletric
order. Using meanfield analysis we chart out the phase diagram for classical
version of the model and find $K_c$ which defines the transition from
disordered phase to ordered phase in $J_1, K$ plane for various values of
$J_2$. We find that presence of $J_1$ and $J_2$ tends to stabilize the
deconfined phases. Over the classical ground states we perform spin-wave
analysis and surprisingly find that quantum fluctuations does not remove the
classical degeneracy at all at quadratic level. The spin-wave spectrum is found
for the four global degenerate ground states which shows both gapped spectrum
and gapless spectrum (near the vicinity of CDT transition) for $J_2=0$. However
for $J_2$ finite, the spectrum is always gapped. We perform PCUT analysis to
improve the results of spin-wave analysis and calculate ground state energy and
one particle dispersion and gap at high symmetry point. Using this we draw the
phase boundary between confined and deconfined phase in the $K-J_1$ plane. The
effect of $J_2$ is also discussed in the resulting phase boundary.
| cond-mat.str-el | we study an organic hydrogen bonded material rmh_2sq analytically and map out the phase diagram as well as low energy excitations in the relevant parameter space at zeroth order the dynamics is governed by plaquette interaction product of sigma_z over a plaquette which defines a z_2 gauge theory and a deconfinement phase satisfying ice rules the system is studied under additional interactions such as an external zeeman field with strength k in xdirection a intermolecular interaction with strength j_1 and a dipoledipole interaction with strength j_2 such that kj_1j_2 the effect of dipoledipole interaction removes the local z_2 symmetry and gives rise to four global degenerate states with ferroeletric order using meanfield analysis we chart out the phase diagram for classical version of the model and find k_c which defines the transition from disordered phase to ordered phase in j_1 k plane for various values of j_2 we find that presence of j_1 and j_2 tends to stabilize the deconfined phases over the classical ground states we perform spinwave analysis and surprisingly find that quantum fluctuations does not remove the classical degeneracy at all at quadratic level the spinwave spectrum is found for the four global degenerate ground states which shows both gapped spectrum and gapless spectrum near the vicinity of cdt transition for j_20 however for j_2 finite the spectrum is always gapped we perform pcut analysis to improve the results of spinwave analysis and calculate ground state energy and one particle dispersion and gap at high symmetry point using this we draw the phase boundary between confined and deconfined phase in the kj_1 plane the effect of j_2 is also discussed in the resulting phase boundary | [['we', 'study', 'an', 'organic', 'hydrogen', 'bonded', 'material', 'rmh_2sq', 'analytically', 'and', 'map', 'out', 'the', 'phase', 'diagram', 'as', 'well', 'as', 'low', 'energy', 'excitations', 'in', 'the', 'relevant', 'parameter', 'space', 'at', 'zeroth', 'order', 'the', 'dynamics', 'is', 'governed', 'by', 'plaquette', 'interaction', 'product', 'of', 'sigma_z', 'over', 'a', 'plaquette', 'which', 'defines', 'a', 'z_2', 'gauge', 'theory', 'and', 'a', 'deconfinement', 'phase', 'satisfying', 'ice', 'rules', 'the', 'system', 'is', 'studied', 'under', 'additional', 'interactions', 'such', 'as', 'an', 'external', 'zeeman', 'field', 'with', 'strength', 'k', 'in', 'xdirection', 'a', 'intermolecular', 'interaction', 'with', 'strength', 'j_1', 'and', 'a', 'dipoledipole', 'interaction', 'with', 'strength', 'j_2', 'such', 'that', 'kj_1j_2', 'the', 'effect', 'of', 'dipoledipole', 'interaction', 'removes', 'the', 'local', 'z_2', 'symmetry', 'and', 'gives', 'rise', 'to', 'four', 'global', 'degenerate', 'states', 'with', 'ferroeletric', 'order', 'using', 'meanfield', 'analysis', 'we', 'chart', 'out', 'the', 'phase', 'diagram', 'for', 'classical', 'version', 'of', 'the', 'model', 'and', 'find', 'k_c', 'which', 'defines', 'the', 'transition', 'from', 'disordered', 'phase', 'to', 'ordered', 'phase', 'in', 'j_1', 'k', 'plane', 'for', 'various', 'values', 'of', 'j_2', 'we', 'find', 'that', 'presence', 'of', 'j_1', 'and', 'j_2', 'tends', 'to', 'stabilize', 'the', 'deconfined', 'phases', 'over', 'the', 'classical', 'ground', 'states', 'we', 'perform', 'spinwave', 'analysis', 'and', 'surprisingly', 'find', 'that', 'quantum', 'fluctuations', 'does', 'not', 'remove', 'the', 'classical', 'degeneracy', 'at', 'all', 'at', 'quadratic', 'level', 'the', 'spinwave', 'spectrum', 'is', 'found', 'for', 'the', 'four', 'global', 'degenerate', 'ground', 'states', 'which', 'shows', 'both', 'gapped', 'spectrum', 'and', 'gapless', 'spectrum', 'near', 'the', 'vicinity', 'of', 'cdt', 'transition', 'for', 'j_20', 'however', 'for', 'j_2', 'finite', 'the', 'spectrum', 'is', 'always', 'gapped', 'we', 'perform', 'pcut', 'analysis', 'to', 'improve', 'the', 'results', 'of', 'spinwave', 'analysis', 'and', 'calculate', 'ground', 'state', 'energy', 'and', 'one', 'particle', 'dispersion', 'and', 'gap', 'at', 'high', 'symmetry', 'point', 'using', 'this', 'we', 'draw', 'the', 'phase', 'boundary', 'between', 'confined', 'and', 'deconfined', 'phase', 'in', 'the', 'kj_1', 'plane', 'the', 'effect', 'of', 'j_2', 'is', 'also', 'discussed', 'in', 'the', 'resulting', 'phase', 'boundary']] | [-0.21054614835799448, 0.21644763965943545, -0.05607787687029778, 0.04799707471664968, -0.02546152657570902, -0.13584188051542173, 0.07865593116772938, 0.3620234571845971, -0.2556358134462396, -0.2662568088369376, 0.04675439341557994, -0.31866684485945757, -0.11965986796426178, 0.09325338903615714, 0.11203460870854502, -0.02454748311725634, -0.02013958897101727, 0.04346208197855387, -0.11542066643766576, -0.18085037012428154, 0.30645832085444924, -0.0021849973038022483, 0.26661565021890465, 0.07608986833199934, 0.04512991104529912, 0.04576122257127732, 0.10448415908133135, -4.174568306698878e-05, -0.17675938727170035, 0.0006442988925718831, 0.22862870164511276, -0.060346144232830974, 0.16115354491316164, -0.3718266535183265, -0.18930178774558143, 0.10237382299667835, 0.15330435260561004, 0.129568918306044, 0.004003127755590436, -0.3128987028141146, 0.028221543948420996, -0.1905338205541586, -0.14609892818317102, -0.12828880913528432, -0.024831918165951043, -0.019277435999548904, -0.27805908543718844, 0.10958139860675836, 0.06162398549631224, 0.09877260503432217, -0.06392483021995991, -0.09962908443476474, -0.1072300164029852, 0.11821632009733768, 0.05392430847035421, 0.07744223204661028, 0.10669096149283251, -0.13211963261264362, -0.07840107962273292, 0.4029500686570349, -0.07730394765483148, -0.12834261270855166, 0.1677018994020203, -0.1561945569523577, -0.11701516343967268, 0.18384062624570444, 0.08741576273107296, 0.058238913743573165, -0.06104805941538831, 0.11497386149141384, 0.02746049402261248, 0.19739463630892476, 0.0038070226849539436, 0.04564674152231293, 0.25188845709768415, 0.12046353106240804, 0.0924271977520174, 0.1764296688994284, -0.10853994241278334, -0.1780612795090262, -0.2946714670941179, -0.12528750317402348, -0.20579287578159752, 0.013097342184498774, -0.09016968985024439, -0.18287663576091184, 0.3812596456446841, 0.13887088161270325, 0.1762235564253859, -0.011594069588429763, 0.24858159158399235, 0.10798175278141836, 0.018453733009850457, 0.05106806896081412, 0.2745595903146033, 0.16156685571985008, 0.07828620150107482, -0.27301518927773555, -0.010886495382300694, 0.08604855453476555] |
1,803.0399 | Frobenius Stratification of Moduli Spaces of Vector Bundles in Positive
characteristic. II | Let $X$ be a smooth projective curve of genus $g(X)\geq 1$ over an
algebraically closed field $k$ of characteristic $p>0$, $\M^s_X(r,d)$ the
moduli space of stable vector bundles of rank $r$ and degree $d$ on $X$. We
study the Frobenius stratification of $\M^s_X(r,d)$ in terms of
Harder-Narasimhan polygons of Frobenius pull backs of stable vector bundles and
obtain the irreducibility and dimension of each non-empty Frobenius stratum in
case $(p,g,r)=(3,2,3)$.
| math.AG | let x be a smooth projective curve of genus gxgeq 1 over an algebraically closed field k of characteristic p0 ms_xrd the moduli space of stable vector bundles of rank r and degree d on x we study the frobenius stratification of ms_xrd in terms of hardernarasimhan polygons of frobenius pull backs of stable vector bundles and obtain the irreducibility and dimension of each nonempty frobenius stratum in case pgr323 | [['let', 'x', 'be', 'a', 'smooth', 'projective', 'curve', 'of', 'genus', 'gxgeq', '1', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'of', 'characteristic', 'p0', 'ms_xrd', 'the', 'moduli', 'space', 'of', 'stable', 'vector', 'bundles', 'of', 'rank', 'r', 'and', 'degree', 'd', 'on', 'x', 'we', 'study', 'the', 'frobenius', 'stratification', 'of', 'ms_xrd', 'in', 'terms', 'of', 'hardernarasimhan', 'polygons', 'of', 'frobenius', 'pull', 'backs', 'of', 'stable', 'vector', 'bundles', 'and', 'obtain', 'the', 'irreducibility', 'and', 'dimension', 'of', 'each', 'nonempty', 'frobenius', 'stratum', 'in', 'case', 'pgr323']] | [-0.3073353916541606, 0.0764682969161515, -0.08870064205341581, 0.00045655269607685614, -0.052224139898907444, -0.2062575747123987, -0.011846117972247843, 0.3196276521337205, -0.3668171405468298, -0.11248552299819994, 0.037146104584056615, -0.18202000638416063, -0.08725696550412239, 0.18292658395754793, -0.15328281259407167, -0.06126842326552108, 0.01568568657503288, 0.19019654709710807, -0.10421114313024757, -0.3939853565686423, 0.45802255792786245, -0.08847340159928022, 0.2001067998184674, 0.014486132662041464, 0.13211080925944058, 0.025692899728301858, 0.04537467110524143, 0.015328155010111926, -0.18338511596717263, 0.15137408305283473, 0.3226689765688734, 0.09738516514324516, 0.18653766421493198, -0.3298731280652725, -0.14693322407918563, 0.28505769790406676, 0.13455214593272682, -0.10494498295736486, 0.09816859519966217, -0.2232438744470963, 0.16985531328111023, -0.08246612600645598, -0.19528561594653066, -0.10076471750179063, 0.13324426762098313, 0.016919119558567047, -0.23612678377632645, -0.06711500642848188, 0.09367658915942993, 0.24090775055135938, -0.11117655828095757, -0.15943403215404006, -0.13759769738206398, -0.01044562924147138, 0.03776007229917804, 0.12067082551631915, 0.09209201858122495, -0.09017731088713027, -0.06126201934302631, 0.30814860693003604, -0.11612562308816807, -0.1972987775326423, 0.05404614468199619, -0.19539797864854336, -0.03184638299263906, 0.20098659720109857, 0.15589504332646079, 0.24448625024693235, 0.11984539486845766, 0.23821417314246757, -0.13670714289975772, 0.06525368098358529, 0.11415470378014489, -0.056465498590167015, 0.126710815064987, 0.05200841289985439, 0.0895285325570275, 0.09836730932432186, -0.06147415029303427, -0.008913403376936913, -0.40889944038961246, -0.25240126430340437, -0.04678939492104278, 0.23268881842386033, -0.20195809215162983, -0.1819716699866821, 0.4289583672931337, -0.021305635800936085, 0.2566741258985754, 0.1257627654172804, 0.22808661940845026, -0.02428480836333356, -0.004165528166661228, 0.06908373258656998, 0.07544391363373269, 0.2911828309972433, -0.10184893664141334, -0.1219952997137401, -0.02904350853835543, 0.23547864264633128] |
1,803.03991 | Measurements of differential cross sections of top quark pair production
as a function of kinematic event variables in proton-proton collisions at
$\sqrt{s}=$ 13 TeV | Measurements of differential $\mathrm{t\overline{t}}$ production cross
sections are presented in the single-lepton decay channel, as a function of a
number of kinematic event variables. The measurements are performed with
proton-proton collision data at $\sqrt{s}=$ 13 TeV, collected by the CMS
experiment at the LHC during 2016, with an integrated luminosity of 35.9
fb$^{-1}$. The data are compared to a variety of state-of-the-art leading-order
and next-to-leading-order $\mathrm{t\overline{t}}$ simulations.
| hep-ex | measurements of differential mathrmtoverlinet production cross sections are presented in the singlelepton decay channel as a function of a number of kinematic event variables the measurements are performed with protonproton collision data at sqrts 13 tev collected by the cms experiment at the lhc during 2016 with an integrated luminosity of 359 fb1 the data are compared to a variety of stateoftheart leadingorder and nexttoleadingorder mathrmtoverlinet simulations | [['measurements', 'of', 'differential', 'mathrmtoverlinet', 'production', 'cross', 'sections', 'are', 'presented', 'in', 'the', 'singlelepton', 'decay', 'channel', 'as', 'a', 'function', 'of', 'a', 'number', 'of', 'kinematic', 'event', 'variables', 'the', 'measurements', 'are', 'performed', 'with', 'protonproton', 'collision', 'data', 'at', 'sqrts', '13', 'tev', 'collected', 'by', 'the', 'cms', 'experiment', 'at', 'the', 'lhc', 'during', '2016', 'with', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'the', 'data', 'are', 'compared', 'to', 'a', 'variety', 'of', 'stateoftheart', 'leadingorder', 'and', 'nexttoleadingorder', 'mathrmtoverlinet', 'simulations']] | [-0.04963390760596341, 0.12845054139759315, -0.10355211747115228, 0.09344897674980449, -0.01427907597468193, -0.055700512943483556, -0.06864916456779882, 0.35142351937160565, -0.1602628360877731, -0.4037034221327127, 0.04831644511302071, -0.46441647554956267, 0.13793269027747326, 0.20605604995542498, 0.10121834337878138, 0.1910134355273487, 0.23267197861933886, -0.00427405119859683, -0.043555315882801565, -0.2900807908944674, 0.25244351873285514, 0.15445671099891414, 0.2325389410522002, 0.04789821881411681, 0.10865559021997918, 0.055070494378069, -0.12587936800372884, -0.07149421837208654, -0.11193537037930827, 0.05163528332347745, 0.33488538399783535, 0.07910941894263473, 0.09376660512009663, -0.3589734684731533, -0.00660472577298755, 0.10944825424743232, 0.11245203068924707, 0.03185980290881664, -0.057189054759358295, -0.35961405443611427, 0.14865334528679056, -0.2723167430776269, -0.06829822233725172, 0.05549953809814222, 0.04208425821653053, -0.03745490426559057, -0.36689128532116094, 0.11746482517042045, -0.14726828720504, 0.16016352259025757, -0.021286340975967138, -0.1972349394224028, -0.11671792129193669, -0.07119384562117118, 0.047890610989433396, 0.057924367555194714, 0.21642900828216502, -0.1336458855336393, -0.2943175535148649, 0.2549992900953364, -0.010018995198518482, -0.09656360862192823, 0.20058581931603406, -0.18119627871870328, -0.06587751978076994, 0.21256232228296906, 0.33834063794130265, 0.051547178859586144, -0.2839771024604787, 0.0710225482810108, 0.01571641063123052, 0.1812801980726254, 0.04113586853717023, 0.04398111700872654, 0.11496448651331463, 0.26567118495369135, -0.06738320318286989, 0.04474921798361326, -0.1779858480249323, -0.04996959008832476, -0.5112817346382497, -0.056505427195398666, -0.0785779352091364, 0.038576934264222186, -0.046537900447572667, -0.014517441661263914, 0.2934937569132047, 0.08942524768579786, 0.3906684075273685, 0.016761175151775356, 0.28956565110763505, 0.12302593954442653, 0.06350165365416724, 0.06318045672335064, 0.3288027575211738, 0.13321172013017002, 0.22020333493823435, -0.21785586508018756, 0.025037357048479033, 0.007294721741562904] |
1,803.03992 | Nonregular elliptic boundary-value problems and H\"ormander spaces | We investigate nonregular elliptic problems with boundary conditions of
higher orders. We prove that these problems are Fredholm on appropriate pairs
of inner product H\"ormander spaces that form a two-sided refined Sobolev
scale. We also prove a theorem on the regularity of generalized solutions to
the problems in these spaces.
| math.AP | we investigate nonregular elliptic problems with boundary conditions of higher orders we prove that these problems are fredholm on appropriate pairs of inner product hormander spaces that form a twosided refined sobolev scale we also prove a theorem on the regularity of generalized solutions to the problems in these spaces | [['we', 'investigate', 'nonregular', 'elliptic', 'problems', 'with', 'boundary', 'conditions', 'of', 'higher', 'orders', 'we', 'prove', 'that', 'these', 'problems', 'are', 'fredholm', 'on', 'appropriate', 'pairs', 'of', 'inner', 'product', 'hormander', 'spaces', 'that', 'form', 'a', 'twosided', 'refined', 'sobolev', 'scale', 'we', 'also', 'prove', 'a', 'theorem', 'on', 'the', 'regularity', 'of', 'generalized', 'solutions', 'to', 'the', 'problems', 'in', 'these', 'spaces']] | [-0.15521815194748342, 0.06351466589607298, -0.06634039975702763, 0.1954345354810357, -0.10428693677764386, -0.08064691588748246, -0.05625302579253912, 0.36361653443425895, -0.340061082392931, -0.19341513983905315, 0.20382095655193552, -0.24564925773069263, -0.11429084576666355, 0.24881733749061824, -0.14570362396538258, 0.09865134628489614, 0.11829073739703745, 0.043893508594483134, -0.18011973380111157, -0.28774585273116826, 0.5092351728864014, -0.11096669067861513, 0.20146944418549537, 0.08547007273882627, 0.09711214346811176, -0.0506882937066257, 0.004618802331387997, 0.00360453637316823, -0.24036729785759234, 0.20203418967314066, 0.2652305768802762, 0.015288624325767159, 0.31560617726296186, -0.4258757768571377, -0.182877302095294, 0.170154186822474, 0.09453093410469592, -0.023222104525193573, 0.013951934617944061, -0.29546623818576334, 0.13276036815252154, -0.10789235724136233, -0.18885610876139253, -0.09149957049172372, -0.03530896364711225, 0.06568101830780507, -0.34883243069052694, 0.08188127172586973, 0.11454463679343461, 0.036384512074291706, -0.1616239199694246, -0.0757666615024209, 0.005960446670651436, 0.009942858386784792, 0.019710236471146347, -0.050387269109487536, 0.03792020575143397, -0.08562013855203986, -0.13833722561597825, 0.28887876007473096, -0.019789005629718304, -0.2949942757934332, 0.15203569576144219, -0.15390641969628632, -0.18380368090234697, 0.04313423685729503, 0.17141272186301648, 0.21144036831334234, -0.05211740959435701, 0.1280563792772591, -0.12869623332982882, 0.09722689069807529, 0.17007726819254457, 0.05780497692525387, 0.058367362516000866, 0.053006892520934344, 0.2034843442030251, 0.17984409868717194, 0.03535993830766529, -0.08045063145225867, -0.3671796929091215, -0.1616052053309977, -0.09391889361664653, 0.08697715930640698, -0.19425645142793654, -0.23585423797369004, 0.32892293700482694, 0.1268102715909481, 0.1406115939002484, 0.11337826253846288, 0.16266126591712238, 0.15602279440499842, 0.031200245711952446, 0.1039706125948578, 0.172165556140244, 0.15908038310706615, 0.09451373135671019, -0.11764363242313265, -0.012702439995482564, 0.25771451499313114] |
1,803.03993 | Constructive description of H\"older-like classes on an arc in
$\mathbb{R}^3$ by means of harmonic functions | We give a constructive description of H\"older-like classes of functions on a
chord-arc curve in $\mathbb{R}^3$ by means of a rate of approximation by
function harmonic is shrinking neibourhoods of those curve
| math.CV | we give a constructive description of holderlike classes of functions on a chordarc curve in mathbbr3 by means of a rate of approximation by function harmonic is shrinking neibourhoods of those curve | [['we', 'give', 'a', 'constructive', 'description', 'of', 'holderlike', 'classes', 'of', 'functions', 'on', 'a', 'chordarc', 'curve', 'in', 'mathbbr3', 'by', 'means', 'of', 'a', 'rate', 'of', 'approximation', 'by', 'function', 'harmonic', 'is', 'shrinking', 'neibourhoods', 'of', 'those', 'curve']] | [-0.18711698202194735, 0.042327134299182126, -0.14747110868413602, 0.054992089607572604, -0.04283378994272601, -0.0673435710881266, 0.08738260573497222, 0.34625096871487554, -0.23070301249202702, -0.20244314509534067, 0.07514962163047804, -0.2658549171061285, -0.14911875182822829, 0.29290650075962466, -0.10477890900426334, 0.03855649285739468, 0.03969162816722547, 0.042105389158091235, -0.08395777366334392, -0.2377556924137377, 0.3566971313088171, -0.06450730868645253, 0.19513922364961717, 0.06319984180792686, 0.09291734958007451, 0.03758998131079058, 0.002865263275922306, -0.00029481689055119793, -0.20005750361709826, 0.1539915101076927, 0.20225188960771887, 0.1491638605873431, 0.2561389653673095, -0.37623455068997796, -0.2273747301660478, 0.1277677665554708, 0.10619952074522453, 0.02916375887129576, -0.0358398926121393, -0.20167299158751004, 0.060977962498943654, -0.09374254335078501, -0.20810465541698278, -0.06783061645804875, 0.04834412322229435, 0.1372035549232556, -0.24351159625897004, 0.07492328309003383, 0.14252432561930148, 0.14319780404349008, -0.06428505864835554, -0.053249090158891295, 0.020943372345138943, 0.00898406836354444, -0.022386813663967674, 0.12303774839928074, 0.03850306938552568, -0.11298250053979216, -0.07229681924406078, 0.3617972587085059, -0.14170979639335024, -0.25114131538617995, 0.086063539699441, -0.14187837318487226, -0.015056409752897678, 0.1685793331313518, 0.16438890236519998, 0.1643384342953082, -0.13493620721443045, 0.1397222595349435, -0.06576983101906315, 0.10569793574752347, 0.09885644368947513, -0.0182005335246363, 0.1548614223758059, 0.11384922824800014, 0.08869754559090061, 0.21089537646020612, 0.02668803124388139, -0.07932478826748388, -0.3829916941542779, -0.14129305600879655, -0.18184941676595517, 0.10805552787778358, -0.1246279198939221, -0.20473646066121517, 0.45413748198939907, -0.09123527189536441, 0.2457842713281993, 0.08511588581266903, 0.2510869783018866, 0.15580191718594683, 0.03331974764624911, 0.03240826078540375, 0.1894379554376487, 0.13663394499059406, -0.030789206645661784, -0.12896108959666303, 0.03760391736643449, 0.22777501538756392] |
1,803.03994 | On Trade in Bilateral Oligopolies with Altruistic and Spiteful Agents | This paper studies the effects of altruism and spitefulness in a two-sided
market in which agents behave strategically and trade according to the
Shapley-Shubik mechanism. By assuming that altruistic agents have concerns for
others on the opposite side of the market, it shows that agents always find
advantageous to trade. However, they prefer to stay out of the market and
consume their endowments when there are altruistic agents who have concerns for
the welfare of those on the same side of the market, or when there are spiteful
agents. These non-trade situations occur either because the necessary
first-order conditions for optimality are violated or because agents' payoff
functions are not concave.
| cs.GT | this paper studies the effects of altruism and spitefulness in a twosided market in which agents behave strategically and trade according to the shapleyshubik mechanism by assuming that altruistic agents have concerns for others on the opposite side of the market it shows that agents always find advantageous to trade however they prefer to stay out of the market and consume their endowments when there are altruistic agents who have concerns for the welfare of those on the same side of the market or when there are spiteful agents these nontrade situations occur either because the necessary firstorder conditions for optimality are violated or because agents payoff functions are not concave | [['this', 'paper', 'studies', 'the', 'effects', 'of', 'altruism', 'and', 'spitefulness', 'in', 'a', 'twosided', 'market', 'in', 'which', 'agents', 'behave', 'strategically', 'and', 'trade', 'according', 'to', 'the', 'shapleyshubik', 'mechanism', 'by', 'assuming', 'that', 'altruistic', 'agents', 'have', 'concerns', 'for', 'others', 'on', 'the', 'opposite', 'side', 'of', 'the', 'market', 'it', 'shows', 'that', 'agents', 'always', 'find', 'advantageous', 'to', 'trade', 'however', 'they', 'prefer', 'to', 'stay', 'out', 'of', 'the', 'market', 'and', 'consume', 'their', 'endowments', 'when', 'there', 'are', 'altruistic', 'agents', 'who', 'have', 'concerns', 'for', 'the', 'welfare', 'of', 'those', 'on', 'the', 'same', 'side', 'of', 'the', 'market', 'or', 'when', 'there', 'are', 'spiteful', 'agents', 'these', 'nontrade', 'situations', 'occur', 'either', 'because', 'the', 'necessary', 'firstorder', 'conditions', 'for', 'optimality', 'are', 'violated', 'or', 'because', 'agents', 'payoff', 'functions', 'are', 'not', 'concave']] | [-0.11128710890872352, 0.10499331536232878, -0.09996756984758268, 0.12142144539500288, -0.10888965156809384, -0.24419977336079565, 0.14002242789351715, 0.4496519947339089, -0.2561839097649406, -0.2533584767525349, 0.14093761265901592, -0.322903923827027, -0.13728255727926458, 0.10596077683714962, -0.16588273078818386, -0.051733603137075354, 0.02912719775452663, 0.08078911895393778, 0.10129477639112262, -0.3635760543850857, 0.34334111003922896, 0.02573555653248358, 0.2586004386438108, 0.02460635910152432, 0.06652930171288755, -0.005208677424271719, 0.011220095074658683, 0.04846599488459055, -0.09907882315933879, 0.07256578110636921, 0.332052985718901, 0.11573995924512044, 0.4002257757435698, -0.502079250226908, -0.12848254528170058, 0.19644067019070371, 0.08442122935356974, 0.04151177362201376, 0.029486804597139562, -0.2552393798314787, 0.06870462449370038, -0.18282427955333383, -0.07475091907550332, -0.06189102336012442, -0.024812724885590578, 0.08478324827973073, -0.29512484200350053, 0.02937409160829602, 0.07968883403606815, 0.0443696495905997, -0.053382112187495744, -0.13460150993335138, -0.07053494088590966, 0.1973314531571488, 0.1580575200976855, -0.09590262681707193, 0.16472235960413814, -0.1851749830951897, -0.14086797290028782, 0.4079202654079423, 0.052674702043995394, -0.19878575484345265, 0.20039762371356404, -0.1500450076002397, -0.10208659807066305, 0.07754524064745856, 0.1692486289491313, 0.06494547910304792, -0.12515766581935903, 0.011687425514704489, -0.07251612916417899, 0.14925973019947153, 0.10601868930725603, 0.04444183104771933, 0.20407351983044672, 0.06408672797314208, 0.2017118358224152, 0.047087762069059624, 0.10743614999201456, -0.20925555810110147, -0.21012517335662328, -0.11758951971375751, -0.1368947333395652, 0.03596699968583288, -0.07707489739824193, -0.13926558865558938, 0.3021880972152149, 0.138216626198125, 0.1273231736486863, 0.1003505672149813, 0.2675146728309743, 0.09222227701417453, 0.04601120755477988, 0.12623448290546005, 0.2665853309231477, -0.04825341863527791, 0.12849686628874016, -0.17681160926874384, 0.23182856866132912, -0.061765094411585036] |
1,803.03995 | Adaptive Smoothing of the Log-Spectrum with Multiple Tapering | A hybrid estimator of the log-spectral density of a stationary time series is
proposed. First, a multiple taper estimate is performed, followed by kernel
smoothing the log-multiple taper estimate. This procedure reduces the expected
mean square error by $(\pi^2/ 4)^{4/5} $ over simply smoothing the log tapered
periodogram. A data adaptive implementation of a variable bandwidth kernel
smoother is given.
| stat.ME eess.AS eess.SP math.ST physics.data-an stat.TH | a hybrid estimator of the logspectral density of a stationary time series is proposed first a multiple taper estimate is performed followed by kernel smoothing the logmultiple taper estimate this procedure reduces the expected mean square error by pi2 445 over simply smoothing the log tapered periodogram a data adaptive implementation of a variable bandwidth kernel smoother is given | [['a', 'hybrid', 'estimator', 'of', 'the', 'logspectral', 'density', 'of', 'a', 'stationary', 'time', 'series', 'is', 'proposed', 'first', 'a', 'multiple', 'taper', 'estimate', 'is', 'performed', 'followed', 'by', 'kernel', 'smoothing', 'the', 'logmultiple', 'taper', 'estimate', 'this', 'procedure', 'reduces', 'the', 'expected', 'mean', 'square', 'error', 'by', 'pi2', '445', 'over', 'simply', 'smoothing', 'the', 'log', 'tapered', 'periodogram', 'a', 'data', 'adaptive', 'implementation', 'of', 'a', 'variable', 'bandwidth', 'kernel', 'smoother', 'is', 'given']] | [-0.12208659868237787, 0.007038718908382901, -0.16301749174579463, 0.06272603491780845, -0.06269653581468196, -0.18797064157491872, 0.08649632191799324, 0.4372259170330804, -0.2625658721502485, -0.2760107469472006, 0.15546052356186355, -0.21713141724467278, -0.11786570723754643, 0.22098901745831145, -0.08542644587377536, 0.13870968480176968, 0.07938942012923031, -0.022595761343836784, -0.11961031316554752, -0.265905378033118, 0.21455255766993325, 0.13859876598520526, 0.27409360556590273, -0.11012700858228872, 0.14998486644692782, 0.04272148396884059, -0.11316230969206462, -0.05675058194500362, -0.113131209244502, 0.08266739454120398, 0.18428390980537596, 0.03991382710378746, 0.42835862555637444, -0.3002680996151898, -0.21738852175145312, 0.07796054489204082, 0.14298761310055852, 0.01713025908724501, 0.013318484809635014, -0.25317032275528745, 0.07547755950483782, -0.1488225862327642, -0.12289823626633734, -0.0035874675838919036, -0.049355692503138864, 0.018668858093562824, -0.38286703526331434, 0.12582671535522516, 0.028646228738642972, 0.034047928189152275, 0.027206372646293765, -0.11157413376174097, 0.03599582788743207, -0.025575836385792958, -0.0198452283491798, 0.06718799054365733, 0.1632835347012713, -0.025749994164878696, -0.04509046923264797, 0.24625808392362347, -0.13899506838060915, -0.17332659475505352, 0.0015501840329118844, -0.061687422563032855, 0.012537961440353558, 0.2192403580993414, 0.16708178815817268, 0.12678731949237207, -0.13865103631216133, 0.06471796285617969, -0.008066215899628427, 0.23107502103686847, 0.08499435380358121, -0.05390838662098194, 0.09848030622855856, 0.2040846899376604, 0.1456948360990219, 0.14035904677263622, -0.22251859299260482, -0.04589908299485928, -0.32373922731795607, -0.1462022349366854, -0.30296942011196293, -0.02167259404789014, -0.2077059360494002, -0.20286699699173713, 0.4221415951334197, 0.07662288689933686, 0.2007120244590373, 0.13515350709123344, 0.3531363537406613, 0.19905907635031075, 0.07545422473199793, 0.10561393256748802, 0.15126960792835673, 0.13256858868106944, 0.03457505771978598, -0.22864769725931872, 0.05683145958705452, 0.08420457538811425] |
1,803.03996 | Matching distributions: Recovery of implied physical densities from
option prices | We introduce a non-parametric method to recover physical probability
distributions of asset returns based on their European option prices and some
other sparse parametric information. Thus the main problem is similar to the
one considered foir instance in the Recovery Theorem by Ross (2015), except
that here we consider a non-dynamical setting. The recovery of the distribution
is complete, instead of estimating merely a finite number of its parameters,
such as implied volatility, skew or kurtosis. The technique is based on a
reverse application of recently introduced Distribution Matching by the author
and is related to the ideas in Distribution Pricing by Dybvig (1988) as well as
comonotonicity.
| q-fin.PR q-fin.GN | we introduce a nonparametric method to recover physical probability distributions of asset returns based on their european option prices and some other sparse parametric information thus the main problem is similar to the one considered foir instance in the recovery theorem by ross 2015 except that here we consider a nondynamical setting the recovery of the distribution is complete instead of estimating merely a finite number of its parameters such as implied volatility skew or kurtosis the technique is based on a reverse application of recently introduced distribution matching by the author and is related to the ideas in distribution pricing by dybvig 1988 as well as comonotonicity | [['we', 'introduce', 'a', 'nonparametric', 'method', 'to', 'recover', 'physical', 'probability', 'distributions', 'of', 'asset', 'returns', 'based', 'on', 'their', 'european', 'option', 'prices', 'and', 'some', 'other', 'sparse', 'parametric', 'information', 'thus', 'the', 'main', 'problem', 'is', 'similar', 'to', 'the', 'one', 'considered', 'foir', 'instance', 'in', 'the', 'recovery', 'theorem', 'by', 'ross', '2015', 'except', 'that', 'here', 'we', 'consider', 'a', 'nondynamical', 'setting', 'the', 'recovery', 'of', 'the', 'distribution', 'is', 'complete', 'instead', 'of', 'estimating', 'merely', 'a', 'finite', 'number', 'of', 'its', 'parameters', 'such', 'as', 'implied', 'volatility', 'skew', 'or', 'kurtosis', 'the', 'technique', 'is', 'based', 'on', 'a', 'reverse', 'application', 'of', 'recently', 'introduced', 'distribution', 'matching', 'by', 'the', 'author', 'and', 'is', 'related', 'to', 'the', 'ideas', 'in', 'distribution', 'pricing', 'by', 'dybvig', '1988', 'as', 'well', 'as', 'comonotonicity']] | [-0.04021522406462545, 0.046383793413569435, -0.10864726167006819, 0.1274333524509011, -0.10906144326430893, -0.11967670530402841, 0.07602736653290063, 0.35809628505294566, -0.2751880155649976, -0.28079582831363203, 0.18691467054440666, -0.24660771116005065, -0.14798546744571459, 0.18702456600763878, -0.15192504244569305, 0.06335074404443866, -0.024720336493348406, 0.019013866595053507, -0.014149143863208244, -0.257271286304692, 0.3202884284557479, 0.07334105072490801, 0.2800517700564673, 0.014629573609122884, 0.1298177874098732, 0.06462337692250784, -0.08171127003260722, -0.0050700719611910736, -0.11341624276172076, 0.14359894149096805, 0.2260146195147291, 0.15557345761438815, 0.3114857847114729, -0.3646790716409788, -0.21369953329944721, 0.1165992998622497, 0.045383759478333396, 0.07954904715809101, -0.028382685581639967, -0.2597630529829832, 0.043172581476011426, -0.21633684360117555, -0.12495317453492398, -0.05124808094142196, 0.027598672137360707, 0.05918327518347129, -0.2954027008038954, 0.09597867650304112, 0.09892068116677594, 0.023338340284035183, -0.018179499936968994, -0.1447119771494208, -0.00878059495214338, 0.09471284476692014, 0.07829632454608332, -0.006675348727023838, 0.10155888089788294, -0.11029019849984167, -0.1506983348995036, 0.3639483530782642, -0.0866570661734424, -0.1938631950886311, 0.12045053878764266, -0.12277024910376172, -0.13325788469758826, 0.05883917354795838, 0.14962974054930367, 0.10978841885628406, -0.16752345087964124, 0.09446183703818019, -0.09419144031147812, 0.10719557173297714, 0.09333283330583683, 0.0030224655371890448, 0.15339575937479108, 0.13882543792878496, 0.10728281470033053, 0.13879244698039647, -0.09319752109210903, -0.11041223634443481, -0.27246696346169597, -0.12189371171015724, -0.2381453607840655, 0.03641531167325573, -0.10153329987748021, -0.18502773875457662, 0.3958740391742403, 0.1553303350968652, 0.2015177921661846, 0.05998025274461257, 0.2983148656894288, 0.14474044023973814, -0.008331433062607023, 0.07915938506011685, 0.14357529137915687, 0.12203452286797915, 0.07512998185773319, -0.12787474724725237, 0.17742076760297207, 0.09367762560843029] |
1,803.03997 | Bulk Matter and the Boundary Quantum Null Energy Condition | We investigate the quantum null energy condition (QNEC) in holographic CFTs,
focusing on half-spaces and particular classes of states. We present direct,
and in certain cases nonperturbative, calculations for both the diagonal and
off- diagonal variational derivatives of entanglement entropy. In d > 2, we
find that the QNEC is saturated. We compute relations between the off-diagonal
variation of entanglement, boundary relative entropy, and the bulk stress
tensor. Strong subadditivity then leads to energy conditions in the bulk. In d
= 2, we find that the QNEC is in general not saturated when the Ryu-Takayanagi
surface intersects bulk matter. Moreover, when bulk matter is present the QNEC
can imply new bulk energy conditions. For a simple class of states, we derive
an example that is stronger than the bulk averaged null energy condition and
reduces to it in certain limits.
| hep-th | we investigate the quantum null energy condition qnec in holographic cfts focusing on halfspaces and particular classes of states we present direct and in certain cases nonperturbative calculations for both the diagonal and off diagonal variational derivatives of entanglement entropy in d 2 we find that the qnec is saturated we compute relations between the offdiagonal variation of entanglement boundary relative entropy and the bulk stress tensor strong subadditivity then leads to energy conditions in the bulk in d 2 we find that the qnec is in general not saturated when the ryutakayanagi surface intersects bulk matter moreover when bulk matter is present the qnec can imply new bulk energy conditions for a simple class of states we derive an example that is stronger than the bulk averaged null energy condition and reduces to it in certain limits | [['we', 'investigate', 'the', 'quantum', 'null', 'energy', 'condition', 'qnec', 'in', 'holographic', 'cfts', 'focusing', 'on', 'halfspaces', 'and', 'particular', 'classes', 'of', 'states', 'we', 'present', 'direct', 'and', 'in', 'certain', 'cases', 'nonperturbative', 'calculations', 'for', 'both', 'the', 'diagonal', 'and', 'off', 'diagonal', 'variational', 'derivatives', 'of', 'entanglement', 'entropy', 'in', 'd', '2', 'we', 'find', 'that', 'the', 'qnec', 'is', 'saturated', 'we', 'compute', 'relations', 'between', 'the', 'offdiagonal', 'variation', 'of', 'entanglement', 'boundary', 'relative', 'entropy', 'and', 'the', 'bulk', 'stress', 'tensor', 'strong', 'subadditivity', 'then', 'leads', 'to', 'energy', 'conditions', 'in', 'the', 'bulk', 'in', 'd', '2', 'we', 'find', 'that', 'the', 'qnec', 'is', 'in', 'general', 'not', 'saturated', 'when', 'the', 'ryutakayanagi', 'surface', 'intersects', 'bulk', 'matter', 'moreover', 'when', 'bulk', 'matter', 'is', 'present', 'the', 'qnec', 'can', 'imply', 'new', 'bulk', 'energy', 'conditions', 'for', 'a', 'simple', 'class', 'of', 'states', 'we', 'derive', 'an', 'example', 'that', 'is', 'stronger', 'than', 'the', 'bulk', 'averaged', 'null', 'energy', 'condition', 'and', 'reduces', 'to', 'it', 'in', 'certain', 'limits']] | [-0.16500015917868502, 0.18412223821128398, -0.08210197126870786, 0.10183048731836396, -0.03190597508480583, -0.15275603316494843, 0.006968901984467832, 0.3170738661310811, -0.2184932585687552, -0.23696055979319458, 0.05067092308730724, -0.27783875750121323, -0.0977339449952748, 0.15707337713894853, -0.03862787422258407, 0.0421389639613799, 0.01985135667053038, 0.07509911899873312, -0.14698055844780974, -0.22260079780370806, 0.3712866005987145, 0.010509462604481403, 0.33357313137663447, 0.17068101962069995, 0.05559859950638687, -0.006560188936629751, 0.04789435882053837, 0.06200940567466033, -0.203516226706373, 0.086731190606783, 0.2000395791888561, 0.07793722768732603, 0.17840575595534797, -0.4551650270063808, -0.20096895258630748, 0.13501784661649793, 0.07259674284074023, 0.12425744023336016, 0.00563085236016364, -0.21361040349617816, 0.07572300156470442, -0.14233196274363907, -0.14257075227088417, -0.09381121569110648, 0.025933421905273975, -0.07319263970827666, -0.2767456435544443, 0.16547584356537656, 0.07142055502855868, 0.00812746283206608, -0.1075279683455069, -0.06199245786452936, -0.08748740615893452, 0.0541424739256373, 0.06453696933939405, -0.019086054968310222, 0.11781502324088976, -0.15897024011887287, -0.031908489065244794, 0.31271655468837073, -0.08772791050042555, -0.21258513518082706, 0.17758547885181464, -0.17592033092607406, -0.13707089562481944, 0.0886285298274479, 0.10250692902827986, 0.14210026299553938, -0.10237573365874056, 0.13941636308479338, -0.06100197070180371, 0.12020675772531093, 0.07563896154633899, 0.07572730492582828, 0.17895660721494452, 0.047077896706996136, 0.10836086327638612, 0.21286637772826236, -0.07002839093447487, -0.07558971791582154, -0.40181767292644666, -0.24110006793415634, -0.20101679578774434, 0.07339305564285799, -0.13380322358547794, -0.15201141289097891, 0.344333617053791, 0.1044365136582148, 0.16756461971047995, 0.07321386311905108, 0.22061961489743082, 0.14070976367034693, 0.04181408336338843, 0.1469650241661061, 0.3032664938735357, 0.1496543593407757, 0.04675145127027687, -0.23870983234424467, 0.023234499530677778, 0.10623916601964636] |
1,803.03998 | Kernels by rainbow paths in arc-colored tournaments | For an arc-colored digraph $D$, define its {\em kernel by rainbow paths} to
be a set $S$ of vertices such that (i) no two vertices of $S$ are connected by
a rainbow path in $D$, and (ii) every vertex outside $S$ can reach $S$ by a
rainbow path in $D$. In this paper, we show that it is NP-complete to decide
whether an arc-colored tournament has a kernel by rainbow paths, where a {\em
tournament} is an orientation of a complete graph. In addition, we show that
every arc-colored $n$-vertex tournament with all its strongly connected
$k$-vertex subtournaments, $3\leq k\leq n$, colored with at least $k-1$ colors
has a kernel by rainbow paths, and the number of colors required cannot be
reduced.
| math.CO | for an arccolored digraph d define its em kernel by rainbow paths to be a set s of vertices such that i no two vertices of s are connected by a rainbow path in d and ii every vertex outside s can reach s by a rainbow path in d in this paper we show that it is npcomplete to decide whether an arccolored tournament has a kernel by rainbow paths where a em tournament is an orientation of a complete graph in addition we show that every arccolored nvertex tournament with all its strongly connected kvertex subtournaments 3leq kleq n colored with at least k1 colors has a kernel by rainbow paths and the number of colors required cannot be reduced | [['for', 'an', 'arccolored', 'digraph', 'd', 'define', 'its', 'em', 'kernel', 'by', 'rainbow', 'paths', 'to', 'be', 'a', 'set', 's', 'of', 'vertices', 'such', 'that', 'i', 'no', 'two', 'vertices', 'of', 's', 'are', 'connected', 'by', 'a', 'rainbow', 'path', 'in', 'd', 'and', 'ii', 'every', 'vertex', 'outside', 's', 'can', 'reach', 's', 'by', 'a', 'rainbow', 'path', 'in', 'd', 'in', 'this', 'paper', 'we', 'show', 'that', 'it', 'is', 'npcomplete', 'to', 'decide', 'whether', 'an', 'arccolored', 'tournament', 'has', 'a', 'kernel', 'by', 'rainbow', 'paths', 'where', 'a', 'em', 'tournament', 'is', 'an', 'orientation', 'of', 'a', 'complete', 'graph', 'in', 'addition', 'we', 'show', 'that', 'every', 'arccolored', 'nvertex', 'tournament', 'with', 'all', 'its', 'strongly', 'connected', 'kvertex', 'subtournaments', '3leq', 'kleq', 'n', 'colored', 'with', 'at', 'least', 'k1', 'colors', 'has', 'a', 'kernel', 'by', 'rainbow', 'paths', 'and', 'the', 'number', 'of', 'colors', 'required', 'can', 'not', 'be', 'reduced']] | [-0.18799537623952317, 0.201710125037097, -0.060162735887144395, -0.0032354634628078438, -0.12764840906228475, -0.1865255161741279, 0.07609561490315217, 0.4419145534738777, -0.24964109084349337, -0.2978817385174637, 0.036839083214744744, -0.3767415943434386, -0.1555626616128001, 0.04289776577833828, -0.10531200052473724, -0.04458032587138042, 0.14562271316195044, 0.14373209396362063, 0.09403614626394782, -0.3100682534705715, 0.2689366085367628, -0.07439433554437284, 0.08074259738309111, 0.09841657036582266, 0.09221785809329855, 0.06654162016674513, 0.023937834642554928, 0.17972025918827308, -0.18738255474418997, -0.0013245365173533195, 0.2785897075645323, 0.21303046210025384, 0.2682270141454732, -0.39041925737079675, -0.17167093457911559, 0.24289875086094062, 0.11203605460941912, -0.006927254352324862, 0.06216000954098091, -0.15483812545615483, 0.17307284711746546, -0.1086865660499751, -0.11146408415255629, 0.060303669589442936, 0.18415583403993066, -0.02191404469795828, -0.29626571377587874, -0.09270442115915258, 0.10450773369672338, -0.014034657890537405, 0.1297362570828811, -0.12735887723634157, -0.0727223374642341, 0.04394624916821476, -0.1074813328024636, 0.15120057660208, -0.04367586575558303, -0.11551877261684616, -0.2110581862005761, 0.34326232666134593, -0.046638714232883315, -0.14640924070604008, 0.10363287423790349, -0.12769064546858028, -0.1339270281567564, 0.13843684096071052, 0.05827664459745089, 0.19507755840015484, -0.17410823438180292, 0.1507492963597557, -0.136355229070395, 0.12297136835589233, 0.15225877875946764, -0.004212758539819984, 0.15396710711579137, 0.13632432382356952, 0.1884106617890359, 0.1450951987767698, 0.030905561059773937, 0.0917813704307456, -0.3340675864762407, -0.12335663808252269, -0.2622667708996365, 0.07822767386557931, -0.19934689820288848, -0.1703396449698423, 0.363231319676691, 0.09165024682046558, 0.216006927419363, 0.06529149948051427, 0.20504308408372315, 0.07840384757517727, 0.0371226512607399, 0.24667747918425537, 0.10560321775681483, 0.11657027928612945, -0.07765916022434224, -0.22100331876199783, 0.05569761542781309, 0.1390523816178727] |
1,803.03999 | Function Estimation Using Data Adaptive Kernel Estimation - How Much
Smoothing? | We determine the expected error by smoothing the data locally. Then we
optimize the shape of the kernel smoother to minimize the error. Because the
optimal estimator depends on the unknown function, our scheme automatically
adjusts to the unknown function. By self-consistently adjusting the kernel
smoother, the total estimator adapts to the data.
Goodness of fit estimators select a kernel halfwidth by minimizing a function
of the halfwidth which is based on the average square residual fit error:
$ASR(h)$. A penalty term is included to adjust for using the same data to
estimate the function and to evaluate the mean square error. Goodness of fit
estimators are relatively simple to implement, but the minimum (of the goodness
of fit functional) tends to be sensitive to small perturbations. To remedy this
sensitivity problem, we fit the mean square error %goodness of fit functional
to a two parameter model prior to determining the optimal halfwidth.
Plug-in derivative estimators estimate the second derivative of the unknown
function in an initial step, and then substitute this estimate into the
asymptotic formula.
| stat.ME cs.AI eess.SP math.ST physics.data-an stat.TH | we determine the expected error by smoothing the data locally then we optimize the shape of the kernel smoother to minimize the error because the optimal estimator depends on the unknown function our scheme automatically adjusts to the unknown function by selfconsistently adjusting the kernel smoother the total estimator adapts to the data goodness of fit estimators select a kernel halfwidth by minimizing a function of the halfwidth which is based on the average square residual fit error asrh a penalty term is included to adjust for using the same data to estimate the function and to evaluate the mean square error goodness of fit estimators are relatively simple to implement but the minimum of the goodness of fit functional tends to be sensitive to small perturbations to remedy this sensitivity problem we fit the mean square error goodness of fit functional to a two parameter model prior to determining the optimal halfwidth plugin derivative estimators estimate the second derivative of the unknown function in an initial step and then substitute this estimate into the asymptotic formula | [['we', 'determine', 'the', 'expected', 'error', 'by', 'smoothing', 'the', 'data', 'locally', 'then', 'we', 'optimize', 'the', 'shape', 'of', 'the', 'kernel', 'smoother', 'to', 'minimize', 'the', 'error', 'because', 'the', 'optimal', 'estimator', 'depends', 'on', 'the', 'unknown', 'function', 'our', 'scheme', 'automatically', 'adjusts', 'to', 'the', 'unknown', 'function', 'by', 'selfconsistently', 'adjusting', 'the', 'kernel', 'smoother', 'the', 'total', 'estimator', 'adapts', 'to', 'the', 'data', 'goodness', 'of', 'fit', 'estimators', 'select', 'a', 'kernel', 'halfwidth', 'by', 'minimizing', 'a', 'function', 'of', 'the', 'halfwidth', 'which', 'is', 'based', 'on', 'the', 'average', 'square', 'residual', 'fit', 'error', 'asrh', 'a', 'penalty', 'term', 'is', 'included', 'to', 'adjust', 'for', 'using', 'the', 'same', 'data', 'to', 'estimate', 'the', 'function', 'and', 'to', 'evaluate', 'the', 'mean', 'square', 'error', 'goodness', 'of', 'fit', 'estimators', 'are', 'relatively', 'simple', 'to', 'implement', 'but', 'the', 'minimum', 'of', 'the', 'goodness', 'of', 'fit', 'functional', 'tends', 'to', 'be', 'sensitive', 'to', 'small', 'perturbations', 'to', 'remedy', 'this', 'sensitivity', 'problem', 'we', 'fit', 'the', 'mean', 'square', 'error', 'goodness', 'of', 'fit', 'functional', 'to', 'a', 'two', 'parameter', 'model', 'prior', 'to', 'determining', 'the', 'optimal', 'halfwidth', 'plugin', 'derivative', 'estimators', 'estimate', 'the', 'second', 'derivative', 'of', 'the', 'unknown', 'function', 'in', 'an', 'initial', 'step', 'and', 'then', 'substitute', 'this', 'estimate', 'into', 'the', 'asymptotic', 'formula']] | [-0.0171383663585981, -0.014075465544589282, -0.11029890487208666, 0.15940230676311662, -0.10925679865018041, -0.13802510100438006, 0.09229695305822877, 0.38170186523215804, -0.292984705905176, -0.35205999785102904, 0.12951149744449966, -0.2531027590025174, -0.10989520309951993, 0.13800480941559232, -0.09960038601209155, 0.12203566782409325, 0.014373338846925517, 0.043289519899355415, -0.11928870085929785, -0.27869640275259205, 0.26940520987078675, 0.13107720196289432, 0.28591863775562326, -0.014435887585436418, 0.1343429274030231, 0.012611613505710424, -0.052467320622368294, -0.04032036011234264, -0.19751791692661672, 0.11091824778718133, 0.16658501488324295, 0.10722337211270562, 0.3396480857944963, -0.32920883028154174, -0.16902510344516486, 0.14967241535156395, 0.12471378105295695, 0.04253011419429888, 0.06822114665622146, -0.22347451924790881, 0.08830617951091634, -0.14702724695300937, -0.13712884794354482, -0.07412540977185761, -0.029813313481678382, 0.0598116952248595, -0.3933644359084693, 0.11014803035703319, -0.01750073908690617, 0.004284896013401026, -0.0951785961369751, -0.16361455956675028, 0.003259063745975833, 0.11939242904587775, 0.08977865413114407, 0.07503732143562626, 0.1547986032779921, -0.0816253449311675, -0.008794863639526408, 0.29317014543762937, -0.11702202419242398, -0.2694717726500874, 0.05160967188302576, -0.11343632971561006, -0.045690812107006255, 0.1299792452929606, 0.21122171870427503, 0.06416313893119381, -0.18715660682276145, 0.034169025649713476, 0.007968628371600062, 0.19176946784665977, 0.0036036507914435456, -0.029866707093209367, 0.10535974918589504, 0.12872808185321363, 0.1436046845523048, 0.16315830323847794, -0.14962509772687388, -0.06391049628357658, -0.34238994970325043, -0.10711577740519053, -0.2807827678718075, -0.03426838134658861, -0.14626705164697673, -0.22731912906932517, 0.442385069977697, 0.16239578371856955, 0.23377094718902794, 0.11563502383399861, 0.3334624733225527, 0.18113238569044784, 0.08175568594808945, 0.08558193869380788, 0.2297106526649176, 0.11475736650490118, -0.02644757526352557, -0.2582627203930976, 0.14503072360689243, 0.06408244372654405] |
1,803.04 | Preparing Bengali-English Code-Mixed Corpus for Sentiment Analysis of
Indian Languages | Analysis of informative contents and sentiments of social users has been
attempted quite intensively in the recent past. Most of the systems are usable
only for monolingual data and fails or gives poor results when used on data
with code-mixing property. To gather attention and encourage researchers to
work on this crisis, we prepared gold standard Bengali-English code-mixed data
with language and polarity tag for sentiment analysis purposes. In this paper,
we discuss the systems we prepared to collect and filter raw Twitter data. In
order to reduce manual work while annotation, hybrid systems combining rule
based and supervised models were developed for both language and sentiment
tagging. The final corpus was annotated by a group of annotators following a
few guidelines. The gold standard corpus thus obtained has impressive
inter-annotator agreement obtained in terms of Kappa values. Various metrics
like Code-Mixed Index (CMI), Code-Mixed Factor (CF) along with various aspects
(language and emotion) also qualitatively polled the code-mixed and sentiment
properties of the corpus.
| cs.CL | analysis of informative contents and sentiments of social users has been attempted quite intensively in the recent past most of the systems are usable only for monolingual data and fails or gives poor results when used on data with codemixing property to gather attention and encourage researchers to work on this crisis we prepared gold standard bengalienglish codemixed data with language and polarity tag for sentiment analysis purposes in this paper we discuss the systems we prepared to collect and filter raw twitter data in order to reduce manual work while annotation hybrid systems combining rule based and supervised models were developed for both language and sentiment tagging the final corpus was annotated by a group of annotators following a few guidelines the gold standard corpus thus obtained has impressive interannotator agreement obtained in terms of kappa values various metrics like codemixed index cmi codemixed factor cf along with various aspects language and emotion also qualitatively polled the codemixed and sentiment properties of the corpus | [['analysis', 'of', 'informative', 'contents', 'and', 'sentiments', 'of', 'social', 'users', 'has', 'been', 'attempted', 'quite', 'intensively', 'in', 'the', 'recent', 'past', 'most', 'of', 'the', 'systems', 'are', 'usable', 'only', 'for', 'monolingual', 'data', 'and', 'fails', 'or', 'gives', 'poor', 'results', 'when', 'used', 'on', 'data', 'with', 'codemixing', 'property', 'to', 'gather', 'attention', 'and', 'encourage', 'researchers', 'to', 'work', 'on', 'this', 'crisis', 'we', 'prepared', 'gold', 'standard', 'bengalienglish', 'codemixed', 'data', 'with', 'language', 'and', 'polarity', 'tag', 'for', 'sentiment', 'analysis', 'purposes', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'systems', 'we', 'prepared', 'to', 'collect', 'and', 'filter', 'raw', 'twitter', 'data', 'in', 'order', 'to', 'reduce', 'manual', 'work', 'while', 'annotation', 'hybrid', 'systems', 'combining', 'rule', 'based', 'and', 'supervised', 'models', 'were', 'developed', 'for', 'both', 'language', 'and', 'sentiment', 'tagging', 'the', 'final', 'corpus', 'was', 'annotated', 'by', 'a', 'group', 'of', 'annotators', 'following', 'a', 'few', 'guidelines', 'the', 'gold', 'standard', 'corpus', 'thus', 'obtained', 'has', 'impressive', 'interannotator', 'agreement', 'obtained', 'in', 'terms', 'of', 'kappa', 'values', 'various', 'metrics', 'like', 'codemixed', 'index', 'cmi', 'codemixed', 'factor', 'cf', 'along', 'with', 'various', 'aspects', 'language', 'and', 'emotion', 'also', 'qualitatively', 'polled', 'the', 'codemixed', 'and', 'sentiment', 'properties', 'of', 'the', 'corpus']] | [-0.02129812561818681, 0.019866673836033, -0.06255398092396332, 0.09499450446561572, -0.1661879754794592, -0.17021357240155338, 0.08281427394725721, 0.4491983338738933, -0.18924911054147578, -0.35843762204502566, 0.0617100408131426, -0.38426631931215527, -0.1020961600341693, 0.21352134333274356, -0.10993139176544818, 0.07654782404115945, 0.14375726768013203, 0.07846291800078964, -0.01846652989924857, -0.3029517638440611, 0.32176342149632, 0.04752937958321788, 0.3981926868302804, 0.03730815686003277, 0.05911949505803712, -0.03552204769979598, -0.10892334278164939, -0.008204276622696356, -0.09180148924051812, 0.18714064322412013, 0.3663637449128146, 0.1934081121531287, 0.307509356944215, -0.3885002595118501, -0.19338843872149786, 0.03897020011067842, 0.13129310439143216, 0.09919305079842382, -0.0488073399967768, -0.3639070086294051, 0.10178444654483235, -0.20233396960168398, 0.03240185819961357, -0.1304820069309437, 0.03980352519305818, -0.0003483561068688604, -0.23874705250262085, 0.056268613817784086, 0.07404244910100136, 0.1682948710030001, -0.027038220072052244, -0.15772505357692188, 0.01004181090375465, 0.20206408018729594, 0.12107953378987131, 0.02885128675508454, 0.12006085699628756, -0.14574121846782156, -0.16008626204336796, 0.37682363882265757, -0.08706428669040289, -0.18886631371622736, 0.2055510954522161, -0.06794466458712563, -0.1969009841425401, 0.025260805668817325, 0.21859748384661296, 0.07488507482815873, -0.1998395701042186, -0.0022240017713612004, -0.029387950250935373, 0.2585175630975176, 0.10267489418443856, -0.027590652980363686, 0.1525428130672398, 0.21707883545366877, -0.08859184187074953, 0.10628446671039318, -0.04969765299588978, -0.03077266631210505, -0.1582649657495715, -0.1152046481944677, -0.1319448861208829, -0.023204932518472724, -0.06760345731189855, -0.12706411330480918, 0.38343154267605506, 0.18364917964984973, 0.15008424664424225, 0.05064599232494154, 0.2620545054644798, -0.014443831749711976, 0.07225427999951398, 0.04754789824788035, 0.14076462733192427, 0.0008549212365213669, 0.22151891814516575, -0.10868171430051779, 0.10758043481813123, 0.02189640056228999] |
1,803.04001 | Skyrmions Driven by Intrinsic Magnons | We study the dynamics of a skyrmion in a magnetic insulating nanowire in the
presence of time-dependent oscillating magnetic field gradients. These ac
fields act as a net driving force on the skyrmion via its own intrinsic
magnetic excitations. In a microscopic quantum field theory approach we include
the unavoidable coupling of the external field to the magnons, which gives rise
to time-dependent dissipation for the skyrmion. We demonstrate that the
magnetic ac field induces a super-Ohmic to Ohmic crossover behavior for the
skyrmion dissipation kernels with time-dependent Ohmic terms. The ac driving of
the magnon bath at resonance results in a unidirectional helical propagation of
the skyrmion in addition to the otherwise periodic bounded motion.
| cond-mat.mes-hall quant-ph | we study the dynamics of a skyrmion in a magnetic insulating nanowire in the presence of timedependent oscillating magnetic field gradients these ac fields act as a net driving force on the skyrmion via its own intrinsic magnetic excitations in a microscopic quantum field theory approach we include the unavoidable coupling of the external field to the magnons which gives rise to timedependent dissipation for the skyrmion we demonstrate that the magnetic ac field induces a superohmic to ohmic crossover behavior for the skyrmion dissipation kernels with timedependent ohmic terms the ac driving of the magnon bath at resonance results in a unidirectional helical propagation of the skyrmion in addition to the otherwise periodic bounded motion | [['we', 'study', 'the', 'dynamics', 'of', 'a', 'skyrmion', 'in', 'a', 'magnetic', 'insulating', 'nanowire', 'in', 'the', 'presence', 'of', 'timedependent', 'oscillating', 'magnetic', 'field', 'gradients', 'these', 'ac', 'fields', 'act', 'as', 'a', 'net', 'driving', 'force', 'on', 'the', 'skyrmion', 'via', 'its', 'own', 'intrinsic', 'magnetic', 'excitations', 'in', 'a', 'microscopic', 'quantum', 'field', 'theory', 'approach', 'we', 'include', 'the', 'unavoidable', 'coupling', 'of', 'the', 'external', 'field', 'to', 'the', 'magnons', 'which', 'gives', 'rise', 'to', 'timedependent', 'dissipation', 'for', 'the', 'skyrmion', 'we', 'demonstrate', 'that', 'the', 'magnetic', 'ac', 'field', 'induces', 'a', 'superohmic', 'to', 'ohmic', 'crossover', 'behavior', 'for', 'the', 'skyrmion', 'dissipation', 'kernels', 'with', 'timedependent', 'ohmic', 'terms', 'the', 'ac', 'driving', 'of', 'the', 'magnon', 'bath', 'at', 'resonance', 'results', 'in', 'a', 'unidirectional', 'helical', 'propagation', 'of', 'the', 'skyrmion', 'in', 'addition', 'to', 'the', 'otherwise', 'periodic', 'bounded', 'motion']] | [-0.259426709766307, 0.2314201948947498, -0.05014057565432299, 0.012306323088304108, -0.09648945216282175, -0.09481372381961936, 0.043850571963863834, 0.37166325524770494, -0.27524026081865205, -0.27152926184172776, -0.004480776093009025, -0.2363659229193782, -0.12541709876828025, 0.2197517976044388, 0.03478962077020571, -0.0019342352175515081, -0.0319290220946202, 0.05448746881929451, 0.005099578393253915, -0.1410492253911296, 0.27944384336648187, -0.03129854125215608, 0.3021081589615968, 0.08052649376271613, 0.08563105241748793, -0.020733251983042936, 0.1284289173059294, 0.05700592452595974, -0.14174679939160656, 0.03221614420381856, 0.1499874929833258, -0.13783465237918727, 0.23007185702565416, -0.5208752091074812, -0.21738805828599966, 0.034697342920919944, 0.1611618789731814, 0.2115658305230117, -0.06353413297168525, -0.2943038588614556, 0.024613081011921167, -0.15078206288885196, -0.1504179337142228, -0.13045600537563964, 0.020541740772073512, 0.03875358153439673, -0.2903735446021089, 0.11125762178562582, 0.1300561854922903, 0.08398746036731734, -0.15214312620208084, -0.010641015620484692, -0.038776336839936414, 0.08372004294430772, 0.07711568771427947, 0.09654886907584773, 0.24461195611491285, -0.20704441162725462, -0.1308602333060819, 0.3077698560142568, -0.12544425690129143, -0.18424672814053966, 0.1427536635370604, -0.1769969066178952, -0.017727554133483047, 0.15381426010923138, 0.16086969323353922, 0.0668928648690404, -0.11440955773638241, 0.08634321961214701, 0.01603270931859854, 0.10366314079548264, 0.02573067276610126, 0.0672568296170633, 0.28003781645333975, 0.1480598838995853, 0.057681325509951545, 0.20636267515886897, -0.11609591340349087, -0.11201431877220627, -0.2866673273022351, -0.12041063630022109, -0.20381972394434028, 0.107537160940661, -0.08315179121664501, -0.2512585598260871, 0.4295378406973684, 0.19167197090252464, 0.13328557911907032, -0.061805415585444404, 0.304329674530389, 0.15444318909932667, 0.06805563191000115, 0.06870198480640377, 0.2674674668032194, 0.23054091402546278, 0.17205055585885742, -0.3891912965296671, -0.026540406477830278, 0.0043838827890606905] |
1,803.04002 | On the nature of $\Xi_c(2930)$ | The single charmed excited $\Xi_c(2930)$ state was discovered many years ago
by BABAR collaboration and recently confirmed by Belle experiment. However,
both of these experiments, unfortunately, could not fix the quantum numbers of
this particle and its nature is under debates. In the present study, we
calculate its mass and width of its dominant decay to $ \Lambda_c K $. To this
end we consider $\Xi_c(2930)$ state once as angularly excited and then radially
excited single charmed baryon in $ \Xi_c$ channel. Comparison of the obtained
results with the experimental data suggests assignment of $\Xi_c(2930)$ state
as the angular excitation of the ground state $\Xi_c$ baryon with quantum
numbers $J^P=\frac{1}{2}^{-}$.
| hep-ph hep-ex hep-lat | the single charmed excited xi_c2930 state was discovered many years ago by babar collaboration and recently confirmed by belle experiment however both of these experiments unfortunately could not fix the quantum numbers of this particle and its nature is under debates in the present study we calculate its mass and width of its dominant decay to lambda_c k to this end we consider xi_c2930 state once as angularly excited and then radially excited single charmed baryon in xi_c channel comparison of the obtained results with the experimental data suggests assignment of xi_c2930 state as the angular excitation of the ground state xi_c baryon with quantum numbers jpfrac12 | [['the', 'single', 'charmed', 'excited', 'xi_c2930', 'state', 'was', 'discovered', 'many', 'years', 'ago', 'by', 'babar', 'collaboration', 'and', 'recently', 'confirmed', 'by', 'belle', 'experiment', 'however', 'both', 'of', 'these', 'experiments', 'unfortunately', 'could', 'not', 'fix', 'the', 'quantum', 'numbers', 'of', 'this', 'particle', 'and', 'its', 'nature', 'is', 'under', 'debates', 'in', 'the', 'present', 'study', 'we', 'calculate', 'its', 'mass', 'and', 'width', 'of', 'its', 'dominant', 'decay', 'to', 'lambda_c', 'k', 'to', 'this', 'end', 'we', 'consider', 'xi_c2930', 'state', 'once', 'as', 'angularly', 'excited', 'and', 'then', 'radially', 'excited', 'single', 'charmed', 'baryon', 'in', 'xi_c', 'channel', 'comparison', 'of', 'the', 'obtained', 'results', 'with', 'the', 'experimental', 'data', 'suggests', 'assignment', 'of', 'xi_c2930', 'state', 'as', 'the', 'angular', 'excitation', 'of', 'the', 'ground', 'state', 'xi_c', 'baryon', 'with', 'quantum', 'numbers', 'jpfrac12']] | [-0.1105423338154209, 0.24946002871294237, -0.06913261913267948, 0.07493187257014737, -0.04435983728878548, -0.1422211449010141, 0.10849461109360035, 0.3227128860688655, -0.18925756600763755, -0.28810793665350876, 0.023678179470186828, -0.34212705503418067, 0.013412020021231374, 0.10475936551713254, 0.09607714372600003, 0.10829063277162838, 0.11526282721038072, 0.05604369917919285, 0.0067634338112635035, -0.2066243020534759, 0.31833408880874375, 0.029233618367411125, 0.22525733692580224, 0.0979513103076013, 0.004268554823742918, -0.023749681234807994, -0.004568910591791723, -0.05572995499089778, -0.16435331893893323, 0.04979373814068108, 0.2322592208353437, 0.14448636523056252, 0.21176163223463276, -0.38675017012544327, -0.1321016598632124, 0.11827387216840392, 0.19094240755630465, 0.15972219818820046, -0.05169511703278208, -0.41145855854221874, 0.11710593378863289, -0.1685623135722338, -0.15628029650651684, -0.09329757206772984, 0.040464610653433285, -0.04296829075243533, -0.22552002852817424, 0.1243043803032183, -0.06321059443735491, 0.032186018894905244, -0.07342800745527286, -0.22966006188000612, -0.06400202745441173, 0.03820335058164652, 0.07522660926654587, 0.07403452061856532, 0.10665934093331343, -0.13323776663289727, -0.1895125916436593, 0.34773415585579437, -0.04330235239158185, -0.08762187622139388, 0.10807727604873792, -0.17766658793895496, -0.1097523402694665, 0.1160004629414076, 0.13191022223436108, 0.0710349058097002, -0.1434196034428951, 0.03553226814936046, -0.06812929070911536, 0.18033310772294056, 0.08308674561982608, 0.0996726919835973, 0.19595653417511522, 0.14755447649301212, -0.049951337723422654, 0.12054657286128778, -0.11113422110276384, -0.08194870297213859, -0.2823818674121731, -0.13842383915749945, -0.1812474236553796, 0.08352251349152479, 0.08261324662473662, -0.06784541728236129, 0.3887166292276059, 0.05502606463557649, 0.28845687114816404, -0.02282383847355007, 0.27223070240884184, 0.08559364534557631, 0.013456639548694001, 0.07518168058894818, 0.2989135432648951, 0.22174100655078818, 0.13410245363435178, -0.2936174080654909, 0.048641535932215575, -0.03481205384394972] |
1,803.04003 | Precise Near-Infrared Radial Velocities with iSHELL | We present a possible NASA key project using the iSHELL near-infrared
high-resolution echelle spectrograph on the NASA Infrared Telescope Facility
for precise radial velocity follow-up of candidate transiting exoplanets
identified by the NASA TESS mission. We briefly review key motivations and
challenges with near-infrared radial velocities. We present the current status
of our preliminary radial velocity analysis from the first year on sky with
iSHELL.
| astro-ph.IM astro-ph.EP astro-ph.SR | we present a possible nasa key project using the ishell nearinfrared highresolution echelle spectrograph on the nasa infrared telescope facility for precise radial velocity followup of candidate transiting exoplanets identified by the nasa tess mission we briefly review key motivations and challenges with nearinfrared radial velocities we present the current status of our preliminary radial velocity analysis from the first year on sky with ishell | [['we', 'present', 'a', 'possible', 'nasa', 'key', 'project', 'using', 'the', 'ishell', 'nearinfrared', 'highresolution', 'echelle', 'spectrograph', 'on', 'the', 'nasa', 'infrared', 'telescope', 'facility', 'for', 'precise', 'radial', 'velocity', 'followup', 'of', 'candidate', 'transiting', 'exoplanets', 'identified', 'by', 'the', 'nasa', 'tess', 'mission', 'we', 'briefly', 'review', 'key', 'motivations', 'and', 'challenges', 'with', 'nearinfrared', 'radial', 'velocities', 'we', 'present', 'the', 'current', 'status', 'of', 'our', 'preliminary', 'radial', 'velocity', 'analysis', 'from', 'the', 'first', 'year', 'on', 'sky', 'with', 'ishell']] | [-0.06153943790839268, 0.12101144953989065, -0.12375017187486474, -0.06352521334416592, -0.23484185383870052, -0.05412491261242674, 0.043664844814114846, 0.4069976370495099, -0.11334163181913587, -0.34544855353350823, 0.13955879285215186, -0.3287290822428006, -0.09526036559478739, 0.28080920927728026, -0.08816247108177497, 0.09919333145595514, 0.20310188746796204, -0.1329928137935125, 0.054879235317751476, -0.2864337392437917, 0.2921136575249525, 0.18880555649073077, 0.1348003386018368, -0.07457546929900463, 0.09779003277564279, -0.04438690510130702, -0.2217285054234358, -0.0497490335864803, -0.28078474047808694, 0.09441254321629038, 0.2733350618594648, 0.21091565939669427, 0.243173449097846, -0.2968162467918144, -0.13147244016424967, -0.0200370547397492, 0.1154116190952034, -0.029135870131162495, -0.11309998127488563, -0.378513687906357, 0.002562880186507335, -0.16326130158626118, -0.2837716345532009, 0.004077680351642462, 0.03516051177508556, 0.08392429917047803, -0.16033601740805004, -0.026845014912004653, -0.15953255077967277, 0.24390874684143524, -0.24779008608132314, -0.20187534309493807, -0.04365161420025218, 0.12284245452342125, -0.05209008650137828, 0.04579682364844932, 0.038465809471045546, -0.10509973143299038, -0.03661415278911591, 0.3900290153060968, -0.1547000357021506, 0.14184813688580805, 0.1322062628916823, -0.2331722818959791, -0.19989371803374245, 0.04867822714149952, 0.20963148517677418, 0.19142341536398116, -0.22406749102072074, 0.03741860359531039, -0.0006168663358459106, 0.20882910719284645, 0.06440459974110127, 0.09084947119968442, 0.4050298766877789, 0.19403386483542048, 0.07377878394551002, 0.06163689562907586, -0.3838188375632923, 0.034828658214806074, -0.3330868761126812, -0.149585336418106, -0.13960168656821434, 0.00249400110467552, 0.005848310544164493, -0.02245906559893718, 0.3903265441696231, 0.21560490598472265, 0.09371263198554516, 0.0004554806778637263, 0.4456493490303938, -0.03777089929029059, 0.11436595165958771, 0.019678193158828294, 0.33993209990171286, 0.06199632369053478, 0.2039704373679482, -0.24561548555054916, -0.0168918999341818, 0.05525672646740881] |
1,803.04004 | Target-normal single-spin asymmetry in elastic electron-nucleon
scattering | We estimate the target-normal single-spin asymmetry at nearly forward angles
in elastic electron-nucleon scattering. In the leading-order approximation,
this asymmetry is proportional to the imaginary part of the two-photon exchange
(TPE) amplitude, which can be expressed as an integral over the doubly virtual
Compton scattering (VVCS) tensor. We develop a model that parametrizes the VVCS
tensor for the case of nearly forward scattering angles. Our parametrization
ensures a proper normalization of the imaginary part of the TPE amplitude on
the well-known forward limit expression, which is given in terms of nucleon
structure functions measurable in inelastic electron-nucleon scattering
experiments. We discuss applicability limits of our theory and provide
target-normal single-spin asymmetry predictions for both elastic
electron-proton and electron-neutron scattering.
| hep-ph nucl-th | we estimate the targetnormal singlespin asymmetry at nearly forward angles in elastic electronnucleon scattering in the leadingorder approximation this asymmetry is proportional to the imaginary part of the twophoton exchange tpe amplitude which can be expressed as an integral over the doubly virtual compton scattering vvcs tensor we develop a model that parametrizes the vvcs tensor for the case of nearly forward scattering angles our parametrization ensures a proper normalization of the imaginary part of the tpe amplitude on the wellknown forward limit expression which is given in terms of nucleon structure functions measurable in inelastic electronnucleon scattering experiments we discuss applicability limits of our theory and provide targetnormal singlespin asymmetry predictions for both elastic electronproton and electronneutron scattering | [['we', 'estimate', 'the', 'targetnormal', 'singlespin', 'asymmetry', 'at', 'nearly', 'forward', 'angles', 'in', 'elastic', 'electronnucleon', 'scattering', 'in', 'the', 'leadingorder', 'approximation', 'this', 'asymmetry', 'is', 'proportional', 'to', 'the', 'imaginary', 'part', 'of', 'the', 'twophoton', 'exchange', 'tpe', 'amplitude', 'which', 'can', 'be', 'expressed', 'as', 'an', 'integral', 'over', 'the', 'doubly', 'virtual', 'compton', 'scattering', 'vvcs', 'tensor', 'we', 'develop', 'a', 'model', 'that', 'parametrizes', 'the', 'vvcs', 'tensor', 'for', 'the', 'case', 'of', 'nearly', 'forward', 'scattering', 'angles', 'our', 'parametrization', 'ensures', 'a', 'proper', 'normalization', 'of', 'the', 'imaginary', 'part', 'of', 'the', 'tpe', 'amplitude', 'on', 'the', 'wellknown', 'forward', 'limit', 'expression', 'which', 'is', 'given', 'in', 'terms', 'of', 'nucleon', 'structure', 'functions', 'measurable', 'in', 'inelastic', 'electronnucleon', 'scattering', 'experiments', 'we', 'discuss', 'applicability', 'limits', 'of', 'our', 'theory', 'and', 'provide', 'targetnormal', 'singlespin', 'asymmetry', 'predictions', 'for', 'both', 'elastic', 'electronproton', 'and', 'electronneutron', 'scattering']] | [-0.1395060327021452, 0.15381742992446693, -0.10585622641281421, 0.11215263925700159, -0.0633073599007325, -0.03751174816000862, 0.009986670213573448, 0.3465502181505205, -0.28257946244307924, -0.17159129901468254, -0.02941979333257475, -0.31354659276881386, -0.11301416949762282, 0.17353575766094403, 0.11173925464268492, 0.04525286648246389, 0.04527931047227828, -0.012658976697110563, -0.030158658531502264, -0.16756630594403865, 0.3096601458133331, 0.05513303804586978, 0.2717144243074816, 0.1663810827792818, 0.11799740349529546, 0.18649131558178103, -0.04907253756727867, -0.057911066886256725, -0.08262789428084669, 0.11289585463530502, 0.2668157029709145, 0.007818936061176682, 0.0817635937340992, -0.42119047883115396, -0.10770721829832852, 0.09283590751128788, 0.1735920349621222, 0.1175209574084416, 0.020661808116979773, -0.23263020388304623, -0.013236636679400416, -0.21860512740276128, -0.16523984806346043, -0.11717440629722316, 0.019214603924701194, -0.04791360310114482, -0.33075020477193323, 0.07850603197560403, -0.023858127536393013, -0.02437868089015995, -0.07591835335053566, -0.16969018879917866, 0.03838106888119413, 0.040075388619629275, 0.09445602829008512, 0.05490550319781574, 0.11994808277177836, -0.15487995311547414, -0.11739078454454155, 0.3538801099698083, -0.09701059359524931, -0.21306704560748668, 0.040253830384932646, -0.2025487248887535, -0.07215951963820878, 0.16444530409659033, 0.2143908740890001, 0.09056416369912003, -0.14157390177392737, 0.13729294808092332, -0.042737845493824915, 0.13044874010091068, 0.12547930212840125, 0.018389417391716494, 0.12920997349521882, 0.15324515526128166, -0.020633244393941236, 0.09344627674837291, -0.14745980577285112, -0.0791330478161949, -0.4206237087540814, -0.07604405451605112, -0.11202285132280887, 0.07330588974496897, -0.11531058969264732, -0.13584251570350983, 0.32016474338827516, 0.07967635064518877, 0.24192430249497512, 0.051661714954505195, 0.3804877913877869, 0.18561884054244973, 0.08590746562372298, 0.02491587961577818, 0.3291030431620213, 0.2064561740839619, 0.11957606288874444, -0.2735347293411233, 0.10918578509820484, 0.03418319064247258] |
1,803.04005 | Associated forms: current progress and open problems | Let $d\ge 3$, $n\ge 2$. The object of our study is the morphism $\Phi$,
introduced in earlier articles by J. Alper, M. Eastwood and the author, that
assigns to every homogeneous form of degree $d$ on ${\mathbb C}^n$ for which
the discriminant $\Delta$ does not vanish the so-called associated form, which
is a form of degree $n(d-2)$ on the dual space. This morphism is
${\mathrm{SL}}_n$-equivariant and is of interest in connection with the
well-known Mather-Yau theorem, specifically, with the problem of explicit
reconstruction of an isolated hypersurface singularity from its Tjurina
algebra. Letting $p$ be the smallest integer such that the product
$\Delta^p\Phi$ extends to the entire affine space of degree $d$ forms, one
observes that the extended map defines a contravariant. In the present paper we
survey known results on the morphism $\Phi$ as well as the contravariant
$\Delta^p\Phi$, and state several open problems. Our goal is to draw the
attention of complex analysts and geometers to the concept of the associated
form and the intriguing connection between complex singularity theory and
invariant theory revealed through it.
| math.CV | let dge 3 nge 2 the object of our study is the morphism phi introduced in earlier articles by j alper m eastwood and the author that assigns to every homogeneous form of degree d on mathbb cn for which the discriminant delta does not vanish the socalled associated form which is a form of degree nd2 on the dual space this morphism is mathrmsl_nequivariant and is of interest in connection with the wellknown matheryau theorem specifically with the problem of explicit reconstruction of an isolated hypersurface singularity from its tjurina algebra letting p be the smallest integer such that the product deltapphi extends to the entire affine space of degree d forms one observes that the extended map defines a contravariant in the present paper we survey known results on the morphism phi as well as the contravariant deltapphi and state several open problems our goal is to draw the attention of complex analysts and geometers to the concept of the associated form and the intriguing connection between complex singularity theory and invariant theory revealed through it | [['let', 'dge', '3', 'nge', '2', 'the', 'object', 'of', 'our', 'study', 'is', 'the', 'morphism', 'phi', 'introduced', 'in', 'earlier', 'articles', 'by', 'j', 'alper', 'm', 'eastwood', 'and', 'the', 'author', 'that', 'assigns', 'to', 'every', 'homogeneous', 'form', 'of', 'degree', 'd', 'on', 'mathbb', 'cn', 'for', 'which', 'the', 'discriminant', 'delta', 'does', 'not', 'vanish', 'the', 'socalled', 'associated', 'form', 'which', 'is', 'a', 'form', 'of', 'degree', 'nd2', 'on', 'the', 'dual', 'space', 'this', 'morphism', 'is', 'mathrmsl_nequivariant', 'and', 'is', 'of', 'interest', 'in', 'connection', 'with', 'the', 'wellknown', 'matheryau', 'theorem', 'specifically', 'with', 'the', 'problem', 'of', 'explicit', 'reconstruction', 'of', 'an', 'isolated', 'hypersurface', 'singularity', 'from', 'its', 'tjurina', 'algebra', 'letting', 'p', 'be', 'the', 'smallest', 'integer', 'such', 'that', 'the', 'product', 'deltapphi', 'extends', 'to', 'the', 'entire', 'affine', 'space', 'of', 'degree', 'd', 'forms', 'one', 'observes', 'that', 'the', 'extended', 'map', 'defines', 'a', 'contravariant', 'in', 'the', 'present', 'paper', 'we', 'survey', 'known', 'results', 'on', 'the', 'morphism', 'phi', 'as', 'well', 'as', 'the', 'contravariant', 'deltapphi', 'and', 'state', 'several', 'open', 'problems', 'our', 'goal', 'is', 'to', 'draw', 'the', 'attention', 'of', 'complex', 'analysts', 'and', 'geometers', 'to', 'the', 'concept', 'of', 'the', 'associated', 'form', 'and', 'the', 'intriguing', 'connection', 'between', 'complex', 'singularity', 'theory', 'and', 'invariant', 'theory', 'revealed', 'through', 'it']] | [-0.15697910278867194, 0.05136097314720513, -0.08326081281112202, 0.02117257890236264, -0.10409423446356408, -0.1412267763835857, -0.0042726422763971535, 0.3046258205053328, -0.3125259760861932, -0.24356044366124407, 0.07814037108249268, -0.28508093036805926, -0.18342167948041174, 0.15252557361766822, -0.08689157350914879, -0.027505641198377676, 0.019326655701918286, 0.1161218931856381, -0.0706052126975909, -0.252160384277629, 0.40024287564059097, -0.0014357257444979781, 0.20385080438694592, 0.04690090027285245, 0.11205707309704463, 0.028664966508493584, -0.03397330201341439, -0.005966746736657254, -0.16076587708623347, 0.13520538077708122, 0.2713270897393004, 0.14108188850752545, 0.23815331257627173, -0.3343193460547557, -0.15186078140859383, 0.1699534524764897, 0.1132054700493802, -0.005064505839057393, 0.009834692350425625, -0.2751047572826093, 0.10158767192861286, -0.1335280897344251, -0.16965581918408895, -0.0427861381539191, 0.0831748115755144, -0.01677234597454153, -0.24580371121239275, 0.01532248624910911, 0.12467687675337397, 0.07381407976397814, -0.04610452500545541, -0.1070512236927315, -0.05469642312655299, 0.09049497425850839, -0.005158583640178802, 0.15791112809747163, 0.05643525921922482, -0.09827473738472803, -0.10000789397077814, 0.3609875100270166, -0.043485495439430664, -0.2205406295636795, 0.15201843351633473, -0.15512146660794982, -0.15562453969397536, 0.11039268058964109, 0.10306554543522665, 0.13109436158043475, -0.038642197377758765, 0.18813245208989196, -0.08991737160989541, 0.11600664753195866, 0.09363251063172932, -0.016630535811122695, 0.14227774062741147, 0.09411171526979592, 0.06889224682321593, 0.14004504564612852, -0.022579998129815662, -0.07985686843867525, -0.34407553793060053, -0.18785660173993896, -0.17081167924844023, 0.1345001868470368, -0.09165721816240316, -0.13193674056953883, 0.36810424062554953, 0.06663596255594265, 0.216207169694826, 0.061723589035550835, 0.22851961464778978, 0.07609936351345925, 0.05021055312784478, 0.057916735606741605, 0.13991931886517436, 0.18324083399611635, 0.05040114283256528, -0.15823183142011826, 0.03448944189717288, 0.12086790698017441] |
1,803.04006 | Classical solutions to a logistic chemotaxis model with singular
sensitivity and signal absorption | Assuming that $0<\chi<\sqrt{\frac{2}n}$, $\kappa\ge 0$ and
$\mu>\frac{n-2}{n}$, we prove global existence of classical solutions to a
chemotaxis system slightly generalizing \[ \begin{split} u_t &= \Delta u - \chi
\nabla\cdot ( \frac{u}{v} \nabla v ) + \kappa u -\mu u^2\\ v_t &= \Delta v - u
v \end{split} \] in a bounded domain $\Omega \subset \mathbb{R}^n$, with
homogeneous Neumann boundary conditions and for widely arbitrary positive
initial data. In the spatially one-dimensional setting, we prove global
existence and, moreover, boundedness of the solution for any $\chi>0$, $\mu>0$,
$\kappa\ge 0$.
| math.AP | assuming that 0chisqrtfrac2n kappage 0 and mufracn2n we prove global existence of classical solutions to a chemotaxis system slightly generalizing beginsplit u_t delta u chi nablacdot fracuv nabla v kappa u mu u2 v_t delta v u v endsplit in a bounded domain omega subset mathbbrn with homogeneous neumann boundary conditions and for widely arbitrary positive initial data in the spatially onedimensional setting we prove global existence and moreover boundedness of the solution for any chi0 mu0 kappage 0 | [['assuming', 'that', '0chisqrtfrac2n', 'kappage', '0', 'and', 'mufracn2n', 'we', 'prove', 'global', 'existence', 'of', 'classical', 'solutions', 'to', 'a', 'chemotaxis', 'system', 'slightly', 'generalizing', 'beginsplit', 'u_t', 'delta', 'u', 'chi', 'nablacdot', 'fracuv', 'nabla', 'v', 'kappa', 'u', 'mu', 'u2', 'v_t', 'delta', 'v', 'u', 'v', 'endsplit', 'in', 'a', 'bounded', 'domain', 'omega', 'subset', 'mathbbrn', 'with', 'homogeneous', 'neumann', 'boundary', 'conditions', 'and', 'for', 'widely', 'arbitrary', 'positive', 'initial', 'data', 'in', 'the', 'spatially', 'onedimensional', 'setting', 'we', 'prove', 'global', 'existence', 'and', 'moreover', 'boundedness', 'of', 'the', 'solution', 'for', 'any', 'chi0', 'mu0', 'kappage', '0']] | [-0.22709930798430977, 0.08581232206779532, 0.02405089714662417, -0.021707584003084583, -0.08418101358754364, -0.2890110966675964, 0.011981557772837971, 0.2964359254937766, -0.3592040930678578, -0.10617586111306752, 0.0994227577757556, -0.3569279504008591, -0.01016342445693322, 0.1052277248374211, -0.029861902242134277, 0.05390517955866495, 0.05508696578908712, 0.08093142890261094, -0.0651412178658096, -0.15660304712180637, 0.35258427268012094, -0.26985429954028833, 0.13955842658852866, 0.05776983431515921, 0.08979061346556257, -0.02522177025859587, 0.11105323015516133, -0.020929436481214668, -0.3364962254024584, -0.028346227310401827, 0.1859101874165629, 0.04507493461776329, 0.31377031510361886, -0.33584942580445815, -0.1973288636532073, 0.2786981669058533, 0.15219960685231185, -0.07630461525466097, 0.016941650995776353, -0.37036283217419524, 0.1621150884801816, -0.06129818819585795, -0.2592667735573885, -0.023152950685471296, 0.1840083449221167, 0.07879906431710544, -0.4644760791408388, 0.19221330175519383, 0.11387128132781454, 0.01442854743646948, -0.19135862205324597, -0.20449000793527566, -0.08689530193805695, 0.0018447705507768613, -0.03654377884231508, 0.1933353129501675, 0.0030686690251490005, -0.11141887908850454, 0.05194730088604908, 0.32751842938657655, -0.1738381965643432, -0.31068229273353754, 0.11025445200012703, -0.2243605760465327, -0.10959085572731535, 0.00846238206692138, 0.04278598700674545, 0.1588673780206591, -0.10777162962691172, 0.3174609677524514, -0.08030328778764478, 0.14825920995568403, 0.15573734863612212, -0.02939736996670131, -0.009784039865878998, 0.07666687519093485, 0.2205041008756349, 0.03679365909805423, -0.01846863128287767, 0.013638284872286022, -0.4057254260405898, -0.10748504777438939, -0.09935171485535409, 0.20690617729039668, -0.13368400489841742, -0.15514013482453792, 0.2629594142107587, 0.056782951495015846, 0.18546946076860063, 0.08255036785512378, 0.13163237136139191, 0.13482483202518014, -0.09869289993290103, 0.15143124563129326, 0.04276162485506287, 0.14320216011439793, 0.17700513665821696, -0.24428865917664216, -0.03492215614900679, 0.12241161909428468] |
1,803.04007 | Characterizing solute hydrogen and hydrides in pure and alloyed titanium
at the atomic scale | Ti has a high affinity for hydrogen and is a typical hydride formers.
Ti-hydride are brittle phases which probably cause premature failure of
Ti-alloys. Here, we used atom probe tomography and electron microscopy to
investigate the hydrogen distribution in a set of specimens of commercially
pure Ti, model and commercial Ti-alloys. Although likely partly introduced
during specimen preparation with the focused-ion beam, we show formation of
Ti-hydrides along {\alpha} grain boundaries and {\alpha}/\b{eta} phase
boundaries in commercial pure Ti and {\alpha}+\b{eta} binary model alloys. No
hydrides are observed in the {\alpha} phase in alloys with Al addition or
quenched-in Mo supersaturation.
| cond-mat.mtrl-sci | ti has a high affinity for hydrogen and is a typical hydride formers tihydride are brittle phases which probably cause premature failure of tialloys here we used atom probe tomography and electron microscopy to investigate the hydrogen distribution in a set of specimens of commercially pure ti model and commercial tialloys although likely partly introduced during specimen preparation with the focusedion beam we show formation of tihydrides along alpha grain boundaries and alphabeta phase boundaries in commercial pure ti and alphabeta binary model alloys no hydrides are observed in the alpha phase in alloys with al addition or quenchedin mo supersaturation | [['ti', 'has', 'a', 'high', 'affinity', 'for', 'hydrogen', 'and', 'is', 'a', 'typical', 'hydride', 'formers', 'tihydride', 'are', 'brittle', 'phases', 'which', 'probably', 'cause', 'premature', 'failure', 'of', 'tialloys', 'here', 'we', 'used', 'atom', 'probe', 'tomography', 'and', 'electron', 'microscopy', 'to', 'investigate', 'the', 'hydrogen', 'distribution', 'in', 'a', 'set', 'of', 'specimens', 'of', 'commercially', 'pure', 'ti', 'model', 'and', 'commercial', 'tialloys', 'although', 'likely', 'partly', 'introduced', 'during', 'specimen', 'preparation', 'with', 'the', 'focusedion', 'beam', 'we', 'show', 'formation', 'of', 'tihydrides', 'along', 'alpha', 'grain', 'boundaries', 'and', 'alphabeta', 'phase', 'boundaries', 'in', 'commercial', 'pure', 'ti', 'and', 'alphabeta', 'binary', 'model', 'alloys', 'no', 'hydrides', 'are', 'observed', 'in', 'the', 'alpha', 'phase', 'in', 'alloys', 'with', 'al', 'addition', 'or', 'quenchedin', 'mo', 'supersaturation']] | [-0.03519466438945191, 0.22372272167085988, -0.0033741904801890717, 0.0015894509239851968, 0.052974536803733444, -0.18971655383878916, 0.10537539506943167, 0.461078613458835, -0.22466574941483355, -0.2896902062786148, 0.03305884957620778, -0.31450784808389615, -0.0900447644010071, 0.13536594064723814, -0.03675188158744389, 0.05215933746130196, 0.01488955160266883, -0.09733760424111922, -0.08205097699633886, -0.21433561203578852, 0.2510564826289672, 0.05141017576631581, 0.3050564208989675, 0.052223983956452884, 0.026718150593878068, -0.06462676768411987, 0.06920360552492677, 0.02300406284822324, -0.1603369526565075, 0.025518603896549374, 0.24752912520594203, 0.01625531507396744, 0.17954515855874598, -0.4814229085081324, -0.24099826394369075, 0.06529028212517193, 0.08177655711578033, 0.11562058247371394, -0.11140411964992118, -0.2128518468810764, 0.0568704982768245, -0.1353191510802999, -0.12037430625389685, -0.02461261130370123, 0.05649941859613221, 0.020416359892403035, -0.2582730623538193, 0.08339891939894441, 0.03992790147930998, 0.10403448855264362, -0.11938702357337647, -0.13092403530536853, -0.09540517038435281, 0.004984495705281643, -0.002128955903319047, 0.03363657265075857, 0.20538122790203112, -0.08456613445539296, -0.051127766835090425, 0.4381322515840383, -0.007079203622703699, -0.05989894473483575, 0.2261457878750624, -0.17857269631934558, -0.11695995327738143, 0.2005748571731995, 0.08750797471165964, 0.10932754085773659, -0.12222250585069823, 0.030510461886206968, 0.07377668628085059, 0.22240274661033385, 0.11876546906441757, -0.0006308279026626158, 0.19921351366282739, 0.19815685399615965, -0.020261829351699075, 0.14792138352490886, -0.15506687272848926, -0.012086699143671383, -0.17388718565157854, -0.2681098112394822, -0.1692745150787007, 0.030714802909642458, -0.06537444750252108, -0.23343482180546546, 0.29385466329734194, 0.09153933289518446, 0.13571274774053046, -0.10298938226535648, 0.22204863792045293, 0.027250860490237325, 0.025781702903128163, -0.033643755214480854, 0.2361722609757916, 0.14615956525865598, 0.11720820439537775, -0.2122369949206633, 0.19485827605000017, 0.015490057527750116] |
1,803.04008 | Multi-Armed Bandits for Correlated Markovian Environments with Smoothed
Reward Feedback | We study a multi-armed bandit problem in a dynamic environment where arm
rewards evolve in a correlated fashion according to a Markov chain. Different
than much of the work on related problems, in our formulation a learning
algorithm does not have access to either a priori information or observations
of the state of the Markov chain and only observes smoothed reward feedback
following time intervals we refer to as epochs. We demonstrate that existing
methods such as UCB and $\varepsilon$-greedy can suffer linear regret in such
an environment. Employing mixing-time bounds on Markov chains, we develop
algorithms called EpochUCB and EpochGreedy that draw inspiration from the
aforementioned methods, yet which admit sublinear regret guarantees for the
problem formulation. Our proposed algorithms proceed in epochs in which an arm
is played repeatedly for a number of iterations that grows linearly as a
function of the number of times an arm has been played in the past. We analyze
these algorithms under two types of smoothed reward feedback at the end of each
epoch: a reward that is the discount-average of the discounted rewards within
an epoch, and a reward that is the time-average of the rewards within an epoch.
| cs.LG | we study a multiarmed bandit problem in a dynamic environment where arm rewards evolve in a correlated fashion according to a markov chain different than much of the work on related problems in our formulation a learning algorithm does not have access to either a priori information or observations of the state of the markov chain and only observes smoothed reward feedback following time intervals we refer to as epochs we demonstrate that existing methods such as ucb and varepsilongreedy can suffer linear regret in such an environment employing mixingtime bounds on markov chains we develop algorithms called epochucb and epochgreedy that draw inspiration from the aforementioned methods yet which admit sublinear regret guarantees for the problem formulation our proposed algorithms proceed in epochs in which an arm is played repeatedly for a number of iterations that grows linearly as a function of the number of times an arm has been played in the past we analyze these algorithms under two types of smoothed reward feedback at the end of each epoch a reward that is the discountaverage of the discounted rewards within an epoch and a reward that is the timeaverage of the rewards within an epoch | [['we', 'study', 'a', 'multiarmed', 'bandit', 'problem', 'in', 'a', 'dynamic', 'environment', 'where', 'arm', 'rewards', 'evolve', 'in', 'a', 'correlated', 'fashion', 'according', 'to', 'a', 'markov', 'chain', 'different', 'than', 'much', 'of', 'the', 'work', 'on', 'related', 'problems', 'in', 'our', 'formulation', 'a', 'learning', 'algorithm', 'does', 'not', 'have', 'access', 'to', 'either', 'a', 'priori', 'information', 'or', 'observations', 'of', 'the', 'state', 'of', 'the', 'markov', 'chain', 'and', 'only', 'observes', 'smoothed', 'reward', 'feedback', 'following', 'time', 'intervals', 'we', 'refer', 'to', 'as', 'epochs', 'we', 'demonstrate', 'that', 'existing', 'methods', 'such', 'as', 'ucb', 'and', 'varepsilongreedy', 'can', 'suffer', 'linear', 'regret', 'in', 'such', 'an', 'environment', 'employing', 'mixingtime', 'bounds', 'on', 'markov', 'chains', 'we', 'develop', 'algorithms', 'called', 'epochucb', 'and', 'epochgreedy', 'that', 'draw', 'inspiration', 'from', 'the', 'aforementioned', 'methods', 'yet', 'which', 'admit', 'sublinear', 'regret', 'guarantees', 'for', 'the', 'problem', 'formulation', 'our', 'proposed', 'algorithms', 'proceed', 'in', 'epochs', 'in', 'which', 'an', 'arm', 'is', 'played', 'repeatedly', 'for', 'a', 'number', 'of', 'iterations', 'that', 'grows', 'linearly', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'times', 'an', 'arm', 'has', 'been', 'played', 'in', 'the', 'past', 'we', 'analyze', 'these', 'algorithms', 'under', 'two', 'types', 'of', 'smoothed', 'reward', 'feedback', 'at', 'the', 'end', 'of', 'each', 'epoch', 'a', 'reward', 'that', 'is', 'the', 'discountaverage', 'of', 'the', 'discounted', 'rewards', 'within', 'an', 'epoch', 'and', 'a', 'reward', 'that', 'is', 'the', 'timeaverage', 'of', 'the', 'rewards', 'within', 'an', 'epoch']] | [-0.09023103572261067, 0.06912202460740585, -0.11769829369150102, 0.055934371701919304, -0.1050583468678479, -0.13616954892491684, 0.0781208329845984, 0.45775987170636656, -0.27562531829119113, -0.2853448394757624, 0.12755823321938992, -0.2475858586625411, -0.13667332840522226, 0.1691434245604353, -0.10492087617182197, 0.032067693930525235, 0.040206558902103166, 0.07483858721426283, -0.03539002617606177, -0.27943156306416944, 0.2825290361013359, 0.07437188446115799, 0.21319642340621123, -0.046837589721708824, 0.15548198285202186, -0.001174425357618393, 0.0014872187079909521, 0.04320154990489708, -0.12129721219852142, 0.02778319923254924, 0.27859687552763485, 0.19658559493911573, 0.4060119152928774, -0.43226982751526893, -0.17650500898777793, 0.14784146941338594, 0.14700162207039122, 0.11418186043484661, -0.039303760616204296, -0.2799720752124603, 0.031930082589865495, -0.15369076883086027, -0.013363950725835868, -0.0021397276614338926, -0.041974760994362904, 0.006715320316624667, -0.3293472750136294, 0.010380439959370937, 0.06986797538060599, 0.0007216013024728267, -0.05127777826423064, -0.11434575543523981, 0.053275176951996024, 0.12975191483632303, 0.07399698382971856, 0.059719595522918285, 0.1360821185943981, -0.1504903464196011, -0.22271219230233094, 0.31736620714267094, -0.06509488016756503, -0.16100807696676406, 0.17834004074669418, -0.07342825995471615, -0.17737526329687964, 0.13093382424006286, 0.23876668273602636, 0.1600295148551082, -0.14120887287247638, 0.06935167793924801, -0.07878850402298551, 0.17800974283988277, 0.02837495973620277, 0.04042654858591656, 0.1513439895418019, 0.17057318788925513, 0.1577693478622211, 0.13099188444037468, -0.03955029238445255, -0.1740740473000094, -0.26017053647396654, -0.12769617760697236, -0.19964170937832348, 0.01598646962927141, -0.1054890010264129, -0.15209267008751154, 0.3679617026892419, 0.16710313536460514, 0.22718073470900074, 0.1645057772178776, 0.30674299970269203, 0.11874653107116524, 0.03840008722737623, 0.13917346707521341, 0.20479469641637152, 0.05220992416740419, 0.07592326404096988, -0.20732487169189903, 0.15134216614831716, 0.050320355670574385] |
1,803.04009 | Symmetry enhancement and closing of knots in 3d/3d correspondence | We revisit Dimofte-Gaiotto-Gukov's construction of 3d gauge theories
associated to 3-manifolds with a torus boundary. After clarifying their
construction from a viewpoint of compactification of a 6d $\mathcal{N}=(2,0)$
theory of $A_1$-type on a 3-manifold, we propose a topological criterion for
$SU(2)/SO(3)$ flavor symmetry enhancement for the $u(1)$ symmetry in the theory
associated to a torus boundary, which is expected from the 6d viewpoint. Base
on the understanding of symmetry enhancement, we generalize the construction to
closed 3-manifolds by identifying the gauge theory counterpart of Dehn filling
operation. The generalized construction predicts infinitely many 3d dualities
from surgery calculus in knot theory. Moreover, by using the symmetry
enhancement criterion, we show that theories associated to all hyperboilc twist
knots have surprising $SU(3)$ symmetry enhancement which is unexpected from the
6d viewpoint.
| hep-th math-ph math.MP | we revisit dimoftegaiottogukovs construction of 3d gauge theories associated to 3manifolds with a torus boundary after clarifying their construction from a viewpoint of compactification of a 6d mathcaln20 theory of a_1type on a 3manifold we propose a topological criterion for su2so3 flavor symmetry enhancement for the u1 symmetry in the theory associated to a torus boundary which is expected from the 6d viewpoint base on the understanding of symmetry enhancement we generalize the construction to closed 3manifolds by identifying the gauge theory counterpart of dehn filling operation the generalized construction predicts infinitely many 3d dualities from surgery calculus in knot theory moreover by using the symmetry enhancement criterion we show that theories associated to all hyperboilc twist knots have surprising su3 symmetry enhancement which is unexpected from the 6d viewpoint | [['we', 'revisit', 'dimoftegaiottogukovs', 'construction', 'of', '3d', 'gauge', 'theories', 'associated', 'to', '3manifolds', 'with', 'a', 'torus', 'boundary', 'after', 'clarifying', 'their', 'construction', 'from', 'a', 'viewpoint', 'of', 'compactification', 'of', 'a', '6d', 'mathcaln20', 'theory', 'of', 'a_1type', 'on', 'a', '3manifold', 'we', 'propose', 'a', 'topological', 'criterion', 'for', 'su2so3', 'flavor', 'symmetry', 'enhancement', 'for', 'the', 'u1', 'symmetry', 'in', 'the', 'theory', 'associated', 'to', 'a', 'torus', 'boundary', 'which', 'is', 'expected', 'from', 'the', '6d', 'viewpoint', 'base', 'on', 'the', 'understanding', 'of', 'symmetry', 'enhancement', 'we', 'generalize', 'the', 'construction', 'to', 'closed', '3manifolds', 'by', 'identifying', 'the', 'gauge', 'theory', 'counterpart', 'of', 'dehn', 'filling', 'operation', 'the', 'generalized', 'construction', 'predicts', 'infinitely', 'many', '3d', 'dualities', 'from', 'surgery', 'calculus', 'in', 'knot', 'theory', 'moreover', 'by', 'using', 'the', 'symmetry', 'enhancement', 'criterion', 'we', 'show', 'that', 'theories', 'associated', 'to', 'all', 'hyperboilc', 'twist', 'knots', 'have', 'surprising', 'su3', 'symmetry', 'enhancement', 'which', 'is', 'unexpected', 'from', 'the', '6d', 'viewpoint']] | [-0.18067043463815935, 0.1347227807946183, -0.11654553710650362, 0.10041123209703073, -0.11284202814931632, -0.15925681482622167, 0.02503545961008058, 0.3215397952881176, -0.21447239458939293, -0.30732181719758955, 0.09067476788004569, -0.22354631287089433, -0.23316833916641144, 0.12859893779386766, -0.13859152864586122, -0.004169007434029481, 0.006988643866861821, 0.050034482426781324, -0.17293481413616973, -0.17714028404225246, 0.36423917110732873, -0.02548524840403843, 0.27818790240053204, 0.0691593731953617, 0.09239216629782732, -0.015522930170845939, -0.0056234143739857245, 0.0007732788217253983, -0.1514807814076562, 0.15470333820121596, 0.22410772225885012, 0.04171758885058807, 0.08559264983341563, -0.4045896838797489, -0.24061493409953982, 0.0517999405392402, 0.13136297379242023, 0.12785762953535595, -0.05204873836009938, -0.32737099818041315, 0.06746177336026449, -0.179734020770411, -0.19685678792484396, -0.07025952560798032, -0.030454843745246762, -0.12839719581097597, -0.18880261328831693, 0.023000805314950412, 0.055149265006548376, 0.12636136951186927, -0.06265136019646889, -0.045495090478652855, -0.06789445630420232, 0.0807250471880252, 0.13189796455480973, 0.07956684296368621, 0.10422636258317652, -0.21573146041555447, -0.17879528316188953, 0.40029871446313336, -0.03432317035913002, -0.20583962637465447, 0.14707540717427037, -0.12150527720814353, -0.22892523231712403, 0.1970482769975206, 0.0949282623550971, 0.12133220226678532, -0.04447136211092584, 0.17097230687159026, -0.11281797963420104, 0.09351071242872422, 0.08470620146545116, 0.005265802516078111, 0.21737273508915678, 0.08896131203800905, 0.07014049976851311, 0.14680534392391564, -0.019080387877238536, -0.12370356528481352, -0.3991530822531786, -0.17298627716900228, -0.11447850920467317, 0.1733361016285926, -0.09989878986380063, -0.14856634298485005, 0.37615520278632175, 0.09702706827010843, 0.17420119226153474, 0.07409602770121637, 0.20236510064387403, 0.05659121896860597, 0.10342943869727605, 0.015961160470396862, 0.15105923742885352, 0.18327025222606608, -0.023938473015732598, -0.21175942901027156, -0.10278180824025185, 0.2669282746355748] |
1,803.0401 | Towards completing Planetary Systems: The role of minor bodies on life
growth and survival | The search for extrasolar planets in the past decades has shown that planets
abound in the Solar neighborhood. While we are still missing an Earth twin, the
forthcoming space missions and ground-based instrumentation are already driven
to achieve this goal. But, in order to fully understand the conditions for life
appearing in the Solar System, we still miss some pieces of the planetary
system jigsaw puzzle, namely a deeper understanding of the minor bodies.
Trojans, moons, and comets are tracers of the formation and evolution processes
of planetary systems. These missing pieces are also critical to understand the
emergence and evolution of life over millions of years. With the large crop of
planetary systems discovered so far and yet to be detected with the forthcoming
missions, the hunt for minor bodies in extrasolar systems is a natural
continuation of our search for real Solar System- and, in particular, Earth-
analogs. This white paper is focused on detection of these minor components and
their relevance in the emergence, evolution and survival of life.
| astro-ph.EP | the search for extrasolar planets in the past decades has shown that planets abound in the solar neighborhood while we are still missing an earth twin the forthcoming space missions and groundbased instrumentation are already driven to achieve this goal but in order to fully understand the conditions for life appearing in the solar system we still miss some pieces of the planetary system jigsaw puzzle namely a deeper understanding of the minor bodies trojans moons and comets are tracers of the formation and evolution processes of planetary systems these missing pieces are also critical to understand the emergence and evolution of life over millions of years with the large crop of planetary systems discovered so far and yet to be detected with the forthcoming missions the hunt for minor bodies in extrasolar systems is a natural continuation of our search for real solar system and in particular earth analogs this white paper is focused on detection of these minor components and their relevance in the emergence evolution and survival of life | [['the', 'search', 'for', 'extrasolar', 'planets', 'in', 'the', 'past', 'decades', 'has', 'shown', 'that', 'planets', 'abound', 'in', 'the', 'solar', 'neighborhood', 'while', 'we', 'are', 'still', 'missing', 'an', 'earth', 'twin', 'the', 'forthcoming', 'space', 'missions', 'and', 'groundbased', 'instrumentation', 'are', 'already', 'driven', 'to', 'achieve', 'this', 'goal', 'but', 'in', 'order', 'to', 'fully', 'understand', 'the', 'conditions', 'for', 'life', 'appearing', 'in', 'the', 'solar', 'system', 'we', 'still', 'miss', 'some', 'pieces', 'of', 'the', 'planetary', 'system', 'jigsaw', 'puzzle', 'namely', 'a', 'deeper', 'understanding', 'of', 'the', 'minor', 'bodies', 'trojans', 'moons', 'and', 'comets', 'are', 'tracers', 'of', 'the', 'formation', 'and', 'evolution', 'processes', 'of', 'planetary', 'systems', 'these', 'missing', 'pieces', 'are', 'also', 'critical', 'to', 'understand', 'the', 'emergence', 'and', 'evolution', 'of', 'life', 'over', 'millions', 'of', 'years', 'with', 'the', 'large', 'crop', 'of', 'planetary', 'systems', 'discovered', 'so', 'far', 'and', 'yet', 'to', 'be', 'detected', 'with', 'the', 'forthcoming', 'missions', 'the', 'hunt', 'for', 'minor', 'bodies', 'in', 'extrasolar', 'systems', 'is', 'a', 'natural', 'continuation', 'of', 'our', 'search', 'for', 'real', 'solar', 'system', 'and', 'in', 'particular', 'earth', 'analogs', 'this', 'white', 'paper', 'is', 'focused', 'on', 'detection', 'of', 'these', 'minor', 'components', 'and', 'their', 'relevance', 'in', 'the', 'emergence', 'evolution', 'and', 'survival', 'of', 'life']] | [-0.13196777810713514, 0.14966168318853815, -0.04880890539619898, 0.09250615648708718, -0.080186540183752, -0.01396433541248011, 0.007640062517968418, 0.32510701498709793, -0.22027044587086367, -0.36405453026338025, 0.14649183088493922, -0.2962977802895313, -0.17481156303222442, 0.22081723126723582, -0.09784395428276946, 0.06895106172102482, 0.13488130992668312, -0.025033366960151186, 0.004635032110706752, -0.30501551667314974, 0.28780716572357556, 0.07907181055566599, 0.08224591992925419, 0.007208808379377736, 0.027138567602716733, -0.06454280846032076, -0.04727732068263427, -0.05074794705822484, -0.12604422104528187, 0.1217630015622532, 0.2696259890948314, 0.18915096591787683, 0.2511423470968175, -0.43920271423493706, -0.24338265101501155, 0.12100723892623602, 0.16523939242172273, 0.04346253349158783, -0.07517195599448737, -0.2782398519799287, 0.0863219348870781, -0.15342711362727854, -0.16253870655241054, -0.02653977714599446, 0.09793168669674805, 0.011959449385041046, -0.19334524463818864, 0.002230831025118214, 0.08213519462016086, 0.12961902190541286, -0.13593152043582915, -0.13645737413601236, -0.022052944465919377, 0.1740928331963978, 0.06441047940461431, -0.013257350765850915, 0.12289863903357019, -0.1301521640243875, -0.09581408513774879, 0.4451855694158355, -0.03564824253492609, -0.08108667768659829, 0.2800554354704895, -0.24390626234154023, -0.16885114999401363, 0.10802792043148995, 0.22323450933042696, 0.12547574395876984, -0.18527291747633107, 0.02928806759611985, -0.0015580196496705677, 0.12691833677994044, 0.056629191515534076, 0.06436457061804397, 0.35738659403449313, 0.21940300181416014, 0.08393553295270045, 0.038381225396310475, -0.12607013170612802, -0.11339397247891526, -0.1985914436179798, -0.20059013005270254, -0.1454638871393907, 0.02134891351425024, -0.012109048192140235, -0.15475609146030134, 0.37073202180502896, 0.1831875773347091, 0.18068968671574365, -0.017535726963488256, 0.2996115913434593, 0.038184646785741155, 0.10699996123019996, 0.0502199359850005, 0.31672023890657097, 0.08292147162002186, 0.15075653091378965, -0.18236556513435315, 0.13812934873668953, -0.004348702509454344] |
1,803.04011 | Higher genus knot contact homology and recursion for colored HOMFLY-PT
polynomials | We sketch a construction of Legendrian Symplectic Field Theory (SFT) for
conormal tori of knots and links. Using large $N$ duality and Witten's
connection between open Gromov-Witten invariants and Chern-Simons gauge theory,
we relate the SFT of a link conormal to the colored HOMFLY-PT polynomials of
the link. We present an argument that the HOMFLY-PT wave function is determined
from SFT by induction on Euler characteristic, and also show how to, more
directly, extract its recursion relation by elimination theory applied to
finitely many noncommutative equations. The latter can be viewed as the higher
genus counterpart of the relation between the augmentation variety and
Gromov-Witten disk potentials established by Aganagic, Vafa, and the authors,
and, from this perspective, our results can be seen as an SFT approach to
quantizing the augmentation variety.
| math.SG hep-th math.GT | we sketch a construction of legendrian symplectic field theory sft for conormal tori of knots and links using large n duality and wittens connection between open gromovwitten invariants and chernsimons gauge theory we relate the sft of a link conormal to the colored homflypt polynomials of the link we present an argument that the homflypt wave function is determined from sft by induction on euler characteristic and also show how to more directly extract its recursion relation by elimination theory applied to finitely many noncommutative equations the latter can be viewed as the higher genus counterpart of the relation between the augmentation variety and gromovwitten disk potentials established by aganagic vafa and the authors and from this perspective our results can be seen as an sft approach to quantizing the augmentation variety | [['we', 'sketch', 'a', 'construction', 'of', 'legendrian', 'symplectic', 'field', 'theory', 'sft', 'for', 'conormal', 'tori', 'of', 'knots', 'and', 'links', 'using', 'large', 'n', 'duality', 'and', 'wittens', 'connection', 'between', 'open', 'gromovwitten', 'invariants', 'and', 'chernsimons', 'gauge', 'theory', 'we', 'relate', 'the', 'sft', 'of', 'a', 'link', 'conormal', 'to', 'the', 'colored', 'homflypt', 'polynomials', 'of', 'the', 'link', 'we', 'present', 'an', 'argument', 'that', 'the', 'homflypt', 'wave', 'function', 'is', 'determined', 'from', 'sft', 'by', 'induction', 'on', 'euler', 'characteristic', 'and', 'also', 'show', 'how', 'to', 'more', 'directly', 'extract', 'its', 'recursion', 'relation', 'by', 'elimination', 'theory', 'applied', 'to', 'finitely', 'many', 'noncommutative', 'equations', 'the', 'latter', 'can', 'be', 'viewed', 'as', 'the', 'higher', 'genus', 'counterpart', 'of', 'the', 'relation', 'between', 'the', 'augmentation', 'variety', 'and', 'gromovwitten', 'disk', 'potentials', 'established', 'by', 'aganagic', 'vafa', 'and', 'the', 'authors', 'and', 'from', 'this', 'perspective', 'our', 'results', 'can', 'be', 'seen', 'as', 'an', 'sft', 'approach', 'to', 'quantizing', 'the', 'augmentation', 'variety']] | [-0.16890019024316588, 0.06704201993367558, -0.13888143969586852, 0.131890346733571, -0.11976834379531669, -0.17035575088635652, 0.00010438876977952367, 0.3000435599648027, -0.34526387058819336, -0.29063466820640094, 0.05505882475920247, -0.2212094318978912, -0.250713611718366, 0.2038886900285654, -0.1398956852428841, 0.008715601552852824, 0.0357862161401885, 0.009340943906202236, -0.10155375208529277, -0.2818874696015634, 0.3839984538605098, -0.022060789771124044, 0.21744307149801348, 0.07142486370514345, 0.10061500375652968, -0.0001849639546972784, -0.047044791263584615, 0.02002036776111433, -0.1528837433860176, 0.1379112057065041, 0.2694156626574554, 0.09775711070732072, 0.09667485515643476, -0.4281322213708226, -0.18143752159945012, 0.09322959633551142, 0.13912480355815426, 0.06398585552321465, 0.00029577077822812663, -0.2960316133473746, 0.1011109211531496, -0.19154290504626592, -0.17299091710910117, -0.0994405501776121, 0.005807072189671806, 0.02143633387062106, -0.16302299294197423, -0.020446466015886417, 0.051864478306731944, 0.10993479593007853, -0.018824062970727966, -0.06372786904896864, -0.07043936384566636, 0.08213515440002084, 0.06839679976374927, 0.14724755626185937, 0.08883694235136676, -0.17242870614052552, -0.17118861520959233, 0.3179234581731373, -0.10105801464735785, -0.2546098082805684, 0.1576647144728199, -0.08381805110327674, -0.16518863331470074, 0.11524391172376151, 0.03659249093581104, 0.13204758462697183, -0.06839974504581539, 0.1467837239549474, -0.10678369146196266, 0.08493600272711112, 0.11442558782767843, -0.03158351125647173, 0.1936724106428411, 0.028551871195139192, 0.04152174830872382, 0.15799679604154362, -0.024438873164454533, -0.09601913995081277, -0.3431087630486934, -0.20597400288578216, -0.1574282004836608, 0.15760532913367514, -0.1253924955408641, -0.15895340602428681, 0.39673970559273253, 0.10426371403842825, 0.165266061706158, 0.15230822334926802, 0.2657371106077776, 0.1412195313861241, 0.06373211679712051, 0.034512790883044625, 0.12723978773195113, 0.26658762972378597, 0.03939054981861828, -0.17233186146724178, -0.04684593076253253, 0.2540329973192208] |
1,803.04012 | On the linear stability of the Schwarzschild solution to gravitational
perturbations in the generalised wave gauge | In a recent seminal paper \cite{D-H-R} of Dafermos, Holzegel and Rodnianski
the linear stability of the Schwarzschild family of black hole solutions to the
Einstein vacuum equations was established by imposing a double null gauge. In
this paper we shall prove that the Schwarzschild family is linearly stable as
solutions to the Einstein vacuum equations by imposing instead a generalised
wave gauge: all sufficiently regular solutions to the system of equations that
result from linearising the Einstein vacuum equations, as expressed in a
generalised wave gauge, about a fixed Schwarzschild solution remain uniformly
bounded on the Schwarzschild exterior region and in fact decay to a member of
the linearised Kerr family. The dispersion is at an inverse polynomial rate and
therefore in principle sufficient for future nonlinear applications. The result
thus fits into the wider goal of establishing the full nonlinear stability of
the exterior Kerr family as solutions to the Einstein vacuum equations by
employing a generalised wave gauge and therefore complements \cite{D-H-R} in a
similar vein as the pioneering work \cite{L-R} of Lindblad and Rodnianski
complemented the monumental achievement of Christodoulou and Klainerman in
\cite{C-K} whereby the global nonlinear stability of the Minkowski space was
established.
| gr-qc math-ph math.AP math.DG math.MP | in a recent seminal paper citedhr of dafermos holzegel and rodnianski the linear stability of the schwarzschild family of black hole solutions to the einstein vacuum equations was established by imposing a double null gauge in this paper we shall prove that the schwarzschild family is linearly stable as solutions to the einstein vacuum equations by imposing instead a generalised wave gauge all sufficiently regular solutions to the system of equations that result from linearising the einstein vacuum equations as expressed in a generalised wave gauge about a fixed schwarzschild solution remain uniformly bounded on the schwarzschild exterior region and in fact decay to a member of the linearised kerr family the dispersion is at an inverse polynomial rate and therefore in principle sufficient for future nonlinear applications the result thus fits into the wider goal of establishing the full nonlinear stability of the exterior kerr family as solutions to the einstein vacuum equations by employing a generalised wave gauge and therefore complements citedhr in a similar vein as the pioneering work citelr of lindblad and rodnianski complemented the monumental achievement of christodoulou and klainerman in citeck whereby the global nonlinear stability of the minkowski space was established | [['in', 'a', 'recent', 'seminal', 'paper', 'citedhr', 'of', 'dafermos', 'holzegel', 'and', 'rodnianski', 'the', 'linear', 'stability', 'of', 'the', 'schwarzschild', 'family', 'of', 'black', 'hole', 'solutions', 'to', 'the', 'einstein', 'vacuum', 'equations', 'was', 'established', 'by', 'imposing', 'a', 'double', 'null', 'gauge', 'in', 'this', 'paper', 'we', 'shall', 'prove', 'that', 'the', 'schwarzschild', 'family', 'is', 'linearly', 'stable', 'as', 'solutions', 'to', 'the', 'einstein', 'vacuum', 'equations', 'by', 'imposing', 'instead', 'a', 'generalised', 'wave', 'gauge', 'all', 'sufficiently', 'regular', 'solutions', 'to', 'the', 'system', 'of', 'equations', 'that', 'result', 'from', 'linearising', 'the', 'einstein', 'vacuum', 'equations', 'as', 'expressed', 'in', 'a', 'generalised', 'wave', 'gauge', 'about', 'a', 'fixed', 'schwarzschild', 'solution', 'remain', 'uniformly', 'bounded', 'on', 'the', 'schwarzschild', 'exterior', 'region', 'and', 'in', 'fact', 'decay', 'to', 'a', 'member', 'of', 'the', 'linearised', 'kerr', 'family', 'the', 'dispersion', 'is', 'at', 'an', 'inverse', 'polynomial', 'rate', 'and', 'therefore', 'in', 'principle', 'sufficient', 'for', 'future', 'nonlinear', 'applications', 'the', 'result', 'thus', 'fits', 'into', 'the', 'wider', 'goal', 'of', 'establishing', 'the', 'full', 'nonlinear', 'stability', 'of', 'the', 'exterior', 'kerr', 'family', 'as', 'solutions', 'to', 'the', 'einstein', 'vacuum', 'equations', 'by', 'employing', 'a', 'generalised', 'wave', 'gauge', 'and', 'therefore', 'complements', 'citedhr', 'in', 'a', 'similar', 'vein', 'as', 'the', 'pioneering', 'work', 'citelr', 'of', 'lindblad', 'and', 'rodnianski', 'complemented', 'the', 'monumental', 'achievement', 'of', 'christodoulou', 'and', 'klainerman', 'in', 'citeck', 'whereby', 'the', 'global', 'nonlinear', 'stability', 'of', 'the', 'minkowski', 'space', 'was', 'established']] | [-0.14949441978194733, 0.06306263040556698, -0.0806651530126276, 0.05581338317382948, -0.11821652595927863, -0.08965828674085134, -0.03444673621205005, 0.22195268425216175, -0.2230896055722153, -0.2342955103745133, 0.12854899578829942, -0.25549080430492, -0.12619694046514604, 0.18160251423726048, -0.07044448612191909, 0.12455222978285152, 0.011053348810659076, 0.022759903294785062, -0.10601363865402053, -0.2408880167973361, 0.38789821942621955, 0.05969041833482987, 0.23739575767623528, -0.008021486885085399, 0.13160920087533184, 0.007278342045872111, 0.00992720156589675, 0.036036112575467474, -0.17415565109242417, 0.07272625440192333, 0.22215349862722641, 0.1080840495937713, 0.27762760566690065, -0.38992828750336656, -0.20711526851055725, 0.06427348480937493, 0.15118494483212255, 0.14653075496875206, -0.044003738936485855, -0.3484058297638382, 0.07268030564769941, -0.15962895861594006, -0.24120613485954853, -0.039067721070379625, 0.02306294907834761, 0.0004656673100187766, -0.24601472337369104, 0.07555322297278563, 0.11585144391663525, -0.01869482884411605, -0.12721896537921715, -0.04947714072507236, -0.03519510629358796, 0.0055363826448934115, 0.09518862450471605, 0.034457118918035864, 0.05949623368048508, -0.10006515085055702, -0.06919642810339147, 0.3573300967275697, -0.14624789662181628, -0.24635609153810203, 0.11440109416880474, -0.18192382598514384, -0.07672266017916442, 0.10479009885350432, 0.13980968409141867, 0.18973201300654255, -0.16815895227996314, 0.1833054234602783, -0.06312644305113022, 0.1118723643226169, 0.18826184166614346, 0.028539365630273764, 0.21224304925197765, 0.0884657551829076, 0.07793359844992888, 0.12055495276343914, 0.03492370500242366, -0.10961672412089016, -0.36738665714118707, -0.15658330844420634, -0.1423287320750224, 0.12239033047904851, -0.08987395383363557, -0.1682356510605967, 0.35838351259720796, 0.05987136215904053, 0.12181969917835478, 0.055951474386514446, 0.2090313014816683, 0.10968742993207677, 0.014204621942219685, 0.0786650641631259, 0.3276445655026283, 0.17199274029449693, 0.15826096960904115, -0.2288597204629807, -0.05244089097048308, 0.15864045815374547] |
1,803.04013 | Anomalous metamagnetism in the low carrier density Kondo lattice
YbRh3Si7 | We report complex metamagnetic transitions in single crystals of the new low
carrier Kondo antiferromagnet YbRh3Si7. Electrical transport, magnetization,
and specific heat measurements reveal antiferromagnetic order at T_N = 7.5 K.
Neutron diffraction measurements show that the magnetic ground state of
YbRh3Si7 is a collinear antiferromagnet where the moments are aligned in the ab
plane. With such an ordered state, no metamagnetic transitions are expected
when a magnetic field is applied along the c axis. It is therefore surprising
that high field magnetization, torque, and resistivity measurements with H||c
reveal two metamagnetic transitions at mu_0H_1 = 6.7 T and mu_0H_2 = 21 T. When
the field is tilted away from the c axis, towards the ab plane, both
metamagnetic transitions are shifted to higher fields. The first metamagnetic
transition leads to an abrupt increase in the electrical resistivity, while the
second transition is accompanied by a dramatic reduction in the electrical
resistivity. Thus, the magnetic and electronic degrees of freedom in YbRh3Si7
are strongly coupled. We discuss the origin of the anomalous metamagnetism and
conclude that it is related to competition between crystal electric field
anisotropy and anisotropic exchange interactions.
| cond-mat.str-el | we report complex metamagnetic transitions in single crystals of the new low carrier kondo antiferromagnet ybrh3si7 electrical transport magnetization and specific heat measurements reveal antiferromagnetic order at t_n 75 k neutron diffraction measurements show that the magnetic ground state of ybrh3si7 is a collinear antiferromagnet where the moments are aligned in the ab plane with such an ordered state no metamagnetic transitions are expected when a magnetic field is applied along the c axis it is therefore surprising that high field magnetization torque and resistivity measurements with hc reveal two metamagnetic transitions at mu_0h_1 67 t and mu_0h_2 21 t when the field is tilted away from the c axis towards the ab plane both metamagnetic transitions are shifted to higher fields the first metamagnetic transition leads to an abrupt increase in the electrical resistivity while the second transition is accompanied by a dramatic reduction in the electrical resistivity thus the magnetic and electronic degrees of freedom in ybrh3si7 are strongly coupled we discuss the origin of the anomalous metamagnetism and conclude that it is related to competition between crystal electric field anisotropy and anisotropic exchange interactions | [['we', 'report', 'complex', 'metamagnetic', 'transitions', 'in', 'single', 'crystals', 'of', 'the', 'new', 'low', 'carrier', 'kondo', 'antiferromagnet', 'ybrh3si7', 'electrical', 'transport', 'magnetization', 'and', 'specific', 'heat', 'measurements', 'reveal', 'antiferromagnetic', 'order', 'at', 't_n', '75', 'k', 'neutron', 'diffraction', 'measurements', 'show', 'that', 'the', 'magnetic', 'ground', 'state', 'of', 'ybrh3si7', 'is', 'a', 'collinear', 'antiferromagnet', 'where', 'the', 'moments', 'are', 'aligned', 'in', 'the', 'ab', 'plane', 'with', 'such', 'an', 'ordered', 'state', 'no', 'metamagnetic', 'transitions', 'are', 'expected', 'when', 'a', 'magnetic', 'field', 'is', 'applied', 'along', 'the', 'c', 'axis', 'it', 'is', 'therefore', 'surprising', 'that', 'high', 'field', 'magnetization', 'torque', 'and', 'resistivity', 'measurements', 'with', 'hc', 'reveal', 'two', 'metamagnetic', 'transitions', 'at', 'mu_0h_1', '67', 't', 'and', 'mu_0h_2', '21', 't', 'when', 'the', 'field', 'is', 'tilted', 'away', 'from', 'the', 'c', 'axis', 'towards', 'the', 'ab', 'plane', 'both', 'metamagnetic', 'transitions', 'are', 'shifted', 'to', 'higher', 'fields', 'the', 'first', 'metamagnetic', 'transition', 'leads', 'to', 'an', 'abrupt', 'increase', 'in', 'the', 'electrical', 'resistivity', 'while', 'the', 'second', 'transition', 'is', 'accompanied', 'by', 'a', 'dramatic', 'reduction', 'in', 'the', 'electrical', 'resistivity', 'thus', 'the', 'magnetic', 'and', 'electronic', 'degrees', 'of', 'freedom', 'in', 'ybrh3si7', 'are', 'strongly', 'coupled', 'we', 'discuss', 'the', 'origin', 'of', 'the', 'anomalous', 'metamagnetism', 'and', 'conclude', 'that', 'it', 'is', 'related', 'to', 'competition', 'between', 'crystal', 'electric', 'field', 'anisotropy', 'and', 'anisotropic', 'exchange', 'interactions']] | [-0.22804255498371817, 0.2576049220837917, 0.0005206139717326575, -0.030276818990052953, -0.08289408399220052, -0.13017339145110265, 0.08174749769811594, 0.41257250465679207, -0.28157920140672377, -0.2933362745654744, 0.028351961775380817, -0.36351037211212756, -0.09574325281522564, 0.14780682111410676, 0.09671976261152186, -0.041110121931981394, -0.04801360699474006, 0.042446145588985164, -0.10359743669301875, -0.1837676193385001, 0.24945373645152996, -0.006185889917400641, 0.2928498599476911, 0.075590756700714, 0.048186885933014185, -0.01528109875885216, 0.14840337441781082, 0.05366247092826745, -0.1161399709305811, -0.010572703595499734, 0.25118362174142855, -0.10528301921849315, 0.13173166811969636, -0.39286560196228126, -0.17070255512088486, 0.001340176496376296, 0.10426040134090628, 0.11301470366810021, -0.047042290153409785, -0.2587226501842206, 0.04101780438543977, -0.06680441537897128, -0.10976239938219708, -0.1420432623047885, -0.01325553617868069, 0.003355720586055336, -0.27645901889867475, 0.14295248142317743, 0.09816734420097861, 0.18363992743999571, -0.09238929232878208, -0.13530678453452483, -0.0771988090001852, 0.03732866925923657, 0.07440697598094875, 0.17055240210800154, 0.16460410448898738, -0.13199638797983376, -0.14886405779099143, 0.3334274989124891, -0.04087003860937281, -0.026313279984468543, 0.1434475773221788, -0.27837999867483015, -0.10734706413302873, 0.23173952643079934, 0.10449069232925319, 0.08694601464714553, -0.12205791127116017, 0.06101795038085658, 0.0455181922763586, 0.16654215290941096, 0.010845437355188501, 0.0012322725822544985, 0.2761768954957055, 0.13013343011356285, 0.04030870937905904, 0.18173982028572544, -0.14512448808480355, -0.0805393243762287, -0.2358108490327927, -0.17956086186113188, -0.19555450714243627, 0.08023929877861126, -0.1046872621170887, -0.17399990551564623, 0.34642879196216125, 0.17941897352976485, 0.1872714373509626, -0.10015398922904924, 0.24164816630953873, 0.12077866952325142, 0.04028570415275926, 0.07908946600037853, 0.2629053514098396, 0.23098888826632016, 0.1760939766476686, -0.3219964443632037, 0.07568377620616072, -0.04379330207090321] |
1,803.04014 | NVIDIA Tensor Core Programmability, Performance & Precision | The NVIDIA Volta GPU microarchitecture introduces a specialized unit, called
"Tensor Core" that performs one matrix-multiply-and-accumulate on 4x4 matrices
per clock cycle. The NVIDIA Tesla V100 accelerator, featuring the Volta
microarchitecture, provides 640 Tensor Cores with a theoretical peak
performance of 125 Tflops/s in mixed precision. In this paper, we investigate
current approaches to program NVIDIA Tensor Cores, their performances and the
precision loss due to computation in mixed precision.
Currently, NVIDIA provides three different ways of programming
matrix-multiply-and-accumulate on Tensor Cores: the CUDA Warp Matrix Multiply
Accumulate (WMMA) API, CUTLASS, a templated library based on WMMA, and cuBLAS
GEMM. After experimenting with different approaches, we found that NVIDIA
Tensor Cores can deliver up to 83 Tflops/s in mixed precision on a Tesla V100
GPU, seven and three times the performance in single and half precision
respectively. A WMMA implementation of batched GEMM reaches a performance of 4
Tflops/s. While precision loss due to matrix multiplication with half precision
input might be critical in many HPC applications, it can be considerably
reduced at the cost of increased computation. Our results indicate that HPC
applications using matrix multiplications can strongly benefit from using of
NVIDIA Tensor Cores.
| cs.DC cs.PF | the nvidia volta gpu microarchitecture introduces a specialized unit called tensor core that performs one matrixmultiplyandaccumulate on 4x4 matrices per clock cycle the nvidia tesla v100 accelerator featuring the volta microarchitecture provides 640 tensor cores with a theoretical peak performance of 125 tflopss in mixed precision in this paper we investigate current approaches to program nvidia tensor cores their performances and the precision loss due to computation in mixed precision currently nvidia provides three different ways of programming matrixmultiplyandaccumulate on tensor cores the cuda warp matrix multiply accumulate wmma api cutlass a templated library based on wmma and cublas gemm after experimenting with different approaches we found that nvidia tensor cores can deliver up to 83 tflopss in mixed precision on a tesla v100 gpu seven and three times the performance in single and half precision respectively a wmma implementation of batched gemm reaches a performance of 4 tflopss while precision loss due to matrix multiplication with half precision input might be critical in many hpc applications it can be considerably reduced at the cost of increased computation our results indicate that hpc applications using matrix multiplications can strongly benefit from using of nvidia tensor cores | [['the', 'nvidia', 'volta', 'gpu', 'microarchitecture', 'introduces', 'a', 'specialized', 'unit', 'called', 'tensor', 'core', 'that', 'performs', 'one', 'matrixmultiplyandaccumulate', 'on', '4x4', 'matrices', 'per', 'clock', 'cycle', 'the', 'nvidia', 'tesla', 'v100', 'accelerator', 'featuring', 'the', 'volta', 'microarchitecture', 'provides', '640', 'tensor', 'cores', 'with', 'a', 'theoretical', 'peak', 'performance', 'of', '125', 'tflopss', 'in', 'mixed', 'precision', 'in', 'this', 'paper', 'we', 'investigate', 'current', 'approaches', 'to', 'program', 'nvidia', 'tensor', 'cores', 'their', 'performances', 'and', 'the', 'precision', 'loss', 'due', 'to', 'computation', 'in', 'mixed', 'precision', 'currently', 'nvidia', 'provides', 'three', 'different', 'ways', 'of', 'programming', 'matrixmultiplyandaccumulate', 'on', 'tensor', 'cores', 'the', 'cuda', 'warp', 'matrix', 'multiply', 'accumulate', 'wmma', 'api', 'cutlass', 'a', 'templated', 'library', 'based', 'on', 'wmma', 'and', 'cublas', 'gemm', 'after', 'experimenting', 'with', 'different', 'approaches', 'we', 'found', 'that', 'nvidia', 'tensor', 'cores', 'can', 'deliver', 'up', 'to', '83', 'tflopss', 'in', 'mixed', 'precision', 'on', 'a', 'tesla', 'v100', 'gpu', 'seven', 'and', 'three', 'times', 'the', 'performance', 'in', 'single', 'and', 'half', 'precision', 'respectively', 'a', 'wmma', 'implementation', 'of', 'batched', 'gemm', 'reaches', 'a', 'performance', 'of', '4', 'tflopss', 'while', 'precision', 'loss', 'due', 'to', 'matrix', 'multiplication', 'with', 'half', 'precision', 'input', 'might', 'be', 'critical', 'in', 'many', 'hpc', 'applications', 'it', 'can', 'be', 'considerably', 'reduced', 'at', 'the', 'cost', 'of', 'increased', 'computation', 'our', 'results', 'indicate', 'that', 'hpc', 'applications', 'using', 'matrix', 'multiplications', 'can', 'strongly', 'benefit', 'from', 'using', 'of', 'nvidia', 'tensor', 'cores']] | [-0.12953613780998657, 0.08146155558235779, -0.01899435419656838, -0.04294302026014968, -0.056096089458565944, -0.1785682310577038, 0.04683468304876084, 0.4217213514439491, -0.21893957909679165, -0.3893383588916936, 0.13298557626947258, -0.24365404621603565, -0.08372558911277918, 0.2541650272700743, -0.025035043082675304, 0.0901236014652978, 0.1672689587154083, 0.0390866348034958, -0.17351229812369628, -0.33537170815479417, 0.19128967656384807, 0.08721924054923762, 0.27052855215558946, 0.05687121519278445, 0.09882268961277728, -0.09045633196666682, 0.034557911227191825, -0.069761258849622, 0.01551501909962287, 0.14354799827319506, 0.2098001205902836, 0.1749534358613077, 0.2612292786259108, -0.45626847812220683, -0.08411403032022147, 0.021935485576043013, 0.11226260853892704, -0.009213994166673851, -0.04127629246524115, -0.21032131216223376, 0.12520208186349335, -0.23978071587420807, -0.04690146668683834, -0.11427385255289046, -0.030634973181286163, -0.019686997072213847, -0.2530199537021132, 0.04665995896383734, -0.04362897420002852, 0.056748791149011546, 0.008310879192223357, -0.25430112579412795, 0.060297766363807986, 0.04823324937672581, -0.07316949183767942, 0.09166290414630594, 0.20728492296006473, -0.11046294076247574, -0.15831729883106108, 0.3859571523655573, -0.096009836068927, -0.16660477956901715, 0.15917749405739626, -0.0739151015202153, -0.15157099504631805, 0.10269772878322037, 0.24532286014523685, 0.050578197230762255, -0.09723334253760817, 0.08234724015663403, 0.03953644446787362, 0.23376196494490062, 0.10140938717399005, 0.010655140611608488, 0.18028980708944037, 0.22897077285457845, 0.00029133101460798955, 0.15013613790717614, -0.10334139543409349, -0.12105500626792755, -0.18634021958008098, -0.2078454067550269, -0.15693483734865302, 0.02072813457307536, -0.13554844162710386, -0.12174885241083144, 0.3940771373575119, 0.17741377115215856, 0.11807561863679439, 0.09536723175612061, 0.35791944079776655, 0.03933638741848556, 0.22936378531290672, 0.1781663861658926, 0.1540381359491362, 0.09369909684439165, 0.1625943895504168, -0.19224683392172862, -0.03531609214552789, 0.003685286112818529] |
1,803.04015 | Multi-objective Contextual Bandit Problem with Similarity Information | In this paper we propose the multi-objective contextual bandit problem with
similarity information. This problem extends the classical contextual bandit
problem with similarity information by introducing multiple and possibly
conflicting objectives. Since the best arm in each objective can be different
given the context, learning the best arm based on a single objective can
jeopardize the rewards obtained from the other objectives. In order to evaluate
the performance of the learner in this setup, we use a performance metric
called the contextual Pareto regret. Essentially, the contextual Pareto regret
is the sum of the distances of the arms chosen by the learner to the context
dependent Pareto front. For this problem, we develop a new online learning
algorithm called Pareto Contextual Zooming (PCZ), which exploits the idea of
contextual zooming to learn the arms that are close to the Pareto front for
each observed context by adaptively partitioning the joint context-arm set
according to the observed rewards and locations of the context-arm pairs
selected in the past. Then, we prove that PCZ achieves $\tilde O
(T^{(1+d_p)/(2+d_p)})$ Pareto regret where $d_p$ is the Pareto zooming
dimension that depends on the size of the set of near-optimal context-arm
pairs. Moreover, we show that this regret bound is nearly optimal by providing
an almost matching $\Omega (T^{(1+d_p)/(2+d_p)})$ lower bound.
| stat.ML cs.LG | in this paper we propose the multiobjective contextual bandit problem with similarity information this problem extends the classical contextual bandit problem with similarity information by introducing multiple and possibly conflicting objectives since the best arm in each objective can be different given the context learning the best arm based on a single objective can jeopardize the rewards obtained from the other objectives in order to evaluate the performance of the learner in this setup we use a performance metric called the contextual pareto regret essentially the contextual pareto regret is the sum of the distances of the arms chosen by the learner to the context dependent pareto front for this problem we develop a new online learning algorithm called pareto contextual zooming pcz which exploits the idea of contextual zooming to learn the arms that are close to the pareto front for each observed context by adaptively partitioning the joint contextarm set according to the observed rewards and locations of the contextarm pairs selected in the past then we prove that pcz achieves tilde o t1d_p2d_p pareto regret where d_p is the pareto zooming dimension that depends on the size of the set of nearoptimal contextarm pairs moreover we show that this regret bound is nearly optimal by providing an almost matching omega t1d_p2d_p lower bound | [['in', 'this', 'paper', 'we', 'propose', 'the', 'multiobjective', 'contextual', 'bandit', 'problem', 'with', 'similarity', 'information', 'this', 'problem', 'extends', 'the', 'classical', 'contextual', 'bandit', 'problem', 'with', 'similarity', 'information', 'by', 'introducing', 'multiple', 'and', 'possibly', 'conflicting', 'objectives', 'since', 'the', 'best', 'arm', 'in', 'each', 'objective', 'can', 'be', 'different', 'given', 'the', 'context', 'learning', 'the', 'best', 'arm', 'based', 'on', 'a', 'single', 'objective', 'can', 'jeopardize', 'the', 'rewards', 'obtained', 'from', 'the', 'other', 'objectives', 'in', 'order', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'learner', 'in', 'this', 'setup', 'we', 'use', 'a', 'performance', 'metric', 'called', 'the', 'contextual', 'pareto', 'regret', 'essentially', 'the', 'contextual', 'pareto', 'regret', 'is', 'the', 'sum', 'of', 'the', 'distances', 'of', 'the', 'arms', 'chosen', 'by', 'the', 'learner', 'to', 'the', 'context', 'dependent', 'pareto', 'front', 'for', 'this', 'problem', 'we', 'develop', 'a', 'new', 'online', 'learning', 'algorithm', 'called', 'pareto', 'contextual', 'zooming', 'pcz', 'which', 'exploits', 'the', 'idea', 'of', 'contextual', 'zooming', 'to', 'learn', 'the', 'arms', 'that', 'are', 'close', 'to', 'the', 'pareto', 'front', 'for', 'each', 'observed', 'context', 'by', 'adaptively', 'partitioning', 'the', 'joint', 'contextarm', 'set', 'according', 'to', 'the', 'observed', 'rewards', 'and', 'locations', 'of', 'the', 'contextarm', 'pairs', 'selected', 'in', 'the', 'past', 'then', 'we', 'prove', 'that', 'pcz', 'achieves', 'tilde', 'o', 't1d_p2d_p', 'pareto', 'regret', 'where', 'd_p', 'is', 'the', 'pareto', 'zooming', 'dimension', 'that', 'depends', 'on', 'the', 'size', 'of', 'the', 'set', 'of', 'nearoptimal', 'contextarm', 'pairs', 'moreover', 'we', 'show', 'that', 'this', 'regret', 'bound', 'is', 'nearly', 'optimal', 'by', 'providing', 'an', 'almost', 'matching', 'omega', 't1d_p2d_p', 'lower', 'bound']] | [-0.07610364912826324, 0.0070036142084896605, -0.10494610329515466, 0.08754646533416915, -0.15759832610019317, -0.14845545655312278, 0.10905477560449514, 0.40057776711672266, -0.32033082561254084, -0.3210404462955683, 0.03438438788691762, -0.2547424628930253, -0.15534560757152796, 0.11699764297733292, -0.14258517824966355, 0.07630468817714985, 0.018283198361293735, 0.07515422374915297, -0.018453606966516833, -0.3133225796774691, 0.35689651424600527, 0.057876956610500845, 0.2868783362775554, -0.03341871107249547, 0.14253841334993073, -0.0003674839640680318, -0.0028801805113450947, 0.03206942709911235, -0.1529689972713496, 0.13892430114498902, 0.3007066283879854, 0.2476234566050399, 0.37566092695657893, -0.3382674520595922, -0.12895960958726774, 0.12571999538585404, 0.1353626451759695, 0.02028151290549975, -0.016310009369343764, -0.3316499445659204, 0.051181970810448035, -0.10472405216625413, -0.012637935509191496, -0.014049670816764724, -0.047684030037234044, 0.02929712649735091, -0.3550626772595134, 0.002920032881426616, 0.05477771169569117, -0.036480272950378256, -0.04911384419820959, -0.11408406244068642, 0.05909080789903196, 0.11975682415334708, 0.044101309067151886, 0.059994889769777134, 0.1321077256171886, -0.1428710225418144, -0.18773787364224406, 0.335139782698232, -0.03021617725281541, -0.18768676899582426, 0.13672635977256556, -0.10715185374317464, -0.10010498292117476, 0.1234748674552261, 0.20944418103834528, 0.14275348058980064, -0.16151499483412324, 0.053915539641633946, -0.1288462651645434, 0.1547185699803598, 0.10015552462444197, 0.03173181745136661, 0.1197763993861763, 0.1956900343142241, 0.16628755783340154, 0.16904608139123062, -0.07246469193416709, -0.12506313776057737, -0.28585903318604305, -0.10680456818505756, -0.17726443233360129, -0.06259211299018325, -0.15959399892003645, -0.12110713667054845, 0.35532707505137007, 0.15166458342997924, 0.2297080947569284, 0.14741021838848628, 0.31199782237271284, 0.07346036562722755, 0.019638162316258336, 0.17630962115520976, 0.22882641610530613, -0.0074736901132442125, 0.061528690370119606, -0.22723278526769447, 0.1644595017782891, 0.07002072957796958] |
1,803.04016 | Homological invariants of powers of fiber products | Let $R$ and $S$ be polynomial rings of positive dimensions over a field $k$.
Let $I\subseteq R, J\subseteq S$ be non-zero homogeneous ideals none of which
contains a linear form. Denote by $F$ the fiber product of $I$ and $J$ in
$T=R\otimes_k S$. We compute homological invariants of the powers of $F$ using
the data of $I$ and $J$. Under the assumption that either $\text{char}~ k=0$ or
$I$ and $J$ are monomial ideals, we provide explicit formulas for the depth and
regularity of powers of $F$. In particular, we establish for all $s\ge 2$ the
intriguing formula $\text{depth}(T/F^s)=0$. If moreover each of the ideals $I$
and $J$ is generated in a single degree, we show that for all $s\ge 1$,
$\text{reg}~ F^s=\max_{i\in [1,s]}\{\text{reg}~ I^i+s-i,\text{reg}~ J^i+s-i\}$.
Finally, we prove that the linearity defect of $F$ is the maximum of the
linearity defects of $I$ and $J$, extending previous work of Conca and R\"omer.
The proofs exploit the so-called Betti splittings of powers of a fiber product.
| math.AC | let r and s be polynomial rings of positive dimensions over a field k let isubseteq r jsubseteq s be nonzero homogeneous ideals none of which contains a linear form denote by f the fiber product of i and j in trotimes_k s we compute homological invariants of the powers of f using the data of i and j under the assumption that either textchar k0 or i and j are monomial ideals we provide explicit formulas for the depth and regularity of powers of f in particular we establish for all sge 2 the intriguing formula textdepthtfs0 if moreover each of the ideals i and j is generated in a single degree we show that for all sge 1 textreg fsmax_iin 1stextreg iisitextreg jisi finally we prove that the linearity defect of f is the maximum of the linearity defects of i and j extending previous work of conca and romer the proofs exploit the socalled betti splittings of powers of a fiber product | [['let', 'r', 'and', 's', 'be', 'polynomial', 'rings', 'of', 'positive', 'dimensions', 'over', 'a', 'field', 'k', 'let', 'isubseteq', 'r', 'jsubseteq', 's', 'be', 'nonzero', 'homogeneous', 'ideals', 'none', 'of', 'which', 'contains', 'a', 'linear', 'form', 'denote', 'by', 'f', 'the', 'fiber', 'product', 'of', 'i', 'and', 'j', 'in', 'trotimes_k', 's', 'we', 'compute', 'homological', 'invariants', 'of', 'the', 'powers', 'of', 'f', 'using', 'the', 'data', 'of', 'i', 'and', 'j', 'under', 'the', 'assumption', 'that', 'either', 'textchar', 'k0', 'or', 'i', 'and', 'j', 'are', 'monomial', 'ideals', 'we', 'provide', 'explicit', 'formulas', 'for', 'the', 'depth', 'and', 'regularity', 'of', 'powers', 'of', 'f', 'in', 'particular', 'we', 'establish', 'for', 'all', 'sge', '2', 'the', 'intriguing', 'formula', 'textdepthtfs0', 'if', 'moreover', 'each', 'of', 'the', 'ideals', 'i', 'and', 'j', 'is', 'generated', 'in', 'a', 'single', 'degree', 'we', 'show', 'that', 'for', 'all', 'sge', '1', 'textreg', 'fsmax_iin', '1stextreg', 'iisitextreg', 'jisi', 'finally', 'we', 'prove', 'that', 'the', 'linearity', 'defect', 'of', 'f', 'is', 'the', 'maximum', 'of', 'the', 'linearity', 'defects', 'of', 'i', 'and', 'j', 'extending', 'previous', 'work', 'of', 'conca', 'and', 'romer', 'the', 'proofs', 'exploit', 'the', 'socalled', 'betti', 'splittings', 'of', 'powers', 'of', 'a', 'fiber', 'product']] | [-0.19156047545260685, 0.08446825460388777, -0.03965888353966692, -0.033622820962677304, -0.03988311012164227, -0.19009685557359043, -0.011535588856903638, 0.32780137784345625, -0.30042696769683147, -0.1986803741651183, 0.09214750331542425, -0.28457307608493565, -0.08532838399467826, 0.16039114558202383, -0.05711843187687553, -0.050273711353821575, 0.022170957576178905, 0.06785735976314845, -0.07071554008724883, -0.29406223366763323, 0.3561350179121554, -0.039920928747445905, 0.14562676274440978, 0.048079602433143055, 0.09185601793648382, 0.01650855708984459, -0.043531662649797194, 0.02772161671335358, -0.24437665949796536, 0.14369979705778682, 0.25426540963802746, 0.13867950300486911, 0.23245747450668858, -0.3609776858755815, -0.10475419305335239, 0.1948820424834325, 0.09617963689159742, -0.013783408418947936, 0.042512185755917954, -0.1964829856172532, 0.18108335983172152, -0.16889406343471366, -0.14625354948506322, -0.06634492264568524, 0.14944556669797748, 0.08123194163594886, -0.33676919291885393, 0.020836311206514448, 0.17394486087251385, 0.1401673721606439, -0.018712671713774685, -0.1559970951009448, -0.0692842273808922, 0.0314383470415249, -0.020097315554512933, 0.018393896036904375, 0.020888332321466703, -0.11686761402389556, -0.11848221291896284, 0.33594230479859516, -0.10530425340219829, -0.16465999388118396, 0.10073692097662473, -0.19755380552367502, -0.11531674887826841, 0.08789602097243937, 0.04273590537772145, 0.16239622318253225, -0.02103384030080816, 0.2166341013808108, -0.1030035484757907, 0.08743322493344452, 0.1296979491598904, 0.03065709911034964, 0.13347021331600611, 0.024398750400041823, 0.056901639538272375, 0.11612094201165128, -0.05940141274634772, 0.05242229701289263, -0.3772558994684954, -0.2209118720738557, -0.19696370960775553, 0.1593334764789837, -0.1027341810949791, -0.10129343523825489, 0.410122369262302, 0.08641494780708596, 0.19614879196544863, 0.0845628383887182, 0.19497393036873298, 0.09544690172392992, 0.011952747186681009, 0.1257578335386121, 0.1204812029001754, 0.1983327770842907, -0.006236275813964037, -0.16057923798370263, 0.0077328033592997105, 0.13014133500064132] |
1,803.04017 | Particles approximation for some 1D kinetic Fokker-Planck equations with
singular forces | In this paper we consider a system of $N$ particles on the real line evolving
according to Newton's law, interacting through a singular (repulsive) force
deriving from the potential $\frac{|x|^{1-\alpha}}{1-\alpha}$ with $\alpha \in
(0,1/8)$ and Brownian force. Thanks to the entropy dissipation along the
Liouville equation associated to this particles system and a control of the
mechanic energy, we establish a quantitative estimate which enables to conclude
to a convergence/consistency the particles system toward the limiting
Vlasov-Fokker-Planck equation with singular force.
| math.AP | in this paper we consider a system of n particles on the real line evolving according to newtons law interacting through a singular repulsive force deriving from the potential fracx1alpha1alpha with alpha in 018 and brownian force thanks to the entropy dissipation along the liouville equation associated to this particles system and a control of the mechanic energy we establish a quantitative estimate which enables to conclude to a convergenceconsistency the particles system toward the limiting vlasovfokkerplanck equation with singular force | [['in', 'this', 'paper', 'we', 'consider', 'a', 'system', 'of', 'n', 'particles', 'on', 'the', 'real', 'line', 'evolving', 'according', 'to', 'newtons', 'law', 'interacting', 'through', 'a', 'singular', 'repulsive', 'force', 'deriving', 'from', 'the', 'potential', 'fracx1alpha1alpha', 'with', 'alpha', 'in', '018', 'and', 'brownian', 'force', 'thanks', 'to', 'the', 'entropy', 'dissipation', 'along', 'the', 'liouville', 'equation', 'associated', 'to', 'this', 'particles', 'system', 'and', 'a', 'control', 'of', 'the', 'mechanic', 'energy', 'we', 'establish', 'a', 'quantitative', 'estimate', 'which', 'enables', 'to', 'conclude', 'to', 'a', 'convergenceconsistency', 'the', 'particles', 'system', 'toward', 'the', 'limiting', 'vlasovfokkerplanck', 'equation', 'with', 'singular', 'force']] | [-0.1378725974089643, 0.1093477690946075, -0.13090919814650206, 0.0007749931692275443, -0.047267994088934194, -0.1576142743453855, 0.05180250565798458, 0.27362061230630813, -0.27499632522039397, -0.2828572567057195, 0.03609913460544865, -0.3276708173282633, -0.10793341076829695, 0.16800511741562735, -0.03081495811148912, 0.0728218265561552, 0.029332126125316077, 0.06311768350262148, -0.0037346959727097163, -0.14519180466208748, 0.3431837992518669, 0.04382067751964625, 0.19538867370449478, 0.04587090511723787, 0.16370449896571757, 0.00025403385840450663, 0.0019271114039458807, 0.02621041375860392, -0.18016278105964767, 0.11691803147992756, 0.1314252312943528, -0.0205660875521223, 0.2868874429996255, -0.41845694146578827, -0.20447071226714533, 0.12844115575846238, 0.15961805367002357, 0.10224182687293078, -0.03583309097551517, -0.30271548612774174, 0.005936398834013675, -0.14482882913626446, -0.24045204097711587, -0.03488550608671164, 0.04820548838499603, 0.09065864536958405, -0.27432079620282107, 0.11125009290025203, 0.03720813360701822, 0.014981313856153549, -0.13536365194646996, -0.014753079815484772, 0.01766269443898544, 0.0783656733228436, 0.06801751718555778, 0.03840169232173622, 0.18263878670367825, -0.11478202320234496, -0.05056976746838493, 0.40646637898952337, -0.09392685716959966, -0.2461923958167811, 0.20253527764955984, -0.13429976505510322, -0.10374123817073959, 0.13326331279299494, 0.18330055926160155, 0.07010189811244115, -0.19060334091110132, 0.07934390411187624, 0.027754324535497383, 0.1485556627570687, 0.02286561904769815, -0.05112166301924971, 0.20091148045450402, 0.13883699988356873, 0.09418223846609457, 0.17298630546023952, -0.06128355789755742, -0.15699077164164826, -0.31043861268819134, -0.23373739492101006, -0.18400943375935283, 0.1234701836858935, -0.11286526233439712, -0.17879810312739278, 0.3401913242060927, 0.1685796198346711, 0.19665257135241093, 0.10469300886822416, 0.2942229360224137, 0.16375629708783912, 0.010056525415776275, 0.034218518576242876, 0.25442072383682185, 0.1649166871616735, 0.15765670183574473, -0.25468030612609244, -0.03484127881745712, 0.09658927897203572] |
1,803.04018 | The corank of a flow over the category of linearly compact vector spaces | For a topological flow $(V,\phi)$ - i.e., $V$ is a linearly compact vector
space and $\phi$ a continuous endomorphism of $V$ - we gain a deep
understanding of the relationship between $(V,\phi)$ and the Bernoulli shift: a
topological flow $(V,\phi)$ is essentially a product of one-dimensional left
Bernoulli shifts as many as $\mathrm{ent}^*(V,\phi)$ counts. This novel
comprehension brings us to introduce a notion of corank for topological flows
designed for coinciding with the value of the topological entropy of
$(V,\phi)$. As an application, we provide an alternative proof of the so-called
Bridge Theorem for locally linearly compact vector spaces connecting the
topological entropy to the algebraic entropy by means of Lefschetz duality.
| math.GR | for a topological flow vphi ie v is a linearly compact vector space and phi a continuous endomorphism of v we gain a deep understanding of the relationship between vphi and the bernoulli shift a topological flow vphi is essentially a product of onedimensional left bernoulli shifts as many as mathrmentvphi counts this novel comprehension brings us to introduce a notion of corank for topological flows designed for coinciding with the value of the topological entropy of vphi as an application we provide an alternative proof of the socalled bridge theorem for locally linearly compact vector spaces connecting the topological entropy to the algebraic entropy by means of lefschetz duality | [['for', 'a', 'topological', 'flow', 'vphi', 'ie', 'v', 'is', 'a', 'linearly', 'compact', 'vector', 'space', 'and', 'phi', 'a', 'continuous', 'endomorphism', 'of', 'v', 'we', 'gain', 'a', 'deep', 'understanding', 'of', 'the', 'relationship', 'between', 'vphi', 'and', 'the', 'bernoulli', 'shift', 'a', 'topological', 'flow', 'vphi', 'is', 'essentially', 'a', 'product', 'of', 'onedimensional', 'left', 'bernoulli', 'shifts', 'as', 'many', 'as', 'mathrmentvphi', 'counts', 'this', 'novel', 'comprehension', 'brings', 'us', 'to', 'introduce', 'a', 'notion', 'of', 'corank', 'for', 'topological', 'flows', 'designed', 'for', 'coinciding', 'with', 'the', 'value', 'of', 'the', 'topological', 'entropy', 'of', 'vphi', 'as', 'an', 'application', 'we', 'provide', 'an', 'alternative', 'proof', 'of', 'the', 'socalled', 'bridge', 'theorem', 'for', 'locally', 'linearly', 'compact', 'vector', 'spaces', 'connecting', 'the', 'topological', 'entropy', 'to', 'the', 'algebraic', 'entropy', 'by', 'means', 'of', 'lefschetz', 'duality']] | [-0.18867862208905511, 0.14987952570637064, -0.12707610922617787, 0.06661781912173974, -0.12169653808680969, -0.16731699231858238, 0.03548096464690539, 0.3287008745476193, -0.3251442944336204, -0.19186477874909794, 0.04197909490102816, -0.27507429059441074, -0.14134445471193538, 0.20845311943339098, -0.07690867140714011, 0.04448602987461886, -0.028643320921227473, 0.1014812517285864, -0.10725693195767769, -0.194089063250998, 0.3863882311521559, -0.030360923766280277, 0.25506947730420104, 0.05909865044715276, 0.1307784784179386, 0.0019349157382998992, -0.006420238533082905, 0.038034457196171795, -0.17552047609052526, 0.15312023483080053, 0.2238354288477348, 0.10742363089336715, 0.2795141882112532, -0.326915397488196, -0.20314550003754572, 0.14875924170290658, 0.09334277799844297, 0.015552278358164594, -0.06532540598696251, -0.29272338243440615, 0.09174243433170294, -0.1905489893215751, -0.13771579615182217, -0.10247051841878427, 0.0916303408016032, 0.01067258447083995, -0.26936946114644816, 0.02522641104227359, 0.09520061866918561, 0.08334231714572791, -0.059324849055174295, -0.02246202460870386, -0.07315495142653379, 0.0887607959133291, 0.021984675871379197, 0.10973600834744786, 0.09048750901748555, -0.14095902644362676, -0.12897488479545222, 0.35452551198183396, -0.10721933836792383, -0.21554571373063489, 0.14840673076826225, -0.05518726464104625, -0.11419696588103377, 0.09479491591214313, 0.13274757203500753, 0.09539844033333959, -0.06817804288050723, 0.14141960307814763, -0.05536774609989803, 0.11345828863885041, 0.07214692964671401, 0.03269706150397248, 0.21859601335899068, 0.12341565248308652, 0.16070641582850964, 0.18839484618959623, -0.03485790105673288, -0.08713985137254802, -0.36460019038016095, -0.23897278867234742, -0.15144249469409227, 0.12189125975405951, -0.12290980868813701, -0.23188040207285399, 0.39808448960731196, 0.04089975761625608, 0.23851975795189176, 0.0906097951319513, 0.25373391480475593, 0.12631310335544169, 0.01003990262114537, 0.0485937979619431, 0.13694445139925004, 0.24201876870271058, 0.09486247320582561, -0.15119185126941959, -0.018737213946708024, 0.16211556981172448] |
1,803.04019 | Data-Augmented Contact Model for Rigid Body Simulation | Accurately modeling contact behaviors for real-world, near-rigid materials
remains a grand challenge for existing rigid-body physics simulators. This
paper introduces a data-augmented contact model that incorporates analytical
solutions with observed data to predict the 3D contact impulse which could
result in rigid bodies bouncing, sliding or spinning in all directions. Our
method enhances the expressiveness of the standard Coulomb contact model by
learning the contact behaviors from the observed data, while preserving the
fundamental contact constraints whenever possible. For example, a classifier is
trained to approximate the transitions between static and dynamic frictions,
while non-penetration constraint during collision is enforced analytically. Our
method computes the aggregated effect of contact for the entire rigid body,
instead of predicting the contact force for each contact point individually,
maintaining same simulation speed as the number of contact points increases for
detailed geometries. Supplemental video: https://shorturl.at/eilwX
Keywords: Physics Simulation Algorithms, Dynamics Learning, Contact Learning
| cs.RO cs.LG | accurately modeling contact behaviors for realworld nearrigid materials remains a grand challenge for existing rigidbody physics simulators this paper introduces a dataaugmented contact model that incorporates analytical solutions with observed data to predict the 3d contact impulse which could result in rigid bodies bouncing sliding or spinning in all directions our method enhances the expressiveness of the standard coulomb contact model by learning the contact behaviors from the observed data while preserving the fundamental contact constraints whenever possible for example a classifier is trained to approximate the transitions between static and dynamic frictions while nonpenetration constraint during collision is enforced analytically our method computes the aggregated effect of contact for the entire rigid body instead of predicting the contact force for each contact point individually maintaining same simulation speed as the number of contact points increases for detailed geometries supplemental video httpsshorturlateilwx keywords physics simulation algorithms dynamics learning contact learning | [['accurately', 'modeling', 'contact', 'behaviors', 'for', 'realworld', 'nearrigid', 'materials', 'remains', 'a', 'grand', 'challenge', 'for', 'existing', 'rigidbody', 'physics', 'simulators', 'this', 'paper', 'introduces', 'a', 'dataaugmented', 'contact', 'model', 'that', 'incorporates', 'analytical', 'solutions', 'with', 'observed', 'data', 'to', 'predict', 'the', '3d', 'contact', 'impulse', 'which', 'could', 'result', 'in', 'rigid', 'bodies', 'bouncing', 'sliding', 'or', 'spinning', 'in', 'all', 'directions', 'our', 'method', 'enhances', 'the', 'expressiveness', 'of', 'the', 'standard', 'coulomb', 'contact', 'model', 'by', 'learning', 'the', 'contact', 'behaviors', 'from', 'the', 'observed', 'data', 'while', 'preserving', 'the', 'fundamental', 'contact', 'constraints', 'whenever', 'possible', 'for', 'example', 'a', 'classifier', 'is', 'trained', 'to', 'approximate', 'the', 'transitions', 'between', 'static', 'and', 'dynamic', 'frictions', 'while', 'nonpenetration', 'constraint', 'during', 'collision', 'is', 'enforced', 'analytically', 'our', 'method', 'computes', 'the', 'aggregated', 'effect', 'of', 'contact', 'for', 'the', 'entire', 'rigid', 'body', 'instead', 'of', 'predicting', 'the', 'contact', 'force', 'for', 'each', 'contact', 'point', 'individually', 'maintaining', 'same', 'simulation', 'speed', 'as', 'the', 'number', 'of', 'contact', 'points', 'increases', 'for', 'detailed', 'geometries', 'supplemental', 'video', 'httpsshorturlateilwx', 'keywords', 'physics', 'simulation', 'algorithms', 'dynamics', 'learning', 'contact', 'learning']] | [-0.12879606574069047, 0.06475923845744473, -0.07014296648573855, 0.051123840181975806, -0.08160762802147675, -0.2254619156885517, 0.058924835451078544, 0.36363361074570444, -0.28478727780982555, -0.3359993914167253, 0.0225598677264639, -0.2849605283379592, -0.17865650654589169, 0.17854265905180305, -0.04686500504612923, 0.10121919280355608, 0.11456507295698252, 0.027287814450518998, -0.07616941269054296, -0.20179708789871542, 0.2858995273834307, 0.04362041683595678, 0.2924842332746059, 0.061386371351741006, 0.13579807264867844, 0.053802702960326965, 0.011614288590948454, 0.05313116368437623, -0.1270780644410125, 0.09913700313819884, 0.2629629187910949, 0.0737140111862713, 0.23620262557028124, -0.42505000344158816, -0.25100000413765994, 0.06956836814060807, 0.09550117944279723, 0.12439188247955961, -0.015550398402191048, -0.2952764449303582, 0.027887040271029978, -0.14232138930601163, -0.1323463748640462, -0.08130707693655019, 0.017872434972016602, 0.02364705962163315, -0.24885439026425749, 0.06664260833105384, 0.06673940533190816, 0.06700696198007204, -0.09221288522989833, -0.061458568578592235, -0.015662406483702613, 0.18515236964043005, 0.05400076093106361, 0.010213917993234107, 0.21018753037319188, -0.1528208530621272, -0.10423795690747516, 0.42191473735908935, -0.026857866198543284, -0.2283479958216366, 0.2152991026558682, -0.06825486146813671, -0.10980533696683717, 0.17852182259108096, 0.19893769637350267, 0.07907921628442112, -0.1797857200039313, 0.04737087838850203, 0.0023277537747217504, 0.12187914052863305, 0.051345257166673076, -0.10030602540933346, 0.2444532369833827, 0.24636222109598602, 0.03178319247633269, 0.11928487267820227, -0.09576747168930586, -0.17266331413399816, -0.2766307674602964, -0.10276496323488103, -0.1560270998653512, 0.0026467170616324316, -0.11776906082196859, -0.17611268566694382, 0.32530395986278693, 0.13411187170535926, 0.17558706161916107, 0.10931322417743879, 0.3557845129312685, 0.01810562355528217, 0.06484810311672272, 0.08000727507267022, 0.2495604928636817, 0.031737811008668286, 0.1185462781604717, -0.21777455572932708, 0.111978305782654, 0.0483852374061142] |
1,803.0402 | Maximum Weight Spectrum Codes | In the recent work \cite{shi18}, a combinatorial problem concerning linear
codes over a finite field $\F_q$ was introduced. In that work the authors
studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero
distinct Hamming weights, showing that its cardinality is upper bounded by
$\frac{q^k-1}{q-1}$. They showed that this bound was sharp in the case $ q=2 $,
and in the case $ k=2 $. They conjectured that the bound is sharp for every
prime power $ q $ and every positive integer $ k $. In this work quickly
establish the truth of this conjecture. We provide two proofs, each employing
different construction techniques. The first relies on the geometric view of
linear codes as systems of projective points. The second approach is purely
algebraic. We establish some lower bounds on the length of codes that satisfy
the conjecture, and the length of the new codes constructed here are discussed.
| cs.IT math.CO math.IT | in the recent work citeshi18 a combinatorial problem concerning linear codes over a finite field f_q was introduced in that work the authors studied the weight set of an nk_q linear code that is the set of nonzero distinct hamming weights showing that its cardinality is upper bounded by fracqk1q1 they showed that this bound was sharp in the case q2 and in the case k2 they conjectured that the bound is sharp for every prime power q and every positive integer k in this work quickly establish the truth of this conjecture we provide two proofs each employing different construction techniques the first relies on the geometric view of linear codes as systems of projective points the second approach is purely algebraic we establish some lower bounds on the length of codes that satisfy the conjecture and the length of the new codes constructed here are discussed | [['in', 'the', 'recent', 'work', 'citeshi18', 'a', 'combinatorial', 'problem', 'concerning', 'linear', 'codes', 'over', 'a', 'finite', 'field', 'f_q', 'was', 'introduced', 'in', 'that', 'work', 'the', 'authors', 'studied', 'the', 'weight', 'set', 'of', 'an', 'nk_q', 'linear', 'code', 'that', 'is', 'the', 'set', 'of', 'nonzero', 'distinct', 'hamming', 'weights', 'showing', 'that', 'its', 'cardinality', 'is', 'upper', 'bounded', 'by', 'fracqk1q1', 'they', 'showed', 'that', 'this', 'bound', 'was', 'sharp', 'in', 'the', 'case', 'q2', 'and', 'in', 'the', 'case', 'k2', 'they', 'conjectured', 'that', 'the', 'bound', 'is', 'sharp', 'for', 'every', 'prime', 'power', 'q', 'and', 'every', 'positive', 'integer', 'k', 'in', 'this', 'work', 'quickly', 'establish', 'the', 'truth', 'of', 'this', 'conjecture', 'we', 'provide', 'two', 'proofs', 'each', 'employing', 'different', 'construction', 'techniques', 'the', 'first', 'relies', 'on', 'the', 'geometric', 'view', 'of', 'linear', 'codes', 'as', 'systems', 'of', 'projective', 'points', 'the', 'second', 'approach', 'is', 'purely', 'algebraic', 'we', 'establish', 'some', 'lower', 'bounds', 'on', 'the', 'length', 'of', 'codes', 'that', 'satisfy', 'the', 'conjecture', 'and', 'the', 'length', 'of', 'the', 'new', 'codes', 'constructed', 'here', 'are', 'discussed']] | [-0.18678133442403097, 0.10563299013072487, -0.08647495343298843, 0.05323362101765656, -0.03903309933917776, -0.17083309397216223, 0.039977129351041495, 0.3040819559852299, -0.2874018022669352, -0.24273064455706372, 0.08588478054886378, -0.24913980532118618, -0.17485596539376125, 0.2410653308863203, -0.10148693756710687, 0.0682332552917627, 0.036925691267641336, 0.08405569708473144, -0.08442132887090611, -0.36511045371577755, 0.34586906167742326, 0.04602583633633713, 0.22249845276771701, 0.08656415307004489, 0.07265956128276853, 0.012754356469448707, -0.024019329202654836, 0.011061138594650652, -0.22141743851863468, 0.1354515878348101, 0.2626155444344327, 0.15132087479307227, 0.2621568513536596, -0.36102125544080266, -0.1843524435549027, 0.13830188447481964, 0.10684189702103501, 0.11186889899664954, -0.026471240099914986, -0.19382589445321832, 0.16134650312198248, -0.12431377455056326, -0.10149403975651383, -0.022412836494255964, 0.04153046844453768, 0.012243470700125988, -0.2656136203863441, -0.015126774275726448, 0.1481412718206491, 0.10627666214933103, -0.06643246818566695, -0.1672176033862841, 0.025787563516107732, 0.09149603037265679, 0.009701729790396886, 0.05914468629595071, -0.005262256782559346, -0.06667534405627122, -0.14287765327943105, 0.3108805636683964, -0.028464070986956358, -0.1778001597100129, 0.12514918785516735, -0.13287081832563735, -0.15240112239054773, 0.10343028520463571, 0.14371115067010515, 0.1467662415465608, -0.06248609925148218, 0.16702338266513336, -0.1701067135898932, 0.14761064087091755, 0.11540937029169746, 0.042516854805760215, 0.12539707542371567, 0.06852508672474794, 0.08812034420018429, 0.1703575236391123, -0.017937454525764063, -0.03205806411458307, -0.3311196640995012, -0.1328216285681215, -0.24187550205922342, 0.04813399706163431, -0.11190233105916789, -0.1609192006218196, 0.368526499485597, 0.1032357003271886, 0.18967747015377015, 0.1247510682753198, 0.2713837946385579, 0.11154684373787573, 0.046485095922771384, 0.12668944894629594, 0.18741136425902769, 0.17484624275605973, 0.015819650191226848, -0.16450465127505995, 0.05994582194089411, 0.1592507043023943] |
1,803.04021 | A highly asymmetric nodal semimetal in bulk SmB6 | We show that novel low temperature properties of bulk SmB6, including the
sudden growth of the de Haas-van Alphen amplitude (and heat capacity)
originating from the bulk at millikelvin temperatures and a previously
unreported linear-in-temperature bulk electrical conductivity at liquid helium
temperatures, signal the presence of a highly asymmetric nodal semimetal. We
show how the highly asymmetric nodal semimetal can be the result of a
topological transformation, of the type recently considered by Shen and Fu,
occurring in a Kondo lattice with dispersionless f-electron levels and Sm
vacancies or other lattice defects. If supported by further data experimental,
the existence of a nodal semimetal would cast considerable doubt over a neutral
Fermi surface being required to explain the origin of the dHvA effect SmB6.
| cond-mat.str-el | we show that novel low temperature properties of bulk smb6 including the sudden growth of the de haasvan alphen amplitude and heat capacity originating from the bulk at millikelvin temperatures and a previously unreported linearintemperature bulk electrical conductivity at liquid helium temperatures signal the presence of a highly asymmetric nodal semimetal we show how the highly asymmetric nodal semimetal can be the result of a topological transformation of the type recently considered by shen and fu occurring in a kondo lattice with dispersionless felectron levels and sm vacancies or other lattice defects if supported by further data experimental the existence of a nodal semimetal would cast considerable doubt over a neutral fermi surface being required to explain the origin of the dhva effect smb6 | [['we', 'show', 'that', 'novel', 'low', 'temperature', 'properties', 'of', 'bulk', 'smb6', 'including', 'the', 'sudden', 'growth', 'of', 'the', 'de', 'haasvan', 'alphen', 'amplitude', 'and', 'heat', 'capacity', 'originating', 'from', 'the', 'bulk', 'at', 'millikelvin', 'temperatures', 'and', 'a', 'previously', 'unreported', 'linearintemperature', 'bulk', 'electrical', 'conductivity', 'at', 'liquid', 'helium', 'temperatures', 'signal', 'the', 'presence', 'of', 'a', 'highly', 'asymmetric', 'nodal', 'semimetal', 'we', 'show', 'how', 'the', 'highly', 'asymmetric', 'nodal', 'semimetal', 'can', 'be', 'the', 'result', 'of', 'a', 'topological', 'transformation', 'of', 'the', 'type', 'recently', 'considered', 'by', 'shen', 'and', 'fu', 'occurring', 'in', 'a', 'kondo', 'lattice', 'with', 'dispersionless', 'felectron', 'levels', 'and', 'sm', 'vacancies', 'or', 'other', 'lattice', 'defects', 'if', 'supported', 'by', 'further', 'data', 'experimental', 'the', 'existence', 'of', 'a', 'nodal', 'semimetal', 'would', 'cast', 'considerable', 'doubt', 'over', 'a', 'neutral', 'fermi', 'surface', 'being', 'required', 'to', 'explain', 'the', 'origin', 'of', 'the', 'dhva', 'effect', 'smb6']] | [-0.18930779554085025, 0.2212432432551718, -0.056889618007135725, 0.017313403471733532, -0.09247741715479342, -0.1823809139070011, 0.1499012282846736, 0.29642390753161313, -0.2574653398741277, -0.2771060335367257, 0.017374138075542906, -0.3408872535932929, -0.1332346368712493, 0.1931452949572685, -0.014815194644935189, 0.027108421271306374, -0.031092488402200323, -0.0368654832380989, -0.12203693043275346, -0.24812998498635996, 0.30854211310525576, 0.0543176194562787, 0.3370793025279718, 0.11238370074575106, 0.00844679900816822, -0.05248671775353291, 0.11472962481380936, 0.05642868013444146, -0.15127113778661652, 0.014689009570922222, 0.26189653486043457, -0.10877488549393151, 0.1456683495893113, -0.42521537750238375, -0.270770687170537, 0.029451707682211795, 0.09477378177126089, 0.14610503448150872, -0.11997936896964788, -0.31666848827303656, 0.04659975600248623, -0.14910446048053283, -0.14653709424929995, -0.07706206447760304, -0.03682509960696822, -0.055295431747752796, -0.16253612493915903, 0.15138587815087498, 0.058356652167745895, 0.09893677061172051, -0.12056945604197081, -0.1301615258430942, -0.12986526881802768, -0.0015563914832103277, 0.0697736815049974, 0.009340147534760857, 0.12634940253525612, -0.08806322164262735, -0.11669366843923326, 0.3713839946524991, -0.10966884956184414, -0.054563459172289094, 0.19356553534406326, -0.22582678247483506, -0.09424338319173155, 0.21566791578586544, 0.10351405340817667, 0.055097967779616855, -0.10753737415577616, 0.10698648039725676, -0.0411920896956637, 0.14201662560921133, 0.0678953158109629, 0.07819085409808453, 0.3122633860686854, 0.172561508704788, 0.010863114163399704, 0.11727997745460485, -0.15602678559239833, 0.014011754761374886, -0.24191376231911202, -0.1761940244318647, -0.21611870755441487, 0.09847526263911277, -0.042410214079990835, -0.22449570289632725, 0.3933087226619283, 0.0995783544964187, 0.21234535964603926, -0.08408372781630005, 0.2022203890364542, 0.10165200740729849, 0.06214339743112965, 0.05626534934966795, 0.22262369026805484, 0.14455956977326423, 0.14914231009372028, -0.33514667305749873, 0.07844563393530646, 0.0278722942926951] |
1,803.04022 | Deep Dictionary Learning: A PARametric NETwork Approach | Deep dictionary learning seeks multiple dictionaries at different image
scales to capture complementary coherent characteristics. We propose a method
for learning a hierarchy of synthesis dictionaries with an image classification
goal. The dictionaries and classification parameters are trained by a
classification objective, and the sparse features are extracted by reducing a
reconstruction loss in each layer. The reconstruction objectives in some sense
regularize the classification problem and inject source signal information in
the extracted features. The performance of the proposed hierarchical method
increases by adding more layers, which consequently makes this model easier to
tune and adapt. The proposed algorithm furthermore, shows remarkably lower
fooling rate in presence of adversarial perturbation. The validation of the
proposed approach is based on its classification performance using four
benchmark datasets and is compared to a CNN of similar size.
| cs.CV | deep dictionary learning seeks multiple dictionaries at different image scales to capture complementary coherent characteristics we propose a method for learning a hierarchy of synthesis dictionaries with an image classification goal the dictionaries and classification parameters are trained by a classification objective and the sparse features are extracted by reducing a reconstruction loss in each layer the reconstruction objectives in some sense regularize the classification problem and inject source signal information in the extracted features the performance of the proposed hierarchical method increases by adding more layers which consequently makes this model easier to tune and adapt the proposed algorithm furthermore shows remarkably lower fooling rate in presence of adversarial perturbation the validation of the proposed approach is based on its classification performance using four benchmark datasets and is compared to a cnn of similar size | [['deep', 'dictionary', 'learning', 'seeks', 'multiple', 'dictionaries', 'at', 'different', 'image', 'scales', 'to', 'capture', 'complementary', 'coherent', 'characteristics', 'we', 'propose', 'a', 'method', 'for', 'learning', 'a', 'hierarchy', 'of', 'synthesis', 'dictionaries', 'with', 'an', 'image', 'classification', 'goal', 'the', 'dictionaries', 'and', 'classification', 'parameters', 'are', 'trained', 'by', 'a', 'classification', 'objective', 'and', 'the', 'sparse', 'features', 'are', 'extracted', 'by', 'reducing', 'a', 'reconstruction', 'loss', 'in', 'each', 'layer', 'the', 'reconstruction', 'objectives', 'in', 'some', 'sense', 'regularize', 'the', 'classification', 'problem', 'and', 'inject', 'source', 'signal', 'information', 'in', 'the', 'extracted', 'features', 'the', 'performance', 'of', 'the', 'proposed', 'hierarchical', 'method', 'increases', 'by', 'adding', 'more', 'layers', 'which', 'consequently', 'makes', 'this', 'model', 'easier', 'to', 'tune', 'and', 'adapt', 'the', 'proposed', 'algorithm', 'furthermore', 'shows', 'remarkably', 'lower', 'fooling', 'rate', 'in', 'presence', 'of', 'adversarial', 'perturbation', 'the', 'validation', 'of', 'the', 'proposed', 'approach', 'is', 'based', 'on', 'its', 'classification', 'performance', 'using', 'four', 'benchmark', 'datasets', 'and', 'is', 'compared', 'to', 'a', 'cnn', 'of', 'similar', 'size']] | [-0.0291459296225666, -0.028352129535800057, -0.07673301733859048, 0.06406023136343506, -0.07997176619178123, -0.1759668877314064, 0.017072448109769645, 0.42173092106959836, -0.3030274529763333, -0.35722880329772394, 0.07867333932902992, -0.2784306247622761, -0.1777498495169258, 0.1799592933504541, -0.11884226349716567, 0.09832717758485267, 0.12495066091822296, 0.05273637722027214, -0.10950556026963408, -0.2977533265811336, 0.31676617474124, 0.07754234452744747, 0.3794159420084564, -0.021740095922723413, 0.12254793759637002, -0.030458119697868824, -0.0562291182920008, -0.0240223260514219, -0.03327933231176918, 0.1808291790935875, 0.29844271916012716, 0.19625578590271556, 0.30842565531801325, -0.3730095843579072, -0.22456767217441023, 0.05926302273805691, 0.13033201128371943, 0.11885149533501295, -0.04586445200670021, -0.31602173877421164, 0.1107806783676257, -0.1419378148515106, 0.025489760316250956, -0.1406710001756437, -0.06238425238852335, -0.02844677438534906, -0.32303335853194926, 0.03270368938512333, 0.08725937415660798, 0.011984176712918697, -0.09989118893880754, -0.11417514516848742, 0.014604804015321219, 0.15398130043382374, 0.01938480227973367, 0.05562861693718279, 0.13064123053610435, -0.20066394047941738, -0.1231665942374521, 0.34038370173862753, -0.09148359602241886, -0.23968232448918142, 0.20408530547865666, -0.011001948599347515, -0.10846626409436473, 0.14571002056575655, 0.2438711367559496, 0.12576791721135927, -0.15547424687675254, -0.012420299626041121, -0.025063483921044013, 0.21905021001036992, 0.07573171273928464, 0.002038747332442333, 0.14373079300190406, 0.2785998963877586, 0.05054510302622529, 0.18227308350426885, -0.16868585506145953, -0.014825337004902609, -0.1947737265183926, -0.06061132708804079, -0.2150216881230282, -0.06949749666348319, -0.1154609799537224, -0.12170137846431531, 0.4495231678216335, 0.21955732333556036, 0.25108189390876384, 0.10030242747726494, 0.34985917257418964, 0.03350579331163317, 0.13111070811282843, 0.0908557022236945, 0.19391971095640603, 0.06366846306071453, 0.07357646800881626, -0.19322144804412827, 0.09228041889625327, 0.083356876816491] |
1,803.04023 | A $\psi$-Ontology Result without the Cartesian Product Assumption | We introduce a weakening of the Preparation Independence Postulate of Pusey,
Barrett, and Rudolph that does not presuppose that the space of ontic states
resulting from a product state preparation can be represented by the Cartesian
product of subsystem state spaces. On the basis of this weakened assumption, it
is shown that, in any model that reproduces the quantum probabilities, any pair
of pure quantum states $\ket{\psi}$, $\ket{\phi}$ with $\bkt{\phi}{\psi} \leq
1/\sqrt{2}$ must be ontologically distinct.
| quant-ph | we introduce a weakening of the preparation independence postulate of pusey barrett and rudolph that does not presuppose that the space of ontic states resulting from a product state preparation can be represented by the cartesian product of subsystem state spaces on the basis of this weakened assumption it is shown that in any model that reproduces the quantum probabilities any pair of pure quantum states ketpsi ketphi with bktphipsi leq 1sqrt2 must be ontologically distinct | [['we', 'introduce', 'a', 'weakening', 'of', 'the', 'preparation', 'independence', 'postulate', 'of', 'pusey', 'barrett', 'and', 'rudolph', 'that', 'does', 'not', 'presuppose', 'that', 'the', 'space', 'of', 'ontic', 'states', 'resulting', 'from', 'a', 'product', 'state', 'preparation', 'can', 'be', 'represented', 'by', 'the', 'cartesian', 'product', 'of', 'subsystem', 'state', 'spaces', 'on', 'the', 'basis', 'of', 'this', 'weakened', 'assumption', 'it', 'is', 'shown', 'that', 'in', 'any', 'model', 'that', 'reproduces', 'the', 'quantum', 'probabilities', 'any', 'pair', 'of', 'pure', 'quantum', 'states', 'ketpsi', 'ketphi', 'with', 'bktphipsi', 'leq', '1sqrt2', 'must', 'be', 'ontologically', 'distinct']] | [-0.13320782789805283, 0.2248560003687938, -0.13303891350825628, 0.042715880100925765, -0.012669513029977679, -0.15229125066349905, 0.06068097759426261, 0.29335284013301133, -0.23518843727807204, -0.2455412943661213, 0.05355969726884117, -0.2162770811251054, -0.08639091270044447, 0.13564275006763638, -0.10059003055716555, 0.000978833536307017, 0.10091751605272294, 0.04692442774772644, -0.09301820948719978, -0.22878858941607177, 0.3890223351245125, -0.008233933861677846, 0.28592104656000933, 0.023467914542804162, 0.10664483220626911, 0.07737086751808722, 0.07010926117499669, 0.04618481776327826, -0.09897934316541068, 0.07588885028924172, 0.2283793035397927, 0.22588952138399085, 0.248660257657369, -0.4065448774645726, -0.20353244770939152, 0.15804399265286823, 0.07748163361102342, 0.11098881869887313, 0.0648712261316056, -0.33918022622043886, 0.04256833290060361, -0.21698049017538626, -0.10117245314953228, -0.11350833884129921, 0.016819081492722033, -0.055329276702056326, -0.24531541739280024, 0.06629511226744701, 0.15602419878666599, 0.0028127686213701964, -0.04554139751940966, -0.10159091477592787, -0.07346318529297909, 0.09205346289401253, -0.057559021591829754, 0.04297981070354581, 0.10533641550689936, -0.0821502921016266, -0.1697708521472911, 0.34424102151145536, -0.03773675655325254, -0.23382270942131678, 0.16088547063370545, -0.14728023486211897, -0.14003005127732954, 0.055859978546698885, 0.022251522913575173, 0.10136533693720896, -0.06895251180976629, 0.13295764608386282, -0.11060718930015961, 0.21442742264519135, 0.07230190536317727, 0.07128824627414966, 0.1564985583536327, 0.036181165206556516, 0.04936123602713148, 0.11293789411274095, 0.0056210232681284346, -0.1193862696387805, -0.3737643360098203, -0.2394388948516765, -0.2723951682417343, 0.15273273486973873, -0.02783937489594488, -0.16795486744920102, 0.3302775071499248, 0.10651312437218924, 0.15111888525386652, 0.014086386015017827, 0.2029064076890548, 0.11235707115575981, 0.05594117974241575, 0.09209502906848988, 0.23717509645968676, 0.14172117748918633, 0.001153691466897726, -0.17196379569980005, 0.17692169388135273, 0.07547877057145039] |
1,803.04024 | The shortness of human life constitutes its limit | In this paper, we affirm our earlier findings of evidence for a limit to
human lifespan. In particular, we assess the analyses in extreme value theory
(EVT) performed by Rootz\'en and Zholud. We find that their criticisms of our
work are unfounded and that their analyses are contradicted by several other
papers using EVT. Furthermore, we find that even if we completely accept the
conclusions about late-life human mortality reached by Rootz\'en and Zholud,
their results do not actually contradict the findings presented in our original
paper: whether unbounded or not, human lifespan is unlikely to greatly exceed
120 years, and the improbability of longer survival---whether it is exactly
zero or merely astronomically small---acts as a de facto limit. In order to
eliminate the confusion surrounding the issue, we propose the adoption of the
term "limit" to denote the age at which the chance of survival is exactly zero
and the term "effective limit" to denote the age at which the change of
survival falls below a given threshold. Once this distinction is made, it can
be demonstrated that the final result of Rootz\'en and Zholud is essentially a
recapitulation of the main conclusion of our paper. Ultimately, much of the
controversy surrounding the issue of a limit to human lifespan can be avoided
by carefully reading the literature and applying statistics to practical human
scales.
| stat.AP q-bio.PE | in this paper we affirm our earlier findings of evidence for a limit to human lifespan in particular we assess the analyses in extreme value theory evt performed by rootzen and zholud we find that their criticisms of our work are unfounded and that their analyses are contradicted by several other papers using evt furthermore we find that even if we completely accept the conclusions about latelife human mortality reached by rootzen and zholud their results do not actually contradict the findings presented in our original paper whether unbounded or not human lifespan is unlikely to greatly exceed 120 years and the improbability of longer survivalwhether it is exactly zero or merely astronomically smallacts as a de facto limit in order to eliminate the confusion surrounding the issue we propose the adoption of the term limit to denote the age at which the chance of survival is exactly zero and the term effective limit to denote the age at which the change of survival falls below a given threshold once this distinction is made it can be demonstrated that the final result of rootzen and zholud is essentially a recapitulation of the main conclusion of our paper ultimately much of the controversy surrounding the issue of a limit to human lifespan can be avoided by carefully reading the literature and applying statistics to practical human scales | [['in', 'this', 'paper', 'we', 'affirm', 'our', 'earlier', 'findings', 'of', 'evidence', 'for', 'a', 'limit', 'to', 'human', 'lifespan', 'in', 'particular', 'we', 'assess', 'the', 'analyses', 'in', 'extreme', 'value', 'theory', 'evt', 'performed', 'by', 'rootzen', 'and', 'zholud', 'we', 'find', 'that', 'their', 'criticisms', 'of', 'our', 'work', 'are', 'unfounded', 'and', 'that', 'their', 'analyses', 'are', 'contradicted', 'by', 'several', 'other', 'papers', 'using', 'evt', 'furthermore', 'we', 'find', 'that', 'even', 'if', 'we', 'completely', 'accept', 'the', 'conclusions', 'about', 'latelife', 'human', 'mortality', 'reached', 'by', 'rootzen', 'and', 'zholud', 'their', 'results', 'do', 'not', 'actually', 'contradict', 'the', 'findings', 'presented', 'in', 'our', 'original', 'paper', 'whether', 'unbounded', 'or', 'not', 'human', 'lifespan', 'is', 'unlikely', 'to', 'greatly', 'exceed', '120', 'years', 'and', 'the', 'improbability', 'of', 'longer', 'survivalwhether', 'it', 'is', 'exactly', 'zero', 'or', 'merely', 'astronomically', 'smallacts', 'as', 'a', 'de', 'facto', 'limit', 'in', 'order', 'to', 'eliminate', 'the', 'confusion', 'surrounding', 'the', 'issue', 'we', 'propose', 'the', 'adoption', 'of', 'the', 'term', 'limit', 'to', 'denote', 'the', 'age', 'at', 'which', 'the', 'chance', 'of', 'survival', 'is', 'exactly', 'zero', 'and', 'the', 'term', 'effective', 'limit', 'to', 'denote', 'the', 'age', 'at', 'which', 'the', 'change', 'of', 'survival', 'falls', 'below', 'a', 'given', 'threshold', 'once', 'this', 'distinction', 'is', 'made', 'it', 'can', 'be', 'demonstrated', 'that', 'the', 'final', 'result', 'of', 'rootzen', 'and', 'zholud', 'is', 'essentially', 'a', 'recapitulation', 'of', 'the', 'main', 'conclusion', 'of', 'our', 'paper', 'ultimately', 'much', 'of', 'the', 'controversy', 'surrounding', 'the', 'issue', 'of', 'a', 'limit', 'to', 'human', 'lifespan', 'can', 'be', 'avoided', 'by', 'carefully', 'reading', 'the', 'literature', 'and', 'applying', 'statistics', 'to', 'practical', 'human', 'scales']] | [-0.06419577021188161, 0.11191018830036878, -0.11316070538928866, 0.08900963103587856, -0.07924557881363269, -0.09015908968246679, 0.11240315194663708, 0.3330593555604407, -0.21177731324652477, -0.32348094046548276, 0.13514998376350768, -0.2838024740007573, -0.1445132410080987, 0.17605017727484146, -0.12618499528408783, 0.004978749153191789, 0.07884382728453991, 0.052621540804726204, -0.019862157538990947, -0.2912328052646314, 0.30540345441009514, 0.08280485491559375, 0.25781608963526587, 0.09420650801205609, 0.05034854885681333, -0.032940476662978266, -0.02586174936316508, 0.02504260140319405, -0.1267216669113103, 0.10450107783461655, 0.26378221477560665, 0.1387477684724477, 0.3251258223151256, -0.4005945463099384, -0.20440834947554062, 0.13085768726887181, 0.18297741073547513, 0.10840217714394385, 0.020091047396168245, -0.2819058840037282, 0.11405160749356062, -0.17394142769418458, -0.15677413413193012, -0.02533212874394459, 0.035693695344629565, -0.036573757175314574, -0.22514777682330792, 0.09451907423226658, 0.10202955287033026, 0.04890234262815544, -0.057015013186693456, -0.10801633537474638, 0.0010157350147242791, 0.1460146683052049, 0.1080185568041218, 0.04015990484081807, 0.11963036514602468, -0.11800753042812825, -0.0891859960632116, 0.3327655619276421, -0.05445881485762324, -0.16245959488073172, 0.18625643331740452, -0.16604039401551876, -0.1271899951056444, 0.07766876275335173, 0.10113288723472838, 0.09082706230453498, -0.145223323659593, 0.04177158167112793, -0.0332914707245696, 0.18191802627448592, 0.08768656462364431, -0.009758617353717065, 0.20285105711497767, 0.13843947821728111, 0.017808221100754702, 0.07176333803701189, -0.0414896606484295, -0.08378620105733196, -0.2836444351996761, -0.11431529788699533, -0.1646735849915006, 0.06904615535066634, -0.032948986113232034, -0.1354753329552685, 0.34098366723940543, 0.2412364723495557, 0.18112800858008477, 0.09501698358404351, 0.2492468657437712, 0.11440074463098426, 0.04827009644811499, 0.05970832508631117, 0.2762500389466628, 0.06075083839823492, 0.09064213559343313, -0.19623137380248018, 0.12112725782208145, 0.010710733868888513] |
1,803.04025 | Reproducibility and Pseudo-Determinism in Log-Space | A curious property of randomized log-space search algorithms is that their
outputs are often longer than their workspace. This leads to the question: how
can we reproduce the results of a randomized log space computation without
storing the output or randomness verbatim? Running the algorithm again with new
random bits may result in a new (and potentially different) output.
We show that every problem in search-RL has a randomized log-space algorithm
where the output can be reproduced. Specifically, we show that for every
problem in search-RL, there are a pair of log-space randomized algorithms A and
B where for every input x, A will output some string t_x of size O(log n), such
that B when running on (x, t_x) will be pseudo-deterministic: that is, running
B multiple times on the same input (x, t_x) will result in the same output on
all executions with high probability. Thus, by storing only O(log n) bits in
memory, it is possible to reproduce the output of a randomized log-space
algorithm.
An algorithm is reproducible without storing any bits in memory (i.e.,
|t_x|=0) if and only if it is pseudo-deterministic. We show
pseudo-deterministic algorithms for finding paths in undirected graphs and
Eulerian graphs using logarithmic space. Our algorithms are substantially
faster than the best known deterministic algorithms for finding paths in such
graphs in log-space.
The algorithm for search-RL has the additional property that its output, when
viewed as a random variable depending on the randomness used by the algorithm,
has entropy O(log n).
| cs.CC | a curious property of randomized logspace search algorithms is that their outputs are often longer than their workspace this leads to the question how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim running the algorithm again with new random bits may result in a new and potentially different output we show that every problem in searchrl has a randomized logspace algorithm where the output can be reproduced specifically we show that for every problem in searchrl there are a pair of logspace randomized algorithms a and b where for every input x a will output some string t_x of size olog n such that b when running on x t_x will be pseudodeterministic that is running b multiple times on the same input x t_x will result in the same output on all executions with high probability thus by storing only olog n bits in memory it is possible to reproduce the output of a randomized logspace algorithm an algorithm is reproducible without storing any bits in memory ie t_x0 if and only if it is pseudodeterministic we show pseudodeterministic algorithms for finding paths in undirected graphs and eulerian graphs using logarithmic space our algorithms are substantially faster than the best known deterministic algorithms for finding paths in such graphs in logspace the algorithm for searchrl has the additional property that its output when viewed as a random variable depending on the randomness used by the algorithm has entropy olog n | [['a', 'curious', 'property', 'of', 'randomized', 'logspace', 'search', 'algorithms', 'is', 'that', 'their', 'outputs', 'are', 'often', 'longer', 'than', 'their', 'workspace', 'this', 'leads', 'to', 'the', 'question', 'how', 'can', 'we', 'reproduce', 'the', 'results', 'of', 'a', 'randomized', 'log', 'space', 'computation', 'without', 'storing', 'the', 'output', 'or', 'randomness', 'verbatim', 'running', 'the', 'algorithm', 'again', 'with', 'new', 'random', 'bits', 'may', 'result', 'in', 'a', 'new', 'and', 'potentially', 'different', 'output', 'we', 'show', 'that', 'every', 'problem', 'in', 'searchrl', 'has', 'a', 'randomized', 'logspace', 'algorithm', 'where', 'the', 'output', 'can', 'be', 'reproduced', 'specifically', 'we', 'show', 'that', 'for', 'every', 'problem', 'in', 'searchrl', 'there', 'are', 'a', 'pair', 'of', 'logspace', 'randomized', 'algorithms', 'a', 'and', 'b', 'where', 'for', 'every', 'input', 'x', 'a', 'will', 'output', 'some', 'string', 't_x', 'of', 'size', 'olog', 'n', 'such', 'that', 'b', 'when', 'running', 'on', 'x', 't_x', 'will', 'be', 'pseudodeterministic', 'that', 'is', 'running', 'b', 'multiple', 'times', 'on', 'the', 'same', 'input', 'x', 't_x', 'will', 'result', 'in', 'the', 'same', 'output', 'on', 'all', 'executions', 'with', 'high', 'probability', 'thus', 'by', 'storing', 'only', 'olog', 'n', 'bits', 'in', 'memory', 'it', 'is', 'possible', 'to', 'reproduce', 'the', 'output', 'of', 'a', 'randomized', 'logspace', 'algorithm', 'an', 'algorithm', 'is', 'reproducible', 'without', 'storing', 'any', 'bits', 'in', 'memory', 'ie', 't_x0', 'if', 'and', 'only', 'if', 'it', 'is', 'pseudodeterministic', 'we', 'show', 'pseudodeterministic', 'algorithms', 'for', 'finding', 'paths', 'in', 'undirected', 'graphs', 'and', 'eulerian', 'graphs', 'using', 'logarithmic', 'space', 'our', 'algorithms', 'are', 'substantially', 'faster', 'than', 'the', 'best', 'known', 'deterministic', 'algorithms', 'for', 'finding', 'paths', 'in', 'such', 'graphs', 'in', 'logspace', 'the', 'algorithm', 'for', 'searchrl', 'has', 'the', 'additional', 'property', 'that', 'its', 'output', 'when', 'viewed', 'as', 'a', 'random', 'variable', 'depending', 'on', 'the', 'randomness', 'used', 'by', 'the', 'algorithm', 'has', 'entropy', 'olog', 'n']] | [-0.14269221645679725, 0.13584217080060046, -0.05740761259789634, 0.07730548371504287, -0.06557946512197327, -0.2119404238081014, 0.09395360610778518, 0.4323866773708408, -0.28894433852997553, -0.33143833289998936, 0.0930261101357572, -0.23759142348201448, -0.13703021859228137, 0.2297884859942434, -0.10183312191915016, 0.06685942887079037, 0.09211265941733027, 0.08059031562694159, -0.01796017279751057, -0.33728750079194925, 0.22793299317054044, 0.01671731711710354, 0.20130174778461218, -0.01757989666309668, 0.08728533431672421, 0.011523925972011578, -0.005082014266334741, 0.04358941097943246, -0.06530288653535188, 0.04034407320988932, 0.26089561336480854, 0.22361776475011708, 0.28389391956101373, -0.3933635917409885, -0.13913115958842742, 0.18391135486772292, 0.16239458968699633, 0.121861462626955, -0.005337847329015691, -0.2151290610501268, 0.14373139127072287, -0.08148199073546863, -0.012846964074250504, -0.04578514641106307, 0.06549090658503759, 0.0013761387199193122, -0.3056112691478069, -0.03450554633625334, 0.10214696321970379, -0.018583765346185856, 0.03172174706754546, -0.11145856298610153, 0.00809396256737233, 0.10856768949134672, -0.029214998385293848, 0.11491048857347068, 0.07472940512299278, -0.09289768222205534, -0.1933054918162636, 0.36595840958054676, -0.04878392770751454, -0.18524420851587867, 0.11013722262415752, -0.10416966260399714, -0.17395084595263183, 0.13947253936667003, 0.14532640081667064, 0.11735596314287815, -0.07932931127871268, 0.13223284173040722, -0.11195712355132478, 0.22532553669107908, 0.08743411807002002, 0.04746419599695331, 0.08393775256892362, 0.14457391987766224, 0.12256201323997452, 0.15582043994069694, 0.014309420801241849, -0.03441282129355806, -0.28211295993027435, -0.15661370558701307, -0.23035556570565574, 0.05944099944721225, -0.1833305284397146, -0.16311381799929528, 0.3323088072952759, 0.15212875622022243, 0.22149793357139386, 0.15219733417609269, 0.32892679229408384, 0.0778171326803921, 0.052816082949544194, 0.20981671551309258, 0.11806298131867594, 0.053201193136508125, 0.07686122451339332, -0.16778835669657088, 0.15571792919255525, 0.09378745304967881] |
1,803.04026 | The effect of photoemission on nanosecond helium microdischarges at
atmospheric pressure | Atmospheric-pressure microdischarges excited by nanosecond high-voltage
pulses are investigated in helium-nitrogen mixtures by first-principles
particle-based simulations that include VUV resonance radiation transport via
tracing photon trajectories. The VUV photons, of which the frequency
redistribution in emission processes is included in some detail, are found to
modify remarkably the computed discharge characteristics due to their ability
to induce electron emission from the cathode surface. The electrons created
this way enhance the plasma density and a significant increase of the transient
current pulse amplitude is observed. The simulations allow the computation of
the density of helium atoms in the 2$^1$P resonant state, as well as the
density of photons in the plasma and the line shape of the resonant VUV
radiation reaching the electrodes. These indicate the presence of significant
radiation trapping in the plasma and photon escape times longer than the
duration of the excitation pulses are found.
| physics.plasm-ph | atmosphericpressure microdischarges excited by nanosecond highvoltage pulses are investigated in heliumnitrogen mixtures by firstprinciples particlebased simulations that include vuv resonance radiation transport via tracing photon trajectories the vuv photons of which the frequency redistribution in emission processes is included in some detail are found to modify remarkably the computed discharge characteristics due to their ability to induce electron emission from the cathode surface the electrons created this way enhance the plasma density and a significant increase of the transient current pulse amplitude is observed the simulations allow the computation of the density of helium atoms in the 21p resonant state as well as the density of photons in the plasma and the line shape of the resonant vuv radiation reaching the electrodes these indicate the presence of significant radiation trapping in the plasma and photon escape times longer than the duration of the excitation pulses are found | [['atmosphericpressure', 'microdischarges', 'excited', 'by', 'nanosecond', 'highvoltage', 'pulses', 'are', 'investigated', 'in', 'heliumnitrogen', 'mixtures', 'by', 'firstprinciples', 'particlebased', 'simulations', 'that', 'include', 'vuv', 'resonance', 'radiation', 'transport', 'via', 'tracing', 'photon', 'trajectories', 'the', 'vuv', 'photons', 'of', 'which', 'the', 'frequency', 'redistribution', 'in', 'emission', 'processes', 'is', 'included', 'in', 'some', 'detail', 'are', 'found', 'to', 'modify', 'remarkably', 'the', 'computed', 'discharge', 'characteristics', 'due', 'to', 'their', 'ability', 'to', 'induce', 'electron', 'emission', 'from', 'the', 'cathode', 'surface', 'the', 'electrons', 'created', 'this', 'way', 'enhance', 'the', 'plasma', 'density', 'and', 'a', 'significant', 'increase', 'of', 'the', 'transient', 'current', 'pulse', 'amplitude', 'is', 'observed', 'the', 'simulations', 'allow', 'the', 'computation', 'of', 'the', 'density', 'of', 'helium', 'atoms', 'in', 'the', '21p', 'resonant', 'state', 'as', 'well', 'as', 'the', 'density', 'of', 'photons', 'in', 'the', 'plasma', 'and', 'the', 'line', 'shape', 'of', 'the', 'resonant', 'vuv', 'radiation', 'reaching', 'the', 'electrodes', 'these', 'indicate', 'the', 'presence', 'of', 'significant', 'radiation', 'trapping', 'in', 'the', 'plasma', 'and', 'photon', 'escape', 'times', 'longer', 'than', 'the', 'duration', 'of', 'the', 'excitation', 'pulses', 'are', 'found']] | [-0.0741926783820206, 0.23731212508673333, -0.042166106307190164, 0.04119417400415094, 0.05465436009817744, -0.08842052227485772, 0.029474346120267697, 0.4370521424618894, -0.21108414118548166, -0.33576659100570344, 0.00319122293587672, -0.29681875326906726, 0.0008301082998514175, 0.20802488784650214, 0.03526967849079296, 0.034492220493569356, 0.05012476594448058, -0.0644705445100617, 0.01629659784989661, -0.1248646320883593, 0.23381869320132553, 0.12985021348927833, 0.27507828681232177, 0.10656218704359274, 0.06670258539945703, -0.0337024962861244, -0.02927557633207371, -0.06223787876700804, -0.0915080343993769, 0.03591965917778546, 0.22873270054258507, 0.021475673090245524, 0.1921076127232295, -0.5086517992544256, -0.2861168135199951, 0.058654617581975786, 0.15495192788203235, 0.10784063993694822, -0.08437298875292508, -0.25916545447089695, -0.019625011046914612, -0.1474105685419875, -0.12975437527407624, 0.0015367508215242869, 0.015508160337946084, 0.09944300912958506, -0.22547977349134035, 0.08325314268227411, 0.005989570930529998, -0.009064408491225275, -0.06742878455835337, -0.055610666670262404, -0.07609460604766205, 0.04482850571456429, 0.048940130436875895, 0.02124022764523756, 0.27510247119600334, -0.13792316483537834, -0.07738728208263239, 0.3674296028226333, -0.10204531865767347, -0.07003813537399042, 0.18330454610109534, -0.24298267805955232, -0.004696784663007735, 0.2835985007783564, 0.122755393948827, 0.12938780993484725, -0.12999201223353077, -0.005160523858798464, 0.033579019432343635, 0.18126922775831789, 0.1455836477274815, 0.07959677887863595, 0.23390032814764608, 0.1286063024595584, -0.02110342551915817, 0.14401841571407825, -0.15661515525906694, -0.035139490459560836, -0.25065149403853365, -0.12661092722316414, -0.15264862602933832, 0.04673109062433431, -0.018077449636770673, -0.15392691556249477, 0.4285491651644905, 0.15290082896077264, 0.12588304048404098, -0.05450996294480506, 0.3317835163883227, 0.1755782922503398, 0.03479048371321381, 0.0477868984134434, 0.30713445760811237, 0.17434234347845085, 0.11407222372020455, -0.33131903565444104, 0.05643139006123457, -0.04724168229277233] |
1,803.04027 | Mass difference for charged quarks from asymptotically safe quantum
gravity | We propose a scenario to retrodict the top and bottom mass and the Abelian
gauge coupling from first principles in a microscopic model including quantum
gravity. In our approximation, antiscreening quantum-gravity fluctuations
induce an asymptotically safe fixed point for the Abelian hypercharge leading
to a uniquely fixed infrared value that is observationally viable for a
particular choice of microscopic gravitational parameters. The unequal quantum
numbers of the top and bottom quark lead to different fixed-point values for
the top and bottom Yukawa under the impact of gauge and gravity fluctuations.
This results in a dynamically generated mass difference between the two quarks.
To work quantitatively, the preferred ratio of electric charges of bottom and
top in our approximation lies in close vicinity to the Standard-Model value of
$Q_b/Q_t =-1/2$.
| hep-th gr-qc hep-ph | we propose a scenario to retrodict the top and bottom mass and the abelian gauge coupling from first principles in a microscopic model including quantum gravity in our approximation antiscreening quantumgravity fluctuations induce an asymptotically safe fixed point for the abelian hypercharge leading to a uniquely fixed infrared value that is observationally viable for a particular choice of microscopic gravitational parameters the unequal quantum numbers of the top and bottom quark lead to different fixedpoint values for the top and bottom yukawa under the impact of gauge and gravity fluctuations this results in a dynamically generated mass difference between the two quarks to work quantitatively the preferred ratio of electric charges of bottom and top in our approximation lies in close vicinity to the standardmodel value of q_bq_t 12 | [['we', 'propose', 'a', 'scenario', 'to', 'retrodict', 'the', 'top', 'and', 'bottom', 'mass', 'and', 'the', 'abelian', 'gauge', 'coupling', 'from', 'first', 'principles', 'in', 'a', 'microscopic', 'model', 'including', 'quantum', 'gravity', 'in', 'our', 'approximation', 'antiscreening', 'quantumgravity', 'fluctuations', 'induce', 'an', 'asymptotically', 'safe', 'fixed', 'point', 'for', 'the', 'abelian', 'hypercharge', 'leading', 'to', 'a', 'uniquely', 'fixed', 'infrared', 'value', 'that', 'is', 'observationally', 'viable', 'for', 'a', 'particular', 'choice', 'of', 'microscopic', 'gravitational', 'parameters', 'the', 'unequal', 'quantum', 'numbers', 'of', 'the', 'top', 'and', 'bottom', 'quark', 'lead', 'to', 'different', 'fixedpoint', 'values', 'for', 'the', 'top', 'and', 'bottom', 'yukawa', 'under', 'the', 'impact', 'of', 'gauge', 'and', 'gravity', 'fluctuations', 'this', 'results', 'in', 'a', 'dynamically', 'generated', 'mass', 'difference', 'between', 'the', 'two', 'quarks', 'to', 'work', 'quantitatively', 'the', 'preferred', 'ratio', 'of', 'electric', 'charges', 'of', 'bottom', 'and', 'top', 'in', 'our', 'approximation', 'lies', 'in', 'close', 'vicinity', 'to', 'the', 'standardmodel', 'value', 'of', 'q_bq_t', '12']] | [-0.12210300733761414, 0.23638638709337556, -0.08407925643405179, 0.10155211025266908, -0.06457591038270039, -0.13159109404296032, 0.11105261281772982, 0.2927051442238735, -0.2205516932772298, -0.3072232832273585, 0.007386623775346379, -0.2574837473075604, -0.06511154139661812, 0.13113480606625671, -0.00440436159260571, 0.05052454042299814, -0.004355145396402804, 0.035952819202066166, -0.0700121772424609, -0.21231411289136304, 0.3412785068157973, 0.01887256861482456, 0.2670559167745523, 0.12410153143491698, 0.07831708899902878, -0.03419793093780754, 0.028169313023681752, -0.02283539691416081, -0.09204774474557098, 0.07214467612902808, 0.1789958128042599, -0.030734153035155032, 0.20426051713639026, -0.38156185881234705, -0.14519897383979696, 0.10272809128218796, 0.08635697819772759, 0.12693889133515768, -0.08784755545093503, -0.26187047019175225, 0.12235346212037257, -0.1933323711018602, -0.15724536407105916, -0.027307492091495078, 0.010632730885845376, -0.07601975183933973, -0.32997809162770864, 0.061815446431864984, -0.02361473031123751, 0.008811436700170816, -0.032866314562852494, -0.12612460501077294, -0.07999500538790016, 0.1116990701375471, 0.1235171595844804, 0.0497367391408261, 0.1682894898003724, -0.19185424784700444, -0.12028265108165215, 0.4087840754764329, -0.13152874046318175, -0.24111045797690167, 0.17251896649395349, -0.14973253613425186, -0.10533518431111588, 0.07727888421504758, 0.17739139128025272, 0.12005886675206057, -0.14159643039602088, 0.13611625498469948, -0.022692702393669606, 0.1454799773830473, 0.08268125596805476, 0.03197488031855755, 0.3084042133632465, 0.14651847433015064, 0.04080902630084893, 0.08384561096409016, -0.06966491810089792, -0.16121102284523658, -0.3850004899504711, -0.11496133747277781, -0.11839533572401706, 0.05467361655144032, -0.1379441827186838, -0.17686012615376967, 0.4128921962401364, 0.1822331645162194, 0.20208724569056358, 0.034909074687334396, 0.2685024715028703, 0.08190113758337247, 0.07150578718574252, 0.07659674352908041, 0.32467561493831454, 0.16568257680773968, 0.060990579695499036, -0.2425033151612297, -0.015611520251468392, 0.1023161803423136] |
1,803.04028 | A Linear Algebraic Approach to Subfield Subcodes of GRS Codes | The problem of finding subfield subcodes of generalized Reed-Solomon (GRS)
codes (i.e., alternant codes) is considered. A pure linear algebraic approach
is taken in order to derive message constraints that generalize the well known
conjugacy constraints for cyclic GRS codes and their Bose-Chaudhuri-Hocquenghem
(BCH) subfield subcodes. It is shown that the presented technique can be used
for finding nested subfield subcodes with increasing design distance.
| cs.IT math.IT | the problem of finding subfield subcodes of generalized reedsolomon grs codes ie alternant codes is considered a pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic grs codes and their bosechaudhurihocquenghem bch subfield subcodes it is shown that the presented technique can be used for finding nested subfield subcodes with increasing design distance | [['the', 'problem', 'of', 'finding', 'subfield', 'subcodes', 'of', 'generalized', 'reedsolomon', 'grs', 'codes', 'ie', 'alternant', 'codes', 'is', 'considered', 'a', 'pure', 'linear', 'algebraic', 'approach', 'is', 'taken', 'in', 'order', 'to', 'derive', 'message', 'constraints', 'that', 'generalize', 'the', 'well', 'known', 'conjugacy', 'constraints', 'for', 'cyclic', 'grs', 'codes', 'and', 'their', 'bosechaudhurihocquenghem', 'bch', 'subfield', 'subcodes', 'it', 'is', 'shown', 'that', 'the', 'presented', 'technique', 'can', 'be', 'used', 'for', 'finding', 'nested', 'subfield', 'subcodes', 'with', 'increasing', 'design', 'distance']] | [-0.21680485267872707, -0.00021402609462921435, -0.0722139927630241, 0.11504524449567095, -0.10753497168994867, -0.282507497494897, -0.006785975955426693, 0.3183022655546665, -0.4081712209225561, -0.24170902845664666, 0.16670463481165756, -0.21836808608988156, -0.14871583154353385, 0.2548568785512963, -0.13575123968140151, 0.128127815732016, 0.06167968081740233, 0.04330056309700012, -0.13215925760137348, -0.37179411176878674, 0.2928480143228976, 0.16136520921001926, 0.21482220945449976, -0.03851712838603327, 0.0765673390088173, -0.008960332771619926, -0.032743487134575845, -0.023160995084505816, -0.19196784629311878, 0.09374289746002222, 0.3861660074156064, 0.24792999546312225, 0.13612966233721147, -0.27816989654316926, -0.23543248563431776, 0.112347780575734, 0.19852591814616552, 0.15539338117322096, -0.036070383641009146, -0.15826281524048402, 0.1393795544711443, -0.22424629690268866, -0.0689461835874961, 0.01443072694998521, 0.02433326247936258, 0.013692282770688718, -0.28915359773314914, -0.08472775299675189, 0.0896688853766626, 0.0885662616445468, -0.03274319342409189, -0.20318834081542894, 0.06044809451111807, 0.07398410983240375, 0.009135805947992664, 0.09282201802214751, 0.044615299949565757, 0.04082481810966363, -0.15584001545391332, 0.39950076665442724, 0.02167522748753142, -0.21184877784779438, 0.09083525686023328, -0.026737364969001365, -0.13063137608293732, 0.135370820789383, 0.1854612824292137, 0.1507171478838875, -0.09145332523263418, 0.14522789824091328, -0.12024541561706709, 0.1775057471787127, 0.08613579199792674, 0.1315194721942624, 0.15876077422155785, 0.021734606474637985, 0.0069687028057300125, 0.24298351257860373, -0.02370804652858239, -0.09103864887012886, -0.22927335182634684, -0.08170984358025285, -0.18496857430570973, 0.02623234293781794, -0.13974660397843064, -0.17940564578748308, 0.35376223961894326, 0.07137795017333701, 0.052427948767749165, 0.12556977469044237, 0.20699805568617125, 0.014085446634831337, 0.19783571276168985, 0.19399806885048748, 0.17051951002616147, 0.255555602916194, -0.07214993089437485, -0.20482412345635775, 0.06681718926232022, 0.16997491674354442] |
1,803.04029 | Regular cylindrical algebraic decomposition | We show that a strong well-based cylindrical algebraic decomposition P of a
bounded semi-algebraic set is a regular cell decomposition, in any dimension
and independently of the method by which P is constructed. Being well-based is
a global condition on P that holds for the output of many widely used
algorithms. We also show the same for S of dimension at most 3 and P a strong
cylindrical algebraic decomposition that is locally boundary simply connected:
this is a purely local extra condition.
| math.AG cs.SC math.AT | we show that a strong wellbased cylindrical algebraic decomposition p of a bounded semialgebraic set is a regular cell decomposition in any dimension and independently of the method by which p is constructed being wellbased is a global condition on p that holds for the output of many widely used algorithms we also show the same for s of dimension at most 3 and p a strong cylindrical algebraic decomposition that is locally boundary simply connected this is a purely local extra condition | [['we', 'show', 'that', 'a', 'strong', 'wellbased', 'cylindrical', 'algebraic', 'decomposition', 'p', 'of', 'a', 'bounded', 'semialgebraic', 'set', 'is', 'a', 'regular', 'cell', 'decomposition', 'in', 'any', 'dimension', 'and', 'independently', 'of', 'the', 'method', 'by', 'which', 'p', 'is', 'constructed', 'being', 'wellbased', 'is', 'a', 'global', 'condition', 'on', 'p', 'that', 'holds', 'for', 'the', 'output', 'of', 'many', 'widely', 'used', 'algorithms', 'we', 'also', 'show', 'the', 'same', 'for', 's', 'of', 'dimension', 'at', 'most', '3', 'and', 'p', 'a', 'strong', 'cylindrical', 'algebraic', 'decomposition', 'that', 'is', 'locally', 'boundary', 'simply', 'connected', 'this', 'is', 'a', 'purely', 'local', 'extra', 'condition']] | [-0.1721838693616979, 0.10031360209392137, -0.12729064133354878, 0.0498403638926705, -0.07371090635298247, -0.16739784381969505, 0.0011556010625987168, 0.31921734072896374, -0.2950729413970699, -0.20885560809668288, 0.11468925834100424, -0.19219215972775436, -0.1410709565662476, 0.19255377339333835, -0.06457096874624131, 0.027906511265066374, 0.04584819343816265, 0.10300131507936013, -0.04562061235409634, -0.24461668583351265, 0.3401034065488591, -0.07135038832988007, 0.27930796395493557, 0.05193013082123754, 0.11568999018222767, 0.009943186557930276, 0.015042823620830629, 0.10436746248616333, -0.1205439209272343, 0.12478704964643883, 0.21879775146673242, 0.139148625758398, 0.26816206826009303, -0.3802257279180978, -0.18920641809881453, 0.16227105767073402, 0.12060207053906767, 0.07428245183994926, -0.00741422074111964, -0.20232187591897077, 0.21694325861599612, -0.10266286892120738, -0.16629089560943194, -0.038225601068192935, 0.08688826112256172, -0.00920981629919934, -0.34259432843740445, 0.005881968130713822, 0.1505221079990088, 0.08389022431044604, -0.049556004912985195, -0.10724015032075884, -0.04296547938306558, 0.05332483073516962, -0.057837999226660074, 0.06918076234476933, 0.0817580496028335, -0.05596773521357541, -0.08750136247667742, 0.34368961269080817, -0.03898793637348586, -0.2559316449613501, 0.19816545351038137, -0.15043244052521257, -0.1393644426421947, 0.13452673301448576, 0.11006474598165018, 0.13750353851636132, -0.09184621262128453, 0.19714939435354872, -0.1277303615772917, 0.151004014880374, 0.11267138173781245, -0.04066973593063563, 0.09025467126574142, 0.12117439158350589, 0.14141884419144166, 0.12699987455439496, -0.020035682849555154, 0.00686117102453732, -0.35505894407719735, -0.13994008113057857, -0.2209946876027094, 0.09031785021435065, -0.12358167162691018, -0.18901800254292517, 0.3562937459560582, 0.01999757411968277, 0.1928998890546072, 0.03326988448136407, 0.29983965370310356, 0.1004084335313619, 0.04582407074161323, 0.10868474903393043, 0.14266397797008865, 0.15563124791068217, 0.014103792276772031, -0.1707114563891608, 0.04965427126847657, 0.13181385990419475] |
1,803.0403 | Modeling Singing F0 With Neural Network Driven Transition-Sustain Models | This study focuses on generating fundamental frequency (F0) curves of singing
voice from musical scores stored in a midi-like notation. Current statistical
parametric approaches to singing F0 modeling meet difficulties in reproducing
vibratos and the temporal details at note boundaries due to the oversmoothing
tendency of statistical models. This paper presents a neural network based
solution that models a pair of neighboring notes at a time (the transition
model) and uses a separate network for generating vibratos (the sustain model).
Predictions from the two models are combined by summation after proper
enveloping to enforce continuity. In the training phase, mild misalignment
between the scores and the target F0 is addressed by back-propagating the
gradients to the networks' inputs. Subjective listening tests on the NITech
singing database show that transition-sustain models are able to generate F0
trajectories close to the original performance.
| eess.AS cs.SD | this study focuses on generating fundamental frequency f0 curves of singing voice from musical scores stored in a midilike notation current statistical parametric approaches to singing f0 modeling meet difficulties in reproducing vibratos and the temporal details at note boundaries due to the oversmoothing tendency of statistical models this paper presents a neural network based solution that models a pair of neighboring notes at a time the transition model and uses a separate network for generating vibratos the sustain model predictions from the two models are combined by summation after proper enveloping to enforce continuity in the training phase mild misalignment between the scores and the target f0 is addressed by backpropagating the gradients to the networks inputs subjective listening tests on the nitech singing database show that transitionsustain models are able to generate f0 trajectories close to the original performance | [['this', 'study', 'focuses', 'on', 'generating', 'fundamental', 'frequency', 'f0', 'curves', 'of', 'singing', 'voice', 'from', 'musical', 'scores', 'stored', 'in', 'a', 'midilike', 'notation', 'current', 'statistical', 'parametric', 'approaches', 'to', 'singing', 'f0', 'modeling', 'meet', 'difficulties', 'in', 'reproducing', 'vibratos', 'and', 'the', 'temporal', 'details', 'at', 'note', 'boundaries', 'due', 'to', 'the', 'oversmoothing', 'tendency', 'of', 'statistical', 'models', 'this', 'paper', 'presents', 'a', 'neural', 'network', 'based', 'solution', 'that', 'models', 'a', 'pair', 'of', 'neighboring', 'notes', 'at', 'a', 'time', 'the', 'transition', 'model', 'and', 'uses', 'a', 'separate', 'network', 'for', 'generating', 'vibratos', 'the', 'sustain', 'model', 'predictions', 'from', 'the', 'two', 'models', 'are', 'combined', 'by', 'summation', 'after', 'proper', 'enveloping', 'to', 'enforce', 'continuity', 'in', 'the', 'training', 'phase', 'mild', 'misalignment', 'between', 'the', 'scores', 'and', 'the', 'target', 'f0', 'is', 'addressed', 'by', 'backpropagating', 'the', 'gradients', 'to', 'the', 'networks', 'inputs', 'subjective', 'listening', 'tests', 'on', 'the', 'nitech', 'singing', 'database', 'show', 'that', 'transitionsustain', 'models', 'are', 'able', 'to', 'generate', 'f0', 'trajectories', 'close', 'to', 'the', 'original', 'performance']] | [-0.08559324421946878, 0.04076401167211757, -0.08200587007466811, 0.08558669715927428, -0.09203009748919125, -0.15498913260154845, 0.04846995292936681, 0.40097749816334766, -0.2669351137229714, -0.2929687235450399, 0.04681218700547554, -0.27079275918557594, -0.15783236833775174, 0.1731993747314951, -0.12542967190223653, 0.07171013625338674, 0.1082881900002721, 0.04858646822917829, -0.07748879202763023, -0.2054348904919976, 0.31042112749528844, 0.02607371704990341, 0.34198349108560977, -0.01634518249446283, 0.11233239335453381, -0.07996489301971767, -0.0330250995044691, -0.06956781397161978, -0.07614653247741365, 0.11763758791367644, 0.26684346724357677, 0.16694819481800433, 0.3168884160746213, -0.4126527695849106, -0.18442442890364621, 0.10002271392200467, 0.09212936642343529, 0.08727201632311757, -0.010966525124588414, -0.33351400372423773, 0.07930409954523371, -0.10647929226979613, -0.028593825527291367, -0.08171185744467421, -0.01650301998049237, 0.033747058047287865, -0.2816788485835549, 0.08580197500861317, 0.09440708141082196, 0.07621912704105827, -0.06528751480231143, -0.09942303712317802, -0.010952459776477106, 0.1642411093403032, 0.05101334433530228, 0.07537000040537205, 0.1067942101421911, -0.1667192301226179, -0.09965780953601663, 0.35173323793308064, -0.061280424469167476, -0.22488080603121172, 0.1671161156947441, -0.07888235490553189, -0.12061176605461894, 0.10706405068302284, 0.21516402103884172, 0.06628529637363618, -0.17844974058865826, -0.010917988087411673, 0.020886485527612884, 0.2114352450868034, 0.09918018979184073, -0.04028496443820388, 0.23433200548153263, 0.16943622127544825, -0.04370860322176114, 0.12495513718644413, -0.09034828162428153, -0.07334380157534844, -0.2973118022057241, -0.08674165859575504, -0.15236436829487185, -0.04992298474130423, -0.04498840526281603, -0.15376247928277048, 0.4449924491202472, 0.22581759631377307, 0.22404793006084536, 0.12543775596735202, 0.3369795232910015, 0.05343504988232398, 0.054392273856269574, 0.045854726926072675, 0.20613094359177395, 0.06363609334811622, 0.12480165816816514, -0.17551537960146865, 0.11568901193137551, 0.08045834049825436] |
1,803.04031 | Upper bounds for domination numbers of graphs using Tur\'an's Theorem
and Lov\'asz local lemma | Let $G$ be a connected graph of order $n$ with vertex set $V(G)$. A subset
$S\subseteq V(G)$ is an $(a,b)$-dominating set if every vertex $v\in S$ is
adjacent to at least $a$ vertices in $S$ and every $v\in V\setminus S$ is
adjacent to at least $b$ vertices in $S$. The minimum cardinality of an
$(a,b)$-dominating set of $G$ is the $(a,b)$-domination number of $G$, denoted
by $\gamma_{a,b}(G)$. There are various results about upper bounds for
$\gamma_{a,b}(G)$ when $G$ is regular or $a$ and $b$ are small numbers.
In the first part of this paper, for a given graph $G$ with the minimum
degree of $\max\{a,b\}$, we define a new graph $G'$ associated to $G$ and show
that the independence number of this graph is related to $\gamma_{a,b}(G)$. In
the next part, using Lov\'asz local lemma, we give a randomized approach to
improve previous results in some special cases.
| math.CO | let g be a connected graph of order n with vertex set vg a subset ssubseteq vg is an abdominating set if every vertex vin s is adjacent to at least a vertices in s and every vin vsetminus s is adjacent to at least b vertices in s the minimum cardinality of an abdominating set of g is the abdomination number of g denoted by gamma_abg there are various results about upper bounds for gamma_abg when g is regular or a and b are small numbers in the first part of this paper for a given graph g with the minimum degree of maxab we define a new graph g associated to g and show that the independence number of this graph is related to gamma_abg in the next part using lovasz local lemma we give a randomized approach to improve previous results in some special cases | [['let', 'g', 'be', 'a', 'connected', 'graph', 'of', 'order', 'n', 'with', 'vertex', 'set', 'vg', 'a', 'subset', 'ssubseteq', 'vg', 'is', 'an', 'abdominating', 'set', 'if', 'every', 'vertex', 'vin', 's', 'is', 'adjacent', 'to', 'at', 'least', 'a', 'vertices', 'in', 's', 'and', 'every', 'vin', 'vsetminus', 's', 'is', 'adjacent', 'to', 'at', 'least', 'b', 'vertices', 'in', 's', 'the', 'minimum', 'cardinality', 'of', 'an', 'abdominating', 'set', 'of', 'g', 'is', 'the', 'abdomination', 'number', 'of', 'g', 'denoted', 'by', 'gamma_abg', 'there', 'are', 'various', 'results', 'about', 'upper', 'bounds', 'for', 'gamma_abg', 'when', 'g', 'is', 'regular', 'or', 'a', 'and', 'b', 'are', 'small', 'numbers', 'in', 'the', 'first', 'part', 'of', 'this', 'paper', 'for', 'a', 'given', 'graph', 'g', 'with', 'the', 'minimum', 'degree', 'of', 'maxab', 'we', 'define', 'a', 'new', 'graph', 'g', 'associated', 'to', 'g', 'and', 'show', 'that', 'the', 'independence', 'number', 'of', 'this', 'graph', 'is', 'related', 'to', 'gamma_abg', 'in', 'the', 'next', 'part', 'using', 'lovasz', 'local', 'lemma', 'we', 'give', 'a', 'randomized', 'approach', 'to', 'improve', 'previous', 'results', 'in', 'some', 'special', 'cases']] | [-0.19889519811318865, 0.11049591923192252, -0.02057217054454417, -0.031073371418912348, -0.105993199879143, -0.14528526102738648, 0.0632865817795893, 0.35583531573928634, -0.2824509066272655, -0.31067963575237784, 0.05281942532606551, -0.35611294543306377, -0.12164070642521155, 0.12746657477210052, -0.10676772187881428, -0.03821605896127635, 0.09674929667039421, 0.16285689434614675, 0.02606910879017207, -0.2813495487271776, 0.28185328439134977, -0.08861099318440618, 0.12777839954300174, 0.08121309114363173, 0.08114206712243371, 0.016942341651382118, 0.024133742250630568, 0.09360928209587592, -0.18223966560351607, 0.06935624015228502, 0.260424870141814, 0.17583274706427393, 0.32790682413454714, -0.36137866513153283, -0.1299554083656905, 0.2435985886202804, 0.06111979305037651, -0.007380442963591937, 0.03337851705768242, -0.20698882539210647, 0.21206558667251776, -0.1255839906786448, -0.09037682690240186, 0.04029147598314388, 0.18114745532130372, -0.0017720645550509978, -0.34967141538087665, -0.028616330518933204, 0.05722934797663113, 0.03745314180991484, 0.10025740809545948, -0.18339656816217406, -0.09071568833134169, 0.08243039558774085, -0.06611547534000771, 0.18002500116247042, 0.004981740088009372, -0.10183683760335734, -0.13846587218858045, 0.36419872756854726, -0.06312050897134307, -0.15855094477823325, 0.12267378607186778, -0.1660575498891031, -0.16834954000881006, 0.08810664927346054, 0.1258470544527317, 0.16414715768769383, -0.10314908661480174, 0.15515892352659963, -0.1311469113133077, 0.08742453905127558, 0.09343614489610853, 0.01737125261670685, 0.12733429886786074, 0.1350812660722897, 0.19289949463985476, 0.1634613502280915, -0.013706207532708629, 0.1419381979917144, -0.3895445781663574, -0.07852338701225657, -0.24893211081367114, 0.06882584588281039, -0.1509496683348171, -0.14234707114559694, 0.40654846495338554, 0.10791721055605288, 0.214562144345636, 0.06080300831717664, 0.20635269689373673, 0.0892237023252729, 0.0349322005086739, 0.1991123288998316, 0.06534581522332858, 0.1846293747505366, -0.09528173245489598, -0.156391736987079, 0.043915553471266196, 0.1821977404684856] |
1,803.04032 | Relativistic Low Angular Momentum Accretion: Long Time Evolution of
Hydrodynamical Inviscid Flows | We investigate relativistic low angular momentum accretion of inviscid
perfect fluid onto a Schwarzschild black hole. The simulations are performed
with a general-relativistic, high-resolution (second-order), shock-capturing,
hydrodynamical numerical code. We use horizon-penetrating Eddington-Finkelstein
coordinates to remove inaccuracies in regions of strong gravity near the black
hole horizon and show the expected convergence of the code with the Michel
solution and stationary Fishbone-Moncrief toroids. We recover, in the framework
of relativistic hydrodynamics, the qualitative behavior known from previous
Newtonian studies that used a Bondi background flow in a pseudo-relativistic
gravitational potential with a latitude-dependent angular momentum at the outer
boundary. Our models exhibit characteristic "turbulent" behavior and the
attained accretion rates are lower than those of the Bondi-Michel radial flow.
For sufficiently low values of the asymptotic sound speed, geometrically thick
tori form in the equatorial plane surrounding the black hole horizon while
accretion takes place mainly through the poles.
| gr-qc | we investigate relativistic low angular momentum accretion of inviscid perfect fluid onto a schwarzschild black hole the simulations are performed with a generalrelativistic highresolution secondorder shockcapturing hydrodynamical numerical code we use horizonpenetrating eddingtonfinkelstein coordinates to remove inaccuracies in regions of strong gravity near the black hole horizon and show the expected convergence of the code with the michel solution and stationary fishbonemoncrief toroids we recover in the framework of relativistic hydrodynamics the qualitative behavior known from previous newtonian studies that used a bondi background flow in a pseudorelativistic gravitational potential with a latitudedependent angular momentum at the outer boundary our models exhibit characteristic turbulent behavior and the attained accretion rates are lower than those of the bondimichel radial flow for sufficiently low values of the asymptotic sound speed geometrically thick tori form in the equatorial plane surrounding the black hole horizon while accretion takes place mainly through the poles | [['we', 'investigate', 'relativistic', 'low', 'angular', 'momentum', 'accretion', 'of', 'inviscid', 'perfect', 'fluid', 'onto', 'a', 'schwarzschild', 'black', 'hole', 'the', 'simulations', 'are', 'performed', 'with', 'a', 'generalrelativistic', 'highresolution', 'secondorder', 'shockcapturing', 'hydrodynamical', 'numerical', 'code', 'we', 'use', 'horizonpenetrating', 'eddingtonfinkelstein', 'coordinates', 'to', 'remove', 'inaccuracies', 'in', 'regions', 'of', 'strong', 'gravity', 'near', 'the', 'black', 'hole', 'horizon', 'and', 'show', 'the', 'expected', 'convergence', 'of', 'the', 'code', 'with', 'the', 'michel', 'solution', 'and', 'stationary', 'fishbonemoncrief', 'toroids', 'we', 'recover', 'in', 'the', 'framework', 'of', 'relativistic', 'hydrodynamics', 'the', 'qualitative', 'behavior', 'known', 'from', 'previous', 'newtonian', 'studies', 'that', 'used', 'a', 'bondi', 'background', 'flow', 'in', 'a', 'pseudorelativistic', 'gravitational', 'potential', 'with', 'a', 'latitudedependent', 'angular', 'momentum', 'at', 'the', 'outer', 'boundary', 'our', 'models', 'exhibit', 'characteristic', 'turbulent', 'behavior', 'and', 'the', 'attained', 'accretion', 'rates', 'are', 'lower', 'than', 'those', 'of', 'the', 'bondimichel', 'radial', 'flow', 'for', 'sufficiently', 'low', 'values', 'of', 'the', 'asymptotic', 'sound', 'speed', 'geometrically', 'thick', 'tori', 'form', 'in', 'the', 'equatorial', 'plane', 'surrounding', 'the', 'black', 'hole', 'horizon', 'while', 'accretion', 'takes', 'place', 'mainly', 'through', 'the', 'poles']] | [-0.16327458087707292, 0.05612785715886669, -0.11205753960608933, 0.10671991891875812, -0.0689741135354632, -0.09393417852540575, -0.04520077250482565, 0.30963958263699265, -0.1954257996576662, -0.27888494930104224, 0.08149123368241055, -0.2918442438570531, -0.011314552140459922, 0.20945348754852405, -0.03354149045598869, 0.07903331188680494, 0.04654490023637442, -0.022446543300002057, -0.12485932409637482, -0.17280103838090105, 0.3295997243242439, 0.1329100775702328, 0.19287082309381584, -0.04388838076989192, 0.11001935863326229, -0.06744926232794249, -0.016774613057055535, 0.06127155406362805, -0.22247007117801185, 0.007255848437371488, 0.19876737742656955, 0.0540233907577695, 0.21795395205373172, -0.45228339117523786, -0.2715544039509385, 0.008319553904191314, 0.17798298500427925, 0.16058223087787377, -0.10327781769258247, -0.22321720870771772, 0.06009111379751483, -0.23457018890720163, -0.17726044679324873, -0.023334651082640868, 0.02064163297590976, 0.014315316157424948, -0.21619361369379772, 0.15305008490670574, 0.0979894072673208, 0.01123925151517363, -0.12467628019559826, -0.041992923247980304, -0.09371771573598774, 0.07448686290346715, 0.11549232191897023, 0.03935942991410155, 0.1839163950990533, -0.13309784436195687, -0.01907022740075214, 0.38169632179385704, -0.08485293948939904, -0.21647628658526652, 0.20909343676160191, -0.2893461374757887, -0.03283232516401473, 0.18935096165089793, 0.2142103380347426, 0.2048637157752858, -0.08721165981330921, 0.0803984514071065, -0.04141076948616427, 0.13893696968129055, 0.12215996057273366, -0.0017203549835579219, 0.3500921311599479, 0.07909049803542124, -0.006426566857781664, 0.127955806510825, -0.13689361798193156, -0.1217762575220518, -0.3009543432287771, -0.0989585507746056, -0.1306406445022534, 0.07828088638190231, -0.18296274746820484, -0.15292977635446633, 0.29108883379297834, 0.11685656923863634, 0.17779918337819745, 0.047304861318873404, 0.324711034033523, 0.07720844876933591, -0.00041765357034180214, 0.21214073093771632, 0.3448597937130143, 0.1440594574685108, 0.1547973268646495, -0.28917437900845716, -0.027961449239818328, 0.13396758928492264] |
1,803.04033 | Cascade context encoder for improved inpainting | In this paper, we analyze if cascade usage of the context encoder with
increasing input can improve the results of the inpainting. For this purpose,
we train context encoder for 64x64 pixels images in a standard way and use its
resized output to fill in the missing input region of the 128x128 context
encoder, both in training and evaluation phase. As the result, the inpainting
is visibly more plausible. In order to thoroughly verify the results, we
introduce normalized squared-distortion, a measure for quantitative inpainting
evaluation, and we provide its mathematical explanation. This is the first
attempt to formalize the inpainting measure, which is based on the properties
of latent feature representation, instead of L2 reconstruction loss.
| cs.CV | in this paper we analyze if cascade usage of the context encoder with increasing input can improve the results of the inpainting for this purpose we train context encoder for 64x64 pixels images in a standard way and use its resized output to fill in the missing input region of the 128x128 context encoder both in training and evaluation phase as the result the inpainting is visibly more plausible in order to thoroughly verify the results we introduce normalized squareddistortion a measure for quantitative inpainting evaluation and we provide its mathematical explanation this is the first attempt to formalize the inpainting measure which is based on the properties of latent feature representation instead of l2 reconstruction loss | [['in', 'this', 'paper', 'we', 'analyze', 'if', 'cascade', 'usage', 'of', 'the', 'context', 'encoder', 'with', 'increasing', 'input', 'can', 'improve', 'the', 'results', 'of', 'the', 'inpainting', 'for', 'this', 'purpose', 'we', 'train', 'context', 'encoder', 'for', '64x64', 'pixels', 'images', 'in', 'a', 'standard', 'way', 'and', 'use', 'its', 'resized', 'output', 'to', 'fill', 'in', 'the', 'missing', 'input', 'region', 'of', 'the', '128x128', 'context', 'encoder', 'both', 'in', 'training', 'and', 'evaluation', 'phase', 'as', 'the', 'result', 'the', 'inpainting', 'is', 'visibly', 'more', 'plausible', 'in', 'order', 'to', 'thoroughly', 'verify', 'the', 'results', 'we', 'introduce', 'normalized', 'squareddistortion', 'a', 'measure', 'for', 'quantitative', 'inpainting', 'evaluation', 'and', 'we', 'provide', 'its', 'mathematical', 'explanation', 'this', 'is', 'the', 'first', 'attempt', 'to', 'formalize', 'the', 'inpainting', 'measure', 'which', 'is', 'based', 'on', 'the', 'properties', 'of', 'latent', 'feature', 'representation', 'instead', 'of', 'l2', 'reconstruction', 'loss']] | [-0.02009974149806457, -0.0018012342083364211, -0.07507298824152556, 0.1102590745331013, -0.09730573054724212, -0.10166472789092824, 0.023486989025419965, 0.4366177420758096, -0.27341026568721083, -0.32225102903963676, 0.10780183562972775, -0.2594798855796649, -0.18638975857275314, 0.13288783165626228, -0.1590394249353016, 0.08054469367549434, 0.09381908341310918, 0.04272507528944045, -0.07897346837301578, -0.24313369959167302, 0.30836933311115117, 0.07181885775082328, 0.30405351993676016, 0.03585174365033363, 0.10682288119729993, -0.014669204359585098, -0.06354661942218784, -0.043180899121517576, -0.09980426477830343, 0.15820807457002328, 0.2757095012267859, 0.18270940648729045, 0.2785242316152515, -0.39028834535515516, -0.20466796328827483, 0.09005050670660647, 0.13828335902081593, 0.1001578278062817, -0.06300572449592813, -0.28333723195025634, 0.12860969372157907, -0.14885152889222936, 0.002627311982937029, -0.09565168391543857, -0.03342676255350194, -0.03612465225962986, -0.29699741106416133, 0.048735909493126235, 0.11504464222776607, 0.020544586667052375, -0.08161577053071031, -0.07021303820536183, 0.028876908569082874, 0.17114185722914108, 0.025183307145449238, 0.07796550004598524, 0.07579106387505628, -0.17259588521295066, -0.09616467420910967, 0.3603131805129092, -0.08391199432361614, -0.23741160423077387, 0.14972149226051787, -0.11241885672668638, -0.11441334089312445, 0.07167538457373478, 0.22260370855380235, 0.09680995765013685, -0.14717400807823086, 0.02271955273092066, -0.05760327246088277, 0.1972938236009715, 0.07405103478131109, 0.036316187620757084, 0.14013020386758807, 0.24695809430779952, 0.044094936103271, 0.23814458070736347, -0.16322204576587457, -0.03884787911625483, -0.31221615108821926, -0.17342238667710075, -0.20635884409320765, -0.05047199915259563, -0.06331680246173697, -0.15238348105601196, 0.4356246947567782, 0.24821844191595527, 0.2662243289262827, 0.08978009619850441, 0.3752302289779844, 0.07772902609551614, 0.059855390687328605, 0.061721679842870296, 0.17995633069698797, 0.0840103227548815, 0.12184930734480892, -0.13423961069001333, 0.0898042298624581, 0.08940191595044372] |
1,803.04034 | Layer specific observation of slow thermal equilibration in ultrathin
metallic nanostructures by femtosecond x-ray diffraction | Ultrafast heat transport in nanoscale metal multilayers is of great interest
in the context of optically-induced demagnetization, remagnetization and
switching. We investigate the structural response and the energy flow in the
ultrathin double-layer system Gold (Au) on ferromagnetic Nickel (Ni) by
ultrafast x-ray diffraction (UXRD). The penetration depth of light exceeds the
bilayer thickness, preventing unambiguous layer-specific information from
optical probes. Even though the excitation pulse is incident from the Au side,
we observe a very rapid heating of the Ni lattice, whereas the Au lattice
initially remains cold; the subsequent heat transfer from Ni to the Au lattice
is found to be two orders of magnitude slower than predicted by the
conventional heat equation and much slower than electron-phonon coupling times
in Au. Both observations are independent of the excitation wavelength, although
for the same fluence 400nm light excites electrons in Au ten times more than
800nm light. Simple model calculations show that the different specific heat of
electrons in Ni and Au as well as the different electron-phonon coupling
rapidly force the majority of thermal energy into the Ni lattice. Our results
show that femtosecond UXRD provides an experimental account of heat transport
over single digit nanometer distances as the thermal framework for ultrafast
spin dynamics.
| cond-mat.mes-hall physics.app-ph | ultrafast heat transport in nanoscale metal multilayers is of great interest in the context of opticallyinduced demagnetization remagnetization and switching we investigate the structural response and the energy flow in the ultrathin doublelayer system gold au on ferromagnetic nickel ni by ultrafast xray diffraction uxrd the penetration depth of light exceeds the bilayer thickness preventing unambiguous layerspecific information from optical probes even though the excitation pulse is incident from the au side we observe a very rapid heating of the ni lattice whereas the au lattice initially remains cold the subsequent heat transfer from ni to the au lattice is found to be two orders of magnitude slower than predicted by the conventional heat equation and much slower than electronphonon coupling times in au both observations are independent of the excitation wavelength although for the same fluence 400nm light excites electrons in au ten times more than 800nm light simple model calculations show that the different specific heat of electrons in ni and au as well as the different electronphonon coupling rapidly force the majority of thermal energy into the ni lattice our results show that femtosecond uxrd provides an experimental account of heat transport over single digit nanometer distances as the thermal framework for ultrafast spin dynamics | [['ultrafast', 'heat', 'transport', 'in', 'nanoscale', 'metal', 'multilayers', 'is', 'of', 'great', 'interest', 'in', 'the', 'context', 'of', 'opticallyinduced', 'demagnetization', 'remagnetization', 'and', 'switching', 'we', 'investigate', 'the', 'structural', 'response', 'and', 'the', 'energy', 'flow', 'in', 'the', 'ultrathin', 'doublelayer', 'system', 'gold', 'au', 'on', 'ferromagnetic', 'nickel', 'ni', 'by', 'ultrafast', 'xray', 'diffraction', 'uxrd', 'the', 'penetration', 'depth', 'of', 'light', 'exceeds', 'the', 'bilayer', 'thickness', 'preventing', 'unambiguous', 'layerspecific', 'information', 'from', 'optical', 'probes', 'even', 'though', 'the', 'excitation', 'pulse', 'is', 'incident', 'from', 'the', 'au', 'side', 'we', 'observe', 'a', 'very', 'rapid', 'heating', 'of', 'the', 'ni', 'lattice', 'whereas', 'the', 'au', 'lattice', 'initially', 'remains', 'cold', 'the', 'subsequent', 'heat', 'transfer', 'from', 'ni', 'to', 'the', 'au', 'lattice', 'is', 'found', 'to', 'be', 'two', 'orders', 'of', 'magnitude', 'slower', 'than', 'predicted', 'by', 'the', 'conventional', 'heat', 'equation', 'and', 'much', 'slower', 'than', 'electronphonon', 'coupling', 'times', 'in', 'au', 'both', 'observations', 'are', 'independent', 'of', 'the', 'excitation', 'wavelength', 'although', 'for', 'the', 'same', 'fluence', '400nm', 'light', 'excites', 'electrons', 'in', 'au', 'ten', 'times', 'more', 'than', '800nm', 'light', 'simple', 'model', 'calculations', 'show', 'that', 'the', 'different', 'specific', 'heat', 'of', 'electrons', 'in', 'ni', 'and', 'au', 'as', 'well', 'as', 'the', 'different', 'electronphonon', 'coupling', 'rapidly', 'force', 'the', 'majority', 'of', 'thermal', 'energy', 'into', 'the', 'ni', 'lattice', 'our', 'results', 'show', 'that', 'femtosecond', 'uxrd', 'provides', 'an', 'experimental', 'account', 'of', 'heat', 'transport', 'over', 'single', 'digit', 'nanometer', 'distances', 'as', 'the', 'thermal', 'framework', 'for', 'ultrafast', 'spin', 'dynamics']] | [-0.09796160283832041, 0.20814803878553134, -0.00638632127083838, 0.01372305955234109, -0.007052372374276344, -0.14307169817934315, 0.03872880831365295, 0.4481075725052506, -0.27228024716560656, -0.3014630761373645, 0.00735936249223484, -0.3468189870663292, -0.03192576768588669, 0.24318602183932223, 0.07023103666366436, 0.014265112213391919, 0.03182983991484015, -0.06486105262816776, -0.06120567409491811, -0.16582873872651432, 0.22452176181608452, 0.07203272648607359, 0.2919277440523729, 0.11167858219526422, 0.036749116470813394, 0.016000232582043212, 0.08801840428742043, -0.03977944553872266, -0.13787686460811807, 0.06800002258163519, 0.20826526049775287, -0.08236481025656198, 0.21077813548841873, -0.5227206212808736, -0.2669787577783259, -0.026982440303947024, 0.14336398024058256, 0.13912187286992916, -0.04916631172601718, -0.20919423402875298, 0.019569086670974054, -0.11901596654878141, -0.09181061746494379, -0.02463442827754009, 0.03842870598292883, 0.030724826939359236, -0.24018541887394698, 0.11122835744754411, 0.08230442144569959, 0.09306035548654389, -0.10111057282819484, -0.11657636742445622, -0.09539147848800685, 0.024339252330649357, 0.04667285447235022, 0.0591827737186507, 0.2262543400832398, -0.09900890998463953, -0.06582274275066223, 0.3681520868189042, -0.0777807912890449, -0.035106003550866335, 0.17526223926016918, -0.2126448806778241, 0.009505870992702862, 0.1970991493916909, 0.12157323420048599, 0.15941242388530205, -0.15666122477985203, 0.012414878083151192, 0.007143093185732141, 0.24706947827004255, 0.11492333109205131, 0.09777489348646039, 0.24664942342832757, 0.24263759173817773, 0.011418142695150051, 0.1283930209560472, -0.168398902658597, -0.05001433511363128, -0.17716856104939674, -0.15034650823508855, -0.20797172689064888, 0.1305087649021656, -0.13306703314810875, -0.1200707797677471, 0.37249415719550316, 0.16897424730779256, 0.16912418085177286, -0.04995307627429541, 0.28897821642805444, 0.09490970512202833, 0.08641536397548268, 0.04973225807323335, 0.2855929260325726, 0.14564040759600735, 0.1471134466919466, -0.2955838406750655, 0.07409270216997427, -0.013840354920830578] |
1,803.04035 | Entity Resolution and Federated Learning get a Federated Resolution | Consider two data providers, each maintaining records of different feature
sets about common entities. They aim to learn a linear model over the whole set
of features. This problem of federated learning over vertically partitioned
data includes a crucial upstream issue: entity resolution, i.e. finding the
correspondence between the rows of the datasets. It is well known that entity
resolution, just like learning, is mistake-prone in the real world. Despite the
importance of the problem, there has been no formal assessment of how errors in
entity resolution impact learning.
In this paper, we provide a thorough answer to this question, answering how
optimal classifiers, empirical losses, margins and generalisation abilities are
affected. While our answer spans a wide set of losses --- going beyond proper,
convex, or classification calibrated ---, it brings simple practical arguments
to upgrade entity resolution as a preprocessing step to learning. One of these
suggests that entity resolution should be aimed at controlling or minimizing
the number of matching errors between examples of distinct classes. In our
experiments, we modify a simple token-based entity resolution algorithm so that
it indeed aims at avoiding matching rows belonging to different classes, and
perform experiments in the setting where entity resolution relies on noisy
data, which is very relevant to real world domains. Notably, our approach
covers the case where one peer \textit{does not} have classes, or a noisy
record of classes. Experiments display that using the class information during
entity resolution can buy significant uplift for learning at little expense
from the complexity standpoint.
| cs.DB cs.LG | consider two data providers each maintaining records of different feature sets about common entities they aim to learn a linear model over the whole set of features this problem of federated learning over vertically partitioned data includes a crucial upstream issue entity resolution ie finding the correspondence between the rows of the datasets it is well known that entity resolution just like learning is mistakeprone in the real world despite the importance of the problem there has been no formal assessment of how errors in entity resolution impact learning in this paper we provide a thorough answer to this question answering how optimal classifiers empirical losses margins and generalisation abilities are affected while our answer spans a wide set of losses going beyond proper convex or classification calibrated it brings simple practical arguments to upgrade entity resolution as a preprocessing step to learning one of these suggests that entity resolution should be aimed at controlling or minimizing the number of matching errors between examples of distinct classes in our experiments we modify a simple tokenbased entity resolution algorithm so that it indeed aims at avoiding matching rows belonging to different classes and perform experiments in the setting where entity resolution relies on noisy data which is very relevant to real world domains notably our approach covers the case where one peer textitdoes not have classes or a noisy record of classes experiments display that using the class information during entity resolution can buy significant uplift for learning at little expense from the complexity standpoint | [['consider', 'two', 'data', 'providers', 'each', 'maintaining', 'records', 'of', 'different', 'feature', 'sets', 'about', 'common', 'entities', 'they', 'aim', 'to', 'learn', 'a', 'linear', 'model', 'over', 'the', 'whole', 'set', 'of', 'features', 'this', 'problem', 'of', 'federated', 'learning', 'over', 'vertically', 'partitioned', 'data', 'includes', 'a', 'crucial', 'upstream', 'issue', 'entity', 'resolution', 'ie', 'finding', 'the', 'correspondence', 'between', 'the', 'rows', 'of', 'the', 'datasets', 'it', 'is', 'well', 'known', 'that', 'entity', 'resolution', 'just', 'like', 'learning', 'is', 'mistakeprone', 'in', 'the', 'real', 'world', 'despite', 'the', 'importance', 'of', 'the', 'problem', 'there', 'has', 'been', 'no', 'formal', 'assessment', 'of', 'how', 'errors', 'in', 'entity', 'resolution', 'impact', 'learning', 'in', 'this', 'paper', 'we', 'provide', 'a', 'thorough', 'answer', 'to', 'this', 'question', 'answering', 'how', 'optimal', 'classifiers', 'empirical', 'losses', 'margins', 'and', 'generalisation', 'abilities', 'are', 'affected', 'while', 'our', 'answer', 'spans', 'a', 'wide', 'set', 'of', 'losses', 'going', 'beyond', 'proper', 'convex', 'or', 'classification', 'calibrated', 'it', 'brings', 'simple', 'practical', 'arguments', 'to', 'upgrade', 'entity', 'resolution', 'as', 'a', 'preprocessing', 'step', 'to', 'learning', 'one', 'of', 'these', 'suggests', 'that', 'entity', 'resolution', 'should', 'be', 'aimed', 'at', 'controlling', 'or', 'minimizing', 'the', 'number', 'of', 'matching', 'errors', 'between', 'examples', 'of', 'distinct', 'classes', 'in', 'our', 'experiments', 'we', 'modify', 'a', 'simple', 'tokenbased', 'entity', 'resolution', 'algorithm', 'so', 'that', 'it', 'indeed', 'aims', 'at', 'avoiding', 'matching', 'rows', 'belonging', 'to', 'different', 'classes', 'and', 'perform', 'experiments', 'in', 'the', 'setting', 'where', 'entity', 'resolution', 'relies', 'on', 'noisy', 'data', 'which', 'is', 'very', 'relevant', 'to', 'real', 'world', 'domains', 'notably', 'our', 'approach', 'covers', 'the', 'case', 'where', 'one', 'peer', 'textitdoes', 'not', 'have', 'classes', 'or', 'a', 'noisy', 'record', 'of', 'classes', 'experiments', 'display', 'that', 'using', 'the', 'class', 'information', 'during', 'entity', 'resolution', 'can', 'buy', 'significant', 'uplift', 'for', 'learning', 'at', 'little', 'expense', 'from', 'the', 'complexity', 'standpoint']] | [-0.06799233103771013, 0.013509793690195962, -0.04719602552485531, 0.07662457141384718, -0.12515811681224717, -0.16649671751829123, 0.08023379663080935, 0.41498183272042766, -0.2847899148544838, -0.3614607602818004, 0.08653379338673821, -0.30408932799436594, -0.10754881114211198, 0.18786413295621515, -0.12643337848863387, 0.0383019035520113, 0.12604303066936237, 0.05301065999830948, -0.04187592815767915, -0.2799899843912535, 0.33129625554516795, 0.060232786135011804, 0.3018771687213317, 0.03719774721992817, 0.14314973003851258, -0.018515382219739113, -0.06141857484267222, 0.033768796623342125, -0.06557565759520025, 0.12723518129191527, 0.3698236457147661, 0.21472396487241294, 0.3428918271649467, -0.38487836630948685, -0.19634764172549068, 0.12140623883808054, 0.1344975377469813, 0.09190755890662324, -0.019897702315236947, -0.26579511391547445, 0.07800756081139941, -0.1491333256777479, -0.05483237778024358, -0.09513327586714497, -0.000799518566543656, -0.028060877197118396, -0.24486460811260669, 0.036882652600181726, 0.08584307444147515, 0.09506922084911774, -0.021182514996527374, -0.0910996004456853, 0.04987274167512584, 0.19172887795001062, 0.03465388600329339, 0.010954468826700753, 0.11431466026246372, -0.15339023820879197, -0.13724275671586159, 0.38632903728089313, 0.0019304505484951696, -0.20608438677780272, 0.21434313614609773, -0.09181258284299093, -0.16555999508741856, 0.11293186964057932, 0.18123745218309548, 0.09676055930897211, -0.11899955372147542, 0.0412928242187601, -0.07095969111839008, 0.20575049600891562, 0.11222328010876571, 0.026251218599182637, 0.20584276996059675, 0.22348680948882765, 0.0685099087915063, 0.10409959270885737, -0.06513651249481166, -0.08682943069055794, -0.24858104814259932, -0.0998720230307824, -0.1771240570921112, 0.029980804981526242, -0.09412666608470403, -0.1498613350005133, 0.37942601641706325, 0.19269721386512453, 0.22779537251646162, 0.05938386617057217, 0.31565147306928376, 0.012045338586190892, 0.08921163363691434, 0.078365677359363, 0.1570436763853247, 0.016094799027428504, 0.11800620756701018, -0.15643984019059665, 0.07922248622741211, 0.03554349557198437] |
1,803.04036 | Metrized Quantum Vector Bundles over Quantum Tori Built from Riemannian
Metrics and Rosenberg's Levi-Civita Connections | We build metrized quantum vector bundles, over a generically transcendental
quantum torus, from Riemannian metrics, using Rosenberg's Levi-Civita
connections for these metrics. We also prove that two metrized quantum vector
bundles, corresponding to positive scalar multiples of a Riemannian metric,
have distance zero between them with respect to the modular Gromov-Hausdorff
propinquity.
| math.OA math.DG math.FA | we build metrized quantum vector bundles over a generically transcendental quantum torus from riemannian metrics using rosenbergs levicivita connections for these metrics we also prove that two metrized quantum vector bundles corresponding to positive scalar multiples of a riemannian metric have distance zero between them with respect to the modular gromovhausdorff propinquity | [['we', 'build', 'metrized', 'quantum', 'vector', 'bundles', 'over', 'a', 'generically', 'transcendental', 'quantum', 'torus', 'from', 'riemannian', 'metrics', 'using', 'rosenbergs', 'levicivita', 'connections', 'for', 'these', 'metrics', 'we', 'also', 'prove', 'that', 'two', 'metrized', 'quantum', 'vector', 'bundles', 'corresponding', 'to', 'positive', 'scalar', 'multiples', 'of', 'a', 'riemannian', 'metric', 'have', 'distance', 'zero', 'between', 'them', 'with', 'respect', 'to', 'the', 'modular', 'gromovhausdorff', 'propinquity']] | [-0.23186419701848465, 0.1032295124963499, -0.09470572895728625, 0.1232943323154289, -0.1693890770055497, -0.24402628858717015, -0.012491993852353726, 0.4269308961856251, -0.3176781302317977, -0.15631716178680877, 0.03356113417360645, -0.31151058067245263, -0.2161235296740555, 0.2031106226898443, -0.10705218686220738, 0.0852971755577108, 0.054562911668864005, 0.14420527684538123, -0.1669847754931722, -0.30198275224448967, 0.5467091298733766, -0.030210383413269974, 0.22333171752353126, 0.09280526886749822, 0.16667995661891138, -0.05775715875475166, 0.00767935962917713, 0.027533785323612392, -0.1520711259986106, 0.1732305554099954, 0.30661036738176617, 0.08429514410314508, 0.19507887513520053, -0.34137535283774084, -0.16884197885743701, 0.24177874491299287, 0.06485725598982893, -0.032451344053977385, 0.05421206410168312, -0.35237271118407637, 0.1285637575918092, -0.08447182028052899, -0.11792390955535946, -0.1587363915392556, 0.028416467329057362, -0.016789884064704753, -0.11227275599510624, -0.06532737385770396, 0.049616632159226216, 0.10391676794880858, -0.07483180771725109, -0.08539396857556242, -0.055218298140411765, 0.07346429031055707, 0.04998315032571554, 0.12695323809972392, 0.12062820086542231, -0.029383221361338377, -0.2211198399152356, 0.29314080383986807, -0.16836580742025176, -0.3300405465550004, 0.07069659465923905, -0.07495330218583919, -0.10588836004563536, 0.05874458605635132, 0.16076439393005926, 0.1645280018162269, -0.006241433067211451, 0.13224222933730254, -0.042672533398637406, 0.04652750164342041, 0.12108055498594275, 0.03482045825176801, 0.2112498154075673, -0.020435922098560974, 0.14654559746402532, 0.11815085076243402, 0.004621974715868978, -0.20416214549914002, -0.37025599439556783, -0.2817936505441769, -0.09714694829800954, 0.2886686762257551, -0.22409712636950785, -0.22589307114517745, 0.36810586873728496, 0.006035932250177631, 0.24517852114513516, 0.22040980735898932, 0.20338657183142808, -0.0018558227445912333, 0.07236895266060646, 0.11830512153056379, 0.20709947059647396, 0.33312525720192265, 0.01115958885818075, -0.06865310188508235, -0.11765906756493048, 0.18163189721795228] |
1,803.04037 | Sales forecasting using WaveNet within the framework of the Kaggle
competition | We took part in the Corporacion Favorita Grocery Sales Forecasting
competition hosted on Kaggle and achieved the 2nd place. In this abstract
paper, we present an overall analysis and solution to the underlying
machine-learning problem based on time series data, where major challenges are
identified and corresponding preliminary methods are proposed. Our approach is
based on the adaptation of dilated convolutional neural network for time series
forecasting. By applying this technique iteratively to batches of n examples, a
big amount of time series data can be eventually processed with a decent speed
and accuracy. We hope this paper could serve, to some extent, as a review and
guideline of the time series forecasting benchmark, inspiring further attempts
and researches.
| cs.LG | we took part in the corporacion favorita grocery sales forecasting competition hosted on kaggle and achieved the 2nd place in this abstract paper we present an overall analysis and solution to the underlying machinelearning problem based on time series data where major challenges are identified and corresponding preliminary methods are proposed our approach is based on the adaptation of dilated convolutional neural network for time series forecasting by applying this technique iteratively to batches of n examples a big amount of time series data can be eventually processed with a decent speed and accuracy we hope this paper could serve to some extent as a review and guideline of the time series forecasting benchmark inspiring further attempts and researches | [['we', 'took', 'part', 'in', 'the', 'corporacion', 'favorita', 'grocery', 'sales', 'forecasting', 'competition', 'hosted', 'on', 'kaggle', 'and', 'achieved', 'the', '2nd', 'place', 'in', 'this', 'abstract', 'paper', 'we', 'present', 'an', 'overall', 'analysis', 'and', 'solution', 'to', 'the', 'underlying', 'machinelearning', 'problem', 'based', 'on', 'time', 'series', 'data', 'where', 'major', 'challenges', 'are', 'identified', 'and', 'corresponding', 'preliminary', 'methods', 'are', 'proposed', 'our', 'approach', 'is', 'based', 'on', 'the', 'adaptation', 'of', 'dilated', 'convolutional', 'neural', 'network', 'for', 'time', 'series', 'forecasting', 'by', 'applying', 'this', 'technique', 'iteratively', 'to', 'batches', 'of', 'n', 'examples', 'a', 'big', 'amount', 'of', 'time', 'series', 'data', 'can', 'be', 'eventually', 'processed', 'with', 'a', 'decent', 'speed', 'and', 'accuracy', 'we', 'hope', 'this', 'paper', 'could', 'serve', 'to', 'some', 'extent', 'as', 'a', 'review', 'and', 'guideline', 'of', 'the', 'time', 'series', 'forecasting', 'benchmark', 'inspiring', 'further', 'attempts', 'and', 'researches']] | [-0.0653096246572896, 0.005104350515280086, -0.0856820624261999, 0.02351601930677445, -0.09487456216230097, -0.10796512416205727, 0.07396092395990705, 0.401739403931822, -0.27674923592016226, -0.34064765932918006, 0.1617129583361471, -0.27788173620644796, -0.18398621764917594, 0.23817362773240122, -0.11097436820944914, 0.08584801879767169, 0.12678444257670712, 0.021859070763756067, -0.017882006123470955, -0.35322798270748085, 0.26153217884910923, 0.091491891656262, 0.3068187866065428, 0.0469952093429354, 0.09048582102235757, -0.06440260449551746, -0.08413810732089874, -0.0015443432887092743, -0.08079319573246324, 0.14456380877353284, 0.3060136197421413, 0.1830923291297359, 0.35974779674130625, -0.483593781844864, -0.17769715551318777, 0.07977494724795349, 0.15119480016904, 0.09387220390554932, -0.06051589076956495, -0.307406751677776, 0.05259864290969239, -0.1790263449930403, -0.04780838989183052, -0.12553290189661753, -0.01300943628526651, 0.008011852574144673, -0.27977657010858387, 0.05057886374206879, 0.028444240506515544, 0.06591967879928863, -0.057147075434048206, -0.11450358888564202, 0.06039536208845675, 0.16351885919889006, 0.06687672365094638, 0.0470875924349659, 0.07312515495607677, -0.079807706393399, -0.1363523704533139, 0.36298982735373014, -0.07835162639156239, -0.1400249734457232, 0.16258750401548475, -0.05664673897549192, -0.19456670094185916, 0.040813931240103185, 0.28198068065899146, 0.10966789480234082, -0.15317322303437525, -0.0024787361333624292, -0.00724154744997748, 0.16884609755192304, 0.03138612217118598, -0.05807248647444141, 0.18632270107602972, 0.2848666963151569, 0.01005293031493759, 0.12688828103988567, -0.09332912575063479, -0.07252255937434797, -0.27927355447577107, -0.1469884915675363, -0.179947507671184, 0.0003372533535425607, -0.0790786914257273, -0.08931293984095001, 0.4365766709202773, 0.20593815859263906, 0.2030112071432428, 0.06673838779266573, 0.31263199322817165, 0.0920300219510483, 0.053323481319488115, 0.07962734194504273, 0.1499237795054423, -0.011167729910240214, 0.17485658437188747, -0.14301450041711777, 0.0815262334723758, 0.10126575819240549] |
1,803.04038 | Updating Beamformers to Respond to Changes in Users | We consider a multi-user multiple-input single-output downlink system that
provides each user with a prespecified level of quality-of-service. The base
station (BS) designs the beamformers so that each user receives a certain
signal-to-interference-and-noise ratio (SINR). In contrast to most of the
available literature in the beamforming field, we focus on the required
modifications when the system changes. We specifically study three cases: (i)
user entering the system, (ii) user leaving the system, and (iii) a change in
the SINR target. We do so in order to avoid designing the entire system from
scratch for every change in the requirements. In each of the three cases, we
describe the modifications required to the beamforming directions and the power
loading. We consider maximum ratio transmission (MRT), zero-forcing (ZF) and
the optimal beamformers. The proposed modifications provide performance that is
either exact or very close to that obtained when we redesign the entire system,
while having much lower computational cost.
| eess.SP cs.IT math.IT | we consider a multiuser multipleinput singleoutput downlink system that provides each user with a prespecified level of qualityofservice the base station bs designs the beamformers so that each user receives a certain signaltointerferenceandnoise ratio sinr in contrast to most of the available literature in the beamforming field we focus on the required modifications when the system changes we specifically study three cases i user entering the system ii user leaving the system and iii a change in the sinr target we do so in order to avoid designing the entire system from scratch for every change in the requirements in each of the three cases we describe the modifications required to the beamforming directions and the power loading we consider maximum ratio transmission mrt zeroforcing zf and the optimal beamformers the proposed modifications provide performance that is either exact or very close to that obtained when we redesign the entire system while having much lower computational cost | [['we', 'consider', 'a', 'multiuser', 'multipleinput', 'singleoutput', 'downlink', 'system', 'that', 'provides', 'each', 'user', 'with', 'a', 'prespecified', 'level', 'of', 'qualityofservice', 'the', 'base', 'station', 'bs', 'designs', 'the', 'beamformers', 'so', 'that', 'each', 'user', 'receives', 'a', 'certain', 'signaltointerferenceandnoise', 'ratio', 'sinr', 'in', 'contrast', 'to', 'most', 'of', 'the', 'available', 'literature', 'in', 'the', 'beamforming', 'field', 'we', 'focus', 'on', 'the', 'required', 'modifications', 'when', 'the', 'system', 'changes', 'we', 'specifically', 'study', 'three', 'cases', 'i', 'user', 'entering', 'the', 'system', 'ii', 'user', 'leaving', 'the', 'system', 'and', 'iii', 'a', 'change', 'in', 'the', 'sinr', 'target', 'we', 'do', 'so', 'in', 'order', 'to', 'avoid', 'designing', 'the', 'entire', 'system', 'from', 'scratch', 'for', 'every', 'change', 'in', 'the', 'requirements', 'in', 'each', 'of', 'the', 'three', 'cases', 'we', 'describe', 'the', 'modifications', 'required', 'to', 'the', 'beamforming', 'directions', 'and', 'the', 'power', 'loading', 'we', 'consider', 'maximum', 'ratio', 'transmission', 'mrt', 'zeroforcing', 'zf', 'and', 'the', 'optimal', 'beamformers', 'the', 'proposed', 'modifications', 'provide', 'performance', 'that', 'is', 'either', 'exact', 'or', 'very', 'close', 'to', 'that', 'obtained', 'when', 'we', 'redesign', 'the', 'entire', 'system', 'while', 'having', 'much', 'lower', 'computational', 'cost']] | [-0.2311154801908667, -0.0010058756882123127, 0.0027833701241880087, 0.013693406066418312, -0.09272975198165247, -0.2463222919387897, 0.12616355177519287, 0.3688824225786575, -0.22771670193349125, -0.26531195025416504, 0.08558027277504847, -0.2697698449816816, -0.1717839751268031, 0.10217589642007235, -0.10068696623691803, 0.048621727068386494, 0.05524381579368547, 0.08125891381222904, -0.09140709375074299, -0.28018420880992606, 0.2978051876816839, 0.11844929422186629, 0.3405529928399594, -0.017706360575998094, 0.08459810656940292, 0.028970044371701635, 0.022239413985887625, -0.010699939375557339, -0.11963036046070522, 0.06228278681698328, 0.3037473797104114, 0.23790265567849872, 0.28356648971486814, -0.41734499590093965, -0.19889336072685565, 0.09032250567232585, 0.14305701410495394, 0.07038742021930398, -0.02632903739006205, -0.19265330108446158, 0.13263194857459593, -0.2127845346880187, -0.03359580054214806, 0.04768070766637784, -0.09480738542176143, 0.05973226442201965, -0.3707023375477808, -0.03695839561616919, 0.0022246914227629544, 0.03161596376923429, -0.06552714397937985, -0.1552661643615645, 0.012853499273561938, 0.18143038356203622, 0.05340192129443975, -0.024644072814718494, 0.11870327001625885, -0.12709396328349973, -0.05391006540599024, 0.41382359066135754, -0.0177295971728541, -0.2724814181910104, 0.15588060966070005, -0.16622428367934694, -0.12259081562025959, 0.16270432222610826, 0.24034697952484535, 0.058918057371429196, -0.16756787044711702, 0.04178749509993644, 0.0018146281267047688, 0.18791031512093676, 0.08466060269048592, 0.07150026788685922, 0.15357590003004357, 0.17771722414904528, 0.16138570248534914, 0.13617846148776686, -0.11520902701404397, -0.06540495035042808, -0.26313174062165295, -0.1218835834323304, -0.16585544977562539, -2.3477491299817516e-05, -0.07759868378491826, -0.07721415540621658, 0.3869514967297103, 0.16022652744724872, 0.14160203007435437, 0.11733022474855849, 0.40248269540299275, 0.1388179810041455, 0.05218391042428127, 0.1391844829384261, 0.22778111716773536, 0.03319443736794838, 0.16618041439088665, -0.2568105297581334, 0.05400982075281868, -0.013202563009764643] |
1,803.04039 | Combinatorial Multi-Objective Multi-Armed Bandit Problem | In this paper, we introduce the COmbinatorial Multi-Objective Multi-Armed
Bandit (COMO-MAB) problem that captures the challenges of combinatorial and
multi-objective online learning simultaneously. In this setting, the goal of
the learner is to choose an action at each time, whose reward vector is a
linear combination of the reward vectors of the arms in the action, to learn
the set of super Pareto optimal actions, which includes the Pareto optimal
actions and actions that become Pareto optimal after adding an arbitrary small
positive number to their expected reward vectors. We define the Pareto regret
performance metric and propose a fair learning algorithm whose Pareto regret is
$O(N L^3 \log T)$, where $T$ is the time horizon, $N$ is the number of arms and
$L$ is the maximum number of arms in an action. We show that COMO-MAB has a
wide range of applications, including recommending bundles of items to users
and network routing, and focus on a resource-allocation application for
multi-user communication in the presence of multidimensional performance
metrics, where we show that our algorithm outperforms existing MAB algorithms.
| cs.LG | in this paper we introduce the combinatorial multiobjective multiarmed bandit comomab problem that captures the challenges of combinatorial and multiobjective online learning simultaneously in this setting the goal of the learner is to choose an action at each time whose reward vector is a linear combination of the reward vectors of the arms in the action to learn the set of super pareto optimal actions which includes the pareto optimal actions and actions that become pareto optimal after adding an arbitrary small positive number to their expected reward vectors we define the pareto regret performance metric and propose a fair learning algorithm whose pareto regret is on l3 log t where t is the time horizon n is the number of arms and l is the maximum number of arms in an action we show that comomab has a wide range of applications including recommending bundles of items to users and network routing and focus on a resourceallocation application for multiuser communication in the presence of multidimensional performance metrics where we show that our algorithm outperforms existing mab algorithms | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'combinatorial', 'multiobjective', 'multiarmed', 'bandit', 'comomab', 'problem', 'that', 'captures', 'the', 'challenges', 'of', 'combinatorial', 'and', 'multiobjective', 'online', 'learning', 'simultaneously', 'in', 'this', 'setting', 'the', 'goal', 'of', 'the', 'learner', 'is', 'to', 'choose', 'an', 'action', 'at', 'each', 'time', 'whose', 'reward', 'vector', 'is', 'a', 'linear', 'combination', 'of', 'the', 'reward', 'vectors', 'of', 'the', 'arms', 'in', 'the', 'action', 'to', 'learn', 'the', 'set', 'of', 'super', 'pareto', 'optimal', 'actions', 'which', 'includes', 'the', 'pareto', 'optimal', 'actions', 'and', 'actions', 'that', 'become', 'pareto', 'optimal', 'after', 'adding', 'an', 'arbitrary', 'small', 'positive', 'number', 'to', 'their', 'expected', 'reward', 'vectors', 'we', 'define', 'the', 'pareto', 'regret', 'performance', 'metric', 'and', 'propose', 'a', 'fair', 'learning', 'algorithm', 'whose', 'pareto', 'regret', 'is', 'on', 'l3', 'log', 't', 'where', 't', 'is', 'the', 'time', 'horizon', 'n', 'is', 'the', 'number', 'of', 'arms', 'and', 'l', 'is', 'the', 'maximum', 'number', 'of', 'arms', 'in', 'an', 'action', 'we', 'show', 'that', 'comomab', 'has', 'a', 'wide', 'range', 'of', 'applications', 'including', 'recommending', 'bundles', 'of', 'items', 'to', 'users', 'and', 'network', 'routing', 'and', 'focus', 'on', 'a', 'resourceallocation', 'application', 'for', 'multiuser', 'communication', 'in', 'the', 'presence', 'of', 'multidimensional', 'performance', 'metrics', 'where', 'we', 'show', 'that', 'our', 'algorithm', 'outperforms', 'existing', 'mab', 'algorithms']] | [-0.13617910368869207, 0.03390060431686675, -0.07186051384851042, 0.05152551623818986, -0.15107793258345228, -0.1639292589158588, 0.0884841122568485, 0.43003038540061583, -0.3097510317887711, -0.3032030872527068, 0.0653914490202968, -0.26616385997415093, -0.19139289423576056, 0.13517972184502977, -0.1584831145749885, 0.0672161803280903, 0.02532845490880437, 0.10163509231692149, -0.0011106897749784165, -0.3242232936380515, 0.33995206109484877, 0.05590816247040185, 0.25684035338045724, -0.017042965914969895, 0.15629128544422993, 0.02663452202443686, 0.008119998518824788, 0.031162049136608628, -0.11351659283581937, 0.10512581948482952, 0.3446168616719249, 0.24085946956196916, 0.38278810338953795, -0.3391425460366543, -0.12862928790345493, 0.16380734887437126, 0.11176051628002423, 0.032275236480722024, -0.026150368760460934, -0.2665668895210292, 0.08105884338229222, -0.1424337179566161, -0.026459738656899517, -0.029858188051204222, 0.0012610043362203964, 0.023341372196094296, -0.37357821849130074, -0.043710600350599337, 0.028340284381124934, 0.001230647671694136, -0.06927306214768418, -0.11770877597253707, 0.06403706809190118, 0.11480566798998727, 0.07726237023154557, 0.04638977473638531, 0.13280793263887367, -0.17199960284265242, -0.20961858085119875, 0.36728680139870545, -0.025840106330769885, -0.19709739929833317, 0.14020087253197103, -0.08238313715947045, -0.11525632582978466, 0.13527653071145385, 0.257330036027578, 0.1781874136120544, -0.1231663069230015, 0.09264346840331004, -0.12044963416890742, 0.12858882852656356, 0.0613194594401761, 0.041455441825407544, 0.10990278637904863, 0.2171074629854674, 0.191801803328602, 0.14290941578578098, -0.04573737525533737, -0.13848179763204044, -0.27884142759050856, -0.13911620425165624, -0.16204719829746644, -0.0050957251319104, -0.15950239648319658, -0.1512306929868679, 0.3684515123154263, 0.13960589623699585, 0.20261003225673474, 0.18644019224257394, 0.3057115421864588, 0.07867793454389065, 0.01821474385142621, 0.1729869363042868, 0.1658669932821692, 0.010095364666717538, 0.06003220944460166, -0.24710876147373248, 0.11085274618245282, 0.054064826939865356] |
1,803.0404 | Drop dynamics on Liquid Infused Surfaces: The Role of the Wetting Ridge | We employ a free energy lattice Boltzmann method to study the dynamics of a
ternary fluid system consisting of a liquid drop driven by a body force across
a regularly textured substrate, infused by a lubricating liquid. We focus on
the case of partial wetting lubricants and observe a rich interplay between
contact line pinning and viscous dissipation at the lubricant ridge, which
become dominant at large and small apparent angles respectively. Our numerical
investigations further demonstrate that the relative importance of viscous
dissipation at the lubricant ridge depends on the drop to lubricant viscosity
ratio, as well as on the shape of the wetting ridge.
| cond-mat.soft | we employ a free energy lattice boltzmann method to study the dynamics of a ternary fluid system consisting of a liquid drop driven by a body force across a regularly textured substrate infused by a lubricating liquid we focus on the case of partial wetting lubricants and observe a rich interplay between contact line pinning and viscous dissipation at the lubricant ridge which become dominant at large and small apparent angles respectively our numerical investigations further demonstrate that the relative importance of viscous dissipation at the lubricant ridge depends on the drop to lubricant viscosity ratio as well as on the shape of the wetting ridge | [['we', 'employ', 'a', 'free', 'energy', 'lattice', 'boltzmann', 'method', 'to', 'study', 'the', 'dynamics', 'of', 'a', 'ternary', 'fluid', 'system', 'consisting', 'of', 'a', 'liquid', 'drop', 'driven', 'by', 'a', 'body', 'force', 'across', 'a', 'regularly', 'textured', 'substrate', 'infused', 'by', 'a', 'lubricating', 'liquid', 'we', 'focus', 'on', 'the', 'case', 'of', 'partial', 'wetting', 'lubricants', 'and', 'observe', 'a', 'rich', 'interplay', 'between', 'contact', 'line', 'pinning', 'and', 'viscous', 'dissipation', 'at', 'the', 'lubricant', 'ridge', 'which', 'become', 'dominant', 'at', 'large', 'and', 'small', 'apparent', 'angles', 'respectively', 'our', 'numerical', 'investigations', 'further', 'demonstrate', 'that', 'the', 'relative', 'importance', 'of', 'viscous', 'dissipation', 'at', 'the', 'lubricant', 'ridge', 'depends', 'on', 'the', 'drop', 'to', 'lubricant', 'viscosity', 'ratio', 'as', 'well', 'as', 'on', 'the', 'shape', 'of', 'the', 'wetting', 'ridge']] | [-0.12734618175001639, 0.16299286098131593, -0.1100035784063193, -0.024606418541087857, -0.02680144890844119, -0.13277403726945367, 0.047558191405907974, 0.3575699236946848, -0.30201861844837385, -0.27387547875174656, 0.0727309456165388, -0.2900225635143524, -0.11947102933893648, 0.17698165065749497, 0.0043117461532776085, 0.05601651370876803, 0.0303908325973371, -0.05475506907162028, -0.051457942830275674, -0.15090748368112264, 0.3250612973868144, 0.04306233833754822, 0.3028662280302565, 0.14334826933589043, 0.1325213260518141, -0.015108608605586132, 0.04666828079465425, 0.08910895525346035, -0.2124657108175117, 0.05128973326237377, 0.18852419447470106, -0.12620680393949854, 0.25557806611693695, -0.45383384451270103, -0.25303200620609856, -0.0011838203612363563, 0.08727315282185544, 0.08884812196835278, -0.030157367776824547, -0.2228074443223447, 0.008956640080179809, -0.162657090005869, -0.13589709351401566, -0.03136441324846292, 0.04233509951429266, 0.0505117330725419, -0.19398854309165814, 0.12555631528112088, 0.0903323521601604, 0.09215331447688546, -0.06629173164607359, -0.11032875310981048, -0.0626675466268833, 0.057992153164034464, 0.07141507877353227, 0.017156533934263828, 0.25010534821798636, -0.18113616818917985, -0.011277381304370344, 0.3896836600714486, -0.08662795438211551, -0.20864244930903023, 0.24778310051363595, -0.14238781342941845, -0.020904050823652518, 0.19987491218654332, 0.24911986285258295, 0.09153240569647542, -0.07867046133702937, -0.015387281537701745, -0.051977621031187055, 0.1909107487156706, 0.09421878744725068, -0.07809829696538453, 0.25590028845757806, 0.26472446528034954, 0.03619244738640088, 0.19547591351394383, -0.1405366114013991, -0.11281384361626685, -0.2885236211630674, -0.1738937681822001, -0.17825984210160314, 0.015805405503103755, -0.10855438798665451, -0.21749297174502094, 0.31769823977934586, 0.04511937807876406, 0.21642461811513025, 0.011614296544411325, 0.26187332699658517, 0.025922651133579114, 0.04272132316375819, 0.065849636413403, 0.27184945379684783, 0.12712024224324608, 0.1325439267378863, -0.3014280473075385, 0.11467016384418491, 0.03272070850570739] |
1,803.04041 | High-density hard-core model on triangular and hexagonal lattices | We perform a rigorous study of the Gibbs statistics of high-density hard-core
random configurations on a unit triangular lattice $\mathbb{A}_2$ and a unit
honeycomb graph $\mathbb{H}_2$, for any value of the (Euclidean) repulsion
diameter $D>0$. Only attainable values of $D$ are relevant, for which
$D^2=a^2+b^2+ab$, $a, b \in\mathbb{Z}$ (L\"oschian numbers). Depending on
arithmetic properties of $D^2$, we identify, for large fugacities, the pure
phases (extreme Gibbs measures) and specify their symmetries. The answers
depend on the way(s) an equilateral triangle of side-length $D$ can be
inscribed in $\mathbb{A}_2$ or $\mathbb{H}_2$. On $\mathbb{A}_2$, our approach
works for all attainable $D^2$; on $\mathbb{H}_2$ we have to exclude $D^2 = 4,
7, 31, 133$, where a sliding phenomenon occurs, similar to that on a unit
square lattice $\mathbb{Z}^2$. For all values $D^2$ apart from the excluded
ones we prove the existence of a first-order phase transition where the number
of co-existing pure phases grows at least as $O(D^2)$.
The proof is based on the Pirogov--Sinai theory which requires non-trivial
verifications of key assumptions: finiteness of the set of periodic ground
states and the Peierls bound. To establish the Peierls bound, we develop a
general method based on the concept of a re-distributed area for Delaunay
triangles. Some of the presented proofs are computer-assisted.
As a by-product of the ground state identification, we solve the disk-packing
problem on $\mathbb{A}_2$ and $\mathbb{H}_2$ for any value of the disk diameter
$D$.
| math.PR | we perform a rigorous study of the gibbs statistics of highdensity hardcore random configurations on a unit triangular lattice mathbba_2 and a unit honeycomb graph mathbbh_2 for any value of the euclidean repulsion diameter d0 only attainable values of d are relevant for which d2a2b2ab a b inmathbbz loschian numbers depending on arithmetic properties of d2 we identify for large fugacities the pure phases extreme gibbs measures and specify their symmetries the answers depend on the ways an equilateral triangle of sidelength d can be inscribed in mathbba_2 or mathbbh_2 on mathbba_2 our approach works for all attainable d2 on mathbbh_2 we have to exclude d2 4 7 31 133 where a sliding phenomenon occurs similar to that on a unit square lattice mathbbz2 for all values d2 apart from the excluded ones we prove the existence of a firstorder phase transition where the number of coexisting pure phases grows at least as od2 the proof is based on the pirogovsinai theory which requires nontrivial verifications of key assumptions finiteness of the set of periodic ground states and the peierls bound to establish the peierls bound we develop a general method based on the concept of a redistributed area for delaunay triangles some of the presented proofs are computerassisted as a byproduct of the ground state identification we solve the diskpacking problem on mathbba_2 and mathbbh_2 for any value of the disk diameter d | [['we', 'perform', 'a', 'rigorous', 'study', 'of', 'the', 'gibbs', 'statistics', 'of', 'highdensity', 'hardcore', 'random', 'configurations', 'on', 'a', 'unit', 'triangular', 'lattice', 'mathbba_2', 'and', 'a', 'unit', 'honeycomb', 'graph', 'mathbbh_2', 'for', 'any', 'value', 'of', 'the', 'euclidean', 'repulsion', 'diameter', 'd0', 'only', 'attainable', 'values', 'of', 'd', 'are', 'relevant', 'for', 'which', 'd2a2b2ab', 'a', 'b', 'inmathbbz', 'loschian', 'numbers', 'depending', 'on', 'arithmetic', 'properties', 'of', 'd2', 'we', 'identify', 'for', 'large', 'fugacities', 'the', 'pure', 'phases', 'extreme', 'gibbs', 'measures', 'and', 'specify', 'their', 'symmetries', 'the', 'answers', 'depend', 'on', 'the', 'ways', 'an', 'equilateral', 'triangle', 'of', 'sidelength', 'd', 'can', 'be', 'inscribed', 'in', 'mathbba_2', 'or', 'mathbbh_2', 'on', 'mathbba_2', 'our', 'approach', 'works', 'for', 'all', 'attainable', 'd2', 'on', 'mathbbh_2', 'we', 'have', 'to', 'exclude', 'd2', '4', '7', '31', '133', 'where', 'a', 'sliding', 'phenomenon', 'occurs', 'similar', 'to', 'that', 'on', 'a', 'unit', 'square', 'lattice', 'mathbbz2', 'for', 'all', 'values', 'd2', 'apart', 'from', 'the', 'excluded', 'ones', 'we', 'prove', 'the', 'existence', 'of', 'a', 'firstorder', 'phase', 'transition', 'where', 'the', 'number', 'of', 'coexisting', 'pure', 'phases', 'grows', 'at', 'least', 'as', 'od2', 'the', 'proof', 'is', 'based', 'on', 'the', 'pirogovsinai', 'theory', 'which', 'requires', 'nontrivial', 'verifications', 'of', 'key', 'assumptions', 'finiteness', 'of', 'the', 'set', 'of', 'periodic', 'ground', 'states', 'and', 'the', 'peierls', 'bound', 'to', 'establish', 'the', 'peierls', 'bound', 'we', 'develop', 'a', 'general', 'method', 'based', 'on', 'the', 'concept', 'of', 'a', 'redistributed', 'area', 'for', 'delaunay', 'triangles', 'some', 'of', 'the', 'presented', 'proofs', 'are', 'computerassisted', 'as', 'a', 'byproduct', 'of', 'the', 'ground', 'state', 'identification', 'we', 'solve', 'the', 'diskpacking', 'problem', 'on', 'mathbba_2', 'and', 'mathbbh_2', 'for', 'any', 'value', 'of', 'the', 'disk', 'diameter', 'd']] | [-0.15250433627510993, 0.14365579425091443, -0.05483362237011683, 0.040288822381208886, -0.03957162732339073, -0.15755371065221693, 0.09644291766675278, 0.3218304193558502, -0.20894259195452258, -0.26136825204669656, 0.12638546551378177, -0.2958842328672995, -0.09481316685446768, 0.15488603428506104, -0.027431133152812204, 0.04660162354178941, 0.026930532137988322, 0.07279694205335466, -0.07765630871617916, -0.25847643554813904, 0.2913690746028089, -0.043860932173448296, 0.23408441241070613, 0.0850594487551245, 0.08019885797712759, 0.022385707226868123, 0.049160620214788495, 0.017718721557614187, -0.21380727876848224, 0.1060984562835515, 0.16274899222537295, 0.06940606422419962, 0.2178144221560973, -0.39263305848956237, -0.15555343812823424, 0.12708249265122434, 0.12145698194702466, 0.09227289870740177, -0.0002523507208269073, -0.2517855797785443, 0.08237714741330643, -0.09940742241073545, -0.1480360842608238, -0.06085082867487185, 0.03221388206539023, -8.299581109832376e-05, -0.28034225721980616, 0.061406039797652565, 0.0961320149557044, 0.09775918228975074, -0.05180055338252352, -0.17058405901549295, -0.013666476683441179, 0.09825282918593697, -0.0235829962663417, 0.043453064925557415, 0.08903774679729158, -0.08466103105116393, -0.13524815755053646, 0.38640242587428264, -0.02063718709481872, -0.2051434258839546, 0.17739355627919076, -0.1424809565498782, -0.16037461168416958, 0.12322731734076071, 0.14235358044819593, 0.13541346198367157, -0.07179292828828354, 0.11470487549421236, -0.09599592885631439, 0.1706455261587645, 0.10717594216364029, 0.03261934926968221, 0.170925137300641, 0.132310411709389, 0.12142522383412725, 0.1554138249595694, -0.07503231046459279, -0.11199641320048086, -0.3320839964700016, -0.13786797051356292, -0.24502309083281432, 0.0647618646019852, -0.13336391866512523, -0.20172251131964114, 0.3534386535195303, 0.09508945780717545, 0.21363376899424827, 0.06374382014281532, 0.2119009577592601, 0.06715634406663455, 0.039891878575856646, 0.05764841783798836, 0.20374994701340501, 0.1264511680047056, 0.020226971772438908, -0.17595797527613707, 0.02892416699192773, 0.13606183578711795] |
1,803.04042 | Interpreting Deep Classifier by Visual Distillation of Dark Knowledge | Interpreting black box classifiers, such as deep networks, allows an analyst
to validate a classifier before it is deployed in a high-stakes setting. A
natural idea is to visualize the deep network's representations, so as to "see
what the network sees". In this paper, we demonstrate that standard dimension
reduction methods in this setting can yield uninformative or even misleading
visualizations. Instead, we present DarkSight, which visually summarizes the
predictions of a classifier in a way inspired by notion of dark knowledge.
DarkSight embeds the data points into a low-dimensional space such that it is
easy to compress the deep classifier into a simpler one, essentially combining
model compression and dimension reduction. We compare DarkSight against t-SNE
both qualitatively and quantitatively, demonstrating that DarkSight
visualizations are more informative. Our method additionally yields a new
confidence measure based on dark knowledge by quantifying how unusual a given
vector of predictions is.
| cs.LG stat.ML | interpreting black box classifiers such as deep networks allows an analyst to validate a classifier before it is deployed in a highstakes setting a natural idea is to visualize the deep networks representations so as to see what the network sees in this paper we demonstrate that standard dimension reduction methods in this setting can yield uninformative or even misleading visualizations instead we present darksight which visually summarizes the predictions of a classifier in a way inspired by notion of dark knowledge darksight embeds the data points into a lowdimensional space such that it is easy to compress the deep classifier into a simpler one essentially combining model compression and dimension reduction we compare darksight against tsne both qualitatively and quantitatively demonstrating that darksight visualizations are more informative our method additionally yields a new confidence measure based on dark knowledge by quantifying how unusual a given vector of predictions is | [['interpreting', 'black', 'box', 'classifiers', 'such', 'as', 'deep', 'networks', 'allows', 'an', 'analyst', 'to', 'validate', 'a', 'classifier', 'before', 'it', 'is', 'deployed', 'in', 'a', 'highstakes', 'setting', 'a', 'natural', 'idea', 'is', 'to', 'visualize', 'the', 'deep', 'networks', 'representations', 'so', 'as', 'to', 'see', 'what', 'the', 'network', 'sees', 'in', 'this', 'paper', 'we', 'demonstrate', 'that', 'standard', 'dimension', 'reduction', 'methods', 'in', 'this', 'setting', 'can', 'yield', 'uninformative', 'or', 'even', 'misleading', 'visualizations', 'instead', 'we', 'present', 'darksight', 'which', 'visually', 'summarizes', 'the', 'predictions', 'of', 'a', 'classifier', 'in', 'a', 'way', 'inspired', 'by', 'notion', 'of', 'dark', 'knowledge', 'darksight', 'embeds', 'the', 'data', 'points', 'into', 'a', 'lowdimensional', 'space', 'such', 'that', 'it', 'is', 'easy', 'to', 'compress', 'the', 'deep', 'classifier', 'into', 'a', 'simpler', 'one', 'essentially', 'combining', 'model', 'compression', 'and', 'dimension', 'reduction', 'we', 'compare', 'darksight', 'against', 'tsne', 'both', 'qualitatively', 'and', 'quantitatively', 'demonstrating', 'that', 'darksight', 'visualizations', 'are', 'more', 'informative', 'our', 'method', 'additionally', 'yields', 'a', 'new', 'confidence', 'measure', 'based', 'on', 'dark', 'knowledge', 'by', 'quantifying', 'how', 'unusual', 'a', 'given', 'vector', 'of', 'predictions', 'is']] | [-0.023734055406530386, 0.023943717657530214, -0.14138952558549742, 0.14123308163291465, -0.13459511337180932, -0.17310392933276791, 0.056759928588289765, 0.40903274760891994, -0.2540396731502066, -0.29088157578992346, 0.044477856686959666, -0.28612774652283407, -0.21186469992195878, 0.1999191701754656, -0.11571686534831921, 0.018404551104952892, 0.0950580962592115, 0.040365038534315924, -0.040921833645552394, -0.28901305789438386, 0.31788128420865785, 0.058285693111247386, 0.3072276396304369, -0.01701627819178005, 0.11057145276106894, -0.015443454555546243, -0.049277474228292706, 0.04711292900048041, -0.08467764689815037, 0.1654791563563049, 0.2892179636036356, 0.20920337200785677, 0.2862438167158204, -0.3892561339214444, -0.23476352432257652, 0.09921802039568622, 0.1589120252771924, 0.15086474450537934, -0.030845481594733427, -0.3239831602573395, 0.0986835324120087, -0.16747618212675056, -0.06489582667748134, -0.19619409811683, -0.024133751674865683, -0.06559326600283384, -0.2757192564321061, 0.014575250170504053, 0.10174635603053805, 0.021760664923737447, -0.04455848224499884, -0.07505097483905653, -0.0031567000970244407, 0.09994498817250133, 0.017560729116667062, 0.07462457510021826, 0.13116985837308068, -0.14968984723246345, -0.12204917675893133, 0.3561741768599798, -0.07145351400366053, -0.22710320509349308, 0.2005492320470512, -0.062226481661200525, -0.1264860532153398, 0.08610515292113026, 0.20570227816080053, 0.0792785099024574, -0.15393855279311539, 0.022561621530136713, -0.07269220701845673, 0.188356087175974, 0.033725713935370244, -0.025731446854770183, 0.19063680245230596, 0.24938633541266123, 0.03873994687882563, 0.14969366179468732, -0.08629648500277351, -0.0579807640487949, -0.255534362749507, -0.13532895009964704, -0.18488003643229603, 0.009179319799877704, -0.10613655000595221, -0.1412439140304923, 0.36021217490546403, 0.22945672099478542, 0.27666285961866377, 0.07460288701268535, 0.35339931458234786, 0.026257041422844244, 0.0812732544564642, 0.08859438036102801, 0.19251367644717296, 0.051706991186365486, 0.08025791936088353, -0.08776429636403918, 0.08545191894595822, 0.06184146447262416] |
1,803.04043 | Uncertainty dimension and basin entropy in relativistic chaotic
scattering | Chaotic scattering is an important topic in nonlinear dynamics and chaos with
applications in several fields in physics and engineering. The study of this
phenomenon in relativistic systems has receivedlittle attention as compared to
the Newtonian case. Here, we focus our work on the study of some relevant
characteristics of the exit basin topology in the relativistic H\'enon-Heiles
system: the uncertainty dimension, the Wada property and the basin entropy. Our
main findings for the uncertainty dimension show two different behaviors
insofar we change the relativistic parameter $\beta$, in which a crossover
behavior is uncovered. This crossover point is related with the disappearance
of KAM islands in phase space that happens for velocity values above the
ultra-relativistic limit, $v>0.1c$. This result is supported by numerical
simulations and also by qualitative analysis, which are in good agreement. On
the other hand, the computation of the exit basins in the phase space suggests
the existence of Wada basins for a range of $\beta<0.625$. We also studied the
evolution of the exit basins in a quantitative manner by computing the basin
entropy, which shows a maximum value for $\beta \approx 0.2$. This last
quantity is related to the uncertainty in the prediction of the final fate of
the system. Finally, our work is relevant in galactic dynamics and it also has
important implications in other topics in physics as in the St\"ormer problem,
among others.
| nlin.CD | chaotic scattering is an important topic in nonlinear dynamics and chaos with applications in several fields in physics and engineering the study of this phenomenon in relativistic systems has receivedlittle attention as compared to the newtonian case here we focus our work on the study of some relevant characteristics of the exit basin topology in the relativistic henonheiles system the uncertainty dimension the wada property and the basin entropy our main findings for the uncertainty dimension show two different behaviors insofar we change the relativistic parameter beta in which a crossover behavior is uncovered this crossover point is related with the disappearance of kam islands in phase space that happens for velocity values above the ultrarelativistic limit v01c this result is supported by numerical simulations and also by qualitative analysis which are in good agreement on the other hand the computation of the exit basins in the phase space suggests the existence of wada basins for a range of beta0625 we also studied the evolution of the exit basins in a quantitative manner by computing the basin entropy which shows a maximum value for beta approx 02 this last quantity is related to the uncertainty in the prediction of the final fate of the system finally our work is relevant in galactic dynamics and it also has important implications in other topics in physics as in the stormer problem among others | [['chaotic', 'scattering', 'is', 'an', 'important', 'topic', 'in', 'nonlinear', 'dynamics', 'and', 'chaos', 'with', 'applications', 'in', 'several', 'fields', 'in', 'physics', 'and', 'engineering', 'the', 'study', 'of', 'this', 'phenomenon', 'in', 'relativistic', 'systems', 'has', 'receivedlittle', 'attention', 'as', 'compared', 'to', 'the', 'newtonian', 'case', 'here', 'we', 'focus', 'our', 'work', 'on', 'the', 'study', 'of', 'some', 'relevant', 'characteristics', 'of', 'the', 'exit', 'basin', 'topology', 'in', 'the', 'relativistic', 'henonheiles', 'system', 'the', 'uncertainty', 'dimension', 'the', 'wada', 'property', 'and', 'the', 'basin', 'entropy', 'our', 'main', 'findings', 'for', 'the', 'uncertainty', 'dimension', 'show', 'two', 'different', 'behaviors', 'insofar', 'we', 'change', 'the', 'relativistic', 'parameter', 'beta', 'in', 'which', 'a', 'crossover', 'behavior', 'is', 'uncovered', 'this', 'crossover', 'point', 'is', 'related', 'with', 'the', 'disappearance', 'of', 'kam', 'islands', 'in', 'phase', 'space', 'that', 'happens', 'for', 'velocity', 'values', 'above', 'the', 'ultrarelativistic', 'limit', 'v01c', 'this', 'result', 'is', 'supported', 'by', 'numerical', 'simulations', 'and', 'also', 'by', 'qualitative', 'analysis', 'which', 'are', 'in', 'good', 'agreement', 'on', 'the', 'other', 'hand', 'the', 'computation', 'of', 'the', 'exit', 'basins', 'in', 'the', 'phase', 'space', 'suggests', 'the', 'existence', 'of', 'wada', 'basins', 'for', 'a', 'range', 'of', 'beta0625', 'we', 'also', 'studied', 'the', 'evolution', 'of', 'the', 'exit', 'basins', 'in', 'a', 'quantitative', 'manner', 'by', 'computing', 'the', 'basin', 'entropy', 'which', 'shows', 'a', 'maximum', 'value', 'for', 'beta', 'approx', '02', 'this', 'last', 'quantity', 'is', 'related', 'to', 'the', 'uncertainty', 'in', 'the', 'prediction', 'of', 'the', 'final', 'fate', 'of', 'the', 'system', 'finally', 'our', 'work', 'is', 'relevant', 'in', 'galactic', 'dynamics', 'and', 'it', 'also', 'has', 'important', 'implications', 'in', 'other', 'topics', 'in', 'physics', 'as', 'in', 'the', 'stormer', 'problem', 'among', 'others']] | [-0.11628151793585985, 0.1265227137531655, -0.11375218214707115, 0.08396829449160911, -0.005214483058283423, -0.07167892052800147, 0.02981113376681526, 0.30861348621384543, -0.26027800930118977, -0.26148013213820204, 0.1105857049933468, -0.287656822778675, -0.16733935926369833, 0.22983738637231793, -0.04676253196575443, 0.04892843559352065, 0.0492432622562313, 0.04585363813747111, -0.045217761222891284, -0.20257672667096666, 0.33447931324234476, 0.06634311438561011, 0.26020175248982313, 0.06760271897490694, 0.04213821419665191, -0.02871208992485754, 0.0069510678908895444, 0.02487408462073044, -0.18198680697943975, 0.08644247834833022, 0.2419587923864545, 0.07932880638252668, 0.28110284665721474, -0.3567599322581786, -0.24948300436692206, 0.0866800412192776, 0.1426437531018886, 0.09537240477150721, -0.05824125347370241, -0.2736038986682957, 0.02455125424927548, -0.14815320037854388, -0.16682542941236145, -0.03167780120877395, 0.06637311420805282, 0.00518758461315502, -0.21410439505066933, 0.09067284118719135, 0.07807190653814133, 0.07016394099456515, -0.059990908995303266, -0.08979038595970248, -0.008627554783028221, 0.1328409011740091, 0.09300530920675489, 0.01465692652763563, 0.11906630066365785, -0.1317559723299013, -0.09518762385547894, 0.3872228639249133, -0.04198376292197083, -0.1701440712211193, 0.2072945136442683, -0.20021174738781453, -0.16438712394597033, 0.11326307760588174, 0.15779771994164937, 0.09293223791816739, -0.12651572223370447, 0.09714805612246014, -0.03972651439924281, 0.12679040851135023, 0.04102738915971078, 0.027151067567068837, 0.18969713114649384, 0.20994044581171956, 0.062808405506266, 0.14223447382525342, -0.0838543413202868, -0.17959411519957813, -0.3006253734995574, -0.15489544337981392, -0.1589605093406977, 0.0051868169280745125, -0.0887060304388773, -0.1267296011706074, 0.40398152009482335, 0.17885298300615826, 0.2059296475495639, 0.001166631163892999, 0.24871866535151368, 0.0932155664401194, -0.005484887571623101, 0.06574164925745025, 0.29115541078270757, 0.11179320455079401, 0.129119581868262, -0.23948281138065763, 0.07137722699337651, 0.07189046224074919] |
1,803.04044 | Coxeter groups and quiver representations | In this expository note, I showcase the relevance of Coxeter groups to quiver
representations. I discuss (1) real and imaginary roots, (2) reflection
functors, and (3) torsion free classes and c-sortable elements. The first two
topics are classical, while the third is a more recent development. I show that
torsion free classes in rep Q containing finitely many indecomposables
correspond bijectively to c-sortable elements in the corresponding Weyl group.
This was first established in Dynkin type by Ingalls and Thomas; it was shown
in general by Amiot, Iyama, Reiten, and Todorov. The proof in this note is
elementary, essentially following the argument of Ingalls and Thomas, but
without the assumption that Q is Dynkin.
| math.RT math.CO | in this expository note i showcase the relevance of coxeter groups to quiver representations i discuss 1 real and imaginary roots 2 reflection functors and 3 torsion free classes and csortable elements the first two topics are classical while the third is a more recent development i show that torsion free classes in rep q containing finitely many indecomposables correspond bijectively to csortable elements in the corresponding weyl group this was first established in dynkin type by ingalls and thomas it was shown in general by amiot iyama reiten and todorov the proof in this note is elementary essentially following the argument of ingalls and thomas but without the assumption that q is dynkin | [['in', 'this', 'expository', 'note', 'i', 'showcase', 'the', 'relevance', 'of', 'coxeter', 'groups', 'to', 'quiver', 'representations', 'i', 'discuss', '1', 'real', 'and', 'imaginary', 'roots', '2', 'reflection', 'functors', 'and', '3', 'torsion', 'free', 'classes', 'and', 'csortable', 'elements', 'the', 'first', 'two', 'topics', 'are', 'classical', 'while', 'the', 'third', 'is', 'a', 'more', 'recent', 'development', 'i', 'show', 'that', 'torsion', 'free', 'classes', 'in', 'rep', 'q', 'containing', 'finitely', 'many', 'indecomposables', 'correspond', 'bijectively', 'to', 'csortable', 'elements', 'in', 'the', 'corresponding', 'weyl', 'group', 'this', 'was', 'first', 'established', 'in', 'dynkin', 'type', 'by', 'ingalls', 'and', 'thomas', 'it', 'was', 'shown', 'in', 'general', 'by', 'amiot', 'iyama', 'reiten', 'and', 'todorov', 'the', 'proof', 'in', 'this', 'note', 'is', 'elementary', 'essentially', 'following', 'the', 'argument', 'of', 'ingalls', 'and', 'thomas', 'but', 'without', 'the', 'assumption', 'that', 'q', 'is', 'dynkin']] | [-0.13577805084723718, 0.12898902409085022, -0.07852645933203269, 0.05410594249291247, -0.1303303374463627, -0.16597450029905558, -0.033078900979537716, 0.34278511242908344, -0.3099836677950072, -0.24827916166140584, 0.055598685230953585, -0.25296382571717624, -0.180882582796856, 0.15760889528074154, -0.18761694664952525, -0.08729266431672793, 0.047294487739635405, 0.08691132741800525, -0.03667944022699406, -0.3368431380806948, 0.39507755669846867, -0.047559633998102264, 0.22328111604509646, 0.050266613624173034, 0.06473251641727984, 0.03437068754053479, -0.08532959163564731, -0.0272643575485665, -0.12626695417425812, 0.11485566728821907, 0.31899045430646655, 0.0731767457909882, 0.21143804199936425, -0.34168012398948666, -0.0844391849904991, 0.15228388149274938, 0.1174364634906963, 0.06444816137949952, -0.03303736822923192, -0.2828327905337669, 0.10880084081732652, -0.2302475293889936, -0.14880153676494956, -0.007107681617255143, 0.15177100295560403, 0.020097663584716718, -0.19368127106051697, -0.00512716897534566, 0.14814245534178458, 0.130453343862635, -0.0548972550456886, -0.15325219985894173, -0.019394415185639734, 0.06914923004724347, 0.0030226729863339612, 0.012396676371409149, 0.0374055122057989, -0.06777803215051167, -0.163367962971199, 0.36101110887779087, 0.02466833459115342, -0.1719884192652739, 0.16688589082638683, -0.16384344839229525, -0.1789338634504626, 0.11573152176079977, 0.012732965992191774, 0.1156492183513923, -0.07893834883968036, 0.20233204732587756, -0.1129714723660104, 0.05813251726080157, 0.1409717147246722, -0.0875382472065547, 0.08773948139870506, 0.038851011397415085, -0.03135524069729032, 0.09795877336230326, 0.05176224155155452, -0.013599117556096692, -0.38085157920916873, -0.2112573062053375, -0.13061248705050452, 0.08749713327555933, -0.057137302669600515, -0.10442016538709459, 0.3815548206646845, 0.10704744807515996, 0.1488322371192146, 0.07159034520583718, 0.1904467673678147, 0.04165937003205743, 0.05036119446403494, 0.05239796992652389, 0.16023266713723147, 0.22221373504828335, 0.008271392667666078, -0.14471983155153953, -0.009005340041894988, 0.2261786386370659] |
1,803.04045 | Some adaptive analog of Yu. E. Nesterov's method for variational
inequalities with a strongly monotone operator | An adaptive analogue of the Yu. E. Nesterov method for variational
inequalities with a strongly monotone operator is proposed. Some estimates are
obtained for the parameters determining the quality of the solution of the
variational inequality depending on the number of iterations.
| math.OC | an adaptive analogue of the yu e nesterov method for variational inequalities with a strongly monotone operator is proposed some estimates are obtained for the parameters determining the quality of the solution of the variational inequality depending on the number of iterations | [['an', 'adaptive', 'analogue', 'of', 'the', 'yu', 'e', 'nesterov', 'method', 'for', 'variational', 'inequalities', 'with', 'a', 'strongly', 'monotone', 'operator', 'is', 'proposed', 'some', 'estimates', 'are', 'obtained', 'for', 'the', 'parameters', 'determining', 'the', 'quality', 'of', 'the', 'solution', 'of', 'the', 'variational', 'inequality', 'depending', 'on', 'the', 'number', 'of', 'iterations']] | [-0.09731925888696596, 0.03693608656820808, -0.07826478386206352, 0.03840877516250614, -0.07019166421100852, -0.13747286733372935, 0.037789802111330484, 0.2914076945079224, -0.282453998878953, -0.3194402292636888, 0.1352668239602021, -0.2701176809413092, -0.1205503116694412, 0.2672416041854636, -0.10955798200198583, 0.11046002275266108, 0.07824497986811843, 0.03874848317909276, -0.12339326218768422, -0.27962576717670473, 0.3111567133594127, 0.03350099471087257, 0.25014024911936195, 0.04980931663331354, 0.12612467188210713, 0.015646302762130897, -0.020882268258858295, 0.017120570077427795, -0.18416385904475602, 0.19749820509570695, 0.15944258638081096, 0.1811318486551976, 0.35749557614326477, -0.33884192120638634, -0.18125418999365397, 0.1335906462655181, 0.09597923437000386, 0.03857735550541076, -0.05611793527523765, -0.3013959044501895, 0.02651837594541056, -0.07237816717298258, -0.15526073040174587, -0.10391624504700303, -0.025131055242603735, 0.10354077261650846, -0.3853639366903475, 0.08006342622407135, 0.07875642136094116, 0.0266989463347099, -0.10671930680317539, -0.14586009111787593, -0.006578104088215956, 0.008833233078586914, 0.038502756212394504, 0.050523454700374885, 0.07545105137285732, -0.08558337167570633, -0.11159452733894189, 0.2637954101498638, -0.03936527650581584, -0.27920273168101195, 0.1194982495425003, -0.058916732602353604, -0.1509099324300353, 0.09716195438522846, 0.12682606461679652, 0.20583662093572674, -0.12212710898546945, 0.12071567437323254, -0.0954416893537633, 0.10977145730118666, 0.05872792272739822, 0.02269480942881533, 0.0011632944945068587, 0.12700406388761448, 0.18730530266960463, 0.10495891397641528, -0.05035123909224889, -0.08763852385094478, -0.31961659865365144, -0.1937053435748177, -0.24570363254419395, 0.023832568277915318, -0.18161553197673388, -0.183692635680061, 0.3831500254926227, 0.0817474132581126, 0.1651189598875741, 0.07725613790431193, 0.22518279181704634, 0.20806153732839794, -0.01067317882552743, 0.09812699594268841, 0.24799794734003844, 0.198742242480096, 0.0635962919775574, -0.27294663231198985, 0.10378763425563063, 0.24615648608388646] |
1,803.04046 | Exponential Condition Number of Solutions of the Discrete Lyapunov
Equation | The condition number of the $n\ x\ n$ matrix $P$ is examined, where $P$
solves %the discete Lyapunov equation, $P - A P A^* = BB^*$, and $B$ is a $n\
x\ d$ matrix. Lower bounds on the condition number, $\kappa$, of $P$ are given
when $A$ is normal, a single Jordan block or in Frobenius form. The bounds show
that the ill-conditioning of $P$ grows as $\exp(n/d) >> 1$. These bounds are
related to the condition number of the transformation that takes $A$ to input
normal form. A simulation shows that $P$ is typically ill-conditioned in the
case of $n>>1$ and $d=1$. When $A_{ij}$ has an independent Gaussian
distribution (subject to restrictions), we observe that $\kappa(P)^{1/n} ~=
3.3$. The effect of auto-correlated forcing on the conditioning on state space
systems is examined
| stat.ME cs.NA cs.SY eess.SY math.NA math.ST physics.data-an stat.TH | the condition number of the n x n matrix p is examined where p solves the discete lyapunov equation p a p a bb and b is a n x d matrix lower bounds on the condition number kappa of p are given when a is normal a single jordan block or in frobenius form the bounds show that the illconditioning of p grows as expnd 1 these bounds are related to the condition number of the transformation that takes a to input normal form a simulation shows that p is typically illconditioned in the case of n1 and d1 when a_ij has an independent gaussian distribution subject to restrictions we observe that kappap1n 33 the effect of autocorrelated forcing on the conditioning on state space systems is examined | [['the', 'condition', 'number', 'of', 'the', 'n', 'x', 'n', 'matrix', 'p', 'is', 'examined', 'where', 'p', 'solves', 'the', 'discete', 'lyapunov', 'equation', 'p', 'a', 'p', 'a', 'bb', 'and', 'b', 'is', 'a', 'n', 'x', 'd', 'matrix', 'lower', 'bounds', 'on', 'the', 'condition', 'number', 'kappa', 'of', 'p', 'are', 'given', 'when', 'a', 'is', 'normal', 'a', 'single', 'jordan', 'block', 'or', 'in', 'frobenius', 'form', 'the', 'bounds', 'show', 'that', 'the', 'illconditioning', 'of', 'p', 'grows', 'as', 'expnd', '1', 'these', 'bounds', 'are', 'related', 'to', 'the', 'condition', 'number', 'of', 'the', 'transformation', 'that', 'takes', 'a', 'to', 'input', 'normal', 'form', 'a', 'simulation', 'shows', 'that', 'p', 'is', 'typically', 'illconditioned', 'in', 'the', 'case', 'of', 'n1', 'and', 'd1', 'when', 'a_ij', 'has', 'an', 'independent', 'gaussian', 'distribution', 'subject', 'to', 'restrictions', 'we', 'observe', 'that', 'kappap1n', '33', 'the', 'effect', 'of', 'autocorrelated', 'forcing', 'on', 'the', 'conditioning', 'on', 'state', 'space', 'systems', 'is', 'examined']] | [-0.2064371377909704, 0.15889561652043735, -0.07939693518722105, 0.01704273083236157, -0.03416861007396605, -0.19103662344065334, 0.03845250191322217, 0.28490029952474055, -0.27832867953157614, -0.25759269215817016, 0.08105284335010404, -0.2993885027799046, -0.12030049540575534, 0.16039030495772344, -0.03807428025359672, 0.05313314283118835, 0.032064589250478004, 0.1462109869286891, -0.09032346798284423, -0.28460929165816024, 0.3027251486829112, -0.037986803618777126, 0.24395421950057858, -0.005211374741823723, 0.04790910398809328, -0.005942840254791673, 0.014147571624360152, 0.00596172321520354, -0.12324694682412507, 0.048699807453279696, 0.20560594379074043, 0.13865082564855888, 0.3011926509239452, -0.367408734871932, -0.1522947187786774, 0.16363069523007623, 0.13327454628112415, 0.028071047072964057, 0.018202638309929402, -0.2024676303456848, 0.13909063673400807, -0.09583448194381264, -0.11389605642577248, -0.010585598023017012, 0.12678319161077814, -0.008110281353491166, -0.3960305079817772, 0.043990085298829064, 0.13196465248308545, 0.03724442754450831, -0.020653349565460333, -0.1958029413714059, -0.02828745165144995, 0.02994650519602666, 0.027791924484532386, 0.0413909785205587, 0.09212983415428815, -0.07480738615886943, -0.027786254631503235, 0.3579622092730706, -0.05714632677919571, -0.25978836938295335, 0.1165333197503868, -0.18050063224805016, -0.12515819892804655, 0.14237345176349794, 0.15052642687852125, 0.11812324387331803, -0.048818383415068854, 0.19016336010573137, -0.11508377147690645, 0.16101129033828213, 0.08113128048855633, -0.015631281238581454, 0.07759330176197672, 0.11753875365672958, 0.09750509765812211, 0.13007623248083133, -0.07827484412469886, -0.028847639737207265, -0.3551394513887649, -0.13028501964817268, -0.2360486823581307, 0.10721424129414595, -0.11603039679730068, -0.15482472112154708, 0.2933366792054758, 0.06637642603544962, 0.2529570547982104, 0.07713477902894189, 0.24061049841758278, 0.14726097615609418, -0.0016084453378021459, 0.07059452325726549, 0.12749716232989042, 0.1751808031713442, 0.014108732590333574, -0.2105222872074043, 0.08426007420371567, 0.06941667619338703] |
1,803.04047 | Heuristics for p-class towers of real quadratic fields | Let $p$ be an odd prime. For a number field $K$, we let $K_\infty$ be the
maximal unramified pro-$p$ extension of $K$; we call the group
$\mathrm{Gal}(K_\infty/K)$ the $p$-class tower group of $K$. In a previous
work, as a non-abelian generalization of the work of Cohen and Lenstra on ideal
class groups, we studied how likely it is that a given finite $p$-group occurs
as the $p$-class tower group of an imaginary quadratic field. Here we do the
same for an arbitrary real quadratic field $K$ as base. As before, the action
of $\mathrm{Gal}(K/\mathbb{Q})$ on the $p$-class tower group of $K$ plays a
crucial role; however, the presence of units of infinite order in the ground
field significantly complicates the possibilities for groups that can occur. We
also sharpen our results in the imaginary quadratic field case by removing a
certain hypothesis, using ideas of Boston and Wood. In an appendix, we show how
the probabilities introduced for finite $p$-groups can be extended in a
consistent way to the infinite pro-$p$ groups which can arise in both the real
and imaginary quadratic settings.}
| math.NT | let p be an odd prime for a number field k we let k_infty be the maximal unramified prop extension of k we call the group mathrmgalk_inftyk the pclass tower group of k in a previous work as a nonabelian generalization of the work of cohen and lenstra on ideal class groups we studied how likely it is that a given finite pgroup occurs as the pclass tower group of an imaginary quadratic field here we do the same for an arbitrary real quadratic field k as base as before the action of mathrmgalkmathbbq on the pclass tower group of k plays a crucial role however the presence of units of infinite order in the ground field significantly complicates the possibilities for groups that can occur we also sharpen our results in the imaginary quadratic field case by removing a certain hypothesis using ideas of boston and wood in an appendix we show how the probabilities introduced for finite pgroups can be extended in a consistent way to the infinite prop groups which can arise in both the real and imaginary quadratic settings | [['let', 'p', 'be', 'an', 'odd', 'prime', 'for', 'a', 'number', 'field', 'k', 'we', 'let', 'k_infty', 'be', 'the', 'maximal', 'unramified', 'prop', 'extension', 'of', 'k', 'we', 'call', 'the', 'group', 'mathrmgalk_inftyk', 'the', 'pclass', 'tower', 'group', 'of', 'k', 'in', 'a', 'previous', 'work', 'as', 'a', 'nonabelian', 'generalization', 'of', 'the', 'work', 'of', 'cohen', 'and', 'lenstra', 'on', 'ideal', 'class', 'groups', 'we', 'studied', 'how', 'likely', 'it', 'is', 'that', 'a', 'given', 'finite', 'pgroup', 'occurs', 'as', 'the', 'pclass', 'tower', 'group', 'of', 'an', 'imaginary', 'quadratic', 'field', 'here', 'we', 'do', 'the', 'same', 'for', 'an', 'arbitrary', 'real', 'quadratic', 'field', 'k', 'as', 'base', 'as', 'before', 'the', 'action', 'of', 'mathrmgalkmathbbq', 'on', 'the', 'pclass', 'tower', 'group', 'of', 'k', 'plays', 'a', 'crucial', 'role', 'however', 'the', 'presence', 'of', 'units', 'of', 'infinite', 'order', 'in', 'the', 'ground', 'field', 'significantly', 'complicates', 'the', 'possibilities', 'for', 'groups', 'that', 'can', 'occur', 'we', 'also', 'sharpen', 'our', 'results', 'in', 'the', 'imaginary', 'quadratic', 'field', 'case', 'by', 'removing', 'a', 'certain', 'hypothesis', 'using', 'ideas', 'of', 'boston', 'and', 'wood', 'in', 'an', 'appendix', 'we', 'show', 'how', 'the', 'probabilities', 'introduced', 'for', 'finite', 'pgroups', 'can', 'be', 'extended', 'in', 'a', 'consistent', 'way', 'to', 'the', 'infinite', 'prop', 'groups', 'which', 'can', 'arise', 'in', 'both', 'the', 'real', 'and', 'imaginary', 'quadratic', 'settings']] | [-0.19316481466492566, 0.1658965404153781, -0.10071968391424467, 0.049325487852348686, -0.11678006265374179, -0.08813101388719859, 0.02563832572131361, 0.31056234463843524, -0.2834063415783483, -0.2841454584444796, 0.07116421514051807, -0.2164398184617292, -0.1482563340812613, 0.22808683811859304, -0.08665373198075724, -0.04736553655695479, -0.020485826271447193, 0.14986253406296776, -0.01920266905593691, -0.31566556785461486, 0.3469678845555002, 0.022403096232192787, 0.20052114796428555, 0.035575506565526376, 0.0545189640689281, 0.05597406747437067, 0.012881437737175691, 0.036391015227907206, -0.0928929881454035, 0.06979779967811803, 0.3189269875147951, 0.05934414118837092, 0.2834308034436808, -0.3817801677810996, -0.18721939326979178, 0.21843752549325748, 0.16627079444469173, 0.05059241967273166, -0.044463005234636574, -0.24360479868161208, 0.13777604279010583, -0.20069142531356593, -0.16956185226621961, -0.05964131376356174, 0.04286464289903579, -0.028881127411597384, -0.2745541141819317, 0.0027493480115405988, 0.10372384685060802, 0.15684559963971895, -0.08301976330548419, -0.1508250418067678, 0.019065672653927904, 0.11717523954993947, 0.02954554804009051, 0.033349885690175204, 0.09984121477046148, -0.11434729275221613, -0.1382870265431908, 0.3902432597268023, -0.1321535595565345, -0.14146950084057466, 0.13923447689193286, -0.14871394334011068, -0.14065962854916877, 0.10836132652980394, 0.14008521745547406, 0.14387074884320533, -0.02116588898966583, 0.20857110603369042, -0.14907000046635036, 0.09717742676553394, 0.06393437274572188, -0.03817975912654762, 0.13804742931619862, 0.04590494426749441, 0.06732394814604471, 0.16671365840059515, -3.145459668906354e-06, -0.008862942104737238, -0.3649935410229376, -0.20336341009364664, -0.1524555847944064, 0.07651973707930736, -0.08585546316184395, -0.14133054887469426, 0.39778328420933934, 0.11464461017122173, 0.16744907738033743, 0.08220797035783961, 0.2179293113680896, 0.0951480670679021, 0.09502037599404954, 0.05878735811144721, 0.10258886541332535, 0.19120021982411778, -0.023296218540375405, -0.2040377221326215, -0.01678709529638702, 0.110292510722522] |
1,803.04048 | Multiple Instance Choquet Integral Classifier Fusion and Regression for
Remote Sensing Applications | In classifier (or regression) fusion the aim is to combine the outputs of
several algorithms to boost overall performance. Standard supervised fusion
algorithms often require accurate and precise training labels. However,
accurate labels may be difficult to obtain in many remote sensing applications.
This paper proposes novel classification and regression fusion models that can
be trained given ambiguosly and imprecisely labeled training data in which
training labels are associated with sets of data points (i.e., "bags") instead
of individual data points (i.e., "instances") following a multiple instance
learning framework. Experiments were conducted based on the proposed algorithms
on both synthetic data and applications such as target detection and crop yield
prediction given remote sensing data. The proposed algorithms show effective
classification and regression performance.
| cs.CV | in classifier or regression fusion the aim is to combine the outputs of several algorithms to boost overall performance standard supervised fusion algorithms often require accurate and precise training labels however accurate labels may be difficult to obtain in many remote sensing applications this paper proposes novel classification and regression fusion models that can be trained given ambiguosly and imprecisely labeled training data in which training labels are associated with sets of data points ie bags instead of individual data points ie instances following a multiple instance learning framework experiments were conducted based on the proposed algorithms on both synthetic data and applications such as target detection and crop yield prediction given remote sensing data the proposed algorithms show effective classification and regression performance | [['in', 'classifier', 'or', 'regression', 'fusion', 'the', 'aim', 'is', 'to', 'combine', 'the', 'outputs', 'of', 'several', 'algorithms', 'to', 'boost', 'overall', 'performance', 'standard', 'supervised', 'fusion', 'algorithms', 'often', 'require', 'accurate', 'and', 'precise', 'training', 'labels', 'however', 'accurate', 'labels', 'may', 'be', 'difficult', 'to', 'obtain', 'in', 'many', 'remote', 'sensing', 'applications', 'this', 'paper', 'proposes', 'novel', 'classification', 'and', 'regression', 'fusion', 'models', 'that', 'can', 'be', 'trained', 'given', 'ambiguosly', 'and', 'imprecisely', 'labeled', 'training', 'data', 'in', 'which', 'training', 'labels', 'are', 'associated', 'with', 'sets', 'of', 'data', 'points', 'ie', 'bags', 'instead', 'of', 'individual', 'data', 'points', 'ie', 'instances', 'following', 'a', 'multiple', 'instance', 'learning', 'framework', 'experiments', 'were', 'conducted', 'based', 'on', 'the', 'proposed', 'algorithms', 'on', 'both', 'synthetic', 'data', 'and', 'applications', 'such', 'as', 'target', 'detection', 'and', 'crop', 'yield', 'prediction', 'given', 'remote', 'sensing', 'data', 'the', 'proposed', 'algorithms', 'show', 'effective', 'classification', 'and', 'regression', 'performance']] | [-0.007571526789825742, -0.011288704910898596, -0.030060510084835616, 0.07240730960194658, -0.12385025899100109, -0.23062204426851093, 0.06822409829961484, 0.4642382368627118, -0.26253558202396804, -0.36747508344232915, 0.12562226329275172, -0.2693908542235632, -0.14996026619148206, 0.21648651360649127, -0.18349043668883785, 0.16333078109182236, 0.22283200035250283, 0.10707556214789307, -0.05592702937263208, -0.33829309947304126, 0.28385291771766374, 0.04710251497241055, 0.38540352992259147, -0.011145323882167175, 0.11275412066275542, 0.002739657040276542, -0.07393165698608126, 0.008776802001748144, -0.002197236922766911, 0.19415776039344992, 0.3839245422818564, 0.23689436505934813, 0.30881087774244265, -0.3927343281939989, -0.21875778715906105, 0.1507668273553737, 0.14550017762732337, 0.10199893413516654, -0.05255667475521625, -0.3346401602256952, 0.07656867154949624, -0.12330679254742657, 0.06997104088692524, -0.18283936756897748, -0.04935394536431243, 0.009531006265272637, -0.3869444206054133, 0.03849828616234217, 0.018747083575377712, 0.0801478254162078, -0.09194420807620102, -0.13505785008589546, 0.041834859249401626, 0.17029351909357177, 0.024684894816737954, 0.023128432797162028, 0.15549806062116978, -0.1717896980585576, -0.18685803828170386, 0.3646666210568775, -0.012056870602745169, -0.20365423120073672, 0.2527225880440688, 0.0015625800346819366, -0.1646595234297428, 0.12080218953390916, 0.29736322436171275, 0.12094277684099791, -0.17820428446222975, -0.008340181009578935, -0.018742194293233438, 0.1437597391309171, 0.03969214762167293, -0.03724585750284112, 0.1637794371983945, 0.2412395379998214, 0.011985310822312637, 0.09549048550358814, -0.16730007141065686, -0.010766256750159995, -0.21665357637296742, -0.07943472800169678, -0.21884889928321163, -0.06625794072264457, -0.10393477471974087, -0.16877735698618357, 0.35325729138429873, 0.2517107482630441, 0.26813066591190676, 0.08759377965025937, 0.37503371024277155, 0.0055128284682693885, 0.10481246075464215, 0.10881781801903181, 0.16345732524324724, 0.022182314607458627, 0.0728134242666325, -0.1300151989174386, 0.09858090417247599, 0.034172127878944566] |
1,803.04049 | PCA by Determinant Optimization has no Spurious Local Optima | Principal component analysis (PCA) is an indispensable tool in many learning
tasks that finds the best linear representation for data. Classically,
principal components of a dataset are interpreted as the directions that
preserve most of its "energy", an interpretation that is theoretically
underpinned by the celebrated Eckart-Young-Mirsky Theorem. There are yet other
ways of interpreting PCA that are rarely exploited in practice, largely because
it is not known how to reliably solve the corresponding non-convex optimisation
programs. In this paper, we consider one such interpretation of principal
components as the directions that preserve most of the "volume" of the dataset.
Our main contribution is a theorem that shows that the corresponding non-convex
program has no spurious local optima. We apply a number of solvers for
empirical confirmation.
| math.OC | principal component analysis pca is an indispensable tool in many learning tasks that finds the best linear representation for data classically principal components of a dataset are interpreted as the directions that preserve most of its energy an interpretation that is theoretically underpinned by the celebrated eckartyoungmirsky theorem there are yet other ways of interpreting pca that are rarely exploited in practice largely because it is not known how to reliably solve the corresponding nonconvex optimisation programs in this paper we consider one such interpretation of principal components as the directions that preserve most of the volume of the dataset our main contribution is a theorem that shows that the corresponding nonconvex program has no spurious local optima we apply a number of solvers for empirical confirmation | [['principal', 'component', 'analysis', 'pca', 'is', 'an', 'indispensable', 'tool', 'in', 'many', 'learning', 'tasks', 'that', 'finds', 'the', 'best', 'linear', 'representation', 'for', 'data', 'classically', 'principal', 'components', 'of', 'a', 'dataset', 'are', 'interpreted', 'as', 'the', 'directions', 'that', 'preserve', 'most', 'of', 'its', 'energy', 'an', 'interpretation', 'that', 'is', 'theoretically', 'underpinned', 'by', 'the', 'celebrated', 'eckartyoungmirsky', 'theorem', 'there', 'are', 'yet', 'other', 'ways', 'of', 'interpreting', 'pca', 'that', 'are', 'rarely', 'exploited', 'in', 'practice', 'largely', 'because', 'it', 'is', 'not', 'known', 'how', 'to', 'reliably', 'solve', 'the', 'corresponding', 'nonconvex', 'optimisation', 'programs', 'in', 'this', 'paper', 'we', 'consider', 'one', 'such', 'interpretation', 'of', 'principal', 'components', 'as', 'the', 'directions', 'that', 'preserve', 'most', 'of', 'the', 'volume', 'of', 'the', 'dataset', 'our', 'main', 'contribution', 'is', 'a', 'theorem', 'that', 'shows', 'that', 'the', 'corresponding', 'nonconvex', 'program', 'has', 'no', 'spurious', 'local', 'optima', 'we', 'apply', 'a', 'number', 'of', 'solvers', 'for', 'empirical', 'confirmation']] | [-0.09823339981371611, -0.015812122953943835, -0.13807779826649177, 0.09595154745661925, -0.08940664807143878, -0.12337246438209701, -0.020702801401888234, 0.3772286609343187, -0.2935047216482431, -0.28560626246475096, 0.14883954315647982, -0.271618026107051, -0.1866557996313997, 0.24141068918645148, -0.08460592841876187, 0.027503901565957112, 0.08142145375875155, 0.020191905587383614, -0.015289496444578202, -0.24099480356529765, 0.2870332968648611, 0.032907861556241834, 0.2692571586808263, 0.025856931242857158, 0.08405058606120751, 0.012751244733616064, -0.04129459700495826, 0.035375153799871294, -0.022987085556064633, 0.1439678102592373, 0.34703031189622374, 0.21414993593366596, 0.31127721514904827, -0.39108499429943994, -0.1820544501817895, 0.16137938669747048, 0.16387961365238535, 0.09506279816777688, -0.016418742527451922, -0.2008253495230919, 0.09601595048704661, -0.10099204525894184, -0.12946884504585401, -0.15964557556802128, 0.011380903991159257, -0.03934495394873455, -0.20714750612066604, 0.0782200524172797, 0.12174110672634653, 0.04428006121228764, -0.048986004772742724, -0.14414342019824297, -0.011583589137473151, 0.10668953475872363, 0.12288381277095878, 0.03561819141994663, 0.10598579072210146, -0.10763606030721305, -0.14884760276337455, 0.3825748511480065, -0.027803646957897766, -0.204937692086293, 0.19613262046289842, -0.04809460431286024, -0.20747219056338365, 0.11153297172492649, 0.13632930400616336, 0.1146907449927269, -0.17437416256229415, 0.07565710100521311, -0.11452086709117092, 0.1824716084497416, 0.013492295426851887, 0.01315155393704332, 0.18768888664263206, 0.16204025147218756, 0.11624799531874866, 0.11983889916693558, -0.05941014034732237, -0.062076779078750866, -0.3116066138164734, -0.14741344758360755, -0.23132551418375372, -0.010334319644859685, -0.07190784377111929, -0.171063869594831, 0.3856635418111884, 0.18927752605720063, 0.1913164779763874, 0.051912585511715625, 0.3315196614565812, 0.11474683118010615, 0.08197006685375126, 0.09558543378091235, 0.254835430551027, 0.13421767657828026, 0.059481519274413586, -0.18140813231644198, 0.08520506631663641, 0.03845971723373129] |
1,803.0405 | On terminal Fano 3-folds with 2-torus action, part II | We continue the classification of terminal Fano threefolds with an effective
two-torus action. In earlier work we settled the Q-factorial case with Picard
number one. Here we treat the larger class of varieties that do not admit any
contraction of a prime divisor; these are called combinatorially minimal.
| math.AG | we continue the classification of terminal fano threefolds with an effective twotorus action in earlier work we settled the qfactorial case with picard number one here we treat the larger class of varieties that do not admit any contraction of a prime divisor these are called combinatorially minimal | [['we', 'continue', 'the', 'classification', 'of', 'terminal', 'fano', 'threefolds', 'with', 'an', 'effective', 'twotorus', 'action', 'in', 'earlier', 'work', 'we', 'settled', 'the', 'qfactorial', 'case', 'with', 'picard', 'number', 'one', 'here', 'we', 'treat', 'the', 'larger', 'class', 'of', 'varieties', 'that', 'do', 'not', 'admit', 'any', 'contraction', 'of', 'a', 'prime', 'divisor', 'these', 'are', 'called', 'combinatorially', 'minimal']] | [-0.21158560152010372, 0.06663913548770022, -0.06348209622471283, 0.0636694368828709, -0.14121571528570107, -0.21243174534174614, -0.026746875172345124, 0.36986426827691804, -0.24548047054364966, -0.22328046240727417, 0.05867807773999326, -0.2474771859124303, -0.17666588385084955, 0.19582520522574973, -0.22186635439478172, -0.007222244152217172, 0.029392494276786845, 0.06904200250088859, -0.08728285435063299, -0.4242606090847403, 0.4661156946482758, -0.06029701171792112, 0.18426422464350858, 0.049754124270596854, 0.07481977368782584, -0.023285424812153604, 0.03604849557935571, 0.030461128354848672, -0.18483293253014685, 0.13925062182048956, 0.3175384232454235, 0.08008943614549935, 0.21037833908728013, -0.41533068551992375, -0.16574489833631864, 0.2640717041795142, 0.17501363380385251, 0.1086477304440147, 0.002845482745518287, -0.1370642448794873, 0.09497781400568783, -0.18701556717132917, -0.20741930386672416, -0.09153760938594739, 0.0073409344380100565, 0.01349647565317961, -0.18024045772229633, -0.0493704216429857, 0.1191100628930144, 0.1591513029222066, -0.022070125579678763, -0.0858100422968467, -0.051598654933817066, 0.04080838269631689, 0.019934070607026417, 0.025492421884943422, 0.06803895657261212, -0.1058009196810114, -0.12354900961508974, 0.3407026685308665, -0.060022969477965184, -0.24132252525305375, 0.13695643312530592, -0.15764978415487954, -0.20732763102084087, 0.18728932815914354, 0.08979665495765705, 0.25161455587173504, -0.0001961920061148703, 0.11917197236713643, -0.16112119873287156, 0.0659215901105199, 0.10767802307964303, -0.026097691647009924, 0.12172763112660807, 0.1024747102346737, 0.08312643601190454, 0.08985888571866478, -0.04211786847251157, -0.017182032732913893, -0.37891012818242115, -0.15483585983747616, -0.09555871642078273, 0.2277036777089355, -0.07134524238063022, -0.16213673841169415, 0.36671910268099356, 0.06568809827634443, 0.22003497050415413, 0.14997690829720037, 0.20336800542039177, 0.0291754156545115, 0.08477706896762054, 0.06921009320649318, 0.17831410208600573, 0.11815084423869848, -0.07376478152582422, -0.1418692904165558, -0.0259381596018405, 0.18972815365608162] |
1,803.04051 | Representation Learning over Dynamic Graphs | How can we effectively encode evolving information over dynamic graphs into
low-dimensional representations? In this paper, we propose DyRep, an inductive
deep representation learning framework that learns a set of functions to
efficiently produce low-dimensional node embeddings that evolves over time. The
learned embeddings drive the dynamics of two key processes namely,
communication and association between nodes in dynamic graphs. These processes
exhibit complex nonlinear dynamics that evolve at different time scales and
subsequently contribute to the update of node embeddings. We employ a
time-scale dependent multivariate point process model to capture these
dynamics. We devise an efficient unsupervised learning procedure and
demonstrate that our approach significantly outperforms representative
baselines on two real-world datasets for the problem of dynamic link prediction
and event time prediction.
| cs.LG stat.ML | how can we effectively encode evolving information over dynamic graphs into lowdimensional representations in this paper we propose dyrep an inductive deep representation learning framework that learns a set of functions to efficiently produce lowdimensional node embeddings that evolves over time the learned embeddings drive the dynamics of two key processes namely communication and association between nodes in dynamic graphs these processes exhibit complex nonlinear dynamics that evolve at different time scales and subsequently contribute to the update of node embeddings we employ a timescale dependent multivariate point process model to capture these dynamics we devise an efficient unsupervised learning procedure and demonstrate that our approach significantly outperforms representative baselines on two realworld datasets for the problem of dynamic link prediction and event time prediction | [['how', 'can', 'we', 'effectively', 'encode', 'evolving', 'information', 'over', 'dynamic', 'graphs', 'into', 'lowdimensional', 'representations', 'in', 'this', 'paper', 'we', 'propose', 'dyrep', 'an', 'inductive', 'deep', 'representation', 'learning', 'framework', 'that', 'learns', 'a', 'set', 'of', 'functions', 'to', 'efficiently', 'produce', 'lowdimensional', 'node', 'embeddings', 'that', 'evolves', 'over', 'time', 'the', 'learned', 'embeddings', 'drive', 'the', 'dynamics', 'of', 'two', 'key', 'processes', 'namely', 'communication', 'and', 'association', 'between', 'nodes', 'in', 'dynamic', 'graphs', 'these', 'processes', 'exhibit', 'complex', 'nonlinear', 'dynamics', 'that', 'evolve', 'at', 'different', 'time', 'scales', 'and', 'subsequently', 'contribute', 'to', 'the', 'update', 'of', 'node', 'embeddings', 'we', 'employ', 'a', 'timescale', 'dependent', 'multivariate', 'point', 'process', 'model', 'to', 'capture', 'these', 'dynamics', 'we', 'devise', 'an', 'efficient', 'unsupervised', 'learning', 'procedure', 'and', 'demonstrate', 'that', 'our', 'approach', 'significantly', 'outperforms', 'representative', 'baselines', 'on', 'two', 'realworld', 'datasets', 'for', 'the', 'problem', 'of', 'dynamic', 'link', 'prediction', 'and', 'event', 'time', 'prediction']] | [-0.08532716963259925, 0.07123126261778394, -0.11497067052480434, 0.09367640316822284, -0.10823723082355555, -0.15620177589552176, 0.055674432045517246, 0.4712400533138744, -0.3637739977754292, -0.30836136349957555, 0.030194503996866726, -0.2546480293160365, -0.2131230294884693, 0.16875268115038652, -0.03627098728001358, 0.021240806852978085, 0.11806057750119738, 0.029443150393724922, -0.04859239047378181, -0.2540106697744059, 0.33624652479474826, 0.017631405631912078, 0.32101041445088, -0.008450836675511974, 0.17433456609761644, 0.014015267400311367, -0.04111248124935364, -0.003812868409788221, -0.0776952616807032, 0.14351566162452312, 0.32974535188893034, 0.20501935114002517, 0.28361758593312136, -0.4504639987398179, -0.25260373675114206, 0.12550954941862955, 0.16833603119988355, 0.09317908895700971, 0.005314038648653115, -0.29029331448668194, 0.047883420945107634, -0.14998817505435116, 0.01065872794753241, -0.17350750161905684, -0.022013245522224854, -0.008081709920999504, -0.29207999900644344, 0.03881978549649038, 0.0958802426879805, -0.0026156522573963286, -0.06443667823764225, -0.04358443081183659, 0.034569764460977766, 0.18392942523566871, -0.012191672835005222, 0.02869550530674807, 0.14732139846385126, -0.11375762499125314, -0.201528774709591, 0.32089904654252854, -0.06336018729451744, -0.21505013462005845, 0.22393475479686692, -0.048905911825356946, -0.18119415051994786, 0.11489663984356148, 0.32455151600597965, 0.13533212906951386, -0.15502709405747386, 0.01652292385810025, -0.027080941299866556, 0.1672331091176602, 0.01828290234064503, 0.01751228226836951, 0.16737525273469323, 0.25614250509909564, 0.046305731934074675, 0.12738065839174292, -0.10131291156792413, -0.15423883425612603, -0.2008796178570558, -0.08038633855270041, -0.14499604954917525, -0.0034251862145479647, -0.17652660859100927, -0.1478913114331062, 0.4506615019448462, 0.24329808873552528, 0.24221512934778847, 0.13737830304120097, 0.29715648830883323, 0.059108341026477586, 0.06644066972582932, 0.14304599397244952, 0.12959919947635143, 0.016932171705599512, 0.08525802897131671, -0.1834446868423613, 0.09715404646703973, 0.05784510749001657] |
1,803.04052 | On an alternative sequence comparison statistic of Steele | The purpose of this paper is to study a statistic that is used to compare the
similarity between two strings, which is first introduced by Michael Steele in
1982. It was proposed as an alternative to the length of the longest common
subsequences, for which the variance problem is still open. Our results include
moment asymptotics and distributional asymptotics for Steele's statistic and a
variation of it in random words and random permutations.
| math.PR | the purpose of this paper is to study a statistic that is used to compare the similarity between two strings which is first introduced by michael steele in 1982 it was proposed as an alternative to the length of the longest common subsequences for which the variance problem is still open our results include moment asymptotics and distributional asymptotics for steeles statistic and a variation of it in random words and random permutations | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'study', 'a', 'statistic', 'that', 'is', 'used', 'to', 'compare', 'the', 'similarity', 'between', 'two', 'strings', 'which', 'is', 'first', 'introduced', 'by', 'michael', 'steele', 'in', '1982', 'it', 'was', 'proposed', 'as', 'an', 'alternative', 'to', 'the', 'length', 'of', 'the', 'longest', 'common', 'subsequences', 'for', 'which', 'the', 'variance', 'problem', 'is', 'still', 'open', 'our', 'results', 'include', 'moment', 'asymptotics', 'and', 'distributional', 'asymptotics', 'for', 'steeles', 'statistic', 'and', 'a', 'variation', 'of', 'it', 'in', 'random', 'words', 'and', 'random', 'permutations']] | [-0.08423270785874903, 0.09773161262453195, -0.1091950410237051, 0.1308681651780841, -0.07711540211043129, -0.07821615984382695, 0.04871266773879553, 0.34216802592759266, -0.27011695190345586, -0.27313492790961713, 0.1110836659264687, -0.29718748092243114, -0.17063313084877774, 0.1832016808792553, -0.12071682482141338, 0.07413813309131624, 0.026282477942104004, 0.05386012800879879, -0.006733501983857523, -0.29812581862692966, 0.2887363650625546, 0.08384229768424818, 0.30477624057396635, 0.01320512731853005, 0.0832751983814962, 0.004428796961342227, -0.050162403302088585, 0.01983766078515208, -0.12046914644691255, 0.1301828499537357, 0.23452507719805796, 0.1423517440203322, 0.27949526811605446, -0.31150012315340236, -0.16541999813220273, 0.12577417885808095, 0.12632922821818557, 0.0961249716267347, 0.0014298221747046464, -0.2684590889982981, 0.13010249086591888, -0.11024600651421368, -0.09299662299868842, -0.012378576632640133, 0.10637366919688983, 0.040213143634801246, -0.2884887447421222, 0.051384012087261025, 0.11799888578179764, 0.03105288088698042, 0.017955516241746, -0.1083615872792083, 0.10256316314119693, 0.1335657339492073, 0.14707729975654654, 0.07584362736367302, -0.013159599899129355, -0.044099615449851304, -0.13698301240419075, 0.3601776098972824, -0.07006756577334583, -0.22465217816850733, 0.1393667300716553, -0.08548609679245887, -0.17012681990657766, 0.05517679756532793, 0.11100936314882073, 0.13101295391990714, -0.20410994659752063, 0.07621634171714317, -0.08884829538236436, 0.14160438897949323, 0.13025238481031298, -0.017822604900710796, 0.1529426730735457, 0.13609502329937603, 0.0776465923448846, 0.19199221587280602, -0.09953220848357687, -0.07718662680955986, -0.2687202567515308, -0.18708141904630482, -0.24058334683769778, 0.025229310154379028, -0.0820077054311397, -0.2134994378389969, 0.39453304140535117, 0.1930279516908404, 0.20316111076023582, 0.10817789603088511, 0.22813968802164372, 0.08005234141744776, 0.019281588268325957, 0.07299057669835547, 0.12303641259874383, 0.175098786600993, 0.05131708271801472, -0.19057703565021544, 0.09211780510409033, 0.1497536636888981] |
1,803.04053 | Learning Local Distortion Visibility From Image Quality Data-sets | Accurate prediction of local distortion visibility thresholds is critical in
many image and video processing applications. Existing methods require an
accurate modeling of the human visual system, and are derived through
pshycophysical experiments with simple, artificial stimuli. These approaches,
however, are difficult to generalize to natural images with complex types of
distortion. In this paper, we explore a different perspective, and we
investigate whether it is possible to learn local distortion visibility from
image quality scores. We propose a convolutional neural network based
optimization framework to infer local detection thresholds in a distorted
image. Our model is trained on multiple quality datasets, and the results are
correlated with empirical visibility thresholds collected on complex stimuli in
a recent study. Our results are comparable to state-of-the-art mathematical
models that were trained on phsycovisual data directly. This suggests that it
is possible to predict psychophysical phenomena from visibility information
embedded in image quality scores.
| cs.MM cs.CV | accurate prediction of local distortion visibility thresholds is critical in many image and video processing applications existing methods require an accurate modeling of the human visual system and are derived through pshycophysical experiments with simple artificial stimuli these approaches however are difficult to generalize to natural images with complex types of distortion in this paper we explore a different perspective and we investigate whether it is possible to learn local distortion visibility from image quality scores we propose a convolutional neural network based optimization framework to infer local detection thresholds in a distorted image our model is trained on multiple quality datasets and the results are correlated with empirical visibility thresholds collected on complex stimuli in a recent study our results are comparable to stateoftheart mathematical models that were trained on phsycovisual data directly this suggests that it is possible to predict psychophysical phenomena from visibility information embedded in image quality scores | [['accurate', 'prediction', 'of', 'local', 'distortion', 'visibility', 'thresholds', 'is', 'critical', 'in', 'many', 'image', 'and', 'video', 'processing', 'applications', 'existing', 'methods', 'require', 'an', 'accurate', 'modeling', 'of', 'the', 'human', 'visual', 'system', 'and', 'are', 'derived', 'through', 'pshycophysical', 'experiments', 'with', 'simple', 'artificial', 'stimuli', 'these', 'approaches', 'however', 'are', 'difficult', 'to', 'generalize', 'to', 'natural', 'images', 'with', 'complex', 'types', 'of', 'distortion', 'in', 'this', 'paper', 'we', 'explore', 'a', 'different', 'perspective', 'and', 'we', 'investigate', 'whether', 'it', 'is', 'possible', 'to', 'learn', 'local', 'distortion', 'visibility', 'from', 'image', 'quality', 'scores', 'we', 'propose', 'a', 'convolutional', 'neural', 'network', 'based', 'optimization', 'framework', 'to', 'infer', 'local', 'detection', 'thresholds', 'in', 'a', 'distorted', 'image', 'our', 'model', 'is', 'trained', 'on', 'multiple', 'quality', 'datasets', 'and', 'the', 'results', 'are', 'correlated', 'with', 'empirical', 'visibility', 'thresholds', 'collected', 'on', 'complex', 'stimuli', 'in', 'a', 'recent', 'study', 'our', 'results', 'are', 'comparable', 'to', 'stateoftheart', 'mathematical', 'models', 'that', 'were', 'trained', 'on', 'phsycovisual', 'data', 'directly', 'this', 'suggests', 'that', 'it', 'is', 'possible', 'to', 'predict', 'psychophysical', 'phenomena', 'from', 'visibility', 'information', 'embedded', 'in', 'image', 'quality', 'scores']] | [-0.04652561003807932, -0.00997722754322846, -0.07841960346481452, 0.09391779722180217, -0.10673284125203887, -0.14671971138566733, 0.017650357620635382, 0.5041725047367315, -0.2607921915594488, -0.3473861121758819, 0.06956691056101894, -0.2937005384111156, -0.23519748111255467, 0.20311382432313016, -0.16093987392572065, 0.09664766767062247, 0.13162581060857823, 0.07691187719348819, -0.06398307819928353, -0.2832381721275548, 0.2987360693141818, 0.04883925128107269, 0.3692805785002808, 0.020425615807374318, 0.07086865133993948, -0.045224306321082014, -0.054419966094816724, 0.019569570626287412, -0.09771667761466234, 0.18939589454171557, 0.3036980995608853, 0.2061532781055818, 0.25520339992052565, -0.42942771514256795, -0.2581983567774296, 0.08044142396034051, 0.09764961021021008, 0.11143207428753764, -0.03452747945751374, -0.34819278489177424, 0.09380332767963409, -0.08783172719491025, 0.02510423518717289, -0.1418750850049158, -0.018164943769418945, -0.007995183670815701, -0.3121484099701047, 0.07792633775932094, 0.02641047611211737, 0.09901726466914018, -0.05363945134139309, -0.07180442786775529, 0.03052679490298033, 0.194768358397608, -0.002125192785169929, 0.07050887252902611, 0.15359630928374826, -0.18485599195584654, -0.14834093056308725, 0.37983439323181906, -0.0328880850939701, -0.20566889671453586, 0.2548889138549566, -0.06257918268597375, -0.14015929277365408, 0.12715145570226014, 0.25888857518633207, 0.08794156482443213, -0.15515452979442973, -0.03968511181728294, -0.037294886739303666, 0.20448587879693755, 0.04456444399276127, 0.009775975906134894, 0.2124145736886809, 0.22946252029389144, -0.0047044455326007055, 0.1339917411003262, -0.12676871188761046, -0.05331693496011818, -0.17852895687373044, -0.052197423864272424, -0.17239812369147936, 0.0018644508393481374, -0.08321404285379685, -0.13480873803889457, 0.3892959344154224, 0.2625298508691291, 0.24213225467596203, 0.0736529242619872, 0.3641879161198934, 0.03932934767411401, 0.084192410868903, 0.021623847984398405, 0.20867219471993545, 0.010704964456769328, 0.07882377276197076, -0.1490375468476365, 0.08157179158724223, 0.019133106043251854] |
1,803.04054 | Two-Stage Convolutional Neural Network for Breast Cancer Histology Image
Classification | This paper explores the problem of breast tissue classification of microscopy
images. Based on the predominant cancer type the goal is to classify images
into four categories of normal, benign, in situ carcinoma, and invasive
carcinoma. Given a suitable training dataset, we utilize deep learning
techniques to address the classification problem. Due to the large size of each
image in the training dataset, we propose a patch-based technique which
consists of two consecutive convolutional neural networks. The first
"patch-wise" network acts as an auto-encoder that extracts the most salient
features of image patches while the second "image-wise" network performs
classification of the whole image. The first network is pre-trained and aimed
at extracting local information while the second network obtains global
information of an input image. We trained the networks using the ICIAR 2018
grand challenge on BreAst Cancer Histology (BACH) dataset. The proposed method
yields 95 % accuracy on the validation set compared to previously reported 77 %
accuracy rates in the literature. Our code is publicly available at
https://github.com/ImagingLab/ICIAR2018
| cs.CV | this paper explores the problem of breast tissue classification of microscopy images based on the predominant cancer type the goal is to classify images into four categories of normal benign in situ carcinoma and invasive carcinoma given a suitable training dataset we utilize deep learning techniques to address the classification problem due to the large size of each image in the training dataset we propose a patchbased technique which consists of two consecutive convolutional neural networks the first patchwise network acts as an autoencoder that extracts the most salient features of image patches while the second imagewise network performs classification of the whole image the first network is pretrained and aimed at extracting local information while the second network obtains global information of an input image we trained the networks using the iciar 2018 grand challenge on breast cancer histology bach dataset the proposed method yields 95 accuracy on the validation set compared to previously reported 77 accuracy rates in the literature our code is publicly available at httpsgithubcomimaginglabiciar2018 | [['this', 'paper', 'explores', 'the', 'problem', 'of', 'breast', 'tissue', 'classification', 'of', 'microscopy', 'images', 'based', 'on', 'the', 'predominant', 'cancer', 'type', 'the', 'goal', 'is', 'to', 'classify', 'images', 'into', 'four', 'categories', 'of', 'normal', 'benign', 'in', 'situ', 'carcinoma', 'and', 'invasive', 'carcinoma', 'given', 'a', 'suitable', 'training', 'dataset', 'we', 'utilize', 'deep', 'learning', 'techniques', 'to', 'address', 'the', 'classification', 'problem', 'due', 'to', 'the', 'large', 'size', 'of', 'each', 'image', 'in', 'the', 'training', 'dataset', 'we', 'propose', 'a', 'patchbased', 'technique', 'which', 'consists', 'of', 'two', 'consecutive', 'convolutional', 'neural', 'networks', 'the', 'first', 'patchwise', 'network', 'acts', 'as', 'an', 'autoencoder', 'that', 'extracts', 'the', 'most', 'salient', 'features', 'of', 'image', 'patches', 'while', 'the', 'second', 'imagewise', 'network', 'performs', 'classification', 'of', 'the', 'whole', 'image', 'the', 'first', 'network', 'is', 'pretrained', 'and', 'aimed', 'at', 'extracting', 'local', 'information', 'while', 'the', 'second', 'network', 'obtains', 'global', 'information', 'of', 'an', 'input', 'image', 'we', 'trained', 'the', 'networks', 'using', 'the', 'iciar', '2018', 'grand', 'challenge', 'on', 'breast', 'cancer', 'histology', 'bach', 'dataset', 'the', 'proposed', 'method', 'yields', '95', 'accuracy', 'on', 'the', 'validation', 'set', 'compared', 'to', 'previously', 'reported', '77', 'accuracy', 'rates', 'in', 'the', 'literature', 'our', 'code', 'is', 'publicly', 'available', 'at', 'httpsgithubcomimaginglabiciar2018']] | [-0.040600829894953804, -0.07720836670913352, -0.011583642815128855, 0.04996612068914276, -0.06289416058765103, -0.16056087971221478, 0.003569991098109832, 0.3929958362076875, -0.22526683515129012, -0.3175853392652546, 0.07756091119275273, -0.3056561840376595, -0.18672642345717622, 0.18454134564394953, -0.16227933186261603, 0.08217277418658514, 0.14864997697129315, 0.06644090212371555, -0.016554764021531724, -0.3429612674995691, 0.3307635796275766, 0.050204906134327064, 0.4015451291897556, -0.001040448368127857, 0.17144505195929446, -0.040391267339319234, -0.07353427447932995, -0.041860136516680496, -0.0501320613162274, 0.1806375390148051, 0.3136067002709578, 0.21835000083748518, 0.3312370071819584, -0.41500408389228616, -0.19548220153193965, 0.09891163600453486, 0.13384384774932792, 0.14220784925453786, -0.005153180867117564, -0.3371235568054198, 0.09990355452395133, -0.11129179039770472, 0.042659765539047795, -0.10036346730720695, -0.048360831352294464, -0.07438370945844024, -0.288902253910367, 0.10732766289064395, 0.036091576990050576, 0.10329530149188247, -0.10550766150672211, -0.11659006857024949, -0.027547247511046452, 0.20614706156387305, -0.000677946881513067, 0.1004167124074662, 0.16440672655309235, -0.2064777294331829, -0.1093456229982188, 0.33695094188442454, -0.03354918311760273, -0.13807173219781058, 0.18019746710030762, -0.028826122022499994, -0.14545985341759488, 0.13574402779895103, 0.22231887377815188, 0.13336630538383143, -0.21407323459529184, -0.039518718885596, -0.06002447286820305, 0.19301210751845724, 0.07558753968138869, -0.07367851597345657, 0.1296073908874643, 0.33034336430552813, -0.02245395431860483, 0.16326414418983318, -0.2481645582970703, 0.030875818912006383, -0.22249720283296137, -0.10949872524499715, -0.20116211202306053, -0.04599667077058084, -0.10034814473900562, -0.16042506300506093, 0.4559925986076927, 0.20458614322013177, 0.22386266819791803, 0.10327143566003845, 0.35388877387491185, -0.06284841549798632, 0.15475411005207293, 0.04732324518651391, 0.17077159248860663, 0.01757834936281489, 0.10869000103793085, -0.17585778250975723, 0.07328070288280114, 0.11502777024621277] |
1,803.04055 | Kinematics of B-F Stars as a Function of Their Dereddened Color from
Gaia and PCRV Data | Parallaxes with an accuracy better than 10% and proper motions from the Gaia
DR1 TGAS catalogue, radial velocities from the PCRV, Tycho-2 photometry,
PARSEC, MIST, YaPSI, BaSTI isochrones, and the most accurate reddening and
extinction estimates have been used to analyze the kinematics of 9543 thin-disk
B-F stars as a function of their dereddened color. These stars are located on
the Hertzsprung-Russell diagram relative to the isochrones with a high
accuracy. This has allowed me to conclude that the reddening and extinction
were significantly underestimated in some kinematic studies of other authors.
The median accuracy of the velocity components U, V, W in this study is 1.7
km/s, although outside the range $-0.1<(B_T-V_T)_0<0.5$ the kinematic
characteristics are noticeably biased due to the incompleteness of the sample.
We have confirmed the variations in the mean velocity of stars relative to the
Sun and the stellar velocity dispersion as a function of their dereddened color
known from the Hipparcos data. Given the age estimates for the stars under
consideration from the TRILEGAL model and the Geneva-Copenhagen survey, these
variations may be considered as variations as a function of the age. A
comparison of our results with the results of other studies of the stellar
kinematics near the Sun has shown that selection and reddening underestimation
explain almost completely the discrepancies between the results. The
dispersions and mean velocities from the results of reliable studies fit into a
$\pm2$ km/s corridor, while the ratios $\sigma_V/\sigma_U$ and
$\sigma_W/\sigma_U$ fit into $\pm0.05$. Based on all reliable studies in the
range $-0.1<(B_T-V_T)_0<0.5$, i.e., for an age from 0.23 to 2.4 Gyr, we have
found that the stellar velocity dispersions in km/s are proportional to the age
in Gyr raised to the power $\beta_U=0.33$, $\beta_V=0.285$, and $\beta_W=0.37$.
| astro-ph.GA astro-ph.SR | parallaxes with an accuracy better than 10 and proper motions from the gaia dr1 tgas catalogue radial velocities from the pcrv tycho2 photometry parsec mist yapsi basti isochrones and the most accurate reddening and extinction estimates have been used to analyze the kinematics of 9543 thindisk bf stars as a function of their dereddened color these stars are located on the hertzsprungrussell diagram relative to the isochrones with a high accuracy this has allowed me to conclude that the reddening and extinction were significantly underestimated in some kinematic studies of other authors the median accuracy of the velocity components u v w in this study is 17 kms although outside the range 01b_tv_t_005 the kinematic characteristics are noticeably biased due to the incompleteness of the sample we have confirmed the variations in the mean velocity of stars relative to the sun and the stellar velocity dispersion as a function of their dereddened color known from the hipparcos data given the age estimates for the stars under consideration from the trilegal model and the genevacopenhagen survey these variations may be considered as variations as a function of the age a comparison of our results with the results of other studies of the stellar kinematics near the sun has shown that selection and reddening underestimation explain almost completely the discrepancies between the results the dispersions and mean velocities from the results of reliable studies fit into a pm2 kms corridor while the ratios sigma_vsigma_u and sigma_wsigma_u fit into pm005 based on all reliable studies in the range 01b_tv_t_005 ie for an age from 023 to 24 gyr we have found that the stellar velocity dispersions in kms are proportional to the age in gyr raised to the power beta_u033 beta_v0285 and beta_w037 | [['parallaxes', 'with', 'an', 'accuracy', 'better', 'than', '10', 'and', 'proper', 'motions', 'from', 'the', 'gaia', 'dr1', 'tgas', 'catalogue', 'radial', 'velocities', 'from', 'the', 'pcrv', 'tycho2', 'photometry', 'parsec', 'mist', 'yapsi', 'basti', 'isochrones', 'and', 'the', 'most', 'accurate', 'reddening', 'and', 'extinction', 'estimates', 'have', 'been', 'used', 'to', 'analyze', 'the', 'kinematics', 'of', '9543', 'thindisk', 'bf', 'stars', 'as', 'a', 'function', 'of', 'their', 'dereddened', 'color', 'these', 'stars', 'are', 'located', 'on', 'the', 'hertzsprungrussell', 'diagram', 'relative', 'to', 'the', 'isochrones', 'with', 'a', 'high', 'accuracy', 'this', 'has', 'allowed', 'me', 'to', 'conclude', 'that', 'the', 'reddening', 'and', 'extinction', 'were', 'significantly', 'underestimated', 'in', 'some', 'kinematic', 'studies', 'of', 'other', 'authors', 'the', 'median', 'accuracy', 'of', 'the', 'velocity', 'components', 'u', 'v', 'w', 'in', 'this', 'study', 'is', '17', 'kms', 'although', 'outside', 'the', 'range', '01b_tv_t_005', 'the', 'kinematic', 'characteristics', 'are', 'noticeably', 'biased', 'due', 'to', 'the', 'incompleteness', 'of', 'the', 'sample', 'we', 'have', 'confirmed', 'the', 'variations', 'in', 'the', 'mean', 'velocity', 'of', 'stars', 'relative', 'to', 'the', 'sun', 'and', 'the', 'stellar', 'velocity', 'dispersion', 'as', 'a', 'function', 'of', 'their', 'dereddened', 'color', 'known', 'from', 'the', 'hipparcos', 'data', 'given', 'the', 'age', 'estimates', 'for', 'the', 'stars', 'under', 'consideration', 'from', 'the', 'trilegal', 'model', 'and', 'the', 'genevacopenhagen', 'survey', 'these', 'variations', 'may', 'be', 'considered', 'as', 'variations', 'as', 'a', 'function', 'of', 'the', 'age', 'a', 'comparison', 'of', 'our', 'results', 'with', 'the', 'results', 'of', 'other', 'studies', 'of', 'the', 'stellar', 'kinematics', 'near', 'the', 'sun', 'has', 'shown', 'that', 'selection', 'and', 'reddening', 'underestimation', 'explain', 'almost', 'completely', 'the', 'discrepancies', 'between', 'the', 'results', 'the', 'dispersions', 'and', 'mean', 'velocities', 'from', 'the', 'results', 'of', 'reliable', 'studies', 'fit', 'into', 'a', 'pm2', 'kms', 'corridor', 'while', 'the', 'ratios', 'sigma_vsigma_u', 'and', 'sigma_wsigma_u', 'fit', 'into', 'pm005', 'based', 'on', 'all', 'reliable', 'studies', 'in', 'the', 'range', '01b_tv_t_005', 'ie', 'for', 'an', 'age', 'from', '023', 'to', '24', 'gyr', 'we', 'have', 'found', 'that', 'the', 'stellar', 'velocity', 'dispersions', 'in', 'kms', 'are', 'proportional', 'to', 'the', 'age', 'in', 'gyr', 'raised', 'to', 'the', 'power', 'beta_u033', 'beta_v0285', 'and', 'beta_w037']] | [-0.004613389737795855, 0.07846178021210223, -0.11706673910213769, 0.06793233110613688, -0.08372408680250527, -0.0287896999564599, 0.08481305733185367, 0.44166178687173924, -0.18533738558123242, -0.38425113844462266, 0.05040867467128842, -0.3035862162719689, 0.008439437768251543, 0.21790527641481366, -0.11501922851783375, 0.008037595919900718, 0.1088473185436541, -0.015331547664688297, -0.07383306873704037, -0.26563246144739333, 0.2555310195311904, 0.010759204642479899, 0.17674505981390404, -0.03482100345697713, 0.056792832098976696, -0.10624695143356598, -0.10970644338358142, 0.025188620818137768, -0.1975496329303778, 0.08874758175315178, 0.19356068002197788, 0.09748399791694705, 0.23205810335864852, -0.2714048195752005, -0.1927165075920155, 0.03735057531419853, 0.19343056981976497, 0.060879172097871484, -0.025767205631471907, -0.29428143817259156, 0.08414509276159331, -0.17012765522708898, -0.17921903290339863, 0.04973368082543127, 0.0834988843384002, 0.060899341679186376, -0.22428849812032997, 0.15628412851680917, -0.0050213959497546375, 0.14876811055738715, -0.1481235994986901, -0.20474331914512833, -0.11044919379727758, 0.15293490511125846, 0.04002752609372231, 0.08378773206159551, 0.11289127275895354, -0.13701958384555044, -0.017572762362632742, 0.43626943955355335, -0.08820089090208262, -0.0862001950498408, 0.1891584765087341, -0.172804935589354, -0.11364467674128476, 0.0981807181112383, 0.16349732209223283, 0.08928783102170892, -0.18690420101842725, -0.006294929295774995, -0.005458259827155672, 0.18861395890622, 0.04974320429314951, 0.031019311852451468, 0.2363064304899267, 0.06424430062958289, 0.03260010534310349, 0.013975079914122085, -0.2397761402182727, -0.059042706421550205, -0.2420652966477423, -0.07689881699300546, -0.09044051824119533, 0.042995143058696686, -0.16754892443478497, -0.12991929734418822, 0.34634092340285194, 0.178250433193068, 0.23697703724405664, 0.07335387860772423, 0.2995530672151674, 0.09934093900480714, 0.12393821643429323, 0.12494784639984317, 0.32135334716419917, 0.20771424771445593, 0.08168313182598556, -0.2384662982650285, 0.10753464749128833, 0.001752221046842005] |
1,803.04056 | Pressure-driven collapse of the relativistic electronic ground state in
a honeycomb iridate | The electronic ground state in many iridate materials is described by a
complex wave-function in which spin and orbital angular momenta are entangled
due to relativistic spin-orbit coupling (SOC). Such a localized electronic
state carries an effective total angular momentum of $J_{eff}=1/2$. In
materials with an edge-sharing octahedral crystal structure, such as the
honeycomb iridates Li2IrO3 and Na2IrO3, these $J_{eff}=1/2$ moments are
expected to be coupled through a special bond-dependent magnetic interaction,
which is a necessary condition for the realization of a Kitaev quantum spin
liquid. However, this relativistic electron picture is challenged by an
alternate description, in which itinerant electrons are confined to a
benzene-like hexagon, keeping the system insulating despite the delocalized
nature of the electrons. In this quasi-molecular orbital (QMO) picture, the
honeycomb iridates are an unlikely choice for a Kitaev spin liquid. Here we
show that the honeycomb iridate Li2IrO3 is best described by a $J_{eff}=1/2$
state at ambient pressure, but crosses over into a QMO state under the
application of small (~ 0.1 GPa) hydrostatic pressure. This result illustrates
that the physics of iridates is extremely rich due to a delicate balance
between electronic bandwidth, spin-orbit coupling, crystal field, and electron
correlation.
| cond-mat.str-el | the electronic ground state in many iridate materials is described by a complex wavefunction in which spin and orbital angular momenta are entangled due to relativistic spinorbit coupling soc such a localized electronic state carries an effective total angular momentum of j_eff12 in materials with an edgesharing octahedral crystal structure such as the honeycomb iridates li2iro3 and na2iro3 these j_eff12 moments are expected to be coupled through a special bonddependent magnetic interaction which is a necessary condition for the realization of a kitaev quantum spin liquid however this relativistic electron picture is challenged by an alternate description in which itinerant electrons are confined to a benzenelike hexagon keeping the system insulating despite the delocalized nature of the electrons in this quasimolecular orbital qmo picture the honeycomb iridates are an unlikely choice for a kitaev spin liquid here we show that the honeycomb iridate li2iro3 is best described by a j_eff12 state at ambient pressure but crosses over into a qmo state under the application of small 01 gpa hydrostatic pressure this result illustrates that the physics of iridates is extremely rich due to a delicate balance between electronic bandwidth spinorbit coupling crystal field and electron correlation | [['the', 'electronic', 'ground', 'state', 'in', 'many', 'iridate', 'materials', 'is', 'described', 'by', 'a', 'complex', 'wavefunction', 'in', 'which', 'spin', 'and', 'orbital', 'angular', 'momenta', 'are', 'entangled', 'due', 'to', 'relativistic', 'spinorbit', 'coupling', 'soc', 'such', 'a', 'localized', 'electronic', 'state', 'carries', 'an', 'effective', 'total', 'angular', 'momentum', 'of', 'j_eff12', 'in', 'materials', 'with', 'an', 'edgesharing', 'octahedral', 'crystal', 'structure', 'such', 'as', 'the', 'honeycomb', 'iridates', 'li2iro3', 'and', 'na2iro3', 'these', 'j_eff12', 'moments', 'are', 'expected', 'to', 'be', 'coupled', 'through', 'a', 'special', 'bonddependent', 'magnetic', 'interaction', 'which', 'is', 'a', 'necessary', 'condition', 'for', 'the', 'realization', 'of', 'a', 'kitaev', 'quantum', 'spin', 'liquid', 'however', 'this', 'relativistic', 'electron', 'picture', 'is', 'challenged', 'by', 'an', 'alternate', 'description', 'in', 'which', 'itinerant', 'electrons', 'are', 'confined', 'to', 'a', 'benzenelike', 'hexagon', 'keeping', 'the', 'system', 'insulating', 'despite', 'the', 'delocalized', 'nature', 'of', 'the', 'electrons', 'in', 'this', 'quasimolecular', 'orbital', 'qmo', 'picture', 'the', 'honeycomb', 'iridates', 'are', 'an', 'unlikely', 'choice', 'for', 'a', 'kitaev', 'spin', 'liquid', 'here', 'we', 'show', 'that', 'the', 'honeycomb', 'iridate', 'li2iro3', 'is', 'best', 'described', 'by', 'a', 'j_eff12', 'state', 'at', 'ambient', 'pressure', 'but', 'crosses', 'over', 'into', 'a', 'qmo', 'state', 'under', 'the', 'application', 'of', 'small', '01', 'gpa', 'hydrostatic', 'pressure', 'this', 'result', 'illustrates', 'that', 'the', 'physics', 'of', 'iridates', 'is', 'extremely', 'rich', 'due', 'to', 'a', 'delicate', 'balance', 'between', 'electronic', 'bandwidth', 'spinorbit', 'coupling', 'crystal', 'field', 'and', 'electron', 'correlation']] | [-0.20765925221007356, 0.25442684546608374, -0.02022438748426051, 0.055527795715571135, -0.059030275389181486, -0.1573936623160024, 0.05152293521440493, 0.3931459481400267, -0.2616945149932931, -0.27364426890236077, -0.025662819040601845, -0.30278597933796175, -0.10287278465931399, 0.13421296853838222, 0.06250966944772161, -0.020017508217798814, -0.005488118313595044, -0.0641313945430293, -0.11992945708869006, -0.19287253202922755, 0.26912906585494056, 0.06442828180965711, 0.27077939850040617, 0.09079602590318987, 0.057515599795769215, 0.024172527842076342, 0.19767296923875657, 0.004529413881198484, -0.12457732407992993, 0.057378559762954105, 0.25963010835224926, -0.12691142583712556, 0.2020182707988448, -0.4426601355306196, -0.1740436749834808, -0.029382957351080388, 0.10570141510373904, 0.16897763521469922, -0.06466964675987862, -0.3086954067432683, -0.02495646435406287, -0.21842762610723018, -0.15720939357071279, -0.15595074686250288, -0.01640267741607445, -0.03491005009575984, -0.24251310861989028, 0.0885096490304449, 0.09455969587933007, 0.08941724485413609, -0.1162003467622099, -0.11508162973427252, -0.10400935799377609, 0.005749637748076752, 0.056527724632712995, 0.10515715802867649, 0.11214625730169747, -0.133736305370599, -0.11546487722406877, 0.43947990044799384, 0.014929894195175824, -0.13565217631712215, 0.17683391003662777, -0.1652480265920345, -0.0807765689613155, 0.1758423791277669, 0.08426483262229915, 0.04404041198633459, -0.1325989551759059, 0.11720939808768964, -0.07230606643282286, 0.18775724506834807, -0.013214530572960419, 0.12152728910690971, 0.3105388954388719, 0.18625376344781977, 0.055766613350656094, 0.12718760663565076, -0.08078229620521746, -0.10828616380411181, -0.19005050375221336, -0.18542438470823833, -0.2887746061885026, 0.11448889686809187, -0.058179119968687645, -0.1937828632546779, 0.39671038558744653, 0.10478081682706442, 0.14941579580535086, -0.14040876984684159, 0.2090127232570049, 0.06550892190805789, 0.02404349861067853, 0.04861931761130406, 0.26282385332576397, 0.18723638336962964, 0.084821072532243, -0.28840503844370763, 0.06440395301466864, 0.03659252177838388] |
1,803.04057 | Learning Partially Structured Environmental Dynamics for Marine Robotic
Navigation | We investigate the scenario that a robot needs to reach a designated goal
after taking a sequence of appropriate actions in a non-static environment that
is partially structured. One application example is to control a marine vehicle
to move in the ocean. The ocean environment is dynamic and oftentimes the ocean
waves result in strong disturbances that can disturb the vehicle's motion.
Modeling such dynamic environment is non-trivial, and integrating such model in
the robotic motion control is particularly difficult. Fortunately, the ocean
currents usually form some local patterns (e.g. vortex) and thus the
environment is partially structured. The historically observed data can be used
to train the robot to learn to interact with the ocean tidal disturbances. In
this paper we propose a method that applies the deep reinforcement learning
framework to learn such partially structured complex disturbances. Our results
show that, by training the robot under artificial and real ocean disturbances,
the robot is able to successfully act in complex and spatiotemporal
environments.
| cs.RO | we investigate the scenario that a robot needs to reach a designated goal after taking a sequence of appropriate actions in a nonstatic environment that is partially structured one application example is to control a marine vehicle to move in the ocean the ocean environment is dynamic and oftentimes the ocean waves result in strong disturbances that can disturb the vehicles motion modeling such dynamic environment is nontrivial and integrating such model in the robotic motion control is particularly difficult fortunately the ocean currents usually form some local patterns eg vortex and thus the environment is partially structured the historically observed data can be used to train the robot to learn to interact with the ocean tidal disturbances in this paper we propose a method that applies the deep reinforcement learning framework to learn such partially structured complex disturbances our results show that by training the robot under artificial and real ocean disturbances the robot is able to successfully act in complex and spatiotemporal environments | [['we', 'investigate', 'the', 'scenario', 'that', 'a', 'robot', 'needs', 'to', 'reach', 'a', 'designated', 'goal', 'after', 'taking', 'a', 'sequence', 'of', 'appropriate', 'actions', 'in', 'a', 'nonstatic', 'environment', 'that', 'is', 'partially', 'structured', 'one', 'application', 'example', 'is', 'to', 'control', 'a', 'marine', 'vehicle', 'to', 'move', 'in', 'the', 'ocean', 'the', 'ocean', 'environment', 'is', 'dynamic', 'and', 'oftentimes', 'the', 'ocean', 'waves', 'result', 'in', 'strong', 'disturbances', 'that', 'can', 'disturb', 'the', 'vehicles', 'motion', 'modeling', 'such', 'dynamic', 'environment', 'is', 'nontrivial', 'and', 'integrating', 'such', 'model', 'in', 'the', 'robotic', 'motion', 'control', 'is', 'particularly', 'difficult', 'fortunately', 'the', 'ocean', 'currents', 'usually', 'form', 'some', 'local', 'patterns', 'eg', 'vortex', 'and', 'thus', 'the', 'environment', 'is', 'partially', 'structured', 'the', 'historically', 'observed', 'data', 'can', 'be', 'used', 'to', 'train', 'the', 'robot', 'to', 'learn', 'to', 'interact', 'with', 'the', 'ocean', 'tidal', 'disturbances', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'that', 'applies', 'the', 'deep', 'reinforcement', 'learning', 'framework', 'to', 'learn', 'such', 'partially', 'structured', 'complex', 'disturbances', 'our', 'results', 'show', 'that', 'by', 'training', 'the', 'robot', 'under', 'artificial', 'and', 'real', 'ocean', 'disturbances', 'the', 'robot', 'is', 'able', 'to', 'successfully', 'act', 'in', 'complex', 'and', 'spatiotemporal', 'environments']] | [-0.11786452925792246, 0.14024017273984624, -0.06577503186170802, 0.07795584154823287, -0.1534104832758506, -0.09243566238067367, 0.0014543363965596214, 0.42931122743722167, -0.30133756333115425, -0.33003555049724653, 0.1272865630178289, -0.20996329589944446, -0.22731666034369757, 0.17553521359311133, -0.14519630069703315, 0.057590856031288926, 0.09077382980083877, 0.024498010296939, 0.050626799603924154, -0.19631551579628703, 0.27721817752797945, 0.003311081830179319, 0.24834868826649406, -0.011719839261125096, 0.1448606824311851, -0.01844325460437121, 0.041927887429130464, 0.017252587188373913, -0.0110219667831905, 0.10066450907792332, 0.32167693872117636, 0.1565530952884618, 0.2960463899639294, -0.5000463884323836, -0.26318271962192025, 0.09121519123683824, 0.10316993686234734, 0.11911416174561688, -0.022299720269317428, -0.3551601920093438, 0.06934414561273473, -0.17689454170070928, -0.1333727270505871, -0.08381493827045867, -0.010327775547788902, -0.0013250197915388553, -0.2999813753286038, -0.011678551837350382, 0.07161860113794154, 0.043264062742166445, -0.10865731072527442, 0.00018003238082835168, -0.029966929145721775, 0.20834033791483803, 0.03284861631762011, 0.050684923829623696, 0.2048674471619906, -0.1650200445797633, -0.05401163414600446, 0.39867874297002953, -0.05114521017354546, -0.24659351384634096, 0.26205835434975044, -0.08979417152392367, -0.09867820614158655, 0.1247116950675704, 0.2732797665577946, 0.09969142897929432, -0.18559274226427078, 0.019385656805807783, -0.05912038454165061, 0.15574652601146335, 0.027657425228619213, -0.06967792329237317, 0.21688670916906136, 0.22154141822829843, 0.12064840359556855, 0.12321683557097321, -0.09248439538659471, -0.11580547365980844, -0.2186815730380741, -0.09965134097234996, -0.11806768248083466, -0.004924492817372084, -0.0365614561641864, -0.13727012145082523, 0.3568526052079643, 0.22304853611823283, 0.18942520960611572, 0.0288151807109402, 0.35944779020183804, 0.055161246931829465, 0.06329222755845297, 0.11691713683222506, 0.21482596209106938, 0.051504301735566874, 0.1495605284743237, -0.2113186578717873, 0.13001733324702153, -0.021476369376548312] |
1,803.04058 | Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time
Cache-Memory Tradeoff | An emerging trend of next generation communication systems is to provide
network edges with additional capabilities such as storage resources in the
form of caches to reduce file delivery latency. To investigate this aspect, we
study the fundamental limits of a cache-aided broadcast-relay wireless network
consisting of one central base station, $M$ cache-equipped transceivers and $K$
receivers from a latency-centric perspective. We use the normalized delivery
time (NDT) to capture the per-bit latency for the worst-case file request
pattern, normalized with respect to a reference interference-free system with
unlimited transceiver cache capabilities. The objective is to design the
schemes for cache placement and file delivery in order to minimize the NDT. To
this end, we establish a novel converse and two types of achievability schemes
applicable to both time-variant and invariant channels. The first scheme is a
general one-shot scheme for any $M$ and $K$ that synergistically exploits both
multicasting (coded) caching and distributed zero-forcing opportunities. We
show that the proposed one-shot scheme (i) attains gains attributed to both
individual and collective transceiver caches (ii) is NDT-optimal for various
parameter settings, particularly at higher cache sizes. The second scheme, on
the other hand, designs beamformers to facilitate both subspace interference
alignment and zero-forcing at lower cache sizes. Exploiting both schemes, we
are able to characterize for various special cases of $M$ and $K$ which satisfy
$K+M\leq 4$ the optimal tradeoff between cache storage and latency. The
tradeoff illustrates that the NDT is the preferred choice to capture the
latency of a system rather than the commonly used sum degrees-of-freedom (DoF).
In fact, our optimal tradeoff refutes the popular belief that increasing cache
sizes translates to increasing the achievable sum DoF.
| cs.IT math.IT | an emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency to investigate this aspect we study the fundamental limits of a cacheaided broadcastrelay wireless network consisting of one central base station m cacheequipped transceivers and k receivers from a latencycentric perspective we use the normalized delivery time ndt to capture the perbit latency for the worstcase file request pattern normalized with respect to a reference interferencefree system with unlimited transceiver cache capabilities the objective is to design the schemes for cache placement and file delivery in order to minimize the ndt to this end we establish a novel converse and two types of achievability schemes applicable to both timevariant and invariant channels the first scheme is a general oneshot scheme for any m and k that synergistically exploits both multicasting coded caching and distributed zeroforcing opportunities we show that the proposed oneshot scheme i attains gains attributed to both individual and collective transceiver caches ii is ndtoptimal for various parameter settings particularly at higher cache sizes the second scheme on the other hand designs beamformers to facilitate both subspace interference alignment and zeroforcing at lower cache sizes exploiting both schemes we are able to characterize for various special cases of m and k which satisfy kmleq 4 the optimal tradeoff between cache storage and latency the tradeoff illustrates that the ndt is the preferred choice to capture the latency of a system rather than the commonly used sum degreesoffreedom dof in fact our optimal tradeoff refutes the popular belief that increasing cache sizes translates to increasing the achievable sum dof | [['an', 'emerging', 'trend', 'of', 'next', 'generation', 'communication', 'systems', 'is', 'to', 'provide', 'network', 'edges', 'with', 'additional', 'capabilities', 'such', 'as', 'storage', 'resources', 'in', 'the', 'form', 'of', 'caches', 'to', 'reduce', 'file', 'delivery', 'latency', 'to', 'investigate', 'this', 'aspect', 'we', 'study', 'the', 'fundamental', 'limits', 'of', 'a', 'cacheaided', 'broadcastrelay', 'wireless', 'network', 'consisting', 'of', 'one', 'central', 'base', 'station', 'm', 'cacheequipped', 'transceivers', 'and', 'k', 'receivers', 'from', 'a', 'latencycentric', 'perspective', 'we', 'use', 'the', 'normalized', 'delivery', 'time', 'ndt', 'to', 'capture', 'the', 'perbit', 'latency', 'for', 'the', 'worstcase', 'file', 'request', 'pattern', 'normalized', 'with', 'respect', 'to', 'a', 'reference', 'interferencefree', 'system', 'with', 'unlimited', 'transceiver', 'cache', 'capabilities', 'the', 'objective', 'is', 'to', 'design', 'the', 'schemes', 'for', 'cache', 'placement', 'and', 'file', 'delivery', 'in', 'order', 'to', 'minimize', 'the', 'ndt', 'to', 'this', 'end', 'we', 'establish', 'a', 'novel', 'converse', 'and', 'two', 'types', 'of', 'achievability', 'schemes', 'applicable', 'to', 'both', 'timevariant', 'and', 'invariant', 'channels', 'the', 'first', 'scheme', 'is', 'a', 'general', 'oneshot', 'scheme', 'for', 'any', 'm', 'and', 'k', 'that', 'synergistically', 'exploits', 'both', 'multicasting', 'coded', 'caching', 'and', 'distributed', 'zeroforcing', 'opportunities', 'we', 'show', 'that', 'the', 'proposed', 'oneshot', 'scheme', 'i', 'attains', 'gains', 'attributed', 'to', 'both', 'individual', 'and', 'collective', 'transceiver', 'caches', 'ii', 'is', 'ndtoptimal', 'for', 'various', 'parameter', 'settings', 'particularly', 'at', 'higher', 'cache', 'sizes', 'the', 'second', 'scheme', 'on', 'the', 'other', 'hand', 'designs', 'beamformers', 'to', 'facilitate', 'both', 'subspace', 'interference', 'alignment', 'and', 'zeroforcing', 'at', 'lower', 'cache', 'sizes', 'exploiting', 'both', 'schemes', 'we', 'are', 'able', 'to', 'characterize', 'for', 'various', 'special', 'cases', 'of', 'm', 'and', 'k', 'which', 'satisfy', 'kmleq', '4', 'the', 'optimal', 'tradeoff', 'between', 'cache', 'storage', 'and', 'latency', 'the', 'tradeoff', 'illustrates', 'that', 'the', 'ndt', 'is', 'the', 'preferred', 'choice', 'to', 'capture', 'the', 'latency', 'of', 'a', 'system', 'rather', 'than', 'the', 'commonly', 'used', 'sum', 'degreesoffreedom', 'dof', 'in', 'fact', 'our', 'optimal', 'tradeoff', 'refutes', 'the', 'popular', 'belief', 'that', 'increasing', 'cache', 'sizes', 'translates', 'to', 'increasing', 'the', 'achievable', 'sum', 'dof']] | [-0.2589559341712165, 0.003791944690858158, -0.01763458162706962, 0.03752511294714423, -0.06370422913501937, -0.25231614108230893, 0.14980582672961915, 0.38599336228380315, -0.2800577665233596, -0.2986673671384124, 0.08174045886233007, -0.24864170173427638, -0.13225656151671042, 0.13015063172863736, -0.14361759629134063, 0.06811662877657745, 0.013706440603809236, 0.027794234509175314, -0.050300442944481806, -0.2920656413972217, 0.2740685869943813, 0.1126069224174905, 0.3837488376558088, 0.045125391759755586, 0.07915085106677704, 0.02163327626528875, -0.010248644313048035, -0.04102599517297002, -0.11755579412906857, 0.11386173899308946, 0.3423834977262794, 0.2079664538212442, 0.25582178688789015, -0.40304431099471427, -0.1847765300349205, 0.08444306962866262, 0.16258680034871045, 0.051436349482814905, -0.015049882049307147, -0.22070490721639968, 0.1486963085929039, -0.2165600403870302, -0.015290512616257015, -0.006242563386791949, -0.04606568746573607, 0.05808611398666642, -0.35932471341178784, -0.04290298749223727, 0.010797695533884186, 0.003384295320004332, -0.030344982236194952, -0.12224552621302805, 0.03876520858796166, 0.17201038715496605, 0.006295946866283092, -0.004920354430402944, 0.10143534646921443, -0.07623087514691028, -0.1076387017647059, 0.39375737078216516, -0.003937428744131676, -0.22109821494903228, 0.14667348915345887, -0.0791150412899978, -0.09336338038037015, 0.15319188742725875, 0.2515438077502328, 0.06637141810857403, -0.15477017380243582, 0.00648110117110015, -0.00924695384137587, 0.20426373892939456, 0.11331696067216451, 0.18248288009735328, 0.11787728319051775, 0.21567372986108815, 0.1760465717181838, 0.15169145663879416, -0.1034703959297161, -0.12127248847772529, -0.23097228414208207, -0.15678037503121167, -0.20334259090901574, -0.03538367307239058, -0.13241115284582394, -0.035543403554734565, 0.31353525448147257, 0.13218225256214086, 0.12837841552213208, 0.15718264236967514, 0.40256772627015497, 0.0676407284143535, 0.09100920827255296, 0.1683323058490675, 0.14927720742655262, 0.07733393555570715, 0.1374990823544669, -0.24138451609084224, 0.07132982209629694, 0.018923965887846627] |
1,803.04059 | Delivery Time Minimization in Cache-Assisted Broadcast-Relay Wireless
Networks with Imperfect CSI | An emerging trend of next generation communication systems is to provide
network edges with additional capabilities such as storage resources in the
form of caches to reduce file delivery latency. To investigate the impact of
this technique on latency, we study the delivery time of a cache-aided
broadcast-relay wireless network consisting of one central base station, $M$
cache-equipped transceivers and $K$ receivers under finite precision channel
state information (CSI). We use the normalized delivery time (NDT) to capture
the worst-case per-bit latency in a file delivery. Lower and upper bounds on
the NDT are derived to understand the influence of $K,M$, cache capacity and
channel quality on the NDT. In particular, regimes of NDT-optimality are
identified and discussed.
| cs.IT math.IT | an emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency to investigate the impact of this technique on latency we study the delivery time of a cacheaided broadcastrelay wireless network consisting of one central base station m cacheequipped transceivers and k receivers under finite precision channel state information csi we use the normalized delivery time ndt to capture the worstcase perbit latency in a file delivery lower and upper bounds on the ndt are derived to understand the influence of km cache capacity and channel quality on the ndt in particular regimes of ndtoptimality are identified and discussed | [['an', 'emerging', 'trend', 'of', 'next', 'generation', 'communication', 'systems', 'is', 'to', 'provide', 'network', 'edges', 'with', 'additional', 'capabilities', 'such', 'as', 'storage', 'resources', 'in', 'the', 'form', 'of', 'caches', 'to', 'reduce', 'file', 'delivery', 'latency', 'to', 'investigate', 'the', 'impact', 'of', 'this', 'technique', 'on', 'latency', 'we', 'study', 'the', 'delivery', 'time', 'of', 'a', 'cacheaided', 'broadcastrelay', 'wireless', 'network', 'consisting', 'of', 'one', 'central', 'base', 'station', 'm', 'cacheequipped', 'transceivers', 'and', 'k', 'receivers', 'under', 'finite', 'precision', 'channel', 'state', 'information', 'csi', 'we', 'use', 'the', 'normalized', 'delivery', 'time', 'ndt', 'to', 'capture', 'the', 'worstcase', 'perbit', 'latency', 'in', 'a', 'file', 'delivery', 'lower', 'and', 'upper', 'bounds', 'on', 'the', 'ndt', 'are', 'derived', 'to', 'understand', 'the', 'influence', 'of', 'km', 'cache', 'capacity', 'and', 'channel', 'quality', 'on', 'the', 'ndt', 'in', 'particular', 'regimes', 'of', 'ndtoptimality', 'are', 'identified', 'and', 'discussed']] | [-0.2970624974506915, 0.03014858159085867, -0.00023639462012638393, 0.016210967754451636, -0.018684988316053, -0.19827093690251693, 0.16027253803311506, 0.37025300929975563, -0.2647921093699769, -0.3197832892481715, 0.12519673149909377, -0.27399017532061565, -0.09229002901528062, 0.13653744713196325, -0.13207824849404204, 0.06797002448151127, 0.02839992601058419, 0.09017468655196369, -0.023247459137207296, -0.2991101272388274, 0.24707263886419117, 0.13518415575321668, 0.36347986759347284, 0.08432315407533787, 0.03153556550287793, 0.01390743449043769, -0.020580274762354918, -0.0798735576025091, -0.15816796442063955, 0.10508857617695999, 0.3285649010640943, 0.2148572624119747, 0.2235434198847566, -0.4774674522793955, -0.23211306500304332, 0.06586448757304277, 0.1272889975633504, 0.00701598572329833, -0.025745768409469124, -0.24421242551289052, 0.11722629849647737, -0.2198306565375951, -0.02116096706694772, 0.015728842992431078, -0.02977874315280117, 0.07409260161101627, -0.29634518868839127, -0.029052331154115308, -0.03952744982402342, 0.023706686298679322, -0.045980561604229815, -0.10428103207586667, 0.016606210054368034, 0.20594700482777423, 0.005634019607538755, -0.009093060224858295, 0.12416034476765885, -0.12227268919595477, -0.062091335952759556, 0.3804862546837992, -0.05130892996795666, -0.18196129483672288, 0.12040522129923646, -0.09000111879924169, -0.10088323163760142, 0.14709297373381436, 0.3298934878638157, 0.04128460771539527, -0.18055673090056476, 0.007738479570302571, 0.0288378154922627, 0.19629446514205545, 0.11840511561156465, 0.20132699908497623, 0.12445280086408314, 0.26092879415855896, 0.15189471759666234, 0.16399968657483402, -0.12906801278113872, -0.10663190617576306, -0.21538075033782256, -0.17895835092386755, -0.2006253242556356, 0.0030845559926496614, -0.10492129563344006, -0.06489772408400686, 0.32352257552198493, 0.11911632033845043, 0.1328527904354418, 0.1342491048376243, 0.40251741259016544, 0.074727292983538, 0.07135755229645814, 0.15699233990321812, 0.14309477322121972, 0.09894092094439727, 0.16121377321517366, -0.2208346935808977, 0.12432877126778676, 0.007870168017191637] |
1,803.0406 | Automorphisms of the shift: Lyapunov exponents, entropy, and the
dimension representation | Let $(X_{A},\sigma_{A})$ be a shift of finite type and
$\text{Aut}(\sigma_{A})$ its corresponding automorphism group. Associated to
$\phi \in \text{Aut}(\sigma_{A})$ are certain Lyapunov exponents
$\alpha^{-}(\phi), \alpha^{+}(\phi)$ which describe asymptotic behavior of the
sequence of coding ranges of $\phi^{n}$. We give lower bounds on
$\alpha^{-}(\phi), \alpha^{+}(\phi)$ in terms of the spectral radius of the
corresponding action of $\phi$ on the dimension group associated to
$(X_{A},\sigma_{A})$. We also give lower bounds on the topological entropy
$h_{top}(\phi)$ in terms of a distinguished part of the spectrum of the action
of $\phi$ on the dimension group, but show that in general $h_{top}(\phi)$ is
not bounded below by the logarithm of the spectral radius of the action of
$\phi$ on the dimension group.
| math.DS | let x_asigma_a be a shift of finite type and textautsigma_a its corresponding automorphism group associated to phi in textautsigma_a are certain lyapunov exponents alphaphi alphaphi which describe asymptotic behavior of the sequence of coding ranges of phin we give lower bounds on alphaphi alphaphi in terms of the spectral radius of the corresponding action of phi on the dimension group associated to x_asigma_a we also give lower bounds on the topological entropy h_topphi in terms of a distinguished part of the spectrum of the action of phi on the dimension group but show that in general h_topphi is not bounded below by the logarithm of the spectral radius of the action of phi on the dimension group | [['let', 'x_asigma_a', 'be', 'a', 'shift', 'of', 'finite', 'type', 'and', 'textautsigma_a', 'its', 'corresponding', 'automorphism', 'group', 'associated', 'to', 'phi', 'in', 'textautsigma_a', 'are', 'certain', 'lyapunov', 'exponents', 'alphaphi', 'alphaphi', 'which', 'describe', 'asymptotic', 'behavior', 'of', 'the', 'sequence', 'of', 'coding', 'ranges', 'of', 'phin', 'we', 'give', 'lower', 'bounds', 'on', 'alphaphi', 'alphaphi', 'in', 'terms', 'of', 'the', 'spectral', 'radius', 'of', 'the', 'corresponding', 'action', 'of', 'phi', 'on', 'the', 'dimension', 'group', 'associated', 'to', 'x_asigma_a', 'we', 'also', 'give', 'lower', 'bounds', 'on', 'the', 'topological', 'entropy', 'h_topphi', 'in', 'terms', 'of', 'a', 'distinguished', 'part', 'of', 'the', 'spectrum', 'of', 'the', 'action', 'of', 'phi', 'on', 'the', 'dimension', 'group', 'but', 'show', 'that', 'in', 'general', 'h_topphi', 'is', 'not', 'bounded', 'below', 'by', 'the', 'logarithm', 'of', 'the', 'spectral', 'radius', 'of', 'the', 'action', 'of', 'phi', 'on', 'the', 'dimension', 'group']] | [-0.1816991396903563, 0.13512022090062037, -0.12255902764741826, 0.020483201724040296, -0.034708543775388886, -0.08940391424441693, 0.03125216007599426, 0.2999757996572808, -0.26533522756885636, -0.23271154780435352, 0.12033630271681246, -0.2601961929359333, -0.12310398653545211, 0.22356991506123966, -0.08735940948260569, -0.01832205991299856, -0.015262247899761506, 0.2100760948852496, -0.11073498346068097, -0.22523400203975957, 0.37572397093857285, -0.0055913128560425435, 0.20628237035908464, 0.08403190557738824, 0.0563775434414238, -0.03147091290839346, -0.0044730568420043035, -0.0005330071862852942, -0.18684263558950392, 0.14233909136269537, 0.17808681187442446, 0.08580356771414853, 0.19578221804602483, -0.3167683086893727, -0.16243137770324154, 0.16542429592361493, 0.1413509656914172, -0.03136384578326931, 0.0029757707740336787, -0.28146692441232435, 0.1516706073549535, -0.15969493949221267, -0.1304772545385743, -0.03636319904827175, 0.04915576439713482, 0.01074032124288512, -0.2369101196486272, 0.07443381961104378, 0.07500370605889939, 0.09403188180475108, -0.062100076643066, -0.12940703240013063, -0.04365230167070321, 0.1204726880517236, 0.04304667013961064, 0.0200418436949232, 0.1043528692376495, -0.12665992619292563, -0.07858571293969861, 0.35353941447719667, -0.11127852738332168, -0.2068616274200314, 0.13038550859597403, -0.20542931638707498, -0.1218165087975166, 0.13463908378282083, 0.19564087133013966, 0.13242180489283878, -0.02713860244571594, 0.19628252360951237, -0.05689328611700639, 0.16268351832322314, 0.05997598852212253, 0.07408630218103412, 0.10257638512855083, 0.05919688423287816, 0.13186287897869747, 0.15836435052735187, -0.004403772177710404, -0.06673957357199582, -0.3843911240058663, -0.1384858000463089, -0.18129191299348213, 0.07945565066098924, -0.15268206738532558, -0.18763140506374823, 0.42155187327282884, 0.05476945520798981, 0.21767120905204024, 0.13302853056621136, 0.1972589292604707, 0.16977407735467484, 0.06180321732206286, 0.05823790849458459, 0.16804172146439025, 0.17560861238476252, -0.015366943656112504, -0.2658763793544366, 0.018847463298094485, 0.19196059497573467] |
1,803.04061 | Multi-Reference Video Coding Using Stillness Detection | Encoders of AOM/AV1 codec consider an input video sequence as succession of
frames grouped in Golden-Frame (GF) groups. The coding structure of a GF group
is fixed with a given GF group size. In the current AOM/AV1 encoder, video
frames are coded using a hierarchical, multilayer coding structure within one
GF group. It has been observed that the use of multilayer coding structure may
result in worse coding performance if the GF group presents consistent
stillness across its frames. This paper proposes a new approach that adaptively
designs the Golden-Frame (GF) group coding structure through the use of
stillness detection. Our new approach hence develops an automatic stillness
detection scheme using three metrics extracted from each GF group. It then
differentiates those GF groups of stillness from other non- still GF groups and
uses different GF coding structures accordingly. Experimental result
demonstrates a consistent coding gain using the new approach.
| eess.IV cs.MM | encoders of aomav1 codec consider an input video sequence as succession of frames grouped in goldenframe gf groups the coding structure of a gf group is fixed with a given gf group size in the current aomav1 encoder video frames are coded using a hierarchical multilayer coding structure within one gf group it has been observed that the use of multilayer coding structure may result in worse coding performance if the gf group presents consistent stillness across its frames this paper proposes a new approach that adaptively designs the goldenframe gf group coding structure through the use of stillness detection our new approach hence develops an automatic stillness detection scheme using three metrics extracted from each gf group it then differentiates those gf groups of stillness from other non still gf groups and uses different gf coding structures accordingly experimental result demonstrates a consistent coding gain using the new approach | [['encoders', 'of', 'aomav1', 'codec', 'consider', 'an', 'input', 'video', 'sequence', 'as', 'succession', 'of', 'frames', 'grouped', 'in', 'goldenframe', 'gf', 'groups', 'the', 'coding', 'structure', 'of', 'a', 'gf', 'group', 'is', 'fixed', 'with', 'a', 'given', 'gf', 'group', 'size', 'in', 'the', 'current', 'aomav1', 'encoder', 'video', 'frames', 'are', 'coded', 'using', 'a', 'hierarchical', 'multilayer', 'coding', 'structure', 'within', 'one', 'gf', 'group', 'it', 'has', 'been', 'observed', 'that', 'the', 'use', 'of', 'multilayer', 'coding', 'structure', 'may', 'result', 'in', 'worse', 'coding', 'performance', 'if', 'the', 'gf', 'group', 'presents', 'consistent', 'stillness', 'across', 'its', 'frames', 'this', 'paper', 'proposes', 'a', 'new', 'approach', 'that', 'adaptively', 'designs', 'the', 'goldenframe', 'gf', 'group', 'coding', 'structure', 'through', 'the', 'use', 'of', 'stillness', 'detection', 'our', 'new', 'approach', 'hence', 'develops', 'an', 'automatic', 'stillness', 'detection', 'scheme', 'using', 'three', 'metrics', 'extracted', 'from', 'each', 'gf', 'group', 'it', 'then', 'differentiates', 'those', 'gf', 'groups', 'of', 'stillness', 'from', 'other', 'non', 'still', 'gf', 'groups', 'and', 'uses', 'different', 'gf', 'coding', 'structures', 'accordingly', 'experimental', 'result', 'demonstrates', 'a', 'consistent', 'coding', 'gain', 'using', 'the', 'new', 'approach']] | [-0.15195128585627252, 0.028177913511368585, -0.15535351190388808, 0.0161566463066265, -0.06650639179546537, -0.1570016694620151, 0.05319617192002919, 0.46088830702560574, -0.311434009622128, -0.23358902734754658, 0.04449398725724628, -0.20891100940344906, -0.22546029223343106, 0.15966888448236058, -0.10952558780774928, -0.010153066862855937, 0.06291709495456638, 0.11444970052311751, -0.08906558793466035, -0.22204036433155322, 0.30089175267415624, 0.049082727500668576, 0.3641274037623048, -0.0722370336423754, 0.08554469725758945, 0.03351264909174092, -0.06415831430412426, -0.01925795489286601, -0.034610367657453914, 0.14752008964510546, 0.3259795922801729, 0.14340719773994154, 0.27686879525237995, -0.35631276171881, -0.2501353504375328, 0.005172292593350583, 0.13037252107421188, 0.09559395673332384, -0.1021456673892366, -0.2953400252138365, 0.1341141926650134, -0.23163777172197336, 0.045048844000022556, -0.021056658196431346, -0.036456687759759056, -0.010077224232608805, -0.26580375977445747, 0.0271952276313174, 0.03098356950795278, 0.02604091418214847, -0.05233959750212553, -0.13043144114026045, 0.013102942807883074, 0.17470759367711866, -0.007143688516382984, 0.09501799253583257, 0.12532296710068713, -0.10519976891157205, -0.13236902422284255, 0.3947093907963544, -0.07761981364691982, -0.1874906277886554, 0.13236778169064908, -0.07387875361569426, -0.20276401017326862, 0.15002994474678025, 0.1770016840545813, 0.10378786635811667, -0.13904687809613156, 0.054858364343778485, -0.08601174885532945, 0.21816933574941563, 0.0934273640206713, 0.011294830452046684, 0.13241218553535086, 0.1994603391912942, 0.04615597836704723, 0.157792040430453, -0.07298041923865173, -0.0029543206674625747, -0.2702721332599459, -0.11697588456366714, -0.15315395685516903, -0.05149107814351147, -0.10082633782961214, -0.14224078442517518, 0.40449167421091853, 0.1297874201405353, 0.1358219704408249, 0.08111549350035824, 0.303758427362285, 0.03620458428269705, 0.12363623922165307, 0.12397587553887451, 0.13692804987265453, 0.1443912346023009, -0.011101988858442652, -0.1182088789552123, 0.031267036809711844, 0.13185282313025784] |
1,803.04062 | Pseudo-task Augmentation: From Deep Multitask Learning to Intratask
Sharing---and Back | Deep multitask learning boosts performance by sharing learned structure
across related tasks. This paper adapts ideas from deep multitask learning to
the setting where only a single task is available. The method is formalized as
pseudo-task augmentation, in which models are trained with multiple decoders
for each task. Pseudo-tasks simulate the effect of training towards
closely-related tasks drawn from the same universe. In a suite of experiments,
pseudo-task augmentation is shown to improve performance on single-task
learning problems. When combined with multitask learning, further improvements
are achieved, including state-of-the-art performance on the CelebA dataset,
showing that pseudo-task augmentation and multitask learning have complementary
value. All in all, pseudo-task augmentation is a broadly applicable and
efficient way to boost performance in deep learning systems.
| cs.LG stat.ML | deep multitask learning boosts performance by sharing learned structure across related tasks this paper adapts ideas from deep multitask learning to the setting where only a single task is available the method is formalized as pseudotask augmentation in which models are trained with multiple decoders for each task pseudotasks simulate the effect of training towards closelyrelated tasks drawn from the same universe in a suite of experiments pseudotask augmentation is shown to improve performance on singletask learning problems when combined with multitask learning further improvements are achieved including stateoftheart performance on the celeba dataset showing that pseudotask augmentation and multitask learning have complementary value all in all pseudotask augmentation is a broadly applicable and efficient way to boost performance in deep learning systems | [['deep', 'multitask', 'learning', 'boosts', 'performance', 'by', 'sharing', 'learned', 'structure', 'across', 'related', 'tasks', 'this', 'paper', 'adapts', 'ideas', 'from', 'deep', 'multitask', 'learning', 'to', 'the', 'setting', 'where', 'only', 'a', 'single', 'task', 'is', 'available', 'the', 'method', 'is', 'formalized', 'as', 'pseudotask', 'augmentation', 'in', 'which', 'models', 'are', 'trained', 'with', 'multiple', 'decoders', 'for', 'each', 'task', 'pseudotasks', 'simulate', 'the', 'effect', 'of', 'training', 'towards', 'closelyrelated', 'tasks', 'drawn', 'from', 'the', 'same', 'universe', 'in', 'a', 'suite', 'of', 'experiments', 'pseudotask', 'augmentation', 'is', 'shown', 'to', 'improve', 'performance', 'on', 'singletask', 'learning', 'problems', 'when', 'combined', 'with', 'multitask', 'learning', 'further', 'improvements', 'are', 'achieved', 'including', 'stateoftheart', 'performance', 'on', 'the', 'celeba', 'dataset', 'showing', 'that', 'pseudotask', 'augmentation', 'and', 'multitask', 'learning', 'have', 'complementary', 'value', 'all', 'in', 'all', 'pseudotask', 'augmentation', 'is', 'a', 'broadly', 'applicable', 'and', 'efficient', 'way', 'to', 'boost', 'performance', 'in', 'deep', 'learning', 'systems']] | [0.019509456111843407, -0.0346172733965223, -0.06526502371063364, 0.03160190452405511, -0.13796828991397606, -0.23302071567884355, 0.002180601756201034, 0.4923689859751307, -0.2826772434102585, -0.33135852605470867, 0.03505039797927879, -0.24687368132662577, -0.18342874856230604, 0.2534440642396431, -0.18588659070288396, 0.08972003258508057, 0.19703352050550405, 0.05051710059270873, -0.09899976615007723, -0.3648836027638086, 0.3206474854607043, 0.04923851195017647, 0.40924348738655203, -0.0078957386421742, 0.1441819959350663, -0.04943951573146538, 0.0032299847082525005, -0.001135500285346977, -0.018073645964578333, 0.1752824796665246, 0.38347167166114665, 0.2242032798984256, 0.36082638993851657, -0.3348218205491783, -0.27427996116400255, 0.09274430204274468, 0.1530736248585258, 0.08486485360934568, -0.031054297868605155, -0.3436726586068751, 0.06952718343417787, -0.18944643008270773, 0.09639474125120973, -0.16260161005021606, -0.09554305703696613, -0.03936954564796608, -0.3250895340866829, 0.018637530469396688, 0.07586466017194458, 0.06399829474995371, -0.05180729909219825, -0.1626503471567555, 0.06254503353819495, 0.14274152838477108, 0.026784828215165705, 0.08460611400774634, 0.15374870100306715, -0.23229267057718433, -0.1991914603019469, 0.3368312451438826, -0.06324978060180657, -0.19302008004065174, 0.2124057264090134, 0.029835666518383583, -0.1904358910625709, 0.0647590965124183, 0.2676461955454185, 0.11774317638521067, -0.16112237753354675, 0.03068290835868598, -0.05339123366675416, 0.13628723335819276, 0.02866551243188623, -0.049245536296826896, 0.13421489888149482, 0.31871909917843694, 0.028009891665548268, 0.15710009582585, -0.10695733721597028, -0.08945049491298736, -0.17293072770947027, -0.0628678044914955, -0.20916395439178545, -0.02614086908364638, -0.09854414694933945, -0.07780854959593377, 0.3520388407785384, 0.23992999235442916, 0.22666301484387674, 0.1499864795695147, 0.3720604916729155, -0.014974922973273292, 0.15915076823935645, 0.14811082246053017, 0.18605870581193842, -0.0016134946023068223, 0.12159387571126466, -0.19047134387360307, 0.08596842661958004, 0.01832322330885857] |
1,803.04063 | Resolvent degree, Hilbert's 13th Problem and geometry | We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in
order to study the complexity of formulas for roots of polynomials and to give
a precise formulation of Hilbert's 13th Problem. We extend the context of this
theory to enumerative problems in algebraic geometry, and consider it as an
intrinsic invariant of a finite group. As one application of this point of
view, we prove that Hilbert's 13th Problem, and his Sextic and Octic
Conjectures, are equivalent to various enumerative geometry problems, for
example problems of finding lines on a smooth cubic surface or bitangents on a
smooth planar quartic.
| math.AG math.AT math.GR math.GT math.NT | we develop the theory of resolvent degree introduced by brauer citebr in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of hilberts 13th problem we extend the context of this theory to enumerative problems in algebraic geometry and consider it as an intrinsic invariant of a finite group as one application of this point of view we prove that hilberts 13th problem and his sextic and octic conjectures are equivalent to various enumerative geometry problems for example problems of finding lines on a smooth cubic surface or bitangents on a smooth planar quartic | [['we', 'develop', 'the', 'theory', 'of', 'resolvent', 'degree', 'introduced', 'by', 'brauer', 'citebr', 'in', 'order', 'to', 'study', 'the', 'complexity', 'of', 'formulas', 'for', 'roots', 'of', 'polynomials', 'and', 'to', 'give', 'a', 'precise', 'formulation', 'of', 'hilberts', '13th', 'problem', 'we', 'extend', 'the', 'context', 'of', 'this', 'theory', 'to', 'enumerative', 'problems', 'in', 'algebraic', 'geometry', 'and', 'consider', 'it', 'as', 'an', 'intrinsic', 'invariant', 'of', 'a', 'finite', 'group', 'as', 'one', 'application', 'of', 'this', 'point', 'of', 'view', 'we', 'prove', 'that', 'hilberts', '13th', 'problem', 'and', 'his', 'sextic', 'and', 'octic', 'conjectures', 'are', 'equivalent', 'to', 'various', 'enumerative', 'geometry', 'problems', 'for', 'example', 'problems', 'of', 'finding', 'lines', 'on', 'a', 'smooth', 'cubic', 'surface', 'or', 'bitangents', 'on', 'a', 'smooth', 'planar', 'quartic']] | [-0.14597730880018836, -0.019544853745387895, -0.09154286123264362, 0.0901518841673547, -0.13822612571803963, -0.12432157626265988, 0.021558900215370835, 0.2747314265773942, -0.31627040712035026, -0.2736816687518548, 0.13589789893925555, -0.26793559607775774, -0.2154877603387314, 0.2343913091040746, -0.14825967141794036, 0.04493221815552234, 0.005892923416788964, 0.04760461655335829, -0.12520846168227567, -0.33302372437217, 0.36233426168487937, -0.03096471404583723, 0.18383754405430427, 0.0931165171969755, 0.14343084631642947, 0.05530171240588613, 0.004421451763596897, 0.01616755825485669, -0.1695271704198853, 0.19919705760948286, 0.3314506345512414, 0.1080164211852403, 0.23700655405135715, -0.3908418492578408, -0.15954035741970965, 0.13965658491075622, 0.0934198431845574, 0.11663188653833725, -0.012005954807368564, -0.22906028665145675, 0.07221785963138602, -0.08988963573724237, -0.23380979495214335, -0.034869614203332684, 0.049511172890882284, 0.0022878574421994536, -0.19865489897190355, 0.010630781433599837, 0.09454352966528021, 0.1545134106851822, -0.023307004738051224, -0.09660073138622786, 0.023627267779517628, 0.03801561550775945, 0.02977560161882281, 0.03413986877821313, 0.02241726425549417, -0.11507670671733863, -0.16189327804992595, 0.39927635268837797, -0.00271156292486315, -0.1960659858259354, 0.10883154558684385, -0.1011737891902015, -0.1693561830998435, 0.09791576413565553, 0.19976266823462485, 0.1914142773888421, -0.05119553627446294, 0.20171664518934182, -0.10644359312330683, 0.10571129141773745, 0.13699962809115795, -0.03381443307415454, 0.15295437921760788, 0.061585026418826745, 0.09407639455086753, 0.18737681201195763, 0.02069919309396224, -0.0857990263029933, -0.3364158881389919, -0.17001697963888884, -0.11695379969736963, 0.10347665579049099, -0.11770478321876213, -0.24133079672944457, 0.40826458458368686, 0.09874934551543464, 0.1561257734839969, 0.09601874100774818, 0.2255610624515433, 0.1128255415995441, -0.02070453300999076, 0.00613437244668175, 0.15700983580694916, 0.23428814652074567, 0.039674294364921675, -0.16283094642829954, -0.03030192263552225, 0.22118251484033524] |
1,803.04064 | Class number formula for dihedral extensions | We give an algebraic proof of a class number formula for dihedral extensions
of number fields of degree $2q$, where $q$ is any odd integer. Our formula
expresses the ratio of class numbers as a ratio of orders of cohomology groups
of units and recovers similar formulas which have appeared in the literature as
special cases. As a corollary of our main result we obtain explicit bounds on
the (finitely many) possible values which can occur as ratio of class numbers
in dihedral extensions. Such bounds are obtained by arithmetic means, without
resorting to deep integral representation theory.
| math.NT | we give an algebraic proof of a class number formula for dihedral extensions of number fields of degree 2q where q is any odd integer our formula expresses the ratio of class numbers as a ratio of orders of cohomology groups of units and recovers similar formulas which have appeared in the literature as special cases as a corollary of our main result we obtain explicit bounds on the finitely many possible values which can occur as ratio of class numbers in dihedral extensions such bounds are obtained by arithmetic means without resorting to deep integral representation theory | [['we', 'give', 'an', 'algebraic', 'proof', 'of', 'a', 'class', 'number', 'formula', 'for', 'dihedral', 'extensions', 'of', 'number', 'fields', 'of', 'degree', '2q', 'where', 'q', 'is', 'any', 'odd', 'integer', 'our', 'formula', 'expresses', 'the', 'ratio', 'of', 'class', 'numbers', 'as', 'a', 'ratio', 'of', 'orders', 'of', 'cohomology', 'groups', 'of', 'units', 'and', 'recovers', 'similar', 'formulas', 'which', 'have', 'appeared', 'in', 'the', 'literature', 'as', 'special', 'cases', 'as', 'a', 'corollary', 'of', 'our', 'main', 'result', 'we', 'obtain', 'explicit', 'bounds', 'on', 'the', 'finitely', 'many', 'possible', 'values', 'which', 'can', 'occur', 'as', 'ratio', 'of', 'class', 'numbers', 'in', 'dihedral', 'extensions', 'such', 'bounds', 'are', 'obtained', 'by', 'arithmetic', 'means', 'without', 'resorting', 'to', 'deep', 'integral', 'representation', 'theory']] | [-0.1743274787669569, 0.08603239039149806, -0.05018015589793118, 0.08479201684976757, -0.09132722385550793, -0.12695900609298627, 0.02176702825937002, 0.2800433395278393, -0.26555999503375927, -0.3644793196486271, 0.09389274852939558, -0.21883272151320185, -0.17640632628083078, 0.2728278872614004, -0.08468419598455289, 0.01059036029455827, -0.009654555759601752, 0.11823427974607567, -0.07990014833595356, -0.2694387139244081, 0.31162414194692917, -0.052651959312521396, 0.18476079315973484, 0.0503637908710813, 0.07930477665813297, 0.03443975749957774, -0.003119480394644245, 0.006691390761465746, -0.14352654482295013, 0.08961873768581724, 0.31260922452796025, 0.07671701586425152, 0.20943903269208208, -0.38562171360743897, -0.15181472769235166, 0.19935209379170318, 0.15583149204980962, 0.08839853023112353, -0.017487197692686578, -0.19892681838602436, 0.10562764737536484, -0.21251879032236187, -0.1765272801751461, -0.1026971544357663, 0.056781228980980814, 0.06780093381352419, -0.2901448560118371, 0.037987212764517386, 0.10197058637574201, 0.12353327418962608, -0.028807296964092826, -0.20577689876414038, 0.031859119693577596, 0.1059498173156183, 0.06548701601853708, -0.001438651172140119, 0.05885885111341367, -0.11429413153827951, -0.15031621380405005, 0.3570505290349223, -0.048533071930121095, -0.21643990745805963, 0.11150191237256692, -0.11107150223391245, -0.1923170402712588, 0.12400502283530006, 0.10946638667385797, 0.18563505466457228, 0.008620330759761284, 0.14787164231588856, -0.15647235904744236, 0.1014543337823481, 0.15352661920502325, 0.07666255113649734, 0.11745385998593909, 0.03590576039456135, 0.055111591633509045, 0.17964063296854801, -0.014245050752592482, -0.061111136202401085, -0.37692155574961583, -0.17627059868346823, -0.1762710781732327, 0.10567025062675607, -0.14868341853271347, -0.1668395798615351, 0.3510205945931375, 0.06833865373319357, 0.1860330600567086, 0.17306606483180076, 0.24144294770548538, 0.14681941454954522, 0.09985551934176105, 0.010917640286996695, 0.12364078636699337, 0.2202002514101451, -0.024725732512353937, -0.08126388062076757, 0.06977801586320738, 0.20038983793644122] |
1,803.04065 | Experience Recommendation for Long Term Safe Learning-based Model
Predictive Control in Changing Operating Conditions | Learning has propelled the cutting edge of performance in robotic control to
new heights, allowing robots to operate with high performance in conditions
that were previously unimaginable. The majority of the work, however, assumes
that the unknown parts are static or slowly changing. This limits them to
static or slowly changing environments. However, in the real world, a robot may
experience various unknown conditions. This paper presents a method to extend
an existing single mode GP-based safe learning controller to learn an
increasing number of non-linear models for the robot dynamics. We show that
this approach enables a robot to re-use past experience from a large number of
previously visited operating conditions, and to safely adapt when a new and
distinct operating condition is encountered. This allows the robot to achieve
safety and high performance in an large number of operating conditions that do
not have to be specified ahead of time. Our approach runs independently from
the controller, imposing no additional computation time on the control loop
regardless of the number of previous operating conditions considered. We
demonstrate the effectiveness of our approach in experiment on a 900\,kg ground
robot with both physical and artificial changes to its dynamics. All of our
experiments are conducted using vision for localization.
| cs.RO | learning has propelled the cutting edge of performance in robotic control to new heights allowing robots to operate with high performance in conditions that were previously unimaginable the majority of the work however assumes that the unknown parts are static or slowly changing this limits them to static or slowly changing environments however in the real world a robot may experience various unknown conditions this paper presents a method to extend an existing single mode gpbased safe learning controller to learn an increasing number of nonlinear models for the robot dynamics we show that this approach enables a robot to reuse past experience from a large number of previously visited operating conditions and to safely adapt when a new and distinct operating condition is encountered this allows the robot to achieve safety and high performance in an large number of operating conditions that do not have to be specified ahead of time our approach runs independently from the controller imposing no additional computation time on the control loop regardless of the number of previous operating conditions considered we demonstrate the effectiveness of our approach in experiment on a 900kg ground robot with both physical and artificial changes to its dynamics all of our experiments are conducted using vision for localization | [['learning', 'has', 'propelled', 'the', 'cutting', 'edge', 'of', 'performance', 'in', 'robotic', 'control', 'to', 'new', 'heights', 'allowing', 'robots', 'to', 'operate', 'with', 'high', 'performance', 'in', 'conditions', 'that', 'were', 'previously', 'unimaginable', 'the', 'majority', 'of', 'the', 'work', 'however', 'assumes', 'that', 'the', 'unknown', 'parts', 'are', 'static', 'or', 'slowly', 'changing', 'this', 'limits', 'them', 'to', 'static', 'or', 'slowly', 'changing', 'environments', 'however', 'in', 'the', 'real', 'world', 'a', 'robot', 'may', 'experience', 'various', 'unknown', 'conditions', 'this', 'paper', 'presents', 'a', 'method', 'to', 'extend', 'an', 'existing', 'single', 'mode', 'gpbased', 'safe', 'learning', 'controller', 'to', 'learn', 'an', 'increasing', 'number', 'of', 'nonlinear', 'models', 'for', 'the', 'robot', 'dynamics', 'we', 'show', 'that', 'this', 'approach', 'enables', 'a', 'robot', 'to', 'reuse', 'past', 'experience', 'from', 'a', 'large', 'number', 'of', 'previously', 'visited', 'operating', 'conditions', 'and', 'to', 'safely', 'adapt', 'when', 'a', 'new', 'and', 'distinct', 'operating', 'condition', 'is', 'encountered', 'this', 'allows', 'the', 'robot', 'to', 'achieve', 'safety', 'and', 'high', 'performance', 'in', 'an', 'large', 'number', 'of', 'operating', 'conditions', 'that', 'do', 'not', 'have', 'to', 'be', 'specified', 'ahead', 'of', 'time', 'our', 'approach', 'runs', 'independently', 'from', 'the', 'controller', 'imposing', 'no', 'additional', 'computation', 'time', 'on', 'the', 'control', 'loop', 'regardless', 'of', 'the', 'number', 'of', 'previous', 'operating', 'conditions', 'considered', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'in', 'experiment', 'on', 'a', '900kg', 'ground', 'robot', 'with', 'both', 'physical', 'and', 'artificial', 'changes', 'to', 'its', 'dynamics', 'all', 'of', 'our', 'experiments', 'are', 'conducted', 'using', 'vision', 'for', 'localization']] | [-0.13028349953761512, 0.10333433021805483, -0.08326294489258357, -0.029318825217547636, -0.12188940461052127, -0.15493979974333463, 0.053822893863788954, 0.4163354240607417, -0.2324392848300556, -0.3817591628229076, 0.10786100832631802, -0.2060213199200172, -0.14869311662907733, 0.22709815102823203, -0.1252745234007272, 0.10265220578901389, 0.07743912127925057, 0.053061960102393155, -0.022343371416615885, -0.2575496167978316, 0.2788595212066466, 0.04186514513366566, 0.2802201035626357, 0.02290155643900259, 0.11082330657365291, -0.011290601412342354, 0.02440314850175049, 0.012755713953623219, -0.06266864449853572, 0.091094484634378, 0.2722701538555831, 0.16358535201400162, 0.32063734304587665, -0.46371418993160324, -0.21012114604565194, 0.10761931117927058, 0.12327219877040023, 0.09690142206125782, -0.03219884002144542, -0.31130341315668736, 0.10757255749598715, -0.15407559475037114, -0.13133141672479337, -0.07082494807710345, -0.014552522406124613, 0.007067784221684694, -0.284725613923271, -0.04503328058730508, 0.03599175067983888, 0.07082390383278069, -0.08320853890573748, -0.06388338002639167, 0.0199975187508122, 0.21112214234664828, 0.04383840067780011, 0.015062886934157051, 0.18586347402300704, -0.1544505624461509, -0.1270365238470431, 0.34616192854477457, -0.015207645530103925, -0.213854427941246, 0.28260840258993314, -0.1161310575750955, -0.12288775456775176, 0.13270758051741602, 0.22671961561781154, 0.12320049751515703, -0.16535936251794306, 0.044862161284651265, -0.013960126201448401, 0.16008616852213106, 0.05821241028707154, -0.010873610703564254, 0.16123645790879343, 0.20978666531728607, 0.09441963368670293, 0.12903729265357444, -0.06853967914750474, -0.11723489746781128, -0.2550073182522252, -0.10449037012718194, -0.16101768802342886, -0.019988993699615043, -0.056163115259516165, -0.12896370820225714, 0.3781464283029286, 0.24965727711865082, 0.2060860773708903, 0.09013761536933428, 0.35197393728963783, 0.07169764799023555, 0.10184577264952246, 0.09543084005020898, 0.24369946189233632, -0.002858329671279095, 0.14374441003458102, -0.22685134246428476, 0.09219209585811176, -0.032453684401408764] |
1,803.04066 | Multisensor Data Fusion for Water Quality Monitoring using Wireless
Sensor Networks | In this paper, the application of hierarchical wireless sensor networks in
water quality monitoring is investigated. Adopting a hierarchical structure,
the set of sensors is divided into multiple clusters where the value of the
sensing parameter is almost constant in each cluster. The members of each
cluster transmit their sensing information to the local fusion center (LFC) of
their corresponding cluster, where using some fusion rule, the received
information is combined, and then possibly sent to a higher-level central
fusion center (CFC). A two-phase processing scheme is also envisioned, in which
the first phase is dedicated to detection in the LFC, and the second phase is
dedicated to estimation in both the LFC and the CFC. The focus of the present
paper is on the problem of decision fusion at the LFC: we propose hard- and
soft-decision maximum a posteriori (MAP) algorithms, which exhibit flexibility
in minimizing the total cost imposed by incorrect detections in the first
phase. The proposed algorithms are simulated and compared with conventional
fusion techniques. It is shown that the proposed techniques result in lower
cost. Furthermore, when the number of sensors or the amount of contamination
increases, the performance gap between the proposed algorithms and the existing
methods also widens.
| eess.SP | in this paper the application of hierarchical wireless sensor networks in water quality monitoring is investigated adopting a hierarchical structure the set of sensors is divided into multiple clusters where the value of the sensing parameter is almost constant in each cluster the members of each cluster transmit their sensing information to the local fusion center lfc of their corresponding cluster where using some fusion rule the received information is combined and then possibly sent to a higherlevel central fusion center cfc a twophase processing scheme is also envisioned in which the first phase is dedicated to detection in the lfc and the second phase is dedicated to estimation in both the lfc and the cfc the focus of the present paper is on the problem of decision fusion at the lfc we propose hard and softdecision maximum a posteriori map algorithms which exhibit flexibility in minimizing the total cost imposed by incorrect detections in the first phase the proposed algorithms are simulated and compared with conventional fusion techniques it is shown that the proposed techniques result in lower cost furthermore when the number of sensors or the amount of contamination increases the performance gap between the proposed algorithms and the existing methods also widens | [['in', 'this', 'paper', 'the', 'application', 'of', 'hierarchical', 'wireless', 'sensor', 'networks', 'in', 'water', 'quality', 'monitoring', 'is', 'investigated', 'adopting', 'a', 'hierarchical', 'structure', 'the', 'set', 'of', 'sensors', 'is', 'divided', 'into', 'multiple', 'clusters', 'where', 'the', 'value', 'of', 'the', 'sensing', 'parameter', 'is', 'almost', 'constant', 'in', 'each', 'cluster', 'the', 'members', 'of', 'each', 'cluster', 'transmit', 'their', 'sensing', 'information', 'to', 'the', 'local', 'fusion', 'center', 'lfc', 'of', 'their', 'corresponding', 'cluster', 'where', 'using', 'some', 'fusion', 'rule', 'the', 'received', 'information', 'is', 'combined', 'and', 'then', 'possibly', 'sent', 'to', 'a', 'higherlevel', 'central', 'fusion', 'center', 'cfc', 'a', 'twophase', 'processing', 'scheme', 'is', 'also', 'envisioned', 'in', 'which', 'the', 'first', 'phase', 'is', 'dedicated', 'to', 'detection', 'in', 'the', 'lfc', 'and', 'the', 'second', 'phase', 'is', 'dedicated', 'to', 'estimation', 'in', 'both', 'the', 'lfc', 'and', 'the', 'cfc', 'the', 'focus', 'of', 'the', 'present', 'paper', 'is', 'on', 'the', 'problem', 'of', 'decision', 'fusion', 'at', 'the', 'lfc', 'we', 'propose', 'hard', 'and', 'softdecision', 'maximum', 'a', 'posteriori', 'map', 'algorithms', 'which', 'exhibit', 'flexibility', 'in', 'minimizing', 'the', 'total', 'cost', 'imposed', 'by', 'incorrect', 'detections', 'in', 'the', 'first', 'phase', 'the', 'proposed', 'algorithms', 'are', 'simulated', 'and', 'compared', 'with', 'conventional', 'fusion', 'techniques', 'it', 'is', 'shown', 'that', 'the', 'proposed', 'techniques', 'result', 'in', 'lower', 'cost', 'furthermore', 'when', 'the', 'number', 'of', 'sensors', 'or', 'the', 'amount', 'of', 'contamination', 'increases', 'the', 'performance', 'gap', 'between', 'the', 'proposed', 'algorithms', 'and', 'the', 'existing', 'methods', 'also', 'widens']] | [-0.11207608115779827, 0.050530978166157516, -0.06252920365915066, -0.007963148173421803, -0.053257025634052185, -0.12212489309107386, 0.08828174741484407, 0.3885896445592729, -0.29223890233466904, -0.30817651606914476, 0.12696820426811806, -0.24851377027154695, -0.13806526966097696, 0.15910449817935687, -0.09909096103525017, 0.0723769562781743, 0.06619719530898714, 0.10264466888293987, -0.056979302577560814, -0.26525363331353974, 0.29212891329647744, 0.11373253789980237, 0.34213589470288375, 0.021898543607534432, 0.09907939804081874, 0.019888084513566842, -0.06560020512253864, 0.01173732517764154, -0.07933357594688792, 0.1431398878461772, 0.2706758595696401, 0.15490614605794956, 0.3012324643491699, -0.38545160440546344, -0.2042849109848825, 0.11225964212790132, 0.13298422088988535, 0.07196394489373921, -0.05908985314379651, -0.2780781912685531, 0.12501733527496095, -0.18715477682672804, -0.037468111474157836, 0.008649757679370118, -0.02908406073522822, 0.02319674703587846, -0.29490454548248657, 0.04371376668597095, 0.008771946844531269, 0.011068182929259976, -0.08602613195799655, -0.109662656129406, 0.0014133422010828081, 0.15245927563916734, -0.004340805239384858, 0.013125435977311032, 0.15049480118550268, -0.13863841565439433, -0.10982327946431036, 0.3789202644410202, 0.003105537457073607, -0.1694888954857228, 0.17631319817609903, -0.0784851178788103, -0.14558794586649507, 0.1488925305127007, 0.18804517989841904, 0.1051398592433188, -0.15839528817997212, 0.03537713131901422, 0.020556623956597433, 0.16695410261702973, 0.04612584283075682, 0.03717879635031994, 0.1668605479184629, 0.1961302978316004, 0.11806831534997356, 0.16343399844609383, -0.16200478857712503, -0.08275510210589301, -0.2545369395194007, -0.12577697780528446, -0.20540958308592075, -0.061874018766258546, -0.06909182291299036, -0.10789905178471378, 0.3693962188341574, 0.1585388473030634, 0.19864061299325309, 0.03141966937166616, 0.3824574631252667, 0.11317849635074154, 0.09071188264571857, 0.0912629224837008, 0.2586285342106016, 0.1157177727115085, 0.1109345452434088, -0.21089798132562443, 0.053367510108595216, 0.052662434124546804] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.