id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0706 | CATTmew: Defeating Software-only Physical Kernel Isolation | All the state-of-the-art rowhammer attacks can break the MMU-enforced
inter-domain isolation because the physical memory owned by each domain is
adjacent to each other. To mitigate these attacks, physical domain isolation,
introduced by CATT, physically separates each domain by dividing the physical
memory into multiple partitions and keeping each partition occupied by only one
domain. CATT implemented physical kernel isolation as the first generic and
practical software-only defense to protect kernel from being rowhammered as
kernel is one of the most appealing targets.
In this paper, we develop a novel exploit that could effectively defeat the
physical kernel isolation and gain both root and kernel privileges. Our exploit
can work without exhausting the page cache or the system memory, or relying on
the information of the virtual-to-physical address mapping. The exploit is
motivated by our key observation that the modern OSes have double-owned kernel
buffers (e.g., video buffers and SCSI Generic buffers) owned concurrently by
the kernel and user domains. The existence of such buffers invalidates the
physical kernel isolation and makes the rowhammer-based attack possible again.
Existing conspicuous rowhammer attacks achieving the root/kernel privilege
escalation exhaust the page cache or even the whole system memory. Instead, we
propose a new technique, named memory ambush. It is able to place the
hammerable double-owned kernel buffers physically adjacent to the target
objects (e.g., page tables) with only a small amount of memory. As a result,
our exploit is stealthier and has fewer memory footprints. We also replace the
inefficient rowhammer algorithm that blindly picks up addresses to hammer with
an efficient one. Our algorithm selects suitable addresses based on an existing
timing channel.
| cs.CR | all the stateoftheart rowhammer attacks can break the mmuenforced interdomain isolation because the physical memory owned by each domain is adjacent to each other to mitigate these attacks physical domain isolation introduced by catt physically separates each domain by dividing the physical memory into multiple partitions and keeping each partition occupied by only one domain catt implemented physical kernel isolation as the first generic and practical softwareonly defense to protect kernel from being rowhammered as kernel is one of the most appealing targets in this paper we develop a novel exploit that could effectively defeat the physical kernel isolation and gain both root and kernel privileges our exploit can work without exhausting the page cache or the system memory or relying on the information of the virtualtophysical address mapping the exploit is motivated by our key observation that the modern oses have doubleowned kernel buffers eg video buffers and scsi generic buffers owned concurrently by the kernel and user domains the existence of such buffers invalidates the physical kernel isolation and makes the rowhammerbased attack possible again existing conspicuous rowhammer attacks achieving the rootkernel privilege escalation exhaust the page cache or even the whole system memory instead we propose a new technique named memory ambush it is able to place the hammerable doubleowned kernel buffers physically adjacent to the target objects eg page tables with only a small amount of memory as a result our exploit is stealthier and has fewer memory footprints we also replace the inefficient rowhammer algorithm that blindly picks up addresses to hammer with an efficient one our algorithm selects suitable addresses based on an existing timing channel | [['all', 'the', 'stateoftheart', 'rowhammer', 'attacks', 'can', 'break', 'the', 'mmuenforced', 'interdomain', 'isolation', 'because', 'the', 'physical', 'memory', 'owned', 'by', 'each', 'domain', 'is', 'adjacent', 'to', 'each', 'other', 'to', 'mitigate', 'these', 'attacks', 'physical', 'domain', 'isolation', 'introduced', 'by', 'catt', 'physically', 'separates', 'each', 'domain', 'by', 'dividing', 'the', 'physical', 'memory', 'into', 'multiple', 'partitions', 'and', 'keeping', 'each', 'partition', 'occupied', 'by', 'only', 'one', 'domain', 'catt', 'implemented', 'physical', 'kernel', 'isolation', 'as', 'the', 'first', 'generic', 'and', 'practical', 'softwareonly', 'defense', 'to', 'protect', 'kernel', 'from', 'being', 'rowhammered', 'as', 'kernel', 'is', 'one', 'of', 'the', 'most', 'appealing', 'targets', 'in', 'this', 'paper', 'we', 'develop', 'a', 'novel', 'exploit', 'that', 'could', 'effectively', 'defeat', 'the', 'physical', 'kernel', 'isolation', 'and', 'gain', 'both', 'root', 'and', 'kernel', 'privileges', 'our', 'exploit', 'can', 'work', 'without', 'exhausting', 'the', 'page', 'cache', 'or', 'the', 'system', 'memory', 'or', 'relying', 'on', 'the', 'information', 'of', 'the', 'virtualtophysical', 'address', 'mapping', 'the', 'exploit', 'is', 'motivated', 'by', 'our', 'key', 'observation', 'that', 'the', 'modern', 'oses', 'have', 'doubleowned', 'kernel', 'buffers', 'eg', 'video', 'buffers', 'and', 'scsi', 'generic', 'buffers', 'owned', 'concurrently', 'by', 'the', 'kernel', 'and', 'user', 'domains', 'the', 'existence', 'of', 'such', 'buffers', 'invalidates', 'the', 'physical', 'kernel', 'isolation', 'and', 'makes', 'the', 'rowhammerbased', 'attack', 'possible', 'again', 'existing', 'conspicuous', 'rowhammer', 'attacks', 'achieving', 'the', 'rootkernel', 'privilege', 'escalation', 'exhaust', 'the', 'page', 'cache', 'or', 'even', 'the', 'whole', 'system', 'memory', 'instead', 'we', 'propose', 'a', 'new', 'technique', 'named', 'memory', 'ambush', 'it', 'is', 'able', 'to', 'place', 'the', 'hammerable', 'doubleowned', 'kernel', 'buffers', 'physically', 'adjacent', 'to', 'the', 'target', 'objects', 'eg', 'page', 'tables', 'with', 'only', 'a', 'small', 'amount', 'of', 'memory', 'as', 'a', 'result', 'our', 'exploit', 'is', 'stealthier', 'and', 'has', 'fewer', 'memory', 'footprints', 'we', 'also', 'replace', 'the', 'inefficient', 'rowhammer', 'algorithm', 'that', 'blindly', 'picks', 'up', 'addresses', 'to', 'hammer', 'with', 'an', 'efficient', 'one', 'our', 'algorithm', 'selects', 'suitable', 'addresses', 'based', 'on', 'an', 'existing', 'timing', 'channel']] | [-0.14087746698971626, 0.035272545443149284, -0.038527465366565115, 0.05489171762898002, -0.14737703795984106, -0.23920322439440017, 0.12282244773748559, 0.37883648902072375, -0.2862516620148079, -0.3039129202763708, 0.15957718398378073, -0.2609642784023341, -0.11018061240484833, 0.1354307412899117, -0.1360170258156393, 0.05123489569424529, 0.04179732276081165, 0.02628713288643169, -0.004085091965707933, -0.27053826043891877, 0.3332050081645578, 0.05948667516404728, 0.27978515747653426, 0.03620728219327745, 0.10782496074405674, 0.016678772863211497, -0.04725051957714143, -0.04990685028309565, -0.0315443143254873, 0.09196376121868731, 0.2660918137880112, 0.17786112073237814, 0.3148580070936455, -0.46541497350323346, -0.21140429281963494, 0.0900760867869051, 0.14619478893824325, 0.0990225969093307, -0.01686538946639114, -0.292588312016308, 0.12650049889486564, -0.20151813086473716, -0.056306245752592694, -0.09695758086998227, -0.029282983158328484, 0.008507071825113358, -0.22697452103350102, -0.036328544825390156, 0.08220267638142378, -0.01764989381410041, -0.020149744888064716, -0.09596477909417787, 0.015410804718662545, 0.17303962578737828, -0.007894843149895095, 0.016773631357377007, 0.17320544663882587, -0.1000097740344914, -0.11948035887073515, 0.35142349115449867, 0.023499802377663623, -0.19724330135339976, 0.219973642560258, -0.0198284221004765, -0.108261980465174, 0.10382271909840264, 0.15791381419557235, 0.06468384082095241, -0.18320733577865264, 0.04149375127382436, -0.011680505118982972, 0.2120507239561774, 0.10591231707378097, 0.07553283853526667, 0.16341322494169944, 0.1845531023234867, 0.08582758558562623, 0.1577846116313869, -0.09401216124105355, -0.06995922034114319, -0.24316234851084684, -0.15320676355820395, -0.23342935050934344, -0.0009756845053074495, -0.08724754735045487, -0.1329496396951518, 0.3743214851069563, 0.18664301626366686, 0.18707085570039333, 0.06233704497594, 0.3888262149833916, 0.04796069381310482, 0.17704189480545948, 0.15961721953320898, 0.13778934284587796, -0.021957249753177165, 0.13041307775057712, -0.18717369449254617, 0.15160146544880743, 0.033914673611310855] |
1,802.07061 | Magnetic exchange and susceptibilities in fcc iron: A supercell
dynamical mean-field theory study | We study the momentum- and temperature dependencies of magnetic
susceptibilities and magnetic exchange in paramagnetic fcc iron by a
combination of density functional theory and supercell dynamical mean-field
theory (DFT+DMFT). We find that in agreement with experimental results the
antiferromagnetic correlations with the wave vector close to $(0,0,2\pi)$
dominate at low temperatures (as was also obtained previously theoretically),
while the antiferromagnetic and ferromagnetic correlations closely compete at
the temperatures $T\sim 1000$ K, where $\gamma$-iron exists in nature. Inverse
staggered susceptibility has linear temperature dependence at low temperatures,
with negative Weiss temperature $\theta_{\rm stagg} \approx -340$ K; the
inverse local susceptibility is also linear at not too low temperatures,
showing well formed local moments. Analysis of magnetic exchange shows that the
dominant contribution comes from first two coordination spheres. In agreement
with the analysis of the susceptibility, the nearest-neighbor exchange is found
to be antiferromagnetic at low temperatures, while at temperature of the
$\alpha$-$\gamma$ structural phase transition its absolute value becomes small,
and the system appears on the boundary between the regimes with strongest
antiferro- and ferromagnetic correlations.
| cond-mat.str-el | we study the momentum and temperature dependencies of magnetic susceptibilities and magnetic exchange in paramagnetic fcc iron by a combination of density functional theory and supercell dynamical meanfield theory dftdmft we find that in agreement with experimental results the antiferromagnetic correlations with the wave vector close to 002pi dominate at low temperatures as was also obtained previously theoretically while the antiferromagnetic and ferromagnetic correlations closely compete at the temperatures tsim 1000 k where gammairon exists in nature inverse staggered susceptibility has linear temperature dependence at low temperatures with negative weiss temperature theta_rm stagg approx 340 k the inverse local susceptibility is also linear at not too low temperatures showing well formed local moments analysis of magnetic exchange shows that the dominant contribution comes from first two coordination spheres in agreement with the analysis of the susceptibility the nearestneighbor exchange is found to be antiferromagnetic at low temperatures while at temperature of the alphagamma structural phase transition its absolute value becomes small and the system appears on the boundary between the regimes with strongest antiferro and ferromagnetic correlations | [['we', 'study', 'the', 'momentum', 'and', 'temperature', 'dependencies', 'of', 'magnetic', 'susceptibilities', 'and', 'magnetic', 'exchange', 'in', 'paramagnetic', 'fcc', 'iron', 'by', 'a', 'combination', 'of', 'density', 'functional', 'theory', 'and', 'supercell', 'dynamical', 'meanfield', 'theory', 'dftdmft', 'we', 'find', 'that', 'in', 'agreement', 'with', 'experimental', 'results', 'the', 'antiferromagnetic', 'correlations', 'with', 'the', 'wave', 'vector', 'close', 'to', '002pi', 'dominate', 'at', 'low', 'temperatures', 'as', 'was', 'also', 'obtained', 'previously', 'theoretically', 'while', 'the', 'antiferromagnetic', 'and', 'ferromagnetic', 'correlations', 'closely', 'compete', 'at', 'the', 'temperatures', 'tsim', '1000', 'k', 'where', 'gammairon', 'exists', 'in', 'nature', 'inverse', 'staggered', 'susceptibility', 'has', 'linear', 'temperature', 'dependence', 'at', 'low', 'temperatures', 'with', 'negative', 'weiss', 'temperature', 'theta_rm', 'stagg', 'approx', '340', 'k', 'the', 'inverse', 'local', 'susceptibility', 'is', 'also', 'linear', 'at', 'not', 'too', 'low', 'temperatures', 'showing', 'well', 'formed', 'local', 'moments', 'analysis', 'of', 'magnetic', 'exchange', 'shows', 'that', 'the', 'dominant', 'contribution', 'comes', 'from', 'first', 'two', 'coordination', 'spheres', 'in', 'agreement', 'with', 'the', 'analysis', 'of', 'the', 'susceptibility', 'the', 'nearestneighbor', 'exchange', 'is', 'found', 'to', 'be', 'antiferromagnetic', 'at', 'low', 'temperatures', 'while', 'at', 'temperature', 'of', 'the', 'alphagamma', 'structural', 'phase', 'transition', 'its', 'absolute', 'value', 'becomes', 'small', 'and', 'the', 'system', 'appears', 'on', 'the', 'boundary', 'between', 'the', 'regimes', 'with', 'strongest', 'antiferro', 'and', 'ferromagnetic', 'correlations']] | [-0.15803642140268825, 0.24388525772850367, -0.03360000512599403, 0.05573757275520951, -0.014031723189294677, -0.12593891637582352, 0.07434962202255106, 0.3786363479025154, -0.2480819157234774, -0.311883281043265, 0.02395986946596002, -0.38325303977101366, -0.06433586290487173, 0.12549625541909004, 0.1431596118854941, -0.03142647435974637, -0.06030341368221508, 0.047609169867924225, -0.14462775202330455, -0.1908468988575888, 0.26662617244503717, 0.05355132102902809, 0.3022004726662999, 0.1285367686144706, 0.04992177119923078, 0.0060507333004021675, 0.12252061516152356, 0.06455248765202916, -0.1530396487451898, -0.01508735498381694, 0.27643240833739663, -0.10953207668022845, 0.19154140535234052, -0.3708014407417398, -0.1768107715020464, 0.034396012113905854, 0.09228023498475192, 0.1087458318401001, -0.030272516902186908, -0.2247521871792163, 0.06872034280571494, -0.12386214946772353, -0.12571944286140602, -0.12822162241131577, 0.001180286392230879, 6.643856745954095e-05, -0.29534850631766446, 0.1922094625581601, 0.048420140310554416, 0.15839402152844492, -0.10593318772060395, -0.18031688498542114, -0.07092300996538886, 0.055587332650743934, 0.06884050630006558, 0.08793095524015371, 0.12464835297379812, -0.08338915292320466, -0.06274347976299892, 0.3329495870222507, -0.09551978705580537, -0.020244421175448224, 0.2074422368128911, -0.23337650430965534, -0.1010803070332093, 0.19128167833497917, 0.09097093261582566, 0.0628591372687052, -0.1168759026384743, 0.08858114849664905, 0.033600448504495777, 0.2047225196464834, 0.026871505463284186, 0.02671406711959373, 0.24118339726754295, 0.14287156674651091, 0.03235063425117088, 0.13948415590526897, -0.10798929248862392, -0.12622236084478738, -0.23653770358280532, -0.07110708607201972, -0.21763762401612688, 0.018925978152930675, -0.14283921379832132, -0.1478004375014941, 0.31256536509185523, 0.16308150035778948, 0.2198935213488188, 0.010269639992409131, 0.26212391390502243, 0.12614414602715193, 0.0548581414596728, 0.09970323888145768, 0.26139207782266155, 0.22771436083580324, 0.1635686356973813, -0.31010178541526495, 0.08462233867348087, 0.008218933583438311] |
1,802.07062 | KASR: A Reliable and Practical Approach to Attack Surface Reduction of
Commodity OS Kernels | Commodity OS kernels have broad attack surfaces due to the large code base
and the numerous features such as device drivers. For a real-world use case
(e.g., an Apache Server), many kernel services are unused and only a small
amount of kernel code is used. Within the used code, a certain part is invoked
only at runtime while the rest are executed at startup and/or shutdown phases
in the kernel's lifetime run. In this paper, we propose a reliable and
practical system, named KASR, which transparently reduces attack surfaces of
commodity OS kernels at runtime without requiring their source code. The KASR
system, residing in a trusted hypervisor, achieves the attack surface reduction
through a two-step approach: (1) reliably depriving unused code of executable
permissions, and (2) transparently segmenting used code and selectively
activating them. We implement a prototype of KASR on Xen-4.8.2 hypervisor and
evaluate its security effectiveness on Linux kernel-4.4.0-87-generic. Our
evaluation shows that KASR reduces the kernel attack surface by 64% and trims
off 40% of CVE vulnerabilities. Besides, KASR successfully detects and blocks
all 6 real-world kernel rootkits. We measure its performance overhead with
three benchmark tools (i.e., SPECINT, httperf and bonnie++). The experimental
results indicate that KASR imposes less than 1% performance overhead (compared
to an unmodified Xen hypervisor) on all the benchmarks.
| cs.CR cs.OS | commodity os kernels have broad attack surfaces due to the large code base and the numerous features such as device drivers for a realworld use case eg an apache server many kernel services are unused and only a small amount of kernel code is used within the used code a certain part is invoked only at runtime while the rest are executed at startup andor shutdown phases in the kernels lifetime run in this paper we propose a reliable and practical system named kasr which transparently reduces attack surfaces of commodity os kernels at runtime without requiring their source code the kasr system residing in a trusted hypervisor achieves the attack surface reduction through a twostep approach 1 reliably depriving unused code of executable permissions and 2 transparently segmenting used code and selectively activating them we implement a prototype of kasr on xen482 hypervisor and evaluate its security effectiveness on linux kernel44087generic our evaluation shows that kasr reduces the kernel attack surface by 64 and trims off 40 of cve vulnerabilities besides kasr successfully detects and blocks all 6 realworld kernel rootkits we measure its performance overhead with three benchmark tools ie specint httperf and bonnie the experimental results indicate that kasr imposes less than 1 performance overhead compared to an unmodified xen hypervisor on all the benchmarks | [['commodity', 'os', 'kernels', 'have', 'broad', 'attack', 'surfaces', 'due', 'to', 'the', 'large', 'code', 'base', 'and', 'the', 'numerous', 'features', 'such', 'as', 'device', 'drivers', 'for', 'a', 'realworld', 'use', 'case', 'eg', 'an', 'apache', 'server', 'many', 'kernel', 'services', 'are', 'unused', 'and', 'only', 'a', 'small', 'amount', 'of', 'kernel', 'code', 'is', 'used', 'within', 'the', 'used', 'code', 'a', 'certain', 'part', 'is', 'invoked', 'only', 'at', 'runtime', 'while', 'the', 'rest', 'are', 'executed', 'at', 'startup', 'andor', 'shutdown', 'phases', 'in', 'the', 'kernels', 'lifetime', 'run', 'in', 'this', 'paper', 'we', 'propose', 'a', 'reliable', 'and', 'practical', 'system', 'named', 'kasr', 'which', 'transparently', 'reduces', 'attack', 'surfaces', 'of', 'commodity', 'os', 'kernels', 'at', 'runtime', 'without', 'requiring', 'their', 'source', 'code', 'the', 'kasr', 'system', 'residing', 'in', 'a', 'trusted', 'hypervisor', 'achieves', 'the', 'attack', 'surface', 'reduction', 'through', 'a', 'twostep', 'approach', '1', 'reliably', 'depriving', 'unused', 'code', 'of', 'executable', 'permissions', 'and', '2', 'transparently', 'segmenting', 'used', 'code', 'and', 'selectively', 'activating', 'them', 'we', 'implement', 'a', 'prototype', 'of', 'kasr', 'on', 'xen482', 'hypervisor', 'and', 'evaluate', 'its', 'security', 'effectiveness', 'on', 'linux', 'kernel44087generic', 'our', 'evaluation', 'shows', 'that', 'kasr', 'reduces', 'the', 'kernel', 'attack', 'surface', 'by', '64', 'and', 'trims', 'off', '40', 'of', 'cve', 'vulnerabilities', 'besides', 'kasr', 'successfully', 'detects', 'and', 'blocks', 'all', '6', 'realworld', 'kernel', 'rootkits', 'we', 'measure', 'its', 'performance', 'overhead', 'with', 'three', 'benchmark', 'tools', 'ie', 'specint', 'httperf', 'and', 'bonnie', 'the', 'experimental', 'results', 'indicate', 'that', 'kasr', 'imposes', 'less', 'than', '1', 'performance', 'overhead', 'compared', 'to', 'an', 'unmodified', 'xen', 'hypervisor', 'on', 'all', 'the', 'benchmarks']] | [-0.1480026675222842, -0.005012424731116838, -0.03745872078852529, 0.05997220751618375, -0.05861488959826007, -0.24230502211656335, 0.10361279563316814, 0.3931677316654926, -0.22564864050048603, -0.35951559157676505, 0.15263823134374205, -0.29205762033098354, -0.08557346808750217, 0.252660972861275, -0.08898035894533202, 0.09772847668500617, 0.1019941116030389, -0.016812868579508405, -0.019333727195397644, -0.30811349289365564, 0.28682242082997667, 0.08342551227515371, 0.2795191943992547, 0.09943093809274148, 0.07772585424207255, -0.018965289239319057, -0.018123328138499685, -0.07313102538149073, 0.013817083855063294, 0.0727130691991427, 0.2657835617026088, 0.1851082056604117, 0.2831585126054238, -0.44219275113090734, -0.16287014748744458, 0.04304216821051299, 0.11040395748752298, 0.05531826384950899, -0.02818530658749585, -0.27993251393640534, 0.15861103664996606, -0.25463175743918376, -0.05737220847578806, -0.08125473972993129, -0.032548040934951505, -0.01572618164393015, -0.2184245924848332, -0.05406269481161905, 0.0229722084107626, 0.07953425706255415, -0.013778797680485958, -0.09774959849402587, -0.029743355784291037, 0.15868327968806098, -0.002988625829712984, 0.026243832560743544, 0.222142264869273, -0.08392491690113692, -0.1058967602907062, 0.34899594547731855, -0.02649435109740926, -0.1559637639710732, 0.22690003090668645, 0.003902303158220178, -0.1316222097228551, 0.1282789717492578, 0.23136586090549827, 0.10607319024160818, -0.15065256242311742, 0.07367568541925823, 0.020963431573168278, 0.24208280667292703, 0.07949681835418794, 0.01646909961111356, 0.12216680016581874, 0.1866549821165238, 0.023964543899501648, 0.15660893056263156, -0.1109829291324055, -0.06012589449637404, -0.24814508091136117, -0.1724166509556088, -0.16473802164927012, -0.025521519802789265, -0.1109641949644407, -0.13557494458063532, 0.3931122627588006, 0.1868459885699509, 0.13439989329378826, 0.08261294742865558, 0.3819539354500474, -0.011706039799098795, 0.1802636494182233, 0.22213078930617144, 0.11001751288362543, -0.035994919325947485, 0.12315844243014815, -0.1845859822975042, 0.13423595003017755, 0.008322116573831875] |
1,802.07063 | The $s$-wave scattering length of a Gaussian potential | We provide accurate expressions for the $s$-wave scattering length for a
Gaussian potential well in one, two and three spatial dimensions. The Gaussian
potential is widely used as a pseudopotential in the theoretical description of
ultracold atomic gases, where the $s$-wave scattering length is a physically
relevant parameter. We first describe a numerical procedure to compute the
value of the $s$-wave scattering length from the parameters of the Gaussian but
find that its accuracy is limited in the vicinity of singularities that result
from the formation of new bound states. We then derive simple analytical
expressions that capture the correct asymptotic behavior of the $s$-wave
scattering length near the bound states. Expressions that are increasingly
accurate in wide parameter regimes are found by a hierarchy of approximations
that capture an increasing number of bound states. The small number of
numerical coefficients that enter these expressions is determined from accurate
numerical calculations. The approximate formulas combine the advantages of the
numerical and approximate expressions, yielding an accurate and simple
description from the weakly to the strongly interacting limit.
| quant-ph | we provide accurate expressions for the swave scattering length for a gaussian potential well in one two and three spatial dimensions the gaussian potential is widely used as a pseudopotential in the theoretical description of ultracold atomic gases where the swave scattering length is a physically relevant parameter we first describe a numerical procedure to compute the value of the swave scattering length from the parameters of the gaussian but find that its accuracy is limited in the vicinity of singularities that result from the formation of new bound states we then derive simple analytical expressions that capture the correct asymptotic behavior of the swave scattering length near the bound states expressions that are increasingly accurate in wide parameter regimes are found by a hierarchy of approximations that capture an increasing number of bound states the small number of numerical coefficients that enter these expressions is determined from accurate numerical calculations the approximate formulas combine the advantages of the numerical and approximate expressions yielding an accurate and simple description from the weakly to the strongly interacting limit | [['we', 'provide', 'accurate', 'expressions', 'for', 'the', 'swave', 'scattering', 'length', 'for', 'a', 'gaussian', 'potential', 'well', 'in', 'one', 'two', 'and', 'three', 'spatial', 'dimensions', 'the', 'gaussian', 'potential', 'is', 'widely', 'used', 'as', 'a', 'pseudopotential', 'in', 'the', 'theoretical', 'description', 'of', 'ultracold', 'atomic', 'gases', 'where', 'the', 'swave', 'scattering', 'length', 'is', 'a', 'physically', 'relevant', 'parameter', 'we', 'first', 'describe', 'a', 'numerical', 'procedure', 'to', 'compute', 'the', 'value', 'of', 'the', 'swave', 'scattering', 'length', 'from', 'the', 'parameters', 'of', 'the', 'gaussian', 'but', 'find', 'that', 'its', 'accuracy', 'is', 'limited', 'in', 'the', 'vicinity', 'of', 'singularities', 'that', 'result', 'from', 'the', 'formation', 'of', 'new', 'bound', 'states', 'we', 'then', 'derive', 'simple', 'analytical', 'expressions', 'that', 'capture', 'the', 'correct', 'asymptotic', 'behavior', 'of', 'the', 'swave', 'scattering', 'length', 'near', 'the', 'bound', 'states', 'expressions', 'that', 'are', 'increasingly', 'accurate', 'in', 'wide', 'parameter', 'regimes', 'are', 'found', 'by', 'a', 'hierarchy', 'of', 'approximations', 'that', 'capture', 'an', 'increasing', 'number', 'of', 'bound', 'states', 'the', 'small', 'number', 'of', 'numerical', 'coefficients', 'that', 'enter', 'these', 'expressions', 'is', 'determined', 'from', 'accurate', 'numerical', 'calculations', 'the', 'approximate', 'formulas', 'combine', 'the', 'advantages', 'of', 'the', 'numerical', 'and', 'approximate', 'expressions', 'yielding', 'an', 'accurate', 'and', 'simple', 'description', 'from', 'the', 'weakly', 'to', 'the', 'strongly', 'interacting', 'limit']] | [-0.113304613888169, 0.1275348354903468, -0.09794791815749838, 0.10135202106393579, -0.031228818149321665, -0.1408350537820472, 0.03968250728606925, 0.31867688243924563, -0.22652882284821554, -0.2669687008611479, 0.0378229702444021, -0.2941806697533966, -0.14573439332593421, 0.22976315635556388, 0.06333151665994027, 0.08046910857997498, 0.03846754601730381, 0.05878617499950395, -0.09710122477842001, -0.19246417670747487, 0.30575524145963545, 0.036679848736562465, 0.27323333907867176, 0.10030473876049963, 0.04986887774561758, 0.014456874790922397, 0.008619908474932957, -0.015117161983550436, -0.19358017464097008, 0.13060262733787603, 0.2591596993244132, 0.04972892964855994, 0.19575961304586487, -0.43883015964664307, -0.2051946097606067, 0.05392307997845629, 0.2035898831028407, 0.1771304401290198, -0.018381451459806727, -0.259588935801833, 0.04477772432100554, -0.17696663399100682, -0.1834823694921988, -0.12398112546863024, 0.05782548269509512, 0.029869640392046107, -0.30575524269482174, 0.08385995721397133, 0.02287276550709128, 0.02026411988419753, -0.08486291136800464, -0.12174879106835036, 0.02794644949657811, 0.1190184383695198, 0.023149232295904792, -0.0295836385122453, 0.08265344262659802, -0.15752377766736989, -0.057060020341732576, 0.3483340931730082, -0.07690936075733965, -0.22071504372742295, 0.17527211677693463, -0.12055959554368072, -0.06601747258903069, 0.18997590191725452, 0.15032402513578988, 0.12690438407767266, -0.14800423836745955, 0.09063106386739456, -0.06067838883132669, 0.1590627705925644, 0.0691244357520725, 0.07241998982910425, 0.1813050713495346, 0.1440377350801886, 0.02360252924473946, 0.11673714358906793, -0.10217260032113494, -0.12902846620128738, -0.3262266863853076, -0.10309307850136995, -0.2028253669653214, 0.0016401065645034367, -0.12044621915873838, -0.191998057506747, 0.35195664310627905, 0.1677470410947746, 0.24063075033916256, 0.08224597849388539, 0.32145937568492305, 0.16991718161599922, 0.013011583521709605, 0.06486152207457833, 0.23615117030386618, 0.14126302898956178, -0.010249709647338269, -0.24916231609081144, 0.0667527422340492, 0.06288864664301949] |
1,802.07064 | Novel View Synthesis for Large-scale Scene using Adversarial Loss | Novel view synthesis aims to synthesize new images from different viewpoints
of given images. Most of previous works focus on generating novel views of
certain objects with a fixed background. However, for some applications, such
as virtual reality or robotic manipulations, large changes in background may
occur due to the egomotion of the camera. Generated images of a large-scale
environment from novel views may be distorted if the structure of the
environment is not considered. In this work, we propose a novel fully
convolutional network, that can take advantage of the structural information
explicitly by incorporating the inverse depth features. The inverse depth
features are obtained from CNNs trained with sparse labeled depth values. This
framework can easily fuse multiple images from different viewpoints. To fill
the missing textures in the generated image, adversarial loss is applied, which
can also improve the overall image quality. Our method is evaluated on the
KITTI dataset. The results show that our method can generate novel views of
large-scale scene without distortion. The effectiveness of our approach is
demonstrated through qualitative and quantitative evaluation.
| cs.CV | novel view synthesis aims to synthesize new images from different viewpoints of given images most of previous works focus on generating novel views of certain objects with a fixed background however for some applications such as virtual reality or robotic manipulations large changes in background may occur due to the egomotion of the camera generated images of a largescale environment from novel views may be distorted if the structure of the environment is not considered in this work we propose a novel fully convolutional network that can take advantage of the structural information explicitly by incorporating the inverse depth features the inverse depth features are obtained from cnns trained with sparse labeled depth values this framework can easily fuse multiple images from different viewpoints to fill the missing textures in the generated image adversarial loss is applied which can also improve the overall image quality our method is evaluated on the kitti dataset the results show that our method can generate novel views of largescale scene without distortion the effectiveness of our approach is demonstrated through qualitative and quantitative evaluation | [['novel', 'view', 'synthesis', 'aims', 'to', 'synthesize', 'new', 'images', 'from', 'different', 'viewpoints', 'of', 'given', 'images', 'most', 'of', 'previous', 'works', 'focus', 'on', 'generating', 'novel', 'views', 'of', 'certain', 'objects', 'with', 'a', 'fixed', 'background', 'however', 'for', 'some', 'applications', 'such', 'as', 'virtual', 'reality', 'or', 'robotic', 'manipulations', 'large', 'changes', 'in', 'background', 'may', 'occur', 'due', 'to', 'the', 'egomotion', 'of', 'the', 'camera', 'generated', 'images', 'of', 'a', 'largescale', 'environment', 'from', 'novel', 'views', 'may', 'be', 'distorted', 'if', 'the', 'structure', 'of', 'the', 'environment', 'is', 'not', 'considered', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'fully', 'convolutional', 'network', 'that', 'can', 'take', 'advantage', 'of', 'the', 'structural', 'information', 'explicitly', 'by', 'incorporating', 'the', 'inverse', 'depth', 'features', 'the', 'inverse', 'depth', 'features', 'are', 'obtained', 'from', 'cnns', 'trained', 'with', 'sparse', 'labeled', 'depth', 'values', 'this', 'framework', 'can', 'easily', 'fuse', 'multiple', 'images', 'from', 'different', 'viewpoints', 'to', 'fill', 'the', 'missing', 'textures', 'in', 'the', 'generated', 'image', 'adversarial', 'loss', 'is', 'applied', 'which', 'can', 'also', 'improve', 'the', 'overall', 'image', 'quality', 'our', 'method', 'is', 'evaluated', 'on', 'the', 'kitti', 'dataset', 'the', 'results', 'show', 'that', 'our', 'method', 'can', 'generate', 'novel', 'views', 'of', 'largescale', 'scene', 'without', 'distortion', 'the', 'effectiveness', 'of', 'our', 'approach', 'is', 'demonstrated', 'through', 'qualitative', 'and', 'quantitative', 'evaluation']] | [-0.04430696647096839, 0.03669241359457374, -0.08504640911188391, 0.03902300954020272, -0.11405718487092398, -0.111182318149238, -0.019543027948950315, 0.45037526316526866, -0.2949625116727677, -0.36164914183318614, 0.062443677608260056, -0.252404110972485, -0.21046165845796672, 0.1982323629768669, -0.1679558392484776, 0.05786149670158112, 0.13245233750074273, 0.010115174430474225, -0.07636104579238842, -0.2510308800627374, 0.33308802117697067, 0.023237950323770445, 0.34413263072363204, 0.02353034757737381, 0.11570198104147696, -0.016258147756646697, -0.04977970653756832, 0.046584440904229675, -0.02571440168127689, 0.17179700115525015, 0.27790163706781135, 0.1942509848339897, 0.2624787369419614, -0.4422009878688388, -0.2566358215951671, 0.045817795147498445, 0.12354024987402631, 0.13121492795633255, -0.08381547616639486, -0.3884785928401268, 0.11405631387347562, -0.11174621176388529, -0.009316607686277066, -0.12379597507210241, -0.06294892573366977, -0.02690635340695735, -0.29360011888622667, 0.019525264995010932, 0.042281841163316534, 0.06894023423083126, -0.07823101731094842, -0.09900291022058809, 0.004696251600722058, 0.22390912146333397, 0.01601633548270911, 0.03797208003428144, 0.13906269581057132, -0.20851537353559657, -0.11523878146512692, 0.3835835581438409, -0.04319263902984353, -0.20530381832892697, 0.20061315590929654, -0.07314389791895842, -0.11058759210476031, 0.15240860995836555, 0.23355140458685733, 0.14934391980318146, -0.16880090211860888, 0.020445842021338954, -0.08204513724841592, 0.194208287286003, 0.037815806195915985, -0.0012696900560210148, 0.20921416698191833, 0.18831221927992173, 0.007457088188837386, 0.1793646576820821, -0.16696652395961184, -0.02440459169447422, -0.24641452141190207, -0.07500603394065467, -0.21350420976264609, -0.0010763959428004455, -0.09653718583019023, -0.1363768515888498, 0.40614300065984327, 0.2729853370627906, 0.2660636991171891, 0.047699387576560386, 0.37831143670547235, 0.03361608838636635, 0.11822061783427165, 0.023001630493025813, 0.18109645152079692, -0.015187759354658839, 0.1059688354557794, -0.14124034330792104, 0.09640777504019853, 0.053790617612604466] |
1,802.07065 | Distributed Power Control in Downlink Cellular Massive MIMO Systems | This paper compares centralized and distributed methods to solve the power
minimization problem with quality-of-service (QoS) constraints in the downlink
(DL) of multi-cell Massive multiple-input multiple-output (MIMO) systems. In
particular, we study the computational complexity, number of parameters that
need to be exchanged between base stations (BSs), and the convergence of
iterative implementations. Although a distributed implementation based on dual
decomposition (which only requires statistical channel knowledge at each BS)
typically converges to the global optimum after a few iterations, many
parameters need to be exchanged to reach convergence.
| cs.IT math.IT | this paper compares centralized and distributed methods to solve the power minimization problem with qualityofservice qos constraints in the downlink dl of multicell massive multipleinput multipleoutput mimo systems in particular we study the computational complexity number of parameters that need to be exchanged between base stations bss and the convergence of iterative implementations although a distributed implementation based on dual decomposition which only requires statistical channel knowledge at each bs typically converges to the global optimum after a few iterations many parameters need to be exchanged to reach convergence | [['this', 'paper', 'compares', 'centralized', 'and', 'distributed', 'methods', 'to', 'solve', 'the', 'power', 'minimization', 'problem', 'with', 'qualityofservice', 'qos', 'constraints', 'in', 'the', 'downlink', 'dl', 'of', 'multicell', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'systems', 'in', 'particular', 'we', 'study', 'the', 'computational', 'complexity', 'number', 'of', 'parameters', 'that', 'need', 'to', 'be', 'exchanged', 'between', 'base', 'stations', 'bss', 'and', 'the', 'convergence', 'of', 'iterative', 'implementations', 'although', 'a', 'distributed', 'implementation', 'based', 'on', 'dual', 'decomposition', 'which', 'only', 'requires', 'statistical', 'channel', 'knowledge', 'at', 'each', 'bs', 'typically', 'converges', 'to', 'the', 'global', 'optimum', 'after', 'a', 'few', 'iterations', 'many', 'parameters', 'need', 'to', 'be', 'exchanged', 'to', 'reach', 'convergence']] | [-0.23481094966946023, -0.01150734805805462, -0.00678963451175375, -0.007077350905112755, -0.10888598601757601, -0.22195973070443012, 0.13860202317120862, 0.35162912704720256, -0.29075590816190405, -0.3192642554745413, 0.10570212295854443, -0.22468071286514235, -0.1290707275731845, 0.10975940681711426, -0.13337527982513891, 0.10715085306738535, 0.10889241149063024, 0.032414719106608564, -0.10961389853200468, -0.3043323982548848, 0.26331081438359666, 0.10427418384659157, 0.3607296546021204, -0.03936149956386411, 0.07392777760481734, -0.012003454562862602, 0.02074141118000523, -0.04150689503157072, -0.0495380223628161, 0.10195725940539387, 0.37948511375553823, 0.2617183303345372, 0.35292060623008215, -0.45276650614785346, -0.2142431942662329, 0.14906913364107272, 0.2558489188844903, 0.006486943288538815, -0.02983604147219298, -0.20001958706154582, 0.1598605580544204, -0.2202265544093392, -0.022544778674171213, -0.01756086555215415, -0.11095475752869349, 0.08540602805605682, -0.3970068717137335, 0.023453502130977223, -0.05599841064109017, 0.0424172996302669, -0.041267377544152606, -0.13445733526323952, 0.06166593860206979, 0.12516344395162685, 0.08058212216933038, -0.006280422877792394, 0.12663025220625856, -0.08279872189401492, -0.07507851121821597, 0.3686940648456973, 0.03385041283673785, -0.2894244709292824, 0.17301658387727553, -0.048809458553958476, -0.17799770364569228, 0.1575802941126435, 0.2892546690267961, 0.08660456709814875, -0.22264734064385797, 0.0694599984818023, 0.00028421683236956596, 0.20159874442494552, 0.07213577114338621, 0.12579233111327073, 0.1275831299580194, 0.23250069165217435, 0.195197722110034, 0.07853755469726964, -0.0696382848369324, -0.176538345393505, -0.2183884736673718, -0.10741833178849702, -0.22344262161281672, 0.00824213692960277, -0.11026844770478848, -0.07165518452235486, 0.33417446674841844, 0.16203827774047516, 0.11292798839132773, 0.1458952199769719, 0.4396323539157074, 0.11193976672810994, 0.05159964652933453, 0.19219703816944797, 0.19599349224227716, 0.146595975938724, 0.15554732601733856, -0.24097512572417767, 0.009306343932887226, 0.004191093868837597] |
1,802.07066 | Intrinsic, deductive, explicit, and algorithmic characterization of the
Szekeres-Szafron solutions | We write the known invariant definition of the Szekeres-Szafron family of
solutions in an intrinsic, deductive, explicit and algorithmic form. We also
intrinsically characterize the two commonly considered subfamilies, and analyze
other subclasses, also defined by first-order differential conditions.
Furthermore, we present a Rainich-like approach to these metrics.
| gr-qc | we write the known invariant definition of the szekeresszafron family of solutions in an intrinsic deductive explicit and algorithmic form we also intrinsically characterize the two commonly considered subfamilies and analyze other subclasses also defined by firstorder differential conditions furthermore we present a rainichlike approach to these metrics | [['we', 'write', 'the', 'known', 'invariant', 'definition', 'of', 'the', 'szekeresszafron', 'family', 'of', 'solutions', 'in', 'an', 'intrinsic', 'deductive', 'explicit', 'and', 'algorithmic', 'form', 'we', 'also', 'intrinsically', 'characterize', 'the', 'two', 'commonly', 'considered', 'subfamilies', 'and', 'analyze', 'other', 'subclasses', 'also', 'defined', 'by', 'firstorder', 'differential', 'conditions', 'furthermore', 'we', 'present', 'a', 'rainichlike', 'approach', 'to', 'these', 'metrics']] | [-0.14248223331473445, 0.021762189103869983, -0.07014288950670997, 0.15431325610362642, -0.10172933315271107, -0.13466521147031174, 0.015267459285931418, 0.3777587934999484, -0.30034415067537973, -0.3019553498648431, 0.10508821730289365, -0.24388918751324323, -0.2185333249685557, 0.18699146782898385, -0.08642252451618729, 0.062420221572013004, -0.023868464495298333, 0.03347394640719437, -0.11953580742904349, -0.2230121380366061, 0.3976932440823673, -0.0748770646750927, 0.2450104024787636, 0.02594676492330821, 0.10827856415720738, -0.06118516190706388, -0.06589450577840857, 0.0768590388495637, -0.2511124187958953, 0.13176689507520717, 0.2521982240166677, 0.16937464426028664, 0.19171144570345464, -0.34779690125066304, -0.12013142557976686, 0.11192262628490267, 0.13991802104789278, 0.08969784860053788, -0.029432561691425253, -0.2561446431538333, 0.08266826456858088, -0.1797116230363431, -0.1432231509167215, -0.15085582639617118, 0.01721444107470629, 0.03595914039760828, -0.22385793652400657, -0.010265261877540743, 0.1543419633526355, 0.04030996610653465, -0.08216760903799339, -0.0943826045334825, 0.024130657262108085, 0.07207559893393646, 0.020823219183670437, -0.07205338817616196, 0.0520850907019137, -0.08478855574377002, -0.13610345874305652, 0.3479522652759561, -0.07029441895935198, -0.2767600032561661, 0.18409675876002596, -0.06589467482357893, -0.19464079399957604, 0.05744439126599742, 0.15789140411652625, 0.1852177487200369, -0.23132982833877855, 0.05887874157886709, -0.01644586216982292, 0.13133466814685127, 0.1050027162241547, 0.09549283072271425, 0.11479899615211331, 0.0693661147404624, 0.04459377556391384, 0.20888565968767658, 0.013502095238832027, -0.1371574727008524, -0.32190262917024287, -0.17308711277766395, -0.05491304922970417, 0.06213203181877085, -0.07794519195411577, -0.21058845499773388, 0.4082279654128639, 0.12901543123323633, 0.16389810050959172, 0.08770789438858628, 0.25358802327157365, 0.14422907939423685, 0.026204232085982094, 0.07058452061660912, 0.19173765239184318, 0.11507304130709203, 0.021898457011126953, -0.16455250866609908, 0.0582534051095338, 0.10524530000174823] |
1,802.07067 | Analysis of Ward identities in supersymmetric Yang-Mills theory | In numerical investigations of supersymmetric Yang-Mills theory on a lattice,
the supersymmetric Ward identities are valuable for finding the critical value
of the hopping parameter and for examining the size of supersymmetry breaking
by the lattice discretisation. In this article we present an improved method
for the numerical analysis of supersymmetric Ward identities, which takes into
account the correlations between the various observables involved. We present
the first complete analysis of supersymmetric Ward identities in
$\mathcal{N}=1$ supersymmetric Yang-Mills theory with gauge group SU(3). The
results show that lattice artefacts scale to zero as $O(a^2)$ towards the
continuum limit in agreement with theoretical expectations.
| hep-lat | in numerical investigations of supersymmetric yangmills theory on a lattice the supersymmetric ward identities are valuable for finding the critical value of the hopping parameter and for examining the size of supersymmetry breaking by the lattice discretisation in this article we present an improved method for the numerical analysis of supersymmetric ward identities which takes into account the correlations between the various observables involved we present the first complete analysis of supersymmetric ward identities in mathcaln1 supersymmetric yangmills theory with gauge group su3 the results show that lattice artefacts scale to zero as oa2 towards the continuum limit in agreement with theoretical expectations | [['in', 'numerical', 'investigations', 'of', 'supersymmetric', 'yangmills', 'theory', 'on', 'a', 'lattice', 'the', 'supersymmetric', 'ward', 'identities', 'are', 'valuable', 'for', 'finding', 'the', 'critical', 'value', 'of', 'the', 'hopping', 'parameter', 'and', 'for', 'examining', 'the', 'size', 'of', 'supersymmetry', 'breaking', 'by', 'the', 'lattice', 'discretisation', 'in', 'this', 'article', 'we', 'present', 'an', 'improved', 'method', 'for', 'the', 'numerical', 'analysis', 'of', 'supersymmetric', 'ward', 'identities', 'which', 'takes', 'into', 'account', 'the', 'correlations', 'between', 'the', 'various', 'observables', 'involved', 'we', 'present', 'the', 'first', 'complete', 'analysis', 'of', 'supersymmetric', 'ward', 'identities', 'in', 'mathcaln1', 'supersymmetric', 'yangmills', 'theory', 'with', 'gauge', 'group', 'su3', 'the', 'results', 'show', 'that', 'lattice', 'artefacts', 'scale', 'to', 'zero', 'as', 'oa2', 'towards', 'the', 'continuum', 'limit', 'in', 'agreement', 'with', 'theoretical', 'expectations']] | [-0.10809357957100695, 0.1562177293440293, -0.09675092641851928, 0.08715571328721831, -0.048352382299535486, -0.10353385749526177, 0.04388922267792367, 0.3308413138034419, -0.15289616913453324, -0.26711754522566655, 0.10400718302936157, -0.30318207927590723, -0.1551597376254577, 0.10941380160200653, -0.0048432110223922825, 0.09739732063257868, 0.04689417492815302, -0.020858152174996664, -0.13204291973543325, -0.23631319447954013, 0.27847518851230085, 0.0024628860704166795, 0.2666165707180801, 0.10812215205932994, 0.04500926473150844, 0.04852756648550479, -0.05584653201106104, 0.0036195843408191666, -0.15392475929010932, 0.1365635590992647, 0.2039502980249699, 0.04302545449271509, 0.14253384500597288, -0.436943813254243, -0.20652786661301134, 0.05604788307462213, 0.18378302071342986, 0.15593447176698885, -0.024050341151627595, -0.3090585712366059, 0.05929027257704185, -0.15122235509639298, -0.179372783181782, -0.12386157570233867, -0.00846769979610153, -0.11017076786860679, -0.28557853882757095, 0.12110454642476098, -0.02682997074624686, 0.09633220313569006, -0.028109998247830323, -0.13501653662154867, -0.07397913597004253, 0.10861279139774445, 0.16161402450530854, 0.02348981235736927, 0.09325322538424392, -0.21401393613145117, -0.17057615412326838, 0.4258733005941059, -0.037356433277786934, -0.20866929508691417, 0.10002776760680293, -0.14735601586515754, -0.25356282288823456, 0.09874303599602534, 0.1153708540120171, 0.08711240469541365, -0.15693216422771655, 0.17035557894269004, -0.0917246522589867, 0.13632038551907155, 0.016648122195371436, 0.03935295253367902, 0.20414437389778858, 0.14322923189842873, 0.02835047414110413, 0.14688035288093232, 0.03877477623856834, -0.16096891428443413, -0.4753152358445149, -0.11588295216409905, -0.12501872633357794, 0.09577485236556278, -0.17469893576725934, -0.1555923859055326, 0.36344887263783554, 0.2185031480463312, 0.14579689283900468, 0.1153104871486594, 0.2024552130447791, 0.14278145788974372, 0.09329557392601538, -0.012669596667356283, 0.215389137888707, 0.15711962374026697, 0.09317830907072401, -0.2874884505855661, -0.1476830300621833, 0.21454279160904652] |
1,802.07068 | Talent vs Luck: the role of randomness in success and failure | The largely dominant meritocratic paradigm of highly competitive Western
cultures is rooted on the belief that success is due mainly, if not
exclusively, to personal qualities such as talent, intelligence, skills,
efforts or risk taking. Sometimes, we are willing to admit that a certain
degree of luck could also play a role in achieving significant material
success. But, as a matter of fact, it is rather common to underestimate the
importance of external forces in individual successful stories. It is very well
known that intelligence or talent exhibit a Gaussian distribution among the
population, whereas the distribution of wealth - considered a proxy of success
- follows typically a power law (Pareto law). Such a discrepancy between a
Normal distribution of inputs, with a typical scale, and the scale invariant
distribution of outputs, suggests that some hidden ingredient is at work behind
the scenes. In this paper, with the help of a very simple agent-based model, we
suggest that such an ingredient is just randomness. In particular, we show
that, if it is true that some degree of talent is necessary to be successful in
life, almost never the most talented people reach the highest peaks of success,
being overtaken by mediocre but sensibly luckier individuals. As to our
knowledge, this counterintuitive result - although implicitly suggested between
the lines in a vast literature - is quantified here for the first time. It
sheds new light on the effectiveness of assessing merit on the basis of the
reached level of success and underlines the risks of distributing excessive
honors or resources to people who, at the end of the day, could have been
simply luckier than others. With the help of this model, several policy
hypotheses are also addressed and compared to show the most efficient
strategies for public funding of research in order to improve meritocracy,
diversity and innovation.
| physics.soc-ph | the largely dominant meritocratic paradigm of highly competitive western cultures is rooted on the belief that success is due mainly if not exclusively to personal qualities such as talent intelligence skills efforts or risk taking sometimes we are willing to admit that a certain degree of luck could also play a role in achieving significant material success but as a matter of fact it is rather common to underestimate the importance of external forces in individual successful stories it is very well known that intelligence or talent exhibit a gaussian distribution among the population whereas the distribution of wealth considered a proxy of success follows typically a power law pareto law such a discrepancy between a normal distribution of inputs with a typical scale and the scale invariant distribution of outputs suggests that some hidden ingredient is at work behind the scenes in this paper with the help of a very simple agentbased model we suggest that such an ingredient is just randomness in particular we show that if it is true that some degree of talent is necessary to be successful in life almost never the most talented people reach the highest peaks of success being overtaken by mediocre but sensibly luckier individuals as to our knowledge this counterintuitive result although implicitly suggested between the lines in a vast literature is quantified here for the first time it sheds new light on the effectiveness of assessing merit on the basis of the reached level of success and underlines the risks of distributing excessive honors or resources to people who at the end of the day could have been simply luckier than others with the help of this model several policy hypotheses are also addressed and compared to show the most efficient strategies for public funding of research in order to improve meritocracy diversity and innovation | [['the', 'largely', 'dominant', 'meritocratic', 'paradigm', 'of', 'highly', 'competitive', 'western', 'cultures', 'is', 'rooted', 'on', 'the', 'belief', 'that', 'success', 'is', 'due', 'mainly', 'if', 'not', 'exclusively', 'to', 'personal', 'qualities', 'such', 'as', 'talent', 'intelligence', 'skills', 'efforts', 'or', 'risk', 'taking', 'sometimes', 'we', 'are', 'willing', 'to', 'admit', 'that', 'a', 'certain', 'degree', 'of', 'luck', 'could', 'also', 'play', 'a', 'role', 'in', 'achieving', 'significant', 'material', 'success', 'but', 'as', 'a', 'matter', 'of', 'fact', 'it', 'is', 'rather', 'common', 'to', 'underestimate', 'the', 'importance', 'of', 'external', 'forces', 'in', 'individual', 'successful', 'stories', 'it', 'is', 'very', 'well', 'known', 'that', 'intelligence', 'or', 'talent', 'exhibit', 'a', 'gaussian', 'distribution', 'among', 'the', 'population', 'whereas', 'the', 'distribution', 'of', 'wealth', 'considered', 'a', 'proxy', 'of', 'success', 'follows', 'typically', 'a', 'power', 'law', 'pareto', 'law', 'such', 'a', 'discrepancy', 'between', 'a', 'normal', 'distribution', 'of', 'inputs', 'with', 'a', 'typical', 'scale', 'and', 'the', 'scale', 'invariant', 'distribution', 'of', 'outputs', 'suggests', 'that', 'some', 'hidden', 'ingredient', 'is', 'at', 'work', 'behind', 'the', 'scenes', 'in', 'this', 'paper', 'with', 'the', 'help', 'of', 'a', 'very', 'simple', 'agentbased', 'model', 'we', 'suggest', 'that', 'such', 'an', 'ingredient', 'is', 'just', 'randomness', 'in', 'particular', 'we', 'show', 'that', 'if', 'it', 'is', 'true', 'that', 'some', 'degree', 'of', 'talent', 'is', 'necessary', 'to', 'be', 'successful', 'in', 'life', 'almost', 'never', 'the', 'most', 'talented', 'people', 'reach', 'the', 'highest', 'peaks', 'of', 'success', 'being', 'overtaken', 'by', 'mediocre', 'but', 'sensibly', 'luckier', 'individuals', 'as', 'to', 'our', 'knowledge', 'this', 'counterintuitive', 'result', 'although', 'implicitly', 'suggested', 'between', 'the', 'lines', 'in', 'a', 'vast', 'literature', 'is', 'quantified', 'here', 'for', 'the', 'first', 'time', 'it', 'sheds', 'new', 'light', 'on', 'the', 'effectiveness', 'of', 'assessing', 'merit', 'on', 'the', 'basis', 'of', 'the', 'reached', 'level', 'of', 'success', 'and', 'underlines', 'the', 'risks', 'of', 'distributing', 'excessive', 'honors', 'or', 'resources', 'to', 'people', 'who', 'at', 'the', 'end', 'of', 'the', 'day', 'could', 'have', 'been', 'simply', 'luckier', 'than', 'others', 'with', 'the', 'help', 'of', 'this', 'model', 'several', 'policy', 'hypotheses', 'are', 'also', 'addressed', 'and', 'compared', 'to', 'show', 'the', 'most', 'efficient', 'strategies', 'for', 'public', 'funding', 'of', 'research', 'in', 'order', 'to', 'improve', 'meritocracy', 'diversity', 'and', 'innovation']] | [-0.07192279979445677, 0.10450376748413921, -0.10433822926777218, 0.0995025263507973, -0.11290511188991859, -0.12967237771954387, 0.08198194639063379, 0.3873510470377943, -0.2423785326529086, -0.3396097937120909, 0.1015675179725421, -0.26077683037759636, -0.17192858582175655, 0.1941802250918332, -0.12322747527229551, 0.00387145937642536, 0.04335750562351773, 0.049250265230703485, 0.0322312622658118, -0.2910763387871588, 0.31284680116244235, 0.10031820593499824, 0.3088184083982541, 0.07281241775988172, 0.08877786518822081, -0.04612793876501536, -0.027760778578483854, 0.00021229215589731835, -0.05133021422795393, 0.13304716466671762, 0.28734789564776675, 0.18193387280840206, 0.360121527882783, -0.39850490809419026, -0.20482922070866488, 0.1344768947406249, 0.14573743490128485, 0.08661729760320955, -0.04843557687356798, -0.24182742099793886, 0.07222643988815865, -0.17951222614388634, -0.1444654521320971, -0.051473909400029744, 0.03173251667191691, 0.014283473718310952, -0.23291353134156548, 0.05367714555158225, 0.0773704307537532, 0.08101313126903015, -0.0007570993337522898, -0.13593371195441395, -0.014426170430899794, 0.17033312657823493, 0.09703312857585077, 0.033215703536610054, 0.12733950732418683, -0.19050041587156316, -0.104641793753552, 0.4017325188937033, -0.018250739602320352, -0.1546538008857935, 0.19610834059896756, -0.1336320345221075, -0.15398117776701264, 0.10283919107735671, 0.16054034203338424, 0.07294918597974749, -0.14567944251221457, 0.0017474751198039342, -0.03470071882168811, 0.1780403681565842, 0.05199380085602905, 0.04498823741098596, 0.21426743210983995, 0.17601031795646505, 0.0680156000703152, 0.06102234467700902, -0.028101040607189612, -0.12969142487389418, -0.24400938945473172, -0.1594443686764479, -0.19212724816507512, 0.04868827136263127, -0.05353998045508266, -0.13392939376889876, 0.3673881545071613, 0.17589052207461608, 0.17891557272026293, 0.053768401691884626, 0.2822978556624117, 0.06884720499587466, 0.09241573780309409, 0.07216023217417962, 0.24437085396474637, 0.05039357324130833, 0.08971539315289671, -0.1485407820356685, 0.19099098175808504, -0.024658681281021257] |
1,802.07069 | On regular frames near rotating black holes | We consider the metric of a generic axially symmetric rotating stationary
black hole. The general approach is developed that enables us to construct
coordinate frame regular near the horizon. As explicit examples, the Kerr and
Kerr-Newmann-(anti-)de Sitter metrics are considered. It is shown how the
rotational versions of the Painleve'-Gullstrand and Doran coordinates appear in
this scheme as particular cases. For the 2+1 version of the metric the direct
generalization of the Lema\^itre coordinate system is obtained. It is shown
that the possibility of introducing a regular frame is indirectly related to
the constancy of a black hole angular velocity and the rate with which the
metric coefficient responsible for the rotation of spacetime, tends to it.
| gr-qc hep-th | we consider the metric of a generic axially symmetric rotating stationary black hole the general approach is developed that enables us to construct coordinate frame regular near the horizon as explicit examples the kerr and kerrnewmannantide sitter metrics are considered it is shown how the rotational versions of the painlevegullstrand and doran coordinates appear in this scheme as particular cases for the 21 version of the metric the direct generalization of the lemaitre coordinate system is obtained it is shown that the possibility of introducing a regular frame is indirectly related to the constancy of a black hole angular velocity and the rate with which the metric coefficient responsible for the rotation of spacetime tends to it | [['we', 'consider', 'the', 'metric', 'of', 'a', 'generic', 'axially', 'symmetric', 'rotating', 'stationary', 'black', 'hole', 'the', 'general', 'approach', 'is', 'developed', 'that', 'enables', 'us', 'to', 'construct', 'coordinate', 'frame', 'regular', 'near', 'the', 'horizon', 'as', 'explicit', 'examples', 'the', 'kerr', 'and', 'kerrnewmannantide', 'sitter', 'metrics', 'are', 'considered', 'it', 'is', 'shown', 'how', 'the', 'rotational', 'versions', 'of', 'the', 'painlevegullstrand', 'and', 'doran', 'coordinates', 'appear', 'in', 'this', 'scheme', 'as', 'particular', 'cases', 'for', 'the', '21', 'version', 'of', 'the', 'metric', 'the', 'direct', 'generalization', 'of', 'the', 'lemaitre', 'coordinate', 'system', 'is', 'obtained', 'it', 'is', 'shown', 'that', 'the', 'possibility', 'of', 'introducing', 'a', 'regular', 'frame', 'is', 'indirectly', 'related', 'to', 'the', 'constancy', 'of', 'a', 'black', 'hole', 'angular', 'velocity', 'and', 'the', 'rate', 'with', 'which', 'the', 'metric', 'coefficient', 'responsible', 'for', 'the', 'rotation', 'of', 'spacetime', 'tends', 'to', 'it']] | [-0.13848745021447217, 0.049760817094497256, -0.08000900696236479, 0.08912805432517981, -0.09143437470855384, -0.14897895079700213, -0.030351217378508943, 0.3280676853891205, -0.21118713389070512, -0.23427041954208358, 0.11487261254585283, -0.2463963005956712, -0.1473820985551795, 0.1964843750064229, -0.08784997322725067, 0.03811494998055799, -0.0021295007539045966, 0.09388162119209702, -0.10767019359176128, -0.22272904650990627, 0.37211183922622226, 0.11663939457001357, 0.29083746941439037, -0.020331095273863394, 0.15754007232969564, 0.005460551034675205, -0.025345014198482486, 0.07311218375941186, -0.14819884797669083, 0.0778361209005856, 0.19135023032090273, 0.13994394074563452, 0.2036024918217726, -0.3226319207440548, -0.1997910403277211, 0.09413739557153192, 0.13306965162839082, 0.17908164867147772, -0.05263840856235314, -0.29097266854911014, 0.06466400970761053, -0.19921032502315938, -0.22001405098828777, -0.06963640774182718, 0.06974244232446052, -0.019518097882672888, -0.23905273008256636, 0.09493606398684969, 0.11410560592374733, -0.05847363798527332, -0.11667392981351064, 0.003661095134608833, -0.03685089368533728, 0.08786897152734535, 0.1159721430850713, 0.0635910023782595, 0.11959008398016208, -0.023204125571847443, -0.07867559434139523, 0.41541942671455184, -0.06429747821048609, -0.28054434540360396, 0.1559043363025733, -0.17767694946539042, -0.05706073405975797, 0.07557333642938013, 0.1445439198287204, 0.21085189067726506, -0.1367662590140565, 0.12139612332574526, -0.040531688301567115, 0.12278668140362274, 0.13228027191382416, 0.027528849754036917, 0.25823765667155385, 0.06336030949926774, 0.05930828388101935, 0.1556634088247565, -0.08967022132931342, -0.1284844403291635, -0.3222164003949227, -0.17341622739532514, -0.1439560445623697, 0.06567035588949661, -0.15208243080332037, -0.16746085133164687, 0.36812185928744745, 0.0747648348232956, 0.1691082606638043, 0.023754701268224945, 0.24576836567500543, 0.09938962482004265, 0.04963863425856006, 0.12023760671807646, 0.2988670560539347, 0.12432932306145286, 0.1405232605636762, -0.2279863871226553, -0.01872385358728934, 0.12818342840784744] |
1,802.0707 | 1/2-BPS D-branes from covariant open superstring in AdS$_4\times
\mathbf{CP}^3$ background | We consider the open superstring action in the AdS$_4 \times \mathbf{CP}^3$
background and investigate the suitable boundary conditions for the open
superstring describing the 1/2-BPS D-branes by imposing the $\kappa$-symmetry
of the action. This results in the classification of 1/2-BPS D-branes from
covariant open superstring. It is shown that the 1/2-BPS D-brane configurations
are restricted considerably by the K\"{a}hler structure on $\mathbf{CP}^3$. We
just consider D-branes without worldvolume fluxes.
| hep-th | we consider the open superstring action in the ads_4 times mathbfcp3 background and investigate the suitable boundary conditions for the open superstring describing the 12bps dbranes by imposing the kappasymmetry of the action this results in the classification of 12bps dbranes from covariant open superstring it is shown that the 12bps dbrane configurations are restricted considerably by the kahler structure on mathbfcp3 we just consider dbranes without worldvolume fluxes | [['we', 'consider', 'the', 'open', 'superstring', 'action', 'in', 'the', 'ads_4', 'times', 'mathbfcp3', 'background', 'and', 'investigate', 'the', 'suitable', 'boundary', 'conditions', 'for', 'the', 'open', 'superstring', 'describing', 'the', '12bps', 'dbranes', 'by', 'imposing', 'the', 'kappasymmetry', 'of', 'the', 'action', 'this', 'results', 'in', 'the', 'classification', 'of', '12bps', 'dbranes', 'from', 'covariant', 'open', 'superstring', 'it', 'is', 'shown', 'that', 'the', '12bps', 'dbrane', 'configurations', 'are', 'restricted', 'considerably', 'by', 'the', 'kahler', 'structure', 'on', 'mathbfcp3', 'we', 'just', 'consider', 'dbranes', 'without', 'worldvolume', 'fluxes']] | [-0.1850620311519563, 0.18653187850166275, -0.01633958935238205, 0.17070910512753154, -0.058530187932774425, -0.14139900374077802, -0.002528654215722412, 0.31874244324053114, -0.1108737630850595, -0.20650341352987764, 0.13069885280455693, -0.2204309177544454, -0.13859428351987962, 0.10641978334203578, -0.14518280749452178, 0.03181181692828735, 0.058015836659225, 0.07808510119608347, -0.10496109468605963, -0.32996466756541876, 0.42683201790719794, -0.03589082677997109, 0.30876173783579597, 0.05142736970109568, 0.10930347291455753, -0.0030541240534596686, -0.014986741828961649, -0.034775376569587686, -0.10077006166408166, 0.14445747940571627, 0.20399783222355705, 0.10511101362889336, 0.006811753269689886, -0.5126876222860554, -0.2497381892298227, 0.040583306484842215, 0.16563571224232082, 0.17021184993664856, 0.05618540563897324, -0.34031341098033, 0.04820281926515526, -0.07451477245954068, -0.18186319132160017, -0.04838596387982261, 0.025983479278890984, -0.12033024515308764, -0.18327200996935827, 0.029374174571231655, 0.004967558292159136, 0.023195108929834583, -0.12660777031956916, -0.05520793458149917, -0.08303099410419447, 0.08344731216683336, 0.150921449193434, 0.13000796583778076, 0.15905264082054296, -0.2733288667117502, -0.1392437359183163, 0.35101611750281375, -0.06534084190439055, -0.28912144672611484, 0.10644635649236, -0.10152588308235441, -0.20382516347951646, 0.06550802630574806, 0.017114509072532688, 0.21903419219281361, -0.21136647630297323, 0.31866021483944246, -0.010441939763225399, 0.04379173555998537, 0.18635486214138244, 0.04530287674371747, 0.28050060466731613, 0.10251314525047074, 0.07681668881812821, 0.1885830071936969, -0.01885742603706709, -0.11636082402201019, -0.44859859506613103, -0.06089682395880421, -0.028562713657384334, 0.24124805468633986, -0.1260869578469757, -0.19433943779617752, 0.3792714478340054, 0.0958422194302514, 0.18077526909663624, 0.028180206572447998, 0.15112725499531496, 0.07011362776646148, 0.05208300947603108, 0.09878500743998565, 0.19675565995545924, 0.1251976502134694, 0.05602404643761237, -0.29395268533878244, -0.2004328344449185, 0.20693493680353614] |
1,802.07071 | Probing quantum turbulence in $^4$He by quantum evaporation measurements | Theory of superfluid $^4$He shows that, due to strong correlations and
backflow effects, the density profile of a vortex line has the character of a
density modulation and it is not a simple rarefaction region as found in clouds
of cold bosonic atoms. We find that the basic features of this density
modulation are represented by a wave--packet of cylindrical symmetry in which
rotons with positive group velocity have a dominant role: The vortex density
modulation can be viewed as a cloud of virtual excitations, mainly rotons,
sustained by the phase of the vortex wave function. This suggests that in a
vortex reconnection some of these rotons become real so that a vortex tangle is
predicted to be a source of non-thermal rotons. The presence of such vorticity
induced rotons can be verified by measurements at low temperature of quantum
evaporation of $^4$He atoms. We estimate the rate of evaporation and this turns
out to be detectable by current instrumentation. Additional information on the
microscopic processes in the decay of quantum turbulence will be obtained if
quantum evaporation by high energy phonons should be detected.
| cond-mat.other cond-mat.quant-gas | theory of superfluid 4he shows that due to strong correlations and backflow effects the density profile of a vortex line has the character of a density modulation and it is not a simple rarefaction region as found in clouds of cold bosonic atoms we find that the basic features of this density modulation are represented by a wavepacket of cylindrical symmetry in which rotons with positive group velocity have a dominant role the vortex density modulation can be viewed as a cloud of virtual excitations mainly rotons sustained by the phase of the vortex wave function this suggests that in a vortex reconnection some of these rotons become real so that a vortex tangle is predicted to be a source of nonthermal rotons the presence of such vorticity induced rotons can be verified by measurements at low temperature of quantum evaporation of 4he atoms we estimate the rate of evaporation and this turns out to be detectable by current instrumentation additional information on the microscopic processes in the decay of quantum turbulence will be obtained if quantum evaporation by high energy phonons should be detected | [['theory', 'of', 'superfluid', '4he', 'shows', 'that', 'due', 'to', 'strong', 'correlations', 'and', 'backflow', 'effects', 'the', 'density', 'profile', 'of', 'a', 'vortex', 'line', 'has', 'the', 'character', 'of', 'a', 'density', 'modulation', 'and', 'it', 'is', 'not', 'a', 'simple', 'rarefaction', 'region', 'as', 'found', 'in', 'clouds', 'of', 'cold', 'bosonic', 'atoms', 'we', 'find', 'that', 'the', 'basic', 'features', 'of', 'this', 'density', 'modulation', 'are', 'represented', 'by', 'a', 'wavepacket', 'of', 'cylindrical', 'symmetry', 'in', 'which', 'rotons', 'with', 'positive', 'group', 'velocity', 'have', 'a', 'dominant', 'role', 'the', 'vortex', 'density', 'modulation', 'can', 'be', 'viewed', 'as', 'a', 'cloud', 'of', 'virtual', 'excitations', 'mainly', 'rotons', 'sustained', 'by', 'the', 'phase', 'of', 'the', 'vortex', 'wave', 'function', 'this', 'suggests', 'that', 'in', 'a', 'vortex', 'reconnection', 'some', 'of', 'these', 'rotons', 'become', 'real', 'so', 'that', 'a', 'vortex', 'tangle', 'is', 'predicted', 'to', 'be', 'a', 'source', 'of', 'nonthermal', 'rotons', 'the', 'presence', 'of', 'such', 'vorticity', 'induced', 'rotons', 'can', 'be', 'verified', 'by', 'measurements', 'at', 'low', 'temperature', 'of', 'quantum', 'evaporation', 'of', '4he', 'atoms', 'we', 'estimate', 'the', 'rate', 'of', 'evaporation', 'and', 'this', 'turns', 'out', 'to', 'be', 'detectable', 'by', 'current', 'instrumentation', 'additional', 'information', 'on', 'the', 'microscopic', 'processes', 'in', 'the', 'decay', 'of', 'quantum', 'turbulence', 'will', 'be', 'obtained', 'if', 'quantum', 'evaporation', 'by', 'high', 'energy', 'phonons', 'should', 'be', 'detected']] | [-0.16164060763360277, 0.25426762702723815, -0.11395396504400147, 0.0689815371316178, -0.027638400367435974, -0.10285362811960481, 0.02033021416376672, 0.33589673118313423, -0.27070516335299694, -0.24302993526531233, 0.04684622518441363, -0.26137218912937554, -0.08296900894146765, 0.1731248461263808, 0.03359714375063148, 0.006760327098261867, 0.025144464124900262, 0.023011330630932306, -0.02524411089000972, -0.1999639415924714, 0.3146405257712546, 0.09051136760406095, 0.26303670469017043, 0.11698755601269974, 0.04305534894685135, -0.07103079280161576, 0.014228847222654401, 0.04328244661761297, -0.12167822261595772, 0.05505712995355999, 0.24264062915903492, 0.04124471968341921, 0.2032985100396783, -0.4618392622450719, -0.2823552714610422, 0.06609919163071223, 0.200800837196309, 0.15096186110734108, -0.06587025406455772, -0.30008404337473815, 0.04717415591852891, -0.18919198767760315, -0.15552535218413213, -0.06388077507600994, 0.05012989537129682, 0.05337989721698938, -0.23248911980866782, 0.10681474773162926, 0.07226903974959577, 0.06435366114349785, -0.04171303058345173, -0.046065231986545226, -0.07403995165903424, 0.03839532480247923, 0.03449707634092585, 0.05276483623940196, 0.18423839904732903, -0.16324372911146162, -0.05941863164205004, 0.38625153396530326, -0.09458193099000366, -0.14957823010312543, 0.14966496767325177, -0.1646655500702862, -0.06231043178940544, 0.21373904007109437, 0.12908292767321186, 0.06425130169561787, -0.07928029709319408, 0.012185073990494365, -0.06206602182332112, 0.17169819587740948, 0.09618880419261955, 0.05635943492069035, 0.31668620671623865, 0.11649259149625495, 0.0267168377513519, 0.13826731529112, -0.1423668849948995, -0.07294787663865734, -0.2938585565098234, -0.17390365414321424, -0.227185207478249, 0.061818037478165146, -0.022103213767813695, -0.16250967000787322, 0.34845789235487984, 0.09440800995358291, 0.1969481617808531, -0.07256080648370994, 0.28416523978214814, 0.1669680032142866, 0.0868417543761835, 0.06715862764095938, 0.27164265111771513, 0.1654665696296237, 0.08095743619660671, -0.26967170181608685, 0.056400856687813195, 0.03248949210234993] |
1,802.07072 | Composite Optimization by Nonconvex Majorization-Minimization | The minimization of a nonconvex composite function can model a variety of
imaging tasks. A popular class of algorithms for solving such problems are
majorization-minimization techniques which iteratively approximate the
composite nonconvex function by a majorizing function that is easy to minimize.
Most techniques, e.g. gradient descent, utilize convex majorizers in order to
guarantee that the majorizer is easy to minimize. In our work we consider a
natural class of nonconvex majorizers for these functions, and show that these
majorizers are still sufficient for a globally convergent optimization scheme.
Numerical results illustrate that by applying this scheme, one can often obtain
superior local optima compared to previous majorization-minimization methods,
when the nonconvex majorizers are solved to global optimality. Finally, we
illustrate the behavior of our algorithm for depth super-resolution from raw
time-of-flight data.
| math.OC cs.CV math.NA | the minimization of a nonconvex composite function can model a variety of imaging tasks a popular class of algorithms for solving such problems are majorizationminimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize most techniques eg gradient descent utilize convex majorizers in order to guarantee that the majorizer is easy to minimize in our work we consider a natural class of nonconvex majorizers for these functions and show that these majorizers are still sufficient for a globally convergent optimization scheme numerical results illustrate that by applying this scheme one can often obtain superior local optima compared to previous majorizationminimization methods when the nonconvex majorizers are solved to global optimality finally we illustrate the behavior of our algorithm for depth superresolution from raw timeofflight data | [['the', 'minimization', 'of', 'a', 'nonconvex', 'composite', 'function', 'can', 'model', 'a', 'variety', 'of', 'imaging', 'tasks', 'a', 'popular', 'class', 'of', 'algorithms', 'for', 'solving', 'such', 'problems', 'are', 'majorizationminimization', 'techniques', 'which', 'iteratively', 'approximate', 'the', 'composite', 'nonconvex', 'function', 'by', 'a', 'majorizing', 'function', 'that', 'is', 'easy', 'to', 'minimize', 'most', 'techniques', 'eg', 'gradient', 'descent', 'utilize', 'convex', 'majorizers', 'in', 'order', 'to', 'guarantee', 'that', 'the', 'majorizer', 'is', 'easy', 'to', 'minimize', 'in', 'our', 'work', 'we', 'consider', 'a', 'natural', 'class', 'of', 'nonconvex', 'majorizers', 'for', 'these', 'functions', 'and', 'show', 'that', 'these', 'majorizers', 'are', 'still', 'sufficient', 'for', 'a', 'globally', 'convergent', 'optimization', 'scheme', 'numerical', 'results', 'illustrate', 'that', 'by', 'applying', 'this', 'scheme', 'one', 'can', 'often', 'obtain', 'superior', 'local', 'optima', 'compared', 'to', 'previous', 'majorizationminimization', 'methods', 'when', 'the', 'nonconvex', 'majorizers', 'are', 'solved', 'to', 'global', 'optimality', 'finally', 'we', 'illustrate', 'the', 'behavior', 'of', 'our', 'algorithm', 'for', 'depth', 'superresolution', 'from', 'raw', 'timeofflight', 'data']] | [-0.032359639294725615, -0.04688874135648174, -0.10950448383626185, 0.11475804174770567, -0.09426451634783718, -0.17551474359334635, 0.006123316128295321, 0.44065884303973807, -0.35276977274010196, -0.31235398363218736, 0.14838198004500533, -0.2258657079638171, -0.21572235265844747, 0.2272745441992004, -0.1207594625298214, 0.15683205795905, 0.08528136431862761, -0.06045225540638194, -0.13549741037554086, -0.3116339940903358, 0.257554218551158, -0.010654741961200883, 0.27179326803276416, 0.040353954475569095, 0.12114596080570657, -0.003100420162781961, 0.0367735975222396, 0.06115836258303668, -0.07763178798626527, 0.15630301684570058, 0.3225315213623576, 0.20779735466843485, 0.35555471205397654, -0.41848695314580336, -0.20355880762541428, 0.1358458945401629, 0.15051649538027664, 0.08775311079194867, -0.057506195731685125, -0.21735150532979042, 0.140703122773999, -0.0922386060938015, -0.07045311442597356, -0.16833746564903654, -0.08735411480433286, 0.089968999481893, -0.3867131829387823, 0.05944929497414514, 0.008684413272999507, 0.003849536838724201, -0.07655472632784649, -0.13775934561687922, 0.05767839862369841, 0.03166297756952122, 0.06002668158809437, 0.0750401037766185, 0.10698418512667313, -0.1094930022447265, -0.12460906694195044, 0.34646599856730464, -0.021091999622198397, -0.2482702040614182, 0.17925106540245278, -0.010959445239793985, -0.13769267659977472, 0.16270977458251373, 0.2095753681369798, 0.2186148923636183, -0.18151298322755566, 0.06496682922361083, -0.06682992931735471, 0.1287591586736752, 0.009247708466968365, -0.025350137851796205, 0.09631788189508918, 0.13759444251873607, 0.20221383457205125, 0.17040015804175204, -0.037398329166138784, -0.10954261714018378, -0.2622323212444894, -0.11020322116021823, -0.24110324584871978, -0.024885056559626657, -0.0942661608043048, -0.13930645793032154, 0.37379748532319873, 0.16738124103180335, 0.18975183416746164, 0.13866560545984544, 0.3588171107484434, 0.12079696505657866, 0.06604618602957492, 0.08365511181379172, 0.21031531174772217, 0.08169373202389736, 0.058166397644444964, -0.21767460712830403, 0.04445622050635783, 0.1070567869399219] |
1,802.07073 | Robust Maximization of Non-Submodular Objectives | We study the problem of maximizing a monotone set function subject to a
cardinality constraint $k$ in the setting where some number of elements $\tau$
is deleted from the returned set. The focus of this work is on the worst-case
adversarial setting. While there exist constant-factor guarantees when the
function is submodular, there are no guarantees for non-submodular objectives.
In this work, we present a new algorithm Oblivious-Greedy and prove the first
constant-factor approximation guarantees for a wider class of non-submodular
objectives. The obtained theoretical bounds are the first constant-factor
bounds that also hold in the linear regime, i.e. when the number of deletions
$\tau$ is linear in $k$. Our bounds depend on established parameters such as
the submodularity ratio and some novel ones such as the inverse curvature. We
bound these parameters for two important objectives including support selection
and variance reduction. Finally, we numerically demonstrate the robust
performance of Oblivious-Greedy for these two objectives on various datasets.
| stat.ML cs.AI cs.DS cs.LG | we study the problem of maximizing a monotone set function subject to a cardinality constraint k in the setting where some number of elements tau is deleted from the returned set the focus of this work is on the worstcase adversarial setting while there exist constantfactor guarantees when the function is submodular there are no guarantees for nonsubmodular objectives in this work we present a new algorithm obliviousgreedy and prove the first constantfactor approximation guarantees for a wider class of nonsubmodular objectives the obtained theoretical bounds are the first constantfactor bounds that also hold in the linear regime ie when the number of deletions tau is linear in k our bounds depend on established parameters such as the submodularity ratio and some novel ones such as the inverse curvature we bound these parameters for two important objectives including support selection and variance reduction finally we numerically demonstrate the robust performance of obliviousgreedy for these two objectives on various datasets | [['we', 'study', 'the', 'problem', 'of', 'maximizing', 'a', 'monotone', 'set', 'function', 'subject', 'to', 'a', 'cardinality', 'constraint', 'k', 'in', 'the', 'setting', 'where', 'some', 'number', 'of', 'elements', 'tau', 'is', 'deleted', 'from', 'the', 'returned', 'set', 'the', 'focus', 'of', 'this', 'work', 'is', 'on', 'the', 'worstcase', 'adversarial', 'setting', 'while', 'there', 'exist', 'constantfactor', 'guarantees', 'when', 'the', 'function', 'is', 'submodular', 'there', 'are', 'no', 'guarantees', 'for', 'nonsubmodular', 'objectives', 'in', 'this', 'work', 'we', 'present', 'a', 'new', 'algorithm', 'obliviousgreedy', 'and', 'prove', 'the', 'first', 'constantfactor', 'approximation', 'guarantees', 'for', 'a', 'wider', 'class', 'of', 'nonsubmodular', 'objectives', 'the', 'obtained', 'theoretical', 'bounds', 'are', 'the', 'first', 'constantfactor', 'bounds', 'that', 'also', 'hold', 'in', 'the', 'linear', 'regime', 'ie', 'when', 'the', 'number', 'of', 'deletions', 'tau', 'is', 'linear', 'in', 'k', 'our', 'bounds', 'depend', 'on', 'established', 'parameters', 'such', 'as', 'the', 'submodularity', 'ratio', 'and', 'some', 'novel', 'ones', 'such', 'as', 'the', 'inverse', 'curvature', 'we', 'bound', 'these', 'parameters', 'for', 'two', 'important', 'objectives', 'including', 'support', 'selection', 'and', 'variance', 'reduction', 'finally', 'we', 'numerically', 'demonstrate', 'the', 'robust', 'performance', 'of', 'obliviousgreedy', 'for', 'these', 'two', 'objectives', 'on', 'various', 'datasets']] | [-0.13690876744829925, 0.04349522767766456, -0.02497378605044192, 0.10191257055225977, -0.07504656423583247, -0.14652597046439436, 0.09338119731708815, 0.3762932563301437, -0.26239155819580245, -0.32041053728431845, 0.1048338595187517, -0.26312365232830404, -0.17273905748059487, 0.21653995301076182, -0.07841419525649161, 0.13327851103526794, 0.06083301153140747, 0.03792833409177222, -0.06104764121786282, -0.31570415402937585, 0.31263226520709075, -0.001728324126155608, 0.23873150049097788, 0.09871438592909627, 0.052279372757395644, -0.006240444908891419, 0.009274052407082383, 0.05846046379939386, -0.1749288991665424, 0.0760326179531907, 0.25686037315613336, 0.20709872910616456, 0.3441776549384283, -0.39394339255893684, -0.1592613723793417, 0.16089647109353333, 0.08887186017818749, 0.061881627625831, -0.07031415624671562, -0.210272307353462, 0.10334519743415153, -0.10197111578516597, -0.02650682550742273, -0.06757441414876064, -0.008957214745437833, 0.03643438168823612, -0.34972966957694973, -0.004625251628109996, 0.1224568625467171, 0.0235485342111747, -0.06951534172081074, -0.20675659431055615, 0.06695594181896894, 0.09593531799504154, 0.08085258990217736, 0.025845706378329236, 0.05045996902356292, -0.12682492042755245, -0.1321637701320278, 0.3605608729004955, -0.06620309773460327, -0.22574731198014916, 0.15311725374354215, -0.09246705357833605, -0.20468274092266134, 0.10174865557687582, 0.22070503726032129, 0.16350417862391206, -0.12323833958510529, 0.11799804562188175, -0.11078492188410964, 0.13735385135907657, 0.058025626975829435, 0.08657323037182237, 0.09356930385236954, 0.1656221970426405, 0.19361351687938663, 0.16987497867292659, -0.02383032490226446, -0.07360950880535659, -0.3309704773246672, -0.11151350347012293, -0.20356451302313003, -0.011477650718609239, -0.12442782764135085, -0.14761980176031306, 0.3851952359590466, 0.1354065903693817, 0.20281044642328266, 0.19074512033420762, 0.3229845422942927, 0.12216727107049227, -0.008099235015903499, 0.13714971326908487, 0.2571048246667673, 0.0824162611933603, 0.011362377686165036, -0.19669040102640664, 0.1277260977395211, 0.06215198371547517] |
1,802.07074 | Electronic States and Possible Origin of the Orbital-Glass State in a
Nearly Metallic Spinel Cobalt Vanadate: An X-ray Magnetic Circular Dichroism
Study | We have investigated the orbital states of the orbital-glassy (short-range
orbital ordered) spinel vanadate Co$_{1.21}$V$_{1.79}$O$_{4}$ using x-ray
absorption spectroscopy (XAS), x-ray magnetic circular dichroism (XMCD), and
subsequent configuration-interaction cluster-model calculation. From the sign
of the XMCD spectra, it was found that the spin magnetic moment of the Co ion
is aligned parallel to the applied magnetic field and that of the V ion
anti-parallel to it, consistent with neutron scattering studies. It was
revealed that the excess Co ions at the octahedral site take the trivalent
low-spin state, and induce a random potential to the V sublattice. The orbital
magnetic moment of the V ion is small although finite, suggesting that the
ordered orbitals mainly consists of real-number orbitals.
| cond-mat.str-el | we have investigated the orbital states of the orbitalglassy shortrange orbital ordered spinel vanadate co_121v_179o_4 using xray absorption spectroscopy xas xray magnetic circular dichroism xmcd and subsequent configurationinteraction clustermodel calculation from the sign of the xmcd spectra it was found that the spin magnetic moment of the co ion is aligned parallel to the applied magnetic field and that of the v ion antiparallel to it consistent with neutron scattering studies it was revealed that the excess co ions at the octahedral site take the trivalent lowspin state and induce a random potential to the v sublattice the orbital magnetic moment of the v ion is small although finite suggesting that the ordered orbitals mainly consists of realnumber orbitals | [['we', 'have', 'investigated', 'the', 'orbital', 'states', 'of', 'the', 'orbitalglassy', 'shortrange', 'orbital', 'ordered', 'spinel', 'vanadate', 'co_121v_179o_4', 'using', 'xray', 'absorption', 'spectroscopy', 'xas', 'xray', 'magnetic', 'circular', 'dichroism', 'xmcd', 'and', 'subsequent', 'configurationinteraction', 'clustermodel', 'calculation', 'from', 'the', 'sign', 'of', 'the', 'xmcd', 'spectra', 'it', 'was', 'found', 'that', 'the', 'spin', 'magnetic', 'moment', 'of', 'the', 'co', 'ion', 'is', 'aligned', 'parallel', 'to', 'the', 'applied', 'magnetic', 'field', 'and', 'that', 'of', 'the', 'v', 'ion', 'antiparallel', 'to', 'it', 'consistent', 'with', 'neutron', 'scattering', 'studies', 'it', 'was', 'revealed', 'that', 'the', 'excess', 'co', 'ions', 'at', 'the', 'octahedral', 'site', 'take', 'the', 'trivalent', 'lowspin', 'state', 'and', 'induce', 'a', 'random', 'potential', 'to', 'the', 'v', 'sublattice', 'the', 'orbital', 'magnetic', 'moment', 'of', 'the', 'v', 'ion', 'is', 'small', 'although', 'finite', 'suggesting', 'that', 'the', 'ordered', 'orbitals', 'mainly', 'consists', 'of', 'realnumber', 'orbitals']] | [-0.13341413981193662, 0.2210834345095751, 0.02237379376211355, 0.036691162924274295, -0.027477448063894596, -0.09989149568395482, 0.04193524801486737, 0.4624432732279484, -0.2735900465303507, -0.2712400425543897, -0.06105873930769471, -0.3865068847070743, -0.016320055048180442, 0.09443809936603165, 0.14236441941565683, -0.02605237976576273, 0.04953877633819596, -0.012909606091168702, -0.09033739864507802, -0.20990119071510166, 0.25389732744616383, 0.07266302967571422, 0.25893609398084444, 0.07729359398174107, 0.03792514937778569, 0.0601417942561655, 0.11956272510668406, 0.06154102365621644, -0.062019245564971424, 0.10243418555394308, 0.23073180607504123, -0.02619717800273345, 0.115388569710617, -0.45254805005099785, -0.15149144584941876, -0.03042721043094101, 0.11460346551129444, 0.12632002683483765, -0.08246175610484222, -0.2586875694533253, 0.05654436798018013, -0.1249251987816941, -0.1336462924248961, -0.10493458658218002, 0.04356404072823974, 0.048789837099134155, -0.29240878383254904, 0.08978247580826919, 0.10649932494474591, 0.1479687774255394, -0.1853339730634585, -0.18131824545403066, -0.16452385547658444, -0.008941505267483812, 0.09057338758268291, 0.126311524483225, 0.1555426438561935, 0.01295506877776904, -0.12741740034001633, 0.3634278777286283, -0.03373105402112517, -0.008718852813427266, 0.1438745671278015, -0.28198031292139736, -0.14540320622503886, 0.22042647394367582, 0.06047330368270413, 0.16050678798650256, -0.1082532863634137, 0.09325858913252576, -0.03813622799168667, 0.21603461763217452, 0.07602510005275472, 0.03023699438597402, 0.26909715126658607, 0.08724675425845715, 0.038624638217923224, 0.13270467410944142, -0.25781954099766463, -0.01214852504647122, -0.1459370961922229, -0.1308150572628161, -0.24100459249825495, 0.04818373908172859, -0.029496491520141218, -0.19805472822955403, 0.3546852974865872, 0.11175341927645425, 0.14960220702187532, -0.1478342294263152, 0.2478471658168695, 0.10115781332501489, 0.07151874907824218, 0.01974127649799244, 0.25259428541375023, 0.26058950759948063, 0.1420098650468211, -0.3913502709713215, 0.1256837147192504, 0.025018408826878693] |
1,802.07075 | Extended $r$-spin theory and the mirror symmetry for the
$A_{r-1}$-singularity | By a famous result of K. Saito, the parameter space of the miniversal
deformation of the $A_{r-1}$-singularity carries a Frobenius manifold
structure. The Landau-Ginzburg mirror symmetry says that, in the flat
coordinates, the potential of this Frobenius manifold is equal to the
generating series of certain integrals over the moduli space of $r$-spin
curves. In this paper we show that the parameters of the miniversal
deformation, considered as functions of the flat coordinates, also have a
simple geometric interpretation using the extended $r$-spin theory, first
considered by T. J. Jarvis, T. Kimura and A. Vaintrob, and studied in a recent
paper of E. Clader, R. J. Tessler and the author. We prove a similar result for
the singularity $D_4$ and present conjectures for the singularities $E_6$ and
$E_8$.
| math.AG math-ph math.MP | by a famous result of k saito the parameter space of the miniversal deformation of the a_r1singularity carries a frobenius manifold structure the landauginzburg mirror symmetry says that in the flat coordinates the potential of this frobenius manifold is equal to the generating series of certain integrals over the moduli space of rspin curves in this paper we show that the parameters of the miniversal deformation considered as functions of the flat coordinates also have a simple geometric interpretation using the extended rspin theory first considered by t j jarvis t kimura and a vaintrob and studied in a recent paper of e clader r j tessler and the author we prove a similar result for the singularity d_4 and present conjectures for the singularities e_6 and e_8 | [['by', 'a', 'famous', 'result', 'of', 'k', 'saito', 'the', 'parameter', 'space', 'of', 'the', 'miniversal', 'deformation', 'of', 'the', 'a_r1singularity', 'carries', 'a', 'frobenius', 'manifold', 'structure', 'the', 'landauginzburg', 'mirror', 'symmetry', 'says', 'that', 'in', 'the', 'flat', 'coordinates', 'the', 'potential', 'of', 'this', 'frobenius', 'manifold', 'is', 'equal', 'to', 'the', 'generating', 'series', 'of', 'certain', 'integrals', 'over', 'the', 'moduli', 'space', 'of', 'rspin', 'curves', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'parameters', 'of', 'the', 'miniversal', 'deformation', 'considered', 'as', 'functions', 'of', 'the', 'flat', 'coordinates', 'also', 'have', 'a', 'simple', 'geometric', 'interpretation', 'using', 'the', 'extended', 'rspin', 'theory', 'first', 'considered', 'by', 't', 'j', 'jarvis', 't', 'kimura', 'and', 'a', 'vaintrob', 'and', 'studied', 'in', 'a', 'recent', 'paper', 'of', 'e', 'clader', 'r', 'j', 'tessler', 'and', 'the', 'author', 'we', 'prove', 'a', 'similar', 'result', 'for', 'the', 'singularity', 'd_4', 'and', 'present', 'conjectures', 'for', 'the', 'singularities', 'e_6', 'and', 'e_8']] | [-0.18674460230541862, 0.04862069870953954, -0.12569507777573555, 0.07686913111265456, -0.07616165585405245, -0.12107647385624215, 0.002205482232164386, 0.27909086971712393, -0.2787737165702375, -0.2371055731736857, 0.06941212092683922, -0.19811569613323907, -0.19940458672253167, 0.1485886328861, -0.13410397910872313, -0.004504495828346474, 0.012244440567511039, 0.054412389207103354, -0.12251945634420199, -0.3057998580561115, 0.393400171415983, 0.01288188323671893, 0.20960813381490995, 0.029481860094953065, 0.12027885348858737, 0.04876092521979759, -0.015833277874956215, -0.01721800912921427, -0.19929530336688855, 0.14074060603917585, 0.2562087010243893, 0.05291219318182919, 0.17145910674493436, -0.3436035165475227, -0.19432867878651994, 0.12161295751740378, 0.11326283075872856, 0.03479913328810939, 0.005281012235796006, -0.26498771505797003, 0.08041366664912757, -0.1758487091480395, -0.19331628640042983, -0.07975337971881853, 0.08897778874732495, 0.010154415501325618, -0.21874756789738753, 0.03144092578234657, 0.11863286851164628, 0.10869433309178887, -0.06863525685098931, -0.11677666679831354, -0.07276610435741976, 0.023561159750138682, 0.039495845269375135, 0.08029130272435274, 0.053087382277613136, -0.10220377544293135, -0.11875635999672877, 0.356180227053623, -0.06825903323240666, -0.1828392899419203, 0.08315036974766651, -0.13933080452765653, -0.16381963054048204, 0.10127959558630259, 0.055871372323805894, 0.1760532401106137, -0.04697227604147762, 0.23815769288738398, -0.10791216253309407, 0.03286733946902311, 0.13536867261754246, -0.052750804960199696, 0.131122996033294, 0.08148030918384866, 0.03975951716883152, 0.10847198958857, -0.041961256623649454, -0.05066822217704039, -0.39177776597381575, -0.21683956918354313, -0.17388443535516465, 0.13278715711409653, -0.10515230540935533, -0.1536423281077149, 0.41461283739245547, 0.022899860061529116, 0.2760434022510615, 0.06714108960123688, 0.18021191922969765, 0.04284497120831983, 0.05368713537729749, 0.03377610707186221, 0.16977853389222206, 0.1873656436837623, 0.050514893843719044, -0.17290635241606223, -0.07255904283649545, 0.18255418743278215] |
1,802.07076 | Implosive collapse about magnetic null points: A quantitative comparison
between 2D and 3D nulls | Null collapse is an implosive process whereby MHD waves focus their energy in
the vicinity of a null point, forming a current sheet and initiating magnetic
reconnection. We consider, for the first time, the case of collapsing 3D
magnetic null points in nonlinear, resistive MHD using numerical simulation,
exploring key physical aspects of the system as well as performing a detailed
parameter study. We find that within a particular plane containing the 3D null,
the plasma and current density enhancements resulting from the collapse are
quantitatively and qualitatively as per the 2D case in both the linear and
nonlinear collapse regimes. However, the scaling with resistivity of the 3D
reconnection rate - which is a global quantity - is found to be less favourable
when the magnetic null point is more rotationally symmetric, due to the action
of increased magnetic back-pressure. Furthermore, we find that with increasing
ambient plasma pressure the collapse can be throttled, as is the case for 2D
nulls. We discuss this pressure-limiting in the context of fast reconnection in
the solar atmosphere and suggest mechanisms by which it may be overcome. We
also discuss the implications of the results in the context of null collapse as
a trigger mechanism of Oscillatory Reconnection, a time-dependent reconnection
mechanism, and also within the wider subject of wave-null point interactions.
We conclude that, in general, increasingly rotationally-asymmetric nulls will
be more favourable in terms of magnetic energy release via null collapse than
their more symmetric counterparts.
| astro-ph.SR physics.flu-dyn physics.plasm-ph physics.space-ph | null collapse is an implosive process whereby mhd waves focus their energy in the vicinity of a null point forming a current sheet and initiating magnetic reconnection we consider for the first time the case of collapsing 3d magnetic null points in nonlinear resistive mhd using numerical simulation exploring key physical aspects of the system as well as performing a detailed parameter study we find that within a particular plane containing the 3d null the plasma and current density enhancements resulting from the collapse are quantitatively and qualitatively as per the 2d case in both the linear and nonlinear collapse regimes however the scaling with resistivity of the 3d reconnection rate which is a global quantity is found to be less favourable when the magnetic null point is more rotationally symmetric due to the action of increased magnetic backpressure furthermore we find that with increasing ambient plasma pressure the collapse can be throttled as is the case for 2d nulls we discuss this pressurelimiting in the context of fast reconnection in the solar atmosphere and suggest mechanisms by which it may be overcome we also discuss the implications of the results in the context of null collapse as a trigger mechanism of oscillatory reconnection a timedependent reconnection mechanism and also within the wider subject of wavenull point interactions we conclude that in general increasingly rotationallyasymmetric nulls will be more favourable in terms of magnetic energy release via null collapse than their more symmetric counterparts | [['null', 'collapse', 'is', 'an', 'implosive', 'process', 'whereby', 'mhd', 'waves', 'focus', 'their', 'energy', 'in', 'the', 'vicinity', 'of', 'a', 'null', 'point', 'forming', 'a', 'current', 'sheet', 'and', 'initiating', 'magnetic', 'reconnection', 'we', 'consider', 'for', 'the', 'first', 'time', 'the', 'case', 'of', 'collapsing', '3d', 'magnetic', 'null', 'points', 'in', 'nonlinear', 'resistive', 'mhd', 'using', 'numerical', 'simulation', 'exploring', 'key', 'physical', 'aspects', 'of', 'the', 'system', 'as', 'well', 'as', 'performing', 'a', 'detailed', 'parameter', 'study', 'we', 'find', 'that', 'within', 'a', 'particular', 'plane', 'containing', 'the', '3d', 'null', 'the', 'plasma', 'and', 'current', 'density', 'enhancements', 'resulting', 'from', 'the', 'collapse', 'are', 'quantitatively', 'and', 'qualitatively', 'as', 'per', 'the', '2d', 'case', 'in', 'both', 'the', 'linear', 'and', 'nonlinear', 'collapse', 'regimes', 'however', 'the', 'scaling', 'with', 'resistivity', 'of', 'the', '3d', 'reconnection', 'rate', 'which', 'is', 'a', 'global', 'quantity', 'is', 'found', 'to', 'be', 'less', 'favourable', 'when', 'the', 'magnetic', 'null', 'point', 'is', 'more', 'rotationally', 'symmetric', 'due', 'to', 'the', 'action', 'of', 'increased', 'magnetic', 'backpressure', 'furthermore', 'we', 'find', 'that', 'with', 'increasing', 'ambient', 'plasma', 'pressure', 'the', 'collapse', 'can', 'be', 'throttled', 'as', 'is', 'the', 'case', 'for', '2d', 'nulls', 'we', 'discuss', 'this', 'pressurelimiting', 'in', 'the', 'context', 'of', 'fast', 'reconnection', 'in', 'the', 'solar', 'atmosphere', 'and', 'suggest', 'mechanisms', 'by', 'which', 'it', 'may', 'be', 'overcome', 'we', 'also', 'discuss', 'the', 'implications', 'of', 'the', 'results', 'in', 'the', 'context', 'of', 'null', 'collapse', 'as', 'a', 'trigger', 'mechanism', 'of', 'oscillatory', 'reconnection', 'a', 'timedependent', 'reconnection', 'mechanism', 'and', 'also', 'within', 'the', 'wider', 'subject', 'of', 'wavenull', 'point', 'interactions', 'we', 'conclude', 'that', 'in', 'general', 'increasingly', 'rotationallyasymmetric', 'nulls', 'will', 'be', 'more', 'favourable', 'in', 'terms', 'of', 'magnetic', 'energy', 'release', 'via', 'null', 'collapse', 'than', 'their', 'more', 'symmetric', 'counterparts']] | [-0.1458031034867059, 0.14799826736017313, -0.012827003858954534, 0.09604299613940188, -0.0495189834855636, -0.08018741337196028, 0.01300697234416713, 0.3400169162087421, -0.22947234520881873, -0.2795118067946857, 0.09313125207950651, -0.21680042190917795, -0.1476958946023461, 0.21256671731912868, 0.026362812817019424, 0.010935013012910316, 0.05279057739588482, 0.014039163650651134, -0.08466480720374749, -0.1778413759094288, 0.3321841267745215, 0.12873349994560124, 0.2742521309127637, 0.024983153454341087, 0.02310485688242984, -0.06009141469753011, 0.015274690197494762, 0.0636693184752852, -0.11137659835355154, 0.021437315315228436, 0.18428314755684252, 0.09226299726686352, 0.2600828783250418, -0.4999044435755717, -0.25620754148532865, 0.05863748740064776, 0.17316806187980743, 0.1115480810896536, -0.07325107196564024, -0.2535420131465783, 0.09014144396825782, -0.15294984521255423, -0.14020729253911007, -0.03997059740296167, 0.015772723474953308, 0.04630772328570377, -0.29601466791371955, 0.1082916377221922, 0.07643681024133588, 0.04422967237153736, -0.11061795034418771, -0.013990137204373278, -0.06169582484773055, 0.06963142446549976, 0.10046268927058519, 0.06332204951440985, 0.165045368610746, -0.16410564737591538, -0.08581466435288616, 0.4030656365994596, -0.010939940400878102, -0.19026283425166893, 0.1983039373110717, -0.21159640980760772, -0.09837335068056229, 0.15171360994468897, 0.1602527703645473, 0.11911828680682726, -0.12374181302460693, 0.028092509425917633, -0.032508492297277966, 0.09114077304191869, 0.06192629715848977, -0.006475213541952638, 0.28443072772202277, 0.19429377955191332, 0.057836952333288325, 0.16176902853905056, -0.14808561047659877, -0.09852454872392273, -0.3244175306710712, -0.183846794934924, -0.13919395375156318, 0.07142184726426308, -0.08601329453239755, -0.1796457784924718, 0.3795911648979264, 0.17789783254888922, 0.19841740306474548, -0.013521475155153834, 0.29415039312388147, 0.12993645608203902, 0.03759683812176229, 0.12047101643431113, 0.2728098271128671, 0.11099451306639278, 0.13865449176173797, -0.21160600412660183, 0.05768595042414345, 0.031511267246214746] |
1,802.07077 | On Bernstein processes generated by hierarchies of linear parabolic
systems in Rd | In this article we investigate the properties of Bernstein processes
generated by infinite hierarchies of forward-backward systems of decoupled
linear deterministic parabolic partial differential equations defined in Rd,
where d is arbitrary. An important feature of those systems is that the
elliptic part of the parabolic operators may be realized as an unbounded
Schr\"odinger operator with compact resolvent in standard L2-space. The
Bernstein processes we are interested in are in general non-Markovian, may be
stationary or non-stationary and are generated by weighted averages of measures
naturally associated with the pure point spectrum of the operator. We also
introduce time-dependent trace-class operators which possess most of the
attributes of density operators in Quantum Statistical Mechanics, and prove
that the statistical averages of certain bounded self-adjoint observables
usually evaluated by means of such operators coincide with the expectation
values of suitable functions of the underlying processes. In the particular
case where the given parabolic equations involve the Hamiltonian of an
isotropic system of quantum harmonic oscillators, we show that one of the
associated processes is identical in law with the periodic Ornstein-Uhlenbeck
process.
| math.PR | in this article we investigate the properties of bernstein processes generated by infinite hierarchies of forwardbackward systems of decoupled linear deterministic parabolic partial differential equations defined in rd where d is arbitrary an important feature of those systems is that the elliptic part of the parabolic operators may be realized as an unbounded schrodinger operator with compact resolvent in standard l2space the bernstein processes we are interested in are in general nonmarkovian may be stationary or nonstationary and are generated by weighted averages of measures naturally associated with the pure point spectrum of the operator we also introduce timedependent traceclass operators which possess most of the attributes of density operators in quantum statistical mechanics and prove that the statistical averages of certain bounded selfadjoint observables usually evaluated by means of such operators coincide with the expectation values of suitable functions of the underlying processes in the particular case where the given parabolic equations involve the hamiltonian of an isotropic system of quantum harmonic oscillators we show that one of the associated processes is identical in law with the periodic ornsteinuhlenbeck process | [['in', 'this', 'article', 'we', 'investigate', 'the', 'properties', 'of', 'bernstein', 'processes', 'generated', 'by', 'infinite', 'hierarchies', 'of', 'forwardbackward', 'systems', 'of', 'decoupled', 'linear', 'deterministic', 'parabolic', 'partial', 'differential', 'equations', 'defined', 'in', 'rd', 'where', 'd', 'is', 'arbitrary', 'an', 'important', 'feature', 'of', 'those', 'systems', 'is', 'that', 'the', 'elliptic', 'part', 'of', 'the', 'parabolic', 'operators', 'may', 'be', 'realized', 'as', 'an', 'unbounded', 'schrodinger', 'operator', 'with', 'compact', 'resolvent', 'in', 'standard', 'l2space', 'the', 'bernstein', 'processes', 'we', 'are', 'interested', 'in', 'are', 'in', 'general', 'nonmarkovian', 'may', 'be', 'stationary', 'or', 'nonstationary', 'and', 'are', 'generated', 'by', 'weighted', 'averages', 'of', 'measures', 'naturally', 'associated', 'with', 'the', 'pure', 'point', 'spectrum', 'of', 'the', 'operator', 'we', 'also', 'introduce', 'timedependent', 'traceclass', 'operators', 'which', 'possess', 'most', 'of', 'the', 'attributes', 'of', 'density', 'operators', 'in', 'quantum', 'statistical', 'mechanics', 'and', 'prove', 'that', 'the', 'statistical', 'averages', 'of', 'certain', 'bounded', 'selfadjoint', 'observables', 'usually', 'evaluated', 'by', 'means', 'of', 'such', 'operators', 'coincide', 'with', 'the', 'expectation', 'values', 'of', 'suitable', 'functions', 'of', 'the', 'underlying', 'processes', 'in', 'the', 'particular', 'case', 'where', 'the', 'given', 'parabolic', 'equations', 'involve', 'the', 'hamiltonian', 'of', 'an', 'isotropic', 'system', 'of', 'quantum', 'harmonic', 'oscillators', 'we', 'show', 'that', 'one', 'of', 'the', 'associated', 'processes', 'is', 'identical', 'in', 'law', 'with', 'the', 'periodic', 'ornsteinuhlenbeck', 'process']] | [-0.13589895977744787, 0.16923370407288058, -0.045463055401824375, 0.06764245830070961, -0.03079179486064292, -0.12894165919815803, -0.056361081534018996, 0.32647694989611803, -0.3196101114655541, -0.17367480650996964, 0.10725999489498649, -0.29737915881801374, -0.144058813957127, 0.1990176580771701, -0.059824011697644855, 0.1195136449153912, 0.05115731716772171, 0.06171192313565034, -0.07510355094998293, -0.1921826259880095, 0.4174478215780315, -0.011635759015675654, 0.1948995818949989, -0.01655579271638838, 0.10613016968912017, 0.002177891235294345, -0.04604875655698163, -0.007655014925847314, -0.07837156080752605, 0.12222502811796428, 0.2679798384299965, 0.07576614544335855, 0.26624542382900807, -0.43572578329119566, -0.19440420067647873, 0.16428063901974846, 0.12089033629385065, 0.040632083209987874, -0.001202493415919045, -0.31043045737688013, 0.04834297997105187, -0.13609037713729133, -0.1881495367932437, -0.05760055318865822, 0.014910872379904459, 0.09316092052430079, -0.30682152603850676, 0.1238050095604164, 0.12809897021220698, 0.06361360608044374, -0.07509941855208814, -0.08945254806187312, -0.03832828183272514, 0.07900636855034332, -0.002831524553308675, -0.045786164760478976, 0.09918627067268389, -0.09172695887902782, -0.15930599468703593, 0.3644407132424373, -0.10331461547156127, -0.28354561299044456, 0.13713613846622283, -0.1929485464226763, -0.12415497476950246, 0.08099126998587249, 0.1722179329130819, 0.15992758020544612, -0.18417313244728917, 0.18089578273379403, -0.057065604232092136, 0.08922201261334044, 0.03435438675600109, 0.07209245846072952, 0.11488316855419077, 0.08008950222052058, 0.11165712775729432, 0.1344862081977482, 0.04862927843222281, -0.17165762092918158, -0.3591825020556127, -0.15173279855256253, -0.16382012186309539, 0.08469101706216142, -0.10446549186261772, -0.2219508549723342, 0.3792806448201386, 0.11456404075551346, 0.2144707943202197, 0.025862376363201902, 0.19505600734917417, 0.2673478945890359, 0.03281672596571278, 0.054163731701668216, 0.18051614603722335, 0.1590285869392448, 0.07394677410236668, -0.20180139467068717, 0.04067514502849862, 0.11589722590961878] |
1,802.07078 | Correlation Flow: Robust Optical Flow Using Kernel Cross-Correlators | Robust velocity and position estimation is crucial for autonomous robot
navigation. The optical flow based methods for autonomous navigation have been
receiving increasing attentions in tandem with the development of micro
unmanned aerial vehicles. This paper proposes a kernel cross-correlator (KCC)
based algorithm to determine optical flow using a monocular camera, which is
named as correlation flow (CF). Correlation flow is able to provide reliable
and accurate velocity estimation and is robust to motion blur. In addition, it
can also estimate the altitude velocity and yaw rate, which are not available
by traditional methods. Autonomous flight tests on a quadcopter show that
correlation flow can provide robust trajectory estimation with very low
processing power. The source codes are released based on the ROS framework.
| cs.RO cs.CV | robust velocity and position estimation is crucial for autonomous robot navigation the optical flow based methods for autonomous navigation have been receiving increasing attentions in tandem with the development of micro unmanned aerial vehicles this paper proposes a kernel crosscorrelator kcc based algorithm to determine optical flow using a monocular camera which is named as correlation flow cf correlation flow is able to provide reliable and accurate velocity estimation and is robust to motion blur in addition it can also estimate the altitude velocity and yaw rate which are not available by traditional methods autonomous flight tests on a quadcopter show that correlation flow can provide robust trajectory estimation with very low processing power the source codes are released based on the ros framework | [['robust', 'velocity', 'and', 'position', 'estimation', 'is', 'crucial', 'for', 'autonomous', 'robot', 'navigation', 'the', 'optical', 'flow', 'based', 'methods', 'for', 'autonomous', 'navigation', 'have', 'been', 'receiving', 'increasing', 'attentions', 'in', 'tandem', 'with', 'the', 'development', 'of', 'micro', 'unmanned', 'aerial', 'vehicles', 'this', 'paper', 'proposes', 'a', 'kernel', 'crosscorrelator', 'kcc', 'based', 'algorithm', 'to', 'determine', 'optical', 'flow', 'using', 'a', 'monocular', 'camera', 'which', 'is', 'named', 'as', 'correlation', 'flow', 'cf', 'correlation', 'flow', 'is', 'able', 'to', 'provide', 'reliable', 'and', 'accurate', 'velocity', 'estimation', 'and', 'is', 'robust', 'to', 'motion', 'blur', 'in', 'addition', 'it', 'can', 'also', 'estimate', 'the', 'altitude', 'velocity', 'and', 'yaw', 'rate', 'which', 'are', 'not', 'available', 'by', 'traditional', 'methods', 'autonomous', 'flight', 'tests', 'on', 'a', 'quadcopter', 'show', 'that', 'correlation', 'flow', 'can', 'provide', 'robust', 'trajectory', 'estimation', 'with', 'very', 'low', 'processing', 'power', 'the', 'source', 'codes', 'are', 'released', 'based', 'on', 'the', 'ros', 'framework']] | [-0.13303650114985724, 0.06054454281805984, -0.10956925482699467, 0.00020845456709784845, -0.10840112736801646, -0.22033877780045114, -0.05302266327517798, 0.46389865907540007, -0.22053650139470496, -0.33770876362799634, 0.1502103173500678, -0.23477581600403233, -0.16705964258430722, 0.2564079756961174, -0.17267576515704633, 0.15391616327988525, 0.13689537750718545, 0.038588451195767356, -0.021214372923432458, -0.15889077827018955, 0.21754634243270923, 0.08684390867053862, 0.3351242337676306, 0.019775084016615554, 0.19335715959389363, 0.02965670725191763, -0.03152699503041203, 0.021970765439853553, -0.09338666671623462, 0.17190357299536588, 0.27756984345802677, 0.12179598564680125, 0.2799504486949093, -0.3844110171325625, -0.25838936745159086, 0.058893555948030085, 0.1706326526379393, 0.08040433683274914, -0.0769944881171649, -0.3405325042023774, 0.06304077985095641, -0.20550659923784195, -0.061469727665215974, -0.10387418127708858, 0.030703089845877503, 0.06676191963150256, -0.3008460639379806, 0.05004580645806028, -0.03530425332850897, 0.11050091472439348, -0.07400459924247116, -0.04059904319564662, 0.010238329703438907, 0.2143971981450675, 0.01441526785492897, 0.0696924984053288, 0.194552642976745, -0.12411216907616283, -0.067221696419555, 0.41438452553965394, -0.03044949311832522, -0.22827980273042717, 0.17344840087800198, -0.05274442938013723, -0.0969003731076936, 0.13643467704945755, 0.26839107043680643, 0.0874015238519097, -0.1919230852095831, -0.02789741446195553, -0.005091120924560293, 0.17177471874240455, 0.02212212859622894, -0.022787681921580507, 0.19832844711509684, 0.2064929499981865, 0.18516718415400735, 0.06792445160118082, -0.20922251112924348, -0.06587616599262541, -0.19785462591173728, -0.11810486470130854, -0.16207556785534946, -0.0383265027493537, -0.04843187954083401, -0.12380622263017652, 0.33260843125472384, 0.23019450314478168, 0.14938067379426362, 0.08100732408967169, 0.442877680258525, 0.09342756245431731, 0.06185041870095677, 0.14510613873661046, 0.2389374761241338, 0.05389527369275569, 0.1651519087308477, -0.2123501686371803, 0.10623466470989966, 0.09225901656018029] |
1,802.07079 | Structured Uncertainty Prediction Networks | This paper is the first work to propose a network to predict a structured
uncertainty distribution for a synthesized image. Previous approaches have been
mostly limited to predicting diagonal covariance matrices. Our novel model
learns to predict a full Gaussian covariance matrix for each reconstruction,
which permits efficient sampling and likelihood evaluation.
We demonstrate that our model can accurately reconstruct ground truth
correlated residual distributions for synthetic datasets and generate plausible
high frequency samples for real face images. We also illustrate the use of
these predicted covariances for structure preserving image denoising.
| stat.ML | this paper is the first work to propose a network to predict a structured uncertainty distribution for a synthesized image previous approaches have been mostly limited to predicting diagonal covariance matrices our novel model learns to predict a full gaussian covariance matrix for each reconstruction which permits efficient sampling and likelihood evaluation we demonstrate that our model can accurately reconstruct ground truth correlated residual distributions for synthetic datasets and generate plausible high frequency samples for real face images we also illustrate the use of these predicted covariances for structure preserving image denoising | [['this', 'paper', 'is', 'the', 'first', 'work', 'to', 'propose', 'a', 'network', 'to', 'predict', 'a', 'structured', 'uncertainty', 'distribution', 'for', 'a', 'synthesized', 'image', 'previous', 'approaches', 'have', 'been', 'mostly', 'limited', 'to', 'predicting', 'diagonal', 'covariance', 'matrices', 'our', 'novel', 'model', 'learns', 'to', 'predict', 'a', 'full', 'gaussian', 'covariance', 'matrix', 'for', 'each', 'reconstruction', 'which', 'permits', 'efficient', 'sampling', 'and', 'likelihood', 'evaluation', 'we', 'demonstrate', 'that', 'our', 'model', 'can', 'accurately', 'reconstruct', 'ground', 'truth', 'correlated', 'residual', 'distributions', 'for', 'synthetic', 'datasets', 'and', 'generate', 'plausible', 'high', 'frequency', 'samples', 'for', 'real', 'face', 'images', 'we', 'also', 'illustrate', 'the', 'use', 'of', 'these', 'predicted', 'covariances', 'for', 'structure', 'preserving', 'image', 'denoising']] | [0.011305392147851702, 0.0021419982709314513, -0.06613878033164403, 0.12932968647826626, -0.09565548080971222, -0.1510767568125511, 0.02421022360289024, 0.48173099792683904, -0.26921602585049265, -0.3301194046836589, 0.08006255746231941, -0.26251038672584714, -0.18761405559337657, 0.12277179465973345, -0.10719164758515747, 0.12525358765750474, 0.11129956468990397, -0.0019695059948033936, -0.12717143583121587, -0.2331942053607908, 0.2880937588051893, 0.06840667831104087, 0.3730722637847066, -0.029770822130123397, 0.169774461314892, -0.01813167308674842, -0.049287731792150145, -0.026745014488646437, -0.04400489308516072, 0.17569827492622173, 0.2728580105088084, 0.18206687466717203, 0.2530671849355871, -0.39293238789895957, -0.2723226270476437, 0.1359902763557013, 0.1428832403977614, 0.1558735558471159, -0.06605937108195023, -0.32512124228979583, 0.11255658892712192, -0.15838384682454332, -0.017000678795106385, -0.19983602426794317, -0.019633977546144033, -0.042804703719372374, -0.388270712718899, 0.0826241348148197, 0.0048410867786277895, 0.025542472428439753, -0.06641980081179139, -0.1513767779992043, 0.0271046670993952, 0.17399274596296574, -0.009807472987829344, 0.011310089890764135, 0.12026710882681706, -0.10046901907101172, -0.08514479580892088, 0.34656594875876023, -0.03726580510239886, -0.23662206396946442, 0.1410490671152492, -0.10306771452862608, -0.14846437271562932, 0.12713607710168656, 0.24443830465126035, 0.10787633571611799, -0.16901126430995014, 0.003592051473274098, -0.08275725134729367, 0.19931988732423633, -0.006460061104482283, -0.03958977361490606, 0.17571778299853855, 0.17448920432640158, 0.021797054130887693, 0.15976273181782427, -0.1822120727130981, -0.04232154353319303, -0.21545709371971694, -0.11276728953437312, -0.26590190715480433, -0.008353559234503495, -0.1039200053324432, -0.1968879136763027, 0.45042442124458437, 0.2731764604838606, 0.2485534541470849, 0.15042001959670376, 0.3590261824682112, 0.055716393396521555, 0.04932149699079278, 0.02206918196221206, 0.16430835752322784, 0.09043310375620975, 0.03740586003455657, -0.13765222967460589, 0.11473327563093651, -0.012020546502595686] |
1,802.0708 | Relative Worst-Order Analysis: A Survey | Relative worst-order analysis is a technique for assessing the relative
quality of online algorithms. We survey the most important results obtained
with this technique and compare it with other quality measures.
| cs.DS | relative worstorder analysis is a technique for assessing the relative quality of online algorithms we survey the most important results obtained with this technique and compare it with other quality measures | [['relative', 'worstorder', 'analysis', 'is', 'a', 'technique', 'for', 'assessing', 'the', 'relative', 'quality', 'of', 'online', 'algorithms', 'we', 'survey', 'the', 'most', 'important', 'results', 'obtained', 'with', 'this', 'technique', 'and', 'compare', 'it', 'with', 'other', 'quality', 'measures']] | [-0.03430063501000404, -0.037095920322462915, -0.1214475903660059, 0.07096391438196102, -0.03785625168432792, -0.1156344432849437, 0.04090803544968367, 0.4520230506857236, -0.1871770924461695, -0.3597099583595991, 0.1337546358971546, -0.29168367354820174, -0.1630841520925363, 0.31022417545318604, -0.07977542197331786, 0.08816032371250912, 0.12856795924405257, 0.03618164242555698, -0.061302100339283544, -0.2858698934937517, 0.300652718047301, 0.1112731022760272, 0.3718218394865592, 0.0441737989274164, 0.05455034663900733, 0.009771007345989347, -0.16338266469538212, 0.08817005949094892, -0.18132520290091633, 0.2310978348366916, 0.2532013493279616, 0.22816521767526865, 0.3206526409213742, -0.25653634189317626, -0.15085262677942712, 0.09541652112578353, 0.08188961272438368, 0.11343898307532072, -0.05018208984207983, -0.2867682938153545, 0.12116990839131177, -0.13311690216263136, -0.09959739428013563, -0.1103953960041205, -0.06250798435260853, 0.06093951884346704, -0.2416628220739464, 0.037937476160004736, 0.0025921276950005754, 0.07864364432170987, -0.09181385736446827, -0.1569743573044737, 0.06441809022799135, 0.18074033876570564, 0.09164058705015729, 0.06670916055639585, 0.11832298457932969, -0.14449994114693254, -0.1310640287469141, 0.4124255827317635, -0.10482569187879562, -0.16783304450412592, 0.22134618867809575, -0.10196976298466325, -0.17331682338068882, 0.086470000356591, 0.1794073570209245, 0.1371926022383074, -0.13417187522475918, -0.01951299959522051, 0.011390089748116831, 0.174262373149395, 0.022009869571775198, 0.05542157602806886, 0.09337001821647088, 0.21062900504718224, 0.0965680449269712, 0.17954967196759147, -0.09032940672089657, -6.687215839823087e-05, -0.21550421466430028, -0.16774569352467855, -0.13879107836013038, -0.04699873930076137, -0.14068040295145087, -0.1267726908127467, 0.38158209597071013, 0.2121513996894161, 0.1779858752541865, 0.029825129189218084, 0.40847788999478024, 0.08865371050002674, 0.025112399272620677, 0.040888599740962185, 0.21703363176590454, 0.09102543871849775, 0.09008413050323724, -0.19374947611552973, 0.10784851186908781, 0.06402895053227743] |
1,802.07081 | Leading temperature dependence of the conductance in Kondo-correlated
quantum dots | Using renormalized perturbation theory in the Coulomb repulsion, we derive an
analytical expression for the leading term in the temperature dependence of the
conductance through a quantum dot described by the impurity Anderson model, in
terms of the renormalized parameters of the model. Taking these parameters from
the literature, we compare the results with published ones calculated using the
numerical renormalization group obtaining a very good agreement. The approach
is superior to alternative perturbative treatments. We compare in particular to
the results of a simple interpolative perturbation approach.
| cond-mat.str-el | using renormalized perturbation theory in the coulomb repulsion we derive an analytical expression for the leading term in the temperature dependence of the conductance through a quantum dot described by the impurity anderson model in terms of the renormalized parameters of the model taking these parameters from the literature we compare the results with published ones calculated using the numerical renormalization group obtaining a very good agreement the approach is superior to alternative perturbative treatments we compare in particular to the results of a simple interpolative perturbation approach | [['using', 'renormalized', 'perturbation', 'theory', 'in', 'the', 'coulomb', 'repulsion', 'we', 'derive', 'an', 'analytical', 'expression', 'for', 'the', 'leading', 'term', 'in', 'the', 'temperature', 'dependence', 'of', 'the', 'conductance', 'through', 'a', 'quantum', 'dot', 'described', 'by', 'the', 'impurity', 'anderson', 'model', 'in', 'terms', 'of', 'the', 'renormalized', 'parameters', 'of', 'the', 'model', 'taking', 'these', 'parameters', 'from', 'the', 'literature', 'we', 'compare', 'the', 'results', 'with', 'published', 'ones', 'calculated', 'using', 'the', 'numerical', 'renormalization', 'group', 'obtaining', 'a', 'very', 'good', 'agreement', 'the', 'approach', 'is', 'superior', 'to', 'alternative', 'perturbative', 'treatments', 'we', 'compare', 'in', 'particular', 'to', 'the', 'results', 'of', 'a', 'simple', 'interpolative', 'perturbation', 'approach']] | [-0.09661058020058343, 0.04828706842636166, -0.13197996835118497, 0.0833854709913298, -0.0005507321223955263, -0.12382407366319305, 0.070707530345482, 0.33695256688886066, -0.20038042937945152, -0.27654254552709806, 0.010392975601875647, -0.3180422803641043, -0.1621337860441682, 0.20848882358933968, -0.005465182592161, 0.052873770272443915, 0.05937605833804065, 0.030522085197100587, -0.12494118405315517, -0.21326727977826854, 0.2924037994790441, 0.07102635920190634, 0.2739167762179436, 0.08171973440965469, 0.052878530442037365, 0.02886498377880674, -0.021080320806835185, 0.07070720893203873, -0.18568751122802496, 0.11410825584210794, 0.21653852006949653, -0.047175036028916525, 0.22480601562843236, -0.43654697737656534, -0.21492225654550234, -0.013408058756877754, 0.13768871893725274, 0.19016955475407568, -0.060149231359404934, -0.28638707273851405, 0.034126585741019386, -0.24456617477434603, -0.1517787151903824, -0.12026665974752343, -0.04012313656064428, -0.0066260703394866805, -0.30223481747618114, 0.12826905007982117, -0.029454399006102572, 0.024637126363813877, -0.09550452404867181, -0.1227020656118508, 0.03311952222032811, 0.1400102493406104, 0.07292460003306835, 0.01750444247260351, 0.10188809370579706, -0.1383810908406634, -0.0959214492150667, 0.36880206708288327, -0.15880313305057248, -0.1952516086404847, 0.14390127886806361, -0.12428371459827758, -0.07561490164582872, 0.08572764836505732, 0.07754475803812966, 0.11179576477562395, -0.17325752341738818, 0.14093562599745466, -0.029918550593058833, 0.11475951756107282, 0.010361823570829902, 0.0027492577731787937, 0.11905573202635754, 0.15216880370280705, -0.02507886253508993, 0.13850202640010553, -0.047838538006710056, -0.15951596200466156, -0.33270382876931265, -0.06962310402146117, -0.19786829564360564, 0.019824635655492206, -0.14163454243680462, -0.18818710157938767, 0.4328475507463736, 0.21132896476509896, 0.21648101440091108, 0.06979586988348853, 0.29381015473468736, 0.2027295527302406, 0.04427281401479955, 0.02587342387149957, 0.26123279464346444, 0.1766775642675136, 0.040773740202315494, -0.28764598957654514, 0.016848173394629903, 0.11699470210905102] |
1,802.07082 | First principles investigation of pressure related quantum transport in
pure black phosphorus devices | We propose a first-principles calculation to investigate the pressure-related
transport properties of two kinds of pure monolayer black phosphorus (MBP)
devices. Numerical results show that semi-conducting MBP can withstand a
considerable compression pressure until it is transformed to be a conductor.
The pure MBP devices can work as flexible electronic devices, "negative"
pressure sensors, and "positive" pressure sensors depending on the chirality of
BP and the magnitude of vertical pressure. When pressure is relatively small,
the conductance is robust against the stress for zigzag MBP devices, while
shows pressure-sensitive properties for armchair MBP devices. The
pressure-stable property of zigzag MBP devices implies a good application
prospects as flexible electronic devices, however, the distinct negative
increase of conductance versus pressure indicates that armchair MBP devices can
work as "negative" pressure sensors. When pressure is relatively large, both
armchair MBP devices and zigzag MBP devices show favorable properties of
"positive" pressure sensors, whose conductivities rise promptly versus
pressure. The longer the device, the more the pressure sensitivity. Band
alignment analysis and empirical Wentzel$-$Kramers$-$Brillouin (WKB)
approximations are also performed to testify the tunneling process of pure MBP
devices from first principles calculation.
| cond-mat.mtrl-sci cond-mat.mes-hall | we propose a firstprinciples calculation to investigate the pressurerelated transport properties of two kinds of pure monolayer black phosphorus mbp devices numerical results show that semiconducting mbp can withstand a considerable compression pressure until it is transformed to be a conductor the pure mbp devices can work as flexible electronic devices negative pressure sensors and positive pressure sensors depending on the chirality of bp and the magnitude of vertical pressure when pressure is relatively small the conductance is robust against the stress for zigzag mbp devices while shows pressuresensitive properties for armchair mbp devices the pressurestable property of zigzag mbp devices implies a good application prospects as flexible electronic devices however the distinct negative increase of conductance versus pressure indicates that armchair mbp devices can work as negative pressure sensors when pressure is relatively large both armchair mbp devices and zigzag mbp devices show favorable properties of positive pressure sensors whose conductivities rise promptly versus pressure the longer the device the more the pressure sensitivity band alignment analysis and empirical wentzelkramersbrillouin wkb approximations are also performed to testify the tunneling process of pure mbp devices from first principles calculation | [['we', 'propose', 'a', 'firstprinciples', 'calculation', 'to', 'investigate', 'the', 'pressurerelated', 'transport', 'properties', 'of', 'two', 'kinds', 'of', 'pure', 'monolayer', 'black', 'phosphorus', 'mbp', 'devices', 'numerical', 'results', 'show', 'that', 'semiconducting', 'mbp', 'can', 'withstand', 'a', 'considerable', 'compression', 'pressure', 'until', 'it', 'is', 'transformed', 'to', 'be', 'a', 'conductor', 'the', 'pure', 'mbp', 'devices', 'can', 'work', 'as', 'flexible', 'electronic', 'devices', 'negative', 'pressure', 'sensors', 'and', 'positive', 'pressure', 'sensors', 'depending', 'on', 'the', 'chirality', 'of', 'bp', 'and', 'the', 'magnitude', 'of', 'vertical', 'pressure', 'when', 'pressure', 'is', 'relatively', 'small', 'the', 'conductance', 'is', 'robust', 'against', 'the', 'stress', 'for', 'zigzag', 'mbp', 'devices', 'while', 'shows', 'pressuresensitive', 'properties', 'for', 'armchair', 'mbp', 'devices', 'the', 'pressurestable', 'property', 'of', 'zigzag', 'mbp', 'devices', 'implies', 'a', 'good', 'application', 'prospects', 'as', 'flexible', 'electronic', 'devices', 'however', 'the', 'distinct', 'negative', 'increase', 'of', 'conductance', 'versus', 'pressure', 'indicates', 'that', 'armchair', 'mbp', 'devices', 'can', 'work', 'as', 'negative', 'pressure', 'sensors', 'when', 'pressure', 'is', 'relatively', 'large', 'both', 'armchair', 'mbp', 'devices', 'and', 'zigzag', 'mbp', 'devices', 'show', 'favorable', 'properties', 'of', 'positive', 'pressure', 'sensors', 'whose', 'conductivities', 'rise', 'promptly', 'versus', 'pressure', 'the', 'longer', 'the', 'device', 'the', 'more', 'the', 'pressure', 'sensitivity', 'band', 'alignment', 'analysis', 'and', 'empirical', 'wentzelkramersbrillouin', 'wkb', 'approximations', 'are', 'also', 'performed', 'to', 'testify', 'the', 'tunneling', 'process', 'of', 'pure', 'mbp', 'devices', 'from', 'first', 'principles', 'calculation']] | [-0.1946722674697509, 0.1319999137473481, -0.06012373086699146, -0.0421472877035043, -0.04369729147026404, -0.2021779233634353, 0.09813332733849281, 0.4520133856604708, -0.28217214077929076, -0.30972210715055476, 0.02755181309816606, -0.3163249478576348, -0.15231123144312345, 0.20478370693943246, -0.018529544024668793, 0.05116402123995284, 0.057165030515727966, -0.043580521767503246, -0.07339114215759997, -0.1857940043283111, 0.18922751641490476, 0.05577253077199009, 0.3684700213352892, 0.11209181191627571, 0.03044517639345747, -0.04343118928397629, 0.10940181940021192, 0.10438442784312003, -0.1536203512820221, 0.04935016461766939, 0.23295616556424648, -0.08569199336999829, 0.2531495542176306, -0.5103276757959355, -0.22279237948625566, -0.00883595205247749, 0.09901714784296309, 0.13931463795411897, -0.09418093804754576, -0.24395978780701122, 0.1684909918347988, -0.1363907490207992, -0.0991379111536012, -0.0721399379656353, 0.03362238292453533, 0.003699052775776549, -0.20737038962196241, 0.09424205141081946, 0.006522236092194439, 0.03938503112759134, -0.11747161798453779, -0.1764111049334578, -0.10228929904467882, 0.06976961127409285, 0.06081399707445018, -0.048960928241672745, 0.27776095224544406, -0.124761689330471, -0.10488325451622083, 0.3847860686698968, -0.021859664038972968, -0.0893348179636226, 0.14447942393103694, -0.10686896969762413, -0.030805409498304685, 0.1383408224841758, 0.12705498939024612, 0.13329314089261313, -0.15049521310921843, 0.033097922518363895, 0.045171029764652364, 0.15681941680947042, 0.0960613029112326, 0.059091799808269806, 0.22180397569404994, 0.16026739892549813, 0.10679245885075168, 0.15127144385924304, -0.10242923342578232, -0.011013767116039278, -0.20875838256758103, -0.24303530724570552, -0.18324417918127903, 0.10093074782932315, -0.12254238410504842, -0.22585181254853912, 0.36363003299908436, 0.15498257795982856, 0.13606212686430266, -0.0017566730248484207, 0.3339585885356002, 0.09818853718164239, 0.0662113222097879, 0.049234252247186576, 0.24365870207003218, 0.1744988374213906, 0.12668654585054065, -0.23086945706002532, 0.1319028225014026, -0.07158152844405119] |
1,802.07083 | Support of Laurent series algebraic over the field of formal power
series | This work is devoted to the study of the support of a Laurent series in
several variables which is algebraic over the ring of power series over a
characteristic zero field. Our first result is the existence of a kind of
maximal dual cone of the support of such a Laurent series. As an application of
this result we provide a gap theorem for Laurent series which are algebraic
over the field of formal power series. We also relate these results to
diophantine properties of the fields of Laurent series.
| math.AC math.AG math.CO math.NT | this work is devoted to the study of the support of a laurent series in several variables which is algebraic over the ring of power series over a characteristic zero field our first result is the existence of a kind of maximal dual cone of the support of such a laurent series as an application of this result we provide a gap theorem for laurent series which are algebraic over the field of formal power series we also relate these results to diophantine properties of the fields of laurent series | [['this', 'work', 'is', 'devoted', 'to', 'the', 'study', 'of', 'the', 'support', 'of', 'a', 'laurent', 'series', 'in', 'several', 'variables', 'which', 'is', 'algebraic', 'over', 'the', 'ring', 'of', 'power', 'series', 'over', 'a', 'characteristic', 'zero', 'field', 'our', 'first', 'result', 'is', 'the', 'existence', 'of', 'a', 'kind', 'of', 'maximal', 'dual', 'cone', 'of', 'the', 'support', 'of', 'such', 'a', 'laurent', 'series', 'as', 'an', 'application', 'of', 'this', 'result', 'we', 'provide', 'a', 'gap', 'theorem', 'for', 'laurent', 'series', 'which', 'are', 'algebraic', 'over', 'the', 'field', 'of', 'formal', 'power', 'series', 'we', 'also', 'relate', 'these', 'results', 'to', 'diophantine', 'properties', 'of', 'the', 'fields', 'of', 'laurent', 'series']] | [-0.21649160978073875, -0.013219681436344723, -0.1524595653120842, -0.013153570583866288, -0.10311987401089734, -0.011465427739959623, -0.010366105298615164, 0.27650505378842355, -0.3396399375413441, -0.20180985888259279, 0.13857210748699597, -0.20292995207839543, -0.17789937485423352, 0.27684793118387463, -0.07258924706839025, 0.03464284291904834, -0.03071065521799028, 0.09622701094259456, -0.06577973190902008, -0.33950283681559895, 0.370139556336734, 0.007351989319754971, 0.20379185914579365, 0.02653086032304499, 0.09612268045441144, -0.010724889290415578, -0.04592333739726907, 0.018625066574249, -0.10898936494357056, 0.13742639979140625, 0.29283723462786937, 0.10330062658629484, 0.31075606213675605, -0.38537607604844704, -0.1470733320961396, 0.10227106018509302, 0.1336791712945948, 0.03830378714483231, -0.01646295885245005, -0.20316063317780694, 0.11887847893328095, -0.21706941451670395, -0.173549489190595, -0.12305360653748115, 0.022133651890584992, 0.08626589708599365, -0.2976957534802043, 0.02656298040431769, 0.12815867891250593, 0.16840982060465548, -0.05888953803934985, -0.06382145218085497, 0.08647853731721018, 0.08121079450162748, 0.08355810185118268, 0.01652634325954649, 0.03198522493864099, -0.09684842163179484, -0.1320415696905305, 0.3159266161732376, -0.09351649827116894, -0.1369993851934042, 0.14481218858725495, -0.18495235732860035, -0.16132985083903703, 0.13311223502581318, 0.1471014941111207, 0.15097900681818524, -0.07335327320421735, 0.13147716976495252, -0.13304108450603153, 0.10362030682154, 0.09647873979993164, 0.03886578563186857, 0.2069663167336128, 0.09421025124481983, 0.04304756128468499, 0.17075901701787694, 0.004412116851502408, -0.06958425766271022, -0.37639440858943596, -0.23607189804186215, -0.1937623472056455, 0.10647095520463255, -0.09781743541566862, -0.2210243444889784, 0.5011968768305248, 0.09422284276224673, 0.2322813693847921, 0.08899703030215783, 0.24056820692494513, 0.16634679969089727, 0.027747800728927057, 0.0027373602975987728, 0.1387189822892348, 0.2187051366083324, 0.0826715436259595, -0.1753270397738864, -0.022381310718547966, 0.10852049754208161] |
1,802.07084 | Subadditivity of logarithm of violation of geometric Bell inequalities
for qudits | Geometrical Bell Inequalities (GBIs) are the strongest known Bell
inequalities for collections of qubits. However, their generalizations to other
systems is not yet fully understood. We formulate GBIs for an arbitrary number
$N$ of observers, each of which possesses a particle of an arbitrary dimension
$d$. The whole $(d-1)$-parameter family of local observables with eigenbases
unbiased to the computational basis is used, but it is immediate to use a
discrete subset of them. We argue analytically for qutrits and numerically for
other systems that the violations grows exponenetially with $N$. Within the
studied range, the violation also grows with $d$. Interestingly, we observe
that the logarithm of the violation ratio for ququats grows with $N$ slower
than the doubled logarithm of the violation ratio for qubits, which implies a
kind of subadditivity.
| quant-ph | geometrical bell inequalities gbis are the strongest known bell inequalities for collections of qubits however their generalizations to other systems is not yet fully understood we formulate gbis for an arbitrary number n of observers each of which possesses a particle of an arbitrary dimension d the whole d1parameter family of local observables with eigenbases unbiased to the computational basis is used but it is immediate to use a discrete subset of them we argue analytically for qutrits and numerically for other systems that the violations grows exponenetially with n within the studied range the violation also grows with d interestingly we observe that the logarithm of the violation ratio for ququats grows with n slower than the doubled logarithm of the violation ratio for qubits which implies a kind of subadditivity | [['geometrical', 'bell', 'inequalities', 'gbis', 'are', 'the', 'strongest', 'known', 'bell', 'inequalities', 'for', 'collections', 'of', 'qubits', 'however', 'their', 'generalizations', 'to', 'other', 'systems', 'is', 'not', 'yet', 'fully', 'understood', 'we', 'formulate', 'gbis', 'for', 'an', 'arbitrary', 'number', 'n', 'of', 'observers', 'each', 'of', 'which', 'possesses', 'a', 'particle', 'of', 'an', 'arbitrary', 'dimension', 'd', 'the', 'whole', 'd1parameter', 'family', 'of', 'local', 'observables', 'with', 'eigenbases', 'unbiased', 'to', 'the', 'computational', 'basis', 'is', 'used', 'but', 'it', 'is', 'immediate', 'to', 'use', 'a', 'discrete', 'subset', 'of', 'them', 'we', 'argue', 'analytically', 'for', 'qutrits', 'and', 'numerically', 'for', 'other', 'systems', 'that', 'the', 'violations', 'grows', 'exponenetially', 'with', 'n', 'within', 'the', 'studied', 'range', 'the', 'violation', 'also', 'grows', 'with', 'd', 'interestingly', 'we', 'observe', 'that', 'the', 'logarithm', 'of', 'the', 'violation', 'ratio', 'for', 'ququats', 'grows', 'with', 'n', 'slower', 'than', 'the', 'doubled', 'logarithm', 'of', 'the', 'violation', 'ratio', 'for', 'qubits', 'which', 'implies', 'a', 'kind', 'of', 'subadditivity']] | [-0.15524012648711505, 0.14782303549350218, -0.01846392405605002, 0.07545303909546419, -0.03159649541703402, -0.2083093609799107, 0.04536265979731979, 0.29916272139234934, -0.23289523510482013, -0.2992469342498225, 0.07388200849891291, -0.2859999720922133, -0.0897726849616447, 0.19405016450809853, -0.02125415661612351, 0.0634869446294033, 0.00533881102273881, 0.07614914193254663, -0.0939970855579304, -0.28793030336964875, 0.28766990084113786, 0.021128667319317174, 0.2578523700576625, 0.009001326896395767, 0.08837551071519556, 0.017526028907013824, 0.020363031879242044, 0.052443868669797666, -0.10937387245087393, 0.1212190410515177, 0.20790244940144476, 0.1750607977683103, 0.2311176151924883, -0.38644361511978786, -0.16371868157875724, 0.16707456640051532, 0.170602117152157, 0.12296523820623406, 0.02104238740685105, -0.25636899629535037, 0.040920916037975985, -0.15350480195047567, -0.1937741317669861, -0.0901467555668205, 0.10013769467695965, -0.009855780720499752, -0.3035212044851505, 0.09812391329865022, 0.050056101728841895, 0.04444507690277533, 0.026669432041671826, -0.09559448120126035, 0.02185899995674845, 0.09767210453264852, 0.038757681227338026, -0.015093571804754902, 0.09611274592680275, -0.09695846061458724, -0.13809678734105546, 0.35932054986687945, -0.015702113809879847, -0.242089632743955, 0.19907860590001292, -0.17608869955438422, -0.16079121112488792, 0.08005124095507199, 0.11897035459332983, 0.12685018698539352, -0.09841794387466507, 0.08621230083326736, -0.09150498346571112, 0.18693439772323472, 0.07519253828468209, 0.14518206402135547, 0.12495083654994232, 0.09487164061283693, 0.12143165086672525, 0.1776849295010834, -0.03686683120326961, -0.09705014860810479, -0.35806895210407674, -0.19392146255268017, -0.2283304707143543, 0.09444064363390225, -0.12579763838755298, -0.1375629174435744, 0.3082389709088602, 0.07896870167496672, 0.1882555554038845, 0.1026462684803846, 0.2312114400192513, 0.12099562781804707, 0.09088903051633679, 0.0923967294911563, 0.2437479010404786, 0.1516461131250253, 0.05227621557423845, -0.2195188457808399, 0.08106338135803526, 0.05991732239635894] |
1,802.07085 | The isomorphism problem for finite extensions of free groups is in
PSPACE | We present an algorithm for the following problem: given a context-free
grammar for the word problem of a virtually free group $G$, compute a finite
graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group
$G$. Our algorithm is non-deterministic and runs in doubly exponential time. It
follows that the isomorphism problem of context-free groups can be solved in
doubly exponential space.
Moreover, if, instead of a grammar, a finite extension of a free group is
given as input, the construction of the graph of groups is in NP and,
consequently, the isomorphism problem in PSPACE.
| math.GR cs.CC cs.FL | we present an algorithm for the following problem given a contextfree grammar for the word problem of a virtually free group g compute a finite graph of groups mathcalg with finite vertex groups and fundamental group g our algorithm is nondeterministic and runs in doubly exponential time it follows that the isomorphism problem of contextfree groups can be solved in doubly exponential space moreover if instead of a grammar a finite extension of a free group is given as input the construction of the graph of groups is in np and consequently the isomorphism problem in pspace | [['we', 'present', 'an', 'algorithm', 'for', 'the', 'following', 'problem', 'given', 'a', 'contextfree', 'grammar', 'for', 'the', 'word', 'problem', 'of', 'a', 'virtually', 'free', 'group', 'g', 'compute', 'a', 'finite', 'graph', 'of', 'groups', 'mathcalg', 'with', 'finite', 'vertex', 'groups', 'and', 'fundamental', 'group', 'g', 'our', 'algorithm', 'is', 'nondeterministic', 'and', 'runs', 'in', 'doubly', 'exponential', 'time', 'it', 'follows', 'that', 'the', 'isomorphism', 'problem', 'of', 'contextfree', 'groups', 'can', 'be', 'solved', 'in', 'doubly', 'exponential', 'space', 'moreover', 'if', 'instead', 'of', 'a', 'grammar', 'a', 'finite', 'extension', 'of', 'a', 'free', 'group', 'is', 'given', 'as', 'input', 'the', 'construction', 'of', 'the', 'graph', 'of', 'groups', 'is', 'in', 'np', 'and', 'consequently', 'the', 'isomorphism', 'problem', 'in', 'pspace']] | [-0.14504986548239424, 0.13828387845577025, -0.11248461207970209, 0.09064112388476077, -0.13836732405938745, -0.1403077148649957, 0.09382960577399384, 0.38353267761389004, -0.390824601323027, -0.3028896864810863, 0.08057545278144558, -0.2307124936079472, -0.09517636620583608, 0.16961760376700075, -0.09983096957043505, 0.014999453304815539, 0.09920610676125921, 0.13871316557039612, -0.016846265046156404, -0.2593670915842258, 0.3393612080973755, -0.04461692347546521, 0.20685434427842037, 0.006328171699970346, 0.13793546692381214, 0.023924190229400226, -0.026370099020795415, 0.05972304877305413, -0.07374567437484036, 0.07769015788811154, 0.35286870940598014, 0.1679331667375626, 0.2648096984425156, -0.3657222199589782, -0.15025904969301448, 0.19879460697705598, 0.14715934705142816, 0.09110284567877804, -0.07131076731344628, -0.23614814024917857, 0.1414888399729947, -0.18445727435545517, -0.03296236570962926, 0.05149499615462324, 0.11850747222215244, -0.031644613472456784, -0.2535619619852274, -0.009938941668411813, 0.1206711951988874, 0.03782033165628763, -0.027287883355195837, -0.064723047898295, 0.02805819149493941, 0.11835470069775876, -0.034547911916100946, 0.05914209520002616, 0.046001698816982434, -0.09392807849673267, -0.19527018844202815, 0.45289532784564596, -0.0655431620303791, -0.20444473507094016, 0.08438317953925772, -0.11507876302096416, -0.1937695563934052, 0.11490154613923166, 0.12468417374580407, 0.16911239263399974, -0.07009548059251812, 0.23558452291733384, -0.15652303469664963, 0.16068462514769785, 0.055465564602198675, -0.06396026520980234, 0.05679468889768744, 0.1773751948806505, 0.14299559531752595, 0.1783295033641217, 0.10463811514764718, 0.027593813951789718, -0.33648462647322525, -0.1595673784784632, -0.15609399279214672, 0.008127550160051468, -0.13095934990959687, -0.2343299414520872, 0.4069501215678438, 0.053332734646602084, 0.12005486587043275, 0.18796856239553272, 0.21364580668969868, 0.1204952177418799, 0.03864249209729359, 0.11360485252930864, 0.042827836324259176, 0.18160065001875317, -0.07940162002641861, -0.2161419366284744, 0.04265974146150744, 0.19868131308365114] |
1,802.07086 | Transient shear banding in the nematic dumbbell model of liquid
crystalline polymers | In the shear flow of liquid crystalline polymers (LCPs) the nematic director
orientation can align with the flow direction for some materials, but
continuously tumble in others. The nematic dumbbell (ND) model was originally
developed to describe the rheology of flow-aligning semi-flexible LCPs, and
flow-aligning LCPs are the focus in this paper. In the shear flow of monodomain
LCPs it is usually assumed that the spatial distribution of the velocity is
uniform. This is in contrast to polymer solutions, where highly non-uniform
spatial velocity profiles have been observed in experiments. We analyse the ND
model, with an additional gradient term in the constitutive model, using a
linear stability analysis. We investigate the separate cases of constant
applied shear stress, and constant applied shear rate. We find that the ND
model has a transient flow instability to the formation of a spatially
inhomogeneous flow velocity for certain starting orientations of the director.
We calculate the spatially resolved flow profile in both constant applied
stress and constant applied shear rate in start up from rest, using a model
with one spatial dimension to illustrate the flow behaviour of the fluid. For
low shear rates flow reversal can be seen as the director realigns with the
flow direction, whereas for high shear rates the director reorientation occurs
simultaneously across the gap. Experimentally, this inhomogeneous flow is
predicted to be observed in flow reversal experiments in LCPs.
| cond-mat.soft | in the shear flow of liquid crystalline polymers lcps the nematic director orientation can align with the flow direction for some materials but continuously tumble in others the nematic dumbbell nd model was originally developed to describe the rheology of flowaligning semiflexible lcps and flowaligning lcps are the focus in this paper in the shear flow of monodomain lcps it is usually assumed that the spatial distribution of the velocity is uniform this is in contrast to polymer solutions where highly nonuniform spatial velocity profiles have been observed in experiments we analyse the nd model with an additional gradient term in the constitutive model using a linear stability analysis we investigate the separate cases of constant applied shear stress and constant applied shear rate we find that the nd model has a transient flow instability to the formation of a spatially inhomogeneous flow velocity for certain starting orientations of the director we calculate the spatially resolved flow profile in both constant applied stress and constant applied shear rate in start up from rest using a model with one spatial dimension to illustrate the flow behaviour of the fluid for low shear rates flow reversal can be seen as the director realigns with the flow direction whereas for high shear rates the director reorientation occurs simultaneously across the gap experimentally this inhomogeneous flow is predicted to be observed in flow reversal experiments in lcps | [['in', 'the', 'shear', 'flow', 'of', 'liquid', 'crystalline', 'polymers', 'lcps', 'the', 'nematic', 'director', 'orientation', 'can', 'align', 'with', 'the', 'flow', 'direction', 'for', 'some', 'materials', 'but', 'continuously', 'tumble', 'in', 'others', 'the', 'nematic', 'dumbbell', 'nd', 'model', 'was', 'originally', 'developed', 'to', 'describe', 'the', 'rheology', 'of', 'flowaligning', 'semiflexible', 'lcps', 'and', 'flowaligning', 'lcps', 'are', 'the', 'focus', 'in', 'this', 'paper', 'in', 'the', 'shear', 'flow', 'of', 'monodomain', 'lcps', 'it', 'is', 'usually', 'assumed', 'that', 'the', 'spatial', 'distribution', 'of', 'the', 'velocity', 'is', 'uniform', 'this', 'is', 'in', 'contrast', 'to', 'polymer', 'solutions', 'where', 'highly', 'nonuniform', 'spatial', 'velocity', 'profiles', 'have', 'been', 'observed', 'in', 'experiments', 'we', 'analyse', 'the', 'nd', 'model', 'with', 'an', 'additional', 'gradient', 'term', 'in', 'the', 'constitutive', 'model', 'using', 'a', 'linear', 'stability', 'analysis', 'we', 'investigate', 'the', 'separate', 'cases', 'of', 'constant', 'applied', 'shear', 'stress', 'and', 'constant', 'applied', 'shear', 'rate', 'we', 'find', 'that', 'the', 'nd', 'model', 'has', 'a', 'transient', 'flow', 'instability', 'to', 'the', 'formation', 'of', 'a', 'spatially', 'inhomogeneous', 'flow', 'velocity', 'for', 'certain', 'starting', 'orientations', 'of', 'the', 'director', 'we', 'calculate', 'the', 'spatially', 'resolved', 'flow', 'profile', 'in', 'both', 'constant', 'applied', 'stress', 'and', 'constant', 'applied', 'shear', 'rate', 'in', 'start', 'up', 'from', 'rest', 'using', 'a', 'model', 'with', 'one', 'spatial', 'dimension', 'to', 'illustrate', 'the', 'flow', 'behaviour', 'of', 'the', 'fluid', 'for', 'low', 'shear', 'rates', 'flow', 'reversal', 'can', 'be', 'seen', 'as', 'the', 'director', 'realigns', 'with', 'the', 'flow', 'direction', 'whereas', 'for', 'high', 'shear', 'rates', 'the', 'director', 'reorientation', 'occurs', 'simultaneously', 'across', 'the', 'gap', 'experimentally', 'this', 'inhomogeneous', 'flow', 'is', 'predicted', 'to', 'be', 'observed', 'in', 'flow', 'reversal', 'experiments', 'in', 'lcps']] | [-0.14526239564030755, 0.17590263460233435, -0.09887108384819437, -0.01476290437658697, -0.03287382262095393, -0.1379750094880138, -0.07041747883599764, 0.39752576174014626, -0.3436835045494587, -0.25677791052166166, 0.09251584422868545, -0.22843213450131625, -0.10156652882951012, 0.12558417108490497, 0.00331767084568643, 0.06448547138763559, -0.03387806449952843, 0.011614997475507946, -0.03677538962577082, -0.19931013832896022, 0.2253684044212039, 0.03555582442956421, 0.3619604416055677, 0.020032330933766433, 0.08221743577619607, -0.00870530903259444, 0.004000606694830333, 0.11612481035071778, -0.2117747937196335, 0.052027921963786875, 0.21747856154686135, -0.020404337523125367, 0.18924750491293235, -0.4476383708481369, -0.2532897663978228, 0.0634972830243057, 0.14344317941874457, 0.16225124399533472, -0.0387443026669909, -0.21141672086034594, 0.06045912301403674, -0.13241540102583912, -0.15134346791115377, -0.05297609286726544, 0.012343901387403836, 0.07917457474822823, -0.2398629580032832, 0.17655215419972786, 0.0455583429414691, 0.08068709433990102, -0.1217418815401011, -0.03862133074567809, -0.06328902580643417, 0.08664479234721512, 0.1265094303166246, 0.06503059498989723, 0.16645401549953248, -0.1696008283419079, -0.04336046110718739, 0.39868819707796743, -0.10131166414697475, -0.21881221917501847, 0.1667880047964084, -0.15883525322659078, -0.09734760000482362, 0.16722435120477186, 0.21749282608512197, 0.12686487267097626, -0.11693475024510863, 0.009720357303190857, -0.047063637418920265, 0.1797095728956179, 0.07857839568705965, -0.10166889820207918, 0.20874286766759573, 0.1522094989205459, 0.07650281725573262, 0.17132186941410787, -0.15103261349992547, -0.1103953594849505, -0.2506000231971461, -0.14756909439284274, -0.14187110517106055, 0.0015924441555211152, -0.11023830325232045, -0.1432270507324215, 0.3530236500407301, 0.08971827738176903, 0.20778441057858246, 0.025572976670672622, 0.24300201059530924, 0.05047018644989512, 0.0480689727991036, 0.10200472384123652, 0.3061284933619195, 0.15848174320969555, 0.17597659525777265, -0.2522155171412127, 0.1207326594420385, 0.045479190028212615] |
1,802.07087 | Convergence of Closed Pseudo-Hermitian Manifolds | Based on uniform CR Sobolev inequality and Moser iteration, this paper
investigates the convergence of closed pseudo-Hermitian manifolds. In terms of
the subelliptic inequality, the set of closed normalized pseudo-Einstein
manifolds with some uniform geometric conditions is compact. Moreover, the set
of closed normalized Sasakian $\eta$-Einstein $(2n+1)$-manifolds with
Carnot-Carath\'eodory distance bounded from above, volume bounded from below
and $L^{n + \frac{1}{2}}$ norm of pseudo-Hermitian curvature bounded is
$C^\infty$ compact. As an application, we will deduce some pointed convergence
of complete K\"ahler cones with Sasakian manifolds as their links.
| math.DG | based on uniform cr sobolev inequality and moser iteration this paper investigates the convergence of closed pseudohermitian manifolds in terms of the subelliptic inequality the set of closed normalized pseudoeinstein manifolds with some uniform geometric conditions is compact moreover the set of closed normalized sasakian etaeinstein 2n1manifolds with carnotcaratheodory distance bounded from above volume bounded from below and ln frac12 norm of pseudohermitian curvature bounded is cinfty compact as an application we will deduce some pointed convergence of complete kahler cones with sasakian manifolds as their links | [['based', 'on', 'uniform', 'cr', 'sobolev', 'inequality', 'and', 'moser', 'iteration', 'this', 'paper', 'investigates', 'the', 'convergence', 'of', 'closed', 'pseudohermitian', 'manifolds', 'in', 'terms', 'of', 'the', 'subelliptic', 'inequality', 'the', 'set', 'of', 'closed', 'normalized', 'pseudoeinstein', 'manifolds', 'with', 'some', 'uniform', 'geometric', 'conditions', 'is', 'compact', 'moreover', 'the', 'set', 'of', 'closed', 'normalized', 'sasakian', 'etaeinstein', '2n1manifolds', 'with', 'carnotcaratheodory', 'distance', 'bounded', 'from', 'above', 'volume', 'bounded', 'from', 'below', 'and', 'ln', 'frac12', 'norm', 'of', 'pseudohermitian', 'curvature', 'bounded', 'is', 'cinfty', 'compact', 'as', 'an', 'application', 'we', 'will', 'deduce', 'some', 'pointed', 'convergence', 'of', 'complete', 'kahler', 'cones', 'with', 'sasakian', 'manifolds', 'as', 'their', 'links']] | [-0.21766292621734842, 0.06417089914143669, -0.016672326774060747, 0.10254678578281926, -0.1403544130333667, -0.16596531757185684, -0.031655015261982965, 0.3615622017104393, -0.2978324980913908, -0.17356687941021104, 0.12003762731944136, -0.30651341440776986, -0.12037151944341845, 0.20878241843297735, -0.19892891127102333, 0.055935161209654534, 0.047035975424551416, 0.13203601768754167, -0.15597023560943873, -0.2648163886805033, 0.5095512009996536, -0.022299362978116535, 0.1913950091827361, 0.1570769783401134, 0.12402401538030512, -0.09725720586854665, 0.05402383217909213, 0.030405691541174704, -0.23610959655937108, 0.1551030353353969, 0.2237623962948377, 0.08099305549979038, 0.23322071340577355, -0.3805297971114345, -0.14832395088227315, 0.21978625313689312, 0.13561943163774137, -0.09845109909087763, -0.022839105439482085, -0.3597712576731868, 0.08405456826861563, -0.023674374724599136, -0.22897553646230492, -0.11496471446649782, -0.02212380233418796, 0.07282533805721023, -0.20737693468429919, 0.07676737506916725, 0.16339991226305264, 0.11282110786408014, -0.13703510942922412, -0.11563204462243908, -0.06453224542904003, 0.04236461291753355, 0.011008352506905794, 0.11394084407145093, 0.12120795893836124, 0.04106901051080518, -0.06999812043946364, 0.2964555776581682, -0.10908509704188027, -0.3077307511763326, 0.05095814040797795, -0.157982234040211, -0.15162809649161224, 0.11028762593003653, 0.13462133465860648, 0.1930159061890224, -0.09083217966916232, 0.24313342784151393, -0.07022634568228119, 0.018138284163399673, 0.1465140320788855, 0.06299318430474264, 0.008181547513231635, 0.08680153012960806, 0.273852350779049, 0.12117020009104269, 0.018686587314774423, -0.08377252329654734, -0.40598148373009146, -0.203645577298306, -0.20181215079180126, 0.24367948073690393, -0.22428703938588104, -0.2203583860670848, 0.294989561726307, -0.10224409169121378, 0.16631714523844848, 0.1954045051216394, 0.22025084366417094, 0.026307603093091634, -0.03734602087616235, 0.19096902578576713, 0.17638227556652827, 0.2699666765529191, 0.06415193356659221, -0.09109237490906968, -0.05570119886422241, 0.190201133314484] |
1,802.07088 | i-RevNet: Deep Invertible Networks | It is widely believed that the success of deep convolutional networks is
based on progressively discarding uninformative variability about the input
with respect to the problem at hand. This is supported empirically by the
difficulty of recovering images from their hidden representations, in most
commonly used network architectures. In this paper we show via a one-to-one
mapping that this loss of information is not a necessary condition to learn
representations that generalize well on complicated problems, such as ImageNet.
Via a cascade of homeomorphic layers, we build the i-RevNet, a network that can
be fully inverted up to the final projection onto the classes, i.e. no
information is discarded. Building an invertible architecture is difficult, for
one, because the local inversion is ill-conditioned, we overcome this by
providing an explicit inverse. An analysis of i-RevNets learned representations
suggests an alternative explanation for the success of deep networks by a
progressive contraction and linear separation with depth. To shed light on the
nature of the model learned by the i-RevNet we reconstruct linear
interpolations between natural image representations.
| cs.LG cs.CV stat.ML | it is widely believed that the success of deep convolutional networks is based on progressively discarding uninformative variability about the input with respect to the problem at hand this is supported empirically by the difficulty of recovering images from their hidden representations in most commonly used network architectures in this paper we show via a onetoone mapping that this loss of information is not a necessary condition to learn representations that generalize well on complicated problems such as imagenet via a cascade of homeomorphic layers we build the irevnet a network that can be fully inverted up to the final projection onto the classes ie no information is discarded building an invertible architecture is difficult for one because the local inversion is illconditioned we overcome this by providing an explicit inverse an analysis of irevnets learned representations suggests an alternative explanation for the success of deep networks by a progressive contraction and linear separation with depth to shed light on the nature of the model learned by the irevnet we reconstruct linear interpolations between natural image representations | [['it', 'is', 'widely', 'believed', 'that', 'the', 'success', 'of', 'deep', 'convolutional', 'networks', 'is', 'based', 'on', 'progressively', 'discarding', 'uninformative', 'variability', 'about', 'the', 'input', 'with', 'respect', 'to', 'the', 'problem', 'at', 'hand', 'this', 'is', 'supported', 'empirically', 'by', 'the', 'difficulty', 'of', 'recovering', 'images', 'from', 'their', 'hidden', 'representations', 'in', 'most', 'commonly', 'used', 'network', 'architectures', 'in', 'this', 'paper', 'we', 'show', 'via', 'a', 'onetoone', 'mapping', 'that', 'this', 'loss', 'of', 'information', 'is', 'not', 'a', 'necessary', 'condition', 'to', 'learn', 'representations', 'that', 'generalize', 'well', 'on', 'complicated', 'problems', 'such', 'as', 'imagenet', 'via', 'a', 'cascade', 'of', 'homeomorphic', 'layers', 'we', 'build', 'the', 'irevnet', 'a', 'network', 'that', 'can', 'be', 'fully', 'inverted', 'up', 'to', 'the', 'final', 'projection', 'onto', 'the', 'classes', 'ie', 'no', 'information', 'is', 'discarded', 'building', 'an', 'invertible', 'architecture', 'is', 'difficult', 'for', 'one', 'because', 'the', 'local', 'inversion', 'is', 'illconditioned', 'we', 'overcome', 'this', 'by', 'providing', 'an', 'explicit', 'inverse', 'an', 'analysis', 'of', 'irevnets', 'learned', 'representations', 'suggests', 'an', 'alternative', 'explanation', 'for', 'the', 'success', 'of', 'deep', 'networks', 'by', 'a', 'progressive', 'contraction', 'and', 'linear', 'separation', 'with', 'depth', 'to', 'shed', 'light', 'on', 'the', 'nature', 'of', 'the', 'model', 'learned', 'by', 'the', 'irevnet', 'we', 'reconstruct', 'linear', 'interpolations', 'between', 'natural', 'image', 'representations']] | [-0.03723537434299273, 0.047550502901257216, -0.07993914321032834, 0.0957479093045842, -0.10859208122088478, -0.1269065827551437, 0.010932142160506383, 0.4269003220459168, -0.3402405896193305, -0.28663596365200733, 0.1285733636348219, -0.2411459577805095, -0.2216540421359241, 0.17657614916953762, -0.11338677698540255, 0.052123960393250804, 0.07993373482745013, 0.0394429169225924, -0.10752897232238354, -0.24121556949170156, 0.35652543681984145, 0.059404520182428755, 0.29766689971003724, 0.005379396102701624, 0.13598454998399334, -0.019835584451733477, -0.02522665315746576, -0.037648904011531294, -0.036918693772234806, 0.18615859909044663, 0.2683956872768186, 0.16466175332322888, 0.28181408049442386, -0.43340162982115116, -0.2284636410895264, 0.13116815228860867, 0.1499516998836503, 0.09887251015163787, -0.031093564142082315, -0.29895593207757704, 0.10071204082997537, -0.11065794148578725, -0.04171081897856175, -0.10363352567963731, -0.008734460731422335, -0.04803199708279779, -0.28661418462375543, 0.03404472198674519, 0.10609877441846498, 0.048489782722377826, -0.039434434385734726, -0.06571524750492161, -0.01069090579336659, 0.13905687293843313, 0.015942497240465092, 0.06989290287862693, 0.08710122977693875, -0.1710496366280934, -0.09947016874720321, 0.3572219300040997, -0.04504466318557489, -0.23148019479764304, 0.20421378250399755, -0.025735425232941735, -0.13570265466315223, 0.12770133934668854, 0.17775884493529776, 0.09980053002357311, -0.1521387462753096, 0.022681157207370725, -0.08469007999753986, 0.2056221281520851, 0.05150724531568844, -0.00023568412703836616, 0.21290677677286018, 0.22192815309604522, 0.06334133019628024, 0.14852990550939102, -0.07946308581399378, -0.050763432728661885, -0.2506016182188673, -0.11354007629976051, -0.22868413598030463, 0.030338139758373735, -0.07594807595093186, -0.13911204766216165, 0.3893002146900492, 0.18613520683319276, 0.2862596156506467, 0.08961391450045095, 0.3169729629124718, 0.10169773527632478, 0.13328825094571187, 0.08762768843618018, 0.21188908586299968, 0.10587776776660106, 0.060392130359648674, -0.16408454658177243, 0.11629386568152957, 0.0725188318843386] |
1,802.07089 | Attentive Tensor Product Learning | This paper proposes a new architecture - Attentive Tensor Product Learning
(ATPL) - to represent grammatical structures in deep learning models. ATPL is a
new architecture to bridge this gap by exploiting Tensor Product
Representations (TPR), a structured neural-symbolic model developed in
cognitive science, aiming to integrate deep learning with explicit language
structures and rules. The key ideas of ATPL are: 1) unsupervised learning of
role-unbinding vectors of words via TPR-based deep neural network; 2) employing
attention modules to compute TPR; and 3) integration of TPR with typical deep
learning architectures including Long Short-Term Memory (LSTM) and Feedforward
Neural Network (FFNN). The novelty of our approach lies in its ability to
extract the grammatical structure of a sentence by using role-unbinding
vectors, which are obtained in an unsupervised manner. This ATPL approach is
applied to 1) image captioning, 2) part of speech (POS) tagging, and 3)
constituency parsing of a sentence. Experimental results demonstrate the
effectiveness of the proposed approach.
| cs.CL cs.AI cs.LG cs.NE | this paper proposes a new architecture attentive tensor product learning atpl to represent grammatical structures in deep learning models atpl is a new architecture to bridge this gap by exploiting tensor product representations tpr a structured neuralsymbolic model developed in cognitive science aiming to integrate deep learning with explicit language structures and rules the key ideas of atpl are 1 unsupervised learning of roleunbinding vectors of words via tprbased deep neural network 2 employing attention modules to compute tpr and 3 integration of tpr with typical deep learning architectures including long shortterm memory lstm and feedforward neural network ffnn the novelty of our approach lies in its ability to extract the grammatical structure of a sentence by using roleunbinding vectors which are obtained in an unsupervised manner this atpl approach is applied to 1 image captioning 2 part of speech pos tagging and 3 constituency parsing of a sentence experimental results demonstrate the effectiveness of the proposed approach | [['this', 'paper', 'proposes', 'a', 'new', 'architecture', 'attentive', 'tensor', 'product', 'learning', 'atpl', 'to', 'represent', 'grammatical', 'structures', 'in', 'deep', 'learning', 'models', 'atpl', 'is', 'a', 'new', 'architecture', 'to', 'bridge', 'this', 'gap', 'by', 'exploiting', 'tensor', 'product', 'representations', 'tpr', 'a', 'structured', 'neuralsymbolic', 'model', 'developed', 'in', 'cognitive', 'science', 'aiming', 'to', 'integrate', 'deep', 'learning', 'with', 'explicit', 'language', 'structures', 'and', 'rules', 'the', 'key', 'ideas', 'of', 'atpl', 'are', '1', 'unsupervised', 'learning', 'of', 'roleunbinding', 'vectors', 'of', 'words', 'via', 'tprbased', 'deep', 'neural', 'network', '2', 'employing', 'attention', 'modules', 'to', 'compute', 'tpr', 'and', '3', 'integration', 'of', 'tpr', 'with', 'typical', 'deep', 'learning', 'architectures', 'including', 'long', 'shortterm', 'memory', 'lstm', 'and', 'feedforward', 'neural', 'network', 'ffnn', 'the', 'novelty', 'of', 'our', 'approach', 'lies', 'in', 'its', 'ability', 'to', 'extract', 'the', 'grammatical', 'structure', 'of', 'a', 'sentence', 'by', 'using', 'roleunbinding', 'vectors', 'which', 'are', 'obtained', 'in', 'an', 'unsupervised', 'manner', 'this', 'atpl', 'approach', 'is', 'applied', 'to', '1', 'image', 'captioning', '2', 'part', 'of', 'speech', 'pos', 'tagging', 'and', '3', 'constituency', 'parsing', 'of', 'a', 'sentence', 'experimental', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'approach']] | [-0.036545965432005514, -0.017600870926943787, -0.04677739475444434, 0.05521673976909369, -0.14876836551958397, -0.18311248088602547, 0.02044804278942074, 0.4631705470976366, -0.31977926964640235, -0.3003008787117596, 0.006745680623871695, -0.2234051304003283, -0.24338822930185183, 0.1331404539979668, -0.1154773367307843, 0.07092312099908887, 0.11520710190354734, 0.06080911718724165, -0.05673353958639144, -0.26059739947671984, 0.327188525182806, 0.048266982696030976, 0.3501180063230193, -0.008865657289568809, 0.18345081805293062, -0.05772148603632762, -0.05494153233052967, -0.09587458539665172, -0.019778299745273106, 0.27020332272384007, 0.37653812770183503, 0.2321815873069131, 0.3494837153495355, -0.3897149812691151, -0.218508095907605, 0.030417141332558007, 0.14279707102438696, 0.08977991979899905, -0.0006305625614751676, -0.35766889131405527, 0.11720313671027209, -0.22268976122259523, 0.08562086737317265, -0.17369376535224876, -0.014790582283738123, -0.031759882267196754, -0.26033044931483246, 0.009527657376038752, 0.14358218024769548, 0.061258172121968206, -0.07157469222064065, -0.14378637491256757, 0.06683092537205548, 0.15569714211508823, -0.011840878348874675, 0.11779013012126563, 0.11849947916314148, -0.20929213697950882, -0.19860114624640743, 0.30386581822375586, -0.08522600856176607, -0.206862951254963, 0.1643210872711175, 0.01583539968457334, -0.15381621267456727, 0.06214718743980785, 0.25553606286834757, 0.08363530909787911, -0.16274215127408184, 0.037482018344872484, -0.02284714201417793, 0.18462052826167552, 0.07202486410903133, -0.032472893981274904, 0.16412230798526767, 0.323179991269235, -0.054681516940569046, 0.13817289127719107, -0.11897112723887797, -0.05375048894862271, -0.1957594264494433, -0.12224532579587903, -0.16381830046291518, -0.005401155923249995, -0.1117731940507693, -0.1400632073711248, 0.4272290590652235, 0.2008632971181469, 0.20961615082064117, 0.1735011139880142, 0.33438624916182963, -0.0022436743624401605, 0.17202365080155668, 0.11209507445081072, 0.14963860441574672, 0.07524382595008441, 0.14917040508904844, -0.12404046404015297, 0.07368671738951924, 0.0951971848870503] |
1,802.0709 | The Parameterized Complexity of Packing Arc-Disjoint Cycles in
Tournaments | Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the
Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$
arc-disjoint cycles. This problem is known to be W[1]-hard in general directed
graphs. In this paper, we initiate a systematic study on the parameterized
complexity of the problem restricted to tournaments. We show that the problem
is fixed-parameter tractable and admits a polynomial kernel when parameterized
by the solution size $k$. In particular, we show that it can be solved in
$2^{\mathcal{O}(k \log k)} n^{\mathcal{O}(1)}$ time and has a kernel with
$\mathcal{O}(k)$ vertices. The primary ingredient in both these results is a
min-max theorem that states that every tournament either contains $k$
arc-disjoint triangles or has a feedback arc set of size at most $6k$. Our
belief is that this combinatorial result is of independent interest and could
be useful in other problems related to cycles in tournaments.
| cs.DS | given a directed graph d on n vertices and a positive integer k the arcdisjoint cycle packing problem is to determine whether d has k arcdisjoint cycles this problem is known to be w1hard in general directed graphs in this paper we initiate a systematic study on the parameterized complexity of the problem restricted to tournaments we show that the problem is fixedparameter tractable and admits a polynomial kernel when parameterized by the solution size k in particular we show that it can be solved in 2mathcalok log k nmathcalo1 time and has a kernel with mathcalok vertices the primary ingredient in both these results is a minmax theorem that states that every tournament either contains k arcdisjoint triangles or has a feedback arc set of size at most 6k our belief is that this combinatorial result is of independent interest and could be useful in other problems related to cycles in tournaments | [['given', 'a', 'directed', 'graph', 'd', 'on', 'n', 'vertices', 'and', 'a', 'positive', 'integer', 'k', 'the', 'arcdisjoint', 'cycle', 'packing', 'problem', 'is', 'to', 'determine', 'whether', 'd', 'has', 'k', 'arcdisjoint', 'cycles', 'this', 'problem', 'is', 'known', 'to', 'be', 'w1hard', 'in', 'general', 'directed', 'graphs', 'in', 'this', 'paper', 'we', 'initiate', 'a', 'systematic', 'study', 'on', 'the', 'parameterized', 'complexity', 'of', 'the', 'problem', 'restricted', 'to', 'tournaments', 'we', 'show', 'that', 'the', 'problem', 'is', 'fixedparameter', 'tractable', 'and', 'admits', 'a', 'polynomial', 'kernel', 'when', 'parameterized', 'by', 'the', 'solution', 'size', 'k', 'in', 'particular', 'we', 'show', 'that', 'it', 'can', 'be', 'solved', 'in', '2mathcalok', 'log', 'k', 'nmathcalo1', 'time', 'and', 'has', 'a', 'kernel', 'with', 'mathcalok', 'vertices', 'the', 'primary', 'ingredient', 'in', 'both', 'these', 'results', 'is', 'a', 'minmax', 'theorem', 'that', 'states', 'that', 'every', 'tournament', 'either', 'contains', 'k', 'arcdisjoint', 'triangles', 'or', 'has', 'a', 'feedback', 'arc', 'set', 'of', 'size', 'at', 'most', '6k', 'our', 'belief', 'is', 'that', 'this', 'combinatorial', 'result', 'is', 'of', 'independent', 'interest', 'and', 'could', 'be', 'useful', 'in', 'other', 'problems', 'related', 'to', 'cycles', 'in', 'tournaments']] | [-0.17828876631162865, 0.12679923679120533, -0.05795201948096387, 0.04007447950808503, -0.11131962196974966, -0.16772970321012268, 0.08412942312133964, 0.3754356474321532, -0.30979580647008814, -0.2982245429486379, 0.09980740657116066, -0.3104656350700871, -0.15399676265721945, 0.1465736744943761, -0.10450859721382394, 0.021962577293283846, 0.11809267046919558, 0.10006415555222989, 0.032883766126456306, -0.31350097534538546, 0.28414824244406955, -0.03122884175727928, 0.13198585253313036, 0.10211024684586416, 0.06851349586596418, 0.01477780463373117, 0.03125829742547419, 0.1347228447963349, -0.16476507840941754, 0.04400464191559494, 0.3257748722343853, 0.19386833341439724, 0.27646864418822686, -0.36886701115470616, -0.17715928701708386, 0.22393680527870616, 0.1251407688189494, 0.061011325630763745, 0.03148140362004357, -0.15960586902771243, 0.14537567527976966, -0.059406183825462665, -0.09261786882722702, 0.002141824179010368, 0.12179831265147138, -0.05127119096355751, -0.28627880206209066, -0.009038956924709246, 0.12460522511690597, 0.026458114495893057, 0.02776716434317151, -0.16625668369095747, 0.023870009699174643, 0.07310847681430077, -0.033411268592125884, 0.11758301532551597, 0.02183798128259552, -0.10428470467492221, -0.17962987809196898, 0.37288833429001417, -0.02509073594793383, -0.17841857419300236, 0.13153321601107323, -0.11592607076071497, -0.20538242754379385, 0.13011414835254023, 0.1480512962221646, 0.19943957248592356, -0.10219036370386005, 0.14848925395850338, -0.17484723699300575, 0.151924875929437, 0.10331525429960732, -0.05332863719721852, 0.11200281921169096, 0.16187888289507674, 0.17126658793054766, 0.2106279552922627, 0.02287752993441628, -0.027106794858761867, -0.25712259945239085, -0.0976238290803801, -0.21631176424623272, 0.06657718523485145, -0.14994940194446826, -0.16594932442776075, 0.38494823982105836, 0.10292611110612358, 0.2007047828029547, 0.11151132172687396, 0.22879449674541033, 0.12296599667149023, 0.03274345912704073, 0.16968255988812367, 0.1325027214408788, 0.13649375332936056, 0.005923318578616569, -0.2012602161420019, 0.10280378386960365, 0.11806636429269259] |
1,802.07091 | An Efficient Semismooth Newton Based Algorithm for Convex Clustering | Clustering may be the most fundamental problem in unsupervised learning which
is still active in machine learning research because its importance in many
applications. Popular methods like K-means, may suffer from instability as they
are prone to get stuck in its local minima. Recently, the sum-of-norms (SON)
model (also known as clustering path), which is a convex relaxation of
hierarchical clustering model, has been proposed in [7] and [5] Although
numerical algorithms like ADMM and AMA are proposed to solve convex clustering
model [2], it is known to be very challenging to solve large-scale problems. In
this paper, we propose a semi-smooth Newton based augmented Lagrangian method
for large-scale convex clustering problems. Extensive numerical experiments on
both simulated and real data demonstrate that our algorithm is highly efficient
and robust for solving large-scale problems. Moreover, the numerical results
also show the superior performance and scalability of our algorithm compared to
existing first-order methods.
| math.OC cs.LG | clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications popular methods like kmeans may suffer from instability as they are prone to get stuck in its local minima recently the sumofnorms son model also known as clustering path which is a convex relaxation of hierarchical clustering model has been proposed in 7 and 5 although numerical algorithms like admm and ama are proposed to solve convex clustering model 2 it is known to be very challenging to solve largescale problems in this paper we propose a semismooth newton based augmented lagrangian method for largescale convex clustering problems extensive numerical experiments on both simulated and real data demonstrate that our algorithm is highly efficient and robust for solving largescale problems moreover the numerical results also show the superior performance and scalability of our algorithm compared to existing firstorder methods | [['clustering', 'may', 'be', 'the', 'most', 'fundamental', 'problem', 'in', 'unsupervised', 'learning', 'which', 'is', 'still', 'active', 'in', 'machine', 'learning', 'research', 'because', 'its', 'importance', 'in', 'many', 'applications', 'popular', 'methods', 'like', 'kmeans', 'may', 'suffer', 'from', 'instability', 'as', 'they', 'are', 'prone', 'to', 'get', 'stuck', 'in', 'its', 'local', 'minima', 'recently', 'the', 'sumofnorms', 'son', 'model', 'also', 'known', 'as', 'clustering', 'path', 'which', 'is', 'a', 'convex', 'relaxation', 'of', 'hierarchical', 'clustering', 'model', 'has', 'been', 'proposed', 'in', '7', 'and', '5', 'although', 'numerical', 'algorithms', 'like', 'admm', 'and', 'ama', 'are', 'proposed', 'to', 'solve', 'convex', 'clustering', 'model', '2', 'it', 'is', 'known', 'to', 'be', 'very', 'challenging', 'to', 'solve', 'largescale', 'problems', 'in', 'this', 'paper', 'we', 'propose', 'a', 'semismooth', 'newton', 'based', 'augmented', 'lagrangian', 'method', 'for', 'largescale', 'convex', 'clustering', 'problems', 'extensive', 'numerical', 'experiments', 'on', 'both', 'simulated', 'and', 'real', 'data', 'demonstrate', 'that', 'our', 'algorithm', 'is', 'highly', 'efficient', 'and', 'robust', 'for', 'solving', 'largescale', 'problems', 'moreover', 'the', 'numerical', 'results', 'also', 'show', 'the', 'superior', 'performance', 'and', 'scalability', 'of', 'our', 'algorithm', 'compared', 'to', 'existing', 'firstorder', 'methods']] | [-0.0356313831490345, -0.030030021581823302, -0.10088668638644249, 0.09952620357982692, -0.12448122818022966, -0.18276379855447694, -0.031886596111259054, 0.429891869444155, -0.31587567338857825, -0.34969937811049595, 0.16779347902813338, -0.2549666858766087, -0.23501749449764917, 0.24084792256287887, -0.09776162876330904, 0.11569711188234291, 0.12100498374600552, 0.00011834919247408642, -0.07657350135329914, -0.3136775658992854, 0.23026460175721072, 0.05762339485073952, 0.31955480302598227, 0.05150187512443058, 0.08525340205233078, -0.05266741447696021, -0.023993115473881756, 0.08977965833496694, -0.03652115516069898, 0.13317931130471775, 0.32743175015907344, 0.20022864654617334, 0.3556136060015936, -0.40746053153538686, -0.21380181267618595, 0.1262785797390327, 0.20988165592088512, 0.10567999712504006, -0.10968109269819443, -0.27027180536319256, 0.1281666649462606, -0.11447644255454897, -0.04739582435056371, -0.1803767352708076, -0.03534309919555917, 0.00931987689507782, -0.28416656695940457, 0.09119614570877993, 0.030219280139518606, -0.0009841628826076263, -0.06738450843534481, -0.1444438643214342, 0.06550720387665358, 0.03385091124800965, 0.07110836023945778, 0.0649126030529212, 0.11398274315165748, -0.1260962764882654, -0.18154012076985582, 0.4216177946226181, 0.012398343349463846, -0.22045718417901203, 0.2561121614126023, 0.009209418871538028, -0.19082871957767852, 0.12214856806186665, 0.2384307787387546, 0.1936496814964094, -0.1360316206456015, 0.07508230991592618, -0.052435535729225526, 0.11773806846069515, -0.007440368511628262, -0.04755498549447542, 0.10381776239213841, 0.2224900617377563, 0.12419049110298817, 0.11254626746353767, -0.08631867201429007, -0.13823191111135347, -0.16706601010120817, -0.0821669974554281, -0.21851009269869937, -0.06315304181005463, -0.11371896347889943, -0.17272387313852577, 0.3564655237255226, 0.22538836032771015, 0.18205158595044754, 0.07055387880781812, 0.38057696356094983, 0.06698767098867775, 0.07081462554158766, 0.1250795156964542, 0.24656864592505276, 0.07353399925264775, 0.08633069444974688, -0.20990508113295378, 0.04736812207020672, 0.06016425029864829] |
1,802.07092 | Propagation of regularity and positive definiteness: a constructive
approach | We show that, for positive definite kernels, if specific forms of regularity
(continuity, Sn-differentiability or holomorphy) hold locally on the diagonal,
then they must hold globally on the whole domain of positive-definiteness. This
local-to-global propagation of regularity is constructively shown to be a
consequence of the algebraic structure induced by the non-negativity of the
associated bilinear forms up to order 5. Consequences of these results for
topological groups and for positive definite and exponentially convex functions
are explored.
| math.CV math.FA | we show that for positive definite kernels if specific forms of regularity continuity sndifferentiability or holomorphy hold locally on the diagonal then they must hold globally on the whole domain of positivedefiniteness this localtoglobal propagation of regularity is constructively shown to be a consequence of the algebraic structure induced by the nonnegativity of the associated bilinear forms up to order 5 consequences of these results for topological groups and for positive definite and exponentially convex functions are explored | [['we', 'show', 'that', 'for', 'positive', 'definite', 'kernels', 'if', 'specific', 'forms', 'of', 'regularity', 'continuity', 'sndifferentiability', 'or', 'holomorphy', 'hold', 'locally', 'on', 'the', 'diagonal', 'then', 'they', 'must', 'hold', 'globally', 'on', 'the', 'whole', 'domain', 'of', 'positivedefiniteness', 'this', 'localtoglobal', 'propagation', 'of', 'regularity', 'is', 'constructively', 'shown', 'to', 'be', 'a', 'consequence', 'of', 'the', 'algebraic', 'structure', 'induced', 'by', 'the', 'nonnegativity', 'of', 'the', 'associated', 'bilinear', 'forms', 'up', 'to', 'order', '5', 'consequences', 'of', 'these', 'results', 'for', 'topological', 'groups', 'and', 'for', 'positive', 'definite', 'and', 'exponentially', 'convex', 'functions', 'are', 'explored']] | [-0.15236509019091676, 0.11731619887997384, -0.07035984552779852, 0.10752266817181916, -0.11887566626749256, -0.10447476812118253, -0.0166423125313474, 0.3710666485614591, -0.3458514887500893, -0.17777813507800366, 0.16323767721580415, -0.23414418442392504, -0.15389142595171057, 0.19025359570967976, -0.04217032765268118, 0.07089994796672715, 0.023544546299880103, 0.07909472713658175, -0.13177248796103402, -0.3139379624634159, 0.4389033622483348, -0.057425838496003835, 0.21037203895968276, 0.13067557554474318, 0.106442573749424, -0.0367128155073272, 0.010841758806839005, 0.028024597528886485, -0.12384704446358465, 0.14722194465772284, 0.2306750714657949, 0.12086953606166236, 0.25801315369362665, -0.42884681850381484, -0.18557244594898317, 0.15707103030562594, 0.10729562041845608, 0.01049391862440419, -0.05972794387580271, -0.28528765291459374, 0.19183261054507517, -0.0916270588452069, -0.16940069406039335, -0.14673854057471475, 0.02261447651287565, 0.05486348634222885, -0.2892019741528958, 0.07161788823832939, 0.1451046760133528, 0.03408671882874393, -0.13183699322670892, -0.10976930589614702, -0.048914627946139155, 0.10226450872293057, 0.027388034367256543, 0.014989523691814634, 0.0458653287949984, -0.09063096609051255, -0.07571547771743559, 0.32567278957357265, -0.037995215476635695, -0.30294375436066034, 0.19782872858015796, -0.18889783100979463, -0.1259945365116484, 0.0987301700107463, 0.14784082633672985, 0.1275181006761147, -0.07940713583579433, 0.14381871127535578, -0.06497807894204441, 0.12122850944953305, 0.132606604372381, 0.03992092880940476, 0.14325906826310197, 0.03861520584527548, 0.17504194732029715, 0.1193274516966073, 0.06980613746012065, -0.06318083376466453, -0.36870599315538033, -0.17958877126190376, -0.15973459784993782, 0.13087781466688816, -0.11077203359658976, -0.19058782507343425, 0.39129067227915654, 0.06163611046250988, 0.16848921942730227, 0.11828683411049379, 0.1965315730504498, 0.1305882830124397, 0.09804079915675057, 0.06212528222300983, 0.17628863601425251, 0.17490268346563273, 0.031499162255846834, -0.16360805524730837, 0.09586128669295024, 0.1108912428865185] |
1,802.07093 | On the non-detectability of spiked large random tensors | This paper addresses the detection of a low rank high-dimensional tensor
corrupted by an additive complex Gaussian noise. In the asymptotic regime where
all the dimensions of the tensor converge towards $+\infty$ at the same rate,
existing results devoted to rank 1 tensors are extended. It is proved that if a
certain parameter depending on the low rank tensor is below a threshold, then
the null hypothesis and the presence of the low rank tensor are
undistinguishable hypotheses in the sense that no test performs better than a
random choice.
| eess.SP | this paper addresses the detection of a low rank highdimensional tensor corrupted by an additive complex gaussian noise in the asymptotic regime where all the dimensions of the tensor converge towards infty at the same rate existing results devoted to rank 1 tensors are extended it is proved that if a certain parameter depending on the low rank tensor is below a threshold then the null hypothesis and the presence of the low rank tensor are undistinguishable hypotheses in the sense that no test performs better than a random choice | [['this', 'paper', 'addresses', 'the', 'detection', 'of', 'a', 'low', 'rank', 'highdimensional', 'tensor', 'corrupted', 'by', 'an', 'additive', 'complex', 'gaussian', 'noise', 'in', 'the', 'asymptotic', 'regime', 'where', 'all', 'the', 'dimensions', 'of', 'the', 'tensor', 'converge', 'towards', 'infty', 'at', 'the', 'same', 'rate', 'existing', 'results', 'devoted', 'to', 'rank', '1', 'tensors', 'are', 'extended', 'it', 'is', 'proved', 'that', 'if', 'a', 'certain', 'parameter', 'depending', 'on', 'the', 'low', 'rank', 'tensor', 'is', 'below', 'a', 'threshold', 'then', 'the', 'null', 'hypothesis', 'and', 'the', 'presence', 'of', 'the', 'low', 'rank', 'tensor', 'are', 'undistinguishable', 'hypotheses', 'in', 'the', 'sense', 'that', 'no', 'test', 'performs', 'better', 'than', 'a', 'random', 'choice']] | [-0.11832839170884756, 0.141970268607353, -0.03340681084017787, 0.06686640163598996, -0.04679030436349826, -0.17464530626311897, -0.007559830005953295, 0.3157539213283194, -0.24894985947240558, -0.20635222806595266, 0.13961761587351146, -0.2435956328848584, -0.17786502665063988, 0.12890384572221794, -0.0626751598636272, 0.031920059465078844, 0.02768441745493975, 0.11767596673841278, -0.09548657769337296, -0.2993584964217411, 0.3551075039483193, 0.1032000402531897, 0.3176040117835833, -0.00305161705861489, 0.12883576789043016, -0.016446349630132317, -0.028595477590958276, 0.019070693333115844, -0.06932549855442226, 0.0760821579877908, 0.2801007379674249, 0.10128266074073812, 0.3084003871306777, -0.3541979240357048, -0.18384224197102916, 0.17828952560408248, 0.10302253986398378, 0.05931063498266869, 0.027774085439482912, -0.25627187963885567, 0.19204989961451954, -0.1499447664970325, -0.12285528286981086, -0.08665531868528989, -0.006903844155992071, -0.04014970575485172, -0.318747488140232, 0.10751735898666084, 0.1068139982720216, 0.02386158532463014, -0.06454855093939436, -0.16656260472308432, 0.02726582873923083, 0.07667194601769249, 0.09143425930394894, 0.023048113603403586, 0.11473728986456991, -0.1522765475454637, -0.051807914039171815, 0.3326610233220789, -0.07100552288223601, -0.2699495217659407, 0.20897419683945676, -0.14297732477490271, -0.15024314628293117, 0.13649903279987888, 0.1485776335725354, 0.13028135415709888, -0.06173119847662747, 0.13368405181584725, -0.06151263460762695, 0.17956686546612116, 0.09948982148845163, 0.0065416799327876005, 0.1283203253832956, 0.11676067026952902, 0.12003499885193175, 0.12462548059152646, -0.07191393591411825, -0.041267312152518165, -0.3147566437100371, -0.1232613999163732, -0.2361124378331523, 0.06318258676910773, -0.16428787689122448, -0.1628090070767535, 0.37302407617163325, 0.1319524959253613, 0.2154624551586393, 0.1279465162091785, 0.3248988464112497, 0.11722601836857696, -0.00802351941044132, 0.1154480654021932, 0.23192948367860583, 0.15304869211847996, 0.030587668960086172, -0.119511148152459, 0.08853180585946474, 0.049361984121302764] |
1,802.07094 | Camera-based vehicle velocity estimation from monocular video | This paper documents the winning entry at the CVPR2017 vehicle velocity
estimation challenge. Velocity estimation is an emerging task in autonomous
driving which has not yet been thoroughly explored. The goal is to estimate the
relative velocity of a specific vehicle from a sequence of images. In this
paper, we present a light-weight approach for directly regressing vehicle
velocities from their trajectories using a multilayer perceptron. Another
contribution is an explorative study of features for monocular vehicle velocity
estimation. We find that light-weight trajectory based features outperform
depth and motion cues extracted from deep ConvNets, especially for far-distance
predictions where current disparity and optical flow estimators are challenged
significantly. Our light-weight approach is real-time capable on a single CPU
and outperforms all competing entries in the velocity estimation challenge. On
the test set, we report an average error of 1.12 m/s which is comparable to a
(ground-truth) system that combines LiDAR and radar techniques to achieve an
error of around 0.71 m/s.
| cs.CV | this paper documents the winning entry at the cvpr2017 vehicle velocity estimation challenge velocity estimation is an emerging task in autonomous driving which has not yet been thoroughly explored the goal is to estimate the relative velocity of a specific vehicle from a sequence of images in this paper we present a lightweight approach for directly regressing vehicle velocities from their trajectories using a multilayer perceptron another contribution is an explorative study of features for monocular vehicle velocity estimation we find that lightweight trajectory based features outperform depth and motion cues extracted from deep convnets especially for fardistance predictions where current disparity and optical flow estimators are challenged significantly our lightweight approach is realtime capable on a single cpu and outperforms all competing entries in the velocity estimation challenge on the test set we report an average error of 112 ms which is comparable to a groundtruth system that combines lidar and radar techniques to achieve an error of around 071 ms | [['this', 'paper', 'documents', 'the', 'winning', 'entry', 'at', 'the', 'cvpr2017', 'vehicle', 'velocity', 'estimation', 'challenge', 'velocity', 'estimation', 'is', 'an', 'emerging', 'task', 'in', 'autonomous', 'driving', 'which', 'has', 'not', 'yet', 'been', 'thoroughly', 'explored', 'the', 'goal', 'is', 'to', 'estimate', 'the', 'relative', 'velocity', 'of', 'a', 'specific', 'vehicle', 'from', 'a', 'sequence', 'of', 'images', 'in', 'this', 'paper', 'we', 'present', 'a', 'lightweight', 'approach', 'for', 'directly', 'regressing', 'vehicle', 'velocities', 'from', 'their', 'trajectories', 'using', 'a', 'multilayer', 'perceptron', 'another', 'contribution', 'is', 'an', 'explorative', 'study', 'of', 'features', 'for', 'monocular', 'vehicle', 'velocity', 'estimation', 'we', 'find', 'that', 'lightweight', 'trajectory', 'based', 'features', 'outperform', 'depth', 'and', 'motion', 'cues', 'extracted', 'from', 'deep', 'convnets', 'especially', 'for', 'fardistance', 'predictions', 'where', 'current', 'disparity', 'and', 'optical', 'flow', 'estimators', 'are', 'challenged', 'significantly', 'our', 'lightweight', 'approach', 'is', 'realtime', 'capable', 'on', 'a', 'single', 'cpu', 'and', 'outperforms', 'all', 'competing', 'entries', 'in', 'the', 'velocity', 'estimation', 'challenge', 'on', 'the', 'test', 'set', 'we', 'report', 'an', 'average', 'error', 'of', '112', 'ms', 'which', 'is', 'comparable', 'to', 'a', 'groundtruth', 'system', 'that', 'combines', 'lidar', 'and', 'radar', 'techniques', 'to', 'achieve', 'an', 'error', 'of', 'around', '071', 'ms']] | [-0.08876303132473035, 0.01632371359766513, -0.09489734776416411, -0.006804087700362763, -0.07898350152106065, -0.15754024248269405, 0.019273988709507382, 0.4360419889183148, -0.24254413068248248, -0.32623158258773527, 0.08714171235018658, -0.2760178178248013, -0.14500402642293944, 0.2298504179719581, -0.16660718240352893, 0.10491530101613275, 0.1353307608399332, 0.05827627045692448, -0.045964324419706284, -0.21747444201295513, 0.254083510670487, 0.021033552355062136, 0.3278649046565898, 0.0038620372612306977, 0.17895495390912852, -0.025611892077921434, -0.025858530687220303, -0.001702470256605689, -0.08108527051989547, 0.15870464128089248, 0.2462150994702734, 0.13730265769199324, 0.3124380091101116, -0.3629588373468159, -0.19138484622889795, 0.0575739977424328, 0.1668648648253636, 0.10867519947983649, -0.03331290709971225, -0.352279503071993, 0.0986578778843887, -0.18969575986078135, -0.04984725725143622, -0.0665067313528209, 0.026714283823301748, -0.007868181196076112, -0.2915236813432728, 0.06957779584383095, 0.00427805116821857, 0.11094811963357078, -0.0832174366603241, -0.10133377306368664, 0.038157177065146264, 0.18175997090184634, 0.012107727910328355, 0.08644892001432014, 0.16397898369439826, -0.18302182355998314, -0.10299026509544448, 0.394497869993265, -0.07305485964608119, -0.19352274116631946, 0.1619410323519954, -0.051968897577166925, -0.12450805193923922, 0.14198135407583684, 0.2313096048158553, 0.12197981979582251, -0.17375734877456825, -0.043154233047067656, -0.0384462435298848, 0.2075082513312838, 0.01825989071013672, -0.024147376432575238, 0.21664920433059984, 0.24822428189680812, 0.0940660848976431, 0.07566877105707152, -0.22508722476614929, -0.05452604396037341, -0.2103620881130861, -0.11852554548734232, -0.21585623037304313, -0.047248011910387674, -0.07228440260594156, -0.12747727178170212, 0.38654220613263407, 0.26493411113644344, 0.19866580314795423, 0.11712092917227412, 0.4021519772847247, 0.06595220998399934, 0.057066450810916027, 0.12653960968094433, 0.2354220016201472, 0.031544021191943133, 0.1275842290585687, -0.1925511288005419, 0.11215593630841338, 0.05375636572029835] |
1,802.07095 | Uncertainty Estimates and Multi-Hypotheses Networks for Optical Flow | Optical flow estimation can be formulated as an end-to-end supervised
learning problem, which yields estimates with a superior accuracy-runtime
tradeoff compared to alternative methodology. In this paper, we make such
networks estimate their local uncertainty about the correctness of their
prediction, which is vital information when building decisions on top of the
estimations. For the first time we compare several strategies and techniques to
estimate uncertainty in a large-scale computer vision task like optical flow
estimation. Moreover, we introduce a new network architecture utilizing the
Winner-Takes-All loss and show that this can provide complementary hypotheses
and uncertainty estimates efficiently with a single forward pass and without
the need for sampling or ensembles. Finally, we demonstrate the quality of the
different uncertainty estimates, which is clearly above previous confidence
measures on optical flow and allows for interactive frame rates.
| cs.CV | optical flow estimation can be formulated as an endtoend supervised learning problem which yields estimates with a superior accuracyruntime tradeoff compared to alternative methodology in this paper we make such networks estimate their local uncertainty about the correctness of their prediction which is vital information when building decisions on top of the estimations for the first time we compare several strategies and techniques to estimate uncertainty in a largescale computer vision task like optical flow estimation moreover we introduce a new network architecture utilizing the winnertakesall loss and show that this can provide complementary hypotheses and uncertainty estimates efficiently with a single forward pass and without the need for sampling or ensembles finally we demonstrate the quality of the different uncertainty estimates which is clearly above previous confidence measures on optical flow and allows for interactive frame rates | [['optical', 'flow', 'estimation', 'can', 'be', 'formulated', 'as', 'an', 'endtoend', 'supervised', 'learning', 'problem', 'which', 'yields', 'estimates', 'with', 'a', 'superior', 'accuracyruntime', 'tradeoff', 'compared', 'to', 'alternative', 'methodology', 'in', 'this', 'paper', 'we', 'make', 'such', 'networks', 'estimate', 'their', 'local', 'uncertainty', 'about', 'the', 'correctness', 'of', 'their', 'prediction', 'which', 'is', 'vital', 'information', 'when', 'building', 'decisions', 'on', 'top', 'of', 'the', 'estimations', 'for', 'the', 'first', 'time', 'we', 'compare', 'several', 'strategies', 'and', 'techniques', 'to', 'estimate', 'uncertainty', 'in', 'a', 'largescale', 'computer', 'vision', 'task', 'like', 'optical', 'flow', 'estimation', 'moreover', 'we', 'introduce', 'a', 'new', 'network', 'architecture', 'utilizing', 'the', 'winnertakesall', 'loss', 'and', 'show', 'that', 'this', 'can', 'provide', 'complementary', 'hypotheses', 'and', 'uncertainty', 'estimates', 'efficiently', 'with', 'a', 'single', 'forward', 'pass', 'and', 'without', 'the', 'need', 'for', 'sampling', 'or', 'ensembles', 'finally', 'we', 'demonstrate', 'the', 'quality', 'of', 'the', 'different', 'uncertainty', 'estimates', 'which', 'is', 'clearly', 'above', 'previous', 'confidence', 'measures', 'on', 'optical', 'flow', 'and', 'allows', 'for', 'interactive', 'frame', 'rates']] | [-0.05640749096612099, 0.014512694632081335, -0.10834283409529726, 0.09494307587419494, -0.08588301921628728, -0.1476029854702906, 0.0785526066736393, 0.44288143262702184, -0.27991789074301937, -0.35265929866318735, 0.14372328837932408, -0.2350315921664804, -0.1450562198726243, 0.23612000525208449, -0.12395219376181545, 0.1212632039597557, 0.13176620975952513, 0.04163272393868223, -0.09220189153706233, -0.2264948460395808, 0.2835477248061938, 0.0679021151906328, 0.33196403001210767, 0.043231104731722904, 0.12074359840829008, 0.030809193015112167, -0.04994469367470728, 0.007074951478891945, -0.13379663053542473, 0.22076356773567216, 0.25709400906773067, 0.15499830664047143, 0.32757643600721864, -0.3958387743464134, -0.2405313312069234, 0.1082571332281741, 0.16226216078647515, 0.12785665752335595, -0.019811881328830973, -0.2893945343238404, 0.07498831830597584, -0.16988235988049177, -0.016004588714984322, -0.11935269298630148, -0.062493433035488655, 0.01882400448658388, -0.32039753107496804, 0.061957648292482986, 0.04052741130147755, 0.04024514201076797, -0.052666662417668306, -0.08606716179302519, 0.0318744319327937, 0.18124163519343817, 0.01660594179628104, 0.02554635746645857, 0.13903054893849567, -0.1410867641000145, -0.15029221395180173, 0.3581035742740126, -0.06170629794976205, -0.2284036423470553, 0.17999978922562415, -0.05428198450007034, -0.13889439552206628, 0.06585125805959649, 0.2366256913413246, 0.0884546105236658, -0.17210043147837242, -0.028187041144128074, -0.0199500000406818, 0.18293559191626135, 0.028937462217431095, 0.03153438791700632, 0.17755507207373633, 0.21987998714486995, 0.10196706794039176, 0.12559825130891272, -0.12478358122812462, -0.05732010198879416, -0.2625658853917661, -0.14948528742138975, -0.14198159618153625, 0.0028613109692224186, -0.1366533265906058, -0.10690807852295846, 0.35467661887298535, 0.2328850293232903, 0.20401731090293856, 0.11806727543449451, 0.36801837042082836, 0.09601278544529375, 0.04288775149909575, 0.0994147612593463, 0.24478715817515406, 0.05518826177975938, 0.09042335526650622, -0.16955380590316452, 0.10683475992553969, 0.04014825552742738] |
1,802.07096 | Generating functions associated to Frobenius algebras | We introduce a generating function associated to the homogeneous generators
of a graded algebra that measures how far is this algebra from being finitely
generated. For the case of some algebras of Frobenius endomorphisms we describe
this generating function explicitly as a rational function.
| math.AC | we introduce a generating function associated to the homogeneous generators of a graded algebra that measures how far is this algebra from being finitely generated for the case of some algebras of frobenius endomorphisms we describe this generating function explicitly as a rational function | [['we', 'introduce', 'a', 'generating', 'function', 'associated', 'to', 'the', 'homogeneous', 'generators', 'of', 'a', 'graded', 'algebra', 'that', 'measures', 'how', 'far', 'is', 'this', 'algebra', 'from', 'being', 'finitely', 'generated', 'for', 'the', 'case', 'of', 'some', 'algebras', 'of', 'frobenius', 'endomorphisms', 'we', 'describe', 'this', 'generating', 'function', 'explicitly', 'as', 'a', 'rational', 'function']] | [-0.13991717968813397, 0.09263199978423389, -0.08272929307581349, 0.10132058103177273, -0.1185452247207815, -0.07508100417908281, -0.06450731692497026, 0.3530339188873768, -0.4212396712973714, -0.16057265863161196, 0.10008041499267248, -0.2688395745459605, -0.20871110148304564, 0.21107836239124564, -0.12333312184041874, -0.030623409050432118, 0.02920512935485352, 0.10188898770138621, -0.13773036499994554, -0.23123985475500708, 0.46532783642495895, 0.031677432141309095, 0.19110617799345742, 0.0014805847128048879, 0.1827337407845665, 0.009043470673284239, -0.0023097636889856817, -0.003989592533219944, -0.16441176682052505, 0.12184122613027946, 0.2957286815667017, 0.14688467615368692, 0.2587629262442616, -0.33225805092264304, -0.07519565243273973, 0.25016799397681927, 0.15289064202542332, 0.03862921148009429, -0.10029347221875055, -0.20316108491335233, 0.11305189551785588, -0.2692610257813199, -0.15268896681531755, -0.09299150653268126, 0.0668110328049145, 0.060564136005599394, -0.28308472665958107, -0.017189290924844416, 0.05438899367370389, 0.1599177771078592, -0.07851135905895551, -0.04289897479413247, -0.07015341797589579, 0.10076340882700276, -0.04292029019085352, 0.04465242871083319, 0.1477045465303077, -0.1110032908406786, -0.15010206774009435, 0.33030304727567866, -0.004517014074901288, -0.31815495511347597, 0.10516607569297776, -0.20016451440328223, -0.1643751199166714, 0.07530224060809071, 0.07984541695226323, 0.16268500961913643, -0.09014809068123047, 0.16689429205672984, -0.17585440564223312, 0.02066704822143286, 0.055310301096390256, 0.0005527836884456602, 0.12810597505251115, 0.08050883701071143, 0.02621180885894732, 0.22020191691858185, 0.10356224353546911, -0.0064370314675298605, -0.406284112483263, -0.17613908083347435, -0.1590971848662858, 0.1706661935684017, -0.057962748634798285, -0.2325243114028126, 0.4982590952210806, 0.17335327333686026, 0.1983883645046841, 0.13524013985244726, 0.2623019513716413, 0.16402107521373016, 0.1479268416508355, 0.005581013085743921, 0.06612893557295055, 0.18210753055014225, -0.03444908324375071, -0.08978607222459024, 0.016526309847408396, 0.17949955571781506] |
1,802.07097 | Maximizing entanglement in bosonic Josephson junctions using shortcuts
to adiabaticity and optimal control | In this article we consider a bosonic Josephson junction, a model system
composed by two coupled nonlinear quantum oscillators which can be implemented
in various physical contexts, initially prepared in a product of weakly
populated coherent states. We quantify the maximum achievable entanglement
between the modes of the junction and then use shortcuts to adiabaticity, a
method developed to speed up adiabatic quantum dynamics, as well as numerical
optimization, to find time-dependent controls (the nonlinearity and the
coupling of the junction) which bring the system to a maximally entangled
state.
| quant-ph physics.optics | in this article we consider a bosonic josephson junction a model system composed by two coupled nonlinear quantum oscillators which can be implemented in various physical contexts initially prepared in a product of weakly populated coherent states we quantify the maximum achievable entanglement between the modes of the junction and then use shortcuts to adiabaticity a method developed to speed up adiabatic quantum dynamics as well as numerical optimization to find timedependent controls the nonlinearity and the coupling of the junction which bring the system to a maximally entangled state | [['in', 'this', 'article', 'we', 'consider', 'a', 'bosonic', 'josephson', 'junction', 'a', 'model', 'system', 'composed', 'by', 'two', 'coupled', 'nonlinear', 'quantum', 'oscillators', 'which', 'can', 'be', 'implemented', 'in', 'various', 'physical', 'contexts', 'initially', 'prepared', 'in', 'a', 'product', 'of', 'weakly', 'populated', 'coherent', 'states', 'we', 'quantify', 'the', 'maximum', 'achievable', 'entanglement', 'between', 'the', 'modes', 'of', 'the', 'junction', 'and', 'then', 'use', 'shortcuts', 'to', 'adiabaticity', 'a', 'method', 'developed', 'to', 'speed', 'up', 'adiabatic', 'quantum', 'dynamics', 'as', 'well', 'as', 'numerical', 'optimization', 'to', 'find', 'timedependent', 'controls', 'the', 'nonlinearity', 'and', 'the', 'coupling', 'of', 'the', 'junction', 'which', 'bring', 'the', 'system', 'to', 'a', 'maximally', 'entangled', 'state']] | [-0.18363079857081174, 0.18819261679115395, -0.05834241025408523, 0.02039673311972163, 0.027169081992987128, -0.21378762673897048, 0.06533588133234945, 0.3193375724574758, -0.2855535857172476, -0.28368811163430413, 0.03404679065182184, -0.23825928552283182, -0.13298328334155182, 0.18657299211610937, -7.184163874222173e-05, 0.09274031154863123, 0.051475545101695594, 0.007176993989075223, -0.0450487386425569, -0.19589668195953386, 0.31271154442802074, 0.006697241286747158, 0.30526274802784126, 0.0057115889930476746, 0.11486248527136114, -0.042478361901723674, 0.10337073732581403, 0.013707870079411402, -0.1262119441629491, 0.08421808929997496, 0.2511428600280649, 0.05473422782961279, 0.2614810603981217, -0.47544327109224266, -0.20684368576233586, 0.07801481594538523, 0.16409488219619056, 0.1748575681484201, 0.015469708809784303, -0.3324228834257358, -0.023844043107237665, -0.2194872653318776, -0.1171431406090657, -0.0908126837004804, -0.02074931165099972, -0.00666915863338444, -0.2661845009101348, 0.051620711230983336, 0.019064685941622077, -0.013729893020354211, 0.018240882290734187, 0.02770507967345313, -0.026842836886903063, 0.08489394955750969, -0.054293906872367695, -0.0064641770027163955, 0.15069473734539415, -0.12349875518896927, -0.1199743879855507, 0.32225127273704857, -0.09132689034255842, -0.22727570809010003, 0.18929745881921714, -0.07521710196613438, -0.05864847156270925, 0.04588772086426616, 0.1808313337051206, 0.1226548049495452, -0.18704607830279404, 0.04591028377051569, 0.013968738794533742, 0.1805858266953793, 0.07473709804730283, 0.07480516026520895, 0.2071097622276284, 0.159705016694756, 0.07920935735520389, 0.23239248851184838, -0.042778466667773, -0.16887595732178953, -0.29198599303037753, -0.15562338190567163, -0.21148106118457186, 0.0930706287165069, -0.03310423835872724, -0.16230602676255834, 0.44627719641559654, 0.1563106636555555, 0.1569034915210472, -0.02940242004632536, 0.2831286226295763, 0.14990579409576538, 0.023310287131203547, 0.06484110792064005, 0.27378360897095666, 0.19242033115329427, 0.07228157166909012, -0.2933851760242962, -0.014156588047949805, 0.006474359328341153] |
1,802.07098 | Do Less, Get More: Streaming Submodular Maximization with Subsampling | In this paper, we develop the first one-pass streaming algorithm for
submodular maximization that does not evaluate the entire stream even once. By
carefully subsampling each element of data stream, our algorithm enjoys the
tightest approximation guarantees in various settings while having the smallest
memory footprint and requiring the lowest number of function evaluations. More
specifically, for a monotone submodular function and a $p$-matchoid constraint,
our randomized algorithm achieves a $4p$ approximation ratio (in expectation)
with $O(k)$ memory and $O(km/p)$ queries per element ($k$ is the size of the
largest feasible solution and $m$ is the number of matroids used to define the
constraint). For the non-monotone case, our approximation ratio increases only
slightly to $4p+2-o(1)$. To the best or our knowledge, our algorithm is the
first that combines the benefits of streaming and subsampling in a novel way in
order to truly scale submodular maximization to massive machine learning
problems. To showcase its practicality, we empirically evaluated the
performance of our algorithm on a video summarization application and observed
that it outperforms the state-of-the-art algorithm by up to fifty fold, while
maintaining practically the same utility.
| cs.LG cs.DS | in this paper we develop the first onepass streaming algorithm for submodular maximization that does not evaluate the entire stream even once by carefully subsampling each element of data stream our algorithm enjoys the tightest approximation guarantees in various settings while having the smallest memory footprint and requiring the lowest number of function evaluations more specifically for a monotone submodular function and a pmatchoid constraint our randomized algorithm achieves a 4p approximation ratio in expectation with ok memory and okmp queries per element k is the size of the largest feasible solution and m is the number of matroids used to define the constraint for the nonmonotone case our approximation ratio increases only slightly to 4p2o1 to the best or our knowledge our algorithm is the first that combines the benefits of streaming and subsampling in a novel way in order to truly scale submodular maximization to massive machine learning problems to showcase its practicality we empirically evaluated the performance of our algorithm on a video summarization application and observed that it outperforms the stateoftheart algorithm by up to fifty fold while maintaining practically the same utility | [['in', 'this', 'paper', 'we', 'develop', 'the', 'first', 'onepass', 'streaming', 'algorithm', 'for', 'submodular', 'maximization', 'that', 'does', 'not', 'evaluate', 'the', 'entire', 'stream', 'even', 'once', 'by', 'carefully', 'subsampling', 'each', 'element', 'of', 'data', 'stream', 'our', 'algorithm', 'enjoys', 'the', 'tightest', 'approximation', 'guarantees', 'in', 'various', 'settings', 'while', 'having', 'the', 'smallest', 'memory', 'footprint', 'and', 'requiring', 'the', 'lowest', 'number', 'of', 'function', 'evaluations', 'more', 'specifically', 'for', 'a', 'monotone', 'submodular', 'function', 'and', 'a', 'pmatchoid', 'constraint', 'our', 'randomized', 'algorithm', 'achieves', 'a', '4p', 'approximation', 'ratio', 'in', 'expectation', 'with', 'ok', 'memory', 'and', 'okmp', 'queries', 'per', 'element', 'k', 'is', 'the', 'size', 'of', 'the', 'largest', 'feasible', 'solution', 'and', 'm', 'is', 'the', 'number', 'of', 'matroids', 'used', 'to', 'define', 'the', 'constraint', 'for', 'the', 'nonmonotone', 'case', 'our', 'approximation', 'ratio', 'increases', 'only', 'slightly', 'to', '4p2o1', 'to', 'the', 'best', 'or', 'our', 'knowledge', 'our', 'algorithm', 'is', 'the', 'first', 'that', 'combines', 'the', 'benefits', 'of', 'streaming', 'and', 'subsampling', 'in', 'a', 'novel', 'way', 'in', 'order', 'to', 'truly', 'scale', 'submodular', 'maximization', 'to', 'massive', 'machine', 'learning', 'problems', 'to', 'showcase', 'its', 'practicality', 'we', 'empirically', 'evaluated', 'the', 'performance', 'of', 'our', 'algorithm', 'on', 'a', 'video', 'summarization', 'application', 'and', 'observed', 'that', 'it', 'outperforms', 'the', 'stateoftheart', 'algorithm', 'by', 'up', 'to', 'fifty', 'fold', 'while', 'maintaining', 'practically', 'the', 'same', 'utility']] | [-0.11151495398261357, -0.01895512165250005, -0.04077807530836278, 0.055715315712213116, -0.09947031560932865, -0.1297491662531487, 0.10999093028855182, 0.39975966799098095, -0.2701241206233012, -0.3535964603963736, 0.06521407992490945, -0.26856157588394913, -0.15265806603836954, 0.1849806631965613, -0.07202981480372113, 0.10131722189984725, 0.07862694287244734, 0.042411577779598336, -0.06457675359386092, -0.35779816347702936, 0.2544749869655002, 0.07311230950384728, 0.2940594484010158, 0.030968562709922726, 0.11996393056800338, 0.014955551554826465, 0.004387584247475339, 0.0359333598850188, -0.085080855447961, 0.12063005158325305, 0.255279477202409, 0.23958741277707993, 0.34861226331794987, -0.36543967976562075, -0.1488223336838387, 0.10989360210259219, 0.1626921237282757, 0.09160520263972717, -0.04716538312393429, -0.21040388458735637, 0.13162340449446158, -0.1390328717782993, -0.021948847849224063, -0.08904694945022866, -0.006056176999432815, 0.002716512484098407, -0.3479880164729784, 0.022787728197117513, 0.06543158192590282, -0.029323449106635275, -0.03711192961404654, -0.1541949508950819, 0.05644524236322959, 0.08365754441207124, 0.03668029378419994, 0.08970404782779264, 0.11223086922781894, -0.11882980926984109, -0.13907296335941333, 0.3968417607952614, -0.082838248942878, -0.19491758018581046, 0.15416907720217432, -0.08480312047853462, -0.1464623168508862, 0.15524972569121903, 0.2041637036615882, 0.1567043066075122, -0.1218259735485992, 0.09254323136992752, -0.08907368513126228, 0.1989462946459802, 0.056812151979554346, 0.018025571679243364, 0.07565170837270499, 0.20488659819789432, 0.1439430229265142, 0.1608010915334563, -0.06057002018331676, -0.09663769919928666, -0.23952385466042403, -0.13780911810117194, -0.23201466512715294, -0.03756594924323852, -0.15957180001549548, -0.1606127131126217, 0.38325132246355753, 0.2017502019483898, 0.17586534174561902, 0.18039381615691694, 0.3895332059080436, 0.07797210548651984, 0.08662252361017808, 0.172647151864461, 0.18700797022446183, 0.05050708080541242, 0.08560641063408725, -0.21371873444625855, 0.10748689033695169, 0.05240592739066562] |
1,802.07099 | CMOS-compatible controlled hyperdoping of silicon nanowires | Hyperdoping consists of the intentional introduction of deep-level dopants
into a semiconductor in excess of equilibrium concentrations. This causes a
broadening of dopant energy levels into an intermediate band between the
valence and conduction bands.[1,2] Recently, bulk Si hyperdoped with chalcogens
or transition metals has been demonstrated to be an appropriate
intermediate-band material for Si-based short-wavelength infrared
photodetectors.[3-5] Intermediate-band nanowires could potentially be used
instead of bulk materials to overcome the Shockley-Queisser limit and to
improve efficiency in solar cells,[6-9] but fundamental scientific questions in
hyperdoping Si nanowires require experimental verification. The development of
a method for obtaining controlled hyperdoping levels at the nanoscale
concomitant with the electrical activation of dopants is, therefore, vital to
understanding these issues. Here, we show a CMOS-compatible technique based on
non-equilibrium processing for the controlled doping of Si at the nanoscale
with dopant concentrations several orders of magnitude greater than the
equilibrium solid solubility. Through the nanoscale spatially controlled
implantation of dopants, and a bottom-up template-assisted solid phase
recrystallization of the nanowires with the use of millisecond-flash lamp
annealing, we form Se-hyperdoped Si/SiO2 core/shell nanowires that have a
room-temperature sub-band gap optoelectronic photoresponse when configured as a
photoconductor device.
| cond-mat.mtrl-sci | hyperdoping consists of the intentional introduction of deeplevel dopants into a semiconductor in excess of equilibrium concentrations this causes a broadening of dopant energy levels into an intermediate band between the valence and conduction bands12 recently bulk si hyperdoped with chalcogens or transition metals has been demonstrated to be an appropriate intermediateband material for sibased shortwavelength infrared photodetectors35 intermediateband nanowires could potentially be used instead of bulk materials to overcome the shockleyqueisser limit and to improve efficiency in solar cells69 but fundamental scientific questions in hyperdoping si nanowires require experimental verification the development of a method for obtaining controlled hyperdoping levels at the nanoscale concomitant with the electrical activation of dopants is therefore vital to understanding these issues here we show a cmoscompatible technique based on nonequilibrium processing for the controlled doping of si at the nanoscale with dopant concentrations several orders of magnitude greater than the equilibrium solid solubility through the nanoscale spatially controlled implantation of dopants and a bottomup templateassisted solid phase recrystallization of the nanowires with the use of millisecondflash lamp annealing we form sehyperdoped sisio2 coreshell nanowires that have a roomtemperature subband gap optoelectronic photoresponse when configured as a photoconductor device | [['hyperdoping', 'consists', 'of', 'the', 'intentional', 'introduction', 'of', 'deeplevel', 'dopants', 'into', 'a', 'semiconductor', 'in', 'excess', 'of', 'equilibrium', 'concentrations', 'this', 'causes', 'a', 'broadening', 'of', 'dopant', 'energy', 'levels', 'into', 'an', 'intermediate', 'band', 'between', 'the', 'valence', 'and', 'conduction', 'bands12', 'recently', 'bulk', 'si', 'hyperdoped', 'with', 'chalcogens', 'or', 'transition', 'metals', 'has', 'been', 'demonstrated', 'to', 'be', 'an', 'appropriate', 'intermediateband', 'material', 'for', 'sibased', 'shortwavelength', 'infrared', 'photodetectors35', 'intermediateband', 'nanowires', 'could', 'potentially', 'be', 'used', 'instead', 'of', 'bulk', 'materials', 'to', 'overcome', 'the', 'shockleyqueisser', 'limit', 'and', 'to', 'improve', 'efficiency', 'in', 'solar', 'cells69', 'but', 'fundamental', 'scientific', 'questions', 'in', 'hyperdoping', 'si', 'nanowires', 'require', 'experimental', 'verification', 'the', 'development', 'of', 'a', 'method', 'for', 'obtaining', 'controlled', 'hyperdoping', 'levels', 'at', 'the', 'nanoscale', 'concomitant', 'with', 'the', 'electrical', 'activation', 'of', 'dopants', 'is', 'therefore', 'vital', 'to', 'understanding', 'these', 'issues', 'here', 'we', 'show', 'a', 'cmoscompatible', 'technique', 'based', 'on', 'nonequilibrium', 'processing', 'for', 'the', 'controlled', 'doping', 'of', 'si', 'at', 'the', 'nanoscale', 'with', 'dopant', 'concentrations', 'several', 'orders', 'of', 'magnitude', 'greater', 'than', 'the', 'equilibrium', 'solid', 'solubility', 'through', 'the', 'nanoscale', 'spatially', 'controlled', 'implantation', 'of', 'dopants', 'and', 'a', 'bottomup', 'templateassisted', 'solid', 'phase', 'recrystallization', 'of', 'the', 'nanowires', 'with', 'the', 'use', 'of', 'millisecondflash', 'lamp', 'annealing', 'we', 'form', 'sehyperdoped', 'sisio2', 'coreshell', 'nanowires', 'that', 'have', 'a', 'roomtemperature', 'subband', 'gap', 'optoelectronic', 'photoresponse', 'when', 'configured', 'as', 'a', 'photoconductor', 'device']] | [-0.06259963523562392, 0.18191355682683363, -0.012271929643219288, -0.0443440541924899, 0.017914077900325714, -0.18353978075642938, 0.11165275885382209, 0.45303447204715136, -0.2409683275353456, -0.3353400567427024, 0.012038417591430558, -0.291582970453319, -0.09265268633400543, 0.19261686656568006, -0.025306197000345636, 0.03711575830382105, 0.0004079557975988191, -0.1312021297982928, -0.07734158508484472, -0.1818886523784738, 0.22202162849058577, 0.08716170048659316, 0.3437883966524368, 0.12982568592662042, 0.05232821175760312, -0.048238252434655245, 0.10864779333150043, 0.017962352016755424, -0.12284128142959476, 0.11573772508887506, 0.3012412179710041, -0.06838463931051887, 0.2607178512289608, -0.5200441657609418, -0.25276181456774316, -0.001964568910964567, 0.149911843793691, 0.12979540274861265, -0.11836492761065062, -0.24576923973292736, 0.0845926587082231, -0.09776152143466983, -0.09636490887484431, -0.03169035467840926, -0.022551319203510178, -0.0015984749219121889, -0.22864600762003223, 0.02794751615131869, 0.06144288793225719, 0.09344474787772658, -0.09356172527725984, -0.1503938112885774, -0.08415315465523779, 0.06378369122888058, -0.0359783013404898, -0.029122833144261027, 0.26126227974867283, -0.10372274367172876, -0.10876343750360748, 0.3576382092195344, -0.029141575864565568, -0.06417772898947849, 0.16789561513377382, -0.13312242506437627, -0.05453898910925534, 0.1750484324274926, 0.1171633039859577, 0.10496871326794038, -0.17269618946155935, 0.057360103746683516, 0.09051859718674296, 0.21129260044081713, 0.10427425121059593, 0.1276596357231638, 0.2679130623594941, 0.27213315707533886, 0.051733204240408476, 0.11136950811198108, -0.12226500860061887, 0.018834246207925818, -0.1742708019495342, -0.24745275001212252, -0.2046954689412719, 0.10058441866159985, -0.0833187644143317, -0.22013593012350002, 0.37976720246866696, 0.1505176113401564, 0.12416442796461168, -0.0732926376241976, 0.2394862154435308, 0.09344803652279957, 0.10545264067297742, -0.02625046266457407, 0.2504631898985171, 0.15492406324605354, 0.1414563194287853, -0.2594015417518143, 0.09408579801735882, -0.018172961035597075] |
1,802.071 | Superradiant Hybrid Quantum Devices | Superradiance is the archetypical collective phenomenon where radiation is
amplified by the coherence of emitters. It plays a prominent role in optics,
where it enables the design of lasers with substantially reduced linewidths,
quantum mechanics, and is even used to explain cosmological observations like
Hawking radiation from black holes. Hybridization of distinct quantum systems
allows to engineer new quantum metamaterials pooling the advantages of the
individual systems. Superconducting circuits coupled to spin ensembles are
promising future building blocks of integrated quantum devices and
superradiance will play a prominent role. As such it is important to study its
fundamental properties in hybrid devices. Experiments in the strong coupling
regime have shown oscillatory behaviour in these systems but a clear signature
of Dicke superradiance has been missing so far. Here we explore superradiance
in a hybrid system composed of a superconducting resonator in the fast cavity
limit inductively coupled to an inhomogeneously broadened ensemble of
nitrogen-vacancy (NV) centres. We observe a superradiant pulse being emitted a
trillion of times faster than the decay for an individual NV centre. This is
further confirmed by the non-linear scaling of the emitted radiation intensity
with respect to the ensemble size. Our work provides the foundation for future
quantum technologies including solid state superradiant masers.
| quant-ph cond-mat.mes-hall physics.atom-ph | superradiance is the archetypical collective phenomenon where radiation is amplified by the coherence of emitters it plays a prominent role in optics where it enables the design of lasers with substantially reduced linewidths quantum mechanics and is even used to explain cosmological observations like hawking radiation from black holes hybridization of distinct quantum systems allows to engineer new quantum metamaterials pooling the advantages of the individual systems superconducting circuits coupled to spin ensembles are promising future building blocks of integrated quantum devices and superradiance will play a prominent role as such it is important to study its fundamental properties in hybrid devices experiments in the strong coupling regime have shown oscillatory behaviour in these systems but a clear signature of dicke superradiance has been missing so far here we explore superradiance in a hybrid system composed of a superconducting resonator in the fast cavity limit inductively coupled to an inhomogeneously broadened ensemble of nitrogenvacancy nv centres we observe a superradiant pulse being emitted a trillion of times faster than the decay for an individual nv centre this is further confirmed by the nonlinear scaling of the emitted radiation intensity with respect to the ensemble size our work provides the foundation for future quantum technologies including solid state superradiant masers | [['superradiance', 'is', 'the', 'archetypical', 'collective', 'phenomenon', 'where', 'radiation', 'is', 'amplified', 'by', 'the', 'coherence', 'of', 'emitters', 'it', 'plays', 'a', 'prominent', 'role', 'in', 'optics', 'where', 'it', 'enables', 'the', 'design', 'of', 'lasers', 'with', 'substantially', 'reduced', 'linewidths', 'quantum', 'mechanics', 'and', 'is', 'even', 'used', 'to', 'explain', 'cosmological', 'observations', 'like', 'hawking', 'radiation', 'from', 'black', 'holes', 'hybridization', 'of', 'distinct', 'quantum', 'systems', 'allows', 'to', 'engineer', 'new', 'quantum', 'metamaterials', 'pooling', 'the', 'advantages', 'of', 'the', 'individual', 'systems', 'superconducting', 'circuits', 'coupled', 'to', 'spin', 'ensembles', 'are', 'promising', 'future', 'building', 'blocks', 'of', 'integrated', 'quantum', 'devices', 'and', 'superradiance', 'will', 'play', 'a', 'prominent', 'role', 'as', 'such', 'it', 'is', 'important', 'to', 'study', 'its', 'fundamental', 'properties', 'in', 'hybrid', 'devices', 'experiments', 'in', 'the', 'strong', 'coupling', 'regime', 'have', 'shown', 'oscillatory', 'behaviour', 'in', 'these', 'systems', 'but', 'a', 'clear', 'signature', 'of', 'dicke', 'superradiance', 'has', 'been', 'missing', 'so', 'far', 'here', 'we', 'explore', 'superradiance', 'in', 'a', 'hybrid', 'system', 'composed', 'of', 'a', 'superconducting', 'resonator', 'in', 'the', 'fast', 'cavity', 'limit', 'inductively', 'coupled', 'to', 'an', 'inhomogeneously', 'broadened', 'ensemble', 'of', 'nitrogenvacancy', 'nv', 'centres', 'we', 'observe', 'a', 'superradiant', 'pulse', 'being', 'emitted', 'a', 'trillion', 'of', 'times', 'faster', 'than', 'the', 'decay', 'for', 'an', 'individual', 'nv', 'centre', 'this', 'is', 'further', 'confirmed', 'by', 'the', 'nonlinear', 'scaling', 'of', 'the', 'emitted', 'radiation', 'intensity', 'with', 'respect', 'to', 'the', 'ensemble', 'size', 'our', 'work', 'provides', 'the', 'foundation', 'for', 'future', 'quantum', 'technologies', 'including', 'solid', 'state', 'superradiant', 'masers']] | [-0.13677723188695173, 0.194145013361141, -0.04303622087987327, 0.03542963325789056, -0.02283596851011854, -0.1859078362882672, -0.007163219717576315, 0.41130044504679275, -0.21077751041527584, -0.2576088019589332, 0.021068895301385004, -0.3187321982877446, -0.11979569018201269, 0.2385669077287593, 0.003142435718038115, 0.06982608337337419, 0.02369383920616867, -0.00791078024102669, -0.006189378508718675, -0.15274862477580378, 0.28230771499810714, 0.11582121772969556, 0.33666249488827965, -0.0008914798908113863, 0.08083233761302593, -0.035666600198364644, 0.06603638678048314, -0.01865993750629207, -0.0773561615299135, 0.10074773512370706, 0.2857010612597368, 0.07987759155878557, 0.2860051584274076, -0.44109622623468414, -0.2361987621175865, 0.09612923714835821, 0.2205353880247645, 0.18586070800637916, -0.08178794615412951, -0.29228143543383756, 0.012748513376322445, -0.1639154639193102, -0.15485207912048132, -0.04770011077835514, 0.02708095340637499, -0.02473388820035499, -0.2047063638567568, 0.0396638310338375, 0.08107183508811135, 0.020815321992922343, 0.0070836594887801925, -0.03912395597758601, 0.0399343939754292, 0.08488405765029802, -0.03739179072914975, -0.009441990696637932, 0.2231061613548137, -0.12750264899704927, -0.15191304118876037, 0.3745227507917148, -0.04346067610601438, -0.09040086242529334, 0.18854931451638707, -0.1597888117531341, -0.09436462215776222, 0.13506881711541108, 0.1518565578014104, 0.1150216961705068, -0.1260440023348591, 0.0328125219461263, 0.020579038439073452, 0.21405866878991725, 0.0538010675299681, 0.17538116001200965, 0.3064016768459284, 0.20747495429706203, 0.032224463288890615, 0.19331074558626238, -0.06909429380429562, -0.12180392526905609, -0.23375007343527518, -0.17504731189174372, -0.18351683685885806, 0.11959137979008672, -0.05428963255359453, -0.14871955384056387, 0.3653531814346081, 0.1731424371321445, 0.13381648475179475, -0.06466268648674185, 0.2620554572341466, 0.12685271035256, 0.10138735546993367, 0.02184884224541521, 0.31731492520697663, 0.18803644285684354, 0.10884578389273823, -0.30301913519225054, -0.009965607240288095, -0.032261615010807244] |
1,802.07101 | Stroke Controllable Fast Style Transfer with Adaptive Receptive Fields | The Fast Style Transfer methods have been recently proposed to transfer a
photograph to an artistic style in real-time. This task involves controlling
the stroke size in the stylized results, which remains an open challenge. In
this paper, we present a stroke controllable style transfer network that can
achieve continuous and spatial stroke size control. By analyzing the factors
that influence the stroke size, we propose to explicitly account for the
receptive field and the style image scales. We propose a StrokePyramid module
to endow the network with adaptive receptive fields, and two training
strategies to achieve faster convergence and augment new stroke sizes upon a
trained model respectively. By combining the proposed runtime control
strategies, our network can achieve continuous changes in stroke sizes and
produce distinct stroke sizes in different spatial regions within the same
output image.
| cs.CV eess.IV | the fast style transfer methods have been recently proposed to transfer a photograph to an artistic style in realtime this task involves controlling the stroke size in the stylized results which remains an open challenge in this paper we present a stroke controllable style transfer network that can achieve continuous and spatial stroke size control by analyzing the factors that influence the stroke size we propose to explicitly account for the receptive field and the style image scales we propose a strokepyramid module to endow the network with adaptive receptive fields and two training strategies to achieve faster convergence and augment new stroke sizes upon a trained model respectively by combining the proposed runtime control strategies our network can achieve continuous changes in stroke sizes and produce distinct stroke sizes in different spatial regions within the same output image | [['the', 'fast', 'style', 'transfer', 'methods', 'have', 'been', 'recently', 'proposed', 'to', 'transfer', 'a', 'photograph', 'to', 'an', 'artistic', 'style', 'in', 'realtime', 'this', 'task', 'involves', 'controlling', 'the', 'stroke', 'size', 'in', 'the', 'stylized', 'results', 'which', 'remains', 'an', 'open', 'challenge', 'in', 'this', 'paper', 'we', 'present', 'a', 'stroke', 'controllable', 'style', 'transfer', 'network', 'that', 'can', 'achieve', 'continuous', 'and', 'spatial', 'stroke', 'size', 'control', 'by', 'analyzing', 'the', 'factors', 'that', 'influence', 'the', 'stroke', 'size', 'we', 'propose', 'to', 'explicitly', 'account', 'for', 'the', 'receptive', 'field', 'and', 'the', 'style', 'image', 'scales', 'we', 'propose', 'a', 'strokepyramid', 'module', 'to', 'endow', 'the', 'network', 'with', 'adaptive', 'receptive', 'fields', 'and', 'two', 'training', 'strategies', 'to', 'achieve', 'faster', 'convergence', 'and', 'augment', 'new', 'stroke', 'sizes', 'upon', 'a', 'trained', 'model', 'respectively', 'by', 'combining', 'the', 'proposed', 'runtime', 'control', 'strategies', 'our', 'network', 'can', 'achieve', 'continuous', 'changes', 'in', 'stroke', 'sizes', 'and', 'produce', 'distinct', 'stroke', 'sizes', 'in', 'different', 'spatial', 'regions', 'within', 'the', 'same', 'output', 'image']] | [-0.03194092800402069, 0.06946001400807501, -0.06693655244695644, 0.048036177043695054, -0.07276412106011117, -0.15615848283472378, 0.009838756265800339, 0.4669898169898037, -0.28803673323135875, -0.33421928856683814, 0.06600394566877461, -0.17140508632756013, -0.16210707613145528, 0.17983414364162076, -0.20334315757381904, 0.05703004823484714, 0.06736283212481742, 0.00040260137504209644, -0.03598309957516798, -0.2619575579951018, 0.2752371089738807, 0.039305874639177237, 0.35372971386338276, 0.01231267681831251, 0.1784747008578447, -0.0378647751598349, -0.009438544312707972, 0.010517338895664105, -0.07930391191969291, 0.1683538964147822, 0.2891746602439578, 0.1720784443423854, 0.34600776718065573, -0.4623809060810701, -0.21288609495588942, 0.06977893600739754, 0.1461391998724877, 0.13176439596134223, -0.04563491718938061, -0.275770159585037, 0.0910544186135403, -0.15100428478900288, -0.027266978292955435, -0.12875018061638094, 0.01627252526341708, -0.009871519379911648, -0.3342549977486656, 0.022100196918472648, 0.0754093371400866, 0.0802492458825472, -0.04472304327393194, -0.07224530212081753, 0.031651271279374865, 0.23899916293558435, 0.02810226778914828, 0.050091393838596086, 0.17676210130288172, -0.19600049242633732, -0.14723990715245475, 0.3066179103292255, -0.025634450915579993, -0.21203574439699668, 0.17613038634611428, -0.07209663937691653, -0.08504205967799044, 0.13301824611456445, 0.25020699759783305, 0.08617945938654568, -0.14223259228511134, -0.024165051923879168, -0.021436513010142506, 0.2289170623728263, 0.0883781228069405, -0.025863642175850608, 0.15662331400402024, 0.22246564218801432, 0.03974179365078284, 0.18752907019992615, -0.13493729120882167, -0.06427891250021513, -0.20869681880930843, -0.09595710045550072, -0.15442822604993547, -0.04212494597405843, -0.11259273111942963, -0.11627422492998396, 0.4602940001565477, 0.2118758534796644, 0.20825344992234654, 0.12405187937353428, 0.34257845224245737, 0.03931535809871106, 0.14254739028705365, 0.08594796322142718, 0.17127227604362197, -0.010492383323582833, 0.15573435221407292, -0.24238818795572076, 0.10623427116703513, 0.06773605450744861] |
1,802.07102 | General statistics of particles without spin | The possibility of obtaining exotic statistics, different from Bose-Einstein
or Fermi-Dirac, is analyzed, in the context of quantum field theory, through
the inclusion of a counting operator in the definition of the partition
function. This operator represents the statistical weight of the allowed number
states. In particular, the statistics of ewkons (introduced in Phys. Rev. E 94,
062115, 2016) is analyzed. They have a negative relation between pressure and
energy density, a feature shared by dark energy. The present approach develops
the possibility of describing dark energy with a field of non-interacting
particles with ewkon's statistics.
| cond-mat.stat-mech quant-ph | the possibility of obtaining exotic statistics different from boseeinstein or fermidirac is analyzed in the context of quantum field theory through the inclusion of a counting operator in the definition of the partition function this operator represents the statistical weight of the allowed number states in particular the statistics of ewkons introduced in phys rev e 94 062115 2016 is analyzed they have a negative relation between pressure and energy density a feature shared by dark energy the present approach develops the possibility of describing dark energy with a field of noninteracting particles with ewkons statistics | [['the', 'possibility', 'of', 'obtaining', 'exotic', 'statistics', 'different', 'from', 'boseeinstein', 'or', 'fermidirac', 'is', 'analyzed', 'in', 'the', 'context', 'of', 'quantum', 'field', 'theory', 'through', 'the', 'inclusion', 'of', 'a', 'counting', 'operator', 'in', 'the', 'definition', 'of', 'the', 'partition', 'function', 'this', 'operator', 'represents', 'the', 'statistical', 'weight', 'of', 'the', 'allowed', 'number', 'states', 'in', 'particular', 'the', 'statistics', 'of', 'ewkons', 'introduced', 'in', 'phys', 'rev', 'e', '94', '062115', '2016', 'is', 'analyzed', 'they', 'have', 'a', 'negative', 'relation', 'between', 'pressure', 'and', 'energy', 'density', 'a', 'feature', 'shared', 'by', 'dark', 'energy', 'the', 'present', 'approach', 'develops', 'the', 'possibility', 'of', 'describing', 'dark', 'energy', 'with', 'a', 'field', 'of', 'noninteracting', 'particles', 'with', 'ewkons', 'statistics']] | [-0.128180146193093, 0.18191590019705473, -0.11875312067665315, 0.04017974169619265, -0.013247567714036753, -0.08226109968381934, 0.05315604497324481, 0.26719813932625885, -0.2027333707859119, -0.3609288748120889, -0.05162256895499695, -0.27847663266584277, -0.09665961890762749, 0.13848951109927535, -0.013777521807545176, 0.05277038935067443, 0.0023013590446983776, 0.05704426774658108, -0.03995395982080178, -0.21202367823570967, 0.3109136901621241, 0.08649006304888947, 0.30274794235204655, 0.05161179939265518, 0.08262970783835044, 0.05751383851505428, -0.05351735410416344, 0.013397603777169328, -0.15912206355187664, 0.09745751356422261, 0.21065707815190157, 0.09361346031073481, 0.28769474684183177, -0.38512757886201143, -0.2124794061431506, 0.1469797621878873, 0.07864566065351634, 0.0855179398264833, -0.04382583799209291, -0.3007220695532548, 0.014697706038229322, -0.21117519461161768, -0.14196399109399258, -0.06139292121224571, 0.04434527559108877, 0.02706242165004369, -0.2394989647048836, 0.1682297250275345, 0.03425643441732973, 0.03936783373592334, -0.042725647435872816, -0.08388215980085079, -0.025909725363211084, 0.016801804272593774, 0.009283220499734549, 0.011734410965194305, 0.10641316666927499, -0.18307166883945078, -0.10067936244013254, 0.3388775624237799, -0.06243762077065185, -0.18516004192254817, 0.16361296923908716, -0.13967087017469262, -0.09423239982667535, 0.10453581098893967, 0.12488772739986113, 0.08855274028610438, -0.1510972295460912, 0.15956351519404657, -0.06406676205460826, 0.12639817079616478, 0.07403180589123319, 0.04806978805572726, 0.2529831012361683, 0.12866159451611262, -0.005835204373094409, 0.15080045767050856, -0.09912787414699172, -0.1283783631224651, -0.3242475342267426, -0.1919772354643404, -0.21864563521618643, 0.05282634989513705, -0.012832473138738957, -0.1587798364829117, 0.4275753012043424, 0.12771897114968547, 0.22828884369179528, -0.006215997331310064, 0.23342704917740775, 0.16183827230512784, 0.009294567178585567, 0.08350204205150173, 0.22873565767561863, 0.18069315094908234, 0.10937578141601989, -0.21068813376526427, -0.03184596052445462, 0.06811187961769367] |
1,802.07103 | Temporal Vertex Cover with a Sliding Time Window | Modern, inherently dynamic systems are usually characterized by a network
structure, i.e. an underlying graph topology, which is subject to discrete
changes over time. Given a static underlying graph $G$, a temporal graph can be
represented via an assignment of a set of integer time-labels to every edge of
$G$, indicating the discrete time steps when this edge is active. While most of
the recent theoretical research on temporal graphs has focused on the notion of
a temporal path and other "path-related" temporal notions, only few attempts
have been made to investigate "non-path" temporal graph problems. In this
paper, motivated by applications in sensor and in transportation networks, we
introduce and study two natural temporal extensions of the classical problem
Vertex Cover. In both cases we wish to minimize the total number of "vertex
appearances" that are needed to "cover" the whole temporal graph. In our first
problem, Temporal Vertex Cover, the aim is to cover every edge at least once
during the lifetime of the temporal graph, where an edge can be covered by one
of its endpoints, only at a time step when it is active. In our second, more
pragmatic variation Sliding Window Temporal Vertex Cover, we are also given a
natural number $\Delta$, and our aim is to cover every edge at least once at
every $\Delta$ consecutive time steps. We present a thorough investigation of
the computational complexity and approximability of these two temporal covering
problems. In particular, we provide strong hardness results, complemented by
various approximation and exact algorithms. Some of our algorithms are
polynomial-time, while others are asymptotically almost optimal under the
Exponential Time Hypothesis (ETH) and other plausible complexity assumptions.
| cs.CC | modern inherently dynamic systems are usually characterized by a network structure ie an underlying graph topology which is subject to discrete changes over time given a static underlying graph g a temporal graph can be represented via an assignment of a set of integer timelabels to every edge of g indicating the discrete time steps when this edge is active while most of the recent theoretical research on temporal graphs has focused on the notion of a temporal path and other pathrelated temporal notions only few attempts have been made to investigate nonpath temporal graph problems in this paper motivated by applications in sensor and in transportation networks we introduce and study two natural temporal extensions of the classical problem vertex cover in both cases we wish to minimize the total number of vertex appearances that are needed to cover the whole temporal graph in our first problem temporal vertex cover the aim is to cover every edge at least once during the lifetime of the temporal graph where an edge can be covered by one of its endpoints only at a time step when it is active in our second more pragmatic variation sliding window temporal vertex cover we are also given a natural number delta and our aim is to cover every edge at least once at every delta consecutive time steps we present a thorough investigation of the computational complexity and approximability of these two temporal covering problems in particular we provide strong hardness results complemented by various approximation and exact algorithms some of our algorithms are polynomialtime while others are asymptotically almost optimal under the exponential time hypothesis eth and other plausible complexity assumptions | [['modern', 'inherently', 'dynamic', 'systems', 'are', 'usually', 'characterized', 'by', 'a', 'network', 'structure', 'ie', 'an', 'underlying', 'graph', 'topology', 'which', 'is', 'subject', 'to', 'discrete', 'changes', 'over', 'time', 'given', 'a', 'static', 'underlying', 'graph', 'g', 'a', 'temporal', 'graph', 'can', 'be', 'represented', 'via', 'an', 'assignment', 'of', 'a', 'set', 'of', 'integer', 'timelabels', 'to', 'every', 'edge', 'of', 'g', 'indicating', 'the', 'discrete', 'time', 'steps', 'when', 'this', 'edge', 'is', 'active', 'while', 'most', 'of', 'the', 'recent', 'theoretical', 'research', 'on', 'temporal', 'graphs', 'has', 'focused', 'on', 'the', 'notion', 'of', 'a', 'temporal', 'path', 'and', 'other', 'pathrelated', 'temporal', 'notions', 'only', 'few', 'attempts', 'have', 'been', 'made', 'to', 'investigate', 'nonpath', 'temporal', 'graph', 'problems', 'in', 'this', 'paper', 'motivated', 'by', 'applications', 'in', 'sensor', 'and', 'in', 'transportation', 'networks', 'we', 'introduce', 'and', 'study', 'two', 'natural', 'temporal', 'extensions', 'of', 'the', 'classical', 'problem', 'vertex', 'cover', 'in', 'both', 'cases', 'we', 'wish', 'to', 'minimize', 'the', 'total', 'number', 'of', 'vertex', 'appearances', 'that', 'are', 'needed', 'to', 'cover', 'the', 'whole', 'temporal', 'graph', 'in', 'our', 'first', 'problem', 'temporal', 'vertex', 'cover', 'the', 'aim', 'is', 'to', 'cover', 'every', 'edge', 'at', 'least', 'once', 'during', 'the', 'lifetime', 'of', 'the', 'temporal', 'graph', 'where', 'an', 'edge', 'can', 'be', 'covered', 'by', 'one', 'of', 'its', 'endpoints', 'only', 'at', 'a', 'time', 'step', 'when', 'it', 'is', 'active', 'in', 'our', 'second', 'more', 'pragmatic', 'variation', 'sliding', 'window', 'temporal', 'vertex', 'cover', 'we', 'are', 'also', 'given', 'a', 'natural', 'number', 'delta', 'and', 'our', 'aim', 'is', 'to', 'cover', 'every', 'edge', 'at', 'least', 'once', 'at', 'every', 'delta', 'consecutive', 'time', 'steps', 'we', 'present', 'a', 'thorough', 'investigation', 'of', 'the', 'computational', 'complexity', 'and', 'approximability', 'of', 'these', 'two', 'temporal', 'covering', 'problems', 'in', 'particular', 'we', 'provide', 'strong', 'hardness', 'results', 'complemented', 'by', 'various', 'approximation', 'and', 'exact', 'algorithms', 'some', 'of', 'our', 'algorithms', 'are', 'polynomialtime', 'while', 'others', 'are', 'asymptotically', 'almost', 'optimal', 'under', 'the', 'exponential', 'time', 'hypothesis', 'eth', 'and', 'other', 'plausible', 'complexity', 'assumptions']] | [-0.13492128134838413, 0.0957654240028996, -0.07035470546469551, 0.04446050085075051, -0.09707111464070993, -0.13660068444711954, 0.05386863456173476, 0.43764027450706106, -0.3082539539930134, -0.32559919214901933, 0.1258431169705506, -0.26253120147663617, -0.1495041544017706, 0.14256450808539556, -0.09794185042889128, 0.08149073958127806, 0.08609661384632447, 0.08712198570688286, -0.00579260642879872, -0.2696015413593673, 0.2863735599996711, 0.009886428651372915, 0.2120551928967251, 0.06999692006903005, 0.0859104772244936, 0.029008769098689536, -0.059938392136245966, 0.09273878979902819, -0.1128706477197409, 0.09123406587639403, 0.27837303089504334, 0.15807935765242556, 0.3380796378065049, -0.4574107566162559, -0.2243587463905198, 0.13862605690129398, 0.10228442269853195, 0.06281297050198824, 0.017478607641944265, -0.22382162930443883, 0.12534691271308027, -0.09435766604155356, -0.05810198340812982, -0.006848900105873379, 0.06586641373249459, 0.0024548676299383405, -0.23868386769280062, -0.0004617172501942453, 0.06788918885159427, 0.04084346632209971, 0.004023180686129743, -0.09419203653216254, 0.0006591189476371189, 0.14816963382548673, -0.0007414985878352562, 0.04294988583221667, 0.05226912076561374, -0.12005881689137955, -0.16288101417012513, 0.3677894336920556, -0.00035064850353460383, -0.16234760288068134, 0.17924944345630112, -0.12130124113468481, -0.19402146962154115, 0.1327378163527549, 0.16136008861096765, 0.1376946268327352, -0.13089375339557696, 0.09382791302788604, -0.06612153952279924, 0.17041989654788506, 0.0840846089615851, 0.05549236052742133, 0.17339035352275803, 0.20431763689165286, 0.14639595373528605, 0.1491315671537186, -0.043447550554908274, -0.07563529643601319, -0.2990565515811677, -0.08461434166056805, -0.19313684671415368, 0.0030153720916765133, -0.11403322483433379, -0.14942759612197246, 0.4564271291095318, 0.13498972130300768, 0.21229346606718458, 0.08983295342899299, 0.2833316163767291, 0.09955659471887739, 0.04264749214812384, 0.12589548542501175, 0.14883786349178146, 0.08778139688260178, 0.06481972655097522, -0.18762743263515944, 0.08743694013843407, 0.07814766925024004] |
1,802.07104 | Spectroscopic Measurements of the Ion Velocity Distribution at the Base
of the Fast Solar Wind | In situ measurements of the fast solar wind reveal non-thermal distributions
of electrons, protons and, minor ions extending from $0.3$ AU to the
heliopause. The physical mechanisms responsible for these non-thermal
properties and the location where these properties originate remain open
questions. Here we present spectroscopic evidence, from extreme ultraviolet
spectroscopy, that the velocity distribution functions (VDFs) of minor ions are
already non-Gaussian at the base of the fast solar wind in a coronal hole, at
altitudes of $< 1.1 R_{\odot}$. Analysis of Fe, Si, and Mg spectral lines
reveal a peaked line-shape core and broad wings that can be characteristed by a
kappa VDF. A kappa distribution fit gives very small kappa indices off-limb of
$\kappa\approx1.9-2.5$, indicating either (a) ion populations far from thermal
equilibrium, (b) fluid motions such as non-Gaussian turbulent fluctuations or
non-uniform wave motions, or (c) some combination of both. These observations
provide important empirical constraints for the source region of the fast solar
wind and for the theoretical models of the different acceleration, heating, and
energy deposition processes therein. To the best of our knowledge, this is the
first time that the ion VDF in the fast solar wind has been probed so close to
its source region. The findings are also a timely precursor to the upcoming
2018 launch of the Parker Solar Probe, which will provide the closest in situ
measurements of the solar wind at approximately $0.04$ AU ($8.5$ solar radii).
| astro-ph.SR | in situ measurements of the fast solar wind reveal nonthermal distributions of electrons protons and minor ions extending from 03 au to the heliopause the physical mechanisms responsible for these nonthermal properties and the location where these properties originate remain open questions here we present spectroscopic evidence from extreme ultraviolet spectroscopy that the velocity distribution functions vdfs of minor ions are already nongaussian at the base of the fast solar wind in a coronal hole at altitudes of 11 r_odot analysis of fe si and mg spectral lines reveal a peaked lineshape core and broad wings that can be characteristed by a kappa vdf a kappa distribution fit gives very small kappa indices offlimb of kappaapprox1925 indicating either a ion populations far from thermal equilibrium b fluid motions such as nongaussian turbulent fluctuations or nonuniform wave motions or c some combination of both these observations provide important empirical constraints for the source region of the fast solar wind and for the theoretical models of the different acceleration heating and energy deposition processes therein to the best of our knowledge this is the first time that the ion vdf in the fast solar wind has been probed so close to its source region the findings are also a timely precursor to the upcoming 2018 launch of the parker solar probe which will provide the closest in situ measurements of the solar wind at approximately 004 au 85 solar radii | [['in', 'situ', 'measurements', 'of', 'the', 'fast', 'solar', 'wind', 'reveal', 'nonthermal', 'distributions', 'of', 'electrons', 'protons', 'and', 'minor', 'ions', 'extending', 'from', '03', 'au', 'to', 'the', 'heliopause', 'the', 'physical', 'mechanisms', 'responsible', 'for', 'these', 'nonthermal', 'properties', 'and', 'the', 'location', 'where', 'these', 'properties', 'originate', 'remain', 'open', 'questions', 'here', 'we', 'present', 'spectroscopic', 'evidence', 'from', 'extreme', 'ultraviolet', 'spectroscopy', 'that', 'the', 'velocity', 'distribution', 'functions', 'vdfs', 'of', 'minor', 'ions', 'are', 'already', 'nongaussian', 'at', 'the', 'base', 'of', 'the', 'fast', 'solar', 'wind', 'in', 'a', 'coronal', 'hole', 'at', 'altitudes', 'of', '11', 'r_odot', 'analysis', 'of', 'fe', 'si', 'and', 'mg', 'spectral', 'lines', 'reveal', 'a', 'peaked', 'lineshape', 'core', 'and', 'broad', 'wings', 'that', 'can', 'be', 'characteristed', 'by', 'a', 'kappa', 'vdf', 'a', 'kappa', 'distribution', 'fit', 'gives', 'very', 'small', 'kappa', 'indices', 'offlimb', 'of', 'kappaapprox1925', 'indicating', 'either', 'a', 'ion', 'populations', 'far', 'from', 'thermal', 'equilibrium', 'b', 'fluid', 'motions', 'such', 'as', 'nongaussian', 'turbulent', 'fluctuations', 'or', 'nonuniform', 'wave', 'motions', 'or', 'c', 'some', 'combination', 'of', 'both', 'these', 'observations', 'provide', 'important', 'empirical', 'constraints', 'for', 'the', 'source', 'region', 'of', 'the', 'fast', 'solar', 'wind', 'and', 'for', 'the', 'theoretical', 'models', 'of', 'the', 'different', 'acceleration', 'heating', 'and', 'energy', 'deposition', 'processes', 'therein', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'that', 'the', 'ion', 'vdf', 'in', 'the', 'fast', 'solar', 'wind', 'has', 'been', 'probed', 'so', 'close', 'to', 'its', 'source', 'region', 'the', 'findings', 'are', 'also', 'a', 'timely', 'precursor', 'to', 'the', 'upcoming', '2018', 'launch', 'of', 'the', 'parker', 'solar', 'probe', 'which', 'will', 'provide', 'the', 'closest', 'in', 'situ', 'measurements', 'of', 'the', 'solar', 'wind', 'at', 'approximately', '004', 'au', '85', 'solar', 'radii']] | [-0.07827820671649287, 0.19431465183447857, -0.047358981160529875, 0.08440599502574837, -0.040994126176051165, -0.10045696798242408, 0.03868887725560452, 0.39032185424150806, -0.23892453005359807, -0.35098560607076573, 0.050765724241007434, -0.2919956640482454, -0.01660671168977742, 0.2214379289275789, 0.00967660711824665, 0.012252051821047582, 0.08264149604286304, -0.0685117005158938, -0.02559263479226995, -0.13689878760654256, 0.2436213101777327, 0.15040531487034445, 0.1802092420708751, 0.04943109606984624, 0.0462629721604556, -0.11891176785077008, -0.019167892755230224, 0.0006285382274901336, -0.1397702538726693, 0.06928401905858309, 0.20966246508829747, 0.11815335149456864, 0.23422659437741367, -0.41938392678670333, -0.2635997759602013, -0.0036442459332046368, 0.17519450457707458, 0.027439594816345468, -0.06426652091736826, -0.23442222119182726, 0.03060332895059265, -0.13825450380238058, -0.1863539966861165, 0.026373547222415947, 0.04002378003324492, 0.06991287815938033, -0.2780967873128494, 0.11497858609973109, 0.045443911383607254, 0.09532215340473389, -0.12115650053453726, -0.11586455293236521, -0.07328475283762692, 0.08596828703914564, 0.061723241196763784, 0.03724766599401137, 0.21582025660288726, -0.07557526134029505, -0.03701775996369641, 0.38705497237822134, -0.06313325007252743, -0.03993132292052289, 0.2190006331874105, -0.25428921988794295, -0.13920416598310853, 0.1841075697507299, 0.16042144196522343, 0.10581762716050805, -0.1538298828902228, 0.020149706489449935, -0.034511499978950685, 0.16145422930797287, 0.06330545058758077, 0.04799879307097014, 0.30842731894049163, 0.10323061960082407, 0.03360750506853022, 0.05508280775233042, -0.21917535191386053, -0.026054180909926863, -0.26678690838161856, -0.12537588517307857, -0.12822576178833683, 0.05771485544015778, -0.12623798062591282, -0.15388131383964318, 0.3771933471148644, 0.16382785923127874, 0.205860922666527, -0.045137008611148347, 0.30336830936474884, 0.08015441105570802, 0.026294121478035084, 0.14427427571243212, 0.3166415049736161, 0.1577870368797695, 0.16486105523506275, -0.2207041666576623, 0.09705407938217524, -0.0022834119055483303] |
1,802.07105 | Bias Compensation in Iterative Soft-Feedback Algorithms with Application
to (Discrete) Compressed Sensing | In all applications in digital communications, it is crucial for an estimator
to be unbiased. Although so-called soft feedback is widely employed in many
different fields of engineering, typically the biased estimate is used. In this
paper, we contrast the fundamental unbiasing principles, which can be directly
applied whenever soft feedback is required. To this end, the problem is treated
from a signal-based perspective, as well as from the approach of estimating the
signal based on an estimate of the noise. Numerical results show that when
employed in iterative reconstruction algorithms for Compressed Sensing, a gain
of 1.2 dB due to proper unbiasing is possible.
| cs.IT math.IT | in all applications in digital communications it is crucial for an estimator to be unbiased although socalled soft feedback is widely employed in many different fields of engineering typically the biased estimate is used in this paper we contrast the fundamental unbiasing principles which can be directly applied whenever soft feedback is required to this end the problem is treated from a signalbased perspective as well as from the approach of estimating the signal based on an estimate of the noise numerical results show that when employed in iterative reconstruction algorithms for compressed sensing a gain of 12 db due to proper unbiasing is possible | [['in', 'all', 'applications', 'in', 'digital', 'communications', 'it', 'is', 'crucial', 'for', 'an', 'estimator', 'to', 'be', 'unbiased', 'although', 'socalled', 'soft', 'feedback', 'is', 'widely', 'employed', 'in', 'many', 'different', 'fields', 'of', 'engineering', 'typically', 'the', 'biased', 'estimate', 'is', 'used', 'in', 'this', 'paper', 'we', 'contrast', 'the', 'fundamental', 'unbiasing', 'principles', 'which', 'can', 'be', 'directly', 'applied', 'whenever', 'soft', 'feedback', 'is', 'required', 'to', 'this', 'end', 'the', 'problem', 'is', 'treated', 'from', 'a', 'signalbased', 'perspective', 'as', 'well', 'as', 'from', 'the', 'approach', 'of', 'estimating', 'the', 'signal', 'based', 'on', 'an', 'estimate', 'of', 'the', 'noise', 'numerical', 'results', 'show', 'that', 'when', 'employed', 'in', 'iterative', 'reconstruction', 'algorithms', 'for', 'compressed', 'sensing', 'a', 'gain', 'of', '12', 'db', 'due', 'to', 'proper', 'unbiasing', 'is', 'possible']] | [-0.028095575570616694, 0.06300958238702845, -0.09406454548949288, 0.07410791650237072, -0.0683634182793044, -0.12320798704223264, 0.02784559427028788, 0.3863483398797966, -0.30310474760120826, -0.3068106952167693, 0.1727709250968127, -0.20994446867456037, -0.2039612085480864, 0.24404597868699404, -0.1377867243474438, 0.07421260568357649, 0.020856881904460136, 0.04344893633387983, -0.03764669128882122, -0.21694637032757913, 0.2609736017705429, 0.07389633003622294, 0.3158904104715302, 0.009891987421239416, 0.09388880002800198, 0.029927723930172977, -0.0428915162215985, 0.030193005437918363, -0.07915142143312898, 0.11363363784316573, 0.3002205764963513, 0.13779583402598897, 0.308682809947502, -0.3873906032027056, -0.21803065886987108, 0.12622210474773532, 0.17408309905301958, 0.14020702714167002, -0.06362488527582692, -0.2209048667035642, 0.11586053716018796, -0.15707304408507688, -0.06645810990816071, -0.049674642742389724, -0.039130846158202205, 0.009537018847082177, -0.3337537164450623, 0.07265187696154629, 0.03579316665861933, 0.009793537775320667, -0.03591984653778906, -0.1147290305500584, 0.048563375246400635, 0.17286239535952475, 0.020289061604333775, 0.05821753321658997, 0.11879876882192635, -0.13520988696476532, -0.1216222068117488, 0.40806273848173163, -0.03357467263537858, -0.20895206192064852, 0.19581178843398533, -0.06107067595723839, -0.12729914784431456, 0.13676109972986436, 0.19706163103027002, 0.11754011760598847, -0.19553459385878386, 0.050937370312887996, 0.012477899440342471, 0.19230412337042035, 0.031614921113387456, 0.037917266382525364, 0.14607766619661733, 0.17098310593781726, 0.10340140958128143, 0.14331332012190529, -0.08015278239202286, -0.053864561208146845, -0.2660769907136758, -0.11826224881446078, -0.24585119512131703, 0.031985624821945315, -0.04941377125769144, -0.14879490422927552, 0.3385323246763576, 0.21373762219168602, 0.1754773451769281, -0.01752869956794062, 0.377733245137192, 0.15108450463795592, 0.060489111482387496, 0.06062034660329421, 0.2794003468250767, 0.1478321758852828, 0.06724554772621819, -0.15283364899722593, 0.0629992838815919, 0.007136450865350309] |
1,802.07106 | Majorana oscillations modulated by Fano interference and dregree of
non-locality in a topological superconducting nanowire-quantum dot system | We explore theoretically the influence of Fano interference in the so-called
Majorana oscillations in a T-shaped hybrid setup formed by a quantum dot (QD)
placed between conducting leads and side-coupled to a topological
superconducting nanowire (TSNW) hosting zero-energy Majorana bound states
(MBSs) at the ends. Differential conductance as a function of the external
magnetic field reveals oscillatory behavior. Both the shape and amplitude of
the oscillations depend on the bias-voltage, degree of MBSs non-locality and
Fano parameter of the system determining the regime of interference. When the
latter is such that direct lead-lead path dominates over lead-QD-lead path and
the bias is tuned in resonance with QD zero-energy, pronounced fractional
Fano-like resonances are observed around zero-bias for highly non-local
geometries. Further, the conductance profiles as a function of both
bias-voltage and QD energy level display "bowtie" and "diamond" shapes, in
qualitative agreement with both previous theoretical and experimental works.
These findings ensure that our proposal can be used to estimate the degree of
MBS non-locality, thus allowing to investigate their topological properties.
| cond-mat.mes-hall | we explore theoretically the influence of fano interference in the socalled majorana oscillations in a tshaped hybrid setup formed by a quantum dot qd placed between conducting leads and sidecoupled to a topological superconducting nanowire tsnw hosting zeroenergy majorana bound states mbss at the ends differential conductance as a function of the external magnetic field reveals oscillatory behavior both the shape and amplitude of the oscillations depend on the biasvoltage degree of mbss nonlocality and fano parameter of the system determining the regime of interference when the latter is such that direct leadlead path dominates over leadqdlead path and the bias is tuned in resonance with qd zeroenergy pronounced fractional fanolike resonances are observed around zerobias for highly nonlocal geometries further the conductance profiles as a function of both biasvoltage and qd energy level display bowtie and diamond shapes in qualitative agreement with both previous theoretical and experimental works these findings ensure that our proposal can be used to estimate the degree of mbs nonlocality thus allowing to investigate their topological properties | [['we', 'explore', 'theoretically', 'the', 'influence', 'of', 'fano', 'interference', 'in', 'the', 'socalled', 'majorana', 'oscillations', 'in', 'a', 'tshaped', 'hybrid', 'setup', 'formed', 'by', 'a', 'quantum', 'dot', 'qd', 'placed', 'between', 'conducting', 'leads', 'and', 'sidecoupled', 'to', 'a', 'topological', 'superconducting', 'nanowire', 'tsnw', 'hosting', 'zeroenergy', 'majorana', 'bound', 'states', 'mbss', 'at', 'the', 'ends', 'differential', 'conductance', 'as', 'a', 'function', 'of', 'the', 'external', 'magnetic', 'field', 'reveals', 'oscillatory', 'behavior', 'both', 'the', 'shape', 'and', 'amplitude', 'of', 'the', 'oscillations', 'depend', 'on', 'the', 'biasvoltage', 'degree', 'of', 'mbss', 'nonlocality', 'and', 'fano', 'parameter', 'of', 'the', 'system', 'determining', 'the', 'regime', 'of', 'interference', 'when', 'the', 'latter', 'is', 'such', 'that', 'direct', 'leadlead', 'path', 'dominates', 'over', 'leadqdlead', 'path', 'and', 'the', 'bias', 'is', 'tuned', 'in', 'resonance', 'with', 'qd', 'zeroenergy', 'pronounced', 'fractional', 'fanolike', 'resonances', 'are', 'observed', 'around', 'zerobias', 'for', 'highly', 'nonlocal', 'geometries', 'further', 'the', 'conductance', 'profiles', 'as', 'a', 'function', 'of', 'both', 'biasvoltage', 'and', 'qd', 'energy', 'level', 'display', 'bowtie', 'and', 'diamond', 'shapes', 'in', 'qualitative', 'agreement', 'with', 'both', 'previous', 'theoretical', 'and', 'experimental', 'works', 'these', 'findings', 'ensure', 'that', 'our', 'proposal', 'can', 'be', 'used', 'to', 'estimate', 'the', 'degree', 'of', 'mbs', 'nonlocality', 'thus', 'allowing', 'to', 'investigate', 'their', 'topological', 'properties']] | [-0.23055673572782645, 0.15136833360473462, -0.06874484537607607, 0.0672504875524764, -0.024307431340874996, -0.214182298392167, 0.07097507920732503, 0.3680314596304122, -0.20632083102656693, -0.3332863921463928, -0.04750654503483983, -0.2933649989338044, -0.16150390375097393, 0.2106977832120131, -0.0022052800235756237, 0.046888395946692016, 0.03821441217491263, 0.0034585154546863017, -0.03680774349417976, -0.17654814660439597, 0.3252605165628826, 0.018766478949007303, 0.33249586674877823, 0.12007911131333779, 0.0005686390199972426, -0.004860551767599057, 0.09704059150124736, 0.03624963879256564, -0.14139115474493283, 0.05068891938221093, 0.24793323942405335, -0.05995213072473074, 0.19443781890029854, -0.4459910876391565, -0.1662229006676866, 0.055922555040674254, 0.17835586412042817, 0.12497259212438674, -0.028486236851141954, -0.3365652373608421, 0.056017993906896345, -0.11033890077395721, -0.12855308448950595, -0.023597827411311514, -0.02740878761294024, 0.0001340930038542651, -0.2431418189623133, 0.10227735007373506, 0.03794897754183587, 0.04191266112714349, 0.0063746761147151975, -0.07579919887391631, -0.06472474607392488, 0.07815262541013962, -0.01783406823490034, -0.018549862568889856, 0.18788310902138405, -0.1393145031973665, -0.14687779118471286, 0.2804217323434868, -0.07187438643783989, -0.1531101324773558, 0.15565618226195083, -0.19397119272308533, -0.019610044872388245, 0.11635201669517248, 0.1243001039386453, 0.07374478353132659, -0.08717973691536292, 0.06366548753268195, -0.0029851362232447545, 0.15145640365115148, 0.07606295201215235, 0.15314615707710105, 0.2633411354136222, 0.18089346161303932, 0.08183943656725151, 0.14490063063841424, -0.1342084805138738, -0.09590956890109309, -0.2852007036864319, -0.1351755817355725, -0.19860840343925007, 0.054248967791414436, -0.061098209517812765, -0.20597057314041783, 0.455625438161523, 0.08945356020977831, 0.23129586314453798, -0.019184485509279457, 0.2634317035868983, 0.15958084692726568, 0.06473356373745072, 0.016438656878274154, 0.25428477711496217, 0.20652265739216305, 0.0753282760591794, -0.3500376768684124, 0.040584546765175596, -0.06084055673084496] |
1,802.07107 | Learning of Optimal Forecast Aggregation in Partial Evidence
Environments | We consider the forecast aggregation problem in repeated settings, where the
forecasts are done on a binary event. At each period multiple experts provide
forecasts about an event. The goal of the aggregator is to aggregate those
forecasts into a subjective accurate forecast. We assume that experts are
Bayesian; namely they share a common prior, each expert is exposed to some
evidence, and each expert applies Bayes rule to deduce his forecast. The
aggregator is ignorant with respect to the information structure (i.e.,
distribution over evidence) according to which experts make their prediction.
The aggregator observes the experts' forecasts only. At the end of each period
the actual state is realized. We focus on the question whether the aggregator
can learn to aggregate optimally the forecasts of the experts, where the
optimal aggregation is the Bayesian aggregation that takes into account all the
information (evidence) in the system.
We consider the class of partial evidence information structures, where each
expert is exposed to a different subset of conditionally independent signals.
Our main results are positive; We show that optimal aggregation can be learned
in polynomial time in a quite wide range of instances of the partial evidence
environments. We provide a tight characterization of the instances where
learning is possible and impossible.
| cs.LG stat.ML | we consider the forecast aggregation problem in repeated settings where the forecasts are done on a binary event at each period multiple experts provide forecasts about an event the goal of the aggregator is to aggregate those forecasts into a subjective accurate forecast we assume that experts are bayesian namely they share a common prior each expert is exposed to some evidence and each expert applies bayes rule to deduce his forecast the aggregator is ignorant with respect to the information structure ie distribution over evidence according to which experts make their prediction the aggregator observes the experts forecasts only at the end of each period the actual state is realized we focus on the question whether the aggregator can learn to aggregate optimally the forecasts of the experts where the optimal aggregation is the bayesian aggregation that takes into account all the information evidence in the system we consider the class of partial evidence information structures where each expert is exposed to a different subset of conditionally independent signals our main results are positive we show that optimal aggregation can be learned in polynomial time in a quite wide range of instances of the partial evidence environments we provide a tight characterization of the instances where learning is possible and impossible | [['we', 'consider', 'the', 'forecast', 'aggregation', 'problem', 'in', 'repeated', 'settings', 'where', 'the', 'forecasts', 'are', 'done', 'on', 'a', 'binary', 'event', 'at', 'each', 'period', 'multiple', 'experts', 'provide', 'forecasts', 'about', 'an', 'event', 'the', 'goal', 'of', 'the', 'aggregator', 'is', 'to', 'aggregate', 'those', 'forecasts', 'into', 'a', 'subjective', 'accurate', 'forecast', 'we', 'assume', 'that', 'experts', 'are', 'bayesian', 'namely', 'they', 'share', 'a', 'common', 'prior', 'each', 'expert', 'is', 'exposed', 'to', 'some', 'evidence', 'and', 'each', 'expert', 'applies', 'bayes', 'rule', 'to', 'deduce', 'his', 'forecast', 'the', 'aggregator', 'is', 'ignorant', 'with', 'respect', 'to', 'the', 'information', 'structure', 'ie', 'distribution', 'over', 'evidence', 'according', 'to', 'which', 'experts', 'make', 'their', 'prediction', 'the', 'aggregator', 'observes', 'the', 'experts', 'forecasts', 'only', 'at', 'the', 'end', 'of', 'each', 'period', 'the', 'actual', 'state', 'is', 'realized', 'we', 'focus', 'on', 'the', 'question', 'whether', 'the', 'aggregator', 'can', 'learn', 'to', 'aggregate', 'optimally', 'the', 'forecasts', 'of', 'the', 'experts', 'where', 'the', 'optimal', 'aggregation', 'is', 'the', 'bayesian', 'aggregation', 'that', 'takes', 'into', 'account', 'all', 'the', 'information', 'evidence', 'in', 'the', 'system', 'we', 'consider', 'the', 'class', 'of', 'partial', 'evidence', 'information', 'structures', 'where', 'each', 'expert', 'is', 'exposed', 'to', 'a', 'different', 'subset', 'of', 'conditionally', 'independent', 'signals', 'our', 'main', 'results', 'are', 'positive', 'we', 'show', 'that', 'optimal', 'aggregation', 'can', 'be', 'learned', 'in', 'polynomial', 'time', 'in', 'a', 'quite', 'wide', 'range', 'of', 'instances', 'of', 'the', 'partial', 'evidence', 'environments', 'we', 'provide', 'a', 'tight', 'characterization', 'of', 'the', 'instances', 'where', 'learning', 'is', 'possible', 'and', 'impossible']] | [-0.09053884834086276, 0.05736274954502939, -0.09679291505072231, 0.10204744658582264, -0.12314873221462136, -0.1547681251233268, 0.09695402623861502, 0.415600421082861, -0.2717179460451007, -0.28834443938405524, 0.1278436273909701, -0.31208128046753975, -0.11311044204400254, 0.14338700032907203, -0.08811337249693987, 0.015392659335256607, 0.07621957766076655, 0.11727364063795595, -0.014687167291413061, -0.3151463940047729, 0.30047547715311906, 0.06678357969679571, 0.28343432008306374, -0.02221887301267037, 0.12273892526512632, 0.011663741066410506, -0.05730644815501467, -0.01098979025218281, -0.12159125145053451, 0.10522099269086162, 0.3366990198100091, 0.20992327187309026, 0.37102709674684964, -0.40540901096186266, -0.18102530975175915, 0.11595224636773807, 0.08677940752592271, 0.08672212178073165, 0.013493885873033849, -0.2725631979910244, 0.07163109703929568, -0.17051338266256214, -0.038295459722713476, -0.05520634427622734, -0.020874572312679, 0.026352627800320678, -0.35888541256047934, 0.04065218087030961, 0.05865930828138448, 0.022734857170912875, -0.10063140363792696, -0.09367038868532411, 0.004426496433981536, 0.19613432280833498, 0.046631152618606134, -0.007810835459133399, 0.13365486848364663, -0.09671801987174407, -0.11899795524450897, 0.3621607648630468, -0.01803887359587089, -0.2003751119141871, 0.1550332641707874, -0.12173071788033066, -0.15709419299481558, 0.1030287851957288, 0.20180136299217646, 0.08644570074184744, -0.15653379207706508, -0.003919169206264481, -0.08622525817986999, 0.2175501964784245, 0.04229937033631118, -0.03282710192022177, 0.24446976276659318, 0.16843440498989778, 0.08791884068478742, 0.11611309411709267, -0.053410218723276455, -0.1233570981127724, -0.27195135803062925, -0.11708938671468992, -0.18057584938569046, 0.04188282138070548, -0.11170286986494178, -0.1330363000708084, 0.3604985248112946, 0.20978058467812413, 0.20714065892938174, 0.07052998752212415, 0.28738845599252943, 0.08577652704596678, 0.01689373371303894, 0.0900892730646345, 0.17861775031056856, -0.0019236303786835018, 0.07574592260720718, -0.13098096451063132, 0.18013296305544604, -0.01374699116491203] |
1,802.07108 | Symmetries near a generic charged null surface and associated algebra:
an off-shell analysis | To understand the underlying degrees of freedom, near horizon symmetry
analysis of a black has gain significant interest in the recent past. In this
paper we generalized those analysis first by taking into account a generic null
surface carrying $U(1)$ electromagnetic charge. With the appropriate boundary
conditions near the surface under study, we identified the symmetry algebra
among the subset of diffeomporphism and gauge generators which preserve the
metric of the null surface and the form of the gauge field configuration. With
the knowledge of those symmetries we further derived the algebra among the
associated charges considering general Lanczos-Lovelock gravity theory and
gauge theory. Importantly while computing the charges we not only considered
general theory, but also used off-shell formalism which is believed to play
crucial role in understanding quantum gravity. Both the non-extremal and
extremal cases are addressed here.
| gr-qc hep-th | to understand the underlying degrees of freedom near horizon symmetry analysis of a black has gain significant interest in the recent past in this paper we generalized those analysis first by taking into account a generic null surface carrying u1 electromagnetic charge with the appropriate boundary conditions near the surface under study we identified the symmetry algebra among the subset of diffeomporphism and gauge generators which preserve the metric of the null surface and the form of the gauge field configuration with the knowledge of those symmetries we further derived the algebra among the associated charges considering general lanczoslovelock gravity theory and gauge theory importantly while computing the charges we not only considered general theory but also used offshell formalism which is believed to play crucial role in understanding quantum gravity both the nonextremal and extremal cases are addressed here | [['to', 'understand', 'the', 'underlying', 'degrees', 'of', 'freedom', 'near', 'horizon', 'symmetry', 'analysis', 'of', 'a', 'black', 'has', 'gain', 'significant', 'interest', 'in', 'the', 'recent', 'past', 'in', 'this', 'paper', 'we', 'generalized', 'those', 'analysis', 'first', 'by', 'taking', 'into', 'account', 'a', 'generic', 'null', 'surface', 'carrying', 'u1', 'electromagnetic', 'charge', 'with', 'the', 'appropriate', 'boundary', 'conditions', 'near', 'the', 'surface', 'under', 'study', 'we', 'identified', 'the', 'symmetry', 'algebra', 'among', 'the', 'subset', 'of', 'diffeomporphism', 'and', 'gauge', 'generators', 'which', 'preserve', 'the', 'metric', 'of', 'the', 'null', 'surface', 'and', 'the', 'form', 'of', 'the', 'gauge', 'field', 'configuration', 'with', 'the', 'knowledge', 'of', 'those', 'symmetries', 'we', 'further', 'derived', 'the', 'algebra', 'among', 'the', 'associated', 'charges', 'considering', 'general', 'lanczoslovelock', 'gravity', 'theory', 'and', 'gauge', 'theory', 'importantly', 'while', 'computing', 'the', 'charges', 'we', 'not', 'only', 'considered', 'general', 'theory', 'but', 'also', 'used', 'offshell', 'formalism', 'which', 'is', 'believed', 'to', 'play', 'crucial', 'role', 'in', 'understanding', 'quantum', 'gravity', 'both', 'the', 'nonextremal', 'and', 'extremal', 'cases', 'are', 'addressed', 'here']] | [-0.147192747963646, 0.12288464655891972, -0.07319343062586707, 0.08347036427543532, -0.08462052402193758, -0.12830582713346472, -0.004238003281970247, 0.31980336053471126, -0.19512925001209697, -0.2917090493033258, 0.07692556232699736, -0.2499246913839212, -0.17357911074386656, 0.12241472730667685, -0.044324185313965134, 0.01847207120773818, -0.0020546859344668525, 0.07629791753058382, -0.10299385252924596, -0.22305679465761313, 0.34701560394128234, 0.06313246526594589, 0.302682498975811, 0.04920182019101938, 0.09447527111662056, 0.04499952853891811, -0.028551207346131476, 0.05587696310781768, -0.14786805412832568, 0.11744316027117827, 0.23654393996480558, 0.07592018416466312, 0.19606879022870238, -0.4693257994480806, -0.23625025652322196, 0.10358127730181642, 0.12231813590611806, 0.13077334155790882, -0.057396635721377334, -0.2913837917752082, 0.07032577387599957, -0.16000518896918503, -0.17719257275470057, -0.08916201639464862, -0.006824889122307462, -0.08788572442793227, -0.21142352657206692, 0.04808108223474035, 0.09399187284783064, 0.04541892484299463, -0.09395083305660448, -0.07528473132142542, -0.09772923715720824, 0.11825589451054447, 0.13842149705143658, 0.03488311906706997, 0.1308242462629037, -0.1531848475360479, -0.09390906232121073, 0.38413167430637335, 5.38686357384963e-06, -0.2480581382008122, 0.15418004032170815, -0.18820949156287883, -0.17596662153402787, 0.08973821871009448, 0.15607485644814137, 0.14182699021796208, -0.16538907236439718, 0.1620978213990737, -0.02312690495402827, 0.0801677998095054, 0.07909237028923717, 0.09662881052446477, 0.2852068333049044, 0.08773011065644326, 0.03019123032886749, 0.11200590965358152, -0.020642659203534638, -0.15087098379036507, -0.3959502276140366, -0.16185473505952064, -0.12113363586580582, 0.07579232422539063, -0.10669508989824555, -0.12328264669334288, 0.38967111837219365, 0.14486472671784514, 0.11570682431229477, -0.014625350822419893, 0.2152893041401244, 0.11930553611073134, 0.10178311527271172, 0.081824918126808, 0.2604622009642449, 0.17960273234756569, 0.0424034725321899, -0.24060704278853462, -0.02709326910092864, 0.09869508393839163] |
1,802.07109 | The derived subgroup of linear and simply-connected o-minimal groups | We show that the derived subgroup of a linear definable group in an o-minimal
structure is also definable, extending the semialgebraic case proved by A.
Pillay. We also show the definability of the derived subgroup in case that the
group is simply-connected.
| math.LO math.GR | we show that the derived subgroup of a linear definable group in an ominimal structure is also definable extending the semialgebraic case proved by a pillay we also show the definability of the derived subgroup in case that the group is simplyconnected | [['we', 'show', 'that', 'the', 'derived', 'subgroup', 'of', 'a', 'linear', 'definable', 'group', 'in', 'an', 'ominimal', 'structure', 'is', 'also', 'definable', 'extending', 'the', 'semialgebraic', 'case', 'proved', 'by', 'a', 'pillay', 'we', 'also', 'show', 'the', 'definability', 'of', 'the', 'derived', 'subgroup', 'in', 'case', 'that', 'the', 'group', 'is', 'simplyconnected']] | [-0.205289570259906, 0.006385117894318509, -0.1035286581221347, 0.0993602669941971, -0.13451147265732288, -0.020535607533972888, 0.017015847643571242, 0.3726250088463227, -0.35968828436342026, -0.15982610727882102, 0.09195160345240895, -0.20560645604772226, -0.12770040794497445, 0.23671578154677436, -0.1460570218928513, -0.07395579147019557, -0.018689498161187486, 0.15110335453590823, -0.048666664077678605, -0.290764433326244, 0.4123616481111163, -0.10869699691067494, 0.23258937733425272, 0.03421122979904924, 0.06754142338676113, -0.008594809355036844, 0.002303455512793291, 0.0622835455107547, -0.13707204292967662, 0.08086146447541458, 0.3329133748387297, 0.10820149404129811, 0.24221899161403554, -0.37608992405945346, -0.18857727253011294, 0.17135225174327692, 0.12541595320882543, 0.010238034428939932, -0.10053894850647166, -0.34000737147982274, 0.1359684584396226, -0.19223517312535218, -0.1939798019759889, -0.08722567935252473, 0.08202556290087246, -0.027365760855554117, -0.2279351868270342, -0.015514794361522598, 0.17635319102555513, 0.14733432769952787, -0.07522338863816999, -0.04086877543124415, -0.043704627746982236, 0.040737576716180356, -0.03448123667788293, 0.062142376022945554, 0.1038510362905938, -0.05090898807559695, -0.10100730193690174, 0.41539004711168154, -0.16414582873472855, -0.18595891193087613, 0.0939014047450785, -0.2350767063797407, -0.2465724308165677, 0.059599799902311394, 0.003337897892509188, 0.18741770239458197, -0.03815121316888724, 0.2691322487025034, -0.2779624300476696, 0.16235594750781143, 0.07829833833412045, -0.058931409170673715, -0.008120287187574874, 0.11720760233168091, 0.0738821494215656, 0.21602145799746117, 0.09612314142508521, 0.036635728020753176, -0.3591957241296768, -0.13353523554369098, -0.11149642299417228, 0.04830209179116147, -0.11345669255769324, -0.17051228628094708, 0.3668666011875584, 0.08549875289290434, 0.0945132336623612, 0.19882707133711802, 0.18753227591514587, 0.05426395223254249, 0.02265992614307574, 0.154503000877975, 0.15746103014264787, 0.2354169769179342, -0.13971401404012881, -0.15593384581041478, -0.004201995053639014, 0.16061749375824416] |
1,802.0711 | A priori bounds and multiplicity of positive solutions for $p$-Laplacian
Neumann problems with sub-critical growth | Let $1<p<+\infty$ and let $\Omega\subset\mathbb R^N$ be either a ball or an
annulus. We continue the analysis started in [Boscaggin, Colasuonno, Noris,
ESAIM Control Optim. Calc. Var. (2017)], concerning quasilinear Neumann
problems of the type \[ -\Delta_p u = f(u), \quad u>0 \mbox{ in } \Omega, \quad
\partial_\nu u = 0 \mbox{ on } \partial\Omega. \] We suppose that $f(0)=f(1)=0$
and that $f$ is negative between the two zeros and positive after. In case
$\Omega$ is a ball, we also require that $f$ grows less than the
Sobolev-critical power at infinity. We prove a priori bounds of radial
solutions, focusing in particular on solutions which start above 1. As an
application, we use the shooting technique to get existence, multiplicity and
oscillatory behavior (around 1) of non-constant radial solutions.
| math.AP | let 1pinfty and let omegasubsetmathbb rn be either a ball or an annulus we continue the analysis started in boscaggin colasuonno noris esaim control optim calc var 2017 concerning quasilinear neumann problems of the type delta_p u fu quad u0 mbox in omega quad partial_nu u 0 mbox on partialomega we suppose that f0f10 and that f is negative between the two zeros and positive after in case omega is a ball we also require that f grows less than the sobolevcritical power at infinity we prove a priori bounds of radial solutions focusing in particular on solutions which start above 1 as an application we use the shooting technique to get existence multiplicity and oscillatory behavior around 1 of nonconstant radial solutions | [['let', '1pinfty', 'and', 'let', 'omegasubsetmathbb', 'rn', 'be', 'either', 'a', 'ball', 'or', 'an', 'annulus', 'we', 'continue', 'the', 'analysis', 'started', 'in', 'boscaggin', 'colasuonno', 'noris', 'esaim', 'control', 'optim', 'calc', 'var', '2017', 'concerning', 'quasilinear', 'neumann', 'problems', 'of', 'the', 'type', 'delta_p', 'u', 'fu', 'quad', 'u0', 'mbox', 'in', 'omega', 'quad', 'partial_nu', 'u', '0', 'mbox', 'on', 'partialomega', 'we', 'suppose', 'that', 'f0f10', 'and', 'that', 'f', 'is', 'negative', 'between', 'the', 'two', 'zeros', 'and', 'positive', 'after', 'in', 'case', 'omega', 'is', 'a', 'ball', 'we', 'also', 'require', 'that', 'f', 'grows', 'less', 'than', 'the', 'sobolevcritical', 'power', 'at', 'infinity', 'we', 'prove', 'a', 'priori', 'bounds', 'of', 'radial', 'solutions', 'focusing', 'in', 'particular', 'on', 'solutions', 'which', 'start', 'above', '1', 'as', 'an', 'application', 'we', 'use', 'the', 'shooting', 'technique', 'to', 'get', 'existence', 'multiplicity', 'and', 'oscillatory', 'behavior', 'around', '1', 'of', 'nonconstant', 'radial', 'solutions']] | [-0.17905286450659028, 0.03901435827524323, -0.03058744948836701, -0.00338892634476715, -0.1083435869204397, -0.18235968823834253, -0.015091976432614968, 0.32236974034262744, -0.28088689414674745, -0.17565006112382442, 0.1618426912581595, -0.40631334563842464, -0.06304640951566398, 0.1990521472190045, -0.11051762916398149, 0.04450306020082295, 0.039823915605910684, 0.06250422099260848, -0.06344722358298589, -0.20014678084628046, 0.3468304598242232, -0.14227183299342624, 0.14161652643546588, 0.05465261073501295, 0.061960748829702775, -0.026961883142621827, 0.07594017291973744, -0.03226510627868296, -0.2937695515195192, 0.02883121115938142, 0.22246218748202845, 0.08970506400057748, 0.3902365521864355, -0.40815435589424204, -0.1632176661108691, 0.22239454899828473, 0.1964233497007527, -0.08766653130179224, -0.01126788678665121, -0.2898989991410127, 0.1430468091569027, -0.08218389425716292, -0.19808650136526143, -0.0077575406200495085, 0.12189452770408712, 0.06006435738258189, -0.3644055719458021, 0.12454932543596824, 0.1265465389299324, 0.04763869007270658, -0.12695303295950303, -0.17348748076894954, -0.028407702711606475, 0.035742215426763944, 0.010672387866569417, 0.16354350738927817, 0.010408933376189039, -0.07758805045795415, -0.04329247275727386, 0.32146826486627594, -0.12396407448121703, -0.27323873366127494, 0.10145320895151431, -0.23044031019275615, -0.13247257773568774, 0.041570749775576996, 0.1720390341307248, 0.19418846768084444, -0.04824093911217667, 0.2364385873137997, -0.06529443930372783, 0.19692403659177551, 0.1692179912043845, -0.059406970201075826, 0.06113286930559, 0.0845928660891324, 0.1715963364758787, 0.07443672775764394, -0.04155070506850211, 0.014190701325619672, -0.38633737943189983, -0.09835616010045554, -0.12108000260464721, 0.1788529999986557, -0.06139802809818374, -0.14289473497187483, 0.3014958611681682, 0.06753751961123042, 0.19714255226353386, 0.07375691751382087, 0.1612122087512447, 0.13319973521102846, -0.0665100776950414, 0.13850844550697805, 0.10250357407372163, 0.1128929878796349, 0.16757647999163186, -0.20985734089426383, -0.023194563430303537, 0.10722914185500194] |
1,802.07111 | Measurement of electron-calcium ionization integral cross section using
an ion trap with a low-energy, pulsed electron gun | An apparatus for production of various atomic and molecular ions inside a
linear Paul trap has been set up. The system applies a custom-made, low energy,
pulsed electron gun to produce ions in electron impact process. Such ionization
method can find some interesting possible applications such as derivation of
ions inaccessible other-ways, which can be used in molecular ion experiments.
The technique allows also for determination of cross sections for various
collisional processes.
As a feasibility study, the apparatus was used for determination of
ionization integral cross section of calcium in the 16--160 eV range of
electron impact energy. The obtained cross section values are discussed and
compared with existing data sets.
| physics.ins-det physics.atom-ph | an apparatus for production of various atomic and molecular ions inside a linear paul trap has been set up the system applies a custommade low energy pulsed electron gun to produce ions in electron impact process such ionization method can find some interesting possible applications such as derivation of ions inaccessible otherways which can be used in molecular ion experiments the technique allows also for determination of cross sections for various collisional processes as a feasibility study the apparatus was used for determination of ionization integral cross section of calcium in the 16160 ev range of electron impact energy the obtained cross section values are discussed and compared with existing data sets | [['an', 'apparatus', 'for', 'production', 'of', 'various', 'atomic', 'and', 'molecular', 'ions', 'inside', 'a', 'linear', 'paul', 'trap', 'has', 'been', 'set', 'up', 'the', 'system', 'applies', 'a', 'custommade', 'low', 'energy', 'pulsed', 'electron', 'gun', 'to', 'produce', 'ions', 'in', 'electron', 'impact', 'process', 'such', 'ionization', 'method', 'can', 'find', 'some', 'interesting', 'possible', 'applications', 'such', 'as', 'derivation', 'of', 'ions', 'inaccessible', 'otherways', 'which', 'can', 'be', 'used', 'in', 'molecular', 'ion', 'experiments', 'the', 'technique', 'allows', 'also', 'for', 'determination', 'of', 'cross', 'sections', 'for', 'various', 'collisional', 'processes', 'as', 'a', 'feasibility', 'study', 'the', 'apparatus', 'was', 'used', 'for', 'determination', 'of', 'ionization', 'integral', 'cross', 'section', 'of', 'calcium', 'in', 'the', '16160', 'ev', 'range', 'of', 'electron', 'impact', 'energy', 'the', 'obtained', 'cross', 'section', 'values', 'are', 'discussed', 'and', 'compared', 'with', 'existing', 'data', 'sets']] | [-0.027281925354891264, 0.13926519027836137, -0.023754631806802644, 0.08019099505636897, 0.03142071369959897, -0.1343783933191082, 0.007761513622402138, 0.37615882885550056, -0.2105777893165076, -0.32847215632513704, 0.026097212667442724, -0.29477040273536453, 0.01426137088554668, 0.2948182499212389, 0.05351766703130157, 0.1207056841719948, 0.07275392552250409, -0.010747190403357686, -0.01687556094970336, -0.1696418554580829, 0.2623127334759579, 0.13888024461564716, 0.24338374431203078, 0.17769029911875994, 0.1342070928474821, 0.01843809320272559, 0.0018238160231670885, 0.0009601582596833641, -0.14582991422372157, 0.1025224036142767, 0.28531406526999165, 0.07390980687420312, 0.20145078789157508, -0.4441671479191329, -0.19484218458334604, 0.07333801940570141, 0.1536377181156396, 0.13728748231382645, -0.10679983768847075, -0.23009838001080998, -0.003506752301578049, -0.20906144296666523, -0.14604560630647717, -0.09424912711806796, 0.007843957387481455, 0.09138801191967014, -0.2994124731468456, 0.030573391468580895, -0.014680018963141216, 0.06552420511447431, -0.09171061365716243, -0.15569155593507564, 0.012415108413578154, 0.05261753270452892, 0.0024451840045413018, 0.0009020284690835455, 0.26219466596271274, -0.05514653908038462, -0.10925926682581236, 0.38894948547890595, -0.08351994461698777, -0.14088149222771865, 0.18940412650002283, -0.15861910535861645, -0.09151903355309556, 0.213176656136843, 0.17984967924620923, 0.09831404524460972, -0.18269397603633167, 0.08282715592849035, -0.010746181233542727, 0.15070811742754797, 0.13414994040126535, 0.05548610061256064, 0.17680672376190085, 0.18655904672771423, 0.02156036035870915, 0.09139059063349746, -0.16011092585284967, -0.027081066541696754, -0.2825542385301863, -0.1918906073866261, -0.10725647586120947, 0.03382988923086642, -0.0016602169098814967, -0.11810768489633594, 0.3411201716669172, 0.11606572426620636, 0.20017355455605834, -0.10249623612538483, 0.3162519416797, 0.11255711435483504, 0.04102417381966973, -0.02116632491752908, 0.24996926878533862, 0.17087909544037805, 0.11016885254968393, -0.22265724820579896, 0.086411970180904, 0.022919775295146817] |
1,802.07112 | Asymptotic Distribution of Parameters in Random Maps | We consider random rooted maps without regard to their genus, with fixed
large number of edges, and address the problem of limiting distributions for
six different parameters: vertices, leaves, loops, root edges, root isthmus,
and root vertex degree. Each of these leads to a different limiting
distribution, varying from (discrete) geometric and Poisson distributions to
different continuous ones: Beta, normal, uniform, and an unusual distribution
whose moments are characterised by a recursive triangular array.
| math.CO math.AP math.PR | we consider random rooted maps without regard to their genus with fixed large number of edges and address the problem of limiting distributions for six different parameters vertices leaves loops root edges root isthmus and root vertex degree each of these leads to a different limiting distribution varying from discrete geometric and poisson distributions to different continuous ones beta normal uniform and an unusual distribution whose moments are characterised by a recursive triangular array | [['we', 'consider', 'random', 'rooted', 'maps', 'without', 'regard', 'to', 'their', 'genus', 'with', 'fixed', 'large', 'number', 'of', 'edges', 'and', 'address', 'the', 'problem', 'of', 'limiting', 'distributions', 'for', 'six', 'different', 'parameters', 'vertices', 'leaves', 'loops', 'root', 'edges', 'root', 'isthmus', 'and', 'root', 'vertex', 'degree', 'each', 'of', 'these', 'leads', 'to', 'a', 'different', 'limiting', 'distribution', 'varying', 'from', 'discrete', 'geometric', 'and', 'poisson', 'distributions', 'to', 'different', 'continuous', 'ones', 'beta', 'normal', 'uniform', 'and', 'an', 'unusual', 'distribution', 'whose', 'moments', 'are', 'characterised', 'by', 'a', 'recursive', 'triangular', 'array']] | [-0.13969297608914408, 0.20348889316055402, -0.017973144180015534, 0.05641814048175473, -0.10093329144906052, -0.15875149085312276, 0.037880377648901696, 0.3867774283060351, -0.3121331703622599, -0.3096778204796735, 0.06431875967521321, -0.3133484322602886, -0.10721996650603172, 0.08638902508175454, -0.07007743362840768, 0.06992929355820289, 0.037395331366742786, 0.04793415029810087, -0.06764090943682743, -0.23055656552723786, 0.3556218814054454, 0.003635026445310261, 0.25394178614825813, -0.03423543144615267, 0.14107532415388002, 0.04527287953533232, -0.05786470404347858, 0.07009309810913496, -0.1314311764876333, 0.07235322949143026, 0.1930425417156437, 0.04697371838689857, 0.1975566273227938, -0.41310299610769424, -0.1431749620651071, 0.17420404440899556, 0.1389232014771551, 0.03816270567728458, 0.024099746366610397, -0.21862044960663124, 0.09222971456993774, -0.12129627758927322, -0.209595249267295, 0.011311421900786258, 0.02941196716415721, 0.10963659033783384, -0.2612096114663055, 0.021168288611177657, 0.06289763292423575, 0.10045218514278531, 0.023229429888463504, -0.23022989980322686, -0.0560259694183195, 0.16732401840036382, 0.0033731133900456937, -0.0018813744992823213, 0.0644809702058115, -0.14612012892423473, -0.12924393299161582, 0.3173384446323522, -2.5819546568232613e-05, -0.22473414873427436, 0.17212387090045456, -0.17156124848092125, -0.1513400300078698, 0.15447971899364446, 0.17237081760037187, 0.10421899717452156, -0.15051133538017403, 0.06798666181684648, -0.03275030623567668, 0.08401511698281644, 0.12729356316472026, -0.006685538544646792, 0.20045945642364993, 0.060431624057929255, 0.11711495672667248, 0.19551514280406204, -0.08459600812686305, -0.10928879091767846, -0.26955380421635267, -0.07841464722956959, -0.20372469766015136, 0.07953933104117578, -0.2318821611894433, -0.2501246027594961, 0.4369696498143713, 0.0725373956775985, 0.29175489715527037, 0.10771881729502834, 0.20684779960209052, 0.13240079094680982, 0.03979194016082565, 0.07211055009109849, 0.04270678769948112, 0.15582349329142253, -0.028483471999926544, -0.14726005744887516, 0.06588041419918472, 0.073349644895643] |
1,802.07113 | Magnon-photon coupling in a non-collinear magnetic insulator
Cu$_2$OSeO$_3$ | Anticrossing behavior between magnons in a non-collinear chiral magnet
Cu$_2$OSeO$_3$ and a two-mode X-band microwave resonator was studied in the
temperature range 5-100K. In the field-induced ferrimagnetic phase, we observed
a strong coupling regime between magnons and two microwave cavity modes with a
cooperativity reaching 3600. In the conical phase, cavity modes are
dispersively coupled to a fundamental helimagnon mode, and we demonstrate that
the magnetic phase diagram of Cu$_2$OSeO$_3$ can be reconstructed from the
measurements of the cavity resonance frequency. In the helical phase, a
hybridized state of a higher-order helimagnon mode and a cavity mode - a
helimagnon polariton - was found. Our results reveal a new class of magnetic
systems where strong coupling of microwave photons to non-trivial spin textures
can be observed.
| cond-mat.mes-hall quant-ph | anticrossing behavior between magnons in a noncollinear chiral magnet cu_2oseo_3 and a twomode xband microwave resonator was studied in the temperature range 5100k in the fieldinduced ferrimagnetic phase we observed a strong coupling regime between magnons and two microwave cavity modes with a cooperativity reaching 3600 in the conical phase cavity modes are dispersively coupled to a fundamental helimagnon mode and we demonstrate that the magnetic phase diagram of cu_2oseo_3 can be reconstructed from the measurements of the cavity resonance frequency in the helical phase a hybridized state of a higherorder helimagnon mode and a cavity mode a helimagnon polariton was found our results reveal a new class of magnetic systems where strong coupling of microwave photons to nontrivial spin textures can be observed | [['anticrossing', 'behavior', 'between', 'magnons', 'in', 'a', 'noncollinear', 'chiral', 'magnet', 'cu_2oseo_3', 'and', 'a', 'twomode', 'xband', 'microwave', 'resonator', 'was', 'studied', 'in', 'the', 'temperature', 'range', '5100k', 'in', 'the', 'fieldinduced', 'ferrimagnetic', 'phase', 'we', 'observed', 'a', 'strong', 'coupling', 'regime', 'between', 'magnons', 'and', 'two', 'microwave', 'cavity', 'modes', 'with', 'a', 'cooperativity', 'reaching', '3600', 'in', 'the', 'conical', 'phase', 'cavity', 'modes', 'are', 'dispersively', 'coupled', 'to', 'a', 'fundamental', 'helimagnon', 'mode', 'and', 'we', 'demonstrate', 'that', 'the', 'magnetic', 'phase', 'diagram', 'of', 'cu_2oseo_3', 'can', 'be', 'reconstructed', 'from', 'the', 'measurements', 'of', 'the', 'cavity', 'resonance', 'frequency', 'in', 'the', 'helical', 'phase', 'a', 'hybridized', 'state', 'of', 'a', 'higherorder', 'helimagnon', 'mode', 'and', 'a', 'cavity', 'mode', 'a', 'helimagnon', 'polariton', 'was', 'found', 'our', 'results', 'reveal', 'a', 'new', 'class', 'of', 'magnetic', 'systems', 'where', 'strong', 'coupling', 'of', 'microwave', 'photons', 'to', 'nontrivial', 'spin', 'textures', 'can', 'be', 'observed']] | [-0.2553349559051477, 0.2771836495201096, -0.04391743817434805, -0.04005914324765828, -0.07220586106877744, -0.1489820787001674, 0.06683041367725265, 0.39841957200258, -0.20962124591981007, -0.2709369521618374, -0.018381397401709562, -0.3035953800776989, -0.08984705131989336, 0.21250782236154, 0.09949558770295414, 0.018408028825330054, 0.0009172535084975445, -0.023233897603548517, -0.015722468326898005, -0.06227656333759092, 0.23070218526886974, -0.034237960368637146, 0.35110036150469043, 0.05150690599064517, 0.09273837321263746, -0.08679849482179294, 0.17804407119576826, 0.0018252831489998635, -0.12282008895248495, -0.013058124242607898, 0.274714618194394, -0.09175199989562596, 0.18141517237517832, -0.4211527159914556, -0.18934272362933896, 0.05300221681534275, 0.18472404167154516, 0.19804283508622064, -0.04533463212229857, -0.3373861326343887, -0.01659417119846354, -0.1268678722331467, -0.12533610935012499, -0.07381040921313613, -0.09108903398358725, -0.04484529099881467, -0.29127779108759894, 0.08776707162444548, 0.05994869705963486, 0.09019961228548753, -0.0376013081913106, -0.017009712695106257, -0.0825599147351383, 0.019062993268111374, -0.007995955509746947, 0.06313872011378407, 0.14451421499706624, -0.10941074832107842, -0.15534486274075945, 0.31083502497796606, -0.12224625228200017, -0.0642010270262031, 0.16035384452349044, -0.2252194401921659, -0.025763949258177262, 0.1867447032752197, 0.1437042879425292, 0.07124471282056434, -0.1117463249862724, 0.03685479570838918, 0.016364847866409436, 0.24825087793803646, 0.0760833926355027, 0.13364784134839608, 0.30178788560253333, 0.17259932330211367, -0.025674419189856305, 0.2359608961004249, -0.14444503278615392, -0.04800219154666837, -0.2252939742633967, -0.117250986965146, -0.22024716590781984, 0.014964103009703198, -0.07939091182031813, -0.1716622678275273, 0.4634187834837088, 0.08809638945612966, 0.1607004272225275, -0.0974134128688403, 0.2894075707933767, 0.11094304099603276, 0.0676012635344594, 0.011035630782324125, 0.3893616384092143, 0.24430844464104592, 0.11114366046660315, -0.35813667228240975, -0.06779446680007911, -0.02372055880657238] |
1,802.07114 | Low Temperature-Mediated Enhancement of Photoacoustic Imaging Depth | We study the temperature dependence of the underlying mechanisms related to
the signal strength and imaging depth in photoacoustic imaging. The presented
theoretical and experimental results indicate that imaging depth can be
improved by lowering the temperature of the intermediate medium that the laser
passes through to reach the imaging target. We discuss the temperature
dependency of optical and acoustic properties of the intermediate medium and
their changes due to cooling. We demonstrate that the SNR improvement of the
photoacoustic signal is mainly due to the reduction of Gr\"uneisen parameter of
the intermediate medium which leads to a lower level of background noise. These
findings may open new possibilities toward the application of biomedical laser
refrigeration.
| physics.optics physics.bio-ph | we study the temperature dependence of the underlying mechanisms related to the signal strength and imaging depth in photoacoustic imaging the presented theoretical and experimental results indicate that imaging depth can be improved by lowering the temperature of the intermediate medium that the laser passes through to reach the imaging target we discuss the temperature dependency of optical and acoustic properties of the intermediate medium and their changes due to cooling we demonstrate that the snr improvement of the photoacoustic signal is mainly due to the reduction of gruneisen parameter of the intermediate medium which leads to a lower level of background noise these findings may open new possibilities toward the application of biomedical laser refrigeration | [['we', 'study', 'the', 'temperature', 'dependence', 'of', 'the', 'underlying', 'mechanisms', 'related', 'to', 'the', 'signal', 'strength', 'and', 'imaging', 'depth', 'in', 'photoacoustic', 'imaging', 'the', 'presented', 'theoretical', 'and', 'experimental', 'results', 'indicate', 'that', 'imaging', 'depth', 'can', 'be', 'improved', 'by', 'lowering', 'the', 'temperature', 'of', 'the', 'intermediate', 'medium', 'that', 'the', 'laser', 'passes', 'through', 'to', 'reach', 'the', 'imaging', 'target', 'we', 'discuss', 'the', 'temperature', 'dependency', 'of', 'optical', 'and', 'acoustic', 'properties', 'of', 'the', 'intermediate', 'medium', 'and', 'their', 'changes', 'due', 'to', 'cooling', 'we', 'demonstrate', 'that', 'the', 'snr', 'improvement', 'of', 'the', 'photoacoustic', 'signal', 'is', 'mainly', 'due', 'to', 'the', 'reduction', 'of', 'gruneisen', 'parameter', 'of', 'the', 'intermediate', 'medium', 'which', 'leads', 'to', 'a', 'lower', 'level', 'of', 'background', 'noise', 'these', 'findings', 'may', 'open', 'new', 'possibilities', 'toward', 'the', 'application', 'of', 'biomedical', 'laser', 'refrigeration']] | [-0.09106334425701663, 0.15255536504314635, -0.06138658662254376, 0.0019026197109708626, -0.07582536352605655, -0.06806498076686443, 0.0882366700529458, 0.4001710327956344, -0.31340687405639167, -0.3203479622105329, 0.1156400101498203, -0.2567805247622189, -0.11755659849511395, 0.2337833505790231, -0.011543424735809195, 0.021856247274815267, 0.025629901142534, -0.012112727962787551, -0.032499539073765404, -0.18630214874504197, 0.26989224708863885, 0.1293133783459278, 0.3135675578578857, 0.13061789440890326, 0.09741699551071586, -0.01107877111142694, -0.03774838255626021, 0.008737623319230524, -0.1174030532519878, 0.11305173472377145, 0.2649570156916462, 0.10275351830180092, 0.2193589289913532, -0.40376454529127687, -0.27108310744094116, 0.0624552483164609, 0.15298029997161236, 0.13025129378014566, -0.08230423978891159, -0.26965479522236974, 0.04333193502930828, -0.08358612577912622, -0.1323208061341951, -0.0403742167259695, -0.020937007125306488, 0.039620984002951824, -0.2639542461437141, 0.09186558117528029, 0.04810486767433006, 0.060494643094114446, -0.11429734873095655, -0.11137959490337505, 0.010160192835208928, 0.10875292433875389, 0.03379505175639522, 0.04304545011360335, 0.19196334030029588, -0.20918011715121823, -0.05280553787978816, 0.3316773778823172, -0.08720983076712181, -0.0810365195402169, 0.22665251956867247, -0.17303241752007784, -0.05404240421846445, 0.17225109037124262, 0.1866285125122823, 0.051405508404372836, -0.10812102616282887, 0.043310198497332246, 0.035036069782579254, 0.20692738811666114, 0.06636908616677954, 0.09586033551223126, 0.15781542647164315, 0.21003872835366377, 0.020285636899141788, 0.19081765305800846, -0.1652059162292501, -0.0033904426482281296, -0.26357255261070256, -0.14174708863720298, -0.13226408950165555, 0.022877721220319128, -0.12323949227043315, -0.1275034490571325, 0.38700247145707495, 0.2579869864687147, 0.19584769582183198, -0.03841434191442737, 0.348991159469106, 0.13914149530745787, 0.0571829746216375, -0.008367702208363033, 0.3100612449242958, 0.1681657258826629, 0.1299780175563526, -0.30131772797101114, 0.05489922625691116, -0.028503542328413962] |
1,802.07115 | Calculation of apsidal precession via perturbation theory | The calculus of apsidal precession frequencies of the planets is developed by
means of a perturbation thecnique. A model of concentric rings (ring model),
suitable for improving calculations, is introduced. Conclusive remarks
concerning a comparison between the theoretical, the calculated and the
observed data of the precession frequencies are performed.
| physics.class-ph | the calculus of apsidal precession frequencies of the planets is developed by means of a perturbation thecnique a model of concentric rings ring model suitable for improving calculations is introduced conclusive remarks concerning a comparison between the theoretical the calculated and the observed data of the precession frequencies are performed | [['the', 'calculus', 'of', 'apsidal', 'precession', 'frequencies', 'of', 'the', 'planets', 'is', 'developed', 'by', 'means', 'of', 'a', 'perturbation', 'thecnique', 'a', 'model', 'of', 'concentric', 'rings', 'ring', 'model', 'suitable', 'for', 'improving', 'calculations', 'is', 'introduced', 'conclusive', 'remarks', 'concerning', 'a', 'comparison', 'between', 'the', 'theoretical', 'the', 'calculated', 'and', 'the', 'observed', 'data', 'of', 'the', 'precession', 'frequencies', 'are', 'performed']] | [-0.21337981637845252, 0.05819512694617923, -0.08648537767442818, 0.0811591902605201, -0.07607025506773166, -0.10817508586701385, 0.05019325824758532, 0.3222185230376769, -0.1904232853605431, -0.2767193476878563, 0.07459688281678424, -0.2617637190435614, -0.06843467594637555, 0.2446216098175441, -0.017230653470116004, 0.06169532405744706, 0.10281195217857556, 0.017204551843508165, -0.0749050592528466, -0.16950938299450338, 0.28105535625708195, 0.10218133309818044, 0.16190809444809445, 0.028992350422302072, 0.05400124411051142, -0.009215938503502354, -0.08113096741845413, 0.013955578207969666, -0.21189007385424813, 0.14581014907785825, 0.22270506754403516, 0.04631340484686044, 0.23073374708088076, -0.4326512913162611, -0.18794665133998711, 0.005450523686500228, 0.0715165137009201, 0.1068150463837142, -0.042791671271683, -0.30075150439325643, 0.039188281207687546, -0.17922348373246436, -0.20136269528836925, -0.08472146504387564, 0.08279874026585295, 0.029152486416302165, -0.28945010822570444, 0.07854069383192465, 0.11622218868923279, 0.14944980818435563, -0.10671536536050999, -0.10225366888453766, -0.012628076331956046, 0.06786225429184888, 0.0840411591486131, 0.00162845830509097, 0.12574166568870448, 0.0022697228254104146, -0.1673464272076226, 0.39202724351566665, -0.0845557131937572, -0.1470465287566185, 0.12521215403756622, -0.20251772553678982, -0.05560087689141534, 0.13197481179875986, 0.0961103173714055, 0.1380771793881241, -0.13871917774786754, 0.07719226325838352, -0.04268333861338241, 0.14791311880060454, 0.1326574238910511, -0.02185845807460802, 0.2734489522266145, 0.17946606854033864, -0.05787661921515662, 0.08452669584325381, -0.1275216274115504, -0.10065326073720139, -0.27758866385081593, -0.08792890144550071, -0.17345497635554294, -0.02415412699575631, -0.07880689278726076, -0.1129705239733567, 0.4211230233539732, 0.11170042165536054, 0.1942302984546642, 0.016602634884683148, 0.32038975954150817, 0.11982561613680148, 0.06114920753776571, 0.03131745538997407, 0.2950977373640148, 0.24865458947986516, 0.049044216792954475, -0.24642164701101732, 0.05415483344612377, 0.023464376981161078] |
1,802.07116 | A Social Network Analysis Framework for Modeling Health Insurance Claims
Data | Health insurance companies in Brazil have their data about claims organized
having the view only for providers. In this way, they loose the physician view
and how they share patients. Partnership between physicians can view as a
fruitful work in most of the cases but sometimes this could be a problem for
health insurance companies and patients, for example a recommendation to visit
another physician only because they work in same clinic. The focus of the work
is to better understand physicians activities and how these activities are
represented in the data. Our approach considers three aspects: the
relationships among physicians, the relationships between physicians and
patients, and the relationships between physicians and health providers. We
present the results of an analysis of a claims database (detailing 18 months of
activity) from a large health insurance company in Brazil. The main
contribution presented in this paper is a set of models to represent: mutual
referral between physicians, patient retention, and physician centrality in the
health insurance network. Our results show the proposed models based on social
network frameworks, extracted surprising insights about physicians from real
health insurance claims data.
| cs.SI | health insurance companies in brazil have their data about claims organized having the view only for providers in this way they loose the physician view and how they share patients partnership between physicians can view as a fruitful work in most of the cases but sometimes this could be a problem for health insurance companies and patients for example a recommendation to visit another physician only because they work in same clinic the focus of the work is to better understand physicians activities and how these activities are represented in the data our approach considers three aspects the relationships among physicians the relationships between physicians and patients and the relationships between physicians and health providers we present the results of an analysis of a claims database detailing 18 months of activity from a large health insurance company in brazil the main contribution presented in this paper is a set of models to represent mutual referral between physicians patient retention and physician centrality in the health insurance network our results show the proposed models based on social network frameworks extracted surprising insights about physicians from real health insurance claims data | [['health', 'insurance', 'companies', 'in', 'brazil', 'have', 'their', 'data', 'about', 'claims', 'organized', 'having', 'the', 'view', 'only', 'for', 'providers', 'in', 'this', 'way', 'they', 'loose', 'the', 'physician', 'view', 'and', 'how', 'they', 'share', 'patients', 'partnership', 'between', 'physicians', 'can', 'view', 'as', 'a', 'fruitful', 'work', 'in', 'most', 'of', 'the', 'cases', 'but', 'sometimes', 'this', 'could', 'be', 'a', 'problem', 'for', 'health', 'insurance', 'companies', 'and', 'patients', 'for', 'example', 'a', 'recommendation', 'to', 'visit', 'another', 'physician', 'only', 'because', 'they', 'work', 'in', 'same', 'clinic', 'the', 'focus', 'of', 'the', 'work', 'is', 'to', 'better', 'understand', 'physicians', 'activities', 'and', 'how', 'these', 'activities', 'are', 'represented', 'in', 'the', 'data', 'our', 'approach', 'considers', 'three', 'aspects', 'the', 'relationships', 'among', 'physicians', 'the', 'relationships', 'between', 'physicians', 'and', 'patients', 'and', 'the', 'relationships', 'between', 'physicians', 'and', 'health', 'providers', 'we', 'present', 'the', 'results', 'of', 'an', 'analysis', 'of', 'a', 'claims', 'database', 'detailing', '18', 'months', 'of', 'activity', 'from', 'a', 'large', 'health', 'insurance', 'company', 'in', 'brazil', 'the', 'main', 'contribution', 'presented', 'in', 'this', 'paper', 'is', 'a', 'set', 'of', 'models', 'to', 'represent', 'mutual', 'referral', 'between', 'physicians', 'patient', 'retention', 'and', 'physician', 'centrality', 'in', 'the', 'health', 'insurance', 'network', 'our', 'results', 'show', 'the', 'proposed', 'models', 'based', 'on', 'social', 'network', 'frameworks', 'extracted', 'surprising', 'insights', 'about', 'physicians', 'from', 'real', 'health', 'insurance', 'claims', 'data']] | [-0.03618974184306959, 0.019553618458245645, -0.0986996912736219, 0.12229820255315789, -0.12203095582308908, -0.12145654689249577, 0.1399517048380668, 0.41306481668085016, -0.1939132180235536, -0.3469463747004589, 0.12185335243071513, -0.38240776929595366, -0.18555956604895452, 0.18317030403496964, -0.19220793693420038, -0.030985509423617885, 0.11598892156502832, 0.0440544251293417, 0.04252105305542943, -0.33260533338407716, 0.27100969863828844, 0.02963283364340742, 0.33004725006502617, 0.0840621175719967, 0.027426066270674624, 0.0054199244191367475, -0.08086693355898009, -0.027078347533711286, -0.09788638315959365, 0.18450413121676773, 0.4338073648243884, 0.23802499479747244, 0.4089203117188638, -0.4473203966817843, -0.16756266037189455, 0.0968919464180039, 0.06475418117131407, 0.04786538586720193, 9.818455615824966e-05, -0.35333845443116924, 0.021243331064445474, -0.22452839170570274, -0.09238737702083888, -0.06417782676514612, 0.003231895831290376, -0.0022746979292216046, -0.25456907475495305, 0.05862330470884603, -0.01800910239576032, 0.13676662447433624, -0.09110921560219987, -0.11184224287028272, -0.04008086037910765, 0.28718810919031657, 0.16427760576415393, -0.019703793053628592, 0.15692623762571545, -0.16753469789126596, -0.17138163152147115, 0.3616747309961332, 0.0837057248009221, -0.13789686311292584, 0.1797897705042035, -0.11077216186279816, -0.17373532637037217, 0.013362941301363722, 0.25650491100235806, 0.04048403928292885, -0.2629898752002095, -0.060782650948524294, -0.023111403781782697, 0.15979787479918547, 0.07396452434677582, -0.05615471887880217, 0.20071905406398904, 0.19761886163836434, 0.015488698894389604, 0.05283189579664616, -0.01592443270791105, -0.08214987758497791, -0.23258557002474037, -0.16652006141979386, -0.1285799693010708, 0.04787106746277974, -0.0906232990930134, -0.12330783509880935, 0.3948105721667941, 0.210855605721316, 0.09718165372710222, 0.02225915502717413, 0.27053518294204004, -0.003162106334231178, 0.0842752580804425, 0.07073658927486687, 0.13800212746318527, -0.01396287840707277, 0.20059814792195405, -0.14582285287213467, 0.17775665833577808, -0.05029052483883721] |
1,802.07117 | Combining Textual Content and Structure to Improve Dialog Similarity | Chatbots, taking advantage of the success of the messaging apps and recent
advances in Artificial Intelligence, have become very popular, from helping
business to improve customer services to chatting to users for the sake of
conversation and engagement (celebrity or personal bots). However, developing
and improving a chatbot requires understanding their data generated by its
users. Dialog data has a different nature of a simple question and answering
interaction, in which context and temporal properties (turn order) creates a
different understanding of such data. In this paper, we propose a novelty
metric to compute dialogs' similarity based not only on the text content but
also on the information related to the dialog structure. Our experimental
results performed over the Switchboard dataset show that using evidence from
both textual content and the dialog structure leads to more accurate results
than using each measure in isolation.
| cs.CL | chatbots taking advantage of the success of the messaging apps and recent advances in artificial intelligence have become very popular from helping business to improve customer services to chatting to users for the sake of conversation and engagement celebrity or personal bots however developing and improving a chatbot requires understanding their data generated by its users dialog data has a different nature of a simple question and answering interaction in which context and temporal properties turn order creates a different understanding of such data in this paper we propose a novelty metric to compute dialogs similarity based not only on the text content but also on the information related to the dialog structure our experimental results performed over the switchboard dataset show that using evidence from both textual content and the dialog structure leads to more accurate results than using each measure in isolation | [['chatbots', 'taking', 'advantage', 'of', 'the', 'success', 'of', 'the', 'messaging', 'apps', 'and', 'recent', 'advances', 'in', 'artificial', 'intelligence', 'have', 'become', 'very', 'popular', 'from', 'helping', 'business', 'to', 'improve', 'customer', 'services', 'to', 'chatting', 'to', 'users', 'for', 'the', 'sake', 'of', 'conversation', 'and', 'engagement', 'celebrity', 'or', 'personal', 'bots', 'however', 'developing', 'and', 'improving', 'a', 'chatbot', 'requires', 'understanding', 'their', 'data', 'generated', 'by', 'its', 'users', 'dialog', 'data', 'has', 'a', 'different', 'nature', 'of', 'a', 'simple', 'question', 'and', 'answering', 'interaction', 'in', 'which', 'context', 'and', 'temporal', 'properties', 'turn', 'order', 'creates', 'a', 'different', 'understanding', 'of', 'such', 'data', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novelty', 'metric', 'to', 'compute', 'dialogs', 'similarity', 'based', 'not', 'only', 'on', 'the', 'text', 'content', 'but', 'also', 'on', 'the', 'information', 'related', 'to', 'the', 'dialog', 'structure', 'our', 'experimental', 'results', 'performed', 'over', 'the', 'switchboard', 'dataset', 'show', 'that', 'using', 'evidence', 'from', 'both', 'textual', 'content', 'and', 'the', 'dialog', 'structure', 'leads', 'to', 'more', 'accurate', 'results', 'than', 'using', 'each', 'measure', 'in', 'isolation']] | [-0.06463802366124582, 0.00943610582584774, -0.07855216307022299, 0.07608443623030325, -0.1762391235291337, -0.1401838611281063, 0.0858268070717006, 0.40252278950841475, -0.21291544583153962, -0.35941802517562693, 0.07276434682070329, -0.3439859632651658, -0.16012120580126066, 0.20144445751631995, -0.10368821405508141, 0.012369419897165952, 0.10021940271124347, 0.08864993623380239, -0.008049777923992628, -0.30801354403956793, 0.32685972158247345, 0.050280007197418146, 0.35441217230173705, 0.10700867645371342, 0.08812073012571393, 0.00044430556590668857, -0.08772434446695519, -0.03135389385796669, -0.06223081986723224, 0.20638168840378057, 0.3453139360293183, 0.2342115175496373, 0.3527786712479105, -0.4323281692769443, -0.19752342935276423, 0.06072102010512026, 0.14769263957229364, 0.09306488573121088, -0.09800503743190347, -0.38242059248861754, 0.10311361607940246, -0.20727746155656254, -0.00023629352411565682, -0.13124640207065064, 0.019086255924776196, -0.014762508733434111, -0.24397430021781474, -0.021148815908115164, 0.08629358921542815, 0.10863970883656293, -0.04600343660179836, -0.07104271606981961, 0.005262714375728845, 0.2347640435926021, 0.07040809439301181, 0.035872822616915476, 0.13245029485875015, -0.1987412123659548, -0.14809481665401514, 0.4197435909364786, -0.0442266484295841, -0.17985809227684513, 0.2219344693019391, -0.06019531193467426, -0.1356995540813336, 0.04009926058157968, 0.25747545214188805, 0.0750713723343021, -0.17763892206858145, -0.011171899120704943, -0.01615794610633101, 0.21715353574189875, 0.042551774628615625, 0.03968577477240211, 0.20752130373471622, 0.23144939372367743, 0.017571611310510587, 0.0628106235421405, -0.009153333903264461, -0.09082303388923821, -0.14923729450027975, -0.14555759176831393, -0.15596041559021817, 0.01767160931851524, -0.07275202470939096, -0.12313549857612492, 0.4094730398307244, 0.24027195358778247, 0.18749239073561816, 0.060671838395743784, 0.3169075591851854, 0.004343438289652113, 0.08882277190585025, 0.08732090087788594, 0.14176653492743047, -0.02050272360308251, 0.19746258045456166, -0.14869387018956737, 0.13656135073284126, 0.004770740727609437] |
1,802.07118 | Reconstruction of the two-dimensional gravitational potential of galaxy
clusters from X-ray and Sunyaev-Zel'dovich measurements | The mass of galaxy clusters is not a direct observable, nonetheless it is
commonly used to probe cosmological models. Based on the combination of all
main cluster observables, that is, the X-ray emission, the thermal
Sunyaev-Zel'dovich (SZ) signal, the velocity dispersion of the cluster
galaxies, and gravitational lensing, the gravitational potential of galaxy
clusters can be jointly reconstructed. We derive the two main ingredients
required for this joint reconstruction: the potentials individually
reconstructed from the observables and their covariance matrices, which act as
a weight in the joint reconstruction. We show here the method to derive these
quantities. The result of the joint reconstruction applied to a real cluster
will be discussed in a forthcoming paper. We apply the Richardson-Lucy
deprojection algorithm to data on a two-dimensional (2D) grid. We first test
the 2D deprojection algorithm on a $\beta$-profile. Assuming hydrostatic
equilibrium, we further reconstruct the gravitational potential of a simulated
galaxy cluster based on synthetic SZ and X-ray data. We then reconstruct the
projected gravitational potential of the massive and dynamically active cluster
Abell 2142, based on the X-ray observations collected with XMM-Newton and the
SZ observations from the Planck satellite. Finally, we compute the covariance
matrix of the projected reconstructed potential of the cluster Abell 2142 based
on the X-ray measurements collected with XMM-Newton. The gravitational
potentials of the simulated cluster recovered from synthetic X-ray and SZ data
are consistent, even though the potential reconstructed from X-rays shows
larger deviations from the true potential. Regarding Abell 2142, the projected
gravitational cluster potentials recovered from SZ and X-ray data reproduce
well the projected potential inferred from gravitational-lensing observations.
(abridged)
| astro-ph.CO | the mass of galaxy clusters is not a direct observable nonetheless it is commonly used to probe cosmological models based on the combination of all main cluster observables that is the xray emission the thermal sunyaevzeldovich sz signal the velocity dispersion of the cluster galaxies and gravitational lensing the gravitational potential of galaxy clusters can be jointly reconstructed we derive the two main ingredients required for this joint reconstruction the potentials individually reconstructed from the observables and their covariance matrices which act as a weight in the joint reconstruction we show here the method to derive these quantities the result of the joint reconstruction applied to a real cluster will be discussed in a forthcoming paper we apply the richardsonlucy deprojection algorithm to data on a twodimensional 2d grid we first test the 2d deprojection algorithm on a betaprofile assuming hydrostatic equilibrium we further reconstruct the gravitational potential of a simulated galaxy cluster based on synthetic sz and xray data we then reconstruct the projected gravitational potential of the massive and dynamically active cluster abell 2142 based on the xray observations collected with xmmnewton and the sz observations from the planck satellite finally we compute the covariance matrix of the projected reconstructed potential of the cluster abell 2142 based on the xray measurements collected with xmmnewton the gravitational potentials of the simulated cluster recovered from synthetic xray and sz data are consistent even though the potential reconstructed from xrays shows larger deviations from the true potential regarding abell 2142 the projected gravitational cluster potentials recovered from sz and xray data reproduce well the projected potential inferred from gravitationallensing observations abridged | [['the', 'mass', 'of', 'galaxy', 'clusters', 'is', 'not', 'a', 'direct', 'observable', 'nonetheless', 'it', 'is', 'commonly', 'used', 'to', 'probe', 'cosmological', 'models', 'based', 'on', 'the', 'combination', 'of', 'all', 'main', 'cluster', 'observables', 'that', 'is', 'the', 'xray', 'emission', 'the', 'thermal', 'sunyaevzeldovich', 'sz', 'signal', 'the', 'velocity', 'dispersion', 'of', 'the', 'cluster', 'galaxies', 'and', 'gravitational', 'lensing', 'the', 'gravitational', 'potential', 'of', 'galaxy', 'clusters', 'can', 'be', 'jointly', 'reconstructed', 'we', 'derive', 'the', 'two', 'main', 'ingredients', 'required', 'for', 'this', 'joint', 'reconstruction', 'the', 'potentials', 'individually', 'reconstructed', 'from', 'the', 'observables', 'and', 'their', 'covariance', 'matrices', 'which', 'act', 'as', 'a', 'weight', 'in', 'the', 'joint', 'reconstruction', 'we', 'show', 'here', 'the', 'method', 'to', 'derive', 'these', 'quantities', 'the', 'result', 'of', 'the', 'joint', 'reconstruction', 'applied', 'to', 'a', 'real', 'cluster', 'will', 'be', 'discussed', 'in', 'a', 'forthcoming', 'paper', 'we', 'apply', 'the', 'richardsonlucy', 'deprojection', 'algorithm', 'to', 'data', 'on', 'a', 'twodimensional', '2d', 'grid', 'we', 'first', 'test', 'the', '2d', 'deprojection', 'algorithm', 'on', 'a', 'betaprofile', 'assuming', 'hydrostatic', 'equilibrium', 'we', 'further', 'reconstruct', 'the', 'gravitational', 'potential', 'of', 'a', 'simulated', 'galaxy', 'cluster', 'based', 'on', 'synthetic', 'sz', 'and', 'xray', 'data', 'we', 'then', 'reconstruct', 'the', 'projected', 'gravitational', 'potential', 'of', 'the', 'massive', 'and', 'dynamically', 'active', 'cluster', 'abell', '2142', 'based', 'on', 'the', 'xray', 'observations', 'collected', 'with', 'xmmnewton', 'and', 'the', 'sz', 'observations', 'from', 'the', 'planck', 'satellite', 'finally', 'we', 'compute', 'the', 'covariance', 'matrix', 'of', 'the', 'projected', 'reconstructed', 'potential', 'of', 'the', 'cluster', 'abell', '2142', 'based', 'on', 'the', 'xray', 'measurements', 'collected', 'with', 'xmmnewton', 'the', 'gravitational', 'potentials', 'of', 'the', 'simulated', 'cluster', 'recovered', 'from', 'synthetic', 'xray', 'and', 'sz', 'data', 'are', 'consistent', 'even', 'though', 'the', 'potential', 'reconstructed', 'from', 'xrays', 'shows', 'larger', 'deviations', 'from', 'the', 'true', 'potential', 'regarding', 'abell', '2142', 'the', 'projected', 'gravitational', 'cluster', 'potentials', 'recovered', 'from', 'sz', 'and', 'xray', 'data', 'reproduce', 'well', 'the', 'projected', 'potential', 'inferred', 'from', 'gravitationallensing', 'observations', 'abridged']] | [-0.030187801851382205, 0.031091887814303238, -0.13376448820086403, 0.11309856198883304, -0.09672848786123925, -0.04359600333393448, 0.023287249731193123, 0.38977290460908853, -0.23972785946292183, -0.3199626216802884, 0.08303960186679399, -0.3056631306324292, -0.09993524475066806, 0.22177890127598032, 0.028792694208419158, 0.05691969840856338, 0.10494604799379077, -0.028318167719300145, -0.08129038431560966, -0.2815738909256955, 0.3131214089708886, 0.11057495584332004, 0.20503818306002627, -0.034260913113959963, 0.11126970729135253, 0.004528770038720082, -0.1285408819542715, 0.04308675989439642, -0.12742842664455464, 0.06659916186774219, 0.18261910166945233, 0.16017173353875816, 0.16688833954157653, -0.37081397591693394, -0.19895594705034186, 0.09016545143337377, 0.15241765945425464, 0.09627468108708315, -0.07251761947258341, -0.35762726339615053, 0.07435576501819822, -0.1669827705870072, -0.13181293190767368, 0.015491700547540354, -0.03649786517231001, 0.045100132252641575, -0.23878301482958098, 0.18840675104099017, -0.06243801937369561, 0.011656234589301878, -0.17166735419348159, -0.10557521166780066, -0.05034256613623627, 0.08624681510393405, -0.01811496393185937, 0.07306758576693634, 0.20175179559909912, -0.10474322842416801, -0.06086595445802366, 0.4101077886367286, -0.04331605612856543, -0.06381818834623253, 0.1965463008403916, -0.18494935211622052, -0.20811741072986345, 0.055813114740023456, 0.183371332751725, 0.04315355847917359, -0.1865954115866097, 0.05818734811123081, -0.030989033125202965, 0.22070276824395277, 0.03164808718116816, -0.008328502860482938, 0.2974251814807455, 0.06962185087311944, 0.05477657012158522, 0.14873804665920842, -0.2647181061665631, 0.023429759247314736, -0.2514120625849399, -0.058932436468873035, -0.24527060573153128, 0.045995954732050585, -0.13717817436398172, -0.14955043161839798, 0.3619159339366619, 0.15626189918947164, 0.20461327390296868, 0.07339234465622145, 0.3531623564488082, 0.09301666056616577, 0.07656888595040612, 0.05332261405505792, 0.2998546919578479, 0.19887898939627188, 0.06512962822517794, -0.24487549495814298, -0.006321527646569949, -0.00304506326318477] |
1,802.07119 | TRLF: An Effective Semi-fragile Watermarking Method for Tamper Detection
and Recovery based on LWT and FNN | This paper proposes a novel method for tamper detection and recovery using
semi-fragile data hiding, based on Lifting Wavelet Transform (LWT) and
Feed-Forward Neural Network (FNN). In TRLF, first, the host image is decomposed
up to one level using LWT, and the Discrete Cosine Transform (DCT) is applied
to each 2*2 blocks of diagonal details. Next, a random binary sequence is
embedded in each block as the watermark by correlating $DC$ coefficients. In
authentication stage, first, the watermarked image geometry is reconstructed by
using Speeded Up Robust Features (SURF) algorithm and extract watermark bits by
using FNN. Afterward, logical exclusive-or operation between original and
extracted watermark is applied to detect tampered region. Eventually, in the
recovery stage, tampered regions are recovered by image digest which is
generated by inverse halftoning technique. The performance and efficiency of
TRLF and its robustness against various geometric, non-geometric and hybrid
attacks are reported. From the experimental results, it can be seen that TRLF
is superior in terms of robustness and quality of the digest and watermarked
image respectively, compared to the-state-of-the-art fragile and semi-fragile
watermarking methods. In addition, imperceptibility has been improved by using
different correlation steps as the gain factor for flat (smooth) and texture
(rough) blocks.
| cs.CR cs.MM | this paper proposes a novel method for tamper detection and recovery using semifragile data hiding based on lifting wavelet transform lwt and feedforward neural network fnn in trlf first the host image is decomposed up to one level using lwt and the discrete cosine transform dct is applied to each 22 blocks of diagonal details next a random binary sequence is embedded in each block as the watermark by correlating dc coefficients in authentication stage first the watermarked image geometry is reconstructed by using speeded up robust features surf algorithm and extract watermark bits by using fnn afterward logical exclusiveor operation between original and extracted watermark is applied to detect tampered region eventually in the recovery stage tampered regions are recovered by image digest which is generated by inverse halftoning technique the performance and efficiency of trlf and its robustness against various geometric nongeometric and hybrid attacks are reported from the experimental results it can be seen that trlf is superior in terms of robustness and quality of the digest and watermarked image respectively compared to thestateoftheart fragile and semifragile watermarking methods in addition imperceptibility has been improved by using different correlation steps as the gain factor for flat smooth and texture rough blocks | [['this', 'paper', 'proposes', 'a', 'novel', 'method', 'for', 'tamper', 'detection', 'and', 'recovery', 'using', 'semifragile', 'data', 'hiding', 'based', 'on', 'lifting', 'wavelet', 'transform', 'lwt', 'and', 'feedforward', 'neural', 'network', 'fnn', 'in', 'trlf', 'first', 'the', 'host', 'image', 'is', 'decomposed', 'up', 'to', 'one', 'level', 'using', 'lwt', 'and', 'the', 'discrete', 'cosine', 'transform', 'dct', 'is', 'applied', 'to', 'each', '22', 'blocks', 'of', 'diagonal', 'details', 'next', 'a', 'random', 'binary', 'sequence', 'is', 'embedded', 'in', 'each', 'block', 'as', 'the', 'watermark', 'by', 'correlating', 'dc', 'coefficients', 'in', 'authentication', 'stage', 'first', 'the', 'watermarked', 'image', 'geometry', 'is', 'reconstructed', 'by', 'using', 'speeded', 'up', 'robust', 'features', 'surf', 'algorithm', 'and', 'extract', 'watermark', 'bits', 'by', 'using', 'fnn', 'afterward', 'logical', 'exclusiveor', 'operation', 'between', 'original', 'and', 'extracted', 'watermark', 'is', 'applied', 'to', 'detect', 'tampered', 'region', 'eventually', 'in', 'the', 'recovery', 'stage', 'tampered', 'regions', 'are', 'recovered', 'by', 'image', 'digest', 'which', 'is', 'generated', 'by', 'inverse', 'halftoning', 'technique', 'the', 'performance', 'and', 'efficiency', 'of', 'trlf', 'and', 'its', 'robustness', 'against', 'various', 'geometric', 'nongeometric', 'and', 'hybrid', 'attacks', 'are', 'reported', 'from', 'the', 'experimental', 'results', 'it', 'can', 'be', 'seen', 'that', 'trlf', 'is', 'superior', 'in', 'terms', 'of', 'robustness', 'and', 'quality', 'of', 'the', 'digest', 'and', 'watermarked', 'image', 'respectively', 'compared', 'to', 'thestateoftheart', 'fragile', 'and', 'semifragile', 'watermarking', 'methods', 'in', 'addition', 'imperceptibility', 'has', 'been', 'improved', 'by', 'using', 'different', 'correlation', 'steps', 'as', 'the', 'gain', 'factor', 'for', 'flat', 'smooth', 'and', 'texture', 'rough', 'blocks']] | [-0.05460525683584445, 0.011972783672664425, -0.08944697654349547, 0.028607843913835262, -0.031228803692832954, -0.1994435360672879, 0.0339915331729286, 0.416277702799633, -0.30185651762054905, -0.28836358412352675, 0.1624607298164811, -0.2624821623549888, -0.17691697720974667, 0.18406832528611025, -0.14159476216645642, 0.11988593099322672, 0.04795774925664505, 0.011057432914408399, -0.07393921966186277, -0.29042623584688293, 0.2556541443930245, 0.055239508544807046, 0.3437820268468475, -0.021293193267945966, 0.10325984751826207, -0.0003771270350233524, -0.07612239060964544, -0.020016687863401373, -0.0189226324975393, 0.11023637204540565, 0.29021379127573477, 0.15980607217209705, 0.21262383398396767, -0.4007848990903072, -0.18862018475706196, 0.04888366082941145, 0.15894209782652302, 0.07872560107452777, -0.07046809180881645, -0.36189345314507554, 0.19370482479651258, -0.1379549001935897, 0.024290379353652837, -0.12182449743462105, -0.00886414168795169, -0.031489300998275356, -0.26290075690942066, 0.061385892402362446, 0.07443875352413777, 0.031337211419846495, -0.0072963945048304234, -0.10282483414801605, -0.005416411480195273, 0.15507789370695166, -0.0029078198948203258, 0.08877153442924335, 0.17384647897572494, -0.10416344387739823, -0.12148317864579011, 0.3515648032839903, -0.06829852391006973, -0.2012653978879326, 0.1259623267973189, -0.022964381348049522, -0.0849365942915171, 0.17242223333439552, 0.17305697972301906, 0.07974636736174694, -0.14557120569767065, 0.020329104901939704, 0.013108075779004424, 0.2042344147156851, 0.12264096048859167, 0.030984225520845867, 0.15313381997197317, 0.16834170509879615, 0.028147420498962496, 0.20677070518300467, -0.1587824296570319, -0.014932158771747103, -0.21770997251059823, -0.12875101104374134, -0.2410330479010465, -0.040637749760849946, -0.11503409040668368, -0.105335647315894, 0.4411896512405399, 0.16126233317624486, 0.20617422657475495, 0.044660756117367535, 0.37881598843480735, 0.07016178817538471, 0.11578840464347855, 0.06889166221862622, 0.1799887470206515, 0.08999781020204811, 0.07321322689462892, -0.1409106110838954, 0.09176569592262454, 0.11410084353216614] |
1,802.0712 | The extremely truncated circumstellar disc of V410 X-ray 1: a precursor
to TRAPPIST-1? | Protoplanetary discs around brown dwarfs and very low mass stars offer some
of the best prospects for forming Earth-sized planets in their habitable zones.
To this end, we study the nature of the disc around the very low mass star V410
X-ray 1, whose SED is indicative of an optically thick and very truncated dust
disc, with our modelling suggesting an outer radius of only 0.6 au. We
investigate two scenarios that could lead to such a truncation, and find that
the observed SED is compatible with both. The first scenario involves the
truncation of both the dust and gas in the disc, perhaps due to a previous
dynamical interaction or the presence of an undetected companion. The second
scenario involves the fact that a radial location of 0.6 au is close to the
expected location of the H$_2$O snowline in the disc. As such, a combination of
efficient dust growth, radial migration, and subsequent fragmentation within
the snowline leads to an optically thick inner dust disc and larger, optically
thin outer dust disc. We find that a firm measurement of the CO $J=2$--1 line
flux would enable us to distinguish between these two scenarios, by enabling a
measurement of the radial extent of gas in the disc. Many models we consider
contain at least several Earth-masses of dust interior to 0.6 au, suggesting
that V410 X-ray 1 could be a precursor to a system with tightly-packed inner
planets, such as TRAPPIST-1.
| astro-ph.SR astro-ph.EP | protoplanetary discs around brown dwarfs and very low mass stars offer some of the best prospects for forming earthsized planets in their habitable zones to this end we study the nature of the disc around the very low mass star v410 xray 1 whose sed is indicative of an optically thick and very truncated dust disc with our modelling suggesting an outer radius of only 06 au we investigate two scenarios that could lead to such a truncation and find that the observed sed is compatible with both the first scenario involves the truncation of both the dust and gas in the disc perhaps due to a previous dynamical interaction or the presence of an undetected companion the second scenario involves the fact that a radial location of 06 au is close to the expected location of the h_2o snowline in the disc as such a combination of efficient dust growth radial migration and subsequent fragmentation within the snowline leads to an optically thick inner dust disc and larger optically thin outer dust disc we find that a firm measurement of the co j21 line flux would enable us to distinguish between these two scenarios by enabling a measurement of the radial extent of gas in the disc many models we consider contain at least several earthmasses of dust interior to 06 au suggesting that v410 xray 1 could be a precursor to a system with tightlypacked inner planets such as trappist1 | [['protoplanetary', 'discs', 'around', 'brown', 'dwarfs', 'and', 'very', 'low', 'mass', 'stars', 'offer', 'some', 'of', 'the', 'best', 'prospects', 'for', 'forming', 'earthsized', 'planets', 'in', 'their', 'habitable', 'zones', 'to', 'this', 'end', 'we', 'study', 'the', 'nature', 'of', 'the', 'disc', 'around', 'the', 'very', 'low', 'mass', 'star', 'v410', 'xray', '1', 'whose', 'sed', 'is', 'indicative', 'of', 'an', 'optically', 'thick', 'and', 'very', 'truncated', 'dust', 'disc', 'with', 'our', 'modelling', 'suggesting', 'an', 'outer', 'radius', 'of', 'only', '06', 'au', 'we', 'investigate', 'two', 'scenarios', 'that', 'could', 'lead', 'to', 'such', 'a', 'truncation', 'and', 'find', 'that', 'the', 'observed', 'sed', 'is', 'compatible', 'with', 'both', 'the', 'first', 'scenario', 'involves', 'the', 'truncation', 'of', 'both', 'the', 'dust', 'and', 'gas', 'in', 'the', 'disc', 'perhaps', 'due', 'to', 'a', 'previous', 'dynamical', 'interaction', 'or', 'the', 'presence', 'of', 'an', 'undetected', 'companion', 'the', 'second', 'scenario', 'involves', 'the', 'fact', 'that', 'a', 'radial', 'location', 'of', '06', 'au', 'is', 'close', 'to', 'the', 'expected', 'location', 'of', 'the', 'h_2o', 'snowline', 'in', 'the', 'disc', 'as', 'such', 'a', 'combination', 'of', 'efficient', 'dust', 'growth', 'radial', 'migration', 'and', 'subsequent', 'fragmentation', 'within', 'the', 'snowline', 'leads', 'to', 'an', 'optically', 'thick', 'inner', 'dust', 'disc', 'and', 'larger', 'optically', 'thin', 'outer', 'dust', 'disc', 'we', 'find', 'that', 'a', 'firm', 'measurement', 'of', 'the', 'co', 'j21', 'line', 'flux', 'would', 'enable', 'us', 'to', 'distinguish', 'between', 'these', 'two', 'scenarios', 'by', 'enabling', 'a', 'measurement', 'of', 'the', 'radial', 'extent', 'of', 'gas', 'in', 'the', 'disc', 'many', 'models', 'we', 'consider', 'contain', 'at', 'least', 'several', 'earthmasses', 'of', 'dust', 'interior', 'to', '06', 'au', 'suggesting', 'that', 'v410', 'xray', '1', 'could', 'be', 'a', 'precursor', 'to', 'a', 'system', 'with', 'tightlypacked', 'inner', 'planets', 'such', 'as', 'trappist1']] | [-0.08446543001303303, 0.09859151110146387, -0.05189502763962142, 0.06378336734627181, -0.06177783074446238, -0.061495736474652334, 0.03881886218047185, 0.3967194187604968, -0.2064964089365599, -0.33155088622338513, 0.09166889034850477, -0.24288819435491296, -0.028095889412259205, 0.16615557619505217, -0.061194855097319534, -0.010578186595658502, 0.04364593555161745, -0.11560310186406458, -0.044822925119660795, -0.20445025681271717, 0.32078265412402734, 0.08462387775607341, 0.04640757506578576, 0.013675218601018375, 0.008431903766333472, -0.12001216633356954, -0.02618380317133505, -0.07694450593293714, -0.17956399002999635, 0.07008039073687632, 0.22082844757555115, 0.07389550764413844, 0.23579998736458346, -0.41079271758410096, -0.22334465377556145, 0.053275535563353356, 0.1904997406859328, 0.029481445389130147, -0.037841229443149715, -0.19927801883948798, 0.08279430527963545, -0.22385067845625448, -0.21110842407350083, 0.06554680118579725, 0.0681173996730469, -0.04428403281625014, -0.2713334001439589, 0.10643141243216189, 0.10511664949943916, 0.0713406788745187, -0.13259083178848768, -0.10948231273228765, -0.08781376541188095, 0.06362852219526834, 0.0355258372223605, 0.05194717076172175, 0.22979842818319057, -0.10786618956572507, -0.016091833786831107, 0.39261354460411757, -0.10397181615535524, -0.04891703916571203, 0.3045461551047677, -0.2507662075958484, -0.10151317252340719, 0.17391948767914628, 0.14609017524837462, 0.15081188934547288, -0.1259967286124333, -0.010229199424564977, -0.05390041359567491, 0.2274394029759117, 0.09408726310453662, 0.04090109149817654, 0.4205209109316434, 0.13763951783778997, 0.06638909903069196, 0.1052385615218577, -0.24112313626957518, -0.07242557442504605, -0.21388948819800166, -0.15049442871904756, -0.13155997743876266, 0.060346700693673094, -0.14266720401329538, -0.15850539276114672, 0.29127578593142067, 0.1187929923016932, 0.27077102107125767, 0.012335978150136831, 0.3032870201282357, 0.05936882998707727, 0.10996503696857744, 0.13023996093283477, 0.3228996277654261, 0.13471583689636096, 0.08259251749453045, -0.2483922661704729, 0.09675076290722628, -0.02798215674971469] |
1,802.07121 | Collective Yu-Shiba-Rusinov states in magnetic clusters at
superconducting surfaces | We study the properties of collective Yu-Shiba-Rusinov (YSR) states generated
by multiple magnetic adatoms (clusters) placed on the surface of a
superconductor. For magnetic clusters with equal distances between their
constituents, we demonstrate the formation of effectively spin-unpolarized YSR
states with subgap energies independent of the spin configuration of the
magnetic impurities. We solve the problem analytically for arbitrary spin
structure and analyze both spin-polarized (dispersive energy levels) and
spin-unpolarized (pinned energy levels) solutions. While the energies of the
spin-polarized solutions can be characterized solely by the net magnetic moment
of the cluster, the wave functions of the spin-unpolarized solutions
effectively decouple from it. This decoupling makes them stable against thermal
fluctuation and detectable in scanning tunneling microscopy experiments.
| cond-mat.supr-con cond-mat.mes-hall | we study the properties of collective yushibarusinov ysr states generated by multiple magnetic adatoms clusters placed on the surface of a superconductor for magnetic clusters with equal distances between their constituents we demonstrate the formation of effectively spinunpolarized ysr states with subgap energies independent of the spin configuration of the magnetic impurities we solve the problem analytically for arbitrary spin structure and analyze both spinpolarized dispersive energy levels and spinunpolarized pinned energy levels solutions while the energies of the spinpolarized solutions can be characterized solely by the net magnetic moment of the cluster the wave functions of the spinunpolarized solutions effectively decouple from it this decoupling makes them stable against thermal fluctuation and detectable in scanning tunneling microscopy experiments | [['we', 'study', 'the', 'properties', 'of', 'collective', 'yushibarusinov', 'ysr', 'states', 'generated', 'by', 'multiple', 'magnetic', 'adatoms', 'clusters', 'placed', 'on', 'the', 'surface', 'of', 'a', 'superconductor', 'for', 'magnetic', 'clusters', 'with', 'equal', 'distances', 'between', 'their', 'constituents', 'we', 'demonstrate', 'the', 'formation', 'of', 'effectively', 'spinunpolarized', 'ysr', 'states', 'with', 'subgap', 'energies', 'independent', 'of', 'the', 'spin', 'configuration', 'of', 'the', 'magnetic', 'impurities', 'we', 'solve', 'the', 'problem', 'analytically', 'for', 'arbitrary', 'spin', 'structure', 'and', 'analyze', 'both', 'spinpolarized', 'dispersive', 'energy', 'levels', 'and', 'spinunpolarized', 'pinned', 'energy', 'levels', 'solutions', 'while', 'the', 'energies', 'of', 'the', 'spinpolarized', 'solutions', 'can', 'be', 'characterized', 'solely', 'by', 'the', 'net', 'magnetic', 'moment', 'of', 'the', 'cluster', 'the', 'wave', 'functions', 'of', 'the', 'spinunpolarized', 'solutions', 'effectively', 'decouple', 'from', 'it', 'this', 'decoupling', 'makes', 'them', 'stable', 'against', 'thermal', 'fluctuation', 'and', 'detectable', 'in', 'scanning', 'tunneling', 'microscopy', 'experiments']] | [-0.20273219556899882, 0.2283117617128276, -0.03940478055698782, 0.10950964392933744, 0.016199175131452435, -0.10801943661958105, 0.09791905297741231, 0.35948632140996073, -0.2822721821819471, -0.3234929610435076, -0.030754385728334242, -0.3232545662825896, -0.06123899095965659, 0.1456034732356417, 0.11311002993690115, 0.005527867751681253, 0.034690100357265156, -0.022015151235141923, -0.06007186904893953, -0.20952915989093387, 0.3470500084657629, 0.030057289293270652, 0.33078464749856157, 0.09592650437477131, 0.06253911431941415, 0.020836547529716202, 0.11125783911444434, 0.03702024254603546, -0.13407117266700985, 0.07719297926509049, 0.23447075163742073, -0.057034414869641684, 0.17352896710239477, -0.5440161145221787, -0.18298922138711235, 0.03851305548211231, 0.16159286203661136, 0.18125343493170284, -0.04148054984300358, -0.34066546182422075, 0.04764479920444149, -0.1305380710889781, -0.1620759551311616, -0.11256002320148864, -0.044577918598475326, 0.06676738705640628, -0.21522524527385595, 0.13666827366061257, 0.02403626197894268, 0.0013969348383550885, -0.1706347545734098, -0.08734217059931584, -0.10166157565339852, 0.06828080183834213, 0.05283907288401128, -0.013761378200568197, 0.1681739181992324, -0.14955105363320903, -0.11333183075708314, 0.2818821761287561, -0.03990329733165372, -0.1527633965426289, 0.19088791385136483, -0.15585935908612333, -0.052178420318181026, 0.15565612421864095, 0.10887413994338707, 0.1445122596870388, -0.1369105322260073, 0.08896631682379672, 0.0034576400395672567, 0.16717662916424833, 0.09721438775128614, 0.09357164044152289, 0.28268766521374467, 0.14482263065365872, 0.10044128218462237, 0.15222761931901546, -0.16039139458918436, -0.04794265982937537, -0.19974326035213275, -0.12279385296596575, -0.2270738428317699, 0.06658676331664705, -0.03667130174094267, -0.17871431032970486, 0.432731188685015, 0.12585701203725042, 0.16940389981321177, -0.0451204850095786, 0.29021372493873, 0.14701667585324088, 0.056021190354573154, 0.0685375192507851, 0.22537108662561708, 0.18101179009272145, 0.06423636055707994, -0.34185846372382295, 0.02478686653218475, -0.0002802724680010261] |
1,802.07122 | Reproducing kernel orthogonal polynomials on the multinomial
distribution | Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials
orthogonal on the multinomial distribution.
In this paper we derive the reproducing kernel orthogonal polynomials
Q_n(x,y};N,p) on the multinomial distribution which are sums of products of
orthonormal polynomials in x and y of fixed total degree n=0,1,.., N.
sum_{n=0}^N rho^nQ_n(x,y);N,p) arises naturally from a probabilistic argument.
An application to a multinomial goodness of fit test is developed, where the
chi-squared test statistic is decomposed into orthogonal components which test
the order of fit. A new duplication formula for the reproducing kernel
polynomials in terms of the 1-dimensional Krawtchouk polynomials is derived.
The duplication formula allows a Lancaster characterization of all reversible
Markov chains with a multinomial stationary distribution whose eigenvectors are
multivariate Krawtchouk polynomials and where eigenvalues are repeated within
the same total degree. The \chi^2 cutoff time, and total variation cutoff time
is investigated in such chains.
Emphasis throughout the paper is on a probabilistic understanding of the
polynomials and their applications, particularly to Markov chains.
| math.PR | diaconis and griffiths 2014 study the multivariate krawtchouk polynomials orthogonal on the multinomial distribution in this paper we derive the reproducing kernel orthogonal polynomials q_nxynp on the multinomial distribution which are sums of products of orthonormal polynomials in x and y of fixed total degree n01 n sum_n0n rhonq_nxynp arises naturally from a probabilistic argument an application to a multinomial goodness of fit test is developed where the chisquared test statistic is decomposed into orthogonal components which test the order of fit a new duplication formula for the reproducing kernel polynomials in terms of the 1dimensional krawtchouk polynomials is derived the duplication formula allows a lancaster characterization of all reversible markov chains with a multinomial stationary distribution whose eigenvectors are multivariate krawtchouk polynomials and where eigenvalues are repeated within the same total degree the chi2 cutoff time and total variation cutoff time is investigated in such chains emphasis throughout the paper is on a probabilistic understanding of the polynomials and their applications particularly to markov chains | [['diaconis', 'and', 'griffiths', '2014', 'study', 'the', 'multivariate', 'krawtchouk', 'polynomials', 'orthogonal', 'on', 'the', 'multinomial', 'distribution', 'in', 'this', 'paper', 'we', 'derive', 'the', 'reproducing', 'kernel', 'orthogonal', 'polynomials', 'q_nxynp', 'on', 'the', 'multinomial', 'distribution', 'which', 'are', 'sums', 'of', 'products', 'of', 'orthonormal', 'polynomials', 'in', 'x', 'and', 'y', 'of', 'fixed', 'total', 'degree', 'n01', 'n', 'sum_n0n', 'rhonq_nxynp', 'arises', 'naturally', 'from', 'a', 'probabilistic', 'argument', 'an', 'application', 'to', 'a', 'multinomial', 'goodness', 'of', 'fit', 'test', 'is', 'developed', 'where', 'the', 'chisquared', 'test', 'statistic', 'is', 'decomposed', 'into', 'orthogonal', 'components', 'which', 'test', 'the', 'order', 'of', 'fit', 'a', 'new', 'duplication', 'formula', 'for', 'the', 'reproducing', 'kernel', 'polynomials', 'in', 'terms', 'of', 'the', '1dimensional', 'krawtchouk', 'polynomials', 'is', 'derived', 'the', 'duplication', 'formula', 'allows', 'a', 'lancaster', 'characterization', 'of', 'all', 'reversible', 'markov', 'chains', 'with', 'a', 'multinomial', 'stationary', 'distribution', 'whose', 'eigenvectors', 'are', 'multivariate', 'krawtchouk', 'polynomials', 'and', 'where', 'eigenvalues', 'are', 'repeated', 'within', 'the', 'same', 'total', 'degree', 'the', 'chi2', 'cutoff', 'time', 'and', 'total', 'variation', 'cutoff', 'time', 'is', 'investigated', 'in', 'such', 'chains', 'emphasis', 'throughout', 'the', 'paper', 'is', 'on', 'a', 'probabilistic', 'understanding', 'of', 'the', 'polynomials', 'and', 'their', 'applications', 'particularly', 'to', 'markov', 'chains']] | [-0.11752225200365657, 0.08600774239486246, -0.10622745739193233, 0.0912959839965851, -0.07224554175859535, -0.1315792135357217, 0.033210508064709696, 0.35482380614741676, -0.28767249040574155, -0.21390180708554807, 0.0901758162493309, -0.2306501514956311, -0.11890649133464722, 0.1501714998779053, -0.07450391945680546, 0.08931042212261561, 0.04574597875324815, 0.03760000526836496, -0.08436849661242142, -0.2708106407084348, 0.28116729213610475, 0.0757418077701897, 0.268533348235833, -0.06365951348918895, 0.11519179374845184, 0.0516349962581109, -0.08610613521494177, -0.09558484466186513, -0.11086468181452869, 0.11727244760612586, 0.26468739945132946, 0.1442756944541688, 0.2522767426137544, -0.3399597822797079, -0.1380524433337929, 0.2007518924967003, 0.1510117547872242, 0.002979962742298933, 0.056269345211545065, -0.24380752597392702, -0.008899925108084832, -0.1670359745837728, -0.1567121602589853, -0.06936865911870463, 0.016017819895120508, 0.1146507814792242, -0.36178881088785964, 0.08672144272410386, 0.1075687226567966, 0.11653656702762916, 0.006497681586206119, -0.20672577449286278, 0.015751744169124796, 0.037919556333517734, 0.038917556815020786, -0.01541553505559229, 0.050361727271157605, -0.049315210916044794, -0.12328603071234892, 0.3387567416344844, -0.03929411538053829, -0.25375428377576403, 0.10718739164587499, -0.18588083120494328, -0.18702391186226275, 0.09947052149407772, 0.17374096717256937, 0.1250868477327235, -0.14977021395668752, 0.13003315901250914, -0.11256276090497985, 0.10005073260195965, 0.13144753018445535, -0.009632444646255187, 0.15661940812933162, 0.05275315552538524, 0.013203386978295909, 0.18781551724425488, -0.04497503055733817, -0.15590448364718285, -0.309240462589849, -0.19457248541915023, -0.2513886414921094, 0.04676481878007848, -0.1930730493936189, -0.22000231139327578, 0.43097687642907073, 0.06844274068902606, 0.21769816505842687, 0.13775360765524117, 0.2258365352415234, 0.17017082059241695, -0.0004279571456800392, 0.040732081333872364, 0.06114169036858127, 0.23230347636675724, 0.029378273875732545, -0.14459656649219169, 0.10484778614246223, 0.13094411159871272] |
1,802.07123 | Building Large Free Subshifts Using the Local Lemma | Gao, Jackson, and Seward proved that every countably infinite group $\Gamma$
admits a nonempty free subshift $X \subseteq 2^\Gamma$. Here we strengthen this
result by showing that free subshifts can be "large" in various senses.
Specifically, we prove that for any $k \geqslant 2$ and $h < \log_2 k$, there
exists a free subshift $X \subseteq k^\Gamma$ of Hausdorff dimension and, if
$\Gamma$ is sofic, entropy at least $h$, answering two questions attributed by
Gao, Jackson, and Seward to Juan Souto. Furthermore, we establish a general
lower bound on the largest "size" of a free subshift $X'$ contained inside a
given subshift $X$. A central role in our arguments is played by the Lov\'{a}sz
Local Lemma, an important tool in probabilistic combinatorics, whose relevance
to the problem of finding free subshifts was first recognized by Aubrun,
Barbieri, and Thomass\'{e}.
| math.DS math.CO | gao jackson and seward proved that every countably infinite group gamma admits a nonempty free subshift x subseteq 2gamma here we strengthen this result by showing that free subshifts can be large in various senses specifically we prove that for any k geqslant 2 and h log_2 k there exists a free subshift x subseteq kgamma of hausdorff dimension and if gamma is sofic entropy at least h answering two questions attributed by gao jackson and seward to juan souto furthermore we establish a general lower bound on the largest size of a free subshift x contained inside a given subshift x a central role in our arguments is played by the lovasz local lemma an important tool in probabilistic combinatorics whose relevance to the problem of finding free subshifts was first recognized by aubrun barbieri and thomasse | [['gao', 'jackson', 'and', 'seward', 'proved', 'that', 'every', 'countably', 'infinite', 'group', 'gamma', 'admits', 'a', 'nonempty', 'free', 'subshift', 'x', 'subseteq', '2gamma', 'here', 'we', 'strengthen', 'this', 'result', 'by', 'showing', 'that', 'free', 'subshifts', 'can', 'be', 'large', 'in', 'various', 'senses', 'specifically', 'we', 'prove', 'that', 'for', 'any', 'k', 'geqslant', '2', 'and', 'h', 'log_2', 'k', 'there', 'exists', 'a', 'free', 'subshift', 'x', 'subseteq', 'kgamma', 'of', 'hausdorff', 'dimension', 'and', 'if', 'gamma', 'is', 'sofic', 'entropy', 'at', 'least', 'h', 'answering', 'two', 'questions', 'attributed', 'by', 'gao', 'jackson', 'and', 'seward', 'to', 'juan', 'souto', 'furthermore', 'we', 'establish', 'a', 'general', 'lower', 'bound', 'on', 'the', 'largest', 'size', 'of', 'a', 'free', 'subshift', 'x', 'contained', 'inside', 'a', 'given', 'subshift', 'x', 'a', 'central', 'role', 'in', 'our', 'arguments', 'is', 'played', 'by', 'the', 'lovasz', 'local', 'lemma', 'an', 'important', 'tool', 'in', 'probabilistic', 'combinatorics', 'whose', 'relevance', 'to', 'the', 'problem', 'of', 'finding', 'free', 'subshifts', 'was', 'first', 'recognized', 'by', 'aubrun', 'barbieri', 'and', 'thomasse']] | [-0.1709022012884974, 0.18896914322017372, -0.0561403500361611, 0.08687843324066531, -0.037125629035459046, -0.217635753011142, 0.11405256126106353, 0.32042425780462613, -0.3295355530698662, -0.19437405947541844, 0.055435721456255437, -0.3216333973805245, -0.11452137508794018, 0.2109436497507293, -0.15691903431602902, -0.011805356721342305, 0.04039257448976454, 0.07655557487969814, -0.016679758950055617, -0.2731895552664671, 0.3052339165562602, -0.028793289916643847, 0.18979814914190143, 0.11532230121825916, 0.09401448315812572, 0.017609413834693638, -0.0201761762356804, 0.021776207884692627, -0.25577600616568397, 0.09000140177786174, 0.29777493139566935, 0.1523271434184542, 0.30389560032905877, -0.27680232509716746, -0.18883418783282294, 0.20677637810687252, 0.13235799724782776, -0.043571046499562435, -0.04693810870083035, -0.2573747764142446, 0.16386692942646536, -0.16226469738192964, -0.141551816009282, -0.017228571721690074, 0.1730263820592908, -0.0252151216643498, -0.25659786686436203, 0.02320601625631199, 0.19673607433619705, 0.10405315524237095, 0.007516148236522829, -0.12434898413957327, -0.0833401156874522, 0.07676706880084712, -0.03554398122756486, 0.12038276206863963, 0.042349329602523314, 0.012379534928924471, -0.16546470275826994, 0.3255293828037068, -0.0855158155520811, -0.1902110367503854, 0.1422687836457044, -0.16399163464286728, -0.21010021118960087, 0.14177102530358252, 0.05461531991570972, 0.14362744537546582, -0.08447868092849418, 0.24756458973085196, -0.18131466992739317, 0.14922037463216786, 0.15279130299535135, 0.006819091327707755, 0.08585625932808372, 0.09165645005734827, 0.10592822757536087, 0.14878063494984087, 0.04532923286551259, 0.047399352986257574, -0.3046803046962705, -0.14521609119728437, -0.1902497458723846, 0.16119697630452667, -0.11529619434451518, -0.15204597308394918, 0.26874604752368253, 0.059619153608514025, 0.14228057200291558, 0.08004715731890494, 0.14282690725319655, 0.07519151065987872, -0.01524372403661761, 0.162285599875495, 0.052231337084262836, 0.19164039074119343, -0.058263695859552725, -0.15404613232375056, 0.07314500204866171, 0.2487001218630568] |
1,802.07124 | Out-distribution training confers robustness to deep neural networks | The easiness at which adversarial instances can be generated in deep neural
networks raises some fundamental questions on their functioning and concerns on
their use in critical systems. In this paper, we draw a connection between
over-generalization and adversaries: a possible cause of adversaries lies in
models designed to make decisions all over the input space, leading to
inappropriate high-confidence decisions in parts of the input space not
represented in the training set. We empirically show an augmented neural
network, which is not trained on any types of adversaries, can increase the
robustness by detecting black-box one-step adversaries, i.e. assimilated to
out-distribution samples, and making generation of white-box one-step
adversaries harder.
| cs.LG stat.ML | the easiness at which adversarial instances can be generated in deep neural networks raises some fundamental questions on their functioning and concerns on their use in critical systems in this paper we draw a connection between overgeneralization and adversaries a possible cause of adversaries lies in models designed to make decisions all over the input space leading to inappropriate highconfidence decisions in parts of the input space not represented in the training set we empirically show an augmented neural network which is not trained on any types of adversaries can increase the robustness by detecting blackbox onestep adversaries ie assimilated to outdistribution samples and making generation of whitebox onestep adversaries harder | [['the', 'easiness', 'at', 'which', 'adversarial', 'instances', 'can', 'be', 'generated', 'in', 'deep', 'neural', 'networks', 'raises', 'some', 'fundamental', 'questions', 'on', 'their', 'functioning', 'and', 'concerns', 'on', 'their', 'use', 'in', 'critical', 'systems', 'in', 'this', 'paper', 'we', 'draw', 'a', 'connection', 'between', 'overgeneralization', 'and', 'adversaries', 'a', 'possible', 'cause', 'of', 'adversaries', 'lies', 'in', 'models', 'designed', 'to', 'make', 'decisions', 'all', 'over', 'the', 'input', 'space', 'leading', 'to', 'inappropriate', 'highconfidence', 'decisions', 'in', 'parts', 'of', 'the', 'input', 'space', 'not', 'represented', 'in', 'the', 'training', 'set', 'we', 'empirically', 'show', 'an', 'augmented', 'neural', 'network', 'which', 'is', 'not', 'trained', 'on', 'any', 'types', 'of', 'adversaries', 'can', 'increase', 'the', 'robustness', 'by', 'detecting', 'blackbox', 'onestep', 'adversaries', 'ie', 'assimilated', 'to', 'outdistribution', 'samples', 'and', 'making', 'generation', 'of', 'whitebox', 'onestep', 'adversaries', 'harder']] | [-0.1095804539404239, 0.03581605686689203, -0.01803656261800243, 0.10005382660709254, -0.10190064272096565, -0.20000454371266468, 0.11859211592561658, 0.42820833044479023, -0.2970492073024313, -0.319829078324072, 0.07604004790679224, -0.2567371170095227, -0.18777707666011845, 0.1896678416162251, -0.18416453251376044, 0.08396494738875074, 0.04314714171797843, 0.022546000049768335, -0.017269465426792734, -0.3364368294793609, 0.3605202593135874, 0.038795449584040805, 0.2765234046791856, -0.004587513616996574, 0.1007632328939901, -0.025591538458127058, 0.0007451026205409755, -0.0021819797913996955, -0.01862127599012744, 0.13579895018457291, 0.31760084354843726, 0.18937727975499657, 0.3576774562516057, -0.45054507425038126, -0.21990704153001578, 0.18572623582938602, 0.12160991862634415, 0.12336858129128814, 0.002936242286719986, -0.34249509243412063, 0.11746412582343092, -0.15628527927103344, -0.03508520278207085, -0.12578764575038542, -0.04911622984611706, -0.0046612933773111116, -0.2629294823771259, -0.039970792905503025, 0.084219078850085, 0.05523756268640837, -0.025550943992293632, -0.03692449778654017, -0.01255822928726195, 0.18399261998281152, 0.037101473715911444, 0.013291224547838038, 0.13046687158393078, -0.19745545137279272, -0.15900319270571475, 0.3511353765555599, 0.010793929451841626, -0.20956617973635797, 0.19691232447973914, -0.031063935606161486, -0.13557874700809652, 0.08218708490063478, 0.2654683465549202, 0.10937624222437457, -0.1241238591856919, 0.016488836921420082, -0.006067628913500288, 0.20854760803752118, 0.05266867996705277, 0.015606260841695575, 0.18791071522397804, 0.19023872370756156, 0.04646367324686081, 0.1566901025897194, -0.05947233228482776, -0.07236263985894537, -0.2615185656861679, -0.09581948008791015, -0.18945008111165348, 0.04155906593151231, -0.0727408044749445, -0.15566455803366866, 0.3644123932447385, 0.2508634029896007, 0.2100091544347018, 0.1213961407407984, 0.3270805038109019, 0.01811680259712162, 0.0950636753145404, 0.1491936658181854, 0.21912688174760095, 0.029421218308024445, 0.07782623595411277, -0.12713059618112607, 0.19212398439780012, -0.0020719037432148047] |
1,802.07125 | Functions of bounded fractional variation and fractal currents | Extending the notion of bounded variation, a function $u \in L_c^1(\mathbb
R^n)$ is of bounded fractional variation with respect to some exponent $\alpha$
if there is a finite constant $C \geq 0$ such that the estimate \[ \biggl|\int
u(x) \det D(f,g_1,\dots,g_{n-1})_x \, dx\biggr| \leq
C\operatorname{Lip}^\alpha(f) \operatorname{Lip}(g_1) \cdots
\operatorname{Lip}(g_{n-1}) \] holds for all Lipschitz functions
$f,g_1,\dots,g_{n-1}$ on $\mathbb R^n$. Among such functions are characteristic
functions of domains with fractal boundaries and H\"older continuous functions.
We characterize functions of bounded fractional variation as a certain subspace
of Whitney's flat chains and as multilinear functionals in the setting of
Ambrosio-Kirchheim currents. Consequently we discuss extensions to H\"older
differential forms, higher integrability, an isoperimetric inequality, a Lusin
type property and change of variables. As an application we obtain sharp
integrability results for Brouwer degree functions with respect to H\"older
maps defined on domains with fractal boundaries.
| math.FA math.MG | extending the notion of bounded variation a function u in l_c1mathbb rn is of bounded fractional variation with respect to some exponent alpha if there is a finite constant c geq 0 such that the estimate bigglint ux det dfg_1dotsg_n1_x dxbiggr leq coperatornamelipalphaf operatornamelipg_1 cdots operatornamelipg_n1 holds for all lipschitz functions fg_1dotsg_n1 on mathbb rn among such functions are characteristic functions of domains with fractal boundaries and holder continuous functions we characterize functions of bounded fractional variation as a certain subspace of whitneys flat chains and as multilinear functionals in the setting of ambrosiokirchheim currents consequently we discuss extensions to holder differential forms higher integrability an isoperimetric inequality a lusin type property and change of variables as an application we obtain sharp integrability results for brouwer degree functions with respect to holder maps defined on domains with fractal boundaries | [['extending', 'the', 'notion', 'of', 'bounded', 'variation', 'a', 'function', 'u', 'in', 'l_c1mathbb', 'rn', 'is', 'of', 'bounded', 'fractional', 'variation', 'with', 'respect', 'to', 'some', 'exponent', 'alpha', 'if', 'there', 'is', 'a', 'finite', 'constant', 'c', 'geq', '0', 'such', 'that', 'the', 'estimate', 'bigglint', 'ux', 'det', 'dfg_1dotsg_n1_x', 'dxbiggr', 'leq', 'coperatornamelipalphaf', 'operatornamelipg_1', 'cdots', 'operatornamelipg_n1', 'holds', 'for', 'all', 'lipschitz', 'functions', 'fg_1dotsg_n1', 'on', 'mathbb', 'rn', 'among', 'such', 'functions', 'are', 'characteristic', 'functions', 'of', 'domains', 'with', 'fractal', 'boundaries', 'and', 'holder', 'continuous', 'functions', 'we', 'characterize', 'functions', 'of', 'bounded', 'fractional', 'variation', 'as', 'a', 'certain', 'subspace', 'of', 'whitneys', 'flat', 'chains', 'and', 'as', 'multilinear', 'functionals', 'in', 'the', 'setting', 'of', 'ambrosiokirchheim', 'currents', 'consequently', 'we', 'discuss', 'extensions', 'to', 'holder', 'differential', 'forms', 'higher', 'integrability', 'an', 'isoperimetric', 'inequality', 'a', 'lusin', 'type', 'property', 'and', 'change', 'of', 'variables', 'as', 'an', 'application', 'we', 'obtain', 'sharp', 'integrability', 'results', 'for', 'brouwer', 'degree', 'functions', 'with', 'respect', 'to', 'holder', 'maps', 'defined', 'on', 'domains', 'with', 'fractal', 'boundaries']] | [-0.15704485020628697, 0.08189127764701026, -0.011903084178263221, 0.08351666503941342, -0.06956257466946636, -0.1493789899440212, -0.021556307758979557, 0.371123030013938, -0.35846879737067766, -0.15182800839818617, 0.1284447536174606, -0.3203944564256675, -0.13063896090398322, 0.20937432985013452, -0.11006969908067515, 0.080199618710077, -0.07081641547225473, 0.02783670813069174, -0.14842569239025238, -0.21654101467303905, 0.3809398984010438, -0.13186021862935474, 0.1770678698049702, 0.08427732664281289, 0.10349403152085453, -0.009111978159861938, 0.017447840049151928, 0.002796466846218091, -0.24307336542029548, 0.1169222658042412, 0.20657309243910527, 0.0868215516266477, 0.2917437546438616, -0.3324300066091632, -0.20033165826533303, 0.21448627519883387, 0.1141507476888142, -0.07670207792992582, 0.00336014362627939, -0.28346746828662983, 0.10700021722560166, -0.08400923109229899, -0.2350841492791269, -0.07357853638960887, 0.09940831485748262, 0.13146182783090204, -0.32270187267479095, 0.11075655063827529, 0.12134525160045712, 0.0978429697930301, -0.14661779803870859, -0.13306175028898162, -0.0514457788378825, 0.07121399374863574, 0.005200617879145701, 0.13883626094631824, 0.08853927709674107, -0.08471284282859415, -0.11578484579568857, 0.28143959031760235, -0.1063019914182884, -0.32172413022819024, 0.14193078632757977, -0.2319301187224288, -0.16063786632886143, 0.049584203975573754, 0.12333150185957437, 0.15120186598416957, -0.07601226461724243, 0.22036225279972654, -0.05239465997646783, 0.13831945192353187, 0.14409921096125974, 0.08846594059559026, 0.029912477641771653, 0.054983390687133066, 0.20949055068550332, 0.17411816550440062, 0.021890397453751726, -0.046176544379954804, -0.3966686537503514, -0.16231429413359127, -0.18490804498748611, 0.12406019783998264, -0.182299537971311, -0.23796975257884684, 0.3349047188597326, 0.017792872188769224, 0.19156542690541908, 0.1560942650921927, 0.14304883592541665, 0.1494412761624149, 0.037931875815394665, 0.07106108253978136, 0.07843409013114194, 0.18351880824442185, 0.07640155549747656, -0.09967190713643004, 0.06653946100286286, 0.14419367870430103] |
1,802.07126 | On Estimating Multi-Attribute Choice Preferences using Private Signals
and Matrix Factorization | Revealed preference theory studies the possibility of modeling an agent's
revealed preferences and the construction of a consistent utility function.
However, modeling agent's choices over preference orderings is not always
practical and demands strong assumptions on human rationality and
data-acquisition abilities. Therefore, we propose a simple generative choice
model where agents are assumed to generate the choice probabilities based on
latent factor matrices that capture their choice evaluation across multiple
attributes. Since the multi-attribute evaluation is typically hidden within the
agent's psyche, we consider a signaling mechanism where agents are provided
with choice information through private signals, so that the agent's choices
provide more insight about his/her latent evaluation across multiple
attributes. We estimate the choice model via a novel multi-stage matrix
factorization algorithm that minimizes the average deviation of the factor
estimates from choice data. Simulation results are presented to validate the
estimation performance of our proposed algorithm.
| stat.ML cs.LG | revealed preference theory studies the possibility of modeling an agents revealed preferences and the construction of a consistent utility function however modeling agents choices over preference orderings is not always practical and demands strong assumptions on human rationality and dataacquisition abilities therefore we propose a simple generative choice model where agents are assumed to generate the choice probabilities based on latent factor matrices that capture their choice evaluation across multiple attributes since the multiattribute evaluation is typically hidden within the agents psyche we consider a signaling mechanism where agents are provided with choice information through private signals so that the agents choices provide more insight about hisher latent evaluation across multiple attributes we estimate the choice model via a novel multistage matrix factorization algorithm that minimizes the average deviation of the factor estimates from choice data simulation results are presented to validate the estimation performance of our proposed algorithm | [['revealed', 'preference', 'theory', 'studies', 'the', 'possibility', 'of', 'modeling', 'an', 'agents', 'revealed', 'preferences', 'and', 'the', 'construction', 'of', 'a', 'consistent', 'utility', 'function', 'however', 'modeling', 'agents', 'choices', 'over', 'preference', 'orderings', 'is', 'not', 'always', 'practical', 'and', 'demands', 'strong', 'assumptions', 'on', 'human', 'rationality', 'and', 'dataacquisition', 'abilities', 'therefore', 'we', 'propose', 'a', 'simple', 'generative', 'choice', 'model', 'where', 'agents', 'are', 'assumed', 'to', 'generate', 'the', 'choice', 'probabilities', 'based', 'on', 'latent', 'factor', 'matrices', 'that', 'capture', 'their', 'choice', 'evaluation', 'across', 'multiple', 'attributes', 'since', 'the', 'multiattribute', 'evaluation', 'is', 'typically', 'hidden', 'within', 'the', 'agents', 'psyche', 'we', 'consider', 'a', 'signaling', 'mechanism', 'where', 'agents', 'are', 'provided', 'with', 'choice', 'information', 'through', 'private', 'signals', 'so', 'that', 'the', 'agents', 'choices', 'provide', 'more', 'insight', 'about', 'hisher', 'latent', 'evaluation', 'across', 'multiple', 'attributes', 'we', 'estimate', 'the', 'choice', 'model', 'via', 'a', 'novel', 'multistage', 'matrix', 'factorization', 'algorithm', 'that', 'minimizes', 'the', 'average', 'deviation', 'of', 'the', 'factor', 'estimates', 'from', 'choice', 'data', 'simulation', 'results', 'are', 'presented', 'to', 'validate', 'the', 'estimation', 'performance', 'of', 'our', 'proposed', 'algorithm']] | [-0.09467681523509348, 0.023987956558476863, -0.09304610011324087, 0.06442084634167161, -0.1655552499433792, -0.1778596968908838, 0.12163947275980382, 0.4589795537492973, -0.2469265480657052, -0.33264633972235275, 0.04427821170022999, -0.24591917796497978, -0.19466676495402063, 0.13730089509259635, -0.0844389291420804, 0.021023494060207534, 0.10211957569215321, 0.05085976733595614, -0.026031982680257634, -0.2584735427939352, 0.30113008766178817, 0.07347987492173448, 0.3359074742852041, 0.011921967232862376, 0.14407177868958612, 0.060135748174866575, -0.06633763456867145, -0.004770504998280698, -0.11058181879690172, 0.1378987817775033, 0.29520204633274333, 0.2111078844899499, 0.37006292466680524, -0.40830628373878913, -0.2188423924355521, 0.11327527533597845, 0.08210530929929959, 0.05187408064160771, -0.028819216202476513, -0.29864815176283355, 0.0566221231097768, -0.1814113367292655, -0.03419666491673897, -0.11694520684552923, -0.04789802104065932, 0.02096893573250159, -0.3700165811632354, 0.00535654319190864, 0.02459585846045473, 0.05757378903061351, -0.08703665761120817, -0.1363923694530577, 0.018163851182595295, 0.15517460166839195, 0.08232665591445071, -0.041019392070898025, 0.1897258532589814, -0.14863876066594103, -0.16126773924560556, 0.3599558220676228, -0.007529594721397598, -0.2555722999730266, 0.160583247949413, -0.06402765881370177, -0.13657563204733317, 0.10812932726748962, 0.1868419952365576, 0.0975411678351862, -0.1721183037949451, 0.00030840651933791355, -0.08416802179608994, 0.23518942413545346, 0.008249417475530966, 0.025855668498540686, 0.17875767299349127, 0.1835951243070948, 0.06958914598787591, 0.0565799543518423, -0.023475194307694198, -0.18396488254914847, -0.2665006462457252, -0.08737230812368958, -0.1755932525344093, 0.0030922126729117905, -0.156455357093071, -0.13862799906215612, 0.3756255276732447, 0.21400628157035018, 0.2036159199243724, 0.09940216725890606, 0.30767374368847017, 0.06256307102505418, 0.05329151285168458, 0.0844282993246745, 0.15280386433317858, 0.03820032692801882, 0.03583140458033464, -0.184558147194189, 0.21864551276549846, -0.006875494163758403] |
1,802.07127 | Actions Speak Louder Than Goals: Valuing Player Actions in Soccer | Assessing the impact of the individual actions performed by soccer players
during games is a crucial aspect of the player recruitment process.
Unfortunately, most traditional metrics fall short in addressing this task as
they either focus on rare actions like shots and goals alone or fail to account
for the context in which the actions occurred. This paper introduces (1) a new
language for describing individual player actions on the pitch and (2) a
framework for valuing any type of player action based on its impact on the game
outcome while accounting for the context in which the action happened. By
aggregating soccer players' action values, their total offensive and defensive
contributions to their team can be quantified. We show how our approach
considers relevant contextual information that traditional player evaluation
metrics ignore and present a number of use cases related to scouting and
playing style characterization in the 2016/2017 and 2017/2018 seasons in
Europe's top competitions.
| stat.AP stat.ML | assessing the impact of the individual actions performed by soccer players during games is a crucial aspect of the player recruitment process unfortunately most traditional metrics fall short in addressing this task as they either focus on rare actions like shots and goals alone or fail to account for the context in which the actions occurred this paper introduces 1 a new language for describing individual player actions on the pitch and 2 a framework for valuing any type of player action based on its impact on the game outcome while accounting for the context in which the action happened by aggregating soccer players action values their total offensive and defensive contributions to their team can be quantified we show how our approach considers relevant contextual information that traditional player evaluation metrics ignore and present a number of use cases related to scouting and playing style characterization in the 20162017 and 20172018 seasons in europes top competitions | [['assessing', 'the', 'impact', 'of', 'the', 'individual', 'actions', 'performed', 'by', 'soccer', 'players', 'during', 'games', 'is', 'a', 'crucial', 'aspect', 'of', 'the', 'player', 'recruitment', 'process', 'unfortunately', 'most', 'traditional', 'metrics', 'fall', 'short', 'in', 'addressing', 'this', 'task', 'as', 'they', 'either', 'focus', 'on', 'rare', 'actions', 'like', 'shots', 'and', 'goals', 'alone', 'or', 'fail', 'to', 'account', 'for', 'the', 'context', 'in', 'which', 'the', 'actions', 'occurred', 'this', 'paper', 'introduces', '1', 'a', 'new', 'language', 'for', 'describing', 'individual', 'player', 'actions', 'on', 'the', 'pitch', 'and', '2', 'a', 'framework', 'for', 'valuing', 'any', 'type', 'of', 'player', 'action', 'based', 'on', 'its', 'impact', 'on', 'the', 'game', 'outcome', 'while', 'accounting', 'for', 'the', 'context', 'in', 'which', 'the', 'action', 'happened', 'by', 'aggregating', 'soccer', 'players', 'action', 'values', 'their', 'total', 'offensive', 'and', 'defensive', 'contributions', 'to', 'their', 'team', 'can', 'be', 'quantified', 'we', 'show', 'how', 'our', 'approach', 'considers', 'relevant', 'contextual', 'information', 'that', 'traditional', 'player', 'evaluation', 'metrics', 'ignore', 'and', 'present', 'a', 'number', 'of', 'use', 'cases', 'related', 'to', 'scouting', 'and', 'playing', 'style', 'characterization', 'in', 'the', '20162017', 'and', '20172018', 'seasons', 'in', 'europes', 'top', 'competitions']] | [-0.057672427044766154, 0.06073014105664222, -0.08500346220484015, 0.10549948649052214, -0.08525973968919676, -0.16103531290616863, 0.09779226179546113, 0.39878236344618023, -0.2032565867719626, -0.3424099170585062, 0.11008132034008077, -0.2845213121621852, -0.16742286282876256, 0.14482279951316393, -0.15615922731946513, -0.012802790791359077, 0.11046488424110565, 0.07887813067478928, 0.05901887224524454, -0.301231424610433, 0.33929065681821935, 0.02696848536432264, 0.25285042585229656, 0.04069332939210781, 0.10927977801781076, 0.060073683140310016, -0.08743698354647346, 0.04350348973616312, -0.0935613017080735, 0.10640775189129932, 0.2805649042010877, 0.20355561326382457, 0.39789200610344766, -0.4232482304025418, -0.15518380561991815, 0.11680791001458457, 0.07084901684859565, 0.06853174997469896, -0.0013229053053755765, -0.31776300445495614, 0.04225992072658364, -0.1982152879677096, -0.0034420981819320256, -0.05537092318398, 0.011606532697726017, -0.011803743835452612, -0.2573641045044983, -0.023593964004758626, 0.07192962246229219, 0.08903380464907042, -0.06237738832288606, -0.12151295690245595, 0.017301518195694324, 0.2741931919379243, 0.08583573479584276, 0.011561171355609823, 0.17470993197991685, -0.2020070164480727, -0.1909156821017112, 0.43671486098437934, -0.050584700445727604, -0.17420840675788368, 0.15963124595790104, -0.10255819583715052, -0.152382713214607, 0.038697116165926124, 0.2162586864318319, 0.1487770979605974, -0.12273328999876026, -0.003601579344831407, 0.008445515246560596, 0.1819151044006839, 0.07582618739266114, 0.016049851144361457, 0.2186511882379129, 0.18454811878644736, 0.07189837255541852, 0.06654090978202239, -0.021343904310113685, -0.13817285333395266, -0.263885670867274, -0.12183153671123514, -0.0818097167084836, 0.002271051208672535, -0.05067524842114876, -0.11948804504232137, 0.4193805185247474, 0.17336597315860308, 0.15136982247553718, 0.0642205321476172, 0.2948675536948025, 0.023457710956153607, 0.06136639173154476, 0.0358929320317871, 0.20868371731963506, -0.03447190293253275, 0.10697742471631592, -0.19658622718979693, 0.17230211158585587, 0.09028203605383539] |
1,802.07128 | Local Differential Privacy for Evolving Data | There are now several large scale deployments of differential privacy used to
collect statistical information about users. However, these deployments
periodically recollect the data and recompute the statistics using algorithms
designed for a single use. As a result, these systems do not provide meaningful
privacy guarantees over long time scales. Moreover, existing techniques to
mitigate this effect do not apply in the "local model" of differential privacy
that these systems use.
In this paper, we introduce a new technique for local differential privacy
that makes it possible to maintain up-to-date statistics over time, with
privacy guarantees that degrade only in the number of changes in the underlying
distribution rather than the number of collection periods. We use our technique
for tracking a changing statistic in the setting where users are partitioned
into an unknown collection of groups, and at every time period each user draws
a single bit from a common (but changing) group-specific distribution. We also
provide an application to frequency and heavy-hitter estimation.
| cs.LG | there are now several large scale deployments of differential privacy used to collect statistical information about users however these deployments periodically recollect the data and recompute the statistics using algorithms designed for a single use as a result these systems do not provide meaningful privacy guarantees over long time scales moreover existing techniques to mitigate this effect do not apply in the local model of differential privacy that these systems use in this paper we introduce a new technique for local differential privacy that makes it possible to maintain uptodate statistics over time with privacy guarantees that degrade only in the number of changes in the underlying distribution rather than the number of collection periods we use our technique for tracking a changing statistic in the setting where users are partitioned into an unknown collection of groups and at every time period each user draws a single bit from a common but changing groupspecific distribution we also provide an application to frequency and heavyhitter estimation | [['there', 'are', 'now', 'several', 'large', 'scale', 'deployments', 'of', 'differential', 'privacy', 'used', 'to', 'collect', 'statistical', 'information', 'about', 'users', 'however', 'these', 'deployments', 'periodically', 'recollect', 'the', 'data', 'and', 'recompute', 'the', 'statistics', 'using', 'algorithms', 'designed', 'for', 'a', 'single', 'use', 'as', 'a', 'result', 'these', 'systems', 'do', 'not', 'provide', 'meaningful', 'privacy', 'guarantees', 'over', 'long', 'time', 'scales', 'moreover', 'existing', 'techniques', 'to', 'mitigate', 'this', 'effect', 'do', 'not', 'apply', 'in', 'the', 'local', 'model', 'of', 'differential', 'privacy', 'that', 'these', 'systems', 'use', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'technique', 'for', 'local', 'differential', 'privacy', 'that', 'makes', 'it', 'possible', 'to', 'maintain', 'uptodate', 'statistics', 'over', 'time', 'with', 'privacy', 'guarantees', 'that', 'degrade', 'only', 'in', 'the', 'number', 'of', 'changes', 'in', 'the', 'underlying', 'distribution', 'rather', 'than', 'the', 'number', 'of', 'collection', 'periods', 'we', 'use', 'our', 'technique', 'for', 'tracking', 'a', 'changing', 'statistic', 'in', 'the', 'setting', 'where', 'users', 'are', 'partitioned', 'into', 'an', 'unknown', 'collection', 'of', 'groups', 'and', 'at', 'every', 'time', 'period', 'each', 'user', 'draws', 'a', 'single', 'bit', 'from', 'a', 'common', 'but', 'changing', 'groupspecific', 'distribution', 'we', 'also', 'provide', 'an', 'application', 'to', 'frequency', 'and', 'heavyhitter', 'estimation']] | [-0.1291775789845622, 0.02948992605846742, -0.08258448910730129, 0.09130235021496474, -0.10275083099294341, -0.16202643621346038, 0.09279916444722788, 0.3877205503935164, -0.2968207829377868, -0.3456202491807441, 0.10605478883283495, -0.25736854133481923, -0.11785517168711081, 0.2210701555126544, -0.1439043698451397, 0.062484576711148924, 0.04919239397753369, 0.06148591574429619, -0.03198923813637741, -0.2966623879108352, 0.3134207733596365, 0.038365649296478795, 0.28392566006743547, -0.0047510242456513824, 0.09063072036457898, 0.026574056125669317, -0.05740894221817143, 0.024419499130453916, -0.10215748995749781, 0.1190891162263473, 0.28038952649909665, 0.19744983707752192, 0.33031481295316056, -0.43129635331499616, -0.17015250229812934, 0.12084360045775996, 0.15991498847266264, 0.12524250786271737, -0.07520031059358381, -0.25714491957967933, 0.11180016369361317, -0.1805123820618698, -0.0660687333230409, -0.10412053743687769, -0.010960563108550779, 0.033157932732226045, -0.2798052899370139, 0.02148208630070175, 0.02729829784313386, 0.07709366152006568, -0.005348629442354044, -0.0640860303417977, 0.016734531534497034, 0.18865023358922564, 0.04581976619224544, -0.029284589760936796, 0.12770328310593454, -0.09172784159750198, -0.1191855270020438, 0.35270778441971, -0.03048485931843364, -0.2248162095646628, 0.16956001285350683, -0.12465020138417568, -0.18569158854979007, 0.1405917107635601, 0.23753352484694032, 0.10139517570620007, -0.17513424662068824, 0.027781402583897226, -0.038469947693925914, 0.2264613272001346, 0.05443721604392384, 0.07814634518528527, 0.1641734354494309, 0.15807890694193316, 0.13440405825103605, 0.057821730758543265, -0.08343600049389131, -0.07872126395708288, -0.2740213034674525, -0.12934830743029263, -0.15601963976285224, 0.024659521072206907, -0.06242686653991272, -0.15726632242316776, 0.3804222940269745, 0.23880075211495613, 0.22717688608011513, 0.10116305190674735, 0.3498260500756177, 0.07426506070787031, 0.09152854467348802, 0.10976248673360908, 0.1535339284935176, 0.055080352582489, 0.15690714849695336, -0.13540016209607889, 0.11751099255034757, -0.03587266681574736] |
1,802.07129 | Deep BCD-Net Using Identical Encoding-Decoding CNN Structures for
Iterative Image Recovery | In "extreme" computational imaging that collects extremely undersampled or
noisy measurements, obtaining an accurate image within a reasonable computing
time is challenging. Incorporating image mapping convolutional neural networks
(CNN) into iterative image recovery has great potential to resolve this issue.
This paper 1) incorporates image mapping CNN using identical convolutional
kernels in both encoders and decoders into a block coordinate descent (BCD)
signal recovery method and 2) applies alternating direction method of
multipliers to train the aforementioned image mapping CNN. We refer to the
proposed recurrent network as BCD-Net using identical encoding-decoding CNN
structures. Numerical experiments show that, for a) denoising low
signal-to-noise-ratio images and b) extremely undersampled magnetic resonance
imaging, the proposed BCD-Net achieves significantly more accurate image
recovery, compared to BCD-Net using distinct encoding-decoding structures
and/or the conventional image recovery model using both wavelets and total
variation.
| stat.ML cs.CV cs.LG | in extreme computational imaging that collects extremely undersampled or noisy measurements obtaining an accurate image within a reasonable computing time is challenging incorporating image mapping convolutional neural networks cnn into iterative image recovery has great potential to resolve this issue this paper 1 incorporates image mapping cnn using identical convolutional kernels in both encoders and decoders into a block coordinate descent bcd signal recovery method and 2 applies alternating direction method of multipliers to train the aforementioned image mapping cnn we refer to the proposed recurrent network as bcdnet using identical encodingdecoding cnn structures numerical experiments show that for a denoising low signaltonoiseratio images and b extremely undersampled magnetic resonance imaging the proposed bcdnet achieves significantly more accurate image recovery compared to bcdnet using distinct encodingdecoding structures andor the conventional image recovery model using both wavelets and total variation | [['in', 'extreme', 'computational', 'imaging', 'that', 'collects', 'extremely', 'undersampled', 'or', 'noisy', 'measurements', 'obtaining', 'an', 'accurate', 'image', 'within', 'a', 'reasonable', 'computing', 'time', 'is', 'challenging', 'incorporating', 'image', 'mapping', 'convolutional', 'neural', 'networks', 'cnn', 'into', 'iterative', 'image', 'recovery', 'has', 'great', 'potential', 'to', 'resolve', 'this', 'issue', 'this', 'paper', '1', 'incorporates', 'image', 'mapping', 'cnn', 'using', 'identical', 'convolutional', 'kernels', 'in', 'both', 'encoders', 'and', 'decoders', 'into', 'a', 'block', 'coordinate', 'descent', 'bcd', 'signal', 'recovery', 'method', 'and', '2', 'applies', 'alternating', 'direction', 'method', 'of', 'multipliers', 'to', 'train', 'the', 'aforementioned', 'image', 'mapping', 'cnn', 'we', 'refer', 'to', 'the', 'proposed', 'recurrent', 'network', 'as', 'bcdnet', 'using', 'identical', 'encodingdecoding', 'cnn', 'structures', 'numerical', 'experiments', 'show', 'that', 'for', 'a', 'denoising', 'low', 'signaltonoiseratio', 'images', 'and', 'b', 'extremely', 'undersampled', 'magnetic', 'resonance', 'imaging', 'the', 'proposed', 'bcdnet', 'achieves', 'significantly', 'more', 'accurate', 'image', 'recovery', 'compared', 'to', 'bcdnet', 'using', 'distinct', 'encodingdecoding', 'structures', 'andor', 'the', 'conventional', 'image', 'recovery', 'model', 'using', 'both', 'wavelets', 'and', 'total', 'variation']] | [-0.07559798513421882, -0.06254467215979884, -0.056266337720235045, 0.0676306654663971, -0.06270742839853038, -0.254721950528567, -0.023299538472620434, 0.5131265531099743, -0.3075389335561785, -0.2842666324254849, 0.1139923424012758, -0.2305926708973569, -0.21859734962533542, 0.15826325648189557, -0.14107658776870038, 0.11359953614313612, 0.1659270303404267, -0.0158507059120553, -0.12712743190592893, -0.25630460981038405, 0.19687149933666634, 0.08403537632803694, 0.3491291252949791, -0.07449288529900017, 0.17892730658833714, 0.006989163852450873, -0.056491641897252566, -0.026728154500953102, 0.004730707439305026, 0.15011123725775924, 0.3294530925441453, 0.18325154755679932, 0.2660096214293576, -0.4541769838630617, -0.25073002196560285, 0.07887579882751963, 0.2058946977322586, 0.09535112329122188, -0.10054261727719618, -0.3245345632706454, 0.11020594943824003, -0.10659313410949364, 0.08777263826395808, -0.15907554405493488, -0.061565521944535344, -0.03333999936153992, -0.34736147289090663, 0.0702744473430174, 0.05601139314700481, 0.037008377978001994, -0.11449132237429295, -0.11422243301602576, 0.06922866981610548, 0.1333779545480774, -0.0337088147618828, 0.12372287871691284, 0.15162537358835232, -0.16941053520137672, -0.0762382407166841, 0.3250414503456877, -0.06189099406377955, -0.20515554061280095, 0.17958351493672395, -0.06280110782119545, -0.13296698046874977, 0.1984500461660004, 0.23746692131963565, 0.09925839769915282, -0.1418921800075675, -0.007295491367958741, -0.05604672737473206, 0.19041304654113467, 0.09912455220968067, 0.007839719556345732, 0.11003314447421715, 0.2424606065795147, 0.07630484369616929, 0.15709550964094116, -0.23831955128074658, -0.009078121603392868, -0.15851980187132847, -0.07350873647122845, -0.23236132052010125, -0.02829286722439549, -0.12945677751713774, -0.13372717826566893, 0.4464667920063404, 0.21535724109346918, 0.21892708944652578, 0.11439320518427508, 0.4136351219800522, 0.032129050364798246, 0.1454743595560175, 0.08546745971099828, 0.1631166332521938, 0.11952988618462206, 0.10630991676086962, -0.16565789627045285, 0.026784816795370453, 0.09261900924896593] |
1,802.0713 | Universal qudit Hamiltonians | A family of quantum Hamiltonians is said to be universal if any other
finite-dimensional Hamiltonian can be approximately encoded within the
low-energy space of a Hamiltonian from that family. If the encoding is
efficient, universal families of Hamiltonians can be used as universal analogue
quantum simulators and universal quantum computers, and the problem of
approximately determining the ground-state energy of a Hamiltonian from a
universal family is QMA-complete. One natural way to categorise Hamiltonians
into families is in terms of the interactions they are built from. Here we
prove universality of some important classes of interactions on qudits
($d$-level systems): (1) We completely characterise the $k$-qudit interactions
which are universal, if augmented with arbitrary 1-local terms. We find that,
for all $k \geqslant 2$ and all local dimensions $d \geqslant 2$, almost all
such interactions are universal aside from a simple stoquastic class. (2) We
prove universality of generalisations of the Heisenberg model that are
ubiquitous in condensed-matter physics, even if free 1-local terms are not
provided. We show that the $SU(d)$ and $SU(2)$ Heisenberg interactions are
universal for all local dimensions $d \geqslant 2$ (spin $\geqslant 1/2$),
implying that a quantum variant of the Max-$d$-Cut problem is QMA-complete. We
also show that for $d=3$ all bilinear-biquadratic Heisenberg interactions are
universal. One example is the general AKLT model. (3) We prove universality of
any interaction proportional to the projector onto a pure entangled state.
| quant-ph | a family of quantum hamiltonians is said to be universal if any other finitedimensional hamiltonian can be approximately encoded within the lowenergy space of a hamiltonian from that family if the encoding is efficient universal families of hamiltonians can be used as universal analogue quantum simulators and universal quantum computers and the problem of approximately determining the groundstate energy of a hamiltonian from a universal family is qmacomplete one natural way to categorise hamiltonians into families is in terms of the interactions they are built from here we prove universality of some important classes of interactions on qudits dlevel systems 1 we completely characterise the kqudit interactions which are universal if augmented with arbitrary 1local terms we find that for all k geqslant 2 and all local dimensions d geqslant 2 almost all such interactions are universal aside from a simple stoquastic class 2 we prove universality of generalisations of the heisenberg model that are ubiquitous in condensedmatter physics even if free 1local terms are not provided we show that the sud and su2 heisenberg interactions are universal for all local dimensions d geqslant 2 spin geqslant 12 implying that a quantum variant of the maxdcut problem is qmacomplete we also show that for d3 all bilinearbiquadratic heisenberg interactions are universal one example is the general aklt model 3 we prove universality of any interaction proportional to the projector onto a pure entangled state | [['a', 'family', 'of', 'quantum', 'hamiltonians', 'is', 'said', 'to', 'be', 'universal', 'if', 'any', 'other', 'finitedimensional', 'hamiltonian', 'can', 'be', 'approximately', 'encoded', 'within', 'the', 'lowenergy', 'space', 'of', 'a', 'hamiltonian', 'from', 'that', 'family', 'if', 'the', 'encoding', 'is', 'efficient', 'universal', 'families', 'of', 'hamiltonians', 'can', 'be', 'used', 'as', 'universal', 'analogue', 'quantum', 'simulators', 'and', 'universal', 'quantum', 'computers', 'and', 'the', 'problem', 'of', 'approximately', 'determining', 'the', 'groundstate', 'energy', 'of', 'a', 'hamiltonian', 'from', 'a', 'universal', 'family', 'is', 'qmacomplete', 'one', 'natural', 'way', 'to', 'categorise', 'hamiltonians', 'into', 'families', 'is', 'in', 'terms', 'of', 'the', 'interactions', 'they', 'are', 'built', 'from', 'here', 'we', 'prove', 'universality', 'of', 'some', 'important', 'classes', 'of', 'interactions', 'on', 'qudits', 'dlevel', 'systems', '1', 'we', 'completely', 'characterise', 'the', 'kqudit', 'interactions', 'which', 'are', 'universal', 'if', 'augmented', 'with', 'arbitrary', '1local', 'terms', 'we', 'find', 'that', 'for', 'all', 'k', 'geqslant', '2', 'and', 'all', 'local', 'dimensions', 'd', 'geqslant', '2', 'almost', 'all', 'such', 'interactions', 'are', 'universal', 'aside', 'from', 'a', 'simple', 'stoquastic', 'class', '2', 'we', 'prove', 'universality', 'of', 'generalisations', 'of', 'the', 'heisenberg', 'model', 'that', 'are', 'ubiquitous', 'in', 'condensedmatter', 'physics', 'even', 'if', 'free', '1local', 'terms', 'are', 'not', 'provided', 'we', 'show', 'that', 'the', 'sud', 'and', 'su2', 'heisenberg', 'interactions', 'are', 'universal', 'for', 'all', 'local', 'dimensions', 'd', 'geqslant', '2', 'spin', 'geqslant', '12', 'implying', 'that', 'a', 'quantum', 'variant', 'of', 'the', 'maxdcut', 'problem', 'is', 'qmacomplete', 'we', 'also', 'show', 'that', 'for', 'd3', 'all', 'bilinearbiquadratic', 'heisenberg', 'interactions', 'are', 'universal', 'one', 'example', 'is', 'the', 'general', 'aklt', 'model', '3', 'we', 'prove', 'universality', 'of', 'any', 'interaction', 'proportional', 'to', 'the', 'projector', 'onto', 'a', 'pure', 'entangled', 'state']] | [-0.15056791032470618, 0.21802522475099742, -0.03728447716519268, 0.09658610954173229, -0.02526394224050155, -0.2192397875803255, -0.03913276479079872, 0.33135593334380775, -0.2844455253388813, -0.25835991172767503, 0.06608145698793072, -0.2878160118984754, -0.15790894879625267, 0.20732417253801366, 0.009315266348861253, 0.03429967947973762, 0.029048404695931198, 0.07797917716361007, -0.09841022397593352, -0.26215802970474245, 0.3273775049321885, -0.06329418839626974, 0.19863966972139452, 0.0341584008075137, 0.09468822840545246, 0.01887948722618556, 0.10575242188075645, 0.019081199471613935, -0.13275269422246205, 0.09616669449583495, 0.2595411985515529, 0.08400685513939693, 0.18667839195323477, -0.3602592501601468, -0.18065232648154472, 0.17399796870509124, 0.16190074909230606, 0.15580516654744248, 0.005498544207590237, -0.25987923524018713, 0.08974401302667646, -0.20176311482199719, -0.14146309713693137, -0.12239355990231485, 0.04145005751449151, -0.01917281567594716, -0.25335311614048905, 0.06631241173394996, 0.13397217663144892, 0.04064282696182508, -0.05090472510468231, -0.09645939625493878, -0.0130096494610913, 0.12197760830317572, -0.06950802228797243, 0.03250024301227774, 0.07029677005764497, -0.10889746653227847, -0.1665026741251292, 0.4084660842629497, -0.01491730252396747, -0.22188561689708175, 0.19082301894258788, -0.13184612365479506, -0.17683681212725366, 0.062408904173279524, 0.10761289692148086, 0.10436402414545673, -0.13117392401934438, 0.18566076505665424, -0.08421473583214528, 0.17247747290527743, 0.005433441386578101, 0.07159425476451041, 0.1759015083384936, 0.07550420157827213, 0.08116103042828422, 0.13152010229095426, 0.011034732055950255, -0.1393797879043343, -0.3368631129727592, -0.17807631870150134, -0.22591635204357988, 0.14230266382100606, -0.09665465926778474, -0.13663075167621794, 0.38586702690431807, 0.12874559130591576, 0.16492115262128382, 0.06961214993210997, 0.18964325205538854, 0.09261529001481271, 0.06683583572195131, 0.12966917549727622, 0.20072319371040706, 0.10791938183749246, -0.051079426038722495, -0.16789318585884258, 0.018123983204301822, 0.10983739929201777] |
1,802.07131 | Semi-direct products involving $Sp_{2n}$ or $Spin_n$ with free algebras
of symmetric invariants | This is a part of an ongoing project, the goal of which is to classify all
semi-direct products $\mathfrak s=\mathfrak g{\ltimes} V$ such that $\mathfrak
g$ is a simple Lie algebra, $V$ is a $\mathfrak g$-module, and $\mathfrak s$
has a free algebra of symmetric invariants. In this paper, we obtain such a
classification for the representations of the orthogonal and symplectic
algebras.
| math.RT | this is a part of an ongoing project the goal of which is to classify all semidirect products mathfrak smathfrak gltimes v such that mathfrak g is a simple lie algebra v is a mathfrak gmodule and mathfrak s has a free algebra of symmetric invariants in this paper we obtain such a classification for the representations of the orthogonal and symplectic algebras | [['this', 'is', 'a', 'part', 'of', 'an', 'ongoing', 'project', 'the', 'goal', 'of', 'which', 'is', 'to', 'classify', 'all', 'semidirect', 'products', 'mathfrak', 'smathfrak', 'gltimes', 'v', 'such', 'that', 'mathfrak', 'g', 'is', 'a', 'simple', 'lie', 'algebra', 'v', 'is', 'a', 'mathfrak', 'gmodule', 'and', 'mathfrak', 's', 'has', 'a', 'free', 'algebra', 'of', 'symmetric', 'invariants', 'in', 'this', 'paper', 'we', 'obtain', 'such', 'a', 'classification', 'for', 'the', 'representations', 'of', 'the', 'orthogonal', 'and', 'symplectic', 'algebras']] | [-0.23046770990486182, 0.05076476079545775, -0.06467498974165037, -0.02554499683532095, -0.19159723634255074, -0.10709081009946882, -0.06300967188722026, 0.3862293059272425, -0.3548753745853901, -0.15485805961939078, 0.13131641285930065, -0.2470480873589478, -0.12132034104942004, 0.1496081093163599, -0.163953016645142, -0.10733373350803814, 0.07867618871941454, 0.18581461342465547, -0.13201210699191998, -0.22742740310255496, 0.3877927296691471, -0.04962834502599897, 0.21413011951667685, -0.007013621710477367, 0.1403400729454699, -0.030152545864915566, -2.2633252517571525e-05, -0.06850120964800081, -0.1537006969591612, 0.09130217746964522, 0.35698800310788176, 0.09723932185905083, 0.24713921517000667, -0.28015574008699445, -0.06727981092851787, 0.2519798988461613, 0.17953176116238215, -0.043172438564296395, -0.02566593929770447, -0.2557365581807163, 0.10394534736221271, -0.2921615710393304, -0.09877379418956855, -0.06737695433317668, 0.1811075248711166, -0.07567848395260554, -0.31537837133048074, -0.03316285319271542, 0.09144148910565982, 0.11318367514907131, -0.08983357153862478, -0.11304075434981357, -0.12025077889362971, 0.07148199832244288, -0.1379421419271874, 0.13380322044360496, 0.09502356201558122, -0.07930745988611192, -0.1384926379052183, 0.45594258774958907, -0.01619300874511874, -0.22987977894289152, 0.13610144513880923, -0.17844035565882685, -0.19154630675320589, 0.04645509622429335, 0.07165317129462011, 0.1664841752203684, -0.04894593975964993, 0.24766262655981655, -0.1829010999155423, -0.03677812970006868, -0.019198133240616512, -0.03691895057018551, 0.11917707460030677, 0.1579160906433586, 0.04357577297126963, 0.10177534957608533, 0.08684210529521344, 0.14261630244760048, -0.3835476788263472, -0.231736372018026, -0.10955026751524577, 0.18273013901142848, -0.06211091049471944, -0.15176975882301727, 0.46493755245492574, 0.07725102365726516, 0.17844481854921296, 0.09695722878400591, 0.2161518499136917, 0.07459180893760825, 0.12336041804196106, 0.07864903104269788, 0.07355997983425383, 0.26906861307927304, -0.07472207281915914, -0.13814810319020163, -0.09445755194044775, 0.19890494050369376] |
1,802.07132 | Capstone: Mobility Modeling on Smartphones to Achieve Privacy by Design | Sharing location traces with context-aware service providers has privacy
implications. Location-privacy preserving mechanisms, such as obfuscation,
anonymization and cryptographic primitives, have been shown to have impractical
utility/privacy tradeoff. Another solution for enhancing user privacy is to
minimize data sharing by executing the tasks conventionally carried out at the
service providers' end on the users' smartphones. Although the data volume
shared with the untrusted entities is significantly reduced, executing
computationally demanding server-side tasks on resource-constrained smartphones
is often impracticable. To this end, we propose a novel perspective on lowering
the computational complexity by treating spatiotemporal trajectories as
space-time signals. Lowering the data dimensionality facilitates offloading the
computational tasks onto the digital-signal processors and the usage of the
non-blocking signal-processing pipelines. While focusing on the task of user
mobility modeling, we achieve the following results in comparison to the state
of the art techniques: (i) mobility models with precision and recall greater
than 80%, (ii) reduction in computational complexity by a factor of 2.5, and
(iii) reduction in power consumption by a factor of 0.5. Furthermore, our
technique does not rely on users' behavioral parameters that usually result in
privacy-leakage and conclusive bias in the existing techniques. Using three
real-world mobility datasets, we demonstrate that our technique addresses these
weaknesses while formulating accurate user mobility models.
| cs.CR cs.CY | sharing location traces with contextaware service providers has privacy implications locationprivacy preserving mechanisms such as obfuscation anonymization and cryptographic primitives have been shown to have impractical utilityprivacy tradeoff another solution for enhancing user privacy is to minimize data sharing by executing the tasks conventionally carried out at the service providers end on the users smartphones although the data volume shared with the untrusted entities is significantly reduced executing computationally demanding serverside tasks on resourceconstrained smartphones is often impracticable to this end we propose a novel perspective on lowering the computational complexity by treating spatiotemporal trajectories as spacetime signals lowering the data dimensionality facilitates offloading the computational tasks onto the digitalsignal processors and the usage of the nonblocking signalprocessing pipelines while focusing on the task of user mobility modeling we achieve the following results in comparison to the state of the art techniques i mobility models with precision and recall greater than 80 ii reduction in computational complexity by a factor of 25 and iii reduction in power consumption by a factor of 05 furthermore our technique does not rely on users behavioral parameters that usually result in privacyleakage and conclusive bias in the existing techniques using three realworld mobility datasets we demonstrate that our technique addresses these weaknesses while formulating accurate user mobility models | [['sharing', 'location', 'traces', 'with', 'contextaware', 'service', 'providers', 'has', 'privacy', 'implications', 'locationprivacy', 'preserving', 'mechanisms', 'such', 'as', 'obfuscation', 'anonymization', 'and', 'cryptographic', 'primitives', 'have', 'been', 'shown', 'to', 'have', 'impractical', 'utilityprivacy', 'tradeoff', 'another', 'solution', 'for', 'enhancing', 'user', 'privacy', 'is', 'to', 'minimize', 'data', 'sharing', 'by', 'executing', 'the', 'tasks', 'conventionally', 'carried', 'out', 'at', 'the', 'service', 'providers', 'end', 'on', 'the', 'users', 'smartphones', 'although', 'the', 'data', 'volume', 'shared', 'with', 'the', 'untrusted', 'entities', 'is', 'significantly', 'reduced', 'executing', 'computationally', 'demanding', 'serverside', 'tasks', 'on', 'resourceconstrained', 'smartphones', 'is', 'often', 'impracticable', 'to', 'this', 'end', 'we', 'propose', 'a', 'novel', 'perspective', 'on', 'lowering', 'the', 'computational', 'complexity', 'by', 'treating', 'spatiotemporal', 'trajectories', 'as', 'spacetime', 'signals', 'lowering', 'the', 'data', 'dimensionality', 'facilitates', 'offloading', 'the', 'computational', 'tasks', 'onto', 'the', 'digitalsignal', 'processors', 'and', 'the', 'usage', 'of', 'the', 'nonblocking', 'signalprocessing', 'pipelines', 'while', 'focusing', 'on', 'the', 'task', 'of', 'user', 'mobility', 'modeling', 'we', 'achieve', 'the', 'following', 'results', 'in', 'comparison', 'to', 'the', 'state', 'of', 'the', 'art', 'techniques', 'i', 'mobility', 'models', 'with', 'precision', 'and', 'recall', 'greater', 'than', '80', 'ii', 'reduction', 'in', 'computational', 'complexity', 'by', 'a', 'factor', 'of', '25', 'and', 'iii', 'reduction', 'in', 'power', 'consumption', 'by', 'a', 'factor', 'of', '05', 'furthermore', 'our', 'technique', 'does', 'not', 'rely', 'on', 'users', 'behavioral', 'parameters', 'that', 'usually', 'result', 'in', 'privacyleakage', 'and', 'conclusive', 'bias', 'in', 'the', 'existing', 'techniques', 'using', 'three', 'realworld', 'mobility', 'datasets', 'we', 'demonstrate', 'that', 'our', 'technique', 'addresses', 'these', 'weaknesses', 'while', 'formulating', 'accurate', 'user', 'mobility', 'models']] | [-0.14024746407013597, -0.017692072668982924, -0.031238231739081756, 0.03929776763827693, -0.10735110204640619, -0.2106192938965951, 0.1302811378222877, 0.40409280023288346, -0.25304307484290967, -0.38313828760915447, 0.08717139197585606, -0.3018780785433493, -0.1159498650327045, 0.20279434535591184, -0.16137776465894121, 0.10570833760755302, 0.08205876310526485, 0.011683141856406216, -0.0514759089548508, -0.3067996595743519, 0.2853405860772175, 0.10069021915562205, 0.37873124221925725, 0.07273759408700914, 0.06778804199199494, -0.005800210081309762, -0.048901582323670596, -0.02622651849532316, -0.05969267659045881, 0.14572456365390002, 0.33128306940417246, 0.2204089021920161, 0.3330091269546901, -0.4370109797045457, -0.2095155883952101, 0.05072799541751369, 0.16609787711864907, 0.07256379572980974, -0.06458748143850586, -0.3042795788190664, 0.11032511020722, -0.2077188980907744, -0.02058237096941877, -0.11158807777270605, -0.02304711001553516, -0.006273219823736715, -0.2521854536498551, 0.025061035073228932, -0.00019410665216965014, 0.10490927139533238, 0.0005991883267661636, -0.09363331474438134, 0.0039570740830730386, 0.17121760243934714, 0.06115319311975156, -0.02954313253323622, 0.1949770111664955, -0.16449385374989972, -0.1752271892955448, 0.38233874708484034, 0.02438341579671912, -0.19849465128051844, 0.20896477941008276, -0.02567803654043625, -0.16774643740962158, 0.11462340509396554, 0.2111692882277959, 0.061472703197734874, -0.170217025736478, 0.05779346697193138, 0.032083659983751636, 0.22232233294441053, 0.06314045973471913, 0.05345415457276444, 0.1372586764321999, 0.2395249519035594, 0.09562017107294969, 0.07903836141400555, -0.04858515708665735, -0.08274955350901285, -0.15983132183843646, -0.13615297391936085, -0.19021750425596332, 0.01612142545501472, -0.10698303110981437, -0.07652026340581297, 0.36487212213971804, 0.21825029659893871, 0.15962029482946324, 0.09968460889471949, 0.4211104079040353, 0.06934159098776083, 0.12160349989685934, 0.1395228140757358, 0.14155536365450444, -0.03760309874062632, 0.18513827040319292, -0.20702108634229172, 0.13054798544546317, -0.005446438047299249] |
1,802.07133 | Towards Deep Representation Learning with Genetic Programming | Genetic Programming (GP) is an evolutionary algorithm commonly used for
machine learning tasks. In this paper we present a method that allows GP to
transform the representation of a large-scale machine learning dataset into a
more compact representation, by means of processing features from the original
representation at individual level. We develop as a proof of concept of this
method an autoencoder. We tested a preliminary version of our approach in a
variety of well-known machine learning image datasets. We speculate that this
method, used in an iterative manner, can produce results competitive with
state-of-art deep neural networks.
| cs.NE | genetic programming gp is an evolutionary algorithm commonly used for machine learning tasks in this paper we present a method that allows gp to transform the representation of a largescale machine learning dataset into a more compact representation by means of processing features from the original representation at individual level we develop as a proof of concept of this method an autoencoder we tested a preliminary version of our approach in a variety of wellknown machine learning image datasets we speculate that this method used in an iterative manner can produce results competitive with stateofart deep neural networks | [['genetic', 'programming', 'gp', 'is', 'an', 'evolutionary', 'algorithm', 'commonly', 'used', 'for', 'machine', 'learning', 'tasks', 'in', 'this', 'paper', 'we', 'present', 'a', 'method', 'that', 'allows', 'gp', 'to', 'transform', 'the', 'representation', 'of', 'a', 'largescale', 'machine', 'learning', 'dataset', 'into', 'a', 'more', 'compact', 'representation', 'by', 'means', 'of', 'processing', 'features', 'from', 'the', 'original', 'representation', 'at', 'individual', 'level', 'we', 'develop', 'as', 'a', 'proof', 'of', 'concept', 'of', 'this', 'method', 'an', 'autoencoder', 'we', 'tested', 'a', 'preliminary', 'version', 'of', 'our', 'approach', 'in', 'a', 'variety', 'of', 'wellknown', 'machine', 'learning', 'image', 'datasets', 'we', 'speculate', 'that', 'this', 'method', 'used', 'in', 'an', 'iterative', 'manner', 'can', 'produce', 'results', 'competitive', 'with', 'stateofart', 'deep', 'neural', 'networks']] | [-0.01433488456989705, -0.057677565756217075, -0.18430651439714948, 0.07139996847147312, -0.1139483747728245, -0.14075652358825413, 0.014713332502465998, 0.44702084453738467, -0.3121299653085975, -0.3098026256134011, 0.054389249144967795, -0.1937205911733089, -0.2656508888954259, 0.24533713173729424, -0.12064694882161459, 0.06838190861578498, 0.15865700201568556, 0.04072511221795362, -0.0637700063632611, -0.2752419220169588, 0.3063482312599615, 0.024211662913831807, 0.3284827135408259, -0.03184872111115528, 0.15520188797916268, -0.022638967327241386, -0.0015221640401714652, -0.007078876386263541, -0.05332600520950462, 0.24415992001518227, 0.3294273860638543, 0.25636987036512215, 0.3656847008969635, -0.3826403776943988, -0.20198368797867502, 0.09868112988579943, 0.1742475503789527, 0.16219353664571975, -0.07268547335457251, -0.32429646732931844, 0.08846207337016809, -0.179171626159104, -0.026173427154557134, -0.1784635917105408, -0.05581866537828987, -0.044510155944723864, -0.2943740729622695, 0.008312483332404981, 0.09823212836517439, 0.07678088779342646, -0.05074413210612114, -0.133334746560538, 0.10582875948617881, 0.07101037282952849, -0.01753044753972137, 0.09785420450112278, 0.12903208004272715, -0.15350947852427027, -0.20041260973559882, 0.35037943236149693, -0.11648156066254085, -0.21030794952672963, 0.2048579895659825, 0.028043249163453524, -0.21018377755654558, 0.09018432099980359, 0.2805214734576947, 0.13719796522387437, -0.18289464289246468, 0.01625835676962624, -0.0722801294843001, 0.19202771555746392, -0.015229629552257913, -0.06630330563199763, 0.15775322429455665, 0.31347496982613976, 0.02159639468359552, 0.17002082123582687, -0.12839719879307918, -0.04745175953769144, -0.22305640585159844, -0.13873149255974865, -0.198499105089078, -0.005059307051480425, -0.09759591265025605, -0.16315302796357747, 0.3866057137825659, 0.22451702072475183, 0.18463078785535633, 0.11999410885975373, 0.3527869414538145, 0.07486358537975395, 0.11498151275469465, 0.11026434485838578, 0.12755676738594715, 0.06282872900756419, 0.11871239609484162, -0.16225823586835164, 0.03015172381039557, 0.0947862959381345] |
1,802.07134 | Characterization of generalized Petersen graphs that are Kronecker
covers | The family of generalized Petersen graphs $G(n, k)$, introduced by Coxeter et
al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by
connecting the vertices of a regular polygon to the corresponding vertices of a
star polygon. The Kronecker cover $\mathrm{KC}(G)$ of a simple undirected graph
$G$ is a a special type of bipartite covering graph of $G$, isomorphic to the
direct (tensor) product of $G$ and $K_2$. We characterize all the members of
generalized Petersen graphs that are Kronecker covers, and describe the
structure of their respective quotients. We observe that some of such quotients
are again generalized Petersen graphs, and describe all such pairs.
| math.CO | the family of generalized petersen graphs gn k introduced by coxeter et al 4 and named by mark watkins 1969 is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon the kronecker cover mathrmkcg of a simple undirected graph g is a a special type of bipartite covering graph of g isomorphic to the direct tensor product of g and k_2 we characterize all the members of generalized petersen graphs that are kronecker covers and describe the structure of their respective quotients we observe that some of such quotients are again generalized petersen graphs and describe all such pairs | [['the', 'family', 'of', 'generalized', 'petersen', 'graphs', 'gn', 'k', 'introduced', 'by', 'coxeter', 'et', 'al', '4', 'and', 'named', 'by', 'mark', 'watkins', '1969', 'is', 'a', 'family', 'of', 'cubic', 'graphs', 'formed', 'by', 'connecting', 'the', 'vertices', 'of', 'a', 'regular', 'polygon', 'to', 'the', 'corresponding', 'vertices', 'of', 'a', 'star', 'polygon', 'the', 'kronecker', 'cover', 'mathrmkcg', 'of', 'a', 'simple', 'undirected', 'graph', 'g', 'is', 'a', 'a', 'special', 'type', 'of', 'bipartite', 'covering', 'graph', 'of', 'g', 'isomorphic', 'to', 'the', 'direct', 'tensor', 'product', 'of', 'g', 'and', 'k_2', 'we', 'characterize', 'all', 'the', 'members', 'of', 'generalized', 'petersen', 'graphs', 'that', 'are', 'kronecker', 'covers', 'and', 'describe', 'the', 'structure', 'of', 'their', 'respective', 'quotients', 'we', 'observe', 'that', 'some', 'of', 'such', 'quotients', 'are', 'again', 'generalized', 'petersen', 'graphs', 'and', 'describe', 'all', 'such', 'pairs']] | [-0.17378770763071272, 0.11407103677603274, -0.041391939109375886, 0.021163799406159332, -0.16402804294416495, -0.116665341194954, 0.05033957514165154, 0.36345344342224234, -0.29650608097782005, -0.29794218126885796, 0.073807968539899, -0.29692795583432924, -0.18862952828105237, 0.11118090234336082, -0.11260095685337637, -0.02834468393645308, 0.12166503610861329, 0.09819721220363234, -0.013222415356787745, -0.308048876909107, 0.3331983515988565, -0.06667102636614193, 0.14997140061989142, 0.03091074340832042, 0.05891737707697593, 0.032969087978976, -0.04413643823349261, 0.08636265758609583, -0.21274161742025302, 0.10460721849682028, 0.248701708626237, 0.14002561228567953, 0.1807177956541161, -0.3292896280207814, -0.15060954360340656, 0.20907374589729147, 0.08213018878732246, -0.0024611698515998484, 0.047006047230113195, -0.23285649963528723, 0.09546469509400227, -0.19353032010179516, -0.12028113629685731, -0.006235972168511367, 0.10588543159836852, 0.05613022543875887, -0.2352877933230998, 3.146507718541601e-05, 0.1373171085105823, 0.05149901817712161, 0.0752789298122799, -0.1784736706061406, -0.09200024160662422, 0.08777772952794088, -0.1434373230052491, 0.008671183202012971, 0.0018454915885855487, -0.08009686033967212, -0.17739305830652918, 0.4033035413049547, 0.0008288926637924469, -0.10902555709335583, 0.0839951616483279, -0.13470489121470097, -0.20987213865291696, 0.09867362173479721, 0.10742565752888047, 0.17226734955224568, -0.06523461091208381, 0.13815564776955358, -0.1592869747279061, 0.030255126380906987, 0.19466644207955347, -0.05507035084437948, 0.12245438190026058, 0.07109538514611756, 0.07884741921044953, 0.21663184545783176, 0.04329208014658778, -0.002617309539608221, -0.2699970443741427, -0.1303882950765861, -0.2134371089921039, 0.07824746546176103, -0.19794766090391833, -0.21093490740770962, 0.46321699758236473, -0.01857028423120511, 0.20258662092493143, 0.0968490242790263, 0.14112422638153238, 0.005871126294001803, 0.07247654620667097, 0.1590037900988046, 0.11406529308553692, 0.28116116878106723, -0.06313071742670627, -0.1460782712585553, 0.010071545455453766, 0.21308351783627258] |
1,802.07135 | Analytic Analysis of Irregular Discrete Universes | In this work we investigate the dynamics of cosmological models with
spherical topology containing up to 600 Schwarzschild black holes arranged in
an irregular manner. We solve the field equations by tessellating the 3-sphere
into eight identical cells, each having a single edge which is shared by all
cells. The shared edge is enforced to be locally rotationally symmetric (LRS),
thereby allowing for solving the dynamics to high accuracy along this edge.
Each cell will then carry an identical (up to parity) configuration which can
however have an arbitrarily random distribution. The dynamics of such models is
compared to that of previous works on regularly distributed black holes as well
as with the standard isotropic dust models of the FLRW type. The irregular
models are shown to have richer dynamics than that of the regular models. The
randomization of the distribution of the black holes is done both without bias
and also with a certain clustering bias. The geometry of the initial
configuration of our models is shown to be qualitatively different from the
regular case in the way it approaches the isotropic model
| gr-qc | in this work we investigate the dynamics of cosmological models with spherical topology containing up to 600 schwarzschild black holes arranged in an irregular manner we solve the field equations by tessellating the 3sphere into eight identical cells each having a single edge which is shared by all cells the shared edge is enforced to be locally rotationally symmetric lrs thereby allowing for solving the dynamics to high accuracy along this edge each cell will then carry an identical up to parity configuration which can however have an arbitrarily random distribution the dynamics of such models is compared to that of previous works on regularly distributed black holes as well as with the standard isotropic dust models of the flrw type the irregular models are shown to have richer dynamics than that of the regular models the randomization of the distribution of the black holes is done both without bias and also with a certain clustering bias the geometry of the initial configuration of our models is shown to be qualitatively different from the regular case in the way it approaches the isotropic model | [['in', 'this', 'work', 'we', 'investigate', 'the', 'dynamics', 'of', 'cosmological', 'models', 'with', 'spherical', 'topology', 'containing', 'up', 'to', '600', 'schwarzschild', 'black', 'holes', 'arranged', 'in', 'an', 'irregular', 'manner', 'we', 'solve', 'the', 'field', 'equations', 'by', 'tessellating', 'the', '3sphere', 'into', 'eight', 'identical', 'cells', 'each', 'having', 'a', 'single', 'edge', 'which', 'is', 'shared', 'by', 'all', 'cells', 'the', 'shared', 'edge', 'is', 'enforced', 'to', 'be', 'locally', 'rotationally', 'symmetric', 'lrs', 'thereby', 'allowing', 'for', 'solving', 'the', 'dynamics', 'to', 'high', 'accuracy', 'along', 'this', 'edge', 'each', 'cell', 'will', 'then', 'carry', 'an', 'identical', 'up', 'to', 'parity', 'configuration', 'which', 'can', 'however', 'have', 'an', 'arbitrarily', 'random', 'distribution', 'the', 'dynamics', 'of', 'such', 'models', 'is', 'compared', 'to', 'that', 'of', 'previous', 'works', 'on', 'regularly', 'distributed', 'black', 'holes', 'as', 'well', 'as', 'with', 'the', 'standard', 'isotropic', 'dust', 'models', 'of', 'the', 'flrw', 'type', 'the', 'irregular', 'models', 'are', 'shown', 'to', 'have', 'richer', 'dynamics', 'than', 'that', 'of', 'the', 'regular', 'models', 'the', 'randomization', 'of', 'the', 'distribution', 'of', 'the', 'black', 'holes', 'is', 'done', 'both', 'without', 'bias', 'and', 'also', 'with', 'a', 'certain', 'clustering', 'bias', 'the', 'geometry', 'of', 'the', 'initial', 'configuration', 'of', 'our', 'models', 'is', 'shown', 'to', 'be', 'qualitatively', 'different', 'from', 'the', 'regular', 'case', 'in', 'the', 'way', 'it', 'approaches', 'the', 'isotropic', 'model']] | [-0.11181198191985933, 0.11157450082409133, -0.07961823416838382, 0.050844579109410835, -0.038137982739894855, -0.16042388452257475, -0.021917290380730738, 0.3833997553852184, -0.25242810566535057, -0.31613557207215903, 0.09675463302751862, -0.26589063927025086, -0.10883611037254172, 0.1504999929722702, -0.04287183641787598, 0.02892215626121944, 0.026200982744542314, 0.04368079692990843, -0.05883446714648491, -0.2784582243741328, 0.336572375154229, 0.08800210473735047, 0.27589136037378287, -0.06674040083611466, 0.06692645103422641, -0.03304970569518881, 0.0031919983149513746, 0.07405787550985975, -0.09553679382802131, 0.0987822643883587, 0.18990275382760086, 0.07739784323443334, 0.228318759796979, -0.4506647972815225, -0.23960576602257788, 0.10739147502159618, 0.16194814079916914, 0.14968759347760605, -0.03748742685939246, -0.26016056906993745, 0.11913679796524103, -0.1685968297369191, -0.14609988611798896, -0.034476991940249245, 0.010758360883894215, 0.02481300808658884, -0.2417457964772399, 0.05783134193584176, 0.08249787814249589, -0.03233676419957825, -0.08004789174605242, -0.07447864354712098, -0.055981462811241334, 0.14971107307760773, 0.04181711301878196, 0.02977960821463848, 0.10926575948605718, -0.11053189680008116, -0.1220868848562848, 0.3791187214361423, -0.04607893438396391, -0.261570706168878, 0.20786827302008928, -0.16351352333415137, -0.09074581777879401, 0.117502393054209, 0.15872958352100913, 0.14754239591243473, -0.15603875705678744, 0.09756543447798796, -0.05042000922991935, 0.1562947031957067, 0.06728529187334377, 0.00044540939953826046, 0.27511500826854585, 0.14129930509902214, 0.05345704874944995, 0.14631694500048584, -0.0631144316778417, -0.1223000776498457, -0.2526336902772765, -0.10438664658716373, -0.15017651385847863, 0.06385468039661646, -0.12521903699701437, -0.198739180342312, 0.38685775439396664, 0.10615868560473798, 0.22825901836420046, 0.04159140544842281, 0.2872487601055819, 0.07216747037486841, 0.09132499094583023, 0.09963263983777522, 0.22267110475197271, 0.09504649366262248, 0.07237524879272551, -0.17899145888488577, 0.029484316763599687, 0.02490851019114337] |
1,802.07136 | Height of rational points on congruent number elliptic curves | We prove that a positive proportion of squarefree integers are congruent
numbers such that the canonical height of the lowest non-torsion rational point
on the corresponding elliptic curve satisfies a strong lower bound.
| math.NT | we prove that a positive proportion of squarefree integers are congruent numbers such that the canonical height of the lowest nontorsion rational point on the corresponding elliptic curve satisfies a strong lower bound | [['we', 'prove', 'that', 'a', 'positive', 'proportion', 'of', 'squarefree', 'integers', 'are', 'congruent', 'numbers', 'such', 'that', 'the', 'canonical', 'height', 'of', 'the', 'lowest', 'nontorsion', 'rational', 'point', 'on', 'the', 'corresponding', 'elliptic', 'curve', 'satisfies', 'a', 'strong', 'lower', 'bound']] | [-0.26941948158271384, 0.12652727710012573, -0.10593626207926056, 0.11908612913931861, -0.04416066948606661, -0.18539734368889846, 0.045058056034825066, 0.24436213964398837, -0.32025220510408736, -0.2077566436633016, 0.00564664030786265, -0.3520941896307649, -0.1442509317827044, 0.2436446180059151, -0.0801375108545251, 0.04828626467761668, 0.03261776446280154, 0.1628816999551473, -0.08058179975628402, -0.3303945680134789, 0.39664925025268033, -0.07918151919588898, 0.19651908483920674, 0.07152982036385572, 0.11231434125114571, -0.041022211355580526, 0.08592298024362235, -0.03019729870456186, -0.2027411487568205, 0.1278846888436061, 0.23780802840536291, 0.05602385894621186, 0.26394436000423, -0.34517820529413945, -0.07572686581900626, 0.28367136712327146, 0.11559086968896515, -0.05377824076761802, -0.03610375427259979, -0.09923239052295685, 0.20830648407211289, -0.07818201839020758, -0.22434459553297723, -0.02115358747400795, 0.08253280705574786, 0.08862538026137785, -0.28056410598483955, 0.03687795567693132, 0.13360370845167022, 0.19396918275478212, -0.0537861792906893, -0.2551782521221674, -0.10095161306812908, 0.041730617906785374, -0.02948041082444516, 0.01980898205797668, 0.051624601664529604, -0.10351599069933097, -0.0578355880623514, 0.2924521195730477, -0.08491342458309549, -0.19066668064756828, 0.0733925679021261, -0.18630202766507864, -0.14641211109913208, 0.208043312710343, 0.11185951831496575, 0.15123216861463856, 0.07291804858003602, 0.16332477435582515, -0.2293406952398293, 0.1898861053006399, 0.182682372220425, -0.05561671437074741, 0.20415714213793928, -0.0363929517228495, 0.1312532410533591, 0.15436904617782796, -0.02023830976704079, -0.04330170243470506, -0.3986695022745566, -0.1950255635734224, -0.19154838009765654, 0.1706550895151767, -0.13478902642699805, -0.20160342442492643, 0.33529540522475587, 0.05290757971956874, 0.23063980270120682, 0.18629737031843627, 0.20916648017186107, 0.19707768802728617, -0.002132636494934559, 0.0691756763156842, 0.10070035183294253, 0.12964258331868966, -0.08591509754346176, -0.17940252154331768, 0.023040225447127312, 0.19641108031977306] |
1,802.07137 | On the cosmological constant in the deformed Einstein-Cartan gauge
gravity in De Donder-Weyl Hamiltonian formulation | A modification of the Einstein-Hilbert theory, the Covariant Canonical Gauge
Gravity (CCGG), leads to a cosmological constant that represents the energy of
the space-time continuum when deformed from its (A)dS ground state to a flat
geometry. CCGG is based on the canonical transformation theory in the De
Donder-Weyl (DW) Hamiltonian formulation. That framework modifies the
Einstein-Hilbert Lagrangian of the free gravitational field by a quadratic
Riemann-Cartan concomitant. The theory predicts a total energy-momentum of the
system of space-time and matter to vanish, in line with the conjecture of a
"Zero-Energy-Universe" going back to Lorentz (1916) and Levi-Civita (1917).
Consequently a flat geometry can only exist in presence of matter where the
bulk vacuum energy of matter, regardless of its value, is eliminated by the
vacuum energy of space-time.% $\lambda_0$. The observed cosmological constant
$\Lambda_{\mathrm{obs}}$ is found to be merely a small correction %of the order
$10^{-120} \,\lambda_0$ attributable to deviations from a flat geometry and
effects of complex dynamical geometry of space-time, namely torsion and
possibly also vacuum fluctuations. That quadratic extension of General
Relativity, anticipated already in 1918 by Einstein \cite{einstein18}, thus
provides a significant and natural contribution to resolving the "cosmological
constant problem".
| gr-qc | a modification of the einsteinhilbert theory the covariant canonical gauge gravity ccgg leads to a cosmological constant that represents the energy of the spacetime continuum when deformed from its ads ground state to a flat geometry ccgg is based on the canonical transformation theory in the de donderweyl dw hamiltonian formulation that framework modifies the einsteinhilbert lagrangian of the free gravitational field by a quadratic riemanncartan concomitant the theory predicts a total energymomentum of the system of spacetime and matter to vanish in line with the conjecture of a zeroenergyuniverse going back to lorentz 1916 and levicivita 1917 consequently a flat geometry can only exist in presence of matter where the bulk vacuum energy of matter regardless of its value is eliminated by the vacuum energy of spacetime lambda_0 the observed cosmological constant lambda_mathrmobs is found to be merely a small correction of the order 10120 lambda_0 attributable to deviations from a flat geometry and effects of complex dynamical geometry of spacetime namely torsion and possibly also vacuum fluctuations that quadratic extension of general relativity anticipated already in 1918 by einstein citeeinstein18 thus provides a significant and natural contribution to resolving the cosmological constant problem | [['a', 'modification', 'of', 'the', 'einsteinhilbert', 'theory', 'the', 'covariant', 'canonical', 'gauge', 'gravity', 'ccgg', 'leads', 'to', 'a', 'cosmological', 'constant', 'that', 'represents', 'the', 'energy', 'of', 'the', 'spacetime', 'continuum', 'when', 'deformed', 'from', 'its', 'ads', 'ground', 'state', 'to', 'a', 'flat', 'geometry', 'ccgg', 'is', 'based', 'on', 'the', 'canonical', 'transformation', 'theory', 'in', 'the', 'de', 'donderweyl', 'dw', 'hamiltonian', 'formulation', 'that', 'framework', 'modifies', 'the', 'einsteinhilbert', 'lagrangian', 'of', 'the', 'free', 'gravitational', 'field', 'by', 'a', 'quadratic', 'riemanncartan', 'concomitant', 'the', 'theory', 'predicts', 'a', 'total', 'energymomentum', 'of', 'the', 'system', 'of', 'spacetime', 'and', 'matter', 'to', 'vanish', 'in', 'line', 'with', 'the', 'conjecture', 'of', 'a', 'zeroenergyuniverse', 'going', 'back', 'to', 'lorentz', '1916', 'and', 'levicivita', '1917', 'consequently', 'a', 'flat', 'geometry', 'can', 'only', 'exist', 'in', 'presence', 'of', 'matter', 'where', 'the', 'bulk', 'vacuum', 'energy', 'of', 'matter', 'regardless', 'of', 'its', 'value', 'is', 'eliminated', 'by', 'the', 'vacuum', 'energy', 'of', 'spacetime', 'lambda_0', 'the', 'observed', 'cosmological', 'constant', 'lambda_mathrmobs', 'is', 'found', 'to', 'be', 'merely', 'a', 'small', 'correction', 'of', 'the', 'order', '10120', 'lambda_0', 'attributable', 'to', 'deviations', 'from', 'a', 'flat', 'geometry', 'and', 'effects', 'of', 'complex', 'dynamical', 'geometry', 'of', 'spacetime', 'namely', 'torsion', 'and', 'possibly', 'also', 'vacuum', 'fluctuations', 'that', 'quadratic', 'extension', 'of', 'general', 'relativity', 'anticipated', 'already', 'in', '1918', 'by', 'einstein', 'citeeinstein18', 'thus', 'provides', 'a', 'significant', 'and', 'natural', 'contribution', 'to', 'resolving', 'the', 'cosmological', 'constant', 'problem']] | [-0.16735165843662494, 0.13479594465267533, -0.12061304503974195, 0.08605110894798902, -0.1189920282267849, -0.13638417838289266, -0.032415303465919955, 0.2452157519364846, -0.22743712903078026, -0.30603742366110964, 0.03172721708809453, -0.23653914472985585, -0.1297368402920256, 0.12225940335095704, -0.05894197786862302, -0.011959119479797664, -0.024042954691443203, 0.07278734844658175, -0.11046729233870185, -0.20585765800691055, 0.37831800757703604, 0.11295864583128908, 0.2301544488630801, 0.02949409726884748, 0.1401111109097807, -0.02708902795954297, -0.01346665511421937, 0.08207545665209182, -0.13668563181814383, 0.07303185350550241, 0.19099788632350587, 0.060092675845642894, 0.22543932017773236, -0.4081712803890696, -0.2362415692744738, 0.0964681027738455, 0.05726151726291088, 0.16533744371675616, -0.010345829813862414, -0.29993779846214846, 0.042655303706699975, -0.1487715016179815, -0.1910648792406088, -0.019285045163996983, 0.026007363221651758, -0.11247017863934161, -0.2004990296967056, 0.13193947281121154, 0.02680851215018265, -0.026628853629517835, -0.09859309492579389, -0.057339108719437114, -0.06980049119253333, 0.03430542932937897, 0.12166902965812672, 0.08393074270982954, 0.14937756742710917, -0.1349885820406295, -0.06870072465001915, 0.43285060468285036, -0.1431756196761853, -0.21209858301153872, 0.09216497821641194, -0.1568021591180392, -0.08080921476115084, 0.14987531428050715, 0.10276429107655834, 0.11349697691669765, -0.11079625014258454, 0.2348434516143243, 0.0003135752243300279, 0.15112156020768452, 0.1149604954359044, 0.024567724672730645, 0.26053643945003085, 0.05426703591244101, 0.04474054956638914, 0.08126986883667087, -0.007558896137197735, -0.14260358120979313, -0.3852302197095317, -0.16946725003557125, -0.16701949321153128, 0.13488853537516357, -0.15104518874879128, -0.1917138078752032, 0.34457258050436695, 0.07487061034529081, 0.12731317600385714, 0.027494057846221647, 0.2519088665673432, 0.08737276185062608, 0.05967119793179639, 0.06386420521630498, 0.3191664490053275, 0.1822941463360621, 0.10437227601384318, -0.24706756292016507, -0.07034083571610002, 0.08235815777152311] |
1,802.07138 | BRST-BV quantization of gauge theories with global symmetries | We consider the general gauge theory with a closed irreducible gauge algebra
possessing the non-anomalous global (super)symmetry in the case when the gauge
fixing procedure violates the global invariance of classical action. The theory
is quantized in the framework of BRST-BV approach in the form of functional
integral over all fields of the configuration space. It is shown that the
global symmetry transformations are deformed in the process of quantization and
the full quantum action is invariant under such deformed global transformations
in the configuration space. The deformed global transformations are calculated
in an explicit form in the one-loop approximation.
| hep-th | we consider the general gauge theory with a closed irreducible gauge algebra possessing the nonanomalous global supersymmetry in the case when the gauge fixing procedure violates the global invariance of classical action the theory is quantized in the framework of brstbv approach in the form of functional integral over all fields of the configuration space it is shown that the global symmetry transformations are deformed in the process of quantization and the full quantum action is invariant under such deformed global transformations in the configuration space the deformed global transformations are calculated in an explicit form in the oneloop approximation | [['we', 'consider', 'the', 'general', 'gauge', 'theory', 'with', 'a', 'closed', 'irreducible', 'gauge', 'algebra', 'possessing', 'the', 'nonanomalous', 'global', 'supersymmetry', 'in', 'the', 'case', 'when', 'the', 'gauge', 'fixing', 'procedure', 'violates', 'the', 'global', 'invariance', 'of', 'classical', 'action', 'the', 'theory', 'is', 'quantized', 'in', 'the', 'framework', 'of', 'brstbv', 'approach', 'in', 'the', 'form', 'of', 'functional', 'integral', 'over', 'all', 'fields', 'of', 'the', 'configuration', 'space', 'it', 'is', 'shown', 'that', 'the', 'global', 'symmetry', 'transformations', 'are', 'deformed', 'in', 'the', 'process', 'of', 'quantization', 'and', 'the', 'full', 'quantum', 'action', 'is', 'invariant', 'under', 'such', 'deformed', 'global', 'transformations', 'in', 'the', 'configuration', 'space', 'the', 'deformed', 'global', 'transformations', 'are', 'calculated', 'in', 'an', 'explicit', 'form', 'in', 'the', 'oneloop', 'approximation']] | [-0.16058871455374174, 0.15806590770036563, -0.1042373419739306, 0.09677737539352166, -0.04567160432692617, -0.0721162862656638, -0.03680191460065543, 0.34544288847595456, -0.26960886993445454, -0.23661567631410435, 0.06343031794996933, -0.2165665511554107, -0.1965629601618275, 0.08824651678092778, -0.04320859511848539, 0.05619795931503177, -0.004000195655971765, 0.12825129289063625, -0.16171137357829138, -0.25838375829625876, 0.34072981658391654, 0.015032090585445985, 0.32320326605811717, -0.045574740197625946, 0.13669198531657456, 0.06669692181283608, -0.002533203846542165, -0.010965814726077952, -0.07831638076611852, 0.09379902196116746, 0.18483777002897114, 0.08054398984182626, 0.15223744144663215, -0.42769661838188766, -0.1838560205930844, 0.0874880289658904, 0.10136222345521674, 0.1389932313375175, -0.018524219291284682, -0.3117392493854277, 0.06442232790635899, -0.16777702504303307, -0.15944559069233946, -0.14056782914325594, -0.015255337371490896, -0.09496612971648574, -0.27100561032537374, 0.05650973683223128, 0.04714362539933063, 0.08899397780187428, -0.1374115359596908, -0.004623429941711947, -0.07285593294538557, 0.09177958661603043, 0.09390087176667293, 0.059017853946425024, 0.12261627488886007, -0.17624645955860616, -0.08243616290157661, 0.4306129627302289, -0.05480792939197272, -0.3030221337080002, 0.094017094951123, -0.1479960445780307, -0.21623793084174395, 0.11083887487649918, 0.09376518143806606, 0.14681149770971388, -0.13344783216554787, 0.2827924335276475, -0.08105739112943411, 0.053361749041359874, 0.04459425223059952, 0.029192734521930105, 0.16166603051126002, 0.07662662159418687, 0.09963794184848666, 0.12698822969105095, 0.0192192917939974, -0.18899288662243635, -0.45236782111227514, -0.15544450039975344, -0.10408995277131908, 0.08592140207765624, -0.10629901931606582, -0.15793797199701656, 0.3891847905423492, 0.07279291107493918, 0.13696049218764528, 0.03701252995990217, 0.21929369818419217, 0.18080873033963143, 0.1357740985136479, 0.03822349803056568, 0.23798759622499346, 0.15958134096115828, 0.004448648350080475, -0.2471337476884946, -0.07484949937555939, 0.1778125809133053] |
1,802.07139 | Superconductivity of Bi-III phase of elemental Bismuth: insights from
Muon-Spin Rotation and Density Functional Theory | Using muon-spin rotation the pressure-induced superconductivity in the Bi-III
phase of elemental Bismuth (transition temperature $T_{\rm c}\simeq7.05$ K) was
investigated. The Ginzburg-Landau parameter $\kappa=\lambda/\xi=30(6)$
($\lambda$ is the magnetic penetration depth, $\xi$ is the coherence length)
was estimated which is the highest among single element superconductors. The
temperature dependence of the superconducting energy gap [$\Delta(T)$]
reconstructed from $\lambda^{-2}(T)$ deviates from the weak-coupled BCS
prediction. The coupling strength $2\Delta/k_{\rm B}T_{\rm c}\simeq 4.34$ was
estimated thus implying that Bi-III stays within the strong coupling regime.
The Density Functional Theory calculations suggest that superconductivity in
Bi-III could be described within the Eliashberg approach with the
characteristic phonon frequency $\omega_{\rm ln}\simeq 5.5$ meV. An alternative
pairing mechanism to the electron-phonon coupling involves the possibility of
Cooper pairing induced by the Fermi surface nesting.
| cond-mat.supr-con | using muonspin rotation the pressureinduced superconductivity in the biiii phase of elemental bismuth transition temperature t_rm csimeq705 k was investigated the ginzburglandau parameter kappalambdaxi306 lambda is the magnetic penetration depth xi is the coherence length was estimated which is the highest among single element superconductors the temperature dependence of the superconducting energy gap deltat reconstructed from lambda2t deviates from the weakcoupled bcs prediction the coupling strength 2deltak_rm bt_rm csimeq 434 was estimated thus implying that biiii stays within the strong coupling regime the density functional theory calculations suggest that superconductivity in biiii could be described within the eliashberg approach with the characteristic phonon frequency omega_rm lnsimeq 55 mev an alternative pairing mechanism to the electronphonon coupling involves the possibility of cooper pairing induced by the fermi surface nesting | [['using', 'muonspin', 'rotation', 'the', 'pressureinduced', 'superconductivity', 'in', 'the', 'biiii', 'phase', 'of', 'elemental', 'bismuth', 'transition', 'temperature', 't_rm', 'csimeq705', 'k', 'was', 'investigated', 'the', 'ginzburglandau', 'parameter', 'kappalambdaxi306', 'lambda', 'is', 'the', 'magnetic', 'penetration', 'depth', 'xi', 'is', 'the', 'coherence', 'length', 'was', 'estimated', 'which', 'is', 'the', 'highest', 'among', 'single', 'element', 'superconductors', 'the', 'temperature', 'dependence', 'of', 'the', 'superconducting', 'energy', 'gap', 'deltat', 'reconstructed', 'from', 'lambda2t', 'deviates', 'from', 'the', 'weakcoupled', 'bcs', 'prediction', 'the', 'coupling', 'strength', '2deltak_rm', 'bt_rm', 'csimeq', '434', 'was', 'estimated', 'thus', 'implying', 'that', 'biiii', 'stays', 'within', 'the', 'strong', 'coupling', 'regime', 'the', 'density', 'functional', 'theory', 'calculations', 'suggest', 'that', 'superconductivity', 'in', 'biiii', 'could', 'be', 'described', 'within', 'the', 'eliashberg', 'approach', 'with', 'the', 'characteristic', 'phonon', 'frequency', 'omega_rm', 'lnsimeq', '55', 'mev', 'an', 'alternative', 'pairing', 'mechanism', 'to', 'the', 'electronphonon', 'coupling', 'involves', 'the', 'possibility', 'of', 'cooper', 'pairing', 'induced', 'by', 'the', 'fermi', 'surface', 'nesting']] | [-0.2144923612475395, 0.2667057441381039, -0.051291091689607125, 0.053802925775758924, -0.048974888998316604, -0.14328432034701108, 0.1258269005557522, 0.328437083221972, -0.26624377677589656, -0.2796250892058015, -0.09833184785582125, -0.32242397022247316, -0.03893431220576167, 0.15225926716066898, 0.08186769071035087, -0.018387729488313197, -0.08330369855929166, 0.018138191252946852, -0.1465086097866297, -0.18425833557732404, 0.2916564136873931, 0.07660292020812631, 0.3525907327234745, 0.12110610249638558, -0.014553822437301278, -0.018939187133684754, 0.15549622319266201, 0.017001367881894113, -0.19581503129808697, -0.0031608331869356333, 0.2879978044833988, -0.08724379210174084, 0.19542239128984512, -0.3419314917102456, -0.260541539683938, -0.01796319946181029, 0.09942968325875699, 0.09620772245433182, 0.019275679722428322, -0.28122233641147615, 0.041709691104944796, -0.12793812978081406, -0.1269730530930683, -0.03570262861996889, 0.00569603718072176, -0.05432265659607947, -0.25260336889699103, 0.171491465061903, 0.01715705455187708, 0.11206627365335589, -0.12879640989936889, -0.15652768544852733, -0.0758480055294931, -0.031991800382733346, 0.068279108049348, 0.13419616987556218, 0.1566314996741712, -0.06894044052250684, -0.006934994405135513, 0.32125774420425296, -0.09778087971359492, 0.012198330670595168, 0.08458945999853312, -0.14825285932794213, -0.025379795260727405, 0.20732752799242735, 0.0018639301131479441, 0.049930626250803474, -0.13563713098224253, 0.1380994676426635, -0.0039514188431203365, 0.24720750135183334, 0.054193658541888, 0.03781898114085198, 0.22328308023512364, 0.22453611785545946, -0.02602879819786176, 0.05225284162070602, -0.1851473747296259, -0.03351348686404526, -0.24957002612948417, -0.1250510184338782, -0.22359702984243632, 0.05579048276692629, -0.10697539092600346, -0.1178362240716815, 0.3457305842451751, 0.13946263625100255, 0.18462885154783726, -0.0394949756776914, 0.20273150411620736, 0.1574718546848744, 0.106711885612458, 0.07126075765118003, 0.2992488726004958, 0.22772948861774056, 0.0767946292757988, -0.38588091677054764, 0.10386455833632499, 0.056087948825210336] |
1,802.0714 | A Testability Analysis Framework for Non-Functional Properties | This paper presents background, the basic steps and an example for a
testability analysis framework for non-functional properties.
| cs.SE | this paper presents background the basic steps and an example for a testability analysis framework for nonfunctional properties | [['this', 'paper', 'presents', 'background', 'the', 'basic', 'steps', 'and', 'an', 'example', 'for', 'a', 'testability', 'analysis', 'framework', 'for', 'nonfunctional', 'properties']] | [-0.08755539295574029, -0.039204731395228815, -0.08174253575917748, 0.08335534009125291, -0.04735696677946382, -0.09175543236132297, 0.01947526516677398, 0.32650962140825057, -0.22928662018643486, -0.32903699794163305, 0.12650905746138758, -0.23313814939724076, -0.23097482695528823, 0.17339529479957289, -0.08207661345497602, 0.0982064500502828, 0.0669448445033696, -0.04851563388688697, -0.026836873808254797, -0.19276294727913207, 0.35413989921410877, 0.12468091755484541, 0.32368892679611844, 0.07135903830122617, 0.07114551221537921, 0.06823834826031493, -0.015921949952219922, 0.02580107779552539, -0.18120036413893104, 0.16628204410274824, 0.2941976266188754, 0.24044688972127107, 0.30697224889364505, -0.4076903706623448, -0.18346604896295401, 0.0657266474639376, 0.1090657422836456, 0.11076168938921506, -0.12718774197209212, -0.23699372965428564, 0.10494174223600163, -0.13222370689941776, -0.1478246214489142, -0.15309067208889043, 0.00830856514059835, -0.03183169590516223, -0.2535260392145978, -0.0179908346488244, 0.1600551830811633, 0.1179381457881795, -0.05622050197174152, -0.0941061040179597, 0.15661649509436554, 0.14743689719277123, 0.07093450665060017, -0.03748319724885126, 0.12285219691693783, -0.1368688994940991, -0.14411710378610426, 0.405063400665919, 0.0036584357731044292, -0.14584093222058275, 0.18689317194124064, 0.033268062889368996, -0.3331199785073598, -0.019375963990266126, 0.1982510613484515, 0.1301231760945585, -0.27156536874827, 0.12187314855853199, 0.04930871228377024, 0.20183756854385138, -0.03827233217695417, 0.06486379743243258, 0.21666165374012458, 0.33632909620387685, 0.04338631396078401, 0.16357370828174883, 0.017691317324837048, 0.01326684643410974, -0.4485898870560858, -0.25491626084678704, -0.029328041891050007, -0.06924741461019342, -0.059680702603751946, -0.17557861117853057, 0.5088120574752489, 0.17446916948796976, 0.15063317482256228, 0.09548824632333384, 0.3883604539765252, 0.07120961719192564, -0.027996156830340624, 0.04183045603955785, 0.15094352244502968, 0.10610415926203132, 0.12730696414493853, -0.14650442275322145, 0.09774430856729548, 0.09391442106829749] |
1,802.07141 | Arrival Time Distributions of Spin-1/2 Particles | The arrival time statistics of spin-1/2 particles governed by Pauli's
equation, and defined by their Bohmian trajectories, show unexpected and very
well articulated features. Comparison with other proposed statistics of arrival
times that arise from either the usual (convective) quantum flux or from
semiclassical considerations suggest testing the notable deviations in an
arrival time experiment, thereby probing the predictive power of Bohmian
trajectories. The suggested experiment, including the preparation of the wave
functions, could be done with present-day experimental technology.
| quant-ph | the arrival time statistics of spin12 particles governed by paulis equation and defined by their bohmian trajectories show unexpected and very well articulated features comparison with other proposed statistics of arrival times that arise from either the usual convective quantum flux or from semiclassical considerations suggest testing the notable deviations in an arrival time experiment thereby probing the predictive power of bohmian trajectories the suggested experiment including the preparation of the wave functions could be done with presentday experimental technology | [['the', 'arrival', 'time', 'statistics', 'of', 'spin12', 'particles', 'governed', 'by', 'paulis', 'equation', 'and', 'defined', 'by', 'their', 'bohmian', 'trajectories', 'show', 'unexpected', 'and', 'very', 'well', 'articulated', 'features', 'comparison', 'with', 'other', 'proposed', 'statistics', 'of', 'arrival', 'times', 'that', 'arise', 'from', 'either', 'the', 'usual', 'convective', 'quantum', 'flux', 'or', 'from', 'semiclassical', 'considerations', 'suggest', 'testing', 'the', 'notable', 'deviations', 'in', 'an', 'arrival', 'time', 'experiment', 'thereby', 'probing', 'the', 'predictive', 'power', 'of', 'bohmian', 'trajectories', 'the', 'suggested', 'experiment', 'including', 'the', 'preparation', 'of', 'the', 'wave', 'functions', 'could', 'be', 'done', 'with', 'presentday', 'experimental', 'technology']] | [-0.1024291444249684, 0.18251243058348338, -0.1160093966347631, 0.08269258052459919, -0.03361556122545153, -0.14430271966848524, 0.008345445789746008, 0.3142183935735375, -0.254553958971519, -0.3576952033065027, 0.029352653823480068, -0.2891431940020993, -0.092998515878935, 0.22452617903181818, -0.02952165435999632, 0.11911928384797647, 0.11181716205173871, 0.021022805041866377, -0.05063713717681821, -0.1803871683383477, 0.25879781564581206, 0.1226688445007312, 0.3144703147583641, -0.012111901032039896, 0.10687901512719691, 0.020660346895601832, -0.0636112354521174, 0.004922649639775045, -0.0799312113617816, 0.06082127980771475, 0.2292842115391977, 0.14341149399988354, 0.20757082561030984, -0.4921286588534713, -0.24924308327317704, 0.08023387371795251, 0.13181294083478862, 0.0952286464831559, -0.06682223072566558, -0.3984888937091455, -0.05338777572833351, -0.13487825656775385, -0.18041093669016844, -0.021077124026487582, -0.024216945568332447, 0.0699189058272168, -0.2041283353464678, 0.134442727673013, 0.028677193059411365, 0.038629065378336234, -0.031468154205504105, -0.1097012311918661, 0.004214242417947389, 0.10118756437732372, 0.10444285679695894, -0.004150034477061126, 0.17066523001412862, -0.12083683250239119, -0.1893173178192228, 0.41917421290418133, -0.05270105132367462, -0.1679614505090285, 0.15574290766380727, -0.18567167476285248, -0.0916239274200052, 0.11329978366848081, 0.08934500802424736, 0.06843437390343751, -0.15404236082686112, 0.036690888983139304, 0.025970442858124443, 0.10760465243365616, 0.08220371353672817, 0.030024074023822324, 0.24254044579574838, 0.14487194555113092, 0.02023488185950555, 0.045147580489719986, -0.08153937293682248, -0.1842577659524977, -0.31495097776642067, -0.12824575778795405, -0.22091314609861, 0.08789448684601667, -0.10557813764862659, -0.11177819627337157, 0.36573124504648147, 0.16062252572737634, 0.18901235518278553, 0.061496329377405345, 0.28425987230148164, 0.14342944875825198, 0.031217675071093253, 0.05438671074807644, 0.2532876327633858, 0.09112242531846278, 0.12090762633015402, -0.24185828889603728, 0.10522269981447607, -0.0060227166744880375] |
1,802.07142 | Mallows permutations as stable matchings | We show that the Mallows measure on permutations of $1,\ldots,n$ arises as
the law of the unique Gale-Shapley stable matching of the random bipartite
graph conditioned to be perfect, where preferences arise from a total ordering
of the vertices but are restricted to the (random) edges of the graph. We
extend this correspondence to infinite intervals, for which the situation is
more intricate. We prove that almost surely every stable matching of the random
bipartite graph obtained by performing Bernoulli percolation on the complete
bipartite graph $K_{\mathbb{Z},\mathbb{Z}}$ falls into one of two classes: a
countable family $(\sigma_n)_{n\in\mathbb{Z}}$ of tame stable matchings, in
which the length of the longest edge crossing $k$ is $O(\log |k|)$ as $k\to\pm
\infty$, and an uncountable family of wild stable matchings, in which this
length is $\exp \Omega(k)$ as $k\to +\infty$. The tame stable matching
$\sigma_n$ has the law of the Mallows permutation of $\mathbb{Z}$ (as
constructed by Gnedin and Olshanski) composed with the shift $k\mapsto k+n$.
The permutation $\sigma_{n+1}$ dominates $\sigma_{n}$ pointwise, and the two
permutations are related by a shift along a random strictly increasing
sequence.
| math.PR | we show that the mallows measure on permutations of 1ldotsn arises as the law of the unique galeshapley stable matching of the random bipartite graph conditioned to be perfect where preferences arise from a total ordering of the vertices but are restricted to the random edges of the graph we extend this correspondence to infinite intervals for which the situation is more intricate we prove that almost surely every stable matching of the random bipartite graph obtained by performing bernoulli percolation on the complete bipartite graph k_mathbbzmathbbz falls into one of two classes a countable family sigma_n_ninmathbbz of tame stable matchings in which the length of the longest edge crossing k is olog k as ktopm infty and an uncountable family of wild stable matchings in which this length is exp omegak as kto infty the tame stable matching sigma_n has the law of the mallows permutation of mathbbz as constructed by gnedin and olshanski composed with the shift kmapsto kn the permutation sigma_n1 dominates sigma_n pointwise and the two permutations are related by a shift along a random strictly increasing sequence | [['we', 'show', 'that', 'the', 'mallows', 'measure', 'on', 'permutations', 'of', '1ldotsn', 'arises', 'as', 'the', 'law', 'of', 'the', 'unique', 'galeshapley', 'stable', 'matching', 'of', 'the', 'random', 'bipartite', 'graph', 'conditioned', 'to', 'be', 'perfect', 'where', 'preferences', 'arise', 'from', 'a', 'total', 'ordering', 'of', 'the', 'vertices', 'but', 'are', 'restricted', 'to', 'the', 'random', 'edges', 'of', 'the', 'graph', 'we', 'extend', 'this', 'correspondence', 'to', 'infinite', 'intervals', 'for', 'which', 'the', 'situation', 'is', 'more', 'intricate', 'we', 'prove', 'that', 'almost', 'surely', 'every', 'stable', 'matching', 'of', 'the', 'random', 'bipartite', 'graph', 'obtained', 'by', 'performing', 'bernoulli', 'percolation', 'on', 'the', 'complete', 'bipartite', 'graph', 'k_mathbbzmathbbz', 'falls', 'into', 'one', 'of', 'two', 'classes', 'a', 'countable', 'family', 'sigma_n_ninmathbbz', 'of', 'tame', 'stable', 'matchings', 'in', 'which', 'the', 'length', 'of', 'the', 'longest', 'edge', 'crossing', 'k', 'is', 'olog', 'k', 'as', 'ktopm', 'infty', 'and', 'an', 'uncountable', 'family', 'of', 'wild', 'stable', 'matchings', 'in', 'which', 'this', 'length', 'is', 'exp', 'omegak', 'as', 'kto', 'infty', 'the', 'tame', 'stable', 'matching', 'sigma_n', 'has', 'the', 'law', 'of', 'the', 'mallows', 'permutation', 'of', 'mathbbz', 'as', 'constructed', 'by', 'gnedin', 'and', 'olshanski', 'composed', 'with', 'the', 'shift', 'kmapsto', 'kn', 'the', 'permutation', 'sigma_n1', 'dominates', 'sigma_n', 'pointwise', 'and', 'the', 'two', 'permutations', 'are', 'related', 'by', 'a', 'shift', 'along', 'a', 'random', 'strictly', 'increasing', 'sequence']] | [-0.17689120937387323, 0.20719656229270636, -0.06668026996985747, 0.05353062997736937, -0.05896341323256074, -0.15309601275150905, 0.07939369292417017, 0.36469945861968434, -0.3246064795693906, -0.22440796881767638, 0.07770620360859314, -0.33253052531417165, -0.11151449762289987, 0.09999309642681213, -0.09179416647458219, 0.04983785012122139, 0.05306246222174737, 0.13450418025506347, -0.011810256856273902, -0.26687649789520046, 0.302688223137154, -0.05543154376046209, 0.2438660760232237, -0.005574232961438345, 0.07376867897410909, 0.07020120859261225, -0.008861278251776199, 0.04453703975263267, -0.1804609531436143, 0.08019822452928912, 0.25091891089752527, 0.12911890878661253, 0.22770559897036763, -0.3242865421021491, -0.13852084785427773, 0.22380296256801302, 0.14396072945065713, 0.03655576089160318, 0.022764267510681523, -0.2685821494767756, 0.13186738750664517, -0.1294223042760892, -0.1048168941446563, 0.004980032364942468, 0.08769234123880441, 0.031437145310631964, -0.29315192297917236, 0.01734308988965127, 0.16506291115970423, 0.0525346916480241, 0.0517626455330991, -0.14388215203581148, -0.0404123854666446, 0.11176578227817761, 0.014079531512139469, 0.05945536458676451, 0.052609558495675904, -0.06353313932613877, -0.15995408458572424, 0.3797723095559285, -0.0501535654622601, -0.1443321018877408, 0.09592583882583179, -0.13362511177808883, -0.1836601464454545, 0.13977439045968854, 0.08231046087346615, 0.1572377771058864, -0.05982821400465674, 0.13485005597245167, -0.16785450865320986, 0.12049465485667978, 0.15928480668213177, 0.007413136851293653, 0.13311748168584261, 0.10900692899156822, 0.17138945196200622, 0.18665174719173816, 0.00014746947517472038, -0.08482143678440807, -0.28075402682997663, -0.10316564130670067, -0.23276691040903164, 0.09764772145014801, -0.19523464987982192, -0.2534237848961035, 0.3794591170160121, 0.07572702613915579, 0.2245488359980034, 0.15935078246736104, 0.19630665793554503, 0.08311513252556324, 0.006012089650560003, 0.09966988522779155, 0.08482657246333494, 0.17943757646612488, -0.04645662981326158, -0.1649540137997279, 0.08133278668889504, 0.13832136223045585] |
1,802.07143 | Breaking the Loop: Recursive Proofs for Coinductive Predicates in
Fibrations | The purpose of this paper is to develop and study recursive proofs of
coinductive predicates. Such recursive proofs allow one to discover proof goals
in the construction of a proof of a coinductive predicate, while still allowing
the use of up-to techniques. This approach lifts the burden to guess
invariants, like bisimulation relations, beforehand. Rather, they allow one to
start with the sought-after proof goal and develop the proof from there until a
point is reached, at which the proof can be closed through a recursion step.
Proofs given in this way are both easier to construct and to understand,
similarly to proofs given in cyclic proof systems or by appealing parameterised
coinduction.
In this paper, we develop a framework for recursive proofs of coinductive
predicates that are given through fibrational predicate liftings. This
framework is built on the so-called later modality, which has made its
appearance in type theoretic settings before. In particular, we show the
soundness and completeness of recursive proofs, we prove that compatible up-to
techniques can be used as inference rules in recursive proofs, and provide some
illustrating examples.
| cs.LO | the purpose of this paper is to develop and study recursive proofs of coinductive predicates such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate while still allowing the use of upto techniques this approach lifts the burden to guess invariants like bisimulation relations beforehand rather they allow one to start with the soughtafter proof goal and develop the proof from there until a point is reached at which the proof can be closed through a recursion step proofs given in this way are both easier to construct and to understand similarly to proofs given in cyclic proof systems or by appealing parameterised coinduction in this paper we develop a framework for recursive proofs of coinductive predicates that are given through fibrational predicate liftings this framework is built on the socalled later modality which has made its appearance in type theoretic settings before in particular we show the soundness and completeness of recursive proofs we prove that compatible upto techniques can be used as inference rules in recursive proofs and provide some illustrating examples | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'develop', 'and', 'study', 'recursive', 'proofs', 'of', 'coinductive', 'predicates', 'such', 'recursive', 'proofs', 'allow', 'one', 'to', 'discover', 'proof', 'goals', 'in', 'the', 'construction', 'of', 'a', 'proof', 'of', 'a', 'coinductive', 'predicate', 'while', 'still', 'allowing', 'the', 'use', 'of', 'upto', 'techniques', 'this', 'approach', 'lifts', 'the', 'burden', 'to', 'guess', 'invariants', 'like', 'bisimulation', 'relations', 'beforehand', 'rather', 'they', 'allow', 'one', 'to', 'start', 'with', 'the', 'soughtafter', 'proof', 'goal', 'and', 'develop', 'the', 'proof', 'from', 'there', 'until', 'a', 'point', 'is', 'reached', 'at', 'which', 'the', 'proof', 'can', 'be', 'closed', 'through', 'a', 'recursion', 'step', 'proofs', 'given', 'in', 'this', 'way', 'are', 'both', 'easier', 'to', 'construct', 'and', 'to', 'understand', 'similarly', 'to', 'proofs', 'given', 'in', 'cyclic', 'proof', 'systems', 'or', 'by', 'appealing', 'parameterised', 'coinduction', 'in', 'this', 'paper', 'we', 'develop', 'a', 'framework', 'for', 'recursive', 'proofs', 'of', 'coinductive', 'predicates', 'that', 'are', 'given', 'through', 'fibrational', 'predicate', 'liftings', 'this', 'framework', 'is', 'built', 'on', 'the', 'socalled', 'later', 'modality', 'which', 'has', 'made', 'its', 'appearance', 'in', 'type', 'theoretic', 'settings', 'before', 'in', 'particular', 'we', 'show', 'the', 'soundness', 'and', 'completeness', 'of', 'recursive', 'proofs', 'we', 'prove', 'that', 'compatible', 'upto', 'techniques', 'can', 'be', 'used', 'as', 'inference', 'rules', 'in', 'recursive', 'proofs', 'and', 'provide', 'some', 'illustrating', 'examples']] | [-0.07368371391807596, 0.01919005064629629, -0.15054940001178058, 0.12122489958925203, -0.16467083350989378, -0.17500978323015196, 0.10384274453377666, 0.3416964438708265, -0.302752489295325, -0.30218958827702563, 0.11577459041072473, -0.19404972709023235, -0.14022478495363166, 0.20279366960825368, -0.1345330322354706, 0.02494244610024311, 0.05813673653644942, 0.03597375904887411, -0.07028354040049321, -0.25777824998014515, 0.34000837930244054, -0.01935115265481866, 0.21276661518024778, 0.060150032374458234, 0.09634443649276582, 0.03609281382650707, -0.06823765008603452, -0.0020473935218945226, -0.14960458610867483, 0.14733635121479355, 0.3452660742678929, 0.19817954087650588, 0.2866689369509943, -0.4497068677647192, -0.08920286391856011, 0.0868222058529309, 0.16387090823279765, 0.1471119234083943, -0.005617509433195565, -0.27698236600053117, 0.12637999873160502, -0.16669471741557285, -0.1369478246375226, -0.153868310935948, -0.011704512052441555, -0.0008235364313278083, -0.23584746658710426, -0.05319471333094471, 0.18841554700330795, 0.09209818344135753, 0.004515857160310235, -0.061970566391125526, 0.02985795733615593, 0.0721823294135574, 0.019699310643415225, 0.010661194295637676, 0.07212946990179152, -0.07201742131232483, -0.1744885216950556, 0.3392633502090113, -0.005709511771177252, -0.19125326666497508, 0.18887276106254489, -0.044218669626403785, -0.20247015304344354, 0.06983482269722907, 0.09769977869585543, 0.14810003997895438, -0.1632795923954395, 0.07796098690707735, -0.0374501294919539, 0.16604749855659826, 0.11647770552809447, 0.055507765146471114, 0.17101454473726574, 0.14985187390254293, 0.05872775040073269, 0.17700586609333713, 0.05721777585039903, -0.08455465045182513, -0.3403646948039939, -0.18354769690166473, -0.11450210864187467, 0.013457744280537946, -0.07039372136908942, -0.18032781459274067, 0.35942373481767426, 0.19701847915736134, 0.14472020284385329, 0.17727987511246338, 0.3096352976955514, 0.11241734427809613, 0.0896169571842123, 0.04606162436825574, 0.1767630770879154, 0.15262712943469445, 0.1096248744180314, -0.07406814718718228, 0.1307718544216226, 0.19312527943198962] |
1,802.07144 | ILP-based Local Search for Graph Partitioning | Computing high-quality graph partitions is a challenging problem with
numerous applications. In this paper, we present a novel meta-heuristic for the
balanced graph partitioning problem. Our approach is based on integer linear
programs that solve the partitioning problem to optimality. However, since
those programs typically do not scale to large inputs, we adapt them to
heuristically improve a given partition. We do so by defining a much smaller
model that allows us to use symmetry breaking and other techniques that make
the approach scalable. For example, in Walshaw's well-known benchmark tables we
are able to improve roughly half of all entries when the number of blocks is
high.
| cs.DS cs.DC | computing highquality graph partitions is a challenging problem with numerous applications in this paper we present a novel metaheuristic for the balanced graph partitioning problem our approach is based on integer linear programs that solve the partitioning problem to optimality however since those programs typically do not scale to large inputs we adapt them to heuristically improve a given partition we do so by defining a much smaller model that allows us to use symmetry breaking and other techniques that make the approach scalable for example in walshaws wellknown benchmark tables we are able to improve roughly half of all entries when the number of blocks is high | [['computing', 'highquality', 'graph', 'partitions', 'is', 'a', 'challenging', 'problem', 'with', 'numerous', 'applications', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'metaheuristic', 'for', 'the', 'balanced', 'graph', 'partitioning', 'problem', 'our', 'approach', 'is', 'based', 'on', 'integer', 'linear', 'programs', 'that', 'solve', 'the', 'partitioning', 'problem', 'to', 'optimality', 'however', 'since', 'those', 'programs', 'typically', 'do', 'not', 'scale', 'to', 'large', 'inputs', 'we', 'adapt', 'them', 'to', 'heuristically', 'improve', 'a', 'given', 'partition', 'we', 'do', 'so', 'by', 'defining', 'a', 'much', 'smaller', 'model', 'that', 'allows', 'us', 'to', 'use', 'symmetry', 'breaking', 'and', 'other', 'techniques', 'that', 'make', 'the', 'approach', 'scalable', 'for', 'example', 'in', 'walshaws', 'wellknown', 'benchmark', 'tables', 'we', 'are', 'able', 'to', 'improve', 'roughly', 'half', 'of', 'all', 'entries', 'when', 'the', 'number', 'of', 'blocks', 'is', 'high']] | [-0.08459847699850798, 0.04385796265409293, -0.06317363980579777, 0.09284030563517094, -0.1832887091613547, -0.16347481470977612, 0.06902417270962528, 0.39170769205385886, -0.281852917965605, -0.3715717074875202, 0.12568616313230316, -0.25133475668405514, -0.17892208442909005, 0.19647276025541402, -0.10507909059352069, 0.12203276607518394, 0.09717935011873056, -0.010193147209334981, -0.05038585586050801, -0.2906498314098119, 0.29904506580593687, 0.01379195356922638, 0.2761350923378982, 0.03325996123237052, 0.08249641607161956, 0.0008870936300674522, -0.005634849078315137, 0.0615586106497277, -0.10526684863826732, 0.15373974586341152, 0.2881932031035561, 0.19182394783840412, 0.2969226899418842, -0.4388235325028223, -0.15725532549334242, 0.15733067861206276, 0.16152215287244567, 0.15244875442133182, -0.012919848695337013, -0.2010050625367849, 0.14021626417525113, -0.14600713199427076, -0.06368300835257051, -0.11406826851803258, 0.013733286994802594, -0.02710864296359769, -0.2882262804562709, -0.006279838711230291, 0.03145585065552344, -0.013379202013041961, -0.0134045073414368, -0.14476191017052364, 0.06405676510055652, 0.12181248426942923, -0.006349680608966284, 0.026327507473373164, 0.07692632704425638, -0.09843136971445617, -0.14303731673431616, 0.40177430650564255, -0.008917279683777856, -0.23315610169622772, 0.18976830200430145, -0.06057150182486684, -0.21766289684671425, 0.11119934459458347, 0.1997866414539102, 0.15769833826925606, -0.13353638822513017, 0.06115374505828152, -0.08589797545465883, 0.19087439304631618, 0.03099077206570655, -0.0026554204609796957, 0.15134863237229487, 0.16753038783618077, 0.1258173623656923, 0.17155167349685346, -0.003362714412408726, -0.08830483892880794, -0.2243819215401783, -0.12614894147608774, -0.21842135883182184, -0.007892198892848144, -0.06453302018417162, -0.18016146500465563, 0.3806755903211457, 0.2412086881964502, 0.21522444733246057, 0.11895802960282674, 0.3200561105558235, 0.08833817278435971, 0.1248612164081014, 0.10128667441420947, 0.13514644885112326, 0.06647211059936564, 0.07684388011693954, -0.16208666715990855, 0.050724902623591736, 0.07894350437412935] |
1,802.07145 | Coarse-Grained Simulation of DNA using LAMMPS | During the last decade coarse-grained nucleotide models have emerged that
allow us to DNA and RNA on unprecedented time and length scales. Among them is
oxDNA, a coarse-grained, sequence-specific model that captures the
hybridisation transition of DNA and many structural properties of single- and
double-stranded DNA. oxDNA was previously only available as standalone
software, but has now been implemented into the popular LAMMPS molecular
dynamics code. This article describes the new implementation and analyses its
parallel performance. Practical applications are presented that focus on
single-stranded DNA, an area of research which has been so far
under-investigated. The LAMMPS implementation of oxDNA lowers the entry barrier
for using the oxDNA model significantly, facilitates future code development
and interfacing with existing LAMMPS functionality as well as other
coarse-grained and atomistic DNA models.
| cond-mat.soft physics.bio-ph physics.comp-ph q-bio.BM | during the last decade coarsegrained nucleotide models have emerged that allow us to dna and rna on unprecedented time and length scales among them is oxdna a coarsegrained sequencespecific model that captures the hybridisation transition of dna and many structural properties of single and doublestranded dna oxdna was previously only available as standalone software but has now been implemented into the popular lammps molecular dynamics code this article describes the new implementation and analyses its parallel performance practical applications are presented that focus on singlestranded dna an area of research which has been so far underinvestigated the lammps implementation of oxdna lowers the entry barrier for using the oxdna model significantly facilitates future code development and interfacing with existing lammps functionality as well as other coarsegrained and atomistic dna models | [['during', 'the', 'last', 'decade', 'coarsegrained', 'nucleotide', 'models', 'have', 'emerged', 'that', 'allow', 'us', 'to', 'dna', 'and', 'rna', 'on', 'unprecedented', 'time', 'and', 'length', 'scales', 'among', 'them', 'is', 'oxdna', 'a', 'coarsegrained', 'sequencespecific', 'model', 'that', 'captures', 'the', 'hybridisation', 'transition', 'of', 'dna', 'and', 'many', 'structural', 'properties', 'of', 'single', 'and', 'doublestranded', 'dna', 'oxdna', 'was', 'previously', 'only', 'available', 'as', 'standalone', 'software', 'but', 'has', 'now', 'been', 'implemented', 'into', 'the', 'popular', 'lammps', 'molecular', 'dynamics', 'code', 'this', 'article', 'describes', 'the', 'new', 'implementation', 'and', 'analyses', 'its', 'parallel', 'performance', 'practical', 'applications', 'are', 'presented', 'that', 'focus', 'on', 'singlestranded', 'dna', 'an', 'area', 'of', 'research', 'which', 'has', 'been', 'so', 'far', 'underinvestigated', 'the', 'lammps', 'implementation', 'of', 'oxdna', 'lowers', 'the', 'entry', 'barrier', 'for', 'using', 'the', 'oxdna', 'model', 'significantly', 'facilitates', 'future', 'code', 'development', 'and', 'interfacing', 'with', 'existing', 'lammps', 'functionality', 'as', 'well', 'as', 'other', 'coarsegrained', 'and', 'atomistic', 'dna', 'models']] | [-0.08212789315551233, 0.06816881613978275, -0.042106020215970395, 0.0367954197482994, -0.060798893567138856, -0.22248422816180838, -0.019041552255489827, 0.424205707730009, -0.2674408480023535, -0.30408647468385214, 0.05286755320759347, -0.2557540236793172, -0.16388286067029603, 0.22724419949361338, 0.016817611111596655, 0.09571598406406477, 0.1397343180822925, -0.008918660421505383, 0.029301664887596137, -0.21364820835789522, 0.1466849730278437, 0.17625076064410117, 0.3076659026860188, 0.1030297598729913, 0.09364910262206999, -0.018558023159186213, -0.006279996078676329, -0.0021593476663558527, -0.19060609246164228, 0.16253637265270718, 0.24457596730370335, 0.16021572860459296, 0.2750246295884538, -0.5094374747087176, -0.27097915183896054, 0.008666808761727925, 0.21184232470292885, 0.20689353564879498, -0.05448949373004815, -0.22611138661606953, 0.07583448538744751, -0.2116752158026569, -0.042083793291105676, -0.11250323347854786, 0.02433024600524312, 0.06907228717150596, -0.15594658625956911, 0.02421770215822527, -0.004528839118742885, 0.12047713705195258, 0.004961095901671797, -0.172088724335369, -0.035454148501874165, 0.17967121504390468, 0.052669043647340284, 0.05635177367725051, 0.2224624562005584, -0.07138321950109318, -0.13710721935718678, 0.38372034973536545, -0.011469539641760862, -0.15379356395703955, 0.226986568634255, -0.021950747001056488, -0.18651759429978063, 0.128303846799267, 0.12251032049266192, 0.07769932285166131, -0.2067775238493386, 0.1239681993620112, 0.0239815957342776, 0.2236344384459349, 0.06756253208463582, 0.0059067601409669105, 0.214335841497478, 0.2629055725840422, -0.04828275201278022, 0.15084124802513263, -0.09318385747677754, -0.19778285039445528, -0.17051444655427567, -0.19355128827468993, -0.15527084968343843, -0.025635163351678505, -0.01797080407413887, -0.20159404544661252, 0.4054807165494332, 0.13322605131767118, 0.10393844203163798, 0.056898052808649555, 0.3083866019294454, -0.05554515397301517, 0.16834134850292826, -0.00022174174754092328, 0.13795321633537802, 0.051023254290115665, 0.10563117346654717, -0.19833103063014837, 0.13784063239850533, 0.01682126527437224] |
1,802.07146 | Stability and convergence of second order backward differentiation
schemes for parabolic Hamilton-Jacobi-Bellman equations | We study a second order BDF (Backward Differentiation Formula) scheme for the
numerical approximation of parabolic HJB (Hamilton-Jacobi-Bellman) equations.
The scheme under consideration is implicit, non-monotone, and second order
accurate in time and space. The lack of monotonicity prevents the use of
well-known convergence results for solutions in the viscosity sense. In this
work, we establish rigorous stability results in a general nonlinear setting as
well as convergence results for some particular cases with additional
regularity assumptions. While most results are presented for one-dimensional,
linear parabolic and non-linear HJB equations, some results are also extended
to multiple dimensions and to Isaacs equations. Numerical tests are included to
validate the method.
| math.NA | we study a second order bdf backward differentiation formula scheme for the numerical approximation of parabolic hjb hamiltonjacobibellman equations the scheme under consideration is implicit nonmonotone and second order accurate in time and space the lack of monotonicity prevents the use of wellknown convergence results for solutions in the viscosity sense in this work we establish rigorous stability results in a general nonlinear setting as well as convergence results for some particular cases with additional regularity assumptions while most results are presented for onedimensional linear parabolic and nonlinear hjb equations some results are also extended to multiple dimensions and to isaacs equations numerical tests are included to validate the method | [['we', 'study', 'a', 'second', 'order', 'bdf', 'backward', 'differentiation', 'formula', 'scheme', 'for', 'the', 'numerical', 'approximation', 'of', 'parabolic', 'hjb', 'hamiltonjacobibellman', 'equations', 'the', 'scheme', 'under', 'consideration', 'is', 'implicit', 'nonmonotone', 'and', 'second', 'order', 'accurate', 'in', 'time', 'and', 'space', 'the', 'lack', 'of', 'monotonicity', 'prevents', 'the', 'use', 'of', 'wellknown', 'convergence', 'results', 'for', 'solutions', 'in', 'the', 'viscosity', 'sense', 'in', 'this', 'work', 'we', 'establish', 'rigorous', 'stability', 'results', 'in', 'a', 'general', 'nonlinear', 'setting', 'as', 'well', 'as', 'convergence', 'results', 'for', 'some', 'particular', 'cases', 'with', 'additional', 'regularity', 'assumptions', 'while', 'most', 'results', 'are', 'presented', 'for', 'onedimensional', 'linear', 'parabolic', 'and', 'nonlinear', 'hjb', 'equations', 'some', 'results', 'are', 'also', 'extended', 'to', 'multiple', 'dimensions', 'and', 'to', 'isaacs', 'equations', 'numerical', 'tests', 'are', 'included', 'to', 'validate', 'the', 'method']] | [-0.10155196128921075, -0.03869523161768236, -0.05766645113260231, 0.0875389810609208, -0.14210479398342696, -0.14146020275286653, 0.015214857272803783, 0.3372462948106907, -0.2735199620238167, -0.24115046740255572, 0.18145500816489485, -0.2534192693311277, -0.15070799023590303, 0.24094014645300127, -0.0750091958367689, 0.1588049900347621, 0.08862366621932861, -0.028035850856791843, -0.10100398105992513, -0.27927888350730595, 0.33103071010078894, -0.014957963019101458, 0.23375559635460377, 0.047579592903970146, 0.11760579311204228, -0.04193453388711946, -0.03977657754651525, 0.033036519685314986, -0.18850070602175864, 0.09484610600312325, 0.2772426921535622, 0.02868193785913966, 0.3533401070162654, -0.4252175553532487, -0.21014970385215498, 0.04140105679715899, 0.11372549320909787, 0.14940378338056193, -0.06545987909829075, -0.2721373300237412, 0.11876249146139757, -0.1335722769166089, -0.2155669737268578, -0.16224095283753492, -0.038919931878759105, 0.09620066286562096, -0.3525834244591269, 0.12723626784996173, 0.10322168999542058, 0.028466112437573347, -0.1347622149602764, -0.07839287145550108, 0.0026053045855157753, 0.05101187324828722, 0.09357405695640905, -0.05570490684741261, 0.015412749769166113, -0.09119313203264028, -0.11829622965835204, 0.3789095168848607, -0.09156960678255101, -0.307276341420683, 0.20311366368550807, -0.12300396707670933, -0.1438143072078343, 0.12618175419047475, 0.17686714483001692, 0.17338776195591146, -0.15300440848064187, 0.08458305809710344, -0.06699090504341505, 0.1261975629104365, 0.07451510141518983, 0.0221644484506793, -0.010690175056118858, 0.13971993510653688, 0.12272137297973544, 0.11663790445309133, 0.015415839266709306, -0.1758208168310706, -0.38129170225372283, -0.17770882099853638, -0.09031156974590637, 0.010641241810199889, -0.12218835506196642, -0.13030125290494074, 0.3307530726667954, 0.15679300197146157, 0.1033281146379357, 0.13591187360103835, 0.2996054273479703, 0.21769125206099654, -0.04534138490191915, 0.0770164887436708, 0.21044720974592068, 0.18886929298010233, 0.13722694450989364, -0.23112980027905328, 0.07553628713993187, 0.18172445266761564] |
1,802.07147 | Practical Pulse Engineering: Gradient Ascent Without Matrix
Exponentiation | Since 2005 there has been a huge growth in the use of engineered control
pulses to perform desired quantum operations in systems such as NMR quantum
information processors. These approaches, which build on the original gradient
ascent pulse engineering (GRAPE) algorithm, remain computationally intensive
because of the need to calculate matrix exponentials for each time step in the
control pulse. Here we discuss how the propagators for each time step can be
approximated using the Trotter--Suzuki formula, and a further speed up achieved
by avoiding unnecessary operations. The resulting procedure can give a
substantial speed gain with negligible cost in propagator error, providing a
more practical approach to pulse engineering.
| quant-ph | since 2005 there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as nmr quantum information processors these approaches which build on the original gradient ascent pulse engineering grape algorithm remain computationally intensive because of the need to calculate matrix exponentials for each time step in the control pulse here we discuss how the propagators for each time step can be approximated using the trottersuzuki formula and a further speed up achieved by avoiding unnecessary operations the resulting procedure can give a substantial speed gain with negligible cost in propagator error providing a more practical approach to pulse engineering | [['since', '2005', 'there', 'has', 'been', 'a', 'huge', 'growth', 'in', 'the', 'use', 'of', 'engineered', 'control', 'pulses', 'to', 'perform', 'desired', 'quantum', 'operations', 'in', 'systems', 'such', 'as', 'nmr', 'quantum', 'information', 'processors', 'these', 'approaches', 'which', 'build', 'on', 'the', 'original', 'gradient', 'ascent', 'pulse', 'engineering', 'grape', 'algorithm', 'remain', 'computationally', 'intensive', 'because', 'of', 'the', 'need', 'to', 'calculate', 'matrix', 'exponentials', 'for', 'each', 'time', 'step', 'in', 'the', 'control', 'pulse', 'here', 'we', 'discuss', 'how', 'the', 'propagators', 'for', 'each', 'time', 'step', 'can', 'be', 'approximated', 'using', 'the', 'trottersuzuki', 'formula', 'and', 'a', 'further', 'speed', 'up', 'achieved', 'by', 'avoiding', 'unnecessary', 'operations', 'the', 'resulting', 'procedure', 'can', 'give', 'a', 'substantial', 'speed', 'gain', 'with', 'negligible', 'cost', 'in', 'propagator', 'error', 'providing', 'a', 'more', 'practical', 'approach', 'to', 'pulse', 'engineering']] | [-0.1025945330959406, 0.11423897342333063, -0.12033802830952813, 0.03429887714393606, -0.05025070362978361, -0.18719943848184564, 0.09465817328203809, 0.45401854138736697, -0.2808291082101112, -0.33122805180874737, 0.12721955072219399, -0.17451335222417996, -0.13243630323135716, 0.2461742861704393, -0.0798876312603666, 0.12446208448911256, 0.10219361847689883, -0.008685914816504174, -0.10197742892884311, -0.26946561991723933, 0.17386456106217918, 0.07300541785926642, 0.2630109002094039, 0.012868170998990536, 0.12488863031136464, 0.009699815822188446, -0.005642300552095879, -0.047112855658104476, -0.07358842278322712, 0.1137003779263151, 0.2929064062275839, 0.15375561721157283, 0.3430167060091414, -0.49385101052678443, -0.2119096379515461, 0.10170135204680264, 0.17774145460518245, 0.16291043192296373, -0.07088379994926403, -0.23217783213847062, 0.04288984447379004, -0.15714172854680908, -0.10034636001271957, -0.15712786439213564, 0.004268614744598215, -0.003948231749977408, -0.23929235317151654, 0.035430699379437346, 0.018610292486846446, 0.030236864267763765, 0.038597402128983625, -0.07780659069645811, 0.039440027404237875, 0.13529864536936986, 0.010744510066102851, 0.06295838560168208, 0.1558914062014744, -0.1084171268157661, -0.1555245044704696, 0.37051625497300517, -0.029384269072166222, -0.1937938201579858, 0.11757833825064484, -0.06269008991816505, -0.09612500807270408, 0.13796762111173436, 0.19103104044069452, 0.09641510286707092, -0.14773170084121046, 0.0645753374106293, 0.07096817269921303, 0.21336629543114793, 0.1049073797735301, 0.04944799345526421, 0.13577336602928963, 0.15469097888298247, 0.10793425917244431, 0.15930486848810688, -0.03906630571211942, -0.10061260082504966, -0.260059978522953, -0.1553544468077069, -0.1971569580279968, 0.053952039020474664, -0.09220263735716633, -0.1572807034054263, 0.40442030801839957, 0.17676926845769314, 0.15088486644778062, 0.05319492716913704, 0.3447426946452734, 0.1773674552402967, 0.1067203491137744, 0.08937425513835148, 0.20187326829711144, 0.10754165466747839, 0.11686421120539307, -0.24842611250721597, 0.06994167209221896, 0.04073700220112435] |
1,802.07148 | Correlated pseudo-marginal schemes for time-discretised stochastic
kinetic models | The challenging problem of conducting fully Bayesian inference for the
reaction rate constants governing stochastic kinetic models (SKMs) is
considered. Given the challenges underlying this problem, the Markov jump
process representation is routinely replaced by an approximation based on a
suitable time discretisation of the system of interest. Improving the accuracy
of these schemes amounts to using an ever finer discretisation level, which in
the context of the inference problem, requires integrating over the uncertainty
in the process at a predetermined number of intermediate times between
observations. Pseudo-marginal Metropolis-Hastings schemes are increasingly
used, since for a given discretisation level, the observed data likelihood can
be unbiasedly estimated using a particle filter. When observations are
particularly informative an auxiliary particle filter can be implemented, by
employing an appropriate construct to push the state particles towards the
observations in a sensible way. Recent work in state-space settings has shown
how the pseudo-marginal approach can be made much more efficient by correlating
the underlying pseudo-random numbers used to form the likelihood estimate at
the current and proposed values of the unknown parameters. We extend this
approach to the time-discretised SKM framework by correlating the innovations
that drive the auxiliary particle filter. We find that the resulting approach
offers substantial gains in efficiency over a standard implementation.
| stat.CO | the challenging problem of conducting fully bayesian inference for the reaction rate constants governing stochastic kinetic models skms is considered given the challenges underlying this problem the markov jump process representation is routinely replaced by an approximation based on a suitable time discretisation of the system of interest improving the accuracy of these schemes amounts to using an ever finer discretisation level which in the context of the inference problem requires integrating over the uncertainty in the process at a predetermined number of intermediate times between observations pseudomarginal metropolishastings schemes are increasingly used since for a given discretisation level the observed data likelihood can be unbiasedly estimated using a particle filter when observations are particularly informative an auxiliary particle filter can be implemented by employing an appropriate construct to push the state particles towards the observations in a sensible way recent work in statespace settings has shown how the pseudomarginal approach can be made much more efficient by correlating the underlying pseudorandom numbers used to form the likelihood estimate at the current and proposed values of the unknown parameters we extend this approach to the timediscretised skm framework by correlating the innovations that drive the auxiliary particle filter we find that the resulting approach offers substantial gains in efficiency over a standard implementation | [['the', 'challenging', 'problem', 'of', 'conducting', 'fully', 'bayesian', 'inference', 'for', 'the', 'reaction', 'rate', 'constants', 'governing', 'stochastic', 'kinetic', 'models', 'skms', 'is', 'considered', 'given', 'the', 'challenges', 'underlying', 'this', 'problem', 'the', 'markov', 'jump', 'process', 'representation', 'is', 'routinely', 'replaced', 'by', 'an', 'approximation', 'based', 'on', 'a', 'suitable', 'time', 'discretisation', 'of', 'the', 'system', 'of', 'interest', 'improving', 'the', 'accuracy', 'of', 'these', 'schemes', 'amounts', 'to', 'using', 'an', 'ever', 'finer', 'discretisation', 'level', 'which', 'in', 'the', 'context', 'of', 'the', 'inference', 'problem', 'requires', 'integrating', 'over', 'the', 'uncertainty', 'in', 'the', 'process', 'at', 'a', 'predetermined', 'number', 'of', 'intermediate', 'times', 'between', 'observations', 'pseudomarginal', 'metropolishastings', 'schemes', 'are', 'increasingly', 'used', 'since', 'for', 'a', 'given', 'discretisation', 'level', 'the', 'observed', 'data', 'likelihood', 'can', 'be', 'unbiasedly', 'estimated', 'using', 'a', 'particle', 'filter', 'when', 'observations', 'are', 'particularly', 'informative', 'an', 'auxiliary', 'particle', 'filter', 'can', 'be', 'implemented', 'by', 'employing', 'an', 'appropriate', 'construct', 'to', 'push', 'the', 'state', 'particles', 'towards', 'the', 'observations', 'in', 'a', 'sensible', 'way', 'recent', 'work', 'in', 'statespace', 'settings', 'has', 'shown', 'how', 'the', 'pseudomarginal', 'approach', 'can', 'be', 'made', 'much', 'more', 'efficient', 'by', 'correlating', 'the', 'underlying', 'pseudorandom', 'numbers', 'used', 'to', 'form', 'the', 'likelihood', 'estimate', 'at', 'the', 'current', 'and', 'proposed', 'values', 'of', 'the', 'unknown', 'parameters', 'we', 'extend', 'this', 'approach', 'to', 'the', 'timediscretised', 'skm', 'framework', 'by', 'correlating', 'the', 'innovations', 'that', 'drive', 'the', 'auxiliary', 'particle', 'filter', 'we', 'find', 'that', 'the', 'resulting', 'approach', 'offers', 'substantial', 'gains', 'in', 'efficiency', 'over', 'a', 'standard', 'implementation']] | [-0.05234056515422401, 0.08068328340315946, -0.09066723211367282, 0.07508115506107702, -0.06674470600317901, -0.12145870165820692, 0.05184118834569036, 0.3941485099407009, -0.28218513749268764, -0.3327145581942559, 0.10869902440515115, -0.20455665021758754, -0.09851397859274755, 0.21301974207020755, -0.05201161605114301, 0.09182908913802997, 0.09366856184307083, 0.008370322663940385, -0.05574690757558174, -0.256153967585677, 0.2640318744837748, 0.1272603220726088, 0.28961574061480766, -0.038644860955523636, 0.1533129566153424, 0.003979394829967562, -0.05230328126946036, 0.004983838595135111, -0.10524696215721856, 0.14464827873820588, 0.2666097786367201, 0.1297581389026078, 0.32982172728669196, -0.413147077261702, -0.23501996852418172, 0.1134242420347119, 0.16646682867381893, 0.11685632382565453, -0.02423807399702956, -0.2958534973140089, 0.04451785268078388, -0.17462781335428323, -0.09602712085164489, -0.08647075505433123, -0.035609041909061966, -0.0033127356740370604, -0.3206127167437794, 0.05761040382288361, 0.01844193484987233, 0.019910509444493362, -0.00040512117710261836, -0.13162314602307223, 0.005614628087829781, 0.09252726152594455, 0.04001483660679914, 0.025630137176846455, 0.13416944457078134, -0.12355374141395127, -0.11623223184087607, 0.34578643953034155, -0.05787826290336643, -0.2668630760775206, 0.14390743509953746, -0.06458123355334354, -0.1449969672147587, 0.16126149653308444, 0.1777056102802706, 0.1266670426192033, -0.19234595370134328, 0.07481713878387637, 0.006014827448118286, 0.1715239573006645, 0.014668580463829455, -0.010253110384577317, 0.17857381704530106, 0.2084130009443897, 0.06825106445603737, 0.10878899814878008, -0.10391329956993006, -0.14385362669547905, -0.25754546698624436, -0.1253798732573949, -0.19647401077629115, 0.0022145131506690397, -0.11418703899978706, -0.12502723694885556, 0.35728208619572155, 0.22642788900600247, 0.18941575811056535, 0.05476128300728425, 0.30337603937642116, 0.17460279542807394, 0.052904202786444775, 0.06792214869613379, 0.20068628312484252, 0.10296501552887226, 0.08510451243879895, -0.18382131770371238, 0.1285131578809175, 0.05615104815787133] |
1,802.07149 | On the search of the elusive Intermediate Mass Black-Holes | Ultra-Luminous X-ray sources (ULXs) are accreting black holes for which their
X-ray properties have been seen to be different to the case of stellar-mass
black hole binaries. For most of the cases their intrinsic energy spectra are
well described by a cold accretion disc (thermal) plus a curved high-energy
emission components. The mass of the black hole (BH) derived from the thermal
disc component is usually in the range of 100-10^5 solar masses, which have led
to the idea that this can represent strong evidence of the Intermediate Mass
Black Holes (IMBH), proposed to exist by theoretical studies but with no firm
detection (as a class) so far. Recent theoretical and observational
developments are leading towards the idea that these sources are instead
compact objects accreting at an unusual super-Eddington regime instead. On the
other hand, gravitational waves have been seen to be a useful tool for finding
(some of these) IMBHs. We give a brief overview about the recent advent of the
discovery of gravitational waves and their relationship with these so far
elusive IMBHs.
| astro-ph.HE | ultraluminous xray sources ulxs are accreting black holes for which their xray properties have been seen to be different to the case of stellarmass black hole binaries for most of the cases their intrinsic energy spectra are well described by a cold accretion disc thermal plus a curved highenergy emission components the mass of the black hole bh derived from the thermal disc component is usually in the range of 100105 solar masses which have led to the idea that this can represent strong evidence of the intermediate mass black holes imbh proposed to exist by theoretical studies but with no firm detection as a class so far recent theoretical and observational developments are leading towards the idea that these sources are instead compact objects accreting at an unusual supereddington regime instead on the other hand gravitational waves have been seen to be a useful tool for finding some of these imbhs we give a brief overview about the recent advent of the discovery of gravitational waves and their relationship with these so far elusive imbhs | [['ultraluminous', 'xray', 'sources', 'ulxs', 'are', 'accreting', 'black', 'holes', 'for', 'which', 'their', 'xray', 'properties', 'have', 'been', 'seen', 'to', 'be', 'different', 'to', 'the', 'case', 'of', 'stellarmass', 'black', 'hole', 'binaries', 'for', 'most', 'of', 'the', 'cases', 'their', 'intrinsic', 'energy', 'spectra', 'are', 'well', 'described', 'by', 'a', 'cold', 'accretion', 'disc', 'thermal', 'plus', 'a', 'curved', 'highenergy', 'emission', 'components', 'the', 'mass', 'of', 'the', 'black', 'hole', 'bh', 'derived', 'from', 'the', 'thermal', 'disc', 'component', 'is', 'usually', 'in', 'the', 'range', 'of', '100105', 'solar', 'masses', 'which', 'have', 'led', 'to', 'the', 'idea', 'that', 'this', 'can', 'represent', 'strong', 'evidence', 'of', 'the', 'intermediate', 'mass', 'black', 'holes', 'imbh', 'proposed', 'to', 'exist', 'by', 'theoretical', 'studies', 'but', 'with', 'no', 'firm', 'detection', 'as', 'a', 'class', 'so', 'far', 'recent', 'theoretical', 'and', 'observational', 'developments', 'are', 'leading', 'towards', 'the', 'idea', 'that', 'these', 'sources', 'are', 'instead', 'compact', 'objects', 'accreting', 'at', 'an', 'unusual', 'supereddington', 'regime', 'instead', 'on', 'the', 'other', 'hand', 'gravitational', 'waves', 'have', 'been', 'seen', 'to', 'be', 'a', 'useful', 'tool', 'for', 'finding', 'some', 'of', 'these', 'imbhs', 'we', 'give', 'a', 'brief', 'overview', 'about', 'the', 'recent', 'advent', 'of', 'the', 'discovery', 'of', 'gravitational', 'waves', 'and', 'their', 'relationship', 'with', 'these', 'so', 'far', 'elusive', 'imbhs']] | [-0.08564581838702517, 0.11428687472769525, -0.06750981403780835, 0.14637531594240238, -0.1455383926363928, -0.08749182494889413, 0.016172249716307437, 0.3988611114131553, -0.1595521079356383, -0.35035709641873836, 0.13048070017314914, -0.32957469613158275, -0.046045677526188745, 0.26804509942552873, -0.02228189454510617, 0.03929271623558764, 0.03319851416096623, -0.03044894509549652, -0.04723522919629301, -0.21585353915978756, 0.34043589063787033, 0.08963849101348648, 0.1566897705865891, -0.006502077457095895, 0.06006051903324468, -0.08620251168230815, -0.03348211360563125, 0.005598376163886444, -0.13030641960021708, 0.08776922825989979, 0.27900858056332384, 0.1259584784321487, 0.23214904772383826, -0.42139880300632543, -0.28261415030541165, 0.07216057604977062, 0.18051606987469962, 0.11396982526007507, -0.1488887061584475, -0.2567945594460304, 0.08011434265013252, -0.24076931968331336, -0.1555394459036844, -0.004637943506240845, 0.0718413391496454, 0.018987122446830783, -0.15770370870296443, 0.10863989979960025, 0.09750123307607803, -0.034608433411589694, -0.10733767039541688, -0.08471316505755697, -0.0356225388537028, 0.08761007559884872, 0.14318198576968696, 0.04105614015699497, 0.1853711823507079, -0.125080198857135, -0.11537725651104536, 0.34945187584763127, -0.0023987357411533595, -0.05223771980298417, 0.26556817632634194, -0.21255144235678017, -0.18466630046388932, 0.13576496628246137, 0.160237660000899, 0.16174554883336117, -0.1582795982834484, 0.029130783229442646, -0.0367796753280397, 0.1744734568840691, 0.05124492348837001, 0.14616323032749018, 0.4585612323667322, 0.11853971351869404, -0.02521767034066475, 0.09709235346909346, -0.11015638239282582, -0.03260231839226825, -0.2226816536991724, -0.09175515313233648, -0.14273097244756563, 0.12142236071771809, -0.0873595451854635, -0.1629625893750095, 0.3109824283234775, 0.10676837339997292, 0.20744245256829474, 0.007683518542908132, 0.28653281631434635, 0.11851362554289933, 0.05630155705846846, 0.10511830835204039, 0.39123994236362963, 0.14160653937874096, 0.10312399416097573, -0.19067692847223952, 0.04550844451279513, 0.021560058032295534] |
1,802.0715 | The Algebraic Approach to Duality: An Introduction | This survey article gives an elementary introduction to the algebraic
approach to Markov process duality, as opposed to the pathwise approach. In the
algebraic approach, a Markov generator is written as the sum of products of
simpler operators, which each have a dual with respect to some duality
function. We discuss at length the recent suggestion by Giardin\`a, Redig, and
others, that it may be a good idea to choose these simpler operators in such a
way that they form an irreducible representation of some known Lie algebra. In
particular, we collect the necessary background on representations of Lie
algebras that is crucial for this approach. We also discuss older work by Lloyd
and Sudbury on duality functions of product form and the relation between
intertwining and duality.
| math.PR math.RT | this survey article gives an elementary introduction to the algebraic approach to markov process duality as opposed to the pathwise approach in the algebraic approach a markov generator is written as the sum of products of simpler operators which each have a dual with respect to some duality function we discuss at length the recent suggestion by giardina redig and others that it may be a good idea to choose these simpler operators in such a way that they form an irreducible representation of some known lie algebra in particular we collect the necessary background on representations of lie algebras that is crucial for this approach we also discuss older work by lloyd and sudbury on duality functions of product form and the relation between intertwining and duality | [['this', 'survey', 'article', 'gives', 'an', 'elementary', 'introduction', 'to', 'the', 'algebraic', 'approach', 'to', 'markov', 'process', 'duality', 'as', 'opposed', 'to', 'the', 'pathwise', 'approach', 'in', 'the', 'algebraic', 'approach', 'a', 'markov', 'generator', 'is', 'written', 'as', 'the', 'sum', 'of', 'products', 'of', 'simpler', 'operators', 'which', 'each', 'have', 'a', 'dual', 'with', 'respect', 'to', 'some', 'duality', 'function', 'we', 'discuss', 'at', 'length', 'the', 'recent', 'suggestion', 'by', 'giardina', 'redig', 'and', 'others', 'that', 'it', 'may', 'be', 'a', 'good', 'idea', 'to', 'choose', 'these', 'simpler', 'operators', 'in', 'such', 'a', 'way', 'that', 'they', 'form', 'an', 'irreducible', 'representation', 'of', 'some', 'known', 'lie', 'algebra', 'in', 'particular', 'we', 'collect', 'the', 'necessary', 'background', 'on', 'representations', 'of', 'lie', 'algebras', 'that', 'is', 'crucial', 'for', 'this', 'approach', 'we', 'also', 'discuss', 'older', 'work', 'by', 'lloyd', 'and', 'sudbury', 'on', 'duality', 'functions', 'of', 'product', 'form', 'and', 'the', 'relation', 'between', 'intertwining', 'and', 'duality']] | [-0.0727057055264595, 0.0824466964934345, -0.12305004382324114, 0.1015915202393245, -0.1369445546915813, -0.10568092024914222, 0.035428051893177326, 0.38136280805338174, -0.300776223270077, -0.2557461127858005, 0.10791344614426635, -0.24815045480499975, -0.20450383145407613, 0.17925791351444786, -0.10300998841194087, -0.011757591782952659, 0.030583078776544426, 0.06535806666943245, -0.09784801867044735, -0.2538225421740208, 0.3563431979564484, 0.04765055598363688, 0.2595015734550543, 0.04149801769744954, 0.11549236416249187, 0.027193258621991845, -0.047150123569736024, -0.03695850458461791, -0.11910564511975963, 0.15063385301618837, 0.2840586108941352, 0.141606939581834, 0.2373096490973694, -0.40405494416336296, -0.11450509682617849, 0.11460325273856142, 0.16097102953426656, 0.0653680340064966, -0.030230272468543262, -0.2735316031248658, 0.06218800359783927, -0.23076528142337338, -0.127168770202843, -0.09580569295030728, 0.01950139056862099, 0.0019461011979728937, -0.24784914941528768, 0.005924024289697627, 0.09581485613671248, 0.046213500580051914, -0.056638218518173744, -0.09224061184249877, 0.026106823865120532, 0.0765228657037369, 0.03219625856195307, 0.08034170105747762, 0.06990436335399863, -0.08553623238003638, -0.1362099317339016, 0.3272048471189919, -0.03355478015146218, -0.22815096141130198, 0.20480545949249063, -0.1096897290481138, -0.18553628493646102, 0.042001072260063665, 0.1181688045107876, 0.128293518369901, -0.15680378802062478, 0.10533730492716131, -0.10200738288403954, 0.059400659257335064, 0.05926023604843067, 0.05468730790380505, 0.1564456486084964, 0.10738998410306522, 0.07066514285725134, 0.13722016295560024, 0.0665974827388709, -0.08784239715532749, -0.35763887519715354, -0.18865952582928003, -0.13142496600812592, 0.10042797805090231, -0.08124372187330664, -0.14729444697877625, 0.36222591231853585, 0.15362124452531134, 0.19593280128356128, 0.09482162189533483, 0.24160832966117596, 0.1354459021367802, 0.09766652287862598, 0.03351535442561726, 0.15557555889290597, 0.1934246074388284, 0.0600531328273064, -0.14359259685443249, 0.018614179151882126, 0.16657168735582673] |
1,802.07151 | Exact results for the $O(N)$ model with quenched disorder | We use scale invariant scattering theory to exactly determine the lines of
renormalization group fixed points for $O(N)$-symmetric models with quenched
disorder in two dimensions. Random fixed points are characterized by two
disorder parameters: a modulus that vanishes when approaching the pure case,
and a phase angle. The critical lines fall into three classes depending on the
values of the disorder modulus. Besides the class corresponding to the pure
case, a second class has maximal value of the disorder modulus and includes
Nishimori-like multicritical points as well as zero temperature fixed points.
The third class contains critical lines that interpolate, as $N$ varies,
between the first two classes. For positive $N$, it contains a single line of
infrared fixed points spanning the values of $N$ from $\sqrt{2}-1$ to $1$. The
symmetry sector of the energy density operator is superuniversal (i.e.
$N$-independent) along this line. For $N=2$ a line of fixed points exists only
in the pure case, but accounts also for the Berezinskii-Kosterlitz-Thouless
phase observed in presence of disorder.
| cond-mat.stat-mech hep-th | we use scale invariant scattering theory to exactly determine the lines of renormalization group fixed points for onsymmetric models with quenched disorder in two dimensions random fixed points are characterized by two disorder parameters a modulus that vanishes when approaching the pure case and a phase angle the critical lines fall into three classes depending on the values of the disorder modulus besides the class corresponding to the pure case a second class has maximal value of the disorder modulus and includes nishimorilike multicritical points as well as zero temperature fixed points the third class contains critical lines that interpolate as n varies between the first two classes for positive n it contains a single line of infrared fixed points spanning the values of n from sqrt21 to 1 the symmetry sector of the energy density operator is superuniversal ie nindependent along this line for n2 a line of fixed points exists only in the pure case but accounts also for the berezinskiikosterlitzthouless phase observed in presence of disorder | [['we', 'use', 'scale', 'invariant', 'scattering', 'theory', 'to', 'exactly', 'determine', 'the', 'lines', 'of', 'renormalization', 'group', 'fixed', 'points', 'for', 'onsymmetric', 'models', 'with', 'quenched', 'disorder', 'in', 'two', 'dimensions', 'random', 'fixed', 'points', 'are', 'characterized', 'by', 'two', 'disorder', 'parameters', 'a', 'modulus', 'that', 'vanishes', 'when', 'approaching', 'the', 'pure', 'case', 'and', 'a', 'phase', 'angle', 'the', 'critical', 'lines', 'fall', 'into', 'three', 'classes', 'depending', 'on', 'the', 'values', 'of', 'the', 'disorder', 'modulus', 'besides', 'the', 'class', 'corresponding', 'to', 'the', 'pure', 'case', 'a', 'second', 'class', 'has', 'maximal', 'value', 'of', 'the', 'disorder', 'modulus', 'and', 'includes', 'nishimorilike', 'multicritical', 'points', 'as', 'well', 'as', 'zero', 'temperature', 'fixed', 'points', 'the', 'third', 'class', 'contains', 'critical', 'lines', 'that', 'interpolate', 'as', 'n', 'varies', 'between', 'the', 'first', 'two', 'classes', 'for', 'positive', 'n', 'it', 'contains', 'a', 'single', 'line', 'of', 'infrared', 'fixed', 'points', 'spanning', 'the', 'values', 'of', 'n', 'from', 'sqrt21', 'to', '1', 'the', 'symmetry', 'sector', 'of', 'the', 'energy', 'density', 'operator', 'is', 'superuniversal', 'ie', 'nindependent', 'along', 'this', 'line', 'for', 'n2', 'a', 'line', 'of', 'fixed', 'points', 'exists', 'only', 'in', 'the', 'pure', 'case', 'but', 'accounts', 'also', 'for', 'the', 'berezinskiikosterlitzthouless', 'phase', 'observed', 'in', 'presence', 'of', 'disorder']] | [-0.1811921547369344, 0.18690631149885512, -0.02425668967632754, 0.019576934024891152, 0.00836407812450835, -0.1829409660436102, 0.09327371035483555, 0.3335766402749522, -0.21512618119318394, -0.24844565423804202, 0.07717549257532005, -0.3329503798768634, -0.1132083891744038, 0.1441414585334271, 0.025064882983791732, 0.020639050445814582, -0.0509580109723001, 0.06452687000412316, -0.1160998753191615, -0.22835856619002742, 0.3848913595595929, -0.04948633072421044, 0.2806871882695261, 0.03422826698737308, 0.05413924675390479, 0.010677159057065313, 0.02805372005760936, 0.05552415757916779, -0.12770378844678426, 0.013309822505800099, 0.22833638466227058, 0.0021333243736686804, 0.20633869212871928, -0.30622503963033004, -0.2103336265648804, 0.17418862873732688, 0.120041508291338, 0.09706934437383011, 0.015887468369328417, -0.2121282783988309, 0.0729918425315104, -0.08536976665934726, -0.21183172138574133, -0.009961891028242895, 0.06330568093939551, -0.00534207211984765, -0.2759151542448394, 0.06460443269471787, 0.02745201345048069, 0.11194415814575873, -0.04821005018172963, -0.12878280903428926, -0.08148283132911838, 0.15284376967247226, 0.06806998314693503, 0.030209747221392934, 0.1266745479861995, -0.14699292728515242, -0.0798555045857072, 0.3860232679539227, -0.08146918011854203, -0.14967728186664836, 0.1631736715568141, -0.1484402869121238, -0.15334366342895442, 0.17758215259112017, 0.103897131181189, 0.1180805299774788, -0.059155938211829164, 0.1411684195190901, -0.042097050051476494, 0.17266230899951465, 0.07638022156399009, 0.011682543339529297, 0.1957811299279066, 0.08206613979529634, 0.1041896894430032, 0.14979594714705377, -0.09574377774177785, -0.13304755174820976, -0.36668921875146526, -0.13387042191295354, -0.2117549184407662, 0.0690830238703971, -0.1515277296724283, -0.21317267722250627, 0.3841576218893308, 0.10765524661595312, 0.25786017759015695, 0.057696153153388184, 0.19024708143842872, 0.13417050827618887, 0.05542512811509715, 0.08383008597108225, 0.2095021055249076, 0.11896663711966193, 0.053553248481226286, -0.1897086325959771, 0.0012232675494271376, 0.11930197837258068] |
1,802.07152 | On an inverse source problem for the Biot's equations in electro-seismic
imaging | Electro-seismic imaging is a novel hybrid imaging modality in geophysical
exploration. This paper concerns an inverse source problem for Biot's equations
that arise in electro-seismic imaging. Using the time reversal method, we
derive an explicit reconstruction formula, which immediately gives the
uniqueness and stability of the reconstructed solution.
| math.AP | electroseismic imaging is a novel hybrid imaging modality in geophysical exploration this paper concerns an inverse source problem for biots equations that arise in electroseismic imaging using the time reversal method we derive an explicit reconstruction formula which immediately gives the uniqueness and stability of the reconstructed solution | [['electroseismic', 'imaging', 'is', 'a', 'novel', 'hybrid', 'imaging', 'modality', 'in', 'geophysical', 'exploration', 'this', 'paper', 'concerns', 'an', 'inverse', 'source', 'problem', 'for', 'biots', 'equations', 'that', 'arise', 'in', 'electroseismic', 'imaging', 'using', 'the', 'time', 'reversal', 'method', 'we', 'derive', 'an', 'explicit', 'reconstruction', 'formula', 'which', 'immediately', 'gives', 'the', 'uniqueness', 'and', 'stability', 'of', 'the', 'reconstructed', 'solution']] | [-0.09692783797315012, 0.020083658334745753, -0.10799259310200189, 0.048611517751245024, -0.11053238036887099, -0.1002584158074266, -0.04278015234497919, 0.3127048827397327, -0.3677392160316231, -0.3030015320982784, 0.15701319696866753, -0.2206975595812158, -0.18486275457204707, 0.21450280870097535, -0.08346066843175019, 0.0580282435597231, 0.09913952017571621, -0.04849722884440174, -0.08558568694934365, -0.1027478271334985, 0.24347827727130303, 0.01578405441250652, 0.31120128425148624, 0.04873739409958944, 0.18201815012920028, 0.05935366510918053, -0.03217398051250105, -0.022732118105826277, -0.18179663364890075, 0.1071271911181005, 0.2994795518995185, 0.16620133326311284, 0.25725436765545356, -0.42978794348891824, -0.22202312401107824, 0.07284713350236416, 0.16602968839773288, 0.12998592520549815, -0.14687034322802597, -0.28627675678581, 0.025868449301924556, -0.10412537322069208, -0.15559459589712787, -0.05497497562222028, -0.038810383315042905, -0.06207184114221794, -0.32713153298633796, 0.135221379333719, 0.06913507075902696, 0.07089216785971075, -0.20664151544527462, -0.0331028281749847, 0.07865537454684575, 0.08102584388689138, 0.01662439520199162, 0.01723471887332077, 0.028250963213698316, -0.16908570037048776, -0.11338521868068104, 0.31215320135621977, -0.0435821309996148, -0.21710740138466159, 0.13835733503219672, -0.05688208626816049, -0.13233444944489747, 0.1643813611008227, 0.17721873556729406, 0.200064225961493, -0.21859408971310282, 0.10677864257862286, -0.06755585188511759, 0.15405618073418736, 0.07719119944764923, -0.008876831435676044, 0.09969128454880168, 0.22212332133979848, 0.1224920157304344, 0.19129828296475657, -0.15140995561766127, -0.04398335594063004, -0.30153548954209936, -0.20544617733200235, -0.15693628498896336, 0.04498777290185293, -0.0770820787483899, -0.20053799380548298, 0.36578425609817106, 0.19262913630033532, 0.11242686671903357, 0.029922789120367572, 0.3540756994237502, 0.1958142793737352, 0.002668235703216245, 0.009407858917256817, 0.20968706242274493, 0.14467257558135316, 0.19471599895041436, -0.24644616415025666, 0.04034787207880678, 0.15743504247802775] |
1,802.07153 | Chow rings and gonality of general abelian varieties | We study the (covering) gonality of abelian varieties and their orbits of
zero-cycles for rational equivalence. We show that any orbit for rational
equivalence of zero-cycles of degree $k$ has dimension at most $k-1$. Building
on the work of Pirola, we show that very general abelian varieties of dimension
$g$ have covering gonality $k\geq f(g)$ where $f(g)$ grows like ${\rm log}\,g$.
This answers a question asked by Bastianelli, De Poi, Ein, Lazarsfeld and B.
Ullery. We also obtain results on the Chow ring of very general abelian
varieties, eg. if $g\geq 2k-1$, for any divisor $D\in {\rm Pic}^0(A)$, $D^k$ is
not a torsion cycle.
| math.AG | we study the covering gonality of abelian varieties and their orbits of zerocycles for rational equivalence we show that any orbit for rational equivalence of zerocycles of degree k has dimension at most k1 building on the work of pirola we show that very general abelian varieties of dimension g have covering gonality kgeq fg where fg grows like rm logg this answers a question asked by bastianelli de poi ein lazarsfeld and b ullery we also obtain results on the chow ring of very general abelian varieties eg if ggeq 2k1 for any divisor din rm pic0a dk is not a torsion cycle | [['we', 'study', 'the', 'covering', 'gonality', 'of', 'abelian', 'varieties', 'and', 'their', 'orbits', 'of', 'zerocycles', 'for', 'rational', 'equivalence', 'we', 'show', 'that', 'any', 'orbit', 'for', 'rational', 'equivalence', 'of', 'zerocycles', 'of', 'degree', 'k', 'has', 'dimension', 'at', 'most', 'k1', 'building', 'on', 'the', 'work', 'of', 'pirola', 'we', 'show', 'that', 'very', 'general', 'abelian', 'varieties', 'of', 'dimension', 'g', 'have', 'covering', 'gonality', 'kgeq', 'fg', 'where', 'fg', 'grows', 'like', 'rm', 'logg', 'this', 'answers', 'a', 'question', 'asked', 'by', 'bastianelli', 'de', 'poi', 'ein', 'lazarsfeld', 'and', 'b', 'ullery', 'we', 'also', 'obtain', 'results', 'on', 'the', 'chow', 'ring', 'of', 'very', 'general', 'abelian', 'varieties', 'eg', 'if', 'ggeq', '2k1', 'for', 'any', 'divisor', 'din', 'rm', 'pic0a', 'dk', 'is', 'not', 'a', 'torsion', 'cycle']] | [-0.2521177270241733, 0.07001727534620797, -0.09273956803315618, 0.048872793834764984, -0.10082848493498071, -0.23064247747539607, 0.009210483080626112, 0.3125814187693075, -0.2508356232225479, -0.22141394363851874, 0.05600497198236871, -0.25869089274585827, -0.1385950128936652, 0.22163124487382693, -0.18257013262584082, -0.051209641768578985, 0.04446598412740289, 0.11064710126945622, -0.04003990317007653, -0.4038653386377015, 0.41647643092296366, -0.07798670864781564, 0.15333692071670033, 0.08616975626175843, 0.08516537630478445, 0.024859309472252154, 0.043730092781948525, -0.019917780931279497, -0.24901009916547726, 0.09788507222959736, 0.3639820521534647, 0.12545347797404072, 0.1808324000997089, -0.2897152684592796, -0.14153088767813898, 0.2453821930148214, 0.0929026468276912, -0.011591872534922604, 0.009753625720142595, -0.18004394362418397, 0.16212353594962833, -0.15483196549362263, -0.1674251675072298, -0.060752943248569384, 0.16832808193126783, 0.0024246049488813263, -0.22054138888595898, -0.05389147388858458, 0.15331181505405642, 0.215382121668369, -0.01665011618639008, -0.18128597980265695, -0.07777959957280314, 0.04252847372463823, -0.02919368995850888, 0.08211961788016832, 0.05466160208927196, -0.10389319725687281, -0.08793368039300069, 0.375387548197748, -0.09854352494557071, -0.13939188922601706, 0.12375658904021443, -0.18229441071218513, -0.22188752050877739, 0.1036650055060977, 0.08658864772742958, 0.22377535491476505, 0.07183066193772779, 0.2593834254499615, -0.16690907085730325, 0.11158168905423684, 0.2167715963283644, -0.057945813290838116, 0.12398565535374817, 0.03851889217389946, 0.0914783646034425, 0.03828429724357528, -0.006359608310446577, 0.0891007711586443, -0.3036953305319241, -0.19652486268828795, -0.09933661174218993, 0.21675289750737206, -0.13706306369440602, -0.1278614257643162, 0.35307108335088466, 0.07036165252906605, 0.15951492111153395, 0.16620910924506707, 0.18681950195357927, -0.00903962731126298, -0.008398996120165057, 0.12838425353910882, 0.1157715061263552, 0.2117763346499646, -0.09132816873092964, -0.15582013271694767, -0.014759654531852134, 0.21653652686661887] |
1,802.07154 | On the support of matrix coefficients of supercuspidal representations
of the general linear group over a local non-archimedean field | We derive an upper bound on the support of matrix coefficients of
suprecuspidal representations of the general linear group over a
non-archimedean local field. The results are in par with those which can be
obtained from the Bushnell--Kutzko classification of supercuspidal
representations, but they are proved independently.
| math.RT math.NT | we derive an upper bound on the support of matrix coefficients of suprecuspidal representations of the general linear group over a nonarchimedean local field the results are in par with those which can be obtained from the bushnellkutzko classification of supercuspidal representations but they are proved independently | [['we', 'derive', 'an', 'upper', 'bound', 'on', 'the', 'support', 'of', 'matrix', 'coefficients', 'of', 'suprecuspidal', 'representations', 'of', 'the', 'general', 'linear', 'group', 'over', 'a', 'nonarchimedean', 'local', 'field', 'the', 'results', 'are', 'in', 'par', 'with', 'those', 'which', 'can', 'be', 'obtained', 'from', 'the', 'bushnellkutzko', 'classification', 'of', 'supercuspidal', 'representations', 'but', 'they', 'are', 'proved', 'independently']] | [-0.13546607509235162, 0.07876015464938499, -0.16573418615102445, 0.01967373704942672, -0.09732367207660624, -0.09903772619714879, -0.01293061647321219, 0.3290456544162463, -0.2907387569658053, -0.2652575095670055, 0.12741909272027324, -0.24205124613059603, -0.14866722512828268, 0.28098320366268087, -0.08669718000632913, -0.013528944802996904, 0.0375170366352667, 0.17083812727714362, -0.10381355783750262, -0.3341610843072767, 0.3341754715808708, -0.0009761589538791906, 0.2599084212485215, -0.006546119147020838, 0.05626288179875068, 0.007777923869940898, -0.06029007808588769, -0.02381540749363763, -0.07968330624229882, 0.17270504509645473, 0.3319507989141604, 0.09310109820216894, 0.1882884013162845, -0.4336059730014075, -0.1694232124997222, 0.1342772172116067, 0.13306070988714372, 0.10311299243324396, -0.0015618409379385412, -0.35745202102091, 0.13864243473938626, -0.1383146395319668, -0.05504640414501014, -0.10265540508249693, -0.04340648380583962, 0.06136884171839641, -0.3184608877434031, 0.04071680491419418, 0.09318751060282407, 0.12544423117461798, -0.15048921875068513, -0.1678484097583746, -0.010131092013224312, 0.1059505284520919, 0.002518204567225083, 0.04342756213863259, 0.0830983449477176, -0.1650910720370872, -0.08692076520832337, 0.3370719995835553, -0.12215874204412103, -0.22454279766964685, 0.20792139325614856, -0.15131857732067938, -0.12033493254515949, 0.08687574392103631, 0.1768358863039833, 0.12823802325874567, -0.08351318056330732, 0.1458148278457963, -0.1609522675204536, 0.1009096771063607, 0.05591430861259932, 0.011313475452049675, 0.15521370992064476, 0.029636811019609802, 0.07327494450399409, 0.05968409805285299, 0.020691280561985204, -0.0013686438678237407, -0.28283708785539086, -0.13433306308529017, -0.17255649338071438, 0.04954983727277621, -0.13637659324171103, -0.13149687500022675, 0.39917963953769725, 0.07409137642294493, 0.21554171682699866, 0.1814344369669688, 0.18456709627871928, 0.18034911554549699, 0.06928676544972089, 0.11677776051320783, 0.20303973166838937, 0.18959472399285954, -0.06682868737413589, -0.10509354302801353, 0.04355175515798771, 0.1521418295679209] |
1,802.07155 | The lithium depletion boundary and the age of the Hyades cluster | Determination of the lithium depletion boundary (LDB), i.e., the
observational limit below which the cores of very low-mass objects do not reach
high enough temperature for Li destruction, has been used to obtain ages for
several open clusters and stellar associations younger than 200 Myr, which
until now has been considered as the practical upper limit on the range of
applicability of this method. In this work we show that the LDB method can be
extended to significant older ages than previously thought. Intermediate
resolution optical spectra of six L-type candidate members in the Hyades
cluster obtained using OSIRIS at the 10.4-m Gran Telescopio Canarias are
presented. The Li~I 670.8~nm resonance doublet is clearly detected only in the
two faintest and coolest of these objects, which are classified as L3.5 to L4
brown dwarf cluster members with luminosities around 10$^{-4}$ solar. Lithium
depletion factors are estimated for our targets with the aid of synthetic
spectra and they are compared with predictions from evolutionary models. A LDB
age of 650$\pm$70 Myr for the Hyades provides a consistent description of our
data using a set of state-of-the-art evolutionary models for brown dwarfs
calculated by \citet{2015A&A..577..42}.
| astro-ph.SR | determination of the lithium depletion boundary ldb ie the observational limit below which the cores of very lowmass objects do not reach high enough temperature for li destruction has been used to obtain ages for several open clusters and stellar associations younger than 200 myr which until now has been considered as the practical upper limit on the range of applicability of this method in this work we show that the ldb method can be extended to significant older ages than previously thought intermediate resolution optical spectra of six ltype candidate members in the hyades cluster obtained using osiris at the 104m gran telescopio canarias are presented the lii 6708nm resonance doublet is clearly detected only in the two faintest and coolest of these objects which are classified as l35 to l4 brown dwarf cluster members with luminosities around 104 solar lithium depletion factors are estimated for our targets with the aid of synthetic spectra and they are compared with predictions from evolutionary models a ldb age of 650pm70 myr for the hyades provides a consistent description of our data using a set of stateoftheart evolutionary models for brown dwarfs calculated by citet2015aa57742 | [['determination', 'of', 'the', 'lithium', 'depletion', 'boundary', 'ldb', 'ie', 'the', 'observational', 'limit', 'below', 'which', 'the', 'cores', 'of', 'very', 'lowmass', 'objects', 'do', 'not', 'reach', 'high', 'enough', 'temperature', 'for', 'li', 'destruction', 'has', 'been', 'used', 'to', 'obtain', 'ages', 'for', 'several', 'open', 'clusters', 'and', 'stellar', 'associations', 'younger', 'than', '200', 'myr', 'which', 'until', 'now', 'has', 'been', 'considered', 'as', 'the', 'practical', 'upper', 'limit', 'on', 'the', 'range', 'of', 'applicability', 'of', 'this', 'method', 'in', 'this', 'work', 'we', 'show', 'that', 'the', 'ldb', 'method', 'can', 'be', 'extended', 'to', 'significant', 'older', 'ages', 'than', 'previously', 'thought', 'intermediate', 'resolution', 'optical', 'spectra', 'of', 'six', 'ltype', 'candidate', 'members', 'in', 'the', 'hyades', 'cluster', 'obtained', 'using', 'osiris', 'at', 'the', '104m', 'gran', 'telescopio', 'canarias', 'are', 'presented', 'the', 'lii', '6708nm', 'resonance', 'doublet', 'is', 'clearly', 'detected', 'only', 'in', 'the', 'two', 'faintest', 'and', 'coolest', 'of', 'these', 'objects', 'which', 'are', 'classified', 'as', 'l35', 'to', 'l4', 'brown', 'dwarf', 'cluster', 'members', 'with', 'luminosities', 'around', '104', 'solar', 'lithium', 'depletion', 'factors', 'are', 'estimated', 'for', 'our', 'targets', 'with', 'the', 'aid', 'of', 'synthetic', 'spectra', 'and', 'they', 'are', 'compared', 'with', 'predictions', 'from', 'evolutionary', 'models', 'a', 'ldb', 'age', 'of', '650pm70', 'myr', 'for', 'the', 'hyades', 'provides', 'a', 'consistent', 'description', 'of', 'our', 'data', 'using', 'a', 'set', 'of', 'stateoftheart', 'evolutionary', 'models', 'for', 'brown', 'dwarfs', 'calculated', 'by', 'citet2015aa57742']] | [-0.01247025584449738, 0.1323615089168587, -0.09070914950836158, 0.10739510877640596, -0.07933810747354121, -0.10836487606470108, 0.080470367463998, 0.42704932552065056, -0.11535982013660537, -0.4266841448745958, 0.08810693061488793, -0.2681406294068819, 0.01082522665633191, 0.24275679109649762, -0.06289862776577414, -0.008278874826680927, 0.13331164373084903, -0.001929271200681544, -0.013992619713529436, -0.290952459503092, 0.2616028107711265, 0.04545928818217591, 0.12969722716090226, -0.036398993434472234, 0.03626873199425696, -0.1507035711004901, -0.03623249207096691, -0.04276674117951493, -0.17172136345741257, 0.05998182794992222, 0.2734649759997734, 0.08809938082588514, 0.21982330902777028, -0.3200315073405573, -0.21986618558071672, 0.05820477033687356, 0.21837935498818092, 0.02853229059776808, -0.0695401353209038, -0.31535937161189725, 0.1325190170949466, -0.17912464112309123, -0.16314441054883896, 0.04158864103267408, 0.06003395425331296, 0.006451493369278873, -0.2259366592753152, 0.10840333763909824, -0.01844288611599288, 0.13077598475562824, -0.1770959408705108, -0.22131711711219623, -0.037614913829187836, 0.1191021155843911, -0.03733786296084796, 0.03722062573709686, 0.11725782975066863, -0.0878836132405589, -0.05148000457367972, 0.37881563958853326, -0.12300252811620573, 0.010010258160551025, 0.28289925879481886, -0.16570763521783874, -0.1624235069861938, 0.1270353732708627, 0.10524560630331255, 0.15238904193560568, -0.21406711642423168, 0.013526883354490983, -0.024176177960035454, 0.18961237765743802, 0.07912364266130156, 0.06435656301306648, 0.2800683759199212, 0.16572745058091884, 0.0004700371539659057, 0.03896651401809851, -0.22580725938101245, -0.05991099974754905, -0.19750487459479119, -0.1175759917982069, -0.11558098564319391, 0.04030494559326158, -0.07967345960810354, -0.11730242425731885, 0.292512346215117, 0.16256854830417022, 0.1961458310319101, 0.0536409655009294, 0.2630329210212435, 0.07861768961977031, 0.15617733095718928, 0.0916903526766021, 0.2986979892560286, 0.18834240576227962, 0.07723635668422617, -0.2331229172036276, 0.08239577445433187, 0.024013903789241745] |
1,802.07156 | $B$ decay anomalies and dark matter from strong dynamics | Indications of lepton flavor universality violation in semileptonic $B$
decays to $K$ or $K^*$ and muons or electrons can be explained by leptoquark
exchange. I present a model in which the leptoquark is a bound state of
constituents charged under a new confining SU($N_{\rm HC}$) hypercolor
interaction. The lightest neutral bound state in the theory is an asymmetric
dark matter candidate, that might be directly detectable through its magnetic
dipole moment interaction.
| hep-ph | indications of lepton flavor universality violation in semileptonic b decays to k or k and muons or electrons can be explained by leptoquark exchange i present a model in which the leptoquark is a bound state of constituents charged under a new confining sun_rm hc hypercolor interaction the lightest neutral bound state in the theory is an asymmetric dark matter candidate that might be directly detectable through its magnetic dipole moment interaction | [['indications', 'of', 'lepton', 'flavor', 'universality', 'violation', 'in', 'semileptonic', 'b', 'decays', 'to', 'k', 'or', 'k', 'and', 'muons', 'or', 'electrons', 'can', 'be', 'explained', 'by', 'leptoquark', 'exchange', 'i', 'present', 'a', 'model', 'in', 'which', 'the', 'leptoquark', 'is', 'a', 'bound', 'state', 'of', 'constituents', 'charged', 'under', 'a', 'new', 'confining', 'sun_rm', 'hc', 'hypercolor', 'interaction', 'the', 'lightest', 'neutral', 'bound', 'state', 'in', 'the', 'theory', 'is', 'an', 'asymmetric', 'dark', 'matter', 'candidate', 'that', 'might', 'be', 'directly', 'detectable', 'through', 'its', 'magnetic', 'dipole', 'moment', 'interaction']] | [-0.14217806405374883, 0.37260557239824266, -0.04808412010606844, 0.15183644660606255, -0.07817758117905921, -0.23258813134291106, 0.07768178475170215, 0.2861431688231985, -0.21460442723602885, -0.30689533750733566, -0.06370330575898858, -0.29420328710693866, 0.005570371926296502, 0.022002626847501636, 0.11935793585790735, -0.03615068806700745, 0.026388456535642035, 0.051129526161174804, -0.01835846081828802, -0.20138402855243637, 0.23569548668779639, 0.008300456515927281, 0.18081209914331944, 0.15045548839568962, -0.025603652394945838, -0.04842211076498239, 0.07037733649162368, -0.0365003873141379, -0.07317465839039666, 0.0429417154001486, 0.14115017950179107, 0.09708193567995396, 0.08614769917201354, -0.3879730856537612, -0.13032679051522994, 0.19023301328221956, 0.18491406977409497, 0.09147137873515021, -0.12978704146937364, -0.3920454169985735, 0.04979961325362739, -0.19480371675712782, -0.11531596908268209, -0.09080363745548918, -0.010882418783795502, -0.07727021808871844, -0.3890095459193819, 0.1355664658605949, 0.0017883474970909043, -0.006808207986371902, -0.04721020881455237, -0.19970772244657078, -0.03293771209428087, -0.03634079637575067, 0.15855986849217313, 0.07948678971863249, 0.2079578922970945, -0.21684014632935739, -0.18327859457349405, 0.3922222576414545, -0.14252721449722433, -0.1731274502688191, 0.1489852148289275, -0.17993731583960149, -0.1351311274467864, 0.16920670595330498, 0.2034175557912224, 0.08959855683820529, -0.2006285593120588, 0.16460684243793366, -0.10677614549381866, 0.16051889627124183, 0.016604009821700554, 0.03679985532330142, 0.33553724580754835, 0.16236232805790174, 0.050082451146509915, 0.0885311235841881, -0.07537219415987945, -0.04213137966063288, -0.38567575677815413, -0.162143805305176, -0.15677720506856632, 0.10455351062975954, -0.028428700758821732, -0.08364859627585651, 0.3566184904064155, 0.0495556587443894, 0.19409223463541517, -0.09417887253059437, 0.2706177310837019, 0.07214873480714029, 0.06804830701003084, 0.061282743240654886, 0.317317780922167, 0.1969003359198622, 0.0703547697307335, -0.2634911531187956, 0.050980400268195405, 0.06927109348018551] |
1,802.07157 | Comment on "A structural test for the conformal invariance of the
critical 3d Ising model" by S. Meneses, S. Rychkov, J. M. Viana Parente Lopes
and P. Yvernay. arXiv:1802.02319 | In a recent preprint [ArXiv 1802.02319], Meneses et al. challenge our proof
that scale invariance implies conformal invariance for the three-dimensional
Ising model [B. Delamotte, M. Tissier and N. Wschebor, Phys. Rev. E 93 (2016),
012144.]. We refute their arguments. We also point out a mistake in their
one-loop calculation of the dimension of the vector operator $V_\mu$ of lowest
dimension which is not a total derivative.
| hep-th cond-mat.stat-mech hep-lat | in a recent preprint arxiv 180202319 meneses et al challenge our proof that scale invariance implies conformal invariance for the threedimensional ising model b delamotte m tissier and n wschebor phys rev e 93 2016 012144 we refute their arguments we also point out a mistake in their oneloop calculation of the dimension of the vector operator v_mu of lowest dimension which is not a total derivative | [['in', 'a', 'recent', 'preprint', 'arxiv', '180202319', 'meneses', 'et', 'al', 'challenge', 'our', 'proof', 'that', 'scale', 'invariance', 'implies', 'conformal', 'invariance', 'for', 'the', 'threedimensional', 'ising', 'model', 'b', 'delamotte', 'm', 'tissier', 'and', 'n', 'wschebor', 'phys', 'rev', 'e', '93', '2016', '012144', 'we', 'refute', 'their', 'arguments', 'we', 'also', 'point', 'out', 'a', 'mistake', 'in', 'their', 'oneloop', 'calculation', 'of', 'the', 'dimension', 'of', 'the', 'vector', 'operator', 'v_mu', 'of', 'lowest', 'dimension', 'which', 'is', 'not', 'a', 'total', 'derivative']] | [-0.1289549651555717, 0.10206046607345343, -0.06172171098953714, -0.02184336734447448, -0.11278582832986309, -0.1056194681065878, 0.0932383639437537, 0.2675741949839698, -0.12893715856837168, -0.3203831205084439, -0.002774432816001917, -0.2914899195874891, -0.18458612989859596, 0.09999657920261304, -0.09226867657214884, 0.07117384624847721, 0.008976294659078121, -0.03674896859053162, -0.06820490930770193, -0.3588445138246302, 0.22775836101162336, 0.10630781387613576, 0.2517370326414464, 0.10990343299964743, 0.06493078975848132, 0.04722069976701131, -0.06525489973324922, -0.037609441619884644, -0.17992200117031085, 0.05663895049292478, 0.16613984279214375, 0.06854857991810047, 0.23660736861488513, -0.34826957823468313, -0.1702312791622394, 0.1332507137840073, 0.06124967407254923, 0.12425283582941178, 0.03180382728591682, -0.3156610318429528, 0.10593545766952898, -0.21670113941804775, -0.1919656429710167, -0.09617849355263094, 0.176217949228181, -0.11164631619448623, -0.2705530441317317, 0.14941943196097254, 0.15158982140823238, 0.1002768353979674, 0.009567764772650516, -0.10724075312816328, -0.06091575538964882, -0.025157540597231878, 0.010419061544516514, 0.13957907840038739, 0.06978375802657777, -0.05727229797611794, -0.16347907943230483, 0.32613457773902244, -0.0695912157515845, -0.1906560547950287, 0.18537431070956611, -0.14151563830373268, -0.2034195054232353, 0.05215594402641493, 0.1410559673320442, 0.15782038199024334, -0.1106683898176397, 0.2580748292863474, -0.13923190723712212, 0.14617374455490556, 0.10182521070143388, -0.027283592472573923, 0.1196978144768265, 0.040191036378664356, 0.003665131952373251, 0.0416947991376923, -0.027610815389292134, -0.07846783099774902, -0.4100649216843228, -0.2037227845510408, -0.23771606961024866, 0.1387981380105503, -0.026188085336123608, -0.1156697403188915, 0.337245536787856, 0.16540811010594142, 0.2592438464578722, 0.04542093357679645, 0.18000499627387692, 0.09864553972335172, 0.017475947441961317, 0.171512512362472, 0.23677681578743842, 0.15898175213125446, 0.13109101691365904, -0.17631266882733232, -0.06330805670492531, 0.19828720218051346] |
1,802.07158 | Friction and Radiative Heat Exchange in a System of Two Parallel Plates
Moving Sideways : Levin-Polevoy-Rytov Theory Revisited | It is shown that the fundamental results obtained in the works by Levine,
Polevoi, Rytov (1980) and Polevoi (1990), based on the
fluctuation-electromagnetic theory by Levine and Rytov, adequately describe the
rate of radiative heat exchange and the frictional force in a system of two
parallel thick plates in relative lateral motion. A numerically calculated
friction force for good metals and thin gaps turns out to be by a factor 107
higher than earlier obtained by Polevoi and increases with increasing
conductivity of the metals.
| cond-mat.mes-hall | it is shown that the fundamental results obtained in the works by levine polevoi rytov 1980 and polevoi 1990 based on the fluctuationelectromagnetic theory by levine and rytov adequately describe the rate of radiative heat exchange and the frictional force in a system of two parallel thick plates in relative lateral motion a numerically calculated friction force for good metals and thin gaps turns out to be by a factor 107 higher than earlier obtained by polevoi and increases with increasing conductivity of the metals | [['it', 'is', 'shown', 'that', 'the', 'fundamental', 'results', 'obtained', 'in', 'the', 'works', 'by', 'levine', 'polevoi', 'rytov', '1980', 'and', 'polevoi', '1990', 'based', 'on', 'the', 'fluctuationelectromagnetic', 'theory', 'by', 'levine', 'and', 'rytov', 'adequately', 'describe', 'the', 'rate', 'of', 'radiative', 'heat', 'exchange', 'and', 'the', 'frictional', 'force', 'in', 'a', 'system', 'of', 'two', 'parallel', 'thick', 'plates', 'in', 'relative', 'lateral', 'motion', 'a', 'numerically', 'calculated', 'friction', 'force', 'for', 'good', 'metals', 'and', 'thin', 'gaps', 'turns', 'out', 'to', 'be', 'by', 'a', 'factor', '107', 'higher', 'than', 'earlier', 'obtained', 'by', 'polevoi', 'and', 'increases', 'with', 'increasing', 'conductivity', 'of', 'the', 'metals']] | [-0.1055213309098583, 0.1417229147573166, -0.061142191729124856, 0.030419745818054414, 0.00904775960918735, -0.10402832936276407, 0.050465679446728355, 0.335313709923888, -0.2283497510368333, -0.32222094632246917, 0.04257933610420236, -0.27890631920274567, -0.12738729170797503, 0.24722138580811373, -0.05068539692198529, 0.04952711930279346, 0.009017739696976017, -0.05656851697987055, -0.03187491151723353, -0.2262304845101693, 0.27609494120320854, 0.10236592965803164, 0.28364273901371395, 0.07777396428179653, 0.062296846147407506, 0.0067673492601470035, -0.04818777890656801, 0.08394762185566565, -0.17053424147110063, 0.07064642170991968, 0.18705755757058368, -0.08073926594875315, 0.21367367994697656, -0.44184160063810207, -0.22977384613717303, -0.01454454644528382, 0.09315180045497769, 0.08694384835441323, -0.004348318625296302, -0.25592687191332086, 0.048427487641353816, -0.17463099933503307, -0.11354547700680354, -0.05107374244972187, 0.09770121228168993, 0.022599818809505772, -0.22906180087490666, 0.12714135995244277, 0.08344783388285364, 0.060927525447571976, -0.07347761905368637, -0.13912482023211745, -0.04270969151574023, 0.06675088114159948, 0.08353385690544897, 0.08420566990971565, 0.1657089762362268, -0.10576371279380778, -0.07365994889508276, 0.35846402230946456, -0.10270898431515568, -0.13989025277688222, 0.16418114448623622, -0.1618497933206313, 0.009410055670270916, 0.16084784371230532, 0.06352257646948975, 0.09953265510609045, -0.14137831435484044, 0.06714756241931087, -0.028567973820163923, 0.135300497609355, 0.1217399423585876, -0.08605679064057767, 0.1703223240780918, 0.11778872355216127, -0.023582074396750505, 0.12291485737488769, -0.038087549320805596, -0.08658056581283317, -0.19219861645251513, -0.17077207507236916, -0.18981999477426356, 0.06714002223794951, -0.0816712628274485, -0.10728908035568618, 0.31207812991650663, 0.11311011170037091, 0.17659685384920415, 0.012608467853244614, 0.2959979905253824, 0.12151765054201379, 0.0783086190767148, 0.09462434573318151, 0.3232734438031912, 0.20405688569607103, 0.12797126057027045, -0.2531345769379507, 0.037169342296992376, 0.08131215832031825] |
1,802.07159 | A Closed-loop controller to improve the Stability of Cascaded DC/DC
Converters | Study of the buck converter and cascaded system considering the voltage mode
controller has been done. First the small signal analysis of a buck dc/dc
converter is presented and its mathematical representation has been showed.
Then, the cascaded converter model regarding close loop impedances and voltage
gain has been studied. The controller for this converter is proposed to
stabilize the performance of the plant. The effectiveness of the proposed
controller has been tested on a typical buck converter.
| eess.SP | study of the buck converter and cascaded system considering the voltage mode controller has been done first the small signal analysis of a buck dcdc converter is presented and its mathematical representation has been showed then the cascaded converter model regarding close loop impedances and voltage gain has been studied the controller for this converter is proposed to stabilize the performance of the plant the effectiveness of the proposed controller has been tested on a typical buck converter | [['study', 'of', 'the', 'buck', 'converter', 'and', 'cascaded', 'system', 'considering', 'the', 'voltage', 'mode', 'controller', 'has', 'been', 'done', 'first', 'the', 'small', 'signal', 'analysis', 'of', 'a', 'buck', 'dcdc', 'converter', 'is', 'presented', 'and', 'its', 'mathematical', 'representation', 'has', 'been', 'showed', 'then', 'the', 'cascaded', 'converter', 'model', 'regarding', 'close', 'loop', 'impedances', 'and', 'voltage', 'gain', 'has', 'been', 'studied', 'the', 'controller', 'for', 'this', 'converter', 'is', 'proposed', 'to', 'stabilize', 'the', 'performance', 'of', 'the', 'plant', 'the', 'effectiveness', 'of', 'the', 'proposed', 'controller', 'has', 'been', 'tested', 'on', 'a', 'typical', 'buck', 'converter']] | [-0.147712741787426, -0.030773899828394253, -0.08074229078080791, -0.08058789349011838, -0.04595926360418208, -0.2326921279577968, 0.021111273881382286, 0.37341653163700056, -0.20397153629276615, -0.27581383929086417, 0.1282028050567859, -0.24216137056310588, -0.12522970624745655, 0.28244470537174493, -0.1263930283439083, 0.17658925880842175, 0.02317395070806528, 0.06350270992156883, 0.027475097371886175, -0.17203709998956093, 0.2167273719275657, 0.11720706111727616, 0.3995335651412367, 0.02066892174144204, 0.22443368426562907, -0.13269381686292875, 0.03416835178788274, -0.06518641321991499, -0.044215670285316616, -0.004245710632322022, 0.24190540457717502, 0.08887037206799366, 0.281226807870926, -0.4170947829500223, -0.23607874701086146, 0.08024941425985442, 0.12015440321873683, 0.06979420356667386, -0.10051063415504849, -0.2629981674492741, 0.16413039243063673, -0.27322539139109164, -0.013018100020977167, -0.04091156659444842, -0.005352094279936491, 0.030700558292058606, -0.275578776995341, -0.057633202511053055, 0.10479440839173129, 0.04729397821789368, -0.028752700068975966, -0.13385931233344123, -0.03790705200905601, 0.13162302437838383, -0.026606485469995115, -0.0065248354475419875, 0.156763635814572, -0.038404484395869076, -0.138245094095906, 0.30742989752429706, 0.0023535520751745654, -0.23139131145599562, 0.11814810644584493, -0.09805456501169083, -0.021354107783199884, 0.12183847853866143, 0.24221308942502126, 0.005113882752947318, -0.17766167795381102, 0.08307588316324072, 0.0030989360589629565, 0.22774567908774584, 0.11105142186921185, -0.062336710472710624, 0.14128469864730364, 0.33849451960756993, 0.014935780185250899, 0.2207538067148282, -0.12773681985727775, -0.06803790708102334, -0.22061969751629454, -0.12111727076654251, -0.16535986296180338, -0.05144141424441328, 0.019546642535901926, -0.08216313525843315, 0.46349476153651875, 0.09470349772331807, 0.08616822314424774, -0.017853109088415902, 0.4099129968537734, 0.23682606555760288, 0.09425538543683405, 0.021696657655784525, 0.3217881128239708, 0.18081810812537485, 0.15504746610083833, -0.29982646932610524, 0.1012112695741682, 0.032347577809093475] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.