id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.03467 | RippleNet: Propagating User Preferences on the Knowledge Graph for
Recommender Systems | To address the sparsity and cold start problem of collaborative filtering,
researchers usually make use of side information, such as social networks or
item attributes, to improve recommendation performance. This paper considers
the knowledge graph as the source of side information. To address the
limitations of existing embedding-based and path-based methods for
knowledge-graph-aware recommendation, we propose Ripple Network, an end-to-end
framework that naturally incorporates the knowledge graph into recommender
systems. Similar to actual ripples propagating on the surface of water, Ripple
Network stimulates the propagation of user preferences over the set of
knowledge entities by automatically and iteratively extending a user's
potential interests along links in the knowledge graph. The multiple "ripples"
activated by a user's historically clicked items are thus superposed to form
the preference distribution of the user with respect to a candidate item, which
could be used for predicting the final clicking probability. Through extensive
experiments on real-world datasets, we demonstrate that Ripple Network achieves
substantial gains in a variety of scenarios, including movie, book and news
recommendation, over several state-of-the-art baselines.
| cs.IR cs.LG stat.ML | to address the sparsity and cold start problem of collaborative filtering researchers usually make use of side information such as social networks or item attributes to improve recommendation performance this paper considers the knowledge graph as the source of side information to address the limitations of existing embeddingbased and pathbased methods for knowledgegraphaware recommendation we propose ripple network an endtoend framework that naturally incorporates the knowledge graph into recommender systems similar to actual ripples propagating on the surface of water ripple network stimulates the propagation of user preferences over the set of knowledge entities by automatically and iteratively extending a users potential interests along links in the knowledge graph the multiple ripples activated by a users historically clicked items are thus superposed to form the preference distribution of the user with respect to a candidate item which could be used for predicting the final clicking probability through extensive experiments on realworld datasets we demonstrate that ripple network achieves substantial gains in a variety of scenarios including movie book and news recommendation over several stateoftheart baselines | [['to', 'address', 'the', 'sparsity', 'and', 'cold', 'start', 'problem', 'of', 'collaborative', 'filtering', 'researchers', 'usually', 'make', 'use', 'of', 'side', 'information', 'such', 'as', 'social', 'networks', 'or', 'item', 'attributes', 'to', 'improve', 'recommendation', 'performance', 'this', 'paper', 'considers', 'the', 'knowledge', 'graph', 'as', 'the', 'source', 'of', 'side', 'information', 'to', 'address', 'the', 'limitations', 'of', 'existing', 'embeddingbased', 'and', 'pathbased', 'methods', 'for', 'knowledgegraphaware', 'recommendation', 'we', 'propose', 'ripple', 'network', 'an', 'endtoend', 'framework', 'that', 'naturally', 'incorporates', 'the', 'knowledge', 'graph', 'into', 'recommender', 'systems', 'similar', 'to', 'actual', 'ripples', 'propagating', 'on', 'the', 'surface', 'of', 'water', 'ripple', 'network', 'stimulates', 'the', 'propagation', 'of', 'user', 'preferences', 'over', 'the', 'set', 'of', 'knowledge', 'entities', 'by', 'automatically', 'and', 'iteratively', 'extending', 'a', 'users', 'potential', 'interests', 'along', 'links', 'in', 'the', 'knowledge', 'graph', 'the', 'multiple', 'ripples', 'activated', 'by', 'a', 'users', 'historically', 'clicked', 'items', 'are', 'thus', 'superposed', 'to', 'form', 'the', 'preference', 'distribution', 'of', 'the', 'user', 'with', 'respect', 'to', 'a', 'candidate', 'item', 'which', 'could', 'be', 'used', 'for', 'predicting', 'the', 'final', 'clicking', 'probability', 'through', 'extensive', 'experiments', 'on', 'realworld', 'datasets', 'we', 'demonstrate', 'that', 'ripple', 'network', 'achieves', 'substantial', 'gains', 'in', 'a', 'variety', 'of', 'scenarios', 'including', 'movie', 'book', 'and', 'news', 'recommendation', 'over', 'several', 'stateoftheart', 'baselines']] | [-0.0955401934845903, -0.01428732114311123, -0.0330266029648911, 0.05641362607919333, -0.19265922536570365, -0.15457313723498206, 0.08764844305476109, 0.43886468275423407, -0.2828233171797668, -0.3488807978858534, 0.057058410044840135, -0.3363955133947833, -0.18018806297679957, 0.140743657801402, -0.10949721092882769, 0.04483296358208547, 0.11885079876994768, 0.0903442178126264, -0.028217189923870838, -0.2984101530905457, 0.3319779218873009, 0.06734189987798146, 0.3377486176778102, 0.06885991536412688, 0.1017545062956439, 0.009249389725576701, -0.08245370710862736, 0.003193403059454774, -0.07760530548284282, 0.14552353035816495, 0.3557777188493517, 0.21784139815824985, 0.34420598787523204, -0.44940542437714237, -0.25303112300669495, 0.053519451500976395, 0.14352256688021722, 0.0867546615512786, -0.024572784438376027, -0.3664255755707279, 0.08620611146285102, -0.2179882113578269, 0.012448631572248093, -0.05056842425958542, -0.036366381214787094, 0.03158798968973409, -0.2987143457224914, -0.011445661488888335, 0.05898168439516562, 0.03781089061622283, -0.025016549294921517, -0.1134314359039946, 0.013232373053090241, 0.19126190088860606, 0.08225914248768454, 0.006355411809301753, 0.16965393323569034, -0.1783548237009231, -0.18727807253973835, 0.39669562321712915, -0.061882784919299445, -0.19380504545894847, 0.14886154703014456, -0.016061190968538613, -0.11001028844968941, 0.12906399713735492, 0.2618336982960845, 0.05231127205261982, -0.17696837307724717, -0.02759682739437183, -0.07676309808532054, 0.18852962217770045, 0.09386251848217785, 0.026037605128775555, 0.2343894401578575, 0.23304873764857478, 0.08207917131547784, 0.10048482101477532, -0.05528580119041191, -0.08581379457007579, -0.16488866523294923, -0.11938169770793797, -0.1845772544125459, -0.016932045162759785, -0.13651741430365438, -0.14147325764924032, 0.4359838103904956, 0.22147060475772481, 0.1793916155155962, 0.06727501101746362, 0.3303952976558143, -0.01355462050493258, 0.07518815494345865, 0.09256219894668066, 0.10780763644564512, -0.012443893622532058, 0.1484274492300003, -0.14024827483741717, 0.14505808371060325, -0.0020926943980157375] |
1,803.03468 | On contact graphs of paths on a grid | In this paper we consider Contact graphs of Paths on a Grid (CPG graphs),
i.e. graphs for which there exists a family of interiorly disjoint paths on a
grid in one-to-one correspondence with their vertex set such that two vertices
are adjacent if and only if the corresponding paths touch at a grid-point. Our
class generalizes the well studied class of VCPG graphs (see [1]). We examine
CPG graphs from a structural point of view which leads to constant upper bounds
on the clique number and the chromatic number. Moreover, we investigate the
recognition and 3-colorability problems for $B_0$-CPG, a subclass of CPG. We
further show that CPG graphs are not necessarily planar and not all planar
graphs are CPG.
| cs.CG | in this paper we consider contact graphs of paths on a grid cpg graphs ie graphs for which there exists a family of interiorly disjoint paths on a grid in onetoone correspondence with their vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a gridpoint our class generalizes the well studied class of vcpg graphs see 1 we examine cpg graphs from a structural point of view which leads to constant upper bounds on the clique number and the chromatic number moreover we investigate the recognition and 3colorability problems for b_0cpg a subclass of cpg we further show that cpg graphs are not necessarily planar and not all planar graphs are cpg | [['in', 'this', 'paper', 'we', 'consider', 'contact', 'graphs', 'of', 'paths', 'on', 'a', 'grid', 'cpg', 'graphs', 'ie', 'graphs', 'for', 'which', 'there', 'exists', 'a', 'family', 'of', 'interiorly', 'disjoint', 'paths', 'on', 'a', 'grid', 'in', 'onetoone', 'correspondence', 'with', 'their', 'vertex', 'set', 'such', 'that', 'two', 'vertices', 'are', 'adjacent', 'if', 'and', 'only', 'if', 'the', 'corresponding', 'paths', 'touch', 'at', 'a', 'gridpoint', 'our', 'class', 'generalizes', 'the', 'well', 'studied', 'class', 'of', 'vcpg', 'graphs', 'see', '1', 'we', 'examine', 'cpg', 'graphs', 'from', 'a', 'structural', 'point', 'of', 'view', 'which', 'leads', 'to', 'constant', 'upper', 'bounds', 'on', 'the', 'clique', 'number', 'and', 'the', 'chromatic', 'number', 'moreover', 'we', 'investigate', 'the', 'recognition', 'and', '3colorability', 'problems', 'for', 'b_0cpg', 'a', 'subclass', 'of', 'cpg', 'we', 'further', 'show', 'that', 'cpg', 'graphs', 'are', 'not', 'necessarily', 'planar', 'and', 'not', 'all', 'planar', 'graphs', 'are', 'cpg']] | [-0.16573693404276657, 0.12429266428857501, 0.03414596927662691, 0.03714274344707115, -0.08047874708078866, -0.14801201414571613, 0.08019020602417488, 0.4301730140995903, -0.2507814674670052, -0.32845233278906244, 0.09518212390243688, -0.31077665493338025, -0.191989894112588, 0.17294619949315634, -0.10934074006827436, -0.001375545636137836, 0.14512297021161413, 0.10314347275381541, 0.023655699390886176, -0.2197265113429286, 0.3237296533026473, -0.08788737003556174, 0.1978191206804835, 0.09307144504263361, 0.10295887152578793, 0.013003303490292568, 0.018158502801138367, 0.12256866984435508, -0.18167359633911023, 0.10456807472798814, 0.2553880512037784, 0.1511145453605578, 0.22497783412631506, -0.3873835382744288, -0.16810697298019361, 0.22641728732448357, 0.09942849500614226, 0.0828828537164049, -0.016640560094537772, -0.1847972989949979, 0.1120501728907514, -0.10087741239585428, -0.05155510724020692, 0.001876570750027895, 0.04332454461986438, 0.06196798890447005, -0.2559623588115359, -0.03184011370007299, 0.12244237820980036, 0.050778327185141206, 0.06285913063026169, -0.10593662570970945, -0.0588505561165034, 0.14952438111759275, -0.06676813426853405, 0.017752238063730746, 0.05581308328188383, -0.13516256403233698, -0.18576316878549817, 0.35849073040647367, 0.03957840648248919, -0.19909862680042273, 0.18358819202607513, -0.15130024861146868, -0.22468433721373096, 0.08555752994158329, 0.15113786093166304, 0.1601039073549402, -0.1306361370266248, 0.1110980274517917, -0.12061088668325773, 0.12616176787155886, 0.14110702596620744, 0.013481184330760922, 0.17354899649229696, 0.13901790827671942, 0.16603248289380318, 0.1860126621989358, -0.032764032361710556, -0.0644107701209111, -0.2988302530402429, -0.08336611459246622, -0.18851570860765332, 0.01792460544115434, -0.15025024427027386, -0.26206054543960905, 0.43047788154938793, 0.12047377019587299, 0.2255698113550997, 0.15750563602584103, 0.1785838863888007, 0.03199032835802163, 0.05336128872158563, 0.1741203998422457, 0.15248236110589156, 0.1184919046349505, -0.008554277177422475, -0.1510811659336313, 0.05238537173161013, 0.12097164385148093] |
1,803.03469 | Deconvolution with Unknown Error Distribution Interpreted as Blind
Isotonic Regression | Deconvolution is a statistical inverse problem to estimate the distribution
of a random variable based on its noisy observations. Despite the extensive
studies on the topic, deconvolution with unknown noise distribution remains as
a notoriously hard problem. We propose a matrix-based viewpoint for collective
deconvolution that subsumes the setup with repeated measurements as a special
case. As the main result, we describe a simple algorithm that partially
utilizes matrix structure to solve deconvolution problem and provide
non-asymptotic error analysis for the algorithm. We show that the proposed
algorithm achieves the minimax optimal rate for deconvolution in a restricted
sense. We also remark the connection between the collective deconvolution and
the so-called statistical seriation as a byproduct or our matrix viewpoint. We
conjecture that the link suggests that collective deconvolution, as well as
deconvolution with repeated measurements, is intrinsically much easier than
usual deconvolution of a single distribution.
| math.ST stat.TH | deconvolution is a statistical inverse problem to estimate the distribution of a random variable based on its noisy observations despite the extensive studies on the topic deconvolution with unknown noise distribution remains as a notoriously hard problem we propose a matrixbased viewpoint for collective deconvolution that subsumes the setup with repeated measurements as a special case as the main result we describe a simple algorithm that partially utilizes matrix structure to solve deconvolution problem and provide nonasymptotic error analysis for the algorithm we show that the proposed algorithm achieves the minimax optimal rate for deconvolution in a restricted sense we also remark the connection between the collective deconvolution and the socalled statistical seriation as a byproduct or our matrix viewpoint we conjecture that the link suggests that collective deconvolution as well as deconvolution with repeated measurements is intrinsically much easier than usual deconvolution of a single distribution | [['deconvolution', 'is', 'a', 'statistical', 'inverse', 'problem', 'to', 'estimate', 'the', 'distribution', 'of', 'a', 'random', 'variable', 'based', 'on', 'its', 'noisy', 'observations', 'despite', 'the', 'extensive', 'studies', 'on', 'the', 'topic', 'deconvolution', 'with', 'unknown', 'noise', 'distribution', 'remains', 'as', 'a', 'notoriously', 'hard', 'problem', 'we', 'propose', 'a', 'matrixbased', 'viewpoint', 'for', 'collective', 'deconvolution', 'that', 'subsumes', 'the', 'setup', 'with', 'repeated', 'measurements', 'as', 'a', 'special', 'case', 'as', 'the', 'main', 'result', 'we', 'describe', 'a', 'simple', 'algorithm', 'that', 'partially', 'utilizes', 'matrix', 'structure', 'to', 'solve', 'deconvolution', 'problem', 'and', 'provide', 'nonasymptotic', 'error', 'analysis', 'for', 'the', 'algorithm', 'we', 'show', 'that', 'the', 'proposed', 'algorithm', 'achieves', 'the', 'minimax', 'optimal', 'rate', 'for', 'deconvolution', 'in', 'a', 'restricted', 'sense', 'we', 'also', 'remark', 'the', 'connection', 'between', 'the', 'collective', 'deconvolution', 'and', 'the', 'socalled', 'statistical', 'seriation', 'as', 'a', 'byproduct', 'or', 'our', 'matrix', 'viewpoint', 'we', 'conjecture', 'that', 'the', 'link', 'suggests', 'that', 'collective', 'deconvolution', 'as', 'well', 'as', 'deconvolution', 'with', 'repeated', 'measurements', 'is', 'intrinsically', 'much', 'easier', 'than', 'usual', 'deconvolution', 'of', 'a', 'single', 'distribution']] | [-0.04228536796686398, -0.0067129083069636915, -0.12933553787594548, 0.11623985090508399, -0.08480474276810276, -0.16191761297028082, 0.06477622412221164, 0.41587183383755943, -0.2976721276522798, -0.30466895618913126, 0.1616165948878074, -0.2306089433683019, -0.23607105066640252, 0.1692455882209727, -0.12037655970930648, 0.10165364841802274, 0.10267260374634393, 0.01684783626174345, -0.10226981421508098, -0.20270428144955868, 0.2800775414624182, 0.08309085540422777, 0.28928716057043546, -0.016948631822074553, 0.12877326706570072, 0.07622858895888539, -0.04408335235590736, 0.013543959700686186, -0.07891842551640477, 0.09571571677818666, 0.24371746289195353, 0.1582722595645761, 0.2989996499682897, -0.35952830200121566, -0.2161197753030756, 0.11733430520739077, 0.1603038337455467, 0.11336059386677229, -0.061051328442388905, -0.24587868794412385, 0.057890982401943736, -0.11762336834466883, -0.07823750974141619, -0.08439455093929962, -0.04669425220919304, -0.02686525561346286, -0.33443930761913965, 0.13234876442623805, 0.08320006059853322, 0.01513758294132291, -0.041810494417571745, -0.13415484930876465, 0.11039143180170534, 0.09191540262636533, 0.053577769177072514, 0.01785139819974599, 0.10779363765966521, -0.1184970917161174, -0.11669844562951222, 0.35393328500949606, -0.07763909746555779, -0.2260381706489795, 0.15649147440210542, -0.08671169085459797, -0.17768999656700357, 0.1159453828966397, 0.156609610838144, 0.14382540749157874, -0.13110367220796354, 0.03635307686438239, -0.14236759218913156, 0.18294237912505815, 0.00691120840805475, 0.02280846502011021, 0.10833893589822728, 0.19184937188401818, 0.1345353880754615, 0.18675907083223162, -0.1616601557565891, -0.09096725030681815, -0.2730266400517858, -0.10272623881219323, -0.23861568811552308, 0.04041242277008944, -0.0766781874151099, -0.20362435081074026, 0.3712598705018053, 0.17162526429941258, 0.23856015851068607, 0.10279762017584983, 0.3366848076028483, 0.1086743986970574, -0.00460539979117346, 0.0656441181524321, 0.2084069038546473, 0.18996486311689728, 0.0764872801785522, -0.19814315157270115, 0.08902923726052249, 0.06981428603160189] |
1,803.0347 | Dissipative vs dispersive coupling in quantum opto-mechanics: squeezing
ability and stability | Generation of squeezed light and optomechanical instability for dissipative
type of opto- mechanical coupling is theoretically addressed for a cavity with
the input mirror, serving as a mechanical oscillator, or an equivalent system.
The problem is treated analytically for the case of resonance excitation or
small detunings, mainly focusing on the bad cavity limit. A qualitative
difference between the dissipative and purely dispersive coupling is reported.
In particular, it is shown that, for the purely dissipative coupling in the bad
cavity regime, the backaction is strongly reduced and the squeezing ability of
the system is strongly suppressed, in contrast to the case of purely dispersive
coupling. It is also shown that, for small detunings, stability diagrams for
the cases of the purely dispersive and dissipative couplings are qualitatively
identical to within the change of the sign of detuning. The results obtained
are compared with those from the recent theoretical publications.
| quant-ph | generation of squeezed light and optomechanical instability for dissipative type of opto mechanical coupling is theoretically addressed for a cavity with the input mirror serving as a mechanical oscillator or an equivalent system the problem is treated analytically for the case of resonance excitation or small detunings mainly focusing on the bad cavity limit a qualitative difference between the dissipative and purely dispersive coupling is reported in particular it is shown that for the purely dissipative coupling in the bad cavity regime the backaction is strongly reduced and the squeezing ability of the system is strongly suppressed in contrast to the case of purely dispersive coupling it is also shown that for small detunings stability diagrams for the cases of the purely dispersive and dissipative couplings are qualitatively identical to within the change of the sign of detuning the results obtained are compared with those from the recent theoretical publications | [['generation', 'of', 'squeezed', 'light', 'and', 'optomechanical', 'instability', 'for', 'dissipative', 'type', 'of', 'opto', 'mechanical', 'coupling', 'is', 'theoretically', 'addressed', 'for', 'a', 'cavity', 'with', 'the', 'input', 'mirror', 'serving', 'as', 'a', 'mechanical', 'oscillator', 'or', 'an', 'equivalent', 'system', 'the', 'problem', 'is', 'treated', 'analytically', 'for', 'the', 'case', 'of', 'resonance', 'excitation', 'or', 'small', 'detunings', 'mainly', 'focusing', 'on', 'the', 'bad', 'cavity', 'limit', 'a', 'qualitative', 'difference', 'between', 'the', 'dissipative', 'and', 'purely', 'dispersive', 'coupling', 'is', 'reported', 'in', 'particular', 'it', 'is', 'shown', 'that', 'for', 'the', 'purely', 'dissipative', 'coupling', 'in', 'the', 'bad', 'cavity', 'regime', 'the', 'backaction', 'is', 'strongly', 'reduced', 'and', 'the', 'squeezing', 'ability', 'of', 'the', 'system', 'is', 'strongly', 'suppressed', 'in', 'contrast', 'to', 'the', 'case', 'of', 'purely', 'dispersive', 'coupling', 'it', 'is', 'also', 'shown', 'that', 'for', 'small', 'detunings', 'stability', 'diagrams', 'for', 'the', 'cases', 'of', 'the', 'purely', 'dispersive', 'and', 'dissipative', 'couplings', 'are', 'qualitatively', 'identical', 'to', 'within', 'the', 'change', 'of', 'the', 'sign', 'of', 'detuning', 'the', 'results', 'obtained', 'are', 'compared', 'with', 'those', 'from', 'the', 'recent', 'theoretical', 'publications']] | [-0.17680197120488933, 0.1825020653514851, -0.03683677754287298, 0.03371746473557626, -0.031057073920965194, -0.17982597545720636, 0.012535125438589603, 0.35921338024238747, -0.25039448994211855, -0.2605771774891764, 0.05288096653375154, -0.2881624201956826, -0.1126169908264031, 0.2517883122169102, -0.013964684607150654, 0.05716829737337927, 0.06501296049760033, 0.029781142259016635, 0.01180974391909937, -0.17873230925373113, 0.32571582158096135, 0.029502203601102034, 0.2947406003251672, 0.05160983444501956, 0.05604056729003787, -0.010333869270980359, 0.06575643196702004, 0.016912700402790505, -0.09195232254967171, 0.0551761508306178, 0.1993506589656075, -0.0304423394271483, 0.24719568563004335, -0.3842869767546654, -0.19263769935661307, 0.07019297858079275, 0.1500512020693471, 0.1632145726494491, -0.02389682095575457, -0.2935170974520345, -0.015395710483814279, -0.14403655958672365, -0.11754934514251848, -0.07387677533707271, 0.013916995236650109, 0.029751042225398122, -0.294720730005453, 0.09389214191411156, 0.09062834840888778, 0.03543247695701818, -0.04078690204769373, -0.041718039923968414, -0.028838626686483623, 0.09674981995175282, 0.030429401229363672, -0.01817086185949544, 0.14858655317958133, -0.17057013838707158, -0.06121291180451711, 0.40346708446741103, -0.10720488380330305, -0.1961421895523866, 0.22369712754773596, -0.14248933909926564, -0.0276332252076827, 0.13629223893706996, 0.11628756627130012, 0.09003441896910469, -0.10340471049149831, 0.06891891891291986, 0.0042226585218062005, 0.18777232432272284, 0.07915295940668633, 0.1005812618539979, 0.16409602020556727, 0.1828303047067796, 0.029423806390259415, 0.18329991437029095, -0.015011655481842657, -0.11152622901368886, -0.31511996642375983, -0.06461382616311312, -0.19385829114044706, 0.043703877832740545, -0.055217952572663, -0.15279528061975725, 0.39087489798044167, 0.1261815835069865, 0.14134801369218622, -0.012955241687595844, 0.3138099824388822, 0.18178615579924856, 0.04812300459792217, -0.014057675478979945, 0.41198224323491256, 0.17694724493970473, 0.0903765363090982, -0.3244847635629897, 0.00854246161490058, -0.004941473137587309] |
1,803.03471 | Maximizing the encoded information via freezing the estimated parameters
of a pulsed driven qubit | We use a rectangular pulse to freeze the possibility of estimating the
coherent parameters ($\theta,\phi$) of a single qubit and the encoded
information. It is shown that, as the possibility of estimating the parameters
increases, the amount of encoded information decreases. The pulse strength and
the detuning between the qubit and the pulse have a different effect on the
estimation degree and the encoded information. We show that if the weight
parameter, $\theta$ is estimated, the encoded information depends on the
initial state settings. Meanwhile, the encoded information doesn't depend on
the estimated phase parameter,$\phi$. These results may be useful in the
context of quantum cryptography, teleportation and secure communication.
| quant-ph | we use a rectangular pulse to freeze the possibility of estimating the coherent parameters thetaphi of a single qubit and the encoded information it is shown that as the possibility of estimating the parameters increases the amount of encoded information decreases the pulse strength and the detuning between the qubit and the pulse have a different effect on the estimation degree and the encoded information we show that if the weight parameter theta is estimated the encoded information depends on the initial state settings meanwhile the encoded information doesnt depend on the estimated phase parameterphi these results may be useful in the context of quantum cryptography teleportation and secure communication | [['we', 'use', 'a', 'rectangular', 'pulse', 'to', 'freeze', 'the', 'possibility', 'of', 'estimating', 'the', 'coherent', 'parameters', 'thetaphi', 'of', 'a', 'single', 'qubit', 'and', 'the', 'encoded', 'information', 'it', 'is', 'shown', 'that', 'as', 'the', 'possibility', 'of', 'estimating', 'the', 'parameters', 'increases', 'the', 'amount', 'of', 'encoded', 'information', 'decreases', 'the', 'pulse', 'strength', 'and', 'the', 'detuning', 'between', 'the', 'qubit', 'and', 'the', 'pulse', 'have', 'a', 'different', 'effect', 'on', 'the', 'estimation', 'degree', 'and', 'the', 'encoded', 'information', 'we', 'show', 'that', 'if', 'the', 'weight', 'parameter', 'theta', 'is', 'estimated', 'the', 'encoded', 'information', 'depends', 'on', 'the', 'initial', 'state', 'settings', 'meanwhile', 'the', 'encoded', 'information', 'doesnt', 'depend', 'on', 'the', 'estimated', 'phase', 'parameterphi', 'these', 'results', 'may', 'be', 'useful', 'in', 'the', 'context', 'of', 'quantum', 'cryptography', 'teleportation', 'and', 'secure', 'communication']] | [-0.16061508331614452, 0.175537903122433, -0.0653845586839619, 0.05136629501293593, -0.04426356281982649, -0.16763390350762172, 0.0622971171765255, 0.3668297151565005, -0.30038032730520114, -0.3007879453719756, 0.10555228808309473, -0.2502243528377538, -0.11114518079957968, 0.2139252776092072, -0.055907105164038476, 0.04988803861474772, 0.06604406187191196, 0.09910574616915589, -0.1067543086476214, -0.23462541878155066, 0.32577432944106127, 0.05312550894450396, 0.3255045236336119, 0.05327269897172484, 0.15067328851020664, 0.07016852339558782, -0.02275629060069492, -0.04981986530671973, -0.14777060433725053, 0.10651864040933481, 0.2088107508479045, 0.15328272401756787, 0.24579967460125138, -0.390341959316967, -0.2331121775445554, 0.12392767717839655, 0.139051868589093, 0.16414599374380953, -0.00858827693913337, -0.29070391062083184, 0.012532189787459482, -0.13684322194043022, -0.04510047121204162, -0.0428713496107984, 0.008213600348852096, 0.017266176495735253, -0.2714677643065059, 0.05504022695021618, 0.04129819417481285, -0.004063161517228555, -0.008292687441641038, -0.06083497160686812, -0.0621722738937808, 0.19352561383670486, -0.008197704906823165, 0.04305067089270937, 0.20253711374083516, -0.16104102638814974, -0.06491601892635909, 0.3163670021826999, -0.03257730195016831, -0.21180063967780988, 0.0731258352859578, -0.11439873532332274, -0.07752816617588187, 0.06756488490986441, 0.1467337214383681, 0.10480772719265671, -0.06438495448593973, 0.028445740774543017, -0.006696054353079664, 0.289452459953657, 0.07866688840808946, 0.16099447043561335, 0.1909802074655207, 0.11329116844016751, 0.02486111782384404, 0.16755706917840577, -0.1453621663524846, -0.12581137029578005, -0.291483010293557, -0.12891435113291197, -0.245260077229607, 0.02933941571332446, -0.12826825103681394, -0.10094087053631826, 0.43073538084164126, 0.1635084655659205, 0.1877823652007506, -0.023476240771967884, 0.30866884050566123, 0.14574955609454046, 0.05289345619977888, 0.07038546655190374, 0.23947636215571622, 0.14815176450946463, 0.06619619420481794, -0.2699620143612932, 0.1513308784062013, -0.037081782347223625] |
1,803.03472 | Tuning frequency band gaps of tensegrity metamaterials with local and
global prestress | This work studies the acoustic band structure of tensegrity metamaterials,
and the possibility to tune the dispersion relation of such systems by playing
with local and global prestress variables. Building on established results of
the Bloch-Floquet theory, the paper first investigates the linearized response
of chains composed of tensegrity units and lumped masses, which undergo small
oscillations around an initial equilibrium state. The stiffness of the units in
such a state varies with an internal self-stress induced by prestretching the
cables forming the tensegrity units, and the global prestress induced by the
application of compression forces to the terminal bases. The given results show
that frequency band gaps of monoatomic and biatomic chains can be effectively
altered by the fine tuning of local and global prestress parameters, while
keeping material properties unchanged. Numerical results on the wave dynamics
of chains under moderately large displacements confirm the presence of
frequency band gaps of the examined systems in the elastically hardening
regime. Novel engineering uses of the examined metamaterials are discussed.
| nlin.PS physics.app-ph | this work studies the acoustic band structure of tensegrity metamaterials and the possibility to tune the dispersion relation of such systems by playing with local and global prestress variables building on established results of the blochfloquet theory the paper first investigates the linearized response of chains composed of tensegrity units and lumped masses which undergo small oscillations around an initial equilibrium state the stiffness of the units in such a state varies with an internal selfstress induced by prestretching the cables forming the tensegrity units and the global prestress induced by the application of compression forces to the terminal bases the given results show that frequency band gaps of monoatomic and biatomic chains can be effectively altered by the fine tuning of local and global prestress parameters while keeping material properties unchanged numerical results on the wave dynamics of chains under moderately large displacements confirm the presence of frequency band gaps of the examined systems in the elastically hardening regime novel engineering uses of the examined metamaterials are discussed | [['this', 'work', 'studies', 'the', 'acoustic', 'band', 'structure', 'of', 'tensegrity', 'metamaterials', 'and', 'the', 'possibility', 'to', 'tune', 'the', 'dispersion', 'relation', 'of', 'such', 'systems', 'by', 'playing', 'with', 'local', 'and', 'global', 'prestress', 'variables', 'building', 'on', 'established', 'results', 'of', 'the', 'blochfloquet', 'theory', 'the', 'paper', 'first', 'investigates', 'the', 'linearized', 'response', 'of', 'chains', 'composed', 'of', 'tensegrity', 'units', 'and', 'lumped', 'masses', 'which', 'undergo', 'small', 'oscillations', 'around', 'an', 'initial', 'equilibrium', 'state', 'the', 'stiffness', 'of', 'the', 'units', 'in', 'such', 'a', 'state', 'varies', 'with', 'an', 'internal', 'selfstress', 'induced', 'by', 'prestretching', 'the', 'cables', 'forming', 'the', 'tensegrity', 'units', 'and', 'the', 'global', 'prestress', 'induced', 'by', 'the', 'application', 'of', 'compression', 'forces', 'to', 'the', 'terminal', 'bases', 'the', 'given', 'results', 'show', 'that', 'frequency', 'band', 'gaps', 'of', 'monoatomic', 'and', 'biatomic', 'chains', 'can', 'be', 'effectively', 'altered', 'by', 'the', 'fine', 'tuning', 'of', 'local', 'and', 'global', 'prestress', 'parameters', 'while', 'keeping', 'material', 'properties', 'unchanged', 'numerical', 'results', 'on', 'the', 'wave', 'dynamics', 'of', 'chains', 'under', 'moderately', 'large', 'displacements', 'confirm', 'the', 'presence', 'of', 'frequency', 'band', 'gaps', 'of', 'the', 'examined', 'systems', 'in', 'the', 'elastically', 'hardening', 'regime', 'novel', 'engineering', 'uses', 'of', 'the', 'examined', 'metamaterials', 'are', 'discussed']] | [-0.19984734426776068, 0.18439400123763613, -0.0034395457361135963, -0.0368869302845312, -0.039505227579123524, -0.08596904443014831, 0.03537161571122485, 0.38372493432779636, -0.3265799238792891, -0.3066207459692419, 0.0812904201379079, -0.24722378675621995, -0.16559308855353508, 0.16747499643356578, 0.005605974118914125, 0.06150770431505682, 0.04024873285681097, -0.02782956539438321, -0.07284904362429925, -0.16205776462843918, 0.30974005314675795, 0.09460469789406252, 0.31620037443825655, 0.010896829640583725, 0.09131302043641283, 0.02386298095573225, 0.03036570070675139, 0.03512938863517904, -0.14662798077790942, 0.12613610369456413, 0.20774960700290265, -0.02384489143443619, 0.2298658617989838, -0.47899677150348235, -0.22397331318118163, 0.05243789210375509, 0.11122944871288828, 0.09582319859065358, -0.024117989457328116, -0.28781525295271854, 0.0625822684175153, -0.1363595680102221, -0.1664900964170077, -0.0783413564786315, -0.0176464224498741, 0.08160197664811358, -0.21356525677070298, 0.06449270929391054, 0.08556591045420021, 0.07406562205111972, -0.11864335762237656, -0.09780466098189575, -0.07531083851898386, 0.1176802359725288, 0.06519792290244626, -0.0517651000523047, 0.19359976138379534, -0.12529329865338754, -0.08313478624789848, 0.3801008297857889, -0.042637254458648216, -0.16787544203393118, 0.18793060445122023, -0.10305174423613139, -0.0771734826101442, 0.12794324619827804, 0.1516469437408553, 0.06274887671991741, -0.11952672042841224, 0.05761236157171847, -0.001021670024568551, 0.2041862251584214, 0.07684719168233889, 0.03156243646848043, 0.22544319819818806, 0.19901608961176942, 0.049327756351234736, 0.13644694848628108, -0.055373422817682524, -0.052526608517272234, -0.2544957281272175, -0.11748348733344109, -0.180977779566641, -0.020692988339905936, -0.08221774136033819, -0.18298529384426288, 0.414302314323037, 0.09942860993661383, 0.19033212918435505, 0.009662459136714287, 0.23650856154072566, 0.10128757453485, 0.08781444499291172, 0.05666861687538892, 0.2931607170898423, 0.16761120056358755, 0.07465652422290626, -0.26940100425137925, 0.05668685658278286, 0.015664566290349916] |
1,803.03473 | Feedbacks from the metabolic network to the genetic network reveal
regulatory modules in E. coli and B. subtilis | The genetic regulatory network (GRN) plays a key role in controlling the
response of the cell to changes in the environment. Although the structure of
GRNs has been the subject of many studies, their large scale structure in the
light of feedbacks from the metabolic network (MN) has received relatively
little attention. Here we study the causal structure of the GRNs, namely the
chain of influence of one component on the other, taking into account feedback
from the MN. First we consider the GRNs of E. coli and B. subtilis without
feedback from MN and illustrate their causal structure. Next we augment the
GRNs with feedback from their respective MNs by including (a) links from genes
coding for enzymes to metabolites produced or consumed in reactions catalyzed
by those enzymes and (b) links from metabolites to genes coding for
transcription factors whose transcriptional activity the metabolites alter by
binding to them. We find that the inclusion of feedback from MN into GRN
significantly affects its causal structure, in particular the number of levels
and relative positions of nodes in the hierarchy, and the number and size of
the strongly connected components (SCCs). We then study the functional
significance of the SCCs. For this we identify condition specific feedbacks
from the MN into the GRN by retaining only those enzymes that are essential for
growth in specific environmental conditions simulated via the technique of flux
balance analysis (FBA). We find that the SCCs of the GRN augmented by these
feedbacks can be ascribed specific functional roles in the organism. Our
algorithmic approach thus reveals relatively autonomous subsystems with
specific functionality, or regulatory modules in the organism. This automated
approach could be useful in identifying biologically relevant modules in other
organisms for which network data is available, but whose biology is less well
studied.
| q-bio.MN | the genetic regulatory network grn plays a key role in controlling the response of the cell to changes in the environment although the structure of grns has been the subject of many studies their large scale structure in the light of feedbacks from the metabolic network mn has received relatively little attention here we study the causal structure of the grns namely the chain of influence of one component on the other taking into account feedback from the mn first we consider the grns of e coli and b subtilis without feedback from mn and illustrate their causal structure next we augment the grns with feedback from their respective mns by including a links from genes coding for enzymes to metabolites produced or consumed in reactions catalyzed by those enzymes and b links from metabolites to genes coding for transcription factors whose transcriptional activity the metabolites alter by binding to them we find that the inclusion of feedback from mn into grn significantly affects its causal structure in particular the number of levels and relative positions of nodes in the hierarchy and the number and size of the strongly connected components sccs we then study the functional significance of the sccs for this we identify condition specific feedbacks from the mn into the grn by retaining only those enzymes that are essential for growth in specific environmental conditions simulated via the technique of flux balance analysis fba we find that the sccs of the grn augmented by these feedbacks can be ascribed specific functional roles in the organism our algorithmic approach thus reveals relatively autonomous subsystems with specific functionality or regulatory modules in the organism this automated approach could be useful in identifying biologically relevant modules in other organisms for which network data is available but whose biology is less well studied | [['the', 'genetic', 'regulatory', 'network', 'grn', 'plays', 'a', 'key', 'role', 'in', 'controlling', 'the', 'response', 'of', 'the', 'cell', 'to', 'changes', 'in', 'the', 'environment', 'although', 'the', 'structure', 'of', 'grns', 'has', 'been', 'the', 'subject', 'of', 'many', 'studies', 'their', 'large', 'scale', 'structure', 'in', 'the', 'light', 'of', 'feedbacks', 'from', 'the', 'metabolic', 'network', 'mn', 'has', 'received', 'relatively', 'little', 'attention', 'here', 'we', 'study', 'the', 'causal', 'structure', 'of', 'the', 'grns', 'namely', 'the', 'chain', 'of', 'influence', 'of', 'one', 'component', 'on', 'the', 'other', 'taking', 'into', 'account', 'feedback', 'from', 'the', 'mn', 'first', 'we', 'consider', 'the', 'grns', 'of', 'e', 'coli', 'and', 'b', 'subtilis', 'without', 'feedback', 'from', 'mn', 'and', 'illustrate', 'their', 'causal', 'structure', 'next', 'we', 'augment', 'the', 'grns', 'with', 'feedback', 'from', 'their', 'respective', 'mns', 'by', 'including', 'a', 'links', 'from', 'genes', 'coding', 'for', 'enzymes', 'to', 'metabolites', 'produced', 'or', 'consumed', 'in', 'reactions', 'catalyzed', 'by', 'those', 'enzymes', 'and', 'b', 'links', 'from', 'metabolites', 'to', 'genes', 'coding', 'for', 'transcription', 'factors', 'whose', 'transcriptional', 'activity', 'the', 'metabolites', 'alter', 'by', 'binding', 'to', 'them', 'we', 'find', 'that', 'the', 'inclusion', 'of', 'feedback', 'from', 'mn', 'into', 'grn', 'significantly', 'affects', 'its', 'causal', 'structure', 'in', 'particular', 'the', 'number', 'of', 'levels', 'and', 'relative', 'positions', 'of', 'nodes', 'in', 'the', 'hierarchy', 'and', 'the', 'number', 'and', 'size', 'of', 'the', 'strongly', 'connected', 'components', 'sccs', 'we', 'then', 'study', 'the', 'functional', 'significance', 'of', 'the', 'sccs', 'for', 'this', 'we', 'identify', 'condition', 'specific', 'feedbacks', 'from', 'the', 'mn', 'into', 'the', 'grn', 'by', 'retaining', 'only', 'those', 'enzymes', 'that', 'are', 'essential', 'for', 'growth', 'in', 'specific', 'environmental', 'conditions', 'simulated', 'via', 'the', 'technique', 'of', 'flux', 'balance', 'analysis', 'fba', 'we', 'find', 'that', 'the', 'sccs', 'of', 'the', 'grn', 'augmented', 'by', 'these', 'feedbacks', 'can', 'be', 'ascribed', 'specific', 'functional', 'roles', 'in', 'the', 'organism', 'our', 'algorithmic', 'approach', 'thus', 'reveals', 'relatively', 'autonomous', 'subsystems', 'with', 'specific', 'functionality', 'or', 'regulatory', 'modules', 'in', 'the', 'organism', 'this', 'automated', 'approach', 'could', 'be', 'useful', 'in', 'identifying', 'biologically', 'relevant', 'modules', 'in', 'other', 'organisms', 'for', 'which', 'network', 'data', 'is', 'available', 'but', 'whose', 'biology', 'is', 'less', 'well', 'studied']] | [-0.11789974189264738, 0.10627704997013465, 0.008420533320206581, 0.06419784952354439, -0.040091799114544, -0.13065856659017033, 0.09827263202549641, 0.37121208469284733, -0.28727103093182604, -0.3049185348979956, 0.041879025700005595, -0.25080035761344116, -0.22421122654096381, 0.16199103348413543, -0.038148018500662795, -0.01787026339023226, 0.07108731189895334, 0.06585379995695556, 0.060393663572721086, -0.2120987271010376, 0.33686862491681824, 0.0847288069225823, 0.2554893006242207, 0.030865760745221613, 0.07676203018833039, -0.03433481093175364, -0.04880856269961285, 0.020397792453492148, -0.10620829078408066, 0.1738444591742728, 0.2819233794088725, 0.18971315430344657, 0.28404104957335463, -0.4929861546685265, -0.25003618262870086, 0.11503476587383213, 0.12868288969806094, 0.12316012424794612, -0.033704079374970115, -0.2507484938913882, 0.08509534340280892, -0.1488757003861979, -0.038908386483498605, -0.06486054898289013, 0.011023310808748599, 0.06311867503339555, -0.24453242021147933, 0.07803894746468468, 0.04718171386831206, 0.08302198857260214, -0.10091978000571014, -0.12646034699030118, -0.10209854216151408, 0.21916981223995322, 0.04818019315882567, -0.018276061475684016, 0.20780432277547184, -0.15543048865306777, -0.08594319272157273, 0.3421160694379791, 0.006733562483526273, -0.2078196093353708, 0.20407556897855753, -0.12837762809212055, -0.19047971926968768, 0.13391376686103593, 0.19415245143641158, 0.05804177783645492, -0.20220353850336986, 0.06985967256404793, 0.02056601763919184, 0.16998439073710647, 0.058628521999961, 0.019095567305994817, 0.17197652908029737, 0.200021859879809, 0.028913520460396917, 0.12485502761540417, -0.05109749412842925, -0.0897553182802231, -0.20891415126103635, -0.12975738216993332, -0.12159702092692848, 0.0396671839226469, -0.10487221206574229, -0.1308123742813084, 0.41939793582635604, 0.0872132259962489, 0.20002635847430195, 0.032126945456172284, 0.2514228978570526, 0.035533769337216775, 0.14248943280787915, 0.037363106985453094, 0.1938503739294528, 0.12416943306155774, 0.0696791381301861, -0.27098312374148115, 0.18457876656833566, 0.011636210599334429] |
1,803.03474 | An end-to-end TextSpotter with Explicit Alignment and Attention | Text detection and recognition in natural images have long been considered as
two separate tasks that are processed sequentially. Training of two tasks in a
unified framework is non-trivial due to significant dif- ferences in
optimisation difficulties. In this work, we present a conceptually simple yet
efficient framework that simultaneously processes the two tasks in one shot.
Our main contributions are three-fold: 1) we propose a novel text-alignment
layer that allows it to precisely compute convolutional features of a text
instance in ar- bitrary orientation, which is the key to boost the per-
formance; 2) a character attention mechanism is introduced by using character
spatial information as explicit supervision, leading to large improvements in
recognition; 3) two technologies, together with a new RNN branch for word
recognition, are integrated seamlessly into a single model which is end-to-end
trainable. This allows the two tasks to work collaboratively by shar- ing
convolutional features, which is critical to identify challenging text
instances. Our model achieves impressive results in end-to-end recognition on
the ICDAR2015 dataset, significantly advancing most recent results, with
improvements of F-measure from (0.54, 0.51, 0.47) to (0.82, 0.77, 0.63), by
using a strong, weak and generic lexicon respectively. Thanks to joint
training, our method can also serve as a good detec- tor by achieving a new
state-of-the-art detection performance on two datasets.
| cs.CV | text detection and recognition in natural images have long been considered as two separate tasks that are processed sequentially training of two tasks in a unified framework is nontrivial due to significant dif ferences in optimisation difficulties in this work we present a conceptually simple yet efficient framework that simultaneously processes the two tasks in one shot our main contributions are threefold 1 we propose a novel textalignment layer that allows it to precisely compute convolutional features of a text instance in ar bitrary orientation which is the key to boost the per formance 2 a character attention mechanism is introduced by using character spatial information as explicit supervision leading to large improvements in recognition 3 two technologies together with a new rnn branch for word recognition are integrated seamlessly into a single model which is endtoend trainable this allows the two tasks to work collaboratively by shar ing convolutional features which is critical to identify challenging text instances our model achieves impressive results in endtoend recognition on the icdar2015 dataset significantly advancing most recent results with improvements of fmeasure from 054 051 047 to 082 077 063 by using a strong weak and generic lexicon respectively thanks to joint training our method can also serve as a good detec tor by achieving a new stateoftheart detection performance on two datasets | [['text', 'detection', 'and', 'recognition', 'in', 'natural', 'images', 'have', 'long', 'been', 'considered', 'as', 'two', 'separate', 'tasks', 'that', 'are', 'processed', 'sequentially', 'training', 'of', 'two', 'tasks', 'in', 'a', 'unified', 'framework', 'is', 'nontrivial', 'due', 'to', 'significant', 'dif', 'ferences', 'in', 'optimisation', 'difficulties', 'in', 'this', 'work', 'we', 'present', 'a', 'conceptually', 'simple', 'yet', 'efficient', 'framework', 'that', 'simultaneously', 'processes', 'the', 'two', 'tasks', 'in', 'one', 'shot', 'our', 'main', 'contributions', 'are', 'threefold', '1', 'we', 'propose', 'a', 'novel', 'textalignment', 'layer', 'that', 'allows', 'it', 'to', 'precisely', 'compute', 'convolutional', 'features', 'of', 'a', 'text', 'instance', 'in', 'ar', 'bitrary', 'orientation', 'which', 'is', 'the', 'key', 'to', 'boost', 'the', 'per', 'formance', '2', 'a', 'character', 'attention', 'mechanism', 'is', 'introduced', 'by', 'using', 'character', 'spatial', 'information', 'as', 'explicit', 'supervision', 'leading', 'to', 'large', 'improvements', 'in', 'recognition', '3', 'two', 'technologies', 'together', 'with', 'a', 'new', 'rnn', 'branch', 'for', 'word', 'recognition', 'are', 'integrated', 'seamlessly', 'into', 'a', 'single', 'model', 'which', 'is', 'endtoend', 'trainable', 'this', 'allows', 'the', 'two', 'tasks', 'to', 'work', 'collaboratively', 'by', 'shar', 'ing', 'convolutional', 'features', 'which', 'is', 'critical', 'to', 'identify', 'challenging', 'text', 'instances', 'our', 'model', 'achieves', 'impressive', 'results', 'in', 'endtoend', 'recognition', 'on', 'the', 'icdar2015', 'dataset', 'significantly', 'advancing', 'most', 'recent', 'results', 'with', 'improvements', 'of', 'fmeasure', 'from', '054', '051', '047', 'to', '082', '077', '063', 'by', 'using', 'a', 'strong', 'weak', 'and', 'generic', 'lexicon', 'respectively', 'thanks', 'to', 'joint', 'training', 'our', 'method', 'can', 'also', 'serve', 'as', 'a', 'good', 'detec', 'tor', 'by', 'achieving', 'a', 'new', 'stateoftheart', 'detection', 'performance', 'on', 'two', 'datasets']] | [-0.05774013356509784, 0.01511984761829858, -0.05419045428375471, 0.03847400720292898, -0.09123743036719353, -0.19872492984081852, 0.01728087905199016, 0.441498071699484, -0.23772680991330317, -0.3533231024694157, 0.055860603734272526, -0.27212567837309776, -0.1651021473420163, 0.22354802717008207, -0.13462574082877504, 0.06878972608626918, 0.1284907609968527, 0.0398034288858374, -0.0696392357274975, -0.2863070623466498, 0.2583478508744661, 0.02319536477191263, 0.3454702907214239, 0.07154096796742926, 0.14287035087480732, -0.07076042397883317, -0.0033280561267734253, -0.04049598570640909, -0.04420083403115168, 0.18340200161748485, 0.3218182929765994, 0.13185607251598497, 0.3148670221666155, -0.37376854651672425, -0.20259685369238223, 0.038540626458502605, 0.16759216285536074, 0.1039033129808762, -0.04983374049895566, -0.32822287600853195, 0.12020574240269113, -0.1904976567243902, 0.04645689032742218, -0.11991240793082132, 0.01744676937219436, -0.04249974215173558, -0.2954589603436881, 0.04726945256565051, 0.08923045798634353, 0.0435612523273382, -0.01800309551149377, -0.11895832070255796, 0.054887610137862364, 0.17690558251861024, 0.027127857359347345, 0.10820963477384146, 0.10161444706471262, -0.17328312873763785, -0.1554800626889858, 0.36470771549465175, -0.10503961862124435, -0.20240511868115021, 0.1974290071042535, -0.031030029072543205, -0.1811386421492927, 0.1344037559468163, 0.21356454184151266, 0.10571391712999095, -0.1831134805608898, -0.016884125499628894, -0.038384573933876814, 0.19970608922997363, 0.0484006088631032, -0.004169619848449889, 0.20018693189919165, 0.2596184619496147, 0.01862268300714252, 0.14575704802827033, -0.1491428828281542, -0.04138966105436081, -0.21582164850987529, -0.11940647649459676, -0.15316562640021414, -0.01575040276859755, -0.09579843006718193, -0.10053808542317179, 0.4176376882693879, 0.2261892348829844, 0.2420658337730557, 0.09324815220116599, 0.34764937541317875, 0.018932819151963834, 0.1353176317164955, 0.06291454500831306, 0.19612846002365425, 0.00947078199925318, 0.10694294507518522, -0.13112713956831185, 0.05482395264967536, 0.06314218774029653] |
1,803.03475 | Impact of cyber-invasive species on a large ecological network | As impacts of introduced species cascade through trophic levels, they can
cause indirect and counter-intuitive effects. To investigate the impact of
invasive species at the network scale, we use a generalized food web model,
capable of propagating changes through networks with a series of ecologically
realistic criteria. Using data from a small British offshore island, we
quantify the impacts of four virtual invasive species (an insectivore, a
herbivore, a carnivore and an omnivore whose diet is based on a rat) and
explore which clusters of species react in similar ways. We find that the
predictions for the impacts of invasive species are ecologically plausible,
even for large networks robust predictions for the impacts of invasive species
can be obtained. Species in the same taxonomic group are similarly impacted by
a virtual invasive species. However, interesting differences within a given
taxonomic group can occur. The results suggest that some native species may be
at risk from a wider range of invasives than previously believed. The
implications of these results for ecologists and land managers are discussed.
| q-bio.PE | as impacts of introduced species cascade through trophic levels they can cause indirect and counterintuitive effects to investigate the impact of invasive species at the network scale we use a generalized food web model capable of propagating changes through networks with a series of ecologically realistic criteria using data from a small british offshore island we quantify the impacts of four virtual invasive species an insectivore a herbivore a carnivore and an omnivore whose diet is based on a rat and explore which clusters of species react in similar ways we find that the predictions for the impacts of invasive species are ecologically plausible even for large networks robust predictions for the impacts of invasive species can be obtained species in the same taxonomic group are similarly impacted by a virtual invasive species however interesting differences within a given taxonomic group can occur the results suggest that some native species may be at risk from a wider range of invasives than previously believed the implications of these results for ecologists and land managers are discussed | [['as', 'impacts', 'of', 'introduced', 'species', 'cascade', 'through', 'trophic', 'levels', 'they', 'can', 'cause', 'indirect', 'and', 'counterintuitive', 'effects', 'to', 'investigate', 'the', 'impact', 'of', 'invasive', 'species', 'at', 'the', 'network', 'scale', 'we', 'use', 'a', 'generalized', 'food', 'web', 'model', 'capable', 'of', 'propagating', 'changes', 'through', 'networks', 'with', 'a', 'series', 'of', 'ecologically', 'realistic', 'criteria', 'using', 'data', 'from', 'a', 'small', 'british', 'offshore', 'island', 'we', 'quantify', 'the', 'impacts', 'of', 'four', 'virtual', 'invasive', 'species', 'an', 'insectivore', 'a', 'herbivore', 'a', 'carnivore', 'and', 'an', 'omnivore', 'whose', 'diet', 'is', 'based', 'on', 'a', 'rat', 'and', 'explore', 'which', 'clusters', 'of', 'species', 'react', 'in', 'similar', 'ways', 'we', 'find', 'that', 'the', 'predictions', 'for', 'the', 'impacts', 'of', 'invasive', 'species', 'are', 'ecologically', 'plausible', 'even', 'for', 'large', 'networks', 'robust', 'predictions', 'for', 'the', 'impacts', 'of', 'invasive', 'species', 'can', 'be', 'obtained', 'species', 'in', 'the', 'same', 'taxonomic', 'group', 'are', 'similarly', 'impacted', 'by', 'a', 'virtual', 'invasive', 'species', 'however', 'interesting', 'differences', 'within', 'a', 'given', 'taxonomic', 'group', 'can', 'occur', 'the', 'results', 'suggest', 'that', 'some', 'native', 'species', 'may', 'be', 'at', 'risk', 'from', 'a', 'wider', 'range', 'of', 'invasives', 'than', 'previously', 'believed', 'the', 'implications', 'of', 'these', 'results', 'for', 'ecologists', 'and', 'land', 'managers', 'are', 'discussed']] | [-0.07694402413078766, 0.18253206992779467, -0.05431727505417477, 0.12583218942377608, -0.029785295219117797, -0.13038780672834308, 0.07023141562775441, 0.3437062192536976, -0.2064211257016179, -0.3199930409044455, 0.08125055865946643, -0.2719121049158275, -0.18070519674333863, 0.19679545475592858, -0.07906621282561628, -0.03321876650510206, 0.09759214382361749, 0.004968461869605656, 0.041051396391563244, -0.22593412398167984, 0.3082172721999044, 0.06271803135857863, 0.27835715044525333, 0.07906233930649857, 0.10221344571635556, -0.06375908226995118, -0.0449829502767166, 0.044241135912524515, -0.09723523189756958, 0.12500160759126389, 0.276282736082861, 0.15466254784982522, 0.2838413756495963, -0.46936174519574164, -0.24761414086317707, 0.13069235396487155, 0.13433799013126127, 0.13388424900550416, -0.025164799756054693, -0.2996861163410358, 0.029420757150724425, -0.1960627386840221, -0.13850825395563554, -0.0306392914184701, -0.003337017760943921, 0.04610386343630052, -0.2630168434965756, 0.08546849709785619, -0.05718541147198057, 0.12270285429475808, -0.05684279600136924, -0.14405434705777329, -0.08552135747118757, 0.1908861029780759, 0.04814264338514393, -0.07396223661409498, 0.20465208854708264, -0.15330199486891813, -0.09515769262369936, 0.395714456317197, -0.05228541170164271, -0.16087357457406048, 0.2736863351805703, -0.09544434618129898, -0.16533160278283932, 0.1167239523974472, 0.20215970963900695, 0.08705845418996339, -0.17794944825796302, -0.023062509199572277, -0.028607883232367366, 0.15223101921775645, 0.0777810196614364, -0.009029244061361399, 0.21996888939034323, 0.20260615098215212, 0.036360192342779075, 0.09666895595159725, -0.06977576454806987, -0.0753342309798082, -0.17768397298909125, -0.16593773928925867, -0.07182922823509823, 0.0016938847698399733, -0.09018774697491524, -0.14815846313026615, 0.3946280572777507, 0.16877007044834386, 0.1793073187796292, 0.04067569873202057, 0.2300683225266871, 0.0066673303225034865, 0.10573212887160396, 0.029164842040888195, 0.1818254244623869, 0.02209005421750119, 0.07698903503378146, -0.18545565480666085, 0.1940745384025591, -0.026801094997556472] |
1,803.03476 | An Unsupervised Model with Attention Autoencoders for Question Retrieval | Question retrieval is a crucial subtask for community question answering.
Previous research focus on supervised models which depend heavily on training
data and manual feature engineering. In this paper, we propose a novel
unsupervised framework, namely reduced attentive matching network (RAMN), to
compute semantic matching between two questions. Our RAMN integrates together
the deep semantic representations, the shallow lexical mismatching information
and the initial rank produced by an external search engine. For the first time,
we propose attention autoencoders to generate semantic representations of
questions. In addition, we employ lexical mismatching to capture surface
matching between two questions, which is derived from the importance of each
word in a question. We conduct experiments on the open CQA datasets of
SemEval-2016 and SemEval-2017. The experimental results show that our
unsupervised model obtains comparable performance with the state-of-the-art
supervised methods in SemEval-2016 Task 3, and outperforms the best system in
SemEval-2017 Task 3 by a wide margin.
| cs.CL | question retrieval is a crucial subtask for community question answering previous research focus on supervised models which depend heavily on training data and manual feature engineering in this paper we propose a novel unsupervised framework namely reduced attentive matching network ramn to compute semantic matching between two questions our ramn integrates together the deep semantic representations the shallow lexical mismatching information and the initial rank produced by an external search engine for the first time we propose attention autoencoders to generate semantic representations of questions in addition we employ lexical mismatching to capture surface matching between two questions which is derived from the importance of each word in a question we conduct experiments on the open cqa datasets of semeval2016 and semeval2017 the experimental results show that our unsupervised model obtains comparable performance with the stateoftheart supervised methods in semeval2016 task 3 and outperforms the best system in semeval2017 task 3 by a wide margin | [['question', 'retrieval', 'is', 'a', 'crucial', 'subtask', 'for', 'community', 'question', 'answering', 'previous', 'research', 'focus', 'on', 'supervised', 'models', 'which', 'depend', 'heavily', 'on', 'training', 'data', 'and', 'manual', 'feature', 'engineering', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'unsupervised', 'framework', 'namely', 'reduced', 'attentive', 'matching', 'network', 'ramn', 'to', 'compute', 'semantic', 'matching', 'between', 'two', 'questions', 'our', 'ramn', 'integrates', 'together', 'the', 'deep', 'semantic', 'representations', 'the', 'shallow', 'lexical', 'mismatching', 'information', 'and', 'the', 'initial', 'rank', 'produced', 'by', 'an', 'external', 'search', 'engine', 'for', 'the', 'first', 'time', 'we', 'propose', 'attention', 'autoencoders', 'to', 'generate', 'semantic', 'representations', 'of', 'questions', 'in', 'addition', 'we', 'employ', 'lexical', 'mismatching', 'to', 'capture', 'surface', 'matching', 'between', 'two', 'questions', 'which', 'is', 'derived', 'from', 'the', 'importance', 'of', 'each', 'word', 'in', 'a', 'question', 'we', 'conduct', 'experiments', 'on', 'the', 'open', 'cqa', 'datasets', 'of', 'semeval2016', 'and', 'semeval2017', 'the', 'experimental', 'results', 'show', 'that', 'our', 'unsupervised', 'model', 'obtains', 'comparable', 'performance', 'with', 'the', 'stateoftheart', 'supervised', 'methods', 'in', 'semeval2016', 'task', '3', 'and', 'outperforms', 'the', 'best', 'system', 'in', 'semeval2017', 'task', '3', 'by', 'a', 'wide', 'margin']] | [-0.02416095106247691, -0.007138322736650212, -0.02688246472963905, 0.0791402529062265, -0.13739787177045776, -0.173542608681981, 0.06491502779885956, 0.44948944393423645, -0.26777017818690807, -0.37295550526138027, 0.03334612877099026, -0.29554708304455857, -0.16588238869288485, 0.194867877624442, -0.12806653123945486, 0.05546228615019251, 0.16479625915682394, 0.07371045854642647, -0.07616752870472185, -0.30383019370720815, 0.3644610154549013, 0.026478565780231365, 0.3742286109006385, 0.06892721575617887, 0.14406076024417322, -0.02467052198891692, -0.10230928659515176, -0.054684044973577796, -0.08600654161948554, 0.22468302587619404, 0.3594178370655154, 0.2193892322438069, 0.3343265188182248, -0.36712263654795735, -0.21300526456968263, 0.07031936647623072, 0.12627165949008629, 0.102337853994553, -0.03163578705573029, -0.35392783416033374, 0.07353218338981855, -0.14782218368163977, 0.10345272132152923, -0.13132684738101327, -0.02169091349355024, -0.04328574263833135, -0.25804682760507025, 0.03631002582256603, 0.1321849015566484, 0.07549981540373338, -0.08118201103183179, -0.11521136717721699, 0.06798370958311982, 0.1880930779940065, 0.01369977393263671, 0.09046623481930617, 0.10101341539111257, -0.21953178040060867, -0.17961342983386097, 0.3642720586188089, -0.08894779903850719, -0.2070282121031816, 0.21236595418760737, 0.0046386836443607716, -0.1833130877428487, 0.0354011853292487, 0.2378074427628342, 0.1256215951492587, -0.14236823201569077, 0.031236097829879014, -0.09953183509117249, 0.22884192008881227, 0.06940857150433646, -0.04062387637879237, 0.18426373189397374, 0.30721243032637763, 0.011077236829270773, 0.14546894195818288, -0.0982985615964638, -0.03523045895602919, -0.1844378888448761, -0.09440403954533774, -0.16390293748939738, -0.06781652143447252, -0.08669579247571224, -0.1284666700917144, 0.4176892117639772, 0.2682911931336218, 0.22933947291868903, 0.07292196607625026, 0.3188630536661234, -0.010159369130478867, 0.06324811356318688, 0.1197679289639471, 0.16281245060849422, -0.019326114342274034, 0.12182936589142271, -0.18324642664801596, 0.07755939079314665, 0.10785778991579766] |
1,803.03477 | Behavioural effects on XVA | Bank behaviour is important for pricing XVA because it links different
counterparties and thus breaks the usual XVA pricing assumption of counterparty
independence. Consider a typical case of a bank hedging a client trade via a
CCP. On client default the hedge (effects) will be removed (rebalanced). On the
other hand, if the hedge counterparty defaults the hedge will be replaced. Thus
if the hedge required initial margin then the default probability driving MVA
is from the client not from the hedge counterparty. This is the opposite of
usual assumptions where counterparty XVAs are computed independent of each
other. Replacement of the hedge counterparty means multiple CVA costs on the
hedge side need inclusion. Since hedge trades are generally at riskless mid (or
worse) these costs are paid on the client side, and must be calculated before
the replacement hedge counterparties are known. We call these counterparties
anonymous counterparties. The effects on CVA and MVA will generally be
exclusive because MVA largely removes CVA, and CVA is hardly relevant for CCPs.
Effects on KVA and FVA will resemble those on MVA. We provide a theoretical
framework, including anonymous counterparties, and numerical examples. Pricing
XVA by considering counterparties in isolation is inadequate and behaviour must
be taken into account.
| q-fin.PR | bank behaviour is important for pricing xva because it links different counterparties and thus breaks the usual xva pricing assumption of counterparty independence consider a typical case of a bank hedging a client trade via a ccp on client default the hedge effects will be removed rebalanced on the other hand if the hedge counterparty defaults the hedge will be replaced thus if the hedge required initial margin then the default probability driving mva is from the client not from the hedge counterparty this is the opposite of usual assumptions where counterparty xvas are computed independent of each other replacement of the hedge counterparty means multiple cva costs on the hedge side need inclusion since hedge trades are generally at riskless mid or worse these costs are paid on the client side and must be calculated before the replacement hedge counterparties are known we call these counterparties anonymous counterparties the effects on cva and mva will generally be exclusive because mva largely removes cva and cva is hardly relevant for ccps effects on kva and fva will resemble those on mva we provide a theoretical framework including anonymous counterparties and numerical examples pricing xva by considering counterparties in isolation is inadequate and behaviour must be taken into account | [['bank', 'behaviour', 'is', 'important', 'for', 'pricing', 'xva', 'because', 'it', 'links', 'different', 'counterparties', 'and', 'thus', 'breaks', 'the', 'usual', 'xva', 'pricing', 'assumption', 'of', 'counterparty', 'independence', 'consider', 'a', 'typical', 'case', 'of', 'a', 'bank', 'hedging', 'a', 'client', 'trade', 'via', 'a', 'ccp', 'on', 'client', 'default', 'the', 'hedge', 'effects', 'will', 'be', 'removed', 'rebalanced', 'on', 'the', 'other', 'hand', 'if', 'the', 'hedge', 'counterparty', 'defaults', 'the', 'hedge', 'will', 'be', 'replaced', 'thus', 'if', 'the', 'hedge', 'required', 'initial', 'margin', 'then', 'the', 'default', 'probability', 'driving', 'mva', 'is', 'from', 'the', 'client', 'not', 'from', 'the', 'hedge', 'counterparty', 'this', 'is', 'the', 'opposite', 'of', 'usual', 'assumptions', 'where', 'counterparty', 'xvas', 'are', 'computed', 'independent', 'of', 'each', 'other', 'replacement', 'of', 'the', 'hedge', 'counterparty', 'means', 'multiple', 'cva', 'costs', 'on', 'the', 'hedge', 'side', 'need', 'inclusion', 'since', 'hedge', 'trades', 'are', 'generally', 'at', 'riskless', 'mid', 'or', 'worse', 'these', 'costs', 'are', 'paid', 'on', 'the', 'client', 'side', 'and', 'must', 'be', 'calculated', 'before', 'the', 'replacement', 'hedge', 'counterparties', 'are', 'known', 'we', 'call', 'these', 'counterparties', 'anonymous', 'counterparties', 'the', 'effects', 'on', 'cva', 'and', 'mva', 'will', 'generally', 'be', 'exclusive', 'because', 'mva', 'largely', 'removes', 'cva', 'and', 'cva', 'is', 'hardly', 'relevant', 'for', 'ccps', 'effects', 'on', 'kva', 'and', 'fva', 'will', 'resemble', 'those', 'on', 'mva', 'we', 'provide', 'a', 'theoretical', 'framework', 'including', 'anonymous', 'counterparties', 'and', 'numerical', 'examples', 'pricing', 'xva', 'by', 'considering', 'counterparties', 'in', 'isolation', 'is', 'inadequate', 'and', 'behaviour', 'must', 'be', 'taken', 'into', 'account']] | [-0.09269612310680923, 0.04558734850769934, -0.0828593381783531, 0.19084615431627475, -0.17382959946049736, -0.22486876236731546, 0.13749397097881927, 0.44187983068136066, -0.25968994728128353, -0.19581349237929457, 0.21471803164884198, -0.3204536239365832, -0.06729803856377167, 0.16797401703773246, -0.19241574020214522, -0.04628548985391927, 0.05083124815316226, -0.014933123740075434, 0.06603372167760077, -0.29582739841414596, 0.2788448348314537, 0.07527888635657011, 0.26340706637039635, 0.08649560808575749, 0.05367957403527376, 0.050303356573119976, -0.07774474158493551, 0.048335332539863884, -0.06691691966261715, 0.08713875380299914, 0.2677022050103495, 0.1307241011205196, 0.3928791049044006, -0.4958712055768746, -0.08526697600385748, 0.15748876061955414, 0.008560607299351921, 0.03617899331640309, 0.04895894019024966, -0.2806002598137219, -0.004107214930207612, -0.31014979491234185, -0.06353487875178242, -0.04562229298440238, 0.013791066258608434, 0.04009483874968002, -0.323036725241064, 0.006582425083391941, -0.0055168532403163575, 0.013439903776788224, -0.02004512675697557, -0.17956111142904355, -0.07677622038038233, 0.12543168971751584, 0.13004826171863199, -0.08189904965267768, 0.18432807202491228, -0.08914261373306195, -0.1536137976531441, 0.3863252896296147, 0.005452672372764657, -0.21342670444974268, 0.043464955125483144, -0.09809847954714385, -0.11152607946244714, 0.09735986025771126, 0.13906688468705397, 0.022142297364413165, -0.17943521827916042, 0.0566879987647833, -0.0078013979968650695, 0.14153403387619898, 0.10874450588240646, 0.0019014674449303688, 0.18541535337751086, 0.09420322087512781, 0.1041531555797869, 0.10461918503264875, -0.023951460968908996, -0.18076474138293774, -0.3011870209752837, -0.1037620436675822, -0.08817376795027834, 0.031485325673691895, -0.12822048758194937, -0.15806903484022208, 0.3104466065527119, 0.15771893343816584, 0.06884159992142276, 0.10854846565724494, 0.35559603317569083, 0.18274710067691138, 0.06404014203312378, 0.08419871978716961, 0.19767810018786874, -0.0684600848925094, 0.08305127230974343, -0.17878810260131453, 0.3122566183111093, -0.00426898317695864] |
1,803.03478 | Model Predictive Control for Autonomous Driving considering Actuator
Dynamics | In this paper, we propose a new model predictive control (MPC) formulation
for autonomous driving. The novelty of our MPC stems from the following
results. Firstly, we adopt an alternating minimization approach wherein linear
velocities and angular accelerations are alternately optimized. We show that in
contrast to the joint optimization, the alternating minimization exploits the
structure of the problem better, which in turn translates to reduction in
computation time. Secondly, our MPC explicitly incorporates the time dependent
non-linear actuator dynamics that captures the transient response of the
vehicle for a given commanded velocity. This added complexity improves the
predictive component of MPC resulting in improved margin of inter-vehicle
distance during maneuvers like overtaking, lane-change, etc. Although, past
works have also incorporated actuator dynamics within MPC, there has been very
few attempts towards coupling actuator dynamics to collision avoidance
constraints through the non-holonomic motion model of the vehicle and analyzing
the resulting behavior. We use a high fidelity simulator to benchmark our
actuator dynamics augmented MPC with other related approaches in terms of
metrics like inter-vehicle distance, trajectory smoothness, and velocity
overshoot.
| cs.RO | in this paper we propose a new model predictive control mpc formulation for autonomous driving the novelty of our mpc stems from the following results firstly we adopt an alternating minimization approach wherein linear velocities and angular accelerations are alternately optimized we show that in contrast to the joint optimization the alternating minimization exploits the structure of the problem better which in turn translates to reduction in computation time secondly our mpc explicitly incorporates the time dependent nonlinear actuator dynamics that captures the transient response of the vehicle for a given commanded velocity this added complexity improves the predictive component of mpc resulting in improved margin of intervehicle distance during maneuvers like overtaking lanechange etc although past works have also incorporated actuator dynamics within mpc there has been very few attempts towards coupling actuator dynamics to collision avoidance constraints through the nonholonomic motion model of the vehicle and analyzing the resulting behavior we use a high fidelity simulator to benchmark our actuator dynamics augmented mpc with other related approaches in terms of metrics like intervehicle distance trajectory smoothness and velocity overshoot | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'model', 'predictive', 'control', 'mpc', 'formulation', 'for', 'autonomous', 'driving', 'the', 'novelty', 'of', 'our', 'mpc', 'stems', 'from', 'the', 'following', 'results', 'firstly', 'we', 'adopt', 'an', 'alternating', 'minimization', 'approach', 'wherein', 'linear', 'velocities', 'and', 'angular', 'accelerations', 'are', 'alternately', 'optimized', 'we', 'show', 'that', 'in', 'contrast', 'to', 'the', 'joint', 'optimization', 'the', 'alternating', 'minimization', 'exploits', 'the', 'structure', 'of', 'the', 'problem', 'better', 'which', 'in', 'turn', 'translates', 'to', 'reduction', 'in', 'computation', 'time', 'secondly', 'our', 'mpc', 'explicitly', 'incorporates', 'the', 'time', 'dependent', 'nonlinear', 'actuator', 'dynamics', 'that', 'captures', 'the', 'transient', 'response', 'of', 'the', 'vehicle', 'for', 'a', 'given', 'commanded', 'velocity', 'this', 'added', 'complexity', 'improves', 'the', 'predictive', 'component', 'of', 'mpc', 'resulting', 'in', 'improved', 'margin', 'of', 'intervehicle', 'distance', 'during', 'maneuvers', 'like', 'overtaking', 'lanechange', 'etc', 'although', 'past', 'works', 'have', 'also', 'incorporated', 'actuator', 'dynamics', 'within', 'mpc', 'there', 'has', 'been', 'very', 'few', 'attempts', 'towards', 'coupling', 'actuator', 'dynamics', 'to', 'collision', 'avoidance', 'constraints', 'through', 'the', 'nonholonomic', 'motion', 'model', 'of', 'the', 'vehicle', 'and', 'analyzing', 'the', 'resulting', 'behavior', 'we', 'use', 'a', 'high', 'fidelity', 'simulator', 'to', 'benchmark', 'our', 'actuator', 'dynamics', 'augmented', 'mpc', 'with', 'other', 'related', 'approaches', 'in', 'terms', 'of', 'metrics', 'like', 'intervehicle', 'distance', 'trajectory', 'smoothness', 'and', 'velocity', 'overshoot']] | [-0.1418918940027692, 0.025979646464931335, -0.10034302645684504, 0.000772382688415314, -0.09659709659461653, -0.14714652470966483, 0.026101148627366864, 0.3989246172511446, -0.30284047770463135, -0.3289366363462843, 0.08968701379232813, -0.2285005118703027, -0.1473143912198341, 0.18104361246586959, -0.11254677931644552, 0.09951783766460641, 0.07091412764783557, 0.007419026217510852, -0.0616240406985194, -0.209198980238443, 0.2382178852844016, 0.07797969971109409, 0.2576638660367928, -0.0007610260251683095, 0.18752849254839493, 0.031552361511594476, 0.01341004086303324, 0.06591355294704396, -0.10938499325628133, 0.11938400292069296, 0.2220790173796659, 0.1250010420354752, 0.3155360018013776, -0.44451180699368864, -0.23720247663032695, 0.07414351557561541, 0.15886331532016726, 0.09799862858962824, -0.02555801444395911, -0.29613719376843445, 0.0656896928770375, -0.18135887622422903, -0.11681394403779786, -0.042712309500665624, 0.007604927784192134, 0.05194512328058378, -0.257472185092883, 0.09806160422737288, 0.021789968178417142, 0.033192141429207275, -0.08250886571043022, -0.0693914884037611, 0.02024675232553803, 0.12077770314985907, 0.06463996264234556, 0.04659646244472644, 0.17378474224502868, -0.10392074529126606, -0.11597499322147464, 0.38091149498085947, -0.03621148456721592, -0.20199906426219486, 0.16993422665278227, -0.0346495415674502, -0.12156423972276405, 0.09978574490494954, 0.25654732141880454, 0.1028299719861899, -0.16257063568041027, 0.030411394201386308, 0.0024801969530770956, 0.1831481248276689, 0.037019388110876, 0.0008243524484871501, 0.13316042949085366, 0.21775984899552528, 0.13813379256039324, 0.11457175101978108, -0.1322161346282913, -0.16534751151348798, -0.2753359204086151, -0.06944689727825684, -0.1287941729562429, -0.01394337443866412, -0.11024228564712145, -0.09346815186182232, 0.39966121434815516, 0.20366549034196452, 0.18729603222638205, 0.11430523870963068, 0.34259743190972514, 0.09367321254055207, 0.07077014451275337, 0.10903589857886262, 0.29977403835197963, 0.05460969592542362, 0.10641803799225377, -0.27239285738629326, 0.09271876293604998, 0.0527127234970132] |
1,803.03479 | Highly Automated Learning for Improved Active Safety of Vulnerable Road
Users | Highly automated driving requires precise models of traffic participants.
Many state of the art models are currently based on machine learning
techniques. Among others, the required amount of labeled data is one major
challenge. An autonomous learning process addressing this problem is proposed.
The initial models are iteratively refined in three steps: (1) detection and
context identification, (2) novelty detection and active learning and (3)
online model adaption.
| cs.AI | highly automated driving requires precise models of traffic participants many state of the art models are currently based on machine learning techniques among others the required amount of labeled data is one major challenge an autonomous learning process addressing this problem is proposed the initial models are iteratively refined in three steps 1 detection and context identification 2 novelty detection and active learning and 3 online model adaption | [['highly', 'automated', 'driving', 'requires', 'precise', 'models', 'of', 'traffic', 'participants', 'many', 'state', 'of', 'the', 'art', 'models', 'are', 'currently', 'based', 'on', 'machine', 'learning', 'techniques', 'among', 'others', 'the', 'required', 'amount', 'of', 'labeled', 'data', 'is', 'one', 'major', 'challenge', 'an', 'autonomous', 'learning', 'process', 'addressing', 'this', 'problem', 'is', 'proposed', 'the', 'initial', 'models', 'are', 'iteratively', 'refined', 'in', 'three', 'steps', '1', 'detection', 'and', 'context', 'identification', '2', 'novelty', 'detection', 'and', 'active', 'learning', 'and', '3', 'online', 'model', 'adaption']] | [-0.07186483161743074, 0.053199325121728605, -0.01117065891294795, 0.04095990210699336, -0.10057941603693454, -0.20508092647308812, 0.02183613890562864, 0.3873402410844231, -0.24665528273566023, -0.39959120361463113, 0.1528238114894039, -0.2818161650451229, -0.13082710754722082, 0.21470351870212814, -0.12843488786123036, 0.13577344264451632, 0.14398656274630306, 0.052069842596264446, 0.017679138345342568, -0.30969382539008034, 0.31572422760483976, 0.016744636547039535, 0.3587400174206671, -0.017335529822637055, 0.13046844935161062, 0.018568659180720502, -0.10471505396451582, -0.087656613357146, -0.027135999376803416, 0.20202096829512706, 0.3340584963100756, 0.24174306215033592, 0.38065334814874563, -0.40078329278484864, -0.22541622005348258, 0.14041121723130345, 0.16638345382285907, 0.1270850403131643, -0.05962168413851246, -0.3003712237251046, 0.046099580913398636, -0.1660227028050405, -0.03448553712052457, -0.10984353833448361, 0.007966631345505662, -0.017736381068757242, -0.27618052673471327, 0.024228715519283843, 0.06825553452226278, 0.08573127161327969, -0.08398425514015424, -0.12768879498574226, 0.06922716244726497, 0.18492912639767917, 0.03529555149340441, 0.03694672539474114, 0.1553844481959994, -0.2402750586043112, -0.18980353255071403, 0.32616904186194434, 0.031182251514538246, -0.17329205594518604, 0.24091737936867183, 0.030215213516973618, -0.2095510425621315, 0.11866012492956703, 0.22055458093938582, 0.15359843992080321, -0.1808634819325936, 0.000845987706698532, 0.024113364052027464, 0.21011899770511425, -0.030671445762409884, -0.07349768867168356, 0.17548163535128183, 0.3105235996053499, 0.05264730274126016, 0.040503054035498816, -0.09481716348775937, -0.10945113715441789, -0.22133734660661397, -0.08597206240793799, -0.1551893929923501, -0.05018783593892723, -0.06803067268821691, -0.09771083762718584, 0.37408295331303687, 0.2246090952265898, 0.1549904609701651, 0.027018011632368572, 0.3853000627063653, 0.02834803605262149, 0.05145631542922381, 0.11228932449868058, 0.21021621938116902, 0.01551603217718794, 0.13286201644223183, -0.1583651015517877, 0.1299940463675953, 0.06922605951010208] |
1,803.0348 | Ascertaining when a basin is Wada: the merging method | Trying to imagine three regions separated by a unique boundary seems a
difficult task. However, this is exactly what happens in many dynamical systems
showing Wada basins. Here, we present a new perspective on the Wada property: A
Wada boundary is the only one that remains unaltered under the action of
merging the basins. This observation allows to develop a new method to test the
Wada property, which is much faster than the previous ones. Furthermore,
another major advantage of the merging method is that a detailed knowledge of
the dynamical system is not required.
| nlin.CD | trying to imagine three regions separated by a unique boundary seems a difficult task however this is exactly what happens in many dynamical systems showing wada basins here we present a new perspective on the wada property a wada boundary is the only one that remains unaltered under the action of merging the basins this observation allows to develop a new method to test the wada property which is much faster than the previous ones furthermore another major advantage of the merging method is that a detailed knowledge of the dynamical system is not required | [['trying', 'to', 'imagine', 'three', 'regions', 'separated', 'by', 'a', 'unique', 'boundary', 'seems', 'a', 'difficult', 'task', 'however', 'this', 'is', 'exactly', 'what', 'happens', 'in', 'many', 'dynamical', 'systems', 'showing', 'wada', 'basins', 'here', 'we', 'present', 'a', 'new', 'perspective', 'on', 'the', 'wada', 'property', 'a', 'wada', 'boundary', 'is', 'the', 'only', 'one', 'that', 'remains', 'unaltered', 'under', 'the', 'action', 'of', 'merging', 'the', 'basins', 'this', 'observation', 'allows', 'to', 'develop', 'a', 'new', 'method', 'to', 'test', 'the', 'wada', 'property', 'which', 'is', 'much', 'faster', 'than', 'the', 'previous', 'ones', 'furthermore', 'another', 'major', 'advantage', 'of', 'the', 'merging', 'method', 'is', 'that', 'a', 'detailed', 'knowledge', 'of', 'the', 'dynamical', 'system', 'is', 'not', 'required']] | [-0.14857245540785555, 0.09073621483617707, -0.16703454197237366, 0.09269943386193757, -0.1124883860741791, -0.12365677384414563, 0.04636193680773048, 0.3435286165068024, -0.2667456824969696, -0.2607219185680151, 0.12071717335340126, -0.23229320824014538, -0.1623162490193193, 0.20007680302583858, -0.10158267425569265, 0.02191696290514971, 0.08279378149462374, 0.04347004606878679, -0.07167491437132029, -0.24425382759225997, 0.32763476893183235, 0.03261345212690924, 0.24217189314628118, 0.026634889171385255, 0.09861578145309498, -0.06033150693646779, 0.004216534409083818, 0.021532283453760962, -0.11642457805650529, 0.10399696146579165, 0.1811926601332073, 0.13914934907378138, 0.34672723920329623, -0.367049251673253, -0.20843847872395266, 0.12179528940469027, 0.15529665356796038, 0.12335560848617828, -0.03312004609156008, -0.24912091583797807, 0.1000464177016463, -0.1469892519085031, -0.14754506404462614, -0.039826674979964366, 0.028772291050929773, -0.10237096828580099, -0.22469781822966117, 0.03839808916182894, 0.12479188503072548, 0.013852558451655663, -0.047207036494939146, -0.046987423221090514, 0.0008820735310253344, 0.13561561189003682, 0.02798320459152915, 0.04596134985944158, 0.1000132416154405, -0.09301135774799868, -0.08500018998441336, 0.41237868234319125, 0.012812160020908585, -0.17706348580357276, 0.2885302194835324, -0.1606006152094587, -0.18194739405850047, 0.1448741930389875, 0.08494716174900532, 0.14245372830252898, -0.2106349959185249, 0.04294276847749164, -0.09654090773853424, 0.17665716156755623, 0.029659123454046876, -0.026159078598414598, 0.185164239453642, 0.19538151108120616, 0.1192168036494159, 0.15463988513342644, -0.04433658050716315, -0.11625623576539128, -0.24712551810631628, -0.1549074031345203, -0.1708841084380095, 0.043948805055391095, -0.02788881628136886, -0.1483019650558402, 0.4052184159450821, 0.19119741630397344, 0.20983214382768461, 0.010275245089034893, 0.3190401614888718, 0.059875647606034026, 0.07772037624626567, 0.07676136640182353, 0.25172444425621315, 0.07459292576133617, 0.08596973864753779, -0.172904757067169, 0.09927660314072119, 0.09053475968539715] |
1,803.03481 | Improved and Scalable Online Learning of Spatial Concepts and Language
Models with Mapping | We propose a novel online learning algorithm, called SpCoSLAM 2.0, for
spatial concepts and lexical acquisition with high accuracy and scalability.
Previously, we proposed SpCoSLAM as an online learning algorithm based on
unsupervised Bayesian probabilistic model that integrates multimodal place
categorization, lexical acquisition, and SLAM. However, our original algorithm
had limited estimation accuracy owing to the influence of the early stages of
learning, and increased computational complexity with added training data.
Therefore, we introduce techniques such as fixed-lag rejuvenation to reduce the
calculation time while maintaining an accuracy higher than that of the original
algorithm. The results show that, in terms of estimation accuracy, the proposed
algorithm exceeds the original algorithm and is comparable to batch learning.
In addition, the calculation time of the proposed algorithm does not depend on
the amount of training data and becomes constant for each step of the scalable
algorithm. Our approach will contribute to the realization of long-term spatial
language interactions between humans and robots.
| cs.RO cs.AI cs.CL cs.LG | we propose a novel online learning algorithm called spcoslam 20 for spatial concepts and lexical acquisition with high accuracy and scalability previously we proposed spcoslam as an online learning algorithm based on unsupervised bayesian probabilistic model that integrates multimodal place categorization lexical acquisition and slam however our original algorithm had limited estimation accuracy owing to the influence of the early stages of learning and increased computational complexity with added training data therefore we introduce techniques such as fixedlag rejuvenation to reduce the calculation time while maintaining an accuracy higher than that of the original algorithm the results show that in terms of estimation accuracy the proposed algorithm exceeds the original algorithm and is comparable to batch learning in addition the calculation time of the proposed algorithm does not depend on the amount of training data and becomes constant for each step of the scalable algorithm our approach will contribute to the realization of longterm spatial language interactions between humans and robots | [['we', 'propose', 'a', 'novel', 'online', 'learning', 'algorithm', 'called', 'spcoslam', '20', 'for', 'spatial', 'concepts', 'and', 'lexical', 'acquisition', 'with', 'high', 'accuracy', 'and', 'scalability', 'previously', 'we', 'proposed', 'spcoslam', 'as', 'an', 'online', 'learning', 'algorithm', 'based', 'on', 'unsupervised', 'bayesian', 'probabilistic', 'model', 'that', 'integrates', 'multimodal', 'place', 'categorization', 'lexical', 'acquisition', 'and', 'slam', 'however', 'our', 'original', 'algorithm', 'had', 'limited', 'estimation', 'accuracy', 'owing', 'to', 'the', 'influence', 'of', 'the', 'early', 'stages', 'of', 'learning', 'and', 'increased', 'computational', 'complexity', 'with', 'added', 'training', 'data', 'therefore', 'we', 'introduce', 'techniques', 'such', 'as', 'fixedlag', 'rejuvenation', 'to', 'reduce', 'the', 'calculation', 'time', 'while', 'maintaining', 'an', 'accuracy', 'higher', 'than', 'that', 'of', 'the', 'original', 'algorithm', 'the', 'results', 'show', 'that', 'in', 'terms', 'of', 'estimation', 'accuracy', 'the', 'proposed', 'algorithm', 'exceeds', 'the', 'original', 'algorithm', 'and', 'is', 'comparable', 'to', 'batch', 'learning', 'in', 'addition', 'the', 'calculation', 'time', 'of', 'the', 'proposed', 'algorithm', 'does', 'not', 'depend', 'on', 'the', 'amount', 'of', 'training', 'data', 'and', 'becomes', 'constant', 'for', 'each', 'step', 'of', 'the', 'scalable', 'algorithm', 'our', 'approach', 'will', 'contribute', 'to', 'the', 'realization', 'of', 'longterm', 'spatial', 'language', 'interactions', 'between', 'humans', 'and', 'robots']] | [-0.01941287813141294, 0.005213449066483144, -0.0692667507740773, 0.030231945493594044, -0.12007332047135193, -0.1643399704878236, 0.06141253145301703, 0.43361956244392424, -0.22957248023207882, -0.38840935359599055, 0.06904707858425721, -0.22158929282186193, -0.17252557378324465, 0.1811255486472365, -0.13859491852279868, 0.08691960100376667, 0.13446177800492562, 0.055699797241618824, -0.07859490191280517, -0.3246784321313018, 0.23144233737991232, 0.10064100988371216, 0.3465514186110278, 0.03834221501956168, 0.18967031605501214, 0.01088182449121005, -0.05843483156854321, -0.014317343033190747, -0.06418339757935501, 0.16488254939709207, 0.2849705300831832, 0.23901366686407963, 0.3635334399823817, -0.400177255307573, -0.17475951306221094, 0.10691763290315462, 0.18425341257073494, 0.12639135975529503, -0.033610344628705095, -0.30626287457087764, 0.09504996691266457, -0.15532372113294113, 0.006706268721844376, -0.13941712812838716, -0.03371527061583648, -0.022919316178474067, -0.2799862817628309, 0.06026246250022827, 0.08726343588024285, 0.05519849639319958, -0.0757602264364221, -0.12060907041156514, 0.04433526832506246, 0.134917347312338, 0.03666774580842289, 0.06115171379808869, 0.13673968837735306, -0.14243116840627623, -0.15619884179803825, 0.35987430117931796, -0.044995052921198896, -0.18122565658381268, 0.1919391945435417, -0.023812898897467565, -0.16255621421469016, 0.14919564990407747, 0.24615935815219125, 0.0874100130178636, -0.11186614474686592, 0.03615788561877685, 0.024987649357652072, 0.2111450684146944, 0.02350397053990305, 0.029930157074993996, 0.0825552403545788, 0.2804988529536763, 0.06649955292015412, 0.11453765696811241, -0.1119697246764156, -0.07719014013498467, -0.2078501371817189, -0.1476161119539684, -0.21105954293393014, -0.07210812274168132, -0.15324253164550292, -0.14386272234393874, 0.3686012667517022, 0.25619440858963854, 0.18690480398858741, 0.14459854815739515, 0.38184637115886494, 0.06352184763791398, 0.09464153049185421, 0.12899013843983181, 0.18380938736708857, 0.007802933541282734, 0.15120014148729605, -0.25172440783100447, 0.13842394501939764, 0.06290247014894364] |
1,803.03482 | Ensuring referential integrity under causal consistency | Referential integrity (RI) is an important correctness property of a shared,
distributed object storage system. It is sometimes thought that enforcing RI
requires a strong form of consistency. In this paper, we argue that causal
consistency suffices to maintain RI. We support this argument with pseudocode
for a reference CRDT data type that maintains RI under causal consistency.
QuickCheck has not found any errors in the model.
| cs.DC cs.DS | referential integrity ri is an important correctness property of a shared distributed object storage system it is sometimes thought that enforcing ri requires a strong form of consistency in this paper we argue that causal consistency suffices to maintain ri we support this argument with pseudocode for a reference crdt data type that maintains ri under causal consistency quickcheck has not found any errors in the model | [['referential', 'integrity', 'ri', 'is', 'an', 'important', 'correctness', 'property', 'of', 'a', 'shared', 'distributed', 'object', 'storage', 'system', 'it', 'is', 'sometimes', 'thought', 'that', 'enforcing', 'ri', 'requires', 'a', 'strong', 'form', 'of', 'consistency', 'in', 'this', 'paper', 'we', 'argue', 'that', 'causal', 'consistency', 'suffices', 'to', 'maintain', 'ri', 'we', 'support', 'this', 'argument', 'with', 'pseudocode', 'for', 'a', 'reference', 'crdt', 'data', 'type', 'that', 'maintains', 'ri', 'under', 'causal', 'consistency', 'quickcheck', 'has', 'not', 'found', 'any', 'errors', 'in', 'the', 'model']] | [-0.1368611850567273, 0.03104382348372844, -0.13520513675106105, 0.1086847310722458, -0.06654642531978411, -0.1861764508188327, 0.059647997815175845, 0.39747009721042503, -0.2560566767438579, -0.28125301010406284, 0.09031069806582336, -0.18460397872684606, -0.11931928696194247, 0.10157587563744121, -0.21900853371497855, 0.0714471750239383, 0.10326067979252938, 0.05349616685173294, -0.04204107409885237, -0.22208642168318046, 0.2868312552255064, 0.07970162027918581, 0.33642161797398507, -0.021989448730131863, 0.10074922349477715, 0.05235803300000505, -0.011651266067386118, 0.09425311103296369, -0.06482200489764765, 0.0978622034838451, 0.24321382384358056, 0.25893118493814965, 0.33050490598847615, -0.3984822931129541, -0.13830152133118306, 0.10828749034831774, 0.10822895269340543, 0.08914950164729979, -0.09374185701581969, -0.20462571142880775, 0.1576709530886207, -0.18538450471945664, -0.1418653223107555, -0.1303453270985342, 0.041834383038803935, -0.048681986698908594, -0.34254615061652305, 0.056069138162741575, 0.12680883184353361, 0.10856607059058525, -0.049310411521191914, -0.008776596387667554, -0.04561582623299823, 0.11336453737857849, -0.0032864750185703385, 0.03654587653173662, 0.07288266591894538, -0.11224469040006177, -0.07411295186846392, 0.387941439649952, 0.02777643515311404, -0.22322924950146186, 0.1919499467571836, -0.056868408014302825, -0.18359144161622137, 0.06347502748579231, 0.08262242931427795, 0.0669568292518605, -0.16796049978862057, 0.09186621826253276, -0.11293967977972395, 0.2520517016024287, 0.06444938081914364, 0.09677088724921888, 0.15587889362793805, 0.17040793677972657, 0.05528619244639108, 0.10465636661748833, -0.05580811422846433, -0.003787323394651288, -0.35903954059719595, -0.17831519457386502, -0.14306436729297708, 0.01274061939394998, -0.10542514754820671, -0.1750163119425302, 0.3224779048190911, 0.2168745914362927, 0.1277332298888533, 0.06491928895129197, 0.3014939884418872, 0.05140591096897512, 0.13346677225729478, 0.1288486769589693, 0.24378963158928108, 0.07626642481382213, 0.10419463692927983, -0.16364874005484492, 0.17266829931802713, 0.07488637756723077] |
1,803.03483 | Inquisitive bisimulation | Inquisitive modal logic InqML is a generalisation of standard Kripke-style
modal logic. In its epistemic incarnation, it extends standard epistemic logic
to capture not just the information that agents have, but also the questions
that they are interested in. Technically, InqML fits within the family of
logics based on team semantics. From a model-theoretic perspective, it takes us
a step in the direction of monadic second-order logic, as inquisitive modal
operators involve quantification over sets of worlds. We introduce and
investigate the natural notion of bisimulation equivalence in the setting of
InqML. We compare the expressiveness of InqML and first-order logic in the
context of relational structures with two sorts, one for worlds and one for
information states. We characterise inquisitive modal logic, as well as its
multi-agent epistemic S5-like variant, as the bisimulation invariant fragment
of first-order logic over various natural classes of two-sorted structures.
These results crucially require non-classical methods in studying bisimulation
and first-order expressiveness over non-elementary classes of structures,
irrespective of whether we aim for characterisations in the sense of classical
or of finite model theory.
| math.LO cs.LO | inquisitive modal logic inqml is a generalisation of standard kripkestyle modal logic in its epistemic incarnation it extends standard epistemic logic to capture not just the information that agents have but also the questions that they are interested in technically inqml fits within the family of logics based on team semantics from a modeltheoretic perspective it takes us a step in the direction of monadic secondorder logic as inquisitive modal operators involve quantification over sets of worlds we introduce and investigate the natural notion of bisimulation equivalence in the setting of inqml we compare the expressiveness of inqml and firstorder logic in the context of relational structures with two sorts one for worlds and one for information states we characterise inquisitive modal logic as well as its multiagent epistemic s5like variant as the bisimulation invariant fragment of firstorder logic over various natural classes of twosorted structures these results crucially require nonclassical methods in studying bisimulation and firstorder expressiveness over nonelementary classes of structures irrespective of whether we aim for characterisations in the sense of classical or of finite model theory | [['inquisitive', 'modal', 'logic', 'inqml', 'is', 'a', 'generalisation', 'of', 'standard', 'kripkestyle', 'modal', 'logic', 'in', 'its', 'epistemic', 'incarnation', 'it', 'extends', 'standard', 'epistemic', 'logic', 'to', 'capture', 'not', 'just', 'the', 'information', 'that', 'agents', 'have', 'but', 'also', 'the', 'questions', 'that', 'they', 'are', 'interested', 'in', 'technically', 'inqml', 'fits', 'within', 'the', 'family', 'of', 'logics', 'based', 'on', 'team', 'semantics', 'from', 'a', 'modeltheoretic', 'perspective', 'it', 'takes', 'us', 'a', 'step', 'in', 'the', 'direction', 'of', 'monadic', 'secondorder', 'logic', 'as', 'inquisitive', 'modal', 'operators', 'involve', 'quantification', 'over', 'sets', 'of', 'worlds', 'we', 'introduce', 'and', 'investigate', 'the', 'natural', 'notion', 'of', 'bisimulation', 'equivalence', 'in', 'the', 'setting', 'of', 'inqml', 'we', 'compare', 'the', 'expressiveness', 'of', 'inqml', 'and', 'firstorder', 'logic', 'in', 'the', 'context', 'of', 'relational', 'structures', 'with', 'two', 'sorts', 'one', 'for', 'worlds', 'and', 'one', 'for', 'information', 'states', 'we', 'characterise', 'inquisitive', 'modal', 'logic', 'as', 'well', 'as', 'its', 'multiagent', 'epistemic', 's5like', 'variant', 'as', 'the', 'bisimulation', 'invariant', 'fragment', 'of', 'firstorder', 'logic', 'over', 'various', 'natural', 'classes', 'of', 'twosorted', 'structures', 'these', 'results', 'crucially', 'require', 'nonclassical', 'methods', 'in', 'studying', 'bisimulation', 'and', 'firstorder', 'expressiveness', 'over', 'nonelementary', 'classes', 'of', 'structures', 'irrespective', 'of', 'whether', 'we', 'aim', 'for', 'characterisations', 'in', 'the', 'sense', 'of', 'classical', 'or', 'of', 'finite', 'model', 'theory']] | [-0.06746708720144634, 0.04755058871873514, -0.09399282690085596, 0.15391004386074403, -0.15683133036611008, -0.11677599489407915, 0.05201759178636273, 0.3667443109020674, -0.3406752465844321, -0.2745607962243925, 0.047755904082084, -0.23011516885800734, -0.08897013286994926, 0.1688109484563618, -0.14198226044760945, 0.06363865214870858, 0.0022496642654126916, 0.0942367897473026, -0.05631601454900817, -0.18915956863982591, 0.3349753867850415, -0.05400191523217955, 0.23393756671231136, 0.009515979090528615, 0.10849910888134101, 0.059608423749411575, 0.0005877428979472408, 0.09097676752291245, -0.12038456469128109, 0.14505046503924032, 0.362332693576896, 0.26385830682260114, 0.30827212874522675, -0.41668611126509625, -0.133152145370789, 0.07950691352650398, 0.05455279423544371, 0.08327252681981044, 0.08397629521409955, -0.3450688906326141, 0.05025548949400639, -0.2193542887461918, -0.025575129516870198, -0.13003314515398867, 0.033497665666678514, 0.015568382023474691, -0.17200761601750286, -0.021328331448180683, 0.2509773947388277, 0.13431646135848993, -0.013092836497778166, -0.05515304842086472, 0.017056614503280037, 0.05058582222177621, -0.04252201070301443, -0.06445462043155192, 0.0987230663307469, -0.0914367221909778, -0.2413661263502, 0.3907204718916292, -0.047957737201059954, -0.18375038609751526, 0.18327842357922242, -0.11702983919010815, -0.20554039897605278, 0.05310870722643823, 0.1117665597013921, 0.15466693953179114, -0.10676581343875251, 0.15799426290664467, -0.04903831336173806, 0.20889517176875522, 0.13779716309050732, 0.1425941513393428, 0.18201199866175735, 0.21504819220421034, 0.039894176275058334, 0.15646593234314474, 0.07534936177232121, -0.20473719007392835, -0.31417440568934607, -0.1734120278988637, -0.020677335127178766, -0.06541263827052184, -0.059313985707391804, -0.2248261372022872, 0.3731119405977719, 0.19300440503590008, 0.10827854439075099, 0.1922993032344976, 0.2812531095039745, 0.08354482247608626, 0.09064000172478111, -0.017378646535694847, 0.1820149793967282, 0.19212701153946654, 0.10745224676305667, -0.13956789647010492, 0.1430564132290138, 0.10405676591199661] |
1,803.03484 | Spectral Stability of Inviscid Roll Waves | We carry out a systematic analytical and numerical study of spectral
stability of discontinuous roll wave solutions of the inviscid Saint Venant
equations, based on a periodic Evans-Lopatinski determinant analogous to the
periodic Evans function of Gardner in the (smooth) viscous case, obtaining a
complete spectral stability diagram useful in hydraulic engineering and related
applications. In particular, we obtain an explicit low-frequency stability
boundary, which, moreover, matches closely with its (numerically-determined)
counterpart in the viscous case. This is seen to be related to but not implied
by the associated formal first-order Whitham modulation equations.
| math.AP physics.flu-dyn | we carry out a systematic analytical and numerical study of spectral stability of discontinuous roll wave solutions of the inviscid saint venant equations based on a periodic evanslopatinski determinant analogous to the periodic evans function of gardner in the smooth viscous case obtaining a complete spectral stability diagram useful in hydraulic engineering and related applications in particular we obtain an explicit lowfrequency stability boundary which moreover matches closely with its numericallydetermined counterpart in the viscous case this is seen to be related to but not implied by the associated formal firstorder whitham modulation equations | [['we', 'carry', 'out', 'a', 'systematic', 'analytical', 'and', 'numerical', 'study', 'of', 'spectral', 'stability', 'of', 'discontinuous', 'roll', 'wave', 'solutions', 'of', 'the', 'inviscid', 'saint', 'venant', 'equations', 'based', 'on', 'a', 'periodic', 'evanslopatinski', 'determinant', 'analogous', 'to', 'the', 'periodic', 'evans', 'function', 'of', 'gardner', 'in', 'the', 'smooth', 'viscous', 'case', 'obtaining', 'a', 'complete', 'spectral', 'stability', 'diagram', 'useful', 'in', 'hydraulic', 'engineering', 'and', 'related', 'applications', 'in', 'particular', 'we', 'obtain', 'an', 'explicit', 'lowfrequency', 'stability', 'boundary', 'which', 'moreover', 'matches', 'closely', 'with', 'its', 'numericallydetermined', 'counterpart', 'in', 'the', 'viscous', 'case', 'this', 'is', 'seen', 'to', 'be', 'related', 'to', 'but', 'not', 'implied', 'by', 'the', 'associated', 'formal', 'firstorder', 'whitham', 'modulation', 'equations']] | [-0.17598085893288015, 0.020619267474025017, -0.11462290073173516, 0.07249677529238084, -0.12522188401831094, -0.10688780730349882, 0.008170135684752016, 0.28955514047054515, -0.2587048104533585, -0.20447694900846522, 0.17409242433746175, -0.22198709623727908, -0.20187114067976514, 0.2153697770128968, -0.08376145046404614, 0.12097197108068353, 0.03603685169570869, 0.004971101098964291, -0.10821532354920461, -0.18459801899609707, 0.2870824911371274, 0.03416087194245749, 0.2384146287040885, 0.029342772709506172, 0.045217373924109565, -0.027840406468678868, -0.04157375827712077, 0.02975797823440003, -0.2191066882342741, 0.06220782068007255, 0.2577270326074413, 0.0019575874671660443, 0.21834634679059187, -0.4264749211850025, -0.23196153068334185, 0.07306982347020699, 0.1419855926125761, 0.09399894126615818, -0.021504119195054055, -0.27603968733080453, 0.06025705015867628, -0.15246939211482963, -0.2133959021709699, -0.08609855126950049, 0.037281475881094574, 0.08826471518434745, -0.24812552778510957, 0.1360838582879433, 0.08375463240607191, 0.06850143071384199, -0.1252902326492032, -0.05429297354653157, -0.04850330270992051, 0.061427010814108514, 0.06066826943268058, 0.011453777403941238, 0.025132297202744472, -0.1247205874226707, -0.049956157848599456, 0.37848383228304566, -0.0813150288917685, -0.24082553020167735, 0.18125601514913542, -0.11805966076871721, -0.09540848549134949, 0.17972965171981242, 0.1262637276592995, 0.132142566895533, -0.11832260506688266, 0.06314407075600077, -0.03368160153488173, 0.1667123951658767, 0.1326633893874704, -0.050311122600349686, 0.1698532083011683, 0.1366338855311555, 0.0826712542824367, 0.18099633070404933, -0.008157298941182735, -0.15515865514715832, -0.33720702520491536, -0.14353851822795727, -0.12718590817624523, 0.08284268224854724, -0.08970283546643983, -0.24625035261194553, 0.40834639439990206, 0.12420503050088882, 0.12752582080742364, 0.03305040946185228, 0.2418392009692647, 0.20328569251002485, -0.02233707625669257, 0.08110089409565653, 0.2622118947717051, 0.17578789051021299, 0.17193728261276758, -0.25645950799357264, 0.006441841012127297, 0.13979140868390438] |
1,803.03485 | Months-long real-time generation of a time scale based on an optical
clock | Time scales consistently provide precise time stamps and time intervals by
combining atomic frequency standards with a reliable local oscillator. Optical
frequency standards, however, have not been applied to the generation of time
scales, although they provide superb accuracy and stability these days. Here,
by steering an oscillator frequency based on the intermittent operation of a
$^{87}$Sr optical lattice clock, we realized an "optically steered" time scale
TA(Sr) that was continuously generated for half a year. The resultant time
scale was as stable as International Atomic Time (TAI) with its accuracy at the
$10^{-16}$ level. We also compared the time scale with TT(BIPM16). TT(BIPM) is
computed in deferred time each January based on a weighted average of the
evaluations of the frequency of TAI using primary and secondary frequency
standards. The variation of the time difference TA(Sr) $-$ TT(BIPM16) was 0.79
ns after 5 months, suggesting the compatibility of using optical clocks for
time scale generation. The steady signal also demonstrated the capability to
evaluate one-month mean scale intervals of TAI over all six months with
comparable uncertainties to those of primary frequency standards (PFSs).
| physics.atom-ph physics.optics quant-ph | time scales consistently provide precise time stamps and time intervals by combining atomic frequency standards with a reliable local oscillator optical frequency standards however have not been applied to the generation of time scales although they provide superb accuracy and stability these days here by steering an oscillator frequency based on the intermittent operation of a 87sr optical lattice clock we realized an optically steered time scale tasr that was continuously generated for half a year the resultant time scale was as stable as international atomic time tai with its accuracy at the 1016 level we also compared the time scale with ttbipm16 ttbipm is computed in deferred time each january based on a weighted average of the evaluations of the frequency of tai using primary and secondary frequency standards the variation of the time difference tasr ttbipm16 was 079 ns after 5 months suggesting the compatibility of using optical clocks for time scale generation the steady signal also demonstrated the capability to evaluate onemonth mean scale intervals of tai over all six months with comparable uncertainties to those of primary frequency standards pfss | [['time', 'scales', 'consistently', 'provide', 'precise', 'time', 'stamps', 'and', 'time', 'intervals', 'by', 'combining', 'atomic', 'frequency', 'standards', 'with', 'a', 'reliable', 'local', 'oscillator', 'optical', 'frequency', 'standards', 'however', 'have', 'not', 'been', 'applied', 'to', 'the', 'generation', 'of', 'time', 'scales', 'although', 'they', 'provide', 'superb', 'accuracy', 'and', 'stability', 'these', 'days', 'here', 'by', 'steering', 'an', 'oscillator', 'frequency', 'based', 'on', 'the', 'intermittent', 'operation', 'of', 'a', '87sr', 'optical', 'lattice', 'clock', 'we', 'realized', 'an', 'optically', 'steered', 'time', 'scale', 'tasr', 'that', 'was', 'continuously', 'generated', 'for', 'half', 'a', 'year', 'the', 'resultant', 'time', 'scale', 'was', 'as', 'stable', 'as', 'international', 'atomic', 'time', 'tai', 'with', 'its', 'accuracy', 'at', 'the', '1016', 'level', 'we', 'also', 'compared', 'the', 'time', 'scale', 'with', 'ttbipm16', 'ttbipm', 'is', 'computed', 'in', 'deferred', 'time', 'each', 'january', 'based', 'on', 'a', 'weighted', 'average', 'of', 'the', 'evaluations', 'of', 'the', 'frequency', 'of', 'tai', 'using', 'primary', 'and', 'secondary', 'frequency', 'standards', 'the', 'variation', 'of', 'the', 'time', 'difference', 'tasr', 'ttbipm16', 'was', '079', 'ns', 'after', '5', 'months', 'suggesting', 'the', 'compatibility', 'of', 'using', 'optical', 'clocks', 'for', 'time', 'scale', 'generation', 'the', 'steady', 'signal', 'also', 'demonstrated', 'the', 'capability', 'to', 'evaluate', 'onemonth', 'mean', 'scale', 'intervals', 'of', 'tai', 'over', 'all', 'six', 'months', 'with', 'comparable', 'uncertainties', 'to', 'those', 'of', 'primary', 'frequency', 'standards', 'pfss']] | [-0.12204988345025139, 0.1707202679773223, -0.0509316659943518, 0.012095909732830966, 0.007125156944586411, -0.11133251911388221, 0.09759945402769944, 0.43250005829600646, -0.24165823083246055, -0.3379914462150142, 0.16698927364335525, -0.20707126427962128, -0.02910850713694177, 0.2545050395088135, -0.025367234722976494, 0.08571142248006787, 0.05930423381603089, 0.04233447426712848, -0.05829343350809692, -0.24894719834793255, 0.21323912053328298, 0.1557435330586227, 0.30665611074430943, 0.0022808967318188127, 0.12887545692208927, -0.04690513908134659, -0.06360445075340611, -0.022039973440820055, -0.07031840834053339, 0.0723258708421578, 0.22263249063551524, 0.06861579646200316, 0.2828181337242603, -0.4270341524739838, -0.20261495434887208, 0.07939627453718626, 0.09567405820132217, 0.06791276399920274, 0.018483898602426052, -0.28652037017297144, 0.03202861810973572, -0.16639914546245138, -0.10741375917933008, -0.018844088363882634, 0.08624470346300296, 0.061881752470742346, -0.22348726059859048, 0.11565987868254027, -0.028907969848944823, 0.13096518772159957, -0.09575575082393768, -0.07665249660309384, 0.007039354536578309, 0.15733373366483597, -0.004680523244331086, 0.05444241808964767, 0.12184406404823127, -0.012976439821547841, -0.16355644531194224, 0.39672816097059976, -0.1386370847376282, -0.0754199579121368, 0.16726987152919692, -0.15778087108661343, -0.07291818785808939, 0.13205170267204333, 0.15664524960009038, 0.06746767453495517, -0.12242792435536713, 0.012808475444709892, 0.047506275919770725, 0.3014827456973056, 0.12924226310218595, 0.07901675049631789, 0.19340093616999726, 0.204079854385355, 0.06227794422393446, 0.04643027138422821, -0.16713672613870748, -0.05525929577890575, -0.2544349248510624, -0.08600829498759112, -0.17376865912814152, 0.024783200276160336, -0.06466464497717735, -0.09944714679429567, 0.45830128357001687, 0.13747257022603349, 0.17883678867843253, 0.09104622415053612, 0.3210381780511715, 0.14163935784245296, 0.0973472541455679, 0.040653968597996415, 0.27273687133669605, 0.04745658280785773, 0.15452375878155877, -0.22246387731752165, 0.04047993154852916, 0.048300071036724075] |
1,803.03486 | Non-local coupling between antiferromagnets and ferromagnets in cavities | Microwaves couple to magnetic moments in both ferromagnets and
antiferromagnets. Although the magnons in ferromagnets and antiferromagnets
radically differ, they can become entangled via strong coupling to the same
microwave mode in a cavity. The equilibrium configuration of the magnetic
moments crucially governs the coupling between the different magnons because
the antiferromagnetic and ferromagnetic magnons have the opposite spins when
their dispersion relations cross. We derive analytical expressions for the
coupling strengths and find that the coupling between antiferromagnets and
ferromagnets is comparable to the coupling between two ferromagnets. Our
findings reveal a robust link between cavity spintronics with ferromagnets and
antiferromagnets.
| cond-mat.mes-hall | microwaves couple to magnetic moments in both ferromagnets and antiferromagnets although the magnons in ferromagnets and antiferromagnets radically differ they can become entangled via strong coupling to the same microwave mode in a cavity the equilibrium configuration of the magnetic moments crucially governs the coupling between the different magnons because the antiferromagnetic and ferromagnetic magnons have the opposite spins when their dispersion relations cross we derive analytical expressions for the coupling strengths and find that the coupling between antiferromagnets and ferromagnets is comparable to the coupling between two ferromagnets our findings reveal a robust link between cavity spintronics with ferromagnets and antiferromagnets | [['microwaves', 'couple', 'to', 'magnetic', 'moments', 'in', 'both', 'ferromagnets', 'and', 'antiferromagnets', 'although', 'the', 'magnons', 'in', 'ferromagnets', 'and', 'antiferromagnets', 'radically', 'differ', 'they', 'can', 'become', 'entangled', 'via', 'strong', 'coupling', 'to', 'the', 'same', 'microwave', 'mode', 'in', 'a', 'cavity', 'the', 'equilibrium', 'configuration', 'of', 'the', 'magnetic', 'moments', 'crucially', 'governs', 'the', 'coupling', 'between', 'the', 'different', 'magnons', 'because', 'the', 'antiferromagnetic', 'and', 'ferromagnetic', 'magnons', 'have', 'the', 'opposite', 'spins', 'when', 'their', 'dispersion', 'relations', 'cross', 'we', 'derive', 'analytical', 'expressions', 'for', 'the', 'coupling', 'strengths', 'and', 'find', 'that', 'the', 'coupling', 'between', 'antiferromagnets', 'and', 'ferromagnets', 'is', 'comparable', 'to', 'the', 'coupling', 'between', 'two', 'ferromagnets', 'our', 'findings', 'reveal', 'a', 'robust', 'link', 'between', 'cavity', 'spintronics', 'with', 'ferromagnets', 'and', 'antiferromagnets']] | [-0.2283841113413812, 0.24089703273356838, -0.0003095283264330789, 0.06282360688212565, -0.08406491114703171, -0.17437981347571693, 0.03169491054837172, 0.42751188598134937, -0.23363140523296727, -0.28489790773749646, -0.033675257804776156, -0.34804019467065145, -0.07653673457931362, 0.21650951000286595, 0.14793515778785826, -0.06369699101310734, -0.05644937551251667, -0.046925462926190126, -0.06452905408143267, -0.1494817264339123, 0.2363611099938805, -0.07743596900071875, 0.38262461428987043, 0.10113877676171708, 0.06625821199450715, -0.021255374180755633, 0.19480590263892913, -0.013558476031118748, -0.1210930316242322, 0.07347368595519048, 0.24222810464162453, -0.15877212651585246, 0.14753967221808054, -0.5248507197909787, -0.1306356510750073, 0.0526872511231797, 0.19344474431857758, 0.20849428247368218, -0.01385206161249502, -0.3069985322289023, -0.03709109202849076, -0.1484338405277288, -0.06293435526301847, -0.13862531426974445, -0.018055711251993973, 0.03207751132568399, -0.28032089228394863, 0.06876919135638494, 0.135390663866465, 0.10595140792429447, -0.05871513985809596, -0.09744819857216641, -0.10433994075876898, 0.10271101987689012, 0.1362323585838335, 0.02441147550958775, 0.10275183907052611, -0.14861718947455907, -0.15568175108409396, 0.3277021712422663, -0.05846700333880589, -0.14778284392520494, 0.2004422598755827, -0.20893933364719736, -0.042647848245870396, 0.05270971537467238, 0.12474098684398603, 0.067858593396879, -0.12099980804729664, 0.07350448178533721, 0.05595660125654118, 0.15190640318335272, 0.015191462776320074, 0.1366807401280704, 0.32975645632683936, 0.09582552972121858, 0.0031166318096403104, 0.1615337122724775, -0.08577229177542761, -0.125874899149708, -0.19182287819464416, -0.14155950184053212, -0.2762035443730009, 0.03302050253613761, -0.15260578600111116, -0.16229226009226314, 0.3552509876762462, 0.23826476684588865, 0.1306913761586389, -0.029478227016607336, 0.27432634420327695, 0.10440096454169857, 0.06174700675011777, 0.06255651857959581, 0.4003714869419734, 0.2648731987539898, 0.12709559368280074, -0.3149895420224935, 0.04399386073882673, -0.004057503026891865] |
1,803.03487 | Cooperative Starting Movement Detection of Cyclists Using Convolutional
Neural Networks and a Boosted Stacking Ensemble | In future, vehicles and other traffic participants will be interconnected and
equipped with various types of sensors, allowing for cooperation on different
levels, such as situation prediction or intention detection. In this article we
present a cooperative approach for starting movement detection of cyclists
using a boosted stacking ensemble approach realizing feature- and decision
level cooperation. We introduce a novel method based on a 3D Convolutional
Neural Network (CNN) to detect starting motions on image sequences by learning
spatio-temporal features. The CNN is complemented by a smart device based
starting movement detection originating from smart devices carried by the
cyclist. Both model outputs are combined in a stacking ensemble approach using
an extreme gradient boosting classifier resulting in a fast and yet robust
cooperative starting movement detector. We evaluate our cooperative approach on
real-world data originating from experiments with 49 test subjects consisting
of 84 starting motions.
| cs.CV cs.AI | in future vehicles and other traffic participants will be interconnected and equipped with various types of sensors allowing for cooperation on different levels such as situation prediction or intention detection in this article we present a cooperative approach for starting movement detection of cyclists using a boosted stacking ensemble approach realizing feature and decision level cooperation we introduce a novel method based on a 3d convolutional neural network cnn to detect starting motions on image sequences by learning spatiotemporal features the cnn is complemented by a smart device based starting movement detection originating from smart devices carried by the cyclist both model outputs are combined in a stacking ensemble approach using an extreme gradient boosting classifier resulting in a fast and yet robust cooperative starting movement detector we evaluate our cooperative approach on realworld data originating from experiments with 49 test subjects consisting of 84 starting motions | [['in', 'future', 'vehicles', 'and', 'other', 'traffic', 'participants', 'will', 'be', 'interconnected', 'and', 'equipped', 'with', 'various', 'types', 'of', 'sensors', 'allowing', 'for', 'cooperation', 'on', 'different', 'levels', 'such', 'as', 'situation', 'prediction', 'or', 'intention', 'detection', 'in', 'this', 'article', 'we', 'present', 'a', 'cooperative', 'approach', 'for', 'starting', 'movement', 'detection', 'of', 'cyclists', 'using', 'a', 'boosted', 'stacking', 'ensemble', 'approach', 'realizing', 'feature', 'and', 'decision', 'level', 'cooperation', 'we', 'introduce', 'a', 'novel', 'method', 'based', 'on', 'a', '3d', 'convolutional', 'neural', 'network', 'cnn', 'to', 'detect', 'starting', 'motions', 'on', 'image', 'sequences', 'by', 'learning', 'spatiotemporal', 'features', 'the', 'cnn', 'is', 'complemented', 'by', 'a', 'smart', 'device', 'based', 'starting', 'movement', 'detection', 'originating', 'from', 'smart', 'devices', 'carried', 'by', 'the', 'cyclist', 'both', 'model', 'outputs', 'are', 'combined', 'in', 'a', 'stacking', 'ensemble', 'approach', 'using', 'an', 'extreme', 'gradient', 'boosting', 'classifier', 'resulting', 'in', 'a', 'fast', 'and', 'yet', 'robust', 'cooperative', 'starting', 'movement', 'detector', 'we', 'evaluate', 'our', 'cooperative', 'approach', 'on', 'realworld', 'data', 'originating', 'from', 'experiments', 'with', '49', 'test', 'subjects', 'consisting', 'of', '84', 'starting', 'motions']] | [-0.0963089603055221, 0.0529706942046823, -0.06951141879786135, -0.006809282705796008, -0.06602935521502276, -0.20465426636720394, 0.08454689270892769, 0.449705829907234, -0.2425551914901403, -0.3345695949907155, 0.06948185254040422, -0.30040201836195934, -0.19567731138774935, 0.1778092937520032, -0.10597564421632157, 0.050968743220833286, 0.1391674412262379, 0.02593895111812697, 8.729401877669452e-05, -0.1843155235048941, 0.29196228969487403, 0.07183783894506138, 0.36854564911071336, -0.041057266583222715, 0.1482854693103265, 0.011775287376640707, -0.0667071614864276, 0.037982024370413904, -0.021366586937009973, 0.17196808641041522, 0.30745426103865514, 0.1524204308876679, 0.30047024752577245, -0.45520976228880233, -0.23509067368414888, 0.045785100877183633, 0.1191821313307931, 0.11131233358470609, -0.06584466385598085, -0.4038900565799503, 0.08451525632689587, -0.2098957232205945, -0.043672644678835096, -0.09789772934223316, -0.05939286288355484, 0.011650865856355348, -0.28172974278326746, 0.013789363308385217, 0.001276607972056586, 0.12591634984413275, -0.07419573919988968, -0.08134759705336321, 0.027467642689826995, 0.15738831202461556, -0.02229253479935305, 0.009964788514133986, 0.1955667331626284, -0.1531660738776792, -0.19352729523516432, 0.366840162751626, -0.04716487240274342, -0.18280752792599655, 0.2210581824009237, 0.0024895267656110985, -0.15453936477971017, 0.10582547319330732, 0.2862510396116952, 0.12196788191795349, -0.18943546045901014, -0.057645591215046796, -0.004031191098497433, 0.14626007584766262, 0.04511142080193575, -0.03519041670270923, 0.22497060231557178, 0.290311876996452, 0.07291185841293765, 0.11928557278232041, -0.19855365597446556, -0.08788271025013254, -0.23060149912323272, -0.06766172884298223, -0.1796094316792782, 0.03396653386702457, -0.07203656145439603, -0.1155202384011782, 0.39048745787898903, 0.21819571656377695, 0.19371589328175043, 0.08074387826570341, 0.3327912358427737, 0.01819174779503017, 0.07949674698812444, 0.05065723560864524, 0.17846578642485195, -0.003294787048140452, 0.12759231529863818, -0.14718496029662778, 0.05786484875874657, 0.05607409358696163] |
1,803.03488 | Nonlinear Bilateral Output-Feedback Control for a Class of Viscous
Hamilton-Jacobi PDEs | We tackle the boundary control and estimation problems for a class of viscous
Hamilton-Jacobi PDEs, considering bilateral actuation and sensing, i.e., at the
two boundaries of a 1-D spatial domain. First, we solve the nonlinear
trajectory generation problem for this type of PDEs, providing the necessary
feedforward actions at both boundaries. Second, in order to guarantee
trajectory tracking with an arbitrary decay rate, we construct nonlinear,
full-state feedback laws employed at the two boundary ends. Third, a nonlinear
observer is constructed, using measurements from both boundaries, which is
combined with the full-state feedback designs into an observer-based
output-feedback law. All of our designs are explicit since they are constructed
interlacing a feedback linearizing transformation (which we introduce) with
backstepping. Due to the fact that the linearizing transformation is locally
invertible, only regional stability results are established, which are,
nevertheless, accompanied with region of attraction estimates. Our stability
proofs are based on the utilization of the linearizing transformation together
with the employment of backstepping transformations, suitably formulated to
handle the case of bilateral actuation and sensing. We illustrate the developed
methodologies via application to traffic flow control and we present consistent
simulation results.
| math.OC | we tackle the boundary control and estimation problems for a class of viscous hamiltonjacobi pdes considering bilateral actuation and sensing ie at the two boundaries of a 1d spatial domain first we solve the nonlinear trajectory generation problem for this type of pdes providing the necessary feedforward actions at both boundaries second in order to guarantee trajectory tracking with an arbitrary decay rate we construct nonlinear fullstate feedback laws employed at the two boundary ends third a nonlinear observer is constructed using measurements from both boundaries which is combined with the fullstate feedback designs into an observerbased outputfeedback law all of our designs are explicit since they are constructed interlacing a feedback linearizing transformation which we introduce with backstepping due to the fact that the linearizing transformation is locally invertible only regional stability results are established which are nevertheless accompanied with region of attraction estimates our stability proofs are based on the utilization of the linearizing transformation together with the employment of backstepping transformations suitably formulated to handle the case of bilateral actuation and sensing we illustrate the developed methodologies via application to traffic flow control and we present consistent simulation results | [['we', 'tackle', 'the', 'boundary', 'control', 'and', 'estimation', 'problems', 'for', 'a', 'class', 'of', 'viscous', 'hamiltonjacobi', 'pdes', 'considering', 'bilateral', 'actuation', 'and', 'sensing', 'ie', 'at', 'the', 'two', 'boundaries', 'of', 'a', '1d', 'spatial', 'domain', 'first', 'we', 'solve', 'the', 'nonlinear', 'trajectory', 'generation', 'problem', 'for', 'this', 'type', 'of', 'pdes', 'providing', 'the', 'necessary', 'feedforward', 'actions', 'at', 'both', 'boundaries', 'second', 'in', 'order', 'to', 'guarantee', 'trajectory', 'tracking', 'with', 'an', 'arbitrary', 'decay', 'rate', 'we', 'construct', 'nonlinear', 'fullstate', 'feedback', 'laws', 'employed', 'at', 'the', 'two', 'boundary', 'ends', 'third', 'a', 'nonlinear', 'observer', 'is', 'constructed', 'using', 'measurements', 'from', 'both', 'boundaries', 'which', 'is', 'combined', 'with', 'the', 'fullstate', 'feedback', 'designs', 'into', 'an', 'observerbased', 'outputfeedback', 'law', 'all', 'of', 'our', 'designs', 'are', 'explicit', 'since', 'they', 'are', 'constructed', 'interlacing', 'a', 'feedback', 'linearizing', 'transformation', 'which', 'we', 'introduce', 'with', 'backstepping', 'due', 'to', 'the', 'fact', 'that', 'the', 'linearizing', 'transformation', 'is', 'locally', 'invertible', 'only', 'regional', 'stability', 'results', 'are', 'established', 'which', 'are', 'nevertheless', 'accompanied', 'with', 'region', 'of', 'attraction', 'estimates', 'our', 'stability', 'proofs', 'are', 'based', 'on', 'the', 'utilization', 'of', 'the', 'linearizing', 'transformation', 'together', 'with', 'the', 'employment', 'of', 'backstepping', 'transformations', 'suitably', 'formulated', 'to', 'handle', 'the', 'case', 'of', 'bilateral', 'actuation', 'and', 'sensing', 'we', 'illustrate', 'the', 'developed', 'methodologies', 'via', 'application', 'to', 'traffic', 'flow', 'control', 'and', 'we', 'present', 'consistent', 'simulation', 'results']] | [-0.130971627866226, 0.06230302095127627, -0.07132069060996098, 0.00718865367222558, -0.11103405049288995, -0.18181586213449918, 0.003942496760525198, 0.3756304091754525, -0.3052104498250022, -0.2683737505431054, 0.19217879637229393, -0.23912848180771107, -0.1660064139869064, 0.20462896116562965, -0.10567444383999221, 0.11127152515806908, 0.04994426904886495, -0.004357376705835729, -0.07806393347148817, -0.21174771076160445, 0.330863093714773, 0.014078240002466677, 0.2750652455870295, -0.020577848660953652, 0.16109981020053965, -0.000780333518681194, -0.04445022559715047, 0.025688071122507, -0.12194965341484476, 0.1286100964553043, 0.25279171149425866, 0.07439335947068078, 0.29600217847231153, -0.43113343122725684, -0.21510999726888258, 0.07586269124711482, 0.11941942425679979, 0.12050756837258329, -0.09087449198947677, -0.30986800332539133, 0.07384692238701973, -0.12812479395021606, -0.12298985605229973, -0.07297818523723738, -0.059889809461310506, 0.034662001719643364, -0.3420646486289722, 0.06620114747922419, 0.05693207886967381, 0.032298208784292605, -0.136052875805035, -0.02353777741761102, -0.01783954689987392, 0.1452067532785198, -0.0006671389431479232, -0.0425511716833474, 0.12557528042543709, -0.08961899229567886, -0.12224352428408262, 0.34348248938234366, 0.004252480098633289, -0.2692782891875443, 0.20186410383757902, -0.08929801319512383, -0.10370838762901258, 0.11935642707248917, 0.1904297049914021, 0.10711499035418608, -0.17768933633730435, 0.04140380894750706, 0.024230135288235033, 0.16962194264730593, 0.07356559530793068, -0.015048273360889652, 0.12929719665044104, 0.1616458395171018, 0.1370739454893434, 0.16067752224383489, -0.023964770506988014, -0.14607887925133886, -0.34301091165010195, -0.08720989267991779, -0.13568941742353977, -0.012664357651374303, -0.08734230601567106, -0.1475857580274654, 0.3781800851065782, 0.1230000469161799, 0.15813306725370543, 0.10934741748921321, 0.30447869290946983, 0.16670248048164163, 0.046032963039579045, 0.09446318767974542, 0.24971596835530363, 0.12793461893791877, 0.11863744565440963, -0.25037491657546224, 0.0337766440291792, 0.1359955306240105] |
1,803.03489 | Green LTE Broadcasting | LTE broadcast is a communication standard which is expected to revolutionize
the multimedia service provision in the future. The distinctive features of
this standard such as increased service capacity, high spectral efficiency, and
spectral adjustability have encouraged many companies to select this standard
for the future generation broadcasting. In this paper, after a complete
introduction of this standard and its unique features, its application in the
Heterogeneous Networks (HetNets) is investigated. In this study, application of
the LTE broadcast standard under a new scenario called Super cell is examined.
Based on the results, the suggested scenario can be considered as one of the
best LTE broadcast scenarios. The main aim of this scenario is to decrease the
total energy consumption. Therefore, the study has demonstrated that this
scenario can reduce the total energy consumption and offers a green servicing
by taking advantage of the small cells capability and the D2D communication
technology.
| cs.NI | lte broadcast is a communication standard which is expected to revolutionize the multimedia service provision in the future the distinctive features of this standard such as increased service capacity high spectral efficiency and spectral adjustability have encouraged many companies to select this standard for the future generation broadcasting in this paper after a complete introduction of this standard and its unique features its application in the heterogeneous networks hetnets is investigated in this study application of the lte broadcast standard under a new scenario called super cell is examined based on the results the suggested scenario can be considered as one of the best lte broadcast scenarios the main aim of this scenario is to decrease the total energy consumption therefore the study has demonstrated that this scenario can reduce the total energy consumption and offers a green servicing by taking advantage of the small cells capability and the d2d communication technology | [['lte', 'broadcast', 'is', 'a', 'communication', 'standard', 'which', 'is', 'expected', 'to', 'revolutionize', 'the', 'multimedia', 'service', 'provision', 'in', 'the', 'future', 'the', 'distinctive', 'features', 'of', 'this', 'standard', 'such', 'as', 'increased', 'service', 'capacity', 'high', 'spectral', 'efficiency', 'and', 'spectral', 'adjustability', 'have', 'encouraged', 'many', 'companies', 'to', 'select', 'this', 'standard', 'for', 'the', 'future', 'generation', 'broadcasting', 'in', 'this', 'paper', 'after', 'a', 'complete', 'introduction', 'of', 'this', 'standard', 'and', 'its', 'unique', 'features', 'its', 'application', 'in', 'the', 'heterogeneous', 'networks', 'hetnets', 'is', 'investigated', 'in', 'this', 'study', 'application', 'of', 'the', 'lte', 'broadcast', 'standard', 'under', 'a', 'new', 'scenario', 'called', 'super', 'cell', 'is', 'examined', 'based', 'on', 'the', 'results', 'the', 'suggested', 'scenario', 'can', 'be', 'considered', 'as', 'one', 'of', 'the', 'best', 'lte', 'broadcast', 'scenarios', 'the', 'main', 'aim', 'of', 'this', 'scenario', 'is', 'to', 'decrease', 'the', 'total', 'energy', 'consumption', 'therefore', 'the', 'study', 'has', 'demonstrated', 'that', 'this', 'scenario', 'can', 'reduce', 'the', 'total', 'energy', 'consumption', 'and', 'offers', 'a', 'green', 'servicing', 'by', 'taking', 'advantage', 'of', 'the', 'small', 'cells', 'capability', 'and', 'the', 'd2d', 'communication', 'technology']] | [-0.17695667243587146, 0.023824260302047293, -0.020187972266668158, 0.05830085255959267, -0.04201993900565676, -0.14104698889423162, 0.10656484743001209, 0.34269579100471576, -0.26325385542096275, -0.2965622816149047, 0.1215449113296927, -0.23535352588729247, -0.14271106113722598, 0.1590880429047454, -0.12539750282762965, 0.02240993773279785, 0.05815221691553138, 0.04754108929467436, 0.000660921344349749, -0.2658547108478256, 0.2627774109837207, 0.1415637974124892, 0.3579393079118362, 0.08321156476602865, 0.02227073839228404, -0.031232300330884755, -0.0451192693512176, -0.03568818785348221, -0.08024837665312876, 0.15111653095013217, 0.26638228179868556, 0.1884305402789706, 0.3080943815140544, -0.4209688705955877, -0.29929797748857373, 0.13032120125564306, 0.1491991952934768, 0.03506570600362274, -0.06274032246361266, -0.2470385008093313, 0.13364387759372076, -0.26000010690002356, -0.10329348700255842, 0.0011599802375329954, -0.02673300491082237, 0.03420732427222997, -0.28729659708379157, -0.010663552506900343, -0.0057902269457515915, 0.015189767289771944, -0.04042606023664887, -0.08284517514402978, 0.0011808428619253008, 0.17523939750696482, 0.025857475137423824, -0.009149349700524717, 0.10987943762531933, -0.13097892106222725, -0.12076465303911582, 0.4372255459525867, -0.07387517402438741, -0.12313093054629128, 0.18871764955264025, -0.062461103530184026, -0.12317205883185747, 0.103761436374809, 0.20307577753096426, 0.06113082651312365, -0.2172111841715186, 0.06804813166902597, -0.0010512023735301274, 0.13893016067174213, 0.04618896217404032, 0.10473463124607836, 0.19677113547100147, 0.2695019067461161, 0.1043756198805089, 0.13270581680300989, -0.08839059005166698, -0.11502989845374893, -0.23602208662410512, -0.1913829348050058, -0.19862547026959396, 0.03699653480496062, -0.07429432914566285, -0.08881251407652407, 0.4198205755827458, 0.1538056948430542, 0.1370387600189516, 0.05314415649857102, 0.38708400576816576, 0.1028216822167834, 0.11914954518119646, 0.07396683522567496, 0.22307536429664315, 0.04938496232467802, 0.2068994996585197, -0.19610496845837733, 0.06767226052838132, -0.04314405399092816] |
1,803.0349 | Computing Transition Rates for Rare Event: When Kramers Theory meets
Free Energy Landscape | Computing reactive trajectories and free energy (FE) landscapes associated to
rare event kinetics is key to understanding the dynamics of complex systems.
The analysis of the FE surface on which the underlying dynamics takes place has
become central to compute transition rates. In the overdamped limit, most often
encountered in biophysics and soft condensed matter, the Kramers' Theory (KT)
has proved to be quite successful in recovering correct kinetics. However, the
additional calculation to obtain rate constants in complex systems where
configurational entropy is competing with energy is still challenging
conceptually and computationally. Building on KT and the metadynamics
framework, the rate is expressed in terms of the height of the FE barrier
measured along the minimum FE path and an auxiliary measure of the
configurational entropy. We apply the formalism to two different problems where
our approach shows good agreement with simulations and experiments and can
present significant improvement over the standard KT.
| cond-mat.stat-mech cond-mat.soft physics.bio-ph physics.comp-ph | computing reactive trajectories and free energy fe landscapes associated to rare event kinetics is key to understanding the dynamics of complex systems the analysis of the fe surface on which the underlying dynamics takes place has become central to compute transition rates in the overdamped limit most often encountered in biophysics and soft condensed matter the kramers theory kt has proved to be quite successful in recovering correct kinetics however the additional calculation to obtain rate constants in complex systems where configurational entropy is competing with energy is still challenging conceptually and computationally building on kt and the metadynamics framework the rate is expressed in terms of the height of the fe barrier measured along the minimum fe path and an auxiliary measure of the configurational entropy we apply the formalism to two different problems where our approach shows good agreement with simulations and experiments and can present significant improvement over the standard kt | [['computing', 'reactive', 'trajectories', 'and', 'free', 'energy', 'fe', 'landscapes', 'associated', 'to', 'rare', 'event', 'kinetics', 'is', 'key', 'to', 'understanding', 'the', 'dynamics', 'of', 'complex', 'systems', 'the', 'analysis', 'of', 'the', 'fe', 'surface', 'on', 'which', 'the', 'underlying', 'dynamics', 'takes', 'place', 'has', 'become', 'central', 'to', 'compute', 'transition', 'rates', 'in', 'the', 'overdamped', 'limit', 'most', 'often', 'encountered', 'in', 'biophysics', 'and', 'soft', 'condensed', 'matter', 'the', 'kramers', 'theory', 'kt', 'has', 'proved', 'to', 'be', 'quite', 'successful', 'in', 'recovering', 'correct', 'kinetics', 'however', 'the', 'additional', 'calculation', 'to', 'obtain', 'rate', 'constants', 'in', 'complex', 'systems', 'where', 'configurational', 'entropy', 'is', 'competing', 'with', 'energy', 'is', 'still', 'challenging', 'conceptually', 'and', 'computationally', 'building', 'on', 'kt', 'and', 'the', 'metadynamics', 'framework', 'the', 'rate', 'is', 'expressed', 'in', 'terms', 'of', 'the', 'height', 'of', 'the', 'fe', 'barrier', 'measured', 'along', 'the', 'minimum', 'fe', 'path', 'and', 'an', 'auxiliary', 'measure', 'of', 'the', 'configurational', 'entropy', 'we', 'apply', 'the', 'formalism', 'to', 'two', 'different', 'problems', 'where', 'our', 'approach', 'shows', 'good', 'agreement', 'with', 'simulations', 'and', 'experiments', 'and', 'can', 'present', 'significant', 'improvement', 'over', 'the', 'standard', 'kt']] | [-0.08532407936373991, 0.1065469029928934, -0.0743726416182547, 0.08617484474905415, -0.008966349784962156, -0.1415107175344964, 0.022178531386254526, 0.353291655000142, -0.2742358894584785, -0.3186177300900076, 0.03574122505356231, -0.2723773397998915, -0.10635075030558101, 0.2093021434296358, -0.0329642667791915, 0.04021601620592878, 0.047379091082672985, 0.042322367949822505, -0.058310227720339045, -0.20331435102981504, 0.23381760938383347, 0.09134862042794173, 0.2857329821419696, 0.09544627785731058, 0.09706616452774154, 0.0008946667219717782, -0.00022849862693579166, 0.018627972063886656, -0.15116527386224382, 0.1256708548356652, 0.27462960882475235, 0.06810827887096962, 0.22738259025643787, -0.4378765707279181, -0.2526560989510897, 0.11089046157793711, 0.13536284235003707, 0.10367907014771444, -0.02673011631916531, -0.20545621001457964, 0.06876541333584502, -0.12651839679070784, -0.10150905165673149, -0.1009511192716271, 0.019259021593281973, 0.0006433543711356431, -0.22949154451247547, 0.11074904915906925, 0.038189027467500664, 0.045903638356014506, -0.06847787539583522, -0.11181087599607645, -0.025500265193510462, 0.0995025721812536, 0.07838538136067134, 0.03944945563683165, 0.16439204318932704, -0.12377285984285817, -0.09741110950345536, 0.40992068192715964, -0.04544707411498001, -0.14542294211244186, 0.24771930726075714, -0.1280395106847894, -0.13045950824781866, 0.19365352897167012, 0.13325708158550081, 0.12986229987839212, -0.15643261936674643, 0.10178421700846513, 0.033806639732551075, 0.1805758606007492, 0.014506002175984542, 0.00940326864973078, 0.1863122683775996, 0.1764975793700508, 0.03179794404952025, 0.10665922457588135, -0.07913102271895578, -0.21841344634046803, -0.25990419091608424, -0.18710134018425828, -0.18298853472231996, 0.03216263154966079, -0.0931631528445279, -0.17366467698707017, 0.3554810580507211, 0.14585968217352865, 0.21340276812378609, 0.00787605040830669, 0.28436026241110224, 0.14575546100968495, 0.019437233549270586, 0.041650916349941065, 0.2153080778813304, 0.13980664298023013, 0.10057970572961494, -0.24628457034841278, 0.10074675694416434, 0.07467426851319221] |
1,803.03491 | Valuing knowledge, information and agency in Multi-agent Reinforcement
Learning: a case study in smart buildings | Increasing energy efficiency in buildings can reduce costs and emissions
substantially. Historically, this has been treated as a local, or single-agent,
optimization problem. However, many buildings utilize the same types of thermal
equipment e.g. electric heaters and hot water vessels. During operation,
occupants in these buildings interact with the equipment differently thereby
driving them to diverse regions in the state-space. Reinforcement learning
agents can learn from these interactions, recorded as sensor data, to optimize
the overall energy efficiency. However, if these agents operate individually at
a household level, they can not exploit the replicated structure in the
problem. In this paper, we demonstrate that this problem can indeed benefit
from multi-agent collaboration by making use of targeted exploration of the
state-space allowing for better generalization. We also investigate trade-offs
between integrating human knowledge and additional sensors. Results show that
savings of over 40% are possible with collaborative multi-agent systems making
use of either expert knowledge or additional sensors with no loss of occupant
comfort. We find that such multi-agent systems comfortably outperform
comparable single agent systems.
| cs.MA cs.AI stat.AP stat.ML | increasing energy efficiency in buildings can reduce costs and emissions substantially historically this has been treated as a local or singleagent optimization problem however many buildings utilize the same types of thermal equipment eg electric heaters and hot water vessels during operation occupants in these buildings interact with the equipment differently thereby driving them to diverse regions in the statespace reinforcement learning agents can learn from these interactions recorded as sensor data to optimize the overall energy efficiency however if these agents operate individually at a household level they can not exploit the replicated structure in the problem in this paper we demonstrate that this problem can indeed benefit from multiagent collaboration by making use of targeted exploration of the statespace allowing for better generalization we also investigate tradeoffs between integrating human knowledge and additional sensors results show that savings of over 40 are possible with collaborative multiagent systems making use of either expert knowledge or additional sensors with no loss of occupant comfort we find that such multiagent systems comfortably outperform comparable single agent systems | [['increasing', 'energy', 'efficiency', 'in', 'buildings', 'can', 'reduce', 'costs', 'and', 'emissions', 'substantially', 'historically', 'this', 'has', 'been', 'treated', 'as', 'a', 'local', 'or', 'singleagent', 'optimization', 'problem', 'however', 'many', 'buildings', 'utilize', 'the', 'same', 'types', 'of', 'thermal', 'equipment', 'eg', 'electric', 'heaters', 'and', 'hot', 'water', 'vessels', 'during', 'operation', 'occupants', 'in', 'these', 'buildings', 'interact', 'with', 'the', 'equipment', 'differently', 'thereby', 'driving', 'them', 'to', 'diverse', 'regions', 'in', 'the', 'statespace', 'reinforcement', 'learning', 'agents', 'can', 'learn', 'from', 'these', 'interactions', 'recorded', 'as', 'sensor', 'data', 'to', 'optimize', 'the', 'overall', 'energy', 'efficiency', 'however', 'if', 'these', 'agents', 'operate', 'individually', 'at', 'a', 'household', 'level', 'they', 'can', 'not', 'exploit', 'the', 'replicated', 'structure', 'in', 'the', 'problem', 'in', 'this', 'paper', 'we', 'demonstrate', 'that', 'this', 'problem', 'can', 'indeed', 'benefit', 'from', 'multiagent', 'collaboration', 'by', 'making', 'use', 'of', 'targeted', 'exploration', 'of', 'the', 'statespace', 'allowing', 'for', 'better', 'generalization', 'we', 'also', 'investigate', 'tradeoffs', 'between', 'integrating', 'human', 'knowledge', 'and', 'additional', 'sensors', 'results', 'show', 'that', 'savings', 'of', 'over', '40', 'are', 'possible', 'with', 'collaborative', 'multiagent', 'systems', 'making', 'use', 'of', 'either', 'expert', 'knowledge', 'or', 'additional', 'sensors', 'with', 'no', 'loss', 'of', 'occupant', 'comfort', 'we', 'find', 'that', 'such', 'multiagent', 'systems', 'comfortably', 'outperform', 'comparable', 'single', 'agent', 'systems']] | [-0.07963355134548196, 0.08095690741108476, -0.033304551397040166, 0.04024417170876404, -0.11890629058523866, -0.15363554902366808, 0.07870916929691289, 0.4550846742296761, -0.29599821798249404, -0.4000530938342722, 0.1046469962119855, -0.2823918958416801, -0.13244007988197898, 0.18047864332038444, -0.1498688765780323, 0.04556506130823188, 0.10087343060083433, 0.03572296813680706, -0.008756516751005123, -0.24793353699152992, 0.2663335759875322, 0.06439583813930354, 0.30228591888127004, 0.01927173836156726, 0.11514057380488586, 0.007861854326041463, -0.0027261892180170185, 0.01700200104294874, -0.03112567333428987, 0.13552562611518873, 0.37116980471182615, 0.15715574281983374, 0.3290528093255654, -0.5019229130438444, -0.2561109968267953, 0.1559622970532721, 0.1495291741411248, 0.0578797498799924, -0.0009618017925690351, -0.2713694984082725, 0.06438962314132368, -0.22999297601795246, -0.0729846774616321, -0.08310011948858366, -0.060868429789975795, 0.04932286099607485, -0.2624301139006672, -0.002902739365295433, 0.0352972858871164, 0.07702868978999917, -0.09157638434871015, -0.11128074365710332, -0.027424835599958897, 0.19089338412264956, 0.015663381454942282, -0.041475212356751646, 0.2121829830284696, -0.16985646124951678, -0.15436702197687488, 0.38285879443653603, 0.006636060769034719, -0.19441409044545502, 0.24509448162974545, -0.0672402160496197, -0.13149609824176878, 0.11167672788790449, 0.23787433120411483, 0.07516300771782301, -0.19622991440469792, 0.014258002935424553, 0.028238937523300676, 0.18511453540122602, 0.06899851887084713, 0.03646567186660832, 0.2050170998726654, 0.21251337264071812, 0.1266695597491476, 0.11312572777123106, -0.027176248937724846, -0.0975680869236054, -0.1826554729857228, -0.11163448134572139, -0.15037270775593986, 0.017442115867032208, -0.07387124151509025, -0.06708064767644828, 0.3170204809443517, 0.2067235618094194, 0.14545113580474703, 0.06831247736938001, 0.3524906888620039, 0.05047303921574811, 0.10918845732654021, 0.09940013847583694, 0.23292249232062287, -0.028468517464881934, 0.15700011130155128, -0.20266317391691369, 0.10007152918379605, -0.060778017112170346] |
1,803.03492 | Existence and uniqueness of ground states for $p$ - Choquard model in 3D | We study the $p$-Choquard equation in 3-dimensional case and establish
existence and uniqueness of ground states for the corresponding Weinstein
functional. For proving the uniqueness of ground states, we use the radial
symmetry to transform the equation into an ordinary differential system, and
applying the Pohozaev identities and Gronwall lemma we show that any two
Weinstein minimizers coincide.
| math.AP | we study the pchoquard equation in 3dimensional case and establish existence and uniqueness of ground states for the corresponding weinstein functional for proving the uniqueness of ground states we use the radial symmetry to transform the equation into an ordinary differential system and applying the pohozaev identities and gronwall lemma we show that any two weinstein minimizers coincide | [['we', 'study', 'the', 'pchoquard', 'equation', 'in', '3dimensional', 'case', 'and', 'establish', 'existence', 'and', 'uniqueness', 'of', 'ground', 'states', 'for', 'the', 'corresponding', 'weinstein', 'functional', 'for', 'proving', 'the', 'uniqueness', 'of', 'ground', 'states', 'we', 'use', 'the', 'radial', 'symmetry', 'to', 'transform', 'the', 'equation', 'into', 'an', 'ordinary', 'differential', 'system', 'and', 'applying', 'the', 'pohozaev', 'identities', 'and', 'gronwall', 'lemma', 'we', 'show', 'that', 'any', 'two', 'weinstein', 'minimizers', 'coincide']] | [-0.1594769257006415, -0.017675099085368982, -0.13619565953941723, 0.14067781677371577, -0.07929788140187922, -0.10814552906116373, 0.02459648429628527, 0.27008110358330767, -0.3144404172178423, -0.24953102585124343, 0.11659894789479215, -0.30676173485341696, -0.1314773698533444, 0.14982693058616287, -0.04238539868802355, 0.08018557524733376, 0.09514844014815856, -0.005025092500114911, -0.10570916095993628, -0.20702604286315476, 0.41727143826714735, -0.13965804221337302, 0.24869962858460976, 0.08775006665995247, 0.12615289526844495, 0.06224536110254887, 0.053201142600492426, -0.03597271650735485, -0.20730723330014275, 0.12919407936523816, 0.20474755008329162, 0.07724493689704359, 0.231085873274296, -0.4572946689369386, -0.13486755698135025, 0.13598333506665208, 0.10038265152916051, 0.11670471458254676, -0.03364779393335706, -0.3951054093828261, 0.10290213527255937, -0.08258998433226034, -0.27889315945733534, -0.15302494504864803, -0.012945509499363732, 0.06078891213901602, -0.23183099866697662, 0.12307387260360676, 0.13539948546442024, 0.0381786354833789, -0.2288531171354024, -0.07029181648364388, -0.06879027849553447, 0.09400418539645902, 0.03734199987038186, -0.02709067209721788, 0.009879423184892195, -0.10746616326076419, -0.12707095272969782, 0.2890550751369773, -0.07812810240297072, -0.25944508148128526, 0.1528576800861118, -0.10709084175004248, -0.19314119553095416, 0.07225893795686333, 0.09177174536805403, 0.14783763442711348, -0.12439188736964736, 0.1362008500084477, -0.08683943210921266, 0.10833947512468226, 0.14147846658893845, -0.006046815995911234, 0.051293947423497833, 0.06201245720710671, 0.1828953616255731, 0.16961226448939556, -0.02193174134988926, -0.08639895301638988, -0.3644936760528046, -0.25946331412220996, -0.15324783625832775, 0.12038757717400267, -0.058037665361138226, -0.13964079586756334, 0.3701305363588689, 0.1014780784515958, 0.12303049404893004, 0.10922852003326018, 0.18107525059920654, 0.1909420607742249, -0.0318388587145723, 0.10207761750197071, 0.19987161394710073, 0.2458248049380225, 0.08760427018594846, -0.1964177037997727, -0.02399217564481915, 0.2072637550238716] |
1,803.03493 | Effective Dresselhaus and Rashba spin-orbit interactions in narrow
quantum wells | Rashba and linear Dresselhaus interactions are believed to yield dominant
contribution to the spin splitting of two-dimensional electrons in the quantum
wells based on A$_3$B$_5$ compounds. We show that the interfacial spin-orbit
interaction significantly renormalizes the value of the corresponding Rashba
($\alpha_{SIA}$) and Dresselhaus ($\alpha_{BIA}$) parameters. For this purpose,
we solve the effective mass equation in a quantum well supplemented by the
original boundary conditions on the atomically sharp interfaces and calculate
the interfacial contributions to $\alpha_{SIA}$ and $\alpha_{BIA}$. Our results
explain a considerable spread in the experimental data on spin-orbit parameters
in GaAs/AlGaAs quantum wells. We also demonstrated that the non-equivalence of
the interfaces leads to the anisotropy of the spin splitting even in quantum
wells with zero average electric field.
| cond-mat.mes-hall | rashba and linear dresselhaus interactions are believed to yield dominant contribution to the spin splitting of twodimensional electrons in the quantum wells based on a_3b_5 compounds we show that the interfacial spinorbit interaction significantly renormalizes the value of the corresponding rashba alpha_sia and dresselhaus alpha_bia parameters for this purpose we solve the effective mass equation in a quantum well supplemented by the original boundary conditions on the atomically sharp interfaces and calculate the interfacial contributions to alpha_sia and alpha_bia our results explain a considerable spread in the experimental data on spinorbit parameters in gaasalgaas quantum wells we also demonstrated that the nonequivalence of the interfaces leads to the anisotropy of the spin splitting even in quantum wells with zero average electric field | [['rashba', 'and', 'linear', 'dresselhaus', 'interactions', 'are', 'believed', 'to', 'yield', 'dominant', 'contribution', 'to', 'the', 'spin', 'splitting', 'of', 'twodimensional', 'electrons', 'in', 'the', 'quantum', 'wells', 'based', 'on', 'a_3b_5', 'compounds', 'we', 'show', 'that', 'the', 'interfacial', 'spinorbit', 'interaction', 'significantly', 'renormalizes', 'the', 'value', 'of', 'the', 'corresponding', 'rashba', 'alpha_sia', 'and', 'dresselhaus', 'alpha_bia', 'parameters', 'for', 'this', 'purpose', 'we', 'solve', 'the', 'effective', 'mass', 'equation', 'in', 'a', 'quantum', 'well', 'supplemented', 'by', 'the', 'original', 'boundary', 'conditions', 'on', 'the', 'atomically', 'sharp', 'interfaces', 'and', 'calculate', 'the', 'interfacial', 'contributions', 'to', 'alpha_sia', 'and', 'alpha_bia', 'our', 'results', 'explain', 'a', 'considerable', 'spread', 'in', 'the', 'experimental', 'data', 'on', 'spinorbit', 'parameters', 'in', 'gaasalgaas', 'quantum', 'wells', 'we', 'also', 'demonstrated', 'that', 'the', 'nonequivalence', 'of', 'the', 'interfaces', 'leads', 'to', 'the', 'anisotropy', 'of', 'the', 'spin', 'splitting', 'even', 'in', 'quantum', 'wells', 'with', 'zero', 'average', 'electric', 'field']] | [-0.19364483050856984, 0.16150865533492206, -0.020129039824928814, 0.06705455107473172, -0.0204059086591158, -0.17344796068233545, 0.007478158093691178, 0.36021781474596165, -0.2513716034285846, -0.298665025027194, -0.04931339846454469, -0.28380585797741764, -0.1352008070918869, 0.21542914352211795, 0.016290636252245454, 0.029637894058813813, 0.01246123268177397, -0.07673000366060582, -0.10403362246131005, -0.24393375773082074, 0.3155055302882292, 0.0037433689299848725, 0.28257934268960944, 0.1621420880375033, 0.06524663615578663, 0.02212629416102513, 0.12163752573923986, -0.005951904481826502, -0.17371767256697582, 0.08024798640904979, 0.22067474363587383, -0.14965975592599906, 0.1778550279616821, -0.45166397100833594, -0.16247960514785936, -0.0062586988291901645, 0.12711076627363313, 0.19300855559174765, -0.08501848104299184, -0.29644456531730345, 0.009412305456296097, -0.14965454345668253, -0.09391500495878033, -0.04813793128295267, -0.013984452726006447, -0.00946056842803955, -0.2679016729206091, 0.09769886912879168, 0.05826536198929105, 0.0276866495479509, -0.11616538298606384, -0.14660148445295446, -0.06839782511624584, 0.08286749366976198, 0.06492974654748486, 0.02236107035375918, 0.14265003988183425, -0.136653710620432, -0.12666975668074226, 0.37493380222500106, -0.115890633221334, -0.2019019882847387, 0.15727668838216693, -0.16287790948227354, -0.028086441257953277, 0.10592750212192902, 0.16616810924663653, 0.055880046640684994, -0.13073828583583236, 0.14788313841134249, 0.03033669884545637, 0.15058299380080958, 0.0005988558700888372, 0.04954097834110382, 0.22577076182380074, 0.09580368275866752, 0.07553283225164795, 0.11237117362811734, -0.1130584911080688, -0.10973092821258747, -0.22115142702231885, -0.17907960419008723, -0.24320881262986507, 0.08673234929361182, -0.07209308573939899, -0.1773391846513956, 0.41641061838533056, 0.19752946878844474, 0.16977473359638978, -0.019530287814005964, 0.2575515466933062, 0.12339033384294035, 0.11346216167735516, 0.022693936205392735, 0.31586985273256163, 0.20663979539808008, 0.07158699919866612, -0.35198257574964253, 0.049991712000862255, -0.001960330131295763] |
1,803.03494 | The Szeg\"o-Asymptotics for Doubly-Dispersive Gaussian Channels | We consider the time-continuous doubly--dispersive channel with additive
Gaussian noise and establish a capacity formula for the case where the channel
operator is represented by a symbol which is periodic in time and fulfills some
further integrability, smoothness and oscillation conditions. More precisely,
we apply the well-known Holsinger-Gallager model for translating a
time-continuous channel for a sequence of time--intervals of increasing length
$\alpha\rightarrow\infty$ to a series of equivalent sets of discrete, parallel
channels, known at the transmitter. We quantify conditions when this procedure
converges. Finally, under periodicity assumptions this result can indeed be
justified as the channel capacity in the sense Shannon. The key to this is
result is a new Szeg\"o formula for certain pseudo--differential operators with
real-valued symbol. The Szeg\"o limit holds if the symbol belongs to the
homogeneous Besov space $\dot{B}^1_{\infty,1}$ with respect to its
time-dependency, characterizing the oscillatory behavior in time. Finally, the
formula justifies the water-filling principle in time and frequency as general
technique independent of a sampling scheme.
| cs.IT math.IT | we consider the timecontinuous doublydispersive channel with additive gaussian noise and establish a capacity formula for the case where the channel operator is represented by a symbol which is periodic in time and fulfills some further integrability smoothness and oscillation conditions more precisely we apply the wellknown holsingergallager model for translating a timecontinuous channel for a sequence of timeintervals of increasing length alpharightarrowinfty to a series of equivalent sets of discrete parallel channels known at the transmitter we quantify conditions when this procedure converges finally under periodicity assumptions this result can indeed be justified as the channel capacity in the sense shannon the key to this is result is a new szego formula for certain pseudodifferential operators with realvalued symbol the szego limit holds if the symbol belongs to the homogeneous besov space dotb1_infty1 with respect to its timedependency characterizing the oscillatory behavior in time finally the formula justifies the waterfilling principle in time and frequency as general technique independent of a sampling scheme | [['we', 'consider', 'the', 'timecontinuous', 'doublydispersive', 'channel', 'with', 'additive', 'gaussian', 'noise', 'and', 'establish', 'a', 'capacity', 'formula', 'for', 'the', 'case', 'where', 'the', 'channel', 'operator', 'is', 'represented', 'by', 'a', 'symbol', 'which', 'is', 'periodic', 'in', 'time', 'and', 'fulfills', 'some', 'further', 'integrability', 'smoothness', 'and', 'oscillation', 'conditions', 'more', 'precisely', 'we', 'apply', 'the', 'wellknown', 'holsingergallager', 'model', 'for', 'translating', 'a', 'timecontinuous', 'channel', 'for', 'a', 'sequence', 'of', 'timeintervals', 'of', 'increasing', 'length', 'alpharightarrowinfty', 'to', 'a', 'series', 'of', 'equivalent', 'sets', 'of', 'discrete', 'parallel', 'channels', 'known', 'at', 'the', 'transmitter', 'we', 'quantify', 'conditions', 'when', 'this', 'procedure', 'converges', 'finally', 'under', 'periodicity', 'assumptions', 'this', 'result', 'can', 'indeed', 'be', 'justified', 'as', 'the', 'channel', 'capacity', 'in', 'the', 'sense', 'shannon', 'the', 'key', 'to', 'this', 'is', 'result', 'is', 'a', 'new', 'szego', 'formula', 'for', 'certain', 'pseudodifferential', 'operators', 'with', 'realvalued', 'symbol', 'the', 'szego', 'limit', 'holds', 'if', 'the', 'symbol', 'belongs', 'to', 'the', 'homogeneous', 'besov', 'space', 'dotb1_infty1', 'with', 'respect', 'to', 'its', 'timedependency', 'characterizing', 'the', 'oscillatory', 'behavior', 'in', 'time', 'finally', 'the', 'formula', 'justifies', 'the', 'waterfilling', 'principle', 'in', 'time', 'and', 'frequency', 'as', 'general', 'technique', 'independent', 'of', 'a', 'sampling', 'scheme']] | [-0.1617399512317296, 0.09549620011706411, -0.09788867285371655, 0.09154081129667314, -0.06523317759022991, -0.18638230856783963, 0.08361000264060603, 0.33844351179805804, -0.32442171519829166, -0.1797472049822071, 0.14722760681660824, -0.21026915338258317, -0.1530854481841541, 0.20519052653423983, -0.12052473277255984, 0.0866909599435418, 0.05566518649568114, 0.08795397346954287, -0.07867515350355664, -0.22818522556414714, 0.34991358057452066, 0.048241458718239524, 0.2636115444453295, 0.009454577204406284, 0.09895790881408309, 0.03572594058515941, -0.008990723760453638, -0.054751277688702416, -0.15895346457564077, 0.04339060633203279, 0.23887846827001116, 0.09747136221154999, 0.2576596164273926, -0.36292791145244313, -0.2251655826414073, 0.14131068399989472, 0.12094436340927962, 0.06826327965425236, 0.026451916506720196, -0.275629968013051, 0.10656053245636737, -0.13555332144038224, -0.13916506845343077, -0.03664683218309541, 0.003323812839678592, 0.043860266785666256, -0.37221461855289006, 0.0979081613448575, 0.1304082105189194, 0.024794164332158773, -0.07396357935453754, -0.0667004826712928, 0.039236196124190346, 0.10850288224766566, 0.048090100071369955, 0.026972140561369606, 0.05817482064558584, -0.05396665494319879, -0.07866396383385255, 0.3279557278664369, -0.1006417308285844, -0.2777761151255281, 0.11638490834279147, -0.1561039186432745, -0.10930118777639704, 0.10325800427228476, 0.12198862779517601, 0.098696103181552, -0.15182994630155053, 0.1128701105940926, -0.05777032603797169, 0.15114620703353007, 0.1144730976127364, 0.0904750063220243, 0.09197349990085688, 0.13473630491155486, 0.13168947653051605, 0.19853114287504053, -0.07753482824378291, -0.11395651973025114, -0.33853288869485604, -0.16398987658666792, -0.21189683677490662, 0.05813816036701341, -0.11285366390200827, -0.15154702011025137, 0.3542668494349157, 0.12330330877829297, 0.16584972805562026, 0.14197103545877415, 0.2787555967181645, 0.19562288397135513, 0.014283789949848053, 0.07168526448205942, 0.13321435733724898, 0.1917734891298388, 0.11284374942382176, -0.17290498863008838, 0.07221555270622541, 0.09434677870264334] |
1,803.03495 | Pointwise estimates on derivatives of Coulombic wave functions and their
electron densities | We prove a priori bounds for all derivatives of non-relativistic Coulombic
eigenfunctions, involving negative powers of the distance to the singularities
of the many-body potential. We use these to derive bounds for all derivatives
of the corresponding one-electron densities, involving negative powers of the
distance from the nuclei. The results are both natural and optimal, as seen
from the ground state of Hydrogen.
| math.AP math-ph math.MP | we prove a priori bounds for all derivatives of nonrelativistic coulombic eigenfunctions involving negative powers of the distance to the singularities of the manybody potential we use these to derive bounds for all derivatives of the corresponding oneelectron densities involving negative powers of the distance from the nuclei the results are both natural and optimal as seen from the ground state of hydrogen | [['we', 'prove', 'a', 'priori', 'bounds', 'for', 'all', 'derivatives', 'of', 'nonrelativistic', 'coulombic', 'eigenfunctions', 'involving', 'negative', 'powers', 'of', 'the', 'distance', 'to', 'the', 'singularities', 'of', 'the', 'manybody', 'potential', 'we', 'use', 'these', 'to', 'derive', 'bounds', 'for', 'all', 'derivatives', 'of', 'the', 'corresponding', 'oneelectron', 'densities', 'involving', 'negative', 'powers', 'of', 'the', 'distance', 'from', 'the', 'nuclei', 'the', 'results', 'are', 'both', 'natural', 'and', 'optimal', 'as', 'seen', 'from', 'the', 'ground', 'state', 'of', 'hydrogen']] | [-0.0990153695974085, 0.08755095755230517, -0.04478295317422303, 0.11066365014347765, -0.0313151349047465, -0.08318393262812779, 0.04982681637482038, 0.32637189198581, -0.2503406578667521, -0.26914504256158595, 0.07083079415476984, -0.3240276686551552, -0.07867353052152173, 0.18547529717242078, 0.03189436042503942, 0.08414487879250258, 0.0065495372779430855, 0.09371614636528114, -0.14317610812565637, -0.19544394346072325, 0.3885043480374392, 0.01297964948037314, 0.1742081857094216, 0.1234941183855491, 0.0879541986237561, -0.02289806158533172, 0.011779681794227117, -0.022217034731828976, -0.1442964233445107, 0.1737936744022937, 0.24205900935663116, 0.08594373956282017, 0.25095111453935265, -0.4462878027605632, -0.1761133793948425, 0.12657287007286436, 0.1099668584305734, 0.13881902418114125, -0.03146986457489667, -0.2991132541071801, 0.037686241154987664, -0.1488184244741523, -0.1787497036839052, -0.09636813121300841, 0.025561754251756365, 0.11588587906093352, -0.28203042229962727, 0.123984084553307, 0.033903338417913466, -0.0006631451052805734, -0.11717700171062634, -0.21186932259135777, -0.02416320369091062, 0.15397220326676256, 0.06794857159848251, -0.05823541864279717, 0.07577792929101085, -0.1364718603325032, -0.11050280584170231, 0.38884692698244067, -0.08422759411826966, -0.17774095328613407, 0.16985861278538192, -0.17333248292376835, -0.06649661246347167, 0.12710165770517456, 0.15478809534143362, 0.15845835844557438, -0.10388948916206284, 0.10400627333105408, 0.01621604480204128, 0.08322110856395393, 0.11174505158874487, 0.12295644001532642, 0.13652621298318818, 0.011878055579487293, 0.1072560122739228, 0.13001188460279198, -0.08945129184968888, -0.11973983166177594, -0.3632902945724449, -0.16999285422738583, -0.2191191703886799, 0.08228960059331877, -0.12222188895190364, -0.1780914386313054, 0.36094309525593876, 0.098856699919062, 0.2146601104547107, 0.10833039173176365, 0.26114616355311776, 0.17619831642572073, 0.023168343769770765, 0.06182818912110099, 0.2522674769399658, 0.16671378883193172, 0.0328160272911191, -0.2132917459507192, 0.02917458414883604, 0.10425457535755067] |
1,803.03496 | Intersectional pairs of $n$-knots, local moves of $n$-knots, and their
associated invariants of $n$-knots | Let $n$ be an integer$\geqq0$. Let $S^{n+2}_1$ (respectively, $S^{n+2}_2$) be
the $(n+2)$-sphere embedded in the $(n+4)$-sphere $S^{n+4}$. Let $S^{n+2}_1$
and $S^{n+2}_2$ intersect transversely. Suppose that the smooth submanifold,
$S^{n+2}_1 \cap S^{n+2}_2$ in $S^{n+2}_i$ is PL homeomophic to the $n$-sphere.
Then $S^{n+2}_1$ and $S^{n+2}_2$ in $S^{n+2}_i$ is an $n$-knot $K_i$. We say
that the pair $(K_1,K_2)$ of n-knots is realizable.
We consider the following problem in this paper. Let $A_1$ and $A_2$ be
n-knots. Is the pair $(A_1,A_2)$ of $n$-knots realizable?
We give a complete characterization.
| math.GT | let n be an integergeqq0 let sn2_1 respectively sn2_2 be the n2sphere embedded in the n4sphere sn4 let sn2_1 and sn2_2 intersect transversely suppose that the smooth submanifold sn2_1 cap sn2_2 in sn2_i is pl homeomophic to the nsphere then sn2_1 and sn2_2 in sn2_i is an nknot k_i we say that the pair k_1k_2 of nknots is realizable we consider the following problem in this paper let a_1 and a_2 be nknots is the pair a_1a_2 of nknots realizable we give a complete characterization | [['let', 'n', 'be', 'an', 'integergeqq0', 'let', 'sn2_1', 'respectively', 'sn2_2', 'be', 'the', 'n2sphere', 'embedded', 'in', 'the', 'n4sphere', 'sn4', 'let', 'sn2_1', 'and', 'sn2_2', 'intersect', 'transversely', 'suppose', 'that', 'the', 'smooth', 'submanifold', 'sn2_1', 'cap', 'sn2_2', 'in', 'sn2_i', 'is', 'pl', 'homeomophic', 'to', 'the', 'nsphere', 'then', 'sn2_1', 'and', 'sn2_2', 'in', 'sn2_i', 'is', 'an', 'nknot', 'k_i', 'we', 'say', 'that', 'the', 'pair', 'k_1k_2', 'of', 'nknots', 'is', 'realizable', 'we', 'consider', 'the', 'following', 'problem', 'in', 'this', 'paper', 'let', 'a_1', 'and', 'a_2', 'be', 'nknots', 'is', 'the', 'pair', 'a_1a_2', 'of', 'nknots', 'realizable', 'we', 'give', 'a', 'complete', 'characterization']] | [-0.19326383272127715, 0.1696415305694245, -0.0517681697034277, -0.028273506661935243, -0.045988467306597156, -0.19583462806767785, -0.08095075661403825, 0.38913792502135036, -0.29035669481381776, -0.108974803053934, 0.046115272748284045, -0.3352730755228549, -0.08686924841313157, 0.14718825388117693, -0.12677703358931466, -0.1341439100157004, 0.023849708490160992, 0.07515783821581863, -0.01162707974508521, -0.23760649876494427, 0.31985199875198306, -0.1247820264310576, 0.14119918056530878, 0.09203811988118105, 0.051189029423585455, 0.0561329043994192, 0.10145672787330114, -0.002402908890508115, -0.2397994937879048, 0.10426082240737741, 0.269018967426382, 0.1288579271931667, 0.1935876362811541, -0.36674216790124775, -0.07893123998655938, 0.277605037833564, 0.20087530381861143, -0.08347604019218124, 0.013703420024830848, -0.21546240106690676, 0.1731651743495604, -0.08750381756108254, -0.13359819408506154, 0.018302900437265634, 0.09166032398861716, -0.007629605161491781, -0.32847044952213766, -0.024456994130741806, 0.07520555981900542, 0.06118380905827507, -0.013319274480454623, -0.09676620028330944, -0.07033249824307859, 0.03452540027792565, -0.08192201016499893, 0.18047508363961243, 0.015193541563348845, 0.022894163851742633, -0.08970946206245571, 0.3712441531475633, -0.0803365022293292, -0.2338770832825503, 0.03326198961003683, -0.1694794030394405, -0.10906047059688717, 0.07305763209005818, 0.13423592981998808, 0.16511940192431213, -0.06480706691509112, 0.18784740989576676, -0.13265377962961794, 0.10820437447400763, 0.05613293935894035, -0.042232415445323565, 0.16263689515762964, 0.08541735116159543, 0.08237749324180185, 0.147489044147369, -0.019794829800957814, 0.08067766343010589, -0.3643938133376651, -0.21040517123183236, -0.1503292671928648, 0.2178696540882811, -0.0593341323599816, -0.1216182305593975, 0.2949450752232224, 0.023263107938691973, 0.2375752786640078, 0.06795944048790262, 0.17393885049968957, 0.07173173562623561, -0.024824370961869135, 0.12158611073973588, 0.08371965192600328, 0.14736556862480937, -0.08723576141055674, -0.12959002494753805, -0.03137518451549113, 0.10938133634626865] |
1,803.03497 | Modelos de Resposta para Experimentos Randomizados em Redes Sociais de
Larga Escala | A/B tests are randomized experiments frequently used by companies that offer
services on the Web for assessing the impact of new features. During an
experiment, each user is randomly redirected to one of two versions of the
website, called treatments. Several response models were proposed to describe
the behavior of a user in a social network website, where the treatment
assigned to her neighbors must be taken into account. However, there is no
consensus as to which model should be applied to a given dataset. In this work,
we propose a new response model, derive theoretical limits for the estimation
error of several models, and obtain empirical results for cases where the
response model was misspecified.
| cs.SI stat.AP | ab tests are randomized experiments frequently used by companies that offer services on the web for assessing the impact of new features during an experiment each user is randomly redirected to one of two versions of the website called treatments several response models were proposed to describe the behavior of a user in a social network website where the treatment assigned to her neighbors must be taken into account however there is no consensus as to which model should be applied to a given dataset in this work we propose a new response model derive theoretical limits for the estimation error of several models and obtain empirical results for cases where the response model was misspecified | [['ab', 'tests', 'are', 'randomized', 'experiments', 'frequently', 'used', 'by', 'companies', 'that', 'offer', 'services', 'on', 'the', 'web', 'for', 'assessing', 'the', 'impact', 'of', 'new', 'features', 'during', 'an', 'experiment', 'each', 'user', 'is', 'randomly', 'redirected', 'to', 'one', 'of', 'two', 'versions', 'of', 'the', 'website', 'called', 'treatments', 'several', 'response', 'models', 'were', 'proposed', 'to', 'describe', 'the', 'behavior', 'of', 'a', 'user', 'in', 'a', 'social', 'network', 'website', 'where', 'the', 'treatment', 'assigned', 'to', 'her', 'neighbors', 'must', 'be', 'taken', 'into', 'account', 'however', 'there', 'is', 'no', 'consensus', 'as', 'to', 'which', 'model', 'should', 'be', 'applied', 'to', 'a', 'given', 'dataset', 'in', 'this', 'work', 'we', 'propose', 'a', 'new', 'response', 'model', 'derive', 'theoretical', 'limits', 'for', 'the', 'estimation', 'error', 'of', 'several', 'models', 'and', 'obtain', 'empirical', 'results', 'for', 'cases', 'where', 'the', 'response', 'model', 'was', 'misspecified']] | [-0.05180885291112394, 0.02781093483381796, -0.09663989499275541, 0.07642335900715713, -0.10525425006876346, -0.1948779142574118, 0.09175353141597889, 0.40894226996420785, -0.22098210456194997, -0.30901605297072693, 0.10723701609370845, -0.3043726932193185, -0.1432517051520147, 0.19564170561779035, -0.0746726384707566, 0.03037328243351959, 0.06714244210964133, 0.06349587510339916, 0.0005283065858810883, -0.3125105414957065, 0.25839495188797473, 0.06354122819852662, 0.28739120673934193, 0.02995168333391434, 0.06084875806620152, -0.0036221688476808624, -0.02863984337329447, 0.038253367154021396, -0.12256440074126093, 0.09604855372112822, 0.2892759663145312, 0.17744879632915272, 0.3547741228650356, -0.44638882624788273, -0.2186755103797748, 0.09352014077313502, 0.10217520208569678, 0.09525368527954861, -0.04005418822233533, -0.3077855631709099, 0.08023725579701492, -0.1960281478903449, -0.04535546028938402, -0.07559647987664934, -0.009751084015768921, 0.018471933813998476, -0.3391862834305984, -0.002976916716353775, -0.0005914097499295041, 0.05275277354240675, -0.06307709097846187, -0.11346154696115389, 0.017458030408055616, 0.19420898280202828, 0.08363577720793446, 0.006532347373712551, 0.13145965994295566, -0.12722350122880768, -0.150343833070706, 0.4098365988325456, -0.031186524889500137, -0.20103825698129968, 0.1517498256349615, -0.06627172665020194, -0.14516318347786777, 0.07018814072141359, 0.2489742898574934, 0.07165672699519401, -0.2297480314215324, -0.01231577992790523, -0.05709417251035057, 0.16986126237014984, -0.009225343273759916, -0.025356167498855563, 0.17885526519365094, 0.1859248491598229, 0.030069867493223462, 0.13306180866242484, -0.07401623215389855, -0.07758192070117541, -0.26763532278609686, -0.12086186248905442, -0.16792355380462612, -0.005490048975153859, -0.059620084995599586, -0.14769065114348356, 0.42095622311121433, 0.2111403795826281, 0.1863500446498651, 0.04544600972540452, 0.29501200334072625, 0.08162234598622208, 0.06720149370938025, 0.06773487976671935, 0.21416209990576165, 0.021266655390279304, 0.08757955872790953, -0.14062518158381612, 0.1597108390013655, 0.03729161005948895] |
1,803.03498 | Efficient calculation of open quantum system dynamics and time-resolved
spectroscopy with Distributed Memory HEOM (DM-HEOM) | Time- and frequency resolved optical signals provide insights into the
properties of light harvesting molecular complexes, including excitation
energies, dipole strengths and orientations, as well as in the exciton energy
flow through the complex. The hierarchical equations of motion (HEOM) provide a
unifying theory, which allows one to study the combined effects of
system-environment dissipation and non-Markovian memory without making
restrictive assumptions about weak or strong couplings or separability of
vibrational and electronic degrees of freedom. With increasing system size the
exact solution of the open quantum system dynamics requires memory and compute
resources beyond a single compute node. To overcome this barrier, we developed
a scalable variant of HEOM. Our distributed memory HEOM, DM-HEOM, is a
universal tool for open quantum system dynamics. It is used to accurately
compute all experimentally accessible time- and frequency resolved processes in
light harvesting molecular complexes with arbitrary system-environment
couplings for a wide range of temperatures and complex sizes.
| physics.chem-ph | time and frequency resolved optical signals provide insights into the properties of light harvesting molecular complexes including excitation energies dipole strengths and orientations as well as in the exciton energy flow through the complex the hierarchical equations of motion heom provide a unifying theory which allows one to study the combined effects of systemenvironment dissipation and nonmarkovian memory without making restrictive assumptions about weak or strong couplings or separability of vibrational and electronic degrees of freedom with increasing system size the exact solution of the open quantum system dynamics requires memory and compute resources beyond a single compute node to overcome this barrier we developed a scalable variant of heom our distributed memory heom dmheom is a universal tool for open quantum system dynamics it is used to accurately compute all experimentally accessible time and frequency resolved processes in light harvesting molecular complexes with arbitrary systemenvironment couplings for a wide range of temperatures and complex sizes | [['time', 'and', 'frequency', 'resolved', 'optical', 'signals', 'provide', 'insights', 'into', 'the', 'properties', 'of', 'light', 'harvesting', 'molecular', 'complexes', 'including', 'excitation', 'energies', 'dipole', 'strengths', 'and', 'orientations', 'as', 'well', 'as', 'in', 'the', 'exciton', 'energy', 'flow', 'through', 'the', 'complex', 'the', 'hierarchical', 'equations', 'of', 'motion', 'heom', 'provide', 'a', 'unifying', 'theory', 'which', 'allows', 'one', 'to', 'study', 'the', 'combined', 'effects', 'of', 'systemenvironment', 'dissipation', 'and', 'nonmarkovian', 'memory', 'without', 'making', 'restrictive', 'assumptions', 'about', 'weak', 'or', 'strong', 'couplings', 'or', 'separability', 'of', 'vibrational', 'and', 'electronic', 'degrees', 'of', 'freedom', 'with', 'increasing', 'system', 'size', 'the', 'exact', 'solution', 'of', 'the', 'open', 'quantum', 'system', 'dynamics', 'requires', 'memory', 'and', 'compute', 'resources', 'beyond', 'a', 'single', 'compute', 'node', 'to', 'overcome', 'this', 'barrier', 'we', 'developed', 'a', 'scalable', 'variant', 'of', 'heom', 'our', 'distributed', 'memory', 'heom', 'dmheom', 'is', 'a', 'universal', 'tool', 'for', 'open', 'quantum', 'system', 'dynamics', 'it', 'is', 'used', 'to', 'accurately', 'compute', 'all', 'experimentally', 'accessible', 'time', 'and', 'frequency', 'resolved', 'processes', 'in', 'light', 'harvesting', 'molecular', 'complexes', 'with', 'arbitrary', 'systemenvironment', 'couplings', 'for', 'a', 'wide', 'range', 'of', 'temperatures', 'and', 'complex', 'sizes']] | [-0.16443000181327358, 0.12746387887119243, -0.06301802498264572, 0.08081247513436186, -0.06649942602066752, -0.17333697959577712, 0.06411706109737189, 0.37698580204055476, -0.30298279157469576, -0.309236390534072, 0.042859697623405225, -0.19061996114825702, -0.08366184140434668, 0.1932682685661488, 0.03580951276951684, 0.051265945219291516, 0.08264420596876731, -0.01813826658643591, -0.0025821735019771717, -0.16121895348381562, 0.27060938167358894, 0.05897166973236614, 0.24527460567127818, 0.08897152323819076, 0.14156791478849184, 0.03343681078284788, 0.03838012074657644, -0.01845043572412135, -0.1336286183870517, 0.12800503020377782, 0.25843062384639126, 0.06055023289548281, 0.2511032813777908, -0.45488580396900385, -0.23951491126820493, 0.06182559092457478, 0.1432453191642148, 0.17816306906006035, -0.01481493226198766, -0.2908270266936877, 0.024140978921563007, -0.1498950247724469, -0.1689411003070955, -0.1418013146165042, 0.034587198396762595, 0.03408792711501846, -0.2525366731943228, 0.08521426998926565, 0.02173717276309617, 0.05151911752405935, -0.06856297985807312, -0.07752133062827991, -0.005102423488353498, 0.13658039909727776, -0.04142930109885175, -0.030608916743986834, 0.1842998349628686, -0.1266920732155902, -0.1225217836491095, 0.38719169794319147, -0.04479729199859624, -0.1947795037801067, 0.21701956962874064, -0.09822050467109641, -0.11138738129207362, 0.15553449442645964, 0.1722592358546069, 0.11927006436953655, -0.19723469511014768, 0.0976680769821635, 0.04162451965161241, 0.20536166999357727, 0.04563724821827446, 0.1556815748141768, 0.20062812440730154, 0.17254258762710753, 0.04531638140981205, 0.15212352296862847, -0.06517316463092963, -0.1722756370764751, -0.2211967281775567, -0.14871653575130786, -0.18154399661057724, 0.09689122012470108, -0.0980748002088475, -0.15079977178277496, 0.4147103705431502, 0.15532805250871043, 0.1602115736086256, 0.05502812098786354, 0.3146888440331587, 0.11064197640277995, 0.07354697685999174, 0.07201033060510571, 0.18796758741910496, 0.17155109266660964, 0.10470841757248706, -0.27455754733333987, 0.03272932200044847, -0.005956731585917087] |
1,803.03499 | Controlled viscosity in dense granular materials | We experimentally investigate the fluidization of a granular material subject
to mechanical vibrations by monitoring the angular velocity of a vane suspended
in the medium and driven by an external motor. On increasing the frequency we
observe a re-entrant transition, as a jammed system first enters a fluidized
state, where the vane rotates with high constant velocity, and then returns to
a frictional state, where the vane velocity is much lower. While the
fluidization frequency is material independent, the viscosity recovery
frequency shows a clear dependence on the material, that we rationalize by
relating this frequency to the balance between dissipative and inertial forces
in the system. Molecular dynamics simulations well reproduce the experimental
data, confirming the suggested theoretical picture.
| cond-mat.soft cond-mat.dis-nn cond-mat.mtrl-sci cond-mat.stat-mech | we experimentally investigate the fluidization of a granular material subject to mechanical vibrations by monitoring the angular velocity of a vane suspended in the medium and driven by an external motor on increasing the frequency we observe a reentrant transition as a jammed system first enters a fluidized state where the vane rotates with high constant velocity and then returns to a frictional state where the vane velocity is much lower while the fluidization frequency is material independent the viscosity recovery frequency shows a clear dependence on the material that we rationalize by relating this frequency to the balance between dissipative and inertial forces in the system molecular dynamics simulations well reproduce the experimental data confirming the suggested theoretical picture | [['we', 'experimentally', 'investigate', 'the', 'fluidization', 'of', 'a', 'granular', 'material', 'subject', 'to', 'mechanical', 'vibrations', 'by', 'monitoring', 'the', 'angular', 'velocity', 'of', 'a', 'vane', 'suspended', 'in', 'the', 'medium', 'and', 'driven', 'by', 'an', 'external', 'motor', 'on', 'increasing', 'the', 'frequency', 'we', 'observe', 'a', 'reentrant', 'transition', 'as', 'a', 'jammed', 'system', 'first', 'enters', 'a', 'fluidized', 'state', 'where', 'the', 'vane', 'rotates', 'with', 'high', 'constant', 'velocity', 'and', 'then', 'returns', 'to', 'a', 'frictional', 'state', 'where', 'the', 'vane', 'velocity', 'is', 'much', 'lower', 'while', 'the', 'fluidization', 'frequency', 'is', 'material', 'independent', 'the', 'viscosity', 'recovery', 'frequency', 'shows', 'a', 'clear', 'dependence', 'on', 'the', 'material', 'that', 'we', 'rationalize', 'by', 'relating', 'this', 'frequency', 'to', 'the', 'balance', 'between', 'dissipative', 'and', 'inertial', 'forces', 'in', 'the', 'system', 'molecular', 'dynamics', 'simulations', 'well', 'reproduce', 'the', 'experimental', 'data', 'confirming', 'the', 'suggested', 'theoretical', 'picture']] | [-0.1815364591505689, 0.2128576485179413, -0.10406747362964476, -0.043378206333727576, -0.05949419050787886, -0.10359183470330512, 0.06521285377433135, 0.3613865139583747, -0.2798265614330982, -0.2613718347454172, 0.0627251925431968, -0.2580798986911153, -0.12400051078857359, 0.19282799428328873, -0.012443534409006437, 0.0612561406645303, 0.011358899502859761, 0.013396968359787327, -0.006242703657092837, -0.09122505503085752, 0.23932337386844058, 0.09172446626471356, 0.302885742407913, 0.05483228410109101, 0.13849659721308855, -0.050502621281581624, 0.027419101850440105, 0.05176411599386484, -0.18157652949284966, -0.009826153584678346, 0.1767306453625982, -0.03497881156078317, 0.27178189243810874, -0.43838817725578944, -0.24294839337623367, 0.024868597744110352, 0.11002066710837728, 0.1168909509491641, -0.04823770132497884, -0.2712594404661407, -0.005480250859788308, -0.17787448816622298, -0.1412742974808983, -0.05532469651273762, 0.06541985966032371, 0.05285790243603212, -0.25177542640982814, 0.13759941199483972, 0.0552788949154395, 0.08755453936270594, -0.14393352865590714, -0.03775048151728697, -0.043561547740440194, 0.10179169803256324, 0.05724560900077146, 0.04443879468599334, 0.23686904223480573, -0.14025747822112558, -0.023957794683519752, 0.4162463205226231, -0.06815677448369874, -0.16105994988853733, 0.22561229914426803, -0.18053250812226906, -0.038316389231476934, 0.14788014532532542, 0.1695828430354595, 0.01987679673669239, -0.11112386554401989, -0.03818862408855542, -0.042853883506419756, 0.22336404121791323, 0.056440882633129755, -0.023792632869056737, 0.23259598470758647, 0.22972559911819795, 0.04509751837855826, 0.1906311254327496, -0.09137591184310925, -0.09010265303077176, -0.2669724926818162, -0.13705176718261403, -0.2165858895886534, 0.0358372309904856, -0.08242550955971334, -0.13943912313940623, 0.37163109991621845, 0.13820716243547698, 0.22903025121098228, 0.01709205723212411, 0.343256042979192, 0.10086933293593271, 0.02429011174826883, 0.0800835508465146, 0.31087295481314264, 0.14924682110043552, 0.1558634783703989, -0.3191757879918441, 0.10104109969106503, -0.006989027683933576] |
1,803.035 | A Bayesian approach to calibrating hydrogen flame kinetics using many
experiments and parameters | First-principles Markov Chain Monte Carlo sampling is used to investigate
uncertainty quantification and uncertainty propagation in parameters describing
hydrogen kinetics. Specifically, we sample the posterior distribution of
thirty-one parameters focusing on the H2O2 and HO2 reactions resulting from
conditioning on ninety-one experiments. Established literature values are used
for the remaining parameters in the mechanism. The samples are computed using
an affine invariant sampler starting with broad, noninformative priors.
Autocorrelation analysis shows that O(1M) samples are sufficient to obtain a
reasonable sampling of the posterior. The resulting distribution identifies
strong positive and negative correlations and several non-Gaussian
characteristics. Using samples drawn from the posterior, we investigate the
impact of parameter uncertainty on the prediction of two more complex flames: a
2D premixed flame kernel and the ignition of a hydrogen jet issuing into a
heated chamber. The former represents a combustion regime similar to the target
experiments used to calibrate the mechanism and the latter represents a
different combustion regime. For the premixed flame, the net amount of product
after a given time interval has a standard deviation of less than 2% whereas
the standard deviation of the ignition time for the jet is more than 10%. The
samples used for these studies are posted online. These results indicate the
degree to which parameters consistent with the target experiments constrain
predicted behavior in different combustion regimes. This process provides a
framework for both identifying reactions for further study from candidate
mechanisms as well as combining uncertainty quantification and propagation to,
ultimately, tie uncertainty in laboratory flame experiments to uncertainty in
end-use numerical predictions of more complicated scenarios.
| math.NA physics.comp-ph | firstprinciples markov chain monte carlo sampling is used to investigate uncertainty quantification and uncertainty propagation in parameters describing hydrogen kinetics specifically we sample the posterior distribution of thirtyone parameters focusing on the h2o2 and ho2 reactions resulting from conditioning on ninetyone experiments established literature values are used for the remaining parameters in the mechanism the samples are computed using an affine invariant sampler starting with broad noninformative priors autocorrelation analysis shows that o1m samples are sufficient to obtain a reasonable sampling of the posterior the resulting distribution identifies strong positive and negative correlations and several nongaussian characteristics using samples drawn from the posterior we investigate the impact of parameter uncertainty on the prediction of two more complex flames a 2d premixed flame kernel and the ignition of a hydrogen jet issuing into a heated chamber the former represents a combustion regime similar to the target experiments used to calibrate the mechanism and the latter represents a different combustion regime for the premixed flame the net amount of product after a given time interval has a standard deviation of less than 2 whereas the standard deviation of the ignition time for the jet is more than 10 the samples used for these studies are posted online these results indicate the degree to which parameters consistent with the target experiments constrain predicted behavior in different combustion regimes this process provides a framework for both identifying reactions for further study from candidate mechanisms as well as combining uncertainty quantification and propagation to ultimately tie uncertainty in laboratory flame experiments to uncertainty in enduse numerical predictions of more complicated scenarios | [['firstprinciples', 'markov', 'chain', 'monte', 'carlo', 'sampling', 'is', 'used', 'to', 'investigate', 'uncertainty', 'quantification', 'and', 'uncertainty', 'propagation', 'in', 'parameters', 'describing', 'hydrogen', 'kinetics', 'specifically', 'we', 'sample', 'the', 'posterior', 'distribution', 'of', 'thirtyone', 'parameters', 'focusing', 'on', 'the', 'h2o2', 'and', 'ho2', 'reactions', 'resulting', 'from', 'conditioning', 'on', 'ninetyone', 'experiments', 'established', 'literature', 'values', 'are', 'used', 'for', 'the', 'remaining', 'parameters', 'in', 'the', 'mechanism', 'the', 'samples', 'are', 'computed', 'using', 'an', 'affine', 'invariant', 'sampler', 'starting', 'with', 'broad', 'noninformative', 'priors', 'autocorrelation', 'analysis', 'shows', 'that', 'o1m', 'samples', 'are', 'sufficient', 'to', 'obtain', 'a', 'reasonable', 'sampling', 'of', 'the', 'posterior', 'the', 'resulting', 'distribution', 'identifies', 'strong', 'positive', 'and', 'negative', 'correlations', 'and', 'several', 'nongaussian', 'characteristics', 'using', 'samples', 'drawn', 'from', 'the', 'posterior', 'we', 'investigate', 'the', 'impact', 'of', 'parameter', 'uncertainty', 'on', 'the', 'prediction', 'of', 'two', 'more', 'complex', 'flames', 'a', '2d', 'premixed', 'flame', 'kernel', 'and', 'the', 'ignition', 'of', 'a', 'hydrogen', 'jet', 'issuing', 'into', 'a', 'heated', 'chamber', 'the', 'former', 'represents', 'a', 'combustion', 'regime', 'similar', 'to', 'the', 'target', 'experiments', 'used', 'to', 'calibrate', 'the', 'mechanism', 'and', 'the', 'latter', 'represents', 'a', 'different', 'combustion', 'regime', 'for', 'the', 'premixed', 'flame', 'the', 'net', 'amount', 'of', 'product', 'after', 'a', 'given', 'time', 'interval', 'has', 'a', 'standard', 'deviation', 'of', 'less', 'than', '2', 'whereas', 'the', 'standard', 'deviation', 'of', 'the', 'ignition', 'time', 'for', 'the', 'jet', 'is', 'more', 'than', '10', 'the', 'samples', 'used', 'for', 'these', 'studies', 'are', 'posted', 'online', 'these', 'results', 'indicate', 'the', 'degree', 'to', 'which', 'parameters', 'consistent', 'with', 'the', 'target', 'experiments', 'constrain', 'predicted', 'behavior', 'in', 'different', 'combustion', 'regimes', 'this', 'process', 'provides', 'a', 'framework', 'for', 'both', 'identifying', 'reactions', 'for', 'further', 'study', 'from', 'candidate', 'mechanisms', 'as', 'well', 'as', 'combining', 'uncertainty', 'quantification', 'and', 'propagation', 'to', 'ultimately', 'tie', 'uncertainty', 'in', 'laboratory', 'flame', 'experiments', 'to', 'uncertainty', 'in', 'enduse', 'numerical', 'predictions', 'of', 'more', 'complicated', 'scenarios']] | [-0.027067439713655918, 0.11349348865481278, -0.07902319499396912, 0.10052891088947395, -0.04838834072832229, -0.11039660128046548, 0.07562065237061173, 0.3909740102108357, -0.25241192789432015, -0.31136382515981514, 0.08435260069705898, -0.2740099252113756, -0.03622436443835778, 0.24172349642821642, -0.013544301070132346, 0.08218583231401973, 0.0890390084458972, -0.023529785138748163, -0.06566157425876777, -0.1844422063834192, 0.2778197418871986, 0.11238677073270083, 0.3013886267670764, -0.007398785972300003, 0.11465676189136674, -0.04657379235404561, -0.05724481370932651, -0.007864187916143323, -0.16774824919019285, 0.09188542603602949, 0.244628346263308, 0.11128602468074773, 0.2553060067149828, -0.4072360401339159, -0.27104166947164626, 0.10533008747470547, 0.12086055680213251, 0.11437542649328639, -0.05560841281093297, -0.2701968364733851, 0.031428215246239045, -0.16107435047693489, -0.08025437658652664, -0.05015785036749154, -0.0015334379215277776, 0.0262882824688447, -0.32256466099720027, 0.08949122393925515, 0.014791537772530233, 0.05673209651546852, -0.03512252513714627, -0.14990979375159544, -0.04050761314882141, 0.11137503357604146, 0.0646489254044114, -0.005090054598601781, 0.17597922065980592, -0.13315836765697964, -0.06424082317257757, 0.39084058347562295, -0.05870259964436662, -0.1734021890521893, 0.1818561318348039, -0.1458880287759832, -0.12804563433010974, 0.15593110537507904, 0.18284245129885537, 0.1092836364312976, -0.16339557798017026, -0.014226242503423666, -0.014770827452182103, 0.16181547489052392, 0.04499977525117157, -0.03534930816429825, 0.1373629934888087, 0.22473265386783992, 0.0102110131995155, 0.13038005890271995, -0.1354652883265308, -0.1247313348093193, -0.27896133845777443, -0.13615506418435921, -0.14472959538007962, 0.02150651374282667, -0.11943476702452348, -0.14678310320519333, 0.3701947025199122, 0.17347541104657654, 0.1988005454757444, 0.05458514201059445, 0.26663308140892045, 0.07867328687812605, 0.020009147620953197, 0.05094896865007028, 0.22070715463597257, 0.13113130638815182, 0.05602291283144985, -0.19939966219442212, 0.16718487129634563, 0.004397165953656131] |
1,803.03501 | Infall and Outflow Motions towards a Sample of Massive Star Forming
Regions from the RMS Survey | We present the results of an outflow and infall survey towards a distance
limited sample of 31 massive star forming regions drawn from the RMS survey.
The presence of young, active outflows is identified from SiO (8-7) emission
and the infall dynamics are explored using HCO$^+$/H$^{13}$CO$^+$ (4-3)
emission. We investigate if the infall and outflow parameters vary with source
properties, exploring whether regions hosting potentially young active outflows
show similarities or differences with regions harbouring more evolved, possibly
momentum driven, "fossil" outflows. SiO emission is detected towards
approximately 46% of the sources. When considering sources with and without an
SiO detection (i.e. potentially active and fossil outflows respectively), only
the $^{12}$CO outflow velocity shows a significant difference between samples,
indicating SiO is more prevalent towards sources with higher outflow
velocities. Furthermore, we find the SiO luminosity increases as a function of
the Herschel 70$\mu$m to WISE 22$\mu$m flux ratio, suggesting the production of
SiO is prevalent in younger, more embedded regions. Similarly, we find
tentative evidence that sources with an SiO detection have a smaller bolometric
luminosity-to-mass ratio, indicating SiO (8-7) emission is associated with
potentially younger regions. We do not find a prevalence towards sources
displaying signatures of infall in our sample. However, the higher energy
HCO$^+$ transitions may not be the best suited tracer of infall at this spatial
resolution in these regions.
| astro-ph.GA astro-ph.SR | we present the results of an outflow and infall survey towards a distance limited sample of 31 massive star forming regions drawn from the rms survey the presence of young active outflows is identified from sio 87 emission and the infall dynamics are explored using hcoh13co 43 emission we investigate if the infall and outflow parameters vary with source properties exploring whether regions hosting potentially young active outflows show similarities or differences with regions harbouring more evolved possibly momentum driven fossil outflows sio emission is detected towards approximately 46 of the sources when considering sources with and without an sio detection ie potentially active and fossil outflows respectively only the 12co outflow velocity shows a significant difference between samples indicating sio is more prevalent towards sources with higher outflow velocities furthermore we find the sio luminosity increases as a function of the herschel 70mum to wise 22mum flux ratio suggesting the production of sio is prevalent in younger more embedded regions similarly we find tentative evidence that sources with an sio detection have a smaller bolometric luminositytomass ratio indicating sio 87 emission is associated with potentially younger regions we do not find a prevalence towards sources displaying signatures of infall in our sample however the higher energy hco transitions may not be the best suited tracer of infall at this spatial resolution in these regions | [['we', 'present', 'the', 'results', 'of', 'an', 'outflow', 'and', 'infall', 'survey', 'towards', 'a', 'distance', 'limited', 'sample', 'of', '31', 'massive', 'star', 'forming', 'regions', 'drawn', 'from', 'the', 'rms', 'survey', 'the', 'presence', 'of', 'young', 'active', 'outflows', 'is', 'identified', 'from', 'sio', '87', 'emission', 'and', 'the', 'infall', 'dynamics', 'are', 'explored', 'using', 'hcoh13co', '43', 'emission', 'we', 'investigate', 'if', 'the', 'infall', 'and', 'outflow', 'parameters', 'vary', 'with', 'source', 'properties', 'exploring', 'whether', 'regions', 'hosting', 'potentially', 'young', 'active', 'outflows', 'show', 'similarities', 'or', 'differences', 'with', 'regions', 'harbouring', 'more', 'evolved', 'possibly', 'momentum', 'driven', 'fossil', 'outflows', 'sio', 'emission', 'is', 'detected', 'towards', 'approximately', '46', 'of', 'the', 'sources', 'when', 'considering', 'sources', 'with', 'and', 'without', 'an', 'sio', 'detection', 'ie', 'potentially', 'active', 'and', 'fossil', 'outflows', 'respectively', 'only', 'the', '12co', 'outflow', 'velocity', 'shows', 'a', 'significant', 'difference', 'between', 'samples', 'indicating', 'sio', 'is', 'more', 'prevalent', 'towards', 'sources', 'with', 'higher', 'outflow', 'velocities', 'furthermore', 'we', 'find', 'the', 'sio', 'luminosity', 'increases', 'as', 'a', 'function', 'of', 'the', 'herschel', '70mum', 'to', 'wise', '22mum', 'flux', 'ratio', 'suggesting', 'the', 'production', 'of', 'sio', 'is', 'prevalent', 'in', 'younger', 'more', 'embedded', 'regions', 'similarly', 'we', 'find', 'tentative', 'evidence', 'that', 'sources', 'with', 'an', 'sio', 'detection', 'have', 'a', 'smaller', 'bolometric', 'luminositytomass', 'ratio', 'indicating', 'sio', '87', 'emission', 'is', 'associated', 'with', 'potentially', 'younger', 'regions', 'we', 'do', 'not', 'find', 'a', 'prevalence', 'towards', 'sources', 'displaying', 'signatures', 'of', 'infall', 'in', 'our', 'sample', 'however', 'the', 'higher', 'energy', 'hco', 'transitions', 'may', 'not', 'be', 'the', 'best', 'suited', 'tracer', 'of', 'infall', 'at', 'this', 'spatial', 'resolution', 'in', 'these', 'regions']] | [-0.06723834095600371, 0.10729530147554922, 0.009843847842680083, 0.07117667578691099, -0.08350283903587195, -0.061500961944046945, 0.04255418206979003, 0.4979500548996859, -0.14396064344586598, -0.33911999569998846, 0.042615166277003784, -0.30621389196150833, 0.006451997958744566, 0.16289704483778528, 0.011490054165317109, -0.1112633956117659, 0.034066978946535126, -0.1411214026912219, -0.038168150185503895, -0.17854785962340733, 0.2794238737670498, 0.08974253032770421, 0.1742809484195378, -0.019095781956695847, 0.05906479059563329, -0.23160596717769902, -0.09865567276952789, -0.01887704831444555, -0.11556534043322447, 0.05649231547541502, 0.26394353349072236, 0.1287568607652146, 0.22469866393444438, -0.3267866696703843, -0.24407486808538023, 0.08659146489161584, 0.24608452773032088, 0.04518298905756738, -0.08098131681061609, -0.3053266836630387, 0.04540874792418132, -0.17898752332613285, -0.1762109154359334, 0.06222537518983396, 0.08953317964169805, 0.019909376731722862, -0.20775704558279054, 0.19779602705604502, 0.0047458638623356815, 0.13808006456846164, -0.10470602153800428, -0.12871569593954418, -0.11334734226163062, 0.057447189327148304, 0.013161353232442505, 0.09660458492942982, 0.24266801646807126, -0.168024039760025, -0.06256976765063074, 0.3892014685438739, -0.07091513378131721, -0.036939520880372986, 0.2958900856061114, -0.23120680182758305, -0.2202738523220695, 0.22410756760069894, 0.11572668734653335, 0.1355122389085591, -0.1084647164155548, -0.12601089565626655, -0.00433129156836205, 0.2532874970955567, 0.0482883644849062, 0.10717610322534003, 0.3445822171328796, 0.08389827687603732, 0.0815304745744086, 0.18141739327512268, -0.2759309922864971, -0.06033205053251651, -0.22311116482648585, -0.11315753220270078, -0.09315727517526183, 0.1113413387165767, -0.13305225173393007, -0.05834999453560966, 0.25526766100277504, 0.10128620629147109, 0.23210485557094215, 0.014807136242484881, 0.2878242385221852, 0.07390848957881746, 0.1162519617834025, 0.20405001485513316, 0.31032668254855605, 0.1392690514628258, 0.10777952833308115, -0.2234121168135769, 0.12812325871239105, -0.05081698124814365] |
1,803.03502 | Collaborative Filtering with Graph-based Implicit Feedback | Introducing consumed items as users' implicit feedback in matrix
factorization (MF) method, SVD++ is one of the most effective collaborative
filtering methods for personalized recommender systems. Though powerful, SVD++
has two limitations: (i). only user-side implicit feedback is utilized, whereas
item-side implicit feedback, which can also enrich item representations, is not
leveraged;(ii). in SVD++, the interacted items are equally weighted when
combining the implicit feedback, which can not reflect user's true preferences
accurately. To tackle the above limitations, in this paper we propose
Graph-based collaborative filtering (GCF) model, Weighted Graph-based
collaborative filtering (W-GCF) model and Attentive Graph-based collaborative
filtering (A-GCF) model, which (i). generalize the implicit feedback to item
side based on the user-item bipartite graph; (ii). flexibly learn the weights
of individuals in the implicit feedback hence improve the model's capacity.
Comprehensive experiments show that our proposed models outperform
state-of-the-art models.For sparse implicit feedback scenarios, additional
improvement is further achieved by leveraging the step-two implicit feedback
information.
| cs.IR | introducing consumed items as users implicit feedback in matrix factorization mf method svd is one of the most effective collaborative filtering methods for personalized recommender systems though powerful svd has two limitations i only userside implicit feedback is utilized whereas itemside implicit feedback which can also enrich item representations is not leveragedii in svd the interacted items are equally weighted when combining the implicit feedback which can not reflect users true preferences accurately to tackle the above limitations in this paper we propose graphbased collaborative filtering gcf model weighted graphbased collaborative filtering wgcf model and attentive graphbased collaborative filtering agcf model which i generalize the implicit feedback to item side based on the useritem bipartite graph ii flexibly learn the weights of individuals in the implicit feedback hence improve the models capacity comprehensive experiments show that our proposed models outperform stateoftheart modelsfor sparse implicit feedback scenarios additional improvement is further achieved by leveraging the steptwo implicit feedback information | [['introducing', 'consumed', 'items', 'as', 'users', 'implicit', 'feedback', 'in', 'matrix', 'factorization', 'mf', 'method', 'svd', 'is', 'one', 'of', 'the', 'most', 'effective', 'collaborative', 'filtering', 'methods', 'for', 'personalized', 'recommender', 'systems', 'though', 'powerful', 'svd', 'has', 'two', 'limitations', 'i', 'only', 'userside', 'implicit', 'feedback', 'is', 'utilized', 'whereas', 'itemside', 'implicit', 'feedback', 'which', 'can', 'also', 'enrich', 'item', 'representations', 'is', 'not', 'leveragedii', 'in', 'svd', 'the', 'interacted', 'items', 'are', 'equally', 'weighted', 'when', 'combining', 'the', 'implicit', 'feedback', 'which', 'can', 'not', 'reflect', 'users', 'true', 'preferences', 'accurately', 'to', 'tackle', 'the', 'above', 'limitations', 'in', 'this', 'paper', 'we', 'propose', 'graphbased', 'collaborative', 'filtering', 'gcf', 'model', 'weighted', 'graphbased', 'collaborative', 'filtering', 'wgcf', 'model', 'and', 'attentive', 'graphbased', 'collaborative', 'filtering', 'agcf', 'model', 'which', 'i', 'generalize', 'the', 'implicit', 'feedback', 'to', 'item', 'side', 'based', 'on', 'the', 'useritem', 'bipartite', 'graph', 'ii', 'flexibly', 'learn', 'the', 'weights', 'of', 'individuals', 'in', 'the', 'implicit', 'feedback', 'hence', 'improve', 'the', 'models', 'capacity', 'comprehensive', 'experiments', 'show', 'that', 'our', 'proposed', 'models', 'outperform', 'stateoftheart', 'modelsfor', 'sparse', 'implicit', 'feedback', 'scenarios', 'additional', 'improvement', 'is', 'further', 'achieved', 'by', 'leveraging', 'the', 'steptwo', 'implicit', 'feedback', 'information']] | [-0.03103547966339035, -0.02413516712764558, -0.07095327349440529, 0.12055972557906, -0.22935200541042813, -0.26363533083958174, 0.06359192243323729, 0.46854353851937003, -0.29829180423015106, -0.3022357899744331, 0.06462763309399057, -0.2826189029280072, -0.19065273572992095, 0.0843896567463887, -0.12367377481636366, 0.005426469920172654, 0.085997769435612, 0.050538870900126744, -0.07195513880069009, -0.32717862721092034, 0.3428459221275, 0.09154707698601913, 0.3095764400668783, -0.0068723917375714365, 0.14049023610758107, 0.019644009524627644, -0.130398652802398, 0.009402507362168988, -0.02301577162523518, 0.13924349163578265, 0.3848139961801102, 0.2056496645113928, 0.3916038019046967, -0.3978643583779047, -0.2661718684096449, 0.09424629049878598, 0.21581817057068928, 0.09613800505434887, -0.07023523259509258, -0.30032937543990174, 0.08336404287880225, -0.24735845955624397, 0.07019468771865944, -0.0955381663120504, -0.08935710941167439, 0.016387181338002703, -0.3583862638600122, 0.04589411555036135, 0.08844276524934114, 0.004852136347467214, -0.03686633094189554, -0.15905394526411554, 0.05559041587600874, 0.16010231213599255, -0.03639968152514056, -0.02664399362592258, 0.1725199347258442, -0.15608737636182543, -0.1819926693859005, 0.3307190620389103, -0.016078201081494197, -0.25925815376294076, 0.16352844354924836, 0.010749535306411631, -0.13359006554469638, 0.10522876398217883, 0.2208013621164985, 0.08634985808368309, -0.15320098272334934, 0.011916805269863164, -0.07736429830806123, 0.22971434713633476, 0.003397868388466342, -0.0050629889257739185, 0.11464976852917982, 0.1925113844103941, 0.0947337248545213, 0.047995702031044155, 0.017655546681078917, -0.09968158276447284, -0.16150146507919808, -0.0788821476493396, -0.19416758417778837, -0.04152270791168763, -0.14620932589086866, -0.12106811792524669, 0.3579200417460764, 0.250217024437791, 0.15337980192860748, 0.07145896296586013, 0.39720523314173123, 0.09546698285327627, 0.08372003850344495, 0.13888211471022538, 0.14019307371204584, 0.05069684015063484, 0.14863968732404625, -0.20956539445148867, 0.15489693827093184, 0.12052766972653617] |
1,803.03503 | Construction of neural networks for realization of localized deep
learning | The subject of deep learning has recently attracted users of machine learning
from various disciplines, including: medical diagnosis and bioinformatics,
financial market analysis and online advertisement, speech and handwriting
recognition, computer vision and natural language processing, time series
forecasting, and search engines. However, theoretical development of deep
learning is still at its infancy. The objective of this paper is to introduce a
deep neural network (also called deep-net) approach to localized manifold
learning, with each hidden layer endowed with a specific learning task. For the
purpose of illustrations, we only focus on deep-nets with three hidden layers,
with the first layer for dimensionality reduction, the second layer for bias
reduction, and the third layer for variance reduction. A feedback component
also designed to eliminate outliers. The main theoretical result in this paper
is the order $\mathcal O\left(m^{-2s/(2s+d)}\right)$ of approximation of the
regression function with regularity $s$, in terms of the number $m$ of sample
points, where the (unknown) manifold dimension $d$ replaces the dimension $D$
of the sampling (Euclidean) space for shallow nets.
| cs.LG | the subject of deep learning has recently attracted users of machine learning from various disciplines including medical diagnosis and bioinformatics financial market analysis and online advertisement speech and handwriting recognition computer vision and natural language processing time series forecasting and search engines however theoretical development of deep learning is still at its infancy the objective of this paper is to introduce a deep neural network also called deepnet approach to localized manifold learning with each hidden layer endowed with a specific learning task for the purpose of illustrations we only focus on deepnets with three hidden layers with the first layer for dimensionality reduction the second layer for bias reduction and the third layer for variance reduction a feedback component also designed to eliminate outliers the main theoretical result in this paper is the order mathcal oleftm2s2sdright of approximation of the regression function with regularity s in terms of the number m of sample points where the unknown manifold dimension d replaces the dimension d of the sampling euclidean space for shallow nets | [['the', 'subject', 'of', 'deep', 'learning', 'has', 'recently', 'attracted', 'users', 'of', 'machine', 'learning', 'from', 'various', 'disciplines', 'including', 'medical', 'diagnosis', 'and', 'bioinformatics', 'financial', 'market', 'analysis', 'and', 'online', 'advertisement', 'speech', 'and', 'handwriting', 'recognition', 'computer', 'vision', 'and', 'natural', 'language', 'processing', 'time', 'series', 'forecasting', 'and', 'search', 'engines', 'however', 'theoretical', 'development', 'of', 'deep', 'learning', 'is', 'still', 'at', 'its', 'infancy', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'a', 'deep', 'neural', 'network', 'also', 'called', 'deepnet', 'approach', 'to', 'localized', 'manifold', 'learning', 'with', 'each', 'hidden', 'layer', 'endowed', 'with', 'a', 'specific', 'learning', 'task', 'for', 'the', 'purpose', 'of', 'illustrations', 'we', 'only', 'focus', 'on', 'deepnets', 'with', 'three', 'hidden', 'layers', 'with', 'the', 'first', 'layer', 'for', 'dimensionality', 'reduction', 'the', 'second', 'layer', 'for', 'bias', 'reduction', 'and', 'the', 'third', 'layer', 'for', 'variance', 'reduction', 'a', 'feedback', 'component', 'also', 'designed', 'to', 'eliminate', 'outliers', 'the', 'main', 'theoretical', 'result', 'in', 'this', 'paper', 'is', 'the', 'order', 'mathcal', 'oleftm2s2sdright', 'of', 'approximation', 'of', 'the', 'regression', 'function', 'with', 'regularity', 's', 'in', 'terms', 'of', 'the', 'number', 'm', 'of', 'sample', 'points', 'where', 'the', 'unknown', 'manifold', 'dimension', 'd', 'replaces', 'the', 'dimension', 'd', 'of', 'the', 'sampling', 'euclidean', 'space', 'for', 'shallow', 'nets']] | [-0.06143289106919795, 0.017719926603944502, -0.023696405352882997, 0.03367963672495768, -0.13029836414229365, -0.17469806282928116, 0.03466521314418826, 0.378722397953664, -0.30018674318504396, -0.3127451412238818, 0.10920098798529229, -0.2882114900493918, -0.19058297742267102, 0.16662656596987047, -0.12677360754950265, 0.09530156826816924, 0.08681676509566823, 0.08428976125062078, -0.039107406906761795, -0.3075112082024666, 0.33269750604634746, 0.03311664094057136, 0.3232627225378038, 0.0005585789593339663, 0.12686153951343368, 0.0036230622150809967, -0.037995854212918824, -0.0366908085033126, -0.07690932619867422, 0.2006322371175006, 0.34559988965176874, 0.15910567128104947, 0.37687130624766063, -0.4002292653957531, -0.2422959036602263, 0.11621422359000957, 0.13694184880338783, 0.06428909975877413, -0.05115351343339538, -0.2847452350995607, 0.07978364864870775, -0.14598224763023226, -0.0173939164164231, -0.10533118137833798, 0.032169717481109306, -0.04006162101807056, -0.27337854414325946, 0.012781358625922265, 0.10983263272438089, 0.12486561612574634, -0.04155166093355361, -0.12481356197986847, 0.013422287997179693, 0.12419872232494952, 0.07881188693412781, 0.08559494541293522, 0.1240352973592473, -0.19347584234517917, -0.12772502901021673, 0.3408308650437764, -0.049707832586221745, -0.18080996335838098, 0.19834805116307927, -0.04724840104732423, -0.187517672910611, 0.08066347557493099, 0.2699253586834373, 0.09753436244730103, -0.14648051089191896, 0.08688375326785755, -0.013109824701882246, 0.1648267721430513, 0.05316942064254953, -0.009191124062789114, 0.1314783823432684, 0.27928813912072464, 0.06843217250200707, 0.14126913869199997, -0.13358790506009688, -0.08078926237169326, -0.25768887780454247, -0.14319495750013847, -0.20875906723698504, -0.005648611190358492, -0.11117870977086462, -0.18461532077114834, 0.3916045876617451, 0.1495094832206691, 0.1857173269674487, 0.09462337930583292, 0.32374767275058736, 0.07221263331192279, 0.0890564780807591, 0.10155533821347894, 0.15984508825659383, 0.08837420776165063, 0.15682617531972257, -0.16138933191082047, 0.09440810184609907, 0.07463606721748821] |
1,803.03504 | Synthesis And Characterization Of Polyynes End-Capped By Biphenyl Groups
({\Alpha},{\Omega}-Biphenylpolyynes) | Stable polyyne chains terminated with biphenyl end groups
(a,u-biphenylpolyynes) were synthesized in a single step through a simple
procedure by using the Cadiot-Chodkiewicz reaction conditions. The
a,ubiphenylpolyynes were separated through HPLC analysis and identified by
means of their electronic absorption spectra. The a,u-biphenylpolyynes were
studied by FT-IR and Raman spectroscopy and the spectral interpretation was
supported with DFT calculations. A peculiarly low reactivity of
a,u-biphenylpolyynes with ozone was observed.
| cond-mat.mtrl-sci | stable polyyne chains terminated with biphenyl end groups aubiphenylpolyynes were synthesized in a single step through a simple procedure by using the cadiotchodkiewicz reaction conditions the aubiphenylpolyynes were separated through hplc analysis and identified by means of their electronic absorption spectra the aubiphenylpolyynes were studied by ftir and raman spectroscopy and the spectral interpretation was supported with dft calculations a peculiarly low reactivity of aubiphenylpolyynes with ozone was observed | [['stable', 'polyyne', 'chains', 'terminated', 'with', 'biphenyl', 'end', 'groups', 'aubiphenylpolyynes', 'were', 'synthesized', 'in', 'a', 'single', 'step', 'through', 'a', 'simple', 'procedure', 'by', 'using', 'the', 'cadiotchodkiewicz', 'reaction', 'conditions', 'the', 'aubiphenylpolyynes', 'were', 'separated', 'through', 'hplc', 'analysis', 'and', 'identified', 'by', 'means', 'of', 'their', 'electronic', 'absorption', 'spectra', 'the', 'aubiphenylpolyynes', 'were', 'studied', 'by', 'ftir', 'and', 'raman', 'spectroscopy', 'and', 'the', 'spectral', 'interpretation', 'was', 'supported', 'with', 'dft', 'calculations', 'a', 'peculiarly', 'low', 'reactivity', 'of', 'aubiphenylpolyynes', 'with', 'ozone', 'was', 'observed']] | [-0.05439516549856361, 0.146543166730279, -0.10312305378893678, -0.011433582068147027, 0.04921540930209791, -0.14574479354846784, 0.09108884725034894, 0.49282026707249527, -0.20548695999690714, -0.3182149624095901, 0.08379046913229532, -0.30752003097030167, -0.11555236998110023, 0.16472452089724623, 0.05009357861297972, 0.07759492952540956, 0.05250005300759392, -0.0766060356023338, -0.05344407719916061, -0.18291500583291054, 0.24261075402062168, 0.14130131396300652, 0.2504895828006899, 0.04108594994827667, 0.01594688537914087, 0.015317094902617527, -0.031649681739509106, 0.015241622246856637, -0.1322349460781826, 0.11568800404818509, 0.2453863749807865, -0.021568659090382213, 0.2083398917422849, -0.4489183129523607, -0.24434252032626638, -0.029755548313807917, 0.10182396348511033, 0.07083556551814955, -0.10160662961082861, -0.3018666726043996, 0.09355483535567627, -0.1092892139328315, -0.09698994320077713, -0.07766199176309302, -0.06262511324466151, 0.05503904566114001, -0.17624766511075637, 0.08721632966497804, -0.07216062138767858, 0.17236267294816465, -0.1272401248707491, -0.10971331890836797, -0.15857004785143278, 0.07276200098182445, -0.0205866188642925, -0.05472303626105285, 0.18510982312042923, 0.009995102779665851, -0.0791641635587439, 0.34701027011717944, -0.1021871009896345, -0.02658040959538673, 0.18176400795688524, -0.11833415644222815, -0.12030621202361277, 0.23674797941930592, 0.008359800435273963, 0.1549202336874955, -0.1840333164368263, 0.03424779409054762, 0.030802135164027706, 0.16922270805876263, 0.1554096731603803, -0.026276540006031555, 0.1609301025112954, 0.1607377945637221, -0.10032555515713551, 0.15621557491249405, -0.14119782978120973, 0.0014271711903240752, -0.148986380218583, -0.15370412321884513, -0.15597753476022796, 0.05014416635865072, 0.02192231002225205, -0.11903150960707161, 0.3582323723445263, -0.047777753337012493, 0.20238963932291987, -0.05457662894075517, 0.23043537942473502, 0.12045406917219653, 0.07670201323344372, -0.027296262491932687, 0.22834415106541095, 0.2083281057763516, 0.0894278627820313, -0.23852261316086001, 0.11840033798259408, 0.040669868215713105] |
1,803.03505 | Electronic spectrum of twisted graphene layers under heterostrain | We demonstrate that stacking layered materials allows a novel type of strain
engineering where each layer is strained independently, which we call
heterostrain. We combine detailed structural and spectroscopic measurements
with tight-binding calculations to show that small uniaxial heterostrain
suppresses Dirac cones and leads to the emergence of flat bands in twisted
graphene layers (TGLs). Moreover, we demonstrate that heterostrain reconstructs
much more severely the energy spectrum of TGLs than homostrain for which both
layers are strained identically ; a result which should apply to virtually all
van der Waals structure opening exciting possibilities for straintronics with
2D materials.
| cond-mat.mes-hall cond-mat.mtrl-sci | we demonstrate that stacking layered materials allows a novel type of strain engineering where each layer is strained independently which we call heterostrain we combine detailed structural and spectroscopic measurements with tightbinding calculations to show that small uniaxial heterostrain suppresses dirac cones and leads to the emergence of flat bands in twisted graphene layers tgls moreover we demonstrate that heterostrain reconstructs much more severely the energy spectrum of tgls than homostrain for which both layers are strained identically a result which should apply to virtually all van der waals structure opening exciting possibilities for straintronics with 2d materials | [['we', 'demonstrate', 'that', 'stacking', 'layered', 'materials', 'allows', 'a', 'novel', 'type', 'of', 'strain', 'engineering', 'where', 'each', 'layer', 'is', 'strained', 'independently', 'which', 'we', 'call', 'heterostrain', 'we', 'combine', 'detailed', 'structural', 'and', 'spectroscopic', 'measurements', 'with', 'tightbinding', 'calculations', 'to', 'show', 'that', 'small', 'uniaxial', 'heterostrain', 'suppresses', 'dirac', 'cones', 'and', 'leads', 'to', 'the', 'emergence', 'of', 'flat', 'bands', 'in', 'twisted', 'graphene', 'layers', 'tgls', 'moreover', 'we', 'demonstrate', 'that', 'heterostrain', 'reconstructs', 'much', 'more', 'severely', 'the', 'energy', 'spectrum', 'of', 'tgls', 'than', 'homostrain', 'for', 'which', 'both', 'layers', 'are', 'strained', 'identically', 'a', 'result', 'which', 'should', 'apply', 'to', 'virtually', 'all', 'van', 'der', 'waals', 'structure', 'opening', 'exciting', 'possibilities', 'for', 'straintronics', 'with', '2d', 'materials']] | [-0.14812007985494444, 0.1736855491566913, -0.022127689541268505, -0.03706793040404782, -0.0947105108294636, -0.1893914036746872, 0.05583158714917341, 0.4312626291752646, -0.3048993083207231, -0.2712095334231363, -0.030114710199842718, -0.30278160941900417, -0.22481892461962016, 0.19963919374062436, 0.004742087565950657, 0.00786603471558345, 0.04293410716284263, -0.15298444534602917, -0.11378702869589784, -0.2107162593692345, 0.31286082256977493, 0.04663826111508043, 0.3411284957473215, 0.06316329094728357, 0.02334844340129118, 0.04343771279642456, 0.08936497458305798, 0.042338912169400014, -0.18621069902521986, 0.12917568714259878, 0.24347280371247937, -0.10615783579843609, 0.22257971608962276, -0.4647421136694519, -0.24127802282179656, -0.019008103606144064, 0.14005626894680684, 0.16950069385654243, -0.07320409120921365, -0.23763433786991395, 0.13320595689461026, -0.14377568216602268, -0.09176954367247067, -0.1419422544747297, -0.052845823554028025, -0.004536953470424602, -0.25339072868044143, 0.07615268011332342, 0.021344327291865882, 0.00339714309965003, -0.13478067620277503, -0.11537627574840659, -0.101825392219287, 0.06146224590606595, -0.002360834252383364, -0.01931821527449708, 0.14648276962535947, -0.09849852110798421, -0.06115134805563445, 0.4045312639521925, -0.029044903282498893, -0.10706882208928858, 0.18006493831053377, -0.14150795443718764, -0.12546521205160963, 0.11290001821165022, 0.11680665382331139, 0.07045271478495316, -0.1120034186812853, 0.07446526177104955, -0.011981979532069281, 0.19175632038692894, 0.07049891849195486, 0.061932763903352776, 0.22460479215277654, 0.15478651074717115, 0.09020274682460647, 0.15411930633586293, -0.11511073780834283, -0.004497002371537842, -0.20469412956092703, -0.2051766692415664, -0.1978411193826775, 0.0859158266948438, -0.0705555918133254, -0.25184422072611357, 0.4251574467475477, 0.1588408179973301, 0.17692009408615136, 0.01114038357780756, 0.21986469833891054, 0.04254359244981683, 0.11488775800925827, 0.04807629533798287, 0.2779985256395058, 0.12243859421608871, 0.04949813232708134, -0.11900984702729865, 0.02153406050056219, 0.0031791893569262405] |
1,803.03506 | Generalised Operations in Free Harmonic Analysis | This article, which is substantially motivated by the previous joint work
with J. McKay [8], establishes the analytic analogues of the relations we found
free probability has with Witt vectors. Therefore, we first present a novel
analytic derivation of an exponential map which relates the free additive
convolution on $\mathbb{R}$ with the free multiplicative convolution on either
the unit circle or $\mathbb{R}_+^*$, for compactly supported, freely infinitely
divisible probability measures. We then introduce several new operations on
these measures, which gives rise to more extended classes of operations. Then
we consider the relation with classical infinite divisibility and the geometry
of the spaces involved. Finally, we discuss the general structure, using the
language of operads and algebraic theories, of the various operations we
defined give rise to.
| math.PR | this article which is substantially motivated by the previous joint work with j mckay 8 establishes the analytic analogues of the relations we found free probability has with witt vectors therefore we first present a novel analytic derivation of an exponential map which relates the free additive convolution on mathbbr with the free multiplicative convolution on either the unit circle or mathbbr_ for compactly supported freely infinitely divisible probability measures we then introduce several new operations on these measures which gives rise to more extended classes of operations then we consider the relation with classical infinite divisibility and the geometry of the spaces involved finally we discuss the general structure using the language of operads and algebraic theories of the various operations we defined give rise to | [['this', 'article', 'which', 'is', 'substantially', 'motivated', 'by', 'the', 'previous', 'joint', 'work', 'with', 'j', 'mckay', '8', 'establishes', 'the', 'analytic', 'analogues', 'of', 'the', 'relations', 'we', 'found', 'free', 'probability', 'has', 'with', 'witt', 'vectors', 'therefore', 'we', 'first', 'present', 'a', 'novel', 'analytic', 'derivation', 'of', 'an', 'exponential', 'map', 'which', 'relates', 'the', 'free', 'additive', 'convolution', 'on', 'mathbbr', 'with', 'the', 'free', 'multiplicative', 'convolution', 'on', 'either', 'the', 'unit', 'circle', 'or', 'mathbbr_', 'for', 'compactly', 'supported', 'freely', 'infinitely', 'divisible', 'probability', 'measures', 'we', 'then', 'introduce', 'several', 'new', 'operations', 'on', 'these', 'measures', 'which', 'gives', 'rise', 'to', 'more', 'extended', 'classes', 'of', 'operations', 'then', 'we', 'consider', 'the', 'relation', 'with', 'classical', 'infinite', 'divisibility', 'and', 'the', 'geometry', 'of', 'the', 'spaces', 'involved', 'finally', 'we', 'discuss', 'the', 'general', 'structure', 'using', 'the', 'language', 'of', 'operads', 'and', 'algebraic', 'theories', 'of', 'the', 'various', 'operations', 'we', 'defined', 'give', 'rise', 'to']] | [-0.12788601447534784, 0.09936326301913785, -0.09773891810767764, 0.07948692122980307, -0.08390176680129696, -0.11048293925544951, 0.03191297107621822, 0.3508639245726696, -0.31042998653330556, -0.22872940775036343, 0.09100532753660717, -0.2230430025475349, -0.18813423685707503, 0.2099012420531069, -0.12358908198487864, 0.03311955111145269, 0.013061681997001641, 0.07424364560907047, -0.11588552257222101, -0.2638793026526114, 0.4046494380431616, 0.01253379125324056, 0.2250812676303019, 0.027444466042853013, 0.12252317061537774, 0.04305105291751092, -0.1136700052013584, -0.019360933023849575, -0.2175258941779749, 0.1965226161579682, 0.20929467386756767, 0.10731761434709462, 0.23520027167222454, -0.43732259353608127, -0.1695868254155214, 0.14527296045369756, 0.11631062170893951, 0.03069234649214424, -0.019124000283406394, -0.28578505276401683, 0.06050197019124418, -0.2143143596325627, -0.09608653090769557, -0.08262767325940094, 0.03946134970224587, 0.05792391851845043, -0.25675188069640636, 0.009048762821086397, 0.11677772309777774, 0.06815439528294319, -0.06913480547982759, -0.09417057574513978, 0.022902668174172892, 0.09124849033706975, 0.02535049406001271, 0.044050288426059146, 0.08933289549643482, -0.05054888046918598, -0.14463213202726888, 0.34094681183066894, -0.04664556896469856, -0.2502065280555036, 0.18799266517235655, -0.1424779856878179, -0.16844355916296402, 0.06917894970053645, 0.08925013695513521, 0.10158710562308708, -0.1017794306871232, 0.1683582281427986, -0.0962545019061136, 0.1166147058664667, 0.11020268037856563, 0.027574974010005505, 0.14528450816429742, 0.07911275508336899, 0.08501112206993024, 0.20318880666956657, -0.018988487085210174, -0.09611911205235707, -0.3439812556378485, -0.1690302596667664, -0.12911831794350637, 0.11396553657589642, -0.07386527355649421, -0.19558702613131737, 0.40077631754111354, 0.1101380916890747, 0.19948849895250376, 0.15767024490729298, 0.22997477882739714, 0.15369663819465346, 0.030211062276897235, 0.06721314867722616, 0.08346361712383943, 0.17480228536058307, 0.010726529334884459, -0.11150694898087678, -0.002027636122574487, 0.13400673011581846] |
1,803.03507 | Dynamic hysteresis from bistability in an antiferromagnetic spinor
condensate | We study the emergence of hysteresis during the process of quantum phase
transition from an antiferromagnetic to a phase-separated state in a spin-1
Bose Einstein condensate of ultracold atoms. We explicitly demonstrate the
appearance of a hysteresis loop with various quench times showing that it is
rate-independent for large magnetizations only. In other cases scaling of the
hysteresis loop area is observed, which we explain by using the Kibble-Zurek
theory in the limit of small magnetization. The effect of an external harmonic
trapping potential is also discussed.
| cond-mat.quant-gas quant-ph | we study the emergence of hysteresis during the process of quantum phase transition from an antiferromagnetic to a phaseseparated state in a spin1 bose einstein condensate of ultracold atoms we explicitly demonstrate the appearance of a hysteresis loop with various quench times showing that it is rateindependent for large magnetizations only in other cases scaling of the hysteresis loop area is observed which we explain by using the kibblezurek theory in the limit of small magnetization the effect of an external harmonic trapping potential is also discussed | [['we', 'study', 'the', 'emergence', 'of', 'hysteresis', 'during', 'the', 'process', 'of', 'quantum', 'phase', 'transition', 'from', 'an', 'antiferromagnetic', 'to', 'a', 'phaseseparated', 'state', 'in', 'a', 'spin1', 'bose', 'einstein', 'condensate', 'of', 'ultracold', 'atoms', 'we', 'explicitly', 'demonstrate', 'the', 'appearance', 'of', 'a', 'hysteresis', 'loop', 'with', 'various', 'quench', 'times', 'showing', 'that', 'it', 'is', 'rateindependent', 'for', 'large', 'magnetizations', 'only', 'in', 'other', 'cases', 'scaling', 'of', 'the', 'hysteresis', 'loop', 'area', 'is', 'observed', 'which', 'we', 'explain', 'by', 'using', 'the', 'kibblezurek', 'theory', 'in', 'the', 'limit', 'of', 'small', 'magnetization', 'the', 'effect', 'of', 'an', 'external', 'harmonic', 'trapping', 'potential', 'is', 'also', 'discussed']] | [-0.1660734529221623, 0.24258049785449898, -0.0418156852699275, 0.0408254728363213, -0.0008823770772794198, -0.13679476558155884, 0.05261682034550427, 0.3631590097157777, -0.21971810733813835, -0.23749519748099404, 0.044932208940568756, -0.27016610445604583, -0.15632517772844468, 0.1939501230358735, 0.0036780072815031156, 0.04001541857489909, -0.010287048155977124, 0.03759938112363733, -0.05573585746949004, -0.2438894315547813, 0.3187505674826773, -0.0016783896964792718, 0.28571992992669687, 0.09357203212941344, 0.08619180405191307, -0.0353614956437578, 0.1392855297816896, 0.061212396264040604, -0.13308325940624333, 0.01127018445123244, 0.19699641263203418, -0.031969016665243544, 0.1827534212805759, -0.43512328527867794, -0.21763542397268887, 0.08874313753558559, 0.14829835638232614, 0.19482774368685338, -0.049286344484693705, -0.3074830023935814, -0.014308797067095494, -0.17656195829568924, -0.16732904864756135, -0.1139189725442008, 0.02607301052060278, -0.0006787258162880423, -0.24459501388536273, 0.1101699913018945, 0.0987992880721416, 0.10737850811418104, -0.0882301411762748, -0.0129382507554416, -0.0012028366635050412, 0.0781619817543047, 0.0522580287474791, 0.039973909233364906, 0.15615195466269707, -0.16340860268422241, -0.12442709003031875, 0.341057443349012, -0.08747993092769864, -0.08761036001017382, 0.13158156940092644, -0.21461128926268597, -0.09659677664160557, 0.14298428615940542, 0.10385194223845141, 0.0691609554763498, -0.14763200788319797, 0.08447155665727359, 0.0022491985696485675, 0.15442467656858994, 0.043913239837977396, 0.002194266086551307, 0.25604769445142184, 0.21505364734979196, 0.0076103851228588445, 0.2421858257074819, -0.11952145589815302, -0.20271291007855158, -0.31116767171984433, -0.17181744323722248, -0.20537232809924874, 0.061354532551512804, -0.10208593371013801, -0.20466970838606358, 0.3638321511372496, 0.1559717129519873, 0.21679903708141426, -0.029905105990507566, 0.26144852029459403, 0.13950579043413544, 0.052771578039759875, 0.021361532005556357, 0.2685476117606821, 0.1632237324260989, 0.13518755290464596, -0.34503387409026853, 0.020894072141669606, 0.0497014787417419] |
1,803.03508 | A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding | Array codes have been widely employed in storage systems, such as Redundant
Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and
EVENODD codes are two popular double-parity array codes. As the capacity of
hard disks increases, better fault tolerance by using array codes with three or
more parity disks is needed. Although many extensions of RDP codes and EVENODD
codes have been proposed, the high decoding complexity is the main drawback of
them. In this paper, we present a new construction for all families of EVENODD
codes and RDP codes, and propose a unified form of them. Under this unified
form, RDP codes can be treated as shortened codes of EVENODD codes. Moreover,
an efficient decoding algorithm based on an LU factorization of Vandermonde
matrix is proposed when the number of continuous surviving parity columns is no
less than the number of erased information columns. The new decoding algorithm
is faster than the existing algorithms when more than three information columns
fail. The proposed efficient decoding algorithm is also applicable to other
Vandermonde array codes. Thus the proposed MDS array code is practically very
meaningful for storage systems that need higher reliability.
| cs.IT math.IT | array codes have been widely employed in storage systems such as redundant arrays of inexpensive disks raid the rowdiagonal parity rdp codes and evenodd codes are two popular doubleparity array codes as the capacity of hard disks increases better fault tolerance by using array codes with three or more parity disks is needed although many extensions of rdp codes and evenodd codes have been proposed the high decoding complexity is the main drawback of them in this paper we present a new construction for all families of evenodd codes and rdp codes and propose a unified form of them under this unified form rdp codes can be treated as shortened codes of evenodd codes moreover an efficient decoding algorithm based on an lu factorization of vandermonde matrix is proposed when the number of continuous surviving parity columns is no less than the number of erased information columns the new decoding algorithm is faster than the existing algorithms when more than three information columns fail the proposed efficient decoding algorithm is also applicable to other vandermonde array codes thus the proposed mds array code is practically very meaningful for storage systems that need higher reliability | [['array', 'codes', 'have', 'been', 'widely', 'employed', 'in', 'storage', 'systems', 'such', 'as', 'redundant', 'arrays', 'of', 'inexpensive', 'disks', 'raid', 'the', 'rowdiagonal', 'parity', 'rdp', 'codes', 'and', 'evenodd', 'codes', 'are', 'two', 'popular', 'doubleparity', 'array', 'codes', 'as', 'the', 'capacity', 'of', 'hard', 'disks', 'increases', 'better', 'fault', 'tolerance', 'by', 'using', 'array', 'codes', 'with', 'three', 'or', 'more', 'parity', 'disks', 'is', 'needed', 'although', 'many', 'extensions', 'of', 'rdp', 'codes', 'and', 'evenodd', 'codes', 'have', 'been', 'proposed', 'the', 'high', 'decoding', 'complexity', 'is', 'the', 'main', 'drawback', 'of', 'them', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'construction', 'for', 'all', 'families', 'of', 'evenodd', 'codes', 'and', 'rdp', 'codes', 'and', 'propose', 'a', 'unified', 'form', 'of', 'them', 'under', 'this', 'unified', 'form', 'rdp', 'codes', 'can', 'be', 'treated', 'as', 'shortened', 'codes', 'of', 'evenodd', 'codes', 'moreover', 'an', 'efficient', 'decoding', 'algorithm', 'based', 'on', 'an', 'lu', 'factorization', 'of', 'vandermonde', 'matrix', 'is', 'proposed', 'when', 'the', 'number', 'of', 'continuous', 'surviving', 'parity', 'columns', 'is', 'no', 'less', 'than', 'the', 'number', 'of', 'erased', 'information', 'columns', 'the', 'new', 'decoding', 'algorithm', 'is', 'faster', 'than', 'the', 'existing', 'algorithms', 'when', 'more', 'than', 'three', 'information', 'columns', 'fail', 'the', 'proposed', 'efficient', 'decoding', 'algorithm', 'is', 'also', 'applicable', 'to', 'other', 'vandermonde', 'array', 'codes', 'thus', 'the', 'proposed', 'mds', 'array', 'code', 'is', 'practically', 'very', 'meaningful', 'for', 'storage', 'systems', 'that', 'need', 'higher', 'reliability']] | [-0.17509920569985601, 0.07139200663990171, -0.027645384661203327, 0.12931567676241684, -0.0312120262181755, -0.27379964591091266, 0.00013263603553544576, 0.41237860902523, -0.257504056780211, -0.2964928366078918, 0.16275011141381887, -0.23261956298180544, -0.14507982942692857, 0.19831233202800527, -0.08935815598185097, 0.13900537395087062, 0.08010300566873714, 0.0018223266633867752, -0.14553121841769703, -0.33913088844080147, 0.24628718454187037, 0.2109527204556798, 0.269004293474912, -0.044559369420615745, 0.037360059798326496, -0.01295684278496386, -0.013828569909189051, 0.0034998353815656933, -0.06412332785737362, 0.11129795923504086, 0.30373725290579995, 0.2224464912772722, 0.2156351951622734, -0.42745158597729943, -0.20739842542252518, 0.0979340340733567, 0.18219755764342457, 0.17129003137718732, -0.0773506668497248, -0.16661137476088092, 0.14097473310054434, -0.2276338689540959, 0.010427743135854447, -0.05046255318181162, 0.014595134527553455, 0.014370647098379171, -0.27221932978621527, -0.017781950937357276, 0.07469265163914922, 0.0699981530730535, 0.014724509974864, -0.21633452459627733, 0.07978827430633828, 0.06880438767044932, -0.00523407888613292, 0.01763505365064096, 0.0476364640223134, -0.028625445663540933, -0.12727717506398525, 0.3724027782639799, 0.030451322037530797, -0.2068413901506574, 0.16513467789203182, -0.03166396228092102, -0.13299914812356897, 0.20646886431980724, 0.19521259254664378, 0.11722746958063605, -0.12076782066909193, 0.04702519293277874, -0.07410571369109675, 0.22572808766077893, 0.07892305325124956, 0.14199813412596995, 0.17810873314010678, 0.12824464416310852, 0.08930072855491744, 0.1944983806409558, -0.0785340212984617, -0.0630126465196857, -0.21123100631424072, -0.14710833553196304, -0.20230444584558427, -0.010736768241865017, -0.12066006003775935, -0.1764066012983676, 0.36307015990557073, 0.12324654094360692, 0.12143918003857834, 0.10326846292446135, 0.33898048812989146, 0.008999569497367096, 0.17554436541164856, 0.17436927843421776, 0.13254734942529467, 0.16861853851514752, 0.014582896068835302, -0.1874440585973692, 0.11114106024463884, 0.0855217786738649] |
1,803.03509 | On the Zeta Functions of Supersingular Curves | In general, the L-polynomial of a curve of genus $g$ is determined by $g$
coefficients. We show that the L-polynomial of a supersingular curve of genus
$g$ is determined by fewer than $g$ coefficients.
| math.AG | in general the lpolynomial of a curve of genus g is determined by g coefficients we show that the lpolynomial of a supersingular curve of genus g is determined by fewer than g coefficients | [['in', 'general', 'the', 'lpolynomial', 'of', 'a', 'curve', 'of', 'genus', 'g', 'is', 'determined', 'by', 'g', 'coefficients', 'we', 'show', 'that', 'the', 'lpolynomial', 'of', 'a', 'supersingular', 'curve', 'of', 'genus', 'g', 'is', 'determined', 'by', 'fewer', 'than', 'g', 'coefficients']] | [-0.2760900250800392, 0.10159128644120168, -0.1605614839012132, -0.016579685588915122, -0.10875959716299001, -0.16391268638236559, 0.015243512523524901, 0.3566758022369707, -0.24383643970769994, -0.29463255608125644, -0.004530317701317151, -0.2577521614730358, -0.15850725134505944, 0.3110651183216011, -0.16689951756202123, -0.011583839597947457, 0.0981546523706878, 0.15742606141001864, -0.07813133824589279, -0.3394191705566995, 0.3428795980837415, -0.11915815172388274, 0.13112757135840022, 0.02096046627882649, 0.0952247673755183, 0.0051820898318991945, 0.002635032869875431, 0.010313237195505816, -0.1891381654638869, 0.13874671087764642, 0.2824325957061613, 0.03325424025602201, 0.14935817946132054, -0.32333129370475516, -0.258401198860477, 0.2119376663776005, 0.048392008551779914, -0.09015523149248432, 0.07145480767768972, -0.14326834453352014, 0.13283757350462325, -0.09848370490705266, -0.21012184938744588, 0.003350919222130495, 0.16262298186912255, -0.02917596193797448, -0.2176573233993943, 0.035036547219052035, 0.0710801054340075, 0.19085260817561955, 0.08926621742327423, -0.20295086483512184, -0.15010988306911552, 0.0012428552898413995, -0.003622993073590538, 0.1302499097004971, 0.020225112723624882, -0.1954441739465384, -0.0256803482223083, 0.39481829260202017, -0.18397308162435794, -0.10887966122005738, 0.004103091490619323, -0.2018962204182411, -0.07151483393767301, 0.18666652381858406, 0.08673542831093073, 0.24490134418010712, -0.038758406525149065, 0.18782830358866384, -0.1114166998578345, 0.1384884361177683, 0.10642364040455397, -0.16524832237422848, 0.11834043198648621, 0.034622795551138764, 0.055442911134484935, 0.14550935334580786, 0.026554227368358302, 0.15848483665681937, -0.34652529328184967, -0.14478089704233058, -0.22286765693741686, 0.15742880659287467, -0.17238928018795216, -0.09167901640210081, 0.4923961417859091, -0.0014758255770977806, 0.20616241513669273, 0.12127165701788138, 0.221551557235858, 0.14585098783102105, 0.042680197669302714, 0.14109621325726895, 0.11366324521162931, 0.21740857211818151, -0.18462453642860055, -0.2099839180762715, 0.052574466311318034, 0.21978356061941562] |
1,803.0351 | Bloch wave filtering in tetrachiral materials via mechanical tuning | The periodic cellular topology characterizing the microscale structure of a
heterogeneous material may allow the finest functional customization of its
acoustic dispersion properties. The paper addresses the free propagation of
elastic waves in micro-structured cellular materials. Focus is on the
alternative formulations suited to describe the wave propagation in the
material, according to the classic canons of solid or structural mechanics.
Adopting the centrosymmetric tetrachiral microstructure as prototypical
periodic cell, the frequency dispersion spectrum resulting from a synthetic
lagrangian beam-lattice formulation is compared with its counterpart derived
from different continuous models (high-fidelity first-order heterogeneous and
equivalent homogenized micropolar continuum). Asymptotic perturbation-based
approximations and numerical spectral solutions are cross-validated. Adopting
the low-frequency band gaps of the material band structures as functional
targets, parametric analyses are carried out to highlight the descriptive
limits of the synthetic models and to explore the enlarged parameter space
described by high-fidelity models. The final tuning of the mechanical
properties of the cellular microstructure is employed to successfully verify
the wave filtering functionality of the tetrachiral material.
| physics.app-ph cond-mat.mtrl-sci | the periodic cellular topology characterizing the microscale structure of a heterogeneous material may allow the finest functional customization of its acoustic dispersion properties the paper addresses the free propagation of elastic waves in microstructured cellular materials focus is on the alternative formulations suited to describe the wave propagation in the material according to the classic canons of solid or structural mechanics adopting the centrosymmetric tetrachiral microstructure as prototypical periodic cell the frequency dispersion spectrum resulting from a synthetic lagrangian beamlattice formulation is compared with its counterpart derived from different continuous models highfidelity firstorder heterogeneous and equivalent homogenized micropolar continuum asymptotic perturbationbased approximations and numerical spectral solutions are crossvalidated adopting the lowfrequency band gaps of the material band structures as functional targets parametric analyses are carried out to highlight the descriptive limits of the synthetic models and to explore the enlarged parameter space described by highfidelity models the final tuning of the mechanical properties of the cellular microstructure is employed to successfully verify the wave filtering functionality of the tetrachiral material | [['the', 'periodic', 'cellular', 'topology', 'characterizing', 'the', 'microscale', 'structure', 'of', 'a', 'heterogeneous', 'material', 'may', 'allow', 'the', 'finest', 'functional', 'customization', 'of', 'its', 'acoustic', 'dispersion', 'properties', 'the', 'paper', 'addresses', 'the', 'free', 'propagation', 'of', 'elastic', 'waves', 'in', 'microstructured', 'cellular', 'materials', 'focus', 'is', 'on', 'the', 'alternative', 'formulations', 'suited', 'to', 'describe', 'the', 'wave', 'propagation', 'in', 'the', 'material', 'according', 'to', 'the', 'classic', 'canons', 'of', 'solid', 'or', 'structural', 'mechanics', 'adopting', 'the', 'centrosymmetric', 'tetrachiral', 'microstructure', 'as', 'prototypical', 'periodic', 'cell', 'the', 'frequency', 'dispersion', 'spectrum', 'resulting', 'from', 'a', 'synthetic', 'lagrangian', 'beamlattice', 'formulation', 'is', 'compared', 'with', 'its', 'counterpart', 'derived', 'from', 'different', 'continuous', 'models', 'highfidelity', 'firstorder', 'heterogeneous', 'and', 'equivalent', 'homogenized', 'micropolar', 'continuum', 'asymptotic', 'perturbationbased', 'approximations', 'and', 'numerical', 'spectral', 'solutions', 'are', 'crossvalidated', 'adopting', 'the', 'lowfrequency', 'band', 'gaps', 'of', 'the', 'material', 'band', 'structures', 'as', 'functional', 'targets', 'parametric', 'analyses', 'are', 'carried', 'out', 'to', 'highlight', 'the', 'descriptive', 'limits', 'of', 'the', 'synthetic', 'models', 'and', 'to', 'explore', 'the', 'enlarged', 'parameter', 'space', 'described', 'by', 'highfidelity', 'models', 'the', 'final', 'tuning', 'of', 'the', 'mechanical', 'properties', 'of', 'the', 'cellular', 'microstructure', 'is', 'employed', 'to', 'successfully', 'verify', 'the', 'wave', 'filtering', 'functionality', 'of', 'the', 'tetrachiral', 'material']] | [-0.11467545005677478, 0.08033945031199582, -0.05766964707242534, 0.046241834593699835, -0.10550745425211298, -0.10375377804746289, 0.03990799266892863, 0.39539233574191845, -0.3184238097151003, -0.26595032717426415, 0.09298566123608433, -0.23794124397234276, -0.17841673162545368, 0.180445367595754, -0.00905548654132958, 0.11261593085540095, 0.03369764805931223, -0.055227624415006685, -0.07072846454874056, -0.13271696370001332, 0.2803054040438391, 0.07271704536906758, 0.34255246254587934, -0.03453043647132505, 0.0636291565268835, -0.009032423089991307, -0.042264750679216444, 0.019575342074573555, -0.15195064122868515, 0.13297655931866822, 0.24776154658744665, 0.04218172198629899, 0.22750277780602582, -0.4659952991945151, -0.30509480074070083, 0.027371211506814843, 0.10572112530067607, 0.09006593973216044, 0.011509135262847784, -0.28411567518101816, 0.05737477748726423, -0.13457728754563708, -0.16771383428417103, -0.07551746261953624, -0.040048054435990264, 0.07352381128784732, -0.20918624557605697, 0.06932171772801753, 0.030439264884979063, 0.047888595023269614, -0.12031187017630102, -0.11098043790043018, -0.07899148861006916, 0.10256544887859749, 0.02095544466489827, -0.06419814092977821, 0.1434586935142088, -0.12805064914185973, -0.08287873456926917, 0.4549094228753848, -0.031398246354098325, -0.21391817799510335, 0.21367994760653589, -0.08458843108469113, -0.05686193096765576, 0.15928015283160132, 0.17178823795312873, 0.07322964551390188, -0.16143275130803272, 0.09452277847835912, -0.0003853005323677528, 0.19096145814163445, 0.048283678709567915, 0.04654983830839374, 0.20043206626284846, 0.22373695560378304, 0.0032711924059239364, 0.14755894363852295, -0.09043532366776211, -0.07365752241337264, -0.2623792896873852, -0.12518866450288857, -0.18547557693762848, 0.004932197566335668, -0.10759193607485101, -0.2177268852171152, 0.4238049874065675, 0.12538493563870198, 0.10451569958154619, 0.03017389143888767, 0.26784113123282766, 0.11181302820387456, 0.03629667303640638, 0.01717370987412404, 0.2570422291810784, 0.17687418032024255, 0.1106320230728401, -0.22966492084714657, 0.04224602636996899, 0.03759324129604729] |
1,803.03511 | Divisibility of L-Polynomials for a Family of Artin-Schreier Curves | In this paper we consider the curves $C_k^{(p,a)} : y^p-y=x^{p^k+1}+ax$
defined over $\mathbb F_p$ and give a positive answer to a conjecture about a
divisibility condition on $L$-polynomials of the curves $C_k^{(p,a)}$. Our
proof involves finding an exact formula for the number of $\mathbb
F_{p^n}$-rational points on $C_k^{(p,a)}$ for all $n$, and uses a result we
proved elsewhere about the number of rational points on supersingular curves.
| math.AG | in this paper we consider the curves c_kpa ypyxpk1ax defined over mathbb f_p and give a positive answer to a conjecture about a divisibility condition on lpolynomials of the curves c_kpa our proof involves finding an exact formula for the number of mathbb f_pnrational points on c_kpa for all n and uses a result we proved elsewhere about the number of rational points on supersingular curves | [['in', 'this', 'paper', 'we', 'consider', 'the', 'curves', 'c_kpa', 'ypyxpk1ax', 'defined', 'over', 'mathbb', 'f_p', 'and', 'give', 'a', 'positive', 'answer', 'to', 'a', 'conjecture', 'about', 'a', 'divisibility', 'condition', 'on', 'lpolynomials', 'of', 'the', 'curves', 'c_kpa', 'our', 'proof', 'involves', 'finding', 'an', 'exact', 'formula', 'for', 'the', 'number', 'of', 'mathbb', 'f_pnrational', 'points', 'on', 'c_kpa', 'for', 'all', 'n', 'and', 'uses', 'a', 'result', 'we', 'proved', 'elsewhere', 'about', 'the', 'number', 'of', 'rational', 'points', 'on', 'supersingular', 'curves']] | [-0.23644612204225268, 0.00588309282670707, -0.11966617425787263, 0.04016382134250307, -0.05628968527162215, -0.10956480505410582, 0.08936779367104464, 0.26980889606056735, -0.22898809882462956, -0.252686952939257, 0.055595315801838296, -0.2716507826007728, -0.14374053910796647, 0.30976012103201356, -0.1597851614933461, 0.016922994359219956, 0.011950986034207745, 0.09597416962060379, -0.051412469383649295, -0.37492319566445076, 0.34183635091176257, -0.08027482603210956, 0.17374476985423826, 0.09616927735623904, 0.11591919624333968, 0.08126078193890862, -0.0324547818299834, -0.06563370896037668, -0.20469564193626866, 0.12774860713398084, 0.2475468121119775, 0.1166102914212388, 0.21682979440083727, -0.3660170360817574, -0.14064080948082847, 0.2194017823712784, 0.1359883968179929, 0.04567549703642726, -0.029484993921869318, -0.20176504616392776, 0.11477921853565931, -0.07132544324849732, -0.20115713252744172, -0.036292037373641506, 0.08378756577440072, 0.027426728862337768, -0.27112287693307735, -0.02225785466725938, 0.13090669229859486, 0.1835202136717271, -0.0668485770947882, -0.14413169399631443, 0.01239300718953018, 0.03005252948787529, 0.022978344876364076, 0.06758161807192664, -0.013490107368852478, -0.059047539780294755, -0.08369794450118206, 0.3366794811881846, -0.029445942796883173, -0.18610249218181707, 0.07391023510717787, -0.11453649576287717, -0.14197427799808793, 0.1227090710963239, 0.1388271313758196, 0.18472417653538287, -0.012158259763964452, 0.1438658896204288, -0.17505206694477238, 0.12233706305778469, 0.13340689390315674, -0.04018258622090798, 0.1483021614694735, 0.03989460394222988, 0.08808408430195414, 0.12037442878317961, 0.0013543062123062555, -0.035900961454899516, -0.3839687664876692, -0.20243828587081225, -0.1642121310596849, 0.16574351923190989, -0.105412668140616, -0.19331101031275466, 0.40375465239048935, 0.08472984898253344, 0.24216603322929586, 0.17535117056104355, 0.21174271014751866, 0.089653303826708, -0.023045909772918094, 0.07252408692147583, 0.08243903081165627, 0.15795696416171268, 0.007385934861304122, -0.12485236217798956, 0.04651471634133486, 0.1928965274564689] |
1,803.03512 | The nonparametric location-scale mixture cure model | We propose completely nonparametric methodology to investigate location-scale
modelling of two-component mixture cure models, where the responses of interest
are only indirectly observable due to the presence of censoring and the
presence of so-called long-term survivors that are always censored. We use
covariate-localized nonparametric estimators, which depend on a bandwidth
sequence, to propose an estimator of the error distribution function that has
not been considered before in the literature. When this bandwidth belongs to a
certain range of undersmoothing bandwidths, the asymptotic distribution of the
proposed estimator of the error distribution function does not depend on this
bandwidth, and this estimator is shown to be root-n consistent. This suggests
that a computationally costly bandwidth selection procedure is unnecessary to
obtain an effective estimator of the error distribution, and that a simpler
rule-of-thumb approach can be used instead. A simulation study investigates the
finite sample properties of our approach, and the methodology is illustrated
using data obtained to study the behavior of distant metastasis in
lymph-node-negative breast cancer patients.
| stat.ME | we propose completely nonparametric methodology to investigate locationscale modelling of twocomponent mixture cure models where the responses of interest are only indirectly observable due to the presence of censoring and the presence of socalled longterm survivors that are always censored we use covariatelocalized nonparametric estimators which depend on a bandwidth sequence to propose an estimator of the error distribution function that has not been considered before in the literature when this bandwidth belongs to a certain range of undersmoothing bandwidths the asymptotic distribution of the proposed estimator of the error distribution function does not depend on this bandwidth and this estimator is shown to be rootn consistent this suggests that a computationally costly bandwidth selection procedure is unnecessary to obtain an effective estimator of the error distribution and that a simpler ruleofthumb approach can be used instead a simulation study investigates the finite sample properties of our approach and the methodology is illustrated using data obtained to study the behavior of distant metastasis in lymphnodenegative breast cancer patients | [['we', 'propose', 'completely', 'nonparametric', 'methodology', 'to', 'investigate', 'locationscale', 'modelling', 'of', 'twocomponent', 'mixture', 'cure', 'models', 'where', 'the', 'responses', 'of', 'interest', 'are', 'only', 'indirectly', 'observable', 'due', 'to', 'the', 'presence', 'of', 'censoring', 'and', 'the', 'presence', 'of', 'socalled', 'longterm', 'survivors', 'that', 'are', 'always', 'censored', 'we', 'use', 'covariatelocalized', 'nonparametric', 'estimators', 'which', 'depend', 'on', 'a', 'bandwidth', 'sequence', 'to', 'propose', 'an', 'estimator', 'of', 'the', 'error', 'distribution', 'function', 'that', 'has', 'not', 'been', 'considered', 'before', 'in', 'the', 'literature', 'when', 'this', 'bandwidth', 'belongs', 'to', 'a', 'certain', 'range', 'of', 'undersmoothing', 'bandwidths', 'the', 'asymptotic', 'distribution', 'of', 'the', 'proposed', 'estimator', 'of', 'the', 'error', 'distribution', 'function', 'does', 'not', 'depend', 'on', 'this', 'bandwidth', 'and', 'this', 'estimator', 'is', 'shown', 'to', 'be', 'rootn', 'consistent', 'this', 'suggests', 'that', 'a', 'computationally', 'costly', 'bandwidth', 'selection', 'procedure', 'is', 'unnecessary', 'to', 'obtain', 'an', 'effective', 'estimator', 'of', 'the', 'error', 'distribution', 'and', 'that', 'a', 'simpler', 'ruleofthumb', 'approach', 'can', 'be', 'used', 'instead', 'a', 'simulation', 'study', 'investigates', 'the', 'finite', 'sample', 'properties', 'of', 'our', 'approach', 'and', 'the', 'methodology', 'is', 'illustrated', 'using', 'data', 'obtained', 'to', 'study', 'the', 'behavior', 'of', 'distant', 'metastasis', 'in', 'lymphnodenegative', 'breast', 'cancer', 'patients']] | [-0.05663875743945926, 0.024185120204010563, -0.11174757087025343, 0.09615518428393673, -0.08974822820164263, -0.1507368384220873, 0.08579227221773443, 0.40659730256737087, -0.22630095576898318, -0.2674496763397053, 0.1384991326071995, -0.22148454421289623, -0.1523455440695117, 0.18296900979826697, -0.15337617135415954, 0.06709109452982287, 0.059726418126430585, -0.005579685648561017, -0.0398910652386047, -0.29349694787861264, 0.2795768542101618, 0.09505419994154608, 0.3477105869047613, -0.010374116155891174, 0.08877320337727812, 0.007463807601997831, -0.037945815345205094, -0.014193339001230267, -0.13104895679423928, 0.11109742848553235, 0.2546285656332755, 0.15790033505258924, 0.36381641623889466, -0.3391789205325259, -0.2424257826003953, 0.16549276440482902, 0.1684166512912117, 0.0975301299245568, -0.0010632218418541893, -0.24405787021191006, 0.10116926283598036, -0.20524925320547394, -0.11482101465513683, -0.0785397416968123, -0.04423881255381976, 0.022658506311554777, -0.34925227960661415, 0.14676417544935072, 0.028307158180164646, 0.03816063565024805, -0.029912882610729122, -0.11392523149443588, 0.016959297270177448, 0.08410778962561709, 0.09759770322686442, -0.018127647354772472, 0.11989431901475842, -0.09307148275863245, -0.05681108863440802, 0.30285526794123363, -0.02733310783795272, -0.22988820084404335, 0.15652428381706038, -0.13436459249596627, -0.10861992680871613, 0.12264003110656807, 0.19865205697294505, 0.1283859794886491, -0.2141745210088213, 0.03874587181658226, -0.020453629434580005, 0.18010970736231027, 0.004676371538613261, 0.019204659084508937, 0.16564683645124917, 0.17440066299070212, 0.06444404129056731, 0.14505085475737206, -0.1291868424096358, -0.05090775550904134, -0.29898932430590225, -0.10157486296213984, -0.24294382369381387, -0.0021222129782187717, -0.07708153736753759, -0.23046578752793545, 0.39252336147095424, 0.21350047641703074, 0.19022492659334317, 0.0914757045999966, 0.28230374249214507, 0.13392479995234746, 0.064784532269822, 0.064039693864803, 0.20165045830948525, 0.0918994580636766, 0.018166280878954624, -0.2292261184670076, 0.16596148479365216, 0.007972478103565883] |
1,803.03513 | Cosmic History and a Candidate Parent Asteroid for the
Quasicrystal-bearing Meteorite Khatyrka | The unique CV-type meteorite Khatyrka is the only natural sample in which
"quasicrystals" and associated crystalline Cu,Al-alloys, including khatyrkite
and cupalite, have been found. They are suspected to have formed in the early
Solar System. To better understand the origin of these exotic phases, and the
relationship of Khatyrka to other CV chondrites, we have measured He and Ne in
six individual, ~40-{\mu}m-sized olivine grains from Khatyrka. We find a
cosmic-ray exposure age of about 2-4 Ma (if the meteoroid was <3 m in diameter,
more if it was larger). The U,Th-He ages of the olivine grains suggest that
Khatyrka experienced a relatively recent (<600 Ma) shock event, which created
pressure and temperature conditions sufficient to form both the quasicrystals
and the high-pressure phases found in the meteorite. We propose that the parent
body of Khatyrka is the large K-type asteroid 89 Julia, based on its peculiar,
but matching reflectance spectrum, evidence for an impact/shock event within
the last few 100 Ma (which formed the Julia family), and its location close to
strong orbital resonances, so that the Khatyrka meteoroid could plausibly have
reached Earth within its rather short cosmic-ray exposure age.
| astro-ph.EP | the unique cvtype meteorite khatyrka is the only natural sample in which quasicrystals and associated crystalline cualalloys including khatyrkite and cupalite have been found they are suspected to have formed in the early solar system to better understand the origin of these exotic phases and the relationship of khatyrka to other cv chondrites we have measured he and ne in six individual 40mumsized olivine grains from khatyrka we find a cosmicray exposure age of about 24 ma if the meteoroid was 3 m in diameter more if it was larger the uthhe ages of the olivine grains suggest that khatyrka experienced a relatively recent 600 ma shock event which created pressure and temperature conditions sufficient to form both the quasicrystals and the highpressure phases found in the meteorite we propose that the parent body of khatyrka is the large ktype asteroid 89 julia based on its peculiar but matching reflectance spectrum evidence for an impactshock event within the last few 100 ma which formed the julia family and its location close to strong orbital resonances so that the khatyrka meteoroid could plausibly have reached earth within its rather short cosmicray exposure age | [['the', 'unique', 'cvtype', 'meteorite', 'khatyrka', 'is', 'the', 'only', 'natural', 'sample', 'in', 'which', 'quasicrystals', 'and', 'associated', 'crystalline', 'cualalloys', 'including', 'khatyrkite', 'and', 'cupalite', 'have', 'been', 'found', 'they', 'are', 'suspected', 'to', 'have', 'formed', 'in', 'the', 'early', 'solar', 'system', 'to', 'better', 'understand', 'the', 'origin', 'of', 'these', 'exotic', 'phases', 'and', 'the', 'relationship', 'of', 'khatyrka', 'to', 'other', 'cv', 'chondrites', 'we', 'have', 'measured', 'he', 'and', 'ne', 'in', 'six', 'individual', '40mumsized', 'olivine', 'grains', 'from', 'khatyrka', 'we', 'find', 'a', 'cosmicray', 'exposure', 'age', 'of', 'about', '24', 'ma', 'if', 'the', 'meteoroid', 'was', '3', 'm', 'in', 'diameter', 'more', 'if', 'it', 'was', 'larger', 'the', 'uthhe', 'ages', 'of', 'the', 'olivine', 'grains', 'suggest', 'that', 'khatyrka', 'experienced', 'a', 'relatively', 'recent', '600', 'ma', 'shock', 'event', 'which', 'created', 'pressure', 'and', 'temperature', 'conditions', 'sufficient', 'to', 'form', 'both', 'the', 'quasicrystals', 'and', 'the', 'highpressure', 'phases', 'found', 'in', 'the', 'meteorite', 'we', 'propose', 'that', 'the', 'parent', 'body', 'of', 'khatyrka', 'is', 'the', 'large', 'ktype', 'asteroid', '89', 'julia', 'based', 'on', 'its', 'peculiar', 'but', 'matching', 'reflectance', 'spectrum', 'evidence', 'for', 'an', 'impactshock', 'event', 'within', 'the', 'last', 'few', '100', 'ma', 'which', 'formed', 'the', 'julia', 'family', 'and', 'its', 'location', 'close', 'to', 'strong', 'orbital', 'resonances', 'so', 'that', 'the', 'khatyrka', 'meteoroid', 'could', 'plausibly', 'have', 'reached', 'earth', 'within', 'its', 'rather', 'short', 'cosmicray', 'exposure', 'age']] | [-0.06391720965527178, 0.18194927520224116, -0.11024486059222811, 0.053736469799762855, -0.0558152113808319, -0.07553464804290323, 0.03536846983416747, 0.39961363156876895, -0.21479628798401645, -0.370358375902538, 0.08189060304330172, -0.2988963133845759, -0.08157470589503646, 0.147590053892414, -0.06621574287106263, -0.01470686507383762, 0.06639602319500158, 0.027862307524198406, -0.037191670140757235, -0.26706510737741124, 0.22487096048350777, 0.07213325311882943, 0.1688224449991599, 0.041595229047215396, 0.054480626751037854, -0.10313148705178611, 0.016981271244535443, -0.026189166131199048, -0.1430921355676346, 0.08619498960693837, 0.2032325870647866, 0.12847029617662112, 0.19293245468138448, -0.4182087308174467, -0.20337764691982058, 0.08224089632952405, 0.12264465590577787, 0.020395681874448512, -0.06897434951859259, -0.2671854167285385, 0.11454979604346707, -0.19406905611326056, -0.14901390117943608, 0.05076224188150097, 0.10979912453080698, -0.006416679135278388, -0.18911444470887223, 0.07974888676757454, 0.04806979993853958, 0.1207299511128616, -0.1297484423811247, -0.17509377683870875, -0.08114335528244415, 0.07782774183133076, 0.07031475621155434, -0.0036719870598365865, 0.1535952103709782, -0.051200114881559726, -0.030643069600906743, 0.4184633736728355, -0.04463528239002992, -0.007544153985837775, 0.2700372465625806, -0.22167443879457535, -0.1229850097449236, 0.21483732363890096, 0.14622940786022653, 0.09567528258212993, -0.18388243485242128, -0.0006861793580189628, -0.047759414932149795, 0.17696634877438067, 0.10658316714413744, 0.02297397893703272, 0.2691540650182193, 0.1425436666148955, 0.0036988697998646286, 0.06953246133641079, -0.16424608976151547, -0.019175922260269204, -0.17609686708773778, -0.16918918311405645, -0.1495642653536252, 0.05837406771337633, -0.08352536954286431, -0.15932466383392532, 0.34950973283905057, 0.13057839933166943, 0.18670909989985726, -0.03777014623929356, 0.1905697120418672, 0.024963796435121786, 0.10017227156898909, 0.09298213954979895, 0.29535603404085164, 0.1244404814130957, 0.09445186710405734, -0.1784245251021999, 0.15743849969842041, -0.006940396993310862] |
1,803.03514 | Generalized distance domination problems and their complexity on graphs
of bounded mim-width | We generalize the family of $(\sigma, \rho)$-problems and locally checkable
vertex partition problems to their distance versions, which naturally captures
well-known problems such as distance-$r$ dominating set and distance-$r$
independent set. We show that these distance problems are XP parameterized by
the structural parameter mim-width, and hence polynomial on graph classes where
mim-width is bounded and quickly computable, such as $k$-trapezoid graphs,
Dilworth $k$-graphs, (circular) permutation graphs, interval graphs and their
complements, convex graphs and their complements, $k$-polygon graphs, circular
arc graphs, complements of $d$-degenerate graphs, and $H$-graphs if given an
$H$-representation. To supplement these findings, we show that many classes of
(distance) $(\sigma, \rho)$-problems are W[1]-hard parameterized by mim-width +
solution size.
| cs.CC cs.DM math.CO | we generalize the family of sigma rhoproblems and locally checkable vertex partition problems to their distance versions which naturally captures wellknown problems such as distancer dominating set and distancer independent set we show that these distance problems are xp parameterized by the structural parameter mimwidth and hence polynomial on graph classes where mimwidth is bounded and quickly computable such as ktrapezoid graphs dilworth kgraphs circular permutation graphs interval graphs and their complements convex graphs and their complements kpolygon graphs circular arc graphs complements of ddegenerate graphs and hgraphs if given an hrepresentation to supplement these findings we show that many classes of distance sigma rhoproblems are w1hard parameterized by mimwidth solution size | [['we', 'generalize', 'the', 'family', 'of', 'sigma', 'rhoproblems', 'and', 'locally', 'checkable', 'vertex', 'partition', 'problems', 'to', 'their', 'distance', 'versions', 'which', 'naturally', 'captures', 'wellknown', 'problems', 'such', 'as', 'distancer', 'dominating', 'set', 'and', 'distancer', 'independent', 'set', 'we', 'show', 'that', 'these', 'distance', 'problems', 'are', 'xp', 'parameterized', 'by', 'the', 'structural', 'parameter', 'mimwidth', 'and', 'hence', 'polynomial', 'on', 'graph', 'classes', 'where', 'mimwidth', 'is', 'bounded', 'and', 'quickly', 'computable', 'such', 'as', 'ktrapezoid', 'graphs', 'dilworth', 'kgraphs', 'circular', 'permutation', 'graphs', 'interval', 'graphs', 'and', 'their', 'complements', 'convex', 'graphs', 'and', 'their', 'complements', 'kpolygon', 'graphs', 'circular', 'arc', 'graphs', 'complements', 'of', 'ddegenerate', 'graphs', 'and', 'hgraphs', 'if', 'given', 'an', 'hrepresentation', 'to', 'supplement', 'these', 'findings', 'we', 'show', 'that', 'many', 'classes', 'of', 'distance', 'sigma', 'rhoproblems', 'are', 'w1hard', 'parameterized', 'by', 'mimwidth', 'solution', 'size']] | [-0.14368317721580917, 0.11153106932351048, 0.017578266476365654, 0.09190269010247323, -0.1608515283473852, -0.15875123333693905, 0.02489988229300996, 0.41883010704451323, -0.37602562484416097, -0.3219454005318271, 0.11579018516296691, -0.31030615549534557, -0.12885511546311054, 0.19533509074456312, -0.12623905428600582, 0.09765788575274531, 0.11394602046348154, 0.03569914058316499, 0.011393097686496647, -0.2847990419517208, 0.3319399796151133, -0.07568997900763696, 0.10987966140224174, 0.11064318890302358, 0.05835221020123837, 0.02347508096347817, -0.0048769996670836755, 0.18401530222459273, -0.21312962892870102, 0.08865361516787247, 0.29680612966079606, 0.22435090357526363, 0.1975217779844322, -0.3424516810612245, -0.15405482872473922, 0.24085631617768244, 0.12258658052411522, -0.0064042496886527675, 0.06543017355196008, -0.2510304532373663, 0.10207033370812, -0.07723111473658884, -0.07837784911759875, -0.03084357258101756, 0.11470279793509028, 0.04911451907458038, -0.2539568451317874, -0.0226456750607626, 0.1546961054036563, 0.02251569279892878, 0.05173243881118569, -0.20118117430670696, -0.025044535515321927, 0.06445493270135061, -0.07098186097150161, 0.06028714651580561, 0.06207228264009411, -0.07402518680107525, -0.21919918418438597, 0.3362404932664834, 0.031195916574109684, -0.18151640700684352, 0.15072175599211318, -0.08167494669217955, -0.2133715474808758, 0.06976500852033496, 0.14074498464099386, 0.17948346464810047, -0.07994599255987189, 0.18389240933042442, -0.13764613112011417, 0.1143477073108608, 0.16774232231757857, 0.017378484608012845, 0.08810768897475844, 0.08312970864671197, 0.17985843111369335, 0.1997235119475094, 0.07819090714381838, -0.031507096748629754, -0.2819178203999234, -0.02042865975844589, -0.20225648930592632, 0.012700265764512799, -0.2296686314566283, -0.24847262754020366, 0.402732195654376, 0.047974244225770235, 0.20245996078645642, 0.21642743097724054, 0.16083437827394598, 0.040460270651965405, 0.027366756844672966, 0.2158184706445106, 0.09915393964514475, 0.1794482563389465, -0.08165747041983361, -0.15177349041808735, 0.07940641941968352, 0.156378015694182] |
1,803.03515 | Ultralow-temperature heat transport in the quantum spin liquid candidate
Ca10Cr7O28 with bilayer kagome lattice | Recently, a novel material with bilayer kagome lattice
Ca$_{10}$Cr$_7$O$_{28}$ was proposed to be a gapless quantum spin liquid, due
to the lack of long-range magnetic order and the observation of broad diffuse
excitations. Here, we present the ultralow-temperature thermal conductivity
measurements on single crystals of Ca$_{10}$Cr$_7$O$_{28}$ to detect its
low-lying magnetic excitations. At finite temperatures, with increasing the
magnetic fields, the thermal conductivity exhibits a clear dip around 6 T,
which may correspond to a crossover in the magnetic ground state. At the
zero-temperature limit, no residual linear term is found at any fields,
indicating the absence of gapless itinerant fermionic excitations. Therefore,
if the spinons do exist, they are either localized or gapped. In the gapped
case, the fitting of our data gives a small gap $\Delta \sim$ 0.27(2) K. These
results put strong constraints on the theoretical description of the ground
state in this quantum spin liquid candidate.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.supr-con | recently a novel material with bilayer kagome lattice ca_10cr_7o_28 was proposed to be a gapless quantum spin liquid due to the lack of longrange magnetic order and the observation of broad diffuse excitations here we present the ultralowtemperature thermal conductivity measurements on single crystals of ca_10cr_7o_28 to detect its lowlying magnetic excitations at finite temperatures with increasing the magnetic fields the thermal conductivity exhibits a clear dip around 6 t which may correspond to a crossover in the magnetic ground state at the zerotemperature limit no residual linear term is found at any fields indicating the absence of gapless itinerant fermionic excitations therefore if the spinons do exist they are either localized or gapped in the gapped case the fitting of our data gives a small gap delta sim 0272 k these results put strong constraints on the theoretical description of the ground state in this quantum spin liquid candidate | [['recently', 'a', 'novel', 'material', 'with', 'bilayer', 'kagome', 'lattice', 'ca_10cr_7o_28', 'was', 'proposed', 'to', 'be', 'a', 'gapless', 'quantum', 'spin', 'liquid', 'due', 'to', 'the', 'lack', 'of', 'longrange', 'magnetic', 'order', 'and', 'the', 'observation', 'of', 'broad', 'diffuse', 'excitations', 'here', 'we', 'present', 'the', 'ultralowtemperature', 'thermal', 'conductivity', 'measurements', 'on', 'single', 'crystals', 'of', 'ca_10cr_7o_28', 'to', 'detect', 'its', 'lowlying', 'magnetic', 'excitations', 'at', 'finite', 'temperatures', 'with', 'increasing', 'the', 'magnetic', 'fields', 'the', 'thermal', 'conductivity', 'exhibits', 'a', 'clear', 'dip', 'around', '6', 't', 'which', 'may', 'correspond', 'to', 'a', 'crossover', 'in', 'the', 'magnetic', 'ground', 'state', 'at', 'the', 'zerotemperature', 'limit', 'no', 'residual', 'linear', 'term', 'is', 'found', 'at', 'any', 'fields', 'indicating', 'the', 'absence', 'of', 'gapless', 'itinerant', 'fermionic', 'excitations', 'therefore', 'if', 'the', 'spinons', 'do', 'exist', 'they', 'are', 'either', 'localized', 'or', 'gapped', 'in', 'the', 'gapped', 'case', 'the', 'fitting', 'of', 'our', 'data', 'gives', 'a', 'small', 'gap', 'delta', 'sim', '0272', 'k', 'these', 'results', 'put', 'strong', 'constraints', 'on', 'the', 'theoretical', 'description', 'of', 'the', 'ground', 'state', 'in', 'this', 'quantum', 'spin', 'liquid', 'candidate']] | [-0.18310506609443108, 0.26017393003295486, -0.06064162154992422, 0.018559799575596118, -0.06408052408757309, -0.15461950461690624, 0.08020812083501369, 0.35284610129892824, -0.22834118541155476, -0.28130964626868565, 0.02568709022908782, -0.3563346339513858, -0.05666491797969987, 0.12379976880775455, 0.05764953479170799, 0.0014918902574572713, -0.015138296806253494, 0.03326357403886505, -0.1153930896652552, -0.19594506437735013, 0.2481440793373622, 0.0031034798671801885, 0.29224952202445514, 0.12019262480239074, 0.03964770992829775, -0.023031093928342065, 0.12443476758858499, 0.005751079550633828, -0.14416414281353354, 0.022355247285837928, 0.2595715456766387, -0.11393625455365206, 0.16474489346146584, -0.43881431374077995, -0.2172544561078151, 0.07782726036384702, 0.14001544162786256, 0.15676650767525038, -0.033672003601677714, -0.29107670405103514, 0.047377094899614655, -0.14471346794627607, -0.1522228402396043, -0.12826199251731546, -0.025434446221527955, -0.07467094591857555, -0.21768104657841225, 0.14117443068263433, 0.10259498644154519, 0.1004248170593443, -0.10277166056330315, -0.12142607291849951, -0.07213249312248081, 0.04832013699070861, 0.04039679486770183, 0.0706206801502655, 0.12173579270330569, -0.16069258224995187, -0.11808297293260693, 0.34524764797960716, -0.06445295914153878, -0.10162265988377234, 0.21445673974851767, -0.1892488597255821, -0.11692811728299905, 0.20993400839467843, 0.08906357326506016, 0.0682614274478207, -0.10568637588798689, 0.08064427221775987, -0.05377805405762046, 0.20065563870904346, -0.019144655386917293, 0.10496301981077219, 0.3255612278915942, 0.15442012978096803, 0.03893473215556393, 0.1487008077224406, -0.1582483680267857, -0.06387812168337405, -0.2626628012706836, -0.13547383937092186, -0.24247952388599514, 0.08049632154288702, -0.03620816618504857, -0.21958514764904977, 0.3931628296617419, 0.13755864155245945, 0.16598254209694763, -0.029808673975834, 0.22522335848150155, 0.13041583337821067, 0.07096794939599932, 0.08469977157345662, 0.2662152911846836, 0.17094892567644518, 0.1108897942615052, -0.3023831294783546, 0.014670063145458698, -0.02185475645586848] |
1,803.03516 | Simulation of Gaussian channels via teleportation and error correction
of Gaussian states | Gaussian channels are the typical way to model the decoherence introduced by
the environment in continuous-variable quantum states. It is known that those
channels can be simulated by a teleportation protocol using as a resource state
either a maximally entangled state passing through the same channel, i.e., the
Choi-state, or a state that is entangled at least as much as the Choi-state.
Since the construction of the Choi-state requires infinite mean energy and
entanglement, i.e. it is unphysical, we derive instead every physical state
able to simulate a given channel through teleportation with finite resources,
and we further find the optimal ones, i.e., the resource states that require
the minimum energy and entanglement. We show that the optimal resource states
are pure and equally entangled to the Choi-state as measured by the
entanglement of formation. We also show that the same amount of entanglement is
enough to simulate an equally decohering channel, while even more entanglement
can simulate less decohering channels. We, finally, use that fact to generalize
a previously known error correction protocol by making it able to correct noise
coming not only from pure loss but from thermal loss channels as well.
| quant-ph | gaussian channels are the typical way to model the decoherence introduced by the environment in continuousvariable quantum states it is known that those channels can be simulated by a teleportation protocol using as a resource state either a maximally entangled state passing through the same channel ie the choistate or a state that is entangled at least as much as the choistate since the construction of the choistate requires infinite mean energy and entanglement ie it is unphysical we derive instead every physical state able to simulate a given channel through teleportation with finite resources and we further find the optimal ones ie the resource states that require the minimum energy and entanglement we show that the optimal resource states are pure and equally entangled to the choistate as measured by the entanglement of formation we also show that the same amount of entanglement is enough to simulate an equally decohering channel while even more entanglement can simulate less decohering channels we finally use that fact to generalize a previously known error correction protocol by making it able to correct noise coming not only from pure loss but from thermal loss channels as well | [['gaussian', 'channels', 'are', 'the', 'typical', 'way', 'to', 'model', 'the', 'decoherence', 'introduced', 'by', 'the', 'environment', 'in', 'continuousvariable', 'quantum', 'states', 'it', 'is', 'known', 'that', 'those', 'channels', 'can', 'be', 'simulated', 'by', 'a', 'teleportation', 'protocol', 'using', 'as', 'a', 'resource', 'state', 'either', 'a', 'maximally', 'entangled', 'state', 'passing', 'through', 'the', 'same', 'channel', 'ie', 'the', 'choistate', 'or', 'a', 'state', 'that', 'is', 'entangled', 'at', 'least', 'as', 'much', 'as', 'the', 'choistate', 'since', 'the', 'construction', 'of', 'the', 'choistate', 'requires', 'infinite', 'mean', 'energy', 'and', 'entanglement', 'ie', 'it', 'is', 'unphysical', 'we', 'derive', 'instead', 'every', 'physical', 'state', 'able', 'to', 'simulate', 'a', 'given', 'channel', 'through', 'teleportation', 'with', 'finite', 'resources', 'and', 'we', 'further', 'find', 'the', 'optimal', 'ones', 'ie', 'the', 'resource', 'states', 'that', 'require', 'the', 'minimum', 'energy', 'and', 'entanglement', 'we', 'show', 'that', 'the', 'optimal', 'resource', 'states', 'are', 'pure', 'and', 'equally', 'entangled', 'to', 'the', 'choistate', 'as', 'measured', 'by', 'the', 'entanglement', 'of', 'formation', 'we', 'also', 'show', 'that', 'the', 'same', 'amount', 'of', 'entanglement', 'is', 'enough', 'to', 'simulate', 'an', 'equally', 'decohering', 'channel', 'while', 'even', 'more', 'entanglement', 'can', 'simulate', 'less', 'decohering', 'channels', 'we', 'finally', 'use', 'that', 'fact', 'to', 'generalize', 'a', 'previously', 'known', 'error', 'correction', 'protocol', 'by', 'making', 'it', 'able', 'to', 'correct', 'noise', 'coming', 'not', 'only', 'from', 'pure', 'loss', 'but', 'from', 'thermal', 'loss', 'channels', 'as', 'well']] | [-0.10778734635516099, 0.19940818055629186, -0.11011652222872932, 0.08677268594313778, 0.015044443359713732, -0.22409392804502673, 0.08188711700735364, 0.37684887189048427, -0.26889099789298493, -0.29698622674133973, 0.11191723025439922, -0.25414944675357376, -0.09131532013608315, 0.17383437340037378, -0.06133420636202929, 0.08443837592704702, 0.08307473489068948, 0.06271623245430823, -0.02785538172843799, -0.24538228377104573, 0.311230593417968, 0.08492484295287064, 0.282675503474689, 0.032980849076489696, 0.09181538881186742, 0.011141771573054883, 0.02402924895394574, -0.017855942890782524, -0.06679205662808226, 0.03864215363384724, 0.2574141468845558, 0.14406516725562282, 0.23045934467893286, -0.41351351844427087, -0.25077012767784235, 0.13211740305606448, 0.14715834292727187, 0.19598232066983684, -0.008064035569649483, -0.2729255126635592, 0.04413516652655125, -0.21634144512648434, -0.07273157207372109, -0.08852438759970833, -0.004614361301400536, -0.051936873679166926, -0.2745599886378485, 0.09539689592517235, 0.04292599341085603, -0.04476421081806658, -0.007133413361836724, -0.0660074178847129, -0.06578077609319546, 0.14167361348098115, -0.04600270981984405, 0.009320228504612274, 0.13710491514744325, -0.14263801120063194, -0.13784765537597776, 0.3482882732275835, -0.04388771310404241, -0.21820096735429673, 0.2007103434355195, -0.10441313331620287, -0.04150074978656683, 0.09467800913052153, 0.11752814416696807, 0.09701406605752934, -0.15375838772460973, -0.0019689233236725337, -0.03727581491213791, 0.2148382609395656, 0.045697598835722227, 0.14735032524433486, 0.1472721398548828, 0.06453916646921815, 0.11270890157362543, 0.21796737784476586, -0.059551134398303084, -0.13196300678723252, -0.3148021414016671, -0.1651802944133752, -0.24594447634317287, 0.09697030009781359, -0.019592485630335093, -0.10109663228012294, 0.3497973445265256, 0.13428873796323218, 0.16770247321998336, 0.06863094593119837, 0.31616871650978806, 0.08759385847772193, 0.07842710382813953, 0.1478439177177635, 0.2364898767255093, 0.12228609806829199, 0.04401461067297448, -0.2266369705213253, 0.1009033874286934, -0.0355630231272314] |
1,803.03517 | Axion energy density, bottle neck period, and $\bar{\theta}$ ratios
between early and late times | The possibility of the "invisible" axion being cold dark matter relies on the
acceptable estimates of the current axion energy density. The estimate depends
on the nature of QCD phase transition at a few hundred MeV and the evolution of
the misalignment angle $\bar{\theta}$. The onset of $\bar{\theta}$ oscillation
undergoes a bottleneck period which occurred during the QCD phase transition.
In addition, the anharmonic coupling of order $a^4$ affects the $\bar{\theta}$
evolution. From the time that the anharmonic effect is negligible, it is rather
simple to calculate the ratio of $\bar{\theta}$'s between early and late times.
For multi GHz oscillations, the current age of the Universe needs at least
$10^{27}$ oscillations which limits an exact calculation of $\bar{\theta}$ . We
establish a stepwise approximation for numerical solutions of the differential
equation and obtain $\bar{\theta}_{\rm now}/\bar{\theta}_f\approx 3\times
10^{-17}$ for $m_a\simeq 10^{-4}\,$eV, where $t_f$ is the first time that the
full hadronic phase (after the QCD phase transition) was established.
| hep-ph astro-ph.CO hep-ex hep-lat | the possibility of the invisible axion being cold dark matter relies on the acceptable estimates of the current axion energy density the estimate depends on the nature of qcd phase transition at a few hundred mev and the evolution of the misalignment angle bartheta the onset of bartheta oscillation undergoes a bottleneck period which occurred during the qcd phase transition in addition the anharmonic coupling of order a4 affects the bartheta evolution from the time that the anharmonic effect is negligible it is rather simple to calculate the ratio of barthetas between early and late times for multi ghz oscillations the current age of the universe needs at least 1027 oscillations which limits an exact calculation of bartheta we establish a stepwise approximation for numerical solutions of the differential equation and obtain bartheta_rm nowbartheta_fapprox 3times 1017 for m_asimeq 104ev where t_f is the first time that the full hadronic phase after the qcd phase transition was established | [['the', 'possibility', 'of', 'the', 'invisible', 'axion', 'being', 'cold', 'dark', 'matter', 'relies', 'on', 'the', 'acceptable', 'estimates', 'of', 'the', 'current', 'axion', 'energy', 'density', 'the', 'estimate', 'depends', 'on', 'the', 'nature', 'of', 'qcd', 'phase', 'transition', 'at', 'a', 'few', 'hundred', 'mev', 'and', 'the', 'evolution', 'of', 'the', 'misalignment', 'angle', 'bartheta', 'the', 'onset', 'of', 'bartheta', 'oscillation', 'undergoes', 'a', 'bottleneck', 'period', 'which', 'occurred', 'during', 'the', 'qcd', 'phase', 'transition', 'in', 'addition', 'the', 'anharmonic', 'coupling', 'of', 'order', 'a4', 'affects', 'the', 'bartheta', 'evolution', 'from', 'the', 'time', 'that', 'the', 'anharmonic', 'effect', 'is', 'negligible', 'it', 'is', 'rather', 'simple', 'to', 'calculate', 'the', 'ratio', 'of', 'barthetas', 'between', 'early', 'and', 'late', 'times', 'for', 'multi', 'ghz', 'oscillations', 'the', 'current', 'age', 'of', 'the', 'universe', 'needs', 'at', 'least', '1027', 'oscillations', 'which', 'limits', 'an', 'exact', 'calculation', 'of', 'bartheta', 'we', 'establish', 'a', 'stepwise', 'approximation', 'for', 'numerical', 'solutions', 'of', 'the', 'differential', 'equation', 'and', 'obtain', 'bartheta_rm', 'nowbartheta_fapprox', '3times', '1017', 'for', 'm_asimeq', '104ev', 'where', 't_f', 'is', 'the', 'first', 'time', 'that', 'the', 'full', 'hadronic', 'phase', 'after', 'the', 'qcd', 'phase', 'transition', 'was', 'established']] | [-0.16613481195595164, 0.2386987153600407, -0.0720439017720085, 0.0762849913497286, -0.0583988470019691, -0.06274894284169105, 0.07973554345035272, 0.28957096736442733, -0.20858210769735955, -0.31117044389247894, 0.10208621855096456, -0.26327659628753153, -0.04912914508876584, 0.1356673089986933, 0.07516406079173668, 0.011733530970689441, 0.002520064581427481, 0.059558621589578205, -0.12881235618071704, -0.1929725293992707, 0.26254381493789253, 0.07165327526677351, 0.2228891986162196, 0.07654426676862232, 0.11724089022858866, -0.06547143025870485, 0.010533878802172174, -0.11597412533441244, -0.15696013064111217, -0.012305030925804145, 0.1723676601775571, 0.04212205970883611, 0.19482753800331046, -0.40808726340387164, -0.163641681063122, 0.12584183095537077, 0.13689338407470156, 0.09825435477354663, -0.008634091727775763, -0.26729580916180096, 0.034294212324689925, -0.1488279079846046, -0.13718212949861955, -0.0190536320185313, 0.036951291217625915, -0.03908344606155312, -0.28571789382197954, 0.17075082160798566, -0.026910873347675647, -0.0296309299906111, -0.059883792358511066, -0.11522139107518188, -0.001437602053674591, 0.055969460598229395, 0.08803389100252058, 0.07687790291202436, 0.14653151809213708, -0.13789273979892205, -0.05100815278302588, 0.4182201279478462, -0.0991540699993115, -0.05406378092419646, 0.11691605433059687, -0.17928273285974977, -0.1203952492486879, 0.1956087585229445, 0.11782029450889193, 0.09504820162720688, -0.10397082274513585, 0.10448390479364383, 0.03769611041348839, 0.22149859718122678, 0.06983903095023344, 0.01867715320126577, 0.2436495903129508, 0.20217588615328583, 0.022501276553511716, 0.06915842924363814, -0.09944126410591235, -0.11995271765687443, -0.3535109230516745, -0.10508032526077049, -0.14715347211587232, 0.07569420036357864, -0.14524922839355695, -0.14335172687197564, 0.40779854897288725, 0.14274433852995855, 0.2145271673556659, 0.02253740946248222, 0.2984897049428145, 0.14714607983440547, 0.020332353201399214, 0.029541980347574565, 0.3425988837254125, 0.16042752488359036, 0.1420401432370017, -0.3054389976004332, 0.0564868111320614, 0.06681726694518289] |
1,803.03518 | Subcovers and codes on the $X_{n,r}$ curves | In this work, subcovers $\mathcal{X}_{n,r}^s$ of the curve
$\mathcal{X}_{n,r}$ are constructed, the Weierstrass semigroup $H(P_\infty)$ at
the point $P_\infty \in \mathcal{X}_{n,r}^s$ is determined and the
corresponding one-point AG codes are investigated. Codes establishing new
records on the parameters with respect to the previously known ones are
discovered, and $108$ improvements on MinT tables are obtained.
| math.AG | in this work subcovers mathcalx_nrs of the curve mathcalx_nr are constructed the weierstrass semigroup hp_infty at the point p_infty in mathcalx_nrs is determined and the corresponding onepoint ag codes are investigated codes establishing new records on the parameters with respect to the previously known ones are discovered and 108 improvements on mint tables are obtained | [['in', 'this', 'work', 'subcovers', 'mathcalx_nrs', 'of', 'the', 'curve', 'mathcalx_nr', 'are', 'constructed', 'the', 'weierstrass', 'semigroup', 'hp_infty', 'at', 'the', 'point', 'p_infty', 'in', 'mathcalx_nrs', 'is', 'determined', 'and', 'the', 'corresponding', 'onepoint', 'ag', 'codes', 'are', 'investigated', 'codes', 'establishing', 'new', 'records', 'on', 'the', 'parameters', 'with', 'respect', 'to', 'the', 'previously', 'known', 'ones', 'are', 'discovered', 'and', '108', 'improvements', 'on', 'mint', 'tables', 'are', 'obtained']] | [-0.1371526301596672, 0.08320775709356755, -0.05121735796833841, 0.10561044191798338, -0.005837358543291115, -0.13182794780900273, 0.03751391982838798, 0.3709748016240505, -0.27903689590032, -0.28151180655717883, 0.14521579787833616, -0.35378896072506905, -0.08827686193399131, 0.29572497182883895, -0.10223449625146504, 0.06303867951814587, 0.053295708395755634, 0.07624268884627292, -0.1610966489668219, -0.31945354969670564, 0.3221192841167347, 0.08087398450320157, 0.22971325398136216, -0.019635901249085482, 0.03854022536408873, -0.04884682029772263, -0.1074855863295782, -0.04399973054667218, -0.21726102066727784, 0.10943506471812725, 0.22977757593616843, 0.08397514273663266, 0.10557978926226497, -0.32509624169996154, -0.19409562850621745, 0.08240538871569487, 0.0955933290712822, 0.06320402450644626, -0.01043536998062896, -0.2495337211741851, 0.15020615650484195, -0.1291589041849455, -0.12049948647080992, -0.03347607474559201, 0.01886568520253954, 0.06730975864383464, -0.23267402826772574, -0.0015311488039934863, 0.026579670894604463, 0.12373157353767265, -0.017182988168385167, -0.19534169162551945, -0.06583120642552295, 0.10042977232772571, 0.011872839509473683, 0.05530138774058567, 0.07876593768238448, -0.056080336382505126, -0.1135743697747015, 0.33312361390114975, -0.013295343432288904, -0.15481641744610478, 0.15004023175256756, -0.13064732699869916, -0.10879625797343369, 0.13359229338283723, 0.10953442151479137, 0.1340322918437708, -0.15232137284384897, 0.1328056679765443, -0.06682386479447953, 0.08952468107376123, 0.10367132653482258, 0.029271911220768325, 0.13712426006364134, 0.06639872704937051, -0.030798222654714033, 0.1285601276008842, -0.042020632965991705, -0.08922329955161191, -0.28313617687672377, -0.097165688388766, -0.18788640331835127, 0.017198126727285292, -0.076305328563299, -0.14300027421380107, 0.4000973955083352, 0.08958534991297011, 0.20286835444410548, 0.06962237492776834, 0.1616942434070202, 0.11583476116021092, 0.0741765802153028, 0.1311541429380528, 0.2126043890423786, 0.13720101134206814, 0.01585809387660657, -0.16530853399868087, 0.09076755104335742, 0.1378344232753779] |
1,803.03519 | Calder\'on cavities inverse problem as a shape-from-moments problem | In this paper, we address a particular case of Calder\'on's (or conductivity)
inverse problem in dimension two, namely the case of a homogeneous background
containing a finite number of cavities (i.e. heterogeneities of infinitely high
conductivities). We aim to recover the location and the shape of the cavities
from the knowledge of the Dirichlet-to-Neumann (DtN) map of the problem. The
proposed reconstruction method is non iterative and uses two main ingredients.
First, we show how to compute the so-called generalized P\'olia-Szeg\"o tensors
(GPST) of the cavities from the DtN of the cavities. Secondly, we show that the
obtained shape from GPST inverse problem can be transformed into a shape from
moments problem, for some particular configurations. However, numerical results
suggest that the reconstruction method is efficient for arbitrary geometries.
| math.AP | in this paper we address a particular case of calderons or conductivity inverse problem in dimension two namely the case of a homogeneous background containing a finite number of cavities ie heterogeneities of infinitely high conductivities we aim to recover the location and the shape of the cavities from the knowledge of the dirichlettoneumann dtn map of the problem the proposed reconstruction method is non iterative and uses two main ingredients first we show how to compute the socalled generalized poliaszego tensors gpst of the cavities from the dtn of the cavities secondly we show that the obtained shape from gpst inverse problem can be transformed into a shape from moments problem for some particular configurations however numerical results suggest that the reconstruction method is efficient for arbitrary geometries | [['in', 'this', 'paper', 'we', 'address', 'a', 'particular', 'case', 'of', 'calderons', 'or', 'conductivity', 'inverse', 'problem', 'in', 'dimension', 'two', 'namely', 'the', 'case', 'of', 'a', 'homogeneous', 'background', 'containing', 'a', 'finite', 'number', 'of', 'cavities', 'ie', 'heterogeneities', 'of', 'infinitely', 'high', 'conductivities', 'we', 'aim', 'to', 'recover', 'the', 'location', 'and', 'the', 'shape', 'of', 'the', 'cavities', 'from', 'the', 'knowledge', 'of', 'the', 'dirichlettoneumann', 'dtn', 'map', 'of', 'the', 'problem', 'the', 'proposed', 'reconstruction', 'method', 'is', 'non', 'iterative', 'and', 'uses', 'two', 'main', 'ingredients', 'first', 'we', 'show', 'how', 'to', 'compute', 'the', 'socalled', 'generalized', 'poliaszego', 'tensors', 'gpst', 'of', 'the', 'cavities', 'from', 'the', 'dtn', 'of', 'the', 'cavities', 'secondly', 'we', 'show', 'that', 'the', 'obtained', 'shape', 'from', 'gpst', 'inverse', 'problem', 'can', 'be', 'transformed', 'into', 'a', 'shape', 'from', 'moments', 'problem', 'for', 'some', 'particular', 'configurations', 'however', 'numerical', 'results', 'suggest', 'that', 'the', 'reconstruction', 'method', 'is', 'efficient', 'for', 'arbitrary', 'geometries']] | [-0.09398835448389367, 0.04704441289893936, -0.05687881152275517, 0.02445647857321585, -0.05144273987682464, -0.08647065795958042, -0.018830603702434216, 0.3725249573999886, -0.3071831084296916, -0.25606348745293855, 0.12391290202007679, -0.28318232647323793, -0.1911564876574503, 0.19952743224142652, -0.03863275665410816, 0.06780848607363164, 0.045180297638975485, 0.023601672734863074, -0.09508265852350598, -0.18748703288535276, 0.37097581898678067, -0.006430380911360559, 0.2859621162223088, 0.05968089525898298, 0.11904568718782402, -0.010429970746816591, -0.011045618733578875, 0.0533176461133615, -0.10882838811536316, 0.14656347325143887, 0.2377767580770707, 0.09277945610535757, 0.22415373555218526, -0.4229212765430295, -0.2094761249681487, 0.12426214222254794, 0.1520609432080573, 0.12431088944738225, -0.04155234470169327, -0.23486141730894067, 0.09059443572209426, -0.12844510278447943, -0.1504126775201208, -0.03597905465343953, -0.04939908070792986, 0.005731097105782219, -0.2871259045895449, 0.07079238326166028, 0.09860714467227921, -0.013204041530934069, -0.11222185122296792, -0.09566305507905781, 0.04772581117834116, 0.12105735030490905, 0.008536866158535775, -0.024138304834477892, 0.07546977904921238, -0.12774029455387734, -0.09979032196985312, 0.3724010400726756, -0.03083057283033985, -0.23564661338983117, 0.14852870231568308, -0.13722085371584625, -0.11931385631247084, 0.12194791977481498, 0.1814245374830076, 0.14715525710796432, -0.12620965527847064, 0.09358960774081015, -0.053478965237953285, 0.1542914129808083, 0.0794551678059637, -0.02956340135284519, 0.1424383831087702, 0.12519164831384785, 0.09873414574941808, 0.22839330653605852, -0.09258336508840632, -0.04080631180355946, -0.29435373182848906, -0.1407410551021381, -0.21063651951650778, 0.042205928832061534, -0.10695992535419668, -0.17987533137491046, 0.39857272457244786, 0.15977284084110296, 0.2164552641469379, 0.035752361488723475, 0.30613254588241723, 0.09026780490611874, 0.0260190916132153, 0.0775569927456334, 0.20377337486170008, 0.1367783786245268, 0.07602819287247031, -0.23335241279456503, 0.017726359693983267, 0.1148529060098321] |
1,803.0352 | On new types of fractional operators and applications | We introduce two kinds of fractional integral operators; the one is defined
via the exponential-integral function $$ E_1(x)=\int_x^\infty
\frac{e^{-t}}{t}\,dt,\quad x>0, $$ and the other is defined via the special
function $$ \mathcal{S}(x)=e^{-x} \int_0^\infty
\frac{x^{s-1}}{\Gamma(s)}\,ds,\quad x>0. $$ We establish different properties
of these operators, and we study the relationship between the fractional
integrals of first kind and the fractional integrals of second kind. Next, we
introduce a new concept of fractional derivative of order $\alpha>0$, which is
defined via the fractional integral of first kind. Using an approximate
identity argument, we show that the introduced fractional derivative converges
to the standard derivative in $L^1$ space, as $\alpha\to 0^+$. Several other
properties are studied, like fractional integration by parts, the relationship
between this fractional derivative and the fractional integral of second kind,
etc. As an application, we consider a new fractional model of the relaxation
equation, we establish an existence and uniqueness result for this model, and
provide an iterative algorithm that converges to the solution.
| math.CA | we introduce two kinds of fractional integral operators the one is defined via the exponentialintegral function e_1xint_xinfty fracettdtquad x0 and the other is defined via the special function mathcalsxex int_0infty fracxs1gammasdsquad x0 we establish different properties of these operators and we study the relationship between the fractional integrals of first kind and the fractional integrals of second kind next we introduce a new concept of fractional derivative of order alpha0 which is defined via the fractional integral of first kind using an approximate identity argument we show that the introduced fractional derivative converges to the standard derivative in l1 space as alphato 0 several other properties are studied like fractional integration by parts the relationship between this fractional derivative and the fractional integral of second kind etc as an application we consider a new fractional model of the relaxation equation we establish an existence and uniqueness result for this model and provide an iterative algorithm that converges to the solution | [['we', 'introduce', 'two', 'kinds', 'of', 'fractional', 'integral', 'operators', 'the', 'one', 'is', 'defined', 'via', 'the', 'exponentialintegral', 'function', 'e_1xint_xinfty', 'fracettdtquad', 'x0', 'and', 'the', 'other', 'is', 'defined', 'via', 'the', 'special', 'function', 'mathcalsxex', 'int_0infty', 'fracxs1gammasdsquad', 'x0', 'we', 'establish', 'different', 'properties', 'of', 'these', 'operators', 'and', 'we', 'study', 'the', 'relationship', 'between', 'the', 'fractional', 'integrals', 'of', 'first', 'kind', 'and', 'the', 'fractional', 'integrals', 'of', 'second', 'kind', 'next', 'we', 'introduce', 'a', 'new', 'concept', 'of', 'fractional', 'derivative', 'of', 'order', 'alpha0', 'which', 'is', 'defined', 'via', 'the', 'fractional', 'integral', 'of', 'first', 'kind', 'using', 'an', 'approximate', 'identity', 'argument', 'we', 'show', 'that', 'the', 'introduced', 'fractional', 'derivative', 'converges', 'to', 'the', 'standard', 'derivative', 'in', 'l1', 'space', 'as', 'alphato', '0', 'several', 'other', 'properties', 'are', 'studied', 'like', 'fractional', 'integration', 'by', 'parts', 'the', 'relationship', 'between', 'this', 'fractional', 'derivative', 'and', 'the', 'fractional', 'integral', 'of', 'second', 'kind', 'etc', 'as', 'an', 'application', 'we', 'consider', 'a', 'new', 'fractional', 'model', 'of', 'the', 'relaxation', 'equation', 'we', 'establish', 'an', 'existence', 'and', 'uniqueness', 'result', 'for', 'this', 'model', 'and', 'provide', 'an', 'iterative', 'algorithm', 'that', 'converges', 'to', 'the', 'solution']] | [-0.14278803064893836, 0.041863522340486854, -0.07948695960490462, 0.0830510153042642, -0.11892948810381289, -0.07555945100597082, 0.011781153248217052, 0.31826575611455316, -0.3491717941390398, -0.2650476286235528, 0.14323574131972586, -0.283875285643332, -0.2057235229936524, 0.16619834458777824, -0.03266295130985478, 0.05067229965247978, -0.04193213598269862, 0.04343234538567067, -0.11728589125992492, -0.19234406360789227, 0.366872570465486, -0.05954662748636343, 0.16773185157217085, 0.021818656826582856, 0.14787668405840984, 0.005743105268219295, -0.04914081555743439, -0.037297281995005246, -0.20945978550382557, 0.13654560926788223, 0.15774587824051148, 0.037933592517406516, 0.33069838791225964, -0.40423223034789163, -0.15775697265202418, 0.13836729280853596, 0.09058170985036458, 0.0007938794987216496, -0.019944285920176368, -0.28545861933022165, 0.07371819734376353, -0.1626920365035916, -0.18806070685744858, -0.09646610160826896, 0.02329944432951892, 0.07677031338710386, -0.28102862962688774, 0.12395010311872913, 0.07677479640234453, -0.011372712375118565, -0.10064303184537074, -0.13487870807055002, 0.016681563273334924, 0.09855830244337901, 0.04440892245605564, 0.015120690307902316, 0.014882308478729848, -0.10862792870447709, -0.1694293696916877, 0.31934865857832706, -0.13157980508120276, -0.2595130930869625, 0.11405899766116188, -0.14784834960935256, -0.1500530236024553, 0.05755868047274886, 0.11057338621527052, 0.19664458627961814, -0.16313759236333844, 0.09673826413554473, -0.03268166995034195, 0.11826173342071855, 0.06850167853124918, 0.06114963277613219, 0.09615982901931812, 0.13564652100336763, 0.13946412447004172, 0.21678267515828617, -0.07857933872116682, -0.12556934356987953, -0.37863703766383994, -0.26213266372901556, -0.19904588433937767, 0.04644828459295707, -0.09504571228936608, -0.16796106972301808, 0.3607619462552695, 0.13383311827261096, 0.16545231868095028, 0.07148820381590691, 0.23472334168260345, 0.2743053361340665, 0.005440822327867723, 0.011014135336527267, 0.15101549743065754, 0.12585973047997612, 0.1271762712381016, -0.21045937871550008, 0.026613497639071938, 0.184146015248142] |
1,803.03521 | Multiple spectator condensates from inflation | We investigate the development of spectator (light test) field condensates
due to their quantum fluctuations in a de Sitter inflationary background,
making use of the stochastic formalism to describe the system. In this context,
a condensate refers to the typical field value found after coarse-graining
using the Hubble scale $H$, which can be essential to seed the initial
conditions required by various post-inflationary processes. We study models
with multiple coupled spectators and for the first time we demonstrate that new
forms of stationary solution exist (distinct from the standard exponential
form) when the potential is asymmetric. Furthermore, we find a critical value
for the inter-field coupling as a function of the number of fields above which
the formation of stationary condensates collapses to $H$. Considering some
simple two-field example potentials, we are also able to derive a lower limit
on the coupling, below which the fluctuations are effectively decoupled, and
the standard stationary variance formulae for each field separately can be
trusted. These results are all numerically verified by a new publicly available
python class (https://github.com/umbralcalc/nfield) to solve the coupled
Langevin equations over a large number of fields, realisations and timescales.
Further applications of this new tool are also discussed.
| gr-qc hep-ph hep-th | we investigate the development of spectator light test field condensates due to their quantum fluctuations in a de sitter inflationary background making use of the stochastic formalism to describe the system in this context a condensate refers to the typical field value found after coarsegraining using the hubble scale h which can be essential to seed the initial conditions required by various postinflationary processes we study models with multiple coupled spectators and for the first time we demonstrate that new forms of stationary solution exist distinct from the standard exponential form when the potential is asymmetric furthermore we find a critical value for the interfield coupling as a function of the number of fields above which the formation of stationary condensates collapses to h considering some simple twofield example potentials we are also able to derive a lower limit on the coupling below which the fluctuations are effectively decoupled and the standard stationary variance formulae for each field separately can be trusted these results are all numerically verified by a new publicly available python class httpsgithubcomumbralcalcnfield to solve the coupled langevin equations over a large number of fields realisations and timescales further applications of this new tool are also discussed | [['we', 'investigate', 'the', 'development', 'of', 'spectator', 'light', 'test', 'field', 'condensates', 'due', 'to', 'their', 'quantum', 'fluctuations', 'in', 'a', 'de', 'sitter', 'inflationary', 'background', 'making', 'use', 'of', 'the', 'stochastic', 'formalism', 'to', 'describe', 'the', 'system', 'in', 'this', 'context', 'a', 'condensate', 'refers', 'to', 'the', 'typical', 'field', 'value', 'found', 'after', 'coarsegraining', 'using', 'the', 'hubble', 'scale', 'h', 'which', 'can', 'be', 'essential', 'to', 'seed', 'the', 'initial', 'conditions', 'required', 'by', 'various', 'postinflationary', 'processes', 'we', 'study', 'models', 'with', 'multiple', 'coupled', 'spectators', 'and', 'for', 'the', 'first', 'time', 'we', 'demonstrate', 'that', 'new', 'forms', 'of', 'stationary', 'solution', 'exist', 'distinct', 'from', 'the', 'standard', 'exponential', 'form', 'when', 'the', 'potential', 'is', 'asymmetric', 'furthermore', 'we', 'find', 'a', 'critical', 'value', 'for', 'the', 'interfield', 'coupling', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'fields', 'above', 'which', 'the', 'formation', 'of', 'stationary', 'condensates', 'collapses', 'to', 'h', 'considering', 'some', 'simple', 'twofield', 'example', 'potentials', 'we', 'are', 'also', 'able', 'to', 'derive', 'a', 'lower', 'limit', 'on', 'the', 'coupling', 'below', 'which', 'the', 'fluctuations', 'are', 'effectively', 'decoupled', 'and', 'the', 'standard', 'stationary', 'variance', 'formulae', 'for', 'each', 'field', 'separately', 'can', 'be', 'trusted', 'these', 'results', 'are', 'all', 'numerically', 'verified', 'by', 'a', 'new', 'publicly', 'available', 'python', 'class', 'httpsgithubcomumbralcalcnfield', 'to', 'solve', 'the', 'coupled', 'langevin', 'equations', 'over', 'a', 'large', 'number', 'of', 'fields', 'realisations', 'and', 'timescales', 'further', 'applications', 'of', 'this', 'new', 'tool', 'are', 'also', 'discussed']] | [-0.11956153503717415, 0.16733957651901513, -0.0818869700636621, 0.09091691322444503, -0.058840453256174326, -0.12929724254251992, -0.01210186201505756, 0.32977872688192217, -0.2586537711544608, -0.2926387206169229, 0.1012251861118501, -0.21246201346333526, -0.12152654846109937, 0.20428075816777147, 0.006006384304673154, 0.04617671293660474, 0.027923705818859307, 0.036319883262981946, -0.029061357681428892, -0.25462292244976115, 0.34239117346292164, 0.0328576232232949, 0.2584804963863375, 0.03188786563000188, 0.08494185970162496, -0.036989924288471816, 0.0026134769800797704, 0.03309687563269657, -0.15469204326618455, 0.06785023401505384, 0.20384991826716914, 0.10905791627917083, 0.2617458335531117, -0.4285028733444124, -0.20630880732185222, 0.13004499758785618, 0.15873203028900779, 0.17131361880295223, -0.04985679789790275, -0.28530410497014097, 0.05384156220456838, -0.15634662963346996, -0.1522871523641574, -0.10981264380719419, 0.0074749460774965245, 0.03783062050685324, -0.29164220109153727, 0.07056031195211679, 0.0025040977014387823, -0.0001384784355198019, -0.06399305497562915, -0.07648354883120868, -0.012409085958339647, 0.0950020750952082, 0.05645109522367018, 0.008595898732234111, 0.12597106669060698, -0.15346580250282307, -0.08319622780144889, 0.3618487139775338, -0.12775449507785538, -0.18280574882955258, 0.18384079521652966, -0.11912210627948051, -0.1208926010537593, 0.11585112985214172, 0.1864657850898615, 0.1386078245418343, -0.18449953291484741, 0.11161535915120632, 0.0039948958847390945, 0.14814621941584288, 0.06766960030098694, 0.0178202579368898, 0.22791134425902262, 0.12900817984991225, 0.024264065319456945, 0.16126757552004864, -0.05867418428138835, -0.1444242048409566, -0.34740761059819575, -0.13824865097944095, -0.15179861510048465, 0.053339964113474345, -0.11143060563105549, -0.1650200135837398, 0.38836302399639994, 0.1922583886487737, 0.19279178115363751, 0.04565807921465617, 0.26802065677884684, 0.14197933098626553, 0.06249401227005959, 0.07545820080005211, 0.23857178554554873, 0.1295930351336585, 0.08637321796102962, -0.2078406962986694, -0.00853552881291314, 0.026376795909372183] |
1,803.03522 | Monte Carlo simulation for Ultra-cold neutron experiments searching for
neutron - mirror neutron oscillation | Neutron oscillation into mirror neutron, a sterile state exactly degenerate
in mass with the neutron, could be a very rapid process, even faster than the
neutron decay itself. It can be observed by comparing the neutron lose rates in
an ultra-cold neutron trapping experiment for different experimental magnetic
fields. We developed a Monte Carlo code that simulates many of the features of
this kind of experiment with non-uniform magnetic fields. The aim of the
simulation is to provide all necessary tools, needed for analyzing experimental
results for neutron traps with different geometry and different configurations
of magnetic field. This work contain technical details on the Monte Carlo
simulation used for the analysis in arXiv:1712.05761 not presented in it.
| physics.comp-ph hep-ex | neutron oscillation into mirror neutron a sterile state exactly degenerate in mass with the neutron could be a very rapid process even faster than the neutron decay itself it can be observed by comparing the neutron lose rates in an ultracold neutron trapping experiment for different experimental magnetic fields we developed a monte carlo code that simulates many of the features of this kind of experiment with nonuniform magnetic fields the aim of the simulation is to provide all necessary tools needed for analyzing experimental results for neutron traps with different geometry and different configurations of magnetic field this work contain technical details on the monte carlo simulation used for the analysis in arxiv171205761 not presented in it | [['neutron', 'oscillation', 'into', 'mirror', 'neutron', 'a', 'sterile', 'state', 'exactly', 'degenerate', 'in', 'mass', 'with', 'the', 'neutron', 'could', 'be', 'a', 'very', 'rapid', 'process', 'even', 'faster', 'than', 'the', 'neutron', 'decay', 'itself', 'it', 'can', 'be', 'observed', 'by', 'comparing', 'the', 'neutron', 'lose', 'rates', 'in', 'an', 'ultracold', 'neutron', 'trapping', 'experiment', 'for', 'different', 'experimental', 'magnetic', 'fields', 'we', 'developed', 'a', 'monte', 'carlo', 'code', 'that', 'simulates', 'many', 'of', 'the', 'features', 'of', 'this', 'kind', 'of', 'experiment', 'with', 'nonuniform', 'magnetic', 'fields', 'the', 'aim', 'of', 'the', 'simulation', 'is', 'to', 'provide', 'all', 'necessary', 'tools', 'needed', 'for', 'analyzing', 'experimental', 'results', 'for', 'neutron', 'traps', 'with', 'different', 'geometry', 'and', 'different', 'configurations', 'of', 'magnetic', 'field', 'this', 'work', 'contain', 'technical', 'details', 'on', 'the', 'monte', 'carlo', 'simulation', 'used', 'for', 'the', 'analysis', 'in', 'arxiv171205761', 'not', 'presented', 'in', 'it']] | [-0.07220787999944554, 0.2133300362134195, -0.09334111590392123, 0.13815088467988693, -0.04648517420451738, -0.10409748747409521, 0.028391875772394687, 0.36415295255107755, -0.21544663096642774, -0.34447800003501594, 0.07495416213089648, -0.25948292984125704, -0.03606344838268482, 0.29458177339635855, 0.03685400188446809, 0.05385652706663833, 0.13299115576769394, 0.01657398842483098, -0.06707138757810442, -0.23143829728783163, 0.30674827426799345, 0.12695386558452731, 0.24737568381123054, 0.022906014321642555, 0.05364150753837779, 0.013116612998593567, -0.005250934535303177, -0.00704374635576183, -0.1306275894856563, 0.046489946046669006, 0.25414825200986785, 0.11250462599146442, 0.16105081575612226, -0.5140209627998436, -0.21281690387708, 0.11285834627735436, 0.14106760919094086, 0.1540687726969775, -0.13416325143024993, -0.25794697580182463, 0.0735552663085027, -0.18782114469979563, -0.1538841492560111, -0.11545764952579625, -0.040806813861052386, 0.051360251033454714, -0.27400783301752984, 0.023504099776793238, 0.030002068427717712, 0.05158403479995636, -0.08636653170578627, -0.13347865688877228, 0.04356362829860459, 0.08165303216132726, 0.06110497923447496, 0.060017420599857964, 0.12716681591800263, -0.12744753648184687, -0.10989673373599847, 0.3242876481057869, -0.030545337156130947, -0.15728498871973517, 0.19528936153739437, -0.19403717117224875, -0.13372174038304988, 0.17310238696443728, 0.14798068864127764, 0.156869295761626, -0.16467261966417393, 0.015705925171934147, -0.02391273486547363, 0.1867704995874013, 0.02913688254566529, -0.009851064405634873, 0.2595136389454715, 0.22865263958318302, -0.01753497652313473, 0.1310409718296594, -0.14302628380883262, -0.1076747301973912, -0.28353052272294194, -0.134806686001392, -0.15660811739906064, 0.046885741153322995, -0.0676299259428514, -0.14434455884829497, 0.3559314304978674, 0.17211133378963822, 0.1294103044554846, -0.05453804036817299, 0.3205619957934842, 0.06814978153914468, 0.07572493475312606, 0.04979297072670431, 0.2619536050324702, 0.16985485943742734, 0.1137156537694172, -0.2798133416730178, 0.058467650917382576, -0.004439981353795554] |
1,803.03523 | Observing The Observer II: Can I know I am in a superposition and still
be in a superposition? | The answer will be a "yes" (despite looking like a violation of the
Uncertainty Principle).
| quant-ph physics.hist-ph | the answer will be a yes despite looking like a violation of the uncertainty principle | [['the', 'answer', 'will', 'be', 'a', 'yes', 'despite', 'looking', 'like', 'a', 'violation', 'of', 'the', 'uncertainty', 'principle']] | [-0.13620029191176097, 0.13477483689785003, -0.13094287055234113, 0.23054460883140565, -0.16725781994561353, -0.18319641643514237, 0.15275233487288156, 0.2382371385892232, -0.27598907351493834, -0.33385263979434965, 0.17383374478667973, -0.3047471503416697, -0.09479543343186378, 0.2092605990668138, -0.10584361006816229, 0.006551880637804667, 0.09554954965909322, 0.0640411810328563, -0.08379896481831868, -0.2373818940172593, 0.2812235241755843, 0.07705720228453478, 0.22369101401418448, 0.11618988650540511, 0.11381232862671216, -0.04294735640287399, -0.007657921190063159, 0.13714097502330938, -0.02336315785845121, 0.11552283888061841, 0.27621810684601467, 0.2722703605890274, 0.3419375898937384, -0.3495536322395007, -0.12662068468828996, 0.22354905133446057, 0.03431673739105463, 0.14699772074818612, -0.0491701011856397, -0.3115167881051699, -0.0069250911474227905, -0.1342761866748333, -0.1629548722334827, -0.044945633659760155, 0.006633590161800385, -0.10452195207277934, -0.26163476904233296, 0.0712385157123208, 0.13632466283937295, 0.03521363195031881, 0.056844764823714894, -0.041158132006724676, 0.0815130385880669, 0.10204729977995157, 0.0848753039903992, 0.03263102043420076, 0.1223487583299478, -0.12405114471912385, -0.17316401128967604, 0.48566855639219286, -0.03526775670858721, -0.20205320318539938, 0.08877482445289692, -0.1746864122649034, -0.18015517368912698, 0.03068547520476083, 0.134188840786616, 0.04145104470662773, -0.17849407518903415, 0.09833138237396875, -0.1299166827307393, 0.21503992180029552, 0.14946939439202347, 0.040435869991779325, 0.3109316613525152, 0.15700412169098854, 0.11950163232783477, 0.04780015913614382, 0.008795380964875222, 0.000665888066093127, -0.35046626795083285, -0.21897080558895443, -0.15629796121890346, 0.16740702275031558, -0.041772999428212644, -0.05194073369105657, 0.3115136253337065, 0.20608750780423482, 0.16564818744858106, 0.0399779495007048, 0.21223190445452927, 0.12932405844330788, 0.016460973024368285, 0.015842046216130258, 0.3355614572763443, 0.07283052926262219, 0.1014297711973389, -0.1804667646686236, 0.1672064492168526, -0.01963442371537288] |
1,803.03524 | Experimental determination of exchange constants in antiferromagnetic
Mn$_2$Au | Mn$_2$Au is an important antiferromagnetic (AF) material for spintronics
applications. Due to its very high N\'eel temperature of about 1500 K, some of
the basic properties are difficult to explore, such as the AF susceptibility
and the exchange constants. Experimental determination of these properties is
further complicated in thin films by unavoidable presence of uncompensated and
quasiloose spins on antisites and at interfaces. Using x-ray magnetic circular
dichroism (XMCD), we have measured the spin and orbital contribution to the
susceptibility in the direction perpendicular to the in-plane magnetic moments
of a Mn$_2$Au(001) film and in fields up to 8 T. By performing these
measurements at a low temperature of 7 K and at room temperature, we were able
to separate the loose spin contribution from the susceptibility of AF coupled
spins. The value of the AF exchange constant obtained with this method for a 10
nm thick Mn$_2$Au(001) film equals to (24 $\pm$ 5) meV.
| cond-mat.mtrl-sci | mn_2au is an important antiferromagnetic af material for spintronics applications due to its very high neel temperature of about 1500 k some of the basic properties are difficult to explore such as the af susceptibility and the exchange constants experimental determination of these properties is further complicated in thin films by unavoidable presence of uncompensated and quasiloose spins on antisites and at interfaces using xray magnetic circular dichroism xmcd we have measured the spin and orbital contribution to the susceptibility in the direction perpendicular to the inplane magnetic moments of a mn_2au001 film and in fields up to 8 t by performing these measurements at a low temperature of 7 k and at room temperature we were able to separate the loose spin contribution from the susceptibility of af coupled spins the value of the af exchange constant obtained with this method for a 10 nm thick mn_2au001 film equals to 24 pm 5 mev | [['mn_2au', 'is', 'an', 'important', 'antiferromagnetic', 'af', 'material', 'for', 'spintronics', 'applications', 'due', 'to', 'its', 'very', 'high', 'neel', 'temperature', 'of', 'about', '1500', 'k', 'some', 'of', 'the', 'basic', 'properties', 'are', 'difficult', 'to', 'explore', 'such', 'as', 'the', 'af', 'susceptibility', 'and', 'the', 'exchange', 'constants', 'experimental', 'determination', 'of', 'these', 'properties', 'is', 'further', 'complicated', 'in', 'thin', 'films', 'by', 'unavoidable', 'presence', 'of', 'uncompensated', 'and', 'quasiloose', 'spins', 'on', 'antisites', 'and', 'at', 'interfaces', 'using', 'xray', 'magnetic', 'circular', 'dichroism', 'xmcd', 'we', 'have', 'measured', 'the', 'spin', 'and', 'orbital', 'contribution', 'to', 'the', 'susceptibility', 'in', 'the', 'direction', 'perpendicular', 'to', 'the', 'inplane', 'magnetic', 'moments', 'of', 'a', 'mn_2au001', 'film', 'and', 'in', 'fields', 'up', 'to', '8', 't', 'by', 'performing', 'these', 'measurements', 'at', 'a', 'low', 'temperature', 'of', '7', 'k', 'and', 'at', 'room', 'temperature', 'we', 'were', 'able', 'to', 'separate', 'the', 'loose', 'spin', 'contribution', 'from', 'the', 'susceptibility', 'of', 'af', 'coupled', 'spins', 'the', 'value', 'of', 'the', 'af', 'exchange', 'constant', 'obtained', 'with', 'this', 'method', 'for', 'a', '10', 'nm', 'thick', 'mn_2au001', 'film', 'equals', 'to', '24', 'pm', '5', 'mev']] | [-0.16558910648363004, 0.20988501739271956, 0.018463377886770393, -0.016242742220607686, -0.049720520347603415, -0.11289895613414333, 0.07996529563771267, 0.4347879370539694, -0.27500234882494334, -0.35129350039029594, 0.07130081391063102, -0.35669848085289185, -0.02503159487816064, 0.19446708624079628, 0.0865096144219646, -0.002883484066650884, -0.06211165673065759, 0.018328874782463044, -0.10566925430229228, -0.22096408515369004, 0.2327430364367549, 0.03605739454130679, 0.270885493871327, 0.10983723312567331, 0.06043406134956872, 0.026098309473845324, 0.10931292263864491, 0.014776712738430911, -0.15011136016600127, 0.0717667507399854, 0.26534961358993314, -0.09241477390567429, 0.16067168834055529, -0.39874214616506115, -0.15072044026792833, -0.0033946151930936857, 0.09944709232628443, 0.10621616468013503, -0.0355251944711199, -0.2214867695890318, 0.1528227004424767, -0.1230427236809383, -0.1377106513096614, -0.1065007039302911, 0.004390541278744901, -0.025503110971553007, -0.257681176852585, 0.12967565623847277, 0.0809306491244474, 0.1442275201376393, -0.10229184862462141, -0.17345498992424263, -0.066399114780851, 0.08387350666606308, 0.08443969876297112, 0.10485698212409932, 0.1516230797094881, -0.10689370015576347, -0.10815335799232248, 0.32206332726453085, -0.057945226811601684, -0.05675098409042939, 0.18207241943424665, -0.2012777580744832, -0.0690468810927613, 0.18194672935274675, 0.1415018042052428, 0.13169416802396117, -0.13606057895690596, 0.055491461886719516, 0.05936069642254887, 0.20173677931980868, 0.06379553025870241, 0.03966800269048881, 0.26407038615893963, 0.12913036794864302, 0.03130102370357092, 0.14481248281586695, -0.15858223772221736, -0.011784078176692435, -0.2059295215325332, -0.1478377623348742, -0.1889920927259434, 0.09711121400285169, -0.11878387302433686, -0.1328183615665981, 0.3565745105780048, 0.1853554410382027, 0.18449842473369485, -0.06694113850397498, 0.27565541396554755, 0.06043314469111225, 0.07640897289935597, 0.053085542677619835, 0.261505822446787, 0.2634016140900234, 0.14579270528577726, -0.2714827589332249, 0.071573211803824, -0.04274879072449709] |
1,803.03525 | Improving lifecycle query in integrated toolchains using linked data and
MQTT-based data warehousing | The development of increasingly complex IoT systems requires large
engineering environments. These environments generally consist of tools from
different vendors and are not necessarily integrated well with each other. In
order to automate various analyses, queries across resources from multiple
tools have to be executed in parallel to the engineering activities. In this
paper, we identify the necessary requirements on such a query capability and
evaluate different architectures according to these requirements. We propose an
improved lifecycle query architecture, which builds upon the existing Tracked
Resource Set (TRS) protocol, and complements it with the MQTT messaging
protocol in order to allow the data in the warehouse to be kept updated in
real-time. As part of the case study focusing on the development of an IoT
automated warehouse, this architecture was implemented for a toolchain
integrated using RESTful microservices and linked data.
| cs.SE cs.MA cs.NI | the development of increasingly complex iot systems requires large engineering environments these environments generally consist of tools from different vendors and are not necessarily integrated well with each other in order to automate various analyses queries across resources from multiple tools have to be executed in parallel to the engineering activities in this paper we identify the necessary requirements on such a query capability and evaluate different architectures according to these requirements we propose an improved lifecycle query architecture which builds upon the existing tracked resource set trs protocol and complements it with the mqtt messaging protocol in order to allow the data in the warehouse to be kept updated in realtime as part of the case study focusing on the development of an iot automated warehouse this architecture was implemented for a toolchain integrated using restful microservices and linked data | [['the', 'development', 'of', 'increasingly', 'complex', 'iot', 'systems', 'requires', 'large', 'engineering', 'environments', 'these', 'environments', 'generally', 'consist', 'of', 'tools', 'from', 'different', 'vendors', 'and', 'are', 'not', 'necessarily', 'integrated', 'well', 'with', 'each', 'other', 'in', 'order', 'to', 'automate', 'various', 'analyses', 'queries', 'across', 'resources', 'from', 'multiple', 'tools', 'have', 'to', 'be', 'executed', 'in', 'parallel', 'to', 'the', 'engineering', 'activities', 'in', 'this', 'paper', 'we', 'identify', 'the', 'necessary', 'requirements', 'on', 'such', 'a', 'query', 'capability', 'and', 'evaluate', 'different', 'architectures', 'according', 'to', 'these', 'requirements', 'we', 'propose', 'an', 'improved', 'lifecycle', 'query', 'architecture', 'which', 'builds', 'upon', 'the', 'existing', 'tracked', 'resource', 'set', 'trs', 'protocol', 'and', 'complements', 'it', 'with', 'the', 'mqtt', 'messaging', 'protocol', 'in', 'order', 'to', 'allow', 'the', 'data', 'in', 'the', 'warehouse', 'to', 'be', 'kept', 'updated', 'in', 'realtime', 'as', 'part', 'of', 'the', 'case', 'study', 'focusing', 'on', 'the', 'development', 'of', 'an', 'iot', 'automated', 'warehouse', 'this', 'architecture', 'was', 'implemented', 'for', 'a', 'toolchain', 'integrated', 'using', 'restful', 'microservices', 'and', 'linked', 'data']] | [-0.1279819911008978, 0.012597024505371757, -0.04423567582027498, 0.02117449950578735, -0.09425450258241003, -0.14672137680628622, 0.03417600314083331, 0.4213555711222456, -0.2615967986457948, -0.3715023250444561, 0.14516656089025873, -0.23795154413327257, -0.1022080124904078, 0.22305374553572413, -0.09556276014021842, 0.09904549110281209, 0.05187231528817128, -0.010080186625387757, -0.001907762347477825, -0.28866424463055235, 0.2937188965486402, 0.030557739092631542, 0.35168809227394404, 0.038934843684051264, 0.022268878532150854, 0.0032945489246688836, -0.07871446919343467, -0.03134802081140216, -0.06681811219537036, 0.16446296954593548, 0.36834269498329586, 0.23565336615045337, 0.28836078529662273, -0.4986811843271374, -0.13699166662000278, 0.0579338192391533, 0.16765949168202884, 0.05869830924776508, -0.027108877851852342, -0.3276063405911947, 0.08603565477277317, -0.22560443523887327, -0.0822050433163366, -0.09673367303313939, -0.02609416534661824, 0.023698576619511746, -0.2526659384297194, -0.07196447492332746, -0.012694426993046827, 0.06871005503051247, -0.04676808456556726, -0.053376255930130574, 0.021623459884877058, 0.19101989006702888, -0.015470240971879334, 0.03397644085789773, 0.1800737105514722, -0.10089477854206, -0.17001839210642566, 0.3816450026071241, 0.013267248119260614, -0.1787197417349444, 0.23822588003397396, -0.02827312664710091, -0.2082768379618143, 0.07093644998505289, 0.2511656790549028, 0.0723211152498868, -0.2331049350678181, 0.04664197853594648, 0.062379880319514594, 0.19040673718860385, 0.0005158508354996113, 0.046501210765212984, 0.20156476549566427, 0.24011599711069825, 0.05915949477959451, 0.14518308768862964, 8.99048812740238e-05, -0.09586920288675432, -0.2290048145409178, -0.1665121871701558, -0.14376532465734698, -0.026075713045739055, -0.04553923676251136, -0.15331793533875904, 0.37259570192149344, 0.235032418402612, 0.14957192249543277, 0.04366348010833798, 0.3746665921194334, 0.03767734641138652, 0.17878834189370718, 0.11957453738845197, 0.13258035733952378, -0.0330995743374294, 0.2154051324745627, -0.15039540698144135, 0.11327681428891548, -0.019476041075581988] |
1,803.03526 | A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple
Polygon | The geodesic Voronoi diagram of m point sites inside a simple polygon of n
vertices is a subdivision of the polygon into m cells, one to each site, such
that all points in a cell share the same nearest site under the geodesic
distance. The best known lower bound for the construction time is Omega( n + m
log m ), and a matching upper bound is a long-standing open question. The
state-of-the-art construction algorithms achieve O( (n+m) log (n+m) ) and O(
n+m log m log^2 n ) time, which are optimal for m=Omega(n) and m=O( n / log^3 n
), respectively. In this paper, we give a construction algorithm with O( n+m(
log m+ log^2 n) ) time, and it is nearly optimal in the sense that if a single
Voronoi vertex can be computed in O( log n ) time, then the construction time
will become the optimal O( n+m log m ). In other words, we reduce the problem
of constructing the diagram in the optimal time to the problem of computing a
single Voronoi vertex in O( log n ) time.
| cs.CG | the geodesic voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells one to each site such that all points in a cell share the same nearest site under the geodesic distance the best known lower bound for the construction time is omega n m log m and a matching upper bound is a longstanding open question the stateoftheart construction algorithms achieve o nm log nm and o nm log m log2 n time which are optimal for momegan and mo n log3 n respectively in this paper we give a construction algorithm with o nm log m log2 n time and it is nearly optimal in the sense that if a single voronoi vertex can be computed in o log n time then the construction time will become the optimal o nm log m in other words we reduce the problem of constructing the diagram in the optimal time to the problem of computing a single voronoi vertex in o log n time | [['the', 'geodesic', 'voronoi', 'diagram', 'of', 'm', 'point', 'sites', 'inside', 'a', 'simple', 'polygon', 'of', 'n', 'vertices', 'is', 'a', 'subdivision', 'of', 'the', 'polygon', 'into', 'm', 'cells', 'one', 'to', 'each', 'site', 'such', 'that', 'all', 'points', 'in', 'a', 'cell', 'share', 'the', 'same', 'nearest', 'site', 'under', 'the', 'geodesic', 'distance', 'the', 'best', 'known', 'lower', 'bound', 'for', 'the', 'construction', 'time', 'is', 'omega', 'n', 'm', 'log', 'm', 'and', 'a', 'matching', 'upper', 'bound', 'is', 'a', 'longstanding', 'open', 'question', 'the', 'stateoftheart', 'construction', 'algorithms', 'achieve', 'o', 'nm', 'log', 'nm', 'and', 'o', 'nm', 'log', 'm', 'log2', 'n', 'time', 'which', 'are', 'optimal', 'for', 'momegan', 'and', 'mo', 'n', 'log3', 'n', 'respectively', 'in', 'this', 'paper', 'we', 'give', 'a', 'construction', 'algorithm', 'with', 'o', 'nm', 'log', 'm', 'log2', 'n', 'time', 'and', 'it', 'is', 'nearly', 'optimal', 'in', 'the', 'sense', 'that', 'if', 'a', 'single', 'voronoi', 'vertex', 'can', 'be', 'computed', 'in', 'o', 'log', 'n', 'time', 'then', 'the', 'construction', 'time', 'will', 'become', 'the', 'optimal', 'o', 'nm', 'log', 'm', 'in', 'other', 'words', 'we', 'reduce', 'the', 'problem', 'of', 'constructing', 'the', 'diagram', 'in', 'the', 'optimal', 'time', 'to', 'the', 'problem', 'of', 'computing', 'a', 'single', 'voronoi', 'vertex', 'in', 'o', 'log', 'n', 'time']] | [-0.1632050992601684, 0.12420498748442957, -0.019780724631356342, 0.03432630776228117, -0.012633918478552783, -0.21564331021559024, 0.1545726541143709, 0.3683480624694909, -0.2544393369715129, -0.348223721866629, 0.038174182600341736, -0.3039892078403916, -0.08945001345660006, 0.12887051109324343, -0.07272894371567028, -0.010045504359794514, 0.04240410420245358, 0.06789412035473756, -0.028864376026072672, -0.35153364346495697, 0.22208541500914308, 0.0317015525352742, 0.21026820198100593, -0.018342041409507927, 0.05660166181890028, -0.010669506944021643, 0.019605635311454536, 0.004568870001073395, -0.16538986069857076, 0.08319029257957092, 0.27006276600062845, 0.13426474637218885, 0.22741009765437672, -0.38625004577317407, -0.09073716941622219, 0.1358156054580052, 0.19008530697120088, 0.03828183594226305, 0.01736434564526592, -0.1565607943811587, 0.11957871179229447, -0.025335785943482604, -0.12937065341775972, 0.06922250782472214, 0.13486321582325866, -0.01397389616817236, -0.28321573875179246, -0.04330847713298031, 0.06698512351938657, 0.0037863749516795255, 0.017798405587673188, -0.15984487787953444, -0.01395096511713096, 0.1205050454022629, -0.08797722305304238, 0.13507307077358877, 0.07533998385337846, -0.04258034373367471, -0.08358845125152065, 0.3636436103177922, -0.09573268024516957, -0.13491714700657342, 0.09859508845422948, -0.16419845651835202, -0.11458175466795052, 0.15827814041902977, 0.12553611236491374, 0.2405425667603101, -0.08088583873850959, 0.22117561730922067, -0.1007625916241003, 0.1871059974856741, 0.1562742832010346, 0.043454888707825115, 0.08760435108627591, 0.15669852435588838, 0.13300906927457878, 0.07821018036953839, -0.08867932215066893, -0.04086945417653104, -0.30475823032004495, -0.20694148801666284, -0.20788062452538206, 0.07823198220825621, -0.2135195908053512, -0.17056718219603811, 0.27477148318929334, 0.06252977379996862, 0.2789250653290323, 0.10887261377580996, 0.2510763686788934, 0.07899562553635665, 0.009607073866895266, 0.18815278650394507, 0.0734267189473446, 0.076812165794628, 0.050129187990512164, -0.2372872253906514, 0.033880148388977564, 0.20008546336420946] |
1,803.03527 | Sufficient conditions on planar graphs to have a relaxed
DP-$3$-colorability | It is known that DP-coloring is a generalization of a list coloring in simple
graphs and many results in list coloring can be generalized in those of
DP-coloring. In this work, we introduce a relaxed DP-coloring which is a
generalization if a relaxed list coloring. We also shows that every planar
graph $G$ without $4$-cycles or $6$-cycles is DP-$(k,d)^*$-colorable. It
follows immediately that $G$ is $(k,d)^*$-choosable.
| math.CO | it is known that dpcoloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of dpcoloring in this work we introduce a relaxed dpcoloring which is a generalization if a relaxed list coloring we also shows that every planar graph g without 4cycles or 6cycles is dpkdcolorable it follows immediately that g is kdchoosable | [['it', 'is', 'known', 'that', 'dpcoloring', 'is', 'a', 'generalization', 'of', 'a', 'list', 'coloring', 'in', 'simple', 'graphs', 'and', 'many', 'results', 'in', 'list', 'coloring', 'can', 'be', 'generalized', 'in', 'those', 'of', 'dpcoloring', 'in', 'this', 'work', 'we', 'introduce', 'a', 'relaxed', 'dpcoloring', 'which', 'is', 'a', 'generalization', 'if', 'a', 'relaxed', 'list', 'coloring', 'we', 'also', 'shows', 'that', 'every', 'planar', 'graph', 'g', 'without', '4cycles', 'or', '6cycles', 'is', 'dpkdcolorable', 'it', 'follows', 'immediately', 'that', 'g', 'is', 'kdchoosable']] | [-0.16326792247306843, 0.08492566780545391, -0.10492471187160565, 0.07208108608969128, -0.1892551985497658, -0.17078850500715467, 0.06058906620511642, 0.4339043694619949, -0.2720353085834246, -0.3294064790297013, 0.09519313540166387, -0.2625562532016864, -0.23198761732604067, 0.13989876399461468, -0.2152535034630161, -0.05077052569160095, 0.1662129891033356, 0.0882220974478584, 0.028308733670900647, -0.278288610346275, 0.2415493403776334, -0.053018346924979524, 0.150213171599003, 0.11467477659909771, 0.02406187054629509, 0.02187437160083881, 0.033762207827889, 0.1496138609515933, -0.11938141637219815, 0.011995612521870778, 0.249010635410937, 0.1795170948554117, 0.23641243565541048, -0.27646181119668584, -0.19936592697452468, 0.20576878790564548, 0.10527780902786897, 0.1280233909608796, -0.055771566827136736, -0.20298734821665745, 0.17681666513761649, -0.15054718427933178, -0.08935519948673364, 0.003043697803066327, 0.08249037710663218, -0.03808889092447666, -0.2540608684460704, -0.015510374225693969, 0.17031630873680115, -0.0224867811475773, 0.05923016499369763, -0.11455171251526246, -0.02551467873585912, 0.029479996512572354, -0.09384061774740425, 0.13579108726519803, -0.003893834152796234, -0.11142582061987083, -0.17674761926038907, 0.44489105825240793, -0.02735629932811627, -0.1880776194998851, 0.12166828848779775, -0.06007894734637095, -0.2669920967748532, 0.10252846579712172, 0.049356963413839154, 0.17077922309533908, -0.15149054848947205, 0.08503771086062233, -0.2415103218661478, 0.11604829464609233, 0.1319982485129283, -0.01748299335774321, 0.1295620263625796, 0.13295033841143147, 0.18341762424858574, 0.23314200336149393, 0.07398827152613263, 0.046825690309588726, -0.3219548503939922, -0.14284158575420197, -0.22158097467528512, 0.07954263510898901, -0.10259510391154505, -0.19159048955815916, 0.3958389497576998, 0.09927875473378943, 0.150688009784342, 0.11195196811862003, 0.23060517832636834, 0.07260955738333555, 0.10417991064560528, 0.1977171161212027, 0.12899348576051684, 0.16619433385248367, -0.033626975033145684, -0.10097791417233216, 0.05471705043903337, 0.1514975642069028] |
1,803.03528 | Biological and Shortest-Path Routing Procedures for Transportation
Network Design | The design of efficient transportation networks is an important challenge in
many research areas. Among the most promising recent methods, biological
routing mimic local rules found in nature. However comparisons with other
methods are rare. In this paper we define a common framework to compare network
design method. We use it to compare biological and a shortest-path routing
approaches. We find that biological routing explore a more efficient set of
solution when looking to design a network for uniformly distributed transfers.
However, the difference between the two approaches is not as important for a
skewed distribution of transfers.
| physics.soc-ph cs.DS cs.SI | the design of efficient transportation networks is an important challenge in many research areas among the most promising recent methods biological routing mimic local rules found in nature however comparisons with other methods are rare in this paper we define a common framework to compare network design method we use it to compare biological and a shortestpath routing approaches we find that biological routing explore a more efficient set of solution when looking to design a network for uniformly distributed transfers however the difference between the two approaches is not as important for a skewed distribution of transfers | [['the', 'design', 'of', 'efficient', 'transportation', 'networks', 'is', 'an', 'important', 'challenge', 'in', 'many', 'research', 'areas', 'among', 'the', 'most', 'promising', 'recent', 'methods', 'biological', 'routing', 'mimic', 'local', 'rules', 'found', 'in', 'nature', 'however', 'comparisons', 'with', 'other', 'methods', 'are', 'rare', 'in', 'this', 'paper', 'we', 'define', 'a', 'common', 'framework', 'to', 'compare', 'network', 'design', 'method', 'we', 'use', 'it', 'to', 'compare', 'biological', 'and', 'a', 'shortestpath', 'routing', 'approaches', 'we', 'find', 'that', 'biological', 'routing', 'explore', 'a', 'more', 'efficient', 'set', 'of', 'solution', 'when', 'looking', 'to', 'design', 'a', 'network', 'for', 'uniformly', 'distributed', 'transfers', 'however', 'the', 'difference', 'between', 'the', 'two', 'approaches', 'is', 'not', 'as', 'important', 'for', 'a', 'skewed', 'distribution', 'of', 'transfers']] | [-0.11025380248522233, 0.02996354699933697, -0.0693899601251267, 0.09385073520255047, -0.07592390766557382, -0.1824185289204957, 0.03989499353219242, 0.4586679021618804, -0.2765135613177447, -0.29509967692880607, 0.06457153585269021, -0.2733394841530493, -0.23946303980691092, 0.22096598783165824, -0.08993414229694374, 0.07792715071249107, 0.08070722343970319, -0.00019754328745968488, -0.030868167949754898, -0.1986907720470763, 0.29152595030490724, 0.03741285905279979, 0.3565286510642998, 0.02641800329877938, 0.0668193739933931, -0.022116419094215547, -0.04969857643092317, 0.03340715904273473, -0.09395210134444286, 0.2100595740259302, 0.33435400666631, 0.18519713779987426, 0.3553915225653624, -0.41446408813781277, -0.25250509568509094, 0.1442340603383372, 0.15854349299167683, 0.11339249907593642, -0.060490810146765564, -0.19353709410761996, 0.1015556290251564, -0.1671295379174455, -0.06841167714446783, -0.11436387572475538, 0.04902545275577648, 0.03924507752051387, -0.24787645834992278, -0.004697340141449656, -0.0035254502982585405, 0.00880007838773332, -0.03509557224116383, -0.13302716613766186, 0.042534822933090737, 0.16911575654242425, 0.034445626802542914, 0.02373202988041603, 0.11633954268918202, -0.14335936071512725, -0.16900613466372752, 0.4245641147907899, 0.025443262809041734, -0.204046757666071, 0.2260434789944212, -0.011518297964060793, -0.18490270556102753, 0.0632838121378065, 0.22412539972942702, 0.15196697826839375, -0.2064178435125077, -0.013498124752635593, -0.010962087221500673, 0.13748758536174285, 0.035099639535919595, 0.03488826133638658, 0.18691128633004062, 0.26114233441375273, 0.1386751480565682, 0.12223707561972741, -0.05966066390428008, -0.14061511559792014, -0.21963653953898013, -0.13934059117977715, -0.1621689900033632, 0.01151410619771626, -0.07115356145620855, -0.16007866699020473, 0.34918577863587713, 0.24178131578052986, 0.21853899728650542, 0.043399955830251684, 0.35050032837839074, 0.015747669236217766, 0.07028202346659132, 0.11651564913098605, 0.1968052476497215, 0.06394855849853508, 0.1307089740828592, -0.15369147898591295, 0.11141925233497037, -0.00311291729081042] |
1,803.03529 | Modelling the longitudinal intensity pattern of diffraction resistant
beams in stratified media | In this paper, we study the propagation of the Frozen Wave type beams through
non-absorbing stratified media and develop a theoretical method capable to
provide the desired spatially shaped diffraction resistant beam in the last
material medium. In this context, we also develop a matrix method to deal with
stratified media with large number of layers. Additionally, we undertake some
discussion about minimizing reflection of the incident FW beam on the first
material interface by using thin films. Our results show that it is indeed
possible to obtain the control, on demand, of the longitudinal intensity
pattern of a diffraction resistant beam even after it undergoes multiple
reflections and transmissions at the layer interfaces. Remote sensing, medical
and military applications, noninvasive optical measurements, etc., are some
fields that can be benefited by the method here proposed.
| physics.optics | in this paper we study the propagation of the frozen wave type beams through nonabsorbing stratified media and develop a theoretical method capable to provide the desired spatially shaped diffraction resistant beam in the last material medium in this context we also develop a matrix method to deal with stratified media with large number of layers additionally we undertake some discussion about minimizing reflection of the incident fw beam on the first material interface by using thin films our results show that it is indeed possible to obtain the control on demand of the longitudinal intensity pattern of a diffraction resistant beam even after it undergoes multiple reflections and transmissions at the layer interfaces remote sensing medical and military applications noninvasive optical measurements etc are some fields that can be benefited by the method here proposed | [['in', 'this', 'paper', 'we', 'study', 'the', 'propagation', 'of', 'the', 'frozen', 'wave', 'type', 'beams', 'through', 'nonabsorbing', 'stratified', 'media', 'and', 'develop', 'a', 'theoretical', 'method', 'capable', 'to', 'provide', 'the', 'desired', 'spatially', 'shaped', 'diffraction', 'resistant', 'beam', 'in', 'the', 'last', 'material', 'medium', 'in', 'this', 'context', 'we', 'also', 'develop', 'a', 'matrix', 'method', 'to', 'deal', 'with', 'stratified', 'media', 'with', 'large', 'number', 'of', 'layers', 'additionally', 'we', 'undertake', 'some', 'discussion', 'about', 'minimizing', 'reflection', 'of', 'the', 'incident', 'fw', 'beam', 'on', 'the', 'first', 'material', 'interface', 'by', 'using', 'thin', 'films', 'our', 'results', 'show', 'that', 'it', 'is', 'indeed', 'possible', 'to', 'obtain', 'the', 'control', 'on', 'demand', 'of', 'the', 'longitudinal', 'intensity', 'pattern', 'of', 'a', 'diffraction', 'resistant', 'beam', 'even', 'after', 'it', 'undergoes', 'multiple', 'reflections', 'and', 'transmissions', 'at', 'the', 'layer', 'interfaces', 'remote', 'sensing', 'medical', 'and', 'military', 'applications', 'noninvasive', 'optical', 'measurements', 'etc', 'are', 'some', 'fields', 'that', 'can', 'be', 'benefited', 'by', 'the', 'method', 'here', 'proposed']] | [-0.11131190733217142, 0.1426219015265815, -0.06866935384802192, -0.002741711663582143, -0.07507728001527379, -0.12229146332110223, 0.0567801612393369, 0.46448005409911275, -0.29352682908339534, -0.2843570292530143, 0.11094379405532141, -0.2671443708686103, -0.17561524922562324, 0.21049772235838807, -0.04640688481809133, 0.06551645909819533, 0.05267610242128071, -0.03566482914624537, -0.01593807737406357, -0.19602130118565744, 0.31358893403975185, 0.053589370170169896, 0.32818651071626365, 0.05953893611234996, 0.09025384555228383, 0.07415842011350297, -0.01230675308376222, 0.01360473842086161, -0.09050163543179224, 0.11112276050056714, 0.26110840263358753, 0.08977720578310683, 0.2689193988301079, -0.5174976978040136, -0.27786614360315176, 0.0162136742608923, 0.12363129016311551, 0.12739708486504456, -0.13270005046369454, -0.2644829789402566, 0.08873630704115118, -0.13244654668447123, -0.1557119407636278, -0.0703530288181569, -0.047764055845190716, 0.02943105510990683, -0.2493475766724955, 0.03570198025087901, 0.028978327146272503, 0.07012191287461012, -0.04465765262241749, -0.052507772076162786, 0.013210199874319026, 0.08186570220106446, 0.040074678526520184, 0.0200263513954055, 0.1414626557756599, -0.1263340770811363, -0.05561482010285973, 0.37767761567032293, -0.016982636304900926, -0.1564780626247418, 0.16750879860346152, -0.15614490965719383, -0.057786967944326424, 0.1697259936344755, 0.22676773331648506, 0.14016818733858494, -0.1532256264335421, -0.020000873288903247, -0.06698082444959522, 0.18715914293801794, 0.10971761863466407, 0.018824002976008856, 0.16585253225297064, 0.17554889157113127, 0.07260253900826416, 0.1561728629620869, -0.12554057564600096, 0.001967524848998223, -0.25955872678819375, -0.15781655354315743, -0.15708942445823648, 0.009525756749152445, -0.05256228885831232, -0.15686645175960354, 0.38389984056737053, 0.18094117644052268, 0.1391788566183737, -0.024522747406188178, 0.3341378611786401, 0.07058671809328884, 0.046456875430200904, 0.04005827908986248, 0.23797172294999816, 0.15522508744427743, 0.16335113807626306, -0.17051875594359658, 0.07512504412614576, -0.02025379119303954] |
1,803.0353 | Synchronization Strings: Efficient and Fast Deterministic Constructions
over Small Alphabets | Synchronization strings are recently introduced by Haeupler and Shahrasbi
(STOC 2017) in the study of codes for correcting insertion and deletion errors
(insdel codes). They showed that for any parameter $\varepsilon>0$,
synchronization strings of arbitrary length exist over an alphabet whose size
depends only on $\varepsilon$. Specifically, they obtained an alphabet size of
$O(\varepsilon^{-4})$, which left an open question on where the minimal size of
such alphabets lies between $\Omega(\varepsilon^{-1})$ and
$O(\varepsilon^{-4})$. In this work, we partially bridge this gap by providing
an improved lower bound of $\Omega(\varepsilon^{-3/2})$, and an improved upper
bound of $O(\varepsilon^{-2})$. We also provide fast explicit constructions of
synchronization strings over small alphabets.
Further, along the lines of previous work on similar combinatorial objects,
we study the extremal question of the smallest possible alphabet size over
which synchronization strings can exist for some constant $\varepsilon < 1$. We
show that one can construct $\varepsilon$-synchronization strings over
alphabets of size four while no such string exists over binary alphabets. This
reduces the extremal question to whether synchronization strings exist over
ternary alphabets.
| cs.IT cs.DS math.IT | synchronization strings are recently introduced by haeupler and shahrasbi stoc 2017 in the study of codes for correcting insertion and deletion errors insdel codes they showed that for any parameter varepsilon0 synchronization strings of arbitrary length exist over an alphabet whose size depends only on varepsilon specifically they obtained an alphabet size of ovarepsilon4 which left an open question on where the minimal size of such alphabets lies between omegavarepsilon1 and ovarepsilon4 in this work we partially bridge this gap by providing an improved lower bound of omegavarepsilon32 and an improved upper bound of ovarepsilon2 we also provide fast explicit constructions of synchronization strings over small alphabets further along the lines of previous work on similar combinatorial objects we study the extremal question of the smallest possible alphabet size over which synchronization strings can exist for some constant varepsilon 1 we show that one can construct varepsilonsynchronization strings over alphabets of size four while no such string exists over binary alphabets this reduces the extremal question to whether synchronization strings exist over ternary alphabets | [['synchronization', 'strings', 'are', 'recently', 'introduced', 'by', 'haeupler', 'and', 'shahrasbi', 'stoc', '2017', 'in', 'the', 'study', 'of', 'codes', 'for', 'correcting', 'insertion', 'and', 'deletion', 'errors', 'insdel', 'codes', 'they', 'showed', 'that', 'for', 'any', 'parameter', 'varepsilon0', 'synchronization', 'strings', 'of', 'arbitrary', 'length', 'exist', 'over', 'an', 'alphabet', 'whose', 'size', 'depends', 'only', 'on', 'varepsilon', 'specifically', 'they', 'obtained', 'an', 'alphabet', 'size', 'of', 'ovarepsilon4', 'which', 'left', 'an', 'open', 'question', 'on', 'where', 'the', 'minimal', 'size', 'of', 'such', 'alphabets', 'lies', 'between', 'omegavarepsilon1', 'and', 'ovarepsilon4', 'in', 'this', 'work', 'we', 'partially', 'bridge', 'this', 'gap', 'by', 'providing', 'an', 'improved', 'lower', 'bound', 'of', 'omegavarepsilon32', 'and', 'an', 'improved', 'upper', 'bound', 'of', 'ovarepsilon2', 'we', 'also', 'provide', 'fast', 'explicit', 'constructions', 'of', 'synchronization', 'strings', 'over', 'small', 'alphabets', 'further', 'along', 'the', 'lines', 'of', 'previous', 'work', 'on', 'similar', 'combinatorial', 'objects', 'we', 'study', 'the', 'extremal', 'question', 'of', 'the', 'smallest', 'possible', 'alphabet', 'size', 'over', 'which', 'synchronization', 'strings', 'can', 'exist', 'for', 'some', 'constant', 'varepsilon', '1', 'we', 'show', 'that', 'one', 'can', 'construct', 'varepsilonsynchronization', 'strings', 'over', 'alphabets', 'of', 'size', 'four', 'while', 'no', 'such', 'string', 'exists', 'over', 'binary', 'alphabets', 'this', 'reduces', 'the', 'extremal', 'question', 'to', 'whether', 'synchronization', 'strings', 'exist', 'over', 'ternary', 'alphabets']] | [-0.2119626064474384, 0.18115506764701828, -0.005425991514991773, 0.06652219273621075, -0.011029872501388802, -0.17275512920507388, 0.11517103912502157, 0.36080535603360386, -0.2775274794766603, -0.30876053280431276, 0.09020360040632268, -0.2297930812806283, -0.11565509504142996, 0.23205842714408162, -0.1329932533591245, 0.05022977552191512, 0.047166325421513694, 0.08976863755872445, -0.06647584862337, -0.3443483745472299, 0.29793777919717523, 0.07074883629905594, 0.20505661505944373, 0.030179474363920458, 0.06523663938666384, -0.0001942729257450205, -0.024873320145358205, -0.004230786466219446, -0.19954041595074107, 0.08187930368578704, 0.26616046115570857, 0.16017882674333384, 0.20757251823244735, -0.38027661488723685, -0.20227509312200964, 0.15180972484022118, 0.2010255106139318, 0.1581326322439426, -0.019517181274393978, -0.22702270450359155, 0.147286555196066, -0.14675360753570107, -0.027752133636403154, 0.005719681090691634, 0.13432737167554293, 0.004976042554160983, -0.2231826480145822, -0.019465006862212877, 0.16579618980312905, 0.05225312505230547, -0.051729819158021335, -0.14240616131900696, 0.0817307822885569, 0.13364516147711908, 0.010193158654572322, 0.06694591730800376, 0.00681614108950074, -0.070753076608015, -0.15663204690215465, 0.2718293705345159, -0.027595982658104937, -0.22271190912664285, 0.142787127420633, -0.07893767646426739, -0.136443335704549, 0.1203997019754603, 0.1829525334515462, 0.12430012808317503, -0.05110335252547299, 0.18227114376056483, -0.12137196562116781, 0.2863157072086813, 0.23282284977197734, 0.08991900990834209, 0.1619665532907994, 0.12806259260147984, 0.08499160267641409, 0.16373745921886204, -0.022514538807462226, -0.07169783751552446, -0.2840845468208978, -0.10237260805293155, -0.1651574887528645, 0.07192191465319357, -0.15385319941169281, -0.23372974612461458, 0.3197359208082944, 0.12340592329624539, 0.20610960722459773, 0.13128827635487486, 0.2129725611187267, 0.03648279990445365, 0.030727030776103424, 0.15860283951552814, 0.12519572945451227, 0.08786543854444195, -0.03557443799592598, -0.20497514836644012, 0.06203740760643166, 0.10018113935339042] |
1,803.03531 | Spatial variations of the Sr i 4607 {\AA} scattering polarization peak | Context. The scattering polarization signal observed in the photospheric Sr i
4607 {\AA} line is expected to vary at granular spatial scales. This variation
can be due to changes in the magnetic field intensity and orientation (Hanle
effect), but also to spatial and temporal variations in the plasma properties.
Measuring the spatial variation of such polarization signal would allow us to
study the properties of the magnetic fields at subgranular scales, but
observations are challenging since both high spatial resolution and high
spectropolarimetric sensitivity are required.
Aims. We aim to provide observational evidence of the polarization peak
spatial variations, and to analyze the correlation they might have with
granulation.
Methods. Observations conjugating high spatial resolution and high
spectropolarimetric precision were performed with the Zurich IMaging
POLarimeter, ZIMPOL, at the GREGOR solar telescope, taking advantage of the
adaptive optics system and the newly installed image derotator.
Results. Spatial variations of the scattering polarization in the Sr i 4607
{\AA} line are clearly observed. The spatial scale of these variations is
comparable with the granular size. Small correlations between the polarization
signal amplitude and the continuum intensity indicate that the polarization is
higher at the center of granules than in the intergranular lanes.
| astro-ph.SR | context the scattering polarization signal observed in the photospheric sr i 4607 aa line is expected to vary at granular spatial scales this variation can be due to changes in the magnetic field intensity and orientation hanle effect but also to spatial and temporal variations in the plasma properties measuring the spatial variation of such polarization signal would allow us to study the properties of the magnetic fields at subgranular scales but observations are challenging since both high spatial resolution and high spectropolarimetric sensitivity are required aims we aim to provide observational evidence of the polarization peak spatial variations and to analyze the correlation they might have with granulation methods observations conjugating high spatial resolution and high spectropolarimetric precision were performed with the zurich imaging polarimeter zimpol at the gregor solar telescope taking advantage of the adaptive optics system and the newly installed image derotator results spatial variations of the scattering polarization in the sr i 4607 aa line are clearly observed the spatial scale of these variations is comparable with the granular size small correlations between the polarization signal amplitude and the continuum intensity indicate that the polarization is higher at the center of granules than in the intergranular lanes | [['context', 'the', 'scattering', 'polarization', 'signal', 'observed', 'in', 'the', 'photospheric', 'sr', 'i', '4607', 'aa', 'line', 'is', 'expected', 'to', 'vary', 'at', 'granular', 'spatial', 'scales', 'this', 'variation', 'can', 'be', 'due', 'to', 'changes', 'in', 'the', 'magnetic', 'field', 'intensity', 'and', 'orientation', 'hanle', 'effect', 'but', 'also', 'to', 'spatial', 'and', 'temporal', 'variations', 'in', 'the', 'plasma', 'properties', 'measuring', 'the', 'spatial', 'variation', 'of', 'such', 'polarization', 'signal', 'would', 'allow', 'us', 'to', 'study', 'the', 'properties', 'of', 'the', 'magnetic', 'fields', 'at', 'subgranular', 'scales', 'but', 'observations', 'are', 'challenging', 'since', 'both', 'high', 'spatial', 'resolution', 'and', 'high', 'spectropolarimetric', 'sensitivity', 'are', 'required', 'aims', 'we', 'aim', 'to', 'provide', 'observational', 'evidence', 'of', 'the', 'polarization', 'peak', 'spatial', 'variations', 'and', 'to', 'analyze', 'the', 'correlation', 'they', 'might', 'have', 'with', 'granulation', 'methods', 'observations', 'conjugating', 'high', 'spatial', 'resolution', 'and', 'high', 'spectropolarimetric', 'precision', 'were', 'performed', 'with', 'the', 'zurich', 'imaging', 'polarimeter', 'zimpol', 'at', 'the', 'gregor', 'solar', 'telescope', 'taking', 'advantage', 'of', 'the', 'adaptive', 'optics', 'system', 'and', 'the', 'newly', 'installed', 'image', 'derotator', 'results', 'spatial', 'variations', 'of', 'the', 'scattering', 'polarization', 'in', 'the', 'sr', 'i', '4607', 'aa', 'line', 'are', 'clearly', 'observed', 'the', 'spatial', 'scale', 'of', 'these', 'variations', 'is', 'comparable', 'with', 'the', 'granular', 'size', 'small', 'correlations', 'between', 'the', 'polarization', 'signal', 'amplitude', 'and', 'the', 'continuum', 'intensity', 'indicate', 'that', 'the', 'polarization', 'is', 'higher', 'at', 'the', 'center', 'of', 'granules', 'than', 'in', 'the', 'intergranular', 'lanes']] | [-0.09775874508308496, 0.1438963358920063, -0.06608347981630718, 0.08010417039839746, -0.07068465855343277, -0.09724117014719294, -0.0484421790307573, 0.4657553088369395, -0.2501207400131878, -0.371203738269373, 0.09112416102958668, -0.27640575332687567, -0.06368742483802399, 0.13754367016589464, -0.03171044292243485, 0.010397719369913957, 0.03444695445322038, -0.04324808890861227, -0.04470499081766483, -0.17916462161990615, 0.25484410395604834, 0.14688722705885546, 0.31171680684114544, 0.04369093990648416, 0.0864591478261244, -0.04517908862430547, -0.08422560156994865, 0.07173994016272957, -0.06035467682316389, 0.07061642675927118, 0.22072187299603846, 0.08327376982197165, 0.17925527597550506, -0.4156739893021868, -0.21813414551130036, 0.05510471256644423, 0.13001826946595824, 0.06808911960349599, 0.017897285419094622, -0.28317038152037904, 0.05149038078087331, -0.019149957804631357, -0.1277631946714289, -0.003368401155107428, 0.028858193546760624, 0.03376329738753315, -0.26859159044810194, 0.06771376696215428, -0.0005857367549249114, 0.16155082803794105, -0.06822456782961737, -0.10035500187943434, -0.04486394686617458, 0.12044092490967938, 0.025492170766524193, 0.026164691765510027, 0.13332987196780555, -0.1251271142177191, -0.039960291770354046, 0.35173270955162855, -0.10414517542443745, -0.08157683530850197, 0.18880793165915938, -0.29877128088105454, -0.13129904240703405, 0.20152807431712524, 0.18922171542022506, 0.08399018290712132, -0.07941748092266086, 0.005822973733881387, 0.019168459664363025, 0.2307348439507001, 0.08934532055881486, 0.1266010172933859, 0.2601593605622612, 0.1427546986448231, 0.016625750551593318, 0.07496284778329511, -0.3089321691922806, -0.012960525991775058, -0.24598369742303494, -0.09863911920565352, -0.1176873318392283, 0.007973138925234848, -0.11242996429074938, -0.08430941906567682, 0.39338457480476086, 0.21187303396664672, 0.19658539427991084, -0.012566550013919672, 0.3044387000978957, 0.10843674593607418, 0.11022722935512551, 0.025631124194275903, 0.2972713146771105, 0.17325579193513377, 0.2196332332237962, -0.2852537457655133, 0.07691957290163866, -0.03107760193530674] |
1,803.03532 | Predicting antimicrobial drug consumption using web search data | Consumption of antimicrobial drugs, such as antibiotics, is linked with
antimicrobial resistance. Surveillance of antimicrobial drug consumption is
therefore an important element in dealing with antimicrobial resistance. Many
countries lack sufficient surveillance systems. Usage of web mined data
therefore has the potential to improve current surveillance methods. To this
end, we study how well antimicrobial drug consumption can be predicted based on
web search queries, compared to historical purchase data of antimicrobial
drugs. We present two prediction models (linear Elastic Net, and non-linear
Gaussian Processes), which we train and evaluate on almost 6 years of weekly
antimicrobial drug consumption data from Denmark and web search data from
Google Health Trends. We present a novel method of selecting web search queries
by considering diseases and drugs linked to antimicrobials, as well as
professional and layman descriptions of antimicrobial drugs, all of which we
mine from the open web. We find that predictions based on web search data are
marginally more erroneous but overall on a par with predictions based on
purchases of antimicrobial drugs. This marginal difference corresponds to
$<1$\% point mean absolute error in weekly usage. Best predictions are reported
when combining both web search and purchase data.
This study contributes a novel alternative solution to the real-life problem
of predicting (and hence monitoring) antimicrobial drug consumption, which is
particularly valuable in countries/states lacking centralised and timely
surveillance systems.
| cs.IR | consumption of antimicrobial drugs such as antibiotics is linked with antimicrobial resistance surveillance of antimicrobial drug consumption is therefore an important element in dealing with antimicrobial resistance many countries lack sufficient surveillance systems usage of web mined data therefore has the potential to improve current surveillance methods to this end we study how well antimicrobial drug consumption can be predicted based on web search queries compared to historical purchase data of antimicrobial drugs we present two prediction models linear elastic net and nonlinear gaussian processes which we train and evaluate on almost 6 years of weekly antimicrobial drug consumption data from denmark and web search data from google health trends we present a novel method of selecting web search queries by considering diseases and drugs linked to antimicrobials as well as professional and layman descriptions of antimicrobial drugs all of which we mine from the open web we find that predictions based on web search data are marginally more erroneous but overall on a par with predictions based on purchases of antimicrobial drugs this marginal difference corresponds to 1 point mean absolute error in weekly usage best predictions are reported when combining both web search and purchase data this study contributes a novel alternative solution to the reallife problem of predicting and hence monitoring antimicrobial drug consumption which is particularly valuable in countriesstates lacking centralised and timely surveillance systems | [['consumption', 'of', 'antimicrobial', 'drugs', 'such', 'as', 'antibiotics', 'is', 'linked', 'with', 'antimicrobial', 'resistance', 'surveillance', 'of', 'antimicrobial', 'drug', 'consumption', 'is', 'therefore', 'an', 'important', 'element', 'in', 'dealing', 'with', 'antimicrobial', 'resistance', 'many', 'countries', 'lack', 'sufficient', 'surveillance', 'systems', 'usage', 'of', 'web', 'mined', 'data', 'therefore', 'has', 'the', 'potential', 'to', 'improve', 'current', 'surveillance', 'methods', 'to', 'this', 'end', 'we', 'study', 'how', 'well', 'antimicrobial', 'drug', 'consumption', 'can', 'be', 'predicted', 'based', 'on', 'web', 'search', 'queries', 'compared', 'to', 'historical', 'purchase', 'data', 'of', 'antimicrobial', 'drugs', 'we', 'present', 'two', 'prediction', 'models', 'linear', 'elastic', 'net', 'and', 'nonlinear', 'gaussian', 'processes', 'which', 'we', 'train', 'and', 'evaluate', 'on', 'almost', '6', 'years', 'of', 'weekly', 'antimicrobial', 'drug', 'consumption', 'data', 'from', 'denmark', 'and', 'web', 'search', 'data', 'from', 'google', 'health', 'trends', 'we', 'present', 'a', 'novel', 'method', 'of', 'selecting', 'web', 'search', 'queries', 'by', 'considering', 'diseases', 'and', 'drugs', 'linked', 'to', 'antimicrobials', 'as', 'well', 'as', 'professional', 'and', 'layman', 'descriptions', 'of', 'antimicrobial', 'drugs', 'all', 'of', 'which', 'we', 'mine', 'from', 'the', 'open', 'web', 'we', 'find', 'that', 'predictions', 'based', 'on', 'web', 'search', 'data', 'are', 'marginally', 'more', 'erroneous', 'but', 'overall', 'on', 'a', 'par', 'with', 'predictions', 'based', 'on', 'purchases', 'of', 'antimicrobial', 'drugs', 'this', 'marginal', 'difference', 'corresponds', 'to', '1', 'point', 'mean', 'absolute', 'error', 'in', 'weekly', 'usage', 'best', 'predictions', 'are', 'reported', 'when', 'combining', 'both', 'web', 'search', 'and', 'purchase', 'data', 'this', 'study', 'contributes', 'a', 'novel', 'alternative', 'solution', 'to', 'the', 'reallife', 'problem', 'of', 'predicting', 'and', 'hence', 'monitoring', 'antimicrobial', 'drug', 'consumption', 'which', 'is', 'particularly', 'valuable', 'in', 'countriesstates', 'lacking', 'centralised', 'and', 'timely', 'surveillance', 'systems']] | [-0.07518918208191744, 0.02424796413087231, -0.019303900140680764, 0.10696256266633179, -0.12081784821368688, -0.1844577718538379, 0.1282462151312645, 0.3963769500699352, -0.2231915292356637, -0.36181067605911377, 0.1314063457955439, -0.3866896964711742, -0.16968009055371544, 0.22430532576675577, -0.1309596839209757, 0.028609516356434477, 0.09355966879561413, 0.04503693453673469, 0.05767639557240743, -0.3263544326733896, 0.22730724737885522, 0.10428068384154406, 0.3209585241438298, 0.07966780938206061, 0.05833581694848059, 0.0024644510285406, -0.12347042726520285, -0.01589575897786856, -0.10819930477051107, 0.17125595302531382, 0.3929940972468039, 0.20701604947067895, 0.3014534194218485, -0.4413545029339985, -0.19895948872190752, 0.11231184615794439, 0.10774768479939412, 0.10265778285183683, -0.07090550073885345, -0.2808734243633552, 0.06919171955036163, -0.19141937257811883, -0.033244140713226476, -0.10137846155894774, 0.03324526576978857, 0.0510640546123971, -0.24472432715814202, 0.08539645501878113, -0.06646907103162161, 0.1458844591091436, -0.11286597939824947, -0.14820924827322496, -0.04214550910023319, 0.1907772158897786, 0.12180135326905242, 0.005408159795670623, 0.21229748045535465, -0.17111717517001493, -0.15171787011122592, 0.3800336866600749, -0.046392248099947575, -0.11159082443102084, 0.20477070181279264, -0.021230989254259487, -0.1286702487268485, 0.09949553092092014, 0.25473082879059866, 0.10609163725217641, -0.2640990222115075, -0.04290154820365276, 0.02116246616596503, 0.1918166004625004, 0.0551618592371437, -0.03757135313884519, 0.19479032563609316, 0.28421072693125, 0.06081923389048602, 0.09165890632031828, -0.06288941579425641, -0.054299953804155324, -0.16889720620064622, -0.16757736339646376, -0.10233513612694335, 0.054643577503922736, -0.09073767382927288, -0.19602444180973658, 0.361737286147106, 0.197361636140972, 0.11755454952812247, 0.04870726855771959, 0.2923367754045645, -0.024178473547197012, 0.097530061367842, 0.04360812150371841, 0.10944958330181084, -0.04772600940869827, 0.17411067065876795, -0.19474070766029813, 0.17485143853302457, -0.01833574428312938] |
1,803.03533 | Strong Rashba effect in the localized impurity states of halogen-doped
monolayer PtSe2 | The recent epitaxial growth of 1T-phase of PtSe2 monolayer (ML) has opened a
possibility for its novel applications, in particular for spintronics device.
However, in contrast to 2H-phase of transition-metal dichalcogenides (TMDs),
the absence of spin splitting in the PtSe2 ML may limit the functionality for
spintronics application. Through fully-relativistic density-functional theory
calculations, we show that large spin splitting can be induced in the PtSe2 ML
by introducing a substitutional halogen impurity. Depending on the atomic
number (Z) of the halogen dopants, we observe an enhancement of the spin
splitting in the localized impurity states (LIS), which is due to the increased
contribution of the p-d orbitals coupling. More importantly, we identify very
large Rashba splitting in the LIS near Fermi level around the Gamma point
characterized by hexagonal warping of the Fermi surface. We show that the
Rashba splitting can be controlled by adjusting the doping concentration.
Therefore, this work paves a possible way to induce the significant Rashba
splitting in the two-dimensional TMDs, which is useful for spintronic devices
operating at room temperature.
| cond-mat.str-el | the recent epitaxial growth of 1tphase of ptse2 monolayer ml has opened a possibility for its novel applications in particular for spintronics device however in contrast to 2hphase of transitionmetal dichalcogenides tmds the absence of spin splitting in the ptse2 ml may limit the functionality for spintronics application through fullyrelativistic densityfunctional theory calculations we show that large spin splitting can be induced in the ptse2 ml by introducing a substitutional halogen impurity depending on the atomic number z of the halogen dopants we observe an enhancement of the spin splitting in the localized impurity states lis which is due to the increased contribution of the pd orbitals coupling more importantly we identify very large rashba splitting in the lis near fermi level around the gamma point characterized by hexagonal warping of the fermi surface we show that the rashba splitting can be controlled by adjusting the doping concentration therefore this work paves a possible way to induce the significant rashba splitting in the twodimensional tmds which is useful for spintronic devices operating at room temperature | [['the', 'recent', 'epitaxial', 'growth', 'of', '1tphase', 'of', 'ptse2', 'monolayer', 'ml', 'has', 'opened', 'a', 'possibility', 'for', 'its', 'novel', 'applications', 'in', 'particular', 'for', 'spintronics', 'device', 'however', 'in', 'contrast', 'to', '2hphase', 'of', 'transitionmetal', 'dichalcogenides', 'tmds', 'the', 'absence', 'of', 'spin', 'splitting', 'in', 'the', 'ptse2', 'ml', 'may', 'limit', 'the', 'functionality', 'for', 'spintronics', 'application', 'through', 'fullyrelativistic', 'densityfunctional', 'theory', 'calculations', 'we', 'show', 'that', 'large', 'spin', 'splitting', 'can', 'be', 'induced', 'in', 'the', 'ptse2', 'ml', 'by', 'introducing', 'a', 'substitutional', 'halogen', 'impurity', 'depending', 'on', 'the', 'atomic', 'number', 'z', 'of', 'the', 'halogen', 'dopants', 'we', 'observe', 'an', 'enhancement', 'of', 'the', 'spin', 'splitting', 'in', 'the', 'localized', 'impurity', 'states', 'lis', 'which', 'is', 'due', 'to', 'the', 'increased', 'contribution', 'of', 'the', 'pd', 'orbitals', 'coupling', 'more', 'importantly', 'we', 'identify', 'very', 'large', 'rashba', 'splitting', 'in', 'the', 'lis', 'near', 'fermi', 'level', 'around', 'the', 'gamma', 'point', 'characterized', 'by', 'hexagonal', 'warping', 'of', 'the', 'fermi', 'surface', 'we', 'show', 'that', 'the', 'rashba', 'splitting', 'can', 'be', 'controlled', 'by', 'adjusting', 'the', 'doping', 'concentration', 'therefore', 'this', 'work', 'paves', 'a', 'possible', 'way', 'to', 'induce', 'the', 'significant', 'rashba', 'splitting', 'in', 'the', 'twodimensional', 'tmds', 'which', 'is', 'useful', 'for', 'spintronic', 'devices', 'operating', 'at', 'room', 'temperature']] | [-0.1709761683157246, 0.1706299918604782, -0.006199377325496503, 0.01987717163416424, -0.017263397159320966, -0.16040191335337503, 0.11267410672294707, 0.41074422304917657, -0.2819971315349851, -0.29423155088509834, -0.04914524111564138, -0.28711358624909605, -0.14864838671471392, 0.20838799216119305, 0.027647870519930232, -0.0017850072153045662, -0.023631726865257534, -0.11915829623650227, -0.1290934761670152, -0.21754133604766268, 0.29165338419643894, 0.061722105315753395, 0.32566246015285805, 0.14185014611442706, 0.0036059912533632347, 0.022146955286817892, 0.14388854662488615, 0.006504452382879598, -0.1254428309685318, 0.12860037903002064, 0.29298190696963244, -0.10794698015121477, 0.24187356668923582, -0.4270205029552536, -0.20071904682554303, -0.014123120733669826, 0.14050370446273258, 0.1906982604667012, -0.1550838827658611, -0.266696747935244, 0.07695281493876661, -0.17459578441189869, -0.13063035848276092, -0.08681078889540264, -0.007551428712904453, -0.01593340978990974, -0.21838789191629204, 0.02543497582631452, 0.05446330262580887, 0.05639397699481508, -0.036345717896723986, -0.15280421482133014, -0.10222870465101941, 0.04706190281680652, 0.03787046599600996, 0.04319040650984139, 0.1903264409889068, -0.1301816884195432, -0.09950962592182415, 0.37099366427532265, -0.10090618907340936, -0.12007034880242178, 0.1540843607285725, -0.16793014909805995, -0.10842474365340812, 0.13149940268934837, 0.15077952801782105, 0.12002125099833523, -0.12857795970447894, 0.1558754023430603, 0.02037663579785398, 0.14576093595425066, 0.0721797906181642, 0.08841274735684107, 0.26960015732395864, 0.20279828071461192, 0.10947359270815338, 0.09874266046897641, -0.15106279538545225, -0.02426536021255223, -0.1782450316739934, -0.22584982504536, -0.25608879779864635, 0.11346850477283754, -0.062918468421059, -0.17263898884345377, 0.40863778942929846, 0.14690009802646403, 0.17909698937886528, -0.09510934554838708, 0.21631153769258943, 0.1315452535832966, 0.11642272252988603, -0.006486314531149609, 0.2706336314098111, 0.12925165770176267, 0.07182917053412113, -0.29435027263792496, 0.09767955628556332, -0.009364730207515614] |
1,803.03534 | High-throughput screening of encapsulated islets using wide-field
lens-free on-chip imaging | Islet microencapsulation is a promising solution to diabetes treatment, but
its quality control based on manual microscopic inspection is extremely
low-throughput, highly variable and laborious. This study presents a
high-throughput islet-encapsulation quality screening system based on lens-free
on-chip imaging with a wide field-of-view of 18.15 cm^2, which is more than 100
times larger than that of a lens-based optical microscope, enabling it to image
and analyze ~8,000 microcapsules in a single frame. Custom-written image
reconstruction and processing software provides the user with clinically
important information, such as microcapsule count, size, intactness, and
information on whether each capsule contains an islet. This high-throughput and
cost-effective platform can be useful for researchers to develop better
encapsulation protocols as well as perform quality control prior to
transplantation.
| physics.ins-det eess.IV physics.app-ph | islet microencapsulation is a promising solution to diabetes treatment but its quality control based on manual microscopic inspection is extremely lowthroughput highly variable and laborious this study presents a highthroughput isletencapsulation quality screening system based on lensfree onchip imaging with a wide fieldofview of 1815 cm2 which is more than 100 times larger than that of a lensbased optical microscope enabling it to image and analyze 8000 microcapsules in a single frame customwritten image reconstruction and processing software provides the user with clinically important information such as microcapsule count size intactness and information on whether each capsule contains an islet this highthroughput and costeffective platform can be useful for researchers to develop better encapsulation protocols as well as perform quality control prior to transplantation | [['islet', 'microencapsulation', 'is', 'a', 'promising', 'solution', 'to', 'diabetes', 'treatment', 'but', 'its', 'quality', 'control', 'based', 'on', 'manual', 'microscopic', 'inspection', 'is', 'extremely', 'lowthroughput', 'highly', 'variable', 'and', 'laborious', 'this', 'study', 'presents', 'a', 'highthroughput', 'isletencapsulation', 'quality', 'screening', 'system', 'based', 'on', 'lensfree', 'onchip', 'imaging', 'with', 'a', 'wide', 'fieldofview', 'of', '1815', 'cm2', 'which', 'is', 'more', 'than', '100', 'times', 'larger', 'than', 'that', 'of', 'a', 'lensbased', 'optical', 'microscope', 'enabling', 'it', 'to', 'image', 'and', 'analyze', '8000', 'microcapsules', 'in', 'a', 'single', 'frame', 'customwritten', 'image', 'reconstruction', 'and', 'processing', 'software', 'provides', 'the', 'user', 'with', 'clinically', 'important', 'information', 'such', 'as', 'microcapsule', 'count', 'size', 'intactness', 'and', 'information', 'on', 'whether', 'each', 'capsule', 'contains', 'an', 'islet', 'this', 'highthroughput', 'and', 'costeffective', 'platform', 'can', 'be', 'useful', 'for', 'researchers', 'to', 'develop', 'better', 'encapsulation', 'protocols', 'as', 'well', 'as', 'perform', 'quality', 'control', 'prior', 'to', 'transplantation']] | [-0.05772123807629432, 0.023110727889849112, -0.0623375993036311, 0.019836273924197446, -0.1244734426313811, -0.22345147442749955, 0.05238800539735181, 0.45074234086989373, -0.19383413598618723, -0.35187973570047826, 0.13101849992363138, -0.2674278780656351, -0.12329563242960567, 0.25404686135074417, -0.12155161127217176, 0.07352388306465077, 0.08607030299699996, 0.006262158472783679, -0.012637562870840766, -0.19943342332089367, 0.16222180426120758, 0.10934781958938342, 0.36105996144989366, 0.03363613005773711, 0.10954012003657985, 0.04909439152683909, 0.00015343281956127852, -0.01381908199357346, -0.0918475927861166, 0.17130527973236623, 0.32609442858341003, 0.16793792807181512, 0.3238929912240114, -0.41396668666688924, -0.2202213652478146, 0.03148210060028436, 0.16629034499753237, 0.08233608599186466, -0.08662264374402748, -0.2736337026831317, 0.10663667379893856, -0.16399916971086964, -0.0416459687951806, -0.13374591220847584, 0.018885431064616057, -0.01456594124748102, -0.2891039637279166, 0.06372078238555408, -0.07060063754983846, 0.09876515497722901, -0.049870581222767364, -0.07086031956979158, 0.024690481745599468, 0.16305401567600605, -0.02982358038540899, 0.1012753269207964, 0.21592774899861167, -0.1474386501000436, -0.07078240705607844, 0.4105849771891251, -0.002836153899513816, -0.1696488249071389, 0.20697110173992875, -0.07339075162491092, -0.09200513713092597, 0.17028068808053642, 0.1799018124911226, 0.11984025503793531, -0.21662454518743537, -0.06023916898320298, 0.03480592596321559, 0.26501960595992724, 0.056696626196099706, 0.0742525903446492, 0.18342073399127146, 0.3173640055874409, 0.0717777369220641, 0.1264996810927833, -0.11802979043977381, 0.021161752310389085, -0.19203831215412165, -0.19748720757794097, -0.13720593344004564, 0.08834614175225584, -0.07893987897769567, -0.2008073795644551, 0.3668140961272904, 0.17738065951357573, 0.16225889030351373, 0.004000328728459652, 0.37361490984316453, 0.0039847554179093195, 0.13838907559055927, 0.0035548885641542593, 0.14664789478194493, 0.02609178326323567, 0.12355657303051576, -0.16251196891400377, 0.09128518652725072, -0.02028148141997474] |
1,803.03535 | Generation of photoluminescent ultrashort carbon nanotubes through
nanoscale exciton localization at sp3 -defect sites | The intrinsic near-infrared photoluminescence observed in long single walled
carbon nanotubes is systematically quenched in ultrashort single-walled carbon
nanotubes (usCNTs, below 100 nm length) due to their short dimension as
compared to the exciton diffusion length. It would however be key for number of
applications to have such tiny nanostructure displaying photoluminescence
emission to complement their unique physical, chemical and biological
properties. Here we demonstrate that intense photoluminescence can be created
in usCNTs (~40 nm length) upon incorporation of emissive sp3-defect sites in
order to trap excitons. Using super-resolution imaging at <25 nm resolution, we
directly reveal the localization of excitons at the defect sites on individual
usCNTs. They are found preferentially localized at nanotube ends which can be
separated by less than 40 nm and behave as independent emitters. The
demonstration and control of bright near-infrared photoluminescence in usCNTs
through exciton trapping opens the possibility to engineering tiny carbon
nanotubes for applications in various domains of research including quantum
optics and bioimaging.
| physics.app-ph physics.optics | the intrinsic nearinfrared photoluminescence observed in long single walled carbon nanotubes is systematically quenched in ultrashort singlewalled carbon nanotubes uscnts below 100 nm length due to their short dimension as compared to the exciton diffusion length it would however be key for number of applications to have such tiny nanostructure displaying photoluminescence emission to complement their unique physical chemical and biological properties here we demonstrate that intense photoluminescence can be created in uscnts 40 nm length upon incorporation of emissive sp3defect sites in order to trap excitons using superresolution imaging at 25 nm resolution we directly reveal the localization of excitons at the defect sites on individual uscnts they are found preferentially localized at nanotube ends which can be separated by less than 40 nm and behave as independent emitters the demonstration and control of bright nearinfrared photoluminescence in uscnts through exciton trapping opens the possibility to engineering tiny carbon nanotubes for applications in various domains of research including quantum optics and bioimaging | [['the', 'intrinsic', 'nearinfrared', 'photoluminescence', 'observed', 'in', 'long', 'single', 'walled', 'carbon', 'nanotubes', 'is', 'systematically', 'quenched', 'in', 'ultrashort', 'singlewalled', 'carbon', 'nanotubes', 'uscnts', 'below', '100', 'nm', 'length', 'due', 'to', 'their', 'short', 'dimension', 'as', 'compared', 'to', 'the', 'exciton', 'diffusion', 'length', 'it', 'would', 'however', 'be', 'key', 'for', 'number', 'of', 'applications', 'to', 'have', 'such', 'tiny', 'nanostructure', 'displaying', 'photoluminescence', 'emission', 'to', 'complement', 'their', 'unique', 'physical', 'chemical', 'and', 'biological', 'properties', 'here', 'we', 'demonstrate', 'that', 'intense', 'photoluminescence', 'can', 'be', 'created', 'in', 'uscnts', '40', 'nm', 'length', 'upon', 'incorporation', 'of', 'emissive', 'sp3defect', 'sites', 'in', 'order', 'to', 'trap', 'excitons', 'using', 'superresolution', 'imaging', 'at', '25', 'nm', 'resolution', 'we', 'directly', 'reveal', 'the', 'localization', 'of', 'excitons', 'at', 'the', 'defect', 'sites', 'on', 'individual', 'uscnts', 'they', 'are', 'found', 'preferentially', 'localized', 'at', 'nanotube', 'ends', 'which', 'can', 'be', 'separated', 'by', 'less', 'than', '40', 'nm', 'and', 'behave', 'as', 'independent', 'emitters', 'the', 'demonstration', 'and', 'control', 'of', 'bright', 'nearinfrared', 'photoluminescence', 'in', 'uscnts', 'through', 'exciton', 'trapping', 'opens', 'the', 'possibility', 'to', 'engineering', 'tiny', 'carbon', 'nanotubes', 'for', 'applications', 'in', 'various', 'domains', 'of', 'research', 'including', 'quantum', 'optics', 'and', 'bioimaging']] | [-0.03808559837641862, 0.2248667618116065, 0.017719866751037813, -0.0004924505548034278, 0.02205959900661751, -0.18243051805090804, 0.031862822720597005, 0.555260722996828, -0.26527789255236217, -0.33053183191697355, 0.019722102044285334, -0.3167845511803242, -0.0607881760663054, 0.21175979500935402, -0.0050349997839442, 0.005837665467643765, 0.03920662729644481, -0.092925138180834, 0.028901707534074644, -0.19403177077958703, 0.18096261303067024, 0.06348912761888731, 0.31928457802931925, 0.1459391273336807, 0.02633820968841053, -0.01396768795395339, 0.06922333361580968, -0.032822100046079286, -0.13799270267051647, 0.1202832902736752, 0.27531991473019674, -0.059071809521642364, 0.24764875415712595, -0.45797518986840674, -0.22346212504500593, 0.0266881779426052, 0.24095620355158498, 0.16438742440099036, -0.06829862651935445, -0.28083218532947846, 0.09750857375372478, -0.05280117327519865, -0.12466640908696493, -0.010020778313233161, 0.03507690267338429, 0.03255551229777205, -0.16979566978270555, 0.05498641273394848, -0.013617184262487026, 0.09864789234721505, -0.0641923996757854, -0.09935505647049861, -0.05221012200553683, 0.08104725572478923, -0.012496073453623894, -0.022220572390605087, 0.2736816947193195, -0.10700626879712039, -0.11895800799700534, 0.3744768363130451, -0.0909935101766296, -0.028287218849140185, 0.2057035911690306, -0.17102687713621115, -0.05168264149400739, 0.2241519884361575, 0.11462737573023288, 0.16065558447376077, -0.1376301824545666, 0.002495375857113596, 0.03733289808704644, 0.21793937096286012, 0.16416536632315887, 0.19895971927326173, 0.28724359980220965, 0.2111442965573206, 0.019354002850624608, 0.13006519162696845, -0.14703149190368825, -0.029183918018077994, -0.16652053442243256, -0.18699117672750382, -0.2020559313442604, 0.1648235189596214, -0.05473463146991878, -0.15803877901383617, 0.3830865908954523, 0.11342669944106429, 0.15456865539624828, -0.02405940649964858, 0.21983161887418431, 0.05054417041447991, 0.15449099062171615, -0.050604636740675314, 0.2648662509120725, 0.16915187521989997, 0.1245313803119194, -0.22875909514748205, 0.014090621214428986, -0.06934681554025982] |
1,803.03536 | Exploring Dependence Structures in the International Arms Trade Network | In the paper we analyse dependence structures among international trade flows
of major conventional weapons from 1952 to 2016. We employ a Network
Disturbance Model commonly used in inferential network analysis and spatial
econometrics. The dependence structure is represented by pre-defined weight
matrices that allow for relating the arms trade flows from the network of
international arms exchange. Several different weight matrices are compared by
means of the AIC in order to select the best dependence structure. It turns out
that the dependence structure among the arms trade flows is rather complex and
can be represented by a specification that, simply speaking, relates each arms
trade flow to all exports and imports of the sending and the receiving state.
By controlling for explanatory variables we are able to show the influence of
political and economic variables on the volume traded.
| stat.AP | in the paper we analyse dependence structures among international trade flows of major conventional weapons from 1952 to 2016 we employ a network disturbance model commonly used in inferential network analysis and spatial econometrics the dependence structure is represented by predefined weight matrices that allow for relating the arms trade flows from the network of international arms exchange several different weight matrices are compared by means of the aic in order to select the best dependence structure it turns out that the dependence structure among the arms trade flows is rather complex and can be represented by a specification that simply speaking relates each arms trade flow to all exports and imports of the sending and the receiving state by controlling for explanatory variables we are able to show the influence of political and economic variables on the volume traded | [['in', 'the', 'paper', 'we', 'analyse', 'dependence', 'structures', 'among', 'international', 'trade', 'flows', 'of', 'major', 'conventional', 'weapons', 'from', '1952', 'to', '2016', 'we', 'employ', 'a', 'network', 'disturbance', 'model', 'commonly', 'used', 'in', 'inferential', 'network', 'analysis', 'and', 'spatial', 'econometrics', 'the', 'dependence', 'structure', 'is', 'represented', 'by', 'predefined', 'weight', 'matrices', 'that', 'allow', 'for', 'relating', 'the', 'arms', 'trade', 'flows', 'from', 'the', 'network', 'of', 'international', 'arms', 'exchange', 'several', 'different', 'weight', 'matrices', 'are', 'compared', 'by', 'means', 'of', 'the', 'aic', 'in', 'order', 'to', 'select', 'the', 'best', 'dependence', 'structure', 'it', 'turns', 'out', 'that', 'the', 'dependence', 'structure', 'among', 'the', 'arms', 'trade', 'flows', 'is', 'rather', 'complex', 'and', 'can', 'be', 'represented', 'by', 'a', 'specification', 'that', 'simply', 'speaking', 'relates', 'each', 'arms', 'trade', 'flow', 'to', 'all', 'exports', 'and', 'imports', 'of', 'the', 'sending', 'and', 'the', 'receiving', 'state', 'by', 'controlling', 'for', 'explanatory', 'variables', 'we', 'are', 'able', 'to', 'show', 'the', 'influence', 'of', 'political', 'and', 'economic', 'variables', 'on', 'the', 'volume', 'traded']] | [-0.10628772192971415, 0.08455407319457403, -0.09485732063518039, 0.09382010565438707, -0.11102349958715162, -0.10989472683119987, 0.07188547238017366, 0.3619802784241204, -0.29908212640189696, -0.30248002663387785, 0.10378849682414772, -0.3044715849433227, -0.1842880884850664, 0.14940450352317255, -0.06719412994571031, 0.021986536637164784, 0.007403546080292602, 0.00780894370732962, -0.010753131439975862, -0.2616477447279197, 0.3350566297071055, 0.07716702135013682, 0.31325436596359524, -0.010285870195366443, 0.12283928423587764, 0.024797770244601582, -0.0788726620309587, 0.04854936798385877, -0.08910641019543358, 0.13875146494579635, 0.2900378307194582, 0.15287589061855605, 0.30109127806998526, -0.4571151004305908, -0.18536312147708875, 0.10463882488298364, 0.09682108579602625, 0.02914751924857098, 0.060013826386836756, -0.24640196687541902, 0.04301596712653658, -0.21746843563310644, -0.06398884424374306, -0.08745225981942245, 0.01796807838337762, 0.0686378475478185, -0.2649587245421052, 0.05612770003665771, 0.015373810102963554, 0.06519637095209743, -0.013925423890551819, -0.10056523295518544, -0.05725887862000881, 0.19008541974035326, 0.07778256950218097, -0.006969614726923672, 0.16848408175199958, -0.12150290656635272, -0.1276274975954688, 0.3706419635697135, -0.02974328612825567, -0.2002452992750997, 0.1487660782228756, -0.1263556829188019, -0.09505774731016052, 0.05865750569584114, 0.21210825985430606, 0.02205318136007658, -0.1494365132717316, 0.019547034491967808, -0.05666508670630199, 0.19916769628013883, 0.11530467737466096, -0.016588884079828857, 0.18638376857686256, 0.14182625245968147, 0.10607231218101723, 0.1334218192134618, -0.06008994728061745, -0.16016585144014764, -0.252676420881679, -0.09838475217111409, -0.11992979036461163, 0.009009847983751179, -0.11763289199807332, -0.10225292365399323, 0.3998038594477943, 0.12712099138713842, 0.20703121818868178, 0.009185858696166957, 0.2634481760540179, 0.0688733047073973, 0.09528515603659408, 0.13502611203085899, 0.20227624170116282, 0.1071386490482837, 0.08748164846827941, -0.184269384594102, 0.17687337724034607, 0.01621023447119764] |
1,803.03537 | A discrete event traffic model explaining the traffic phases of the
train dynamics on a linear metro line with demand-dependent control | In this paper we present a mathematical model of the train dynamics in a
linear metro line system with demand-dependent run and dwell times. On every
segment of the line, we consider two main constraints. The first constraint is
on the travel time, which is the sum of run and dwell time. The second one is
on the safe separation time, modeling the signaling system, so that only one
train can occupy a segment at a time. The dwell and the run times are modeled
dynamically, with two control laws. The one on the dwell time makes sure that
all the passengers can debark from and embark into the train. The one on the
run time ensures train time-headway regularity in the case where perturbations
do not exceed a run time margin.
We use a Max-plus algebra approach which allows to derive analytic formulas
for the train time-headway and frequency depending on the number of trains and
on the passenger demand. The analytic formulas, illustrated by 3D figures,
permit to understand the phases of the train dynamics of a linear metro line
being operated as a transport on demand system.
| math.OC | in this paper we present a mathematical model of the train dynamics in a linear metro line system with demanddependent run and dwell times on every segment of the line we consider two main constraints the first constraint is on the travel time which is the sum of run and dwell time the second one is on the safe separation time modeling the signaling system so that only one train can occupy a segment at a time the dwell and the run times are modeled dynamically with two control laws the one on the dwell time makes sure that all the passengers can debark from and embark into the train the one on the run time ensures train timeheadway regularity in the case where perturbations do not exceed a run time margin we use a maxplus algebra approach which allows to derive analytic formulas for the train timeheadway and frequency depending on the number of trains and on the passenger demand the analytic formulas illustrated by 3d figures permit to understand the phases of the train dynamics of a linear metro line being operated as a transport on demand system | [['in', 'this', 'paper', 'we', 'present', 'a', 'mathematical', 'model', 'of', 'the', 'train', 'dynamics', 'in', 'a', 'linear', 'metro', 'line', 'system', 'with', 'demanddependent', 'run', 'and', 'dwell', 'times', 'on', 'every', 'segment', 'of', 'the', 'line', 'we', 'consider', 'two', 'main', 'constraints', 'the', 'first', 'constraint', 'is', 'on', 'the', 'travel', 'time', 'which', 'is', 'the', 'sum', 'of', 'run', 'and', 'dwell', 'time', 'the', 'second', 'one', 'is', 'on', 'the', 'safe', 'separation', 'time', 'modeling', 'the', 'signaling', 'system', 'so', 'that', 'only', 'one', 'train', 'can', 'occupy', 'a', 'segment', 'at', 'a', 'time', 'the', 'dwell', 'and', 'the', 'run', 'times', 'are', 'modeled', 'dynamically', 'with', 'two', 'control', 'laws', 'the', 'one', 'on', 'the', 'dwell', 'time', 'makes', 'sure', 'that', 'all', 'the', 'passengers', 'can', 'debark', 'from', 'and', 'embark', 'into', 'the', 'train', 'the', 'one', 'on', 'the', 'run', 'time', 'ensures', 'train', 'timeheadway', 'regularity', 'in', 'the', 'case', 'where', 'perturbations', 'do', 'not', 'exceed', 'a', 'run', 'time', 'margin', 'we', 'use', 'a', 'maxplus', 'algebra', 'approach', 'which', 'allows', 'to', 'derive', 'analytic', 'formulas', 'for', 'the', 'train', 'timeheadway', 'and', 'frequency', 'depending', 'on', 'the', 'number', 'of', 'trains', 'and', 'on', 'the', 'passenger', 'demand', 'the', 'analytic', 'formulas', 'illustrated', 'by', '3d', 'figures', 'permit', 'to', 'understand', 'the', 'phases', 'of', 'the', 'train', 'dynamics', 'of', 'a', 'linear', 'metro', 'line', 'being', 'operated', 'as', 'a', 'transport', 'on', 'demand', 'system']] | [-0.13719190102308354, 0.07792120922029891, -0.07446119198427001, 0.04246314687956561, -0.0662855438001335, -0.15840031597961454, 0.055462203200961006, 0.3835064469380899, -0.244953519563151, -0.2893537180568196, 0.14915422679908436, -0.2518347631063234, -0.09293983389494663, 0.2182170863150609, -0.026463439573374072, 0.027588646858311357, 0.07456965138268795, 0.09730761587505843, -0.03293959702801039, -0.2563606280984575, 0.27801113135176414, 0.004298292479398561, 0.28770816560458157, 0.0186970329922723, 0.1381947786306982, 0.014658603273540181, -0.015773250724181554, -0.016175636058138248, -0.08564612099771113, 0.08383546255410035, 0.20965406888911062, 0.14855201589438985, 0.2911982843949598, -0.5114718102024896, -0.17602232440889992, 0.0955954203679365, 0.10680155673477937, 0.08637552756315811, 0.02976528272785722, -0.2535406052038331, 0.029748133057976103, -0.13103244283751764, -0.09270552015972343, -0.025209636288754483, 0.04139088038751419, 0.058135908255551726, -0.26236328967609146, 0.011586182292530988, 0.02563065427300976, 0.0030723762813958024, -0.05251018073505157, -0.032812111736696334, -0.02423621313101513, 0.15704374923990008, 0.03157277853832521, 0.002435152946495788, 0.12577480970147473, -0.07322867676749469, -0.1174666097813702, 0.39363470688174934, -0.05785796722085116, -0.20356786386555734, 0.170965975639658, -0.11839691272627456, -0.10742843238032482, 0.10263480172378625, 0.24181068652963383, 0.1287738229271936, -0.13943163080306903, 0.0352545179286724, -0.03690200510058314, 0.2074287608494992, 0.07550477340540036, -0.0265388825630888, 0.17433450730180644, 0.2152361644325441, 0.09926611401928351, 0.11122803081897029, -0.11487596717593755, -0.11188332439013855, -0.31406558505160376, -0.1370640275355904, -0.18492017241945352, 0.038571888280049725, -0.05818837074618019, -0.1297471090145607, 0.44912348237839783, 0.17695422042247919, 0.22563854025607494, 0.1644898592715029, 0.3166953210738745, 0.14421765110888915, 0.06448252433960504, 0.09429274919254586, 0.18630156335742906, 0.025334340878118304, 0.14289382169706785, -0.20881886366631544, 0.08876120675484615, 0.07561127171217602] |
1,803.03538 | Bounds on dipole moments of tau-neutrino from single photon searches in
$SU(4)_L\times U(1)_X$ model at CLIC and ILC energies | We investigate the dipole moments of the tau- neutrino at high-energy and
high luminosity at linear electron positron colliders, such as CLIC or ILC
through the analysis of the reaction $e^{+}\, e^{-}\rightarrow \nu\, \bar \nu
\,\gamma$ in the framework of the $SU(4)_L \times U(1)_X$ model. The limits on
dipole moment were obtained for integrated luminosity of $\cal{L}$= 500-2000\,
fb$^{-1}$ and center of mass between 0.5 and 3.0 TeV. The estimated limits for
the tau-neutrino magnetic and electric dipole moments are improved by 2-3
orders of magnitude and complement previous studies on the dipole moments.
| hep-ph | we investigate the dipole moments of the tau neutrino at highenergy and high luminosity at linear electron positron colliders such as clic or ilc through the analysis of the reaction e erightarrow nu bar nu gamma in the framework of the su4_l times u1_x model the limits on dipole moment were obtained for integrated luminosity of call 5002000 fb1 and center of mass between 05 and 30 tev the estimated limits for the tauneutrino magnetic and electric dipole moments are improved by 23 orders of magnitude and complement previous studies on the dipole moments | [['we', 'investigate', 'the', 'dipole', 'moments', 'of', 'the', 'tau', 'neutrino', 'at', 'highenergy', 'and', 'high', 'luminosity', 'at', 'linear', 'electron', 'positron', 'colliders', 'such', 'as', 'clic', 'or', 'ilc', 'through', 'the', 'analysis', 'of', 'the', 'reaction', 'e', 'erightarrow', 'nu', 'bar', 'nu', 'gamma', 'in', 'the', 'framework', 'of', 'the', 'su4_l', 'times', 'u1_x', 'model', 'the', 'limits', 'on', 'dipole', 'moment', 'were', 'obtained', 'for', 'integrated', 'luminosity', 'of', 'call', '5002000', 'fb1', 'and', 'center', 'of', 'mass', 'between', '05', 'and', '30', 'tev', 'the', 'estimated', 'limits', 'for', 'the', 'tauneutrino', 'magnetic', 'and', 'electric', 'dipole', 'moments', 'are', 'improved', 'by', '23', 'orders', 'of', 'magnitude', 'and', 'complement', 'previous', 'studies', 'on', 'the', 'dipole', 'moments']] | [-0.06105831749935416, 0.1842243466773962, 0.03440742907727365, 0.13715265935009463, -0.011041877907700837, -0.04467872957738631, 0.023948864623076938, 0.3791886452347674, -0.18057474307963586, -0.33818910780184447, 0.018283023695867668, -0.34602891433825517, 0.09149778230819217, 0.19915942064526074, 0.1499549590814066, 0.041091437359895316, 0.011633983706718589, 0.019162312417509073, -0.07621786571008728, -0.1720238218896408, 0.21854647079561937, 0.10944322496652603, 0.24478239670118435, 0.09370477171614766, 0.10570229729637504, 0.0012290547998186122, -0.03440932666962134, -0.08948341320625487, -0.1270083183858623, 0.07918176044056073, 0.17248685315172088, 0.05467055672581526, 0.1028486083539084, -0.40176696884148616, -0.060992463065826515, 0.1286972272655669, 0.11507143317028246, -0.029095100337996126, -0.008101957114512457, -0.31771568785560256, 0.09681327943937813, -0.20983978107254556, -0.14191629903569342, -0.01072654448092935, 0.05379839523873748, 0.011393773577552526, -0.35947465980821786, 0.09308904184504076, 0.0027257109090606585, 0.09206940459107306, -0.05732050584629178, -0.25890454123827056, -0.027706964308039306, -0.05052552425470996, 0.11883712242768601, 0.08952467404634128, 0.21746797314498256, -0.11679907569332305, -0.18347684639268258, 0.3400038716561617, -0.09969776508428077, -0.11152624927381886, 0.14647023824657848, -0.265172347282753, -0.12482428735746269, 0.16893684261656822, 0.2548858634978929, 0.054983099996845454, -0.15636858234102738, 0.16578977148511764, 0.027003044176145775, 0.13195399587052536, 0.0695102143329271, 0.02772120331374413, 0.25130161712289184, 0.19670527662705392, 0.07655879640159138, 0.02598883747618566, -0.18577944670130123, 0.04494076010652204, -0.37193462134839256, -0.09253408309032625, -0.11075814116369695, 0.10698923907624161, -0.09112706786796247, -0.03151902280985675, 0.382302807188256, 0.08735945905704903, 0.2383566759229499, 0.005854649729333184, 0.29363249896213095, 0.1597410936510448, 0.048971198306002835, 0.051084170649467506, 0.33272888328622474, 0.16938704244812278, 0.09323858340677033, -0.2802819448939346, 0.006807834717464891, 0.061011166886446325] |
1,803.03539 | Donovan's conjecture and blocks with abelian defect groups | We give a reduction of Donovan's conjecture for abelian groups to a similar
statement for quasisimple groups. Consequently we show that Donovan's
conjecture holds for abelian $2$-groups.
| math.RT math.GR | we give a reduction of donovans conjecture for abelian groups to a similar statement for quasisimple groups consequently we show that donovans conjecture holds for abelian 2groups | [['we', 'give', 'a', 'reduction', 'of', 'donovans', 'conjecture', 'for', 'abelian', 'groups', 'to', 'a', 'similar', 'statement', 'for', 'quasisimple', 'groups', 'consequently', 'we', 'show', 'that', 'donovans', 'conjecture', 'holds', 'for', 'abelian', '2groups']] | [-0.23674127031807546, 0.1138641587846602, -0.15613321559848609, 0.18194164425410606, -0.09989049878937227, -0.21237267398585877, 0.07641988468390924, 0.35031404153064444, -0.21179632125077424, -0.23039877580271828, 0.07061945222732094, -0.16880938521137945, -0.11501186009910372, 0.27956454511041995, -0.21376797170550735, -0.13005551716519725, 0.04701469335015173, 0.06650048101113902, -0.055520153889018625, -0.4613920562659149, 0.3781592222275557, -0.145947830406604, 0.2797219818113027, 0.16778704951758738, 0.08046384458807383, 0.08525583089363796, 0.02229034141809852, -0.01058296431545858, -0.14541979935327415, 0.1196684433875985, 0.3989825185250353, 0.03474081556002299, 0.15646314731350652, -0.2893560622577314, -0.1619599530197404, 0.2660538172349334, 0.11078266290671847, 0.13557064919560044, -0.15198929846735187, -0.21395263096524608, 0.2300189180230653, -0.2391248110819746, -0.2496068283950013, -0.09478486143052578, 0.15209172031393758, -0.09434179630544451, -0.2545558128643919, 0.08311464332251085, 0.19854679765800634, 0.16592024618552792, -0.11323324121810772, -0.06755787848184507, 0.016701010366280872, 0.10554007161408663, -0.002491455525159836, -0.05343859070153148, 0.02174211862600512, -0.09960253805749947, -0.2103712996467948, 0.4028376947950434, -0.06583875983401581, -0.12316900250260476, 0.11366642663186347, -0.13914188673650776, -0.34923693634293695, 0.10480082276518699, 0.022773913625213835, 0.10315402241906634, 0.10461696264920411, 0.16460046448089458, -0.2945322063234117, 0.07295490111465808, 0.1388935419489388, -0.03916522941586596, 0.03796205614452009, 0.05629771871975175, 0.14050002471992262, 0.16313314389575412, 0.14195080225666365, 0.14305164333846834, -0.3405263451514421, -0.2909272099258723, -0.01861038224564658, 0.2321597401190687, -0.06635542560575737, -0.1584700182321723, 0.3199579029309529, 0.12571426957017845, 0.041317675124715875, 0.30028768856492305, 0.10637034406816517, 0.01165476593154448, 0.05873695009008602, 0.058758231776731985, 0.07214929756742937, 0.32367145697827693, -0.16497551545035094, -0.0705669359476478, -0.08138476952013594, 0.2849816700650586] |
1,803.0354 | An approach for modeling of multiphase flows as random processes | The basic system of differential equations for a multiphase flow with the
introduction of the probability of each phase in the flow is considered. The
main analysis is focused on the case of a heterogeneous two-phase flow. The
conservation equations for mass, momentum and energy are obtained under the
assumption that parameters of the interacting phases are players of the
statistical process. In parallel, dynamical system by the Kolmogorov's theorem
for two states of a statistical system (phases of a two-phase mixture) is
considered. Probability of phases in a flow is taken further for comparison
with the probability and parameters of a two-phase flow from the equations of
flow dynamics. Analysis of the parameters of a two-phase flow is performed as
relating to available flow regimes from a statistical point of view on the
basis of achievable parameter values and, first of all, on the condition that
the probability is strictly in the range from 0 to 1. Correspondence of
parameters by the equation array for flow dynamics and by solution of the
dynamical system of two phases (two interacting statistical states) revealed
the values of the coefficients for dynamical system, expressed in terms of the
flow parameters. The results obtained are intended for further discussion,
research, comparison with experimental data and with results of other
researchers of the multiphase flows.
| physics.flu-dyn | the basic system of differential equations for a multiphase flow with the introduction of the probability of each phase in the flow is considered the main analysis is focused on the case of a heterogeneous twophase flow the conservation equations for mass momentum and energy are obtained under the assumption that parameters of the interacting phases are players of the statistical process in parallel dynamical system by the kolmogorovs theorem for two states of a statistical system phases of a twophase mixture is considered probability of phases in a flow is taken further for comparison with the probability and parameters of a twophase flow from the equations of flow dynamics analysis of the parameters of a twophase flow is performed as relating to available flow regimes from a statistical point of view on the basis of achievable parameter values and first of all on the condition that the probability is strictly in the range from 0 to 1 correspondence of parameters by the equation array for flow dynamics and by solution of the dynamical system of two phases two interacting statistical states revealed the values of the coefficients for dynamical system expressed in terms of the flow parameters the results obtained are intended for further discussion research comparison with experimental data and with results of other researchers of the multiphase flows | [['the', 'basic', 'system', 'of', 'differential', 'equations', 'for', 'a', 'multiphase', 'flow', 'with', 'the', 'introduction', 'of', 'the', 'probability', 'of', 'each', 'phase', 'in', 'the', 'flow', 'is', 'considered', 'the', 'main', 'analysis', 'is', 'focused', 'on', 'the', 'case', 'of', 'a', 'heterogeneous', 'twophase', 'flow', 'the', 'conservation', 'equations', 'for', 'mass', 'momentum', 'and', 'energy', 'are', 'obtained', 'under', 'the', 'assumption', 'that', 'parameters', 'of', 'the', 'interacting', 'phases', 'are', 'players', 'of', 'the', 'statistical', 'process', 'in', 'parallel', 'dynamical', 'system', 'by', 'the', 'kolmogorovs', 'theorem', 'for', 'two', 'states', 'of', 'a', 'statistical', 'system', 'phases', 'of', 'a', 'twophase', 'mixture', 'is', 'considered', 'probability', 'of', 'phases', 'in', 'a', 'flow', 'is', 'taken', 'further', 'for', 'comparison', 'with', 'the', 'probability', 'and', 'parameters', 'of', 'a', 'twophase', 'flow', 'from', 'the', 'equations', 'of', 'flow', 'dynamics', 'analysis', 'of', 'the', 'parameters', 'of', 'a', 'twophase', 'flow', 'is', 'performed', 'as', 'relating', 'to', 'available', 'flow', 'regimes', 'from', 'a', 'statistical', 'point', 'of', 'view', 'on', 'the', 'basis', 'of', 'achievable', 'parameter', 'values', 'and', 'first', 'of', 'all', 'on', 'the', 'condition', 'that', 'the', 'probability', 'is', 'strictly', 'in', 'the', 'range', 'from', '0', 'to', '1', 'correspondence', 'of', 'parameters', 'by', 'the', 'equation', 'array', 'for', 'flow', 'dynamics', 'and', 'by', 'solution', 'of', 'the', 'dynamical', 'system', 'of', 'two', 'phases', 'two', 'interacting', 'statistical', 'states', 'revealed', 'the', 'values', 'of', 'the', 'coefficients', 'for', 'dynamical', 'system', 'expressed', 'in', 'terms', 'of', 'the', 'flow', 'parameters', 'the', 'results', 'obtained', 'are', 'intended', 'for', 'further', 'discussion', 'research', 'comparison', 'with', 'experimental', 'data', 'and', 'with', 'results', 'of', 'other', 'researchers', 'of', 'the', 'multiphase', 'flows']] | [-0.15359845486937335, 0.11021982443127022, -0.11750452735617217, -0.006957182795246491, 0.015480241036607265, -0.10608643372132279, 0.025918030328321698, 0.29146698636436896, -0.2641860506838668, -0.28774856772627766, 0.12071585363120566, -0.278396016926551, -0.08734237507609356, 0.21081866857878087, -0.006789096500471706, 0.1064454791889625, 0.06372863152886138, 0.03770294489404313, -0.06582451462787808, -0.18305782544767965, 0.3718552344881116, 0.014292816176369988, 0.2807023362151233, 0.013770155615765365, 0.11870384360484493, -0.020233625027233085, -0.034777974065106645, 0.05819384903094955, -0.15843222104256596, 0.08728591007669351, 0.21353571785706604, 0.09127860376189939, 0.2349630616251295, -0.40969372518798886, -0.26123596131127347, 0.049715444190655225, 0.10479029152348503, 0.07129927951991621, -0.03823224178829327, -0.2633644121212303, 0.06717584022253381, -0.14931691679850692, -0.12556090141220938, -0.030244498500996586, -0.004606103162150577, 0.07950616429867517, -0.29715375157233276, 0.11075532907773888, 0.05708618072713346, 0.07049242983154987, -0.1028242753898963, -0.10520156442948377, -0.037248768359085555, 0.14214410534238114, 0.06365232083330677, -0.018336437143199987, 0.10726712452357307, -0.1863011665920394, -0.07820919311786602, 0.41037329956383456, -0.048973523071393944, -0.22139331337688195, 0.18822138490180623, -0.12154860030548917, -0.11131132901351208, 0.14417469271193195, 0.18297910582320553, 0.11300586674644768, -0.16658726256189033, 0.04290842440646201, -0.058952490598957866, 0.16153173610987878, -0.020985212689054903, -0.010765659637597487, 0.1815170414568814, 0.18737527308353472, 0.05689266312243712, 0.13407958036196962, -0.06202543092095104, -0.16942369258579085, -0.32483372978899816, -0.1607951831822684, -0.16462212916499433, 0.011865071168514938, -0.11084992055246781, -0.11672056942959042, 0.42253155017701477, 0.11914583160099468, 0.1983323632760555, 0.024392934594033664, 0.28285689994153396, 0.12823095065130688, -0.0079756028619932, 0.06293975334083535, 0.2389630450428847, 0.15760195484317469, 0.1187515302447442, -0.20838884679638522, 0.06389914749493629, 0.0852873885295063] |
1,803.03541 | Homoclinically expansive actions and a Garden of Eden theorem for
harmonic models | Let $\Gamma$ be a countable Abelian group and $f \in \Z[\Gamma]$, where
$\Z[\Gamma]$ denotes the integral group ring of $\Gamma$. Consider the
Pontryagin dual $X_f$ of the cyclic $\Z[\Gamma]$-module $\Z[\Gamma]/\Z[\Gamma]
f$ and suppose that $f$ is weakly expansive (e.g., $f$ is invertible in
$\ell^1(\Gamma)$, or, when $\Gamma$ is not virtually $\Z$ or $\Z^2$, $f$ is
well-balanced) and that $X_f$ is connected. We prove that if $\tau \colon X_f
\to X_f$ is a $\Gamma$-equivariant continuous map, then $\tau$ is surjective if
and only if the restriction of $\tau$ to each $\Gamma$-homoclinicity class is
injective. We also show that this equivalence remains valid in the case when
$\Gamma = \Z^d$ and $f \in \Z[\Gamma] = \Z[u_1,u_1^{-1}, \ldots, u_d,
u_d^{-1}]$ is an irreducible atoral polynomial such that its zero-set $Z(f)$ is
contained in the image of the intersection of $[0,1]^d$ and a finite union of
hyperplanes in $\R^d$ under the quotient map $\R^d \to \T^d$ (e.g., when $d
\geq 2$ such that $Z(f)$ is finite). These two results are analogues of the
classical Garden of Eden theorem of Moore and Myhill for cellular automata with
finite alphabet over $\Gamma$.
| math.DS math.GR | let gamma be a countable abelian group and f in zgamma where zgamma denotes the integral group ring of gamma consider the pontryagin dual x_f of the cyclic zgammamodule zgammazgamma f and suppose that f is weakly expansive eg f is invertible in ell1gamma or when gamma is not virtually z or z2 f is wellbalanced and that x_f is connected we prove that if tau colon x_f to x_f is a gammaequivariant continuous map then tau is surjective if and only if the restriction of tau to each gammahomoclinicity class is injective we also show that this equivalence remains valid in the case when gamma zd and f in zgamma zu_1u_11 ldots u_d u_d1 is an irreducible atoral polynomial such that its zeroset zf is contained in the image of the intersection of 01d and a finite union of hyperplanes in rd under the quotient map rd to td eg when d geq 2 such that zf is finite these two results are analogues of the classical garden of eden theorem of moore and myhill for cellular automata with finite alphabet over gamma | [['let', 'gamma', 'be', 'a', 'countable', 'abelian', 'group', 'and', 'f', 'in', 'zgamma', 'where', 'zgamma', 'denotes', 'the', 'integral', 'group', 'ring', 'of', 'gamma', 'consider', 'the', 'pontryagin', 'dual', 'x_f', 'of', 'the', 'cyclic', 'zgammamodule', 'zgammazgamma', 'f', 'and', 'suppose', 'that', 'f', 'is', 'weakly', 'expansive', 'eg', 'f', 'is', 'invertible', 'in', 'ell1gamma', 'or', 'when', 'gamma', 'is', 'not', 'virtually', 'z', 'or', 'z2', 'f', 'is', 'wellbalanced', 'and', 'that', 'x_f', 'is', 'connected', 'we', 'prove', 'that', 'if', 'tau', 'colon', 'x_f', 'to', 'x_f', 'is', 'a', 'gammaequivariant', 'continuous', 'map', 'then', 'tau', 'is', 'surjective', 'if', 'and', 'only', 'if', 'the', 'restriction', 'of', 'tau', 'to', 'each', 'gammahomoclinicity', 'class', 'is', 'injective', 'we', 'also', 'show', 'that', 'this', 'equivalence', 'remains', 'valid', 'in', 'the', 'case', 'when', 'gamma', 'zd', 'and', 'f', 'in', 'zgamma', 'zu_1u_11', 'ldots', 'u_d', 'u_d1', 'is', 'an', 'irreducible', 'atoral', 'polynomial', 'such', 'that', 'its', 'zeroset', 'zf', 'is', 'contained', 'in', 'the', 'image', 'of', 'the', 'intersection', 'of', '01d', 'and', 'a', 'finite', 'union', 'of', 'hyperplanes', 'in', 'rd', 'under', 'the', 'quotient', 'map', 'rd', 'to', 'td', 'eg', 'when', 'd', 'geq', '2', 'such', 'that', 'zf', 'is', 'finite', 'these', 'two', 'results', 'are', 'analogues', 'of', 'the', 'classical', 'garden', 'of', 'eden', 'theorem', 'of', 'moore', 'and', 'myhill', 'for', 'cellular', 'automata', 'with', 'finite', 'alphabet', 'over', 'gamma']] | [-0.16022562688902123, 0.19695989043498735, -0.06674207698088139, 0.021823373482847172, -0.05436717213338448, -0.18223263081680569, -0.000763430724651294, 0.3714412000651161, -0.3466248207518624, -0.09164630444461687, 0.07221562855831709, -0.28770097517634796, -0.08292906914397867, 0.17702801974470883, -0.0876744973887172, -0.030943345593146255, 0.03604029170754883, 0.14174127579770154, -0.0440627480404348, -0.2668142866821856, 0.3354231969582745, -0.09444975045820077, 0.18632522514477992, 0.04478841520580722, 0.09616160327051249, 0.027839497511094023, -0.020238484969983497, 0.013802691291655518, -0.16961797711612436, 0.014348230195335217, 0.30282657316161526, 0.12076802449947636, 0.2220783654724073, -0.2876711470488873, -0.13077822896238003, 0.28282624596936834, 0.121102396474291, -0.10500399577431381, 0.020147802006168704, -0.24594846475326146, 0.19182168929966995, -0.16516125126379647, -0.085150075584857, 0.010595429587152063, 0.14505089951886072, 0.028478635075670253, -0.3479201051639393, 0.022273682074511372, 0.14206599764939812, 0.10067255613394081, -0.0066997747473780895, -0.10608766182946662, -0.09572203872570147, 0.054496047211028374, -0.0026026978590784388, 0.16935219451422906, 0.07678630329852847, -0.08608544765027343, -0.08337376501165433, 0.4010492090627344, -0.08800650468846369, -0.25238826347308024, 0.15111341765409128, -0.24803930986155237, -0.17484702869421906, 0.1467841606690652, 0.09146202122663251, 0.12157001032545749, -0.04044292437991114, 0.2927446045114064, -0.13797157768987947, 0.12387607691085173, 0.06253478049766273, -0.01970830519955295, 0.09303711936291721, 0.10719643740578451, 0.11696146889217844, 0.10866082630495334, -0.030259737752688427, 0.030200653336942197, -0.3928185446705255, -0.17789641642011703, -0.15592472261438767, 0.1664895022560409, -0.08011147596609791, -0.14818387699520422, 0.29464649184762187, 0.024584599859533936, 0.1669842172232974, 0.13894247100041765, 0.21236618931094806, 0.09492178647390877, 0.004874662866091562, 0.09315189280702423, 0.07063204105943441, 0.16994797532550163, -0.06896965118745962, -0.16398428983262014, 0.008441345023068909, 0.17559341778202603] |
1,803.03542 | Volvox barberi flocks, forming near-optimal, two-dimensional,
polydisperse lattice packings | Volvox barberi is a multicellular green alga forming spherical colonies of
10000-50000 differentiated somatic and germ cells. Here, I show that these
colonies actively self-organize over minutes into "flocks" that can contain
more than 100 colonies moving and rotating collectively for hours. The colonies
in flocks form two-dimensional, irregular, "active crystals", with lattice
angles and colony diameters both following log-normal distributions. Comparison
with a dynamical simulation of soft spheres with diameters matched to the
Volvox samples, and a weak long-range attractive force, show that the Volvox
flocks achieve optimal random close-packing. A dye tracer in the Volvox medium
revealed large hydrodynamic vortices generated by colony and flock rotations,
providing a likely source of the forces leading to flocking and optimal
packing.
| q-bio.QM cond-mat.soft | volvox barberi is a multicellular green alga forming spherical colonies of 1000050000 differentiated somatic and germ cells here i show that these colonies actively selforganize over minutes into flocks that can contain more than 100 colonies moving and rotating collectively for hours the colonies in flocks form twodimensional irregular active crystals with lattice angles and colony diameters both following lognormal distributions comparison with a dynamical simulation of soft spheres with diameters matched to the volvox samples and a weak longrange attractive force show that the volvox flocks achieve optimal random closepacking a dye tracer in the volvox medium revealed large hydrodynamic vortices generated by colony and flock rotations providing a likely source of the forces leading to flocking and optimal packing | [['volvox', 'barberi', 'is', 'a', 'multicellular', 'green', 'alga', 'forming', 'spherical', 'colonies', 'of', '1000050000', 'differentiated', 'somatic', 'and', 'germ', 'cells', 'here', 'i', 'show', 'that', 'these', 'colonies', 'actively', 'selforganize', 'over', 'minutes', 'into', 'flocks', 'that', 'can', 'contain', 'more', 'than', '100', 'colonies', 'moving', 'and', 'rotating', 'collectively', 'for', 'hours', 'the', 'colonies', 'in', 'flocks', 'form', 'twodimensional', 'irregular', 'active', 'crystals', 'with', 'lattice', 'angles', 'and', 'colony', 'diameters', 'both', 'following', 'lognormal', 'distributions', 'comparison', 'with', 'a', 'dynamical', 'simulation', 'of', 'soft', 'spheres', 'with', 'diameters', 'matched', 'to', 'the', 'volvox', 'samples', 'and', 'a', 'weak', 'longrange', 'attractive', 'force', 'show', 'that', 'the', 'volvox', 'flocks', 'achieve', 'optimal', 'random', 'closepacking', 'a', 'dye', 'tracer', 'in', 'the', 'volvox', 'medium', 'revealed', 'large', 'hydrodynamic', 'vortices', 'generated', 'by', 'colony', 'and', 'flock', 'rotations', 'providing', 'a', 'likely', 'source', 'of', 'the', 'forces', 'leading', 'to', 'flocking', 'and', 'optimal', 'packing']] | [-0.13815830106517143, 0.24380679417711992, -0.08961346855697533, 0.027209037351227986, -0.021852061532748244, -0.14288236657788123, 0.025876035992162847, 0.4003555158851668, -0.2340681634610519, -0.26305304241832345, 0.025047907279804348, -0.281207644722114, -0.2227892456964279, 0.12769334724483392, -0.04053776939448047, -0.001976166865400349, 0.03869642152955445, -0.06931905976477234, 0.10718145776578845, -0.22181393411786607, 0.17564412536448798, -0.005067449160075436, 0.256500794608534, -0.08207231229171157, 0.13852783010903902, -0.050203509513812604, 0.051603143685497344, 0.06938183974707499, -0.1743889689473993, 0.0892469595593866, 0.1863510247048301, 0.015008208066380273, 0.25190542863759524, -0.4990933931277444, -0.21226954277566012, 0.09235597352186839, 0.20795577177001784, 0.09610121454655503, -0.0832644556286444, -0.2793997825045759, 0.06982238706453549, -0.13828688168820616, -0.21525806812181447, -0.049603198243615525, 0.07836899011163041, 0.1531554534798488, -0.2769024908183686, 0.12099964076818044, 0.030993651693036858, 0.1125302489536504, -0.10025816784667162, -0.08747366438619793, -0.08009357121773064, 0.132976882175232, 0.031217399767289558, 0.013515024702064693, 0.25879462021403016, -0.12394631075828026, -0.08890336406572412, 0.40999710018125674, 0.028206690942533898, -0.16245021306094715, 0.2660522037030508, -0.17984928478254006, -0.05987337251814703, 0.2243466983937348, 0.22199819026476084, 0.0980755625423626, -0.1413346277161812, -0.08672565973344414, -0.11235646864709754, 0.18274972439588358, 0.14769834030885248, -0.04844294680515304, 0.24652767124352976, 0.1920243544736877, 0.0589110624898846, 0.10355230029575371, -0.08864417358139083, -0.13762859598112603, -0.14170378839286665, -0.12245947913421938, -0.14479517207461565, 0.06139618648060908, -0.1304865826185657, -0.18185191535934184, 0.2931504219945055, 0.028665946637435505, 0.16673592046863633, 0.13655844345145549, 0.19834653369228666, -0.06921855399850756, 0.11203213685657828, 0.06606643804892277, 0.1957885170976321, 0.059589942959913364, 0.1004583656739366, -0.23500320903258398, 0.03140573088894598, 0.03206470009754412] |
1,803.03543 | Non-ergodic states induced by impurity levels in quantum spin chains | The semi-infinite XY spin chain with an impurity at the boundary has been
chosen as a prototype of interacting many-body systems to test for non-ergodic
behavior. The model is exactly solvable in analytic way in the thermodynamic
limit, where energy eigenstates and the spectrum are obtained in closed form.
In addition of a continuous band, localized states may split off from the
continuum, for some values of the impurity parameters. In the next step, after
the preparation of an arbitrary non-equilibrium state, we observe the time
evolution of the site magnetization. Relaxation properties are described by the
long-time behavior, which is estimated using the stationary phase method.
Absence of localized states defines an ergodic region in parameter space, where
the system relaxes to a homogeneous magnetization. Out of this region, impurity
levels split from the band, and localization phenomena may lead to
non-ergodicity.
| cond-mat.stat-mech | the semiinfinite xy spin chain with an impurity at the boundary has been chosen as a prototype of interacting manybody systems to test for nonergodic behavior the model is exactly solvable in analytic way in the thermodynamic limit where energy eigenstates and the spectrum are obtained in closed form in addition of a continuous band localized states may split off from the continuum for some values of the impurity parameters in the next step after the preparation of an arbitrary nonequilibrium state we observe the time evolution of the site magnetization relaxation properties are described by the longtime behavior which is estimated using the stationary phase method absence of localized states defines an ergodic region in parameter space where the system relaxes to a homogeneous magnetization out of this region impurity levels split from the band and localization phenomena may lead to nonergodicity | [['the', 'semiinfinite', 'xy', 'spin', 'chain', 'with', 'an', 'impurity', 'at', 'the', 'boundary', 'has', 'been', 'chosen', 'as', 'a', 'prototype', 'of', 'interacting', 'manybody', 'systems', 'to', 'test', 'for', 'nonergodic', 'behavior', 'the', 'model', 'is', 'exactly', 'solvable', 'in', 'analytic', 'way', 'in', 'the', 'thermodynamic', 'limit', 'where', 'energy', 'eigenstates', 'and', 'the', 'spectrum', 'are', 'obtained', 'in', 'closed', 'form', 'in', 'addition', 'of', 'a', 'continuous', 'band', 'localized', 'states', 'may', 'split', 'off', 'from', 'the', 'continuum', 'for', 'some', 'values', 'of', 'the', 'impurity', 'parameters', 'in', 'the', 'next', 'step', 'after', 'the', 'preparation', 'of', 'an', 'arbitrary', 'nonequilibrium', 'state', 'we', 'observe', 'the', 'time', 'evolution', 'of', 'the', 'site', 'magnetization', 'relaxation', 'properties', 'are', 'described', 'by', 'the', 'longtime', 'behavior', 'which', 'is', 'estimated', 'using', 'the', 'stationary', 'phase', 'method', 'absence', 'of', 'localized', 'states', 'defines', 'an', 'ergodic', 'region', 'in', 'parameter', 'space', 'where', 'the', 'system', 'relaxes', 'to', 'a', 'homogeneous', 'magnetization', 'out', 'of', 'this', 'region', 'impurity', 'levels', 'split', 'from', 'the', 'band', 'and', 'localization', 'phenomena', 'may', 'lead', 'to', 'nonergodicity']] | [-0.14151752700254164, 0.1813874221173843, -0.08132417471037356, 0.0444512438668928, 0.020041434361332364, -0.13345037038939503, 0.0541056540055474, 0.35899755413077405, -0.27605396008991695, -0.24023702115445703, 0.0778824398798829, -0.27024038053293536, -0.06266499097927936, 0.17005352401239732, 0.037925447232718415, 0.03409943478827127, 0.028973640319020194, 0.052849580388893924, -0.09346081820394765, -0.17552340828481464, 0.3044705274164794, 0.024165638152614133, 0.2681914532778563, 0.03434337343421433, 0.05607549616923699, 0.02920375892996684, 0.11002090413504365, 0.0196182798442408, -0.11460739945328527, 0.023750924204892995, 0.2593314946365341, 0.00023948011587706064, 0.2376142493970171, -0.43246742856356646, -0.21320553413442486, 0.0800690288945277, 0.17567789857927057, 0.1409097075082974, 0.003909483832027112, -0.318745349455703, -0.0010798622559861058, -0.13784308661869565, -0.19817726565785446, -0.054366016301319944, 0.008369266517929264, -0.004177260254933076, -0.2599196118160991, 0.09875111107981496, 0.06617924015011664, 0.033653335752110346, -0.10295267816685089, -0.06379328898587297, -0.053165684516014125, 0.14167183131904348, 0.027526897170672103, 0.007562524378560223, 0.14000719080359994, -0.11457942964890125, -0.09589322584752853, 0.34319837808192194, -0.07050056478588262, -0.18077691609261337, 0.18043750500912173, -0.16210520076337498, -0.11607538523816771, 0.17286448107081484, 0.12500907401912487, 0.10123963837049432, -0.16619600362382125, 0.13016242513493545, -0.021378809575584124, 0.1586035834674209, -0.005010574951872126, 0.05539754072165156, 0.23331775727284537, 0.16859550578715085, 0.08315454616856116, 0.20116213412786071, -0.09935408552385658, -0.1599655524889411, -0.2978523449672686, -0.13725432794593223, -0.2357563223116673, 0.0783724706698131, -0.06327114192670426, -0.19469664343535067, 0.43579021187570804, 0.11231801551633004, 0.20398353368786354, 0.005346995932245431, 0.19778733085710687, 0.1834560073513238, -0.004039707792258555, 0.07580912218207715, 0.221282264568812, 0.11102070025708917, 0.08245843357790808, -0.276644383873009, 0.055833026745610616, 0.0647142956007298] |
1,803.03544 | Explaining Black-box Android Malware Detection | Machine-learning models have been recently used for detecting malicious
Android applications, reporting impressive performances on benchmark datasets,
even when trained only on features statically extracted from the application,
such as system calls and permissions. However, recent findings have highlighted
the fragility of such in-vitro evaluations with benchmark datasets, showing
that very few changes to the content of Android malware may suffice to evade
detection. How can we thus trust that a malware detector performing well on
benchmark data will continue to do so when deployed in an operating
environment? To mitigate this issue, the most popular Android malware detectors
use linear, explainable machine-learning models to easily identify the most
influential features contributing to each decision. In this work, we generalize
this approach to any black-box machine- learning model, by leveraging a
gradient-based approach to identify the most influential local features. This
enables using nonlinear models to potentially increase accuracy without
sacrificing interpretability of decisions. Our approach also highlights the
global characteristics learned by the model to discriminate between benign and
malware applications. Finally, as shown by our empirical analysis on a popular
Android malware detection task, it also helps identifying potential
vulnerabilities of linear and nonlinear models against adversarial
manipulations.
| cs.LG cs.CR stat.ML | machinelearning models have been recently used for detecting malicious android applications reporting impressive performances on benchmark datasets even when trained only on features statically extracted from the application such as system calls and permissions however recent findings have highlighted the fragility of such invitro evaluations with benchmark datasets showing that very few changes to the content of android malware may suffice to evade detection how can we thus trust that a malware detector performing well on benchmark data will continue to do so when deployed in an operating environment to mitigate this issue the most popular android malware detectors use linear explainable machinelearning models to easily identify the most influential features contributing to each decision in this work we generalize this approach to any blackbox machine learning model by leveraging a gradientbased approach to identify the most influential local features this enables using nonlinear models to potentially increase accuracy without sacrificing interpretability of decisions our approach also highlights the global characteristics learned by the model to discriminate between benign and malware applications finally as shown by our empirical analysis on a popular android malware detection task it also helps identifying potential vulnerabilities of linear and nonlinear models against adversarial manipulations | [['machinelearning', 'models', 'have', 'been', 'recently', 'used', 'for', 'detecting', 'malicious', 'android', 'applications', 'reporting', 'impressive', 'performances', 'on', 'benchmark', 'datasets', 'even', 'when', 'trained', 'only', 'on', 'features', 'statically', 'extracted', 'from', 'the', 'application', 'such', 'as', 'system', 'calls', 'and', 'permissions', 'however', 'recent', 'findings', 'have', 'highlighted', 'the', 'fragility', 'of', 'such', 'invitro', 'evaluations', 'with', 'benchmark', 'datasets', 'showing', 'that', 'very', 'few', 'changes', 'to', 'the', 'content', 'of', 'android', 'malware', 'may', 'suffice', 'to', 'evade', 'detection', 'how', 'can', 'we', 'thus', 'trust', 'that', 'a', 'malware', 'detector', 'performing', 'well', 'on', 'benchmark', 'data', 'will', 'continue', 'to', 'do', 'so', 'when', 'deployed', 'in', 'an', 'operating', 'environment', 'to', 'mitigate', 'this', 'issue', 'the', 'most', 'popular', 'android', 'malware', 'detectors', 'use', 'linear', 'explainable', 'machinelearning', 'models', 'to', 'easily', 'identify', 'the', 'most', 'influential', 'features', 'contributing', 'to', 'each', 'decision', 'in', 'this', 'work', 'we', 'generalize', 'this', 'approach', 'to', 'any', 'blackbox', 'machine', 'learning', 'model', 'by', 'leveraging', 'a', 'gradientbased', 'approach', 'to', 'identify', 'the', 'most', 'influential', 'local', 'features', 'this', 'enables', 'using', 'nonlinear', 'models', 'to', 'potentially', 'increase', 'accuracy', 'without', 'sacrificing', 'interpretability', 'of', 'decisions', 'our', 'approach', 'also', 'highlights', 'the', 'global', 'characteristics', 'learned', 'by', 'the', 'model', 'to', 'discriminate', 'between', 'benign', 'and', 'malware', 'applications', 'finally', 'as', 'shown', 'by', 'our', 'empirical', 'analysis', 'on', 'a', 'popular', 'android', 'malware', 'detection', 'task', 'it', 'also', 'helps', 'identifying', 'potential', 'vulnerabilities', 'of', 'linear', 'and', 'nonlinear', 'models', 'against', 'adversarial', 'manipulations']] | [-0.04191277774691116, -0.034214056792479824, -0.07354595475597307, 0.0846723473345628, -0.13211748172761872, -0.23878958377987147, 0.07507632764521986, 0.3904494068259373, -0.23197307890455704, -0.37539038243703543, 0.10260665459907614, -0.33903736289124936, -0.21185464987298475, 0.2564448525564512, -0.11450976503198035, 0.1351194921019487, 0.08600277885096147, 0.027041836325079203, -0.033089640467660504, -0.33678576249745673, 0.2976802867841525, 0.08292210788931698, 0.3082980157947168, 0.06690620322013274, 0.0431198191648582, -0.023898074000899213, -0.03278841050923802, -0.010645258679360267, -0.033378927073572415, 0.1269194524104023, 0.389112249871032, 0.2258987603604328, 0.34088770306494554, -0.42763428159873, -0.2414537320099771, 0.12219433037564159, 0.154364347262308, 0.1289156263101904, -0.054309346909722084, -0.366157658965094, 0.13002918180427514, -0.21565446769236588, -0.06102883881190792, -0.19471960437949748, -0.019951059918676038, -0.005025250539474655, -0.2206400801707059, -0.015276845975604374, 0.04367841787810903, 0.06811546548677143, -0.002114181057550013, -0.08695148594444618, 0.0037062969955150037, 0.16062688688602067, 0.10203073773707728, -0.021369290838483723, 0.2096434216783382, -0.17489959641185124, -0.18068775746505708, 0.31196828223066403, -0.05615577310352819, -0.17291881515469867, 0.25909243878559207, 0.03325484140019398, -0.17373639945639296, 0.06796355969738216, 0.2643894950510003, 0.11825304818339646, -0.19423417445112137, 0.0017148671849281528, 0.003461729786358774, 0.225108069058042, 0.0395963499462232, -0.013772405919153243, 0.18110354920790997, 0.24351287681463873, 0.013387716460274533, 0.11572668581909966, -0.10219310224551009, -0.02868520045594778, -0.1880973283527419, -0.08085846798261627, -0.1581215006392449, -0.0015191704541211949, -0.08570948493179457, -0.1492705676976766, 0.41626540505792947, 0.32318869188951793, 0.15822557541774585, 0.06126941567403264, 0.3614470700861421, -0.009633182580582798, 0.14348977628163995, 0.09905538800609065, 0.20907161289360374, -0.03456096964073367, 0.11227617711992935, -0.1612826170149492, 0.1650629881635541, -0.016346266114269384] |
1,803.03545 | Digital Communication with Rydberg Atoms & Amplitude-Modulated Microwave
Fields | Rydberg atoms, with one highly-excited, nearly-ionized electron, have extreme
sensitivity to electric fields, including microwave fields ranging from 100 MHz
to over 1 THz. Here we show that room-temperature Rydberg atoms can be used as
sensitive, high bandwidth, microwave communication antennas. We demonstrate
near photon-shot-noise limited readout of data encoded in amplitude-modulated
17 GHz microwaves, using an electromagnetically-induced-transparency (EIT)
probing scheme. We measure a photon-shot-noise limited channel capacity of up
to 8.2 Mbit/s and implement an 8-state phase-shift-keying digital communication
protocol. The bandwidth of the EIT probing scheme is found to be limited by the
available coupling laser power and the natural linewidth of the rubidium D2
transition. We discuss how atomic communications receivers offer several
opportunities to surpass the capabilities of classical antennas.
| physics.atom-ph physics.optics quant-ph | rydberg atoms with one highlyexcited nearlyionized electron have extreme sensitivity to electric fields including microwave fields ranging from 100 mhz to over 1 thz here we show that roomtemperature rydberg atoms can be used as sensitive high bandwidth microwave communication antennas we demonstrate near photonshotnoise limited readout of data encoded in amplitudemodulated 17 ghz microwaves using an electromagneticallyinducedtransparency eit probing scheme we measure a photonshotnoise limited channel capacity of up to 82 mbits and implement an 8state phaseshiftkeying digital communication protocol the bandwidth of the eit probing scheme is found to be limited by the available coupling laser power and the natural linewidth of the rubidium d2 transition we discuss how atomic communications receivers offer several opportunities to surpass the capabilities of classical antennas | [['rydberg', 'atoms', 'with', 'one', 'highlyexcited', 'nearlyionized', 'electron', 'have', 'extreme', 'sensitivity', 'to', 'electric', 'fields', 'including', 'microwave', 'fields', 'ranging', 'from', '100', 'mhz', 'to', 'over', '1', 'thz', 'here', 'we', 'show', 'that', 'roomtemperature', 'rydberg', 'atoms', 'can', 'be', 'used', 'as', 'sensitive', 'high', 'bandwidth', 'microwave', 'communication', 'antennas', 'we', 'demonstrate', 'near', 'photonshotnoise', 'limited', 'readout', 'of', 'data', 'encoded', 'in', 'amplitudemodulated', '17', 'ghz', 'microwaves', 'using', 'an', 'electromagneticallyinducedtransparency', 'eit', 'probing', 'scheme', 'we', 'measure', 'a', 'photonshotnoise', 'limited', 'channel', 'capacity', 'of', 'up', 'to', '82', 'mbits', 'and', 'implement', 'an', '8state', 'phaseshiftkeying', 'digital', 'communication', 'protocol', 'the', 'bandwidth', 'of', 'the', 'eit', 'probing', 'scheme', 'is', 'found', 'to', 'be', 'limited', 'by', 'the', 'available', 'coupling', 'laser', 'power', 'and', 'the', 'natural', 'linewidth', 'of', 'the', 'rubidium', 'd2', 'transition', 'we', 'discuss', 'how', 'atomic', 'communications', 'receivers', 'offer', 'several', 'opportunities', 'to', 'surpass', 'the', 'capabilities', 'of', 'classical', 'antennas']] | [-0.156660513157343, 0.1805288218838689, 0.06574074786943876, -0.023263744941753584, -0.022651691023805518, -0.22891144866002647, 0.12523291464251413, 0.45842325624184516, -0.24010017740434203, -0.3165924626788715, 0.04128255435583613, -0.26410792191793037, -0.047746386653478676, 0.2587690805955752, -0.0205845808027297, 0.051067949410876244, -0.008813097648988895, -0.040529372231141336, 0.018242219240571244, -0.1894181684176324, 0.18559436270223204, 0.10916877500864307, 0.3549474956717615, 0.0735187788334925, 0.13040293728065774, -0.056120663161987695, 0.044369145712959086, -0.09710368508571471, -0.1042110728826, 0.0997201181712515, 0.31702244334581603, 0.108760949659608, 0.22877233094210184, -0.4442297088254879, -0.2169395098538418, 0.07838517465066483, 0.1443882534901301, 0.15398873067725966, -0.03310386497693939, -0.3282089094722235, 0.03172904903796024, -0.18875806455735147, -0.08856322148784511, -0.09244347123686618, -0.05180959937321704, 0.06196543465111011, -0.2901136554717048, 0.002938698515356556, -0.03197130928293052, 0.11061687781134756, -0.006370358774817087, -0.04431424379288181, 0.08441346643229462, 0.06518337232954194, -0.10025825398042798, 0.03043679670502651, 0.18284435761804746, -0.08209675570904482, -0.1399825234836861, 0.36568094561694237, -0.11167842947416068, -0.05795758834479725, 0.17071423512680942, -0.17976746623729908, -0.009786529629301976, 0.1894980418548836, 0.17275053576038152, 0.056334509866357574, -0.13601570237973115, 0.05340255945977732, 0.02850791225134115, 0.27391868761581617, 0.17893411140374052, 0.2193247169290283, 0.15482809824672172, 0.15606582845462774, 0.07688612298049956, 0.158146604999703, -0.18211357633212233, -0.01810793054093251, -0.18216800480717565, -0.10218160366260909, -0.23230797168988038, 0.10461385288972377, -0.06662776666041274, -0.04143077501936293, 0.3501472353418353, 0.19615224831902264, 0.10576070730036836, -0.044034985408974374, 0.3781871744753354, 0.08870423109009408, 0.08944207106289129, 0.05431222810780978, 0.28375612906505904, 0.19006874211836697, 0.12311973204226725, -0.23246436600376497, -0.08934771365720809, -0.11868055987411284] |
1,803.03546 | On a limiting point process related to modified permutation matrices | We consider random permutation matrices following a one-parameter family of
deformations of the uniform distribution, called Ewens' measures, and
modifications of these matrices where the entries equal to one are replaced by
i.i.d uniform random variables on the unit circle. For each of these two
ensembles of matrices, rescaling properly the eigenangles provides a limiting
point process as the size of the matrices goes to infinity. If $J$ is an
interval of $\mathbb{R}$, we show that, as the length of $J$ tends to infinity,
the number of points lying in $J$ of the limiting point process related to
modified permutation matrices is asymptotically normal. Moreover, for
permutation matrices without modification, if $a$ and $a+b$ denote the
endpoints of $J$, we still have an asymptotic normality for the number of
points lying in $J$, in the two following cases: [$a$ fixed and $b \to \infty$]
and [$a,b \to \infty$ with $b$ proportional to $a$].
| math.PR | we consider random permutation matrices following a oneparameter family of deformations of the uniform distribution called ewens measures and modifications of these matrices where the entries equal to one are replaced by iid uniform random variables on the unit circle for each of these two ensembles of matrices rescaling properly the eigenangles provides a limiting point process as the size of the matrices goes to infinity if j is an interval of mathbbr we show that as the length of j tends to infinity the number of points lying in j of the limiting point process related to modified permutation matrices is asymptotically normal moreover for permutation matrices without modification if a and ab denote the endpoints of j we still have an asymptotic normality for the number of points lying in j in the two following cases a fixed and b to infty and ab to infty with b proportional to a | [['we', 'consider', 'random', 'permutation', 'matrices', 'following', 'a', 'oneparameter', 'family', 'of', 'deformations', 'of', 'the', 'uniform', 'distribution', 'called', 'ewens', 'measures', 'and', 'modifications', 'of', 'these', 'matrices', 'where', 'the', 'entries', 'equal', 'to', 'one', 'are', 'replaced', 'by', 'iid', 'uniform', 'random', 'variables', 'on', 'the', 'unit', 'circle', 'for', 'each', 'of', 'these', 'two', 'ensembles', 'of', 'matrices', 'rescaling', 'properly', 'the', 'eigenangles', 'provides', 'a', 'limiting', 'point', 'process', 'as', 'the', 'size', 'of', 'the', 'matrices', 'goes', 'to', 'infinity', 'if', 'j', 'is', 'an', 'interval', 'of', 'mathbbr', 'we', 'show', 'that', 'as', 'the', 'length', 'of', 'j', 'tends', 'to', 'infinity', 'the', 'number', 'of', 'points', 'lying', 'in', 'j', 'of', 'the', 'limiting', 'point', 'process', 'related', 'to', 'modified', 'permutation', 'matrices', 'is', 'asymptotically', 'normal', 'moreover', 'for', 'permutation', 'matrices', 'without', 'modification', 'if', 'a', 'and', 'ab', 'denote', 'the', 'endpoints', 'of', 'j', 'we', 'still', 'have', 'an', 'asymptotic', 'normality', 'for', 'the', 'number', 'of', 'points', 'lying', 'in', 'j', 'in', 'the', 'two', 'following', 'cases', 'a', 'fixed', 'and', 'b', 'to', 'infty', 'and', 'ab', 'to', 'infty', 'with', 'b', 'proportional', 'to', 'a']] | [-0.13426838664861482, 0.1567439249569468, -0.039373277385226065, 0.012580516254435197, -0.011025635810155008, -0.14898829878265268, 0.09761936281612935, 0.3469445159890098, -0.274739721099073, -0.2001030590914774, 0.1045197917055643, -0.3197599450808043, -0.09678385156934192, 0.11283803538242781, -0.09235174174791848, 0.062165212975754065, 0.011104056940359227, 0.08625337105317443, -0.09655547663196618, -0.25859566876859547, 0.32796081287475926, 0.008525114372567413, 0.22354179560804124, -0.033859891981324726, 0.09123383134944377, 0.0540360707266171, -0.025936099026866524, 0.010548483483801772, -0.1346954904343827, 0.05033830594266856, 0.19566909325144746, 0.10244571823273706, 0.2785183237378601, -0.36498151362867526, -0.1252913757842156, 0.1947814077808479, 0.14845002056373394, 0.019210232738283723, 0.038414910565787816, -0.2284052406979445, 0.14000617487799663, -0.1254937091136193, -0.18032113312640125, -0.024726086570059553, 0.09547051951042651, 0.07367674197265087, -0.34776545239892465, 0.023345037617605008, 0.12334538194247419, 0.04796704248786947, 0.01884082613476351, -0.18227572186722182, 0.0008409806189364663, 0.12175294986067742, 0.08025410758929473, 0.036769309305598095, 0.09034591758364258, -0.060446263430944454, -0.08659854691378237, 0.3476158135332429, -0.04385263293226755, -0.2691628358637293, 0.1476509171550229, -0.17435995874138172, -0.14170197395948705, 0.08416766606977368, 0.13200978522974194, 0.11441834185430719, -0.10706215519214572, 0.15808994106924026, -0.08630697993452058, 0.09246625531095025, 0.1068808571344205, -0.018516427246865884, 0.14802967572548226, 0.05035556362199238, 0.11903341018116965, 0.1402451347991873, -0.07775036629831139, -0.09623706814820811, -0.3362580019420658, -0.16797642139269015, -0.2591926092708033, 0.12981757996269058, -0.15795717281373095, -0.21863915468109588, 0.3737544348292978, 0.10897015030282775, 0.2822766695780302, 0.0978819995668102, 0.17270304086112898, 0.11377365414655823, 0.007727864731766673, 0.09755400917644984, 0.10288770190360987, 0.19488909226930487, -0.004286031777440917, -0.1565585541843248, 0.009365223579449591, 0.11100862575755789] |
1,803.03547 | Long time evolutionary dynamics of phenotypically structured populations
in time periodic environments | We study the long time behavior of a parabolic Lotka-Volterra type equation
considering a time-periodic growth rate with non-local competition. Such
equation describes the dynamics of a phenotypically struc-tured population
under the effect of mutations and selection in a fluctuating environment. We
first prove that, in long time, the solution converges to the unique periodic
solution of the problem. Next, we describe this periodic solution
asymptotically as the effect of the mutations vanish. Using a theory based on
Hamilton-Jacobi equations with constraint, we prove that, as the effect of the
mutations vanishes, the solution concentrates on a single Dirac mass, while the
size of the population varies periodically in time. When the effect of the
mutations are small but nonzero, we provide some formal approximations of the
moments of the population's distribution. We then show, via some examples, how
such results could be compared to biological experiments.
| math.AP | we study the long time behavior of a parabolic lotkavolterra type equation considering a timeperiodic growth rate with nonlocal competition such equation describes the dynamics of a phenotypically structured population under the effect of mutations and selection in a fluctuating environment we first prove that in long time the solution converges to the unique periodic solution of the problem next we describe this periodic solution asymptotically as the effect of the mutations vanish using a theory based on hamiltonjacobi equations with constraint we prove that as the effect of the mutations vanishes the solution concentrates on a single dirac mass while the size of the population varies periodically in time when the effect of the mutations are small but nonzero we provide some formal approximations of the moments of the populations distribution we then show via some examples how such results could be compared to biological experiments | [['we', 'study', 'the', 'long', 'time', 'behavior', 'of', 'a', 'parabolic', 'lotkavolterra', 'type', 'equation', 'considering', 'a', 'timeperiodic', 'growth', 'rate', 'with', 'nonlocal', 'competition', 'such', 'equation', 'describes', 'the', 'dynamics', 'of', 'a', 'phenotypically', 'structured', 'population', 'under', 'the', 'effect', 'of', 'mutations', 'and', 'selection', 'in', 'a', 'fluctuating', 'environment', 'we', 'first', 'prove', 'that', 'in', 'long', 'time', 'the', 'solution', 'converges', 'to', 'the', 'unique', 'periodic', 'solution', 'of', 'the', 'problem', 'next', 'we', 'describe', 'this', 'periodic', 'solution', 'asymptotically', 'as', 'the', 'effect', 'of', 'the', 'mutations', 'vanish', 'using', 'a', 'theory', 'based', 'on', 'hamiltonjacobi', 'equations', 'with', 'constraint', 'we', 'prove', 'that', 'as', 'the', 'effect', 'of', 'the', 'mutations', 'vanishes', 'the', 'solution', 'concentrates', 'on', 'a', 'single', 'dirac', 'mass', 'while', 'the', 'size', 'of', 'the', 'population', 'varies', 'periodically', 'in', 'time', 'when', 'the', 'effect', 'of', 'the', 'mutations', 'are', 'small', 'but', 'nonzero', 'we', 'provide', 'some', 'formal', 'approximations', 'of', 'the', 'moments', 'of', 'the', 'populations', 'distribution', 'we', 'then', 'show', 'via', 'some', 'examples', 'how', 'such', 'results', 'could', 'be', 'compared', 'to', 'biological', 'experiments']] | [-0.1609653557356143, 0.11022614159614963, -0.08844465531763576, 0.06723377107781972, -0.049587939941913496, -0.10709737309058305, 0.05429939590125237, 0.31673896453045564, -0.3066077924707309, -0.22549122238221267, 0.1118872187794883, -0.2868751973344558, -0.19316673967797232, 0.16239871268737174, -0.05060834228536304, 0.015265394366492017, 0.07551064261561577, 0.04611345438059375, -0.03486488987279891, -0.25594796351518256, 0.3273093007888239, 0.010640021679656846, 0.25888741410457766, 0.02205058875403424, 0.1346094234716654, -0.02595144874562009, 0.015857047439381784, 0.04818277000164499, -0.14540992237417247, 0.02703892231244138, 0.18638546520616023, 0.09012381164483776, 0.3249323934563721, -0.4440676372270195, -0.18837422918097502, 0.11592624589625024, 0.14493346277055755, 0.18691789500611727, -0.08855063986859987, -0.25929068888182794, 0.06983708764496101, -0.1402626064937438, -0.19338661428464918, -0.02263890043357197, 0.007114997849527265, 0.09967832134079924, -0.2738305942541888, 0.11064213088105376, 0.06001616806286026, 0.02197893091230368, -0.12879093268056255, -0.06945156036768438, -0.02921695231228788, 0.13800339509996737, 0.10036078444365286, -0.036344693937231186, 0.10695169287968148, -0.11540932569464314, -0.09920861807392062, 0.36588649337693135, -0.13029677208297613, -0.2606380279397681, 0.16792109099432168, -0.16237526630894059, -0.12260105558132538, 0.09740613970500069, 0.1836974297802211, 0.16221654491790502, -0.15336751036845278, 0.10637429127189311, -0.04045222979989283, 0.15629950131536746, 0.0547034404221542, 0.022352457825778698, 0.1692101412459093, 0.21408738647460887, 0.086480243391275, 0.14358000927462186, -0.07092778768301719, -0.1335071005120392, -0.29048744840610796, -0.13836822799584342, -0.15274795383487377, 0.10926255576794042, -0.09720768744344142, -0.21259994739603225, 0.3986470085461022, 0.14832190711361667, 0.19647750666453725, 0.097304538665276, 0.2300573206779097, 0.16123316338646929, 0.033539900096880945, 0.040284423709357614, 0.1807734689577863, 0.09640430649552419, 0.08262742836452817, -0.2791540050708062, 0.09248494250730764, 0.06089530745837964] |
1,803.03548 | Counting lines on surfaces, especially quintics | We introduce certain rational functions on a smooth projective surface X in
IP^3 which facilitate counting the lines on X. We apply this to smooth quintics
in characteristic zero to prove that they contain no more than 127 lines, and
that any given line meets at most 28 others. We construct examples which
demonstrate that the latter bound is sharp.
| math.AG | we introduce certain rational functions on a smooth projective surface x in ip3 which facilitate counting the lines on x we apply this to smooth quintics in characteristic zero to prove that they contain no more than 127 lines and that any given line meets at most 28 others we construct examples which demonstrate that the latter bound is sharp | [['we', 'introduce', 'certain', 'rational', 'functions', 'on', 'a', 'smooth', 'projective', 'surface', 'x', 'in', 'ip3', 'which', 'facilitate', 'counting', 'the', 'lines', 'on', 'x', 'we', 'apply', 'this', 'to', 'smooth', 'quintics', 'in', 'characteristic', 'zero', 'to', 'prove', 'that', 'they', 'contain', 'no', 'more', 'than', '127', 'lines', 'and', 'that', 'any', 'given', 'line', 'meets', 'at', 'most', '28', 'others', 'we', 'construct', 'examples', 'which', 'demonstrate', 'that', 'the', 'latter', 'bound', 'is', 'sharp']] | [-0.13442840654752217, 0.05655179784322779, -0.053230794495902956, 0.06829726587360103, -0.06715820566751063, -0.18526664023132375, 0.04757770552726773, 0.3987246627608935, -0.20057568946892085, -0.21141882204295445, 0.05739710174578552, -0.27192620014150937, -0.1624311884244283, 0.2642720959459742, -0.11066250341633956, -0.04445927302003838, 0.006031540569771702, 0.0638733949046582, -0.10616622860349405, -0.3081339083107499, 0.3424565882033979, -0.08409724499021347, 0.2330486527023216, 0.09140640952779601, 0.09065048406094624, -0.017709436578055224, 0.02717336524122705, -0.0038511985602478187, -0.17724460141992798, 0.12989872130565344, 0.29185567727933326, 0.11460846180949981, 0.19948782076438268, -0.37247337149456144, -0.20198422591201962, 0.20899719928080837, 0.1240533349569887, 0.057504630313875774, -0.010863298221617393, -0.2020056438166648, 0.16129988036118448, -0.07257915375909457, -0.14561672390361005, -0.07369353221729398, 0.030404932711583874, 0.03700279480932901, -0.22025237797449032, -0.009206953660274545, 0.09160071642448504, 0.10609378742519766, -0.013151644942505905, -0.10466559315488363, -0.08082005538356801, 0.03667817004801085, -0.03934670890448615, 0.08821667148925674, 0.09050595556230595, -0.0839845908456482, -0.06399401006444047, 0.32796911159530284, -0.08081570543702886, -0.22444082659494596, 0.21255511047008138, -0.17645560210803524, -0.16090329755097627, 0.2066037780450036, 0.13272127672098577, 0.18462558124835293, -0.03928081839500616, 0.0694455332539898, -0.09406682887735467, 0.1952554507763125, 0.13129193804537256, -0.015267946316938227, 0.13874699217267333, 0.016553300929566226, 0.13525097727930793, 0.11086486107087694, -0.08620507279410958, -0.03530189879917695, -0.38738780419031776, -0.1730896888038842, -0.13462086389772593, 0.11389611036671947, -0.05120964529123739, -0.2005282651943465, 0.36507923423002164, 0.12828791220672428, 0.2706931139808148, 0.09171822482700615, 0.22368392922605077, 0.0957823824059839, 0.061588947063622376, 0.09794244957932581, 0.17413411252200603, 0.07346492289410284, 0.002773339937751492, -0.10772909990822276, 0.029836646110440294, 0.08715013242714728] |
1,803.03549 | Spin-vorticity coupling in viscous electron fluids | We consider spin-vorticity coupling - the generation of spin polarization by
vorticity - in viscous two-dimensional electron systems with spin-orbit
coupling. We first derive hydrodynamic equations for spin and momentum
densities in which their mutual coupling is determined by the rotational
viscosity. We then calculate the rotational viscosity microscopically in the
limits of weak and strong spin-orbit coupling. We provide estimates that show
that the spin-orbit coupling achieved in recent experiments is strong enough
for the spin-vorticity coupling to be observed. On the one hand, this coupling
provides a way to image viscous electron flows by imaging spin densities. On
the other hand, we show that the spin polarization generated by spin-vorticity
coupling in the hydrodynamic regime can, in principle, be much larger than that
generated, e.g. by the spin Hall effect, in the diffusive regime.
| cond-mat.mes-hall | we consider spinvorticity coupling the generation of spin polarization by vorticity in viscous twodimensional electron systems with spinorbit coupling we first derive hydrodynamic equations for spin and momentum densities in which their mutual coupling is determined by the rotational viscosity we then calculate the rotational viscosity microscopically in the limits of weak and strong spinorbit coupling we provide estimates that show that the spinorbit coupling achieved in recent experiments is strong enough for the spinvorticity coupling to be observed on the one hand this coupling provides a way to image viscous electron flows by imaging spin densities on the other hand we show that the spin polarization generated by spinvorticity coupling in the hydrodynamic regime can in principle be much larger than that generated eg by the spin hall effect in the diffusive regime | [['we', 'consider', 'spinvorticity', 'coupling', 'the', 'generation', 'of', 'spin', 'polarization', 'by', 'vorticity', 'in', 'viscous', 'twodimensional', 'electron', 'systems', 'with', 'spinorbit', 'coupling', 'we', 'first', 'derive', 'hydrodynamic', 'equations', 'for', 'spin', 'and', 'momentum', 'densities', 'in', 'which', 'their', 'mutual', 'coupling', 'is', 'determined', 'by', 'the', 'rotational', 'viscosity', 'we', 'then', 'calculate', 'the', 'rotational', 'viscosity', 'microscopically', 'in', 'the', 'limits', 'of', 'weak', 'and', 'strong', 'spinorbit', 'coupling', 'we', 'provide', 'estimates', 'that', 'show', 'that', 'the', 'spinorbit', 'coupling', 'achieved', 'in', 'recent', 'experiments', 'is', 'strong', 'enough', 'for', 'the', 'spinvorticity', 'coupling', 'to', 'be', 'observed', 'on', 'the', 'one', 'hand', 'this', 'coupling', 'provides', 'a', 'way', 'to', 'image', 'viscous', 'electron', 'flows', 'by', 'imaging', 'spin', 'densities', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'the', 'spin', 'polarization', 'generated', 'by', 'spinvorticity', 'coupling', 'in', 'the', 'hydrodynamic', 'regime', 'can', 'in', 'principle', 'be', 'much', 'larger', 'than', 'that', 'generated', 'eg', 'by', 'the', 'spin', 'hall', 'effect', 'in', 'the', 'diffusive', 'regime']] | [-0.19462375955155758, 0.21487467892732082, -0.04011669329631684, 0.03529232528161452, -0.04864636985168083, -0.128112816526346, -0.02879374814845288, 0.3533252166625835, -0.2772994585206677, -0.27769226571128, 0.022177855498956713, -0.2418747406327791, -0.08473123232104274, 0.2102207444041773, 0.06714407070331387, -0.010972003247449869, 0.014927403334138998, -0.048635099345336864, -0.06046342260183405, -0.17336700900992963, 0.3229231431571169, 0.0073871712700755736, 0.26756391949854347, 0.11696820476078498, 0.11140744947592046, -2.4647973199833685e-05, 0.06521674673726309, 0.058786708298625784, -0.16944598082784015, 0.07112116557754465, 0.19012314424704094, -0.07145656127510454, 0.1890268864269966, -0.4564526482248929, -0.21819199525765073, 0.011531924258973172, 0.1205612425643511, 0.1936865063104431, -0.05951990120620258, -0.27990701121153005, 0.00880683254999623, -0.19915047624329132, -0.09935896427009198, -0.11561016562575502, 0.029208905513592953, 0.008464100186838143, -0.3028211127897141, 0.14408012320211075, 0.09129705354779848, 0.02388347827641766, -0.05656623896280887, -0.061648828602993665, -0.0961065275591117, 0.06305287754051943, 0.10026572141778975, 0.03494083891455918, 0.11311326439991079, -0.18430923482875772, -0.09964922576996763, 0.3740987371264109, -0.1687434897746121, -0.22632009100665013, 0.19747348381692906, -0.23267182094434194, -0.07528011453574274, 0.10673404279262272, 0.1771408681716047, 0.11424165243220363, -0.12696863422448287, 0.07400980837028057, -0.029535905409381905, 0.14392199738423772, 0.025689997041333856, 0.06524916902990706, 0.25378993246009324, 0.15551680175643137, 0.06877368511354078, 0.10934552049078394, -0.1387681735598277, -0.06447910931684188, -0.22573233597369782, -0.11601097469648985, -0.24180237478368097, 0.10140958760253418, -0.08426592200138752, -0.06198640472825561, 0.3507628423898523, 0.21303938442507564, 0.16628710708386307, 0.018221978102497923, 0.3051519611739178, 0.16509879625110485, 0.08309694171584309, 0.05043076630681753, 0.3841682196483572, 0.1821512751673946, 0.08602765016952779, -0.3396126870882572, 0.051096283233856586, 0.07455239203973993] |
1,803.0355 | On Optimal Polyline Simplification using the Hausdorff and Fr\'echet
Distance | We revisit the classical polygonal line simplification problem and study it
using the Hausdorff distance and Fr\'echet distance. Interestingly, no previous
authors studied line simplification under these measures in its pure form,
namely: for a given $\varepsilon$ > 0, choose a minimum size subsequence of the
vertices of the input such that the Hausdorff or Fr\'echet distance between the
input and output polylines is at most $\varepsilon$. We analyze how the
well-known Douglas-Peucker and Imai-Iri simplification algorithms perform
compared to the optimum possible, also in the situation where the algorithms
are given a considerably larger error threshold than $\varepsilon$.
Furthermore, we show that computing an optimal simplification using the
undirected Hausdorff distance is NP-hard. The same holds when using the
directed Hausdorff distance from the input to the output polyline, whereas the
reverse can be computed in polynomial time. Finally, to compute the optimal
simplification from a polygonal line consisting of $n$ vertices under the
Fr\'echet distance, we give an $O(kn^5)$ time algorithm that requires $O(kn^2)$
space, where $k$ is the output complexity of the simplification.
| cs.CG | we revisit the classical polygonal line simplification problem and study it using the hausdorff distance and frechet distance interestingly no previous authors studied line simplification under these measures in its pure form namely for a given varepsilon 0 choose a minimum size subsequence of the vertices of the input such that the hausdorff or frechet distance between the input and output polylines is at most varepsilon we analyze how the wellknown douglaspeucker and imaiiri simplification algorithms perform compared to the optimum possible also in the situation where the algorithms are given a considerably larger error threshold than varepsilon furthermore we show that computing an optimal simplification using the undirected hausdorff distance is nphard the same holds when using the directed hausdorff distance from the input to the output polyline whereas the reverse can be computed in polynomial time finally to compute the optimal simplification from a polygonal line consisting of n vertices under the frechet distance we give an okn5 time algorithm that requires okn2 space where k is the output complexity of the simplification | [['we', 'revisit', 'the', 'classical', 'polygonal', 'line', 'simplification', 'problem', 'and', 'study', 'it', 'using', 'the', 'hausdorff', 'distance', 'and', 'frechet', 'distance', 'interestingly', 'no', 'previous', 'authors', 'studied', 'line', 'simplification', 'under', 'these', 'measures', 'in', 'its', 'pure', 'form', 'namely', 'for', 'a', 'given', 'varepsilon', '0', 'choose', 'a', 'minimum', 'size', 'subsequence', 'of', 'the', 'vertices', 'of', 'the', 'input', 'such', 'that', 'the', 'hausdorff', 'or', 'frechet', 'distance', 'between', 'the', 'input', 'and', 'output', 'polylines', 'is', 'at', 'most', 'varepsilon', 'we', 'analyze', 'how', 'the', 'wellknown', 'douglaspeucker', 'and', 'imaiiri', 'simplification', 'algorithms', 'perform', 'compared', 'to', 'the', 'optimum', 'possible', 'also', 'in', 'the', 'situation', 'where', 'the', 'algorithms', 'are', 'given', 'a', 'considerably', 'larger', 'error', 'threshold', 'than', 'varepsilon', 'furthermore', 'we', 'show', 'that', 'computing', 'an', 'optimal', 'simplification', 'using', 'the', 'undirected', 'hausdorff', 'distance', 'is', 'nphard', 'the', 'same', 'holds', 'when', 'using', 'the', 'directed', 'hausdorff', 'distance', 'from', 'the', 'input', 'to', 'the', 'output', 'polyline', 'whereas', 'the', 'reverse', 'can', 'be', 'computed', 'in', 'polynomial', 'time', 'finally', 'to', 'compute', 'the', 'optimal', 'simplification', 'from', 'a', 'polygonal', 'line', 'consisting', 'of', 'n', 'vertices', 'under', 'the', 'frechet', 'distance', 'we', 'give', 'an', 'okn5', 'time', 'algorithm', 'that', 'requires', 'okn2', 'space', 'where', 'k', 'is', 'the', 'output', 'complexity', 'of', 'the', 'simplification']] | [-0.1127637101413119, 0.053011002687928216, -0.050010496644887985, 0.08118032364798763, -0.06480132540428014, -0.13370491979307994, 0.09170332931382798, 0.40804067650826126, -0.31371346105575065, -0.26886450951691543, 0.06519486721967845, -0.2758254705289335, -0.12962848645212605, 0.1789324013150817, -0.0737435293876631, 0.07504593957043632, 0.07407263031927869, 0.10899914889379816, -0.08923845333324713, -0.25889214419023415, 0.2988538168483078, 0.011265359500823758, 0.2379072555679243, 0.03132979673276612, 0.09563291600098574, 0.0012235489489813877, 0.0157766759498478, 0.07476549055870639, -0.1583497821478844, 0.10009471152138864, 0.23690735446397476, 0.17070050149083918, 0.26539106052341804, -0.3881091992100051, -0.14921611097240603, 0.17933748301855007, 0.1321751688184693, 0.06111296214336573, 0.04177162570738082, -0.23060073025205152, 0.11570366346114856, -0.08926719719913181, -0.10405102410884358, 0.018044638858978137, 0.10256047379008906, -0.004133541279115043, -0.28267757232344254, 0.014460945365034034, 0.06426016057213378, 0.03229954151090148, -0.0067378656801951745, -0.13932461140347038, -0.003754954768864568, 0.1471731048464832, 0.01307350747252755, 0.1079549978035069, 0.08889315239976832, -0.07681678421253901, -0.12176915555975812, 0.37463025472581735, -0.04758127745544487, -0.21942273582071933, 0.1438006912195665, -0.1053810476225281, -0.10396528092678636, 0.13142591969754416, 0.16100282648166772, 0.14103271183828542, -0.0829098312970864, 0.14207887576979605, -0.05999444769478814, 0.17151468362913705, 0.14206049965727036, 0.034850175405154005, 0.06718236866453121, 0.14254412056504598, 0.154768992052955, 0.19136259351724347, -0.07488250506985634, -0.08172774724059922, -0.30426742341355856, -0.13287863780224565, -0.2301163181031751, 0.04526199252401522, -0.1758279659251309, -0.17262502909139837, 0.33639593203795726, 0.15667924739597744, 0.24692480544949513, 0.14688464294209383, 0.2998654052755947, 0.11615167207864308, 0.0068056307202421645, 0.16676123195522746, 0.1921213892718972, 0.08965825148029687, 0.01926365741636864, -0.19248741776492923, 0.08792835724171857, 0.13130678780523108] |
1,803.03551 | An iterative method for elliptic problems with rapidly oscillating
coefficients | We introduce a new iterative method for computing solutions of elliptic
equations with random rapidly oscillating coefficients. Similarly to a
multigrid method, each step of the iteration involves different computations
meant to address different length scales. However, we use here the homogenized
equation on all scales larger than a fixed multiple of the scale of oscillation
of the coefficients. While the performance of standard multigrid methods
degrades rapidly under the regime of large scale separation that we consider
here, we show an explicit estimate on the contraction factor of our method
which is independent of the size of the domain. We also present numerical
experiments which confirm the effectiveness of the method, with openly
available source code.
| math.NA cs.NA math.AP | we introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients similarly to a multigrid method each step of the iteration involves different computations meant to address different length scales however we use here the homogenized equation on all scales larger than a fixed multiple of the scale of oscillation of the coefficients while the performance of standard multigrid methods degrades rapidly under the regime of large scale separation that we consider here we show an explicit estimate on the contraction factor of our method which is independent of the size of the domain we also present numerical experiments which confirm the effectiveness of the method with openly available source code | [['we', 'introduce', 'a', 'new', 'iterative', 'method', 'for', 'computing', 'solutions', 'of', 'elliptic', 'equations', 'with', 'random', 'rapidly', 'oscillating', 'coefficients', 'similarly', 'to', 'a', 'multigrid', 'method', 'each', 'step', 'of', 'the', 'iteration', 'involves', 'different', 'computations', 'meant', 'to', 'address', 'different', 'length', 'scales', 'however', 'we', 'use', 'here', 'the', 'homogenized', 'equation', 'on', 'all', 'scales', 'larger', 'than', 'a', 'fixed', 'multiple', 'of', 'the', 'scale', 'of', 'oscillation', 'of', 'the', 'coefficients', 'while', 'the', 'performance', 'of', 'standard', 'multigrid', 'methods', 'degrades', 'rapidly', 'under', 'the', 'regime', 'of', 'large', 'scale', 'separation', 'that', 'we', 'consider', 'here', 'we', 'show', 'an', 'explicit', 'estimate', 'on', 'the', 'contraction', 'factor', 'of', 'our', 'method', 'which', 'is', 'independent', 'of', 'the', 'size', 'of', 'the', 'domain', 'we', 'also', 'present', 'numerical', 'experiments', 'which', 'confirm', 'the', 'effectiveness', 'of', 'the', 'method', 'with', 'openly', 'available', 'source', 'code']] | [-0.10969233595662647, 0.08073223551496979, -0.07823109999473175, 0.011420765645905502, -0.06523997745572184, -0.11887918981428966, 0.017793153398710057, 0.34619849980768996, -0.30573732692461747, -0.27608072184599364, 0.12453180958684056, -0.244620180175377, -0.13091810095038375, 0.25125951561121607, -0.020337277227359958, 0.08336482763401845, 0.09989675296804844, 0.019286067818060644, -0.1089721529557505, -0.2636184849593247, 0.34842021364726633, 0.06576311999820492, 0.2829584021312304, 0.027141856108732425, 0.14395507721182627, -0.05283237939987045, -0.06568491463668835, 0.030096768998564817, -0.14487186314879655, 0.134268095330773, 0.19643270778947342, 0.09754308534264475, 0.3122956980990931, -0.4184017656291397, -0.17795746442344454, 0.05788592439797571, 0.17932220918532366, 0.15263603818921262, -0.04159426411243681, -0.22059606038965285, 0.11674537296550205, -0.14328213941910836, -0.12807720015422466, -0.08458721015252109, -0.019637004989716742, 0.04885695215451937, -0.29248284952094156, 0.0888805041310047, 0.03463874989822029, 0.05179349654632756, -0.05423527797604473, -0.12994709284578124, 0.0732791452234786, 0.11160861660575128, 0.06582379358730818, -0.012624580858864335, 0.09756807315871756, -0.10568949437757923, -0.07492314821156935, 0.36423375241012657, -0.09745305087917353, -0.22938196700161848, 0.18367297048720285, -0.10725063378683841, -0.12747116723599342, 0.12009935893723343, 0.20572151219333984, 0.20152243012641993, -0.10107050047248092, 0.07543708920940502, -0.03581211348979646, 0.21662268011520305, 0.051747193852535046, -0.00892606252629278, 0.10530341371523742, 0.1960982831640758, 0.09735063260468917, 0.15227745530299014, -0.0934098789619648, -0.08525306800316669, -0.3137225968266726, -0.130630472372485, -0.1983367939485619, 0.015166752422467256, -0.1508012368885052, -0.1988041070727711, 0.3990687968957628, 0.2252406824945321, 0.19376967848939264, 0.09248059800364332, 0.3238233026180767, 0.12531551282204145, 0.09454581771905606, 0.10168062264704679, 0.1702226933219239, 0.0687253611574236, 0.08729751461631276, -0.2586591045370198, 0.031107462401318755, 0.09402700071422081] |
1,803.03552 | Effective fluctuation and response theory | The response of thermodynamic systems perturbed out of an equilibrium
steady-state is described by the reciprocal and the fluctuation-dissipation
relations. The so-called fluctuation theorems extended the study of
fluctuations far beyond equilibrium. All these results rely on the crucial
assumption that the observer has complete information about the system. Such a
precise control is difficult to attain, hence the following questions are
compelling: Will an observer who has marginal information be able to perform an
effective thermodynamic analysis? Given that such observer will only establish
local equilibrium amidst the whirling of hidden degrees of freedom, by
perturbing the stalling currents will he/she observe equilibrium-like
fluctuations? We model the dynamics of open systems as Markov jump processes on
finite networks. We establish that: 1) While marginal currents do not obey a
full-fledged fluctuation relation, there exist effective affinities for which
an integral fluctuation relation holds; 2) Under reasonable assumptions on the
parametrization of the rates, effective and "real" affinities only differ by a
constant; 3) At stalling, i.e. where the marginal currents vanish, a
symmetrized fluctuation-dissipation relation holds while reciprocity does not;
4) There exists a notion of marginal time-reversal that plays a role akin to
that played by time-reversal for complete systems, which restores the
fluctuation relation and reciprocity. The above results hold for
configuration-space currents, and for phenomenological currents provided that
certain symmetries of the effective affinities are respected - a condition
whose range of validity we deem the most interesting question left open to
future inquiry. Our results are constructive and operational: we provide an
explicit expression for the effective affinities and propose a procedure to
measure them in laboratory.
| cond-mat.stat-mech | the response of thermodynamic systems perturbed out of an equilibrium steadystate is described by the reciprocal and the fluctuationdissipation relations the socalled fluctuation theorems extended the study of fluctuations far beyond equilibrium all these results rely on the crucial assumption that the observer has complete information about the system such a precise control is difficult to attain hence the following questions are compelling will an observer who has marginal information be able to perform an effective thermodynamic analysis given that such observer will only establish local equilibrium amidst the whirling of hidden degrees of freedom by perturbing the stalling currents will heshe observe equilibriumlike fluctuations we model the dynamics of open systems as markov jump processes on finite networks we establish that 1 while marginal currents do not obey a fullfledged fluctuation relation there exist effective affinities for which an integral fluctuation relation holds 2 under reasonable assumptions on the parametrization of the rates effective and real affinities only differ by a constant 3 at stalling ie where the marginal currents vanish a symmetrized fluctuationdissipation relation holds while reciprocity does not 4 there exists a notion of marginal timereversal that plays a role akin to that played by timereversal for complete systems which restores the fluctuation relation and reciprocity the above results hold for configurationspace currents and for phenomenological currents provided that certain symmetries of the effective affinities are respected a condition whose range of validity we deem the most interesting question left open to future inquiry our results are constructive and operational we provide an explicit expression for the effective affinities and propose a procedure to measure them in laboratory | [['the', 'response', 'of', 'thermodynamic', 'systems', 'perturbed', 'out', 'of', 'an', 'equilibrium', 'steadystate', 'is', 'described', 'by', 'the', 'reciprocal', 'and', 'the', 'fluctuationdissipation', 'relations', 'the', 'socalled', 'fluctuation', 'theorems', 'extended', 'the', 'study', 'of', 'fluctuations', 'far', 'beyond', 'equilibrium', 'all', 'these', 'results', 'rely', 'on', 'the', 'crucial', 'assumption', 'that', 'the', 'observer', 'has', 'complete', 'information', 'about', 'the', 'system', 'such', 'a', 'precise', 'control', 'is', 'difficult', 'to', 'attain', 'hence', 'the', 'following', 'questions', 'are', 'compelling', 'will', 'an', 'observer', 'who', 'has', 'marginal', 'information', 'be', 'able', 'to', 'perform', 'an', 'effective', 'thermodynamic', 'analysis', 'given', 'that', 'such', 'observer', 'will', 'only', 'establish', 'local', 'equilibrium', 'amidst', 'the', 'whirling', 'of', 'hidden', 'degrees', 'of', 'freedom', 'by', 'perturbing', 'the', 'stalling', 'currents', 'will', 'heshe', 'observe', 'equilibriumlike', 'fluctuations', 'we', 'model', 'the', 'dynamics', 'of', 'open', 'systems', 'as', 'markov', 'jump', 'processes', 'on', 'finite', 'networks', 'we', 'establish', 'that', '1', 'while', 'marginal', 'currents', 'do', 'not', 'obey', 'a', 'fullfledged', 'fluctuation', 'relation', 'there', 'exist', 'effective', 'affinities', 'for', 'which', 'an', 'integral', 'fluctuation', 'relation', 'holds', '2', 'under', 'reasonable', 'assumptions', 'on', 'the', 'parametrization', 'of', 'the', 'rates', 'effective', 'and', 'real', 'affinities', 'only', 'differ', 'by', 'a', 'constant', '3', 'at', 'stalling', 'ie', 'where', 'the', 'marginal', 'currents', 'vanish', 'a', 'symmetrized', 'fluctuationdissipation', 'relation', 'holds', 'while', 'reciprocity', 'does', 'not', '4', 'there', 'exists', 'a', 'notion', 'of', 'marginal', 'timereversal', 'that', 'plays', 'a', 'role', 'akin', 'to', 'that', 'played', 'by', 'timereversal', 'for', 'complete', 'systems', 'which', 'restores', 'the', 'fluctuation', 'relation', 'and', 'reciprocity', 'the', 'above', 'results', 'hold', 'for', 'configurationspace', 'currents', 'and', 'for', 'phenomenological', 'currents', 'provided', 'that', 'certain', 'symmetries', 'of', 'the', 'effective', 'affinities', 'are', 'respected', 'a', 'condition', 'whose', 'range', 'of', 'validity', 'we', 'deem', 'the', 'most', 'interesting', 'question', 'left', 'open', 'to', 'future', 'inquiry', 'our', 'results', 'are', 'constructive', 'and', 'operational', 'we', 'provide', 'an', 'explicit', 'expression', 'for', 'the', 'effective', 'affinities', 'and', 'propose', 'a', 'procedure', 'to', 'measure', 'them', 'in', 'laboratory']] | [-0.15798010881105265, 0.1369881705315788, -0.0996826156918853, 0.1326956398470664, -0.05541349323363322, -0.162611020909368, 0.08058605011255306, 0.32897248145835506, -0.24985739961996797, -0.268566414153047, 0.0936800631332792, -0.2662018953867229, -0.13699609583339953, 0.17498278086257554, -0.03589269838242609, 0.030309288660270536, 0.01064434247323384, 0.05179793460346583, -0.07467810917951552, -0.1996939221098057, 0.3169087462532729, 0.06449047797892202, 0.29173377190065325, 0.075052123917808, 0.1277028834052054, 0.03696984442971592, -0.002184541762816785, 0.029851721032764043, -0.14742585287646973, 0.09131814025615675, 0.2320752206241937, 0.11374225439091395, 0.25395069878060383, -0.4372082371092865, -0.20380854584086375, 0.12178532309947034, 0.128580868958987, 0.09764836218836975, -0.027679083341340848, -0.24779594127807036, 0.07076381203160893, -0.15146425125151322, -0.1696698471450168, -0.13197300765866146, 0.04213744057926635, 0.009610439240468522, -0.26999018949605147, 0.10815765314580394, 0.14484424412944716, 0.0794409784622408, -0.05966175165168281, -0.07754857075719397, -0.02333169097658178, 0.1838536586292858, 0.03329828147096835, -0.001582086007231056, 0.15872439609606823, -0.14409222204033698, -0.09650061780131917, 0.34151711109750715, -0.03724897646506719, -0.2218382894259111, 0.18506911929591122, -0.1359811132607081, -0.14814644083861825, 0.09076493068312971, 0.09297948645864273, 0.07820906288186398, -0.18891075469649696, 0.08357729975564678, -0.06099970819174254, 0.15928367713407865, 0.0556144765380605, 0.042266774695363184, 0.24251486647640427, 0.09201395009537794, 0.10206719268719293, 0.08780665283831957, -0.011406016926220154, -0.13761759274106514, -0.3467698351675954, -0.1292429762489482, -0.1538131056835435, 0.08540743312807461, -0.06930020542755616, -0.13135465476283892, 0.32767393757809105, 0.1783152354191267, 0.15663437813870967, 0.07664492104040987, 0.2397687694610258, 0.15000126360506644, 0.059993927170285385, 0.08571740583176432, 0.26468015492745983, 0.1261310608975067, 0.07567252891268787, -0.21168239423090152, 0.08176174137064314, 0.040693417289448953] |
1,803.03553 | Critical Behavior of Topological Kondo Insulators | A thermodynamic study of the Kondo insulator SmB$_6$ is pursued to elucidate
the well-known anomalous low-temperature electronic-like specific heat
contribution conjectured to arise from metallic surface states. A general
thermodynamic description of topological Kondo insulators is developed using a
mean-field slave-boson approximation and an approach inspired by Hill
thermodynamics to study the phase transitions with the critical exponents of
the model. The results show consistency with the Josephson hyper-scaling
relation. We further apply this framework to SmB$_6$. By separating the bulk
and boundary contributions to the heat capacity, we show that while the surface
states contribute to an increase of the heat capacity upon lowering the
temperature, the effect is immeasurably small. This suggests that an alternate
explanation is required for the anomalous low-temperature contributions to the
specific heat in this material.
| cond-mat.str-el cond-mat.stat-mech | a thermodynamic study of the kondo insulator smb_6 is pursued to elucidate the wellknown anomalous lowtemperature electroniclike specific heat contribution conjectured to arise from metallic surface states a general thermodynamic description of topological kondo insulators is developed using a meanfield slaveboson approximation and an approach inspired by hill thermodynamics to study the phase transitions with the critical exponents of the model the results show consistency with the josephson hyperscaling relation we further apply this framework to smb_6 by separating the bulk and boundary contributions to the heat capacity we show that while the surface states contribute to an increase of the heat capacity upon lowering the temperature the effect is immeasurably small this suggests that an alternate explanation is required for the anomalous lowtemperature contributions to the specific heat in this material | [['a', 'thermodynamic', 'study', 'of', 'the', 'kondo', 'insulator', 'smb_6', 'is', 'pursued', 'to', 'elucidate', 'the', 'wellknown', 'anomalous', 'lowtemperature', 'electroniclike', 'specific', 'heat', 'contribution', 'conjectured', 'to', 'arise', 'from', 'metallic', 'surface', 'states', 'a', 'general', 'thermodynamic', 'description', 'of', 'topological', 'kondo', 'insulators', 'is', 'developed', 'using', 'a', 'meanfield', 'slaveboson', 'approximation', 'and', 'an', 'approach', 'inspired', 'by', 'hill', 'thermodynamics', 'to', 'study', 'the', 'phase', 'transitions', 'with', 'the', 'critical', 'exponents', 'of', 'the', 'model', 'the', 'results', 'show', 'consistency', 'with', 'the', 'josephson', 'hyperscaling', 'relation', 'we', 'further', 'apply', 'this', 'framework', 'to', 'smb_6', 'by', 'separating', 'the', 'bulk', 'and', 'boundary', 'contributions', 'to', 'the', 'heat', 'capacity', 'we', 'show', 'that', 'while', 'the', 'surface', 'states', 'contribute', 'to', 'an', 'increase', 'of', 'the', 'heat', 'capacity', 'upon', 'lowering', 'the', 'temperature', 'the', 'effect', 'is', 'immeasurably', 'small', 'this', 'suggests', 'that', 'an', 'alternate', 'explanation', 'is', 'required', 'for', 'the', 'anomalous', 'lowtemperature', 'contributions', 'to', 'the', 'specific', 'heat', 'in', 'this', 'material']] | [-0.13210016875845296, 0.16771645163250717, -0.08938767988178314, 0.06420171718116652, -0.06913675076970266, -0.14631874456112695, 0.13994686652299468, 0.2753941787532037, -0.26395358492366294, -0.2639589807138581, 0.01566623869373209, -0.3413875585661806, -0.17222095294467485, 0.17201609967565729, -0.039538028593541996, 0.045972470593011225, -0.061554944502528415, -0.019002241717482157, -0.10896138226521682, -0.19197604012195812, 0.3248575257567802, 0.04460260848458292, 0.32398386248810723, 0.15694243391044438, 0.014932533909538479, -0.06501066234583656, 0.07800933912354098, 0.03787140975790945, -0.21038158155440187, 0.06378288822386159, 0.23700740135267773, -0.06887796275656331, 0.17735337611344276, -0.42426109610294754, -0.26756363013180706, 0.03403585350183262, 0.08819103526889882, 0.1341556979706652, -0.05423373598287898, -0.2634127727131162, 0.0266095980477985, -0.1547473913294997, -0.13172456013236308, -0.1320438442458963, -0.03354791504556708, -0.08173563532137919, -0.23280903709360934, 0.104222113337142, 0.0924012178368161, 0.05527215617246728, -0.09761027342668085, -0.10011605272390597, -0.02704990836509475, 0.09678877652693314, 0.06910917157457871, 0.04324705581794577, 0.13960847480815242, -0.13522616351397257, -0.10980732539654568, 0.31778128729484073, -0.06075970196186311, -0.12490955608011449, 0.18695581313152093, -0.1739532501704878, -0.10352127554925215, 0.13399591667323626, 0.08320625342259352, 0.08381039759181229, -0.18369128153955733, 0.09131991286553923, -0.014423643294404346, 0.14506202201697638, -0.026337810139397556, 0.027775122158345766, 0.2479085324007566, 0.19100768296894702, 0.029920928391881964, 0.22334239179635365, -0.08152622230894242, -0.10211023190199878, -0.2837717271027169, -0.20291854312756297, -0.22514273665111625, 0.06368966140629102, -0.07294654579119665, -0.1918327153984909, 0.37308035198260436, 0.19229756447748514, 0.19091230712012586, 0.0005128348112162767, 0.25378394596786663, 0.16150357880057223, 0.05652907836713095, 0.06913525719110938, 0.247603456433298, 0.17670825611320184, 0.12867873710417893, -0.34652789609302115, 0.05254652155880732, 0.08896740984213962] |
1,803.03554 | Numerical Modeling of Pulse Wave Propagation in a Stenosed Artery using
Two-Way Coupled Fluid Structure Interaction (FSI) | As the heart beats, it creates fluctuation in blood pressure leading to a
pulse wave that propagates by displacing the arterial wall. These waves travel
through the arterial tree and carry information about the medium that they
propagate through as well as information of the geometry of the arterial tree.
Pulse wave velocity (PWV) can be used as a non-invasive diagnostic tool to
study the functioning of cardiovascular system. A stenosis in an artery can
dampen the pulse wave leading to changes in the propagating pulse. Hence, PWV
analysis can be performed to detect a stenosed region in arteries. This paper
presents a numerical study of pulse wave propagation in a stenosed artery by
means of two-way coupled fluid structure interaction (FSI). The computational
model was validated by the comparison of the simulated PWV results with
theoretical values for a healthy artery. Propagation of the pulse waves in the
stenosed artery was compared with healthy case using spatiotemporal maps of
wall displacements. The analysis for PWV showed significance differences
between the healthy and stenosed arteries including damping of propagating
waves and generation of high wall displacements downstream the stenosis caused
by flow instabilities. This approach can be used to develop patient-specific
models that are capable of predicting PWV signatures associated with stenosis
changes. The knowledge gained from these models may increase utility of this
approach for managing patients at risk of stenosis occurrence.
| physics.flu-dyn | as the heart beats it creates fluctuation in blood pressure leading to a pulse wave that propagates by displacing the arterial wall these waves travel through the arterial tree and carry information about the medium that they propagate through as well as information of the geometry of the arterial tree pulse wave velocity pwv can be used as a noninvasive diagnostic tool to study the functioning of cardiovascular system a stenosis in an artery can dampen the pulse wave leading to changes in the propagating pulse hence pwv analysis can be performed to detect a stenosed region in arteries this paper presents a numerical study of pulse wave propagation in a stenosed artery by means of twoway coupled fluid structure interaction fsi the computational model was validated by the comparison of the simulated pwv results with theoretical values for a healthy artery propagation of the pulse waves in the stenosed artery was compared with healthy case using spatiotemporal maps of wall displacements the analysis for pwv showed significance differences between the healthy and stenosed arteries including damping of propagating waves and generation of high wall displacements downstream the stenosis caused by flow instabilities this approach can be used to develop patientspecific models that are capable of predicting pwv signatures associated with stenosis changes the knowledge gained from these models may increase utility of this approach for managing patients at risk of stenosis occurrence | [['as', 'the', 'heart', 'beats', 'it', 'creates', 'fluctuation', 'in', 'blood', 'pressure', 'leading', 'to', 'a', 'pulse', 'wave', 'that', 'propagates', 'by', 'displacing', 'the', 'arterial', 'wall', 'these', 'waves', 'travel', 'through', 'the', 'arterial', 'tree', 'and', 'carry', 'information', 'about', 'the', 'medium', 'that', 'they', 'propagate', 'through', 'as', 'well', 'as', 'information', 'of', 'the', 'geometry', 'of', 'the', 'arterial', 'tree', 'pulse', 'wave', 'velocity', 'pwv', 'can', 'be', 'used', 'as', 'a', 'noninvasive', 'diagnostic', 'tool', 'to', 'study', 'the', 'functioning', 'of', 'cardiovascular', 'system', 'a', 'stenosis', 'in', 'an', 'artery', 'can', 'dampen', 'the', 'pulse', 'wave', 'leading', 'to', 'changes', 'in', 'the', 'propagating', 'pulse', 'hence', 'pwv', 'analysis', 'can', 'be', 'performed', 'to', 'detect', 'a', 'stenosed', 'region', 'in', 'arteries', 'this', 'paper', 'presents', 'a', 'numerical', 'study', 'of', 'pulse', 'wave', 'propagation', 'in', 'a', 'stenosed', 'artery', 'by', 'means', 'of', 'twoway', 'coupled', 'fluid', 'structure', 'interaction', 'fsi', 'the', 'computational', 'model', 'was', 'validated', 'by', 'the', 'comparison', 'of', 'the', 'simulated', 'pwv', 'results', 'with', 'theoretical', 'values', 'for', 'a', 'healthy', 'artery', 'propagation', 'of', 'the', 'pulse', 'waves', 'in', 'the', 'stenosed', 'artery', 'was', 'compared', 'with', 'healthy', 'case', 'using', 'spatiotemporal', 'maps', 'of', 'wall', 'displacements', 'the', 'analysis', 'for', 'pwv', 'showed', 'significance', 'differences', 'between', 'the', 'healthy', 'and', 'stenosed', 'arteries', 'including', 'damping', 'of', 'propagating', 'waves', 'and', 'generation', 'of', 'high', 'wall', 'displacements', 'downstream', 'the', 'stenosis', 'caused', 'by', 'flow', 'instabilities', 'this', 'approach', 'can', 'be', 'used', 'to', 'develop', 'patientspecific', 'models', 'that', 'are', 'capable', 'of', 'predicting', 'pwv', 'signatures', 'associated', 'with', 'stenosis', 'changes', 'the', 'knowledge', 'gained', 'from', 'these', 'models', 'may', 'increase', 'utility', 'of', 'this', 'approach', 'for', 'managing', 'patients', 'at', 'risk', 'of', 'stenosis', 'occurrence']] | [-0.10943914505692055, 0.1418013555950674, -0.08518075262163385, 0.03355655861596773, -0.0562608167868859, -0.07955458965512241, -0.0037706569621595255, 0.38265742010201126, -0.24100354510307503, -0.2744435441616299, 0.1353909670829457, -0.28747187361177134, -0.15968371957716385, 0.2058722361464597, -0.05554164897826852, 0.0498839500655601, 0.11029143795339079, 0.01960191657704745, 0.031751540905692065, -0.12521689911792655, 0.23607484822145508, 0.06698635162170097, 0.3195886024365865, 0.05080527428421692, 0.10071404819035015, -0.019880457231405194, -0.025236224447868667, 0.04114694319377641, -0.11197327929116109, 0.08255592510739967, 0.29147922831988826, 0.11578518403654063, 0.2959522559405444, -0.48279928631019825, -0.31583992616861034, 0.04513573073462259, 0.15387861082398296, 0.12779453242509406, -0.01237637542094236, -0.3321655195080495, 0.05783209337027496, -0.1423213083238057, -0.14262678065385206, -0.009053575816312446, -0.04432569593071234, 0.02609085904778073, -0.2577179221752651, 0.17434760320520973, -0.026488448480691745, 0.12776564431485177, -0.06940097127773283, -0.0496012904504394, -0.09799824847615936, 0.16837467005188564, 0.10003869820240277, 0.06779305506477636, 0.19371150542713117, -0.16790093612345536, -0.0729978115766513, 0.36074071543395136, -0.05629532309069174, -0.2054542837071916, 0.16059639617448968, -0.1283963084540154, 0.002077055695294822, 0.1930055455604464, 0.22924336600377196, 0.0493576171355274, -0.15157577898298377, -0.09106034667669824, 0.04184323057303477, 0.1860367019072199, 0.16569567115002115, -0.0769415286033866, 0.1959291430941659, 0.2145522929200415, -0.007683436302348268, 0.16051933702352245, -0.17379252886266724, -0.02178851494869385, -0.26632955575325873, -0.13431264442899324, -0.07698450633224756, -0.0037527235553104256, -0.09886895572446144, -0.17389589132363367, 0.43469835202261614, 0.16196616554219084, 0.09438337467594847, 0.03184877807682164, 0.30202275484224755, 0.05928994944247181, 0.0437866830573789, 0.04207482633017035, 0.23895822898704608, 0.12447320720052962, 0.12015520893646876, -0.2642844627469442, 0.13459598808649273, 0.012962330278616735] |
1,803.03555 | The quadratic type of the 2-principal indecomposable modules of the
double covers of alternating groups | We determine the quadratic type of the 2-modular principal indecomposable
modules of the double covers of alternating groups.
| math.RT | we determine the quadratic type of the 2modular principal indecomposable modules of the double covers of alternating groups | [['we', 'determine', 'the', 'quadratic', 'type', 'of', 'the', '2modular', 'principal', 'indecomposable', 'modules', 'of', 'the', 'double', 'covers', 'of', 'alternating', 'groups']] | [-0.2699526267954045, 0.05045201784620682, -0.011344749273525344, 0.03980328716958562, -0.10008017165172431, -0.12117687467899588, -0.020483521434168022, 0.32121599920921856, -0.42029013484716415, -0.172142645654579, 0.11479676357056531, -0.19508309558861786, -0.1150412463693, 0.2014959595269627, -0.07044012094330457, -0.12435571476817131, 0.0032926820373783507, 0.13915240904316306, -0.14509080816060305, -0.3261995568043656, 0.41165974073939854, -0.06069508008658886, 0.22458155722253853, -0.05296147449149026, 0.16087983233026332, 0.14098299253318045, -0.1355251892366343, -0.057892836112942964, -0.14453619511591065, 0.18599507436414975, 0.3312272866153055, -0.0016991000932951768, 0.1748727531068855, -0.31581186906745035, -0.014352547030688988, 0.25554939690563416, 0.169405037123296, -0.01804320419776357, 0.0438919086009264, -0.13610091588149467, 0.09664223615416428, -0.21068811478714147, -0.18582697347220448, 0.0002840119931432936, -0.004472364775008625, 0.11885808175429702, -0.18972192663285467, 0.032589927645555385, 0.09468924212786886, 0.10006950428295466, -0.13943164971553618, -0.19554636772308084, -0.023951924302511744, 0.13589846316931975, -0.06216188054531813, -0.1455240555676735, 0.09607774197744827, -0.09521865668810076, -0.20166321243676874, 0.2855275629295243, -0.028974152997963958, -0.14077794476826158, 0.13362967491977745, -0.14237957592639658, -0.1992906263201601, 0.17164081128107178, 0.05707007129159239, 0.15930782455123133, -0.006222534717784988, 0.18459967813558048, -0.18145726869503656, 0.05187936230666108, 0.03443496912303898, -0.08122777524921629, 0.14380836171201533, 0.11057175426847404, 0.05704982646016611, 0.2031575028474132, -0.06059737213783794, 0.05084567703306675, -0.3742255311873224, -0.25805586519547635, -0.04983613557285733, 0.056815134768839926, -0.09944727132096887, -0.2607116156076599, 0.5563236673672994, -0.037558229433165655, 0.10949316206905577, 0.12861917793957722, 0.14509915974405077, 0.005175822414457798, 0.16126058985375696, -0.03564955811533663, 0.1964840421246158, 0.321395396358437, -0.11632420727983117, -0.2147532951914602, -0.05111064143582351, 0.20335785558240282] |
1,803.03556 | Jacobi-Galerkin spectral method for eigenvalue problems of Riesz
fractional differential equations | An efficient Jacobi-Galerkin spectral method for calculating eigenvalues of
Riesz fractional partial differential equations with homogeneous Dirichlet
boundary values is proposed in this paper. In order to retain the symmetry and
positive definiteness of the discrete linear system, we introduce some properly
defined Sobolev spaces and approximate the eigenvalue problem in a standard
Galerkin weak formulation instead of the Petrov-Galerkin one as in literature.
Poincar\'{e} and inverse inequalities are proved for the proposed Galerkin
formulation which finally help us establishing a sharp estimate on the
algebraic system's condition number. Rigorous error estimates of the
eigenvalues and eigenvectors are then readily obtained by using Babu\v{s}ka and
Osborn's approximation theory on self-adjoint and positive-definite eigenvalue
problems. Numerical results are presented to demonstrate the accuracy and
efficiency, and to validate the asymptotically exponential oder of convergence.
Moreover, the Weyl-type asymptotic law $ \lambda_n=\mathcal{O}(n^{2\alpha})$
for the $n$-th eigenvalue $\lambda_n$ of the Riesz fractional differential
operator of order $2\alpha$, and the condition number $N^{4\alpha}$ of its
algebraic system with respect to the polynomial degree $N$ are observed.
| math.NA | an efficient jacobigalerkin spectral method for calculating eigenvalues of riesz fractional partial differential equations with homogeneous dirichlet boundary values is proposed in this paper in order to retain the symmetry and positive definiteness of the discrete linear system we introduce some properly defined sobolev spaces and approximate the eigenvalue problem in a standard galerkin weak formulation instead of the petrovgalerkin one as in literature poincare and inverse inequalities are proved for the proposed galerkin formulation which finally help us establishing a sharp estimate on the algebraic systems condition number rigorous error estimates of the eigenvalues and eigenvectors are then readily obtained by using babuvska and osborns approximation theory on selfadjoint and positivedefinite eigenvalue problems numerical results are presented to demonstrate the accuracy and efficiency and to validate the asymptotically exponential oder of convergence moreover the weyltype asymptotic law lambda_nmathcalon2alpha for the nth eigenvalue lambda_n of the riesz fractional differential operator of order 2alpha and the condition number n4alpha of its algebraic system with respect to the polynomial degree n are observed | [['an', 'efficient', 'jacobigalerkin', 'spectral', 'method', 'for', 'calculating', 'eigenvalues', 'of', 'riesz', 'fractional', 'partial', 'differential', 'equations', 'with', 'homogeneous', 'dirichlet', 'boundary', 'values', 'is', 'proposed', 'in', 'this', 'paper', 'in', 'order', 'to', 'retain', 'the', 'symmetry', 'and', 'positive', 'definiteness', 'of', 'the', 'discrete', 'linear', 'system', 'we', 'introduce', 'some', 'properly', 'defined', 'sobolev', 'spaces', 'and', 'approximate', 'the', 'eigenvalue', 'problem', 'in', 'a', 'standard', 'galerkin', 'weak', 'formulation', 'instead', 'of', 'the', 'petrovgalerkin', 'one', 'as', 'in', 'literature', 'poincare', 'and', 'inverse', 'inequalities', 'are', 'proved', 'for', 'the', 'proposed', 'galerkin', 'formulation', 'which', 'finally', 'help', 'us', 'establishing', 'a', 'sharp', 'estimate', 'on', 'the', 'algebraic', 'systems', 'condition', 'number', 'rigorous', 'error', 'estimates', 'of', 'the', 'eigenvalues', 'and', 'eigenvectors', 'are', 'then', 'readily', 'obtained', 'by', 'using', 'babuvska', 'and', 'osborns', 'approximation', 'theory', 'on', 'selfadjoint', 'and', 'positivedefinite', 'eigenvalue', 'problems', 'numerical', 'results', 'are', 'presented', 'to', 'demonstrate', 'the', 'accuracy', 'and', 'efficiency', 'and', 'to', 'validate', 'the', 'asymptotically', 'exponential', 'oder', 'of', 'convergence', 'moreover', 'the', 'weyltype', 'asymptotic', 'law', 'lambda_nmathcalon2alpha', 'for', 'the', 'nth', 'eigenvalue', 'lambda_n', 'of', 'the', 'riesz', 'fractional', 'differential', 'operator', 'of', 'order', '2alpha', 'and', 'the', 'condition', 'number', 'n4alpha', 'of', 'its', 'algebraic', 'system', 'with', 'respect', 'to', 'the', 'polynomial', 'degree', 'n', 'are', 'observed']] | [-0.10223050082207746, 0.018530006094373504, -0.07476426294444882, 0.08937136162005897, -0.0925543353327417, -0.1270298055578245, -0.0068754496682058314, 0.30746352422006784, -0.28845417914202526, -0.25821737174140125, 0.14876642601614418, -0.2869058679345818, -0.12789579888929092, 0.16175526743643873, -0.06751642428709947, 0.17039010845794456, 0.05701203074117768, 0.051322337749990676, -0.1120774632574813, -0.2419623046866729, 0.34371524120381636, 0.00716752400954387, 0.2190842782549139, 0.04797780535660595, 0.10761151206125283, -0.058757231872905755, -0.027862317278049886, -0.00823557104117104, -0.16321986622226956, 0.15304909188264337, 0.2585872276145632, 0.04413103922048495, 0.3077774228018132, -0.40384607769304975, -0.14174204879063404, 0.15377590309695474, 0.1513260914334318, 0.023220950195017003, -0.008410802027182876, -0.32231975828541354, 0.12876094499924443, -0.12156415006107377, -0.1928306313583605, -0.11990018207247236, -0.006817023691144728, 0.04206879533497462, -0.3634030325615424, 0.13082288728383856, 0.09255150284817708, 0.048837211854766964, -0.08861823228445635, -0.14249134322883383, 0.003959324937092052, 0.03606860195231136, 0.021627153328154236, -0.055012635742535905, 0.01631166695941439, -0.028078997054503167, -0.09224266090729673, 0.33085551556377185, -0.04861054675330663, -0.29748158864233465, 0.09014189221142303, -0.1547730428615718, -0.10156559445091434, 0.09244072910708685, 0.15291204880590417, 0.15721604329281122, -0.09399508770799175, 0.15423504814714847, -0.03014944041067446, 0.12128195615618356, 0.08454204352372992, 0.033767953681360395, 0.03921663847618869, 0.06248052493901923, 0.1452070018616117, 0.12310987748787738, -0.005161020080863853, -0.1407556740461067, -0.34788896632380784, -0.1833806619203339, -0.23426838471953357, 0.03499783095598798, -0.18046778873299663, -0.20228182786654325, 0.3847403748659417, 0.1104376881765867, 0.13667047248288458, 0.13574712330799749, 0.24032222696890435, 0.23097276139569226, -0.022201720645950575, 0.06894089287323454, 0.1809651139284099, 0.231296954594741, 0.09833767670594777, -0.25309419741166667, 0.019224044190542328, 0.2260852159178328] |
1,803.03557 | Modified Fractional Logistic Equation | In the article [B.J.West, Exact solution to fractional logistic equation,
Physica A: Statistical Mechanics and its Applications 429 (2015) 103-108], the
author has obtained a function as the solution to fractional logistic equation
(FLE). As demonstrated later in [I. Area, J. Losada, J. J. Nieto, A note on the
fractional logistic equation, Physica A: Statistical Mechanics and its
Applications 444 (2016) 182-187], this function (West function) is not the
solution to FLE, but nevertheless as shown by West, it is in good agreement
with the numerical solution to FLE. The West function indicates a compelling
feature, in which the exponentials are substituted by Mittag-Leffler functions.
In this paper, a modified fractional logistic equation (MFLE) is introduced, to
which the West function is a solution. The proposed fractional
integro-differential equation possesses a nonlinear additive term related to
the solution of the logistic equation (LE). The method utilized in this
article, may be applied to the analysis of solutions to nonlinear fractional
differential equations of mathematical physics.
| math-ph math.MP | in the article bjwest exact solution to fractional logistic equation physica a statistical mechanics and its applications 429 2015 103108 the author has obtained a function as the solution to fractional logistic equation fle as demonstrated later in i area j losada j j nieto a note on the fractional logistic equation physica a statistical mechanics and its applications 444 2016 182187 this function west function is not the solution to fle but nevertheless as shown by west it is in good agreement with the numerical solution to fle the west function indicates a compelling feature in which the exponentials are substituted by mittagleffler functions in this paper a modified fractional logistic equation mfle is introduced to which the west function is a solution the proposed fractional integrodifferential equation possesses a nonlinear additive term related to the solution of the logistic equation le the method utilized in this article may be applied to the analysis of solutions to nonlinear fractional differential equations of mathematical physics | [['in', 'the', 'article', 'bjwest', 'exact', 'solution', 'to', 'fractional', 'logistic', 'equation', 'physica', 'a', 'statistical', 'mechanics', 'and', 'its', 'applications', '429', '2015', '103108', 'the', 'author', 'has', 'obtained', 'a', 'function', 'as', 'the', 'solution', 'to', 'fractional', 'logistic', 'equation', 'fle', 'as', 'demonstrated', 'later', 'in', 'i', 'area', 'j', 'losada', 'j', 'j', 'nieto', 'a', 'note', 'on', 'the', 'fractional', 'logistic', 'equation', 'physica', 'a', 'statistical', 'mechanics', 'and', 'its', 'applications', '444', '2016', '182187', 'this', 'function', 'west', 'function', 'is', 'not', 'the', 'solution', 'to', 'fle', 'but', 'nevertheless', 'as', 'shown', 'by', 'west', 'it', 'is', 'in', 'good', 'agreement', 'with', 'the', 'numerical', 'solution', 'to', 'fle', 'the', 'west', 'function', 'indicates', 'a', 'compelling', 'feature', 'in', 'which', 'the', 'exponentials', 'are', 'substituted', 'by', 'mittagleffler', 'functions', 'in', 'this', 'paper', 'a', 'modified', 'fractional', 'logistic', 'equation', 'mfle', 'is', 'introduced', 'to', 'which', 'the', 'west', 'function', 'is', 'a', 'solution', 'the', 'proposed', 'fractional', 'integrodifferential', 'equation', 'possesses', 'a', 'nonlinear', 'additive', 'term', 'related', 'to', 'the', 'solution', 'of', 'the', 'logistic', 'equation', 'le', 'the', 'method', 'utilized', 'in', 'this', 'article', 'may', 'be', 'applied', 'to', 'the', 'analysis', 'of', 'solutions', 'to', 'nonlinear', 'fractional', 'differential', 'equations', 'of', 'mathematical', 'physics']] | [-0.05740181275756208, -0.025426473393342138, -0.12803866110180984, 0.0497737955887692, -0.11455019077529079, -0.15452403483206625, 0.0087673829482313, 0.26595651165738426, -0.29787660852329145, -0.26826423227711815, 0.10842211467144514, -0.32695245899850073, -0.2181353836164156, 0.1708973643994711, -0.1009159632582472, 0.10510759550704973, 0.016249082352017392, -0.01938037827078785, -0.030181430679346834, -0.23074442865500538, 0.24267101533398588, 0.04602951698167169, 0.2249429979322186, 0.025955906036593344, 0.16841210077678703, -0.04832692807887374, -0.03901231822829624, 0.00016550296882850043, -0.18922323271956132, 0.07219499650393954, 0.26106238362859496, 0.06924658071724062, 0.3388642590921025, -0.3332133084443045, -0.23805399189894058, 0.0774657861054846, 0.1196466485829807, 0.05808726244863493, -0.001993019334098428, -0.30842856821598286, 0.041317303069167255, -0.18638823950744193, -0.19805271562292986, -0.03016027870421426, 0.10468295639126289, 0.05165744872520799, -0.2802643724254431, 0.16871549804573474, 0.0723036118256657, -0.010086142845590663, -0.0669668524454475, -0.16255069145736117, -0.026864083767261192, -0.024494507251689154, 0.04317163482094357, 0.10687319578542172, 0.026791528590393732, -0.13558849157701877, -0.1058322143920275, 0.3487012932273727, -0.0958918751917363, -0.26166579977143556, 0.13777306461301836, -0.11740719280003206, -0.12587419252044388, 0.0887172618209853, 0.1281816062476972, 0.10639700390722441, -0.21032398881286568, 0.1273761171383367, -0.0750456566529013, 0.15814138151797819, 0.07572183858383424, -0.060226319543267126, 0.09314592701515981, 0.12467747277100079, 0.05152879675281934, 0.12584697258997107, -0.026266260688650126, -0.14647104398503621, -0.29819725765065747, -0.18711525501078863, -0.1951804999088556, 0.08832830813019579, -0.06851581477698211, -0.15020886618952753, 0.37949116162446717, 0.12441241347031402, 0.13322814594468343, 0.019361016458776775, 0.20539334941198414, 0.2529704653172065, -0.019833822650777072, 0.08204754793391743, 0.19089302992425072, 0.19470014034550615, 0.18955429763134038, -0.2030029376008496, 0.036389644717600964, 0.1266840363488249] |
1,803.03558 | Uncovering instabilities in the spatiotemporal dynamics of a
shear-thickening cornstarch suspension | Recent theories predict that discontinuous shear-thickening (DST) involves an
instability, the nature of which remains elusive. Here, we explore unsteady
dynamics in a dense cornstarch suspension by coupling long rheological
measurements under constant shear stresses to ultrasound imaging. We
demonstrate that unsteadiness in DST results from localized bands that travel
along the vorticity direction with a specific signature on the global shear
rate response. These propagating events coexist with quiescent phases for
stresses slightly above DST onset, resulting in intermittent, turbulent-like
dynamics. Deeper into DST, events proliferate, leading to simpler, Gaussian
dynamics. We interpret our results in terms of unstable vorticity bands as
inferred from recent model and numerical simulations.
| cond-mat.soft cond-mat.mtrl-sci nlin.CD physics.flu-dyn | recent theories predict that discontinuous shearthickening dst involves an instability the nature of which remains elusive here we explore unsteady dynamics in a dense cornstarch suspension by coupling long rheological measurements under constant shear stresses to ultrasound imaging we demonstrate that unsteadiness in dst results from localized bands that travel along the vorticity direction with a specific signature on the global shear rate response these propagating events coexist with quiescent phases for stresses slightly above dst onset resulting in intermittent turbulentlike dynamics deeper into dst events proliferate leading to simpler gaussian dynamics we interpret our results in terms of unstable vorticity bands as inferred from recent model and numerical simulations | [['recent', 'theories', 'predict', 'that', 'discontinuous', 'shearthickening', 'dst', 'involves', 'an', 'instability', 'the', 'nature', 'of', 'which', 'remains', 'elusive', 'here', 'we', 'explore', 'unsteady', 'dynamics', 'in', 'a', 'dense', 'cornstarch', 'suspension', 'by', 'coupling', 'long', 'rheological', 'measurements', 'under', 'constant', 'shear', 'stresses', 'to', 'ultrasound', 'imaging', 'we', 'demonstrate', 'that', 'unsteadiness', 'in', 'dst', 'results', 'from', 'localized', 'bands', 'that', 'travel', 'along', 'the', 'vorticity', 'direction', 'with', 'a', 'specific', 'signature', 'on', 'the', 'global', 'shear', 'rate', 'response', 'these', 'propagating', 'events', 'coexist', 'with', 'quiescent', 'phases', 'for', 'stresses', 'slightly', 'above', 'dst', 'onset', 'resulting', 'in', 'intermittent', 'turbulentlike', 'dynamics', 'deeper', 'into', 'dst', 'events', 'proliferate', 'leading', 'to', 'simpler', 'gaussian', 'dynamics', 'we', 'interpret', 'our', 'results', 'in', 'terms', 'of', 'unstable', 'vorticity', 'bands', 'as', 'inferred', 'from', 'recent', 'model', 'and', 'numerical', 'simulations']] | [-0.1609177486632358, 0.237241504387004, -0.0932406644421545, 0.023618321823464197, -0.04512513851408254, -0.06956129179928791, 0.0034137489189478482, 0.36390594409948046, -0.30789867808873, -0.23525888011790813, 0.06885987747545269, -0.23901424472304908, -0.21349148129705678, 0.1776206721784547, -0.019894850156693296, 0.045673711017959494, 0.059439779362979936, -0.044319959518245675, -0.03685172790534456, -0.1298276344779879, 0.22536896074360066, 0.05727190045343543, 0.33198966039767996, -0.0009036715994377366, 0.07286805207841099, -0.07781075140545991, 0.018483782839030027, 0.06408148548481139, -0.1947969699605892, -0.008079679295505312, 0.2355794444383884, 0.0019251667428761721, 0.22337380275130272, -0.5053306612101468, -0.3215896608053961, 0.022638477961961393, 0.1507115699657747, 0.08231498689962212, -0.02587330987708728, -0.2915175266098231, 0.04183534791015766, -0.1303822814698585, -0.11722151874564588, -0.10112181372136217, 0.050819019382734865, 0.01740319727581333, -0.2576728387989781, 0.2301425252713009, 0.026095723453909158, 0.07710110295844391, -0.14814304659693417, -0.00840896920999512, -0.06857688730709594, 0.09065036609536037, 0.13927425538210875, 0.050805141535502946, 0.17025603762065822, -0.1884386425414546, -0.09219082047824155, 0.36748889755796305, -0.08581826171350919, -0.1376846966164356, 0.2829650593413548, -0.17647301657350248, -0.12681036714295094, 0.23929621458730915, 0.22354665777053345, 0.07367987245776352, -0.04928256720463237, -0.07596167460644872, -0.03178629989481785, 0.15889367805158888, 0.07154447786848653, -0.03637954058781774, 0.24178373304206285, 0.19366330816092986, 0.034900886470197956, 0.12623199855654754, -0.12311657286429016, -0.10911769329739565, -0.26640794742852447, -0.09761529416904192, -0.12310639616863972, 0.0392990074776621, -0.08322385414066957, -0.17707642211409455, 0.39028278724502097, 0.16079985725346804, 0.1844569299094887, 0.06593419806290926, 0.2811906176365235, 0.06463582076619125, 0.0197809160168452, 0.10469950448128987, 0.3312570764386857, 0.14156165028795262, 0.17695887668312274, -0.2123994444676844, 0.07544353326824917, 0.0678665899713947] |
1,803.03559 | Homomorphic Encryption for Speaker Recognition: Protection of Biometric
Templates and Vendor Model Parameters | Data privacy is crucial when dealing with biometric data. Accounting for the
latest European data privacy regulation and payment service directive,
biometric template protection is essential for any commercial application.
Ensuring unlinkability across biometric service operators, irreversibility of
leaked encrypted templates, and renewability of e.g., voice models following
the i-vector paradigm, biometric voice-based systems are prepared for the
latest EU data privacy legislation. Employing Paillier cryptosystems, Euclidean
and cosine comparators are known to ensure data privacy demands, without loss
of discrimination nor calibration performance. Bridging gaps from template
protection to speaker recognition, two architectures are proposed for the
two-covariance comparator, serving as a generative model in this study. The
first architecture preserves privacy of biometric data capture subjects. In the
second architecture, model parameters of the comparator are encrypted as well,
such that biometric service providers can supply the same comparison modules
employing different key pairs to multiple biometric service operators. An
experimental proof-of-concept and complexity analysis is carried out on the
data from the 2013-2014 NIST i-vector machine learning challenge.
| cs.CR cs.SD eess.AS | data privacy is crucial when dealing with biometric data accounting for the latest european data privacy regulation and payment service directive biometric template protection is essential for any commercial application ensuring unlinkability across biometric service operators irreversibility of leaked encrypted templates and renewability of eg voice models following the ivector paradigm biometric voicebased systems are prepared for the latest eu data privacy legislation employing paillier cryptosystems euclidean and cosine comparators are known to ensure data privacy demands without loss of discrimination nor calibration performance bridging gaps from template protection to speaker recognition two architectures are proposed for the twocovariance comparator serving as a generative model in this study the first architecture preserves privacy of biometric data capture subjects in the second architecture model parameters of the comparator are encrypted as well such that biometric service providers can supply the same comparison modules employing different key pairs to multiple biometric service operators an experimental proofofconcept and complexity analysis is carried out on the data from the 20132014 nist ivector machine learning challenge | [['data', 'privacy', 'is', 'crucial', 'when', 'dealing', 'with', 'biometric', 'data', 'accounting', 'for', 'the', 'latest', 'european', 'data', 'privacy', 'regulation', 'and', 'payment', 'service', 'directive', 'biometric', 'template', 'protection', 'is', 'essential', 'for', 'any', 'commercial', 'application', 'ensuring', 'unlinkability', 'across', 'biometric', 'service', 'operators', 'irreversibility', 'of', 'leaked', 'encrypted', 'templates', 'and', 'renewability', 'of', 'eg', 'voice', 'models', 'following', 'the', 'ivector', 'paradigm', 'biometric', 'voicebased', 'systems', 'are', 'prepared', 'for', 'the', 'latest', 'eu', 'data', 'privacy', 'legislation', 'employing', 'paillier', 'cryptosystems', 'euclidean', 'and', 'cosine', 'comparators', 'are', 'known', 'to', 'ensure', 'data', 'privacy', 'demands', 'without', 'loss', 'of', 'discrimination', 'nor', 'calibration', 'performance', 'bridging', 'gaps', 'from', 'template', 'protection', 'to', 'speaker', 'recognition', 'two', 'architectures', 'are', 'proposed', 'for', 'the', 'twocovariance', 'comparator', 'serving', 'as', 'a', 'generative', 'model', 'in', 'this', 'study', 'the', 'first', 'architecture', 'preserves', 'privacy', 'of', 'biometric', 'data', 'capture', 'subjects', 'in', 'the', 'second', 'architecture', 'model', 'parameters', 'of', 'the', 'comparator', 'are', 'encrypted', 'as', 'well', 'such', 'that', 'biometric', 'service', 'providers', 'can', 'supply', 'the', 'same', 'comparison', 'modules', 'employing', 'different', 'key', 'pairs', 'to', 'multiple', 'biometric', 'service', 'operators', 'an', 'experimental', 'proofofconcept', 'and', 'complexity', 'analysis', 'is', 'carried', 'out', 'on', 'the', 'data', 'from', 'the', '20132014', 'nist', 'ivector', 'machine', 'learning', 'challenge']] | [-0.13759309899601976, -0.061323499198801146, -0.04607761788220536, 0.08979304904977863, -0.08965647992948016, -0.29549859375720455, 0.05735410990182464, 0.37866750676405325, -0.29839020003647315, -0.33203840698804377, 0.12548295633189557, -0.3661970931226553, -0.06503646721313955, 0.2204218876545356, -0.2085509496105879, 0.1820413787524111, 0.06880736511962532, 0.01605400760773812, 0.014695955155218935, -0.2777208148146368, 0.3142761378797025, 0.06057040445222767, 0.44803260218837027, 0.002856081657486378, 0.05348888228264411, 0.007964196401722618, -0.05034840479079832, -0.13589765635159243, -0.008669861545725988, 0.15110589837181498, 0.3625729744988068, 0.26967076906802123, 0.3022040680227195, -0.4055927419957854, -0.13977208217404805, 0.07039238706220095, 0.10719975251206762, 0.07939706623730575, -0.12467918025754039, -0.3581187755004475, 0.08623351400012713, -0.24261641560243608, -0.01152104793458119, -0.11266989481825514, -0.06039762713797611, 0.015849516345408453, -0.3128530134604665, -0.017434432604915007, 0.02579376208471939, 0.1668670630391092, -0.08073563159983495, -0.08856757692772256, -0.0651684378855173, 0.21682603547804902, 0.05126475072713822, -0.029929645545505118, 0.17482639003280528, -0.12362544257441789, -0.17451791127333582, 0.37046155969463507, -0.025468765447307487, -0.14762082392592313, 0.11890941901413514, -0.003487092719727455, -0.17965762689709663, 0.04322849869998117, 0.2114094298909151, -0.00307061707982573, -0.261148661798429, 0.022359755720954236, 0.006537160398052818, 0.2431248602782481, 0.0797387020353823, 0.07500272990099689, 0.1711615265929829, 0.23842823946953218, 0.022411476412220424, 0.10856888886298653, -0.08581396607136542, -0.08371247392776009, -0.21234051876917712, -0.1339266433231753, -0.18127882747067767, -0.027090627418351554, -0.09804149562480567, -0.13261415626159345, 0.373259900958889, 0.19399950783782413, 0.13166555090319673, 0.08059381528260853, 0.44373607913241586, 0.016689698436413204, 0.16953303572617073, 0.07440174846860344, 0.14996924739366826, -0.041821873857028034, 0.1749078159925897, -0.10631198386028656, 0.19422537711112808, -0.0043506006746051405] |
1,803.0356 | Constrained hierarchical networked optimization for energy markets | In this paper, we propose a distributed control strategy for the design of an
energy market. The method relies on a hierarchical structure of aggregators for
the coordination of prosumers (agents which can produce and consume energy).
The hierarchy reflects the voltage level separations of the electrical grid and
allows aggregating prosumers in pools, while taking into account the grid
operational constraints. To reach optimal coordination, the prosumers
communicate their forecasted power profile to the upper level of the hierarchy.
Each time the information crosses upwards a level of the hierarchy, it is first
aggregated, both to strongly reduce the data flow and to preserve the privacy.
In the first part of the paper, the decomposition algorithm, which is based on
the alternating direction method of multipliers (ADMM), is presented. In the
second part, we explore how the proposed algorithm scales with increasing
number of prosumers and hierarchical levels, through extensive simulations
based on randomly generated scenarios.
| cs.SY cs.MA | in this paper we propose a distributed control strategy for the design of an energy market the method relies on a hierarchical structure of aggregators for the coordination of prosumers agents which can produce and consume energy the hierarchy reflects the voltage level separations of the electrical grid and allows aggregating prosumers in pools while taking into account the grid operational constraints to reach optimal coordination the prosumers communicate their forecasted power profile to the upper level of the hierarchy each time the information crosses upwards a level of the hierarchy it is first aggregated both to strongly reduce the data flow and to preserve the privacy in the first part of the paper the decomposition algorithm which is based on the alternating direction method of multipliers admm is presented in the second part we explore how the proposed algorithm scales with increasing number of prosumers and hierarchical levels through extensive simulations based on randomly generated scenarios | [['in', 'this', 'paper', 'we', 'propose', 'a', 'distributed', 'control', 'strategy', 'for', 'the', 'design', 'of', 'an', 'energy', 'market', 'the', 'method', 'relies', 'on', 'a', 'hierarchical', 'structure', 'of', 'aggregators', 'for', 'the', 'coordination', 'of', 'prosumers', 'agents', 'which', 'can', 'produce', 'and', 'consume', 'energy', 'the', 'hierarchy', 'reflects', 'the', 'voltage', 'level', 'separations', 'of', 'the', 'electrical', 'grid', 'and', 'allows', 'aggregating', 'prosumers', 'in', 'pools', 'while', 'taking', 'into', 'account', 'the', 'grid', 'operational', 'constraints', 'to', 'reach', 'optimal', 'coordination', 'the', 'prosumers', 'communicate', 'their', 'forecasted', 'power', 'profile', 'to', 'the', 'upper', 'level', 'of', 'the', 'hierarchy', 'each', 'time', 'the', 'information', 'crosses', 'upwards', 'a', 'level', 'of', 'the', 'hierarchy', 'it', 'is', 'first', 'aggregated', 'both', 'to', 'strongly', 'reduce', 'the', 'data', 'flow', 'and', 'to', 'preserve', 'the', 'privacy', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'the', 'decomposition', 'algorithm', 'which', 'is', 'based', 'on', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'is', 'presented', 'in', 'the', 'second', 'part', 'we', 'explore', 'how', 'the', 'proposed', 'algorithm', 'scales', 'with', 'increasing', 'number', 'of', 'prosumers', 'and', 'hierarchical', 'levels', 'through', 'extensive', 'simulations', 'based', 'on', 'randomly', 'generated', 'scenarios']] | [-0.15144433217585845, 0.06542983310451735, -0.07684149791428724, 0.038186904210537956, -0.07906151701292842, -0.10818386869801647, 0.11759753765651043, 0.3577731266190672, -0.3256149959934365, -0.35840447447529644, 0.10166829408559455, -0.26132625894731126, -0.09272536294161086, 0.14720531572383133, -0.04624528570136257, 0.0063153905082185555, 0.03760343304075965, 0.035912781351714565, -0.005791687788471437, -0.26473026285333573, 0.3058417404380443, 0.11102989980962816, 0.33972540016695385, 0.038364811474160786, 0.151112426449782, -0.003269950595275042, -0.032739577387091795, 0.014452654595492751, -0.07131983772673567, 0.17080882927521493, 0.23606595677875314, 0.14078635559862207, 0.3272441436142133, -0.46693362719171744, -0.14971986334848034, 0.10973254273865063, 0.13225102610886097, 0.06005282375878494, -0.02472913267526918, -0.25359646136024194, 0.09939516307845427, -0.1792288612526883, -0.05210683948010396, -0.05268066027646611, -0.0671518855790495, 0.07560609219778198, -0.2930450647135835, 0.03505846959387492, 0.02865540777825436, 0.003557956087733708, -0.08995643925184242, -0.10154233748466963, -0.04914802349332696, 0.17198010242286815, 0.04068724134236954, -0.059575978516205066, 0.1509270447404213, -0.10126567570712108, -0.11444446242823722, 0.3847456098338411, -0.005838358825944649, -0.19354562386929705, 0.11744840792602723, -0.0937559327828419, -0.12963267409533358, 0.12073126499048749, 0.2462753010698695, 0.08394288416406151, -0.13554939845388542, 0.05607023865138744, -0.025052920517743014, 0.2037540642695893, 0.026577916499049326, -0.014180064288110347, 0.1805655050453297, 0.2288362063248019, 0.18234682282444778, 0.12890156709302103, -0.08233135568933075, -0.1298923707184542, -0.2503111194255673, -0.1441443502594521, -0.17486658600339916, -0.041719438273839324, -0.090767598347249, -0.13321878756900693, 0.44777451122215217, 0.18608904797524498, 0.18990380355530673, 0.09430368592410948, 0.35621186931229015, 0.14122645736072853, 0.07489573116604073, 0.09611268031594765, 0.1805929700772806, 0.043465783190765196, 0.14493180308372353, -0.23711178098841582, 0.08903674903595642, 0.05701536145417174] |
1,803.03561 | Dual of Hardy-amalgam spaces and norms inequalities | We characterize the dual spaces of the generalized Hardy spaces defined by
replacing Lebesgue quasi-norms by Wiener amalgam ones. In these generalized
Hardy spaces, we prove that some classical linear operators such as
Calder\'on-Zygmund, convolution and Riesz potential operators are bounded.
| math.FA | we characterize the dual spaces of the generalized hardy spaces defined by replacing lebesgue quasinorms by wiener amalgam ones in these generalized hardy spaces we prove that some classical linear operators such as calderonzygmund convolution and riesz potential operators are bounded | [['we', 'characterize', 'the', 'dual', 'spaces', 'of', 'the', 'generalized', 'hardy', 'spaces', 'defined', 'by', 'replacing', 'lebesgue', 'quasinorms', 'by', 'wiener', 'amalgam', 'ones', 'in', 'these', 'generalized', 'hardy', 'spaces', 'we', 'prove', 'that', 'some', 'classical', 'linear', 'operators', 'such', 'as', 'calderonzygmund', 'convolution', 'and', 'riesz', 'potential', 'operators', 'are', 'bounded']] | [-0.05804133183527284, 0.16955321795511535, -0.00466291610969276, 0.22825398782222736, -0.1340521874428704, -0.08903881900648518, -0.036973841533791726, 0.3705900869354969, -0.44003258064025785, -0.01911263862942777, 0.18631336445034277, -0.2936704381846073, -0.1936208140105009, 0.20204063514020384, -0.21235991413591476, 0.12496191809641016, -0.019457764264832183, 0.02755050080623932, -0.17253593529756295, -0.29616349581174733, 0.5124330512452416, -0.09614149383950706, 0.12563706475605324, -0.005057791793128339, 0.03962764589161408, 0.016881434383188804, -0.10673608320833343, -0.0565640058186723, -0.17467893460831496, 0.17553713104528626, 0.29350499786073114, 0.05068431001315575, 0.3729630551051076, -0.40263737429205965, -0.2332628261888536, 0.3051122477868708, 0.11586809320738767, -0.21531575575198342, 0.0009518909188578041, -0.41855968348681927, -0.002060381945495198, -0.12170576959530391, -0.14488639417899454, -0.19794603232748625, -0.028790529152923603, 0.14877845955694594, -0.35834674473579337, 0.05599518989712545, 0.15794410013661878, 0.030246365701825154, -0.2510127377378323, -0.17106107856351427, -0.002395506346280255, -0.004429622326137089, -0.12259740686816413, 0.07549232326266242, 0.07871162883437625, 0.03950652873666003, -0.21067417425489643, 0.28294544421681544, -0.11584243771233936, -0.3350990679592076, 0.05691674526599122, -0.2159755660516278, -0.09084358802860285, -0.06621162440037219, 0.029851550122768414, 0.12850435318925033, -0.10726474770685522, 0.2453773675426818, -0.07835606181221764, -0.021094013550659506, 0.19962606671061822, 0.19762686369713486, -0.06124897737328599, 0.007807838480647017, 0.22977115595486106, 0.186483635362692, 0.058086313807729224, -0.11919011390432943, -0.35019697124002186, -0.18226025580632976, -0.22907189570549058, 0.07176851235875269, -0.20525860773909144, -0.22322795689730654, 0.29294846961047594, 0.038115087878129374, 0.10745021408401066, 0.1637328720038257, 0.12639471556900478, 0.12453737230006061, 0.09093673959965022, 0.02677832128162064, 0.14365792064714564, 0.26332246354304073, 0.10585503280162811, -0.05293788657262467, -0.08491248009362962, 0.376727965354803] |
1,803.03562 | An Integrated Inverse Space Sparse Representation Framework for Tumor
Classification | Microarray gene expression data-based tumor classification is an active and
challenging issue. In this paper, an integrated tumor classification framework
is presented, which aims to exploit information in existing available samples,
and focuses on the small sample problem and unbalanced classification problem.
Firstly, an inverse space sparse representation based classification (ISSRC)
model is proposed by considering the characteristics of gene-based tumor data,
such as sparsity and a small number of training samples. A decision information
factors (DIF)-based gene selection method is constructed to enhance the
representation ability of the ISSRC. It is worth noting that the DIF is
established from reducing clinical misdiagnosis rate and dimension of small
sample data. For further improving the representation ability and
classification stability of the ISSRC, feature learning is conducted on the
selected gene subset. The feature learning method is constructed by
complementing the advantages of non-negative matrix factorization (NMF) and
deep learning. Without confusion, the ISSRC combined with gene selection and
feature learning is called the integrated ISSRC, whose stability, optimization
and the corresponding convergence are analyzed. Extensive experiments on six
public microarray gene expression datasets show the integrated ISSRC-based
tumor classification framework is superior to classical and state-of-the-art
methods. There are significant improvements in classification accuracy,
specificity and sensitivity, whether there is a tumor in the early diagnosis,
what kind of tumor, or whether metastasis occurs after tumor surgery.
| cs.CV | microarray gene expression databased tumor classification is an active and challenging issue in this paper an integrated tumor classification framework is presented which aims to exploit information in existing available samples and focuses on the small sample problem and unbalanced classification problem firstly an inverse space sparse representation based classification issrc model is proposed by considering the characteristics of genebased tumor data such as sparsity and a small number of training samples a decision information factors difbased gene selection method is constructed to enhance the representation ability of the issrc it is worth noting that the dif is established from reducing clinical misdiagnosis rate and dimension of small sample data for further improving the representation ability and classification stability of the issrc feature learning is conducted on the selected gene subset the feature learning method is constructed by complementing the advantages of nonnegative matrix factorization nmf and deep learning without confusion the issrc combined with gene selection and feature learning is called the integrated issrc whose stability optimization and the corresponding convergence are analyzed extensive experiments on six public microarray gene expression datasets show the integrated issrcbased tumor classification framework is superior to classical and stateoftheart methods there are significant improvements in classification accuracy specificity and sensitivity whether there is a tumor in the early diagnosis what kind of tumor or whether metastasis occurs after tumor surgery | [['microarray', 'gene', 'expression', 'databased', 'tumor', 'classification', 'is', 'an', 'active', 'and', 'challenging', 'issue', 'in', 'this', 'paper', 'an', 'integrated', 'tumor', 'classification', 'framework', 'is', 'presented', 'which', 'aims', 'to', 'exploit', 'information', 'in', 'existing', 'available', 'samples', 'and', 'focuses', 'on', 'the', 'small', 'sample', 'problem', 'and', 'unbalanced', 'classification', 'problem', 'firstly', 'an', 'inverse', 'space', 'sparse', 'representation', 'based', 'classification', 'issrc', 'model', 'is', 'proposed', 'by', 'considering', 'the', 'characteristics', 'of', 'genebased', 'tumor', 'data', 'such', 'as', 'sparsity', 'and', 'a', 'small', 'number', 'of', 'training', 'samples', 'a', 'decision', 'information', 'factors', 'difbased', 'gene', 'selection', 'method', 'is', 'constructed', 'to', 'enhance', 'the', 'representation', 'ability', 'of', 'the', 'issrc', 'it', 'is', 'worth', 'noting', 'that', 'the', 'dif', 'is', 'established', 'from', 'reducing', 'clinical', 'misdiagnosis', 'rate', 'and', 'dimension', 'of', 'small', 'sample', 'data', 'for', 'further', 'improving', 'the', 'representation', 'ability', 'and', 'classification', 'stability', 'of', 'the', 'issrc', 'feature', 'learning', 'is', 'conducted', 'on', 'the', 'selected', 'gene', 'subset', 'the', 'feature', 'learning', 'method', 'is', 'constructed', 'by', 'complementing', 'the', 'advantages', 'of', 'nonnegative', 'matrix', 'factorization', 'nmf', 'and', 'deep', 'learning', 'without', 'confusion', 'the', 'issrc', 'combined', 'with', 'gene', 'selection', 'and', 'feature', 'learning', 'is', 'called', 'the', 'integrated', 'issrc', 'whose', 'stability', 'optimization', 'and', 'the', 'corresponding', 'convergence', 'are', 'analyzed', 'extensive', 'experiments', 'on', 'six', 'public', 'microarray', 'gene', 'expression', 'datasets', 'show', 'the', 'integrated', 'issrcbased', 'tumor', 'classification', 'framework', 'is', 'superior', 'to', 'classical', 'and', 'stateoftheart', 'methods', 'there', 'are', 'significant', 'improvements', 'in', 'classification', 'accuracy', 'specificity', 'and', 'sensitivity', 'whether', 'there', 'is', 'a', 'tumor', 'in', 'the', 'early', 'diagnosis', 'what', 'kind', 'of', 'tumor', 'or', 'whether', 'metastasis', 'occurs', 'after', 'tumor', 'surgery']] | [-0.01484045355166826, -0.017792177463998086, -0.03836924309738808, 0.08011494297223787, -0.10036144977228509, -0.15148254230411518, 0.044532713079825044, 0.40488409420682325, -0.2460280708982868, -0.2895794199647692, 0.1252569728743078, -0.28658074757291213, -0.205820780509255, 0.18611310354744395, -0.13634089884865616, 0.09395182156314452, 0.15104699412360786, 0.05571715857678403, 7.629999114821355e-05, -0.3182780518848449, 0.29640619943849744, 0.05811625294270925, 0.39846845710029205, 0.015707266326062383, 0.15076871373794146, -0.020529922431127893, -0.10448191476675371, -0.001950509312381554, -0.0801348600610638, 0.16938534702588287, 0.35423878681328563, 0.26809619321694805, 0.34073125386507147, -0.3535359015395322, -0.20944410265423358, 0.13840904291305278, 0.1595219732898598, 0.09689301155927953, -0.048801123892577986, -0.3113265840253896, 0.08801735356864002, -0.1146287150373165, -0.014138083165097569, -0.12532596396178836, -0.0019201595067150064, -0.046944127269089225, -0.3112731374805379, 0.10664796397193438, 0.061049409018208586, 0.09839831799475683, -0.08829306580954129, -0.15105087880459098, 0.00741392622805304, 0.1546721631190222, 0.054119625439763897, 0.05945277923200693, 0.14893704942013655, -0.18233417979441582, -0.13810604027161996, 0.30486092515082824, 0.004078854316224655, -0.2340113375749853, 0.19037965796370473, -0.03425144745373271, -0.12378427677063478, 0.14715921306594584, 0.2075730862365001, 0.08295846188389179, -0.20656327630496688, 0.029804461661777977, 0.0012126013015707334, 0.18003372769802808, 0.056811643125903276, -0.049928576085302566, 0.11656467044829494, 0.3144338707957003, 0.021282653433995113, 0.12842720926014914, -0.1509926672367793, -0.03311659334020482, -0.20470529734260506, -0.10354180350278815, -0.18676418273502754, 0.0010060586221516132, -0.138728156416069, -0.1514060327866011, 0.38381798894248076, 0.13602725439679084, 0.17444502683149443, 0.05974101231692152, 0.3089523097127676, 0.03014373494325102, 0.09166000902549261, 0.028684672829177645, 0.15634692377100387, 0.08038501396568284, 0.053770237368428044, -0.25342111895067826, 0.10771484763464993, 0.05320770831571685] |
1,803.03563 | On generic principal ideals in the exterior algebra | We give a lower bound on the Hilbert series of the exterior algebra modulo a
principal ideal generated by a generic form of odd degree and disprove a
conjecture by Moreno-Soc\'ias and Snellman. We also show that the lower bound
is equal to the minimal Hilbert series in some specific cases.
| math.AC | we give a lower bound on the hilbert series of the exterior algebra modulo a principal ideal generated by a generic form of odd degree and disprove a conjecture by morenosocias and snellman we also show that the lower bound is equal to the minimal hilbert series in some specific cases | [['we', 'give', 'a', 'lower', 'bound', 'on', 'the', 'hilbert', 'series', 'of', 'the', 'exterior', 'algebra', 'modulo', 'a', 'principal', 'ideal', 'generated', 'by', 'a', 'generic', 'form', 'of', 'odd', 'degree', 'and', 'disprove', 'a', 'conjecture', 'by', 'morenosocias', 'and', 'snellman', 'we', 'also', 'show', 'that', 'the', 'lower', 'bound', 'is', 'equal', 'to', 'the', 'minimal', 'hilbert', 'series', 'in', 'some', 'specific', 'cases']] | [-0.18331754056736826, 0.11388298016041518, -0.08521523071452976, 0.06821815722854808, -0.07073089987039566, -0.14227943658828734, 0.01652815319597721, 0.2582114132400602, -0.25343636983074247, -0.24709895238280297, 0.12007301627425476, -0.23112463958095758, -0.16732733537908642, 0.22135917795822024, -0.06180216087028384, 0.006668218094855547, 0.03761188505683094, 0.11731623448431491, -0.08514050993602723, -0.33228514444082974, 0.38257429480552674, 0.011915985457599164, 0.2024323298037052, 0.07898134598508477, 0.07684995470568538, -0.019797513782978057, 0.023997273575514556, -0.0327438791862005, -0.1834542776698072, 0.17624032320454716, 0.21420482881367206, 0.11177107241936028, 0.25147262364625933, -0.41572020422667266, -0.1119413910107687, 0.16780119338072835, 0.1255757297668606, 0.029466380327939988, -0.02143742087529972, -0.21013715248554946, 0.1348334488645196, -0.17964494717103663, -0.16061087787151337, -0.0913807549327612, 0.07099987087771296, -0.03910018593072891, -0.2720581224281341, 0.057911205305135806, 0.1556942843645811, 0.1167906591296196, -0.07528933130204678, -0.11004999896511436, -0.01875777490437031, 0.02018931289203465, -0.03072215756867081, 0.005220906194299459, 0.006716308463364839, -0.09735452584922313, -0.12558497447520495, 0.3108312590792775, -0.11460139984032139, -0.24840154219418764, 0.12838388837873935, -0.21660294499248267, -0.13875663220882417, 0.09061434144154192, 0.10729385823011399, 0.14822571780532598, -0.006661441586911679, 0.15561265676980837, -0.1763448916748166, 0.09930052498355507, 0.13374446362257003, 0.0071842432115226985, 0.12019192469539121, 0.03514296844601631, 0.09825709116412326, 0.21180320812389256, 0.013059852407313883, -0.006080408655107021, -0.38363335251808167, -0.23005629100138322, -0.21767297372221947, 0.11648948715999723, -0.12663053648022468, -0.13913549656048418, 0.3858470744034275, 0.078480897709087, 0.22472186371684075, 0.10101609054952859, 0.25551986385136843, 0.13900738066062332, 0.027664175871759653, 0.10311990006943234, 0.1403136423259275, 0.14360688597895205, -0.07972946515306831, -0.15927878637798132, 0.015127122849225998, 0.16962291618809103] |
1,803.03564 | A B\"acklund transformation for elliptic four-point conformal blocks | We apply an integral transformation to solutions of a partial differential
equation for five-point correlation functions in Liouville theory on a sphere
with one degenerate field $V_{-\frac{1}{2b}}$. By repeating this
transformation, we can reach a whole lattice of values for the conformal
dimensions of the four other operators. Factorizing out the degenerate field
leads to integral representations of the corresponding four-point conformal
blocks. We illustrate this procedure on the elliptic conformal blocks
discovered in a previous publication.
| hep-th | we apply an integral transformation to solutions of a partial differential equation for fivepoint correlation functions in liouville theory on a sphere with one degenerate field v_frac12b by repeating this transformation we can reach a whole lattice of values for the conformal dimensions of the four other operators factorizing out the degenerate field leads to integral representations of the corresponding fourpoint conformal blocks we illustrate this procedure on the elliptic conformal blocks discovered in a previous publication | [['we', 'apply', 'an', 'integral', 'transformation', 'to', 'solutions', 'of', 'a', 'partial', 'differential', 'equation', 'for', 'fivepoint', 'correlation', 'functions', 'in', 'liouville', 'theory', 'on', 'a', 'sphere', 'with', 'one', 'degenerate', 'field', 'v_frac12b', 'by', 'repeating', 'this', 'transformation', 'we', 'can', 'reach', 'a', 'whole', 'lattice', 'of', 'values', 'for', 'the', 'conformal', 'dimensions', 'of', 'the', 'four', 'other', 'operators', 'factorizing', 'out', 'the', 'degenerate', 'field', 'leads', 'to', 'integral', 'representations', 'of', 'the', 'corresponding', 'fourpoint', 'conformal', 'blocks', 'we', 'illustrate', 'this', 'procedure', 'on', 'the', 'elliptic', 'conformal', 'blocks', 'discovered', 'in', 'a', 'previous', 'publication']] | [-0.15501644447029225, 0.07366102081007404, -0.08918769084419564, 0.04915800647454729, -0.09832040810847263, -0.09229520812483602, -0.012688011752049389, 0.3080524666676004, -0.24376898538321257, -0.20898821877046048, 0.11169046416915462, -0.31532711433981986, -0.1746901687920878, 0.17206273022058763, 0.0023146369739582666, 0.11411720144697986, 0.035406760718232316, 0.07118241368841968, -0.18163955217766525, -0.30311285266897786, 0.3851647711371219, -0.04404157242664185, 0.25227885051189286, -0.0037549142970850595, 0.1398625023859112, 0.05768976423668822, -0.04800515606582753, -0.01150065959480248, -0.12370430192861118, 0.14156250810054571, 0.2497596651511757, 0.03535722749381277, 0.1989526047683811, -0.4154989548811787, -0.18063688135129938, 0.03954586987138579, 0.16129362811089346, 0.11571023756589152, 0.00589020561279827, -0.2673116795424568, 0.016052627994979144, -0.1263398935675229, -0.21072687672475646, -0.09160506016709596, -0.009749904841699294, -0.03078469836251124, -0.28311585899638503, 0.08568066254433927, 0.026889812323803965, 0.04150444570328354, -0.07678455080665451, -0.07650058513115111, 0.003081678284185105, 0.09862818712932303, 0.03312146049881305, 0.0478612964691006, 0.08825389736356508, -0.14541793050317975, -0.13866285566703146, 0.30755251103178843, -0.09405340232249153, -0.27115237894222927, 0.11922942599630915, -0.15539375895413718, -0.19871666404957833, 0.11829719403268475, 0.13399737544578352, 0.14789227982002653, -0.1698587026606363, 0.14980256613834123, -0.07127107388192885, 0.12305565833843216, 0.10843733918706053, -0.04510132627757756, 0.20246068417633833, 0.0786974621495526, 0.0682686299980177, 0.1790920232742792, -0.013857568338464358, -0.1216377952920371, -0.38543121742182657, -0.18870887725221874, -0.1298351839129617, 0.11833913544634063, -0.12603271018451778, -0.18512888914464334, 0.4262900087541263, 0.12011754422124604, 0.19344111470701664, 0.07398216133496087, 0.18517182248883488, 0.19618924047895953, 0.16571710662499659, 0.009808461282916955, 0.19880170626320728, 0.18644161936888276, 0.08125547653119276, -0.20298985359994204, -0.11894948480767198, 0.18096401543037868] |
1,803.03565 | On the potential of Cherenkov Telescope Arrays and KM3 Neutrino
Telescopes for the detection of extended sources | We discuss the discovery potential of extended very-high-energy (VHE)
neutrino sources by the future KM3 Neutrino Telescope (KM3NeT) in the context
of the constraining power of the Cherenkov Telescope Array (CTA), designed for
deep surveys of the sky in VHE gamma rays. The study is based on a comparative
analysis of sensitivities of KM3NeT and CTA. We show that a minimum gamma-ray
energy flux of E^2{\phi}_{\gamma}(10 TeV) > 1x10^{-12} TeV cm^{-2} s^{-1} is
required to identify a possible neutrino counterpart with a 3{\sigma}
significance and 10 years of KM3NeT observations with upgoing muons, if the
source has an angular size of R_{src} = 0.1 deg and emits gamma rays with an
E^{-2} energy spectrum through a full hadronic mechanism. This minimum
gamma-ray flux is increased to the level of E^2{\phi}_{\gamma}(10 TeV) >
2x10^{-11} TeV cm^{-2} s^{-1} in case of sources with radial extension of
R_{src} = 2.0 deg. The analysis methods are applied to the supernova remnant RX
J1713.7-3946 and the Galactic Center Ridge, as well as to the recent HAWC
catalog of multi-TeV gamma-ray sources.
| astro-ph.HE | we discuss the discovery potential of extended veryhighenergy vhe neutrino sources by the future km3 neutrino telescope km3net in the context of the constraining power of the cherenkov telescope array cta designed for deep surveys of the sky in vhe gamma rays the study is based on a comparative analysis of sensitivities of km3net and cta we show that a minimum gammaray energy flux of e2phi_gamma10 tev 1x1012 tev cm2 s1 is required to identify a possible neutrino counterpart with a 3sigma significance and 10 years of km3net observations with upgoing muons if the source has an angular size of r_src 01 deg and emits gamma rays with an e2 energy spectrum through a full hadronic mechanism this minimum gammaray flux is increased to the level of e2phi_gamma10 tev 2x1011 tev cm2 s1 in case of sources with radial extension of r_src 20 deg the analysis methods are applied to the supernova remnant rx j171373946 and the galactic center ridge as well as to the recent hawc catalog of multitev gammaray sources | [['we', 'discuss', 'the', 'discovery', 'potential', 'of', 'extended', 'veryhighenergy', 'vhe', 'neutrino', 'sources', 'by', 'the', 'future', 'km3', 'neutrino', 'telescope', 'km3net', 'in', 'the', 'context', 'of', 'the', 'constraining', 'power', 'of', 'the', 'cherenkov', 'telescope', 'array', 'cta', 'designed', 'for', 'deep', 'surveys', 'of', 'the', 'sky', 'in', 'vhe', 'gamma', 'rays', 'the', 'study', 'is', 'based', 'on', 'a', 'comparative', 'analysis', 'of', 'sensitivities', 'of', 'km3net', 'and', 'cta', 'we', 'show', 'that', 'a', 'minimum', 'gammaray', 'energy', 'flux', 'of', 'e2phi_gamma10', 'tev', '1x1012', 'tev', 'cm2', 's1', 'is', 'required', 'to', 'identify', 'a', 'possible', 'neutrino', 'counterpart', 'with', 'a', '3sigma', 'significance', 'and', '10', 'years', 'of', 'km3net', 'observations', 'with', 'upgoing', 'muons', 'if', 'the', 'source', 'has', 'an', 'angular', 'size', 'of', 'r_src', '01', 'deg', 'and', 'emits', 'gamma', 'rays', 'with', 'an', 'e2', 'energy', 'spectrum', 'through', 'a', 'full', 'hadronic', 'mechanism', 'this', 'minimum', 'gammaray', 'flux', 'is', 'increased', 'to', 'the', 'level', 'of', 'e2phi_gamma10', 'tev', '2x1011', 'tev', 'cm2', 's1', 'in', 'case', 'of', 'sources', 'with', 'radial', 'extension', 'of', 'r_src', '20', 'deg', 'the', 'analysis', 'methods', 'are', 'applied', 'to', 'the', 'supernova', 'remnant', 'rx', 'j171373946', 'and', 'the', 'galactic', 'center', 'ridge', 'as', 'well', 'as', 'to', 'the', 'recent', 'hawc', 'catalog', 'of', 'multitev', 'gammaray', 'sources']] | [-0.07477065682039774, 0.16489578488194856, 0.019990783395423067, 0.16368611833361987, -0.12048874925988327, -0.0529159678013197, 0.020622171018095242, 0.4302070125510606, -0.16989282047420384, -0.3725270604675946, 0.060410884847875594, -0.35850303224842284, 0.037941419539579545, 0.2551133578665377, 0.03855846971522884, -0.02137550453859322, 0.12889122738990755, -0.05274767534657648, -0.02177993294961717, -0.20775072289896862, 0.19611560967834002, 0.2638090679384255, 0.19243283427896954, 0.08398024002755326, 0.14427669236015173, -0.09116331980164562, -0.05275035766230542, -0.10502037953119725, -0.09980387411810841, 0.080409325096601, 0.2649090835514341, 0.1597259721616172, 0.11961823345960251, -0.3138585421589336, -0.21919414336610185, 0.17635251613267297, 0.12159845514854949, -0.07518101559807769, -0.017116115808935968, -0.36384111971017863, 0.08296283631179471, -0.25004651654966265, -0.2338851098265011, 0.13208972731358481, -0.009707720818585671, 0.04996396118492287, -0.17505286711855747, 0.0642540592068274, -0.06104645948965169, 0.05208709311652152, -0.10443217367477094, -0.15432171615871734, 0.012528510137815915, -0.0028071096610455286, 0.10663251501890565, 0.07965496360061695, 0.12974396444787134, -0.1559964201948051, -0.13338629544748637, 0.3858466311496505, -0.048054390746290754, -0.01850850714392783, 0.13545054359877082, -0.21914971600996241, -0.21064870590288637, 0.2300428236457741, 0.21104590011912347, 0.05781328542728997, -0.1979739167672094, 0.1172282674247288, -0.01839963226423909, 0.22497008934511714, 0.02553332087284486, 0.03807262840343485, 0.2934158316236876, 0.23010821072828203, 0.16746168843106024, 0.08390544038376815, -0.3496844370203603, 0.07849319038013207, -0.3644751893949606, -0.07671452443035032, -0.13811798625448274, 0.15154426824232187, -0.0811639544578308, -0.06798056522391216, 0.4193366253859408, 0.10319559241733736, 0.16253194614546373, -0.015276719987880261, 0.29362381354162825, 0.042622506739072766, 0.05066515821575498, 0.09935161181160115, 0.3557033058466567, 0.13053729190834842, 0.12721413703513376, -0.15441389015177265, -0.032305400133260435, 0.003899764865525954] |
1,803.03566 | Thermodynamics Properties of Confined Particles on Noncommutative Plane | We consider a system of $N$ particles living on the noncommutative plane in
the presence of a confining potential and study its thermodynamics properties.
Indeed, after calculating the partition function, we determine the
corresponding internal energy and heat capacity where different corrections are
obtained. In analogy with the magnetic field case, we define an effective
magnetization and study its susceptibility in terms of the noncommutative
parameter $\theta$. By introducing the chemical potential, we investigate the
Bose-Einstein condensation for the present system. Different limiting cases
related to the temperature and $\theta$ will be analyzed as well as some
numerical illustration will be presented.
| cond-mat.stat-mech hep-th quant-ph | we consider a system of n particles living on the noncommutative plane in the presence of a confining potential and study its thermodynamics properties indeed after calculating the partition function we determine the corresponding internal energy and heat capacity where different corrections are obtained in analogy with the magnetic field case we define an effective magnetization and study its susceptibility in terms of the noncommutative parameter theta by introducing the chemical potential we investigate the boseeinstein condensation for the present system different limiting cases related to the temperature and theta will be analyzed as well as some numerical illustration will be presented | [['we', 'consider', 'a', 'system', 'of', 'n', 'particles', 'living', 'on', 'the', 'noncommutative', 'plane', 'in', 'the', 'presence', 'of', 'a', 'confining', 'potential', 'and', 'study', 'its', 'thermodynamics', 'properties', 'indeed', 'after', 'calculating', 'the', 'partition', 'function', 'we', 'determine', 'the', 'corresponding', 'internal', 'energy', 'and', 'heat', 'capacity', 'where', 'different', 'corrections', 'are', 'obtained', 'in', 'analogy', 'with', 'the', 'magnetic', 'field', 'case', 'we', 'define', 'an', 'effective', 'magnetization', 'and', 'study', 'its', 'susceptibility', 'in', 'terms', 'of', 'the', 'noncommutative', 'parameter', 'theta', 'by', 'introducing', 'the', 'chemical', 'potential', 'we', 'investigate', 'the', 'boseeinstein', 'condensation', 'for', 'the', 'present', 'system', 'different', 'limiting', 'cases', 'related', 'to', 'the', 'temperature', 'and', 'theta', 'will', 'be', 'analyzed', 'as', 'well', 'as', 'some', 'numerical', 'illustration', 'will', 'be', 'presented']] | [-0.145686187702642, 0.15052306911621047, -0.04270492090076646, 0.07062994470527652, -0.01264025549879115, -0.0908824377054093, 0.03921736327146052, 0.3281854038656342, -0.2563395984333885, -0.2933235893245129, 0.10603032200528748, -0.27380972442345, -0.15556181010826692, 0.17410783453698397, -0.002503780680069444, 0.01693353783590354, -0.03150291333212426, 0.0800508707350887, -0.08973934183664181, -0.21273309552320735, 0.3530043671957637, 0.06101462757214904, 0.21834221360383227, 0.10140241871533148, 0.05725865161009863, 0.03008630275657839, 0.0034118914821495614, 0.05750962451236096, -0.19727908840457745, 0.04061326546156231, 0.1858221420780847, 0.040744947694132436, 0.1882484019551353, -0.40737934114740176, -0.21989171398694024, 0.13263249279492917, 0.13536361134245845, 0.08503746282647126, -0.05258578340198808, -0.2480417934826155, 0.014501519503491912, -0.16126635885231344, -0.20500720221567534, -0.12647897467546748, 0.00521482232223064, 0.061147186343612915, -0.2435925953813792, 0.06298619911260675, 0.022645636289334838, 0.06728196043667256, -0.09483075677645485, -0.11284309064549412, -0.020796236568404472, 0.12315909734781028, 0.05358953944147181, 0.036274510043143644, 0.15246629148867785, -0.15481504826696918, -0.06788887413145572, 0.3776147441628079, -0.06539493906494304, -0.21821653844752148, 0.14839316256727805, -0.17258161006440573, -0.08511875615016941, 0.04333692609661204, 0.16830535119744108, 0.13558809297141053, -0.15691559424842982, 0.11595794363358222, -0.00956903470625334, 0.10913561740273829, 0.06608005638197795, 0.04088422627526098, 0.22878657723320464, 0.14297035966050245, -0.007233081569246875, 0.2481363962345081, -0.07488711394013509, -0.1292803637824916, -0.3370504086864564, -0.19464959837404974, -0.17310657527174472, 0.07295183149878592, -0.11464214244202309, -0.14638698670337452, 0.3936403146031879, 0.15584924221769267, 0.1996604296031828, 0.00558979752217876, 0.25339686049504534, 0.17768738794428132, 0.01425822980829752, 0.032433305211894796, 0.22712864189587909, 0.1564240933523751, 0.1220317828998554, -0.27446871572265436, -0.009614902480012354, 0.05799554775048997] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.