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.0136 | ORLA/OLAA: Orthogonal Coexistence of LAA and WiFi in Unlicensed Spectrum | Future mobile networks will exploit unlicensed spectrum to boost capacity and
meet growing user demands cost-effectively. The 3GPP has recently defined a
Licensed-Assisted Access (LAA) scheme to enable global Unlicensed LTE (U-LTE)
deployment, aiming at ($i$) ensuring fair coexistence with incumbent WiFi
networks, i.e., impacting on their performance no more than another WiFi
device, and ($ii$) achieving superior airtime efficiency as compared to WiFi.
In this paper we show the standardized LAA fails to simultaneously fulfill
these objectives, and design an alternative orthogonal (collision-free)
listen-before-talk coexistence paradigm that provides a substantial improvement
in performance, yet imposes no penalty on existing WiFi networks. We derive two
LAA optimal transmission policies, ORLA and OLAA, that maximize LAA throughput
in both asynchronous and synchronous (i.e., with alignment to licensed anchor
frame boundaries) modes of operation, respectively. We present a comprehensive
performance evaluation through which we demonstrate that, when aggregating
packets, IEEE 802.11ac WiFi can be more efficient than 3GPP LAA, whereas our
proposals can attain 100% higher throughput, without harming WiFi. We further
show that long U-LTE frames incur up to 92% throughput losses on WiFi when
using 3GPP LAA, whilst ORLA/OLAA sustain $>$200% gains at no cost, even in the
presence of non-saturated WiFi and/or in multi-rate scenarios.
| cs.NI | future mobile networks will exploit unlicensed spectrum to boost capacity and meet growing user demands costeffectively the 3gpp has recently defined a licensedassisted access laa scheme to enable global unlicensed lte ulte deployment aiming at i ensuring fair coexistence with incumbent wifi networks ie impacting on their performance no more than another wifi device and ii achieving superior airtime efficiency as compared to wifi in this paper we show the standardized laa fails to simultaneously fulfill these objectives and design an alternative orthogonal collisionfree listenbeforetalk coexistence paradigm that provides a substantial improvement in performance yet imposes no penalty on existing wifi networks we derive two laa optimal transmission policies orla and olaa that maximize laa throughput in both asynchronous and synchronous ie with alignment to licensed anchor frame boundaries modes of operation respectively we present a comprehensive performance evaluation through which we demonstrate that when aggregating packets ieee 80211ac wifi can be more efficient than 3gpp laa whereas our proposals can attain 100 higher throughput without harming wifi we further show that long ulte frames incur up to 92 throughput losses on wifi when using 3gpp laa whilst orlaolaa sustain 200 gains at no cost even in the presence of nonsaturated wifi andor in multirate scenarios | [['future', 'mobile', 'networks', 'will', 'exploit', 'unlicensed', 'spectrum', 'to', 'boost', 'capacity', 'and', 'meet', 'growing', 'user', 'demands', 'costeffectively', 'the', '3gpp', 'has', 'recently', 'defined', 'a', 'licensedassisted', 'access', 'laa', 'scheme', 'to', 'enable', 'global', 'unlicensed', 'lte', 'ulte', 'deployment', 'aiming', 'at', 'i', 'ensuring', 'fair', 'coexistence', 'with', 'incumbent', 'wifi', 'networks', 'ie', 'impacting', 'on', 'their', 'performance', 'no', 'more', 'than', 'another', 'wifi', 'device', 'and', 'ii', 'achieving', 'superior', 'airtime', 'efficiency', 'as', 'compared', 'to', 'wifi', 'in', 'this', 'paper', 'we', 'show', 'the', 'standardized', 'laa', 'fails', 'to', 'simultaneously', 'fulfill', 'these', 'objectives', 'and', 'design', 'an', 'alternative', 'orthogonal', 'collisionfree', 'listenbeforetalk', 'coexistence', 'paradigm', 'that', 'provides', 'a', 'substantial', 'improvement', 'in', 'performance', 'yet', 'imposes', 'no', 'penalty', 'on', 'existing', 'wifi', 'networks', 'we', 'derive', 'two', 'laa', 'optimal', 'transmission', 'policies', 'orla', 'and', 'olaa', 'that', 'maximize', 'laa', 'throughput', 'in', 'both', 'asynchronous', 'and', 'synchronous', 'ie', 'with', 'alignment', 'to', 'licensed', 'anchor', 'frame', 'boundaries', 'modes', 'of', 'operation', 'respectively', 'we', 'present', 'a', 'comprehensive', 'performance', 'evaluation', 'through', 'which', 'we', 'demonstrate', 'that', 'when', 'aggregating', 'packets', 'ieee', '80211ac', 'wifi', 'can', 'be', 'more', 'efficient', 'than', '3gpp', 'laa', 'whereas', 'our', 'proposals', 'can', 'attain', '100', 'higher', 'throughput', 'without', 'harming', 'wifi', 'we', 'further', 'show', 'that', 'long', 'ulte', 'frames', 'incur', 'up', 'to', '92', 'throughput', 'losses', 'on', 'wifi', 'when', 'using', '3gpp', 'laa', 'whilst', 'orlaolaa', 'sustain', '200', 'gains', 'at', 'no', 'cost', 'even', 'in', 'the', 'presence', 'of', 'nonsaturated', 'wifi', 'andor', 'in', 'multirate', 'scenarios']] | [-0.254208528310459, -0.03262222808516707, 0.011011125213195527, 0.013885313912876302, -0.06974692076018349, -0.27620437787382385, 0.17006755586359093, 0.48182995439103377, -0.19668272662611297, -0.28354717729137097, 0.06996380110718403, -0.2586912820509528, -0.13547007084027193, 0.16064990471714913, -0.15527659786554673, 0.044022722223041516, 0.07738647649970498, 0.007056652458236363, -0.03800351222871631, -0.29391312592347796, 0.18579664052955214, 0.1535358665805236, 0.42813616190383685, 0.06718680193527272, 0.011651479803600269, -0.032759492067777694, -0.00341342670602066, -0.0564313400073431, -0.05203226363183282, 0.09780648673319291, 0.33545751046662714, 0.17595428828409507, 0.32596474000025744, -0.464051908007487, -0.2517351840532371, 0.10820553674934831, 0.16837402919784597, -0.002670104099340292, -0.037247046200003686, -0.27967456289896026, 0.20623239504308927, -0.3028993577724184, -0.03424481358796136, -0.0370273498762677, -0.10138227196644288, 0.04426634318162849, -0.3510251447132126, -0.01915154246606433, -0.026720626889589007, 0.06650466800537609, -0.04980139644001031, -0.0711189746400295, -0.018541654417828762, 0.1890944012533989, 0.002867038526215512, -0.018987326254947715, 0.08007106632405465, -0.08409098318351702, -0.16024702649090938, 0.3973528741678195, -0.04016857237317043, -0.16498677266659725, 0.19932513263317483, -0.040637015209264535, -0.07508836005726338, 0.13713583610812896, 0.21986315645444304, -0.008014186264875238, -0.19074807999802137, -0.010759027117911948, 0.03378959894365636, 0.175384811302925, 0.139186633214475, 0.15866797578472422, 0.15044766352789948, 0.23392809417552837, 0.21064857511656054, 0.05467983059334888, -0.09460311636139884, -0.12073988358105593, -0.1645212022411586, -0.1165110646719252, -0.14624931135293634, 0.02124213869335936, -0.0662102619522982, -0.0500909459362483, 0.3601794704761834, 0.2004118188768243, 0.08650333308776961, 0.16252210392646807, 0.4083595702526581, 0.007622821743030157, 0.11966055244397353, 0.20434503244764324, 0.21741367994219213, -0.031375967627866146, 0.22150498927241905, -0.17060381234785663, 0.05684265281439791, -0.05439739049335858] |
1,802.01361 | Measure-preserving symmetries and reversibilities of ordinary
differential systems | We prove that measure-preserving symmetries of an $n$-dimensional
differential system preserve its divergence and the divergence derivatives
along the solutions. Also, we prove that measure-preserving reversibilities
preserve odd-order divergence derivatives along the solutions, and that
even-order derivatives are multiplied by $-1$. We apply such results to find
all the area-preserving symmetries and reversibilities of planar Lotka-Volterra
and Li\'enard systems.
| math.DS | we prove that measurepreserving symmetries of an ndimensional differential system preserve its divergence and the divergence derivatives along the solutions also we prove that measurepreserving reversibilities preserve oddorder divergence derivatives along the solutions and that evenorder derivatives are multiplied by 1 we apply such results to find all the areapreserving symmetries and reversibilities of planar lotkavolterra and lienard systems | [['we', 'prove', 'that', 'measurepreserving', 'symmetries', 'of', 'an', 'ndimensional', 'differential', 'system', 'preserve', 'its', 'divergence', 'and', 'the', 'divergence', 'derivatives', 'along', 'the', 'solutions', 'also', 'we', 'prove', 'that', 'measurepreserving', 'reversibilities', 'preserve', 'oddorder', 'divergence', 'derivatives', 'along', 'the', 'solutions', 'and', 'that', 'evenorder', 'derivatives', 'are', 'multiplied', 'by', '1', 'we', 'apply', 'such', 'results', 'to', 'find', 'all', 'the', 'areapreserving', 'symmetries', 'and', 'reversibilities', 'of', 'planar', 'lotkavolterra', 'and', 'lienard', 'systems']] | [-0.193581123157578, 0.0792865915624997, -0.0529921596585694, 0.07365043068273087, -0.07544746094430654, -0.11940739271467772, -0.06806432698869098, 0.3354260079183821, -0.3308685054465876, -0.16489949359132325, 0.14922786760538564, -0.39297887905485046, -0.23047154990293212, 0.14457793230727567, -0.10178188834797149, 0.08961510527148937, 0.01464096022675098, 0.045002294716156896, -0.1391012471808531, -0.24255384776299282, 0.3747858665252136, -0.12196571581949622, 0.21269406869581317, 0.01613729730469443, 0.24497497501641008, -0.03448837609977414, 0.0204074568020464, 0.0013653705142225312, -0.17136543166566684, 0.06126722683182965, 0.19168671106888077, 0.07125411543332166, 0.178163849369828, -0.38953996146634473, -0.1694474864940522, 0.13685064976719225, 0.14279750045546788, 0.07304236457004386, -0.057008508695447345, -0.30181917927811963, 0.06140834809738701, -0.12763681864144943, -0.22607680515117817, -0.1982484269666217, 0.008821590030092304, 0.09612449398264289, -0.2779036592692137, 0.09546302840995634, 0.15458739919872103, 0.111087626346458, -0.12062420458651259, -0.048368318138596746, -0.13159362993881865, 0.08269634519277488, 0.08204201413160664, -0.0011438043724934933, 0.06004438790003375, -0.06026568451612178, -0.13509497100534706, 0.35546018953545616, -0.11472009303506021, -0.32543887248483755, 0.13348233873434998, -0.17665963484984587, -0.20060149724674176, 0.1087696786212214, 0.1367499620290631, 0.1313293419454752, -0.12427814206171592, 0.13608287141847789, -0.005719020062962831, 0.12546789502504013, 0.12407666691815701, 0.03054427466813033, 0.07287377845180237, -0.04069623040130078, 0.17484796422896748, 0.15658060636892282, 0.032916906092442196, -0.14997266195872325, -0.3413388231548212, -0.204244472133785, -0.09909893021626809, 0.06857785386806828, -0.12508575607118813, -0.1636766448174998, 0.3582996091631762, 0.13129782269440465, 0.10579139010396675, 0.15648394191274578, 0.17061220876619979, 0.19940154428072907, 0.051663021580710754, 0.10390312496130749, 0.19068750739886853, 0.14555170122234118, 0.029370119301917946, -0.24169345844095036, -0.008849943735463134, 0.15766568551376714] |
1,802.01362 | Cuspidal cohomology of stacks of shtukas | Let $G$ be a connected split reductive group over a finite field ${\mathbb
F}_q$ and $X$ a smooth projective geometrically connected curve over ${\mathbb
F}_q$. The $\ell$-adic cohomology of stacks of $G$-shtukas is a generalization
of the space of automorphic forms with compact support over the function field
of $X$. In this paper, we construct a constant term morphism on the cohomology
of stacks of shtukas which is a generalization of the constant term morphism
for automorphic forms. We also define the cuspidal cohomology which generalizes
the space of cuspidal automorphic forms. Then we show that the cuspidal
cohomology has finite dimension and that it is equal to the (rationally)
Hecke-finite cohomology defined by V. Lafforgue.
| math.AG math.NT math.RT | let g be a connected split reductive group over a finite field mathbb f_q and x a smooth projective geometrically connected curve over mathbb f_q the elladic cohomology of stacks of gshtukas is a generalization of the space of automorphic forms with compact support over the function field of x in this paper we construct a constant term morphism on the cohomology of stacks of shtukas which is a generalization of the constant term morphism for automorphic forms we also define the cuspidal cohomology which generalizes the space of cuspidal automorphic forms then we show that the cuspidal cohomology has finite dimension and that it is equal to the rationally heckefinite cohomology defined by v lafforgue | [['let', 'g', 'be', 'a', 'connected', 'split', 'reductive', 'group', 'over', 'a', 'finite', 'field', 'mathbb', 'f_q', 'and', 'x', 'a', 'smooth', 'projective', 'geometrically', 'connected', 'curve', 'over', 'mathbb', 'f_q', 'the', 'elladic', 'cohomology', 'of', 'stacks', 'of', 'gshtukas', 'is', 'a', 'generalization', 'of', 'the', 'space', 'of', 'automorphic', 'forms', 'with', 'compact', 'support', 'over', 'the', 'function', 'field', 'of', 'x', 'in', 'this', 'paper', 'we', 'construct', 'a', 'constant', 'term', 'morphism', 'on', 'the', 'cohomology', 'of', 'stacks', 'of', 'shtukas', 'which', 'is', 'a', 'generalization', 'of', 'the', 'constant', 'term', 'morphism', 'for', 'automorphic', 'forms', 'we', 'also', 'define', 'the', 'cuspidal', 'cohomology', 'which', 'generalizes', 'the', 'space', 'of', 'cuspidal', 'automorphic', 'forms', 'then', 'we', 'show', 'that', 'the', 'cuspidal', 'cohomology', 'has', 'finite', 'dimension', 'and', 'that', 'it', 'is', 'equal', 'to', 'the', 'rationally', 'heckefinite', 'cohomology', 'defined', 'by', 'v', 'lafforgue']] | [-0.2972956835818679, 0.046296249265256134, -0.17680719093136166, 0.001607415648987112, -0.11915651580480778, -0.11813930537875579, -0.042221682509609865, 0.3016227322428123, -0.38121962846540236, -0.14378506308826416, 0.054558731852423235, -0.1983320470575405, -0.15622626151889563, 0.22380752963540346, -0.19078012031057606, -0.07323014010148851, -0.003869296110275647, 0.15728140012158648, -0.11672988885041813, -0.36818752353606016, 0.48351660259068013, -0.11325508832283641, 0.22420072898511653, 0.03151745447565032, 0.14152840539691564, 0.015056967176496983, 0.03527131377030974, -0.06452960973129729, -0.12749638287413806, 0.13997758307048808, 0.3869988707015696, -0.011601533621306653, 0.1928849855154429, -0.3513571166473886, -0.16481706570509982, 0.28657792144981414, 0.14963432170612656, -0.08887290050194639, 0.028301337939363135, -0.27469826530179253, 0.1296671218684186, -0.19605710603620696, -0.1451820796477082, -0.08680030720551377, 0.10471221416095353, 0.025843931119079174, -0.2519429049920291, -0.04383635381869364, 0.06896846782740043, 0.19117924425998986, -0.10570125292743678, -0.06347429006077025, -0.08569717702010403, 0.03175962166354546, -0.05418212685288618, 0.18313096380671082, 0.09290668772857474, -0.0749859670885717, -0.0781979771249968, 0.35029928785465336, -0.13594917116443747, -0.21851730160415173, 0.043573380804256254, -0.1686355175146752, -0.1345377857108479, 0.12882501411494676, 0.0875369684446765, 0.1953541373105153, 0.06975064852639384, 0.2579203104833141, -0.16470862135857992, 0.05921559283894527, 0.08384748617106158, -0.06024380954103949, 0.14550774615743886, 0.060450486444017806, 0.08815489946662083, 0.11239551187027245, 0.027159759699893385, 0.01411531540038793, -0.4076980082237202, -0.21064738447818418, -0.10484642362950937, 0.2029048773014675, -0.11989739986273217, -0.1835493057804263, 0.44421498719602825, 0.0248669835212438, 0.1921233045099222, 0.20109277303683643, 0.23530681117680732, 0.0503684818967367, 0.10448418948799372, 0.06517978713483266, 0.043609935834841886, 0.2785058781221185, -0.09739984077421705, -0.1030143489656241, -0.03933176806844447, 0.22968478439294773] |
1,802.01363 | First global next-to-leading order determination of diffractive parton
distribution functions and their uncertainties within the {\tt xFitter}
framework | We present {\tt GKG18-DPDFs}, a next-to-leading order (NLO) QCD analysis of
diffractive parton distribution functions (diffractive PDFs) and their
uncertainties. This is the first global set of diffractive PDFs determined
within the {\tt xFitter} framework. This analysis is motivated by all available
and most up-to-date data on inclusive diffractive deep inelastic scattering
(diffractive DIS). Heavy quark contributions are considered within the
framework of the Thorne-Roberts (TR) general mass variable flavor number scheme
(GM-VFNS). We form a mutually consistent set of diffractive PDFs due to the
inclusion of high-precision data from H1/ZEUS combined inclusive diffractive
cross sections measurements. We study the impact of the H1/ZEUS combined data
by producing a variety of determinations based on reduced data sets. We find
that these data sets have a significant impact on the diffractive PDFs with
some substantial reductions in uncertainties. The predictions based on the
extracted diffractive PDFs are compared to the analyzed diffractive DIS data
and with other determinations of the diffractive PDFs.
| hep-ph hep-ex | we present tt gkg18dpdfs a nexttoleading order nlo qcd analysis of diffractive parton distribution functions diffractive pdfs and their uncertainties this is the first global set of diffractive pdfs determined within the tt xfitter framework this analysis is motivated by all available and most uptodate data on inclusive diffractive deep inelastic scattering diffractive dis heavy quark contributions are considered within the framework of the thorneroberts tr general mass variable flavor number scheme gmvfns we form a mutually consistent set of diffractive pdfs due to the inclusion of highprecision data from h1zeus combined inclusive diffractive cross sections measurements we study the impact of the h1zeus combined data by producing a variety of determinations based on reduced data sets we find that these data sets have a significant impact on the diffractive pdfs with some substantial reductions in uncertainties the predictions based on the extracted diffractive pdfs are compared to the analyzed diffractive dis data and with other determinations of the diffractive pdfs | [['we', 'present', 'tt', 'gkg18dpdfs', 'a', 'nexttoleading', 'order', 'nlo', 'qcd', 'analysis', 'of', 'diffractive', 'parton', 'distribution', 'functions', 'diffractive', 'pdfs', 'and', 'their', 'uncertainties', 'this', 'is', 'the', 'first', 'global', 'set', 'of', 'diffractive', 'pdfs', 'determined', 'within', 'the', 'tt', 'xfitter', 'framework', 'this', 'analysis', 'is', 'motivated', 'by', 'all', 'available', 'and', 'most', 'uptodate', 'data', 'on', 'inclusive', 'diffractive', 'deep', 'inelastic', 'scattering', 'diffractive', 'dis', 'heavy', 'quark', 'contributions', 'are', 'considered', 'within', 'the', 'framework', 'of', 'the', 'thorneroberts', 'tr', 'general', 'mass', 'variable', 'flavor', 'number', 'scheme', 'gmvfns', 'we', 'form', 'a', 'mutually', 'consistent', 'set', 'of', 'diffractive', 'pdfs', 'due', 'to', 'the', 'inclusion', 'of', 'highprecision', 'data', 'from', 'h1zeus', 'combined', 'inclusive', 'diffractive', 'cross', 'sections', 'measurements', 'we', 'study', 'the', 'impact', 'of', 'the', 'h1zeus', 'combined', 'data', 'by', 'producing', 'a', 'variety', 'of', 'determinations', 'based', 'on', 'reduced', 'data', 'sets', 'we', 'find', 'that', 'these', 'data', 'sets', 'have', 'a', 'significant', 'impact', 'on', 'the', 'diffractive', 'pdfs', 'with', 'some', 'substantial', 'reductions', 'in', 'uncertainties', 'the', 'predictions', 'based', 'on', 'the', 'extracted', 'diffractive', 'pdfs', 'are', 'compared', 'to', 'the', 'analyzed', 'diffractive', 'dis', 'data', 'and', 'with', 'other', 'determinations', 'of', 'the', 'diffractive', 'pdfs']] | [-0.035903437582601325, 0.11085251755721401, -0.15964321130886674, 0.14983922339451966, -0.015433390266844071, -0.0015603141218889505, 0.04203070833900711, 0.3819449927192181, -0.18637081978158676, -0.22240986173637795, 0.034699236168671634, -0.3715898492315318, 0.009765552839962766, 0.16931167408183684, 0.04150640932784881, 0.1828132608861779, 0.12775904227019055, -0.07366771432571113, -0.05574851306591881, -0.21957709919952323, 0.3937004973529838, 0.0033113514551587286, 0.2639197019918356, 0.12883217796625104, 0.04747674248501425, 0.12503309393650852, -0.1888194032406318, -0.03321525116334669, -0.1356337771767812, 0.14582549487095092, 0.2594561448768218, 0.10335140869901807, 0.10092000234581064, -0.4061501032629167, -0.09598060703574447, 0.05201703982020263, 0.11053371236484963, 0.09947754051900119, -0.056185911770444366, -0.24976200205564963, 0.042399253838812004, -0.23872835837537423, -0.10476897840271704, -0.13278649189451244, -0.04306996288069058, 0.03815987088455586, -0.3292824816133361, 0.04742567877983674, -0.0955579844652675, 0.02701615516562015, -0.016428499946778176, -0.23155816919679637, -0.06118567335943226, 0.013114005501847714, 0.07218889688374475, 0.13033350232726662, 0.156513024484957, -0.1733458567498019, -0.15140745789685753, 0.3982864968420472, -0.026777153995499247, -0.14508680156195625, 0.08862801092036535, -0.2400044677371625, -0.18083812182740075, 0.16113583175756502, 0.2762183683553303, 0.0598926201057111, -0.22291369095328264, 0.08347625282658555, -0.028271289492840877, 0.17741352948869463, 0.036915993041475303, 0.09716958794851963, 0.11870836940797744, 0.2473569660796784, -0.09513593676820165, -0.021245379835818312, -0.16098223665067052, -0.07756552383798407, -0.4183575293398462, -0.009766583802411332, -0.08178181017938187, 0.019616825763660018, -0.11778663621198575, -0.13645718096158815, 0.328528924854686, 0.1281237126153428, 0.2839811546058627, 0.04143377489817794, 0.3878562854137272, 0.09487067878162633, 0.11023571470141177, 0.05472092635754962, 0.2613453806299731, 0.1661495352833299, 0.11251944463001565, -0.19073417683539445, 0.09825653142179362, 0.015113783269771374] |
1,802.01364 | Classifying and modelling spiral structures in hydrodynamic simulations
of astrophysical discs | We demonstrate numerical techniques for automatic identification of
individual spiral arms in hydrodynamic simulations of astrophysical discs.
Building on our earlier work, which used tensor classification to identify
regions that were "spiral-like", we can now obtain fits to spirals for
individual arm elements. We show this process can even detect spirals in
relatively flocculent spiral patterns, but the resulting fits to logarithmic
"grand-design" spirals are less robust. Our methods not only permit the
estimation of pitch angles, but also direct measurements of the spiral arm
width and pattern speed. In principle, our techniques will allow the tracking
of material as it passes through an arm. Our demonstration uses smoothed
particle hydrodynamics simulations, but we stress that the method is suitable
for any finite-element hydrodynamics system. We anticipate our techniques will
be essential to studies of star formation in disc galaxies, and attempts to
find the origin of recently observed spiral structure in protostellar discs.
| astro-ph.GA astro-ph.EP | we demonstrate numerical techniques for automatic identification of individual spiral arms in hydrodynamic simulations of astrophysical discs building on our earlier work which used tensor classification to identify regions that were spirallike we can now obtain fits to spirals for individual arm elements we show this process can even detect spirals in relatively flocculent spiral patterns but the resulting fits to logarithmic granddesign spirals are less robust our methods not only permit the estimation of pitch angles but also direct measurements of the spiral arm width and pattern speed in principle our techniques will allow the tracking of material as it passes through an arm our demonstration uses smoothed particle hydrodynamics simulations but we stress that the method is suitable for any finiteelement hydrodynamics system we anticipate our techniques will be essential to studies of star formation in disc galaxies and attempts to find the origin of recently observed spiral structure in protostellar discs | [['we', 'demonstrate', 'numerical', 'techniques', 'for', 'automatic', 'identification', 'of', 'individual', 'spiral', 'arms', 'in', 'hydrodynamic', 'simulations', 'of', 'astrophysical', 'discs', 'building', 'on', 'our', 'earlier', 'work', 'which', 'used', 'tensor', 'classification', 'to', 'identify', 'regions', 'that', 'were', 'spirallike', 'we', 'can', 'now', 'obtain', 'fits', 'to', 'spirals', 'for', 'individual', 'arm', 'elements', 'we', 'show', 'this', 'process', 'can', 'even', 'detect', 'spirals', 'in', 'relatively', 'flocculent', 'spiral', 'patterns', 'but', 'the', 'resulting', 'fits', 'to', 'logarithmic', 'granddesign', 'spirals', 'are', 'less', 'robust', 'our', 'methods', 'not', 'only', 'permit', 'the', 'estimation', 'of', 'pitch', 'angles', 'but', 'also', 'direct', 'measurements', 'of', 'the', 'spiral', 'arm', 'width', 'and', 'pattern', 'speed', 'in', 'principle', 'our', 'techniques', 'will', 'allow', 'the', 'tracking', 'of', 'material', 'as', 'it', 'passes', 'through', 'an', 'arm', 'our', 'demonstration', 'uses', 'smoothed', 'particle', 'hydrodynamics', 'simulations', 'but', 'we', 'stress', 'that', 'the', 'method', 'is', 'suitable', 'for', 'any', 'finiteelement', 'hydrodynamics', 'system', 'we', 'anticipate', 'our', 'techniques', 'will', 'be', 'essential', 'to', 'studies', 'of', 'star', 'formation', 'in', 'disc', 'galaxies', 'and', 'attempts', 'to', 'find', 'the', 'origin', 'of', 'recently', 'observed', 'spiral', 'structure', 'in', 'protostellar', 'discs']] | [-0.09468885859820006, 0.030027305699114586, -0.13967034815774335, 0.06970289416500686, -0.11099560919834615, -0.06556542469914277, -0.02230082481533331, 0.4555547235884353, -0.22235766982254512, -0.32335505571047013, 0.06380242685856927, -0.21991922739022352, -0.15531232122440713, 0.21388054443538407, -0.03666390765264824, 0.052956224800172175, 0.0685820216252529, -0.08116834734977743, -0.07560940802720219, -0.2593899473786814, 0.25065179499071816, 0.05737551221890109, 0.19902871648914047, -0.0617967375263862, 0.05486466365793793, -0.0688162822784348, -0.07657163948888056, 0.0005239423291830273, -0.19616168496690695, 0.04627766537588912, 0.2668790438926065, 0.10869372897636291, 0.2233495402298021, -0.458491301218459, -0.20697936722963395, 0.042934142460580915, 0.23370804601989978, 0.15382063178294156, -0.06918408611997987, -0.26049365539877833, 0.1140784385172626, -0.15068719407778874, -0.17658609001558612, -0.07605563673831812, 0.0061579671621854815, 0.025627354042024, -0.2765883248584351, 0.10325253683625411, 0.07057702889992529, 0.03698714958978575, -0.04680258235380102, -0.07459042074276714, -0.015642518999339262, 0.11495213056521418, 0.033948501532514844, 0.05204705692761179, 0.22797784659642628, -0.14229405615871846, -0.1111671156431367, 0.37545924664281505, -0.029445328383839557, -0.13793527298643218, 0.2580074122895233, -0.2023749853183467, -0.13732420374463952, 0.12377671909808823, 0.1820229730990643, 0.12267489022236656, -0.09075937002281924, -0.03879735099118469, -0.06609831372723467, 0.20898277188995973, 0.044702262864085275, -0.00047136236635314955, 0.2616261806363216, 0.1385286239765028, 0.06115002887831493, 0.09927947959460487, -0.16228513470881123, -0.08167386691346039, -0.2573005743929512, -0.12301472299913695, -0.10236768537902503, -0.011057098081555404, -0.08151576419054023, -0.13897102936654798, 0.34651782523308483, 0.15061761427205056, 0.18850011919895732, 0.044612253251086385, 0.3384916741860571, 0.031178942517915666, 0.15228961642783184, 0.09084501939027437, 0.29957449324837243, 0.11054549268567813, 0.07167904868770342, -0.23069022453840604, 0.09495840847262411, 0.017271240194957075] |
1,802.01365 | A Bilevel Approach for Parameter Learning in Inverse Problems | A learning approach to selecting regularization parameters in multi-penalty
Tikhonov regularization is investigated. It leads to a bilevel optimization
problem, where the lower level problem is a Tikhonov regularized problem
parameterized in the regularization parameters. Conditions which ensure the
existence of solutions to the bilevel optimization problem of interest are
derived, and these conditions are verified for two relevant examples.
Difficulties arising from the possible lack of convexity of the lower level
problems are discussed. Optimality conditions are given provided that a
reasonable constraint qualification holds. Finally, results from numerical
experiments used to test the developed theory are presented.
| math.OC | a learning approach to selecting regularization parameters in multipenalty tikhonov regularization is investigated it leads to a bilevel optimization problem where the lower level problem is a tikhonov regularized problem parameterized in the regularization parameters conditions which ensure the existence of solutions to the bilevel optimization problem of interest are derived and these conditions are verified for two relevant examples difficulties arising from the possible lack of convexity of the lower level problems are discussed optimality conditions are given provided that a reasonable constraint qualification holds finally results from numerical experiments used to test the developed theory are presented | [['a', 'learning', 'approach', 'to', 'selecting', 'regularization', 'parameters', 'in', 'multipenalty', 'tikhonov', 'regularization', 'is', 'investigated', 'it', 'leads', 'to', 'a', 'bilevel', 'optimization', 'problem', 'where', 'the', 'lower', 'level', 'problem', 'is', 'a', 'tikhonov', 'regularized', 'problem', 'parameterized', 'in', 'the', 'regularization', 'parameters', 'conditions', 'which', 'ensure', 'the', 'existence', 'of', 'solutions', 'to', 'the', 'bilevel', 'optimization', 'problem', 'of', 'interest', 'are', 'derived', 'and', 'these', 'conditions', 'are', 'verified', 'for', 'two', 'relevant', 'examples', 'difficulties', 'arising', 'from', 'the', 'possible', 'lack', 'of', 'convexity', 'of', 'the', 'lower', 'level', 'problems', 'are', 'discussed', 'optimality', 'conditions', 'are', 'given', 'provided', 'that', 'a', 'reasonable', 'constraint', 'qualification', 'holds', 'finally', 'results', 'from', 'numerical', 'experiments', 'used', 'to', 'test', 'the', 'developed', 'theory', 'are', 'presented']] | [-0.10289356556975028, -0.014011513479430266, -0.0700210276050399, 0.1433464167804241, -0.11272636500676397, -0.1754308141711535, 0.029264347674795473, 0.3613637133002883, -0.32168133705478125, -0.3288351076636275, 0.1853981670815347, -0.2186952204998545, -0.16394689308498242, 0.22059504165681024, -0.12306970372241029, 0.16974794293631507, 0.10467453222166785, -0.024585929990868376, -0.11488601113987071, -0.3024177209408295, 0.3118142595354731, 0.02910689548165961, 0.25826813586319636, 0.07835684237870003, 0.13323280171989793, -0.057264830634901016, 0.018781112412912675, 0.06591984888331757, -0.1614915061289488, 0.13357678808170756, 0.3158874509225816, 0.19013858842428286, 0.3858111047993956, -0.4001372496249399, -0.22386747487171582, 0.08216859305258652, 0.060932666538377304, 0.061961846316769494, -0.06562556884242128, -0.24731394341874002, 0.10574926590227117, -0.08262328413136379, -0.10112099271888535, -0.08966103879113992, -0.08871284558089694, -0.0042861879737389206, -0.3924033633160471, 0.0677561255011971, 0.009387419006382727, 0.017350435652064556, -0.15268943091440532, -0.16092122060416097, 0.008233545837227744, 0.08297801633704115, 0.11482614212471878, -0.021558577695160615, 0.08852965142954179, -0.12252013514175861, -0.11129585337458235, 0.38969384209074154, 0.018632219292369266, -0.29109807795553344, 0.17419019166728236, -0.01678442224540343, -0.1602378497605748, 0.11027254351424147, 0.14801059235734018, 0.1860684421233306, -0.1782481348555949, 0.10239408622352368, -0.056467913133515554, 0.10285642226649956, 0.06163038115130004, 0.007462205812146868, 0.09171463362402235, 0.1757946183735674, 0.12285507522579847, 0.18255739549240757, -0.03452678998424248, -0.11309589892966823, -0.35279459607872093, -0.02280828922121513, -0.18700951962458967, -0.04895968995329858, -0.09614644227816954, -0.1292966726951, 0.3361216736675212, 0.1845869729671665, 0.16396101136607202, 0.05846740711936633, 0.2729200755405908, 0.1961622370384643, 0.005953188322371606, 0.03781550403007052, 0.2561093945093829, 0.1397809780136955, 0.04166891442781145, -0.21892763297496873, 0.049976344763023796, 0.11219939427459706] |
1,802.01366 | First Measurements of Beam Backgrounds at SuperKEKB | The high design luminosity of the SuperKEKB electron-positron collider is
expected to result in challenging levels of beam-induced backgrounds in the
interaction region. Properly simulating and mitigating these backgrounds is
critical to the success of the Belle~II experiment. We report on measurements
performed with a suite of dedicated beam background detectors, collectively
known as BEAST II, during the so-called Phase 1 commissioning run of SuperKEKB
in 2016, which involved operation of both the high energy ring (HER) of 7 GeV
electrons as well as the low energy ring (LER) of 4 GeV positrons. We describe
the BEAST II detector systems, the simulation of beam backgrounds, and the
measurements performed. The measurements include standard ones of dose rates
versus accelerator conditions, and more novel investigations, such as
bunch-by-bunch measurements of injection backgrounds and measurements sensitive
to the energy spectrum and angular distribution of fast neutrons. We observe
beam-gas, Touschek, beam-dust, and injection backgrounds. We do not observe
significant synchrotron radiation, as expected. Measured LER beam-gas
backgrounds and Touschek backgrounds in both rings are slightly elevated, on
average three times larger than the levels predicted by simulation. HER
beam-gas backgrounds are on on average two orders of magnitude larger than
predicted. Systematic uncertainties and channel-to-channel variations are
large, so that these excesses constitute only 1-2 sigma level effects. Neutron
background rates are higher than predicted and should be studied further. We
will measure the remaining beam background processes, due to colliding beams,
in the imminent commissioning Phase 2. These backgrounds are expected to be the
most critical for Belle II, to the point of necessitating replacement of
detector components during the Phase 3 (full-luminosity) operation of SuperKEB.
| physics.ins-det hep-ex physics.acc-ph | the high design luminosity of the superkekb electronpositron collider is expected to result in challenging levels of beaminduced backgrounds in the interaction region properly simulating and mitigating these backgrounds is critical to the success of the belleii experiment we report on measurements performed with a suite of dedicated beam background detectors collectively known as beast ii during the socalled phase 1 commissioning run of superkekb in 2016 which involved operation of both the high energy ring her of 7 gev electrons as well as the low energy ring ler of 4 gev positrons we describe the beast ii detector systems the simulation of beam backgrounds and the measurements performed the measurements include standard ones of dose rates versus accelerator conditions and more novel investigations such as bunchbybunch measurements of injection backgrounds and measurements sensitive to the energy spectrum and angular distribution of fast neutrons we observe beamgas touschek beamdust and injection backgrounds we do not observe significant synchrotron radiation as expected measured ler beamgas backgrounds and touschek backgrounds in both rings are slightly elevated on average three times larger than the levels predicted by simulation her beamgas backgrounds are on on average two orders of magnitude larger than predicted systematic uncertainties and channeltochannel variations are large so that these excesses constitute only 12 sigma level effects neutron background rates are higher than predicted and should be studied further we will measure the remaining beam background processes due to colliding beams in the imminent commissioning phase 2 these backgrounds are expected to be the most critical for belle ii to the point of necessitating replacement of detector components during the phase 3 fullluminosity operation of superkeb | [['the', 'high', 'design', 'luminosity', 'of', 'the', 'superkekb', 'electronpositron', 'collider', 'is', 'expected', 'to', 'result', 'in', 'challenging', 'levels', 'of', 'beaminduced', 'backgrounds', 'in', 'the', 'interaction', 'region', 'properly', 'simulating', 'and', 'mitigating', 'these', 'backgrounds', 'is', 'critical', 'to', 'the', 'success', 'of', 'the', 'belleii', 'experiment', 'we', 'report', 'on', 'measurements', 'performed', 'with', 'a', 'suite', 'of', 'dedicated', 'beam', 'background', 'detectors', 'collectively', 'known', 'as', 'beast', 'ii', 'during', 'the', 'socalled', 'phase', '1', 'commissioning', 'run', 'of', 'superkekb', 'in', '2016', 'which', 'involved', 'operation', 'of', 'both', 'the', 'high', 'energy', 'ring', 'her', 'of', '7', 'gev', 'electrons', 'as', 'well', 'as', 'the', 'low', 'energy', 'ring', 'ler', 'of', '4', 'gev', 'positrons', 'we', 'describe', 'the', 'beast', 'ii', 'detector', 'systems', 'the', 'simulation', 'of', 'beam', 'backgrounds', 'and', 'the', 'measurements', 'performed', 'the', 'measurements', 'include', 'standard', 'ones', 'of', 'dose', 'rates', 'versus', 'accelerator', 'conditions', 'and', 'more', 'novel', 'investigations', 'such', 'as', 'bunchbybunch', 'measurements', 'of', 'injection', 'backgrounds', 'and', 'measurements', 'sensitive', 'to', 'the', 'energy', 'spectrum', 'and', 'angular', 'distribution', 'of', 'fast', 'neutrons', 'we', 'observe', 'beamgas', 'touschek', 'beamdust', 'and', 'injection', 'backgrounds', 'we', 'do', 'not', 'observe', 'significant', 'synchrotron', 'radiation', 'as', 'expected', 'measured', 'ler', 'beamgas', 'backgrounds', 'and', 'touschek', 'backgrounds', 'in', 'both', 'rings', 'are', 'slightly', 'elevated', 'on', 'average', 'three', 'times', 'larger', 'than', 'the', 'levels', 'predicted', 'by', 'simulation', 'her', 'beamgas', 'backgrounds', 'are', 'on', 'on', 'average', 'two', 'orders', 'of', 'magnitude', 'larger', 'than', 'predicted', 'systematic', 'uncertainties', 'and', 'channeltochannel', 'variations', 'are', 'large', 'so', 'that', 'these', 'excesses', 'constitute', 'only', '12', 'sigma', 'level', 'effects', 'neutron', 'background', 'rates', 'are', 'higher', 'than', 'predicted', 'and', 'should', 'be', 'studied', 'further', 'we', 'will', 'measure', 'the', 'remaining', 'beam', 'background', 'processes', 'due', 'to', 'colliding', 'beams', 'in', 'the', 'imminent', 'commissioning', 'phase', '2', 'these', 'backgrounds', 'are', 'expected', 'to', 'be', 'the', 'most', 'critical', 'for', 'belle', 'ii', 'to', 'the', 'point', 'of', 'necessitating', 'replacement', 'of', 'detector', 'components', 'during', 'the', 'phase', '3', 'fullluminosity', 'operation', 'of', 'superkeb']] | [-0.08685020595122991, 0.1852328270820983, -0.040543516029549, 0.11060518640100353, 0.0004551828126696979, -0.13611904118614107, 0.015008313893785645, 0.3789832933586748, -0.1559691731531262, -0.37390113411032977, 0.09356029010471983, -0.34103076892001005, 0.002431347733363509, 0.22346912066902458, -0.020088953579889837, 0.05757513525596176, 0.08110061014817535, -0.031496841590577626, -0.08508250737470328, -0.21648667753641562, 0.2596516740227611, 0.19546851942397872, 0.28208860492304666, 0.03677983127914451, 0.08352436179120559, -0.015284463630557773, -0.07224120105948874, -0.014857717748621808, -0.10117949167560629, 0.014987447064640946, 0.2556724329421259, 0.12079398061905522, 0.1437332993844072, -0.43895283887190195, -0.1623353513705832, 0.13438214373266366, 0.11827603232471601, 0.07703970288104542, -0.056687816978196415, -0.2706373480819714, 0.07167870678976589, -0.193462611959309, -0.11492724713068181, -0.0225049273653627, 0.0006494211584675428, 0.023813174506786335, -0.24492475709549205, 0.0424527075032101, 0.012814287669564639, 0.04468788577051943, -0.04726914672381313, -0.17495767717071645, -0.011042235736728316, 0.05614699312376187, 0.047048600999165927, 0.038428345293355315, 0.21558630961739897, -0.16053861351803575, -0.1340387097443454, 0.35274938041316894, -0.03480624043641001, -0.10515238002442535, 0.19611298015104908, -0.24532912322234446, -0.08542531964999131, 0.18677438897087567, 0.22073221026734888, 0.09242485605029609, -0.15257130520288176, 0.01578832656452826, 0.08346554579432397, 0.15205964762411467, 0.06824449734310345, 0.05930539784501033, 0.20989318671469365, 0.18155694458255311, 0.051892425570445884, 0.08466931790334296, -0.170938081046402, -0.006809098454301848, -0.34467301087501895, -0.09221115938442595, -0.07752623524164151, 0.055990121694615966, -0.015333531783439599, -0.0709206719060175, 0.36170720204930096, 0.12351132064984138, 0.1835792690741501, -0.015025993002328666, 0.2930923563048161, 0.07202164339747362, 0.07135808528993734, 0.03680541773658607, 0.30482487494180743, 0.07839215728796155, 0.12081687968491357, -0.2113012482329984, 0.033819585201426354, -0.028098910524824855] |
1,802.01367 | Integrable Subsectors from Holography | We consider operators in ${\cal N}=4$ super Yang-Mills theory dual to closed
string states propagating on a class of LLM geometries. The LLM geometries we
consider are specified by a boundary condition that is a set of black rings on
the LLM plane. When projected to the LLM plane, the closed strings are polygons
with all corners lying on the outer edge of a single ring. The large $N$ limit
of correlators of these operators receives contributions from non-planar
diagrams even for the leading large $N$ dynamics. Our interest in these
fluctuations is because a previous weak coupling analysis argues that the net
effect of summing the huge set of non-planar diagrams, is a simple rescaling of
the 't Hooft coupling. We carry out some nontrivial checks of this proposal.
Using the $su(2|2)^2$ symmetry we determine the two magnon $S$-matrix and
demonstrate that it agrees, up to two loops, with a weak coupling computation
performed in the CFT. We also compute the first finite size corrections to both
the magnon and the dyonic magnon by constructing solutions to the Nambu-Goto
action that carry finite angular momentum. These finite size computations
constitute a strong coupling confirmation of the proposal.
| hep-th | we consider operators in cal n4 super yangmills theory dual to closed string states propagating on a class of llm geometries the llm geometries we consider are specified by a boundary condition that is a set of black rings on the llm plane when projected to the llm plane the closed strings are polygons with all corners lying on the outer edge of a single ring the large n limit of correlators of these operators receives contributions from nonplanar diagrams even for the leading large n dynamics our interest in these fluctuations is because a previous weak coupling analysis argues that the net effect of summing the huge set of nonplanar diagrams is a simple rescaling of the t hooft coupling we carry out some nontrivial checks of this proposal using the su222 symmetry we determine the two magnon smatrix and demonstrate that it agrees up to two loops with a weak coupling computation performed in the cft we also compute the first finite size corrections to both the magnon and the dyonic magnon by constructing solutions to the nambugoto action that carry finite angular momentum these finite size computations constitute a strong coupling confirmation of the proposal | [['we', 'consider', 'operators', 'in', 'cal', 'n4', 'super', 'yangmills', 'theory', 'dual', 'to', 'closed', 'string', 'states', 'propagating', 'on', 'a', 'class', 'of', 'llm', 'geometries', 'the', 'llm', 'geometries', 'we', 'consider', 'are', 'specified', 'by', 'a', 'boundary', 'condition', 'that', 'is', 'a', 'set', 'of', 'black', 'rings', 'on', 'the', 'llm', 'plane', 'when', 'projected', 'to', 'the', 'llm', 'plane', 'the', 'closed', 'strings', 'are', 'polygons', 'with', 'all', 'corners', 'lying', 'on', 'the', 'outer', 'edge', 'of', 'a', 'single', 'ring', 'the', 'large', 'n', 'limit', 'of', 'correlators', 'of', 'these', 'operators', 'receives', 'contributions', 'from', 'nonplanar', 'diagrams', 'even', 'for', 'the', 'leading', 'large', 'n', 'dynamics', 'our', 'interest', 'in', 'these', 'fluctuations', 'is', 'because', 'a', 'previous', 'weak', 'coupling', 'analysis', 'argues', 'that', 'the', 'net', 'effect', 'of', 'summing', 'the', 'huge', 'set', 'of', 'nonplanar', 'diagrams', 'is', 'a', 'simple', 'rescaling', 'of', 'the', 't', 'hooft', 'coupling', 'we', 'carry', 'out', 'some', 'nontrivial', 'checks', 'of', 'this', 'proposal', 'using', 'the', 'su222', 'symmetry', 'we', 'determine', 'the', 'two', 'magnon', 'smatrix', 'and', 'demonstrate', 'that', 'it', 'agrees', 'up', 'to', 'two', 'loops', 'with', 'a', 'weak', 'coupling', 'computation', 'performed', 'in', 'the', 'cft', 'we', 'also', 'compute', 'the', 'first', 'finite', 'size', 'corrections', 'to', 'both', 'the', 'magnon', 'and', 'the', 'dyonic', 'magnon', 'by', 'constructing', 'solutions', 'to', 'the', 'nambugoto', 'action', 'that', 'carry', 'finite', 'angular', 'momentum', 'these', 'finite', 'size', 'computations', 'constitute', 'a', 'strong', 'coupling', 'confirmation', 'of', 'the', 'proposal']] | [-0.21295139979397068, 0.1649970706232419, -0.04658309863221766, 0.06337889411011617, -0.07349165612737639, -0.10730612029514341, 0.032832686292510856, 0.313196072526596, -0.18664179361340674, -0.2361598898071062, 0.0763275523598287, -0.31062840672228675, -0.10958974908407063, 0.14467400652497556, -0.004806066713750955, 0.03045469901943109, 0.04354184705792277, 0.03946239795921502, -0.09009615104584343, -0.225700236285444, 0.32536435932405483, -0.024355670090322617, 0.26978617701020957, 0.07707345970986279, 0.08408656540136276, -0.008812593086857837, 0.00464766026319315, 0.06936606632856031, -0.1254124673951542, 0.10865007232224352, 0.2240000219011416, 0.036064417875193135, 0.16300274025310169, -0.4448910356226443, -0.16448989553809767, 0.07637512936924744, 0.16920878328947406, 0.1665811083347753, -0.0004972823880227151, -0.24463383489373056, 0.07873958903552983, -0.16878107798314004, -0.1705099910960975, -0.08554321338629557, 0.04624880010243317, -0.04963376469007044, -0.24088130722579668, 0.015956585522302464, 0.050243657216373264, 0.01103305152024735, -0.015365536933802444, -0.07390969509324717, -0.07819146599333658, 0.11724997350356349, 0.06128511741645534, 0.043370949135002015, 0.09673033251881016, -0.14440505389909664, -0.13400987893192454, 0.32112820568786127, -0.06570274294165876, -0.2225503284658183, 0.150395916103423, -0.20014943803408927, -0.1447770218717668, 0.13275498589924115, 0.11780731471530585, 0.18828681200925576, -0.10471526192269827, 0.1948150739143132, -0.07329690325452541, 0.10759340001683508, 0.1089625309898772, 0.04367078881183959, 0.2631085439481669, 0.09480794169704872, 0.04848560225586007, 0.20256829327630876, -0.05620175521265753, -0.1088550176161031, -0.4021288459600805, -0.09279510395065176, -0.15453182812956529, 0.0937339427153053, -0.14390993067472022, -0.22499014173323909, 0.348662896339918, 0.11706688526942573, 0.23221834092442126, 0.06686595787124877, 0.23643090150723553, 0.1128637927316536, 0.10577212862383499, 0.09234157760364163, 0.2406696068163258, 0.15760634337890556, 0.022025578107327373, -0.2880646905225626, -0.08813511114567518, 0.14691750681253546] |
1,802.01368 | Dynamical gauge symmetry breaking in lower-dimensional Lorentz-violating
supersymmetric theory | In this work we study the dynamical generation of mass in the
Lorentz-violating low-dimensional Super-Yang-Mills theory in the aether
superspace coupled to a scalar matter. We also suggest that our studies can be
applied for condensed matter systems, especially lower-dimensional
superconductors and topological insulators. In low dimensional materials, the
parameter $\Delta$ generated by presence of the aether term can be interpreted
as a quantity that renormalizes the propagation velocity of the bosonic mode
with respect to the Fermi velocity.
| hep-th | in this work we study the dynamical generation of mass in the lorentzviolating lowdimensional superyangmills theory in the aether superspace coupled to a scalar matter we also suggest that our studies can be applied for condensed matter systems especially lowerdimensional superconductors and topological insulators in low dimensional materials the parameter delta generated by presence of the aether term can be interpreted as a quantity that renormalizes the propagation velocity of the bosonic mode with respect to the fermi velocity | [['in', 'this', 'work', 'we', 'study', 'the', 'dynamical', 'generation', 'of', 'mass', 'in', 'the', 'lorentzviolating', 'lowdimensional', 'superyangmills', 'theory', 'in', 'the', 'aether', 'superspace', 'coupled', 'to', 'a', 'scalar', 'matter', 'we', 'also', 'suggest', 'that', 'our', 'studies', 'can', 'be', 'applied', 'for', 'condensed', 'matter', 'systems', 'especially', 'lowerdimensional', 'superconductors', 'and', 'topological', 'insulators', 'in', 'low', 'dimensional', 'materials', 'the', 'parameter', 'delta', 'generated', 'by', 'presence', 'of', 'the', 'aether', 'term', 'can', 'be', 'interpreted', 'as', 'a', 'quantity', 'that', 'renormalizes', 'the', 'propagation', 'velocity', 'of', 'the', 'bosonic', 'mode', 'with', 'respect', 'to', 'the', 'fermi', 'velocity']] | [-0.17895349714598513, 0.26002479614572055, -0.0547484405032253, 0.04145247474330466, -0.09159259053088631, -0.11839696618321623, -0.02104228135652227, 0.3034519726363353, -0.23452319666342455, -0.2581470353518542, 0.02812108953330147, -0.2793991732929798, -0.1781772910145736, 0.1591427036549283, -0.03317298560957365, 0.04277556873504308, -0.03084200279952227, 0.038894431388500746, -0.08778186454850284, -0.24388948174877256, 0.33208188145197454, 0.0030869864092408854, 0.25157733562202017, 0.038312958924783556, 0.059407642317487845, -0.025215197118777264, 0.03532757548780381, 0.06800140891978636, -0.10840334815855132, 0.10547283943742514, 0.26271696885033874, 0.001979728152716084, 0.18253346138834198, -0.4172362562599061, -0.3108853512337502, 0.07960597003656852, 0.170440354372693, 0.13359471289676766, -0.06330916671011644, -0.32085451639339896, 0.014409176883718022, -0.20625372848155188, -0.172868714680014, -0.12459508083831472, -0.031118583859569286, -0.06374275850874808, -0.22158821004655072, 0.143120696764849, 0.008562145570125078, 0.0208772927334037, -0.09125735917824167, -0.049974843541372424, -0.0719396172568815, 0.010900551299977152, 0.11100631051614315, 0.07767746103868549, 0.1284424376819884, -0.2123640523734392, -0.09942518213698995, 0.4338255079486702, -0.15488053554568817, -0.23791876154704183, 0.1787127674073924, -0.1494871912994923, -0.14088450786009243, 0.07910130155284571, 0.1999433463250723, 0.09848570033224134, -0.12562427883142535, 0.14441334126374236, -0.04102559978602147, 0.18011967737015477, 0.03472952173339038, 0.08081343240705849, 0.31051173863956066, 0.14234364317447135, 0.037003695717246474, 0.10933609121431938, -0.07390862987730416, -0.07012401898450489, -0.3319747909738482, -0.1975089252566848, -0.204870376171164, 0.026243540069347697, -0.08640970872060096, -0.16516409882733338, 0.395212552722402, 0.1763270045652738, 0.156621438156389, -0.03328675822991453, 0.24423734188268456, 0.15908320057736355, 0.07697321271783189, 0.04921410957799305, 0.30337974229898257, 0.17808205634650268, 0.09198740700000449, -0.2683950187756291, -0.0515336034571917, 0.08325556654459502] |
1,802.01369 | Driven Hofstadter Butterflies and Related Topological Invariants | The properties of the Hofstadter butterfly, a fractal, self similar spectrum
of a two dimensional electron gas, are studied in the case where the system is
additionally illuminated with monochromatic light. This is accomplished by
applying Floquet theory to a tight binding model on the honeycomb lattice
subjected to a perpendicular magnetic field and either linearly or circularly
polarized light. It is shown how the deformation of the fractal structure of
the spectrum depends on intensity and polarization. Thereby, the topological
properties of the Hofstadter butterfly in presence of the oscillating electric
field are investigated. A thorough numerical analysis of not only the Chern
numbers but also the $W_{3}$-invariants gives the appropriate insight into the
topology of this driven system. This includes a comparison of a direct
$W_3$-calculation to the method based on summing up Chern numbers of the
truncated Floquet Hamiltonian.
| cond-mat.mes-hall | the properties of the hofstadter butterfly a fractal self similar spectrum of a two dimensional electron gas are studied in the case where the system is additionally illuminated with monochromatic light this is accomplished by applying floquet theory to a tight binding model on the honeycomb lattice subjected to a perpendicular magnetic field and either linearly or circularly polarized light it is shown how the deformation of the fractal structure of the spectrum depends on intensity and polarization thereby the topological properties of the hofstadter butterfly in presence of the oscillating electric field are investigated a thorough numerical analysis of not only the chern numbers but also the w_3invariants gives the appropriate insight into the topology of this driven system this includes a comparison of a direct w_3calculation to the method based on summing up chern numbers of the truncated floquet hamiltonian | [['the', 'properties', 'of', 'the', 'hofstadter', 'butterfly', 'a', 'fractal', 'self', 'similar', 'spectrum', 'of', 'a', 'two', 'dimensional', 'electron', 'gas', 'are', 'studied', 'in', 'the', 'case', 'where', 'the', 'system', 'is', 'additionally', 'illuminated', 'with', 'monochromatic', 'light', 'this', 'is', 'accomplished', 'by', 'applying', 'floquet', 'theory', 'to', 'a', 'tight', 'binding', 'model', 'on', 'the', 'honeycomb', 'lattice', 'subjected', 'to', 'a', 'perpendicular', 'magnetic', 'field', 'and', 'either', 'linearly', 'or', 'circularly', 'polarized', 'light', 'it', 'is', 'shown', 'how', 'the', 'deformation', 'of', 'the', 'fractal', 'structure', 'of', 'the', 'spectrum', 'depends', 'on', 'intensity', 'and', 'polarization', 'thereby', 'the', 'topological', 'properties', 'of', 'the', 'hofstadter', 'butterfly', 'in', 'presence', 'of', 'the', 'oscillating', 'electric', 'field', 'are', 'investigated', 'a', 'thorough', 'numerical', 'analysis', 'of', 'not', 'only', 'the', 'chern', 'numbers', 'but', 'also', 'the', 'w_3invariants', 'gives', 'the', 'appropriate', 'insight', 'into', 'the', 'topology', 'of', 'this', 'driven', 'system', 'this', 'includes', 'a', 'comparison', 'of', 'a', 'direct', 'w_3calculation', 'to', 'the', 'method', 'based', 'on', 'summing', 'up', 'chern', 'numbers', 'of', 'the', 'truncated', 'floquet', 'hamiltonian']] | [-0.19601574384931675, 0.17137772593913334, -0.08976782335168017, 0.047615170877959044, -0.045386616832443646, -0.11847050632682762, 0.036238147211094786, 0.3659025059081614, -0.2734403763897717, -0.2628626392123156, 0.039754771369708966, -0.254557141355638, -0.16829214023143452, 0.217392272219461, 0.022495627350040844, 0.02268494658637792, -0.006435187979202186, 0.025180429413116403, -0.04188469142287171, -0.2237753588689624, 0.3411353605599808, 0.041015647814076926, 0.2896755569814039, 0.05970593837888113, 0.05120645174756646, 0.017581007501991864, -0.002196668234786817, 0.06229637126172227, -0.09940852202208979, 0.13138791633038116, 0.11754550667745726, -0.011655149397639824, 0.19468652441864834, -0.42253089952947837, -0.20314386195636222, 0.03362818087584206, 0.1281026175711304, 0.0968631737765723, -0.04147744806998942, -0.27550601221986915, 0.045701340939350694, -0.1339559947340084, -0.160548782418482, -0.07128234925247463, 0.00943441307255333, 0.033191498718224466, -0.2360040105700526, 0.04716272940879987, 0.06399247267483069, 0.08400699050564851, -0.08120827354390972, -0.04840243425985266, -0.0807599829044193, 0.08055727229553408, 0.045928302248440946, 0.026418986560643783, 0.10338415867382926, -0.12802848633047167, -0.09180024355383856, 0.40934317859022745, -0.06268693113483355, -0.18927437774171788, 0.15794124397216364, -0.17946677499650313, -0.08220918176562658, 0.1801517587554242, 0.1229684212877016, 0.10510214118153921, -0.09296901055453678, 0.11990805011092952, -0.08533015587101025, 0.1771041683054396, 0.05057109100078898, 0.0307938379593127, 0.24162283066127982, 0.1578715915059937, 0.06147041419920112, 0.19764603681064077, -0.0886770290305971, -0.09619014463387429, -0.2519892479525879, -0.13012338532800122, -0.2344071075586336, 0.092336898189907, -0.050290910964914864, -0.21538428188297465, 0.49016520734876395, 0.10054016230486533, 0.19942593666824646, -0.032900932830359254, 0.3243821176334417, 0.15783028995584963, 0.036967657549705886, 0.02917523286637983, 0.24236945289885625, 0.19592643324950976, 0.07920288205745497, -0.25036051319413155, -0.02935285162114139, 0.07060432381695136] |
1,802.0137 | A quantitative shrinking target result on Sturmian sequences for
rotations | Let $R_\alpha$ be an irrational rotation of the circle, and code the orbit of
any point $x$ by whether $R_\alpha^i(x)$ belongs to $[0,\alpha)$ or
$[\alpha,1)$ -- this produces a Sturmian sequence. A point is undetermined at
step $j$ if its coding up to time $j$ does not determine its coding at time
$j+1$. We prove a pair of results on the asymptotic frequency of a point being
undetermined, for full measure sets of $\alpha$ and $x$.
| math.DS | let r_alpha be an irrational rotation of the circle and code the orbit of any point x by whether r_alphaix belongs to 0alpha or alpha1 this produces a sturmian sequence a point is undetermined at step j if its coding up to time j does not determine its coding at time j1 we prove a pair of results on the asymptotic frequency of a point being undetermined for full measure sets of alpha and x | [['let', 'r_alpha', 'be', 'an', 'irrational', 'rotation', 'of', 'the', 'circle', 'and', 'code', 'the', 'orbit', 'of', 'any', 'point', 'x', 'by', 'whether', 'r_alphaix', 'belongs', 'to', '0alpha', 'or', 'alpha1', 'this', 'produces', 'a', 'sturmian', 'sequence', 'a', 'point', 'is', 'undetermined', 'at', 'step', 'j', 'if', 'its', 'coding', 'up', 'to', 'time', 'j', 'does', 'not', 'determine', 'its', 'coding', 'at', 'time', 'j1', 'we', 'prove', 'a', 'pair', 'of', 'results', 'on', 'the', 'asymptotic', 'frequency', 'of', 'a', 'point', 'being', 'undetermined', 'for', 'full', 'measure', 'sets', 'of', 'alpha', 'and', 'x']] | [-0.18320019679093683, 0.11437909370716945, -0.08968201430036209, 0.00422880838851671, -0.031329711474402736, -0.21322233393486287, 0.14403585186133766, 0.38858741169443, -0.3206362028832774, -0.18600928354567872, 0.11956347095326998, -0.27184294376874696, -0.04578915449815828, 0.17036188855402273, -0.06206234763502269, -0.014299365370911924, 0.026010050683760562, 0.12822076199164084, -0.08003084757994558, -0.22493983131229273, 0.3131000933212203, 0.008994382126508531, 0.1466207728710189, 0.00877645580928672, 0.13832995341461454, -0.012636369849378997, -0.031020788942318963, -0.06041444367036928, -0.17629059824488452, 0.044124337517329165, 0.22711542565878984, 0.09828346674771023, 0.2839539462348094, -0.27390118173600453, -0.14685184035349536, 0.17310919525806565, 0.1364282748152225, 0.03928917155575913, 0.028492604343006638, -0.22128529496793006, 0.14006614356578603, -0.10530727381056577, -0.1961634466047021, -0.04546878842410405, 0.13740446453763022, 0.0327967081936328, -0.3236315759666566, 0.020313280345116917, 0.1252957451333468, 0.060858838713249645, -0.009794364290035053, -0.10741587599890458, -0.04990100894891027, 0.15131587592721288, 0.024141293450107647, 0.1579158819922422, 0.06495732890215476, -0.039884368923643755, -0.11638529024502212, 0.3945242165260621, -0.04789582218320386, -0.2221271761164472, 0.1342594555730151, -0.21636832103595716, -0.13786446751170867, 0.15197826709560547, 0.10124905868685125, 0.14462758530233358, -0.06679841473767836, 0.18326542343837335, -0.08125122975104966, 0.234965487472584, 0.10603525692194297, -0.02026085467455355, 0.2017357912090783, 0.07175314084098146, 0.11083538097493048, 0.08211477823410737, -0.09502571165196698, -0.006760655587690102, -0.3332752093068651, -0.14262901568734968, -0.23098040818916382, 0.13959935542555507, -0.11264460614994105, -0.18412274939033227, 0.3517804810701794, 0.07637008089521849, 0.1878224729082069, 0.0844861228472075, 0.1968145108580388, 0.12259900339602216, 0.0013269428431207466, 0.13098937064736477, 0.12921778422251745, 0.103648818887745, 0.028063133333784504, -0.19250389472329738, 0.04661090266450334, 0.134085292518894] |
1,802.01371 | General relativity with nonzero cosmological constant as a gauge theory | We show in a new way that the general relativity action (and Lagrangian)in
recent Einstein-Palatini formulation is equivalent in four dimensions to the
action (and Lagrangian) of a gauge field. This paper is a continuation of the
previous paper [17] and it also gives an amended version of the lecture
delivered by one of the authors [M.D.] at Hypercomplex Seminar in Bedlewo.
| gr-qc | we show in a new way that the general relativity action and lagrangianin recent einsteinpalatini formulation is equivalent in four dimensions to the action and lagrangian of a gauge field this paper is a continuation of the previous paper 17 and it also gives an amended version of the lecture delivered by one of the authors md at hypercomplex seminar in bedlewo | [['we', 'show', 'in', 'a', 'new', 'way', 'that', 'the', 'general', 'relativity', 'action', 'and', 'lagrangianin', 'recent', 'einsteinpalatini', 'formulation', 'is', 'equivalent', 'in', 'four', 'dimensions', 'to', 'the', 'action', 'and', 'lagrangian', 'of', 'a', 'gauge', 'field', 'this', 'paper', 'is', 'a', 'continuation', 'of', 'the', 'previous', 'paper', '17', 'and', 'it', 'also', 'gives', 'an', 'amended', 'version', 'of', 'the', 'lecture', 'delivered', 'by', 'one', 'of', 'the', 'authors', 'md', 'at', 'hypercomplex', 'seminar', 'in', 'bedlewo']] | [-0.12512220970553453, 0.06639955546463588, -0.14747074787642378, 0.014127710202449292, -0.0776396426448568, -0.07991800836638593, -0.0276092925666236, 0.2890130291086026, -0.19749760056738971, -0.3139470928409671, 0.08575486282810385, -0.25460775959931436, -0.22949769570812828, 0.1562439200514164, -0.13782882838525246, -0.007830369820604558, 0.05435255930194112, 0.06683532594413054, -0.07336115473346999, -0.31142916984581315, 0.3436879043574216, 0.07642516535019776, 0.22542651095351235, 0.05289418460251611, 0.13162901171589972, -0.001312045113290431, -0.06464231675338061, 0.04531657222475185, -0.11912504779463577, 0.1732759490135874, 0.21223939775077047, 0.10311294084445374, 0.25906856214536017, -0.4019358470791676, -0.16196486430212123, 0.0010626053162774102, 0.09267748597642926, 0.1369841804911123, -0.03926457866232415, -0.2784095999219867, 0.0649883236705524, -0.19814961166960782, -0.12459417753356708, -0.013920593823565811, 0.03213020284530386, -0.08097883226869047, -0.2254832067420004, 0.02490387234376881, 0.07636505893630083, 0.10374745691851636, -0.05156626169127031, -0.08205374453567946, 0.07349613987956173, 0.05895982123148002, 0.082372913587472, 0.13409139783136914, 0.06067109004915005, -0.10563225777758682, -0.13542632746403335, 0.430494207217068, -0.10084520272727383, -0.2105841566732184, 0.17555707967916473, -0.1307399159556896, -0.20722403841429068, 0.07683842976531777, 0.14488402491465943, 0.16344672542248592, -0.2007090735600376, 0.14085791412393608, -0.081483473650134, 0.11723181536634926, 0.07863496592054602, -0.02975424621387797, 0.1544892174634533, 0.10254319054914303, 0.04655431146870871, 0.11082605338945496, 0.009774305140141581, -0.10790239112665419, -0.38198568216967776, -0.21804463496950807, -0.13366280631620253, 0.09428929878001818, -0.019579304495996215, -0.08395847703376022, 0.4347962466389185, 0.15367516271434115, 0.1259223945499932, 0.0632744193168693, 0.2379716131836176, 0.11936925348566203, 0.021254266719104815, 0.05581732801176974, 0.23789054402684578, 0.1329464400072628, 0.13327109815980323, -0.14268490307216272, -0.08254265515171907, 0.170245180326346] |
1,802.01372 | Multi-parameter extensions of a theorem of Pichorides | Extending work of Pichorides and Zygmund to the $d$-dimensional setting, we
show that the supremum of $L^p$-norms of the Littlewood-Paley square function
over the unit ball of the analytic Hardy spaces $H^p_A(\mathbb{T}^d)$ blows up
like $(p-1)^{-d}$ as $p\to 1^+$. Furthermore, we obtain an $L\log^d L$-estimate
for square functions on $H^1_A(\mathbb{T}^d)$. Euclidean variants of
Pichorides's theorem are also obtained.
| math.CA math.CV | extending work of pichorides and zygmund to the ddimensional setting we show that the supremum of lpnorms of the littlewoodpaley square function over the unit ball of the analytic hardy spaces hp_amathbbtd blows up like p1d as pto 1 furthermore we obtain an llogd lestimate for square functions on h1_amathbbtd euclidean variants of pichoridess theorem are also obtained | [['extending', 'work', 'of', 'pichorides', 'and', 'zygmund', 'to', 'the', 'ddimensional', 'setting', 'we', 'show', 'that', 'the', 'supremum', 'of', 'lpnorms', 'of', 'the', 'littlewoodpaley', 'square', 'function', 'over', 'the', 'unit', 'ball', 'of', 'the', 'analytic', 'hardy', 'spaces', 'hp_amathbbtd', 'blows', 'up', 'like', 'p1d', 'as', 'pto', '1', 'furthermore', 'we', 'obtain', 'an', 'llogd', 'lestimate', 'for', 'square', 'functions', 'on', 'h1_amathbbtd', 'euclidean', 'variants', 'of', 'pichoridess', 'theorem', 'are', 'also', 'obtained']] | [-0.07498666197240639, 0.05235630760328674, -0.02605665557516309, 0.09895022123908767, -0.03116431235908889, -0.040701541440704696, 0.02562598053079385, 0.359156078667953, -0.309093866416683, -0.1350584911684004, 0.17169972165272787, -0.31972446092046225, -0.1215665340423584, 0.2564810584478367, -0.08480992888172086, 0.07623424933542712, -0.022972175779824074, 0.059439747840560116, -0.130408268480096, -0.30942438320758253, 0.36477330405838215, -0.0021006810443046, 0.16543971965662563, 0.09183463195446305, 0.11087173628262602, 0.06468281231354922, 0.0034020408146226634, -0.031107949164624397, -0.24063055117487517, 0.135352627087671, 0.16523985172478625, 0.08511027910460073, 0.3233675262532555, -0.37431454894920957, -0.17978260907917643, 0.1857177208070285, 0.16495675121684775, -0.07653707305255991, 0.04035723892873368, -0.26630531836193627, 0.07264915900304914, -0.08980525353063758, -0.18684796203832285, -0.10188567964360118, 0.02168783775638216, 0.09077877273263696, -0.31968387868255377, 0.0786344085662187, 0.12245678873016284, 0.041109044140634626, -0.15630472221304303, -0.17888590888693356, 0.020870984469253857, 0.10604281609770484, 0.03932833066210151, 0.14251882689467704, 0.09381738071533618, -0.03182220698083536, -0.14937978230703336, 0.31972712659850144, -0.10165945275758322, -0.24469990852790383, 0.07956520881718741, -0.22706467081577733, -0.08982177873034604, 0.04076418191946756, 0.17232866560628352, 0.14474503612235332, -0.050260903958517775, 0.21115063369842785, -0.11467165110382037, 0.0935843975435441, 0.1656082667535744, 0.07625897246180102, 0.006526500416489748, 0.0927813718892419, 0.1708608304257863, 0.20252045772324961, -0.0777762771196229, -0.11842010811736915, -0.3703746998933359, -0.20686915552673432, -0.2407115462522667, 0.12679417789555514, -0.1661797340849052, -0.20565561796180332, 0.32034618887477195, 0.03226727978863682, 0.18066592528171335, 0.193547851835879, 0.18123577950665584, 0.10426546523768383, 0.06529310035805863, 0.05951318356136863, 0.16768803261220455, 0.16845233883941546, 0.058460318525948636, -0.11635468398722318, -0.08522575920841728, 0.19058882882102177] |
1,802.01373 | Optimal Besov differentiability for entropy solutions of the Eikonal
equation | In this paper we study the Eikonal equation in a bounded planar domain. We
prove the equivalence among optimal Besov regularity, the finiteness of every
entropy production and the validity of a kinetic formulation.
| math.AP | in this paper we study the eikonal equation in a bounded planar domain we prove the equivalence among optimal besov regularity the finiteness of every entropy production and the validity of a kinetic formulation | [['in', 'this', 'paper', 'we', 'study', 'the', 'eikonal', 'equation', 'in', 'a', 'bounded', 'planar', 'domain', 'we', 'prove', 'the', 'equivalence', 'among', 'optimal', 'besov', 'regularity', 'the', 'finiteness', 'of', 'every', 'entropy', 'production', 'and', 'the', 'validity', 'of', 'a', 'kinetic', 'formulation']] | [-0.16440499868065886, 0.06710104238899316, -0.10236295060638119, 0.1147429453147411, -0.06546289917519864, -0.03948019546292284, 0.014443924352663624, 0.2667287732474506, -0.31496245452367205, -0.17137750780538602, 0.07928072528995793, -0.2821413337746087, -0.11932601560564603, 0.12368888057330076, -0.10390548271072261, 0.11038895805968958, 0.07913572378182675, 0.03790652654681574, -0.07577465803307645, -0.21998975306804128, 0.39537525264655843, -0.07154358627603334, 0.27720120790250163, 0.16228106092004216, 0.14620718077811248, 0.024727090946672595, 0.023931380068568292, 0.03967737228445271, -0.278996185728294, 0.15617678104899824, 0.23458722896654816, 0.08832154137438492, 0.3158271430361578, -0.35706176828877206, -0.20742054727366743, 0.19013093677623308, 0.10444526905741762, 0.0526018044911325, -0.042769323907765174, -0.2166875424411367, 0.10551340479458518, -0.1430041263537372, -0.18995021275409005, -0.0031393930343363214, -0.005500935620683081, 0.0442425548852257, -0.28994183236842647, 0.09040177512146971, 0.15252865099019425, 0.046723740127430684, -0.18319763461648322, 0.0007019174175665659, -0.013656747691771564, 0.03287168388145373, 0.03685288558549741, 0.0196401415981681, 0.03756734157522099, -0.1168951893102049, -0.1087522140758879, 0.3323420457103673, -0.059114238192491675, -0.2837755508063471, 0.1296892046709271, -0.19021015756708734, -0.17311241222983775, 0.04323166873141685, 0.16587290244505687, 0.1798507965012344, -0.19480789510314078, 0.21855264061014168, -0.08346122196492027, 0.12956816053209716, 0.15737418709870646, 0.04286581118974615, 0.028770908288767234, 0.18141176600885742, 0.09891175180125762, 0.23308714183376117, 0.002976355005932205, -0.09727032789412667, -0.45557568507159457, -0.21159151905928464, -0.1513212170890149, 0.10618522075717063, -0.15384505846604418, -0.18817896752015634, 0.35463196022764726, 0.19527925783768296, 0.11586195679710191, 0.14386907817028902, 0.25996710546314716, 0.15890074490487358, -0.047110669205293935, 0.13875314127653837, 0.24090816349010258, 0.19236421004375992, 0.11860881417113192, -0.2369766280274181, 0.014756852459600744, 0.21689674758261604] |
1,802.01374 | Congruences for the Coefficients of the Powers of the Euler Product | Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod
_{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the
properties of the modular equations of the second and the third order under the
Atkin $U$-operator, we determine the generating functions of
$p_{8k}(2^{2\alpha} n +\frac{k(2^{2\alpha}-1)}{3})$ $(1\leq k\leq 3)$ and
$p_{3k} (3^{2\beta}n+\frac{k(3^{2\beta}-1)}{8})$ $(1\leq k\leq 8)$ in terms of
some linear recurring sequences. Combining with a result of Engstrom about the
periodicity of linear recurring sequences modulo $m$, we obtain infinite
families of congruences for $p_k(n)$ modulo any $m\geq2$, where $1\leq k\leq
24$ and $3|k$ or $8|k$. Based on these congruences for $p_k(n)$, infinite
families of congruences for many partition functions such as the overpartition
function, $t$-core partition functions and $\ell$-regular partition functions
are easily obtained.
| math.CO math.NT | let p_kn be given by the kth power of the euler product prod _n1infty1qnksum_n0inftyp_knqn by investigating the properties of the modular equations of the second and the third order under the atkin uoperator we determine the generating functions of p_8k22alpha n frack22alpha13 1leq kleq 3 and p_3k 32betanfrack32beta18 1leq kleq 8 in terms of some linear recurring sequences combining with a result of engstrom about the periodicity of linear recurring sequences modulo m we obtain infinite families of congruences for p_kn modulo any mgeq2 where 1leq kleq 24 and 3k or 8k based on these congruences for p_kn infinite families of congruences for many partition functions such as the overpartition function tcore partition functions and ellregular partition functions are easily obtained | [['let', 'p_kn', 'be', 'given', 'by', 'the', 'kth', 'power', 'of', 'the', 'euler', 'product', 'prod', '_n1infty1qnksum_n0inftyp_knqn', 'by', 'investigating', 'the', 'properties', 'of', 'the', 'modular', 'equations', 'of', 'the', 'second', 'and', 'the', 'third', 'order', 'under', 'the', 'atkin', 'uoperator', 'we', 'determine', 'the', 'generating', 'functions', 'of', 'p_8k22alpha', 'n', 'frack22alpha13', '1leq', 'kleq', '3', 'and', 'p_3k', '32betanfrack32beta18', '1leq', 'kleq', '8', 'in', 'terms', 'of', 'some', 'linear', 'recurring', 'sequences', 'combining', 'with', 'a', 'result', 'of', 'engstrom', 'about', 'the', 'periodicity', 'of', 'linear', 'recurring', 'sequences', 'modulo', 'm', 'we', 'obtain', 'infinite', 'families', 'of', 'congruences', 'for', 'p_kn', 'modulo', 'any', 'mgeq2', 'where', '1leq', 'kleq', '24', 'and', '3k', 'or', '8k', 'based', 'on', 'these', 'congruences', 'for', 'p_kn', 'infinite', 'families', 'of', 'congruences', 'for', 'many', 'partition', 'functions', 'such', 'as', 'the', 'overpartition', 'function', 'tcore', 'partition', 'functions', 'and', 'ellregular', 'partition', 'functions', 'are', 'easily', 'obtained']] | [-0.2170774725576242, 0.13360136790543348, -0.030802596831330076, 0.07851182078767537, -0.03173436977876685, -0.1329710064575267, -0.017664449074520513, 0.2743013560787862, -0.2717546064856375, -0.2827461678136745, 0.10922367096994008, -0.3400542461492408, -0.13785505275297752, 0.19199063923830786, -0.02208028851687892, 0.06528436493637979, -0.03350694434574017, 0.07803730342415774, -0.09214278348347443, -0.3098167431158706, 0.3576004962062734, -0.07551734195624152, 0.14066414781010303, 0.019839355444961473, 0.10938012822825685, 0.0669973270706912, 0.0010229561464964515, -0.028166895789993752, -0.19320631900436094, 0.11250947042901674, 0.292571023815017, 0.1491476868470319, 0.2373104441879142, -0.37259478461092865, -0.10052091749205899, 0.205684416119455, 0.15677779820848667, -0.08014409711114807, 0.03362579845811407, -0.20452900647193703, 0.16641586462561136, -0.11739322140367113, -0.1583818660225146, -0.0695687275276416, 0.06694399730031753, 0.13556698015413415, -0.3573639166748358, 0.009659220181946825, 0.14816583027569658, 0.126012660531152, -0.06056742041877224, -0.23455043124735483, -0.007149487678120788, 0.08655152220077988, -0.009730929200354422, 0.04854087220329759, -0.03073493603011991, -0.0851290687942543, -0.139354795203584, 0.3186786058756849, 0.004270555820658357, -0.20696786458158276, 0.05515680559035231, -0.1816181602099767, -0.20568547426508024, 0.10676838762652224, 0.08505804019255771, 0.18691947243502763, -0.04250279439087862, 0.1468685226033354, -0.11188161020111452, 0.15610137325064796, 0.22086395412030765, 0.01767757288220092, 0.11461708541665003, 0.012598713155453786, 0.038624786496715635, 0.2009061415387222, 0.03758101757321284, 0.03962453432842834, -0.35250823501433826, -0.18579662858675688, -0.17809695382721913, 0.14481463173054096, -0.21388716859151968, -0.15379170026992345, 0.3518932649356305, 0.04581909337375536, 0.16093636503936642, 0.18257953872920102, 0.16603214470430827, 0.12678541501080537, 0.054062451920511886, 0.07776678716923055, -7.916366732201706e-05, 0.16074611300514996, -0.028336456001728263, -0.14024808384208445, -0.012596679621567138, 0.2096569507709171] |
1,802.01375 | Adipochondrocytes in rabbit auricular cartilage | Chondrocytes are described as one cell population in different cartilage
types. The auricular cartilage in mouse and rat contains unique chondrocytes
similar in morphology to white adipocytes and known as lipochondrocytes.
Lipochondrocytes were not mentioned in other species. The current study aimed
to explore the existence of this cell type in rabbits. The auricles of adult
male white rabbits were harvested and processed for histological examination
with light and electron microscopy. With the light microscopy, the auricular
cartilage of adult rabbits contained central large rounded adipocyte-like
chondrocytes, termed in the current study adipochondrocytes The
adipochondrocytes were embedded in relatively wide lacunae and had large lipid
droplets with a rim of cytoplasm. The scanning electron microscopy confirmed
this result. With the transmission electron microscopy, the adipochondrocytes
showed dark nucleus and electron-dense cytoplasm with few organelles and
cytoplasmic processes. The adipochondrocytes of the auricular cartilage in
adult rabbits were unique cell type and different from chondrocytes in other
cartilage subtypes. This result should be considered during cartilage
transplant. Further studies are suggested to investigate the development and
physiological roles of adipochondrocytes in the auricular cartilage in rabbits.
| q-bio.TO | chondrocytes are described as one cell population in different cartilage types the auricular cartilage in mouse and rat contains unique chondrocytes similar in morphology to white adipocytes and known as lipochondrocytes lipochondrocytes were not mentioned in other species the current study aimed to explore the existence of this cell type in rabbits the auricles of adult male white rabbits were harvested and processed for histological examination with light and electron microscopy with the light microscopy the auricular cartilage of adult rabbits contained central large rounded adipocytelike chondrocytes termed in the current study adipochondrocytes the adipochondrocytes were embedded in relatively wide lacunae and had large lipid droplets with a rim of cytoplasm the scanning electron microscopy confirmed this result with the transmission electron microscopy the adipochondrocytes showed dark nucleus and electrondense cytoplasm with few organelles and cytoplasmic processes the adipochondrocytes of the auricular cartilage in adult rabbits were unique cell type and different from chondrocytes in other cartilage subtypes this result should be considered during cartilage transplant further studies are suggested to investigate the development and physiological roles of adipochondrocytes in the auricular cartilage in rabbits | [['chondrocytes', 'are', 'described', 'as', 'one', 'cell', 'population', 'in', 'different', 'cartilage', 'types', 'the', 'auricular', 'cartilage', 'in', 'mouse', 'and', 'rat', 'contains', 'unique', 'chondrocytes', 'similar', 'in', 'morphology', 'to', 'white', 'adipocytes', 'and', 'known', 'as', 'lipochondrocytes', 'lipochondrocytes', 'were', 'not', 'mentioned', 'in', 'other', 'species', 'the', 'current', 'study', 'aimed', 'to', 'explore', 'the', 'existence', 'of', 'this', 'cell', 'type', 'in', 'rabbits', 'the', 'auricles', 'of', 'adult', 'male', 'white', 'rabbits', 'were', 'harvested', 'and', 'processed', 'for', 'histological', 'examination', 'with', 'light', 'and', 'electron', 'microscopy', 'with', 'the', 'light', 'microscopy', 'the', 'auricular', 'cartilage', 'of', 'adult', 'rabbits', 'contained', 'central', 'large', 'rounded', 'adipocytelike', 'chondrocytes', 'termed', 'in', 'the', 'current', 'study', 'adipochondrocytes', 'the', 'adipochondrocytes', 'were', 'embedded', 'in', 'relatively', 'wide', 'lacunae', 'and', 'had', 'large', 'lipid', 'droplets', 'with', 'a', 'rim', 'of', 'cytoplasm', 'the', 'scanning', 'electron', 'microscopy', 'confirmed', 'this', 'result', 'with', 'the', 'transmission', 'electron', 'microscopy', 'the', 'adipochondrocytes', 'showed', 'dark', 'nucleus', 'and', 'electrondense', 'cytoplasm', 'with', 'few', 'organelles', 'and', 'cytoplasmic', 'processes', 'the', 'adipochondrocytes', 'of', 'the', 'auricular', 'cartilage', 'in', 'adult', 'rabbits', 'were', 'unique', 'cell', 'type', 'and', 'different', 'from', 'chondrocytes', 'in', 'other', 'cartilage', 'subtypes', 'this', 'result', 'should', 'be', 'considered', 'during', 'cartilage', 'transplant', 'further', 'studies', 'are', 'suggested', 'to', 'investigate', 'the', 'development', 'and', 'physiological', 'roles', 'of', 'adipochondrocytes', 'in', 'the', 'auricular', 'cartilage', 'in', 'rabbits']] | [-0.02984425943965713, 0.1509657147828774, -0.0249814624839928, 0.042538576863525024, 0.02167045234560242, -0.15001484974960072, 0.013365787866577092, 0.36904975674632523, -0.20021492428042822, -0.2691049991330753, 0.08273709658145284, -0.31910099471505315, -0.20011586905974482, 0.1535772640620255, -0.17773440345190467, -0.029963180298606555, 0.03473056006607496, -0.02251416473300196, 0.11677696422039945, -0.21217290085866505, 0.22014613170176744, 0.02331049265857372, 0.2921158743608329, 0.04937632885416355, 0.06259923495559229, -0.012592527252208028, -0.0334616581728268, -0.021227401026731565, -0.16319155209542563, 0.09156447856480049, 0.28937201157677916, 0.09774452747725364, 0.24793390744727933, -0.5165663541191154, -0.25222276714630426, 0.07350198878557421, 0.17686510127969085, 0.04922030343311942, -0.051472464002047975, -0.24721260876394807, 0.09259925813207195, -0.11747436682215064, -0.10818169198593952, 0.016738167462042635, -0.028795466385135013, 0.06684942861449801, -0.18422004224784258, 0.1698677452447656, -0.02233731980021629, 0.1481845903520783, -0.1548906566368209, -0.12850114580295566, -0.07419194100980854, 0.18614615476948934, 0.07919857177831646, 0.00486358806439158, 0.2572813850646425, -0.14164446998539562, -0.07015200633969572, 0.31539974172353846, 0.0161399355960182, -0.10358935473098731, 0.21629093021620066, -0.20495561605461665, -0.09205283430767142, 0.1292015208015477, 0.12984215429363152, 0.08024575509027475, -0.22923869222092133, -0.07610079576030936, -0.026144002797082067, 0.14869546324221625, 0.19107462489046156, -0.03983607911957531, 0.16974893527674592, 0.2359751654581891, -0.09369970400649537, 0.11606257191031344, -0.16014095823694435, 0.003230547418610917, -0.1566592900806831, -0.20209922659624782, -0.05834956442833775, 0.04542088777274734, -0.02477562281540789, -0.16269414729128281, 0.3749767422857177, 0.026725870479842543, 0.15925091738916106, -0.03445072795083332, 0.23654262515224722, -0.07976693088162898, 0.10534109781987758, -0.04031018839062502, 0.1900673869997263, 0.09078102976394196, 0.14062796865279475, -0.25936090658781014, 0.12591533583795858, 0.007991855599619966] |
1,802.01376 | Two-dimensional type-II Dirac fermions in layered oxides | Relativistic massless Dirac fermions can be probed with high-energy physics
experiments, but appear also as low-energy quasi-particle excitations in
electronic band structures. In condensed matter systems, their massless nature
can be protected by crystal symmetries. Classification of such
symmetry-protected relativistic band degeneracies has been fruitful, although
many of the predicted quasi-particles still await their experimental discovery.
Here we reveal, using angle-resolved photoemission spectroscopy, the existence
of two-dimensional type-II Dirac fermions in the high-temperature
superconductor La$_{1.77}$Sr$_{0.23}$CuO$_4$. The Dirac point, constituting the
crossing of $d_{x^2-y^2}$ and $d_{z^2}$ bands, is found approximately one
electronvolt below the Fermi level ($E_\mathrm{F}$) and is protected by mirror
symmetry. If spin-orbit coupling is considered, the Dirac point degeneracy is
lifted and the bands acquire a topologically non-trivial character. In certain
nickelate systems, band structure calculations suggest that the same type-II
Dirac fermions can be realised near $E_\mathrm{F}$.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.supr-con | relativistic massless dirac fermions can be probed with highenergy physics experiments but appear also as lowenergy quasiparticle excitations in electronic band structures in condensed matter systems their massless nature can be protected by crystal symmetries classification of such symmetryprotected relativistic band degeneracies has been fruitful although many of the predicted quasiparticles still await their experimental discovery here we reveal using angleresolved photoemission spectroscopy the existence of twodimensional typeii dirac fermions in the hightemperature superconductor la_177sr_023cuo_4 the dirac point constituting the crossing of d_x2y2 and d_z2 bands is found approximately one electronvolt below the fermi level e_mathrmf and is protected by mirror symmetry if spinorbit coupling is considered the dirac point degeneracy is lifted and the bands acquire a topologically nontrivial character in certain nickelate systems band structure calculations suggest that the same typeii dirac fermions can be realised near e_mathrmf | [['relativistic', 'massless', 'dirac', 'fermions', 'can', 'be', 'probed', 'with', 'highenergy', 'physics', 'experiments', 'but', 'appear', 'also', 'as', 'lowenergy', 'quasiparticle', 'excitations', 'in', 'electronic', 'band', 'structures', 'in', 'condensed', 'matter', 'systems', 'their', 'massless', 'nature', 'can', 'be', 'protected', 'by', 'crystal', 'symmetries', 'classification', 'of', 'such', 'symmetryprotected', 'relativistic', 'band', 'degeneracies', 'has', 'been', 'fruitful', 'although', 'many', 'of', 'the', 'predicted', 'quasiparticles', 'still', 'await', 'their', 'experimental', 'discovery', 'here', 'we', 'reveal', 'using', 'angleresolved', 'photoemission', 'spectroscopy', 'the', 'existence', 'of', 'twodimensional', 'typeii', 'dirac', 'fermions', 'in', 'the', 'hightemperature', 'superconductor', 'la_177sr_023cuo_4', 'the', 'dirac', 'point', 'constituting', 'the', 'crossing', 'of', 'd_x2y2', 'and', 'd_z2', 'bands', 'is', 'found', 'approximately', 'one', 'electronvolt', 'below', 'the', 'fermi', 'level', 'e_mathrmf', 'and', 'is', 'protected', 'by', 'mirror', 'symmetry', 'if', 'spinorbit', 'coupling', 'is', 'considered', 'the', 'dirac', 'point', 'degeneracy', 'is', 'lifted', 'and', 'the', 'bands', 'acquire', 'a', 'topologically', 'nontrivial', 'character', 'in', 'certain', 'nickelate', 'systems', 'band', 'structure', 'calculations', 'suggest', 'that', 'the', 'same', 'typeii', 'dirac', 'fermions', 'can', 'be', 'realised', 'near', 'e_mathrmf']] | [-0.21883793418143252, 0.28200350277521147, -0.06851507854654634, 0.11500657170930569, -0.09918651914746641, -0.21839874220020372, 0.09559542038260202, 0.3664499920719176, -0.25509047989311406, -0.31711067799344766, -0.019937045456801385, -0.3502173568758604, -0.12750327443074194, 0.12613841734672462, 0.06956217923744333, 0.03314397057933773, -0.0034482458391957146, -0.07435374608993692, -0.17531490067133962, -0.2034734777208286, 0.31780216182588783, 0.011282982316417552, 0.29432682215953043, 0.09096899487098291, -0.03623079257286924, -0.019941331614344884, 0.13678423010261742, -0.04613069529316837, -0.06908547529045587, 0.038997899056261526, 0.30176743077911544, -0.14362061321534378, 0.1313201148789912, -0.4216077735768162, -0.24557961804102169, 0.006339566748616078, 0.2002493929521603, 0.1349825445602802, -0.08866613997789703, -0.37181377500000834, 0.031937955464521196, -0.1499246372807798, -0.1967882241504334, -0.12863814058753817, -0.10029441928289992, -0.13244086042006345, -0.12330058689451971, 0.10900693210725432, -0.008475327010018577, 0.07187809803636816, -0.07187119492651264, -0.11113459163801008, -0.1857831700798794, 0.017733897564919304, 0.07421875342629555, -0.006630890274700112, 0.08779568920370942, -0.13461490607277737, -0.17403350905481751, 0.4784106224467107, -0.025205840993163395, -0.11076525678496352, 0.17675442424462104, -0.19626319113609603, -0.12263571173488665, 0.1830625964392298, 0.05773431716801719, 0.05135442775828268, -0.1040137347253542, 0.1720522334267345, -0.08794496825430542, 0.1308685287237737, 0.038236735715269504, 0.14348761584582947, 0.3902978616491925, 0.15733179428301444, 0.03400243584547366, 0.022393406718038023, -0.13658059717544602, -0.013912315445235201, -0.2542042803511747, -0.15424833041213776, -0.2859303407076237, 0.07639284092068618, 0.033129527238461444, -0.18037979485024866, 0.43086711513615555, 0.09325881197499178, 0.15136558443756787, -0.11388710658769492, 0.15783043718970508, 0.148475913986691, 0.08076589748517965, 0.06846804126574517, 0.3042071755245167, 0.11916175706432663, 0.03306225425707806, -0.27296191146898774, -0.038846586432673115, 0.030331298085800606] |
1,802.01377 | The nature of the TRAPPIST-1 exoplanets | Context. The TRAPPIST-1 system hosts seven Earth-sized, temperate exoplanets
orbiting an ultra-cool dwarf star. As such, it represents a remarkable setting
to study the formation and evolution of terrestrial planets that formed in the
same protoplanetary disk. While the sizes of the TRAPPIST-1 planets are all
known to better than 5% precision, their densities have significant
uncertainties (between 28% and 95%) because of poor constraints on the planet's
masses. Aims.The goal of this paper is to improve our knowledge of the
TRAPPIST-1 planetary masses and densities using transit-timing variations
(TTV). The complexity of the TTV inversion problem is known to be particularly
acute in multi-planetary systems (convergence issues, degeneracies and size of
the parameter space), especially for resonant chain systems such as TRAPPIST-1.
Methods. To overcome these challenges, we have used a novel method that employs
a genetic algorithm coupled to a full N-body integrator that we applied to a
set of 284 individual transit timings. This approach enables us to efficiently
explore the parameter space and to derive reliable masses and densities from
TTVs for all seven planets. Results. Our new masses result in a five- to
eight-fold improvement on the planetary density uncertainties, with precisions
ranging from 5% to 12%. These updated values provide new insights into the bulk
structure of the TRAPPIST-1 planets. We find that TRAPPIST-1\,c and e likely
have largely rocky interiors, while planets b, d, f, g, and h require envelopes
of volatiles in the form of thick atmospheres, oceans, or ice, in most cases
with water mass fractions less than 5%.
| astro-ph.EP | context the trappist1 system hosts seven earthsized temperate exoplanets orbiting an ultracool dwarf star as such it represents a remarkable setting to study the formation and evolution of terrestrial planets that formed in the same protoplanetary disk while the sizes of the trappist1 planets are all known to better than 5 precision their densities have significant uncertainties between 28 and 95 because of poor constraints on the planets masses aimsthe goal of this paper is to improve our knowledge of the trappist1 planetary masses and densities using transittiming variations ttv the complexity of the ttv inversion problem is known to be particularly acute in multiplanetary systems convergence issues degeneracies and size of the parameter space especially for resonant chain systems such as trappist1 methods to overcome these challenges we have used a novel method that employs a genetic algorithm coupled to a full nbody integrator that we applied to a set of 284 individual transit timings this approach enables us to efficiently explore the parameter space and to derive reliable masses and densities from ttvs for all seven planets results our new masses result in a five to eightfold improvement on the planetary density uncertainties with precisions ranging from 5 to 12 these updated values provide new insights into the bulk structure of the trappist1 planets we find that trappist1c and e likely have largely rocky interiors while planets b d f g and h require envelopes of volatiles in the form of thick atmospheres oceans or ice in most cases with water mass fractions less than 5 | [['context', 'the', 'trappist1', 'system', 'hosts', 'seven', 'earthsized', 'temperate', 'exoplanets', 'orbiting', 'an', 'ultracool', 'dwarf', 'star', 'as', 'such', 'it', 'represents', 'a', 'remarkable', 'setting', 'to', 'study', 'the', 'formation', 'and', 'evolution', 'of', 'terrestrial', 'planets', 'that', 'formed', 'in', 'the', 'same', 'protoplanetary', 'disk', 'while', 'the', 'sizes', 'of', 'the', 'trappist1', 'planets', 'are', 'all', 'known', 'to', 'better', 'than', '5', 'precision', 'their', 'densities', 'have', 'significant', 'uncertainties', 'between', '28', 'and', '95', 'because', 'of', 'poor', 'constraints', 'on', 'the', 'planets', 'masses', 'aimsthe', 'goal', 'of', 'this', 'paper', 'is', 'to', 'improve', 'our', 'knowledge', 'of', 'the', 'trappist1', 'planetary', 'masses', 'and', 'densities', 'using', 'transittiming', 'variations', 'ttv', 'the', 'complexity', 'of', 'the', 'ttv', 'inversion', 'problem', 'is', 'known', 'to', 'be', 'particularly', 'acute', 'in', 'multiplanetary', 'systems', 'convergence', 'issues', 'degeneracies', 'and', 'size', 'of', 'the', 'parameter', 'space', 'especially', 'for', 'resonant', 'chain', 'systems', 'such', 'as', 'trappist1', 'methods', 'to', 'overcome', 'these', 'challenges', 'we', 'have', 'used', 'a', 'novel', 'method', 'that', 'employs', 'a', 'genetic', 'algorithm', 'coupled', 'to', 'a', 'full', 'nbody', 'integrator', 'that', 'we', 'applied', 'to', 'a', 'set', 'of', '284', 'individual', 'transit', 'timings', 'this', 'approach', 'enables', 'us', 'to', 'efficiently', 'explore', 'the', 'parameter', 'space', 'and', 'to', 'derive', 'reliable', 'masses', 'and', 'densities', 'from', 'ttvs', 'for', 'all', 'seven', 'planets', 'results', 'our', 'new', 'masses', 'result', 'in', 'a', 'five', 'to', 'eightfold', 'improvement', 'on', 'the', 'planetary', 'density', 'uncertainties', 'with', 'precisions', 'ranging', 'from', '5', 'to', '12', 'these', 'updated', 'values', 'provide', 'new', 'insights', 'into', 'the', 'bulk', 'structure', 'of', 'the', 'trappist1', 'planets', 'we', 'find', 'that', 'trappist1c', 'and', 'e', 'likely', 'have', 'largely', 'rocky', 'interiors', 'while', 'planets', 'b', 'd', 'f', 'g', 'and', 'h', 'require', 'envelopes', 'of', 'volatiles', 'in', 'the', 'form', 'of', 'thick', 'atmospheres', 'oceans', 'or', 'ice', 'in', 'most', 'cases', 'with', 'water', 'mass', 'fractions', 'less', 'than', '5']] | [-0.10064635411186447, 0.11676805396615067, -0.031929478581720426, 0.0777082345015261, -0.10007110351151534, -0.06374686894678445, 0.10023419586030131, 0.3306252140057266, -0.1628677949138787, -0.39127283424225656, 0.10232393326582531, -0.2613598586930063, -0.10889965707306253, 0.22330730447415695, -0.08554631717098776, 0.07025178274697698, 0.13427738203620176, -0.059006989411824716, -0.06341259926997482, -0.30132269996034283, 0.26839683580576884, 0.0208046500572877, 0.062105393726667464, -0.014266220047752293, 0.02222871092913398, -0.09653730496634232, -0.005505234941609146, -0.06456839011380633, -0.19855964574531937, 0.09629943843005052, 0.25621352293041294, 0.1385197228438026, 0.21136518276942706, -0.37640243925988065, -0.22401201956437958, 0.08916832743909267, 0.15755961425088041, 0.04961780530703796, -0.01868832006765342, -0.2644657712554299, 0.08051424982547832, -0.1938855970610482, -0.1597960000450934, -0.035569672206553896, 0.08477218123874808, -0.018989683154613038, -0.2825843583692728, 0.06715825206668716, 0.05254748091913846, 0.10266663962180993, -0.11876272562035728, -0.19403984618342532, -0.06804176084264073, 0.12186525602303373, 0.018847937506168734, 0.0094065915995328, 0.14812740497291088, -0.07098717262513589, -0.0407225011041128, 0.43589873058412787, -0.09629028394437926, -0.11534390532476611, 0.2809327167870347, -0.21358137636205413, -0.1686936123531254, 0.16390450640180862, 0.2040394502254239, 0.1303492509218496, -0.1783545033524784, 0.013194778454020735, -0.00834126692829751, 0.19535907882973264, 0.08369376589255335, 0.05797772271271665, 0.33318465438314043, 0.17567513940960544, 0.10720768450919986, 0.040088086086235104, -0.17539541141036175, -0.051631690149173834, -0.14721165648833018, -0.1444238699871556, -0.1281582846246703, 0.033557248790928904, -0.09309714937076341, -0.12084590897592175, 0.3612337933064532, 0.18775298913917224, 0.19097966105133915, 0.05377359948772576, 0.3026681281878909, 0.04610051007454271, 0.1075289415988833, 0.09918029770587189, 0.2789624817858905, 0.14539233977408256, 0.061585237955234136, -0.24212053006735104, 0.07850417134292467, -0.01461761249089433] |
1,802.01378 | Psychological Safety and Norm Clarity in Software Engineering Teams | In the software engineering industry today, companies primarily conduct their
work in teams. To increase organizational productivity, it is thus crucial to
know the factors that affect team effectiveness. Two team-related concepts that
have gained prominence lately are psychological safety and team norms. Still,
few studies exist that explore these in a software engineering context.
Therefore, with the aim of extending the knowledge of these concepts, we
examined if psychological safety and team norm clarity associate positively
with software developers' self-assessed team performance and job satisfaction,
two important elements of effectiveness.
We collected industry survey data from practitioners (N = 217) in 38
development teams working for five different organizations. The result of
multiple linear regression analyses indicates that both psychological safety
and team norm clarity predict team members' self-assessed performance and job
satisfaction. The findings also suggest that clarity of norms is a stronger
(30\% and 71\% stronger, respectively) predictor than psychological safety.
This research highlights the need to examine, in more detail, the
relationship between social norms and software development. The findings of
this study could serve as an empirical baseline for such, future work.
| cs.SE | in the software engineering industry today companies primarily conduct their work in teams to increase organizational productivity it is thus crucial to know the factors that affect team effectiveness two teamrelated concepts that have gained prominence lately are psychological safety and team norms still few studies exist that explore these in a software engineering context therefore with the aim of extending the knowledge of these concepts we examined if psychological safety and team norm clarity associate positively with software developers selfassessed team performance and job satisfaction two important elements of effectiveness we collected industry survey data from practitioners n 217 in 38 development teams working for five different organizations the result of multiple linear regression analyses indicates that both psychological safety and team norm clarity predict team members selfassessed performance and job satisfaction the findings also suggest that clarity of norms is a stronger 30 and 71 stronger respectively predictor than psychological safety this research highlights the need to examine in more detail the relationship between social norms and software development the findings of this study could serve as an empirical baseline for such future work | [['in', 'the', 'software', 'engineering', 'industry', 'today', 'companies', 'primarily', 'conduct', 'their', 'work', 'in', 'teams', 'to', 'increase', 'organizational', 'productivity', 'it', 'is', 'thus', 'crucial', 'to', 'know', 'the', 'factors', 'that', 'affect', 'team', 'effectiveness', 'two', 'teamrelated', 'concepts', 'that', 'have', 'gained', 'prominence', 'lately', 'are', 'psychological', 'safety', 'and', 'team', 'norms', 'still', 'few', 'studies', 'exist', 'that', 'explore', 'these', 'in', 'a', 'software', 'engineering', 'context', 'therefore', 'with', 'the', 'aim', 'of', 'extending', 'the', 'knowledge', 'of', 'these', 'concepts', 'we', 'examined', 'if', 'psychological', 'safety', 'and', 'team', 'norm', 'clarity', 'associate', 'positively', 'with', 'software', 'developers', 'selfassessed', 'team', 'performance', 'and', 'job', 'satisfaction', 'two', 'important', 'elements', 'of', 'effectiveness', 'we', 'collected', 'industry', 'survey', 'data', 'from', 'practitioners', 'n', '217', 'in', '38', 'development', 'teams', 'working', 'for', 'five', 'different', 'organizations', 'the', 'result', 'of', 'multiple', 'linear', 'regression', 'analyses', 'indicates', 'that', 'both', 'psychological', 'safety', 'and', 'team', 'norm', 'clarity', 'predict', 'team', 'members', 'selfassessed', 'performance', 'and', 'job', 'satisfaction', 'the', 'findings', 'also', 'suggest', 'that', 'clarity', 'of', 'norms', 'is', 'a', 'stronger', '30', 'and', '71', 'stronger', 'respectively', 'predictor', 'than', 'psychological', 'safety', 'this', 'research', 'highlights', 'the', 'need', 'to', 'examine', 'in', 'more', 'detail', 'the', 'relationship', 'between', 'social', 'norms', 'and', 'software', 'development', 'the', 'findings', 'of', 'this', 'study', 'could', 'serve', 'as', 'an', 'empirical', 'baseline', 'for', 'such', 'future', 'work']] | [-0.07987678245062362, 0.04215194501456289, -0.056739146245102325, 0.08605238778415966, -0.1493608666017551, -0.14145646808870338, 0.05102839802133825, 0.4349237583401437, -0.2043597820806443, -0.40155992367543986, 0.10233034013732764, -0.3035949517129543, -0.16251434610206383, 0.16984095420386341, -0.11645848251929557, 0.04960206744034548, 0.09986160911204343, 0.012451594222236325, -0.001169788365478854, -0.309237816165881, 0.2884466209020969, 0.08884026658142338, 0.3440539699198829, 0.08941898648218076, -0.03514257874780309, -0.033596540338082896, -0.09647511389559588, 0.016292717952180555, -0.10716419586793022, 0.16368387323785322, 0.38047114206427657, 0.2787348410441867, 0.4542186250910163, -0.40888276789840816, -0.15639485913781903, 0.06676956548582058, 0.10517071883848592, -0.0305359041821715, -0.01612317019647201, -0.3172170346653139, 0.03195474193544706, -0.22005863325745875, -0.1225773174114324, -0.09286605604850322, 0.016369254550758144, 0.014959829827342687, -0.19925329775354397, -0.035412437127859055, 0.04660098062709408, 0.16972871395834796, -0.06938674442243536, -0.1698207738916264, -0.004559473914874566, 0.21889461210954028, 0.12154331951830033, 0.009364240977762115, 0.17185654068063644, -0.15396365857859318, -0.16305674608494786, 0.36296747908801646, -0.008303760548792402, -0.12797597974941538, 0.20891354227677691, -0.1076432807333264, -0.2062009672848256, 0.03432085705430222, 0.2344520026025035, 0.005901882324267078, -0.2047543145791703, -0.0015392850150001815, -0.0029303339700139054, 0.19348088516476186, 0.0680771770635368, 0.010872505188013451, 0.18347689538841716, 0.20790616608904422, 0.05709972554389891, 0.07440762785640923, 0.039641169584482105, -0.09758387650866565, -0.22904982890877118, -0.15712847635653374, -0.08731272509573279, -0.004238009623981811, -0.08318560346150834, -0.0831120128844034, 0.36236096064283235, 0.21078580116249016, 0.06063695843551761, 0.06822645330276164, 0.2698398123168059, -0.007182586729224469, 0.08581601791461375, 0.07142651263825797, 0.2620037702969401, 0.03353698435365348, 0.17224948605824564, -0.19249824133569476, 0.12910937801808925, -0.045584833361460145] |
1,802.01379 | Online Compact Convexified Factorization Machine | Factorization Machine (FM) is a supervised learning approach with a powerful
capability of feature engineering. It yields state-of-the-art performance in
various batch learning tasks where all the training data is made available
prior to the training. However, in real-world applications where the data
arrives sequentially in a streaming manner, the high cost of re-training with
batch learning algorithms has posed formidable challenges in the online
learning scenario. The initial challenge is that no prior formulations of FM
could fulfill the requirements in Online Convex Optimization (OCO) -- the
paramount framework for online learning algorithm design. To address the
aforementioned challenge, we invent a new convexification scheme leading to a
Compact Convexified FM (CCFM) that seamlessly meets the requirements in OCO.
However for learning Compact Convexified FM (CCFM) in the online learning
setting, most existing algorithms suffer from expensive projection operations.
To address this subsequent challenge, we follow the general projection-free
algorithmic framework of Online Conditional Gradient and propose an Online
Compact Convex Factorization Machine (OCCFM) algorithm that eschews the
projection operation with efficient linear optimization steps. In support of
the proposed OCCFM in terms of its theoretical foundation, we prove that the
developed algorithm achieves a sub-linear regret bound. To evaluate the
empirical performance of OCCFM, we conduct extensive experiments on 6
real-world datasets for online recommendation and binary classification tasks.
The experimental results show that OCCFM outperforms the state-of-art online
learning algorithms.
| cs.LG | factorization machine fm is a supervised learning approach with a powerful capability of feature engineering it yields stateoftheart performance in various batch learning tasks where all the training data is made available prior to the training however in realworld applications where the data arrives sequentially in a streaming manner the high cost of retraining with batch learning algorithms has posed formidable challenges in the online learning scenario the initial challenge is that no prior formulations of fm could fulfill the requirements in online convex optimization oco the paramount framework for online learning algorithm design to address the aforementioned challenge we invent a new convexification scheme leading to a compact convexified fm ccfm that seamlessly meets the requirements in oco however for learning compact convexified fm ccfm in the online learning setting most existing algorithms suffer from expensive projection operations to address this subsequent challenge we follow the general projectionfree algorithmic framework of online conditional gradient and propose an online compact convex factorization machine occfm algorithm that eschews the projection operation with efficient linear optimization steps in support of the proposed occfm in terms of its theoretical foundation we prove that the developed algorithm achieves a sublinear regret bound to evaluate the empirical performance of occfm we conduct extensive experiments on 6 realworld datasets for online recommendation and binary classification tasks the experimental results show that occfm outperforms the stateofart online learning algorithms | [['factorization', 'machine', 'fm', 'is', 'a', 'supervised', 'learning', 'approach', 'with', 'a', 'powerful', 'capability', 'of', 'feature', 'engineering', 'it', 'yields', 'stateoftheart', 'performance', 'in', 'various', 'batch', 'learning', 'tasks', 'where', 'all', 'the', 'training', 'data', 'is', 'made', 'available', 'prior', 'to', 'the', 'training', 'however', 'in', 'realworld', 'applications', 'where', 'the', 'data', 'arrives', 'sequentially', 'in', 'a', 'streaming', 'manner', 'the', 'high', 'cost', 'of', 'retraining', 'with', 'batch', 'learning', 'algorithms', 'has', 'posed', 'formidable', 'challenges', 'in', 'the', 'online', 'learning', 'scenario', 'the', 'initial', 'challenge', 'is', 'that', 'no', 'prior', 'formulations', 'of', 'fm', 'could', 'fulfill', 'the', 'requirements', 'in', 'online', 'convex', 'optimization', 'oco', 'the', 'paramount', 'framework', 'for', 'online', 'learning', 'algorithm', 'design', 'to', 'address', 'the', 'aforementioned', 'challenge', 'we', 'invent', 'a', 'new', 'convexification', 'scheme', 'leading', 'to', 'a', 'compact', 'convexified', 'fm', 'ccfm', 'that', 'seamlessly', 'meets', 'the', 'requirements', 'in', 'oco', 'however', 'for', 'learning', 'compact', 'convexified', 'fm', 'ccfm', 'in', 'the', 'online', 'learning', 'setting', 'most', 'existing', 'algorithms', 'suffer', 'from', 'expensive', 'projection', 'operations', 'to', 'address', 'this', 'subsequent', 'challenge', 'we', 'follow', 'the', 'general', 'projectionfree', 'algorithmic', 'framework', 'of', 'online', 'conditional', 'gradient', 'and', 'propose', 'an', 'online', 'compact', 'convex', 'factorization', 'machine', 'occfm', 'algorithm', 'that', 'eschews', 'the', 'projection', 'operation', 'with', 'efficient', 'linear', 'optimization', 'steps', 'in', 'support', 'of', 'the', 'proposed', 'occfm', 'in', 'terms', 'of', 'its', 'theoretical', 'foundation', 'we', 'prove', 'that', 'the', 'developed', 'algorithm', 'achieves', 'a', 'sublinear', 'regret', 'bound', 'to', 'evaluate', 'the', 'empirical', 'performance', 'of', 'occfm', 'we', 'conduct', 'extensive', 'experiments', 'on', '6', 'realworld', 'datasets', 'for', 'online', 'recommendation', 'and', 'binary', 'classification', 'tasks', 'the', 'experimental', 'results', 'show', 'that', 'occfm', 'outperforms', 'the', 'stateofart', 'online', 'learning', 'algorithms']] | [-0.05479334434494376, -0.026369578596884446, -0.09677343020478568, 0.060551953121642424, -0.14324119282135708, -0.19552620691608574, 0.046019761550143874, 0.46425015525089514, -0.2727627471126496, -0.30690436434915996, 0.10279813278938146, -0.23905649247723793, -0.16218528015777903, 0.20521007942593786, -0.15006362125959954, 0.1531776128889258, 0.16786368560007822, 0.009759442087419428, -0.10593908946135218, -0.34120303205142183, 0.26733578489601595, 0.03921916131893623, 0.35501956491598635, 0.04575933111582658, 0.12597519253854286, 0.010723568220092947, -0.01662971901394736, -0.020925217944373988, -0.07027651079665545, 0.176282265607934, 0.39152366862780863, 0.2650323578272946, 0.3927543588797562, -0.3908611300867051, -0.17319238912073318, 0.09743168433287165, 0.12230169969502483, 0.0750170030098851, -0.08727554435759445, -0.28127039557348954, 0.0892957700657305, -0.16848122021624948, 0.0018372075343183402, -0.15131526056713232, -0.051895979135538096, -0.031492205751168637, -0.3386130031109948, 0.017823777910405562, 0.0873567149603081, 0.02349840782197385, -0.04561654536544289, -0.1476930079290218, 0.11221786924880721, 0.09866162476125816, 0.05079251748674292, 0.07346370038054563, 0.14186268898152649, -0.14703110116355173, -0.21527503041253457, 0.358761615400877, -0.035378570697503164, -0.15795226176675803, 0.18298968478860655, 0.0157864440678105, -0.20614807697611154, 0.10512348856367491, 0.2810965032108, 0.11191326771849758, -0.16412432523191392, 0.08858335994390755, -0.034580857919254096, 0.15118493912299966, 0.004637034194431557, -0.0285570798374026, 0.07973357263936437, 0.28887100328875964, 0.09770386223079122, 0.13152935407586105, -0.0476729039630676, -0.10241371502995426, -0.20637508986341158, -0.10005451231750315, -0.21174622752557204, -0.03183653211303392, -0.13673159261703277, -0.13926258219149093, 0.32558837029154314, 0.21308894583088314, 0.1670585381959019, 0.11488866920839867, 0.3976309059653431, 0.014656885180839112, 0.08161557275914298, 0.18777489485138835, 0.19948586054720338, 0.015151411903106832, 0.1498939888002371, -0.21339464885411494, 0.07829512395707344, 0.04899379617337876] |
1,802.0138 | Moir\'e structure of MoS$_2$ on Au(111): Local structural and electronic
properties | Monolayer islands of molybdenum disulfide (MoS$_2$) on Au(111) form a
characteristic moir\'e structure, leading to locally different stacking
sequences at the S-Mo-S-Au interface. Using low-temperature scanning tunneling
microscopy (STM) and atomic force microscopy (AFM), we find that the moir\'e
islands exhibit a unique orientation with respect to the Au crystal structure.
This indicates a clear preference of MoS$_2$ growth in a regular stacking
fashion. We further probe the influence of the local atomic structure on the
electronic properties. Differential conductance spectra show pronounced
features of the valence band and conduction band, some of which undergo
significant shifts depending on the local atomic structure. We also determine
the tunneling decay constant as a function of the bias voltage by a
height-modulated spectroscopy method. This allows for an increased sensitivity
of states with non-negligible parallel momentum $k_\parallel$ and the
identification of the origin of the states from different areas in the
Brillouin zone.
| cond-mat.mes-hall | monolayer islands of molybdenum disulfide mos_2 on au111 form a characteristic moire structure leading to locally different stacking sequences at the smosau interface using lowtemperature scanning tunneling microscopy stm and atomic force microscopy afm we find that the moire islands exhibit a unique orientation with respect to the au crystal structure this indicates a clear preference of mos_2 growth in a regular stacking fashion we further probe the influence of the local atomic structure on the electronic properties differential conductance spectra show pronounced features of the valence band and conduction band some of which undergo significant shifts depending on the local atomic structure we also determine the tunneling decay constant as a function of the bias voltage by a heightmodulated spectroscopy method this allows for an increased sensitivity of states with nonnegligible parallel momentum k_parallel and the identification of the origin of the states from different areas in the brillouin zone | [['monolayer', 'islands', 'of', 'molybdenum', 'disulfide', 'mos_2', 'on', 'au111', 'form', 'a', 'characteristic', 'moire', 'structure', 'leading', 'to', 'locally', 'different', 'stacking', 'sequences', 'at', 'the', 'smosau', 'interface', 'using', 'lowtemperature', 'scanning', 'tunneling', 'microscopy', 'stm', 'and', 'atomic', 'force', 'microscopy', 'afm', 'we', 'find', 'that', 'the', 'moire', 'islands', 'exhibit', 'a', 'unique', 'orientation', 'with', 'respect', 'to', 'the', 'au', 'crystal', 'structure', 'this', 'indicates', 'a', 'clear', 'preference', 'of', 'mos_2', 'growth', 'in', 'a', 'regular', 'stacking', 'fashion', 'we', 'further', 'probe', 'the', 'influence', 'of', 'the', 'local', 'atomic', 'structure', 'on', 'the', 'electronic', 'properties', 'differential', 'conductance', 'spectra', 'show', 'pronounced', 'features', 'of', 'the', 'valence', 'band', 'and', 'conduction', 'band', 'some', 'of', 'which', 'undergo', 'significant', 'shifts', 'depending', 'on', 'the', 'local', 'atomic', 'structure', 'we', 'also', 'determine', 'the', 'tunneling', 'decay', 'constant', 'as', 'a', 'function', 'of', 'the', 'bias', 'voltage', 'by', 'a', 'heightmodulated', 'spectroscopy', 'method', 'this', 'allows', 'for', 'an', 'increased', 'sensitivity', 'of', 'states', 'with', 'nonnegligible', 'parallel', 'momentum', 'k_parallel', 'and', 'the', 'identification', 'of', 'the', 'origin', 'of', 'the', 'states', 'from', 'different', 'areas', 'in', 'the', 'brillouin', 'zone']] | [-0.16032302742448928, 0.1171494531172723, -0.09323849563249356, 0.023833858222706904, -0.008146819914847413, -0.11741214322438775, 0.10797690602578848, 0.420604190954801, -0.32663605067915685, -0.29080013096865404, -0.05740883511736451, -0.3135498808650964, -0.16504917474582342, 0.1650131713808358, 0.06829870580976842, 0.0006971955736911537, 0.021330244412595695, -0.07533601005780417, -0.09414164920887541, -0.17683260242810986, 0.3091506559508009, 0.06905468472673389, 0.33673634768882454, 0.09003704372518415, 0.0346400996376354, 0.026919641316362077, 0.07824510266854359, 0.040714242164320597, -0.19156279638068768, 0.07928874145102556, 0.19775730067389025, -0.1125642671327938, 0.22264921306726215, -0.48012684373147535, -0.16125976807444087, -0.030192578352062693, 0.13877073150665667, 0.14047871040174076, -0.08545589666022925, -0.2801312090353978, 0.043116196621234386, -0.08704995212063893, -0.09358184544319574, -0.07492427870118679, -0.027330044469477347, 0.007933170692885808, -0.2031572454096437, 0.11467149973227392, 0.0003361147828400135, 0.11897449429778245, -0.1091530816664688, -0.07886572435479486, -0.1235436857302967, 0.08337303511536642, 0.012121687102562829, 0.0291978567635528, 0.21640917838819876, -0.08266679778845118, -0.1037419047472286, 0.36062766434687293, -0.07077671018946328, -0.09478908238132427, 0.16906133870712964, -0.2292773893646796, -0.0943413511928071, 0.17649831828323737, 0.10488524273523886, 0.11166640802953805, -0.10412442462125031, 0.07439150615640597, -0.017837901427816823, 0.21678781296882854, 0.14638022402607703, 0.10089779324554557, 0.24310021893427575, 0.18348746603642335, 0.10754749362650734, 0.11184645807933087, -0.19443720519923974, 0.012315851792493122, -0.1981846504882228, -0.17765496671199799, -0.18078951148672542, 0.07072144978673466, -0.08432346521753696, -0.2506145206998859, 0.45214015055266554, 0.08287642477080226, 0.23786348620142111, -0.06679396171219672, 0.2609423514480559, 0.08573608324806763, 0.11787105389111269, -0.0300566856905618, 0.22043764883524974, 0.14333907745766059, 0.09633207768389343, -0.28578576085864, 0.08160659621294662, -0.02417723521990264] |
1,802.01381 | Randomness and isometries in echo state networks and compressed sensing | Although largely different concepts, echo state networks and compressed
sensing models both rely on collections of random weights; as the reservoir
dynamics for echo state networks, and the sensing coefficients in compressed
sensing. Several methods for generating the random matrices and metrics to
indicate desirable performance are well-studied in compressed sensing, but less
so for echo state networks. This work explores any overlap in these compressed
sensing methods and metrics for application to echo state networks. Several
methods for generating the random reservoir weights are considered, and a new
metric, inspired by the restricted isometry property for compressed sensing, is
proposed for echo state networks. The methods and metrics are investigated
theoretically and experimentally, with results suggesting that the same types
of random matrices work well for both echo state network and compressed sensing
scenarios, and that echo state network classification accuracy is improved when
the proposed restricted isometry-like constants are close to 1.
| cs.IT eess.SP math.IT | although largely different concepts echo state networks and compressed sensing models both rely on collections of random weights as the reservoir dynamics for echo state networks and the sensing coefficients in compressed sensing several methods for generating the random matrices and metrics to indicate desirable performance are wellstudied in compressed sensing but less so for echo state networks this work explores any overlap in these compressed sensing methods and metrics for application to echo state networks several methods for generating the random reservoir weights are considered and a new metric inspired by the restricted isometry property for compressed sensing is proposed for echo state networks the methods and metrics are investigated theoretically and experimentally with results suggesting that the same types of random matrices work well for both echo state network and compressed sensing scenarios and that echo state network classification accuracy is improved when the proposed restricted isometrylike constants are close to 1 | [['although', 'largely', 'different', 'concepts', 'echo', 'state', 'networks', 'and', 'compressed', 'sensing', 'models', 'both', 'rely', 'on', 'collections', 'of', 'random', 'weights', 'as', 'the', 'reservoir', 'dynamics', 'for', 'echo', 'state', 'networks', 'and', 'the', 'sensing', 'coefficients', 'in', 'compressed', 'sensing', 'several', 'methods', 'for', 'generating', 'the', 'random', 'matrices', 'and', 'metrics', 'to', 'indicate', 'desirable', 'performance', 'are', 'wellstudied', 'in', 'compressed', 'sensing', 'but', 'less', 'so', 'for', 'echo', 'state', 'networks', 'this', 'work', 'explores', 'any', 'overlap', 'in', 'these', 'compressed', 'sensing', 'methods', 'and', 'metrics', 'for', 'application', 'to', 'echo', 'state', 'networks', 'several', 'methods', 'for', 'generating', 'the', 'random', 'reservoir', 'weights', 'are', 'considered', 'and', 'a', 'new', 'metric', 'inspired', 'by', 'the', 'restricted', 'isometry', 'property', 'for', 'compressed', 'sensing', 'is', 'proposed', 'for', 'echo', 'state', 'networks', 'the', 'methods', 'and', 'metrics', 'are', 'investigated', 'theoretically', 'and', 'experimentally', 'with', 'results', 'suggesting', 'that', 'the', 'same', 'types', 'of', 'random', 'matrices', 'work', 'well', 'for', 'both', 'echo', 'state', 'network', 'and', 'compressed', 'sensing', 'scenarios', 'and', 'that', 'echo', 'state', 'network', 'classification', 'accuracy', 'is', 'improved', 'when', 'the', 'proposed', 'restricted', 'isometrylike', 'constants', 'are', 'close', 'to', '1']] | [-0.0731948474041655, 0.12548790767855844, -0.028115734208399565, 0.031526142126405796, 0.0014086406239691902, -0.19030499742275067, 0.016631381875330132, 0.4622716170802615, -0.30527296667808995, -0.23959547934408476, 0.17177975131579207, -0.24874623535578352, -0.19949670342935455, 0.19030358607034667, -0.08658969963541607, 0.1616830109113377, 0.1071594100128981, 0.07715046044524296, -0.08472858584832911, -0.24014328943650706, 0.3071645248401301, 0.05493164480986451, 0.37501895165350896, 0.004298092505218936, 0.09490458043923698, -0.004042268258951653, 0.00435341993237243, -0.003415073537468618, -0.030702567060217047, 0.14196705092292497, 0.2619553554594698, 0.19916159555535107, 0.23543467220935507, -0.43306099304478934, -0.312207001090975, 0.1329675046453143, 0.15555444218559203, 0.11406229009084842, -0.0758036103478505, -0.3304463995413648, 0.10890670620160652, -0.15345472435229549, -0.008344690135856665, -0.14326116121663207, -0.010151510501243905, 0.021748545890053112, -0.2954282097433225, 0.05265522083218873, 0.035553420071331845, 0.0032819901026931463, -0.09166447816300967, -0.16952805754460784, 0.11115971738563887, 0.14706326086090094, -0.00021951728244768638, -0.01072079134386739, 0.14629529615912854, -0.17400563960123405, -0.14912988046515926, 0.3451622231053858, -0.039882204474065625, -0.19881924908924725, 0.21090160959302842, -0.05443611992918734, -0.13395322412495908, 0.08066376873133765, 0.17600058229774043, 0.1384480308491761, -0.12727439253687253, 0.025661196598853138, -0.01356840374715188, 0.15106560294425078, 0.05049322274044838, 0.10999373325262389, 0.11566258822430801, 0.1515314119040138, 0.059978283193035456, 0.12228362033222771, -0.07476065610839797, -0.11166528386849106, -0.1474754195355999, -0.1142021959017524, -0.26912267416946933, 0.008668951227579241, -0.10482812175758144, -0.13559568668502608, 0.402763188493992, 0.1587006538388094, 0.20525067164166982, 0.08338979081010288, 0.34312590632855505, 0.01995949857956517, 0.063151060682691, 0.08921752512391072, 0.24504200988783945, 0.1826840049048484, 0.12427183214629836, -0.15560340105093334, 0.0810708821404214, 0.03219316355896249] |
1,802.01382 | Comment on "Experimental Verification of a Jarzynski-Related
Information-Theoretic Equality by a Single Trapped Ion" PRL 120 010601 (2018) | The target paper presents an experimental verification of a
"Jarzynski-related" equality. We show that the latter equality is in fact not
related to the Jarzynski equality.
| cond-mat.stat-mech | the target paper presents an experimental verification of a jarzynskirelated equality we show that the latter equality is in fact not related to the jarzynski equality | [['the', 'target', 'paper', 'presents', 'an', 'experimental', 'verification', 'of', 'a', 'jarzynskirelated', 'equality', 'we', 'show', 'that', 'the', 'latter', 'equality', 'is', 'in', 'fact', 'not', 'related', 'to', 'the', 'jarzynski', 'equality']] | [-0.1418856186233461, 0.06776147077383939, -0.1290944217890501, 0.08285848962608724, -0.07158558242022992, -0.1547617077641189, 0.0004041190119460225, 0.3045071265101433, -0.30432524144649503, -0.27776000030338766, 0.059762690807692705, -0.2688054420799017, -0.12924657002091408, 0.22850943639874458, -0.17011985946446656, 0.06159289764240384, 0.06953763954807073, 0.0703515899181366, -0.05414425327442587, -0.28290685459971426, 0.305986812338233, 0.025193434841930866, 0.29097318843007086, 0.17960422970354556, 0.0642431204020977, 0.06082395015284419, 0.07603269089013338, 0.006827378175221384, -0.150980643137882, 0.12763483386486768, 0.2843903236091137, 0.2350434725359082, 0.22191929508000613, -0.3668313593417406, -0.10291349895298481, 0.1260765751125291, 0.10989909228868783, 0.0887653736770153, -0.04068007647991181, -0.2262088281661272, 0.0924160821083933, -0.18039019390940667, -0.05579781148582697, -0.044745937287807465, 0.005620015375316143, -0.02998382531106472, -0.23958109537139535, 0.12116630852222443, 0.22604018054902553, 0.04070980463176966, -0.0805054921656847, -0.049677105620503426, 0.05115555675700307, 0.08156421998515725, 0.050520727960392836, -0.008382067065685988, 0.06751588931307197, -0.10171019852161407, -0.07696536712348462, 0.3365197496116161, 0.01328836765140295, -0.1923153258441016, 0.17096389491111041, -0.15167885821312665, -0.23862726096995174, -0.0356048309803009, 0.046320012956857684, 0.11738026201725006, -0.18490603387355806, 0.13014381147921086, -0.09248850107192993, 0.2219233351200819, 0.030013323090970517, -0.06637861726805568, 0.13942252893000842, 0.10927104383707047, 0.11118133500218391, 0.25791788145899774, 0.014833571314811706, -0.060693587884306906, -0.431039834022522, -0.24106288036331536, -0.21831217676401138, 0.01135089633113239, -0.018203528616577386, -0.1043753319978714, 0.32120718896389006, 0.22126192964613436, 0.16118081033229828, 0.10752090003341436, 0.32220814377069473, 0.13606951205059886, -0.018350662142038347, 0.03771006157621741, 0.28393453523516654, 0.13893545433878898, 0.06663061879575252, -0.21037025904282927, 0.11454948803409934, 0.029140984155237675] |
1,802.01383 | Commutator Subgroups of Virtual and Welded Braid Groups | Let $VB_n$, resp. $WB_n$ denote the virtual, resp. welded, braid group on $n$
strands. We study their commutator subgroups $VB_n' = [VB_n, VB_n]$ and, $WB_n'
= [WB_n, WB_n]$ respectively. We obtain a set of generators and defining
relations for these commutator subgroups. In particular, we prove that $VB_n'$
is finitely generated if and only if $n \geq 4$, and $WB_n'$ is finitely
generated for $n \geq 3$. Also we prove that $VB_3'/VB_3'' =\mathbb{Z}_3 \oplus
\mathbb{Z}_3 \oplus\mathbb{Z}_3 \oplus \mathbb{Z}^{\infty}$, $VB_4' / VB_4'' =
\mathbb{Z}_3 \oplus \mathbb{Z}_3 \oplus \mathbb{Z}_3$, $WB_3'/WB_3'' =
\mathbb{Z}_3 \oplus \mathbb{Z}_3 \oplus\mathbb{Z}_3 \oplus \mathbb{Z},$
$WB_4'/WB_4'' = \mathbb{Z}_3,$ and for $n \geq 5$ the commutator subgroups
$VB_n'$ and $WB_n'$ are perfect, i.e. the commutator subgroup is equal to the
second commutator subgroup.
| math.GT math.GR | let vb_n resp wb_n denote the virtual resp welded braid group on n strands we study their commutator subgroups vb_n vb_n vb_n and wb_n wb_n wb_n respectively we obtain a set of generators and defining relations for these commutator subgroups in particular we prove that vb_n is finitely generated if and only if n geq 4 and wb_n is finitely generated for n geq 3 also we prove that vb_3vb_3 mathbbz_3 oplus mathbbz_3 oplusmathbbz_3 oplus mathbbzinfty vb_4 vb_4 mathbbz_3 oplus mathbbz_3 oplus mathbbz_3 wb_3wb_3 mathbbz_3 oplus mathbbz_3 oplusmathbbz_3 oplus mathbbz wb_4wb_4 mathbbz_3 and for n geq 5 the commutator subgroups vb_n and wb_n are perfect ie the commutator subgroup is equal to the second commutator subgroup | [['let', 'vb_n', 'resp', 'wb_n', 'denote', 'the', 'virtual', 'resp', 'welded', 'braid', 'group', 'on', 'n', 'strands', 'we', 'study', 'their', 'commutator', 'subgroups', 'vb_n', 'vb_n', 'vb_n', 'and', 'wb_n', 'wb_n', 'wb_n', 'respectively', 'we', 'obtain', 'a', 'set', 'of', 'generators', 'and', 'defining', 'relations', 'for', 'these', 'commutator', 'subgroups', 'in', 'particular', 'we', 'prove', 'that', 'vb_n', 'is', 'finitely', 'generated', 'if', 'and', 'only', 'if', 'n', 'geq', '4', 'and', 'wb_n', 'is', 'finitely', 'generated', 'for', 'n', 'geq', '3', 'also', 'we', 'prove', 'that', 'vb_3vb_3', 'mathbbz_3', 'oplus', 'mathbbz_3', 'oplusmathbbz_3', 'oplus', 'mathbbzinfty', 'vb_4', 'vb_4', 'mathbbz_3', 'oplus', 'mathbbz_3', 'oplus', 'mathbbz_3', 'wb_3wb_3', 'mathbbz_3', 'oplus', 'mathbbz_3', 'oplusmathbbz_3', 'oplus', 'mathbbz', 'wb_4wb_4', 'mathbbz_3', 'and', 'for', 'n', 'geq', '5', 'the', 'commutator', 'subgroups', 'vb_n', 'and', 'wb_n', 'are', 'perfect', 'ie', 'the', 'commutator', 'subgroup', 'is', 'equal', 'to', 'the', 'second', 'commutator', 'subgroup']] | [-0.26976745193738727, 0.2596148732331915, -0.01693493403801951, 0.02385880784323832, -0.09148621761641644, -0.23605623734055445, -0.033085631591122634, 0.39685819389452354, -0.31463152878499084, -0.16907006353481646, 0.10585431651951352, -0.35304629751438393, -0.059997405128450976, 0.14865211282275753, -0.1292492102931997, -0.1440417429468586, -0.009102788685453594, 0.1808704773493863, -0.05745076273200572, -0.27063079701668213, 0.25081105162005085, -0.1833665712881799, 0.17424680203639414, -0.01116817532141411, 0.11389876143801786, 0.006882106731517599, 0.0633758545058583, -0.15771820420963228, -0.20284547651287516, 0.013457219082212776, 0.23367467438460354, 0.023954926639658595, 0.0820625564083457, -0.3623190695642058, -0.0028946085004221407, 0.37200147910962106, 0.2699475586542501, -0.1572207033958867, -0.004354582835680916, -0.29478405573225896, 0.23719872053234128, -0.3009612422368122, -0.06709026917922012, -0.06998083925455673, 0.1703268583317142, -0.08318498027895432, -0.29231767099213984, 0.011538037788624866, 0.1041930140158452, 0.15112002563893523, 0.0656523977303792, -0.18830691336081662, -0.15770625101974867, 0.10173038589349444, -0.06899562876013646, 0.024219967341029144, 0.05218274338563921, -0.04389879147206015, -0.1547929056527076, 0.44769745607168304, -0.013513481133369677, -0.20735882927552549, 0.0015546633806421395, -0.16743701912565243, -0.2658330756410478, 0.052824858157391394, 0.008098482350827357, 0.11056029203629822, 0.10897354215998716, 0.2595611199738731, -0.23700221709120983, 0.10733680886327537, 0.0982966117193461, -0.010294377165120265, 0.0010949382515743785, 0.0006491929322583686, 0.06882492795056842, 0.07774643799067911, 0.12666449671688088, 0.15735239732087752, -0.4180064613871071, -0.2623596620626337, -0.09479550126760583, 0.2409750803228502, -0.1261172965203664, -0.07222108633488143, 0.33178584106744974, 0.02023851018774947, 0.05240833912036219, 0.19112698325391755, 0.1259791630431326, 0.0002971055284366781, 0.04559018162352571, 0.15591385876418118, -0.07292588021811269, 0.2568297110019474, -0.23553244760601755, -0.17611098552892762, -0.1266983017632994, 0.3093665579436432] |
1,802.01384 | Strong Decay of $P_c(4380)$ Pentaquark in a Molecular Picture | There are different assumptions on the substructure of the pentaquarks
$P_c(4380)$ and $P_c(4450)$, newly founded in $J/\psi N $ invariant mass by the
LHCb collaboration, giving consistent mass results with the experimental
observations. The experimental data and recent theoretical studies on their
mass suggest interpretation of these states as spin-3/2 negative-parity and
spin-5/2 positive-parity pentaquarks, respectively. There may exist
opposite-parity states corresponding to these particles, as well. Despite a lot
of studies, however, the nature and internal organization of these pentaquarks
in terms of quarks and gluons are not clear. To this end we need more
theoretical investigations on other physical properties of these states. In
this accordance, we study a strong and dominant decay of the $P_c(4380)$ to
$J/\psi$ and $N$ in the framework of three point QCD sum rule method. An
interpolating current in a molecular form is applied to calculate six strong
coupling form factors defining the transitions of the positive and negative
parity spin-3/2 pentaquark states. The values of the coupling constants are
used in the calculation of the decay widths of these transitions. The obtained
results are compared with the existing experimental data.
| hep-ph hep-ex hep-lat | there are different assumptions on the substructure of the pentaquarks p_c4380 and p_c4450 newly founded in jpsi n invariant mass by the lhcb collaboration giving consistent mass results with the experimental observations the experimental data and recent theoretical studies on their mass suggest interpretation of these states as spin32 negativeparity and spin52 positiveparity pentaquarks respectively there may exist oppositeparity states corresponding to these particles as well despite a lot of studies however the nature and internal organization of these pentaquarks in terms of quarks and gluons are not clear to this end we need more theoretical investigations on other physical properties of these states in this accordance we study a strong and dominant decay of the p_c4380 to jpsi and n in the framework of three point qcd sum rule method an interpolating current in a molecular form is applied to calculate six strong coupling form factors defining the transitions of the positive and negative parity spin32 pentaquark states the values of the coupling constants are used in the calculation of the decay widths of these transitions the obtained results are compared with the existing experimental data | [['there', 'are', 'different', 'assumptions', 'on', 'the', 'substructure', 'of', 'the', 'pentaquarks', 'p_c4380', 'and', 'p_c4450', 'newly', 'founded', 'in', 'jpsi', 'n', 'invariant', 'mass', 'by', 'the', 'lhcb', 'collaboration', 'giving', 'consistent', 'mass', 'results', 'with', 'the', 'experimental', 'observations', 'the', 'experimental', 'data', 'and', 'recent', 'theoretical', 'studies', 'on', 'their', 'mass', 'suggest', 'interpretation', 'of', 'these', 'states', 'as', 'spin32', 'negativeparity', 'and', 'spin52', 'positiveparity', 'pentaquarks', 'respectively', 'there', 'may', 'exist', 'oppositeparity', 'states', 'corresponding', 'to', 'these', 'particles', 'as', 'well', 'despite', 'a', 'lot', 'of', 'studies', 'however', 'the', 'nature', 'and', 'internal', 'organization', 'of', 'these', 'pentaquarks', 'in', 'terms', 'of', 'quarks', 'and', 'gluons', 'are', 'not', 'clear', 'to', 'this', 'end', 'we', 'need', 'more', 'theoretical', 'investigations', 'on', 'other', 'physical', 'properties', 'of', 'these', 'states', 'in', 'this', 'accordance', 'we', 'study', 'a', 'strong', 'and', 'dominant', 'decay', 'of', 'the', 'p_c4380', 'to', 'jpsi', 'and', 'n', 'in', 'the', 'framework', 'of', 'three', 'point', 'qcd', 'sum', 'rule', 'method', 'an', 'interpolating', 'current', 'in', 'a', 'molecular', 'form', 'is', 'applied', 'to', 'calculate', 'six', 'strong', 'coupling', 'form', 'factors', 'defining', 'the', 'transitions', 'of', 'the', 'positive', 'and', 'negative', 'parity', 'spin32', 'pentaquark', 'states', 'the', 'values', 'of', 'the', 'coupling', 'constants', 'are', 'used', 'in', 'the', 'calculation', 'of', 'the', 'decay', 'widths', 'of', 'these', 'transitions', 'the', 'obtained', 'results', 'are', 'compared', 'with', 'the', 'existing', 'experimental', 'data']] | [-0.11768686825616216, 0.2016327149648858, -0.06899041804624473, 0.10679255338213879, -0.057745754559409807, -0.10259174175291537, 0.0779086136443411, 0.3626300982612977, -0.1520203289432379, -0.2965827135227242, 0.016550705216595914, -0.32908530850063034, -0.06285911343523605, 0.11924307642474691, 0.0706569729821089, 0.11438635532704697, 0.0833492662339287, 0.024867871153681356, -0.050376646902989895, -0.2054255318200405, 0.3285037150013853, -0.00984898322874451, 0.24050763690654925, 0.13906386337880502, -0.020608013604125158, -0.056207893399476884, -0.028071843890752145, -0.041984794458454065, -0.13241727101908535, 0.11346587759241002, 0.23505348050319416, 0.10479770910821576, 0.1636415581034626, -0.40231564735625197, -0.1211872406772034, 0.09077808401736626, 0.15638741720803978, 0.10702073042664458, -0.05599969329742309, -0.3436385483510872, 0.09356843056449826, -0.153431043531534, -0.1279464995483544, -0.13547669444606705, 0.004355281647444169, -0.009866970411332493, -0.25623287774253894, 0.08515079598873854, -0.011245348198802515, 0.05295795413421437, -0.0941816030299281, -0.25621353494586113, -0.04909666920489168, 0.08316833042554597, 0.11320879512197553, 0.039098516368695636, 0.10626168817251841, -0.1525625916942456, -0.1983023966976347, 0.3782701494700131, -0.04087718763826963, -0.17823949878547282, 0.19844143873642145, -0.15524719131707068, -0.18745004219366587, 0.09707228385190912, 0.13907918338614073, 0.07754143657421762, -0.12853272151660156, 0.04027052773013313, -0.0732760283894299, 0.14838519378239662, 0.05159481421840143, 0.11200462193801043, 0.22685929082762352, 0.12590857918429024, -0.047058414398906706, 0.07415754715370433, -0.03797071312683669, -0.14103286244463234, -0.3351341207178041, -0.11830382018921558, -0.14347105426713824, 0.05562220027561008, -0.04495180660378148, -0.0974969059330994, 0.3903505758103481, 0.08743876033589583, 0.2694566394501231, -0.0004360742448644842, 0.2563906539191696, 0.09190309842933905, 0.08489288776032228, 0.05181087132787362, 0.3036572570541505, 0.18944540735891954, 0.08494212949943585, -0.2642947505598634, 0.04970520613329077, -0.0017159207958110513] |
1,802.01385 | Chiral Anomaly, Topological Field Theory, and Novel States of Matter | Starting with a description of the motivation underlying the analysis
presented in this paper and a brief survey of the chiral anomaly, I proceed to
review some basic elements of the theory of the quantum Hall effect in 2D
incompressible electron gases in an external magnetic field, ("Hall
insulators"). I discuss the origin and role of anomalous chiral edge currents
and of anomaly inflow in 2D insulators with explicitly or spontaneously broken
time reversal, i.e., in Hall insulators and "Chern insulators". The topological
Chern-Simons action yielding the large-scale response equations for the 2D bulk
of such states of matter is displayed. A classification of Hall insulators
featuring quasi-particles with abelian braid statistics is sketched.
Subsequently, the chiral edge spin currents encountered in some time-reversal
invariant 2D topological insulators with spin-orbit interactions and the bulk
response equations of such materials are described. A short digression into the
theory of 3D topological insulators, including "axionic insulators", follows
next. To conclude, some open problems are described and a problem in cosmology
related to axionic insulators is mentioned. As far as the quantum Hall effect
and the spin currents in time-reversal invariant 2D topological insulators are
concerned this review is based on extensive work my collaborators and I carried
out in the early 1990's.
| cond-mat.mes-hall | starting with a description of the motivation underlying the analysis presented in this paper and a brief survey of the chiral anomaly i proceed to review some basic elements of the theory of the quantum hall effect in 2d incompressible electron gases in an external magnetic field hall insulators i discuss the origin and role of anomalous chiral edge currents and of anomaly inflow in 2d insulators with explicitly or spontaneously broken time reversal ie in hall insulators and chern insulators the topological chernsimons action yielding the largescale response equations for the 2d bulk of such states of matter is displayed a classification of hall insulators featuring quasiparticles with abelian braid statistics is sketched subsequently the chiral edge spin currents encountered in some timereversal invariant 2d topological insulators with spinorbit interactions and the bulk response equations of such materials are described a short digression into the theory of 3d topological insulators including axionic insulators follows next to conclude some open problems are described and a problem in cosmology related to axionic insulators is mentioned as far as the quantum hall effect and the spin currents in timereversal invariant 2d topological insulators are concerned this review is based on extensive work my collaborators and i carried out in the early 1990s | [['starting', 'with', 'a', 'description', 'of', 'the', 'motivation', 'underlying', 'the', 'analysis', 'presented', 'in', 'this', 'paper', 'and', 'a', 'brief', 'survey', 'of', 'the', 'chiral', 'anomaly', 'i', 'proceed', 'to', 'review', 'some', 'basic', 'elements', 'of', 'the', 'theory', 'of', 'the', 'quantum', 'hall', 'effect', 'in', '2d', 'incompressible', 'electron', 'gases', 'in', 'an', 'external', 'magnetic', 'field', 'hall', 'insulators', 'i', 'discuss', 'the', 'origin', 'and', 'role', 'of', 'anomalous', 'chiral', 'edge', 'currents', 'and', 'of', 'anomaly', 'inflow', 'in', '2d', 'insulators', 'with', 'explicitly', 'or', 'spontaneously', 'broken', 'time', 'reversal', 'ie', 'in', 'hall', 'insulators', 'and', 'chern', 'insulators', 'the', 'topological', 'chernsimons', 'action', 'yielding', 'the', 'largescale', 'response', 'equations', 'for', 'the', '2d', 'bulk', 'of', 'such', 'states', 'of', 'matter', 'is', 'displayed', 'a', 'classification', 'of', 'hall', 'insulators', 'featuring', 'quasiparticles', 'with', 'abelian', 'braid', 'statistics', 'is', 'sketched', 'subsequently', 'the', 'chiral', 'edge', 'spin', 'currents', 'encountered', 'in', 'some', 'timereversal', 'invariant', '2d', 'topological', 'insulators', 'with', 'spinorbit', 'interactions', 'and', 'the', 'bulk', 'response', 'equations', 'of', 'such', 'materials', 'are', 'described', 'a', 'short', 'digression', 'into', 'the', 'theory', 'of', '3d', 'topological', 'insulators', 'including', 'axionic', 'insulators', 'follows', 'next', 'to', 'conclude', 'some', 'open', 'problems', 'are', 'described', 'and', 'a', 'problem', 'in', 'cosmology', 'related', 'to', 'axionic', 'insulators', 'is', 'mentioned', 'as', 'far', 'as', 'the', 'quantum', 'hall', 'effect', 'and', 'the', 'spin', 'currents', 'in', 'timereversal', 'invariant', '2d', 'topological', 'insulators', 'are', 'concerned', 'this', 'review', 'is', 'based', 'on', 'extensive', 'work', 'my', 'collaborators', 'and', 'i', 'carried', 'out', 'in', 'the', 'early', '1990s']] | [-0.20675920627545566, 0.23032112501490962, -0.03484933761563817, 0.049024603725410995, -0.07828824358016608, -0.17988419285088422, -0.015280656600260132, 0.3135684151113743, -0.24737253686679261, -0.27751765882241586, 0.060362031015323565, -0.3085810220520389, -0.211986005294048, 0.14117642181504164, -0.03208155945508874, 0.08695944215924967, -0.08091857618031402, -0.04277513366624979, -0.12978327070429388, -0.24171608090012645, 0.3121349598325434, -0.04773790902302911, 0.28375039768538307, 0.07852033948570135, 0.04304349688935049, -0.02476670039496163, -0.007175622929242395, 0.055819868319113515, -0.13031485709029117, 0.05723335780286496, 0.2670848571806259, -0.09097235657626741, 0.14268211638111444, -0.5034391260572842, -0.2136919925040621, -0.022518479444884828, 0.0831351771773327, 0.15958275701448743, -0.10735996335002017, -0.35758833991629735, 0.044887244007328436, -0.19121576954300204, -0.1138546680277657, -0.09411617333645977, 0.04377413851353118, -0.08472294081002474, -0.17471047380628685, 0.0772155370785012, 0.10305381844906757, 0.14261413267813622, -0.08983922858412068, -0.10461852240065733, -0.06443540666784559, 0.0782735383481763, 0.09361462945428987, 0.033527331714174664, 0.1267310657760217, -0.24301501501662034, -0.2080430911967553, 0.43215251019379747, -0.04242608088866941, -0.1684464583350789, 0.17595399279601961, -0.14836911906133451, -0.1327057784800196, 0.09486477279209621, 0.11547042048211248, 0.0948994069648463, -0.09201279525157241, 0.13491417191530455, -0.06869550062859031, 0.05809966564799349, -0.03297823023250593, 0.09680945257478882, 0.33130297806402226, 0.1446066258134254, 0.04237473382880645, 0.13899543950156795, -0.06926329279473672, -0.05802232864357176, -0.3218887932554242, -0.22697557714487804, -0.24331420254006628, 0.1139092622341455, 0.03461956453919854, -0.19443115017687282, 0.45754631202268814, 0.16232541032645498, 0.1499666344984213, -0.0507218149202388, 0.24120625513827518, 0.12337613279066448, 0.03236294125339815, 0.0325885670137636, 0.20410658160316025, 0.18671076177630486, 0.12869297194605073, -0.25616239898649623, -0.027243561256078203, 0.11489527151875553] |
1,802.01386 | Curvature Inequalities and Extremal Operators | A curvature inequality is established for contractive commuting tuples of
operators in the Cowen-Douglas class of rank n. Properties of the extremal
operators, that is, the operators which achieve equality, are investigated.
Specifically, a substantial part of a well known question due to R. G. Douglas
involving these extremal operators, in the case of the unit disc, is answered.
| math.FA | a curvature inequality is established for contractive commuting tuples of operators in the cowendouglas class of rank n properties of the extremal operators that is the operators which achieve equality are investigated specifically a substantial part of a well known question due to r g douglas involving these extremal operators in the case of the unit disc is answered | [['a', 'curvature', 'inequality', 'is', 'established', 'for', 'contractive', 'commuting', 'tuples', 'of', 'operators', 'in', 'the', 'cowendouglas', 'class', 'of', 'rank', 'n', 'properties', 'of', 'the', 'extremal', 'operators', 'that', 'is', 'the', 'operators', 'which', 'achieve', 'equality', 'are', 'investigated', 'specifically', 'a', 'substantial', 'part', 'of', 'a', 'well', 'known', 'question', 'due', 'to', 'r', 'g', 'douglas', 'involving', 'these', 'extremal', 'operators', 'in', 'the', 'case', 'of', 'the', 'unit', 'disc', 'is', 'answered']] | [-0.17202183723418138, 0.10082604774763271, 0.030381655873004662, 0.10849013412173963, -0.053022781442219426, -0.16146100819963266, -0.0035685460651451247, 0.30515131209108787, -0.29069717076875395, -0.2249008976870169, 0.14670564932748675, -0.31892941743766856, -0.1375663166242194, 0.1721044741255247, -0.12021340601840767, 0.08869871119889668, 0.034392042069743244, 0.11077695290984238, -0.09619468302166058, -0.29368088879796156, 0.4353188003523875, -0.007393705256093862, 0.16016818334395855, 0.08838395461818929, 0.0788543599862921, -0.02187254358728227, -0.04526399915753785, 0.023809240846815755, -0.10980580373476279, 0.16212047098236063, 0.29452255374546776, 0.11739787705621477, 0.28083615011330376, -0.3286550905460776, -0.1757509468154887, 0.18542698264256183, 0.10972817719645672, -0.03504151122652436, -0.029974148656099528, -0.23689952890104535, 0.06364712323125263, -0.11925148490374371, -0.14013787098544633, -0.07307211189704427, 0.07155014990663187, -0.024337689348859555, -0.343577249149271, 0.08368502978740608, 0.16437566498397077, 0.048021920435762, -0.08467596781369047, -0.0933632192407119, -0.031833148178628694, 0.08575010995017522, 0.006731967729816245, 0.03736025605634865, 0.08110242582447195, -0.04976597205751528, -0.11831861694335495, 0.318094083613132, -0.031200983166947204, -0.2358122677621195, 0.10010894781010131, -0.2185537773263404, -0.12884701692925418, 0.012913705331226022, 0.1324303458302708, 0.2369882882877561, -0.12098944209263486, 0.22931347185966827, -0.14094805035550714, 0.07863048172034955, 0.11103241212697605, 0.07537971594434043, 0.11657033754133825, 0.04396970782002781, 0.12997591295832042, 0.16974390291814076, 0.07500481555017374, -0.0660373297662048, -0.3138785078427044, -0.1677149634934583, -0.18746703512714072, 0.11957765741557894, -0.10702441354140134, -0.18261614996718906, 0.4021820701279883, 0.03941436576009807, 0.22327928194555186, 0.07446634932223833, 0.1857905472486706, 0.10015681329956752, 0.12385301442690573, 0.09229240924025238, 0.20000753892680345, 0.2273432284088458, 0.06926715678645898, -0.1608876423768194, 0.024575305439658083, 0.19105532127669303] |
1,802.01387 | Classification of Informative Frames in Colonoscopy Videos Using
Convolutional Neural Networks with Binarized Weights | Colorectal cancer is one of the common cancers in the United States. Polyp is
one of the main causes of the colonic cancer and early detection of polyps will
increase chance of cancer treatments. In this paper, we propose a novel
classification of informative frames based on a convolutional neural network
with binarized weights. The proposed CNN is trained with colonoscopy frames
along with the labels of the frames as input data. We also used binarized
weights and kernels to reduce the size of CNN and make it suitable for
implementation in medical hardware. We evaluate our proposed method using Asu
Mayo Test clinic database, which contains colonoscopy videos of different
patients. Our proposed method reaches a dice score of 71.20% and accuracy of
more than 90% using the mentioned dataset.
| eess.IV | colorectal cancer is one of the common cancers in the united states polyp is one of the main causes of the colonic cancer and early detection of polyps will increase chance of cancer treatments in this paper we propose a novel classification of informative frames based on a convolutional neural network with binarized weights the proposed cnn is trained with colonoscopy frames along with the labels of the frames as input data we also used binarized weights and kernels to reduce the size of cnn and make it suitable for implementation in medical hardware we evaluate our proposed method using asu mayo test clinic database which contains colonoscopy videos of different patients our proposed method reaches a dice score of 7120 and accuracy of more than 90 using the mentioned dataset | [['colorectal', 'cancer', 'is', 'one', 'of', 'the', 'common', 'cancers', 'in', 'the', 'united', 'states', 'polyp', 'is', 'one', 'of', 'the', 'main', 'causes', 'of', 'the', 'colonic', 'cancer', 'and', 'early', 'detection', 'of', 'polyps', 'will', 'increase', 'chance', 'of', 'cancer', 'treatments', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'classification', 'of', 'informative', 'frames', 'based', 'on', 'a', 'convolutional', 'neural', 'network', 'with', 'binarized', 'weights', 'the', 'proposed', 'cnn', 'is', 'trained', 'with', 'colonoscopy', 'frames', 'along', 'with', 'the', 'labels', 'of', 'the', 'frames', 'as', 'input', 'data', 'we', 'also', 'used', 'binarized', 'weights', 'and', 'kernels', 'to', 'reduce', 'the', 'size', 'of', 'cnn', 'and', 'make', 'it', 'suitable', 'for', 'implementation', 'in', 'medical', 'hardware', 'we', 'evaluate', 'our', 'proposed', 'method', 'using', 'asu', 'mayo', 'test', 'clinic', 'database', 'which', 'contains', 'colonoscopy', 'videos', 'of', 'different', 'patients', 'our', 'proposed', 'method', 'reaches', 'a', 'dice', 'score', 'of', '7120', 'and', 'accuracy', 'of', 'more', 'than', '90', 'using', 'the', 'mentioned', 'dataset']] | [-0.004065654271651941, -0.02748193561485151, -0.04516492058871357, 0.042886654650863575, -0.052345639492832975, -0.17702133631163086, 0.04750915879173958, 0.4120050960590082, -0.1549502543657165, -0.2841427840349328, 0.06669488750870929, -0.30715938185462516, -0.19456683744441802, 0.1924698909225639, -0.20025837049243672, 0.07756192329204606, 0.17876373281887242, 0.07626891228590758, -0.020887835107686867, -0.36659721484166063, 0.27488091198962095, 0.05277806337396721, 0.3380421630768034, 0.009622906089426224, 0.14259562843331697, -0.02907877704768463, -0.056578470664169954, -0.029755065861897443, -0.03820956736547119, 0.1924698593673467, 0.32427750658314985, 0.2350868406805089, 0.35196271166205406, -0.4078887909337992, -0.18106358628435673, 0.08853886657188298, 0.10463416074466614, 0.11269999027717859, 0.007237835064639679, -0.35498297988892114, 0.10237654259087134, -0.15445781634935668, 0.013170319710651995, -0.08702793491663027, -0.015095680287349542, -0.022255452691029957, -0.3020489777488108, 0.11564624699642206, 0.006678644338452065, 0.09533486005899902, -0.08802238222609722, -0.13590941096137044, -0.016720877672396314, 0.17771777942179495, 0.03028849397345183, 0.08675415924028672, 0.15465410992161918, -0.15581324172688546, -0.14273606611900955, 0.3498105383051545, -0.024335387623748914, -0.17234067419430113, 0.17881366455010386, -0.047994372120326145, -0.11546621539182107, 0.10224316608007883, 0.21815003211723769, 0.1256411966355873, -0.17781564631350055, -0.10101846570881326, -0.028499185036555047, 0.18028957636330192, 0.1118577977447799, -0.042689742769278186, 0.1253012234801853, 0.28744533099945035, -0.03652805764626228, 0.1728874132150912, -0.22094346247151322, 0.0219431625650698, -0.23719686160987344, -0.16234021410630403, -0.18119137463398022, -0.04203221167594137, -0.11397536249275013, -0.17391075126165595, 0.4644837521002379, 0.23584983271425802, 0.16359705871276786, 0.0873165741689034, 0.30520221062772374, -0.017911687982979565, 0.17788174441297547, 0.059788119842348095, 0.15467968315796088, 0.013071195350405369, 0.0846778119910679, -0.17784029761869602, 0.08908168905066284, 0.0673674532276301] |
1,802.01388 | A Signature-based Algorithm for computing Computing Gr\"obner Bases over
Principal Ideal Domains | Signature-based algorithms have become a standard approach for Gr\"obner
basis computations for polynomial systems over fields, but how to extend these
techniques to coefficients in general rings is not yet as well understood.
In this paper, we present a proof-of-concept signature-based algorithm for
computing Gr\"obner bases over commutative integral domains. It is adapted from
a general version of M\"oller's algorithm (1988) which considers reductions by
multiple polynomials at each step. This algorithm performs reductions with
non-decreasing signatures, and in particular, signature drops do not occur.
When the coefficients are from a principal ideal domain (e.g. the ring of
integers or the ring of univariate polynomials over a field), we prove
correctness and termination of the algorithm, and we show how to use signature
properties to implement classic signature-based criteria to eliminate some
redundant reductions. In particular, if the input is a regular sequence, the
algorithm operates without any reduction to 0.
We have written a toy implementation of the algorithm in Magma. Early
experimental results suggest that the algorithm might even be correct and
terminate in a more general setting, for polynomials over a unique
factorization domain (e.g. the ring of multivariate polynomials over a field or
a PID).
| cs.SC | signaturebased algorithms have become a standard approach for grobner basis computations for polynomial systems over fields but how to extend these techniques to coefficients in general rings is not yet as well understood in this paper we present a proofofconcept signaturebased algorithm for computing grobner bases over commutative integral domains it is adapted from a general version of mollers algorithm 1988 which considers reductions by multiple polynomials at each step this algorithm performs reductions with nondecreasing signatures and in particular signature drops do not occur when the coefficients are from a principal ideal domain eg the ring of integers or the ring of univariate polynomials over a field we prove correctness and termination of the algorithm and we show how to use signature properties to implement classic signaturebased criteria to eliminate some redundant reductions in particular if the input is a regular sequence the algorithm operates without any reduction to 0 we have written a toy implementation of the algorithm in magma early experimental results suggest that the algorithm might even be correct and terminate in a more general setting for polynomials over a unique factorization domain eg the ring of multivariate polynomials over a field or a pid | [['signaturebased', 'algorithms', 'have', 'become', 'a', 'standard', 'approach', 'for', 'grobner', 'basis', 'computations', 'for', 'polynomial', 'systems', 'over', 'fields', 'but', 'how', 'to', 'extend', 'these', 'techniques', 'to', 'coefficients', 'in', 'general', 'rings', 'is', 'not', 'yet', 'as', 'well', 'understood', 'in', 'this', 'paper', 'we', 'present', 'a', 'proofofconcept', 'signaturebased', 'algorithm', 'for', 'computing', 'grobner', 'bases', 'over', 'commutative', 'integral', 'domains', 'it', 'is', 'adapted', 'from', 'a', 'general', 'version', 'of', 'mollers', 'algorithm', '1988', 'which', 'considers', 'reductions', 'by', 'multiple', 'polynomials', 'at', 'each', 'step', 'this', 'algorithm', 'performs', 'reductions', 'with', 'nondecreasing', 'signatures', 'and', 'in', 'particular', 'signature', 'drops', 'do', 'not', 'occur', 'when', 'the', 'coefficients', 'are', 'from', 'a', 'principal', 'ideal', 'domain', 'eg', 'the', 'ring', 'of', 'integers', 'or', 'the', 'ring', 'of', 'univariate', 'polynomials', 'over', 'a', 'field', 'we', 'prove', 'correctness', 'and', 'termination', 'of', 'the', 'algorithm', 'and', 'we', 'show', 'how', 'to', 'use', 'signature', 'properties', 'to', 'implement', 'classic', 'signaturebased', 'criteria', 'to', 'eliminate', 'some', 'redundant', 'reductions', 'in', 'particular', 'if', 'the', 'input', 'is', 'a', 'regular', 'sequence', 'the', 'algorithm', 'operates', 'without', 'any', 'reduction', 'to', '0', 'we', 'have', 'written', 'a', 'toy', 'implementation', 'of', 'the', 'algorithm', 'in', 'magma', 'early', 'experimental', 'results', 'suggest', 'that', 'the', 'algorithm', 'might', 'even', 'be', 'correct', 'and', 'terminate', 'in', 'a', 'more', 'general', 'setting', 'for', 'polynomials', 'over', 'a', 'unique', 'factorization', 'domain', 'eg', 'the', 'ring', 'of', 'multivariate', 'polynomials', 'over', 'a', 'field', 'or', 'a', 'pid']] | [-0.12933211212090903, 0.0031788676822717167, -0.1288518120555778, 0.06322926170854881, -0.09983080628810066, -0.17282844580775455, 0.013411397360096774, 0.3819892106942795, -0.32118582864053286, -0.2436608319432854, 0.1459681318061375, -0.1889370140249855, -0.17181062368072345, 0.2356451259690206, -0.08867487949950986, 0.024550924403475945, 0.07929707588873636, 0.04214452744236955, -0.08147775384143519, -0.3158461910616326, 0.28410965241912994, 0.03092638638113911, 0.20150854318266986, -0.0054239257854226995, 0.09251322118031918, 0.018699504767343327, -0.04295691945379478, 0.03684675832976349, -0.09586978462266872, 0.07694701994090673, 0.3068997709410518, 0.1770947371602489, 0.2679832997724844, -0.41366184112526966, -0.14376623577311934, 0.17060254787998133, 0.16633808439940884, 0.13815424725158554, -0.021943101861023336, -0.201602857070858, 0.1225043528712701, -0.19420517681707072, -0.12131272931232225, -0.1195714912054377, 0.007580256944840502, 0.02221413214583343, -0.3174490207249308, 0.015904496990181694, 0.10338932015212375, 0.11084707373935711, -0.024517298209242262, -0.11579311932565822, 0.07085143553734237, 0.04232543876968516, -0.024186070250318298, 0.03522377645353501, 0.10655469770529237, -0.10422846449108504, -0.18882586408509455, 0.36328879763704525, -0.05655289923622456, -0.23133930608854822, 0.1803986132519329, -0.11726430647458937, -0.15981483405886507, 0.13918494212267987, 0.1605144996013511, 0.14759270371822406, -0.09055964773131508, 0.11763370829522048, -0.08700782772102136, 0.1445677498421028, 0.09785544333848448, 0.02153837840141841, 0.16629194625976249, 0.0888653265642255, 0.07188486148782856, 0.13283286221037577, -0.002199227788284346, -0.06921783618011217, -0.2860134363706205, -0.19070149393724137, -0.16569027772533645, 0.015834846394165797, -0.06941765036063044, -0.1823836585141756, 0.4049369867881713, 0.15626269643517895, 0.16608601225418362, 0.08551998535608732, 0.3071657486035297, 0.09084605203705123, 0.09397599324462254, 0.11418954473358565, 0.14162272223562175, 0.10297161641287332, 0.09263060672440328, -0.14110917282985738, 0.07244582793876604, 0.11853348322481212] |
1,802.01389 | Counting inversions and descents of random elements in finite Coxeter
groups | We investigate Mahonian and Eulerian probability distributions given by
inversions and descents in general finite Coxeter groups. We provide uniform
formulas for the means and variances in terms of Coxeter group data in both
cases. We also provide uniform formulas for the double-Eulerian probability
distribution of the sum of descents and inverse descents. We finally establish
necessary and sufficient conditions for general sequences of Coxeter groups of
increasing rank under which Mahonian and Eulerian probability distributions
satisfy central and local limit theorems.
| math.CO | we investigate mahonian and eulerian probability distributions given by inversions and descents in general finite coxeter groups we provide uniform formulas for the means and variances in terms of coxeter group data in both cases we also provide uniform formulas for the doubleeulerian probability distribution of the sum of descents and inverse descents we finally establish necessary and sufficient conditions for general sequences of coxeter groups of increasing rank under which mahonian and eulerian probability distributions satisfy central and local limit theorems | [['we', 'investigate', 'mahonian', 'and', 'eulerian', 'probability', 'distributions', 'given', 'by', 'inversions', 'and', 'descents', 'in', 'general', 'finite', 'coxeter', 'groups', 'we', 'provide', 'uniform', 'formulas', 'for', 'the', 'means', 'and', 'variances', 'in', 'terms', 'of', 'coxeter', 'group', 'data', 'in', 'both', 'cases', 'we', 'also', 'provide', 'uniform', 'formulas', 'for', 'the', 'doubleeulerian', 'probability', 'distribution', 'of', 'the', 'sum', 'of', 'descents', 'and', 'inverse', 'descents', 'we', 'finally', 'establish', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'general', 'sequences', 'of', 'coxeter', 'groups', 'of', 'increasing', 'rank', 'under', 'which', 'mahonian', 'and', 'eulerian', 'probability', 'distributions', 'satisfy', 'central', 'and', 'local', 'limit', 'theorems']] | [-0.10961607516991882, 0.1428547924913374, -0.09886887776492922, 0.15450949408113956, -0.05514433247865074, -0.10514289613836157, 0.11060780032974794, 0.35144993676631536, -0.2500977932912424, -0.258946555212462, 0.06886254353477493, -0.2178185548817302, -0.12840637343901176, 0.16224291693005297, -0.1604789583609629, 0.05931481489060837, 0.04695220169737751, 0.04975289092068618, -0.1105095541426613, -0.27140376028133395, 0.33694204413274553, -0.0011903715986804461, 0.2970390144712579, 0.03872877778701001, 0.10498196204670096, 0.07186303620606109, -0.11046036661395596, 0.04790853197201939, -0.2246400950488025, 0.08525869811390653, 0.2698452089982176, 0.13898543233948726, 0.18211217549985942, -0.41776236668114125, -0.08727061855434268, 0.20799400122767245, 0.16075728858970564, 0.043682776901721496, -0.07346672330477079, -0.24349209222436688, 0.1257417606431301, -0.1731225480497987, -0.17041809443545378, -0.08121014142661918, 0.0901107443281001, 0.15404262015435063, -0.3363720626098874, 0.12542362580971253, 0.10949764204108053, 0.17001183905903203, -0.022739580823798424, -0.16893406895874644, 0.021676534896049603, 0.13918474289819666, 0.012958225334224142, -0.10816640399373424, 0.023991278182991124, -0.10002073382291897, -0.10635921992016611, 0.3724980611170148, 0.00021328949182650741, -0.26702478041665423, 0.09486034827559818, -0.18977446149873697, -0.1912489346584972, 0.08446224761500173, 0.14496370419905877, 0.15421001348151525, -0.06509987056761245, 0.09004430306779312, -0.12362936257534189, 0.022418897897924905, 0.14757152949172406, 0.026009113629877477, 0.11797359223006132, -0.018406346463310866, 0.12231692963676458, 0.18624707198713297, -0.04684816811371733, -0.04946580043430498, -0.35244151250815686, -0.20251300965470295, -0.1403953921492499, 0.016574464876342704, -0.19410547855857008, -0.15941274141386888, 0.3864547046660273, 0.09893680513939923, 0.14445627906739159, 0.19757014385533783, 0.1801273873604742, 0.1503251338410651, -0.008630077117467645, 0.0629950919372524, 0.018946962232735974, 0.2927104079618728, -0.035342923572493926, -0.1354368207746266, 0.052015623445680115, 0.20458488153109763] |
1,802.0139 | Isoperimetric inequality and Weitzenb\"ock type formula for critical
metrics of the volume | We provide an isoperimetric inequality for critical metrics of the volume
functional with nonnegative scalar curvature on compact manifolds with
boundary. In addition, we establish a Weitzenb\"ock type formula for critical
metrics of the volume functional on four-dimensional manifolds. As an
application, we obtain a classification result for such metrics.
| math.DG | we provide an isoperimetric inequality for critical metrics of the volume functional with nonnegative scalar curvature on compact manifolds with boundary in addition we establish a weitzenbock type formula for critical metrics of the volume functional on fourdimensional manifolds as an application we obtain a classification result for such metrics | [['we', 'provide', 'an', 'isoperimetric', 'inequality', 'for', 'critical', 'metrics', 'of', 'the', 'volume', 'functional', 'with', 'nonnegative', 'scalar', 'curvature', 'on', 'compact', 'manifolds', 'with', 'boundary', 'in', 'addition', 'we', 'establish', 'a', 'weitzenbock', 'type', 'formula', 'for', 'critical', 'metrics', 'of', 'the', 'volume', 'functional', 'on', 'fourdimensional', 'manifolds', 'as', 'an', 'application', 'we', 'obtain', 'a', 'classification', 'result', 'for', 'such', 'metrics']] | [-0.16540284536778926, -0.012808153065270745, -0.07730644654482603, 0.11493682656437158, -0.06646726813167333, -0.14570209631696343, 0.00098413048312068, 0.3375968934223056, -0.15995350614190101, -0.25143625486642124, 0.16468047281494363, -0.30406329497694967, -0.22159298367798327, 0.23130357989110054, -0.14185905248858036, 0.06743543885648251, 0.02458217741455883, 0.1377233801461989, -0.12122747328598052, -0.24170158918946982, 0.5074948181957006, -0.048053151778876785, 0.2481161307170987, 0.18188283275812864, 0.10186596836894751, -0.023168717436492445, 0.013850491335615516, 0.08067959100008011, -0.2702085149660707, 0.16575012407265605, 0.2285607998818159, 0.11041342401877045, 0.20605636589229107, -0.3679953788220882, -0.2337529263086617, 0.1354461017716676, 0.07478141812607646, 0.04582165113650263, -0.08131064530927688, -0.318647785037756, 0.0762818361632526, -0.08644371818751097, -0.19778781928122044, -0.15161584232002498, -0.013170896340161562, -0.017406766787171363, -0.2628945117071271, 0.09735162746161223, 0.02079296190291643, 0.08075010631233454, -0.1795180529076606, -0.09449917395599186, 0.030134503450244664, 0.1039629372395575, 0.05848000830039382, 0.052158178873360155, 0.09867078020237387, -0.07530558339436538, -0.12477721431525424, 0.29372873647138475, -0.11908880718052388, -0.331049644947052, 0.10365833096206188, -0.05838879458606243, -0.17761852853000165, 0.02289061274379492, 0.21482898149639368, 0.17270833667367697, -0.0929446567595005, 0.14052356785163284, -0.002395511025097221, 0.09106413897126914, 0.09027241427451373, 0.017508523426949977, 0.11248603893909603, 0.14473867977969349, 0.22591416569426656, 0.15462433582870289, -0.028128802101127802, -0.04909653251059353, -0.409919902831316, -0.3085916659608483, -0.16865487322211264, 0.171975620649755, -0.2592176052089781, -0.2831586211640388, 0.3255316995829344, -0.05831057693809271, 0.1740649053826928, 0.16296028917655347, 0.21169036537408828, 0.1006240335595794, 0.04951732657849789, 0.09001573791727424, 0.18393028974533082, 0.20012727454304696, 0.0976278354600072, -0.09687517621554434, -0.06145666789263487, 0.18242946393787862] |
1,802.01391 | Plasma evolution within an erupting coronal cavity | Coronal cavities have previously been observed associated with long-lived
quiescent filaments and are thought to correspond to the associated magnetic
flux rope. Although the standard flare model predicts a coronal cavity
corresponding to the erupting flux rope, these have only been observed using
broadband imaging data, restricting analysis to the plane-of-sky. We present a
unique set of spectroscopic observations of an active region filament seen
erupting at the solar limb in the extreme ultraviolet (EUV). The cavity erupted
and expanded rapidly, with the change in rise phase contemporaneous with an
increase in non-thermal electron energy flux of the associated flare. Hot and
cool filamentary material was observed to rise with the erupting flux rope,
disappearing suddenly as the cavity appeared. Although strongly blue-shifted
plasma continued to be observed flowing from the apex of the erupting flux
rope, this outflow soon ceased. These results indicate that the sudden
injection of energy from the flare beneath forced the rapid eruption and
expansion of the flux rope, driving strong plasma flows which resulted in the
eruption of an under-dense filamentary flux rope.
| astro-ph.SR | coronal cavities have previously been observed associated with longlived quiescent filaments and are thought to correspond to the associated magnetic flux rope although the standard flare model predicts a coronal cavity corresponding to the erupting flux rope these have only been observed using broadband imaging data restricting analysis to the planeofsky we present a unique set of spectroscopic observations of an active region filament seen erupting at the solar limb in the extreme ultraviolet euv the cavity erupted and expanded rapidly with the change in rise phase contemporaneous with an increase in nonthermal electron energy flux of the associated flare hot and cool filamentary material was observed to rise with the erupting flux rope disappearing suddenly as the cavity appeared although strongly blueshifted plasma continued to be observed flowing from the apex of the erupting flux rope this outflow soon ceased these results indicate that the sudden injection of energy from the flare beneath forced the rapid eruption and expansion of the flux rope driving strong plasma flows which resulted in the eruption of an underdense filamentary flux rope | [['coronal', 'cavities', 'have', 'previously', 'been', 'observed', 'associated', 'with', 'longlived', 'quiescent', 'filaments', 'and', 'are', 'thought', 'to', 'correspond', 'to', 'the', 'associated', 'magnetic', 'flux', 'rope', 'although', 'the', 'standard', 'flare', 'model', 'predicts', 'a', 'coronal', 'cavity', 'corresponding', 'to', 'the', 'erupting', 'flux', 'rope', 'these', 'have', 'only', 'been', 'observed', 'using', 'broadband', 'imaging', 'data', 'restricting', 'analysis', 'to', 'the', 'planeofsky', 'we', 'present', 'a', 'unique', 'set', 'of', 'spectroscopic', 'observations', 'of', 'an', 'active', 'region', 'filament', 'seen', 'erupting', 'at', 'the', 'solar', 'limb', 'in', 'the', 'extreme', 'ultraviolet', 'euv', 'the', 'cavity', 'erupted', 'and', 'expanded', 'rapidly', 'with', 'the', 'change', 'in', 'rise', 'phase', 'contemporaneous', 'with', 'an', 'increase', 'in', 'nonthermal', 'electron', 'energy', 'flux', 'of', 'the', 'associated', 'flare', 'hot', 'and', 'cool', 'filamentary', 'material', 'was', 'observed', 'to', 'rise', 'with', 'the', 'erupting', 'flux', 'rope', 'disappearing', 'suddenly', 'as', 'the', 'cavity', 'appeared', 'although', 'strongly', 'blueshifted', 'plasma', 'continued', 'to', 'be', 'observed', 'flowing', 'from', 'the', 'apex', 'of', 'the', 'erupting', 'flux', 'rope', 'this', 'outflow', 'soon', 'ceased', 'these', 'results', 'indicate', 'that', 'the', 'sudden', 'injection', 'of', 'energy', 'from', 'the', 'flare', 'beneath', 'forced', 'the', 'rapid', 'eruption', 'and', 'expansion', 'of', 'the', 'flux', 'rope', 'driving', 'strong', 'plasma', 'flows', 'which', 'resulted', 'in', 'the', 'eruption', 'of', 'an', 'underdense', 'filamentary', 'flux', 'rope']] | [-0.09051757088638634, 0.22790628870552102, 0.014679010151026968, 0.08892789134930028, -0.08793555052044369, -0.06591854296955046, 0.009588049579666687, 0.4809080849729437, -0.1630216266744635, -0.37887276763190103, 0.07875941282459509, -0.24941720958414107, -0.049482825644022926, 0.19991881401257267, -0.04257194442539892, -0.004319724855767615, 0.11961109100258259, -0.029439101060696322, -0.009566860589557769, -0.15770606609066562, 0.23673886266230038, 0.13250981199726794, 0.2184697393296734, 0.019669332741837763, 0.09180174147067643, -0.20490558377035253, -0.033008289289291344, 0.0014731417860128194, -0.1044030324351475, 0.011880812502151365, 0.12728028888840165, 0.05492007149664383, 0.20965760528999666, -0.510969598383471, -0.261419919212791, 0.0012070226519467445, 0.22920970599213875, -0.015859497204428155, 0.008371419514602248, -0.2880246962509092, -0.02215203146226496, -0.1603328766322086, -0.17251769416086252, 0.09184738766797428, 0.02142963506406246, -0.0007658448387665789, -0.23866952529343563, 0.10193144733882276, 0.014550364602294714, 0.07903708532900035, -0.13277227351150617, 0.01841171246011255, -0.12567244209062994, 0.07599115035595508, 0.15835678428749675, 0.14782728438197984, 0.2806966465497233, -0.13159372415991927, -0.07421575656275177, 0.2829308760789478, -0.03247756628038664, 0.08973206542224191, 0.1792298277297614, -0.24861968501195228, -0.15216278538170308, 0.34217692785193965, 0.0970894808552713, -0.007163999657479619, -0.09474650745972076, -0.08373524129973443, -0.08256016160730877, 0.11308706140499458, 0.08153315528956705, -0.006705359407497684, 0.3672445510415225, 0.10960943143497424, 0.02100813225590996, 0.2007350645830605, -0.25541666288068, -0.0508550346839403, -0.27537696444762444, -0.10620955972510843, -0.0781911051781411, 0.08394569806252507, -0.05257430547742985, -0.2747259211229608, 0.4004267306712862, 0.12138990157247422, 0.23122408431590477, -0.10859089261883423, 0.2473362718016825, 0.11744650848108726, 0.09372324963729808, 0.20609434030159227, 0.3461218927596701, 0.23235269783938814, 0.2659641433371928, -0.25469483225996603, 0.03307839032449869, 0.053180713669589444] |
1,802.01392 | Grassmann representation in qubit informatics and superlogic | The Grassmann representation for the system of qubits, is considered. The
treatment is based on natural description of the qubits system as fermions and
uses coherent states of fermions. The quantum logic gates are represented in
two forms - by symbols of operations and by partial differential operators on
the symbols of the states. The considered representation of quantum logic is
called as superlogic. The examples are given for classical logic operations of
negation, conjunction, disjunction and for reversible three-bit Toffoli gate
and its quantum generalization - three-qbit Deutsch gate. The representation
for composite gates is also considered. Path integral represenatation in
Grassmann algebra for quantum automaton with qubits memory is described. In
particular for the autonomous automaton corresponding to the special case of
general dynamic system this description differ from path integral
representation in commutative memory phase space by the specific nonliner term
in superaction.
| quant-ph | the grassmann representation for the system of qubits is considered the treatment is based on natural description of the qubits system as fermions and uses coherent states of fermions the quantum logic gates are represented in two forms by symbols of operations and by partial differential operators on the symbols of the states the considered representation of quantum logic is called as superlogic the examples are given for classical logic operations of negation conjunction disjunction and for reversible threebit toffoli gate and its quantum generalization threeqbit deutsch gate the representation for composite gates is also considered path integral represenatation in grassmann algebra for quantum automaton with qubits memory is described in particular for the autonomous automaton corresponding to the special case of general dynamic system this description differ from path integral representation in commutative memory phase space by the specific nonliner term in superaction | [['the', 'grassmann', 'representation', 'for', 'the', 'system', 'of', 'qubits', 'is', 'considered', 'the', 'treatment', 'is', 'based', 'on', 'natural', 'description', 'of', 'the', 'qubits', 'system', 'as', 'fermions', 'and', 'uses', 'coherent', 'states', 'of', 'fermions', 'the', 'quantum', 'logic', 'gates', 'are', 'represented', 'in', 'two', 'forms', 'by', 'symbols', 'of', 'operations', 'and', 'by', 'partial', 'differential', 'operators', 'on', 'the', 'symbols', 'of', 'the', 'states', 'the', 'considered', 'representation', 'of', 'quantum', 'logic', 'is', 'called', 'as', 'superlogic', 'the', 'examples', 'are', 'given', 'for', 'classical', 'logic', 'operations', 'of', 'negation', 'conjunction', 'disjunction', 'and', 'for', 'reversible', 'threebit', 'toffoli', 'gate', 'and', 'its', 'quantum', 'generalization', 'threeqbit', 'deutsch', 'gate', 'the', 'representation', 'for', 'composite', 'gates', 'is', 'also', 'considered', 'path', 'integral', 'represenatation', 'in', 'grassmann', 'algebra', 'for', 'quantum', 'automaton', 'with', 'qubits', 'memory', 'is', 'described', 'in', 'particular', 'for', 'the', 'autonomous', 'automaton', 'corresponding', 'to', 'the', 'special', 'case', 'of', 'general', 'dynamic', 'system', 'this', 'description', 'differ', 'from', 'path', 'integral', 'representation', 'in', 'commutative', 'memory', 'phase', 'space', 'by', 'the', 'specific', 'nonliner', 'term', 'in', 'superaction']] | [-0.1623137132334853, 0.15519932508452114, -0.0061970541570731934, 0.06902873078823513, -0.04294223849437074, -0.2059538635121434, 0.059723003526343736, 0.3394907443711521, -0.27454756227559707, -0.24715749731828981, 0.0727316537138788, -0.24909595898947023, -0.14342681704591034, 0.2258081806704719, -0.12383873663604894, 0.09192971072732702, 0.05275989751536267, 0.09857046871168658, -0.0798437830146587, -0.2439813086109117, 0.3272227307233352, -0.01586540312192928, 0.22243152199402214, -0.04702215925261959, 0.1382933724770679, 0.07428719339964925, 0.01501131193144313, -0.03235798693077923, -0.03048901063066425, 0.09486107343513889, 0.2987457477811275, 0.12805745373513047, 0.18640670535676446, -0.478024335049674, -0.17123113326886866, 0.03925673613747489, 0.0872884547828733, 0.1201821326671155, 0.031103275258693486, -0.3328208927088252, 0.03078720858320594, -0.19430028290177384, -0.03230289006869949, -0.114947188074258, 0.06425032878941889, -0.013342602333674828, -0.24230059470769996, -0.00034086544463800674, 0.13008811084408287, 0.08576691567004867, -0.030453724602521364, -0.07266671336685301, 0.017843525848476916, 0.08612693070453849, -0.12329516122745125, 0.020959480497193463, 0.12874610834021835, -0.1147044022214196, -0.23599966481024176, 0.33711953926005844, -0.014491632235639379, -0.2477342379774819, 0.11357019221614914, -0.07607300191496809, -0.10860300459403624, 0.04602142647057375, 0.10198176988559042, 0.09902398812696867, -0.13733920624730647, 0.1669129821924837, -0.03665784169781081, 0.16268381115101965, 0.0792403214128939, 0.12915829559730313, 0.14971316032120313, 0.13640193119546043, 0.06532983191588775, 0.19676284725176738, 0.019636098823860183, -0.18895687523515933, -0.3510291162178132, -0.23566369006925442, -0.20362045490620526, 0.04742557028843526, -0.049294339699946434, -0.18508019512321086, 0.404583433223558, 0.08194931103991995, 0.10828444387776949, 0.06681048931514329, 0.2778121336422702, 0.19067491952111906, 0.13509792811072147, 0.03476988159925908, 0.12086147165044825, 0.2153451775600275, 0.05803390181497902, -0.22038164482937453, 0.04312462805842994, 0.145328444605429] |
1,802.01393 | Seasonal Stochastic Volatility and the Samuelson Effect in Agricultural
Futures Markets | We introduce a multi-factor stochastic volatility model for commodities that
incorporates seasonality and the Samuelson effect. Conditions on the seasonal
term under which the corresponding volatility factor is well-defined are given,
and five different specifications of the seasonality pattern are proposed. We
calculate the joint characteristic function of two futures prices for different
maturities in the risk-neutral measure. The model is then presented under the
physical measure, and its state-space representation is derived, in order to
estimate the parameters with the Kalman filter for time series of corn, cotton,
soybean, sugar and wheat futures from 2007 to 2017. The seasonal model
significantly outperforms the nested non-seasonal model in all five markets,
and we show which seasonality patterns are particularly well-suited in each
case. We also confirm the importance of correctly modelling the Samuelson
effect in order to account for futures with different maturities. Our results
are clearly confirmed in a robustness check carried out with an alternative
dataset of constant maturity futures for the same agricultural markets.
| q-fin.PR | we introduce a multifactor stochastic volatility model for commodities that incorporates seasonality and the samuelson effect conditions on the seasonal term under which the corresponding volatility factor is welldefined are given and five different specifications of the seasonality pattern are proposed we calculate the joint characteristic function of two futures prices for different maturities in the riskneutral measure the model is then presented under the physical measure and its statespace representation is derived in order to estimate the parameters with the kalman filter for time series of corn cotton soybean sugar and wheat futures from 2007 to 2017 the seasonal model significantly outperforms the nested nonseasonal model in all five markets and we show which seasonality patterns are particularly wellsuited in each case we also confirm the importance of correctly modelling the samuelson effect in order to account for futures with different maturities our results are clearly confirmed in a robustness check carried out with an alternative dataset of constant maturity futures for the same agricultural markets | [['we', 'introduce', 'a', 'multifactor', 'stochastic', 'volatility', 'model', 'for', 'commodities', 'that', 'incorporates', 'seasonality', 'and', 'the', 'samuelson', 'effect', 'conditions', 'on', 'the', 'seasonal', 'term', 'under', 'which', 'the', 'corresponding', 'volatility', 'factor', 'is', 'welldefined', 'are', 'given', 'and', 'five', 'different', 'specifications', 'of', 'the', 'seasonality', 'pattern', 'are', 'proposed', 'we', 'calculate', 'the', 'joint', 'characteristic', 'function', 'of', 'two', 'futures', 'prices', 'for', 'different', 'maturities', 'in', 'the', 'riskneutral', 'measure', 'the', 'model', 'is', 'then', 'presented', 'under', 'the', 'physical', 'measure', 'and', 'its', 'statespace', 'representation', 'is', 'derived', 'in', 'order', 'to', 'estimate', 'the', 'parameters', 'with', 'the', 'kalman', 'filter', 'for', 'time', 'series', 'of', 'corn', 'cotton', 'soybean', 'sugar', 'and', 'wheat', 'futures', 'from', '2007', 'to', '2017', 'the', 'seasonal', 'model', 'significantly', 'outperforms', 'the', 'nested', 'nonseasonal', 'model', 'in', 'all', 'five', 'markets', 'and', 'we', 'show', 'which', 'seasonality', 'patterns', 'are', 'particularly', 'wellsuited', 'in', 'each', 'case', 'we', 'also', 'confirm', 'the', 'importance', 'of', 'correctly', 'modelling', 'the', 'samuelson', 'effect', 'in', 'order', 'to', 'account', 'for', 'futures', 'with', 'different', 'maturities', 'our', 'results', 'are', 'clearly', 'confirmed', 'in', 'a', 'robustness', 'check', 'carried', 'out', 'with', 'an', 'alternative', 'dataset', 'of', 'constant', 'maturity', 'futures', 'for', 'the', 'same', 'agricultural', 'markets']] | [-0.05039405211783856, 0.05896276084950589, -0.10432365233729403, 0.13137624915394686, -0.05202454849600747, -0.1080437008381249, 0.020664516129497303, 0.41582850135683297, -0.257330187422459, -0.26344441312241806, 0.14509337499221586, -0.28707960950693184, -0.16859236737069427, 0.20292139537520257, -0.08931128660508666, 0.019986140546992038, 0.01395226632811533, -0.029152607304010404, 0.030677156010923166, -0.2977719701958416, 0.2531378009280818, 0.06487450481628079, 0.3132163601358006, 0.03906602059779913, 0.152905088049887, -0.0263544077513717, -0.0857677881582079, -0.0020468198913093432, -0.12905707942057684, 0.09392391724500761, 0.24943669449751188, 0.11308405135690897, 0.2764230589045728, -0.4186802758352764, -0.20183182835423494, 0.11198733634797924, 0.005829222920927197, 0.04694428046637899, 0.055650528971279735, -0.2533171360313623, 0.0205930202178298, -0.23244857407141342, -0.09431478636429073, -0.09497208241934338, 0.03846957854483366, 0.03469533395830048, -0.3327809111439589, 0.08295328442181926, 0.02152376482824245, 0.07047492550462989, -0.08531112432920274, -0.1471038898312857, -0.05186116573378354, 0.13787450873663268, 0.12107823196102876, -0.09050786827062537, 0.09347642143116702, -0.082102591436951, -0.13266964453968208, 0.3690043528710144, -0.12611381504796895, -0.1839365403221202, 0.1433788181832397, -0.1497225897296904, -0.14800710336821354, 0.09841527556018702, 0.1817621321204197, 0.04518732525426151, -0.19358081072681102, 0.02581725638263006, -0.05786143763955817, 0.1615984266825828, 0.07043450043525502, -0.0564031355414001, 0.17276266942092453, 0.18772944376568299, 0.059139848201457096, 0.1441667021507487, -0.12858873072602078, -0.1640771065680142, -0.27406710924872435, -0.1248824890571119, -0.10334951619418473, -0.04869103601696082, -0.15680533676106323, -0.14896540908165365, 0.4334351222580635, 0.20275979375477926, 0.12215888220255813, 0.11697793563972339, 0.25578078405976473, 0.1129461735162985, 0.025612078356018, 0.07543473953033338, 0.14441652041691613, 0.008328986271769818, 0.12464583895438497, -0.20178283004129463, 0.18831778616863246, 0.018277120136891502] |
1,802.01394 | General features of experiments on the dynamics of laser-driven
electron-positron beams | The experimental study of the dynamics of neutral electron-positron beams is
an emerging area of research, enabled by the recent results on the generation
of this exotic state of matter in the laboratory. Electron-positron beams and
plasmas are believed to play a major role in the dynamics of extreme
astrophysical objects such as supermassive black holes and pulsars. For
instance, they are believed to be the main constituents of a large number of
astrophysical jets, and they have been proposed to significantly contribute to
the emission of gamma-ray bursts and their afterglow. However, despite
extensive numerical modelling and indirect astrophysical observations, a
detailed experimental characterisation of the dynamics of these objects is
still at its infancy. Here, we will report on some of the general features of
experiments studying the dynamics of electron-positron beams in a fully
laser-driven setup.
| physics.plasm-ph | the experimental study of the dynamics of neutral electronpositron beams is an emerging area of research enabled by the recent results on the generation of this exotic state of matter in the laboratory electronpositron beams and plasmas are believed to play a major role in the dynamics of extreme astrophysical objects such as supermassive black holes and pulsars for instance they are believed to be the main constituents of a large number of astrophysical jets and they have been proposed to significantly contribute to the emission of gammaray bursts and their afterglow however despite extensive numerical modelling and indirect astrophysical observations a detailed experimental characterisation of the dynamics of these objects is still at its infancy here we will report on some of the general features of experiments studying the dynamics of electronpositron beams in a fully laserdriven setup | [['the', 'experimental', 'study', 'of', 'the', 'dynamics', 'of', 'neutral', 'electronpositron', 'beams', 'is', 'an', 'emerging', 'area', 'of', 'research', 'enabled', 'by', 'the', 'recent', 'results', 'on', 'the', 'generation', 'of', 'this', 'exotic', 'state', 'of', 'matter', 'in', 'the', 'laboratory', 'electronpositron', 'beams', 'and', 'plasmas', 'are', 'believed', 'to', 'play', 'a', 'major', 'role', 'in', 'the', 'dynamics', 'of', 'extreme', 'astrophysical', 'objects', 'such', 'as', 'supermassive', 'black', 'holes', 'and', 'pulsars', 'for', 'instance', 'they', 'are', 'believed', 'to', 'be', 'the', 'main', 'constituents', 'of', 'a', 'large', 'number', 'of', 'astrophysical', 'jets', 'and', 'they', 'have', 'been', 'proposed', 'to', 'significantly', 'contribute', 'to', 'the', 'emission', 'of', 'gammaray', 'bursts', 'and', 'their', 'afterglow', 'however', 'despite', 'extensive', 'numerical', 'modelling', 'and', 'indirect', 'astrophysical', 'observations', 'a', 'detailed', 'experimental', 'characterisation', 'of', 'the', 'dynamics', 'of', 'these', 'objects', 'is', 'still', 'at', 'its', 'infancy', 'here', 'we', 'will', 'report', 'on', 'some', 'of', 'the', 'general', 'features', 'of', 'experiments', 'studying', 'the', 'dynamics', 'of', 'electronpositron', 'beams', 'in', 'a', 'fully', 'laserdriven', 'setup']] | [-0.11116622092718219, 0.16901179818235917, -0.07356512301815875, 0.11616089027508986, -0.06190848755884728, -0.05421680788904857, -0.011468492260725377, 0.38982801647227017, -0.19787178904809755, -0.32340051968106265, 0.07346038099984713, -0.30577588181527293, -0.07104211938801966, 0.27780758077613743, 0.008914739007411672, 0.06921951364509749, 0.09203057278537279, -0.03744515433167141, 0.004661356234628198, -0.2041669323380447, 0.3123291398937941, 0.16579698783968636, 0.24084035852394675, 0.06842042102391342, 0.09085922498966185, -0.07849849564552629, -0.06979766595110351, -0.021144973105757678, -0.08141049077372542, 0.12518919671579137, 0.26737172864109493, 0.13502376804483399, 0.22464572251705275, -0.4717823035157413, -0.24910558379596945, 0.09549195385410739, 0.14820186613234793, 0.09951841809766755, -0.1344445495038769, -0.3051682420798557, 0.05194713343722116, -0.1725310898593647, -0.13695335569757994, -0.0527690228195392, 0.04540531312470599, 0.06881631500499738, -0.20410712672859804, 0.023517958992395362, 0.062241486597826315, 0.0192807726185139, -0.07167386688482981, -0.06557158875805091, 0.02183166493346794, 0.09347044939188648, 0.08849190974360158, 0.008682850672923726, 0.1618410602807429, -0.21958893793300063, -0.14643842904500182, 0.4281885404568568, 0.005347215530308459, -0.09336978580347068, 0.2508659799710559, -0.22207322475172098, -0.16180081647425462, 0.14099282126123314, 0.21499355393964395, 0.13561500476257835, -0.12746360002038665, 0.029756923415111845, -0.050527581154442516, 0.11003452003095969, 0.011130727862724833, 0.09495051503189833, 0.32763315903411494, 0.20168800209816412, -0.023256466156139754, 0.10803210843277412, -0.1254641364944978, -0.061470784169869674, -0.2992103285015487, -0.1467262895693232, -0.1363593717072186, 0.08403901053234941, -0.0025450203013095483, -0.12758067880904556, 0.3979601704066606, 0.14254096989593595, 0.16928107913905124, -0.07582914856724816, 0.2894419426005135, 0.047941740715320105, 0.022202580197372562, 0.04747475434861836, 0.3387335390340379, 0.13755149068143352, 0.10986361810904023, -0.21674840351258465, 0.07323507615616344, -0.004772306860444679] |
1,802.01395 | Intent-Based In-flight Service Encryption in Multi-Layer Transport
Networks | We demonstrate multi-layer encrypted service provisioning via the ACINO
orchestrator. ACINO combines a novel intent interface with an ONOS-based SDN
orchestrator to facilitate encrypted services at IP, Ethernet and optical
network layers.
| cs.NI cs.CR | we demonstrate multilayer encrypted service provisioning via the acino orchestrator acino combines a novel intent interface with an onosbased sdn orchestrator to facilitate encrypted services at ip ethernet and optical network layers | [['we', 'demonstrate', 'multilayer', 'encrypted', 'service', 'provisioning', 'via', 'the', 'acino', 'orchestrator', 'acino', 'combines', 'a', 'novel', 'intent', 'interface', 'with', 'an', 'onosbased', 'sdn', 'orchestrator', 'to', 'facilitate', 'encrypted', 'services', 'at', 'ip', 'ethernet', 'and', 'optical', 'network', 'layers']] | [-0.30333397781540605, -0.11762625683482399, -0.029722674862192624, -0.054170669281277166, -0.14517669777931838, -0.3149563397345101, 0.1770030563247615, 0.5367195816903279, -0.4150541748466163, -0.2554446188411836, 0.019245213949410565, -0.2712919842451811, -0.1726512686702712, 0.13426475117689576, -0.08039418206518066, 0.15978375729173422, 0.014857456184409815, -0.08727450122864082, 0.027337141880958246, -0.26296408981855574, 0.28346308063844156, 0.06799587186682841, 0.46720265995325716, 0.1610442910600325, 0.08705644425133179, 0.09193496703138125, -0.0053644329630609215, -0.1843552901931428, -0.018795634202402215, 0.20011063010014338, 0.37815733780634814, 0.181694179901789, 0.27796909527788904, -0.5904548895256273, -0.1523362123086278, -0.10901592235113013, 0.19261013684344702, 0.007209218974257338, -0.04664321022172426, -0.4154477657043728, 0.18028397366789908, -0.3593922356336281, -0.03696570481205809, -0.06105638947337866, -0.10564287043786769, 0.03316537489921882, -0.29923144936690044, -0.1738019425357724, -0.12309792303833468, 0.08628297448639982, -0.036641092135988436, 0.08591261249164055, -0.04977635533452548, 0.18678076595774498, -0.0942535864687043, 0.059948240599498666, 0.2504206584477476, -0.11404231065434628, -0.17429118918190742, 0.3242930047984781, 0.011336912722166243, -0.09291709352541587, 0.15329656675297382, 0.1790051398606136, -0.07902664713689993, 0.08594866992969966, 0.277011622622577, -0.03471348543876204, -0.2579875830239777, 0.002816692121118179, 0.02310960303092825, 0.2707368714799141, 0.03484426466105827, 0.03961558977206205, 0.22716480737616276, 0.32716628703577766, 0.10910149178756721, 0.18946335593174243, -0.05587894906257761, -0.01562765839806726, -0.13480468971076712, -0.23613088940880422, -0.17568840471834973, -0.06735390148543079, -0.1465057709955827, -0.11685351844363172, 0.4118378757145898, 0.2272581907053446, 0.10478927593292861, 0.1057361965870549, 0.48551978170871735, -0.03279177330691239, 0.18898763953997144, 0.29021948987040025, 0.11778262257575989, -0.10341883690000095, 0.33239815504579195, -0.052710103641810085, 0.17977680898560533, 0.05176428043893699] |
1,802.01396 | To understand deep learning we need to understand kernel learning | Generalization performance of classifiers in deep learning has recently
become a subject of intense study. Deep models, typically over-parametrized,
tend to fit the training data exactly. Despite this "overfitting", they perform
well on test data, a phenomenon not yet fully understood.
The first point of our paper is that strong performance of overfitted
classifiers is not a unique feature of deep learning. Using six real-world and
two synthetic datasets, we establish experimentally that kernel machines
trained to have zero classification or near zero regression error perform very
well on test data, even when the labels are corrupted with a high level of
noise. We proceed to give a lower bound on the norm of zero loss solutions for
smooth kernels, showing that they increase nearly exponentially with data size.
We point out that this is difficult to reconcile with the existing
generalization bounds. Moreover, none of the bounds produce non-trivial results
for interpolating solutions.
Second, we show experimentally that (non-smooth) Laplacian kernels easily fit
random labels, a finding that parallels results for ReLU neural networks. In
contrast, fitting noisy data requires many more epochs for smooth Gaussian
kernels. Similar performance of overfitted Laplacian and Gaussian classifiers
on test, suggests that generalization is tied to the properties of the kernel
function rather than the optimization process.
Certain key phenomena of deep learning are manifested similarly in kernel
methods in the modern "overfitted" regime. The combination of the experimental
and theoretical results presented in this paper indicates a need for new
theoretical ideas for understanding properties of classical kernel methods. We
argue that progress on understanding deep learning will be difficult until more
tractable "shallow" kernel methods are better understood.
| stat.ML cs.LG | generalization performance of classifiers in deep learning has recently become a subject of intense study deep models typically overparametrized tend to fit the training data exactly despite this overfitting they perform well on test data a phenomenon not yet fully understood the first point of our paper is that strong performance of overfitted classifiers is not a unique feature of deep learning using six realworld and two synthetic datasets we establish experimentally that kernel machines trained to have zero classification or near zero regression error perform very well on test data even when the labels are corrupted with a high level of noise we proceed to give a lower bound on the norm of zero loss solutions for smooth kernels showing that they increase nearly exponentially with data size we point out that this is difficult to reconcile with the existing generalization bounds moreover none of the bounds produce nontrivial results for interpolating solutions second we show experimentally that nonsmooth laplacian kernels easily fit random labels a finding that parallels results for relu neural networks in contrast fitting noisy data requires many more epochs for smooth gaussian kernels similar performance of overfitted laplacian and gaussian classifiers on test suggests that generalization is tied to the properties of the kernel function rather than the optimization process certain key phenomena of deep learning are manifested similarly in kernel methods in the modern overfitted regime the combination of the experimental and theoretical results presented in this paper indicates a need for new theoretical ideas for understanding properties of classical kernel methods we argue that progress on understanding deep learning will be difficult until more tractable shallow kernel methods are better understood | [['generalization', 'performance', 'of', 'classifiers', 'in', 'deep', 'learning', 'has', 'recently', 'become', 'a', 'subject', 'of', 'intense', 'study', 'deep', 'models', 'typically', 'overparametrized', 'tend', 'to', 'fit', 'the', 'training', 'data', 'exactly', 'despite', 'this', 'overfitting', 'they', 'perform', 'well', 'on', 'test', 'data', 'a', 'phenomenon', 'not', 'yet', 'fully', 'understood', 'the', 'first', 'point', 'of', 'our', 'paper', 'is', 'that', 'strong', 'performance', 'of', 'overfitted', 'classifiers', 'is', 'not', 'a', 'unique', 'feature', 'of', 'deep', 'learning', 'using', 'six', 'realworld', 'and', 'two', 'synthetic', 'datasets', 'we', 'establish', 'experimentally', 'that', 'kernel', 'machines', 'trained', 'to', 'have', 'zero', 'classification', 'or', 'near', 'zero', 'regression', 'error', 'perform', 'very', 'well', 'on', 'test', 'data', 'even', 'when', 'the', 'labels', 'are', 'corrupted', 'with', 'a', 'high', 'level', 'of', 'noise', 'we', 'proceed', 'to', 'give', 'a', 'lower', 'bound', 'on', 'the', 'norm', 'of', 'zero', 'loss', 'solutions', 'for', 'smooth', 'kernels', 'showing', 'that', 'they', 'increase', 'nearly', 'exponentially', 'with', 'data', 'size', 'we', 'point', 'out', 'that', 'this', 'is', 'difficult', 'to', 'reconcile', 'with', 'the', 'existing', 'generalization', 'bounds', 'moreover', 'none', 'of', 'the', 'bounds', 'produce', 'nontrivial', 'results', 'for', 'interpolating', 'solutions', 'second', 'we', 'show', 'experimentally', 'that', 'nonsmooth', 'laplacian', 'kernels', 'easily', 'fit', 'random', 'labels', 'a', 'finding', 'that', 'parallels', 'results', 'for', 'relu', 'neural', 'networks', 'in', 'contrast', 'fitting', 'noisy', 'data', 'requires', 'many', 'more', 'epochs', 'for', 'smooth', 'gaussian', 'kernels', 'similar', 'performance', 'of', 'overfitted', 'laplacian', 'and', 'gaussian', 'classifiers', 'on', 'test', 'suggests', 'that', 'generalization', 'is', 'tied', 'to', 'the', 'properties', 'of', 'the', 'kernel', 'function', 'rather', 'than', 'the', 'optimization', 'process', 'certain', 'key', 'phenomena', 'of', 'deep', 'learning', 'are', 'manifested', 'similarly', 'in', 'kernel', 'methods', 'in', 'the', 'modern', 'overfitted', 'regime', 'the', 'combination', 'of', 'the', 'experimental', 'and', 'theoretical', 'results', 'presented', 'in', 'this', 'paper', 'indicates', 'a', 'need', 'for', 'new', 'theoretical', 'ideas', 'for', 'understanding', 'properties', 'of', 'classical', 'kernel', 'methods', 'we', 'argue', 'that', 'progress', 'on', 'understanding', 'deep', 'learning', 'will', 'be', 'difficult', 'until', 'more', 'tractable', 'shallow', 'kernel', 'methods', 'are', 'better', 'understood']] | [-0.035540705294014964, 0.018556017059290098, -0.10186035811271696, 0.13756694072645528, -0.10587740553335266, -0.19770876476340157, 0.04644358515732741, 0.4394797653180929, -0.2519791379249353, -0.27991712898712795, 0.10238796289865323, -0.27647198813384494, -0.19418936046828655, 0.23712787461272783, -0.10825105153004096, 0.10708674402545681, 0.1537246827518554, 0.025310887620121025, -0.08590931569983204, -0.31028341547763577, 0.31868381262003115, 0.04870691900342542, 0.3090362377538473, 0.028289157982661035, 0.06929356698187573, -0.07429297554822599, -0.019385736561279825, 0.00859634105238407, -0.08762351536755651, 0.13336648121928435, 0.2972454753619806, 0.14208810328901242, 0.3215613062828511, -0.4179656542268106, -0.23429230905086448, 0.14994745606492882, 0.1513208552504883, 0.08730925629804248, -0.023429444260420377, -0.2635283549023095, 0.08390868127533643, -0.11465874293705167, -0.06949953424657206, -0.17345412254330145, -0.04124476889603965, -0.000986025961394013, -0.29178266546256815, 0.07237879541684143, 0.10988353892596331, 0.061094367093515074, -0.04475166377939766, -0.1413684038310513, 0.04751662716601151, 0.08564768340356946, 0.039547653426479035, 0.043295532482464316, 0.0831587450753013, -0.19402804449719893, -0.1253532613560611, 0.308212298775936, -0.08752691433807917, -0.21401260605201472, 0.23620481817127145, -0.09241596982050553, -0.15846777121576636, 0.1140442947495273, 0.2166036519505881, 0.11666179517210334, -0.1488046568960036, 0.042144941999585364, -0.05868709308477186, 0.14642566980952362, 0.033083054458173056, 0.009989142176701868, 0.16070101240175783, 0.21676716447737496, 0.05557727336731954, 0.12934970038837465, -0.08782843627678834, -0.09700088985532308, -0.2481973584332644, -0.07251854218113765, -0.23883634493032993, 0.022250413622982673, -0.09505969574391254, -0.18265606311866814, 0.35845769144487466, 0.18688984649660395, 0.2599744906049329, 0.131274922801979, 0.316034835488569, 0.0887143278566504, 0.11036932461714144, 0.10755709467938157, 0.24587589534076615, 0.09572104878284761, 0.08148966884414713, -0.14604045591945677, 0.09367968909871235, 0.016562610167822393] |
1,802.01397 | Generic representations for symmetric spaces | For a connected quasi-split reductive algebraic group $G$ over a field $k$,
which is either a finite field or a non-archimedean local field, $\theta$ an
involutive automorphism of $G$ over $k$, let $K =G^\theta$. Let
$K^1=[K^0,K^0]$, the commutator subgroup of $K^0$, the connected component of
identity of $K$. In this paper, we provide a simple condition on $(G,\theta)$
for there to be an irreducible admissible generic representations $\pi$ of $G$
with ${\rm Hom}_{K^1}[\pi,{\mathbb C}] \not = 0$. The condition is most easily
stated in terms of a real reductive group $G_\theta({\mathbb R})$ associated to
the pair $(G,\theta)$ being quasi-split.
| math.RT math.NT | for a connected quasisplit reductive algebraic group g over a field k which is either a finite field or a nonarchimedean local field theta an involutive automorphism of g over k let k gtheta let k1k0k0 the commutator subgroup of k0 the connected component of identity of k in this paper we provide a simple condition on gtheta for there to be an irreducible admissible generic representations pi of g with rm hom_k1pimathbb c not 0 the condition is most easily stated in terms of a real reductive group g_thetamathbb r associated to the pair gtheta being quasisplit | [['for', 'a', 'connected', 'quasisplit', 'reductive', 'algebraic', 'group', 'g', 'over', 'a', 'field', 'k', 'which', 'is', 'either', 'a', 'finite', 'field', 'or', 'a', 'nonarchimedean', 'local', 'field', 'theta', 'an', 'involutive', 'automorphism', 'of', 'g', 'over', 'k', 'let', 'k', 'gtheta', 'let', 'k1k0k0', 'the', 'commutator', 'subgroup', 'of', 'k0', 'the', 'connected', 'component', 'of', 'identity', 'of', 'k', 'in', 'this', 'paper', 'we', 'provide', 'a', 'simple', 'condition', 'on', 'gtheta', 'for', 'there', 'to', 'be', 'an', 'irreducible', 'admissible', 'generic', 'representations', 'pi', 'of', 'g', 'with', 'rm', 'hom_k1pimathbb', 'c', 'not', '0', 'the', 'condition', 'is', 'most', 'easily', 'stated', 'in', 'terms', 'of', 'a', 'real', 'reductive', 'group', 'g_thetamathbb', 'r', 'associated', 'to', 'the', 'pair', 'gtheta', 'being', 'quasisplit']] | [-0.30809964123917255, 0.11105905978137774, -0.14962702473919642, -0.05683172891578196, -0.17512941601882248, -0.1617726156291993, -0.0023089494838036207, 0.35274766201741603, -0.3376757192535718, -0.17926421932091838, 0.04555081760657853, -0.22036214274795432, -0.06604373905268547, 0.20303894699747232, -0.07938724545467842, -0.13048057195755017, 0.01009770868542163, 0.24405825811370865, -0.0670071001507734, -0.27171985895225875, 0.36129830628633497, -0.1080095020171843, 0.16233783377040373, 0.017947994442166465, 0.07012428140365763, 0.029772063477062866, 0.03561309515682392, -0.005823466897402939, -0.11431709908341106, 0.07535461114817545, 0.3892232507663338, 0.06142011924989914, 0.23964971722299724, -0.3286303675488422, -0.15051434934139252, 0.28531091930834873, 0.16256218771695308, -0.0930550978947921, 0.007063483450512745, -0.31250924134725017, 0.18498819566478855, -0.18142482995202666, -0.13675694386229703, -0.028857235130118696, 0.12987257706761163, -0.07863743579701374, -0.3142865597858633, -0.00025702014957603656, 0.09194786857421461, 0.2031209072098136, -0.0026862909747777802, -0.13118481898165651, -0.05079734189141738, 0.04288804757555849, -0.048350289233617096, 0.16381214553870163, 0.09217318237121952, -0.09063184812027765, -0.056836175183324435, 0.40450879840278314, -0.1293193589503828, -0.2022809675870169, 0.10354846231149216, -0.15003204609414464, -0.12006263904469577, 0.13185799083623448, 0.10459590817458536, 0.1865502000835381, -0.04335221536457538, 0.22959069754732284, -0.15550474399014524, 0.07211568260957536, 0.02671279302357059, -0.09537817633857852, 0.137027931438857, 0.01839311121178693, 0.11920229524472042, 0.0768453446302661, 0.0820301904312433, 0.0929038334919728, -0.4154237847579153, -0.16864733176894095, -0.12179178910967159, 0.18811604931818837, -0.12501198877825548, -0.17303288268219483, 0.4035563655981892, 0.029397455034287354, 0.17703772812689605, 0.10838835650295216, 0.1867305594447412, 0.07489808360421049, 0.07241405481104984, 0.12962246342611156, 0.011927980481107768, 0.32211452400017726, -0.14406839421656178, -0.17121305154930605, -0.020291765494958352, 0.13424471972118082] |
1,802.01398 | Soft photon and two hard jets forward production in proton-nucleus
collisions | We calculate the cross section for production of a soft photon and two hard
jets in the forward rapidity region in proton-nucleus collisions at high
energies. The calculation is performed within the hybrid formalism. The
hardness of the final particles is defined with respect to the saturation scale
of the nucleus. We consider both the correlation limit of small momentum
imbalance and the dilute target limit where the momentum imbalance is of the
order of the hardness of the jets. The results depend on the first two
transverse-momentum-dependent (TMD) gluon distributions of the nucleus.
| hep-ph nucl-th | we calculate the cross section for production of a soft photon and two hard jets in the forward rapidity region in protonnucleus collisions at high energies the calculation is performed within the hybrid formalism the hardness of the final particles is defined with respect to the saturation scale of the nucleus we consider both the correlation limit of small momentum imbalance and the dilute target limit where the momentum imbalance is of the order of the hardness of the jets the results depend on the first two transversemomentumdependent tmd gluon distributions of the nucleus | [['we', 'calculate', 'the', 'cross', 'section', 'for', 'production', 'of', 'a', 'soft', 'photon', 'and', 'two', 'hard', 'jets', 'in', 'the', 'forward', 'rapidity', 'region', 'in', 'protonnucleus', 'collisions', 'at', 'high', 'energies', 'the', 'calculation', 'is', 'performed', 'within', 'the', 'hybrid', 'formalism', 'the', 'hardness', 'of', 'the', 'final', 'particles', 'is', 'defined', 'with', 'respect', 'to', 'the', 'saturation', 'scale', 'of', 'the', 'nucleus', 'we', 'consider', 'both', 'the', 'correlation', 'limit', 'of', 'small', 'momentum', 'imbalance', 'and', 'the', 'dilute', 'target', 'limit', 'where', 'the', 'momentum', 'imbalance', 'is', 'of', 'the', 'order', 'of', 'the', 'hardness', 'of', 'the', 'jets', 'the', 'results', 'depend', 'on', 'the', 'first', 'two', 'transversemomentumdependent', 'tmd', 'gluon', 'distributions', 'of', 'the', 'nucleus']] | [-0.08346013956396107, 0.20212766285886632, -0.13715846896508432, 0.14194951410327314, 0.04275527369092278, -0.018167390307272845, -0.0007044018513741011, 0.3640754908481811, -0.2080918151062933, -0.2754300204124252, -0.03649212697649652, -0.31412496917108274, 0.06796652090517764, 0.1009558134296156, 0.05466978386647633, 0.09700217048459231, 0.04161633375754699, 0.006670601695696724, -0.06313619425797716, -0.16910311353065946, 0.3899561412201481, 0.07048678457578446, 0.2727050495611385, 0.1782177693851136, 0.12834443467510667, 0.09430029225892368, -0.024074265660911285, -0.002857099089058156, -0.09963289620552926, 0.08945371883090318, 0.21146746726330132, 0.0017880523290009574, 0.1862768354448564, -0.38080528592492674, -0.10275379355323125, 0.07528151631196763, 0.12585117625558076, 0.07272591681635761, -0.015293450536889994, -0.18892374780385734, 0.0575213901267605, -0.23467721225337146, -0.14467979579212817, -0.011854219507980854, 0.0071320082110531155, 0.060163069833466344, -0.2651400823180782, 0.10258162518507465, 0.019985794644565024, -0.030980593581842457, -0.048340070653369926, -0.15268098557011245, -0.06075642895240812, 0.08713035313709777, 0.11195715962280024, 0.06045504359954453, 0.18050605236017642, -0.22614346967423038, -0.13122856903244107, 0.3739323874717539, -0.016305582856690076, -0.17302955661286065, 0.15758130422971667, -0.2406365658909558, -0.14761832284622212, 0.1969787812905703, 0.23566309919214232, 0.17109948910644002, -0.1298182987598108, 0.07509674708373805, -0.028898443996985542, 0.15924859979992456, 0.06337835861895075, 0.06414870452878878, 0.15868338833543214, 0.20591272250253786, -0.022949940830895164, 0.16245436840542057, -0.19560253624358473, -0.11624273879730955, -0.39514975875933117, -0.12500200334889475, -0.16128573371989138, 0.009915758855640888, -0.10400119851352004, -0.12002477212313642, 0.36637052228832817, 0.08837410934675644, 0.296529921690656, 0.015235867586601129, 0.3273670616103931, 0.1610249208999758, 0.03731984598314429, 0.08052205896262635, 0.3306290311342541, 0.16287275118396638, 0.13769069252079946, -0.25738154109468325, 0.06621970317544455, 0.05055271166356954] |
1,802.01399 | Molecular diffusion of stable water isotopes in polar firn as a proxy
for past temperatures | Polar precipitation archived in ice caps contains information on past
temperature conditions. Such information can be retrieved by measuring the
water isotopic signals of $\delta{}^{18}\mathrm{O}$ and $\delta\mathrm{D}$ in
ice cores. These signals have been attenuated during densification due to
molecular diffusion in the firn column, where the magnitude of the diffusion is
isotopologoue specific and temperature dependent. By utilizing the differential
diffusion signal, dual isotope measurements of $\delta{}^{18}\mathrm{O}$ and
$\delta\mathrm{D}$ enable multiple temperature reconstruction techniques. This
study assesses how well six different methods can be used to reconstruct past
surface temperatures from the diffusion-based temperature proxies. Two of the
methods are based on the single diffusion lengths of $\delta{}^{18}\mathrm{O}$
and $\delta\mathrm{D}$, three of the methods employ the differential diffusion
signal, while the last uses the ratio between the single diffusion lengths. All
techniques are tested on synthetic data in order to evaluate their accuracy and
precision. We perform a benchmark test to thirteen high resolution Holocene
data sets from Greenland and Antarctica, which represent a broad range of mean
annual surface temperatures and accumulation rates. Based on the benchmark
test, we comment on the accuracy and precision of the methods. Both the
benchmark test and the synthetic data test demonstrate that the most precise
reconstructions are obtained when using the single isotope diffusion lengths,
with precisions of approximately $1.0\,^\mathrm{o}\mathrm{C}$. In the benchmark
test, the single isotope diffusion lengths are also found to reconstruct
consistent temperatures with a root-mean-square-deviation of
$0.7\,^\mathrm{o}\mathrm{C}$.
| physics.geo-ph | polar precipitation archived in ice caps contains information on past temperature conditions such information can be retrieved by measuring the water isotopic signals of delta18mathrmo and deltamathrmd in ice cores these signals have been attenuated during densification due to molecular diffusion in the firn column where the magnitude of the diffusion is isotopologoue specific and temperature dependent by utilizing the differential diffusion signal dual isotope measurements of delta18mathrmo and deltamathrmd enable multiple temperature reconstruction techniques this study assesses how well six different methods can be used to reconstruct past surface temperatures from the diffusionbased temperature proxies two of the methods are based on the single diffusion lengths of delta18mathrmo and deltamathrmd three of the methods employ the differential diffusion signal while the last uses the ratio between the single diffusion lengths all techniques are tested on synthetic data in order to evaluate their accuracy and precision we perform a benchmark test to thirteen high resolution holocene data sets from greenland and antarctica which represent a broad range of mean annual surface temperatures and accumulation rates based on the benchmark test we comment on the accuracy and precision of the methods both the benchmark test and the synthetic data test demonstrate that the most precise reconstructions are obtained when using the single isotope diffusion lengths with precisions of approximately 10mathrmomathrmc in the benchmark test the single isotope diffusion lengths are also found to reconstruct consistent temperatures with a rootmeansquaredeviation of 07mathrmomathrmc | [['polar', 'precipitation', 'archived', 'in', 'ice', 'caps', 'contains', 'information', 'on', 'past', 'temperature', 'conditions', 'such', 'information', 'can', 'be', 'retrieved', 'by', 'measuring', 'the', 'water', 'isotopic', 'signals', 'of', 'delta18mathrmo', 'and', 'deltamathrmd', 'in', 'ice', 'cores', 'these', 'signals', 'have', 'been', 'attenuated', 'during', 'densification', 'due', 'to', 'molecular', 'diffusion', 'in', 'the', 'firn', 'column', 'where', 'the', 'magnitude', 'of', 'the', 'diffusion', 'is', 'isotopologoue', 'specific', 'and', 'temperature', 'dependent', 'by', 'utilizing', 'the', 'differential', 'diffusion', 'signal', 'dual', 'isotope', 'measurements', 'of', 'delta18mathrmo', 'and', 'deltamathrmd', 'enable', 'multiple', 'temperature', 'reconstruction', 'techniques', 'this', 'study', 'assesses', 'how', 'well', 'six', 'different', 'methods', 'can', 'be', 'used', 'to', 'reconstruct', 'past', 'surface', 'temperatures', 'from', 'the', 'diffusionbased', 'temperature', 'proxies', 'two', 'of', 'the', 'methods', 'are', 'based', 'on', 'the', 'single', 'diffusion', 'lengths', 'of', 'delta18mathrmo', 'and', 'deltamathrmd', 'three', 'of', 'the', 'methods', 'employ', 'the', 'differential', 'diffusion', 'signal', 'while', 'the', 'last', 'uses', 'the', 'ratio', 'between', 'the', 'single', 'diffusion', 'lengths', 'all', 'techniques', 'are', 'tested', 'on', 'synthetic', 'data', 'in', 'order', 'to', 'evaluate', 'their', 'accuracy', 'and', 'precision', 'we', 'perform', 'a', 'benchmark', 'test', 'to', 'thirteen', 'high', 'resolution', 'holocene', 'data', 'sets', 'from', 'greenland', 'and', 'antarctica', 'which', 'represent', 'a', 'broad', 'range', 'of', 'mean', 'annual', 'surface', 'temperatures', 'and', 'accumulation', 'rates', 'based', 'on', 'the', 'benchmark', 'test', 'we', 'comment', 'on', 'the', 'accuracy', 'and', 'precision', 'of', 'the', 'methods', 'both', 'the', 'benchmark', 'test', 'and', 'the', 'synthetic', 'data', 'test', 'demonstrate', 'that', 'the', 'most', 'precise', 'reconstructions', 'are', 'obtained', 'when', 'using', 'the', 'single', 'isotope', 'diffusion', 'lengths', 'with', 'precisions', 'of', 'approximately', '10mathrmomathrmc', 'in', 'the', 'benchmark', 'test', 'the', 'single', 'isotope', 'diffusion', 'lengths', 'are', 'also', 'found', 'to', 'reconstruct', 'consistent', 'temperatures', 'with', 'a', 'rootmeansquaredeviation', 'of', '07mathrmomathrmc']] | [-0.04463720399323038, 0.11027309764842542, -0.05334895157296668, 0.02994542142032977, -0.002379152123713708, -0.10540184043584612, 0.02917349426730899, 0.3994894073171131, -0.2524252676220524, -0.33830696712761044, 0.13893805625917532, -0.29238252712895113, -0.060170650373654974, 0.23928674855032714, -0.014339185712495976, 0.055317275098355295, 0.073826575674456, 0.041990446213137564, -0.09801271359013962, -0.26224756387054476, 0.25090718714488763, 0.08720658551033397, 0.3124629448886203, 0.07521325884479635, 0.10015423052354273, -0.05555496916127533, -0.07970152106392592, 0.011186009714916602, -0.1343137862969358, 0.09761771116745106, 0.2332725922311449, 0.11001503499623357, 0.17379617048585314, -0.4327712128080933, -0.23555541293443008, 0.07085958975604024, 0.08913512581217466, 0.09751514942529295, -0.028338911702907723, -0.24803095593578892, 0.038350350047378814, -0.10214045106322836, -0.05971528145176816, -0.07477020942783615, -0.009154876266898176, 0.05899056292437924, -0.2650338223458552, 0.11178599083507572, -0.039236249922581366, 0.1186889916721542, -0.07798095339005497, -0.18299305314292846, -0.0406977442533204, 0.148448940184361, 0.03177268267707836, -0.02001713923231888, 0.16106835993251495, -0.07298494891077453, -0.11540745824594663, 0.3704299465713675, -0.13752742560029865, -0.14784796317344753, 0.22071115876216504, -0.16172439473586442, -0.10101303248320927, 0.18378092121269743, 0.20615820350693698, 0.139347210605392, -0.1794588696362645, -0.0003843510277289108, -0.0022749520376545646, 0.17826908355247292, 0.09632163827496944, -0.0018895392373235803, 0.2211427355798798, 0.19621365771025134, 0.006043996846390162, 0.08065639327179593, -0.2318322985083796, -0.07528999348228277, -0.19636683346100853, -0.14717504228820424, -0.16296742217796775, -0.003254374980500315, -0.10067403960870175, -0.123567171996633, 0.3618795178925334, 0.20448599033699208, 0.2089233709396205, 0.014727278924803645, 0.3162552728278215, 0.06116113727231573, 0.07750649619055813, 0.048788364742334014, 0.22215944640950094, 0.11666318981193491, 0.10537203175205169, -0.24197619776458526, 0.1033623481911244, 0.01408816545252625] |
1,802.014 | Polarization and Fake News: Early Warning of Potential Misinformation
Targets | Users polarization and confirmation bias play a key role in misinformation
spreading on online social media. Our aim is to use this information to
determine in advance potential targets for hoaxes and fake news. In this paper,
we introduce a general framework for promptly identifying polarizing content on
social media and, thus, "predicting" future fake news topics. We validate the
performances of the proposed methodology on a massive Italian Facebook dataset,
showing that we are able to identify topics that are susceptible to
misinformation with 77% accuracy. Moreover, such information may be embedded as
a new feature in an additional classifier able to recognize fake news with 91%
accuracy. The novelty of our approach consists in taking into account a series
of characteristics related to users behavior on online social media, making a
first, important step towards the smoothing of polarization and the mitigation
of misinformation phenomena.
| cs.SI | users polarization and confirmation bias play a key role in misinformation spreading on online social media our aim is to use this information to determine in advance potential targets for hoaxes and fake news in this paper we introduce a general framework for promptly identifying polarizing content on social media and thus predicting future fake news topics we validate the performances of the proposed methodology on a massive italian facebook dataset showing that we are able to identify topics that are susceptible to misinformation with 77 accuracy moreover such information may be embedded as a new feature in an additional classifier able to recognize fake news with 91 accuracy the novelty of our approach consists in taking into account a series of characteristics related to users behavior on online social media making a first important step towards the smoothing of polarization and the mitigation of misinformation phenomena | [['users', 'polarization', 'and', 'confirmation', 'bias', 'play', 'a', 'key', 'role', 'in', 'misinformation', 'spreading', 'on', 'online', 'social', 'media', 'our', 'aim', 'is', 'to', 'use', 'this', 'information', 'to', 'determine', 'in', 'advance', 'potential', 'targets', 'for', 'hoaxes', 'and', 'fake', 'news', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'general', 'framework', 'for', 'promptly', 'identifying', 'polarizing', 'content', 'on', 'social', 'media', 'and', 'thus', 'predicting', 'future', 'fake', 'news', 'topics', 'we', 'validate', 'the', 'performances', 'of', 'the', 'proposed', 'methodology', 'on', 'a', 'massive', 'italian', 'facebook', 'dataset', 'showing', 'that', 'we', 'are', 'able', 'to', 'identify', 'topics', 'that', 'are', 'susceptible', 'to', 'misinformation', 'with', '77', 'accuracy', 'moreover', 'such', 'information', 'may', 'be', 'embedded', 'as', 'a', 'new', 'feature', 'in', 'an', 'additional', 'classifier', 'able', 'to', 'recognize', 'fake', 'news', 'with', '91', 'accuracy', 'the', 'novelty', 'of', 'our', 'approach', 'consists', 'in', 'taking', 'into', 'account', 'a', 'series', 'of', 'characteristics', 'related', 'to', 'users', 'behavior', 'on', 'online', 'social', 'media', 'making', 'a', 'first', 'important', 'step', 'towards', 'the', 'smoothing', 'of', 'polarization', 'and', 'the', 'mitigation', 'of', 'misinformation', 'phenomena']] | [-0.07618095793564912, 0.011069902687014372, -0.0542556112315379, 0.10326601444113188, -0.1739818546730949, -0.12068435187343837, 0.07798696597040232, 0.42142567677157267, -0.2074788655946348, -0.31542643250542735, 0.07582185275735473, -0.3657471233611407, -0.22054086733755154, 0.18879553714090386, -0.0825467087406465, -0.012990142560887093, 0.04834849967583254, 0.04444423364158593, 0.050648708644063296, -0.3329928353623658, 0.330365713872649, 0.08144536714044204, 0.3260246203249308, 0.1063717318267948, 0.08205976753121838, 0.032917903935802836, -0.1412157511693381, 0.0020744318433967577, -0.08124847451514378, 0.13954614124856382, 0.35709814611999763, 0.18142702965205218, 0.36614239562562584, -0.38144158387594684, -0.21938513335296694, 0.08953227018493981, 0.14140918823655974, 0.13233721877771373, -0.09091546151115476, -0.3619595483661357, 0.09224517907761988, -0.17930996986454492, -0.10136925845508318, -0.10537589849194601, 0.005186122965675836, -0.0013732095676645332, -0.25049651228525, 0.04133039000475792, 0.035599638292958743, 0.054200101922563956, -0.003492998003604866, -0.059549845608591175, 0.026440551311259164, 0.2004023859606815, 0.07546657032561394, -0.008352465131502207, 0.1520194996189529, -0.1698191017736079, -0.1410294648728707, 0.4128538509894188, -0.0463684884875658, -0.17401111783573822, 0.1657585148211746, -0.04165549778069059, -0.14207902875076345, 0.09749404681200276, 0.3314929347307909, 0.09680189612340562, -0.1862028867392769, -0.09172752217491012, -0.020907901458720974, 0.1843610052110431, 0.04974120881940637, 0.017595958685720985, 0.2129243864506787, 0.2226305901117268, 0.04980893526859835, 0.10271200049766752, -0.06701066962373602, -0.06059497498058188, -0.24412815287379788, -0.1794974122506877, -0.11978828269025298, 0.051327822918625116, -0.09062663593993135, -0.10389731660307873, 0.4275772766191132, 0.23551820843642082, 0.17265284365537215, -0.002009185816661841, 0.2763970683876831, -0.03439078520790224, 0.0503215095326051, 0.07941598061877651, 0.1815128794611514, 0.0032581395222520343, 0.17211865745627378, -0.14681688730041084, 0.1375853571895079, -0.004773378418322944] |
1,802.01401 | Transition Metal Chalcogenide Tin Sulfide Nanodimensional Films Align
Liquid Crystals | Transition metal chalcogenide tin sulfide (SnS) films as alternative
noncontact alignment layer for liquid crystals, have been demonstrated and
investigated. The SnS has an anisotropic atomic chain structure similar to
black Phosphorous which causes the liquid crystal molecules to align without
the need for any additional surface treatments. The high anisotropic nature of
SnS promotes the alignment of the easy axis of liquid crystal molecules along
the periodic atomic grooves of the SnS layer. The atomically thin SnS layers
were deposited on indium tin oxide films on glass substrates, at room
temperature by chemical vapor deposition. The device characteristics are
comparable to those commercially available, which use photo-aligning polymer
materials. We measured threshold voltage of 0.92V, anchoring energy of
1.573x10^(-6) J/m^2, contrast ratio better than 71:1 and electro-optical
rise/fall times of 80/390ms, respectively for ~11 micron thick liquid crystal
device as expected.
| physics.app-ph | transition metal chalcogenide tin sulfide sns films as alternative noncontact alignment layer for liquid crystals have been demonstrated and investigated the sns has an anisotropic atomic chain structure similar to black phosphorous which causes the liquid crystal molecules to align without the need for any additional surface treatments the high anisotropic nature of sns promotes the alignment of the easy axis of liquid crystal molecules along the periodic atomic grooves of the sns layer the atomically thin sns layers were deposited on indium tin oxide films on glass substrates at room temperature by chemical vapor deposition the device characteristics are comparable to those commercially available which use photoaligning polymer materials we measured threshold voltage of 092v anchoring energy of 1573x106 jm2 contrast ratio better than 711 and electrooptical risefall times of 80390ms respectively for 11 micron thick liquid crystal device as expected | [['transition', 'metal', 'chalcogenide', 'tin', 'sulfide', 'sns', 'films', 'as', 'alternative', 'noncontact', 'alignment', 'layer', 'for', 'liquid', 'crystals', 'have', 'been', 'demonstrated', 'and', 'investigated', 'the', 'sns', 'has', 'an', 'anisotropic', 'atomic', 'chain', 'structure', 'similar', 'to', 'black', 'phosphorous', 'which', 'causes', 'the', 'liquid', 'crystal', 'molecules', 'to', 'align', 'without', 'the', 'need', 'for', 'any', 'additional', 'surface', 'treatments', 'the', 'high', 'anisotropic', 'nature', 'of', 'sns', 'promotes', 'the', 'alignment', 'of', 'the', 'easy', 'axis', 'of', 'liquid', 'crystal', 'molecules', 'along', 'the', 'periodic', 'atomic', 'grooves', 'of', 'the', 'sns', 'layer', 'the', 'atomically', 'thin', 'sns', 'layers', 'were', 'deposited', 'on', 'indium', 'tin', 'oxide', 'films', 'on', 'glass', 'substrates', 'at', 'room', 'temperature', 'by', 'chemical', 'vapor', 'deposition', 'the', 'device', 'characteristics', 'are', 'comparable', 'to', 'those', 'commercially', 'available', 'which', 'use', 'photoaligning', 'polymer', 'materials', 'we', 'measured', 'threshold', 'voltage', 'of', '092v', 'anchoring', 'energy', 'of', '1573x106', 'jm2', 'contrast', 'ratio', 'better', 'than', '711', 'and', 'electrooptical', 'risefall', 'times', 'of', '80390ms', 'respectively', 'for', '11', 'micron', 'thick', 'liquid', 'crystal', 'device', 'as', 'expected']] | [-0.09947443861460341, 0.18217158069139416, -0.017616736068241837, -0.06297012257720411, -0.015074398888248032, -0.22151180487834726, 0.07745221979828362, 0.5186595782178683, -0.2168437398268261, -0.30866711426431825, 0.016566485898785184, -0.34993205675720307, -0.038429374958429, 0.1559351992698899, 0.05361560174598075, 0.05992090168571019, -0.042179925677677, -0.12395251166088965, -0.10084363590736968, -0.17667783161058373, 0.21487603298948565, 0.07652879771742754, 0.416264265930901, 0.06855047928621534, 0.10037351692554311, -0.04918076045451807, 0.17671846404023792, -0.02174346292040486, -0.21623086346907244, 0.03797999427458136, 0.2617684742435813, -0.1931471440559793, 0.12889770150650293, -0.5481237035921261, -0.24255273007936234, -0.023368008169885456, 0.12071166809503178, 0.11740059541804931, -0.11848420357125798, -0.22962684870657066, 0.08012187706333572, -0.12281199414186024, -0.11604912837872794, -0.009005009079439755, -0.03179383368325838, 0.04928647791393155, -0.17926879362894924, 0.04169763768247018, 0.05958614148793445, 0.0933554300184672, -0.10466176350061121, -0.20300520055731625, -0.11824734721997537, 0.03555454227392582, -0.00514455408151464, 0.04122917039743355, 0.29843322726884397, -0.09357646496737025, -0.03409895745942882, 0.35349372279006935, -0.06067137905294025, -0.07423026390893357, 0.1987941813430803, -0.14188232367851542, 0.005451034963724838, 0.20322671599105757, 0.11995398769352544, 0.11934224143624306, -0.17992134167571497, 0.007259813480693307, 0.026397560682633648, 0.24312658570166948, 0.17846385265052642, 0.054056758174092334, 0.24839546170045176, 0.2792852112063396, 0.028955011110604348, 0.14414396166271679, -0.15658608283780084, 0.018434114943163982, -0.13389830867611413, -0.2614605018389884, -0.19236924225528576, 0.07952747746806024, -0.11865420262578139, -0.2296239531673221, 0.3145174332489462, 0.07322741797311803, 0.10450975191307024, -0.09553954340652496, 0.2354424623443502, -0.02434709811400946, 0.11743033516720153, -0.06636086328333055, 0.26068282778800017, 0.1525731195402129, 0.14263869308289967, -0.2136136847986853, 0.17648373485333624, -0.038182309498011636] |
1,802.01402 | Holder continuity of the steepest descent direction for multiobjective
optimization | The aim of this manuscript is to characterize the continuity properties of
the multiobjective steepest descent direction for smooth objective functions.
We will show that this direction is Holder continuous with optimal exponent
1/2. In particular, this direction fails to be Lipschitz continuous even for
polynomial objectives.
| math.OC | the aim of this manuscript is to characterize the continuity properties of the multiobjective steepest descent direction for smooth objective functions we will show that this direction is holder continuous with optimal exponent 12 in particular this direction fails to be lipschitz continuous even for polynomial objectives | [['the', 'aim', 'of', 'this', 'manuscript', 'is', 'to', 'characterize', 'the', 'continuity', 'properties', 'of', 'the', 'multiobjective', 'steepest', 'descent', 'direction', 'for', 'smooth', 'objective', 'functions', 'we', 'will', 'show', 'that', 'this', 'direction', 'is', 'holder', 'continuous', 'with', 'optimal', 'exponent', '12', 'in', 'particular', 'this', 'direction', 'fails', 'to', 'be', 'lipschitz', 'continuous', 'even', 'for', 'polynomial', 'objectives']] | [-0.12572146700497003, 0.05197007056484197, -0.1077607112163876, 0.08397302912062708, -0.13640547649404827, -0.11579678116485159, -0.03282651854084527, 0.4752298670404769, -0.4082236334166311, -0.16155656921538583, 0.10873333301068225, -0.20298509034229087, -0.15269199251494509, 0.19092523865401745, -0.14961053732227772, 0.11151077473496503, 0.015064723115969212, -0.021871301543680912, -0.11399462042336768, -0.3041600926600872, 0.30751532530213926, -0.015486591555019642, 0.24539048947948724, 0.03481524495130524, 0.08785542543293869, 0.012965677375409832, 0.03547349429015625, 0.022451241480860303, -0.16446495060688207, 0.12478242683759395, 0.2892505847551721, 0.11085889480532483, 0.3721932902773644, -0.3382124105825069, -0.15892345471644498, 0.21895192107780181, 0.1349188449416072, 0.025377607329728755, -0.04034650920236364, -0.19007007096042025, 0.14192442516697215, -0.02963910099277471, -0.21538454938204366, -0.026541117519298767, -0.008150884658692683, 0.12205608678545724, -0.30708972784750005, 0.0655301326013943, 0.08502073851513102, 0.02692884698193124, -0.10941333821083003, -0.06685731661050244, 0.016960024209494922, 0.07356911279419635, 0.07018076102348401, 0.16714766483872812, 0.10123489790179944, -0.08690076525461801, -0.10856013784700251, 0.32163904010853234, -0.07055644124518445, -0.2751223642795168, 0.15632934424471348, -0.1772384741838942, -0.17603739639347854, 0.09913374962126638, 0.19463169909617367, 0.18307971261550693, -0.17664264566562277, 0.09713584884129306, -0.03471731095812581, 0.17561458921099596, 0.03093430574270005, -0.037810684587964986, 0.05643398108634543, 0.09059649947139019, 0.2738779000640708, 0.1877049086590674, -0.017184305302006132, -0.07738921377173763, -0.34499929468840995, -0.20990229661556634, -0.17484266917280694, 0.054305318089083156, -0.08469466785801218, -0.13126895017921925, 0.4494446670968442, 0.1559954697583267, 0.1477375387986924, 0.17432043521585774, 0.26806216976268493, 0.136617895334642, -0.048226855031432626, 0.08241674833078967, 0.25780023594803, 0.08524620455709543, 0.15174009385419654, -0.20225263465730908, 0.13475684948424074, 0.13144607813236245] |
1,802.01403 | An AI aid to the editors. Exploring the possibility of an AI assisted
article classification system | This work is a preliminary exploratory study of how we could progress a step
towards an AI assisted article classification sys- tem in academia. The
proposed system aims to aid the journal editors in their decisions by
pinpointing the potential weaknesses or strengths of a submitted manuscript.
From a large collection of articles and corresponding author-editor
interactions we explore the possible reasons that lead to a paper being not
forwarded for review. Our investigation reveals that in most cases either it is
be- cause the prospective manuscript is out of scope of the journal or the
manuscript does not satisfy the minimum quality requirements to maintain the
standard of the journal. We extract several features to quantify the quality of
a paper and the degree of in-scope explor- ing keyword search, citation
analysis, reputations of authors and affiliations, similarity with respect to
accepted papers. With these features we train standard machine learning
classifiers to develop a classification system. On a decent set of test data
our approach yields promising results across 3 different journals. We believe
that our approach is generic and could be adapted to other journals with
appropriate adjustments.
| cs.DL | this work is a preliminary exploratory study of how we could progress a step towards an ai assisted article classification sys tem in academia the proposed system aims to aid the journal editors in their decisions by pinpointing the potential weaknesses or strengths of a submitted manuscript from a large collection of articles and corresponding authoreditor interactions we explore the possible reasons that lead to a paper being not forwarded for review our investigation reveals that in most cases either it is be cause the prospective manuscript is out of scope of the journal or the manuscript does not satisfy the minimum quality requirements to maintain the standard of the journal we extract several features to quantify the quality of a paper and the degree of inscope explor ing keyword search citation analysis reputations of authors and affiliations similarity with respect to accepted papers with these features we train standard machine learning classifiers to develop a classification system on a decent set of test data our approach yields promising results across 3 different journals we believe that our approach is generic and could be adapted to other journals with appropriate adjustments | [['this', 'work', 'is', 'a', 'preliminary', 'exploratory', 'study', 'of', 'how', 'we', 'could', 'progress', 'a', 'step', 'towards', 'an', 'ai', 'assisted', 'article', 'classification', 'sys', 'tem', 'in', 'academia', 'the', 'proposed', 'system', 'aims', 'to', 'aid', 'the', 'journal', 'editors', 'in', 'their', 'decisions', 'by', 'pinpointing', 'the', 'potential', 'weaknesses', 'or', 'strengths', 'of', 'a', 'submitted', 'manuscript', 'from', 'a', 'large', 'collection', 'of', 'articles', 'and', 'corresponding', 'authoreditor', 'interactions', 'we', 'explore', 'the', 'possible', 'reasons', 'that', 'lead', 'to', 'a', 'paper', 'being', 'not', 'forwarded', 'for', 'review', 'our', 'investigation', 'reveals', 'that', 'in', 'most', 'cases', 'either', 'it', 'is', 'be', 'cause', 'the', 'prospective', 'manuscript', 'is', 'out', 'of', 'scope', 'of', 'the', 'journal', 'or', 'the', 'manuscript', 'does', 'not', 'satisfy', 'the', 'minimum', 'quality', 'requirements', 'to', 'maintain', 'the', 'standard', 'of', 'the', 'journal', 'we', 'extract', 'several', 'features', 'to', 'quantify', 'the', 'quality', 'of', 'a', 'paper', 'and', 'the', 'degree', 'of', 'inscope', 'explor', 'ing', 'keyword', 'search', 'citation', 'analysis', 'reputations', 'of', 'authors', 'and', 'affiliations', 'similarity', 'with', 'respect', 'to', 'accepted', 'papers', 'with', 'these', 'features', 'we', 'train', 'standard', 'machine', 'learning', 'classifiers', 'to', 'develop', 'a', 'classification', 'system', 'on', 'a', 'decent', 'set', 'of', 'test', 'data', 'our', 'approach', 'yields', 'promising', 'results', 'across', '3', 'different', 'journals', 'we', 'believe', 'that', 'our', 'approach', 'is', 'generic', 'and', 'could', 'be', 'adapted', 'to', 'other', 'journals', 'with', 'appropriate', 'adjustments']] | [-0.06786327823508709, 0.01539166338463676, -0.09223428179131742, 0.037934750954499816, -0.13639317008712276, -0.129749203416169, 0.09210869359781365, 0.376058624395805, -0.22878422145916533, -0.33835828117933864, 0.06874724380023994, -0.3068565522473325, -0.16675199575539895, 0.19279355392575748, -0.12084453888992212, 0.0329220046827609, 0.11193463144079836, 0.03101434266544563, -0.03337207931203511, -0.31170631843993546, 0.30939721731991365, 0.0940888682281766, 0.33361598501405704, 0.06776836774775158, 0.0246306742795881, -0.030412806956856338, -0.10684248573724525, 0.03961664836899901, -0.12759140098313326, 0.17933672810190174, 0.30762067688481204, 0.1938194790682583, 0.35269708507669667, -0.3776522061969868, -0.1712206078030504, 0.08258761252182975, 0.13047165774971878, 0.1141178694691647, -0.010140770429556835, -0.284152144771291, 0.10978592777866181, -0.1882357137671471, -0.09325055198044216, -0.10809610269116189, 0.010696479545600672, 0.011460360005330393, -0.23422757218833323, 0.01596991987079727, 0.06718212032749776, 0.09128251842287168, -0.03707585054469448, -0.11380105932174181, 0.04628572463939982, 0.16036156786571223, 0.0873379634210357, 0.06227256791455494, 0.13060590613229328, -0.12782240251360077, -0.15404671416544016, 0.41238208728098363, -0.036575979044384976, -0.17693528256048915, 0.21601097504288036, -0.05348549171464232, -0.1699396380181449, 0.055720077529451045, 0.22815409625717809, 0.06847009447453452, -0.18564127094393212, 0.009130881687813492, -0.013104421613866058, 0.19090704020745955, 0.05725118455233141, -0.007376941459292852, 0.1913864746118191, 0.17579478620694428, 0.010372244687036429, 0.11104715626628912, -0.0592724888329271, -0.053192416668891726, -0.27544846040783105, -0.1623386332528695, -0.14022099127652365, 0.026639467005022906, -0.02172444717159061, -0.1463051380234815, 0.44018280356334, 0.22729242060003338, 0.15885196144633468, 0.019171013088900565, 0.27351524985873354, 0.05350978843377787, 0.06527956836550773, 0.055787193120787386, 0.22239811082060137, 0.043853959561419235, 0.14939871172928226, -0.12948705702675162, 0.08353012548907408, 0.016839673577576243] |
1,802.01404 | Blowup Analysis for the Perfect Conductivity Problem with convex but not
strictly convex inclusions | In the perfect conductivity problem, it is interesting to study whether the
electric field can become arbitrarily large or not, in a narrow region between
two adjacent perfectly conducting inclusions. In this paper, we show that the
relative convexity of two adjacent inclusions plays a key role in the blowup
analysis of the electric field and find some new phenomena. By energy method,
we prove the boundedness of the gradient of the solution if two adjacent
inclusions fail to be locally relatively strictly convex, namely, if the top
and bottom boundaries of the narrow region are partially "flat". The boundary
estimates when an inclusion with partially "flat" boundary is close to the
"flat" matrix boundary and estimates for the general elliptic equation of
divergence form are also established in all dimensions.
| math.AP | in the perfect conductivity problem it is interesting to study whether the electric field can become arbitrarily large or not in a narrow region between two adjacent perfectly conducting inclusions in this paper we show that the relative convexity of two adjacent inclusions plays a key role in the blowup analysis of the electric field and find some new phenomena by energy method we prove the boundedness of the gradient of the solution if two adjacent inclusions fail to be locally relatively strictly convex namely if the top and bottom boundaries of the narrow region are partially flat the boundary estimates when an inclusion with partially flat boundary is close to the flat matrix boundary and estimates for the general elliptic equation of divergence form are also established in all dimensions | [['in', 'the', 'perfect', 'conductivity', 'problem', 'it', 'is', 'interesting', 'to', 'study', 'whether', 'the', 'electric', 'field', 'can', 'become', 'arbitrarily', 'large', 'or', 'not', 'in', 'a', 'narrow', 'region', 'between', 'two', 'adjacent', 'perfectly', 'conducting', 'inclusions', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'relative', 'convexity', 'of', 'two', 'adjacent', 'inclusions', 'plays', 'a', 'key', 'role', 'in', 'the', 'blowup', 'analysis', 'of', 'the', 'electric', 'field', 'and', 'find', 'some', 'new', 'phenomena', 'by', 'energy', 'method', 'we', 'prove', 'the', 'boundedness', 'of', 'the', 'gradient', 'of', 'the', 'solution', 'if', 'two', 'adjacent', 'inclusions', 'fail', 'to', 'be', 'locally', 'relatively', 'strictly', 'convex', 'namely', 'if', 'the', 'top', 'and', 'bottom', 'boundaries', 'of', 'the', 'narrow', 'region', 'are', 'partially', 'flat', 'the', 'boundary', 'estimates', 'when', 'an', 'inclusion', 'with', 'partially', 'flat', 'boundary', 'is', 'close', 'to', 'the', 'flat', 'matrix', 'boundary', 'and', 'estimates', 'for', 'the', 'general', 'elliptic', 'equation', 'of', 'divergence', 'form', 'are', 'also', 'established', 'in', 'all', 'dimensions']] | [-0.13436651111132544, 0.14184568598895345, -0.04575578041573745, 0.058055503690217176, -0.061825487503198946, -0.14896819015737367, -0.0096328015437435, 0.38727153776540557, -0.31005059393080137, -0.2506622769238911, 0.13581193822084123, -0.2833244885595245, -0.12853973584590864, 0.14825427688068163, -0.06796877709739906, 0.01721299469883319, 0.04625306966472844, 0.027894224125522237, -0.04999467565407906, -0.21691990807254352, 0.3748685256187015, -0.06772414467631634, 0.2708649937248298, 0.1129374748330478, 0.041390060168115125, -0.010221475047478808, 0.03026985291050363, 0.09323287569697349, -0.1275778636623477, 0.12058586932324186, 0.2426160604209561, 0.006949966558333458, 0.2805184351159473, -0.42818043380975723, -0.17106762984127716, 0.12561645337117425, 0.12996588280524007, 0.0786710799465539, -0.06176113071922525, -0.2358527698603864, 0.11966935901028168, -0.09294072041849656, -0.16595685450033149, -0.01144129779360449, -0.0017787518089935753, 0.017692937172650722, -0.27788233401196943, 0.08705839854713977, 0.0930235504605634, 0.02308124420410804, -0.11529240738742678, -0.07594575785466591, -0.03488820913880495, 0.1229093209815919, 0.05981884095533431, 0.006230376379338683, 0.06935563150665346, -0.13531443769045468, -0.01109722774753077, 0.32604015506946177, -0.06348170164105205, -0.2636142298437029, 0.1839683029279895, -0.20089535911759462, -0.06098818183229625, 0.1385569735963381, 0.13520712027226695, 0.1465567977963911, -0.144926478402562, 0.11596657049829738, -0.0685962354559949, 0.13825967419761026, 0.09406513579275089, 0.008820683996189555, 0.20790545450423964, 0.09424528772302881, 0.15601846487581275, 0.16325333077400098, -0.056151640670772156, -0.09925865208132918, -0.35515865338042035, -0.17754937418850267, -0.1423446702520285, 0.03036041152834597, -0.10700738996248213, -0.2394532888758046, 0.33436130629212574, 0.08673677733523473, 0.23132990422580418, -0.014663706405642834, 0.2791633339641431, 0.1008320428175098, 0.035625530673432666, 0.13758288054435536, 0.2734798239572916, 0.16575301772708656, 0.056941875285035325, -0.1916312266226488, 0.05891363741474525, 0.08570497628045447] |
1,802.01405 | Comparing approaches for mitigating intergroup variability in
personality recognition | Personality have been found to predict many life outcomes, and there have
been huge interests on automatic personality recognition from a speaker's
utterance. Previously, we achieved accuracies between 37%-44% for three-way
classification of high, medium or low for each of the Big Five personality
traits (Openness to Experience, Conscientiousness, Extraversion, Agreeableness,
Neuroticism). We show here that we can improve performance on this task by
accounting for heterogeneity of gender and L1 in our data, which has English
speech from female and male native speakers of Chinese and Standard American
English (SAE). We experiment with personalizing models by L1 and gender and
normalizing features by speaker, L1 group, and/or gender.
| cs.SD cs.CL eess.AS | personality have been found to predict many life outcomes and there have been huge interests on automatic personality recognition from a speakers utterance previously we achieved accuracies between 3744 for threeway classification of high medium or low for each of the big five personality traits openness to experience conscientiousness extraversion agreeableness neuroticism we show here that we can improve performance on this task by accounting for heterogeneity of gender and l1 in our data which has english speech from female and male native speakers of chinese and standard american english sae we experiment with personalizing models by l1 and gender and normalizing features by speaker l1 group andor gender | [['personality', 'have', 'been', 'found', 'to', 'predict', 'many', 'life', 'outcomes', 'and', 'there', 'have', 'been', 'huge', 'interests', 'on', 'automatic', 'personality', 'recognition', 'from', 'a', 'speakers', 'utterance', 'previously', 'we', 'achieved', 'accuracies', 'between', '3744', 'for', 'threeway', 'classification', 'of', 'high', 'medium', 'or', 'low', 'for', 'each', 'of', 'the', 'big', 'five', 'personality', 'traits', 'openness', 'to', 'experience', 'conscientiousness', 'extraversion', 'agreeableness', 'neuroticism', 'we', 'show', 'here', 'that', 'we', 'can', 'improve', 'performance', 'on', 'this', 'task', 'by', 'accounting', 'for', 'heterogeneity', 'of', 'gender', 'and', 'l1', 'in', 'our', 'data', 'which', 'has', 'english', 'speech', 'from', 'female', 'and', 'male', 'native', 'speakers', 'of', 'chinese', 'and', 'standard', 'american', 'english', 'sae', 'we', 'experiment', 'with', 'personalizing', 'models', 'by', 'l1', 'and', 'gender', 'and', 'normalizing', 'features', 'by', 'speaker', 'l1', 'group', 'andor', 'gender']] | [-0.0044812327037232185, 0.040841793789904254, -0.0630460304107705, 0.11399086747092084, -0.13473854671283667, -0.20217519651226903, 0.069108500645214, 0.4767704973885909, -0.18673527500498185, -0.37024619394257546, 0.06589430586516071, -0.3323390745566389, -0.16608958368172544, 0.1867647598093854, -0.1777917529550304, 0.0005732182105746838, 0.1174532892590991, 0.09264032317564712, 0.0032168472924808023, -0.33287912098810485, 0.30012275849323755, 0.02838250941761402, 0.3449188831108494, 0.035408179177432705, 0.11277356968205764, -0.05642538417558989, -0.05658713694439706, -0.04109963482467953, -0.023232403683698836, 0.15244566159299627, 0.36659496626326066, 0.2194247492460893, 0.3861535979998768, -0.35418810515767046, -0.1667841252670068, 0.07449417571545741, 0.12079058170164807, 0.10390902598016818, -0.04640142001220188, -0.4262128353477755, 0.09704956932232604, -0.2136585242841222, 0.0586775705739514, -0.07429803293433314, 0.06024932674850004, 0.01766924530806003, -0.2046706000975239, 0.11617878813364911, 0.0696979359074265, 0.24801380403442394, -0.08958036270112209, -0.20695423300766788, 0.005495599775421305, 0.26613566440683917, 0.15097784458199268, 0.00587635581731933, 0.11250911005815371, -0.18871477934309716, -0.15640976805444978, 0.36054785167499354, -0.09142480369383862, -0.18860015383955742, 0.23578956370335927, -0.09490098549403386, -0.16035300043065512, 0.006256567638948423, 0.23337673650383778, 0.005998013725871681, -0.1609909311791352, -0.03517202394795518, -0.034787878490249634, 0.24893878499439004, 0.14718809079137468, -0.05120263067116841, 0.17310470468022887, 0.18782129841472167, -0.04733288909977199, 0.07670250018938966, -0.08233018996569952, 0.025037252032326176, -0.10680430250481592, -0.13082968428252487, -0.1191280112161788, -0.012627870237471861, -0.07512083792671297, -0.09415611770824281, 0.39467998591375564, 0.15800969050171862, 0.1009814821166593, 0.0851168913879953, 0.2317565474958253, -0.012162878898980626, 0.10018897403475888, 0.049299970883854724, 0.1628408985908801, -0.046941987856145985, 0.14096753710214424, -0.1930359616542423, 0.164784712153017, 0.011824320167102295] |
1,802.01406 | Vertices for Iwahori-Hecke algebras and the Dipper-Du conjecture | Let $\mathscr{H}_n$ denote the Iwahori-Hecke algebra corresponding to the
symmetric group $\mathfrak{S}_n$. We set up a Green correspondence for
bimodules of these Hecke algebras, and a Brauer correspondence between their
blocks. We examine Specht modules for $\mathscr{H}_n$ and compute the vertices
of certain Specht modules, before using this to give a classification of the
vertices of blocks of $\mathscr{H}_n$ in any characteristic. Finally, we apply
this classification to resolve the Dipper-Du conjecture about the structure of
vertices of indecomposable $\mathscr{H}_n$-modules.
| math.RT | let mathscrh_n denote the iwahorihecke algebra corresponding to the symmetric group mathfraks_n we set up a green correspondence for bimodules of these hecke algebras and a brauer correspondence between their blocks we examine specht modules for mathscrh_n and compute the vertices of certain specht modules before using this to give a classification of the vertices of blocks of mathscrh_n in any characteristic finally we apply this classification to resolve the dipperdu conjecture about the structure of vertices of indecomposable mathscrh_nmodules | [['let', 'mathscrh_n', 'denote', 'the', 'iwahorihecke', 'algebra', 'corresponding', 'to', 'the', 'symmetric', 'group', 'mathfraks_n', 'we', 'set', 'up', 'a', 'green', 'correspondence', 'for', 'bimodules', 'of', 'these', 'hecke', 'algebras', 'and', 'a', 'brauer', 'correspondence', 'between', 'their', 'blocks', 'we', 'examine', 'specht', 'modules', 'for', 'mathscrh_n', 'and', 'compute', 'the', 'vertices', 'of', 'certain', 'specht', 'modules', 'before', 'using', 'this', 'to', 'give', 'a', 'classification', 'of', 'the', 'vertices', 'of', 'blocks', 'of', 'mathscrh_n', 'in', 'any', 'characteristic', 'finally', 'we', 'apply', 'this', 'classification', 'to', 'resolve', 'the', 'dipperdu', 'conjecture', 'about', 'the', 'structure', 'of', 'vertices', 'of', 'indecomposable', 'mathscrh_nmodules']] | [-0.1884097805342231, 0.027890694523170494, -0.06995914797656812, 0.02434350845989031, -0.10533800461174299, -0.12608266908985874, 0.013693368432518, 0.3630329586075953, -0.3520232270209071, -0.22012176057204413, 0.08981035800668626, -0.23325840062282693, -0.1431830568479386, 0.10276360242651442, -0.13569953113806266, -0.09801878111484723, 0.07600339582094397, 0.11557599543355024, -0.13680512850913099, -0.3104222204195909, 0.4021979278096786, -0.010542237829679672, 0.21001063462776634, 0.040122956897203736, 0.11888752258472288, 0.06147864423931027, -0.036254683148283035, -0.07528353172640961, -0.1682266296329311, 0.17992640599512902, 0.3564409535909549, 0.11547060487553096, 0.1830661986172438, -0.3790291440553772, -0.0035567941973941065, 0.2624922624956339, 0.17683652800937685, 0.021004591937153004, 0.024335093724613007, -0.26313594363343257, 0.1526258154772222, -0.24289618640278393, -0.12298293873213996, -0.024752353437435932, 0.12086518662862289, -0.02295555475836572, -0.24927819853138106, -0.03282350345920676, 0.05369139331369064, 0.1371871184390516, -0.09159982630994935, -0.13184444607796672, -0.07108245146735452, 0.16622597490771648, -0.10323923361750367, -0.027264769242789883, 0.08440463139245716, -0.13143537413830367, -0.20044607974779913, 0.3172609058375924, 0.03662594486227951, -0.1560960526112467, 0.1245637296173626, -0.1966124158949615, -0.14253045191080907, 0.05972924581370675, 0.08835956887700237, 0.1325176985313495, -0.04004977122382022, 0.1544332695298064, -0.18020834661542606, 0.0018226986867375672, 0.16072015876237017, -0.019734625071764756, 0.1733996476739263, 0.06716374929946585, 0.02182282180262682, 0.1887440717038818, 0.040411586449362144, 0.07949557304621124, -0.3678833207784173, -0.2364018469547423, -0.10723855145848714, 0.13360936908075252, -0.13985778805046067, -0.18019228977843738, 0.47079358321542925, 0.13456320964420834, 0.22310087182081473, 0.20191991730378225, 0.1294231422436543, 0.01775583669633563, 0.15197509519743901, 0.0477952615548976, 0.05869952534349301, 0.3294108982484501, -0.07379548050439319, -0.17200563859958679, -0.06549911023690723, 0.2548115125630433] |
1,802.01407 | Fixed point theorems involving numerical invariants | We exhibit invariants of smooth projective algebraic varieties with integer
values, whose nonvanishing modulo p prevents the existence of an action without
fixed points of certain finite p-groups. The case of base fields of
characteristic p is included. Counterexamples are systematically provided to
test the sharpness of our results.
| math.AG | we exhibit invariants of smooth projective algebraic varieties with integer values whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite pgroups the case of base fields of characteristic p is included counterexamples are systematically provided to test the sharpness of our results | [['we', 'exhibit', 'invariants', 'of', 'smooth', 'projective', 'algebraic', 'varieties', 'with', 'integer', 'values', 'whose', 'nonvanishing', 'modulo', 'p', 'prevents', 'the', 'existence', 'of', 'an', 'action', 'without', 'fixed', 'points', 'of', 'certain', 'finite', 'pgroups', 'the', 'case', 'of', 'base', 'fields', 'of', 'characteristic', 'p', 'is', 'included', 'counterexamples', 'are', 'systematically', 'provided', 'to', 'test', 'the', 'sharpness', 'of', 'our', 'results']] | [-0.2632055564840533, 0.10056099312039025, -0.09972591470090711, 0.02486468292060023, -0.08485772957246067, -0.16598351816741788, 0.014284930897553508, 0.27138765810095533, -0.2775632164688135, -0.25478367121624096, 0.0441019353741894, -0.24172406601814592, -0.108330674160614, 0.22991251242252028, -0.11167549606108544, 0.046122277143936394, -0.004404531986623698, 0.10526526523563935, -0.1180218960519652, -0.37627347806297545, 0.4380463145825328, -0.04725614196753928, 0.19942850330654455, 0.07754014468542775, 0.0845270850315538, -0.019547356976842394, -0.004459907633385488, 0.014656596455951127, -0.14294732214730918, 0.06719880127252972, 0.3276126080534744, 0.052865017965740085, 0.19943937837925493, -0.3717658248710997, -0.14114558198774346, 0.24040713450130152, 0.08150177503156723, 0.05516352852312278, -0.013189927427744379, -0.2596558785512663, 0.22011206204983957, -0.10689098416466494, -0.22629671673081359, -0.10927080342127961, 0.046250876153306086, 0.0668776213590588, -0.2752843084840142, -0.022636644162085592, 0.14717286277077712, 0.23236540376151704, -0.09641029384481359, -0.1528964674513673, -0.06162746719616864, 0.08641835838100131, 0.06778788275313469, 0.0002136542081680833, 0.0692909551613337, -0.1034827305536185, -0.13957825272667165, 0.3542762523402973, -0.014919548219411957, -0.23264823078500982, 0.15134086089246734, -0.18209870074096382, -0.10113868468003917, 0.207264538835354, 0.0836318697856397, 0.1941341950881238, 0.05935296446693187, 0.1873772943354383, -0.10905030261421082, 0.10218189436258102, 0.107557659617112, -0.026831582811071862, 0.13308029401363158, 0.011855450762929966, 0.05601534261653314, 0.1523877107965931, -0.02695313267105696, -0.031863738288532714, -0.4396904357233826, -0.12145484298733729, -0.14881896231399508, 0.1365793273803227, -0.16054061683350984, -0.18730634494627618, 0.3770879851654172, 0.08620202790337558, 0.18326066104619174, 0.14274226826596625, 0.1980352539721192, 0.08093648522911707, 0.03532989125470726, 0.01504964369102096, 0.11669807320422663, 0.18953597766100144, -0.07033406950685443, -0.17877317799198233, 0.017080072370566884, 0.15250037803447672] |
1,802.01408 | Independence of the grossone-based infinity methodology from
non-standard analysis and comments upon logical fallacies in some texts
asserting the opposite | This commentary considers non-standard analysis and a recently introduced
computational methodology based on the notion of \G1 (this symbol is called
\emph{grossone}). The latter approach was developed with the intention to allow
one to work with infinities and infinitesimals numerically in a unique
computational framework and in all the situations requiring these notions.
Non-standard analysis is a classical purely symbolic technique that works with
ultrafilters, external and internal sets, standard and non-standard numbers,
etc. In its turn, the \G1-based methodology does not use any of these notions
and proposes a more physical treatment of mathematical objects separating the
objects from tools used to study them. It both offers a possibility to create
new numerical methods using infinities and infinitesimals in floating-point
computations and allows one to study certain mathematical objects dealing with
infinity more accurately than it is done traditionally. In these notes, we
explain that even though both methodologies deal with infinities and
infinitesimals, they are independent and represent two different philosophies
of Mathematics that are not in a conflict. It is proved that texts
\cite{Flunks, Gutman_Kutateladze_2008, Kutateladze_2011} asserting that the
\G1-based methodology is a part of non-standard analysis unfortunately contain
several logical fallacies. Their attempt to prove that the \G1-based
methodology is a part of non-standard analysis is similar to trying to show
that constructivism can be reduced to the traditional mathematics.
| math.GM | this commentary considers nonstandard analysis and a recently introduced computational methodology based on the notion of g1 this symbol is called emphgrossone the latter approach was developed with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework and in all the situations requiring these notions nonstandard analysis is a classical purely symbolic technique that works with ultrafilters external and internal sets standard and nonstandard numbers etc in its turn the g1based methodology does not use any of these notions and proposes a more physical treatment of mathematical objects separating the objects from tools used to study them it both offers a possibility to create new numerical methods using infinities and infinitesimals in floatingpoint computations and allows one to study certain mathematical objects dealing with infinity more accurately than it is done traditionally in these notes we explain that even though both methodologies deal with infinities and infinitesimals they are independent and represent two different philosophies of mathematics that are not in a conflict it is proved that texts citeflunks gutman_kutateladze_2008 kutateladze_2011 asserting that the g1based methodology is a part of nonstandard analysis unfortunately contain several logical fallacies their attempt to prove that the g1based methodology is a part of nonstandard analysis is similar to trying to show that constructivism can be reduced to the traditional mathematics | [['this', 'commentary', 'considers', 'nonstandard', 'analysis', 'and', 'a', 'recently', 'introduced', 'computational', 'methodology', 'based', 'on', 'the', 'notion', 'of', 'g1', 'this', 'symbol', 'is', 'called', 'emphgrossone', 'the', 'latter', 'approach', 'was', 'developed', 'with', 'the', 'intention', 'to', 'allow', 'one', 'to', 'work', 'with', 'infinities', 'and', 'infinitesimals', 'numerically', 'in', 'a', 'unique', 'computational', 'framework', 'and', 'in', 'all', 'the', 'situations', 'requiring', 'these', 'notions', 'nonstandard', 'analysis', 'is', 'a', 'classical', 'purely', 'symbolic', 'technique', 'that', 'works', 'with', 'ultrafilters', 'external', 'and', 'internal', 'sets', 'standard', 'and', 'nonstandard', 'numbers', 'etc', 'in', 'its', 'turn', 'the', 'g1based', 'methodology', 'does', 'not', 'use', 'any', 'of', 'these', 'notions', 'and', 'proposes', 'a', 'more', 'physical', 'treatment', 'of', 'mathematical', 'objects', 'separating', 'the', 'objects', 'from', 'tools', 'used', 'to', 'study', 'them', 'it', 'both', 'offers', 'a', 'possibility', 'to', 'create', 'new', 'numerical', 'methods', 'using', 'infinities', 'and', 'infinitesimals', 'in', 'floatingpoint', 'computations', 'and', 'allows', 'one', 'to', 'study', 'certain', 'mathematical', 'objects', 'dealing', 'with', 'infinity', 'more', 'accurately', 'than', 'it', 'is', 'done', 'traditionally', 'in', 'these', 'notes', 'we', 'explain', 'that', 'even', 'though', 'both', 'methodologies', 'deal', 'with', 'infinities', 'and', 'infinitesimals', 'they', 'are', 'independent', 'and', 'represent', 'two', 'different', 'philosophies', 'of', 'mathematics', 'that', 'are', 'not', 'in', 'a', 'conflict', 'it', 'is', 'proved', 'that', 'texts', 'citeflunks', 'gutman_kutateladze_2008', 'kutateladze_2011', 'asserting', 'that', 'the', 'g1based', 'methodology', 'is', 'a', 'part', 'of', 'nonstandard', 'analysis', 'unfortunately', 'contain', 'several', 'logical', 'fallacies', 'their', 'attempt', 'to', 'prove', 'that', 'the', 'g1based', 'methodology', 'is', 'a', 'part', 'of', 'nonstandard', 'analysis', 'is', 'similar', 'to', 'trying', 'to', 'show', 'that', 'constructivism', 'can', 'be', 'reduced', 'to', 'the', 'traditional', 'mathematics']] | [-0.06362463781102137, 0.04987033868780021, -0.1514540141413983, 0.1282936453845733, -0.15450244346760553, -0.15461973427498543, 0.04161948123946786, 0.3489258691329848, -0.2516706026180393, -0.3133895822991194, 0.10401606933896387, -0.2551665167092076, -0.17082591605245728, 0.2161163084801625, -0.14526896058497105, 0.03340990032064094, 0.0617197089436972, 0.017397069883405825, -0.035665630145707505, -0.24585239308018406, 0.3190591051116247, 0.025222206188217654, 0.25452091005546124, 0.027508092476901683, 0.08243550352348063, -0.016606368283762343, -0.1012365734712644, 0.04832090208021162, -0.08979062464479119, 0.17487065691119907, 0.2959894294596531, 0.19001182936980596, 0.3215094414624301, -0.4386421672068536, -0.19456750932149589, 0.11699150438759137, 0.10585364528762346, 0.12936267437021756, 0.016433104543433396, -0.2626492489721965, 0.11324258580888537, -0.16783868585797873, -0.12390457847240297, -0.13133235052227973, -0.006367965425703336, -0.021317369305655698, -0.20356985344128176, 0.008511945308948105, 0.10585773551138118, 0.09181761068969288, 0.00013521631084255535, -0.09430150707590987, 0.03250524006064304, 0.10668143159074878, 0.07814039795190514, -0.009177380150438032, 0.09237014340998774, -0.08043838507940315, -0.13977770238098772, 0.38568746583028274, -0.0035084164069716776, -0.24422394359822977, 0.24777230461318553, -0.11328438691032881, -0.1681607518218119, 0.08317607841242781, 0.10464591807262465, 0.11328022396191954, -0.16233042860033245, 0.0901394208676224, -0.007971785740135767, 0.15763564801732585, 0.07998398925093088, -0.005322222189385105, 0.17661848219788887, 0.11597875150089915, 0.024677401048723947, 0.08682547881723043, 0.001701155992685182, -0.10386794064384462, -0.3020008025823203, -0.16467482165687464, -0.1421828932472801, 0.016271800036801405, -0.032981132139552345, -0.19380795117467642, 0.33956544280941175, 0.20322564467232124, 0.13800498893569138, 0.046643867951140484, 0.31608532384270804, 0.08611652944713238, 0.08284918891202489, 0.04744128890081563, 0.1947368245624768, 0.1310980637473139, 0.11675980722912672, -0.11720403201602907, 0.0637158466545357, 0.07675380837913094] |
1,802.01409 | Spatial control of carrier capture in two-dimensional materials: Beyond
energy selection rules | Transition metal dichalcogenide monolayers have attracted wide attention due
to their remarkable optical, electronic and mechanical properties. In these
materials local strain distributions effectively form quasi zero-dimensional
potentials, whose localized states may be populated by carrier capture from the
continuum states. Using a recently developed Lindblad single-particle approach,
here we study the phonon-induced carrier capture in a MoSe$_2$ monolayer.
Although one decisive control parameter is the energy selection rule, which
links the energy of the incoming carriers to that of the final state via the
emitted phonon, we show that additionally the spatio-temporal dynamics plays a
crucial role. By varying the direction of the incoming carriers with respect to
the orientation of the localized potential, we introduce a new control
mechanism for the carrier capture: the spatial control.
| cond-mat.mes-hall | transition metal dichalcogenide monolayers have attracted wide attention due to their remarkable optical electronic and mechanical properties in these materials local strain distributions effectively form quasi zerodimensional potentials whose localized states may be populated by carrier capture from the continuum states using a recently developed lindblad singleparticle approach here we study the phononinduced carrier capture in a mose_2 monolayer although one decisive control parameter is the energy selection rule which links the energy of the incoming carriers to that of the final state via the emitted phonon we show that additionally the spatiotemporal dynamics plays a crucial role by varying the direction of the incoming carriers with respect to the orientation of the localized potential we introduce a new control mechanism for the carrier capture the spatial control | [['transition', 'metal', 'dichalcogenide', 'monolayers', 'have', 'attracted', 'wide', 'attention', 'due', 'to', 'their', 'remarkable', 'optical', 'electronic', 'and', 'mechanical', 'properties', 'in', 'these', 'materials', 'local', 'strain', 'distributions', 'effectively', 'form', 'quasi', 'zerodimensional', 'potentials', 'whose', 'localized', 'states', 'may', 'be', 'populated', 'by', 'carrier', 'capture', 'from', 'the', 'continuum', 'states', 'using', 'a', 'recently', 'developed', 'lindblad', 'singleparticle', 'approach', 'here', 'we', 'study', 'the', 'phononinduced', 'carrier', 'capture', 'in', 'a', 'mose_2', 'monolayer', 'although', 'one', 'decisive', 'control', 'parameter', 'is', 'the', 'energy', 'selection', 'rule', 'which', 'links', 'the', 'energy', 'of', 'the', 'incoming', 'carriers', 'to', 'that', 'of', 'the', 'final', 'state', 'via', 'the', 'emitted', 'phonon', 'we', 'show', 'that', 'additionally', 'the', 'spatiotemporal', 'dynamics', 'plays', 'a', 'crucial', 'role', 'by', 'varying', 'the', 'direction', 'of', 'the', 'incoming', 'carriers', 'with', 'respect', 'to', 'the', 'orientation', 'of', 'the', 'localized', 'potential', 'we', 'introduce', 'a', 'new', 'control', 'mechanism', 'for', 'the', 'carrier', 'capture', 'the', 'spatial', 'control']] | [-0.11864890273864148, 0.17943157116496877, -0.07727483119742828, 0.03884377957342622, -0.022833215654827654, -0.14173461394238984, 0.08410203538824135, 0.410338923917152, -0.28585025771462824, -0.26191264996168684, -0.016186945626031957, -0.26493412036143127, -0.16941776125895558, 0.15016934481718636, 0.018235281353554456, 0.03840607502434068, 0.006071087595046265, -0.04768076797336107, -0.04004316260761698, -0.1474105015386158, 0.3205823501375562, 0.055876990787510294, 0.3563364470428496, 0.08026822349711438, 0.07776402739000332, 0.04134935781985405, 0.04889989233925007, -0.015710797160863876, -0.13101843444803762, 0.14024174528731237, 0.24465295854497526, -0.044658917656306585, 0.29944161118692136, -0.46315591591701377, -0.2617057042734814, 0.055000932996335905, 0.14395012258319184, 0.15968218564466952, -0.09599290619553358, -0.2936176024231827, 0.0530044932202145, -0.169446107669728, -0.12183777877180546, -0.1019968975597294, 0.014701515436172485, 0.04504635192461137, -0.2220434145242507, 0.09469731864373898, 0.053385887629701756, -0.0034598073980305344, -0.10034964381338796, -0.06761772858226323, -0.112208705590092, 0.13315276195498882, 0.02676352785601921, 0.006894071132592217, 0.20399094826279907, -0.13884139594301814, -0.10271339799146517, 0.3770013438552269, -0.03379870860499068, -0.1733281011274812, 0.17957243259297684, -0.1593127184169134, -0.04363881683093496, 0.19008557277629734, 0.1806452448363416, 0.11767647210217547, -0.15149730249231652, 0.05791547812577846, -0.010187738262175117, 0.16398613694036612, 0.042314346792409196, 0.15305503446688817, 0.2484140305987239, 0.16558283928679884, 0.05132469745694834, 0.1126827407597375, -0.12495662039145827, -0.09616353462297411, -0.19745089167554397, -0.1568231118390031, -0.2125497178240039, 0.06631964514963329, -0.03876852110249729, -0.1655844780325424, 0.4773671938582993, 0.1295133277299101, 0.2014393149438547, -0.061025598914966395, 0.23387923714108183, 0.15110397023636324, 0.0784572442771605, 0.019657520329928957, 0.2635895855491981, 0.1527471838362544, 0.09279028424498392, -0.28414447588329494, 0.09086747481342172, 0.010987446214130614] |
1,802.0141 | High resolution nanofocus X-ray source based on ultracold electrons from
laser cooled-atoms | X-ray 3D tomography is So far limited to micron resolution because of the
large focusing spot of the focused electron beam on the metal target. Here, we
proposed a nanofocous X-ray 3D tomography system based on focused electrons
from laser-cooled atoms in a nanoscale region of metal target in vacuum useful
for 3D nanotomography and submicron volumetric imaging. We have shown the
system has submicron resolution because of ability of focusing cold electrons
to submicron size, the smaller the X-ray focal spot, the higher the resolution
will be. In our system flux through the specimen of (photons/mm^2/s) can be
improved by sub-micron focusing of X-ray radiation as well. In contrast,
synchrotrons and X-ray tubes provide intense radiation beams, however, these
attributes are not necessary for microtomography and the proposed
sub-microfocus source compares favorably with respect to the radiation flux
because of ability of sub-micron focusing of electrons from near-threshold
photoionizing laser cooled atoms.
| physics.ins-det physics.bio-ph | xray 3d tomography is so far limited to micron resolution because of the large focusing spot of the focused electron beam on the metal target here we proposed a nanofocous xray 3d tomography system based on focused electrons from lasercooled atoms in a nanoscale region of metal target in vacuum useful for 3d nanotomography and submicron volumetric imaging we have shown the system has submicron resolution because of ability of focusing cold electrons to submicron size the smaller the xray focal spot the higher the resolution will be in our system flux through the specimen of photonsmm2s can be improved by submicron focusing of xray radiation as well in contrast synchrotrons and xray tubes provide intense radiation beams however these attributes are not necessary for microtomography and the proposed submicrofocus source compares favorably with respect to the radiation flux because of ability of submicron focusing of electrons from nearthreshold photoionizing laser cooled atoms | [['xray', '3d', 'tomography', 'is', 'so', 'far', 'limited', 'to', 'micron', 'resolution', 'because', 'of', 'the', 'large', 'focusing', 'spot', 'of', 'the', 'focused', 'electron', 'beam', 'on', 'the', 'metal', 'target', 'here', 'we', 'proposed', 'a', 'nanofocous', 'xray', '3d', 'tomography', 'system', 'based', 'on', 'focused', 'electrons', 'from', 'lasercooled', 'atoms', 'in', 'a', 'nanoscale', 'region', 'of', 'metal', 'target', 'in', 'vacuum', 'useful', 'for', '3d', 'nanotomography', 'and', 'submicron', 'volumetric', 'imaging', 'we', 'have', 'shown', 'the', 'system', 'has', 'submicron', 'resolution', 'because', 'of', 'ability', 'of', 'focusing', 'cold', 'electrons', 'to', 'submicron', 'size', 'the', 'smaller', 'the', 'xray', 'focal', 'spot', 'the', 'higher', 'the', 'resolution', 'will', 'be', 'in', 'our', 'system', 'flux', 'through', 'the', 'specimen', 'of', 'photonsmm2s', 'can', 'be', 'improved', 'by', 'submicron', 'focusing', 'of', 'xray', 'radiation', 'as', 'well', 'in', 'contrast', 'synchrotrons', 'and', 'xray', 'tubes', 'provide', 'intense', 'radiation', 'beams', 'however', 'these', 'attributes', 'are', 'not', 'necessary', 'for', 'microtomography', 'and', 'the', 'proposed', 'submicrofocus', 'source', 'compares', 'favorably', 'with', 'respect', 'to', 'the', 'radiation', 'flux', 'because', 'of', 'ability', 'of', 'submicron', 'focusing', 'of', 'electrons', 'from', 'nearthreshold', 'photoionizing', 'laser', 'cooled', 'atoms']] | [0.003583394861004005, 0.16851958355555932, -0.02510527951642871, 0.05035031205120807, -0.02694131656549871, -0.13225888904184102, -0.0006100383540615439, 0.47038995891809465, -0.21214039812485377, -0.34086499484760374, 0.07203596212280293, -0.3166371168444554, -0.01278620783239603, 0.254477311950177, -0.0499008047505049, 0.09469279190525412, 0.0456293946194152, -0.07195426677644719, -0.019601104460501423, -0.16388189574703574, 0.2854043583540867, 0.16244922980472135, 0.3348869901631648, 0.09599302103122076, 0.12982870736469826, -0.022019409181860586, -0.013402458891893426, 0.023636366532494624, -0.07595399948302656, 0.1068874123878777, 0.21055578640662134, 0.04830002724503477, 0.19815076321363448, -0.530338778073589, -0.24347607433097437, 0.032063077968050496, 0.19441812633536756, 0.09141297231428325, -0.08793196846575786, -0.26202707437953604, 0.019137957751130065, -0.0968833915082117, -0.11733960375810663, -0.021433998290449383, -0.018250206423302492, 0.0783053567345875, -0.21754879546972614, 0.017569417214641968, 0.016045683015836403, 0.07993290174131593, -0.09105735783930868, -0.05723551981849596, -0.01236352779592077, 0.05622616077152391, -0.009349503202053407, 0.06435274785384536, 0.21277508875665566, -0.16392232021937767, -0.047650232054293154, 0.39578581909338634, -0.023350042820287246, -0.10355696545292933, 0.20153371846924226, -0.2629232737546166, -0.037497450200219946, 0.25556821449349326, 0.16039139210130088, 0.1621061808243394, -0.13077535606299837, 0.029809433301367486, -0.0300363955895106, 0.2491187622770667, 0.11633979318353037, 0.10586871347390116, 0.273923279736191, 0.25874820961694545, 0.00976432461446772, 0.17858381397556514, -0.25160980321777365, 0.02863304678350687, -0.1731581415833595, -0.12903795820350447, -0.20528268189479906, 0.05605652498246248, -0.02123725195696655, -0.14427976872830187, 0.34067714013469713, 0.17863137179985641, 0.14000683321927984, -0.08423426944917689, 0.36983044028282164, 0.0397777207971861, 0.0836509636292855, -0.007966042504025002, 0.28295139532060903, 0.12202813036429386, 0.13534451144126555, -0.2581912571657449, 0.018623970976720253, -0.03568442550177375] |
1,802.01411 | Carrier-envelope-phase stable, high-contrast, double
chirped-pulse-amplification laser system | We present the first carrier-envelope phase stable chirped pulse amplifier
(CPA) featuring high temporal contrast for relativistic intensity laser-plasma
interactions at 1 kHz repetition rate. The laser is based on a double-CPA
architecture including XPW filtering technique and a high-energy grism-based
compressor. 8 mJ, 22 fs pulses are produced with 10-11 temporal contrast at -20
ps and a CEP drift of 240 mrad RMS.
| physics.optics | we present the first carrierenvelope phase stable chirped pulse amplifier cpa featuring high temporal contrast for relativistic intensity laserplasma interactions at 1 khz repetition rate the laser is based on a doublecpa architecture including xpw filtering technique and a highenergy grismbased compressor 8 mj 22 fs pulses are produced with 1011 temporal contrast at 20 ps and a cep drift of 240 mrad rms | [['we', 'present', 'the', 'first', 'carrierenvelope', 'phase', 'stable', 'chirped', 'pulse', 'amplifier', 'cpa', 'featuring', 'high', 'temporal', 'contrast', 'for', 'relativistic', 'intensity', 'laserplasma', 'interactions', 'at', '1', 'khz', 'repetition', 'rate', 'the', 'laser', 'is', 'based', 'on', 'a', 'doublecpa', 'architecture', 'including', 'xpw', 'filtering', 'technique', 'and', 'a', 'highenergy', 'grismbased', 'compressor', '8', 'mj', '22', 'fs', 'pulses', 'are', 'produced', 'with', '1011', 'temporal', 'contrast', 'at', '20', 'ps', 'and', 'a', 'cep', 'drift', 'of', '240', 'mrad', 'rms']] | [-0.12539763947124363, 0.22901140264861408, -0.056401010928103, 0.03280255587229536, 0.0318573889795874, -0.20900561234562612, 0.028710217577725895, 0.5395346862859414, -0.19072858430445194, -0.3480983075769771, 0.036345313463482215, -0.2470629516355388, 0.011186706604527646, 0.2588420138221051, -0.01342849115092979, 0.06941766946836085, 0.03484012444549408, -0.034495422941037135, -0.041886070040894334, -0.11460830912673388, 0.17124131253202918, 0.11111811780538715, 0.29172878775012784, 0.005751182401522261, 0.1909312823878937, 0.013105523329777796, 0.023700331047665876, -0.17209080130350393, -0.0867072489173686, 0.03518957401946431, 0.21621937054346818, -0.0024851143176926943, 0.2527602956645557, -0.358345074823401, -0.21181897892326604, -0.015236555629211371, 0.08268716846607992, 0.08003273838367618, -0.08748237252212511, -0.2596130224601289, 0.11378888672858965, -0.1885755448525802, -0.09478018178650346, 0.028790120875127004, 0.018075728575225738, 0.12917369607164234, -0.30219360069203816, 0.08150807400157706, 0.03773777636978012, 0.11126407061810376, -0.010299712198129932, -0.043769959833656176, 0.06082760220485144, -0.07760863674835103, -0.08654589293387215, 0.15281132288223712, 0.18731296612865855, -0.07053938543149194, -0.12820411054226646, 0.34941926270295853, -0.12735894064373168, -0.021378224227027814, 0.1392548404916449, -0.20326645374603447, -0.024911988503681343, 0.3096999081431842, 0.15864617142780515, 0.13987343136190636, -0.07907582083182624, -0.04165100848080865, 0.14870461701133028, 0.37266811575801645, 0.2718177869778554, 0.08160882079821141, 0.19357737972110997, 0.2567022326784056, 0.012645270564730783, 0.08084066849980565, -0.2504856004570534, -0.005125143473632023, -0.28292652808862634, 0.002040453980863858, -0.08723771059122241, 0.038091039145747047, -0.09098640660570217, -0.00609986456569101, 0.4610381419541406, 0.12713023711789828, 0.08941468738828648, 0.02684349885790563, 0.3108771112365801, 0.16218495621636023, -0.012393446268941292, 0.05364718204784039, 0.2582709989128787, 0.17608440829227207, 0.18671960353881853, -0.2229089939672897, -0.05866999915022342, -0.027142851063828976] |
1,802.01412 | The convexity of inclusions and gradient's concentration for Lam\'e
systems with partially infinite coefficients | It is interesting to study the stress concentration between two adjacent
stiff inclusions in composite materials, which can be modeled by the Lam\'e
system with partially infinite coefficients. To overcome the difficulty from
the lack of maximum principle for elliptic systems, we use the energy method
and an iteration technique to study the gradient estimates of the solution. We
first find a novel phenomenon that the gradient will not blow up any more once
these two adjacent inclusions fail to be locally relatively strictly convex,
namely, the top and bottom boundaries of the narrow region are partially
"flat". This is contrary to our expectation. In order to further explore the
blow-up mechanism of the gradient, we next investigate two adjacent inclusions
with relative convexity of order m and finally reveal an underlying
relationship between the blow-up rate of the stress and the order of the
relative convexity of the subdomains in all dimensions.
| math.AP | it is interesting to study the stress concentration between two adjacent stiff inclusions in composite materials which can be modeled by the lame system with partially infinite coefficients to overcome the difficulty from the lack of maximum principle for elliptic systems we use the energy method and an iteration technique to study the gradient estimates of the solution we first find a novel phenomenon that the gradient will not blow up any more once these two adjacent inclusions fail to be locally relatively strictly convex namely the top and bottom boundaries of the narrow region are partially flat this is contrary to our expectation in order to further explore the blowup mechanism of the gradient we next investigate two adjacent inclusions with relative convexity of order m and finally reveal an underlying relationship between the blowup rate of the stress and the order of the relative convexity of the subdomains in all dimensions | [['it', 'is', 'interesting', 'to', 'study', 'the', 'stress', 'concentration', 'between', 'two', 'adjacent', 'stiff', 'inclusions', 'in', 'composite', 'materials', 'which', 'can', 'be', 'modeled', 'by', 'the', 'lame', 'system', 'with', 'partially', 'infinite', 'coefficients', 'to', 'overcome', 'the', 'difficulty', 'from', 'the', 'lack', 'of', 'maximum', 'principle', 'for', 'elliptic', 'systems', 'we', 'use', 'the', 'energy', 'method', 'and', 'an', 'iteration', 'technique', 'to', 'study', 'the', 'gradient', 'estimates', 'of', 'the', 'solution', 'we', 'first', 'find', 'a', 'novel', 'phenomenon', 'that', 'the', 'gradient', 'will', 'not', 'blow', 'up', 'any', 'more', 'once', 'these', 'two', 'adjacent', 'inclusions', 'fail', 'to', 'be', 'locally', 'relatively', 'strictly', 'convex', 'namely', 'the', 'top', 'and', 'bottom', 'boundaries', 'of', 'the', 'narrow', 'region', 'are', 'partially', 'flat', 'this', 'is', 'contrary', 'to', 'our', 'expectation', 'in', 'order', 'to', 'further', 'explore', 'the', 'blowup', 'mechanism', 'of', 'the', 'gradient', 'we', 'next', 'investigate', 'two', 'adjacent', 'inclusions', 'with', 'relative', 'convexity', 'of', 'order', 'm', 'and', 'finally', 'reveal', 'an', 'underlying', 'relationship', 'between', 'the', 'blowup', 'rate', 'of', 'the', 'stress', 'and', 'the', 'order', 'of', 'the', 'relative', 'convexity', 'of', 'the', 'subdomains', 'in', 'all', 'dimensions']] | [-0.11840573903036249, 0.10661150468836746, -0.06879708016279086, 0.040884146534569954, -0.06615650473966025, -0.11354672030722296, 0.027595760659892964, 0.3869524258462822, -0.3426103821470177, -0.27696085597914977, 0.1303067850595754, -0.2753358111394192, -0.13309452694907686, 0.1357014331878376, -0.05757707007266612, 0.03709178617272794, 0.015582680282201253, 0.013711073761501538, -0.07651455753507226, -0.247994991624414, 0.35599301667622246, -0.024629052205496695, 0.2549746615045211, 0.07954464833331264, 0.08093302221086145, -0.046831241303604415, 0.016618352413810548, 0.058696352225405715, -0.13710830404045207, 0.16975836918135387, 0.21995784418377418, 0.03954460585849007, 0.29595974792446333, -0.4253302433229739, -0.1799423810508516, 0.1385711694617141, 0.11930849645332452, 0.0953591149931871, -0.023376085261796797, -0.22421410944604991, 0.12363605432553229, -0.1269519631690011, -0.14810610214077863, -0.04213430223456931, -0.03060021606012205, 0.051490465961274955, -0.2551513290477101, 0.07803008138670836, 0.08484763417248782, 0.008208952795446308, -0.08817027693194356, -0.07091605332238733, -0.032570028447795635, 0.11303838067596741, 0.0814594779881874, -0.00945490884714078, 0.07887331114814075, -0.10704031663533219, -0.053471876667459416, 0.34712124811911504, -0.061721234490677984, -0.22636487286907295, 0.21652280769365675, -0.15943320438545805, -0.06875264561838573, 0.14135463422870423, 0.17780398188810947, 0.14842973643414725, -0.15894130096935175, 0.055378554143875935, -0.016352411015628794, 0.17475952421089794, 0.08406818440500526, -0.01850700083423065, 0.17540402882702016, 0.12041429042803987, 0.14880717462659174, 0.15858159687071796, -0.06971960844094652, -0.08900421257648203, -0.3432169245933396, -0.19395772213370424, -0.15717106711749426, 0.011242781009534953, -0.1211653141288872, -0.17153558864873025, 0.34168027915985755, 0.13501944459573018, 0.2448647541596609, 0.030878869750463934, 0.2599720498546958, 0.11502949549935247, 0.05795603072015094, 0.08260122496403413, 0.2633046154267599, 0.15525429062788781, 0.07495683777979971, -0.24240642031989504, 0.07201588483149904, 0.10343400974532747] |
1,802.01413 | Nonconservative traceless type gravity | Extensions of the gravity theory in order to obtain traceless field equations
have been widely considered in the literature. The leading example of such
class of theories is the unimodular gravity, but there are other possibilities
like the mimetic gravity and the Rastall gravity with a coupling parameter
$\lambda = 1/2$. The unimodular gravity proposal is a very interesting approach
in other to address the cosmological constant problem. When coupled to matter
such theories may imply that the energy-momentum tensor is not divergence free
anymore. In this paper, a unimodular type theory will be developed by evading
the conservation $T^{\mu\nu}_{\, ; \mu}=0$. The cosmological consequences of
the later, both at background as well as for scalar and tensor perturbations,
are explored. Possible further extensions of this approach are discussed as
well as its connection with the traditional unimodular gravity.
| gr-qc astro-ph.CO hep-th | extensions of the gravity theory in order to obtain traceless field equations have been widely considered in the literature the leading example of such class of theories is the unimodular gravity but there are other possibilities like the mimetic gravity and the rastall gravity with a coupling parameter lambda 12 the unimodular gravity proposal is a very interesting approach in other to address the cosmological constant problem when coupled to matter such theories may imply that the energymomentum tensor is not divergence free anymore in this paper a unimodular type theory will be developed by evading the conservation tmunu_ mu0 the cosmological consequences of the later both at background as well as for scalar and tensor perturbations are explored possible further extensions of this approach are discussed as well as its connection with the traditional unimodular gravity | [['extensions', 'of', 'the', 'gravity', 'theory', 'in', 'order', 'to', 'obtain', 'traceless', 'field', 'equations', 'have', 'been', 'widely', 'considered', 'in', 'the', 'literature', 'the', 'leading', 'example', 'of', 'such', 'class', 'of', 'theories', 'is', 'the', 'unimodular', 'gravity', 'but', 'there', 'are', 'other', 'possibilities', 'like', 'the', 'mimetic', 'gravity', 'and', 'the', 'rastall', 'gravity', 'with', 'a', 'coupling', 'parameter', 'lambda', '12', 'the', 'unimodular', 'gravity', 'proposal', 'is', 'a', 'very', 'interesting', 'approach', 'in', 'other', 'to', 'address', 'the', 'cosmological', 'constant', 'problem', 'when', 'coupled', 'to', 'matter', 'such', 'theories', 'may', 'imply', 'that', 'the', 'energymomentum', 'tensor', 'is', 'not', 'divergence', 'free', 'anymore', 'in', 'this', 'paper', 'a', 'unimodular', 'type', 'theory', 'will', 'be', 'developed', 'by', 'evading', 'the', 'conservation', 'tmunu_', 'mu0', 'the', 'cosmological', 'consequences', 'of', 'the', 'later', 'both', 'at', 'background', 'as', 'well', 'as', 'for', 'scalar', 'and', 'tensor', 'perturbations', 'are', 'explored', 'possible', 'further', 'extensions', 'of', 'this', 'approach', 'are', 'discussed', 'as', 'well', 'as', 'its', 'connection', 'with', 'the', 'traditional', 'unimodular', 'gravity']] | [-0.12126716986291713, 0.16098433597054443, -0.0747955265790498, 0.10045558179006227, -0.12837232280906072, -0.19217847166445984, -0.09946845269244958, 0.2913781225147164, -0.24761462304056348, -0.30501585304463175, 0.12758957262678236, -0.24645165720379308, -0.17360282909837277, 0.14208844478022964, -0.04969342904822791, 0.03554746605796561, -0.03366193460875794, 0.10792268440127373, -0.07013397004587152, -0.26616973616182804, 0.35636857210877626, 0.0802507819402415, 0.21664883814125513, 0.05912138063200366, 0.06939484952497021, -0.07584779528791413, -0.030411774097421372, 0.09553638273535077, -0.13347239672534403, 0.0370667087892584, 0.24495793917412811, 0.1091317899965147, 0.2511157581740169, -0.3931723233887597, -0.30357186219600196, 0.12053111685193418, 0.11378588524017044, 0.15540263542617835, -0.07214036994093262, -0.2702614163829233, 0.055633576371131796, -0.19657899787896038, -0.15481576663852833, -0.08598102771108695, 0.009334149844910237, -0.05446364918230649, -0.2263416256995269, 0.10265188055756666, 0.030722240908824673, -0.021369400535203406, -0.06416413351903696, -0.1131544576081283, 0.006625390344518511, 0.06120901926945354, 0.13604522008202313, 0.04465846617719816, 0.08500657222398064, -0.14504138369332342, -0.10709635225408848, 0.45941072591470883, -0.11889510223152362, -0.2610774578745751, 0.17476863581139376, -0.12675494457225261, -0.1657799948417746, 0.009131703542901532, 0.09600560609867577, 0.1468638741177582, -0.12708177365408013, 0.2056181755127481, -0.009391757821397144, 0.08526497616377823, 0.09312558766139452, 0.0656663049799938, 0.2807666045983377, 0.09716259462327477, 0.05291147421025123, 0.09277887631737138, -0.0012980139684205985, -0.10764956944801858, -0.36854593120926227, -0.14211730956894292, -0.13171201989547732, 0.05099874622069097, -0.13092369466026224, -0.17402181238182546, 0.33427127526032135, 0.15261005699679064, 0.08349644191997975, 0.0681390706809265, 0.253402916043449, 0.0991261786514181, 0.10354955493205446, 0.03574756182634326, 0.31419214795288797, 0.20417622132192584, 0.08623752015409991, -0.2009789689036552, -0.036442063854979896, 0.07637984466718455] |
1,802.01414 | A Learning-based Approach to Joint Content Caching and Recommendation at
Base Stations | Recommendation system is able to shape user demands, which can be used for
boosting caching gain. In this paper, we jointly optimize content caching and
recommendation at base stations to maximize the caching gain meanwhile not
compromising the user preference. We first propose a model to capture the
impact of recommendation on user demands, which is controlled by a
user-specific psychological threshold. We then formulate a joint caching and
recommendation problem maximizing the successful offloading probability, which
is a mixed integer programming problem. We develop a hierarchical iterative
algorithm to solve the problem when the threshold is known. Since the user
threshold is unknown in practice, we proceed to propose an $\varepsilon$-greedy
algorithm to find the solution by learning the threshold via interactions with
users. Simulation results show that the proposed algorithms improve the
successful offloading probability compared with prior works with/without
recommendation. The $\varepsilon$-greedy algorithm learns the user threshold
quickly, and achieves more than $1-\varepsilon$ of the performance obtained by
the algorithm with known threshold.
| cs.NI cs.LG | recommendation system is able to shape user demands which can be used for boosting caching gain in this paper we jointly optimize content caching and recommendation at base stations to maximize the caching gain meanwhile not compromising the user preference we first propose a model to capture the impact of recommendation on user demands which is controlled by a userspecific psychological threshold we then formulate a joint caching and recommendation problem maximizing the successful offloading probability which is a mixed integer programming problem we develop a hierarchical iterative algorithm to solve the problem when the threshold is known since the user threshold is unknown in practice we proceed to propose an varepsilongreedy algorithm to find the solution by learning the threshold via interactions with users simulation results show that the proposed algorithms improve the successful offloading probability compared with prior works withwithout recommendation the varepsilongreedy algorithm learns the user threshold quickly and achieves more than 1varepsilon of the performance obtained by the algorithm with known threshold | [['recommendation', 'system', 'is', 'able', 'to', 'shape', 'user', 'demands', 'which', 'can', 'be', 'used', 'for', 'boosting', 'caching', 'gain', 'in', 'this', 'paper', 'we', 'jointly', 'optimize', 'content', 'caching', 'and', 'recommendation', 'at', 'base', 'stations', 'to', 'maximize', 'the', 'caching', 'gain', 'meanwhile', 'not', 'compromising', 'the', 'user', 'preference', 'we', 'first', 'propose', 'a', 'model', 'to', 'capture', 'the', 'impact', 'of', 'recommendation', 'on', 'user', 'demands', 'which', 'is', 'controlled', 'by', 'a', 'userspecific', 'psychological', 'threshold', 'we', 'then', 'formulate', 'a', 'joint', 'caching', 'and', 'recommendation', 'problem', 'maximizing', 'the', 'successful', 'offloading', 'probability', 'which', 'is', 'a', 'mixed', 'integer', 'programming', 'problem', 'we', 'develop', 'a', 'hierarchical', 'iterative', 'algorithm', 'to', 'solve', 'the', 'problem', 'when', 'the', 'threshold', 'is', 'known', 'since', 'the', 'user', 'threshold', 'is', 'unknown', 'in', 'practice', 'we', 'proceed', 'to', 'propose', 'an', 'varepsilongreedy', 'algorithm', 'to', 'find', 'the', 'solution', 'by', 'learning', 'the', 'threshold', 'via', 'interactions', 'with', 'users', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'algorithms', 'improve', 'the', 'successful', 'offloading', 'probability', 'compared', 'with', 'prior', 'works', 'withwithout', 'recommendation', 'the', 'varepsilongreedy', 'algorithm', 'learns', 'the', 'user', 'threshold', 'quickly', 'and', 'achieves', 'more', 'than', '1varepsilon', 'of', 'the', 'performance', 'obtained', 'by', 'the', 'algorithm', 'with', 'known', 'threshold']] | [-0.0947064865690499, -0.01892195375001897, -0.06569605290290832, 0.055003256814733864, -0.15180118831368275, -0.23759282991032016, 0.15540035566138327, 0.4304001113871135, -0.27175938795848065, -0.34594228855300563, 0.03673101528070822, -0.26560034508345626, -0.2144844680884292, 0.09161918189415866, -0.11861785312171981, 0.09520064981889922, 0.05806141585344449, 0.09386571797441287, -0.048174649983341526, -0.34151678060529284, 0.3053031587490745, 0.13383514721350498, 0.3345687594997601, 0.06192082974566034, 0.10176314466846097, 0.02283259681341833, -0.007336177549700825, -0.0061118717765413135, -0.12079806569691065, 0.1032613472478655, 0.35150491980364523, 0.24719884019086968, 0.33870139374700653, -0.3786277322334249, -0.20203864845501243, 0.08052168662816915, 0.16953997901943793, 0.06774053412436294, -0.06942202952518255, -0.28752051853765564, 0.15887928497977555, -0.23221729043310127, 0.009641062731978046, -0.04340607587652034, -0.0778428962039032, 0.014684742019253683, -0.3988537118988987, -0.024520285921283514, 0.00897062421742692, -0.035952671167317284, -0.03715072557784572, -0.11295514196614702, 0.04961235162308327, 0.1573637329732385, 0.04089422720128177, 0.018646137231009934, 0.13507489718676333, -0.14007396597824767, -0.16494426460016565, 0.39360054964985114, -0.004909337268660479, -0.22280610615179974, 0.11481952313502061, -0.023702725035935103, -0.11118527501821518, 0.156516039572903, 0.25598462168763725, 0.11480194193602775, -0.16484716105043778, 0.005852613821471424, -0.047664573585827756, 0.19282963204601533, 0.04777709142226411, -0.012411703506389251, 0.1385284019031012, 0.24532906461860535, 0.15364383002855334, 0.13721614549601316, -0.05702559278537351, -0.0876895576457392, -0.15413121838145047, -0.09805166879556625, -0.19982507785625128, -0.01859813966745923, -0.10542180093472714, -0.07125406494891517, 0.3710029885307493, 0.21840887310555632, 0.16507388391049513, 0.1609420308594996, 0.3775667832625738, 0.15409135155334888, 0.02680498964036815, 0.15356058499169906, 0.15452467448622303, -0.013404315015292692, 0.15272663024861466, -0.22608934431505132, 0.15135110529414547, 0.05108547583502908] |
1,802.01415 | Big Data Analytics for Wireless and Wired Network Design: A Survey | Currently, the world is witnessing a mounting avalanche of data due to the
increasing number of mobile network subscribers, Internet websites, and online
services. This trend is continuing to develop in a quick and diverse manner in
the form of big data. Big data analytics can process large amounts of raw data
and extract useful, smaller-sized information, which can be used by different
parties to make reliable decisions. In this paper, we conduct a survey on the
role that big data analytics can play in the design of data communication
networks. Integrating the latest advances that employ big data analytics with
the networks control/traffic layers might be the best way to build robust data
communication networks with refined performance and intelligent features.
First, the survey starts with the introduction of the big data basic concepts,
framework, and characteristics. Second, we illustrate the main network design
cycle employing big data analytics. This cycle represents the umbrella concept
that unifies the surveyed topics. Third, there is a detailed review of the
current academic and industrial efforts toward network design using big data
analytics. Forth, we identify the challenges confronting the utilization of big
data analytics in network design. Finally, we highlight several future research
directions. To the best of our knowledge, this is the first survey that
addresses the use of big data analytics techniques for the design of a broad
range of networks.
| cs.NI stat.ML | currently the world is witnessing a mounting avalanche of data due to the increasing number of mobile network subscribers internet websites and online services this trend is continuing to develop in a quick and diverse manner in the form of big data big data analytics can process large amounts of raw data and extract useful smallersized information which can be used by different parties to make reliable decisions in this paper we conduct a survey on the role that big data analytics can play in the design of data communication networks integrating the latest advances that employ big data analytics with the networks controltraffic layers might be the best way to build robust data communication networks with refined performance and intelligent features first the survey starts with the introduction of the big data basic concepts framework and characteristics second we illustrate the main network design cycle employing big data analytics this cycle represents the umbrella concept that unifies the surveyed topics third there is a detailed review of the current academic and industrial efforts toward network design using big data analytics forth we identify the challenges confronting the utilization of big data analytics in network design finally we highlight several future research directions to the best of our knowledge this is the first survey that addresses the use of big data analytics techniques for the design of a broad range of networks | [['currently', 'the', 'world', 'is', 'witnessing', 'a', 'mounting', 'avalanche', 'of', 'data', 'due', 'to', 'the', 'increasing', 'number', 'of', 'mobile', 'network', 'subscribers', 'internet', 'websites', 'and', 'online', 'services', 'this', 'trend', 'is', 'continuing', 'to', 'develop', 'in', 'a', 'quick', 'and', 'diverse', 'manner', 'in', 'the', 'form', 'of', 'big', 'data', 'big', 'data', 'analytics', 'can', 'process', 'large', 'amounts', 'of', 'raw', 'data', 'and', 'extract', 'useful', 'smallersized', 'information', 'which', 'can', 'be', 'used', 'by', 'different', 'parties', 'to', 'make', 'reliable', 'decisions', 'in', 'this', 'paper', 'we', 'conduct', 'a', 'survey', 'on', 'the', 'role', 'that', 'big', 'data', 'analytics', 'can', 'play', 'in', 'the', 'design', 'of', 'data', 'communication', 'networks', 'integrating', 'the', 'latest', 'advances', 'that', 'employ', 'big', 'data', 'analytics', 'with', 'the', 'networks', 'controltraffic', 'layers', 'might', 'be', 'the', 'best', 'way', 'to', 'build', 'robust', 'data', 'communication', 'networks', 'with', 'refined', 'performance', 'and', 'intelligent', 'features', 'first', 'the', 'survey', 'starts', 'with', 'the', 'introduction', 'of', 'the', 'big', 'data', 'basic', 'concepts', 'framework', 'and', 'characteristics', 'second', 'we', 'illustrate', 'the', 'main', 'network', 'design', 'cycle', 'employing', 'big', 'data', 'analytics', 'this', 'cycle', 'represents', 'the', 'umbrella', 'concept', 'that', 'unifies', 'the', 'surveyed', 'topics', 'third', 'there', 'is', 'a', 'detailed', 'review', 'of', 'the', 'current', 'academic', 'and', 'industrial', 'efforts', 'toward', 'network', 'design', 'using', 'big', 'data', 'analytics', 'forth', 'we', 'identify', 'the', 'challenges', 'confronting', 'the', 'utilization', 'of', 'big', 'data', 'analytics', 'in', 'network', 'design', 'finally', 'we', 'highlight', 'several', 'future', 'research', 'directions', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'survey', 'that', 'addresses', 'the', 'use', 'of', 'big', 'data', 'analytics', 'techniques', 'for', 'the', 'design', 'of', 'a', 'broad', 'range', 'of', 'networks']] | [-0.11887165648636944, 0.011812581166673403, -0.06506007947672755, 0.03485764817613812, -0.13896488973233864, -0.11240318872123248, 0.06056727819372517, 0.36472521638457395, -0.2892405157445152, -0.33362219408477023, 0.15149135508592687, -0.32524867078845765, -0.16611834477383272, 0.20766182438958258, -0.11503618248930862, 0.06282912605659818, 0.13877692657121704, -0.008351756622651954, -0.003752187275412408, -0.2769314792446663, 0.34301764001461044, 0.08522764225470232, 0.3675848884020178, 0.04581664871319612, 0.026839645499327255, -0.022134567281832006, -0.10147857153800809, -0.03358751462542682, -0.1283002249045838, 0.21753855099401626, 0.3673970174372954, 0.28494553947498724, 0.353336828904936, -0.46748833337322976, -0.19625792360826277, 0.10217382729928376, 0.14851957877686658, 0.086321246386803, -0.07718387243788472, -0.28308600495726643, 0.09698420176126296, -0.18110139584934815, -0.0944211139329568, -0.12240581860759767, 0.0025517369693072584, 0.01674210090690103, -0.24325541678152865, -0.0364288570202113, -0.004807683435879503, 0.07811858436370922, 0.0077341014938378605, -0.0798201492667053, 0.03848353545665257, 0.1928377280135748, 0.0423019923292679, 0.03130193844939546, 0.13956981218214354, -0.14605097066322786, -0.13340532003793043, 0.37387603359474314, -0.01950397273425811, -0.061837435297522336, 0.13766990057031475, -0.05691952896969659, -0.2063613715309456, 0.05613076050505768, 0.23846112410951148, 0.027124473863902192, -0.20785649741638967, 0.03800736705105332, 0.02526364584546133, 0.1710386910925325, -0.01011379407940521, -0.0018868004465757897, 0.21030071112065218, 0.2915513051776578, 0.06482283276550117, 0.09338252515999754, -0.08600119585715621, -0.10588618714233368, -0.2401381536695332, -0.14362582815528818, -0.16862041364097363, 0.011485089672032897, -0.12058080015343703, -0.11937162881612262, 0.38193949570705976, 0.22627199108780913, 0.21298892847393353, 0.021953028990096893, 0.3753840321054061, 0.005076469464965358, 0.12827935154843084, 0.09304139148081084, 0.17080559879863932, 0.030210815925449455, 0.2472350796376198, -0.10102216531263031, 0.06599022615983179, -0.06386549681328334] |
1,802.01416 | Conditioning of Finite Volume Element Method for Diffusion Problems with
General Simplicial Meshes | The conditioning of the linear finite volume element discretization for
general diffusion equations is studied on arbitrary simplicial meshes. The
condition number is defined as the ratio of the maximal singular value of the
stiffness matrix to the minimal eigenvalue of its symmetric part. This
definition is motivated by the fact that the convergence rate of the
generalized minimal residual method for the corresponding linear systems is
determined by the ratio. An upper bound for the ratio is established by
developing an upper bound for the maximal singular value and a lower bound for
the minimal eigenvalue of the symmetric part. It is shown that the bound
depends on three factors, the number of the elements in the mesh, the mesh
nonuniformity measured in the Euclidean metric, and the mesh nonuniformity
measured in the metric specified by the inverse diffusion matrix. It is also
shown that the diagonal scaling can effectively eliminates the effects from the
mesh nonuniformity measured in the Euclidean metric. Numerical results for a
selection of examples in one, two, and three dimensions are presented.
| math.NA | the conditioning of the linear finite volume element discretization for general diffusion equations is studied on arbitrary simplicial meshes the condition number is defined as the ratio of the maximal singular value of the stiffness matrix to the minimal eigenvalue of its symmetric part this definition is motivated by the fact that the convergence rate of the generalized minimal residual method for the corresponding linear systems is determined by the ratio an upper bound for the ratio is established by developing an upper bound for the maximal singular value and a lower bound for the minimal eigenvalue of the symmetric part it is shown that the bound depends on three factors the number of the elements in the mesh the mesh nonuniformity measured in the euclidean metric and the mesh nonuniformity measured in the metric specified by the inverse diffusion matrix it is also shown that the diagonal scaling can effectively eliminates the effects from the mesh nonuniformity measured in the euclidean metric numerical results for a selection of examples in one two and three dimensions are presented | [['the', 'conditioning', 'of', 'the', 'linear', 'finite', 'volume', 'element', 'discretization', 'for', 'general', 'diffusion', 'equations', 'is', 'studied', 'on', 'arbitrary', 'simplicial', 'meshes', 'the', 'condition', 'number', 'is', 'defined', 'as', 'the', 'ratio', 'of', 'the', 'maximal', 'singular', 'value', 'of', 'the', 'stiffness', 'matrix', 'to', 'the', 'minimal', 'eigenvalue', 'of', 'its', 'symmetric', 'part', 'this', 'definition', 'is', 'motivated', 'by', 'the', 'fact', 'that', 'the', 'convergence', 'rate', 'of', 'the', 'generalized', 'minimal', 'residual', 'method', 'for', 'the', 'corresponding', 'linear', 'systems', 'is', 'determined', 'by', 'the', 'ratio', 'an', 'upper', 'bound', 'for', 'the', 'ratio', 'is', 'established', 'by', 'developing', 'an', 'upper', 'bound', 'for', 'the', 'maximal', 'singular', 'value', 'and', 'a', 'lower', 'bound', 'for', 'the', 'minimal', 'eigenvalue', 'of', 'the', 'symmetric', 'part', 'it', 'is', 'shown', 'that', 'the', 'bound', 'depends', 'on', 'three', 'factors', 'the', 'number', 'of', 'the', 'elements', 'in', 'the', 'mesh', 'the', 'mesh', 'nonuniformity', 'measured', 'in', 'the', 'euclidean', 'metric', 'and', 'the', 'mesh', 'nonuniformity', 'measured', 'in', 'the', 'metric', 'specified', 'by', 'the', 'inverse', 'diffusion', 'matrix', 'it', 'is', 'also', 'shown', 'that', 'the', 'diagonal', 'scaling', 'can', 'effectively', 'eliminates', 'the', 'effects', 'from', 'the', 'mesh', 'nonuniformity', 'measured', 'in', 'the', 'euclidean', 'metric', 'numerical', 'results', 'for', 'a', 'selection', 'of', 'examples', 'in', 'one', 'two', 'and', 'three', 'dimensions', 'are', 'presented']] | [-0.12649090123347143, 0.1301740607362191, -0.03651539838527528, 0.04816762983322855, -0.0269365706533361, -0.08775870632537211, -0.0054866676755103, 0.2877281429429193, -0.2790914452530109, -0.27451395078593593, 0.13594169317407198, -0.26694668304656494, -0.1359374368016535, 0.17479684708242335, -0.060085379811568876, 0.09316237696696314, 0.03481397350329194, 0.07677388025887227, -0.0895591524385146, -0.24907694555546964, 0.3575058956316599, 0.06536920645648321, 0.31724372213272106, 0.09941719460374351, 0.11894999893533924, -0.03861134482306962, -0.05234815803450647, 0.05282081500823306, -0.13293815151394411, 0.1260208247119582, 0.20200970059383683, 0.09450914382704356, 0.231594889450902, -0.3659294718206766, -0.1880645023324014, 0.11842437025180526, 0.122741845814417, 0.06433940709704596, -0.028068988313218263, -0.24151118967179838, 0.11923565552046711, -0.12311390386596767, -0.1679196299597872, -0.004506886782375782, 0.03503517419350951, -0.0014910959125904555, -0.3066792189865635, 0.059649197048385984, 0.0875663602217153, 0.0286020858581518, -0.0590261504808807, -0.14989493170876078, -0.016972730404519465, 0.1034815353498365, 0.028558249776957954, -0.006181929461930072, 0.08052310659916381, -0.10019815801198102, -0.0527161746573624, 0.361644949227718, -0.06727963080106492, -0.3183112971128548, 0.10155482579734218, -0.13765763866014025, -0.04664164308060923, 0.12332073396354327, 0.14214041683655443, 0.14333740003103537, -0.11333704587291885, 0.14028574417644765, -0.06253182987965057, 0.13202827091438674, 0.07357817398269106, -0.002993637089960256, 0.0867945520315853, 0.1381339605857116, 0.1404146492596339, 0.13530128192989774, -0.06934595318626235, -0.10922885079229816, -0.3373419234393102, -0.14283158489257056, -0.24836425036466628, 0.02553435090374662, -0.20012480026515517, -0.18955788909545263, 0.368201728533493, 0.07806109156449105, 0.19710099242504664, 0.07078355299492022, 0.29387916729712255, 0.17446722196914738, 0.0756489901562755, 0.07346253124526127, 0.25059725874459393, 0.17062341336558542, 0.03415614105447122, -0.26496109429333525, 0.09432253711386009, 0.16889713334280662] |
1,802.01417 | Building machine learning force fields for nanoclusters | We assess Gaussian process (GP) regression as a technique to model
interatomic forces in metal nanoclusters by analysing the performance of
2-body, 3-body and many-body kernel functions on a set of 19-atom Ni cluster
structures. We find that 2-body GP kernels fail to provide faithful force
estimates, despite succeeding in bulk Ni systems. However, both 3- and
many-body kernels predict forces within a $\sim$0.1 eV/$\text{\AA}$ average
error even for small training datasets, and achieve high accuracy even on
out-of-sample, high temperature, structures. While training and testing on the
same structure always provides satisfactory accuracy, cross-testing on
dissimilar structures leads to higher prediction errors, posing an
extrapolation problem. This can be cured using heterogeneous training on
databases that contain more than one structure, which results in a good
trade-off between versatility and overall accuracy. Starting from a 3-body
kernel trained this way, we build an efficient non-parametric 3-body force
field that allows accurate prediction of structural properties at finite
temperatures, following a newly developed scheme [Glielmo et al. PRB 97, 184307
(2018)]. We use this to assess the thermal stability of Ni$_{19}$ nanoclusters
at a fractional cost of full ab initio calculations.
| physics.comp-ph | we assess gaussian process gp regression as a technique to model interatomic forces in metal nanoclusters by analysing the performance of 2body 3body and manybody kernel functions on a set of 19atom ni cluster structures we find that 2body gp kernels fail to provide faithful force estimates despite succeeding in bulk ni systems however both 3 and manybody kernels predict forces within a sim01 evtextaa average error even for small training datasets and achieve high accuracy even on outofsample high temperature structures while training and testing on the same structure always provides satisfactory accuracy crosstesting on dissimilar structures leads to higher prediction errors posing an extrapolation problem this can be cured using heterogeneous training on databases that contain more than one structure which results in a good tradeoff between versatility and overall accuracy starting from a 3body kernel trained this way we build an efficient nonparametric 3body force field that allows accurate prediction of structural properties at finite temperatures following a newly developed scheme glielmo et al prb 97 184307 2018 we use this to assess the thermal stability of ni_19 nanoclusters at a fractional cost of full ab initio calculations | [['we', 'assess', 'gaussian', 'process', 'gp', 'regression', 'as', 'a', 'technique', 'to', 'model', 'interatomic', 'forces', 'in', 'metal', 'nanoclusters', 'by', 'analysing', 'the', 'performance', 'of', '2body', '3body', 'and', 'manybody', 'kernel', 'functions', 'on', 'a', 'set', 'of', '19atom', 'ni', 'cluster', 'structures', 'we', 'find', 'that', '2body', 'gp', 'kernels', 'fail', 'to', 'provide', 'faithful', 'force', 'estimates', 'despite', 'succeeding', 'in', 'bulk', 'ni', 'systems', 'however', 'both', '3', 'and', 'manybody', 'kernels', 'predict', 'forces', 'within', 'a', 'sim01', 'evtextaa', 'average', 'error', 'even', 'for', 'small', 'training', 'datasets', 'and', 'achieve', 'high', 'accuracy', 'even', 'on', 'outofsample', 'high', 'temperature', 'structures', 'while', 'training', 'and', 'testing', 'on', 'the', 'same', 'structure', 'always', 'provides', 'satisfactory', 'accuracy', 'crosstesting', 'on', 'dissimilar', 'structures', 'leads', 'to', 'higher', 'prediction', 'errors', 'posing', 'an', 'extrapolation', 'problem', 'this', 'can', 'be', 'cured', 'using', 'heterogeneous', 'training', 'on', 'databases', 'that', 'contain', 'more', 'than', 'one', 'structure', 'which', 'results', 'in', 'a', 'good', 'tradeoff', 'between', 'versatility', 'and', 'overall', 'accuracy', 'starting', 'from', 'a', '3body', 'kernel', 'trained', 'this', 'way', 'we', 'build', 'an', 'efficient', 'nonparametric', '3body', 'force', 'field', 'that', 'allows', 'accurate', 'prediction', 'of', 'structural', 'properties', 'at', 'finite', 'temperatures', 'following', 'a', 'newly', 'developed', 'scheme', 'glielmo', 'et', 'al', 'prb', '97', '184307', '2018', 'we', 'use', 'this', 'to', 'assess', 'the', 'thermal', 'stability', 'of', 'ni_19', 'nanoclusters', 'at', 'a', 'fractional', 'cost', 'of', 'full', 'ab', 'initio', 'calculations']] | [-0.05938872321118676, 0.024751268297188437, -0.08401445903488107, 0.10683659828316956, -0.03904566322579175, -0.15051261179300177, 0.09834289407244305, 0.42613723309257545, -0.22297468022820918, -0.34322625898529546, 0.026401499380055513, -0.27377504602812447, -0.12184359846712166, 0.19607039998864403, -0.0514124713196243, 0.08940666420888659, 0.13471547491043, -0.02894236861013908, -0.11214009389136541, -0.28042679171304447, 0.25611408226808685, 0.0941660814843065, 0.26724134772210506, 0.047389817338537525, 0.08211259515515554, -0.010757546334502262, 0.028436938621657522, 0.01648010926673541, -0.11071178451038086, 0.13343165351795283, 0.24860240368399064, 0.05590846174321062, 0.3076355472081215, -0.4392758447525872, -0.21374041651551787, 0.0726253388374037, 0.11080661037861295, 0.1375017995581918, -0.015457724174877906, -0.2760542046115104, 0.07724826094769949, -0.18209144346214629, -0.08846342440795255, -0.16727619253073794, 0.015107947442605085, -0.01698373288287454, -0.3070790471362793, 0.1225660223035595, 0.04950904812336572, 0.08427093654357344, -0.0811817097531103, -0.136105992716133, 0.002045870236297314, 0.09597899854038465, -0.03530517805295342, 0.047216231053116155, 0.14132042356540223, -0.12585073204560054, -0.10600413839030709, 0.38408028986305, -0.06775981728907839, -0.17652011452796493, 0.2305404881846059, -0.10839031544337804, -0.11252912709590149, 0.16626448136552968, 0.21737399218176065, 0.06874938897184424, -0.17103232249076403, 0.05924713991525759, 0.03372639126672938, 0.21154163137355164, 0.06410998351041328, -0.020744082784733258, 0.1508200689363671, 0.21291161959839833, 0.03028779402878639, 0.08873669844989136, -0.09129767762497068, -0.07533498814084089, -0.22051215664659804, -0.11391426636735166, -0.20207238312105874, 0.023563761853713644, -0.1270120638670444, -0.1873806872014963, 0.3493206252967522, 0.18731895415615793, 0.2002584887769174, 0.0932586060729935, 0.28271984596849997, 0.056283324238343944, 0.05681562114104226, 0.08527460025774466, 0.220121063276924, 0.10245813290034798, 0.03205828668323119, -0.23184892866080878, 0.08060653328618689, 0.03306613922924609] |
1,802.01418 | Keplerian shear in ergodic theory | Many integrable physical systems exhibit Keplerian shear. We look at this
phenomenon from the point of view of ergodic theory, where it can be seen as
mixing conditionally to an invariant $\sigma$-algebra. In this context, we give
a sufficient criterion for Keplerian shear to appear in a system, investigate
its genericity and, in a few cases, its speed. Some additional,
non-Hamiltonian, examples are discussed.
| math.DS | many integrable physical systems exhibit keplerian shear we look at this phenomenon from the point of view of ergodic theory where it can be seen as mixing conditionally to an invariant sigmaalgebra in this context we give a sufficient criterion for keplerian shear to appear in a system investigate its genericity and in a few cases its speed some additional nonhamiltonian examples are discussed | [['many', 'integrable', 'physical', 'systems', 'exhibit', 'keplerian', 'shear', 'we', 'look', 'at', 'this', 'phenomenon', 'from', 'the', 'point', 'of', 'view', 'of', 'ergodic', 'theory', 'where', 'it', 'can', 'be', 'seen', 'as', 'mixing', 'conditionally', 'to', 'an', 'invariant', 'sigmaalgebra', 'in', 'this', 'context', 'we', 'give', 'a', 'sufficient', 'criterion', 'for', 'keplerian', 'shear', 'to', 'appear', 'in', 'a', 'system', 'investigate', 'its', 'genericity', 'and', 'in', 'a', 'few', 'cases', 'its', 'speed', 'some', 'additional', 'nonhamiltonian', 'examples', 'are', 'discussed']] | [-0.17918796992307762, 0.1207488423626728, -0.11814931478147628, 0.10448511600770871, -0.04103839938034071, -0.169394302276487, 0.017924253827004577, 0.3626015777408611, -0.33125287778239, -0.21511604593979428, 0.15285868086539267, -0.21151291720889276, -0.18017005870933644, 0.2179332207160769, -0.11443740170216188, 0.07511074012836616, 0.05198672790356795, 0.07552210703943274, -0.07052277207549196, -0.22947786588338204, 0.28987659581616754, -0.002274764972298726, 0.1665189772102167, 0.029897626573074376, 0.09934238856646971, -0.06891328637811966, -0.01219180667612818, 0.029416477000467012, -0.17749083936359966, 0.021777855115942657, 0.26542259339476004, 0.11842046567471698, 0.24244728055782616, -0.360798709501978, -0.22868578494671965, 0.11581015393312555, 0.13110521946509834, 0.1189286487933714, -0.025141487742075697, -0.26516250328859314, 0.08463863280485384, -0.18955407722387463, -0.19352329187677242, -0.11102113316883333, 0.009171909361612052, 0.002492942236131057, -0.24731671262998134, 0.08862029411830008, 0.14758510229876265, 0.135135134216398, -0.05275880969929858, -0.04674604512365477, -0.02627897711499827, 0.07544179275282659, 0.08156905610667309, 0.01505686129530659, 0.1376257398078451, -0.09679305311146891, -0.07541917990602087, 0.4332736337382812, -0.04331130802711414, -0.2369999057852965, 0.2461195444702753, -0.1806760991748888, -0.20190191196161322, 0.12191808211355237, 0.19183546851490973, 0.07767781127768103, -0.15918177914863918, 0.06545846137942135, -0.089213569968706, 0.09031222146722939, 0.08312728285818594, 0.07846061560849193, 0.2626524514926132, 0.1238524635846261, 0.09494128457026818, 0.15224792928893294, -0.04712529093376361, -0.10226319409412099, -0.35040286781077157, -0.1292180198506685, -0.1301899402824347, 0.09913873583718669, -0.0737303541534402, -0.17052698141196743, 0.36227296898141503, 0.15949613608972868, 0.22810102135917987, 0.04883826945660985, 0.21451830572914332, 0.12756984323004872, -0.003598941897507757, 0.0778323393460596, 0.25769289591198685, 0.1487147260340862, 0.09681761127285426, -0.12871544873269158, 0.028298496376919502, 0.056046237357804785] |
1,802.01419 | Exponential functions of finite posets and the number of extensions with
a fixed set of minimal points | We establish formulas for the number of all downsets (or equivalently, of all
antichains) of a finite poset P. Then, using these numbers, we determine
recursively and explicitly the number of all posets having a fixed set of
minimal points and inducing the poset P on the non- minimal points. It turns
out that these counting functions are closely related to a collection of
downset numbers of certain subposets. Since any function of that kind is an
exponential sum (with the number of minimal points as exponent), we call it the
exponential function of the poset. Some linear equations, divisibility
relations, upper and lower bounds, and asymptotical equalities for the counting
functions are deduced. A list of all such exponential functions for posets with
up to five points concludes the paper.
| math.CO | we establish formulas for the number of all downsets or equivalently of all antichains of a finite poset p then using these numbers we determine recursively and explicitly the number of all posets having a fixed set of minimal points and inducing the poset p on the non minimal points it turns out that these counting functions are closely related to a collection of downset numbers of certain subposets since any function of that kind is an exponential sum with the number of minimal points as exponent we call it the exponential function of the poset some linear equations divisibility relations upper and lower bounds and asymptotical equalities for the counting functions are deduced a list of all such exponential functions for posets with up to five points concludes the paper | [['we', 'establish', 'formulas', 'for', 'the', 'number', 'of', 'all', 'downsets', 'or', 'equivalently', 'of', 'all', 'antichains', 'of', 'a', 'finite', 'poset', 'p', 'then', 'using', 'these', 'numbers', 'we', 'determine', 'recursively', 'and', 'explicitly', 'the', 'number', 'of', 'all', 'posets', 'having', 'a', 'fixed', 'set', 'of', 'minimal', 'points', 'and', 'inducing', 'the', 'poset', 'p', 'on', 'the', 'non', 'minimal', 'points', 'it', 'turns', 'out', 'that', 'these', 'counting', 'functions', 'are', 'closely', 'related', 'to', 'a', 'collection', 'of', 'downset', 'numbers', 'of', 'certain', 'subposets', 'since', 'any', 'function', 'of', 'that', 'kind', 'is', 'an', 'exponential', 'sum', 'with', 'the', 'number', 'of', 'minimal', 'points', 'as', 'exponent', 'we', 'call', 'it', 'the', 'exponential', 'function', 'of', 'the', 'poset', 'some', 'linear', 'equations', 'divisibility', 'relations', 'upper', 'and', 'lower', 'bounds', 'and', 'asymptotical', 'equalities', 'for', 'the', 'counting', 'functions', 'are', 'deduced', 'a', 'list', 'of', 'all', 'such', 'exponential', 'functions', 'for', 'posets', 'with', 'up', 'to', 'five', 'points', 'concludes', 'the', 'paper']] | [-0.17692700855945812, 0.1396646925759411, -0.04965213897985936, 0.0946999712045596, -0.07735316221867083, -0.10545300211728985, 0.10820623195129411, 0.2794764946812039, -0.3257104897345523, -0.2785955790802659, 0.10447878560108197, -0.3082661398949514, -0.1249626925631021, 0.21873630238483652, -0.051730498052464324, 0.09064384496625058, 0.002001413169053902, 0.09318223524525876, -0.08307832155646827, -0.31955381716025694, 0.3654474544957394, -0.047273992092920936, 0.20135950491912946, 0.04444402320050983, 0.09775150627011561, 0.011427871851812167, -0.017454486615770988, 0.04306299077659732, -0.18847097501299567, 0.10013133373363868, 0.24533041819524845, 0.15235091660541433, 0.23601073903948752, -0.3634080449830144, -0.09061865070088276, 0.24265075317861243, 0.12766368931713906, 0.0383348832607184, 0.034598707028607775, -0.1767705986062989, 0.14870554937017755, -0.15366686158280335, -0.15332126698833498, -0.07382745370411008, 0.047294069672508154, 0.1138562778409087, -0.28080320769195793, -0.040674267715298154, 0.1033058112188605, 0.11389278181991185, -0.022197243425184646, -0.17242890772345754, -0.036513281778169385, 0.09065528946416808, 0.019156477857960517, -0.00982556805434061, 0.028650789806007885, -0.09468513548032928, -0.13392086943854997, 0.3468110303017702, 0.016519838314901555, -0.2521143721572998, 0.12351615405250482, -0.1865592962699651, -0.15596914226509176, 0.14453855537958726, 0.08307914183482186, 0.1285047768010893, -0.09663837167384629, 0.1197143427739702, -0.15535374064680957, 0.09694549764101287, 0.15636198164340648, 0.057346510142798866, 0.15710023601489667, 0.05999372474394227, 0.10682191994780575, 0.19142193789416143, 0.014127533891743035, -0.05618148491156238, -0.3901660518848714, -0.13862147112199255, -0.16780347083801872, 0.05987841510462738, -0.16144029067727944, -0.237903117272427, 0.37617510732064263, 0.07080500005595101, 0.22531723663680084, 0.16448066637047942, 0.1891239256036418, 0.15132536495094212, 0.05854088206818142, 0.05279652286061656, 0.08441798013874031, 0.14289824067764267, -0.0629363760231276, -0.1534089355263859, 0.05437339094773162, 0.18934559923745975] |
1,802.0142 | Experimental realization of noise-induced adiabaticity in nuclear
magnetic resonance | The adiabatic evolution is the dynamics of an instantaneous eigenstate of a
slowly varing Hamiltonian. Recently, an interesting phenomenon shows up that
white noises can enhance and even induce adiabaticity, which is in contrast to
previous perception that environmental noises always modify and even ruin a
designed adiabatic passage. We experimentally realized a noise-induced
adiabaticity in a nuclear magnetic resonance system. Adiabatic Hadamard gate
and entangled state are demonstrated. The effect of noise on adiabaticity is
experimentally exhibited and compared with the noise-free process. We utilized
a noise-injected method, which can be applied to other quantum systems.
| quant-ph | the adiabatic evolution is the dynamics of an instantaneous eigenstate of a slowly varing hamiltonian recently an interesting phenomenon shows up that white noises can enhance and even induce adiabaticity which is in contrast to previous perception that environmental noises always modify and even ruin a designed adiabatic passage we experimentally realized a noiseinduced adiabaticity in a nuclear magnetic resonance system adiabatic hadamard gate and entangled state are demonstrated the effect of noise on adiabaticity is experimentally exhibited and compared with the noisefree process we utilized a noiseinjected method which can be applied to other quantum systems | [['the', 'adiabatic', 'evolution', 'is', 'the', 'dynamics', 'of', 'an', 'instantaneous', 'eigenstate', 'of', 'a', 'slowly', 'varing', 'hamiltonian', 'recently', 'an', 'interesting', 'phenomenon', 'shows', 'up', 'that', 'white', 'noises', 'can', 'enhance', 'and', 'even', 'induce', 'adiabaticity', 'which', 'is', 'in', 'contrast', 'to', 'previous', 'perception', 'that', 'environmental', 'noises', 'always', 'modify', 'and', 'even', 'ruin', 'a', 'designed', 'adiabatic', 'passage', 'we', 'experimentally', 'realized', 'a', 'noiseinduced', 'adiabaticity', 'in', 'a', 'nuclear', 'magnetic', 'resonance', 'system', 'adiabatic', 'hadamard', 'gate', 'and', 'entangled', 'state', 'are', 'demonstrated', 'the', 'effect', 'of', 'noise', 'on', 'adiabaticity', 'is', 'experimentally', 'exhibited', 'and', 'compared', 'with', 'the', 'noisefree', 'process', 'we', 'utilized', 'a', 'noiseinjected', 'method', 'which', 'can', 'be', 'applied', 'to', 'other', 'quantum', 'systems']] | [-0.1547616873115961, 0.21557593258603447, -0.12265707631983484, 0.09354338254776924, -0.0007527989995044967, -0.19900903619418386, 0.05275282195361797, 0.40443073709805805, -0.2681425247283187, -0.2724699466683281, 0.0718001157171481, -0.20447058110342672, -0.18512443573126802, 0.21863692580761077, -0.09009507470182143, 0.11508011613235188, 0.0628006717209549, 0.03597062996110859, -0.04535449913237244, -0.23556079085877477, 0.26278811336184543, 0.060277019179011404, 0.27844442283579457, 0.011006588169645207, 0.0927528996350399, -0.04408126801960558, 0.07271811754132311, -0.012794559365526462, -0.057467880101739865, -0.008334967317447687, 0.20097370359386937, 0.04222653224618019, 0.25810711927867186, -0.4388692349699947, -0.2397953801167508, 0.13862876376758018, 0.14704426841732735, 0.18765212377911666, -0.06895966003260885, -0.3492135420674458, 0.01691327957936058, -0.19782897181964168, -0.10505970863353771, -0.13596299025812186, 0.012583766326618692, -0.024434379699717585, -0.3051577770068737, 0.09556940726664227, 0.1247700179349825, 0.0028691877669189125, -0.0065145205771841574, -0.0025577375818102155, 0.030317327119216014, 0.09704748474662968, -0.020649460185874585, 0.02091694388460989, 0.22289058119834712, -0.08998453977013317, -0.13790570952308676, 0.33512239975546737, -0.10312947263203871, -0.169584729007056, 0.18273456871490149, -0.12139842321630567, -0.049338298117315084, 0.1272158749246349, 0.11501314472116064, 0.08619923865383801, -0.15112855176751813, 0.06319421686202986, 0.055612666212255135, 0.18340929112552354, 0.06640136904024985, 0.05445868811026836, 0.15644821821964192, 0.1346227876492776, 0.09028597815449757, 0.17770164900321106, -0.08124699259496992, -0.1462690525125557, -0.22228638239903376, -0.10690651518719581, -0.22398733125858902, 0.1234704368397009, -0.03162587536705056, -0.12232348587713204, 0.41903072318139795, 0.20324739031881714, 0.1711070433666464, -0.0507949589373311, 0.2848754698061384, 0.17913364532675283, 0.02455494996199074, 0.061778804816034004, 0.28678003725750995, 0.16147945846266035, 0.09493592132639606, -0.31670905338736094, 0.08618406632740516, -0.029780143571163837] |
1,802.01421 | First-order Adversarial Vulnerability of Neural Networks and Input
Dimension | Over the past few years, neural networks were proven vulnerable to
adversarial images: targeted but imperceptible image perturbations lead to
drastically different predictions. We show that adversarial vulnerability
increases with the gradients of the training objective when viewed as a
function of the inputs. Surprisingly, vulnerability does not depend on network
topology: for many standard network architectures, we prove that at
initialization, the $\ell_1$-norm of these gradients grows as the square root
of the input dimension, leaving the networks increasingly vulnerable with
growing image size. We empirically show that this dimension dependence persists
after either usual or robust training, but gets attenuated with higher
regularization.
| stat.ML cs.CV cs.LG | over the past few years neural networks were proven vulnerable to adversarial images targeted but imperceptible image perturbations lead to drastically different predictions we show that adversarial vulnerability increases with the gradients of the training objective when viewed as a function of the inputs surprisingly vulnerability does not depend on network topology for many standard network architectures we prove that at initialization the ell_1norm of these gradients grows as the square root of the input dimension leaving the networks increasingly vulnerable with growing image size we empirically show that this dimension dependence persists after either usual or robust training but gets attenuated with higher regularization | [['over', 'the', 'past', 'few', 'years', 'neural', 'networks', 'were', 'proven', 'vulnerable', 'to', 'adversarial', 'images', 'targeted', 'but', 'imperceptible', 'image', 'perturbations', 'lead', 'to', 'drastically', 'different', 'predictions', 'we', 'show', 'that', 'adversarial', 'vulnerability', 'increases', 'with', 'the', 'gradients', 'of', 'the', 'training', 'objective', 'when', 'viewed', 'as', 'a', 'function', 'of', 'the', 'inputs', 'surprisingly', 'vulnerability', 'does', 'not', 'depend', 'on', 'network', 'topology', 'for', 'many', 'standard', 'network', 'architectures', 'we', 'prove', 'that', 'at', 'initialization', 'the', 'ell_1norm', 'of', 'these', 'gradients', 'grows', 'as', 'the', 'square', 'root', 'of', 'the', 'input', 'dimension', 'leaving', 'the', 'networks', 'increasingly', 'vulnerable', 'with', 'growing', 'image', 'size', 'we', 'empirically', 'show', 'that', 'this', 'dimension', 'dependence', 'persists', 'after', 'either', 'usual', 'or', 'robust', 'training', 'but', 'gets', 'attenuated', 'with', 'higher', 'regularization']] | [-0.0927427953419586, 0.08398862946778536, -0.021315996885477077, 0.09760427472647279, -0.06657896911991494, -0.21541895914512377, 0.010547984369276535, 0.42657972277291784, -0.2959473294871194, -0.2990414640023595, 0.11773073033740124, -0.277928149150241, -0.22528546466492116, 0.1611094568301702, -0.1507638721682486, 0.07869026010323849, 0.09461608744625534, 0.06902770647069528, -0.07974121399179455, -0.36992153753304763, 0.3323091059546208, 0.053940361738204955, 0.3191349241258909, 0.0036113880020344543, 0.09631290112378164, -0.028903829468236792, 0.0015620624513498374, 0.04385114290662819, -0.02048791317550543, 0.07104342640599325, 0.24339128923865722, 0.1652703640184232, 0.35852898862212895, -0.46450813474754493, -0.24570343689549537, 0.15696216655806416, 0.1668409884508167, 0.14489943234116903, -0.025516807770223488, -0.28197374066470987, 0.1232771819595655, -0.16187076035532214, -0.06780814240087889, -0.12279586709614489, -0.00564997099849972, 0.00202492999711207, -0.2714952735817947, 0.054818516552803065, 0.07906333137126197, 0.06969562115458151, -0.01729020263024029, -0.13225495076427857, -0.07314721058521952, 0.13230786425466207, 0.09280827079145682, 0.07502324634808161, 0.2000600344767528, -0.18694924107043162, -0.06624320176474395, 0.2966369229501912, -0.04944946355230752, -0.18754683077512752, 0.19399248068886144, -0.07891506814353523, -0.11680485860450149, 0.1197333439341968, 0.2186557987837919, 0.0862026566151707, -0.05973938749507181, 0.012730294492627893, 0.009311520982356299, 0.20806282740529805, 0.0914233429579153, 0.04745861051958941, 0.11893243878813727, 0.18298200141649604, 0.12278779758461973, 0.16836869241226288, -0.1258169152529999, -0.06338426333275579, -0.21111176734169323, -0.026008139102764075, -0.20240802639385774, 0.069976085180644, -0.13268502018902273, -0.21016427142811672, 0.3812618046998978, 0.2068239153318462, 0.2697717660860646, 0.1526512316694217, 0.3453993020135732, 0.037899635243783925, 0.19271443073549085, 0.12003974288125478, 0.24371814924247917, 0.03479634773518358, 0.10072267072253106, -0.12387909249934767, 0.15882843409531883, 0.006209638617223217] |
1,802.01422 | Semiclassical approximation of the Wheeler-DeWitt equation: arbitrary
orders and the question of unitarity | We extend the Born-Oppenheimer type of approximation scheme for the
Wheeler-DeWitt equation of canonical quantum gravity to arbitrary orders in the
inverse Planck mass squared. We discuss in detail the origin of unitarity
violation in this scheme and show that unitarity can be restored by an
appropriate modification which requires back reaction from matter onto the
gravitational sector. In our analysis, we heavily rely on the gauge aspects of
the standard Born-Oppenheimer scheme in molecular physics.
| gr-qc quant-ph | we extend the bornoppenheimer type of approximation scheme for the wheelerdewitt equation of canonical quantum gravity to arbitrary orders in the inverse planck mass squared we discuss in detail the origin of unitarity violation in this scheme and show that unitarity can be restored by an appropriate modification which requires back reaction from matter onto the gravitational sector in our analysis we heavily rely on the gauge aspects of the standard bornoppenheimer scheme in molecular physics | [['we', 'extend', 'the', 'bornoppenheimer', 'type', 'of', 'approximation', 'scheme', 'for', 'the', 'wheelerdewitt', 'equation', 'of', 'canonical', 'quantum', 'gravity', 'to', 'arbitrary', 'orders', 'in', 'the', 'inverse', 'planck', 'mass', 'squared', 'we', 'discuss', 'in', 'detail', 'the', 'origin', 'of', 'unitarity', 'violation', 'in', 'this', 'scheme', 'and', 'show', 'that', 'unitarity', 'can', 'be', 'restored', 'by', 'an', 'appropriate', 'modification', 'which', 'requires', 'back', 'reaction', 'from', 'matter', 'onto', 'the', 'gravitational', 'sector', 'in', 'our', 'analysis', 'we', 'heavily', 'rely', 'on', 'the', 'gauge', 'aspects', 'of', 'the', 'standard', 'bornoppenheimer', 'scheme', 'in', 'molecular', 'physics']] | [-0.09042276640416515, 0.1119144511806218, -0.128303038535753, 0.10718032848059297, -0.04699006541877201, -0.09966307559883908, 0.05921453546034172, 0.2863641107258828, -0.25892247240010063, -0.26496475486476956, 0.03538136598868541, -0.21998277691339976, -0.12009101777067899, 0.15037450392877585, -0.028250076955086308, 0.06286714321590568, 0.015313405568074239, -0.002361585042978588, -0.13495535639690628, -0.2447258911071051, 0.35404473068927855, 0.06564764789225974, 0.25161972879677225, 0.09291946333465412, 0.08658561429719587, 0.011166859448789373, -0.02150879352733395, -0.05244898009359052, -0.1323250403883752, 0.07909898357588406, 0.17944462708271058, 0.1208831965004241, 0.18378222421252807, -0.47604931019994084, -0.22982024662441722, 0.08016488924132366, 0.1391711708427848, 0.19011415431956075, -0.029906752747544823, -0.3116542226757462, 0.02510587413972213, -0.1699541668701721, -0.17882397548007584, -0.09044169382449534, -0.07829462728267045, -0.06635204822707333, -0.22284305269682878, 0.12858455234795416, 0.012971638848907069, -0.012251223204657435, -0.022969841926456673, -0.08593223685104596, 0.050067026771629525, 0.014998443106091336, 0.05620312575544966, 0.019697192561962812, 0.15681066096907384, -0.14354337722148844, -0.0941943688146574, 0.46151064201503206, -0.09808315336091541, -0.23447855868327774, 0.12553008023257317, -0.1560028374354404, -0.1668274075246269, 0.0934945016021007, 0.13000881742980136, 0.09168626826967259, -0.156191255419368, 0.2102797433456688, 0.004993810526732551, 0.15655082355155364, 0.08305554905918573, 0.032681415954261626, 0.19647144152488755, 0.11588685889728367, 0.04125251870381793, 0.07824668725554243, -0.05032852152362466, -0.1730335666185343, -0.3967848366224452, -0.15131614742016322, -0.1653617278329636, 0.09014833098013983, -0.11745553458776588, -0.08939619875807119, 0.3428501368973325, 0.1717260492855291, 0.15297947822775887, -0.0071086745791896985, 0.3101783226562762, 0.12267328613425459, 0.06287731156733475, 0.05907083085836157, 0.31615510592727286, 0.13957479852558063, 0.06568804840667565, -0.3094714555098969, -0.037603869372488635, 0.14803084363474658] |
1,802.01423 | Remarks on the self-shrinking Clifford torus | On the one hand, we prove that the Clifford torus in $\mathbb{C}^2$ is
unstable for Lagrangian mean curvature flow under arbitrarily small Hamiltonian
perturbations, even though it is Hamiltonian $F$-stable and locally area
minimising under Hamiltonian variations. On the other hand, we show that the
Clifford torus is rigid: it is locally unique as a self-shrinker for mean
curvature flow, despite having infinitesimal deformations which do not arise
from rigid motions. The proofs rely on analysing higher order phenomena:
specifically, showing that the Clifford torus is not a local entropy minimiser
even under Hamiltonian variations, and demonstrating that infinitesimal
deformations which do not generate rigid motions are genuinely obstructed.
| math.DG math.AP math.SG | on the one hand we prove that the clifford torus in mathbbc2 is unstable for lagrangian mean curvature flow under arbitrarily small hamiltonian perturbations even though it is hamiltonian fstable and locally area minimising under hamiltonian variations on the other hand we show that the clifford torus is rigid it is locally unique as a selfshrinker for mean curvature flow despite having infinitesimal deformations which do not arise from rigid motions the proofs rely on analysing higher order phenomena specifically showing that the clifford torus is not a local entropy minimiser even under hamiltonian variations and demonstrating that infinitesimal deformations which do not generate rigid motions are genuinely obstructed | [['on', 'the', 'one', 'hand', 'we', 'prove', 'that', 'the', 'clifford', 'torus', 'in', 'mathbbc2', 'is', 'unstable', 'for', 'lagrangian', 'mean', 'curvature', 'flow', 'under', 'arbitrarily', 'small', 'hamiltonian', 'perturbations', 'even', 'though', 'it', 'is', 'hamiltonian', 'fstable', 'and', 'locally', 'area', 'minimising', 'under', 'hamiltonian', 'variations', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'the', 'clifford', 'torus', 'is', 'rigid', 'it', 'is', 'locally', 'unique', 'as', 'a', 'selfshrinker', 'for', 'mean', 'curvature', 'flow', 'despite', 'having', 'infinitesimal', 'deformations', 'which', 'do', 'not', 'arise', 'from', 'rigid', 'motions', 'the', 'proofs', 'rely', 'on', 'analysing', 'higher', 'order', 'phenomena', 'specifically', 'showing', 'that', 'the', 'clifford', 'torus', 'is', 'not', 'a', 'local', 'entropy', 'minimiser', 'even', 'under', 'hamiltonian', 'variations', 'and', 'demonstrating', 'that', 'infinitesimal', 'deformations', 'which', 'do', 'not', 'generate', 'rigid', 'motions', 'are', 'genuinely', 'obstructed']] | [-0.19520025046429076, 0.1697733802635462, -0.0996555327993194, 0.09616290064584122, -0.09197461642666695, -0.17135537069701, -0.08085915984996005, 0.401770177818493, -0.267072293104245, -0.20844846015471383, 0.15917749692944366, -0.24134152785473323, -0.17793001923197455, 0.21451375091986713, -0.17017987955397917, 0.02071270406451247, 0.10281712584060813, 0.08114496609965048, -0.07117441257273932, -0.2364499051670689, 0.3429132060686109, -0.03932786948227007, 0.22231354694300837, 0.038079498581900136, 0.12187224288616295, -0.00048608560576488116, 0.0451325271214538, 0.08911302647288513, -0.11576584796901844, 0.10214380933176898, 0.18168379270528773, 0.005300489147492779, 0.1804250955513311, -0.4293415949192889, -0.24485858736576838, 0.15847817169280226, 0.10346869288499408, 0.10558780725114048, 0.011646778403659599, -0.26040932754857826, 0.09656777524244074, -0.11019699545064514, -0.1641236512725233, -0.14645411549007878, 0.048115194322319206, -0.024323023766505643, -0.18988626337088987, 0.08919560819556681, 0.16050413372251418, 0.11886027166534455, -0.08348036594710254, -0.018612600606652575, -0.11770351302015399, 0.09663510362728747, 0.044351464759028694, 0.03471867006203724, 0.20295132058373558, -0.07830964725671781, -0.0472891841643413, 0.41721711881937235, -0.05491180363038572, -0.33169839206715585, 0.16161771714922313, -0.15033228433084325, -0.16900390974425394, 0.15043198999974433, 0.10451278401487464, 0.13741359126341846, -0.0718879113913676, 0.15079957406878164, -0.0662074177397774, 0.15129046459947157, 0.08093622730993623, -0.0040667021664184165, 0.15348253488848243, 0.021475096523693397, 0.2020875397052855, 0.08236518049443893, -0.03963481560733955, -0.1600126614196038, -0.36077229728187443, -0.1174503489810794, -0.17405446546703338, 0.1508819326738893, -0.08243082820009569, -0.21484259224214822, 0.35079352954112064, 0.07193728547474933, 0.17891980949874728, 0.10037304154183894, 0.26191162958809544, 0.07582594007317729, 0.08965186614739717, 0.16167615747523553, 0.2549033899782994, 0.1189022667646203, -0.01655939004785561, -0.16764390891751085, 0.02376226562186392, 0.13952282258659737] |
1,802.01424 | Can Common Crawl reliably track persistent identifier (PID) use over
time? | We report here on the results of two studies using two and four monthly web
crawls respectively from the Common Crawl (CC) initiative between 2014 and
2017, whose initial goal was to provide empirical evidence for the changing
patterns of use of so-called persistent identifiers. This paper focusses on the
tooling needed for dealing with CC data, and the problems we found with it. The
first study is based on over $10^{12}$ URIs from over $5 * 10^9$ pages crawled
in April 2014 and April 2017, the second study adds a further $3 * 10^9$ pages
from the April 2015 and April 2016 crawls. We conclude with suggestions on
specific actions needed to enable studies based on CC to give reliable
longitudinal information.
| cs.DL cs.NI | we report here on the results of two studies using two and four monthly web crawls respectively from the common crawl cc initiative between 2014 and 2017 whose initial goal was to provide empirical evidence for the changing patterns of use of socalled persistent identifiers this paper focusses on the tooling needed for dealing with cc data and the problems we found with it the first study is based on over 1012 uris from over 5 109 pages crawled in april 2014 and april 2017 the second study adds a further 3 109 pages from the april 2015 and april 2016 crawls we conclude with suggestions on specific actions needed to enable studies based on cc to give reliable longitudinal information | [['we', 'report', 'here', 'on', 'the', 'results', 'of', 'two', 'studies', 'using', 'two', 'and', 'four', 'monthly', 'web', 'crawls', 'respectively', 'from', 'the', 'common', 'crawl', 'cc', 'initiative', 'between', '2014', 'and', '2017', 'whose', 'initial', 'goal', 'was', 'to', 'provide', 'empirical', 'evidence', 'for', 'the', 'changing', 'patterns', 'of', 'use', 'of', 'socalled', 'persistent', 'identifiers', 'this', 'paper', 'focusses', 'on', 'the', 'tooling', 'needed', 'for', 'dealing', 'with', 'cc', 'data', 'and', 'the', 'problems', 'we', 'found', 'with', 'it', 'the', 'first', 'study', 'is', 'based', 'on', 'over', '1012', 'uris', 'from', 'over', '5', '109', 'pages', 'crawled', 'in', 'april', '2014', 'and', 'april', '2017', 'the', 'second', 'study', 'adds', 'a', 'further', '3', '109', 'pages', 'from', 'the', 'april', '2015', 'and', 'april', '2016', 'crawls', 'we', 'conclude', 'with', 'suggestions', 'on', 'specific', 'actions', 'needed', 'to', 'enable', 'studies', 'based', 'on', 'cc', 'to', 'give', 'reliable', 'longitudinal', 'information']] | [-0.060747385127008086, 0.05212490084727318, -0.0543435274908119, 0.025152701830629967, -0.0971352002845138, -0.05980477567130992, 0.1255785239002213, 0.37467520432315826, -0.1547796138569959, -0.4171057934661142, 0.15958323946880745, -0.3324878955921851, -0.14430538095795542, 0.22648770831263632, -0.06940911545933894, -0.013638119274858107, 0.11029668670717227, -0.007200674663542208, -0.03938800482125568, -0.3358697042731214, 0.28746061583871235, 0.07653875086429598, 0.28916653979585066, 0.078053808597894, 0.0822301252623866, 0.018861786065977222, -0.17499022575264628, -0.05690921800719066, -0.16799737769756312, 0.14845820121113057, 0.228496394218292, 0.17334825401232878, 0.2524578812847699, -0.44176974250696416, -0.09036634175861177, 0.03888866415031809, 0.04288267557103233, 0.061912493330949905, -0.006823126022696249, -0.3257665794288878, 0.09310382248233419, -0.18620173780109026, -0.018714959379131636, -0.0034176300372158693, 0.08543981365428484, 0.03855449346101974, -0.23686272387723784, 0.08020543940519252, -0.002611719899279766, 0.12092427178940252, -0.061172994669557605, -0.09096721681758516, 0.00930690515617078, 0.15586209299874085, 0.04237861459312791, 0.06842507073590301, 0.06986243546409301, -0.033914011812668815, -0.1809631391882527, 0.3609666307726182, -0.04118783571680407, -0.055940933525562286, 0.22314894503013286, -0.08813952980178201, -0.19509911121154003, 0.08469348219954524, 0.2366288547176331, 0.10301055445158777, -0.16452568240871668, 0.03604309528456108, -0.049570617227514914, 0.2329144310975863, 0.06236461609840578, -0.05456564234461912, 0.1971666330071397, 0.16024786686478568, 0.021301261792036372, 0.11303332274633436, -0.1203907802758723, -0.05227892075699931, -0.266014703918895, -0.12889209225935447, -0.12269973299612315, 0.05327546301928988, -0.020050756763527362, -0.08571305403039475, 0.4139711936658695, 0.1976540384395986, 0.19743728087945603, 0.006583769843732738, 0.22253762628913912, 0.0064392648175481924, 0.029561911900585502, 0.14614251766677114, 0.22659431005373967, 0.054058817099810634, 0.2006687425973648, -0.09981673133144855, 0.034676007172169766, 0.021826641253111036] |
1,802.01425 | SDN based Control and Management of WLANs in the 3GPP 5G Network | The exponential growth in mobile broadband usage [1] has catalyzed the need
for high data rate communication systems. In this regard, activities for
standardizing the next generation mobile broadband system, known as the Fifth
Generation(5G) system are underway. The 5G system also enables the integration
of Institute of Electrical and Electronic Engineers (IEEE) Wireless Local Area
Networks (WLANs) for providing cost-effective broadband connectivity. It is
therefore imperative to find solutions for control and management of WLANs,
while providing seamless inter-working capabilities with the cellular network.
In this paper, we propose a novel Software Defined Networking (SDN) based
architecture for efficient control and management of IEEE WLANs while providing
a mechanism for smooth integration of WLANs within the 5G system.
| cs.NI | the exponential growth in mobile broadband usage 1 has catalyzed the need for high data rate communication systems in this regard activities for standardizing the next generation mobile broadband system known as the fifth generation5g system are underway the 5g system also enables the integration of institute of electrical and electronic engineers ieee wireless local area networks wlans for providing costeffective broadband connectivity it is therefore imperative to find solutions for control and management of wlans while providing seamless interworking capabilities with the cellular network in this paper we propose a novel software defined networking sdn based architecture for efficient control and management of ieee wlans while providing a mechanism for smooth integration of wlans within the 5g system | [['the', 'exponential', 'growth', 'in', 'mobile', 'broadband', 'usage', '1', 'has', 'catalyzed', 'the', 'need', 'for', 'high', 'data', 'rate', 'communication', 'systems', 'in', 'this', 'regard', 'activities', 'for', 'standardizing', 'the', 'next', 'generation', 'mobile', 'broadband', 'system', 'known', 'as', 'the', 'fifth', 'generation5g', 'system', 'are', 'underway', 'the', '5g', 'system', 'also', 'enables', 'the', 'integration', 'of', 'institute', 'of', 'electrical', 'and', 'electronic', 'engineers', 'ieee', 'wireless', 'local', 'area', 'networks', 'wlans', 'for', 'providing', 'costeffective', 'broadband', 'connectivity', 'it', 'is', 'therefore', 'imperative', 'to', 'find', 'solutions', 'for', 'control', 'and', 'management', 'of', 'wlans', 'while', 'providing', 'seamless', 'interworking', 'capabilities', 'with', 'the', 'cellular', 'network', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'software', 'defined', 'networking', 'sdn', 'based', 'architecture', 'for', 'efficient', 'control', 'and', 'management', 'of', 'ieee', 'wlans', 'while', 'providing', 'a', 'mechanism', 'for', 'smooth', 'integration', 'of', 'wlans', 'within', 'the', '5g', 'system']] | [-0.27156959318603247, -0.025284914848378907, 0.041555509918322, -0.02387193307552834, -0.06141304220585942, -0.2219117382557084, 0.08310088847657286, 0.39184551710910087, -0.23208901373732646, -0.2931258932261144, 0.11072124372398229, -0.21146024287267887, -0.19262524505177417, 0.2291454140617812, -0.11099836314925766, 0.12279967556044585, 0.027486867145082708, -0.040983567878572366, 0.040281764357903246, -0.2285330625314076, 0.24069924831737655, 0.13135738951801243, 0.4214838752365213, 0.10006116247357075, 0.03974361673601256, 0.005657675020964974, -0.042898046200053164, -0.09138708999794828, -0.07446326583355539, 0.21892424485788253, 0.37104550880080056, 0.20194364684807548, 0.34875712524783814, -0.4867414767553998, -0.2715182546289417, 0.0468055486523199, 0.17953969430478323, 0.00920560001790271, -0.08193013625479918, -0.2780681510605865, 0.13457993772354418, -0.317425680165258, -0.12249794137522073, -0.04643428748694517, 0.0031684447884938473, 0.08397055509790258, -0.30757579851453587, -0.03265512424695771, -0.03810758668913553, 0.09038410171219227, -0.07355461372220415, 0.01863133189489402, 0.0017600769958443056, 0.18394870058065121, -0.04892013089186749, 0.014101716902864686, 0.1475068706209116, -0.14416117451185265, -0.1460543040943853, 0.40881456444197795, 0.0354978916219483, -0.12489640012864907, 0.1629299835471626, -0.021546975196481258, -0.14145231162103178, 0.07344816614463294, 0.23983002028633224, 0.010993853495535204, -0.2607758386707786, 0.07365787092061571, 0.09158965365929624, 0.15899895734579886, 0.028372305253978377, 0.13590294105332282, 0.20699406424695152, 0.34038065887703484, 0.19768348445137174, 0.04865567723952108, -0.07228496378423696, -0.10083363028992978, -0.21779715103270897, -0.1731357505639731, -0.15950862372341423, 0.031361989558563896, -0.05991355391276973, -0.134005046860015, 0.41344497864276675, 0.161804129118968, 0.02612672277363175, 0.10496094469888673, 0.3914564527508061, 0.0474585824383628, 0.14675413649055666, 0.13561624677187586, 0.1976943330649855, 0.018057623380889832, 0.30633437504865607, -0.13569042390070352, 0.060409275033527006, -0.00794144344942297] |
1,802.01426 | Temporal organization of magnetospheric fluctuations unveiled by
recurrence patterns in the Dst index | Magnetic storms constitute the most remarkable large-scale phenomena of
nonlinear magnetospheric dynamics. Studying the dynamical organization of
macroscopic variability in terms of geomagnetic activity index data by means of
complexity measures provides a promising approach for identifying the
underlying processes and associated time-scales. Here, we apply a suite of
characteristics from recurrence quantification analysis (RQA) and recurrence
network analysis (RNA) in order to unveil some key nonlinear features of the
hourly Disturbance storm-time (Dst) index during periods with magnetic storms
and such of normal variability. Our results demonstrate that recurrence-based
measures can serve as excellent tracers for changes in the dynamical complexity
along non-stationary records of geomagnetic activity. In particular, trapping
time (characterizing the typical length of "laminar phases" in the observed
dynamics) and recurrence network transitivity (associated with the number of
the system's effective dynamical degrees of freedom) allow for a very good
discrimination between magnetic storm and quiescence phases. In general, some
RQA and RNA characteristics distinguish between storm and non-storm times
equally well or even better than other previously considered nonlinear
characteristics like Hurst exponent or symbolic dynamics based entropy
concepts. Our results point to future potentials of recurrence characteristics
for unveiling temporal changes in the dynamical complexity of the
magnetosphere.
| physics.ao-ph nlin.CD | magnetic storms constitute the most remarkable largescale phenomena of nonlinear magnetospheric dynamics studying the dynamical organization of macroscopic variability in terms of geomagnetic activity index data by means of complexity measures provides a promising approach for identifying the underlying processes and associated timescales here we apply a suite of characteristics from recurrence quantification analysis rqa and recurrence network analysis rna in order to unveil some key nonlinear features of the hourly disturbance stormtime dst index during periods with magnetic storms and such of normal variability our results demonstrate that recurrencebased measures can serve as excellent tracers for changes in the dynamical complexity along nonstationary records of geomagnetic activity in particular trapping time characterizing the typical length of laminar phases in the observed dynamics and recurrence network transitivity associated with the number of the systems effective dynamical degrees of freedom allow for a very good discrimination between magnetic storm and quiescence phases in general some rqa and rna characteristics distinguish between storm and nonstorm times equally well or even better than other previously considered nonlinear characteristics like hurst exponent or symbolic dynamics based entropy concepts our results point to future potentials of recurrence characteristics for unveiling temporal changes in the dynamical complexity of the magnetosphere | [['magnetic', 'storms', 'constitute', 'the', 'most', 'remarkable', 'largescale', 'phenomena', 'of', 'nonlinear', 'magnetospheric', 'dynamics', 'studying', 'the', 'dynamical', 'organization', 'of', 'macroscopic', 'variability', 'in', 'terms', 'of', 'geomagnetic', 'activity', 'index', 'data', 'by', 'means', 'of', 'complexity', 'measures', 'provides', 'a', 'promising', 'approach', 'for', 'identifying', 'the', 'underlying', 'processes', 'and', 'associated', 'timescales', 'here', 'we', 'apply', 'a', 'suite', 'of', 'characteristics', 'from', 'recurrence', 'quantification', 'analysis', 'rqa', 'and', 'recurrence', 'network', 'analysis', 'rna', 'in', 'order', 'to', 'unveil', 'some', 'key', 'nonlinear', 'features', 'of', 'the', 'hourly', 'disturbance', 'stormtime', 'dst', 'index', 'during', 'periods', 'with', 'magnetic', 'storms', 'and', 'such', 'of', 'normal', 'variability', 'our', 'results', 'demonstrate', 'that', 'recurrencebased', 'measures', 'can', 'serve', 'as', 'excellent', 'tracers', 'for', 'changes', 'in', 'the', 'dynamical', 'complexity', 'along', 'nonstationary', 'records', 'of', 'geomagnetic', 'activity', 'in', 'particular', 'trapping', 'time', 'characterizing', 'the', 'typical', 'length', 'of', 'laminar', 'phases', 'in', 'the', 'observed', 'dynamics', 'and', 'recurrence', 'network', 'transitivity', 'associated', 'with', 'the', 'number', 'of', 'the', 'systems', 'effective', 'dynamical', 'degrees', 'of', 'freedom', 'allow', 'for', 'a', 'very', 'good', 'discrimination', 'between', 'magnetic', 'storm', 'and', 'quiescence', 'phases', 'in', 'general', 'some', 'rqa', 'and', 'rna', 'characteristics', 'distinguish', 'between', 'storm', 'and', 'nonstorm', 'times', 'equally', 'well', 'or', 'even', 'better', 'than', 'other', 'previously', 'considered', 'nonlinear', 'characteristics', 'like', 'hurst', 'exponent', 'or', 'symbolic', 'dynamics', 'based', 'entropy', 'concepts', 'our', 'results', 'point', 'to', 'future', 'potentials', 'of', 'recurrence', 'characteristics', 'for', 'unveiling', 'temporal', 'changes', 'in', 'the', 'dynamical', 'complexity', 'of', 'the', 'magnetosphere']] | [-0.15161333914362743, 0.14941646997803099, -0.0848107717178872, 0.13748829976255258, -0.03396362777979439, -0.10961063477793351, 0.009217656592567786, 0.3474695767580504, -0.26721030302871057, -0.3287204917694621, 0.08489163464171527, -0.2595593883245071, -0.2162353576526844, 0.2490928952164691, -0.04353057981922929, 0.06571583765767643, 0.049056226055004766, 0.011451365379157839, -0.029326851868524854, -0.16199778250918673, 0.24580719692660083, 0.08506767869367278, 0.2475232983930174, -0.006783900860458466, 0.058611795997815984, -0.03267604241198103, -0.05343987213750485, 0.02850489679774444, -0.10777536533281047, 0.08543139178108876, 0.24456387940619892, 0.12937195180442754, 0.23310124825713743, -0.4523163264745782, -0.2814868121256529, 0.08161534505937561, 0.10374866822606017, 0.022744995280366227, -0.009701589902339897, -0.2804441793220751, 0.03458574053050326, -0.12486335380333177, -0.1442294504810033, -0.09477663638868503, 0.08120628396333585, 0.08306748494494413, -0.2727758971540707, 0.13962640083814154, 0.05421258408915747, 0.16007216427282528, -0.0891461802577414, -0.04459079897450971, -0.033008996321558216, 0.17297004594518045, 0.10392176765682441, -0.016468097244760966, 0.1391845029172903, -0.12915128704591705, -0.16390980753314732, 0.36452207131669145, -0.04227394434794603, -0.12220561547030516, 0.23388808967174016, -0.17784597448963935, -0.1915622650338291, 0.14048524252528993, 0.19456198208121206, 0.045016676766724495, -0.13547316040348242, -0.03235104124221189, 0.023575610928512705, 0.19801979493696742, 0.06017074531191969, 0.1062303345040831, 0.22204280309975513, 0.20368182881427882, 0.0342781813121332, 0.1281709225218642, -0.11504892977195438, -0.11752198135544514, -0.22705505527739456, -0.12478797979139049, -0.11285734275502744, 0.04502292300501077, -0.17881720074863355, -0.1748288984048029, 0.46933941408909235, 0.16895769481040226, 0.15483497789019507, 0.04513438229260994, 0.249304859076622, 0.07131694426147607, 0.015493252195344476, 0.084274905984946, 0.1936726170133804, 0.14464045762316108, 0.1308599146899625, -0.24299495316940942, 0.14731321535463182, 0.06279762705164076] |
1,802.01427 | Electroluminescence pulse shape and electron diffusion in liquid argon
measured in a dual-phase TPC | We report the measurement of the longitudinal diffusion constant in liquid
argon with the DarkSide-50 dual-phase time projection chamber. The measurement
is performed at drift electric fields of 100 V/cm, 150 V/cm, and 200 V/cm using
high statistics $^{39}$Ar decays from atmospheric argon. We derive an
expression to describe the pulse shape of the electroluminescence signal (S2)
in dual-phase TPCs. The derived S2 pulse shape is fit to events from the
uppermost portion of the TPC in order to characterize the radial dependence of
the signal. The results are provided as inputs to the measurement of the
longitudinal diffusion constant DL, which we find to be (4.12 $\pm$ 0.04)
cm$^2$/s for a selection of 140keV electron recoil events in 200V/cm drift
field and 2.8kV/cm extraction field. To study the systematics of our
measurement we examine datasets of varying event energy, field strength, and
detector volume yielding a weighted average value for the diffusion constant of
(4.09 $\pm$ 0.09) cm$^2$ /s. The measured longitudinal diffusion constant is
observed to have an energy dependence, and within the studied energy range the
result is systematically lower than other results in the literature.
| physics.ins-det | we report the measurement of the longitudinal diffusion constant in liquid argon with the darkside50 dualphase time projection chamber the measurement is performed at drift electric fields of 100 vcm 150 vcm and 200 vcm using high statistics 39ar decays from atmospheric argon we derive an expression to describe the pulse shape of the electroluminescence signal s2 in dualphase tpcs the derived s2 pulse shape is fit to events from the uppermost portion of the tpc in order to characterize the radial dependence of the signal the results are provided as inputs to the measurement of the longitudinal diffusion constant dl which we find to be 412 pm 004 cm2s for a selection of 140kev electron recoil events in 200vcm drift field and 28kvcm extraction field to study the systematics of our measurement we examine datasets of varying event energy field strength and detector volume yielding a weighted average value for the diffusion constant of 409 pm 009 cm2 s the measured longitudinal diffusion constant is observed to have an energy dependence and within the studied energy range the result is systematically lower than other results in the literature | [['we', 'report', 'the', 'measurement', 'of', 'the', 'longitudinal', 'diffusion', 'constant', 'in', 'liquid', 'argon', 'with', 'the', 'darkside50', 'dualphase', 'time', 'projection', 'chamber', 'the', 'measurement', 'is', 'performed', 'at', 'drift', 'electric', 'fields', 'of', '100', 'vcm', '150', 'vcm', 'and', '200', 'vcm', 'using', 'high', 'statistics', '39ar', 'decays', 'from', 'atmospheric', 'argon', 'we', 'derive', 'an', 'expression', 'to', 'describe', 'the', 'pulse', 'shape', 'of', 'the', 'electroluminescence', 'signal', 's2', 'in', 'dualphase', 'tpcs', 'the', 'derived', 's2', 'pulse', 'shape', 'is', 'fit', 'to', 'events', 'from', 'the', 'uppermost', 'portion', 'of', 'the', 'tpc', 'in', 'order', 'to', 'characterize', 'the', 'radial', 'dependence', 'of', 'the', 'signal', 'the', 'results', 'are', 'provided', 'as', 'inputs', 'to', 'the', 'measurement', 'of', 'the', 'longitudinal', 'diffusion', 'constant', 'dl', 'which', 'we', 'find', 'to', 'be', '412', 'pm', '004', 'cm2s', 'for', 'a', 'selection', 'of', '140kev', 'electron', 'recoil', 'events', 'in', '200vcm', 'drift', 'field', 'and', '28kvcm', 'extraction', 'field', 'to', 'study', 'the', 'systematics', 'of', 'our', 'measurement', 'we', 'examine', 'datasets', 'of', 'varying', 'event', 'energy', 'field', 'strength', 'and', 'detector', 'volume', 'yielding', 'a', 'weighted', 'average', 'value', 'for', 'the', 'diffusion', 'constant', 'of', '409', 'pm', '009', 'cm2', 's', 'the', 'measured', 'longitudinal', 'diffusion', 'constant', 'is', 'observed', 'to', 'have', 'an', 'energy', 'dependence', 'and', 'within', 'the', 'studied', 'energy', 'range', 'the', 'result', 'is', 'systematically', 'lower', 'than', 'other', 'results', 'in', 'the', 'literature']] | [-0.07356408340305651, 0.16639057792343265, -0.051830181490062854, 0.014772494681560064, -0.008866046978441138, -0.08080244734282455, 0.011682152841365345, 0.367749037441387, -0.23296492386193726, -0.3748012699877783, 0.06678809818839254, -0.3262223658297131, 0.03290113875822675, 0.20062483639346176, 0.011696560637554735, 0.028755050407902848, 0.016321105827447228, 0.0327823418943632, -0.08509813903540533, -0.19153432403841325, 0.18549304352247067, 0.10801573800954527, 0.293457859428443, 0.08829106697161752, 0.14879596867956602, -0.014491147127613345, -0.04996817890349375, -0.01778642159588735, -0.1850783912369841, 0.02705690979717239, 0.23221538696057534, 0.061641497802870565, 0.17539555017125383, -0.38136326077003635, -0.17122517883626154, 0.08327373085162973, 0.09778851162021358, 0.06948771572260935, -0.05772932675937491, -0.2827260122754641, 0.06585845115321678, -0.15501727299124468, -0.1053007096264972, 0.01041834843370022, 0.04781703670917239, 0.023805573728950744, -0.29288204873114654, 0.15137439798839109, -0.009763387699676577, 0.06757777116151266, -0.09886066326170519, -0.16507009428585329, 0.045791789532579, 0.06144196083468775, 0.07520473946727091, 0.08626911428792061, 0.23889401021553705, -0.10506186533784394, -0.05656456059065237, 0.3450470460348472, -0.1589597035622661, -0.15193849715143842, 0.10445020415304448, -0.23266862371876354, -0.048017226915646305, 0.22407321353513066, 0.18846579691425205, 0.09285471331508409, -0.16022268422974414, 0.02076599701753347, 0.030031853241555554, 0.20340553559963742, 0.07047475779914768, 0.01458127812046798, 0.1436540351038979, 0.18856657005693783, 0.07568712365407977, 0.07646432380168199, -0.2376659585022798, -0.025108795184942502, -0.30464769119424345, -0.1596781925188117, -0.14856342572884093, 0.06122023159868374, -0.09233901105659653, -0.1154562047010185, 0.4087724718115022, 0.12459626265513424, 0.20260437747203214, 0.011058852591636961, 0.281450287979697, 0.11785128577211772, 0.045673947074070013, 0.022210665440226915, 0.29398495911730715, 0.18426876517152915, 0.13745206455895376, -0.2526351308865693, 0.05718092827917507, -0.011279951205216748] |
1,802.01428 | Re-thinking non-inferiority: a practical trial design for optimising
treatment duration | Background: trials to identify the minimal effective treatment duration are
needed in different therapeutic areas, including bacterial infections, TB and
Hepatitis--C. However, standard non-inferiority designs have several
limitations, including arbitrariness of non-inferiority margins, choice of
research arms and very large sample sizes.
Methods: we recast the problem of finding an appropriate non-inferior
treatment duration in terms of modelling the entire duration-response curve
within a pre-specified range. We propose a multi-arm randomised trial design,
allocating patients to different treatment durations. We use fractional
polynomials and spline-based methods to flexibly model the duration-response
curve. We compare different methods in terms of a scaled version of the area
between true and estimated prediction curves. We evaluate sensitivity to key
design parameters, including sample size, number and position of arms.
Results: a total sample size of $\sim 500$ patients divided into a moderate
number of equidistant arms (5-7) is sufficient to estimate the
duration-response curve within a $5\%$ error margin in $95\%$ of the
simulations. Fractional polynomials provide similar or better results than
spline-based methods in most scenarios.
Conclusions: our proposed practical randomised trial design is an alternative
to standard non-inferiority designs, avoiding many of their limitations, and
yet being fairly robust to different possible duration-response curves. The
trial outcome is the whole duration-response curve, which could be used by
clinicians and policy makers to make informed decisions, facilitating a move
away from a forced binary hypothesis testing paradigm.
| stat.ME | background trials to identify the minimal effective treatment duration are needed in different therapeutic areas including bacterial infections tb and hepatitisc however standard noninferiority designs have several limitations including arbitrariness of noninferiority margins choice of research arms and very large sample sizes methods we recast the problem of finding an appropriate noninferior treatment duration in terms of modelling the entire durationresponse curve within a prespecified range we propose a multiarm randomised trial design allocating patients to different treatment durations we use fractional polynomials and splinebased methods to flexibly model the durationresponse curve we compare different methods in terms of a scaled version of the area between true and estimated prediction curves we evaluate sensitivity to key design parameters including sample size number and position of arms results a total sample size of sim 500 patients divided into a moderate number of equidistant arms 57 is sufficient to estimate the durationresponse curve within a 5 error margin in 95 of the simulations fractional polynomials provide similar or better results than splinebased methods in most scenarios conclusions our proposed practical randomised trial design is an alternative to standard noninferiority designs avoiding many of their limitations and yet being fairly robust to different possible durationresponse curves the trial outcome is the whole durationresponse curve which could be used by clinicians and policy makers to make informed decisions facilitating a move away from a forced binary hypothesis testing paradigm | [['background', 'trials', 'to', 'identify', 'the', 'minimal', 'effective', 'treatment', 'duration', 'are', 'needed', 'in', 'different', 'therapeutic', 'areas', 'including', 'bacterial', 'infections', 'tb', 'and', 'hepatitisc', 'however', 'standard', 'noninferiority', 'designs', 'have', 'several', 'limitations', 'including', 'arbitrariness', 'of', 'noninferiority', 'margins', 'choice', 'of', 'research', 'arms', 'and', 'very', 'large', 'sample', 'sizes', 'methods', 'we', 'recast', 'the', 'problem', 'of', 'finding', 'an', 'appropriate', 'noninferior', 'treatment', 'duration', 'in', 'terms', 'of', 'modelling', 'the', 'entire', 'durationresponse', 'curve', 'within', 'a', 'prespecified', 'range', 'we', 'propose', 'a', 'multiarm', 'randomised', 'trial', 'design', 'allocating', 'patients', 'to', 'different', 'treatment', 'durations', 'we', 'use', 'fractional', 'polynomials', 'and', 'splinebased', 'methods', 'to', 'flexibly', 'model', 'the', 'durationresponse', 'curve', 'we', 'compare', 'different', 'methods', 'in', 'terms', 'of', 'a', 'scaled', 'version', 'of', 'the', 'area', 'between', 'true', 'and', 'estimated', 'prediction', 'curves', 'we', 'evaluate', 'sensitivity', 'to', 'key', 'design', 'parameters', 'including', 'sample', 'size', 'number', 'and', 'position', 'of', 'arms', 'results', 'a', 'total', 'sample', 'size', 'of', 'sim', '500', 'patients', 'divided', 'into', 'a', 'moderate', 'number', 'of', 'equidistant', 'arms', '57', 'is', 'sufficient', 'to', 'estimate', 'the', 'durationresponse', 'curve', 'within', 'a', '5', 'error', 'margin', 'in', '95', 'of', 'the', 'simulations', 'fractional', 'polynomials', 'provide', 'similar', 'or', 'better', 'results', 'than', 'splinebased', 'methods', 'in', 'most', 'scenarios', 'conclusions', 'our', 'proposed', 'practical', 'randomised', 'trial', 'design', 'is', 'an', 'alternative', 'to', 'standard', 'noninferiority', 'designs', 'avoiding', 'many', 'of', 'their', 'limitations', 'and', 'yet', 'being', 'fairly', 'robust', 'to', 'different', 'possible', 'durationresponse', 'curves', 'the', 'trial', 'outcome', 'is', 'the', 'whole', 'durationresponse', 'curve', 'which', 'could', 'be', 'used', 'by', 'clinicians', 'and', 'policy', 'makers', 'to', 'make', 'informed', 'decisions', 'facilitating', 'a', 'move', 'away', 'from', 'a', 'forced', 'binary', 'hypothesis', 'testing', 'paradigm']] | [-0.08012321392774709, 0.05867832432748276, -0.07788383625805952, 0.10229702489440624, -0.09949120728330862, -0.16907493378887448, 0.11927697190648726, 0.3980552619223634, -0.21311640307858476, -0.3399231504185253, 0.10608926148832433, -0.22535922938886171, -0.10190155617042015, 0.24080587004144222, -0.1486316975624038, 0.06875252137487978, 0.06979753587317343, -0.036982560570975646, -0.0645533995287449, -0.29257621249068594, 0.22232866223252767, 0.05208392521805771, 0.2925235925313945, -0.03842352530083213, 0.06167301340287344, 0.0157666730039761, -0.043193379412335545, 0.014035303987419376, -0.15167525072251725, 0.10655769726518208, 0.3080502680948593, 0.18043173453770578, 0.3562037531190958, -0.3984085610290926, -0.194825367499021, 0.14107777500966898, 0.12105690440935138, 0.08980537057878116, 0.009703667006558843, -0.25202995945916423, 0.06200643153224363, -0.16811974612346214, -0.15034042853209326, -0.04476100250453744, 0.006682480966003659, 0.02792426732191657, -0.30594236293457383, 0.05381310182366357, -0.019154366185395125, 0.08981109947626853, -0.057168656529293545, -0.18664280876107356, 0.044882351606208674, 0.12799478768178016, 0.06900592412290653, 0.029356702977122787, 0.1627766754116035, -0.1238257605470227, -0.12405459750563097, 0.35335468175088686, 0.006277485623939309, -0.19930475366373474, 0.16617200500381568, -0.09630680011195314, -0.07843133829122123, 0.13988770418661114, 0.21591713089241177, 0.10556956313318637, -0.17557498747701797, -0.03211515179698945, 0.008441051240646256, 0.18059375401015162, 0.05959253152185637, -0.012337944448455913, 0.17240304274695456, 0.18156971091913998, 0.040415478120786816, 0.11526574630292259, -0.12357912428525841, -0.11778696687343833, -0.28415498003148687, -0.10876118305386004, -0.10747290651401521, 0.003818692334004256, -0.13835176025398133, -0.15192567734794643, 0.4034168715111147, 0.16939105108006197, 0.1667267175204256, 0.09091506300157765, 0.2773227567673048, 0.05018591843112611, 0.07150602636910561, 0.04602137083808581, 0.17044524195739347, 0.06864741960198133, 0.007470362346109926, -0.18894669391378027, 0.11205275679150453, -0.012593412375809927] |
1,802.01429 | Manuscripts in Time and Space: Experiments in Scriptometrics on an Old
French Corpus | Witnesses of medieval literary texts, preserved in manuscript, are layered
objects , being almost exclusively copies of copies. This results in multiple
and hard to distinguish linguistic strata -- the author's scripta interacting
with the scriptae of the various scribes -- in a context where literary written
language is already a dialectal hybrid. Moreover, no single linguistic
phenomenon allows to distinguish between different scriptae, and only the
combination of multiple characteristics is likely to be significant [9] -- but
which ones? The most common approach is to search for these features in a set
of previously selected texts, that are supposed to be representative of a given
scripta. This can induce a circularity, in which texts are used to select
features that in turn characterise them as belonging to a linguistic area. To
counter this issue, this paper offers an unsupervised and corpus-based
approach, in which clustering methods are applied to an Old French corpus to
identify main divisions and groups. Ultimately, scriptometric profiles are
built for each of them.
| cs.CL stat.AP | witnesses of medieval literary texts preserved in manuscript are layered objects being almost exclusively copies of copies this results in multiple and hard to distinguish linguistic strata the authors scripta interacting with the scriptae of the various scribes in a context where literary written language is already a dialectal hybrid moreover no single linguistic phenomenon allows to distinguish between different scriptae and only the combination of multiple characteristics is likely to be significant 9 but which ones the most common approach is to search for these features in a set of previously selected texts that are supposed to be representative of a given scripta this can induce a circularity in which texts are used to select features that in turn characterise them as belonging to a linguistic area to counter this issue this paper offers an unsupervised and corpusbased approach in which clustering methods are applied to an old french corpus to identify main divisions and groups ultimately scriptometric profiles are built for each of them | [['witnesses', 'of', 'medieval', 'literary', 'texts', 'preserved', 'in', 'manuscript', 'are', 'layered', 'objects', 'being', 'almost', 'exclusively', 'copies', 'of', 'copies', 'this', 'results', 'in', 'multiple', 'and', 'hard', 'to', 'distinguish', 'linguistic', 'strata', 'the', 'authors', 'scripta', 'interacting', 'with', 'the', 'scriptae', 'of', 'the', 'various', 'scribes', 'in', 'a', 'context', 'where', 'literary', 'written', 'language', 'is', 'already', 'a', 'dialectal', 'hybrid', 'moreover', 'no', 'single', 'linguistic', 'phenomenon', 'allows', 'to', 'distinguish', 'between', 'different', 'scriptae', 'and', 'only', 'the', 'combination', 'of', 'multiple', 'characteristics', 'is', 'likely', 'to', 'be', 'significant', '9', 'but', 'which', 'ones', 'the', 'most', 'common', 'approach', 'is', 'to', 'search', 'for', 'these', 'features', 'in', 'a', 'set', 'of', 'previously', 'selected', 'texts', 'that', 'are', 'supposed', 'to', 'be', 'representative', 'of', 'a', 'given', 'scripta', 'this', 'can', 'induce', 'a', 'circularity', 'in', 'which', 'texts', 'are', 'used', 'to', 'select', 'features', 'that', 'in', 'turn', 'characterise', 'them', 'as', 'belonging', 'to', 'a', 'linguistic', 'area', 'to', 'counter', 'this', 'issue', 'this', 'paper', 'offers', 'an', 'unsupervised', 'and', 'corpusbased', 'approach', 'in', 'which', 'clustering', 'methods', 'are', 'applied', 'to', 'an', 'old', 'french', 'corpus', 'to', 'identify', 'main', 'divisions', 'and', 'groups', 'ultimately', 'scriptometric', 'profiles', 'are', 'built', 'for', 'each', 'of', 'them']] | [-0.07204752398313428, 0.07359986436182628, -0.10328976811728285, 0.09248981770414408, -0.12878531868072465, -0.13199188842733128, 0.046824228036377376, 0.39133841908919664, -0.28182954788336567, -0.3411610203343758, 0.06549192731985765, -0.2986817077821602, -0.126565306844544, 0.18248030729449005, -0.11631876706757063, -0.0312199825956629, 0.04332674769513263, 0.05134277763073704, 0.001592799481233022, -0.2876790655416899, 0.31351714894644045, 0.01559866765286185, 0.2858431535498725, -0.024241981279803797, 0.05550076189433779, -0.08204727559750385, -0.07330824041409144, 0.02294306578457447, -0.05068650486512307, 0.16176344183747846, 0.3700514793555978, 0.17243650455528298, 0.2872425881928644, -0.36812904489403764, -0.17713636915096614, 0.097212787651874, 0.14368773496744044, 0.1178894167961667, 0.010840205759227138, -0.30137287083144754, 0.10820714578866684, -0.15714550433834684, -0.04716873774304986, -0.08088566660395384, 0.03654454600214501, -0.0002812082147899947, -0.2173593566028767, 0.025521899536723396, 0.07318723873389553, 0.059924862424677316, -0.02367495639468229, -0.10429531196989347, 0.013429840201757665, 0.17669012705206963, 0.06845838475566746, 0.04646539224377416, 0.09016525004333331, -0.10846168329036492, -0.13903474249668846, 0.39459003693212763, -0.030806308930762614, -0.20506093029439537, 0.25389802563746966, -0.0856400340669817, -0.18244274153996923, 0.08592933395511808, 0.17150649892314812, 0.10753558369844786, -0.23165460828508885, -0.013594042968313479, -0.07281837760373676, 0.1980272895903641, 0.11365155009210018, 0.02415662001964116, 0.2144116919642697, 0.14247644260137177, -0.03141175726131519, 0.14572654306057245, -0.04039689374586247, -0.06953682268804019, -0.2529496377729668, -0.1477876847961266, -0.15306067856691458, -0.003701084262089364, -0.03583869350569871, -0.19384045079079074, 0.39875353450538376, 0.17004823475287645, 0.19091623742838656, 0.01218130303035416, 0.2453463651194163, 0.012370467567448562, 0.11798396168593239, 0.0408670554491777, 0.17215518650535974, 0.05120512660724208, 0.08093738753314307, -0.10560626127797128, 0.07934663872994437, 0.02760766156717165] |
1,802.0143 | Nonlinear optical response of doped mono- and bilayer graphene: length
gauge tight-binding model | We compute the nonlinear optical response of doped mono- and bilayer graphene
using the full dispersion based on tight-binding models. The response is
derived with the density matrix formalism using the length gauge and is valid
for any periodic system, with arbitrary doping. By collecting terms that define
effective nonlinear response tensors, we identify all nonlinear Drude-like
terms (up to third-order) and show that all additional spurious divergences
present in the induced current vanish. The nonlinear response of graphene
comprises a large Drude-like divergence and three resonances that are tightly
connected with transitions occurring in the vicinity of the Fermi level. The
analytic solution derived using the Dirac approximation captures accurately the
first- and third-order responses in graphene, even at very high doping levels.
The quadratic response of gapped graphene is also strongly enhanced by doping,
even for systems with small gaps such as commensurate structures of graphene on
SiC. The nonlinear response of bilayer graphene is significantly richer,
combining the resonances that stem from doping with its intrinsic strong
low-energy resonances.
| cond-mat.mes-hall | we compute the nonlinear optical response of doped mono and bilayer graphene using the full dispersion based on tightbinding models the response is derived with the density matrix formalism using the length gauge and is valid for any periodic system with arbitrary doping by collecting terms that define effective nonlinear response tensors we identify all nonlinear drudelike terms up to thirdorder and show that all additional spurious divergences present in the induced current vanish the nonlinear response of graphene comprises a large drudelike divergence and three resonances that are tightly connected with transitions occurring in the vicinity of the fermi level the analytic solution derived using the dirac approximation captures accurately the first and thirdorder responses in graphene even at very high doping levels the quadratic response of gapped graphene is also strongly enhanced by doping even for systems with small gaps such as commensurate structures of graphene on sic the nonlinear response of bilayer graphene is significantly richer combining the resonances that stem from doping with its intrinsic strong lowenergy resonances | [['we', 'compute', 'the', 'nonlinear', 'optical', 'response', 'of', 'doped', 'mono', 'and', 'bilayer', 'graphene', 'using', 'the', 'full', 'dispersion', 'based', 'on', 'tightbinding', 'models', 'the', 'response', 'is', 'derived', 'with', 'the', 'density', 'matrix', 'formalism', 'using', 'the', 'length', 'gauge', 'and', 'is', 'valid', 'for', 'any', 'periodic', 'system', 'with', 'arbitrary', 'doping', 'by', 'collecting', 'terms', 'that', 'define', 'effective', 'nonlinear', 'response', 'tensors', 'we', 'identify', 'all', 'nonlinear', 'drudelike', 'terms', 'up', 'to', 'thirdorder', 'and', 'show', 'that', 'all', 'additional', 'spurious', 'divergences', 'present', 'in', 'the', 'induced', 'current', 'vanish', 'the', 'nonlinear', 'response', 'of', 'graphene', 'comprises', 'a', 'large', 'drudelike', 'divergence', 'and', 'three', 'resonances', 'that', 'are', 'tightly', 'connected', 'with', 'transitions', 'occurring', 'in', 'the', 'vicinity', 'of', 'the', 'fermi', 'level', 'the', 'analytic', 'solution', 'derived', 'using', 'the', 'dirac', 'approximation', 'captures', 'accurately', 'the', 'first', 'and', 'thirdorder', 'responses', 'in', 'graphene', 'even', 'at', 'very', 'high', 'doping', 'levels', 'the', 'quadratic', 'response', 'of', 'gapped', 'graphene', 'is', 'also', 'strongly', 'enhanced', 'by', 'doping', 'even', 'for', 'systems', 'with', 'small', 'gaps', 'such', 'as', 'commensurate', 'structures', 'of', 'graphene', 'on', 'sic', 'the', 'nonlinear', 'response', 'of', 'bilayer', 'graphene', 'is', 'significantly', 'richer', 'combining', 'the', 'resonances', 'that', 'stem', 'from', 'doping', 'with', 'its', 'intrinsic', 'strong', 'lowenergy', 'resonances']] | [-0.14619954098774077, 0.15022015325633029, -0.0009994923738156293, 0.02826382126862205, -0.024153589214154975, -0.15703907055065555, 0.031659654119636775, 0.359148564488562, -0.23593627245078774, -0.26717803675984575, 0.001723718426737198, -0.3440721999247407, -0.22463553992024254, 0.15972673651480743, 0.04099546445176265, 0.04760078436574563, -0.0012563983324324973, -0.05261495457772642, -0.10374814792547028, -0.20550811264885935, 0.3199622315831136, 0.02413494030059705, 0.29549618848994763, 0.06747376631950787, 0.07851780962664634, 0.0508554452606531, 0.07983889037656576, 0.052932046440451644, -0.09897915828857316, 0.10757493488301068, 0.2645737259606819, -0.09699014159796629, 0.2002240080619231, -0.450912848201602, -0.20426383235378104, -0.014976483869886155, 0.11444171281872577, 0.14786932446322468, -0.03526221787809803, -0.25702550532269225, 0.0722799375145642, -0.1250627521712463, -0.11918364959392631, -0.11546267176637166, -0.021766247796327916, 0.01608103326370203, -0.25629205416433165, 0.1225418725127468, 0.034325032148423584, 0.05711544988958468, -0.10321850734722238, -0.12750046892662878, -0.0839029558566074, 0.08492463026845525, 0.015452149045263786, -0.003605075940445098, 0.1638731223715166, -0.1315278417057206, -0.07258626175665318, 0.3957265634306295, -0.11209267853125714, -0.16756788182050683, 0.1712181252971573, -0.19823847554602422, -0.05550871052519353, 0.19764895961202986, 0.14201257479895546, 0.08624799199792188, -0.15303049922574224, 0.11429900094984521, -0.010304112210030516, 0.17758133418744343, 0.08443582022757551, 0.10645035631294081, 0.22816997837426878, 0.1629829755090827, 0.05837324317977872, 0.11683682705645265, -0.08143375406236669, -0.010032127757535078, -0.26861193056250815, -0.09236857882242053, -0.19304502093595952, 0.055386014303685234, -0.0813071552177906, -0.2323877687815057, 0.4457713569877236, 0.12556943023268696, 0.17226574863821573, 0.029589425511170872, 0.2554510286914423, 0.21779815827260812, 0.09724467201835238, 0.027666369106533917, 0.2649545375336243, 0.12162885602447204, 0.051197531985709185, -0.28772031693843864, 0.03487425492426684, -0.0002092754767482104] |
1,802.01431 | Topological insulation in a ladder model with particle-hole and
reflection symmetries | A two-legged ladder model, one dimensional, exhibiting the parity anomaly is
constructed. The model belongs to the $C$ and $CI$ symmetry classes, depending
on the parameters, but, due to reflection, it exhibits topological insulation.
The model consists of two superimposed Creutz models with onsite potentials.
The topological invariants for both cases are {\it mirror winding numbers,}
which are nonzero individually in the topological phase, but sum to zero
overall in both phases. We demonstrate the presence of edge states and
quantized Hall response in the topological region. Our model exhibits two
distinct topological regions, distinguished by the different types of
reflection symmetries.
| cond-mat.str-el cond-mat.mes-hall cond-mat.other | a twolegged ladder model one dimensional exhibiting the parity anomaly is constructed the model belongs to the c and ci symmetry classes depending on the parameters but due to reflection it exhibits topological insulation the model consists of two superimposed creutz models with onsite potentials the topological invariants for both cases are it mirror winding numbers which are nonzero individually in the topological phase but sum to zero overall in both phases we demonstrate the presence of edge states and quantized hall response in the topological region our model exhibits two distinct topological regions distinguished by the different types of reflection symmetries | [['a', 'twolegged', 'ladder', 'model', 'one', 'dimensional', 'exhibiting', 'the', 'parity', 'anomaly', 'is', 'constructed', 'the', 'model', 'belongs', 'to', 'the', 'c', 'and', 'ci', 'symmetry', 'classes', 'depending', 'on', 'the', 'parameters', 'but', 'due', 'to', 'reflection', 'it', 'exhibits', 'topological', 'insulation', 'the', 'model', 'consists', 'of', 'two', 'superimposed', 'creutz', 'models', 'with', 'onsite', 'potentials', 'the', 'topological', 'invariants', 'for', 'both', 'cases', 'are', 'it', 'mirror', 'winding', 'numbers', 'which', 'are', 'nonzero', 'individually', 'in', 'the', 'topological', 'phase', 'but', 'sum', 'to', 'zero', 'overall', 'in', 'both', 'phases', 'we', 'demonstrate', 'the', 'presence', 'of', 'edge', 'states', 'and', 'quantized', 'hall', 'response', 'in', 'the', 'topological', 'region', 'our', 'model', 'exhibits', 'two', 'distinct', 'topological', 'regions', 'distinguished', 'by', 'the', 'different', 'types', 'of', 'reflection', 'symmetries']] | [-0.21476971132078154, 0.201428281490271, -0.04676759666158343, 0.010635748164335667, -0.03341586440436396, -0.23203935932057598, 0.03386822151358002, 0.3455979211767222, -0.2590195777981232, -0.2965940294020316, 0.05449405513982307, -0.299523131246222, -0.16578719088825963, 0.11878930717962337, 0.0004739304042909769, -0.0014772268158255838, -0.0461834484035624, 0.018819506225340506, -0.09636612202259986, -0.22485662361392386, 0.3239578557766828, -0.07828913549618687, 0.32945068086515744, 0.02254614421604749, 0.046106089568496045, -0.04347522535553092, 0.04058729886424308, 0.037755077000713524, -0.07737251876981235, 0.04756751376850184, 0.19340419127108952, -0.036780735354541856, 0.09595667435696312, -0.3912656980055366, -0.2240127256258811, 0.08358155762521076, 0.0783070339901172, 0.10897336502481873, -0.006188974091463594, -0.317133900230093, 0.06498562173881367, -0.16694469040478854, -0.12597593364269272, -0.09124516460168011, 0.0124626830585447, -0.04479602157302639, -0.23185756878342992, 0.06538607921524375, 0.06093070962849785, 0.05877652128829675, -0.07220112917460866, -0.11557082847381632, -0.1207657816303967, 0.10927715089044296, 0.04993095392059973, -0.03573190162013121, 0.06657127436255013, -0.1732307177493674, -0.16403058144336968, 0.39141767014128465, -0.024130015223122695, -0.20191497639661618, 0.235606727484778, -0.14300778037460415, -0.11628741718025185, 0.143757977975731, 0.0823099667242929, 0.0725021267802838, -0.04977087728084549, 0.10762029225075179, -0.04232873715569868, 0.1415135217374008, 0.024737635453907298, 0.06514397080914647, 0.272540613643679, 0.0860210373979427, 0.05078178521259414, 0.19676240431327446, -0.10387816968346562, -0.12486732586323485, -0.3114370247805674, -0.12741131174341574, -0.1795349872794331, 0.0017951982935854032, -0.06181144576911203, -0.20235073970009884, 0.4963244584334247, 0.10445005436685831, 0.2167473338023924, -0.009872326973195681, 0.25309938842467233, 0.14527040074793987, 0.086062043705526, 0.03489524424167387, 0.201823777314869, 0.12681318584181295, 0.03235924400345824, -0.25046119534504124, 0.029302494569599408, 0.1121073871504004] |
1,802.01432 | A Class of M\"obius Iterated Function Systems | We give a procedure to produce M\"obius iterated function systems (MIFS) on
the unit disc in the complex plane.
| math.DS math.CA | we give a procedure to produce mobius iterated function systems mifs on the unit disc in the complex plane | [['we', 'give', 'a', 'procedure', 'to', 'produce', 'mobius', 'iterated', 'function', 'systems', 'mifs', 'on', 'the', 'unit', 'disc', 'in', 'the', 'complex', 'plane']] | [-0.17989956116990038, -0.002761270899913813, -0.10165399263956044, 0.11904580479389743, -0.09316436421910398, -0.01861467306796265, 0.03795516157620832, 0.4395112379601127, -0.2879205679422931, -0.22143147199561722, 0.07593884324581411, -0.21446323316348226, -0.2040859779441043, 0.2681029344859876, -0.08189960113285404, 0.07603380044824198, 0.03661250783816764, -0.03831630700120801, -0.07529885283867388, -0.3037844313994834, 0.33135420829057693, -0.048159690059133266, 0.13949063361475342, -0.010893533447463261, 0.07919532903715183, 0.10395962279289961, -0.007062764605507255, -0.05047218146194753, -0.18828249072018816, 0.09556141623148792, 0.1510032780076328, 0.09503381755693179, 0.2096733867778982, -0.415656216442585, -0.12940688884670012, 0.09917993765128286, 0.14194411786861325, -0.0003405662351532986, -0.014152939805123759, -0.18180683804185768, 0.055262542770881405, -0.1294214486291534, -0.1764867991993302, -0.04978790369473005, -0.015486127647914384, 0.01911986799371478, -0.26046257377847243, 0.022726180522065414, 0.11665776891535834, 0.09518995234975591, -0.056793924175987116, -0.04530066702710955, -0.025381978405149358, 0.06796163702873807, -0.05751762676395868, 0.13915370144930325, 0.1892044005278302, -0.01794932017985143, -0.09174064100769005, 0.3879333040431926, -0.03157123967416977, -0.32091770517198664, 0.15744380667609603, -0.19905628903621905, -0.12804232616173594, 0.12906436308434135, 0.24399312075815702, 0.1348970377523648, -0.06622197106480598, 0.10906734680266757, -0.08967918750682943, 0.13648775945368566, 0.06555756671648276, -0.033484376072393435, 0.22137567606803618, 0.05377883983677939, 0.13237281094648337, 0.24953169944254974, -0.04460536162859123, -0.12100089096317165, -0.25596994338066953, -0.18077216454242406, -0.1283088146868211, 0.11312772980646084, -0.08602637964251794, -0.3076905538573077, 0.36429826778016594, 0.062018585048223794, 0.2896842454118948, 0.1131205000350938, 0.28695961607522086, 0.16350405364248313, 0.17482684481594907, -0.027577768815191167, 0.1274706044871556, 0.10700708457366809, 0.07265350690699722, -0.16435210423936186, -0.026399887142408835, 0.18129791461519504] |
1,802.01433 | Interactive Grounded Language Acquisition and Generalization in a 2D
World | We build a virtual agent for learning language in a 2D maze-like world. The
agent sees images of the surrounding environment, listens to a virtual teacher,
and takes actions to receive rewards. It interactively learns the teacher's
language from scratch based on two language use cases: sentence-directed
navigation and question answering. It learns simultaneously the visual
representations of the world, the language, and the action control. By
disentangling language grounding from other computational routines and sharing
a concept detection function between language grounding and prediction, the
agent reliably interpolates and extrapolates to interpret sentences that
contain new word combinations or new words missing from training sentences. The
new words are transferred from the answers of language prediction. Such a
language ability is trained and evaluated on a population of over 1.6 million
distinct sentences consisting of 119 object words, 8 color words, 9
spatial-relation words, and 50 grammatical words. The proposed model
significantly outperforms five comparison methods for interpreting zero-shot
sentences. In addition, we demonstrate human-interpretable intermediate outputs
of the model in the appendix.
| cs.CL cs.AI cs.LG | we build a virtual agent for learning language in a 2d mazelike world the agent sees images of the surrounding environment listens to a virtual teacher and takes actions to receive rewards it interactively learns the teachers language from scratch based on two language use cases sentencedirected navigation and question answering it learns simultaneously the visual representations of the world the language and the action control by disentangling language grounding from other computational routines and sharing a concept detection function between language grounding and prediction the agent reliably interpolates and extrapolates to interpret sentences that contain new word combinations or new words missing from training sentences the new words are transferred from the answers of language prediction such a language ability is trained and evaluated on a population of over 16 million distinct sentences consisting of 119 object words 8 color words 9 spatialrelation words and 50 grammatical words the proposed model significantly outperforms five comparison methods for interpreting zeroshot sentences in addition we demonstrate humaninterpretable intermediate outputs of the model in the appendix | [['we', 'build', 'a', 'virtual', 'agent', 'for', 'learning', 'language', 'in', 'a', '2d', 'mazelike', 'world', 'the', 'agent', 'sees', 'images', 'of', 'the', 'surrounding', 'environment', 'listens', 'to', 'a', 'virtual', 'teacher', 'and', 'takes', 'actions', 'to', 'receive', 'rewards', 'it', 'interactively', 'learns', 'the', 'teachers', 'language', 'from', 'scratch', 'based', 'on', 'two', 'language', 'use', 'cases', 'sentencedirected', 'navigation', 'and', 'question', 'answering', 'it', 'learns', 'simultaneously', 'the', 'visual', 'representations', 'of', 'the', 'world', 'the', 'language', 'and', 'the', 'action', 'control', 'by', 'disentangling', 'language', 'grounding', 'from', 'other', 'computational', 'routines', 'and', 'sharing', 'a', 'concept', 'detection', 'function', 'between', 'language', 'grounding', 'and', 'prediction', 'the', 'agent', 'reliably', 'interpolates', 'and', 'extrapolates', 'to', 'interpret', 'sentences', 'that', 'contain', 'new', 'word', 'combinations', 'or', 'new', 'words', 'missing', 'from', 'training', 'sentences', 'the', 'new', 'words', 'are', 'transferred', 'from', 'the', 'answers', 'of', 'language', 'prediction', 'such', 'a', 'language', 'ability', 'is', 'trained', 'and', 'evaluated', 'on', 'a', 'population', 'of', 'over', '16', 'million', 'distinct', 'sentences', 'consisting', 'of', '119', 'object', 'words', '8', 'color', 'words', '9', 'spatialrelation', 'words', 'and', '50', 'grammatical', 'words', 'the', 'proposed', 'model', 'significantly', 'outperforms', 'five', 'comparison', 'methods', 'for', 'interpreting', 'zeroshot', 'sentences', 'in', 'addition', 'we', 'demonstrate', 'humaninterpretable', 'intermediate', 'outputs', 'of', 'the', 'model', 'in', 'the', 'appendix']] | [-0.011955961677094186, 0.0430930519265361, -0.03696883373438965, 0.11621871567128204, -0.18338860757107478, -0.19125166656124556, 0.09962621260824245, 0.4290763714220808, -0.3010643828107954, -0.3707405134959709, -0.01577152029088655, -0.3423167476241022, -0.13783047384166885, 0.17195770997610918, -0.14265514334912824, 0.004368670337541072, 0.13311152775815233, 0.11947291462443942, -0.013840200897268302, -0.27735735231815556, 0.30581982985821143, -0.027398371455790257, 0.27272251418380195, -0.05299428211249104, 0.18270517540296952, -0.01211573644561509, -0.06444292180957598, -0.06466374908049421, -0.0047300393373091556, 0.17215668450571261, 0.3727416140243931, 0.25035194078796047, 0.2997867669815436, -0.3691388558201102, -0.17938022690197064, 0.035339045565071794, 0.10051737063791776, 0.12173095634640303, -0.004854273840211072, -0.3654347197467402, 0.05730723295168583, -0.19562018872780162, 0.08651544915804596, -0.08293629120791678, 0.01956354872239645, -0.058965181338947355, -0.25648657208969167, -0.03471441407042263, 0.11569143234762948, 0.11440794217416497, -0.07878841021163173, -0.09856706572328369, 0.01139382752359758, 0.23301879321306207, 0.021228755062153607, 0.09330264196682418, 0.17077843269853052, -0.1821455207063145, -0.1842504634398718, 0.4006510032340884, -0.05692816835281244, -0.22186640353310247, 0.2407860417138287, -0.058672438275480514, -0.11579477224366327, 0.0787216509140075, 0.2135148564960028, 0.07121998015358004, -0.15339569759157182, 0.046761730162638, -0.07826072449266618, 0.2466336547222454, 0.1367209874781195, -0.03126121353869716, 0.2366537547807025, 0.2165414793545456, -0.0617394863477594, 0.13001018901373163, -0.06635564613307632, -0.06745064927422073, -0.2248337365318696, -0.15304610758023554, -0.15178406274157338, -0.03664798029633456, -0.10694401040822159, -0.1313911510108927, 0.4351983274289862, 0.23673367976254328, 0.1992582759595216, 0.15528584210754393, 0.3019562668145396, -0.02169397815000699, 0.11469570607398562, 0.11562482847799656, 0.07575421128963489, -0.016151230070241836, 0.12129151867364187, -0.1406466131298911, 0.10783759695423636, 0.08762850972341893] |
1,802.01434 | Invariance and conservation laws of some nonlinear Schrodinger equation
with PT-symmetric potentials and inhomogeneous nonlinearity | In this paper, we construct and analyse the symmetries and conservation laws
(conserved densities) of a model of a nonlinear Scrodinger equation with
PT-symmetric potentials and inhomogeneity.
| math-ph math.MP nlin.SI | in this paper we construct and analyse the symmetries and conservation laws conserved densities of a model of a nonlinear scrodinger equation with ptsymmetric potentials and inhomogeneity | [['in', 'this', 'paper', 'we', 'construct', 'and', 'analyse', 'the', 'symmetries', 'and', 'conservation', 'laws', 'conserved', 'densities', 'of', 'a', 'model', 'of', 'a', 'nonlinear', 'scrodinger', 'equation', 'with', 'ptsymmetric', 'potentials', 'and', 'inhomogeneity']] | [-0.1557328791047136, 0.11712358943704101, -0.09727453192075093, 0.05258091672375384, -0.037422357092577, -0.15518854472234292, -0.05429488816729712, 0.27886692462144075, -0.2230512993755164, -0.28401304063973604, 0.04344669515180781, -0.30319156483919535, -0.19363660917237954, 0.018512148815379652, -0.026991778777705297, 0.08296089460728345, -0.027849163308187767, -0.04958557068473763, -0.11105255322116944, -0.12517411254898267, 0.35947584536754423, -0.032441034257687906, 0.2494464082022508, 0.024276142181069764, 0.19610285541663566, -0.05227522332980125, 0.008280197986298136, 0.024201835522911063, -0.20080365688988455, 0.11697526598625162, 0.1680834661755297, 0.02867815602156851, 0.18807934386724676, -0.4526644371174, -0.26909077515894614, 0.13479794103100343, 0.12650088440299173, 0.18300357790387892, -0.07040978190316646, -0.26701624789792633, -0.0029697358711726135, -0.19169441486398378, -0.26263755918652926, -0.11158443162976592, 0.08407602000429674, 0.10899669780499405, -0.2713511259191566, 0.17929049453663606, 0.061400637651483216, 0.05399383632121263, -0.16627247758313185, 0.018391050570816907, -0.09926389241418629, -0.006854479528825592, 0.02440928674251255, -0.08906517709019007, 0.037677648666970154, -0.16828629980726098, -0.10062977713015345, 0.4324475123926445, -0.03859585585693518, -0.31663429088614603, 0.13503563914585998, -0.11565220769908693, -0.16426057082221465, 0.027148445033364825, 0.20631538436713595, 0.12587536462686127, -0.20643103353817155, 0.14577375313793137, -0.001794976234022114, 0.1287813968266602, 0.04958705169459184, 0.0193851953027425, 0.15262663847318403, 0.11243987559444374, 0.06403007754987036, 0.12490930874762987, 0.029977550609382213, -0.1517166471177781, -0.4053734805848863, -0.14784950543953865, -0.15087131169383172, 0.10485870874038448, -0.060557700157342305, -0.16775883265115596, 0.4619982703416436, 0.17155368898615794, 0.16927510727610853, 0.0723694169341966, 0.211987413207276, 0.24519128035064097, 0.04749859765999847, 0.06451595743635187, 0.17297041547243241, 0.22034844880302748, 0.15778487279183334, -0.25757071044709945, -0.10121036376114245, 0.07330432239299019] |
1,802.01435 | A Method for Restoring the Training Set Distribution in an Image
Classifier | Convolutional Neural Networks are a well-known staple of modern image
classification. However, it can be difficult to assess the quality and
robustness of such models. Deep models are known to perform well on a given
training and estimation set, but can easily be fooled by data that is
specifically generated for the purpose. It has been shown that one can produce
an artificial example that does not represent the desired class, but activates
the network in the desired way. This paper describes a new way of
reconstructing a sample from the training set distribution of an image
classifier without deep knowledge about the underlying distribution. This
enables access to the elements of images that most influence the decision of a
convolutional network and to extract meaningful information about the training
distribution.
| stat.ML cs.AI cs.CV | convolutional neural networks are a wellknown staple of modern image classification however it can be difficult to assess the quality and robustness of such models deep models are known to perform well on a given training and estimation set but can easily be fooled by data that is specifically generated for the purpose it has been shown that one can produce an artificial example that does not represent the desired class but activates the network in the desired way this paper describes a new way of reconstructing a sample from the training set distribution of an image classifier without deep knowledge about the underlying distribution this enables access to the elements of images that most influence the decision of a convolutional network and to extract meaningful information about the training distribution | [['convolutional', 'neural', 'networks', 'are', 'a', 'wellknown', 'staple', 'of', 'modern', 'image', 'classification', 'however', 'it', 'can', 'be', 'difficult', 'to', 'assess', 'the', 'quality', 'and', 'robustness', 'of', 'such', 'models', 'deep', 'models', 'are', 'known', 'to', 'perform', 'well', 'on', 'a', 'given', 'training', 'and', 'estimation', 'set', 'but', 'can', 'easily', 'be', 'fooled', 'by', 'data', 'that', 'is', 'specifically', 'generated', 'for', 'the', 'purpose', 'it', 'has', 'been', 'shown', 'that', 'one', 'can', 'produce', 'an', 'artificial', 'example', 'that', 'does', 'not', 'represent', 'the', 'desired', 'class', 'but', 'activates', 'the', 'network', 'in', 'the', 'desired', 'way', 'this', 'paper', 'describes', 'a', 'new', 'way', 'of', 'reconstructing', 'a', 'sample', 'from', 'the', 'training', 'set', 'distribution', 'of', 'an', 'image', 'classifier', 'without', 'deep', 'knowledge', 'about', 'the', 'underlying', 'distribution', 'this', 'enables', 'access', 'to', 'the', 'elements', 'of', 'images', 'that', 'most', 'influence', 'the', 'decision', 'of', 'a', 'convolutional', 'network', 'and', 'to', 'extract', 'meaningful', 'information', 'about', 'the', 'training', 'distribution']] | [-0.03916859086371873, 0.01710987926610987, -0.09864732370008039, 0.0818161235052296, -0.12830441821195926, -0.15130473088601049, 0.0104097431989472, 0.4414086874062551, -0.30393131679894386, -0.35698091185417113, 0.10236307105515152, -0.25632754099761484, -0.19781392727772357, 0.19250653399177206, -0.1217884903681244, 0.08686980065971414, 0.11241333262696293, 0.08451671987587145, -0.03229178457684417, -0.2740123905614729, 0.32528243929090844, 0.05480439736612696, 0.3354239675735358, -0.005223522083620534, 0.11328879526957607, -0.04096124384250983, -0.01884705408561605, -0.003131529808627399, -0.02562702866204488, 0.17111583931357352, 0.28008959796671795, 0.22512864591802634, 0.3021090444326685, -0.41334468559227583, -0.2527857498258694, 0.1388834729970198, 0.1675427607936031, 0.16200876566545883, -0.02161565752618214, -0.2955493767326342, 0.12273114892647012, -0.1478161632513471, -0.03868951658071339, -0.15624324957491786, -0.028709914477520714, -0.021405701150936395, -0.3009992094447424, -0.017234278099881557, 0.0862612938730558, 0.017868033304583024, -0.024287314421696345, -0.07950210379337082, -0.023504099373186704, 0.2127963089071328, -0.009345344959168148, 0.07867725267348712, 0.11705531821166741, -0.20013935997627164, -0.08092549877003091, 0.37023636087320233, -0.024195262142066055, -0.21723809999676832, 0.1925030758831906, -0.06613413649540081, -0.13036311015074376, 0.11719639519698748, 0.23844031313121433, 0.09061761036291292, -0.2214077350591089, -0.0005143904851443839, -0.06169928376427816, 0.20341814406045522, 0.03391335308836162, -0.0014965283321856542, 0.2044148946443985, 0.2328511245143493, 0.03142174990591771, 0.13202452011058063, -0.13096292325444803, -0.036455984525951265, -0.2367667961494201, -0.1068269299016199, -0.23763286017009433, 0.04200167831520902, -0.06667519491203645, -0.17500730662296513, 0.4171398353944213, 0.22268462482882478, 0.23464353597289278, 0.08316073086795234, 0.30944869347371673, 0.05247772165653225, 0.1504196910656818, 0.0798704183006389, 0.196026842003219, 0.05632068792834366, 0.07068000393315353, -0.11881928267810522, 0.16387210516898915, -0.0017956511600952566] |
1,802.01436 | Variational image compression with a scale hyperprior | We describe an end-to-end trainable model for image compression based on
variational autoencoders. The model incorporates a hyperprior to effectively
capture spatial dependencies in the latent representation. This hyperprior
relates to side information, a concept universal to virtually all modern image
codecs, but largely unexplored in image compression using artificial neural
networks (ANNs). Unlike existing autoencoder compression methods, our model
trains a complex prior jointly with the underlying autoencoder. We demonstrate
that this model leads to state-of-the-art image compression when measuring
visual quality using the popular MS-SSIM index, and yields rate-distortion
performance surpassing published ANN-based methods when evaluated using a more
traditional metric based on squared error (PSNR). Furthermore, we provide a
qualitative comparison of models trained for different distortion metrics.
| eess.IV cs.IT math.IT | we describe an endtoend trainable model for image compression based on variational autoencoders the model incorporates a hyperprior to effectively capture spatial dependencies in the latent representation this hyperprior relates to side information a concept universal to virtually all modern image codecs but largely unexplored in image compression using artificial neural networks anns unlike existing autoencoder compression methods our model trains a complex prior jointly with the underlying autoencoder we demonstrate that this model leads to stateoftheart image compression when measuring visual quality using the popular msssim index and yields ratedistortion performance surpassing published annbased methods when evaluated using a more traditional metric based on squared error psnr furthermore we provide a qualitative comparison of models trained for different distortion metrics | [['we', 'describe', 'an', 'endtoend', 'trainable', 'model', 'for', 'image', 'compression', 'based', 'on', 'variational', 'autoencoders', 'the', 'model', 'incorporates', 'a', 'hyperprior', 'to', 'effectively', 'capture', 'spatial', 'dependencies', 'in', 'the', 'latent', 'representation', 'this', 'hyperprior', 'relates', 'to', 'side', 'information', 'a', 'concept', 'universal', 'to', 'virtually', 'all', 'modern', 'image', 'codecs', 'but', 'largely', 'unexplored', 'in', 'image', 'compression', 'using', 'artificial', 'neural', 'networks', 'anns', 'unlike', 'existing', 'autoencoder', 'compression', 'methods', 'our', 'model', 'trains', 'a', 'complex', 'prior', 'jointly', 'with', 'the', 'underlying', 'autoencoder', 'we', 'demonstrate', 'that', 'this', 'model', 'leads', 'to', 'stateoftheart', 'image', 'compression', 'when', 'measuring', 'visual', 'quality', 'using', 'the', 'popular', 'msssim', 'index', 'and', 'yields', 'ratedistortion', 'performance', 'surpassing', 'published', 'annbased', 'methods', 'when', 'evaluated', 'using', 'a', 'more', 'traditional', 'metric', 'based', 'on', 'squared', 'error', 'psnr', 'furthermore', 'we', 'provide', 'a', 'qualitative', 'comparison', 'of', 'models', 'trained', 'for', 'different', 'distortion', 'metrics']] | [-0.019693143319430922, -0.05909103900855619, -0.11192071445917418, 0.1244209660120955, -0.10095059888221877, -0.19425806079506258, 0.011687495332011136, 0.49559558167561024, -0.28177420337769116, -0.3019690775150849, 0.022982304407791657, -0.2659029956937821, -0.2289825724360864, 0.19617721448413844, -0.1670434795337352, 0.12740655750092042, 0.11647515348351199, 0.08268075776387444, -0.1330015405085061, -0.28873358195847715, 0.28726644687208325, 0.08104512032336933, 0.42705650496958514, -0.00875410276719115, 0.1747030133854363, -0.016360704584551345, -0.04544487354068532, -0.02323234402997927, -0.09591334136156028, 0.2211150123164335, 0.26799047741720144, 0.19704946384415, 0.26486605570905586, -0.39580981949852273, -0.3264263835158353, 0.06861091905258103, 0.1384148105193884, 0.09779062908727768, -0.036200725277794395, -0.3293205351868937, 0.07207896555523766, -0.17182716418611854, 0.10399398519773005, -0.14600407049610195, -0.07920493277113054, -0.006743652050956807, -0.30849964063891694, 0.08228990898949497, 0.0777053319317989, 0.06372145918190233, -0.08907370071103873, -0.13999224668907478, 0.06488795322269848, 0.13236779936114018, 0.005552226619810359, 0.09903942091555973, 0.13347217037673453, -0.18531181218539372, -0.11283216659799372, 0.3478466799282584, -0.11261057840421611, -0.2611572109124323, 0.1647973078041345, 0.015152272752924892, -0.12396254940035421, 0.09487492995228895, 0.23811363717271708, 0.07100272261776215, -0.16142376453913018, 0.0008666328542234668, -0.017687348779752726, 0.2510334704925637, 0.06603538762000659, -0.0026371613460446685, 0.11547642191852758, 0.26787019758831615, 0.0008123951602326937, 0.16289380730768618, -0.1472191801544833, -0.08342523322140505, -0.1786392472130208, -0.06641825454401945, -0.19071609273549045, -0.026533921951551204, -0.1564063278741486, -0.17864135643351853, 0.40132984290022616, 0.26067813035978143, 0.2264244143296926, 0.13215953863633811, 0.4079008614336533, 0.03154941618515656, 0.12304420636828281, 0.10201036723807824, 0.18466823224809545, 0.04195669857584987, 0.07586741966218495, -0.11561771622504885, 0.09347394573471456, 0.0871669666010363] |
1,802.01437 | Transfer-matrix calculations of the effects of tension and torque
constraints on DNA-protein interactions | Organization and maintenance of the chromosomal DNA in living cells strongly
depends on the DNA interactions with a plethora of DNA-binding proteins.
Single-molecule studies show that formation of nucleoprotein complexes on DNA
by such proteins is frequently subject to force and torque constraints applied
to the DNA. Although the existing experimental techniques allow to exert these
type of mechanical constraints on individual DNA biopolymers, their exact
effects in regulation of DNA-protein interactions are still not completely
understood due to the lack of systematic theoretical methods able to
efficiently interpret complex experimental observations. To fill this gap, we
have developed a general theoretical framework based on the transfer-matrix
calculations that can be used to accurately describe behaviour of DNA-protein
interactions under force and torque constraints. Potential applications of the
constructed theoretical approach are demonstrated by predicting how these
constraints affect the DNA-binding properties of different types of
architectural proteins. Obtained results provide important insights into
potential physiological functions of mechanical forces in the chromosomal DNA
organization by architectural proteins as well as into single-DNA manipulation
studies of DNA-protein interactions.
| q-bio.BM | organization and maintenance of the chromosomal dna in living cells strongly depends on the dna interactions with a plethora of dnabinding proteins singlemolecule studies show that formation of nucleoprotein complexes on dna by such proteins is frequently subject to force and torque constraints applied to the dna although the existing experimental techniques allow to exert these type of mechanical constraints on individual dna biopolymers their exact effects in regulation of dnaprotein interactions are still not completely understood due to the lack of systematic theoretical methods able to efficiently interpret complex experimental observations to fill this gap we have developed a general theoretical framework based on the transfermatrix calculations that can be used to accurately describe behaviour of dnaprotein interactions under force and torque constraints potential applications of the constructed theoretical approach are demonstrated by predicting how these constraints affect the dnabinding properties of different types of architectural proteins obtained results provide important insights into potential physiological functions of mechanical forces in the chromosomal dna organization by architectural proteins as well as into singledna manipulation studies of dnaprotein interactions | [['organization', 'and', 'maintenance', 'of', 'the', 'chromosomal', 'dna', 'in', 'living', 'cells', 'strongly', 'depends', 'on', 'the', 'dna', 'interactions', 'with', 'a', 'plethora', 'of', 'dnabinding', 'proteins', 'singlemolecule', 'studies', 'show', 'that', 'formation', 'of', 'nucleoprotein', 'complexes', 'on', 'dna', 'by', 'such', 'proteins', 'is', 'frequently', 'subject', 'to', 'force', 'and', 'torque', 'constraints', 'applied', 'to', 'the', 'dna', 'although', 'the', 'existing', 'experimental', 'techniques', 'allow', 'to', 'exert', 'these', 'type', 'of', 'mechanical', 'constraints', 'on', 'individual', 'dna', 'biopolymers', 'their', 'exact', 'effects', 'in', 'regulation', 'of', 'dnaprotein', 'interactions', 'are', 'still', 'not', 'completely', 'understood', 'due', 'to', 'the', 'lack', 'of', 'systematic', 'theoretical', 'methods', 'able', 'to', 'efficiently', 'interpret', 'complex', 'experimental', 'observations', 'to', 'fill', 'this', 'gap', 'we', 'have', 'developed', 'a', 'general', 'theoretical', 'framework', 'based', 'on', 'the', 'transfermatrix', 'calculations', 'that', 'can', 'be', 'used', 'to', 'accurately', 'describe', 'behaviour', 'of', 'dnaprotein', 'interactions', 'under', 'force', 'and', 'torque', 'constraints', 'potential', 'applications', 'of', 'the', 'constructed', 'theoretical', 'approach', 'are', 'demonstrated', 'by', 'predicting', 'how', 'these', 'constraints', 'affect', 'the', 'dnabinding', 'properties', 'of', 'different', 'types', 'of', 'architectural', 'proteins', 'obtained', 'results', 'provide', 'important', 'insights', 'into', 'potential', 'physiological', 'functions', 'of', 'mechanical', 'forces', 'in', 'the', 'chromosomal', 'dna', 'organization', 'by', 'architectural', 'proteins', 'as', 'well', 'as', 'into', 'singledna', 'manipulation', 'studies', 'of', 'dnaprotein', 'interactions']] | [-0.11191281223384496, 0.11084113517721195, -0.05420543618625804, 0.08851529226384618, -0.08232647759756179, -0.13878833583629366, 0.05988133411456862, 0.39757400937378407, -0.2813353861650724, -0.3081086822209901, 0.012725460903556871, -0.21820831129568094, -0.24613115168961414, 0.20745280638351524, -0.04179284825994309, 0.045041048334220825, 0.08940381557468764, -0.008501855787144859, 0.04616107678647791, -0.1946861176264964, 0.23857862206981675, 0.06730648298784463, 0.2811915653789144, 0.13945474655575413, 0.052830715132667946, -0.020852089019785268, 0.0019988527749089545, 0.022726458586291985, -0.20028072884713438, 0.20099894088212913, 0.28311086466975427, 0.1112986773074594, 0.24630984033750936, -0.5637326826226343, -0.2520017720166374, 0.07163449785452378, 0.16348585614599706, 0.13983194435308322, -0.057243672942512494, -0.2727272489129074, 0.055937329817333084, -0.12571150133140344, -0.07937087952139725, -0.1636034918457186, 0.000876501751958989, 0.13269749074504616, -0.20771038875486073, 0.0901631268808681, 0.03345321845119359, 0.09141077205836819, -0.11708937843298811, -0.12393025051098673, -0.03418311134655698, 0.20524216433882378, 0.08226388144919, 0.002817744947708306, 0.283523056543631, -0.12627249653058734, -0.13928268173169292, 0.3940867679376741, 0.03389520857619185, -0.24159995711269905, 0.23888851561599275, -0.08442540408970181, -0.17820966283769837, 0.11624519981893847, 0.1641445319283377, 0.06477761496737432, -0.218878584618293, 0.03199844089306608, 0.05083858594298363, 0.1798377809732148, 0.0490303350570991, 0.026537804279981307, 0.23152860813104453, 0.20129223054162426, -0.01729027549422273, 0.11884987934752828, -0.02258562328479661, -0.12003210242419096, -0.18060584265864296, -0.09061773757782524, -0.13963408234955618, 0.046923343292414606, -0.0422382734221664, -0.16979203906611362, 0.37241485607391744, 0.12974518567998633, 0.1817127565089404, 0.02632279928611445, 0.2694502296763357, -0.04163895095463089, 0.13766821609741978, -0.08758096356373908, 0.22699841078216462, 0.09217397118735472, 0.05024016876129454, -0.290404262267422, 0.1303626445711988, 0.008930248184799311] |
1,802.01438 | Studying Antimatter Gravity with Muonium | The gravitational acceleration of antimatter, gbar, has yet to be directly
measured; an unexpected outcome of its measurement could change our
understanding of gravity, the universe, and the possibility of a fifth force.
Three avenues are apparent for such a measurement: antihydrogen, positronium,
and muonium, the last requiring a precision atom interferometer and novel
muonium beam under development. The interferometer and its few-picometer
alignment and calibration systems appear feasible. With 100 nm grating pitch,
measurements of gbar to 10%, 1%, or better can be envisioned. These could
constitute the first gravitational measurements of leptonic matter, of
2nd-generation matter, and possibly, of antimatter.
| physics.ins-det gr-qc hep-ex nucl-ex physics.atom-ph | the gravitational acceleration of antimatter gbar has yet to be directly measured an unexpected outcome of its measurement could change our understanding of gravity the universe and the possibility of a fifth force three avenues are apparent for such a measurement antihydrogen positronium and muonium the last requiring a precision atom interferometer and novel muonium beam under development the interferometer and its fewpicometer alignment and calibration systems appear feasible with 100 nm grating pitch measurements of gbar to 10 1 or better can be envisioned these could constitute the first gravitational measurements of leptonic matter of 2ndgeneration matter and possibly of antimatter | [['the', 'gravitational', 'acceleration', 'of', 'antimatter', 'gbar', 'has', 'yet', 'to', 'be', 'directly', 'measured', 'an', 'unexpected', 'outcome', 'of', 'its', 'measurement', 'could', 'change', 'our', 'understanding', 'of', 'gravity', 'the', 'universe', 'and', 'the', 'possibility', 'of', 'a', 'fifth', 'force', 'three', 'avenues', 'are', 'apparent', 'for', 'such', 'a', 'measurement', 'antihydrogen', 'positronium', 'and', 'muonium', 'the', 'last', 'requiring', 'a', 'precision', 'atom', 'interferometer', 'and', 'novel', 'muonium', 'beam', 'under', 'development', 'the', 'interferometer', 'and', 'its', 'fewpicometer', 'alignment', 'and', 'calibration', 'systems', 'appear', 'feasible', 'with', '100', 'nm', 'grating', 'pitch', 'measurements', 'of', 'gbar', 'to', '10', '1', 'or', 'better', 'can', 'be', 'envisioned', 'these', 'could', 'constitute', 'the', 'first', 'gravitational', 'measurements', 'of', 'leptonic', 'matter', 'of', '2ndgeneration', 'matter', 'and', 'possibly', 'of', 'antimatter']] | [-0.13137426450018688, 0.21003263672980327, -0.09669645468123478, 0.03726916331428998, -0.07069762777721528, -0.14729783992458245, -0.00082265703689934, 0.3592020482710092, -0.2297493501999738, -0.38596851610126764, 0.03813558079228543, -0.24504981870477152, -0.0044025705302005065, 0.21258719147201444, 0.02710279331330468, 0.0710510496882316, 0.050919567274003485, -0.004876622118719733, -0.05203275624109377, -0.2034778414976479, 0.2647890612381593, 0.12899699923351848, 0.20362036360778135, 0.07821360468751483, 0.10648020072309945, -0.06834637893751117, -0.03619324669039043, -0.018000237353256728, -0.07818898402320423, 0.1051894355805056, 0.2113745209281471, 0.14315300347228158, 0.2085699298151649, -0.4339894961455081, -0.1782444295681446, 0.1578232354143321, 0.11749477745817587, 0.1555177812270894, -0.07521372689118627, -0.35721663545614274, 0.001458305601574628, -0.17347214805506317, -0.1475213616164309, -0.04543653884810386, 0.028067935411449484, -0.01932334191497821, -0.24903673199143742, 0.05971277690501792, 0.007206975141226655, -0.010166886963392838, -0.06693419427057673, -0.10428140395191858, 0.07199696855997612, 0.05458944582029956, 0.01328484522695146, 0.0905113191998536, 0.20743246228056084, -0.11611587191830472, -0.15839857860735737, 0.46945827878495255, -0.09383990939033429, -0.08858464809485, 0.16395145852469128, -0.22478947141161648, -0.08636598195419601, 0.12668771609562532, 0.13230627914429596, 0.05867906653847877, -0.1364172364834069, 0.0021281743797907, 0.051437598948210185, 0.17380375081285981, 0.13766379578334123, 0.08514575450911675, 0.33122205347892375, 0.20222426642834365, 0.06255534235941301, 0.020391040939219885, -0.15348681788153873, 0.025003427662656154, -0.3282857782179766, -0.2208093074473119, -0.14541774777531863, 0.07577000870046639, -0.07016082782451626, -0.07556809626270712, 0.34871749900797805, 0.10833412398224568, 0.1203143481893631, -0.043187679961498936, 0.3351946499678168, 0.033069458178078555, 0.05845009380638009, -0.05673822897053001, 0.39683047128785953, 0.14929448324716696, 0.10034029860519758, -0.22718055920656954, 0.0725460236904783, -0.06035099549237454] |
1,802.01439 | Efficiency of high-performance discontinuous Galerkin spectral element
methods for under-resolved turbulent incompressible flows | The present paper addresses the numerical solution of turbulent flows with
high-order discontinuous Galerkin methods for discretizing the incompressible
Navier-Stokes equations. The efficiency of high-order methods when applied to
under-resolved problems is an open issue in literature. This topic is carefully
investigated in the present work by the example of the 3D Taylor-Green vortex
problem. Our implementation is based on a generic high-performance framework
for matrix-free evaluation of finite element operators with one of the best
realizations currently known. We present a methodology to systematically
analyze the efficiency of the incompressible Navier-Stokes solver for high
polynomial degrees. Due to the absence of optimal rates of convergence in the
under-resolved regime, our results reveal that demonstrating improved
efficiency of high-order methods is a challenging task and that optimal
computational complexity of solvers, preconditioners, and matrix-free
implementations are necessary ingredients to achieve the goal of better
solution quality at the same computational costs already for a geometrically
simple problem such as the Taylor-Green vortex. Although the analysis is
performed for a Cartesian geometry, our approach is generic and can be applied
to arbitrary geometries. We present excellent performance numbers on modern,
cache-based computer architectures achieving a throughput for operator
evaluation of 3e8 up to 1e9 DoFs/sec on one Intel Haswell node with 28 cores.
Compared to performance results published within the last 5 years for
high-order DG discretizations of the compressible Navier-Stokes equations, our
approach reduces computational costs by more than one order of magnitude for
the same setup.
| physics.flu-dyn physics.comp-ph | the present paper addresses the numerical solution of turbulent flows with highorder discontinuous galerkin methods for discretizing the incompressible navierstokes equations the efficiency of highorder methods when applied to underresolved problems is an open issue in literature this topic is carefully investigated in the present work by the example of the 3d taylorgreen vortex problem our implementation is based on a generic highperformance framework for matrixfree evaluation of finite element operators with one of the best realizations currently known we present a methodology to systematically analyze the efficiency of the incompressible navierstokes solver for high polynomial degrees due to the absence of optimal rates of convergence in the underresolved regime our results reveal that demonstrating improved efficiency of highorder methods is a challenging task and that optimal computational complexity of solvers preconditioners and matrixfree implementations are necessary ingredients to achieve the goal of better solution quality at the same computational costs already for a geometrically simple problem such as the taylorgreen vortex although the analysis is performed for a cartesian geometry our approach is generic and can be applied to arbitrary geometries we present excellent performance numbers on modern cachebased computer architectures achieving a throughput for operator evaluation of 3e8 up to 1e9 dofssec on one intel haswell node with 28 cores compared to performance results published within the last 5 years for highorder dg discretizations of the compressible navierstokes equations our approach reduces computational costs by more than one order of magnitude for the same setup | [['the', 'present', 'paper', 'addresses', 'the', 'numerical', 'solution', 'of', 'turbulent', 'flows', 'with', 'highorder', 'discontinuous', 'galerkin', 'methods', 'for', 'discretizing', 'the', 'incompressible', 'navierstokes', 'equations', 'the', 'efficiency', 'of', 'highorder', 'methods', 'when', 'applied', 'to', 'underresolved', 'problems', 'is', 'an', 'open', 'issue', 'in', 'literature', 'this', 'topic', 'is', 'carefully', 'investigated', 'in', 'the', 'present', 'work', 'by', 'the', 'example', 'of', 'the', '3d', 'taylorgreen', 'vortex', 'problem', 'our', 'implementation', 'is', 'based', 'on', 'a', 'generic', 'highperformance', 'framework', 'for', 'matrixfree', 'evaluation', 'of', 'finite', 'element', 'operators', 'with', 'one', 'of', 'the', 'best', 'realizations', 'currently', 'known', 'we', 'present', 'a', 'methodology', 'to', 'systematically', 'analyze', 'the', 'efficiency', 'of', 'the', 'incompressible', 'navierstokes', 'solver', 'for', 'high', 'polynomial', 'degrees', 'due', 'to', 'the', 'absence', 'of', 'optimal', 'rates', 'of', 'convergence', 'in', 'the', 'underresolved', 'regime', 'our', 'results', 'reveal', 'that', 'demonstrating', 'improved', 'efficiency', 'of', 'highorder', 'methods', 'is', 'a', 'challenging', 'task', 'and', 'that', 'optimal', 'computational', 'complexity', 'of', 'solvers', 'preconditioners', 'and', 'matrixfree', 'implementations', 'are', 'necessary', 'ingredients', 'to', 'achieve', 'the', 'goal', 'of', 'better', 'solution', 'quality', 'at', 'the', 'same', 'computational', 'costs', 'already', 'for', 'a', 'geometrically', 'simple', 'problem', 'such', 'as', 'the', 'taylorgreen', 'vortex', 'although', 'the', 'analysis', 'is', 'performed', 'for', 'a', 'cartesian', 'geometry', 'our', 'approach', 'is', 'generic', 'and', 'can', 'be', 'applied', 'to', 'arbitrary', 'geometries', 'we', 'present', 'excellent', 'performance', 'numbers', 'on', 'modern', 'cachebased', 'computer', 'architectures', 'achieving', 'a', 'throughput', 'for', 'operator', 'evaluation', 'of', '3e8', 'up', 'to', '1e9', 'dofssec', 'on', 'one', 'intel', 'haswell', 'node', 'with', '28', 'cores', 'compared', 'to', 'performance', 'results', 'published', 'within', 'the', 'last', '5', 'years', 'for', 'highorder', 'dg', 'discretizations', 'of', 'the', 'compressible', 'navierstokes', 'equations', 'our', 'approach', 'reduces', 'computational', 'costs', 'by', 'more', 'than', 'one', 'order', 'of', 'magnitude', 'for', 'the', 'same', 'setup']] | [-0.1126882661890231, -0.006527511457327235, -0.04652565510421083, 0.023646565421571484, -0.055439405479256396, -0.11964923017696152, 0.010854744686976045, 0.3576270108739656, -0.24482599314022052, -0.3221156033706223, 0.13670135993270083, -0.2230739205416928, -0.09503293917249374, 0.25682539161771717, -0.0822441837839343, 0.13920868133247746, 0.1342845559101249, -0.04719312402052517, -0.09854361578457214, -0.2896984587201971, 0.2849955032967652, 0.05698116780902312, 0.3044225862666177, 0.04137780707200792, 0.11770611458561644, -0.11170149328209823, -0.015075612820806057, 0.03365092265714959, -0.11562584113379101, 0.13109788926752716, 0.2923841094068153, 0.07121850647030722, 0.31322279140141196, -0.44898677085799815, -0.21110581326567213, 0.034105768992766225, 0.15956983839614106, 0.1163735694935303, -0.046153402372703003, -0.234149739733988, 0.12767515604230917, -0.1729819839763478, -0.13101590079126682, -0.10905283549374606, -0.019367434324817807, 0.028797552464208072, -0.2874985475138557, 0.07727667605277241, 0.04361240844936981, 0.0707839510471719, -0.04794137375107474, -0.13464260473752743, 0.04736867439705969, 0.08695062045237462, 0.0181766085845335, 0.017315220229736552, 0.06330428201713735, -0.13157424744411667, -0.14485275038854953, 0.429020437355176, -0.04926688952459736, -0.2772584580996157, 0.1989685176063435, -0.07287601059268616, -0.11974534607961834, 0.1479450961275829, 0.20163645338441238, 0.16492946999056673, -0.09625131669729935, 0.06944707742578926, -0.024758095290829858, 0.17792792787928724, 0.03590140583625866, -0.02067082399044307, 0.11091751410489584, 0.24663039714446275, 0.09889831405693317, 0.13722099286581108, -0.06342833549753438, -0.13830729717827908, -0.26853505396889904, -0.15288612347217354, -0.17733808642071558, -0.011376722443686055, -0.12022882426798588, -0.1453526245649692, 0.3825935026842768, 0.20029719073014954, 0.09577070591177193, 0.07622577357649538, 0.3758022454605112, 0.11111992322489604, 0.051085047663295476, 0.1387016501888629, 0.21053012596997925, 0.12544793978606056, 0.14741214103092878, -0.2546590714492055, 0.021653122661400556, 0.13442117577452758] |
1,802.0144 | A Robotic "Social Media" Controlled Observatory for Education and
Research | I describe the world's first robotic observatory to interact with its
observers entirely using the social media platforms Facebook or Twitter. The
telescope "tweets" what it's doing, posts live images, and responds to observer
commands through a comprehensive command set. Observation requests are queued
and observed by a responsive queue engine. Its architecture, social media based
image processing capability and several usage examples are also described.
| physics.ed-ph astro-ph.IM | i describe the worlds first robotic observatory to interact with its observers entirely using the social media platforms facebook or twitter the telescope tweets what its doing posts live images and responds to observer commands through a comprehensive command set observation requests are queued and observed by a responsive queue engine its architecture social media based image processing capability and several usage examples are also described | [['i', 'describe', 'the', 'worlds', 'first', 'robotic', 'observatory', 'to', 'interact', 'with', 'its', 'observers', 'entirely', 'using', 'the', 'social', 'media', 'platforms', 'facebook', 'or', 'twitter', 'the', 'telescope', 'tweets', 'what', 'its', 'doing', 'posts', 'live', 'images', 'and', 'responds', 'to', 'observer', 'commands', 'through', 'a', 'comprehensive', 'command', 'set', 'observation', 'requests', 'are', 'queued', 'and', 'observed', 'by', 'a', 'responsive', 'queue', 'engine', 'its', 'architecture', 'social', 'media', 'based', 'image', 'processing', 'capability', 'and', 'several', 'usage', 'examples', 'are', 'also', 'described']] | [-0.14305561498710603, 0.06284036870453168, -0.059310754888098345, 0.07072360460403036, -0.25198340482276044, -0.21114542880659978, 0.11150406866870595, 0.5092828379887523, -0.25636386678017903, -0.3599402463966698, 0.11104259263216094, -0.43113435895153973, -0.18841128985778513, 0.20143415977486945, -0.05645880845347137, 0.003697095803076853, 0.111895624934484, 0.08471156565020933, 0.07777442639891172, -0.28203107505528763, 0.22390728181220987, 0.08864880255141268, 0.3063148401049671, -0.027873031632748967, 0.13517656557572386, -0.0493883147560568, -0.09362456456504085, -0.014178426336553512, -0.038966469283243925, 0.11648852801458402, 0.34451065972009953, 0.28578361741683417, 0.31177193809046666, -0.47312257297788607, -0.16206986886082272, 0.003694362472742796, 0.11250070915698554, 0.010259719451300263, -0.042346489100688785, -0.45497831513851206, 0.00989880024236768, -0.20926953867698708, -0.07042178686595324, -0.03730839509234735, 0.04187678993912414, 0.039900425863875585, -0.16494925987596312, -0.07491972813582062, -0.03936919005531253, 0.12538823090267903, -0.040233257281325874, 0.03290261587156265, -0.01416419388789853, 0.2331638305243387, 0.0354502968151461, -0.05138462099641787, 0.29843207437432173, -0.1301769440090566, -0.16007851300210776, 0.4340109853779502, -0.00022389069481781036, -0.11334859592501413, 0.18020842981059104, -0.0238132519527536, -0.09315990876745094, 0.07920755608233088, 0.27995725554611645, 0.08875961617961751, -0.2267795065558995, -0.03687861848128236, -0.062291483408912565, 0.21402640528200814, 0.09278216915360342, 0.002604309984511047, 0.20336037449482264, 0.1966231097890572, 0.010980557311664928, 0.09492456256835298, -0.044980572748251936, -0.05543166517534039, -0.2198566279063622, -0.13770076100957918, -0.1748598283297862, 0.010790254504448085, -0.07219222299406255, -0.10567082434356438, 0.36736298815319035, 0.1843842817823205, 0.12970420347075118, 0.05924420769566275, 0.3540153379382735, -0.06388873758767273, 0.09739389528068855, 0.13573767033151604, 0.1361745989909678, -0.06285351021991421, 0.3200595849687516, -0.1276113104681964, 0.11030448559728084, -0.015097661099086205] |
1,802.01441 | Survival amplitude, instantaneous energy and decay rate of an unstable
system: Analytical results | We consider a model of a unstable state defined by the truncated Breit-Wigner
energy density distribution function. An analytical form of the survival
amplitude $a(t)$ of the state considered is found. Our attention is focused on
the late time properties of $a(t)$ and on effects generated by the
non--exponential behavior of this amplitude in the late time region: In 1957
Khalfin proved that this amplitude tends to zero as $t$ goes to the infinity
more slowly than any exponential function of $t$. This effect can be described
using a time-dependent decay rate $\gamma(t)$ and then the Khalfin result means
that this $\gamma(t)$ is not a constant but at late times it tends to zero as
$t$ goes to the infinity. It appears that the energy $E(t)$ of the unstable
state behaves similarly: It tends to the minimal energy $E_{min}$ of the system
as $t \to \infty$. Within the model considered we find two first leading time
dependent elements of late time asymptotic expansions of $E(t)$ and $\gamma
(t)$. We discuss also possible implications of such a late time asymptotic
properties of $E(t)$ and $\gamma (t)$ and cases where these properties may
manifest themselves.
| quant-ph gr-qc hep-ph | we consider a model of a unstable state defined by the truncated breitwigner energy density distribution function an analytical form of the survival amplitude at of the state considered is found our attention is focused on the late time properties of at and on effects generated by the nonexponential behavior of this amplitude in the late time region in 1957 khalfin proved that this amplitude tends to zero as t goes to the infinity more slowly than any exponential function of t this effect can be described using a timedependent decay rate gammat and then the khalfin result means that this gammat is not a constant but at late times it tends to zero as t goes to the infinity it appears that the energy et of the unstable state behaves similarly it tends to the minimal energy e_min of the system as t to infty within the model considered we find two first leading time dependent elements of late time asymptotic expansions of et and gamma t we discuss also possible implications of such a late time asymptotic properties of et and gamma t and cases where these properties may manifest themselves | [['we', 'consider', 'a', 'model', 'of', 'a', 'unstable', 'state', 'defined', 'by', 'the', 'truncated', 'breitwigner', 'energy', 'density', 'distribution', 'function', 'an', 'analytical', 'form', 'of', 'the', 'survival', 'amplitude', 'at', 'of', 'the', 'state', 'considered', 'is', 'found', 'our', 'attention', 'is', 'focused', 'on', 'the', 'late', 'time', 'properties', 'of', 'at', 'and', 'on', 'effects', 'generated', 'by', 'the', 'nonexponential', 'behavior', 'of', 'this', 'amplitude', 'in', 'the', 'late', 'time', 'region', 'in', '1957', 'khalfin', 'proved', 'that', 'this', 'amplitude', 'tends', 'to', 'zero', 'as', 't', 'goes', 'to', 'the', 'infinity', 'more', 'slowly', 'than', 'any', 'exponential', 'function', 'of', 't', 'this', 'effect', 'can', 'be', 'described', 'using', 'a', 'timedependent', 'decay', 'rate', 'gammat', 'and', 'then', 'the', 'khalfin', 'result', 'means', 'that', 'this', 'gammat', 'is', 'not', 'a', 'constant', 'but', 'at', 'late', 'times', 'it', 'tends', 'to', 'zero', 'as', 't', 'goes', 'to', 'the', 'infinity', 'it', 'appears', 'that', 'the', 'energy', 'et', 'of', 'the', 'unstable', 'state', 'behaves', 'similarly', 'it', 'tends', 'to', 'the', 'minimal', 'energy', 'e_min', 'of', 'the', 'system', 'as', 't', 'to', 'infty', 'within', 'the', 'model', 'considered', 'we', 'find', 'two', 'first', 'leading', 'time', 'dependent', 'elements', 'of', 'late', 'time', 'asymptotic', 'expansions', 'of', 'et', 'and', 'gamma', 't', 'we', 'discuss', 'also', 'possible', 'implications', 'of', 'such', 'a', 'late', 'time', 'asymptotic', 'properties', 'of', 'et', 'and', 'gamma', 't', 'and', 'cases', 'where', 'these', 'properties', 'may', 'manifest', 'themselves']] | [-0.12653919701706354, 0.190747985050008, -0.13405079594837416, 0.07353220623013096, -0.02680202507187125, -0.10664148201413183, 0.06475163694142987, 0.30829688937794125, -0.26423184929531396, -0.25709012894857425, 0.07862282439057806, -0.26673374039849623, -0.10986385470825619, 0.14806881824199478, -0.0037309138921337985, 0.04465376350478573, -0.004926954160825653, 0.1072170701990184, -0.060607238577973156, -0.24101053196767952, 0.2652836195657686, 0.09530402318254949, 0.23625029863924188, 0.020303032450242828, 0.056828800266140525, -0.011526845360580117, -0.0032355261995539145, 0.008717795577656265, -0.17004571500570734, -0.04251591788865433, 0.20389677691659433, 0.09225813593773335, 0.27604218765880933, -0.3952530458945916, -0.20217366961019181, 0.13109429661483732, 0.18138941514204435, 0.07107908309104374, 0.017321491643464932, -0.23649703114416565, 0.07624863430862484, -0.1623724629147065, -0.20361863760461, -0.0293643595298681, 0.09346647641001453, 0.008785063416547494, -0.28166954817945244, 0.11026976664217039, 0.09697257039146835, -0.03395098497261115, -0.03812416061249904, -0.12235084439475823, -0.036197102419945164, 0.09901700330472314, 0.128884395045817, 0.05897339682427713, 0.09669656038689645, -0.0998141447521283, -0.04180463796742068, 0.32322406852762625, -0.13473855163710532, -0.13849248138251546, 0.19184632675838054, -0.1840075170114598, -0.08712020221677816, 0.1267608740038861, 0.13721742637761883, 0.1712563829795081, -0.09600450396972077, 0.13774710492243167, 0.01745449376854698, 0.13282847655647545, 0.09965937367611483, 0.024822960134807955, 0.14426814628658827, 0.14247352889753453, 0.030045123282853765, 0.13872490898003909, -0.06324054573667405, -0.06872559953366353, -0.33767617396392663, -0.14560340113281586, -0.19616925057115447, 0.11082583562710137, -0.06394972733167359, -0.15717008741514593, 0.37310139221920985, 0.09427445482310641, 0.2708585260802677, 0.07684680169274538, 0.24539292626411033, 0.18015503694322635, 0.031707328550006054, 0.11657710066691754, 0.20482179360377356, 0.10706295345582965, 0.12455131426945792, -0.2483340064280816, 0.08415543020176919, 0.03544664882736309] |
1,802.01442 | A Parameter Version of Forstneri\v{c}'s Splitting Lemma | We construct solution operators to the $\overline{\partial}$-equation that
depend continuously on the domain. This is applied to derive a parameter
version of Forstneri\v{c}'s splitting lemma: If both the maps and the domains
they are defined on vary continuously with a parameter, then the maps obtained
from Forstneri\v{c}'s splitting will depend continuously on the parameter as
well.
| math.CV | we construct solution operators to the overlinepartialequation that depend continuously on the domain this is applied to derive a parameter version of forstnerivcs splitting lemma if both the maps and the domains they are defined on vary continuously with a parameter then the maps obtained from forstnerivcs splitting will depend continuously on the parameter as well | [['we', 'construct', 'solution', 'operators', 'to', 'the', 'overlinepartialequation', 'that', 'depend', 'continuously', 'on', 'the', 'domain', 'this', 'is', 'applied', 'to', 'derive', 'a', 'parameter', 'version', 'of', 'forstnerivcs', 'splitting', 'lemma', 'if', 'both', 'the', 'maps', 'and', 'the', 'domains', 'they', 'are', 'defined', 'on', 'vary', 'continuously', 'with', 'a', 'parameter', 'then', 'the', 'maps', 'obtained', 'from', 'forstnerivcs', 'splitting', 'will', 'depend', 'continuously', 'on', 'the', 'parameter', 'as', 'well']] | [-0.08358501208325227, 0.12545702625410976, -0.0887613697408664, 0.04157447889102278, -0.10038900913894866, -0.09683683305909788, 0.054378141235146255, 0.3709693031937436, -0.32155356176318256, -0.2653985396889901, 0.20372144847728865, -0.24402176579719204, -0.1081448936558984, 0.25771121855359524, -0.060313890826095035, -0.023793645608411344, 0.02609856487079351, 0.03780357236973941, -0.09270969127020282, -0.2056897403586104, 0.4072140151703799, -0.017078354954719543, 0.2504451771922134, 0.055272066689751764, 0.12540933964084144, 0.007137875279618634, -0.02194874911327605, 0.027299357095250377, -0.18942471604464958, 0.08497440640780109, 0.19136469890535981, 0.10036881545696545, 0.21150743478426226, -0.34901626908254846, -0.1886239445216402, 0.13030075381889386, 0.13048133639515275, 0.0740487451872064, 0.008945895358920097, -0.3106920895408149, 0.056283428247466134, -0.10615820635144634, -0.08436047653150228, -0.10068281353623779, -0.014693612060337155, 0.11899194956101754, -0.28512969202603455, -0.0028622058754855834, 0.024982715545101435, -0.014836412216364234, -0.10423904133926111, -0.08178449634255634, -0.0703879721954258, 0.1573533641381396, 0.02523359736962313, 0.09287958828456423, 0.16931248815833694, -0.06361045066215512, -0.051221806978530904, 0.3158031660304577, -0.10985362089963423, -0.3159379043650848, 0.16948500199726335, -0.14952749201889942, -0.1138308182772663, 0.04562177843655701, 0.1762011685512132, 0.1558536914418693, -0.06155830206073545, 0.14555158027926357, -0.02435230911295447, 0.2193566706997377, 0.053596552194061654, -0.003260206715721223, 0.12097806742207871, 0.07486398247312065, 0.17169904414374657, 0.14155494059539503, -0.04863681209152909, -0.10586834829128175, -0.29220210802223945, -0.0985322344996449, -0.18276834330538771, 0.013985054015561386, -0.07173296240890287, -0.20487316747851395, 0.4298200243049198, 0.12927566273827795, 0.28943166688636496, 0.03514584797624223, 0.21577896012200248, 0.1904702628596203, 0.11374192067456466, 0.06564441301721942, 0.234743045160064, 0.0918979555480527, 0.11038384064859538, -0.14695403396790088, 0.04786469801156609, 0.1028133407752547] |
1,802.01443 | Population transfer at exceptional points in spectra of the hydrogen
atom in parallel electric and magnetic fields | We study the population transfer between resonance states for a
time-dependent loop around exceptional points in spectra of the hydrogen atom
in parallel electric and magnetic fields. Exceptional points are well-suited
for population transfer mechanisms, since a closed loop around these in
parameter space commutes eigenstates. We address the question how shape and
duration of the dynamical parameter loop affects the transferred population, in
order to optimize the latter. Since the full quantum dynamics of the expansion
coefficients is time-consuming, we furthermore present an approximation method,
based on a $2\times 2$ matrix.
| quant-ph physics.atom-ph | we study the population transfer between resonance states for a timedependent loop around exceptional points in spectra of the hydrogen atom in parallel electric and magnetic fields exceptional points are wellsuited for population transfer mechanisms since a closed loop around these in parameter space commutes eigenstates we address the question how shape and duration of the dynamical parameter loop affects the transferred population in order to optimize the latter since the full quantum dynamics of the expansion coefficients is timeconsuming we furthermore present an approximation method based on a 2times 2 matrix | [['we', 'study', 'the', 'population', 'transfer', 'between', 'resonance', 'states', 'for', 'a', 'timedependent', 'loop', 'around', 'exceptional', 'points', 'in', 'spectra', 'of', 'the', 'hydrogen', 'atom', 'in', 'parallel', 'electric', 'and', 'magnetic', 'fields', 'exceptional', 'points', 'are', 'wellsuited', 'for', 'population', 'transfer', 'mechanisms', 'since', 'a', 'closed', 'loop', 'around', 'these', 'in', 'parameter', 'space', 'commutes', 'eigenstates', 'we', 'address', 'the', 'question', 'how', 'shape', 'and', 'duration', 'of', 'the', 'dynamical', 'parameter', 'loop', 'affects', 'the', 'transferred', 'population', 'in', 'order', 'to', 'optimize', 'the', 'latter', 'since', 'the', 'full', 'quantum', 'dynamics', 'of', 'the', 'expansion', 'coefficients', 'is', 'timeconsuming', 'we', 'furthermore', 'present', 'an', 'approximation', 'method', 'based', 'on', 'a', '2times', '2', 'matrix']] | [-0.14914168663950556, 0.15427131104708836, -0.033025312257687685, 0.09574467158982651, -0.02360909008016081, -0.09279901345144026, 0.08209415117744356, 0.3919688835942551, -0.2551893349129545, -0.2854102225974202, 0.05900190361653981, -0.24155278247274944, -0.13527240919242817, 0.1858626102178317, -0.011374222666389593, 0.03270544851725192, 0.07736450973290789, 0.04300404334967227, -0.07979295203340767, -0.18235275604883613, 0.35920066024055297, 0.05860748271452789, 0.2513563390315065, 0.025851405063725037, 0.10557402489180474, 0.009278834994841853, 0.03198021105819625, -0.03299394904404281, -0.10044281712591487, 0.09731420437848377, 0.21620469308539253, 0.06925592172141794, 0.24230572858663357, -0.44683566768451227, -0.16902583170398747, 0.10743929293897489, 0.18666219148967092, 0.1030836718602349, -0.031000517826254036, -0.22416960382226692, 0.03622853298135021, -0.13859595614485443, -0.1490776003692704, -0.08796577944430402, 0.02810315849289865, -0.021101035483930584, -0.27652151271721104, 0.0799967740945842, 0.02489335983757527, 0.06583542952759434, -0.08219473283110268, -0.06301552788151996, 0.002910558078640505, 0.15477371247201835, -0.011644094709165232, -0.010402765851366617, 0.15122293374683385, -0.12709601096424233, -0.09151863543387584, 0.35859599071757303, -0.06328669577108129, -0.18081818155579918, 0.12132848041263693, -0.19289630476344863, -0.11827022065509758, 0.1504115347507531, 0.17631181066288895, 0.1566663890388673, -0.1156158368508129, 0.139295673573582, 0.01854847129130655, 0.16810001353935702, 0.03124856799537235, 0.00137382369670693, 0.21688643977572414, 0.12124263867735863, 0.050400742542241576, 0.14123039702763376, -0.09639887053408133, -0.16261580737267176, -0.26492305766062246, -0.15352849256368759, -0.16850518266690653, 0.06909293624693932, -0.07559036030959207, -0.17442354507258404, 0.43665498235445144, 0.15527224591325806, 0.22799455704238347, -0.033171066660029086, 0.2742441004020688, 0.13822565719728236, 0.042799507703065225, 0.06938264082165678, 0.22043432437045418, 0.15843626625997864, 0.07779072017064723, -0.286548139451517, 0.006949214548196482, 0.06793163615562346] |
1,802.01444 | Inverse compton scattered merger-nova: late X-ray counterpart of
gravitational wave signals from NS-NS/BH mergers | The recent observations of GW170817 and its electromagnetic (EM) counterparts
show that double neutron star mergers could lead to rich and bright EM
emissions. Recent numerical simulations suggest that neutron star and neutron
star/black hole (NS-NS/BH) mergers would leave behind a central remnant
surrounded by a mildly isotropic ejecta. The central remnant could launch a
collimated jet and when the jet propagating through the ejecta, a mildly
relativistic cocoon would be formed and the interaction between the cocoon and
the ambient medium would accelerate electrons via external shock in a wide
angle. So that the merger-nova photons (i.e., thermal emission from the ejecta)
would be scattered into higher frequency via inverse compton (IC) process when
they propagating through the cocoon shocked region. We find that the IC
scattered component peaks at X-ray band and it will reach its peak luminosity
in order of days (simultaneously with the merger-nova emission). With current
X-ray detectors, such a late X-ray component could be detected out to 200 Mpc,
depending on the merger remnant properties. It could serve as an important
electromagnetic counterpart of gravitational wave signals from NS-NS/BH
mergers. Nevertheless, simultaneous detection of such a late X-ray signal and
the merger-nova signal could shed light on the cocoon properties and the
concrete structure of the jet.
| astro-ph.HE | the recent observations of gw170817 and its electromagnetic em counterparts show that double neutron star mergers could lead to rich and bright em emissions recent numerical simulations suggest that neutron star and neutron starblack hole nsnsbh mergers would leave behind a central remnant surrounded by a mildly isotropic ejecta the central remnant could launch a collimated jet and when the jet propagating through the ejecta a mildly relativistic cocoon would be formed and the interaction between the cocoon and the ambient medium would accelerate electrons via external shock in a wide angle so that the mergernova photons ie thermal emission from the ejecta would be scattered into higher frequency via inverse compton ic process when they propagating through the cocoon shocked region we find that the ic scattered component peaks at xray band and it will reach its peak luminosity in order of days simultaneously with the mergernova emission with current xray detectors such a late xray component could be detected out to 200 mpc depending on the merger remnant properties it could serve as an important electromagnetic counterpart of gravitational wave signals from nsnsbh mergers nevertheless simultaneous detection of such a late xray signal and the mergernova signal could shed light on the cocoon properties and the concrete structure of the jet | [['the', 'recent', 'observations', 'of', 'gw170817', 'and', 'its', 'electromagnetic', 'em', 'counterparts', 'show', 'that', 'double', 'neutron', 'star', 'mergers', 'could', 'lead', 'to', 'rich', 'and', 'bright', 'em', 'emissions', 'recent', 'numerical', 'simulations', 'suggest', 'that', 'neutron', 'star', 'and', 'neutron', 'starblack', 'hole', 'nsnsbh', 'mergers', 'would', 'leave', 'behind', 'a', 'central', 'remnant', 'surrounded', 'by', 'a', 'mildly', 'isotropic', 'ejecta', 'the', 'central', 'remnant', 'could', 'launch', 'a', 'collimated', 'jet', 'and', 'when', 'the', 'jet', 'propagating', 'through', 'the', 'ejecta', 'a', 'mildly', 'relativistic', 'cocoon', 'would', 'be', 'formed', 'and', 'the', 'interaction', 'between', 'the', 'cocoon', 'and', 'the', 'ambient', 'medium', 'would', 'accelerate', 'electrons', 'via', 'external', 'shock', 'in', 'a', 'wide', 'angle', 'so', 'that', 'the', 'mergernova', 'photons', 'ie', 'thermal', 'emission', 'from', 'the', 'ejecta', 'would', 'be', 'scattered', 'into', 'higher', 'frequency', 'via', 'inverse', 'compton', 'ic', 'process', 'when', 'they', 'propagating', 'through', 'the', 'cocoon', 'shocked', 'region', 'we', 'find', 'that', 'the', 'ic', 'scattered', 'component', 'peaks', 'at', 'xray', 'band', 'and', 'it', 'will', 'reach', 'its', 'peak', 'luminosity', 'in', 'order', 'of', 'days', 'simultaneously', 'with', 'the', 'mergernova', 'emission', 'with', 'current', 'xray', 'detectors', 'such', 'a', 'late', 'xray', 'component', 'could', 'be', 'detected', 'out', 'to', '200', 'mpc', 'depending', 'on', 'the', 'merger', 'remnant', 'properties', 'it', 'could', 'serve', 'as', 'an', 'important', 'electromagnetic', 'counterpart', 'of', 'gravitational', 'wave', 'signals', 'from', 'nsnsbh', 'mergers', 'nevertheless', 'simultaneous', 'detection', 'of', 'such', 'a', 'late', 'xray', 'signal', 'and', 'the', 'mergernova', 'signal', 'could', 'shed', 'light', 'on', 'the', 'cocoon', 'properties', 'and', 'the', 'concrete', 'structure', 'of', 'the', 'jet']] | [-0.08882431138499242, 0.17572601567856813, -0.10524445966087247, 0.11995002034396714, -0.1719611320128673, -0.06730592726760418, 0.027988273718180093, 0.45007349120479234, -0.23542535032840892, -0.29955910296647204, 0.07878304611860901, -0.31489712071600656, -0.006370062677478286, 0.22631258030417659, 0.060918405794832604, -0.06827878889282335, 0.11746344953379703, -0.06230700471407861, -0.07897185061854953, -0.1565387934373097, 0.28602422761704616, 0.16341726717149987, 0.15578416203030607, 0.034297422046812485, 0.08600248970274985, -0.02765922360734341, -0.016624104167103, -0.04406050565551984, -0.030677948026407397, -0.020498725172447066, 0.21209132688435914, 0.14446178652311156, 0.1631548202437012, -0.46822221233496364, -0.2693784146404611, 0.06263208027574903, 0.20852196626277736, 0.013812695481232914, -0.09366372995463336, -0.3075192938974136, 0.034323293038812236, -0.2660481629952211, -0.17052010381419405, 0.0813432404478496, 0.012089364576052891, 0.0314482630366031, -0.20071387972093532, 0.10920483403415047, 0.03675470166025845, -0.07198831496734015, -0.06627294090314126, -0.020607869744195904, -0.04250972243157071, -0.013338488333436612, 0.09124918866171851, 0.08349001306784667, 0.22787042814766018, -0.1620263109533466, -0.07060147012789414, 0.4016235018577514, -0.03755678426957484, 0.018383182650825506, 0.2315822520332647, -0.23170399777110265, -0.11188104167633073, 0.24357487951807608, 0.15973462078921463, 0.09530404736091133, -0.10332609568282573, -0.05532230551167667, 0.005834797800678712, 0.19017966670211528, 0.07153855698804061, 0.0640276638209435, 0.3938775958751324, 0.10775765082296071, -0.024494688992908863, 0.1372652190096322, -0.2227200045001129, 0.03225274621388775, -0.26493955275318215, -0.08667456463390323, -0.11944063913794191, 0.13697196331066178, -0.13150091381436663, -0.11337728486144959, 0.3209783975712675, 0.06073335211444209, 0.15249491689459993, -0.07207221708024367, 0.3023410507301831, 0.08981673691985788, 0.05940724605204704, 0.1699135477278609, 0.38210517542323036, 0.1797161931620185, 0.11640509806503432, -0.23119417441453557, 0.08389936134113549, -0.025486751227801394] |
1,802.01445 | Road Segmentation in SAR Satellite Images with Deep Fully-Convolutional
Neural Networks | Remote sensing is extensively used in cartography. As transportation networks
grow and change, extracting roads automatically from satellite images is
crucial to keep maps up-to-date. Synthetic Aperture Radar satellites can
provide high resolution topographical maps. However roads are difficult to
identify in these data as they look visually similar to targets such as rivers
and railways. Most road extraction methods on Synthetic Aperture Radar images
still rely on a prior segmentation performed by classical computer vision
algorithms. Few works study the potential of deep learning techniques, despite
their successful applications to optical imagery. This letter presents an
evaluation of Fully-Convolutional Neural Networks for road segmentation in SAR
images. We study the relative performance of early and state-of-the-art
networks after carefully enhancing their sensitivity towards thin objects by
adding spatial tolerance rules. Our models shows promising results,
successfully extracting most of the roads in our test dataset. This shows that,
although Fully-Convolutional Neural Networks natively lack efficiency for road
segmentation, they are capable of good results if properly tuned. As the
segmentation quality does not scale well with the increasing depth of the
networks, the design of specialized architectures for roads extraction should
yield better performances.
| cs.CV | remote sensing is extensively used in cartography as transportation networks grow and change extracting roads automatically from satellite images is crucial to keep maps uptodate synthetic aperture radar satellites can provide high resolution topographical maps however roads are difficult to identify in these data as they look visually similar to targets such as rivers and railways most road extraction methods on synthetic aperture radar images still rely on a prior segmentation performed by classical computer vision algorithms few works study the potential of deep learning techniques despite their successful applications to optical imagery this letter presents an evaluation of fullyconvolutional neural networks for road segmentation in sar images we study the relative performance of early and stateoftheart networks after carefully enhancing their sensitivity towards thin objects by adding spatial tolerance rules our models shows promising results successfully extracting most of the roads in our test dataset this shows that although fullyconvolutional neural networks natively lack efficiency for road segmentation they are capable of good results if properly tuned as the segmentation quality does not scale well with the increasing depth of the networks the design of specialized architectures for roads extraction should yield better performances | [['remote', 'sensing', 'is', 'extensively', 'used', 'in', 'cartography', 'as', 'transportation', 'networks', 'grow', 'and', 'change', 'extracting', 'roads', 'automatically', 'from', 'satellite', 'images', 'is', 'crucial', 'to', 'keep', 'maps', 'uptodate', 'synthetic', 'aperture', 'radar', 'satellites', 'can', 'provide', 'high', 'resolution', 'topographical', 'maps', 'however', 'roads', 'are', 'difficult', 'to', 'identify', 'in', 'these', 'data', 'as', 'they', 'look', 'visually', 'similar', 'to', 'targets', 'such', 'as', 'rivers', 'and', 'railways', 'most', 'road', 'extraction', 'methods', 'on', 'synthetic', 'aperture', 'radar', 'images', 'still', 'rely', 'on', 'a', 'prior', 'segmentation', 'performed', 'by', 'classical', 'computer', 'vision', 'algorithms', 'few', 'works', 'study', 'the', 'potential', 'of', 'deep', 'learning', 'techniques', 'despite', 'their', 'successful', 'applications', 'to', 'optical', 'imagery', 'this', 'letter', 'presents', 'an', 'evaluation', 'of', 'fullyconvolutional', 'neural', 'networks', 'for', 'road', 'segmentation', 'in', 'sar', 'images', 'we', 'study', 'the', 'relative', 'performance', 'of', 'early', 'and', 'stateoftheart', 'networks', 'after', 'carefully', 'enhancing', 'their', 'sensitivity', 'towards', 'thin', 'objects', 'by', 'adding', 'spatial', 'tolerance', 'rules', 'our', 'models', 'shows', 'promising', 'results', 'successfully', 'extracting', 'most', 'of', 'the', 'roads', 'in', 'our', 'test', 'dataset', 'this', 'shows', 'that', 'although', 'fullyconvolutional', 'neural', 'networks', 'natively', 'lack', 'efficiency', 'for', 'road', 'segmentation', 'they', 'are', 'capable', 'of', 'good', 'results', 'if', 'properly', 'tuned', 'as', 'the', 'segmentation', 'quality', 'does', 'not', 'scale', 'well', 'with', 'the', 'increasing', 'depth', 'of', 'the', 'networks', 'the', 'design', 'of', 'specialized', 'architectures', 'for', 'roads', 'extraction', 'should', 'yield', 'better', 'performances']] | [-0.047402319407615905, -0.004805106846302246, -0.0479223737708078, 0.06726256502547469, -0.08615267636158909, -0.15914632115775768, 0.0025126934170914004, 0.48528233989118, -0.2213766556340628, -0.38036886902812583, 0.11803860379179987, -0.27626598194146, -0.19946170518509088, 0.24821369382194602, -0.1769372930006704, 0.13638462350279904, 0.15896526298079736, -0.01423381853189009, -0.012578615980825048, -0.2639932955889843, 0.24764086426331255, 0.09688671122899112, 0.3856081277466355, 0.04532883949816609, 0.08552443443809468, -0.03472052609267382, -0.06989546643140224, -0.008032478922261641, -0.05277435799888246, 0.15346447405650113, 0.3492757373617235, 0.1961360567720989, 0.25847894756171186, -0.46604445127722544, -0.2769777899608016, 0.09918595863124118, 0.17112636438164955, 0.0951777881751649, -0.050234355172142385, -0.3475472459091972, 0.09413461688046272, -0.11003245082862961, -0.04264114963320585, -0.13564824543367976, 0.0009613643728721982, 0.02732714545339919, -0.22337797446033128, 0.019302022294738354, 0.02635684799218628, 0.1209160705944762, -0.032913621737120244, -0.11643896009773017, -0.009190890160747445, 0.24525739258298507, -0.011582444734775868, 0.0386623252947361, 0.19418065366693416, -0.23040577775906199, -0.11687678375926155, 0.3969847392863952, -0.03262522991340703, -0.1662826222839216, 0.22414151470487317, -0.04043927676259325, -0.15687053034273096, 0.10589441736945165, 0.22739741999942523, 0.10842344215235267, -0.16711662171456293, -0.03918792973003852, -0.018626532359765125, 0.1643519546215733, 0.07220970723563089, 0.003345519620686387, 0.22694681982348602, 0.2735110720482249, 0.06417062735328308, 0.10262753693625713, -0.18491290352808742, -0.028211888589132098, -0.16025068585892233, -0.08068848996488855, -0.19408657363114448, -0.030642492365232334, -0.10253628855787564, -0.13680268260530937, 0.3689288001662741, 0.23749362179645314, 0.2080870800509822, 0.0831227313177899, 0.40446649986581923, -0.013113691274506541, 0.15979704893050858, 0.044686155778188734, 0.21654084937061924, 0.022750796380643853, 0.18355040651371476, -0.12459305764104311, 0.08825654866269383, 0.011644311981180157] |
1,802.01446 | Lorentz Distributed Noncommutative $F(T,T_G)$ Wormhole Solutions | The aim of this paper is to study static spherically symmetric noncommutative
$F(T,T_G)$ wormhole solutions along with Lorentzian distribution. Here, $T$ and
$T_G$ are torsion scalar and teleparallel equivalent Gauss-Bonnet term,
respectively. We take a particular redshift function and two $F(T,T_G)$ models.
We analyze the behavior of shape function and also examine null as well as weak
energy conditions graphically. It is concluded that there exist realistic
wormhole solutions for both models. We also study the stability of these
wormhole solutions through equilibrium condition and found them stable.
| gr-qc | the aim of this paper is to study static spherically symmetric noncommutative ftt_g wormhole solutions along with lorentzian distribution here t and t_g are torsion scalar and teleparallel equivalent gaussbonnet term respectively we take a particular redshift function and two ftt_g models we analyze the behavior of shape function and also examine null as well as weak energy conditions graphically it is concluded that there exist realistic wormhole solutions for both models we also study the stability of these wormhole solutions through equilibrium condition and found them stable | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'study', 'static', 'spherically', 'symmetric', 'noncommutative', 'ftt_g', 'wormhole', 'solutions', 'along', 'with', 'lorentzian', 'distribution', 'here', 't', 'and', 't_g', 'are', 'torsion', 'scalar', 'and', 'teleparallel', 'equivalent', 'gaussbonnet', 'term', 'respectively', 'we', 'take', 'a', 'particular', 'redshift', 'function', 'and', 'two', 'ftt_g', 'models', 'we', 'analyze', 'the', 'behavior', 'of', 'shape', 'function', 'and', 'also', 'examine', 'null', 'as', 'well', 'as', 'weak', 'energy', 'conditions', 'graphically', 'it', 'is', 'concluded', 'that', 'there', 'exist', 'realistic', 'wormhole', 'solutions', 'for', 'both', 'models', 'we', 'also', 'study', 'the', 'stability', 'of', 'these', 'wormhole', 'solutions', 'through', 'equilibrium', 'condition', 'and', 'found', 'them', 'stable']] | [-0.16804556647019292, 0.07023544997950508, -0.092577833999795, 0.1542919316945534, -0.09951839709008875, -0.1999806265653619, -0.05253669446921611, 0.38657283440062945, -0.19151743154295467, -0.2548045273182321, 0.09015815802955661, -0.25911593170233327, -0.17779592529934068, 0.11052203736140985, -0.018953155329323967, 0.05102807779224928, 0.004614695186980746, 0.033546438070268116, -0.09210785156210477, -0.21746506117580627, 0.4300960148261352, 0.03585589824202047, 0.2624122319446707, 0.06689064754490656, 0.08896372569936582, -0.06459429232266055, 0.013589828232811256, 0.09817918136038563, -0.2610218309456203, -0.027925306317311795, 0.1929951971010682, 0.12899586522359063, 0.19991801055254077, -0.38686621269549837, -0.2215788438492878, 0.14838138963519173, 0.12979195168538188, 0.103798064683691, -0.0664693038085137, -0.26792580888352613, 0.11421443866459992, -0.20433046168182045, -0.16287292136853052, -0.09800350207793103, 0.056975098199803724, 0.02987312273365784, -0.20365704005499455, 0.08980710224700901, 0.06447629516928415, -0.006794087017293681, -0.1629271100656214, -0.0509138400930996, -0.04376661159172231, 0.053220765384718434, 0.1475744279344905, -0.014998598881489173, 0.09641002928732302, -0.11743248749090443, -0.02996070083066694, 0.3569289587692104, -0.11695230237885633, -0.2635468702117743, 0.16582430522380906, -0.13521797391215593, -0.09181297350865365, 0.02334528821996752, 0.11084018467226997, 0.22068318161605435, -0.17254940802972255, 0.15306859038735804, -0.025795595908262345, 0.1375058552062414, 0.124362728809832, 0.022005817826456307, 0.24540109241338956, 0.062370929938465866, 0.06099131858156232, 0.19371207398150794, -0.00629491669381175, -0.14964589710474352, -0.3932388616006144, -0.16199545715723865, -0.09221872692102227, 0.08056213513059034, -0.14294000663076903, -0.19195283818672496, 0.38535958786749025, 0.10977625354280462, 0.13916921238838273, 0.08209625394506888, 0.23737574070268733, 0.10068720119571398, -0.018317829018501056, 0.08517391288660292, 0.27269419136626477, 0.13715737335521475, 0.12488065860551698, -0.19575167087962406, -0.024746655211360616, 0.033920275565998796] |
1,802.01447 | Mixed-Resolution Image Representation and Compression with Convolutional
Neural Networks | In this paper, we propose an end-to-end mixed-resolution image compression
framework with convolutional neural networks. Firstly, given one input image,
feature description neural network (FDNN) is used to generate a new
representation of this image, so that this image representation can be more
efficiently compressed by standard codec, as compared to the input image.
Furthermore, we use post-processing neural network (PPNN) to remove the coding
artifacts caused by quantization of codec. Secondly, low-resolution image
representation is adopted for high efficiency compression in terms of most of
bit spent by image's structures under low bit-rate. However, more bits should
be assigned to image details in the high-resolution, when most of structures
have been kept after compression at the high bit-rate. This comes from a fact
that the low-resolution image representation can't burden more information than
high-resolution representation beyond a certain bit-rate. Finally, to resolve
the problem of error back-propagation from the PPNN network to the FDNN
network, we introduce to learn a virtual codec neural network to imitate two
continuous procedures of standard compression and post-processing. The
objective experimental results have demonstrated the proposed method has a
large margin improvement, when comparing with several state-of-the-art
approaches.
| cs.CV | in this paper we propose an endtoend mixedresolution image compression framework with convolutional neural networks firstly given one input image feature description neural network fdnn is used to generate a new representation of this image so that this image representation can be more efficiently compressed by standard codec as compared to the input image furthermore we use postprocessing neural network ppnn to remove the coding artifacts caused by quantization of codec secondly lowresolution image representation is adopted for high efficiency compression in terms of most of bit spent by images structures under low bitrate however more bits should be assigned to image details in the highresolution when most of structures have been kept after compression at the high bitrate this comes from a fact that the lowresolution image representation cant burden more information than highresolution representation beyond a certain bitrate finally to resolve the problem of error backpropagation from the ppnn network to the fdnn network we introduce to learn a virtual codec neural network to imitate two continuous procedures of standard compression and postprocessing the objective experimental results have demonstrated the proposed method has a large margin improvement when comparing with several stateoftheart approaches | [['in', 'this', 'paper', 'we', 'propose', 'an', 'endtoend', 'mixedresolution', 'image', 'compression', 'framework', 'with', 'convolutional', 'neural', 'networks', 'firstly', 'given', 'one', 'input', 'image', 'feature', 'description', 'neural', 'network', 'fdnn', 'is', 'used', 'to', 'generate', 'a', 'new', 'representation', 'of', 'this', 'image', 'so', 'that', 'this', 'image', 'representation', 'can', 'be', 'more', 'efficiently', 'compressed', 'by', 'standard', 'codec', 'as', 'compared', 'to', 'the', 'input', 'image', 'furthermore', 'we', 'use', 'postprocessing', 'neural', 'network', 'ppnn', 'to', 'remove', 'the', 'coding', 'artifacts', 'caused', 'by', 'quantization', 'of', 'codec', 'secondly', 'lowresolution', 'image', 'representation', 'is', 'adopted', 'for', 'high', 'efficiency', 'compression', 'in', 'terms', 'of', 'most', 'of', 'bit', 'spent', 'by', 'images', 'structures', 'under', 'low', 'bitrate', 'however', 'more', 'bits', 'should', 'be', 'assigned', 'to', 'image', 'details', 'in', 'the', 'highresolution', 'when', 'most', 'of', 'structures', 'have', 'been', 'kept', 'after', 'compression', 'at', 'the', 'high', 'bitrate', 'this', 'comes', 'from', 'a', 'fact', 'that', 'the', 'lowresolution', 'image', 'representation', 'cant', 'burden', 'more', 'information', 'than', 'highresolution', 'representation', 'beyond', 'a', 'certain', 'bitrate', 'finally', 'to', 'resolve', 'the', 'problem', 'of', 'error', 'backpropagation', 'from', 'the', 'ppnn', 'network', 'to', 'the', 'fdnn', 'network', 'we', 'introduce', 'to', 'learn', 'a', 'virtual', 'codec', 'neural', 'network', 'to', 'imitate', 'two', 'continuous', 'procedures', 'of', 'standard', 'compression', 'and', 'postprocessing', 'the', 'objective', 'experimental', 'results', 'have', 'demonstrated', 'the', 'proposed', 'method', 'has', 'a', 'large', 'margin', 'improvement', 'when', 'comparing', 'with', 'several', 'stateoftheart', 'approaches']] | [-0.04149934045977678, -0.011168737026517174, -0.09050396096034921, 0.04899257232605147, -0.07702742451970788, -0.18307872043067222, 0.027103631935743472, 0.4720848222152171, -0.3165732923318473, -0.31477340746072596, 0.07837528791797342, -0.22342535146208084, -0.19269473881127766, 0.1686121329274318, -0.18994805672196333, 0.10383607047897102, 0.13117903763901229, 0.041319515141103554, -0.08649236884769149, -0.30007463195747236, 0.2855429144243232, 0.09340478637656245, 0.3426498429019757, -0.03572302317600263, 0.12827057646372755, -0.046454881252769205, -0.029737427994763296, -0.033560570209996456, -0.02211984291280936, 0.17962131348357205, 0.3086390343972438, 0.19913659115814136, 0.30032325329481013, -0.4488956687508701, -0.2673075807020261, 0.07392234071230255, 0.16516115600387976, 0.1395731181704917, -0.0483123644934744, -0.296624997917833, 0.17409397170147883, -0.18130750989377345, 0.06076383886622371, -0.11145202753042387, -0.053456556220259036, -0.05060405374269929, -0.2963472553100582, 0.011371712827659333, 0.045052002228728925, 0.05243035450751454, -0.03770647657108662, -0.08526165114228319, 0.036576952046951175, 0.14962216710021545, 0.006465923846663106, 0.12126526967296618, 0.12257020785400904, -0.21457490094224416, -0.10068090163518728, 0.3885591903778633, -0.06146985376104435, -0.22505374515816387, 0.1465399788033309, -0.033578386379483065, -0.12383593781006769, 0.15561987801094254, 0.21092746665440693, 0.06458017843596907, -0.14644483736323535, -0.015655455063851163, -0.02019432335223404, 0.22724272940944823, 0.13112862866584193, 0.043159896884248664, 0.13833776911614473, 0.2257433726326828, 0.029475927951267963, 0.1778456859961345, -0.17329193101568544, -0.016955108275646683, -0.1936824047706365, -0.09668286209395204, -0.21786051745878754, -0.003268446402933082, -0.10969999095494679, -0.1080978839958136, 0.38787197547969576, 0.23245672919242186, 0.23051946073736745, 0.10821113351930338, 0.39781043152542, 0.06707469087728622, 0.14629355744444258, 0.08639450379348133, 0.16411094061567066, 0.049661585970641804, 0.11806771705419289, -0.12516877428903558, 0.05302118698202576, 0.09010470122668332] |
1,802.01448 | Hardening Deep Neural Networks via Adversarial Model Cascades | Deep neural networks (DNNs) are vulnerable to malicious inputs crafted by an
adversary to produce erroneous outputs. Works on securing neural networks
against adversarial examples achieve high empirical robustness on simple
datasets such as MNIST. However, these techniques are inadequate when
empirically tested on complex data sets such as CIFAR-10 and SVHN. Further,
existing techniques are designed to target specific attacks and fail to
generalize across attacks. We propose the Adversarial Model Cascades (AMC) as a
way to tackle the above inadequacies. Our approach trains a cascade of models
sequentially where each model is optimized to be robust towards a mixture of
multiple attacks. Ultimately, it yields a single model which is secure against
a wide range of attacks; namely FGSM, Elastic, Virtual Adversarial
Perturbations and Madry. On an average, AMC increases the model's empirical
robustness against various attacks simultaneously, by a significant margin (of
6.225% for MNIST, 5.075% for SVHN and 2.65% for CIFAR10). At the same time, the
model's performance on non-adversarial inputs is comparable to the
state-of-the-art models.
| cs.LG cs.CR stat.ML | deep neural networks dnns are vulnerable to malicious inputs crafted by an adversary to produce erroneous outputs works on securing neural networks against adversarial examples achieve high empirical robustness on simple datasets such as mnist however these techniques are inadequate when empirically tested on complex data sets such as cifar10 and svhn further existing techniques are designed to target specific attacks and fail to generalize across attacks we propose the adversarial model cascades amc as a way to tackle the above inadequacies our approach trains a cascade of models sequentially where each model is optimized to be robust towards a mixture of multiple attacks ultimately it yields a single model which is secure against a wide range of attacks namely fgsm elastic virtual adversarial perturbations and madry on an average amc increases the models empirical robustness against various attacks simultaneously by a significant margin of 6225 for mnist 5075 for svhn and 265 for cifar10 at the same time the models performance on nonadversarial inputs is comparable to the stateoftheart models | [['deep', 'neural', 'networks', 'dnns', 'are', 'vulnerable', 'to', 'malicious', 'inputs', 'crafted', 'by', 'an', 'adversary', 'to', 'produce', 'erroneous', 'outputs', 'works', 'on', 'securing', 'neural', 'networks', 'against', 'adversarial', 'examples', 'achieve', 'high', 'empirical', 'robustness', 'on', 'simple', 'datasets', 'such', 'as', 'mnist', 'however', 'these', 'techniques', 'are', 'inadequate', 'when', 'empirically', 'tested', 'on', 'complex', 'data', 'sets', 'such', 'as', 'cifar10', 'and', 'svhn', 'further', 'existing', 'techniques', 'are', 'designed', 'to', 'target', 'specific', 'attacks', 'and', 'fail', 'to', 'generalize', 'across', 'attacks', 'we', 'propose', 'the', 'adversarial', 'model', 'cascades', 'amc', 'as', 'a', 'way', 'to', 'tackle', 'the', 'above', 'inadequacies', 'our', 'approach', 'trains', 'a', 'cascade', 'of', 'models', 'sequentially', 'where', 'each', 'model', 'is', 'optimized', 'to', 'be', 'robust', 'towards', 'a', 'mixture', 'of', 'multiple', 'attacks', 'ultimately', 'it', 'yields', 'a', 'single', 'model', 'which', 'is', 'secure', 'against', 'a', 'wide', 'range', 'of', 'attacks', 'namely', 'fgsm', 'elastic', 'virtual', 'adversarial', 'perturbations', 'and', 'madry', 'on', 'an', 'average', 'amc', 'increases', 'the', 'models', 'empirical', 'robustness', 'against', 'various', 'attacks', 'simultaneously', 'by', 'a', 'significant', 'margin', 'of', '6225', 'for', 'mnist', '5075', 'for', 'svhn', 'and', '265', 'for', 'cifar10', 'at', 'the', 'same', 'time', 'the', 'models', 'performance', 'on', 'nonadversarial', 'inputs', 'is', 'comparable', 'to', 'the', 'stateoftheart', 'models']] | [-0.06568810715312685, -0.0007694092806880636, -0.026110215885016847, 0.12936745692140367, -0.047333718408994814, -0.2620101603742703, 0.07100922003497973, 0.42988533443113897, -0.23381518862648484, -0.3387987715329098, 0.09163719421793597, -0.30315343760063546, -0.19115930606665857, 0.2569290205028237, -0.17286040053446305, 0.1643995160202715, 0.09618073045686983, 0.0035832479828968645, -0.011857750433195821, -0.34256845168385874, 0.304955047416939, 0.08622641512312625, 0.36653865991564305, 0.009443884251146194, 0.09733391765518772, -0.07701445018242606, 0.035962767733315776, -0.027690928198931302, -0.013730679207262309, 0.08295324736493914, 0.2876904402818421, 0.18371346205308595, 0.320616718600778, -0.42384950787595965, -0.25408757691107253, 0.09703627808074303, 0.09755924086990382, 0.14688469665133572, -0.013551026847733951, -0.3800103625775698, 0.17772214546909226, -0.20727774288834017, 0.01196050903527066, -0.19398858450791415, -0.020359974710599464, 0.048348261196138886, -0.31047648003544, 0.0035656449987607843, 0.07944673015188207, 0.05324574027994566, -0.040437065396348344, -0.13059090751990238, -0.007759469614008113, 0.13478899238415418, 0.029130884106887286, 0.04231519823661074, 0.17730926450561074, -0.17785276827155885, -0.18547849250299966, 0.3110752883202889, -0.07743429789210067, -0.2097650343004395, 0.22037651664474706, 0.08550756942782113, -0.1256829815582879, 0.09678217899567886, 0.2906532604137764, 0.11299966746557723, -0.10256066807068076, -0.025005716717500678, -0.03569225830861422, 0.1991276286104146, 0.04295776355189874, -0.012645869959584053, 0.15052235240582376, 0.24959141452495448, 0.04146773481282734, 0.16059871600625816, -0.15512063923593172, -0.0803630772697301, -0.19938951255308518, 0.004467468782711555, -0.1679263558540055, 0.016737308351816062, -0.11448021017747712, -0.15022693882312846, 0.3791753396830138, 0.24913020800561164, 0.2360251923516283, 0.14651755424514276, 0.41929191703743796, -0.023573275719878866, 0.11383525447043426, 0.11408457651679568, 0.2067301966921043, 0.014497479958021465, 0.057743238608407625, -0.11897352835683919, 0.15165707029347472, -0.04455287613467697] |
1,802.01449 | Spin-orbit coupling induced magnetic anisotropy and large spin wave gap
in $\rm Na Os O_3$ | The role of spin-orbit coupling and Hund's rule coupling on magnetic
ordering, anisotropy, and excitations are investigated within a minimal
three-orbital model for the $5d^3$ compound $\rm Na Os O_3$. Asymmetry between
the magnetic moments for the $xy$ and $xz,yz$ orbitals, arising from the
hopping asymmetry generated by the $\rm Os O_6$ octahedral tilting and
rotation, together with the weak correlation effect, are shown to be crucial
for the large SOC induced magnetic anisotropy and spin wave gap observed in
this compound. Due to the intrinsic SOC-induced changes in the electronic
densities under rotation of the staggered field, their coupling with the
orbital energy offset is also found to contribute significantly to the magnetic
anisotropy energy.
| cond-mat.str-el | the role of spinorbit coupling and hunds rule coupling on magnetic ordering anisotropy and excitations are investigated within a minimal threeorbital model for the 5d3 compound rm na os o_3 asymmetry between the magnetic moments for the xy and xzyz orbitals arising from the hopping asymmetry generated by the rm os o_6 octahedral tilting and rotation together with the weak correlation effect are shown to be crucial for the large soc induced magnetic anisotropy and spin wave gap observed in this compound due to the intrinsic socinduced changes in the electronic densities under rotation of the staggered field their coupling with the orbital energy offset is also found to contribute significantly to the magnetic anisotropy energy | [['the', 'role', 'of', 'spinorbit', 'coupling', 'and', 'hunds', 'rule', 'coupling', 'on', 'magnetic', 'ordering', 'anisotropy', 'and', 'excitations', 'are', 'investigated', 'within', 'a', 'minimal', 'threeorbital', 'model', 'for', 'the', '5d3', 'compound', 'rm', 'na', 'os', 'o_3', 'asymmetry', 'between', 'the', 'magnetic', 'moments', 'for', 'the', 'xy', 'and', 'xzyz', 'orbitals', 'arising', 'from', 'the', 'hopping', 'asymmetry', 'generated', 'by', 'the', 'rm', 'os', 'o_6', 'octahedral', 'tilting', 'and', 'rotation', 'together', 'with', 'the', 'weak', 'correlation', 'effect', 'are', 'shown', 'to', 'be', 'crucial', 'for', 'the', 'large', 'soc', 'induced', 'magnetic', 'anisotropy', 'and', 'spin', 'wave', 'gap', 'observed', 'in', 'this', 'compound', 'due', 'to', 'the', 'intrinsic', 'socinduced', 'changes', 'in', 'the', 'electronic', 'densities', 'under', 'rotation', 'of', 'the', 'staggered', 'field', 'their', 'coupling', 'with', 'the', 'orbital', 'energy', 'offset', 'is', 'also', 'found', 'to', 'contribute', 'significantly', 'to', 'the', 'magnetic', 'anisotropy', 'energy']] | [-0.20924101663042854, 0.24228698235298185, 0.04718681505142615, 0.09137467359963419, -0.04055836523786701, -0.08492819787854136, 0.041384356327210395, 0.4041595734728115, -0.3130776818865782, -0.32640949574074357, -0.0547641522094511, -0.2890319287102541, -0.05781748270262675, 0.10392232685438196, 0.10559438235339194, -0.059202124545318556, -0.03859042199649688, -0.029207444460741406, -0.0976760894349166, -0.17784762041691435, 0.29973522404305125, 0.05585701733121071, 0.31120618342438006, 0.12078247618899632, 0.021772907083404475, 0.02658606843685667, 0.13164565620285557, 0.01729487292147402, -0.11760334499533577, 0.08532327806517123, 0.19608995430010917, -0.12710321743988656, 0.13955414704688682, -0.3981164698810156, -0.13058551384039738, 0.0037806591597096674, 0.11580428754878712, 0.1326444269406834, -0.06451948931147665, -0.30208384810850536, 0.023426144056617793, -0.15600531493666872, -0.11395145691588776, -0.11224986648925676, 0.028097168067751196, 0.03188174056162223, -0.33305292853589796, 0.13306058771232873, 0.0988722429299679, 0.14057664801206055, -0.11524855721629514, -0.15596573876923528, -0.16438619132506951, 0.039520894434174586, 0.13644323533938812, 0.09827657181223662, 0.1054603987752765, -0.0816925950152679, -0.08128756727443222, 0.39602804564517635, -0.0611941364658033, -0.13777590710027465, 0.11746213924348482, -0.19547663408668775, -0.09868957112936688, 0.1524902473982616, 0.11524385098490367, 0.04541538517263814, -0.09259407301353098, 0.11774873824796142, 0.035791680172757155, 0.1723063609297869, 0.014898454354963554, 0.09348421426618407, 0.24392388184586988, 0.10297257448787447, 0.04837322502661946, 0.08768739452051673, -0.17836677026232414, -0.0862157634772553, -0.18311037985479522, -0.12326142677017649, -0.20146677088482176, 0.07551927228921378, -0.08050738326572424, -0.1481317747271407, 0.38194857896827483, 0.1609857266503868, 0.16143874028007146, -0.09704067099815362, 0.20188152734270512, 0.10611430204730353, 0.1129790641837111, 0.037965484756318016, 0.29444895939628496, 0.21486395950116025, 0.10920578614880877, -0.3920654119413892, 0.11336620609629257, 0.017764690269892715] |
1,802.0145 | Green function for gradient perturbation of unimodal L\'evy processes in
the real line | We prove that the Green function of a generator of symmetric unimodal L\'evy
processes with the weak lower scaling order bigger than one and the Green
function of its gradient perturbations are comparable for bounded $C^{1,1}$
subsets of the real line if the drift function is from an appropriate Kato
class.
| math.AP math.PR | we prove that the green function of a generator of symmetric unimodal levy processes with the weak lower scaling order bigger than one and the green function of its gradient perturbations are comparable for bounded c11 subsets of the real line if the drift function is from an appropriate kato class | [['we', 'prove', 'that', 'the', 'green', 'function', 'of', 'a', 'generator', 'of', 'symmetric', 'unimodal', 'levy', 'processes', 'with', 'the', 'weak', 'lower', 'scaling', 'order', 'bigger', 'than', 'one', 'and', 'the', 'green', 'function', 'of', 'its', 'gradient', 'perturbations', 'are', 'comparable', 'for', 'bounded', 'c11', 'subsets', 'of', 'the', 'real', 'line', 'if', 'the', 'drift', 'function', 'is', 'from', 'an', 'appropriate', 'kato', 'class']] | [-0.09102948532238894, 0.08991574259804717, -0.05067731275716249, 0.10556632575496812, -0.06891082304840286, -0.08980367889664337, -0.03186518249704557, 0.37277045685286614, -0.2854176200195855, -0.17337972636097201, 0.1373699051191044, -0.28101300762272347, -0.14227770772926948, 0.2202055010141111, -0.024821935057201806, 0.0671089608302139, -0.0056797791564581444, 0.033916545958787785, -0.06678952695345323, -0.22439838392550454, 0.4001365358868212, -0.0029206121084736844, 0.22731687391962052, 0.005536033041483047, 0.09947506369402011, -0.023927932778629018, -0.00901584876883848, -0.014060974267183566, -0.10700277630402365, 0.11456492566960115, 0.11912613560065545, 0.09823394297877801, 0.3249149146836762, -0.35240755058532836, -0.1783990536944247, 0.1957357774908636, 0.08196528001195368, 0.03691385974011877, -0.026367321012395563, -0.2788228723129221, 0.1499642604852424, -0.13808648733823908, -0.2066539520598656, 0.010617395296838939, 0.10133504557112853, 0.1223781871627651, -0.33213343093281283, 0.06562628063793276, 0.09854976810953196, 0.03607241708931385, -0.09251111232922138, -0.16275837464148507, -0.0661277138427192, 0.10838060548492506, 0.005574123947607244, 0.09188599027145435, 0.1414921465329826, -0.10845757869309654, -0.06079568513029931, 0.2975723667837241, -0.13865239198654022, -0.2382767622669538, 0.1864332049062439, -0.23307452731144926, -0.07477318393249138, 0.14934280511977918, 0.12448953807938333, 0.16560219860106123, -0.11811105525303706, 0.13943205850869966, -0.023659869078911988, 0.12729139433141945, 0.0702121741247966, 0.005131451349121099, 0.09510368584454351, 0.093936780714156, 0.19786289662999265, 0.17628601123122314, -0.008737041541904795, -0.08522968154911902, -0.3638877076115094, -0.1463985686902614, -0.22640886502888272, 0.08093712827665549, -0.15283603128017265, -0.2404883066009657, 0.38615633911617536, 0.0707765562898096, 0.2082115083421562, 0.1678588633772497, 0.22931303734909378, 0.23013378893408706, 0.0811410878657126, 0.1002395515941887, 0.15678639465249053, 0.1182458447246794, 0.06801339629672322, -0.17375646572213108, 0.08500430824271604, 0.09112030809246432] |
1,802.01451 | Quantitative Fine-Grained Human Evaluation of Machine Translation
Systems: a Case Study on English to Croatian | This paper presents a quantitative fine-grained manual evaluation approach to
comparing the performance of different machine translation (MT) systems. We
build upon the well-established Multidimensional Quality Metrics (MQM) error
taxonomy and implement a novel method that assesses whether the differences in
performance for MQM error types between different MT systems are statistically
significant. We conduct a case study for English-to-Croatian, a language
direction that involves translating into a morphologically rich language, for
which we compare three MT systems belonging to different paradigms: pure
phrase-based, factored phrase-based and neural. First, we design an
MQM-compliant error taxonomy tailored to the relevant linguistic phenomena of
Slavic languages, which made the annotation process feasible and accurate.
Errors in MT outputs were then annotated by two annotators following this
taxonomy. Subsequently, we carried out a statistical analysis which showed that
the best-performing system (neural) reduces the errors produced by the worst
system (pure phrase-based) by more than half (54\%). Moreover, we conducted an
additional analysis of agreement errors in which we distinguished between short
(phrase-level) and long distance (sentence-level) errors. We discovered that
phrase-based MT approaches are of limited use for long distance agreement
phenomena, for which neural MT was found to be especially effective.
| cs.CL cs.AI | this paper presents a quantitative finegrained manual evaluation approach to comparing the performance of different machine translation mt systems we build upon the wellestablished multidimensional quality metrics mqm error taxonomy and implement a novel method that assesses whether the differences in performance for mqm error types between different mt systems are statistically significant we conduct a case study for englishtocroatian a language direction that involves translating into a morphologically rich language for which we compare three mt systems belonging to different paradigms pure phrasebased factored phrasebased and neural first we design an mqmcompliant error taxonomy tailored to the relevant linguistic phenomena of slavic languages which made the annotation process feasible and accurate errors in mt outputs were then annotated by two annotators following this taxonomy subsequently we carried out a statistical analysis which showed that the bestperforming system neural reduces the errors produced by the worst system pure phrasebased by more than half 54 moreover we conducted an additional analysis of agreement errors in which we distinguished between short phraselevel and long distance sentencelevel errors we discovered that phrasebased mt approaches are of limited use for long distance agreement phenomena for which neural mt was found to be especially effective | [['this', 'paper', 'presents', 'a', 'quantitative', 'finegrained', 'manual', 'evaluation', 'approach', 'to', 'comparing', 'the', 'performance', 'of', 'different', 'machine', 'translation', 'mt', 'systems', 'we', 'build', 'upon', 'the', 'wellestablished', 'multidimensional', 'quality', 'metrics', 'mqm', 'error', 'taxonomy', 'and', 'implement', 'a', 'novel', 'method', 'that', 'assesses', 'whether', 'the', 'differences', 'in', 'performance', 'for', 'mqm', 'error', 'types', 'between', 'different', 'mt', 'systems', 'are', 'statistically', 'significant', 'we', 'conduct', 'a', 'case', 'study', 'for', 'englishtocroatian', 'a', 'language', 'direction', 'that', 'involves', 'translating', 'into', 'a', 'morphologically', 'rich', 'language', 'for', 'which', 'we', 'compare', 'three', 'mt', 'systems', 'belonging', 'to', 'different', 'paradigms', 'pure', 'phrasebased', 'factored', 'phrasebased', 'and', 'neural', 'first', 'we', 'design', 'an', 'mqmcompliant', 'error', 'taxonomy', 'tailored', 'to', 'the', 'relevant', 'linguistic', 'phenomena', 'of', 'slavic', 'languages', 'which', 'made', 'the', 'annotation', 'process', 'feasible', 'and', 'accurate', 'errors', 'in', 'mt', 'outputs', 'were', 'then', 'annotated', 'by', 'two', 'annotators', 'following', 'this', 'taxonomy', 'subsequently', 'we', 'carried', 'out', 'a', 'statistical', 'analysis', 'which', 'showed', 'that', 'the', 'bestperforming', 'system', 'neural', 'reduces', 'the', 'errors', 'produced', 'by', 'the', 'worst', 'system', 'pure', 'phrasebased', 'by', 'more', 'than', 'half', '54', 'moreover', 'we', 'conducted', 'an', 'additional', 'analysis', 'of', 'agreement', 'errors', 'in', 'which', 'we', 'distinguished', 'between', 'short', 'phraselevel', 'and', 'long', 'distance', 'sentencelevel', 'errors', 'we', 'discovered', 'that', 'phrasebased', 'mt', 'approaches', 'are', 'of', 'limited', 'use', 'for', 'long', 'distance', 'agreement', 'phenomena', 'for', 'which', 'neural', 'mt', 'was', 'found', 'to', 'be', 'especially', 'effective']] | [-0.0939094806295782, 0.03184529172663455, -0.05445785562724176, 0.12724939779403058, -0.0746404131500502, -0.17098390727981247, 0.10970029467187653, 0.4351537712482792, -0.2385377046144144, -0.33244165806852355, 0.025204072817525066, -0.2592064295660215, -0.14886460748778638, 0.24828359124373006, -0.09603249853373402, 0.09152013850057347, 0.14478362829546737, 0.01632144926039436, -0.12055601096756738, -0.2657522220879492, 0.27942242206549367, 0.036684100352688646, 0.3586527253924446, -0.03462441174802606, 0.096552512038739, -0.05363841333915715, -0.04137210839785485, 0.02508478641575861, -0.09998500028068336, 0.172638320592185, 0.28644047907055026, 0.16365296843772134, 0.2961640936096735, -0.3714758828705685, -0.17347803833950876, 0.051471346528316385, 0.130677180431461, 0.10756110018671895, 0.006206762926600699, -0.31604711289842136, 0.09776322346185382, -0.18677374042601164, 0.008705838279877413, -0.11665165198101389, 0.019236910096934123, -0.005939635221206705, -0.24944336565959296, 0.05333133632093174, 0.10662282648822058, 0.15003950241953135, -0.035575720416899353, -0.14562569688441176, 0.05432725421181231, 0.19296162912734982, 0.045902041544181746, 0.08028614498566686, 0.10530802970422865, -0.09325817840572474, -0.15724934338629623, 0.3579641201079475, -0.08052227091412542, -0.21173913480280052, 0.21447183123220587, -0.02957776808262229, -0.18869614550865002, 0.08735801215046038, 0.22830616893814737, 0.07446299512597798, -0.22895938600398802, -0.022564087020741266, -0.004373361795465697, 0.2606619545940611, 0.06878091728977972, -0.026701890041000997, 0.1914592400132067, 0.23969076531045516, -0.03822750299716265, 0.1605096195143591, -0.08967981885441324, -0.09463006232728749, -0.23154707385857373, -0.13434787041963622, -0.11051405139365633, -0.002189296763978259, -0.04347482575027206, -0.13483630777618877, 0.38077899781667224, 0.22359658424822482, 0.15670185283795376, 0.10793987192822659, 0.2933116196043263, 0.02108594567768953, 0.0744119416840017, 0.06919835753988174, 0.21795766031595343, 0.011630658946950177, 0.12596074251853157, -0.19245584695564696, 0.07443464803627005, 0.041857682053942524] |
1,802.01452 | Optimal Gaussian Metrology for Generic Multimode Interferometric Circuit | Bounds on the ultimate precision attainable in the estimation of a parameter
in Gaussian quantum metrology are obtained when the average number of bosonic
probes is fixed. We identify the optimal input probe state among generic (mixed
in general) Gaussian states with a fixed average number of probe photons for
the estimation of a parameter contained in a generic multimode interferometric
optical circuit, namely, a passive linear circuit preserving the total number
of photons. The optimal Gaussian input state is essentially a single-mode
squeezed vacuum, and the ultimate precision is achieved by a homodyne
measurement on the single mode. We also reveal the best strategy for the
estimation when we are given $L$ identical target circuits and are allowed to
apply passive linear controls in between with an arbitrary number of ancilla
modes introduced.
| quant-ph | bounds on the ultimate precision attainable in the estimation of a parameter in gaussian quantum metrology are obtained when the average number of bosonic probes is fixed we identify the optimal input probe state among generic mixed in general gaussian states with a fixed average number of probe photons for the estimation of a parameter contained in a generic multimode interferometric optical circuit namely a passive linear circuit preserving the total number of photons the optimal gaussian input state is essentially a singlemode squeezed vacuum and the ultimate precision is achieved by a homodyne measurement on the single mode we also reveal the best strategy for the estimation when we are given l identical target circuits and are allowed to apply passive linear controls in between with an arbitrary number of ancilla modes introduced | [['bounds', 'on', 'the', 'ultimate', 'precision', 'attainable', 'in', 'the', 'estimation', 'of', 'a', 'parameter', 'in', 'gaussian', 'quantum', 'metrology', 'are', 'obtained', 'when', 'the', 'average', 'number', 'of', 'bosonic', 'probes', 'is', 'fixed', 'we', 'identify', 'the', 'optimal', 'input', 'probe', 'state', 'among', 'generic', 'mixed', 'in', 'general', 'gaussian', 'states', 'with', 'a', 'fixed', 'average', 'number', 'of', 'probe', 'photons', 'for', 'the', 'estimation', 'of', 'a', 'parameter', 'contained', 'in', 'a', 'generic', 'multimode', 'interferometric', 'optical', 'circuit', 'namely', 'a', 'passive', 'linear', 'circuit', 'preserving', 'the', 'total', 'number', 'of', 'photons', 'the', 'optimal', 'gaussian', 'input', 'state', 'is', 'essentially', 'a', 'singlemode', 'squeezed', 'vacuum', 'and', 'the', 'ultimate', 'precision', 'is', 'achieved', 'by', 'a', 'homodyne', 'measurement', 'on', 'the', 'single', 'mode', 'we', 'also', 'reveal', 'the', 'best', 'strategy', 'for', 'the', 'estimation', 'when', 'we', 'are', 'given', 'l', 'identical', 'target', 'circuits', 'and', 'are', 'allowed', 'to', 'apply', 'passive', 'linear', 'controls', 'in', 'between', 'with', 'an', 'arbitrary', 'number', 'of', 'ancilla', 'modes', 'introduced']] | [-0.1493503170560545, 0.20155080452610463, -0.0426483989220613, -0.00047395427697407666, -0.002167258449871816, -0.21306231427840444, 0.08279991139303337, 0.34553780016114016, -0.2191715235752401, -0.3104858552348981, 0.06794944469757906, -0.24300107627467654, -0.06972309439304049, 0.23756914081594058, -0.06149165947407262, 0.15061837257365626, 0.03299570066242743, 0.06710440416146181, -0.03314186864768836, -0.22546285969558574, 0.28155425591950317, 0.04147233132450188, 0.3053713229262451, -0.06390438668096243, 0.14468546852525047, 0.05351837947895167, -0.04107242126587723, -0.018771022758029624, -0.11050658731429434, 0.09698685055117318, 0.2444392790802435, 0.1002786357212923, 0.2593509983201859, -0.38198053365601087, -0.18589135986203745, 0.1577070356588728, 0.1267636745521771, 0.16570266520034577, 0.007462913120068165, -0.26577350539641814, 0.03371895820514035, -0.10710279703241905, -0.10352318732888062, -0.041894740195694696, -0.027768543000513717, 0.000518136666462159, -0.3233672061139273, 0.04258173938172543, 0.007930999819828725, 0.026813035160164114, -0.009512999442531101, -0.09347656934171109, 0.008029957433967894, 0.1138739165169736, -0.09450423254443806, 0.013022410047393459, 0.154483780824343, -0.17566301983280747, -0.10102493325665371, 0.30193543257608785, -0.10586537141352892, -0.24343441280626707, 0.12362476878924601, -0.13555211103660292, -0.07896176312959739, 0.11233848065082262, 0.16319566645862366, 0.08406832008692089, -0.09318341602638204, 0.06890705461985668, -0.05316508100924096, 0.22162869052071846, 0.07001666210412827, 0.148598068156158, 0.18110559626357325, 0.15655680262716487, 0.10756471225255128, 0.19909138529936768, -0.105852381896172, -0.07916827766752954, -0.34541165573633653, -0.1446871053889644, -0.2242594336360648, 0.04007124012933849, -0.1260726149869412, -0.13592267798089575, 0.38185542539012296, 0.0972769252335611, 0.1691612046170257, 0.056650970596820116, 0.3438911059707987, 0.1321714694764632, 0.00440119954656615, 0.06585302049252413, 0.31027513001558943, 0.17542748630164998, 0.006504926891344141, -0.25141890250744103, 0.035627947849179824, -0.004894209043956849] |
1,802.01453 | Reducing CMSO Model Checking to Highly Connected Graphs | Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the
CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a
graph $G$, and the objective is to determine whether $G\models \psi$. Our main
theorem states that for every CMSO sentence $\psi$, if CMSO$[\psi]$ is solvable
in polynomial time on "globally highly connected graphs", then CMSO$[\psi]$ is
solvable in polynomial time (on general graphs). We demonstrate the utility of
our theorem in the design of parameterized algorithms. Specifically we show
that technical problem-specific ingredients of a powerful method for designing
parameterized algorithms, recursive understanding, can be replaced by a
black-box invocation of our main theorem. We also show that our theorem can be
easily deployed to show fixed parameterized tractability of a wide range of
problems, where the input is a graph $G$ and the task is to find a connected
induced subgraph of $G$ such that "few" vertices in this subgraph have
neighbors outside the subgraph, and additionally the subgraph has a
CMSO-definable property.
| cs.DS cs.CC cs.LO | given a counting monadic second order cmso sentence psi the cmsopsi problem is defined as follows the input to cmsopsi is a graph g and the objective is to determine whether gmodels psi our main theorem states that for every cmso sentence psi if cmsopsi is solvable in polynomial time on globally highly connected graphs then cmsopsi is solvable in polynomial time on general graphs we demonstrate the utility of our theorem in the design of parameterized algorithms specifically we show that technical problemspecific ingredients of a powerful method for designing parameterized algorithms recursive understanding can be replaced by a blackbox invocation of our main theorem we also show that our theorem can be easily deployed to show fixed parameterized tractability of a wide range of problems where the input is a graph g and the task is to find a connected induced subgraph of g such that few vertices in this subgraph have neighbors outside the subgraph and additionally the subgraph has a cmsodefinable property | [['given', 'a', 'counting', 'monadic', 'second', 'order', 'cmso', 'sentence', 'psi', 'the', 'cmsopsi', 'problem', 'is', 'defined', 'as', 'follows', 'the', 'input', 'to', 'cmsopsi', 'is', 'a', 'graph', 'g', 'and', 'the', 'objective', 'is', 'to', 'determine', 'whether', 'gmodels', 'psi', 'our', 'main', 'theorem', 'states', 'that', 'for', 'every', 'cmso', 'sentence', 'psi', 'if', 'cmsopsi', 'is', 'solvable', 'in', 'polynomial', 'time', 'on', 'globally', 'highly', 'connected', 'graphs', 'then', 'cmsopsi', 'is', 'solvable', 'in', 'polynomial', 'time', 'on', 'general', 'graphs', 'we', 'demonstrate', 'the', 'utility', 'of', 'our', 'theorem', 'in', 'the', 'design', 'of', 'parameterized', 'algorithms', 'specifically', 'we', 'show', 'that', 'technical', 'problemspecific', 'ingredients', 'of', 'a', 'powerful', 'method', 'for', 'designing', 'parameterized', 'algorithms', 'recursive', 'understanding', 'can', 'be', 'replaced', 'by', 'a', 'blackbox', 'invocation', 'of', 'our', 'main', 'theorem', 'we', 'also', 'show', 'that', 'our', 'theorem', 'can', 'be', 'easily', 'deployed', 'to', 'show', 'fixed', 'parameterized', 'tractability', 'of', 'a', 'wide', 'range', 'of', 'problems', 'where', 'the', 'input', 'is', 'a', 'graph', 'g', 'and', 'the', 'task', 'is', 'to', 'find', 'a', 'connected', 'induced', 'subgraph', 'of', 'g', 'such', 'that', 'few', 'vertices', 'in', 'this', 'subgraph', 'have', 'neighbors', 'outside', 'the', 'subgraph', 'and', 'additionally', 'the', 'subgraph', 'has', 'a', 'cmsodefinable', 'property']] | [-0.12197743769396435, 0.05394952214238319, -0.07862908264452761, 0.05979778293774209, -0.1424274121594587, -0.13930609850495151, 0.04006469774793721, 0.398171139615729, -0.32550963413986295, -0.2967633563460726, 0.07722517854223648, -0.24238765618171204, -0.1664487327138583, 0.19487701504858154, -0.11351304776458578, 0.03799468422534339, 0.09805469586316383, 0.09869717909587604, 0.004218343744110881, -0.2734459954134019, 0.31085284444023714, -0.05550709914585406, 0.17538040500472893, 0.10896988246646343, 0.10841154189371137, 0.010192439782390879, 0.01892285891385241, 0.06463380028126818, -0.11200791074573345, 0.0717265487630908, 0.33513728679919785, 0.18833730873284918, 0.3010202064073052, -0.3640958690865911, -0.1538009088204214, 0.18970840105109593, 0.10527648548172279, 0.060909922964250046, 0.0024696565162616244, -0.2542077975912076, 0.15204191169927292, -0.1235135848379948, -0.06508682510730895, -0.05536379172946468, 0.058389986176608184, 0.007018627948833235, -0.3015543074036638, -0.01914634933345951, 0.14598903994668613, -0.0007999899506544215, 0.04592031682065378, -0.0922975610934593, -0.01516261368594838, 0.09119817027539918, -0.058744652387262744, 0.11804283746362974, 0.097393909601537, -0.11026089853099123, -0.1667973833285611, 0.3861980882614399, -0.042766707642427224, -0.182767542211734, 0.10208999864531286, -0.09499859536687533, -0.2157245163438898, 0.07525156327720844, 0.14501446345256586, 0.18059252621323774, -0.11617134495102095, 0.13240103870947761, -0.11222203338349407, 0.18180104077857157, 0.07725629945229175, -0.03250939884879203, 0.11294949824611346, 0.19430347655786936, 0.13333743449977853, 0.18715727148492906, 0.05087021839607394, -0.005263076102445749, -0.3050666504003333, -0.11195231287239232, -0.2524999488610774, 0.032805893618161934, -0.14092561416583715, -0.179200384878751, 0.43755672492764214, 0.1292562596189479, 0.14726355082891657, 0.14609570707393824, 0.2797777842052958, 0.1261389948575842, 0.05486427760033896, 0.13933401892603742, 0.14631862707478419, 0.12267530422770616, -0.015563584203747186, -0.1556245190361303, 0.09949216297122114, 0.12121101016686721] |
1,802.01454 | Linear Stability of $f(R,\phi,X)$ Thick Branes: Tensor Perturbations | We explore thick branes in $f(R,\phi,X)$ gravity. We obtain the linear tensor
perturbation equation of $f(R,\phi,X)$ branes and show that the branes are
stable against the tensor perturbations under the condition of $\frac{\partial
f(R,\phi,X)}{\partial R}>0$. In order to obtain thick brane solutions of the
fourth-order field equations in this theory, we employ the reconstruction
technique. We get exact solutions of the specific $f(R,\phi,X)$ thick brane
generated by a non-canonical scalar field. It is shown that the zero mode of
the graviton for the thick brane is localized under certain conditions. This
implies that the four-dimensional Newtonian potential is recovered on the
brane. The effects of the Kaluza-Klein modes of the graviton for the
$f(R,\phi,X)$ thick brane are also discussed.
| hep-th | we explore thick branes in frphix gravity we obtain the linear tensor perturbation equation of frphix branes and show that the branes are stable against the tensor perturbations under the condition of fracpartial frphixpartial r0 in order to obtain thick brane solutions of the fourthorder field equations in this theory we employ the reconstruction technique we get exact solutions of the specific frphix thick brane generated by a noncanonical scalar field it is shown that the zero mode of the graviton for the thick brane is localized under certain conditions this implies that the fourdimensional newtonian potential is recovered on the brane the effects of the kaluzaklein modes of the graviton for the frphix thick brane are also discussed | [['we', 'explore', 'thick', 'branes', 'in', 'frphix', 'gravity', 'we', 'obtain', 'the', 'linear', 'tensor', 'perturbation', 'equation', 'of', 'frphix', 'branes', 'and', 'show', 'that', 'the', 'branes', 'are', 'stable', 'against', 'the', 'tensor', 'perturbations', 'under', 'the', 'condition', 'of', 'fracpartial', 'frphixpartial', 'r0', 'in', 'order', 'to', 'obtain', 'thick', 'brane', 'solutions', 'of', 'the', 'fourthorder', 'field', 'equations', 'in', 'this', 'theory', 'we', 'employ', 'the', 'reconstruction', 'technique', 'we', 'get', 'exact', 'solutions', 'of', 'the', 'specific', 'frphix', 'thick', 'brane', 'generated', 'by', 'a', 'noncanonical', 'scalar', 'field', 'it', 'is', 'shown', 'that', 'the', 'zero', 'mode', 'of', 'the', 'graviton', 'for', 'the', 'thick', 'brane', 'is', 'localized', 'under', 'certain', 'conditions', 'this', 'implies', 'that', 'the', 'fourdimensional', 'newtonian', 'potential', 'is', 'recovered', 'on', 'the', 'brane', 'the', 'effects', 'of', 'the', 'kaluzaklein', 'modes', 'of', 'the', 'graviton', 'for', 'the', 'frphix', 'thick', 'brane', 'are', 'also', 'discussed']] | [-0.17210289556039812, 0.13928926227835275, -0.09747913254077657, 0.10447001450604333, -0.08723200016094655, -0.15070601438677286, -0.08180078215822104, 0.2727499816722584, -0.19473763467680852, -0.1938728719428813, 0.10390918155919003, -0.2527979827896392, -0.12130859547089469, 0.11546973333993958, -0.05743917457412107, 0.00866263555520672, -0.01982102556730289, 0.04051564375858091, -0.038114037769215216, -0.25331158787643504, 0.41506053537714405, 0.007065163595775552, 0.27132837171271695, 0.027210404667253527, 0.12403507545685112, -0.07932222143241788, 0.03907665613075813, 0.028079981315817872, -0.19766199310852553, 0.0620301246832488, 0.18843882316286908, 0.05316665031063229, 0.14085248625695201, -0.47040142272046565, -0.2184734996171447, 0.059898349510750466, 0.16056760381591523, 0.19764954636615337, -0.0369672858466047, -0.2752073364158682, 0.15789694927032974, -0.14248386540023958, -0.19854375225554963, -0.07162372487640577, -0.003577149921033721, -0.08686059639173543, -0.27049039307413464, 0.10710221841330522, 0.06130031116654055, -0.02484906461658114, -0.13167098185473705, -0.0694703055285233, -0.10897968128576117, 0.02483156669521862, 0.17178702561216333, -0.006487687165706845, 0.13124410259947814, -0.15347157146829038, -0.052225923249537475, 0.3469584439012964, -0.16513136384902144, -0.286787127302486, 0.12244430795643416, -0.14975421854010704, -0.0648439469001398, 0.07436770635609657, 0.09343099500983953, 0.24534263291348846, -0.10855251385078576, 0.24663288762617336, -0.016940049014164734, 0.14245827634171662, 0.15139213859466677, 0.028704254478571337, 0.2424510104771135, 0.0924052054682052, 0.07029858645114859, 0.17551677480193992, -0.04851820221825866, -0.10310539439857258, -0.41060230230628436, -0.12816481030510612, -0.09943419588424889, 0.09645971499572871, -0.19079805517130655, -0.21660151612087572, 0.36188494237297675, 0.1226079461967101, 0.14319942459578516, 0.02586807191403488, 0.24644284071874314, 0.12404418367718867, 0.05187075293102002, 0.06576064454344244, 0.33265088380203917, 0.15634848127907175, 0.10794801426996177, -0.2482096358889051, -0.12656493342710437, 0.11649193003244887] |
1,802.01455 | The value of ultrahigh resolution OCT in dermatology - delineating the
dermo-epidermal junction, capillaries in the dermal papillae and vellus hairs | Optical coherence tomography (OCT) imaging of the skin is gaining recognition
and is increasingly applied to dermatological research. A key dermatological
parameter inferred from an OCT image is the epidermal (Ep) thickness as a
thickened Ep can be an indicator of a skin disease. Agreement in the literature
on the signal characters of Ep and the subjacent skin layer, the dermis (D), is
evident. Ambiguities of the OCT signal interpretation in the literature is
however seen for the transition region between the Ep and D, which from
histology is known as the dermo-epidermal junction (DEJ); a distinct junction
comprised by the lower surface of a single cell layer in epidermis connected to
an even thinner basement membrane, attached to the underlying dermis. In this
work we investigate the impact of an improved axial and lateral resolution on
the applicability of OCT for imaging of the skin. To this goal, OCT images are
compared produced by a commercial OCT system and by an in-house built ultrahigh
resolution (UHR-) OCT system for dermatology. In 11 healthy volunteers, we
investigate the DEJ signal characteristics. We perform a detailed analysis of
the dark (low) signal band clearly seen for UHR-OCT in the DEJ region where we,
by using a transition function, find the signal transition of axial
sub-resolution character, which can be directly attributed to the exact
location of DEJ, both in normal (thin/hairy) and glabrous (thick) skin. For
selected healthy volunteers, we investigate the dermal papillae and the vellus
hairs and identify distinct features that only UHR-OCT can resolve. Differences
are seen in tracing hairs of diameter below 20mm, and in imaging the dermal
papillae where capillary structures are identified in the hand palm, not
previously reported in OCT studies and specifically for glabrous skin not
reported in any other in vivo optical imaging studies.
| physics.med-ph | optical coherence tomography oct imaging of the skin is gaining recognition and is increasingly applied to dermatological research a key dermatological parameter inferred from an oct image is the epidermal ep thickness as a thickened ep can be an indicator of a skin disease agreement in the literature on the signal characters of ep and the subjacent skin layer the dermis d is evident ambiguities of the oct signal interpretation in the literature is however seen for the transition region between the ep and d which from histology is known as the dermoepidermal junction dej a distinct junction comprised by the lower surface of a single cell layer in epidermis connected to an even thinner basement membrane attached to the underlying dermis in this work we investigate the impact of an improved axial and lateral resolution on the applicability of oct for imaging of the skin to this goal oct images are compared produced by a commercial oct system and by an inhouse built ultrahigh resolution uhr oct system for dermatology in 11 healthy volunteers we investigate the dej signal characteristics we perform a detailed analysis of the dark low signal band clearly seen for uhroct in the dej region where we by using a transition function find the signal transition of axial subresolution character which can be directly attributed to the exact location of dej both in normal thinhairy and glabrous thick skin for selected healthy volunteers we investigate the dermal papillae and the vellus hairs and identify distinct features that only uhroct can resolve differences are seen in tracing hairs of diameter below 20mm and in imaging the dermal papillae where capillary structures are identified in the hand palm not previously reported in oct studies and specifically for glabrous skin not reported in any other in vivo optical imaging studies | [['optical', 'coherence', 'tomography', 'oct', 'imaging', 'of', 'the', 'skin', 'is', 'gaining', 'recognition', 'and', 'is', 'increasingly', 'applied', 'to', 'dermatological', 'research', 'a', 'key', 'dermatological', 'parameter', 'inferred', 'from', 'an', 'oct', 'image', 'is', 'the', 'epidermal', 'ep', 'thickness', 'as', 'a', 'thickened', 'ep', 'can', 'be', 'an', 'indicator', 'of', 'a', 'skin', 'disease', 'agreement', 'in', 'the', 'literature', 'on', 'the', 'signal', 'characters', 'of', 'ep', 'and', 'the', 'subjacent', 'skin', 'layer', 'the', 'dermis', 'd', 'is', 'evident', 'ambiguities', 'of', 'the', 'oct', 'signal', 'interpretation', 'in', 'the', 'literature', 'is', 'however', 'seen', 'for', 'the', 'transition', 'region', 'between', 'the', 'ep', 'and', 'd', 'which', 'from', 'histology', 'is', 'known', 'as', 'the', 'dermoepidermal', 'junction', 'dej', 'a', 'distinct', 'junction', 'comprised', 'by', 'the', 'lower', 'surface', 'of', 'a', 'single', 'cell', 'layer', 'in', 'epidermis', 'connected', 'to', 'an', 'even', 'thinner', 'basement', 'membrane', 'attached', 'to', 'the', 'underlying', 'dermis', 'in', 'this', 'work', 'we', 'investigate', 'the', 'impact', 'of', 'an', 'improved', 'axial', 'and', 'lateral', 'resolution', 'on', 'the', 'applicability', 'of', 'oct', 'for', 'imaging', 'of', 'the', 'skin', 'to', 'this', 'goal', 'oct', 'images', 'are', 'compared', 'produced', 'by', 'a', 'commercial', 'oct', 'system', 'and', 'by', 'an', 'inhouse', 'built', 'ultrahigh', 'resolution', 'uhr', 'oct', 'system', 'for', 'dermatology', 'in', '11', 'healthy', 'volunteers', 'we', 'investigate', 'the', 'dej', 'signal', 'characteristics', 'we', 'perform', 'a', 'detailed', 'analysis', 'of', 'the', 'dark', 'low', 'signal', 'band', 'clearly', 'seen', 'for', 'uhroct', 'in', 'the', 'dej', 'region', 'where', 'we', 'by', 'using', 'a', 'transition', 'function', 'find', 'the', 'signal', 'transition', 'of', 'axial', 'subresolution', 'character', 'which', 'can', 'be', 'directly', 'attributed', 'to', 'the', 'exact', 'location', 'of', 'dej', 'both', 'in', 'normal', 'thinhairy', 'and', 'glabrous', 'thick', 'skin', 'for', 'selected', 'healthy', 'volunteers', 'we', 'investigate', 'the', 'dermal', 'papillae', 'and', 'the', 'vellus', 'hairs', 'and', 'identify', 'distinct', 'features', 'that', 'only', 'uhroct', 'can', 'resolve', 'differences', 'are', 'seen', 'in', 'tracing', 'hairs', 'of', 'diameter', 'below', '20mm', 'and', 'in', 'imaging', 'the', 'dermal', 'papillae', 'where', 'capillary', 'structures', 'are', 'identified', 'in', 'the', 'hand', 'palm', 'not', 'previously', 'reported', 'in', 'oct', 'studies', 'and', 'specifically', 'for', 'glabrous', 'skin', 'not', 'reported', 'in', 'any', 'other', 'in', 'vivo', 'optical', 'imaging', 'studies']] | [-0.06792769327160811, 0.09026883275135222, -0.05637009552976286, 0.027625402628509987, -0.025039630256097775, -0.1165827235335528, -0.007930888507439934, 0.3911651063597564, -0.2361385936704574, -0.2997891457958354, 0.11193250191612765, -0.29222545064107736, -0.15983220398651832, 0.20082272667914428, -0.08949979556342649, 0.018315357356786927, 0.04154615171774218, 0.03681300114213116, -0.020298716607456555, -0.14338790255940523, 0.25607670998194504, 0.02712969416172341, 0.31120385227392516, 0.06185604303037302, 0.07450824064047386, -0.0174646472104869, -0.027474546444411028, 0.023755127888624415, -0.1176092542829872, 0.10116085387070221, 0.2874483567958867, 0.09595234622247517, 0.2148726161166411, -0.4353362504825598, -0.21409471381160897, 0.06115035352355727, 0.1768034303867374, 0.06526765180398908, -0.015394653055678916, -0.3023666413594978, 0.07752293825105636, -0.10359327618216137, -0.08177909712849643, 0.008217229123732156, 0.03969491202805994, -0.02377929123704908, -0.24595468725871156, 0.09466561461212458, 0.017985820255116074, 0.12129276445580753, -0.09097321888687472, -0.10304233462742596, -0.011621213583934187, 0.1664591423245241, 0.015805770920962723, 0.07253108706806632, 0.16240841343319623, -0.20420240214320295, -0.0786006003528087, 0.3352334172925865, -0.019630627971619168, -0.12263942246798815, 0.19453810607882763, -0.1648560950394582, -0.061530176071945566, 0.14758651961669678, 0.15993124363874947, 0.10229247802400472, -0.14279817847569506, -0.00045369627212506626, -0.027529008142487068, 0.2102751283410949, 0.10485494897233617, -0.011323733188852594, 0.1657719555873775, 0.22298934863431863, -0.015905842830988292, 0.12547158747256862, -0.2014741243869819, 0.00912985607577168, -0.23143491768419291, -0.15940260464170328, -0.16396701847272063, 0.02116437108964998, -0.057597711901333316, -0.15340540562254637, 0.36977901600962915, 0.13320984099270394, 0.20153285952297476, -0.03608352943129135, 0.2842352268449109, 0.04791186217148867, 0.1278893861767557, 0.0037597788087020217, 0.2781703781116258, 0.10856641918902524, 0.11082989097061734, -0.23771042681553148, 0.06407832466959577, 0.008165141601297339] |
1,802.01456 | A strong averaging principle for L\'evy diffusions in foliated spaces
with unbounded leaves | This article extends a strong averaging principle for L\'evy diffusions which
live on the leaves of a foliated manifold subject to small transversal L\'evy
type perturbation to the case of non-compact leaves. The main result states
that the existence of $p$-th moments of the foliated L\'evy diffusion for
$p\geq 2$ and an ergodic convergence of its coefficients in $L^p$ implies the
strong $L^p$ convergence of the fast perturbed motion on the time scale
$t/\epsilon$ to the system driven by the averaged coefficients. In order to
compensate the non-compactness of the leaves we use an estimate of the
dynamical system for each of the increments of the canonical Marcus equation
derived in da Costa and Hoegele (2017), the boundedness of the coefficients in
$L^p$ and a nonlinear Gronwall-Bihari type estimate. The price for the
non-compactness are slower rates of convergence, given as $p$-dependent powers
of $\epsilon$ strictly smaller than $1/4$.
| math.DS | this article extends a strong averaging principle for levy diffusions which live on the leaves of a foliated manifold subject to small transversal levy type perturbation to the case of noncompact leaves the main result states that the existence of pth moments of the foliated levy diffusion for pgeq 2 and an ergodic convergence of its coefficients in lp implies the strong lp convergence of the fast perturbed motion on the time scale tepsilon to the system driven by the averaged coefficients in order to compensate the noncompactness of the leaves we use an estimate of the dynamical system for each of the increments of the canonical marcus equation derived in da costa and hoegele 2017 the boundedness of the coefficients in lp and a nonlinear gronwallbihari type estimate the price for the noncompactness are slower rates of convergence given as pdependent powers of epsilon strictly smaller than 14 | [['this', 'article', 'extends', 'a', 'strong', 'averaging', 'principle', 'for', 'levy', 'diffusions', 'which', 'live', 'on', 'the', 'leaves', 'of', 'a', 'foliated', 'manifold', 'subject', 'to', 'small', 'transversal', 'levy', 'type', 'perturbation', 'to', 'the', 'case', 'of', 'noncompact', 'leaves', 'the', 'main', 'result', 'states', 'that', 'the', 'existence', 'of', 'pth', 'moments', 'of', 'the', 'foliated', 'levy', 'diffusion', 'for', 'pgeq', '2', 'and', 'an', 'ergodic', 'convergence', 'of', 'its', 'coefficients', 'in', 'lp', 'implies', 'the', 'strong', 'lp', 'convergence', 'of', 'the', 'fast', 'perturbed', 'motion', 'on', 'the', 'time', 'scale', 'tepsilon', 'to', 'the', 'system', 'driven', 'by', 'the', 'averaged', 'coefficients', 'in', 'order', 'to', 'compensate', 'the', 'noncompactness', 'of', 'the', 'leaves', 'we', 'use', 'an', 'estimate', 'of', 'the', 'dynamical', 'system', 'for', 'each', 'of', 'the', 'increments', 'of', 'the', 'canonical', 'marcus', 'equation', 'derived', 'in', 'da', 'costa', 'and', 'hoegele', '2017', 'the', 'boundedness', 'of', 'the', 'coefficients', 'in', 'lp', 'and', 'a', 'nonlinear', 'gronwallbihari', 'type', 'estimate', 'the', 'price', 'for', 'the', 'noncompactness', 'are', 'slower', 'rates', 'of', 'convergence', 'given', 'as', 'pdependent', 'powers', 'of', 'epsilon', 'strictly', 'smaller', 'than', '14']] | [-0.1505120591970072, 0.11157430384999464, -0.057623371502485914, 0.07966098325171818, -0.04510220647694505, -0.08765175459561172, 0.018655241950142648, 0.29080166837491955, -0.31413414948905, -0.18659693919451667, 0.13872806250820963, -0.26512259863899884, -0.091748798805365, 0.1948734781464093, -0.1045469981491515, 0.0572292375038568, 0.015376987602549042, 0.061303601907502836, -0.0650242025200531, -0.25418817980823166, 0.3429978462569669, 0.04022219274066338, 0.20273083291447336, 0.012914374660776586, 0.1424148428969744, -0.0010055827458395439, -0.03096823676229537, -0.02371575893061299, -0.16589141063904747, 0.11886061126877852, 0.16450893398703767, 0.03665305029119358, 0.300353481522983, -0.3717124049748186, -0.17982898812763215, 0.13851470270884686, 0.11469833182050612, 0.027241371853156712, -0.01268516081942841, -0.29932715589826814, 0.10624877175109913, -0.11014444612245373, -0.19555017841523703, -0.05769812167926254, 0.060541781070990626, 0.06657072482868193, -0.3119175232325991, 0.12373445939342333, 0.1832029042014342, 0.040319091024678705, -0.11282138056739481, -0.11194787090359141, -0.017757294319418013, 0.09416621876246974, 0.08304327116252816, 0.018228872980111513, 0.08863347422705367, -0.0700899947337255, -0.0948889139963656, 0.32508965007973467, -0.13394536606567123, -0.22112742466788712, 0.16178305492559003, -0.19898631803526665, -0.12452259775390531, 0.16387716583831577, 0.18836826589085212, 0.16343574868008293, -0.13161613734527713, 0.13195015272627691, -0.004556677013565945, 0.12549701018803786, 0.10272461578541366, 0.016403465243499903, 0.06894522920554998, 0.11135096697700622, 0.18608069436966765, 0.10093993951921307, -0.05911526967395971, -0.12999356191820738, -0.33935366899129893, -0.1637450098456042, -0.19484636453012016, 0.1155176514515742, -0.15110305395441803, -0.1717429060146821, 0.3677341915654386, 0.10124057843143969, 0.18794195499068417, 0.12198128934623356, 0.21560185645599247, 0.17290082655760058, -0.0062323894928253834, 0.09714733901889805, 0.18588769171374286, 0.19257473038528494, 0.11519959033466876, -0.22760065036372845, 0.06684477900655396, 0.14541591414674915] |
1,802.01457 | Diverse Beam Search for Increased Novelty in Abstractive Summarization | Text summarization condenses a text to a shorter version while retaining the
important informations. Abstractive summarization is a recent development that
generates new phrases, rather than simply copying or rephrasing sentences
within the original text. Recently neural sequence-to-sequence models have
achieved good results in the field of abstractive summarization, which opens
new possibilities and applications for industrial purposes. However, most
practitioners observe that these models still use large parts of the original
text in the output summaries, making them often similar to extractive
frameworks. To address this drawback, we first introduce a new metric to
measure how much of a summary is extracted from the input text. Secondly, we
present a novel method, that relies on a diversity factor in computing the
neural network loss, to improve the diversity of the summaries generated by any
neural abstractive model implementing beam search. Finally, we show that this
method not only makes the system less extractive, but also improves the overall
rouge score of state-of-the-art methods by at least 2 points.
| cs.CL | text summarization condenses a text to a shorter version while retaining the important informations abstractive summarization is a recent development that generates new phrases rather than simply copying or rephrasing sentences within the original text recently neural sequencetosequence models have achieved good results in the field of abstractive summarization which opens new possibilities and applications for industrial purposes however most practitioners observe that these models still use large parts of the original text in the output summaries making them often similar to extractive frameworks to address this drawback we first introduce a new metric to measure how much of a summary is extracted from the input text secondly we present a novel method that relies on a diversity factor in computing the neural network loss to improve the diversity of the summaries generated by any neural abstractive model implementing beam search finally we show that this method not only makes the system less extractive but also improves the overall rouge score of stateoftheart methods by at least 2 points | [['text', 'summarization', 'condenses', 'a', 'text', 'to', 'a', 'shorter', 'version', 'while', 'retaining', 'the', 'important', 'informations', 'abstractive', 'summarization', 'is', 'a', 'recent', 'development', 'that', 'generates', 'new', 'phrases', 'rather', 'than', 'simply', 'copying', 'or', 'rephrasing', 'sentences', 'within', 'the', 'original', 'text', 'recently', 'neural', 'sequencetosequence', 'models', 'have', 'achieved', 'good', 'results', 'in', 'the', 'field', 'of', 'abstractive', 'summarization', 'which', 'opens', 'new', 'possibilities', 'and', 'applications', 'for', 'industrial', 'purposes', 'however', 'most', 'practitioners', 'observe', 'that', 'these', 'models', 'still', 'use', 'large', 'parts', 'of', 'the', 'original', 'text', 'in', 'the', 'output', 'summaries', 'making', 'them', 'often', 'similar', 'to', 'extractive', 'frameworks', 'to', 'address', 'this', 'drawback', 'we', 'first', 'introduce', 'a', 'new', 'metric', 'to', 'measure', 'how', 'much', 'of', 'a', 'summary', 'is', 'extracted', 'from', 'the', 'input', 'text', 'secondly', 'we', 'present', 'a', 'novel', 'method', 'that', 'relies', 'on', 'a', 'diversity', 'factor', 'in', 'computing', 'the', 'neural', 'network', 'loss', 'to', 'improve', 'the', 'diversity', 'of', 'the', 'summaries', 'generated', 'by', 'any', 'neural', 'abstractive', 'model', 'implementing', 'beam', 'search', 'finally', 'we', 'show', 'that', 'this', 'method', 'not', 'only', 'makes', 'the', 'system', 'less', 'extractive', 'but', 'also', 'improves', 'the', 'overall', 'rouge', 'score', 'of', 'stateoftheart', 'methods', 'by', 'at', 'least', '2', 'points']] | [-0.04536756357459142, 0.046137949249282835, -0.06803826803958715, 0.11560796982658332, -0.15074694957088172, -0.16844925707613928, 0.055501929757091596, 0.42489158865284815, -0.2556285180803113, -0.31161707727866766, 0.037771035879216645, -0.29855251148034484, -0.16071860256161233, 0.220680165431082, -0.12813121046369466, 0.054940528121980775, 0.13425852745198286, 0.050283249775999975, -0.06841443130504009, -0.3063241297519661, 0.2991226086552811, 0.05009811537990556, 0.35273560559233796, 0.0361211728497502, 0.1214184276180992, -0.04644708328097838, -0.05881799764093563, -0.022991317319518405, -0.08311625627457087, 0.20529848589188524, 0.30589527280515744, 0.23540210819489063, 0.33997002784603625, -0.3657914563881222, -0.24026862486987513, 0.06296924114111568, 0.15717843910073034, 0.16553242689139105, -0.055197887167406194, -0.3075289376763373, 0.12427114166826363, -0.17929325763621098, 0.03722681625217155, -0.14710328259819447, 0.011418775788276903, -0.014473959144698071, -0.2455310574966929, 0.015552123916058487, 0.13270889947152306, 0.04650689779984704, 0.009454769315198064, -0.14272147769827573, 0.04954199407238667, 0.12145432436662401, 0.06528800984289354, 0.1279722378870263, 0.10391687293200803, -0.20439485252143252, -0.1499328525990424, 0.39064793685484217, -0.07740466124538302, -0.21748957052942608, 0.16407743081153914, -0.035025585448292235, -0.1643084015768881, 0.0877981748178425, 0.18892062374958274, 0.11915079307792013, -0.1940390963504124, -0.01097286472506215, -0.032088618835753945, 0.25500445465623406, 0.0750511290860974, 0.008067572561021034, 0.19431001265924533, 0.26599356627640086, 0.00813299306315651, 0.13326221611488545, -0.042684951992760574, -0.04834486785435707, -0.20894187147255172, -0.12086199492645952, -0.16650429999417235, -0.0027340783629278493, -0.08823261784722673, -0.16748154471964527, 0.42705260438723325, 0.2816933729718908, 0.2021594517836733, 0.09436867938903243, 0.357589844801634, 0.02372940752335642, 0.11559183291054866, 0.09098753464661714, 0.14864887711977773, -0.029707166975220807, 0.14187744178412448, -0.09745747282186291, 0.09717234597367802, 0.09314790277427734] |
1,802.01458 | Image denoising with generalized Gaussian mixture model patch priors | Patch priors have become an important component of image restoration. A
powerful approach in this category of restoration algorithms is the popular
Expected Patch Log-Likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture
model (GMM) prior learned on clean image patches as a way to regularize
degraded patches. In this paper, we show that a generalized Gaussian mixture
model (GGMM) captures the underlying distribution of patches better than a GMM.
Even though GGMM is a powerful prior to combine with EPLL, the non-Gaussianity
of its components presents major challenges to be applied to a computationally
intensive process of image restoration. Specifically, each patch has to undergo
a patch classification step and a shrinkage step. These two steps can be
efficiently solved with a GMM prior but are computationally impractical when
using a GGMM prior. In this paper, we provide approximations and computational
recipes for fast evaluation of these two steps, so that EPLL can embed a GGMM
prior on an image with more than tens of thousands of patches. Our main
contribution is to analyze the accuracy of our approximations based on thorough
theoretical analysis. Our evaluations indicate that the GGMM prior is
consistently a better fit formodeling image patch distribution and performs
better on average in image denoising task.
| eess.IV cs.CV math.ST stat.ML stat.TH | patch priors have become an important component of image restoration a powerful approach in this category of restoration algorithms is the popular expected patch loglikelihood epll algorithm epll uses a gaussian mixture model gmm prior learned on clean image patches as a way to regularize degraded patches in this paper we show that a generalized gaussian mixture model ggmm captures the underlying distribution of patches better than a gmm even though ggmm is a powerful prior to combine with epll the nongaussianity of its components presents major challenges to be applied to a computationally intensive process of image restoration specifically each patch has to undergo a patch classification step and a shrinkage step these two steps can be efficiently solved with a gmm prior but are computationally impractical when using a ggmm prior in this paper we provide approximations and computational recipes for fast evaluation of these two steps so that epll can embed a ggmm prior on an image with more than tens of thousands of patches our main contribution is to analyze the accuracy of our approximations based on thorough theoretical analysis our evaluations indicate that the ggmm prior is consistently a better fit formodeling image patch distribution and performs better on average in image denoising task | [['patch', 'priors', 'have', 'become', 'an', 'important', 'component', 'of', 'image', 'restoration', 'a', 'powerful', 'approach', 'in', 'this', 'category', 'of', 'restoration', 'algorithms', 'is', 'the', 'popular', 'expected', 'patch', 'loglikelihood', 'epll', 'algorithm', 'epll', 'uses', 'a', 'gaussian', 'mixture', 'model', 'gmm', 'prior', 'learned', 'on', 'clean', 'image', 'patches', 'as', 'a', 'way', 'to', 'regularize', 'degraded', 'patches', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'generalized', 'gaussian', 'mixture', 'model', 'ggmm', 'captures', 'the', 'underlying', 'distribution', 'of', 'patches', 'better', 'than', 'a', 'gmm', 'even', 'though', 'ggmm', 'is', 'a', 'powerful', 'prior', 'to', 'combine', 'with', 'epll', 'the', 'nongaussianity', 'of', 'its', 'components', 'presents', 'major', 'challenges', 'to', 'be', 'applied', 'to', 'a', 'computationally', 'intensive', 'process', 'of', 'image', 'restoration', 'specifically', 'each', 'patch', 'has', 'to', 'undergo', 'a', 'patch', 'classification', 'step', 'and', 'a', 'shrinkage', 'step', 'these', 'two', 'steps', 'can', 'be', 'efficiently', 'solved', 'with', 'a', 'gmm', 'prior', 'but', 'are', 'computationally', 'impractical', 'when', 'using', 'a', 'ggmm', 'prior', 'in', 'this', 'paper', 'we', 'provide', 'approximations', 'and', 'computational', 'recipes', 'for', 'fast', 'evaluation', 'of', 'these', 'two', 'steps', 'so', 'that', 'epll', 'can', 'embed', 'a', 'ggmm', 'prior', 'on', 'an', 'image', 'with', 'more', 'than', 'tens', 'of', 'thousands', 'of', 'patches', 'our', 'main', 'contribution', 'is', 'to', 'analyze', 'the', 'accuracy', 'of', 'our', 'approximations', 'based', 'on', 'thorough', 'theoretical', 'analysis', 'our', 'evaluations', 'indicate', 'that', 'the', 'ggmm', 'prior', 'is', 'consistently', 'a', 'better', 'fit', 'formodeling', 'image', 'patch', 'distribution', 'and', 'performs', 'better', 'on', 'average', 'in', 'image', 'denoising', 'task']] | [0.0012065258958430674, -0.04271367726421606, -0.15618614301470538, 0.09206718435854537, -0.0929286643737354, -0.15468929750092614, 0.012622167155943597, 0.4680762318177865, -0.23062586027103513, -0.31390803586243865, 0.10588027933184864, -0.23572145105124667, -0.1521031540849855, 0.1441342284647712, -0.1096832533478916, 0.06556460506460728, 0.1125725733962519, 0.014457076240712642, -0.08411529722910088, -0.2981634735523795, 0.2713801424793281, 0.08081317401229171, 0.3166386453544524, -0.0450556717472724, 0.11222790256411266, -0.040293624436554425, -0.039556008922423086, -0.010497628884457719, -0.046900334797066116, 0.161847882604119, 0.24947910925122693, 0.16286258816454882, 0.3173184011522188, -0.4255700999011214, -0.25581570305915263, 0.11731622285431233, 0.18060832774006905, 0.1212481390181123, -0.032266403827494426, -0.27765056639999297, 0.08796702746678, -0.13337357263215102, -0.01358581904339819, -0.14136633600215787, -0.0383191223798069, -0.044349664799273554, -0.34579424364402744, 0.09825326614932586, 0.10072685141102948, 0.03323169246924898, -0.012656219408549637, -0.15582913052639924, 0.050419306500071585, 0.10204090025287699, 0.03214603301925168, 0.08078217396485762, 0.1488324559636217, -0.1523344106345366, -0.07525293036675205, 0.3675442985438097, -0.06875928715523444, -0.24182374664087547, 0.18533047799540397, -0.04861105128657073, -0.15115538651186328, 0.14722116963821463, 0.2057937144104821, 0.14014006756881897, -0.1462940283340336, 0.005801229293585773, -0.04107408030988434, 0.21012755673235425, 0.039079647802282125, -0.04664701237113779, 0.19151891203588234, 0.22875938130108317, 0.08829807900442924, 0.17112843329064512, -0.15285112374336818, -0.06687953575209786, -0.24673801521622898, -0.11590833353469722, -0.22117202735926883, -0.028047932267677076, -0.11824137721830014, -0.1880601883839028, 0.41326064384506583, 0.2175854321819945, 0.24742999620614753, 0.08701403458746007, 0.37893157221305257, 0.04936057137400404, 0.08809675676569056, 0.061380386517927175, 0.16194156876903995, 0.04527280284114218, 0.043105861998181075, -0.10792227300295892, 0.1063831607820108, 0.04934857159969397] |
1,802.01459 | An information model for modular robots: the Hardware Robot Information
Model (HRIM) | Today's landscape of robotics is dominated by vertical integration where
single vendors develop the final product leading to slow progress, expensive
products and customer lock-in. Opposite to this, an horizontal integration
would result in a rapid development of cost-effective mass-market products with
an additional consumer empowerment. The transition of an industry from vertical
integration to horizontal integration is typically catalysed by de facto
industry standards that enable a simplified and seamless integration of
products. However, in robotics there is currently no leading candidate for a
global plug-and-play standard.
This paper tackles the problem of incompatibility between robot components
that hinder the reconfigurability and flexibility demanded by the robotics
industry. Particularly, it presents a model to create plug-and-play robot
hardware components. Rather than iteratively evolving previous ontologies, our
proposed model answers the needs identified by the industry while facilitating
interoperability, measurability and comparability of robotics technology. Our
approach differs significantly with the ones presented before as it is
hardware-oriented and establishes a clear set of actions towards the
integration of this model in real environments and with real manufacturers.
| cs.RO | todays landscape of robotics is dominated by vertical integration where single vendors develop the final product leading to slow progress expensive products and customer lockin opposite to this an horizontal integration would result in a rapid development of costeffective massmarket products with an additional consumer empowerment the transition of an industry from vertical integration to horizontal integration is typically catalysed by de facto industry standards that enable a simplified and seamless integration of products however in robotics there is currently no leading candidate for a global plugandplay standard this paper tackles the problem of incompatibility between robot components that hinder the reconfigurability and flexibility demanded by the robotics industry particularly it presents a model to create plugandplay robot hardware components rather than iteratively evolving previous ontologies our proposed model answers the needs identified by the industry while facilitating interoperability measurability and comparability of robotics technology our approach differs significantly with the ones presented before as it is hardwareoriented and establishes a clear set of actions towards the integration of this model in real environments and with real manufacturers | [['todays', 'landscape', 'of', 'robotics', 'is', 'dominated', 'by', 'vertical', 'integration', 'where', 'single', 'vendors', 'develop', 'the', 'final', 'product', 'leading', 'to', 'slow', 'progress', 'expensive', 'products', 'and', 'customer', 'lockin', 'opposite', 'to', 'this', 'an', 'horizontal', 'integration', 'would', 'result', 'in', 'a', 'rapid', 'development', 'of', 'costeffective', 'massmarket', 'products', 'with', 'an', 'additional', 'consumer', 'empowerment', 'the', 'transition', 'of', 'an', 'industry', 'from', 'vertical', 'integration', 'to', 'horizontal', 'integration', 'is', 'typically', 'catalysed', 'by', 'de', 'facto', 'industry', 'standards', 'that', 'enable', 'a', 'simplified', 'and', 'seamless', 'integration', 'of', 'products', 'however', 'in', 'robotics', 'there', 'is', 'currently', 'no', 'leading', 'candidate', 'for', 'a', 'global', 'plugandplay', 'standard', 'this', 'paper', 'tackles', 'the', 'problem', 'of', 'incompatibility', 'between', 'robot', 'components', 'that', 'hinder', 'the', 'reconfigurability', 'and', 'flexibility', 'demanded', 'by', 'the', 'robotics', 'industry', 'particularly', 'it', 'presents', 'a', 'model', 'to', 'create', 'plugandplay', 'robot', 'hardware', 'components', 'rather', 'than', 'iteratively', 'evolving', 'previous', 'ontologies', 'our', 'proposed', 'model', 'answers', 'the', 'needs', 'identified', 'by', 'the', 'industry', 'while', 'facilitating', 'interoperability', 'measurability', 'and', 'comparability', 'of', 'robotics', 'technology', 'our', 'approach', 'differs', 'significantly', 'with', 'the', 'ones', 'presented', 'before', 'as', 'it', 'is', 'hardwareoriented', 'and', 'establishes', 'a', 'clear', 'set', 'of', 'actions', 'towards', 'the', 'integration', 'of', 'this', 'model', 'in', 'real', 'environments', 'and', 'with', 'real', 'manufacturers']] | [-0.12139477792687797, 0.059624932593456074, -0.024370166615666718, -0.010879164291519588, -0.10518355314421017, -0.1291202190057427, 0.03435126968510344, 0.41027954330646926, -0.2540125907881099, -0.3393358648597692, 0.10872383658274527, -0.22213387369764237, -0.14507262265895693, 0.22966448984794277, -0.13569295654309663, 0.052130324517512754, 0.08853758251545636, -0.029220176787440027, -0.007221790877552808, -0.2085274863318446, 0.2754935415833142, 0.04979410554737564, 0.3384431367138338, 0.04902298963534531, 0.08932676037781338, -0.0010078167372770356, -0.050894722402660866, -0.0509070897719488, -0.05695564442438798, 0.1939709401343494, 0.3200755858731069, 0.1778635045871913, 0.3536671761664028, -0.4456513279190894, -0.16596674311316176, 0.08667932487396376, 0.15690281954489313, 0.0343110390783162, -0.0608820725661399, -0.30606132811537073, 0.06015705234590876, -0.24135443795304956, -0.13680566098865415, -0.08985335977350394, 0.025885717179416942, -0.024572889852596532, -0.24812299464149087, -0.00927981911645679, 0.029085588364160798, 0.08103218818936246, -0.033942474083702885, -0.08341848935795886, -0.01904310972503062, 0.18337915474261168, 0.05585198002289248, 0.05860360396535102, 0.1719456840950075, -0.15775722622468524, -0.14780112076419918, 0.38964511403876745, 0.005867307645571549, -0.1758749832201676, 0.223152412017912, -0.03924534399078092, -0.1311608371841512, 0.10609338151812919, 0.13778346208750866, 0.051940452458541, -0.1839834207199969, 0.06920786672912727, 0.06574716074706129, 0.1705522342438527, 0.05728231431141998, -0.03828952362004856, 0.2057059895629168, 0.2386053533612468, 0.12778918527443095, 0.09141152500687691, 0.027776807446877754, -0.14313621137008656, -0.22327983306113924, -0.20302001497606234, -0.1260571163683983, 0.013626414207608198, -0.0633861251364088, -0.19759221569117646, 0.343318184314484, 0.18021418339980955, 0.12783491712461195, 0.04086457536388398, 0.41417561288075416, 0.04855038705970268, 0.11822714668102144, 0.05596124159507035, 0.20901502675920977, 0.038312210889109355, 0.21740337066859886, -0.11821906089003124, 0.12063687354368105, -0.014601194850686451] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.