id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0506 | Kondo behavior and metamagnetic phase transition in a heavy fermion
compound CeBi2 | Heavy fermions represent an archetypal example of strongly correlated
electron systems which, due to entanglement among different interactions, often
exhibit exotic and fascinating physics involving Kondo screening, magnetism and
unconventional superconductivity. Here we report a comprehensive study on the
transport and thermodynamic properties of a cerium-based heavy fermion compound
CeBi$_2$ which undergoes an anti-ferromagnetic transition at $T_N$ $\sim$ 3.3
K. Its high temperature paramagnetic state is characterized by an enhanced heat
capacity with Sommerfeld coefficient $\gamma$ over 200 mJ/molK$^2$. The
magnetization in the magnetically ordered state features a metamagnetic
transition. Remarkably, a large negative magnetoresistance associated with the
magnetism was observed in a wide temperature and field-angle range.
Collectively, CeBi$_2$ may serve as an intriguing system to study the interplay
between $f$ electrons and the itinerant Fermi sea.
| cond-mat.str-el cond-mat.mtrl-sci | heavy fermions represent an archetypal example of strongly correlated electron systems which due to entanglement among different interactions often exhibit exotic and fascinating physics involving kondo screening magnetism and unconventional superconductivity here we report a comprehensive study on the transport and thermodynamic properties of a ceriumbased heavy fermion compound cebi_2 which undergoes an antiferromagnetic transition at t_n sim 33 k its high temperature paramagnetic state is characterized by an enhanced heat capacity with sommerfeld coefficient gamma over 200 mjmolk2 the magnetization in the magnetically ordered state features a metamagnetic transition remarkably a large negative magnetoresistance associated with the magnetism was observed in a wide temperature and fieldangle range collectively cebi_2 may serve as an intriguing system to study the interplay between f electrons and the itinerant fermi sea | [['heavy', 'fermions', 'represent', 'an', 'archetypal', 'example', 'of', 'strongly', 'correlated', 'electron', 'systems', 'which', 'due', 'to', 'entanglement', 'among', 'different', 'interactions', 'often', 'exhibit', 'exotic', 'and', 'fascinating', 'physics', 'involving', 'kondo', 'screening', 'magnetism', 'and', 'unconventional', 'superconductivity', 'here', 'we', 'report', 'a', 'comprehensive', 'study', 'on', 'the', 'transport', 'and', 'thermodynamic', 'properties', 'of', 'a', 'ceriumbased', 'heavy', 'fermion', 'compound', 'cebi_2', 'which', 'undergoes', 'an', 'antiferromagnetic', 'transition', 'at', 't_n', 'sim', '33', 'k', 'its', 'high', 'temperature', 'paramagnetic', 'state', 'is', 'characterized', 'by', 'an', 'enhanced', 'heat', 'capacity', 'with', 'sommerfeld', 'coefficient', 'gamma', 'over', '200', 'mjmolk2', 'the', 'magnetization', 'in', 'the', 'magnetically', 'ordered', 'state', 'features', 'a', 'metamagnetic', 'transition', 'remarkably', 'a', 'large', 'negative', 'magnetoresistance', 'associated', 'with', 'the', 'magnetism', 'was', 'observed', 'in', 'a', 'wide', 'temperature', 'and', 'fieldangle', 'range', 'collectively', 'cebi_2', 'may', 'serve', 'as', 'an', 'intriguing', 'system', 'to', 'study', 'the', 'interplay', 'between', 'f', 'electrons', 'and', 'the', 'itinerant', 'fermi', 'sea']] | [-0.18784526622455036, 0.2980655882519574, -0.02982469431414742, 0.05915121006546542, -0.04353622430639844, -0.17832055693817517, 0.10588522381814462, 0.32964633728399695, -0.2654237751775081, -0.31444759229345925, -0.017610513041579415, -0.39037845018763273, -0.10579257554352461, 0.1698581919014927, 0.0839448388229819, -0.022362054547845636, -0.06773351387320352, 0.01611082472224971, -0.12007294649199124, -0.18402204406447709, 0.2779648934624025, 0.04320944897416565, 0.28779755811214386, 0.13393709526234676, 0.047604939421511346, -0.022312249420388577, 0.16249350337163795, 0.02319674117172817, -0.12908560293287755, 0.001224308873393706, 0.28449843675341635, -0.12905205302457842, 0.1819465703050059, -0.35352003708156565, -0.21887641500622507, 0.02738221235100239, 0.115564952371642, 0.06649913154320702, -0.10728694871529966, -0.3042243779563005, -0.015502246891311, -0.16025287605866434, -0.12740952895985666, -0.15186541255134794, -0.020726612366233316, -0.04953846185364657, -0.25993956432544757, 0.1466230367650352, 0.05704899543077715, 0.14795100865589958, -0.07703094362809751, -0.13832781216525103, -0.04131234504859008, 0.02572285808208916, 0.06331640637354068, 0.0642858699808592, 0.1375930076649797, -0.13188904831333767, -0.12184781970323197, 0.35802278236027746, -0.0656547836852186, 0.003761419871201118, 0.24631193247697655, -0.200117591180883, -0.08764679376627245, 0.2060170952001557, 0.15268366917273, 0.0851110904366665, -0.17264483386229368, 0.06031499474100576, -0.0394152871273931, 0.17922973308327889, -0.026770926082491993, 0.10949092827707765, 0.3220609449393426, 0.21556394853599606, 0.012549185408427128, 0.16153215332232077, -0.09993619257852154, -0.07660683878653106, -0.2096373429004517, -0.1734614473442355, -0.20903673422123706, 0.11433882892153979, -0.06988399247728964, -0.21289804817957153, 0.3716755881609898, 0.14564598577618154, 0.2221294507118208, -0.1263875623773192, 0.16669837712302862, 0.08952936447236598, 0.029276843903408872, 0.06726964900920553, 0.19490457923033289, 0.20162771081936265, 0.15812649421434524, -0.3308190586422348, 0.08422146698031278, -0.01528848620826408] |
1,802.05061 | Non-arithmetic monodromy of higher hypergeometric functions | We show that all the currently known non-arithmetic lattices in ${\rm
PU}(2,1)$ are monodromy groups of higher hypergeometric functions.
| math.GT | we show that all the currently known nonarithmetic lattices in rm pu21 are monodromy groups of higher hypergeometric functions | [['we', 'show', 'that', 'all', 'the', 'currently', 'known', 'nonarithmetic', 'lattices', 'in', 'rm', 'pu21', 'are', 'monodromy', 'groups', 'of', 'higher', 'hypergeometric', 'functions']] | [-0.2372600360724487, 0.14663162204976143, -0.021391974467980236, 0.16186178686391367, -0.06842729231146605, -0.0740818151910054, -0.07682782293934572, 0.4425163108267282, -0.2602895517882548, -0.18200756472192312, 0.13448762275450127, -0.30881236650441823, -0.21091099196162663, 0.31768329912110377, -0.07820288925186585, 0.031376010836347154, -0.012748498322540209, 0.08496155001615223, -0.16935160980363817, -0.40381505340337753, 0.3401594405111514, -0.1320201280085664, 0.2025090736386023, 0.007655045556786813, 0.02978741456019251, -0.07534592897680245, 0.012393842573816838, -0.1416705610524667, -0.14710533674262574, 0.10903712528708734, 0.3207365350895806, 0.031290340580438315, 0.10770921487557261, -0.34066153317689896, -0.16301759503977864, 0.20052114580635375, 0.18354713845703946, 0.004774545564463264, -0.007846333895270763, -0.2500995233851044, 0.09470850974321365, -0.19701431123049637, -0.17050247056115614, -0.10483771660610249, 0.029299888612800522, 0.14297179005255825, -0.15737647769090377, 0.0577484030080469, 0.03274129571295098, 0.12541871052235365, -0.04371356991070666, -0.2288223112394151, -0.06944168930089004, 0.10343812518802128, -0.03762423707858512, -0.012839339232366336, 0.05544885147460982, -0.10274101730043951, -0.11883004460679858, 0.45023603301103177, -0.028790260665118694, -0.17530601412842148, 0.13537803686861144, -0.27350622513576556, -0.30385534188367036, 0.1326327431750925, 0.07510636217500034, 0.1555512437694951, -0.03346678144053409, 0.14464552690716168, -0.2094973811977788, 0.1298072847880815, 0.1357933170848379, -0.00955810091507278, 0.10259443019075613, -0.024746833148559456, 0.049306551337634265, 0.11545803986097637, 0.140991077366236, 0.00381681869590753, -0.3538257391437104, -0.14186980643946873, -0.0868962517178213, 0.0959808257849593, -0.10150257600961547, -0.15908003570266852, 0.303182115778327, 0.06009328406990359, 0.12110999942218002, 0.16465753204140224, 0.13737983570287102, 0.0650983743957783, 0.17454287703884275, 0.07005410665940297, 0.10570721289044932, 0.15166493152317248, -0.162553838307136, -0.1034697406974278, -0.13419101169136793, 0.19151638046299158] |
1,802.05062 | Contingent derivatives and regularization for noncoercive inverse
problems | We study the inverse problem of parameter identification in non-coercive
variational problems that commonly appear in applied models. We examine the
differentiability of the set-valued parameter-to-solution map by using the
first-order and the second-order contingent derivatives. We explore the inverse
problem by using the output least-squares and the modified output least-squares
objectives. By regularizing the non-coercive variational problem, we obtain a
single-valued regularized parameter-to-solution map and investigate its
smoothness and boundedness. We also consider optimization problems using the
output least-squares and the modified output least-squares objectives for the
regularized variational problem. We give a complete convergence analysis
showing that for the output least-squares and the modified output
least-squares, the regularized minimization problems approximate the original
optimization problems suitably. We also provide the first-order and the
second-order adjoint method for the computation of the first-order and the
second-order derivatives of the output least-squares objective. We provide
discrete formulas for the gradient and the Hessian calculation and present
numerical results.
| math.OC math.NA | we study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models we examine the differentiability of the setvalued parametertosolution map by using the firstorder and the secondorder contingent derivatives we explore the inverse problem by using the output leastsquares and the modified output leastsquares objectives by regularizing the noncoercive variational problem we obtain a singlevalued regularized parametertosolution map and investigate its smoothness and boundedness we also consider optimization problems using the output leastsquares and the modified output leastsquares objectives for the regularized variational problem we give a complete convergence analysis showing that for the output leastsquares and the modified output leastsquares the regularized minimization problems approximate the original optimization problems suitably we also provide the firstorder and the secondorder adjoint method for the computation of the firstorder and the secondorder derivatives of the output leastsquares objective we provide discrete formulas for the gradient and the hessian calculation and present numerical results | [['we', 'study', 'the', 'inverse', 'problem', 'of', 'parameter', 'identification', 'in', 'noncoercive', 'variational', 'problems', 'that', 'commonly', 'appear', 'in', 'applied', 'models', 'we', 'examine', 'the', 'differentiability', 'of', 'the', 'setvalued', 'parametertosolution', 'map', 'by', 'using', 'the', 'firstorder', 'and', 'the', 'secondorder', 'contingent', 'derivatives', 'we', 'explore', 'the', 'inverse', 'problem', 'by', 'using', 'the', 'output', 'leastsquares', 'and', 'the', 'modified', 'output', 'leastsquares', 'objectives', 'by', 'regularizing', 'the', 'noncoercive', 'variational', 'problem', 'we', 'obtain', 'a', 'singlevalued', 'regularized', 'parametertosolution', 'map', 'and', 'investigate', 'its', 'smoothness', 'and', 'boundedness', 'we', 'also', 'consider', 'optimization', 'problems', 'using', 'the', 'output', 'leastsquares', 'and', 'the', 'modified', 'output', 'leastsquares', 'objectives', 'for', 'the', 'regularized', 'variational', 'problem', 'we', 'give', 'a', 'complete', 'convergence', 'analysis', 'showing', 'that', 'for', 'the', 'output', 'leastsquares', 'and', 'the', 'modified', 'output', 'leastsquares', 'the', 'regularized', 'minimization', 'problems', 'approximate', 'the', 'original', 'optimization', 'problems', 'suitably', 'we', 'also', 'provide', 'the', 'firstorder', 'and', 'the', 'secondorder', 'adjoint', 'method', 'for', 'the', 'computation', 'of', 'the', 'firstorder', 'and', 'the', 'secondorder', 'derivatives', 'of', 'the', 'output', 'leastsquares', 'objective', 'we', 'provide', 'discrete', 'formulas', 'for', 'the', 'gradient', 'and', 'the', 'hessian', 'calculation', 'and', 'present', 'numerical', 'results']] | [-0.04460649893625015, -0.06290222607446905, -0.08491138199674367, 0.15132459483250882, -0.10860840520597523, -0.12144177589459415, 0.024395996446815567, 0.3658959394603779, -0.37731573695340487, -0.27375828124924645, 0.17114659905569227, -0.23187833608281386, -0.19022230007626775, 0.1478259978562452, -0.08203929421262406, 0.19434745568462317, 0.08500693805657233, -0.02554686929215677, -0.1746237778452614, -0.24639811612152837, 0.32152957886551753, -0.002622978814842203, 0.21598969393297793, 0.00867921909128752, 0.17616949932092707, 0.04668751929568339, -0.0007595711953560763, 0.035074987572535306, -0.14754887705101835, 0.15304245167600486, 0.2369365623935549, 0.1809079869049071, 0.36436475879406627, -0.39356000888856907, -0.19127367942039913, 0.13299875690519244, 0.07815119738195421, 0.05542712436423083, -0.01636925645915296, -0.26978203601239226, 0.054220988564016415, -0.08358136216720825, -0.07018257464176114, -0.12263284113753257, -0.13073214835817396, 0.06852649674600556, -0.355941764892468, 0.10846602454998153, 0.056783232578559766, 0.03949675155520628, -0.11831299924730806, -0.15712200157061407, 0.024128586039848954, 0.03667022921498629, 0.04721906865708223, -0.0022425278652860206, 0.045611275395354894, -0.10523778571204954, -0.10864169273342748, 0.3425877527864296, -0.11082351117253397, -0.27971274917945266, 0.09396680053087729, -0.04119647411877125, -0.12376556172524873, 0.09467989688479825, 0.19262027696122805, 0.20640358101293632, -0.13680676587774784, 0.0920808081437032, -0.033625209020285665, 0.1359439557123505, 0.046497591441096386, -0.05266248484516422, 0.08197388097738163, 0.09368522264044202, 0.1553454179540748, 0.23879571254453563, -0.07148870336620544, -0.12376433553518963, -0.3362655052207882, -0.12105892591997745, -0.16931367557660876, -0.04533246891275402, -0.12220856860848114, -0.1905406608800345, 0.40129922120537187, 0.16044392365125257, 0.15569307991079515, 0.14771266820357193, 0.32873971391280615, 0.2679197066227752, -0.017793871814906714, 0.07409100162890987, 0.2549885844876636, 0.1716632448605415, 0.1048139952582932, -0.2917271179509573, 0.04829113980529747, 0.18559504498998763] |
1,802.05063 | Multi-Nets. Classification of discrete and smooth surfaces with
characteristic properties on arbitrary parameter rectangles | We investigate the common underlying discrete structures for various smooth
and discrete nets. The main idea is to impose the characteristic properties of
the nets not only on elementary quadrilaterals but also on larger parameter
rectangles. For discrete planar quadrilateral nets, circular nets, $Q^*$-nets
and conical nets we obtain a characterization of the corresponding discrete
multi-nets. In the limit these discrete nets lead to some classical classes of
smooth surfaces. Furthermore, we propose to use the characterized discrete nets
as discrete extensions for the nets to obtain structure preserving subdivision
schemes.
| math.DG | we investigate the common underlying discrete structures for various smooth and discrete nets the main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter rectangles for discrete planar quadrilateral nets circular nets qnets and conical nets we obtain a characterization of the corresponding discrete multinets in the limit these discrete nets lead to some classical classes of smooth surfaces furthermore we propose to use the characterized discrete nets as discrete extensions for the nets to obtain structure preserving subdivision schemes | [['we', 'investigate', 'the', 'common', 'underlying', 'discrete', 'structures', 'for', 'various', 'smooth', 'and', 'discrete', 'nets', 'the', 'main', 'idea', 'is', 'to', 'impose', 'the', 'characteristic', 'properties', 'of', 'the', 'nets', 'not', 'only', 'on', 'elementary', 'quadrilaterals', 'but', 'also', 'on', 'larger', 'parameter', 'rectangles', 'for', 'discrete', 'planar', 'quadrilateral', 'nets', 'circular', 'nets', 'qnets', 'and', 'conical', 'nets', 'we', 'obtain', 'a', 'characterization', 'of', 'the', 'corresponding', 'discrete', 'multinets', 'in', 'the', 'limit', 'these', 'discrete', 'nets', 'lead', 'to', 'some', 'classical', 'classes', 'of', 'smooth', 'surfaces', 'furthermore', 'we', 'propose', 'to', 'use', 'the', 'characterized', 'discrete', 'nets', 'as', 'discrete', 'extensions', 'for', 'the', 'nets', 'to', 'obtain', 'structure', 'preserving', 'subdivision', 'schemes']] | [-0.08425220602657646, 0.03275038606564825, -0.058433783540709154, 0.1434234263543557, -0.10841919944828583, -0.1229585559055623, 0.036573772569600906, 0.4203969238532914, -0.34329309769802624, -0.22132806132237118, 0.14946598597905703, -0.21840100675407384, -0.14688828820427363, 0.17154187575603524, -0.15033416380174458, 0.09559810724523332, 0.0017856083137707578, 0.011325338953692051, -0.11078473068773746, -0.2195644281985652, 0.3248838865094715, -0.07677531020922793, 0.26962987803336647, 0.03132210078959664, 0.14173257129473818, 0.026132613404964408, -0.020687874437620244, 0.02197463254496041, -0.14459533197805285, 0.14236131213191483, 0.21462704494543788, 0.057779996816275846, 0.1954624449265086, -0.47224608715623617, -0.2182960455616315, 0.18865189964676068, 0.09298615092670338, 0.10240447481887208, 0.00666006732887278, -0.2662247764567534, 0.13053432097141113, -0.07799149016435776, -0.13454489336969952, -0.09739095465176635, -0.019407252226180085, 0.0732648777956557, -0.22537337252158776, -0.007001636739005335, 0.21492092050094572, 0.09816362571178211, -0.029869495735814173, -0.08336536904874568, -0.07110665437584329, 0.07833158983072887, -0.04115149762947112, -0.036362865360246764, 0.02319687258762618, -0.06989696597059568, -0.176135987136513, 0.36777828791075284, 0.010451723966333601, -0.2859681325861149, 0.21227838595708212, -0.09429058021762304, -0.15575829832297233, 0.11174007423429025, 0.2094653550742401, 0.1438894353600012, -0.08693348187500508, 0.11219197805427636, -0.07347788402500252, 0.10920506570902136, 0.10312192134766116, 0.04593606192825569, 0.17261037327763107, 0.12928428879628578, 0.08464083245231045, 0.17782470346428453, -0.0662033766702128, -0.14955065787718114, -0.3552473738375637, -0.13159067188907, -0.13136043914386797, 0.008453367642909547, -0.10935562972154003, -0.2724437717762258, 0.3888332783761952, 0.05820793032633244, 0.22667740955431429, 0.16739155609781545, 0.21963996907903088, 0.09923720652522106, 0.11744586274855667, 0.05980417248275545, 0.17552543501013942, 0.16846252645676335, 0.030457887751981615, -0.11175861615014987, -0.0005951770219124026, 0.18400271394703951] |
1,802.05064 | Analysis of Large Urn Models with Local Mean-Field Interactions | The stochastic models investigated in this paper describe the evolution of a
set of $F_N$ identical balls scattered into $N$ urns connected by an underlying
symmetrical graph with constant degree $h_N$. After some random amount of time
{\em all the balls} of any urn are redistributed locally, among the $h_N$ urns
of its neighborhood. The allocation of balls is done at random according to a
set of weights which depend on the state of the system. The main original
features of this context is that the cardinality $h_N$ of the range of
interaction is not necessarily linear with respect to $N$ as in a classical
mean-field context and, also, that the number of simultaneous jumps of the
process is not bounded due to the redistribution of all balls of an urn at the
same time. The approach relies on the analysis of the evolution of the local
empirical distributions associated to the state of urns located in the
neighborhood of a given urn. Under convenient conditions, by taking an
appropriate Wasserstein distance and by establishing several technical
estimates for local empirical distributions, we are able to prove mean-field
convergence results.
When the load per node goes to infinity, a convergence result for the
invariant distribution of the associated McKean-Vlasov process is obtained for
several allocation policies. For the class of power of $d$ choices policies, we
show that the associated invariant measure has an asymptotic finite support
property under this regime. This result differs somewhat from the classical
double exponential decay property usually encountered in the literature for
power of $d$ choices policies.
| math.PR | the stochastic models investigated in this paper describe the evolution of a set of f_n identical balls scattered into n urns connected by an underlying symmetrical graph with constant degree h_n after some random amount of time em all the balls of any urn are redistributed locally among the h_n urns of its neighborhood the allocation of balls is done at random according to a set of weights which depend on the state of the system the main original features of this context is that the cardinality h_n of the range of interaction is not necessarily linear with respect to n as in a classical meanfield context and also that the number of simultaneous jumps of the process is not bounded due to the redistribution of all balls of an urn at the same time the approach relies on the analysis of the evolution of the local empirical distributions associated to the state of urns located in the neighborhood of a given urn under convenient conditions by taking an appropriate wasserstein distance and by establishing several technical estimates for local empirical distributions we are able to prove meanfield convergence results when the load per node goes to infinity a convergence result for the invariant distribution of the associated mckeanvlasov process is obtained for several allocation policies for the class of power of d choices policies we show that the associated invariant measure has an asymptotic finite support property under this regime this result differs somewhat from the classical double exponential decay property usually encountered in the literature for power of d choices policies | [['the', 'stochastic', 'models', 'investigated', 'in', 'this', 'paper', 'describe', 'the', 'evolution', 'of', 'a', 'set', 'of', 'f_n', 'identical', 'balls', 'scattered', 'into', 'n', 'urns', 'connected', 'by', 'an', 'underlying', 'symmetrical', 'graph', 'with', 'constant', 'degree', 'h_n', 'after', 'some', 'random', 'amount', 'of', 'time', 'em', 'all', 'the', 'balls', 'of', 'any', 'urn', 'are', 'redistributed', 'locally', 'among', 'the', 'h_n', 'urns', 'of', 'its', 'neighborhood', 'the', 'allocation', 'of', 'balls', 'is', 'done', 'at', 'random', 'according', 'to', 'a', 'set', 'of', 'weights', 'which', 'depend', 'on', 'the', 'state', 'of', 'the', 'system', 'the', 'main', 'original', 'features', 'of', 'this', 'context', 'is', 'that', 'the', 'cardinality', 'h_n', 'of', 'the', 'range', 'of', 'interaction', 'is', 'not', 'necessarily', 'linear', 'with', 'respect', 'to', 'n', 'as', 'in', 'a', 'classical', 'meanfield', 'context', 'and', 'also', 'that', 'the', 'number', 'of', 'simultaneous', 'jumps', 'of', 'the', 'process', 'is', 'not', 'bounded', 'due', 'to', 'the', 'redistribution', 'of', 'all', 'balls', 'of', 'an', 'urn', 'at', 'the', 'same', 'time', 'the', 'approach', 'relies', 'on', 'the', 'analysis', 'of', 'the', 'evolution', 'of', 'the', 'local', 'empirical', 'distributions', 'associated', 'to', 'the', 'state', 'of', 'urns', 'located', 'in', 'the', 'neighborhood', 'of', 'a', 'given', 'urn', 'under', 'convenient', 'conditions', 'by', 'taking', 'an', 'appropriate', 'wasserstein', 'distance', 'and', 'by', 'establishing', 'several', 'technical', 'estimates', 'for', 'local', 'empirical', 'distributions', 'we', 'are', 'able', 'to', 'prove', 'meanfield', 'convergence', 'results', 'when', 'the', 'load', 'per', 'node', 'goes', 'to', 'infinity', 'a', 'convergence', 'result', 'for', 'the', 'invariant', 'distribution', 'of', 'the', 'associated', 'mckeanvlasov', 'process', 'is', 'obtained', 'for', 'several', 'allocation', 'policies', 'for', 'the', 'class', 'of', 'power', 'of', 'd', 'choices', 'policies', 'we', 'show', 'that', 'the', 'associated', 'invariant', 'measure', 'has', 'an', 'asymptotic', 'finite', 'support', 'property', 'under', 'this', 'regime', 'this', 'result', 'differs', 'somewhat', 'from', 'the', 'classical', 'double', 'exponential', 'decay', 'property', 'usually', 'encountered', 'in', 'the', 'literature', 'for', 'power', 'of', 'd', 'choices', 'policies']] | [-0.11855089427910377, 0.1195364964547383, -0.0962260137967227, 0.04682937186278464, -0.027948016059113942, -0.10914992442276654, 0.07161921430458829, 0.34794184958434776, -0.29157977835930343, -0.24882463525078602, 0.08794974694258671, -0.2708328606883071, -0.08646528979855458, 0.14569247364755517, -0.09562599682691772, 0.060248660715783775, 0.050145661972946495, 0.09158120501499638, -0.01980162436804759, -0.2820984604862517, 0.359030396838676, 0.039374544526036025, 0.26705417641550977, -0.007879151054835054, 0.10368998950188395, 0.016531546756858893, -0.02297494352614585, 0.013789463374592645, -0.14039549204569463, 0.09972949268848781, 0.19550890592099782, 0.12072118663073238, 0.3258887249091109, -0.3891775894400171, -0.18730161421199262, 0.16416073806350165, 0.14040853754170646, 0.04133177108968831, -0.0076716058987578795, -0.24993951081744475, 0.10805063321301182, -0.1322702166900245, -0.1590352483083115, -0.017319126654426947, 0.036205933266407864, 0.08963566013884522, -0.31244286521605286, 0.028027456316511774, 0.12078995573121484, 0.022825429285079694, -0.05548909787547211, -0.13052617758291174, -0.014308247614311967, 0.14154196673034364, 0.06571972915020102, 0.01369162777725593, 0.10323286585035263, -0.0953805255349513, -0.09908863312490426, 0.36815808138884465, -0.04760273376624932, -0.20805092222684066, 0.1568907447789615, -0.14420200768369515, -0.14001449016251508, 0.11840503708771058, 0.15232081295207087, 0.11928875012564058, -0.1449609723842562, 0.11816514835085634, -0.06998318215980842, 0.11660784236137745, 0.06524073594858863, 0.046495978242430853, 0.1291990784092491, 0.132527434247406, 0.12519171456549627, 0.1543040353895126, -0.02895260662324691, -0.14616881089617884, -0.3446458763152559, -0.11521473762087042, -0.2242630505553684, 0.06313951598967694, -0.15753313220721782, -0.1729704486825875, 0.38030413009612307, 0.10376762487516586, 0.22769664294359065, 0.1245034899453707, 0.2393764669939649, 0.12611404287121117, 0.015717061727171404, 0.09189029842642904, 0.16085699736727171, 0.13770980284081863, 0.06803805091968974, -0.21038435119515844, 0.10281890585837963, 0.0847833732828257] |
1,802.05065 | Stochastic first passage time accelerated with CUDA | The numerical integration of stochastic trajectories to estimate the time to
pass a threshold is an interesting physical quantity, for instance in Josephson
junctions and atomic force microscopy, where the full trajectory is not
accessible. We propose an algorithm suitable for efficient implementation on
graphical processing unit in CUDA environment. The proposed approach for well
balanced loads achieves almost perfect scaling with the number of available
threads and processors, and allows an acceleration of about 400x with a GPU
GTX980 respect to standard multicore CPU. This method allows with off the shell
GPU to challenge problems that are otherwise prohibitive, as thermal activation
in slowly tilted potentials. In particular, we demonstrate that it is possible
to simulate the switching currents distributions of Josephson junctions in the
timescale of actual experiments.
| physics.comp-ph | the numerical integration of stochastic trajectories to estimate the time to pass a threshold is an interesting physical quantity for instance in josephson junctions and atomic force microscopy where the full trajectory is not accessible we propose an algorithm suitable for efficient implementation on graphical processing unit in cuda environment the proposed approach for well balanced loads achieves almost perfect scaling with the number of available threads and processors and allows an acceleration of about 400x with a gpu gtx980 respect to standard multicore cpu this method allows with off the shell gpu to challenge problems that are otherwise prohibitive as thermal activation in slowly tilted potentials in particular we demonstrate that it is possible to simulate the switching currents distributions of josephson junctions in the timescale of actual experiments | [['the', 'numerical', 'integration', 'of', 'stochastic', 'trajectories', 'to', 'estimate', 'the', 'time', 'to', 'pass', 'a', 'threshold', 'is', 'an', 'interesting', 'physical', 'quantity', 'for', 'instance', 'in', 'josephson', 'junctions', 'and', 'atomic', 'force', 'microscopy', 'where', 'the', 'full', 'trajectory', 'is', 'not', 'accessible', 'we', 'propose', 'an', 'algorithm', 'suitable', 'for', 'efficient', 'implementation', 'on', 'graphical', 'processing', 'unit', 'in', 'cuda', 'environment', 'the', 'proposed', 'approach', 'for', 'well', 'balanced', 'loads', 'achieves', 'almost', 'perfect', 'scaling', 'with', 'the', 'number', 'of', 'available', 'threads', 'and', 'processors', 'and', 'allows', 'an', 'acceleration', 'of', 'about', '400x', 'with', 'a', 'gpu', 'gtx980', 'respect', 'to', 'standard', 'multicore', 'cpu', 'this', 'method', 'allows', 'with', 'off', 'the', 'shell', 'gpu', 'to', 'challenge', 'problems', 'that', 'are', 'otherwise', 'prohibitive', 'as', 'thermal', 'activation', 'in', 'slowly', 'tilted', 'potentials', 'in', 'particular', 'we', 'demonstrate', 'that', 'it', 'is', 'possible', 'to', 'simulate', 'the', 'switching', 'currents', 'distributions', 'of', 'josephson', 'junctions', 'in', 'the', 'timescale', 'of', 'actual', 'experiments']] | [-0.15982369028139287, 0.06993164557979281, -0.06750095634219738, 0.019507749827327923, -0.08315459316453108, -0.18194677813981588, 0.056758327224703795, 0.45412650652802905, -0.2678387791204911, -0.3283707899672803, 0.04794261624159005, -0.23262686639903293, -0.09768535310554748, 0.2628648158207607, -0.04617457352220439, 0.10223319077721009, 0.08791014647756058, 0.02215340809466747, -0.037353502395294176, -0.24217861612112476, 0.21836597212554457, 0.09970077369362115, 0.28726413019288044, 0.04291269020893826, 0.11010833191327178, -0.041617084303512596, 0.04250845550559461, -0.007583308881685997, -0.0934675633930825, 0.0981229073797854, 0.21709691023301836, 0.09252261085650669, 0.2577588542866019, -0.5127464988304732, -0.150625067934967, 0.0647812367345278, 0.15686399974981144, 0.0982174123923939, -0.02952521537663415, -0.21898063618259933, 0.07828197702765465, -0.15701383388099763, -0.1069346119578068, -0.10918786232717909, 0.03146920497350108, 0.030986316530750346, -0.2894081827539664, 0.060741428760453485, 0.011594427325941908, 0.024510410728936012, -0.021358201889177926, -0.05620920615485654, 0.04034592761264111, 0.07939497939704988, 0.0015372479603124353, 0.03298432811951408, 0.16958059551767432, -0.11696503335216012, -0.1438648669855096, 0.37226473655408393, -0.03648303826518643, -0.19999004512165602, 0.17810675468958484, -0.08655891701614914, -0.09647132680536463, 0.11254205083689438, 0.16465620555413457, 0.11141391603562695, -0.16417867675638542, 0.07153534534467886, 0.005277492431923747, 0.18465279293282388, 0.06482117654791532, -0.0018411252665548371, 0.16909463958671458, 0.23797410777949082, 0.08525076850514429, 0.1659881717274682, -0.1112250807032419, -0.14937949129783262, -0.2731835441663861, -0.179577813970928, -0.19346591254982812, 0.030202497759623487, -0.09681817278805493, -0.19339283898902626, 0.34559152465170395, 0.21478571929216672, 0.16471136871080558, 0.07123755944462923, 0.38098180232426293, 0.09374349132592145, 0.11643096148394622, 0.1242511799532132, 0.1557808409874829, 0.08859912110313486, 0.12665483234494995, -0.23637729341235872, 0.034381926650754534, -0.023760384056144036] |
1,802.05066 | An automorphic generalization of the Hermite-Minkowski theorem | We show that for any integer $N$, there are only finitely many cuspidal
algebraic automorphic representations of ${\rm GL}_n$ over $\mathbb{Q}$, with
$n$ varying, whose conductor is $N$ and whose weights are in the interval
$\{0,1,...,23\}$. More generally, we define a simple sequence $(r(w))_{w \geq
0}$ such that for any integer $w$, any number field $E$ whose root-discriminant
is less than $r(w)$, and any ideal $N$ in the ring of integers of $E$, there
are only finitely many cuspidal algebraic automorphic representations of
general linear groups over $E$ whose conductor is $N$ and whose weights are in
the interval $\{0,1,...,w\}$. Assuming a version of GRH, we also show that we
may replace $r(w)$ with $8 \pi e^{\gamma-H_w}$ in this statement, where
$\gamma$ is Euler's constant and $H_w$ the $w$-th harmonic number.
The proofs are based on some new positivity properties of certain real
quadratic forms which occur in the study of the Weil explicit formula for
Rankin-Selberg $L$-functions. Both the effectiveness and the optimality of the
methods are discussed.
| math.NT | we show that for any integer n there are only finitely many cuspidal algebraic automorphic representations of rm gl_n over mathbbq with n varying whose conductor is n and whose weights are in the interval 0123 more generally we define a simple sequence rw_w geq 0 such that for any integer w any number field e whose rootdiscriminant is less than rw and any ideal n in the ring of integers of e there are only finitely many cuspidal algebraic automorphic representations of general linear groups over e whose conductor is n and whose weights are in the interval 01w assuming a version of grh we also show that we may replace rw with 8 pi egammah_w in this statement where gamma is eulers constant and h_w the wth harmonic number the proofs are based on some new positivity properties of certain real quadratic forms which occur in the study of the weil explicit formula for rankinselberg lfunctions both the effectiveness and the optimality of the methods are discussed | [['we', 'show', 'that', 'for', 'any', 'integer', 'n', 'there', 'are', 'only', 'finitely', 'many', 'cuspidal', 'algebraic', 'automorphic', 'representations', 'of', 'rm', 'gl_n', 'over', 'mathbbq', 'with', 'n', 'varying', 'whose', 'conductor', 'is', 'n', 'and', 'whose', 'weights', 'are', 'in', 'the', 'interval', '0123', 'more', 'generally', 'we', 'define', 'a', 'simple', 'sequence', 'rw_w', 'geq', '0', 'such', 'that', 'for', 'any', 'integer', 'w', 'any', 'number', 'field', 'e', 'whose', 'rootdiscriminant', 'is', 'less', 'than', 'rw', 'and', 'any', 'ideal', 'n', 'in', 'the', 'ring', 'of', 'integers', 'of', 'e', 'there', 'are', 'only', 'finitely', 'many', 'cuspidal', 'algebraic', 'automorphic', 'representations', 'of', 'general', 'linear', 'groups', 'over', 'e', 'whose', 'conductor', 'is', 'n', 'and', 'whose', 'weights', 'are', 'in', 'the', 'interval', '01w', 'assuming', 'a', 'version', 'of', 'grh', 'we', 'also', 'show', 'that', 'we', 'may', 'replace', 'rw', 'with', '8', 'pi', 'egammah_w', 'in', 'this', 'statement', 'where', 'gamma', 'is', 'eulers', 'constant', 'and', 'h_w', 'the', 'wth', 'harmonic', 'number', 'the', 'proofs', 'are', 'based', 'on', 'some', 'new', 'positivity', 'properties', 'of', 'certain', 'real', 'quadratic', 'forms', 'which', 'occur', 'in', 'the', 'study', 'of', 'the', 'weil', 'explicit', 'formula', 'for', 'rankinselberg', 'lfunctions', 'both', 'the', 'effectiveness', 'and', 'the', 'optimality', 'of', 'the', 'methods', 'are', 'discussed']] | [-0.22298619010041215, 0.12334405536001379, -0.09680491682480682, 0.029831391544024827, -0.07960042905796207, -0.18750033966180954, -0.024699303528971293, 0.34708176864819096, -0.2878924857091272, -0.23339661784244306, 0.08613162342614183, -0.26332968789237465, -0.14351557270609633, 0.248176130404075, -0.06161549973837806, 0.024625418694322984, 0.012810351971931982, 0.15734218628794858, -0.06773742801566242, -0.3204930743259011, 0.3480468719351021, -0.08381699033533081, 0.14555615847648093, 0.01364315916417223, 0.06002998554648718, 0.017867288809043893, 0.011209970683028753, -0.06544900930514841, -0.11878496025698647, 0.11624616360235394, 0.3067060649987649, 0.060629380768108546, 0.24816796386501555, -0.38644909431988544, -0.1247525836087086, 0.2515483384613286, 0.13318318394436077, -0.010884073160052526, 0.010311885533949613, -0.22673930007061271, 0.18359526966232806, -0.1456639030630785, -0.10430823431886507, -0.05194462381980636, 0.11240231791355958, 0.05127304303883152, -0.30365597044371745, 0.0005286428638183597, 0.11775873639536175, 0.14867640836446575, -0.04936812682585283, -0.202977314022031, -0.017262791926887903, 0.037702656770125034, 0.012827669761397622, 0.0462377293021277, 0.06241807110720512, -0.0989352456872549, -0.09825328594412316, 0.34713091937204205, -0.050963380847172106, -0.24814190477358572, 0.11598416800526055, -0.19682506092570046, -0.16026319318563875, 0.14383391140762603, 0.07994184657705553, 0.14502977242862636, -0.008356011548841542, 0.1982434837581505, -0.1536868919627247, 0.11158024800630907, 0.13166031157880118, -0.007594679723225647, 0.13522574895936432, 0.02030708132819696, 0.05084782958993773, 0.09495305249354605, -0.0034186320957925284, -0.019647669109205405, -0.38675169829617845, -0.18746690014659456, -0.1825477617778674, 0.12682692143487548, -0.1325443037837624, -0.16832568667067047, 0.3587911536296209, 0.07921161102483783, 0.20328023381757013, 0.16002501192516788, 0.21109143511222844, 0.13720746397069006, 0.031146757935427805, 0.11527852742283633, 0.0856918647315593, 0.16228995385269324, -0.042732312290393044, -0.1409171227676173, 0.02639218427692399, 0.1102858248999286] |
1,802.05067 | Performance-driven 3D printing of continuous curved fibre reinforced
polymer composites a preliminary numerical study | This paper presents a new concept to place continuous curved fibres for CFRP
composites, which can be fulfilled by potential additive or hybrid
manufacturing technology. Based on the loading condition, principal stress
trajectories are generated through finite element analysis (FEA) and used as
the guidance of the placement paths for carbon fibres. Three numerical cases,
an open-hole single ply lamina under uniaxial tension and an open-hole
cross-ply laminate under biaxial tension and normal pressure, are studied and
compared with traditional reinforced composites with unidirectional fibres. The
modelling results show that the stress concentration in both fibre and matrix
are reduced significantly by the curved fibre placement and the stiffness of
CFRP composites have been improved. This concept of performance-driven
optimization method could lead to a useful tool for the design of future 3D
printing process for fibre reinforced composites.
| physics.app-ph cond-mat.mtrl-sci | this paper presents a new concept to place continuous curved fibres for cfrp composites which can be fulfilled by potential additive or hybrid manufacturing technology based on the loading condition principal stress trajectories are generated through finite element analysis fea and used as the guidance of the placement paths for carbon fibres three numerical cases an openhole single ply lamina under uniaxial tension and an openhole crossply laminate under biaxial tension and normal pressure are studied and compared with traditional reinforced composites with unidirectional fibres the modelling results show that the stress concentration in both fibre and matrix are reduced significantly by the curved fibre placement and the stiffness of cfrp composites have been improved this concept of performancedriven optimization method could lead to a useful tool for the design of future 3d printing process for fibre reinforced composites | [['this', 'paper', 'presents', 'a', 'new', 'concept', 'to', 'place', 'continuous', 'curved', 'fibres', 'for', 'cfrp', 'composites', 'which', 'can', 'be', 'fulfilled', 'by', 'potential', 'additive', 'or', 'hybrid', 'manufacturing', 'technology', 'based', 'on', 'the', 'loading', 'condition', 'principal', 'stress', 'trajectories', 'are', 'generated', 'through', 'finite', 'element', 'analysis', 'fea', 'and', 'used', 'as', 'the', 'guidance', 'of', 'the', 'placement', 'paths', 'for', 'carbon', 'fibres', 'three', 'numerical', 'cases', 'an', 'openhole', 'single', 'ply', 'lamina', 'under', 'uniaxial', 'tension', 'and', 'an', 'openhole', 'crossply', 'laminate', 'under', 'biaxial', 'tension', 'and', 'normal', 'pressure', 'are', 'studied', 'and', 'compared', 'with', 'traditional', 'reinforced', 'composites', 'with', 'unidirectional', 'fibres', 'the', 'modelling', 'results', 'show', 'that', 'the', 'stress', 'concentration', 'in', 'both', 'fibre', 'and', 'matrix', 'are', 'reduced', 'significantly', 'by', 'the', 'curved', 'fibre', 'placement', 'and', 'the', 'stiffness', 'of', 'cfrp', 'composites', 'have', 'been', 'improved', 'this', 'concept', 'of', 'performancedriven', 'optimization', 'method', 'could', 'lead', 'to', 'a', 'useful', 'tool', 'for', 'the', 'design', 'of', 'future', '3d', 'printing', 'process', 'for', 'fibre', 'reinforced', 'composites']] | [-0.10105250076987117, 0.13238933681122617, -0.06760753753172943, -0.09108752472903368, -0.05416827956080544, -0.16968364830684962, -0.019156510160277807, 0.4738595125486525, -0.26171263682877094, -0.24227593307175654, 0.13984654241713876, -0.2163648196804277, -0.1687289424116636, 0.21694864040381348, -0.09175836375291399, 0.09637683462150556, 0.0760565345944408, -0.05958658999515523, -0.031686502852202425, -0.20842106527441162, 0.2527794685113104, 0.04449267641862305, 0.40715699197335853, 0.043819622336819825, 0.0800669515746639, 0.037472489488012954, -0.0005812913735511062, 0.08322959946621686, -0.15080775533097823, 0.137959234217155, 0.2302165738032233, -0.001924000102557617, 0.21975825533686247, -0.4619917646050453, -0.24333917390112933, 0.07584050608457153, 0.09724036839006724, 0.05504403367769241, -0.06899310956313777, -0.24840050447973416, 0.10742307595176649, -0.15280126743420636, -0.13883397311119616, -0.06935734870984293, -0.05284715910850883, 0.05015718361376215, -0.27280590738833166, 0.012116899003656648, 0.03441660373979215, 0.06354543085297128, -0.06104860280258514, -0.15038756067402287, -0.05297239319414651, 0.07687800774089457, 0.03956607894502118, -0.030396703273064637, 0.2097999213283074, -0.11978415653725966, -0.058527516499295724, 0.3970732210780219, -0.05046421664653065, -0.22264279335613277, 0.13964520179894385, -0.011454786378354263, -0.09351741644493539, 0.16580915303311225, 0.18407701526051587, 0.08119664945565969, -0.16021439983181174, -0.0007813000647860358, 0.03769504172114401, 0.14612160989739967, 0.10016748028984897, -0.0477497375958847, 0.19486351916733996, 0.23309779443892, 0.03481602405362073, 0.14720335368338383, -0.04639497320100719, -0.005990067910630819, -0.26944356809015113, -0.2222642271508121, -0.11527342460848553, 0.030535647125492584, -0.1311898635251853, -0.19296788027017586, 0.3161024526297617, 0.07497167810060673, 0.11987198454414984, 0.031445694619139805, 0.26385776170616526, 0.036499330890364945, 0.0821855222578529, -0.040726450486309664, 0.2716886408948641, 0.1591375565169741, 0.10646244086050462, -0.16231735406791886, 0.07322957729518735, 0.04583290046777764] |
1,802.05068 | Hitomi X-ray Observation of the Pulsar Wind Nebula G21.5$-$0.9 | We present results from the Hitomi X-ray observation of a young
composite-type supernova remnant (SNR) G21.5$-$0.9, whose emission is dominated
by the pulsar wind nebula (PWN) contribution. The X-ray spectra in the 0.8-80
keV range obtained with the Soft X-ray Spectrometer (SXS), Soft X-ray Imager
(SXI) and Hard X-ray Imager (HXI) show a significant break in the continuum as
previously found with the NuSTAR observation. After taking into account all
known emissions from the SNR other than the PWN itself, we find that the Hitomi
spectra can be fitted with a broken power law with photon indices of
$\Gamma_1=1.74\pm0.02$ and $\Gamma_2=2.14\pm0.01$ below and above the break at
$7.1\pm0.3$ keV, which is significantly lower than the NuSTAR result ($\sim9.0$
keV). The spectral break cannot be reproduced by time-dependent particle
injection one-zone spectral energy distribution models, which strongly
indicates that a more complex emission model is needed, as suggested by recent
theoretical models. We also search for narrow emission or absorption lines with
the SXS, and perform a timing analysis of PSR J1833$-$1034 with the HXI and
SGD. No significant pulsation is found from the pulsar. However, unexpectedly,
narrow absorption line features are detected in the SXS data at 4.2345 keV and
9.296 keV with a significance of 3.65 $\sigma$. While the origin of these
features is not understood, their mere detection opens up a new field of
research and was only possible with the high resolution, sensitivity and
ability to measure extended sources provided by an X-ray microcalorimeter.
| astro-ph.HE | we present results from the hitomi xray observation of a young compositetype supernova remnant snr g21509 whose emission is dominated by the pulsar wind nebula pwn contribution the xray spectra in the 0880 kev range obtained with the soft xray spectrometer sxs soft xray imager sxi and hard xray imager hxi show a significant break in the continuum as previously found with the nustar observation after taking into account all known emissions from the snr other than the pwn itself we find that the hitomi spectra can be fitted with a broken power law with photon indices of gamma_1174pm002 and gamma_2214pm001 below and above the break at 71pm03 kev which is significantly lower than the nustar result sim90 kev the spectral break cannot be reproduced by timedependent particle injection onezone spectral energy distribution models which strongly indicates that a more complex emission model is needed as suggested by recent theoretical models we also search for narrow emission or absorption lines with the sxs and perform a timing analysis of psr j18331034 with the hxi and sgd no significant pulsation is found from the pulsar however unexpectedly narrow absorption line features are detected in the sxs data at 42345 kev and 9296 kev with a significance of 365 sigma while the origin of these features is not understood their mere detection opens up a new field of research and was only possible with the high resolution sensitivity and ability to measure extended sources provided by an xray microcalorimeter | [['we', 'present', 'results', 'from', 'the', 'hitomi', 'xray', 'observation', 'of', 'a', 'young', 'compositetype', 'supernova', 'remnant', 'snr', 'g21509', 'whose', 'emission', 'is', 'dominated', 'by', 'the', 'pulsar', 'wind', 'nebula', 'pwn', 'contribution', 'the', 'xray', 'spectra', 'in', 'the', '0880', 'kev', 'range', 'obtained', 'with', 'the', 'soft', 'xray', 'spectrometer', 'sxs', 'soft', 'xray', 'imager', 'sxi', 'and', 'hard', 'xray', 'imager', 'hxi', 'show', 'a', 'significant', 'break', 'in', 'the', 'continuum', 'as', 'previously', 'found', 'with', 'the', 'nustar', 'observation', 'after', 'taking', 'into', 'account', 'all', 'known', 'emissions', 'from', 'the', 'snr', 'other', 'than', 'the', 'pwn', 'itself', 'we', 'find', 'that', 'the', 'hitomi', 'spectra', 'can', 'be', 'fitted', 'with', 'a', 'broken', 'power', 'law', 'with', 'photon', 'indices', 'of', 'gamma_1174pm002', 'and', 'gamma_2214pm001', 'below', 'and', 'above', 'the', 'break', 'at', '71pm03', 'kev', 'which', 'is', 'significantly', 'lower', 'than', 'the', 'nustar', 'result', 'sim90', 'kev', 'the', 'spectral', 'break', 'can', 'not', 'be', 'reproduced', 'by', 'timedependent', 'particle', 'injection', 'onezone', 'spectral', 'energy', 'distribution', 'models', 'which', 'strongly', 'indicates', 'that', 'a', 'more', 'complex', 'emission', 'model', 'is', 'needed', 'as', 'suggested', 'by', 'recent', 'theoretical', 'models', 'we', 'also', 'search', 'for', 'narrow', 'emission', 'or', 'absorption', 'lines', 'with', 'the', 'sxs', 'and', 'perform', 'a', 'timing', 'analysis', 'of', 'psr', 'j18331034', 'with', 'the', 'hxi', 'and', 'sgd', 'no', 'significant', 'pulsation', 'is', 'found', 'from', 'the', 'pulsar', 'however', 'unexpectedly', 'narrow', 'absorption', 'line', 'features', 'are', 'detected', 'in', 'the', 'sxs', 'data', 'at', '42345', 'kev', 'and', '9296', 'kev', 'with', 'a', 'significance', 'of', '365', 'sigma', 'while', 'the', 'origin', 'of', 'these', 'features', 'is', 'not', 'understood', 'their', 'mere', 'detection', 'opens', 'up', 'a', 'new', 'field', 'of', 'research', 'and', 'was', 'only', 'possible', 'with', 'the', 'high', 'resolution', 'sensitivity', 'and', 'ability', 'to', 'measure', 'extended', 'sources', 'provided', 'by', 'an', 'xray', 'microcalorimeter']] | [-0.013403517341776174, 0.12274571325422375, -0.07055339426300604, 0.10843054188679026, -0.09821291554388244, -0.14072660632308356, 0.05211482549322892, 0.47248488777001535, -0.19910348322596555, -0.39192946435314074, 0.0831720161733741, -0.32212405065690314, -0.011529422243422066, 0.23516609234262012, 0.0076486219205578005, -0.013517801917335096, 0.08302479759936245, -0.07537110063655317, -0.028252160252882012, -0.14702496277483484, 0.23162241883802975, 0.1542971177451882, 0.17231658223654675, 0.04531618177482843, 0.07086439361537937, -0.05236980977395072, -0.0397271390856159, -0.006014201393705015, -0.06640485652429215, 0.06334518026637513, 0.2133450181925973, 0.11461426005078179, 0.15585299052898427, -0.3371931099253976, -0.2702309377491474, 0.06317427873174652, 0.17011592016663124, -0.06130052436227826, -0.01840444724971461, -0.2985199910188325, 0.06463279118203397, -0.2151561798951165, -0.16938189852382401, 0.015158988146711726, -0.023708948101136402, 0.023453020191730255, -0.1834059426169419, 0.09798119115762986, 0.0338730870824007, 0.04853360382609131, -0.13910565264850147, -0.08395340993292322, -0.008467885888805074, 0.026402145246051497, 0.06029990047441549, 0.04630668457185711, 0.12468380112227914, -0.12581731548049324, -0.11448845714292188, 0.38276687096385864, -0.05117770026340284, 0.025985588090617424, 0.17571564128791745, -0.22919578713168628, -0.1841204641617773, 0.27238931008306727, 0.06512434840633356, 0.07678046219752864, -0.13593481356818768, 0.042901860986843954, -0.014827742629053363, 0.29585467437513113, 0.035553370093472675, 0.05220279951516971, 0.28122961322569157, 0.11675033746777903, 0.013517095732371791, 0.1522349901357858, -0.26046021431078364, 0.027152946314337657, -0.2624258349480277, -0.04002243452628474, -0.15191930789098312, 0.1101877944115097, -0.08083966231788509, -0.11358637950928643, 0.374050943192464, 0.08627051345653801, 0.19965782267145413, 0.022031955972260004, 0.338481652390689, 0.1563657399448316, 0.06805397031598096, 0.11260387689656431, 0.33290901984480664, 0.1297826519921953, 0.12858406957796936, -0.20626692043344128, 0.04019430597083766, -0.039546192941171204] |
1,802.05069 | Scale invariance with fundamental matters and anomaly: A holographic
description | Generally, quantum field theories can be thought as deformations away from
conformal field theories. In this article, with a simple bottom up model
assumed to possess a holographic description, we study a putative large N
quantum field theory with large and arbitrary number of adjoint and fundamental
degrees of freedom and a non-vanishing chiral anomaly, in the presence of an
external magnetic field and with a non-vanishing density. Motivated by the
richness of quantum chromodynamics under similar condition, we explore the
solution space to find an infinite class of scale-invariant, but not conformal,
field theories that may play a pivotal role in defining the corresponding
physics. In particular, we find two classes of geometries: Schrodinger
isometric and warped AdS_3 geometries with an SL(2,R) X U(1) isometry. We find
hints of spontaneous breaking of translational symmetry, at low temperatures,
around the warped backgrounds.
| hep-th | generally quantum field theories can be thought as deformations away from conformal field theories in this article with a simple bottom up model assumed to possess a holographic description we study a putative large n quantum field theory with large and arbitrary number of adjoint and fundamental degrees of freedom and a nonvanishing chiral anomaly in the presence of an external magnetic field and with a nonvanishing density motivated by the richness of quantum chromodynamics under similar condition we explore the solution space to find an infinite class of scaleinvariant but not conformal field theories that may play a pivotal role in defining the corresponding physics in particular we find two classes of geometries schrodinger isometric and warped ads_3 geometries with an sl2r x u1 isometry we find hints of spontaneous breaking of translational symmetry at low temperatures around the warped backgrounds | [['generally', 'quantum', 'field', 'theories', 'can', 'be', 'thought', 'as', 'deformations', 'away', 'from', 'conformal', 'field', 'theories', 'in', 'this', 'article', 'with', 'a', 'simple', 'bottom', 'up', 'model', 'assumed', 'to', 'possess', 'a', 'holographic', 'description', 'we', 'study', 'a', 'putative', 'large', 'n', 'quantum', 'field', 'theory', 'with', 'large', 'and', 'arbitrary', 'number', 'of', 'adjoint', 'and', 'fundamental', 'degrees', 'of', 'freedom', 'and', 'a', 'nonvanishing', 'chiral', 'anomaly', 'in', 'the', 'presence', 'of', 'an', 'external', 'magnetic', 'field', 'and', 'with', 'a', 'nonvanishing', 'density', 'motivated', 'by', 'the', 'richness', 'of', 'quantum', 'chromodynamics', 'under', 'similar', 'condition', 'we', 'explore', 'the', 'solution', 'space', 'to', 'find', 'an', 'infinite', 'class', 'of', 'scaleinvariant', 'but', 'not', 'conformal', 'field', 'theories', 'that', 'may', 'play', 'a', 'pivotal', 'role', 'in', 'defining', 'the', 'corresponding', 'physics', 'in', 'particular', 'we', 'find', 'two', 'classes', 'of', 'geometries', 'schrodinger', 'isometric', 'and', 'warped', 'ads_3', 'geometries', 'with', 'an', 'sl2r', 'x', 'u1', 'isometry', 'we', 'find', 'hints', 'of', 'spontaneous', 'breaking', 'of', 'translational', 'symmetry', 'at', 'low', 'temperatures', 'around', 'the', 'warped', 'backgrounds']] | [-0.1724126139954126, 0.20900769498472638, -0.05678010733698127, 0.05125340003713729, -0.07959172770202251, -0.14854646421654125, -0.052516593433044274, 0.32959886273028144, -0.20470736248904026, -0.28718568863097943, 0.08266348952368478, -0.23370615047284624, -0.15660079328251453, 0.10750165283020002, -0.03870340973191278, 0.007016352941872368, -0.05009362135167745, 0.07997274459265893, -0.13625003057236876, -0.20277336096509138, 0.3328515156467353, 0.023497674815048476, 0.28116026407265116, 0.05933910152386271, 0.10990853987398072, -0.01646219214595015, 0.045238901260899196, 0.048921843285428056, -0.13900434294524708, 0.08838705264005653, 0.2344008011212179, 0.021630811957563733, 0.1804195907045628, -0.4427665715027128, -0.2289391280952054, 0.12447614744338403, 0.14235424859659143, 0.15833871563712895, -0.0782366871905946, -0.29274518621272183, 0.053590162821166534, -0.16621844246196496, -0.213163971277872, -0.10015440033420815, 0.002579107891250087, -0.10736946192484768, -0.24415762237483032, 0.07833156873583531, 0.0584135438859935, 0.10944615676220257, -0.06303498597363089, -0.03368824525919913, -0.04228780308121841, 0.07333170447144395, 0.12112897162204346, 0.07673276904384231, 0.12822057053030297, -0.21535597969679504, -0.12796900001793943, 0.3830172527437164, -0.0858006072820912, -0.2167001937476682, 0.17939957743018708, -0.17251772961036538, -0.17657494030787912, 0.11964886225956742, 0.15383646054468839, 0.14177263567460255, -0.10654531010675808, 0.18874604045556903, -0.0554432908760082, 0.13366911977014675, 0.06336806614515962, 0.0790434877304557, 0.30890591338958956, 0.06924601767661417, 0.05940537131063535, 0.14964037458658297, -0.014327686261975954, -0.12368842312069216, -0.4129942987953693, -0.1530728258986131, -0.11707721306273425, 0.15344525130601308, -0.1347282668144211, -0.17404836789414027, 0.3567940798050291, 0.10896351203075642, 0.1978266373486586, 0.014407703082378901, 0.16164708882898196, 0.08790018851458894, 0.10121958806346708, 0.07937289010011919, 0.22361301282883136, 0.18825699205339794, 0.022008254543655147, -0.2239832474020454, -0.10218038645402437, 0.09136901632062829] |
1,802.0507 | On Quasi-Infinitely Divisible Distributions with a Point Mass | An infinitely divisible distribution on $\mathbb{R}$ is a probability measure
$\mu$ such that the characteristic function $\hat{\mu}$ has a
L\'{e}vy-Khintchine representation with characteristic triplet $(a,\gamma,
\nu)$, where $\nu$ is a L\'{e}vy measure, $\gamma\in\mathbb{R}$ and $a\ge 0$. A
natural extension of such distributions are quasi-infinitely distributions.
Instead of a L\'{e}vy measure, we assume that $\nu$ is a "signed L\'{e}vy
measure", for further information on the definition see [\ref{Lindner}]. We
show that a distribution $\mu=p\delta_{x_0}+(1-p)\mu_{ac}$ with $p>0$ and $x_0
\in \mathbb{R}$, where $\mu_{ac}$ is the absolutely continuous part, is
quasi-infinitely divisible if and only if $\hat{\mu}(z)\neq0$ for every
$z\in\mathbb{R}$. We apply this to show that certain variance mixtures of mean
zero normal distributions are quasi-infinitely divisible distributions, and we
give an example of a quasi-infinitely divisible distribution that is not
continuous but has infinite quasi-L\'{e}vy measure. Furthermore, it is shown
that replacing the signed L\'{e}vy measure by a seemingly more general complex
L\'{e}vy measure does not lead to new distributions. Last but not least it is
proven that the class of quasi-infinitely divisible distributions is not open,
but path-connected in the space of probability measures with the Prokhorov
metric.
| math.PR | an infinitely divisible distribution on mathbbr is a probability measure mu such that the characteristic function hatmu has a levykhintchine representation with characteristic triplet agamma nu where nu is a levy measure gammainmathbbr and age 0 a natural extension of such distributions are quasiinfinitely distributions instead of a levy measure we assume that nu is a signed levy measure for further information on the definition see reflindner we show that a distribution mupdelta_x_01pmu_ac with p0 and x_0 in mathbbr where mu_ac is the absolutely continuous part is quasiinfinitely divisible if and only if hatmuzneq0 for every zinmathbbr we apply this to show that certain variance mixtures of mean zero normal distributions are quasiinfinitely divisible distributions and we give an example of a quasiinfinitely divisible distribution that is not continuous but has infinite quasilevy measure furthermore it is shown that replacing the signed levy measure by a seemingly more general complex levy measure does not lead to new distributions last but not least it is proven that the class of quasiinfinitely divisible distributions is not open but pathconnected in the space of probability measures with the prokhorov metric | [['an', 'infinitely', 'divisible', 'distribution', 'on', 'mathbbr', 'is', 'a', 'probability', 'measure', 'mu', 'such', 'that', 'the', 'characteristic', 'function', 'hatmu', 'has', 'a', 'levykhintchine', 'representation', 'with', 'characteristic', 'triplet', 'agamma', 'nu', 'where', 'nu', 'is', 'a', 'levy', 'measure', 'gammainmathbbr', 'and', 'age', '0', 'a', 'natural', 'extension', 'of', 'such', 'distributions', 'are', 'quasiinfinitely', 'distributions', 'instead', 'of', 'a', 'levy', 'measure', 'we', 'assume', 'that', 'nu', 'is', 'a', 'signed', 'levy', 'measure', 'for', 'further', 'information', 'on', 'the', 'definition', 'see', 'reflindner', 'we', 'show', 'that', 'a', 'distribution', 'mupdelta_x_01pmu_ac', 'with', 'p0', 'and', 'x_0', 'in', 'mathbbr', 'where', 'mu_ac', 'is', 'the', 'absolutely', 'continuous', 'part', 'is', 'quasiinfinitely', 'divisible', 'if', 'and', 'only', 'if', 'hatmuzneq0', 'for', 'every', 'zinmathbbr', 'we', 'apply', 'this', 'to', 'show', 'that', 'certain', 'variance', 'mixtures', 'of', 'mean', 'zero', 'normal', 'distributions', 'are', 'quasiinfinitely', 'divisible', 'distributions', 'and', 'we', 'give', 'an', 'example', 'of', 'a', 'quasiinfinitely', 'divisible', 'distribution', 'that', 'is', 'not', 'continuous', 'but', 'has', 'infinite', 'quasilevy', 'measure', 'furthermore', 'it', 'is', 'shown', 'that', 'replacing', 'the', 'signed', 'levy', 'measure', 'by', 'a', 'seemingly', 'more', 'general', 'complex', 'levy', 'measure', 'does', 'not', 'lead', 'to', 'new', 'distributions', 'last', 'but', 'not', 'least', 'it', 'is', 'proven', 'that', 'the', 'class', 'of', 'quasiinfinitely', 'divisible', 'distributions', 'is', 'not', 'open', 'but', 'pathconnected', 'in', 'the', 'space', 'of', 'probability', 'measures', 'with', 'the', 'prokhorov', 'metric']] | [-0.08479276236966657, 0.1918922441749917, -0.1761536499404389, 0.10786707514552804, -0.061829266264913196, -0.17005604819101078, -0.009843879734904951, 0.42304555233567953, -0.27676094329470524, -0.17190257231793468, 0.07475433744611623, -0.28655041496107436, -0.12582785457071505, 0.15380122785142664, -0.13481431558055035, 0.015574532970988555, -0.011471712546747016, 0.08873546320398379, -0.015339754776188942, -0.22681940781236018, 0.3493611427845241, -0.031005739495056965, 0.2441953512556527, 0.04230046443484278, 0.15412228984717766, -0.026114191202514517, -0.05508534827221529, -0.011236545093434752, -0.15929475830343226, 0.042263778341610145, 0.2139597811645059, 0.11174066060060717, 0.2933516534672969, -0.2635421493885034, -0.20332614484536665, 0.2783389388502616, 0.10903580507526742, -0.05221831013256198, -0.01774963744672119, -0.26273155756517436, 0.12297647033309382, -0.17971016161913134, -0.14972181304904592, -0.0833745653913154, 0.1498181265272686, 0.0583219009289599, -0.3368220085369261, 0.04065773954220197, 0.12510906530255655, 0.047197764471132796, -0.02776056853168563, -0.15156952776305843, -0.01724216652750645, 0.0699798830546965, 0.05077132348441924, 0.05216659314907662, 0.10372108167923769, -0.06289752818892062, -0.0925182252312484, 0.31119588051375974, -0.09534290535900611, -0.3127076470029905, 0.14804668396043227, -0.2663841264793123, -0.15547439283893807, 0.14419210468844065, 0.08127428096233179, 0.13027766883454245, -0.12328106984647963, 0.15497628458061904, -0.11894834717310479, 0.1577834744941514, 0.06290719939557754, -0.0011914137927385088, 0.12814581441457645, 0.09165672210687974, 0.18032668759722426, 0.09266454962815497, -0.05201720700943437, -0.07806906358683077, -0.3386578629927143, -0.1977938005596946, -0.2559868603180487, 0.15972969971714876, -0.06273595325720911, -0.2108674501427943, 0.3354926835112881, 0.08191733847311496, 0.20900492087568398, 0.14816167764871827, 0.19691600248789537, 0.16997604243173872, -0.0013078007582605453, 0.09687622870652653, 0.06242456482520894, 0.1343479819428783, -0.010268997264337604, -0.08215893067244906, 0.1243095290821815, 0.007116067838227457] |
1,802.05071 | Limit Theorems for the Alloy-type Random Energy Model | In this paper, we consider limit laws for the model, which is a
generalisation of the random energy model (REM) to the case when the energy
levels have the mixture distribution. More precisely, the distribution of the
energy levels is assumed to be a mixture of two normal distributions, one of
which is standard normal, while the second has the mean \(\sqrt{n}a\) with some
\(a\in \R,\) and the variance \(\sigma \ne 1\). The phase space \((a,\sigma)
\subset \R \times \R_+\) is divided onto several domains, where after
appropriate normalisation, the partition function converges in law to the
stable distribution. These domains are separated by the critical surfaces,
corresponding to transitions from the normal distribution to \(\alpha-\)stable
with \(\alpha \in (1,2)\), after to 1-stable, and finally to \(\alpha-\)stable
with \(\alpha \in (0,1).\) The corresponding phase diagram is the central
result of this paper.
| math.PR | in this paper we consider limit laws for the model which is a generalisation of the random energy model rem to the case when the energy levels have the mixture distribution more precisely the distribution of the energy levels is assumed to be a mixture of two normal distributions one of which is standard normal while the second has the mean sqrtna with some ain r and the variance sigma ne 1 the phase space asigma subset r times r_ is divided onto several domains where after appropriate normalisation the partition function converges in law to the stable distribution these domains are separated by the critical surfaces corresponding to transitions from the normal distribution to alphastable with alpha in 12 after to 1stable and finally to alphastable with alpha in 01 the corresponding phase diagram is the central result of this paper | [['in', 'this', 'paper', 'we', 'consider', 'limit', 'laws', 'for', 'the', 'model', 'which', 'is', 'a', 'generalisation', 'of', 'the', 'random', 'energy', 'model', 'rem', 'to', 'the', 'case', 'when', 'the', 'energy', 'levels', 'have', 'the', 'mixture', 'distribution', 'more', 'precisely', 'the', 'distribution', 'of', 'the', 'energy', 'levels', 'is', 'assumed', 'to', 'be', 'a', 'mixture', 'of', 'two', 'normal', 'distributions', 'one', 'of', 'which', 'is', 'standard', 'normal', 'while', 'the', 'second', 'has', 'the', 'mean', 'sqrtna', 'with', 'some', 'ain', 'r', 'and', 'the', 'variance', 'sigma', 'ne', '1', 'the', 'phase', 'space', 'asigma', 'subset', 'r', 'times', 'r_', 'is', 'divided', 'onto', 'several', 'domains', 'where', 'after', 'appropriate', 'normalisation', 'the', 'partition', 'function', 'converges', 'in', 'law', 'to', 'the', 'stable', 'distribution', 'these', 'domains', 'are', 'separated', 'by', 'the', 'critical', 'surfaces', 'corresponding', 'to', 'transitions', 'from', 'the', 'normal', 'distribution', 'to', 'alphastable', 'with', 'alpha', 'in', '12', 'after', 'to', '1stable', 'and', 'finally', 'to', 'alphastable', 'with', 'alpha', 'in', '01', 'the', 'corresponding', 'phase', 'diagram', 'is', 'the', 'central', 'result', 'of', 'this', 'paper']] | [-0.06704804907199524, 0.15278514375553487, -0.0922697770197922, 0.03698931239357099, 0.02062522953851743, -0.12347399561619717, 0.03527376745209917, 0.36579155530912655, -0.2849379253923787, -0.26594456097652724, 0.09968650714223477, -0.29749119508324573, -0.06534590086642098, 0.13188598093292708, -0.052573393685214805, 0.017117961907613995, -0.03666474906470072, 0.06601936845042815, -0.07543620575510018, -0.213504443158138, 0.35727108655669165, 0.0022295799951815437, 0.2573454914092753, -0.044335072144291346, 0.05900359755474414, -0.027731163739325836, 0.019549560402883283, -0.0015048740816827706, -0.15272471996962178, 0.08533415751175043, 0.20308823178436422, 0.06812094716051369, 0.2626961901724497, -0.33521737730302287, -0.1942242299477365, 0.18341027188993303, 0.12510727578196146, 0.01223978767640466, 0.017478909919262164, -0.24701101902760036, 0.11182864795518206, -0.156466751775526, -0.15625839209818143, 0.0016045883423417594, 0.07892404498155922, 0.06450101521307047, -0.31043512516998495, 0.11104961892867342, 0.10319450314252486, 0.005624509454500062, -0.05714368425864488, -0.1415483074490615, -0.031030199857071995, 0.11443434525235781, 0.05898488766979426, 0.05742283366911166, 0.093725851342513, -0.11524401863018077, -0.020157480572766447, 0.36850723778789346, -0.07133549890284432, -0.22644000762003533, 0.14722350516838703, -0.20435220683208197, -0.11828920872657435, 0.13708008142148562, 0.11495449676418658, 0.10539108764237587, -0.12742651016701176, 0.11584723273420984, -0.011314495770485267, 0.15928866226120408, 0.04543050759676712, -0.0351006778762907, 0.17450609446523038, 0.13678777528470976, 0.08675662726527146, 0.15113818163220633, -0.12117142778827894, -0.12795821363965038, -0.3307029444803583, -0.15384836879340894, -0.18255167179047427, 0.06731472423313357, -0.11103819670954039, -0.16437615083319182, 0.3842541640525327, 0.08516686384777493, 0.23812646002191654, 0.08803557244076637, 0.24533228210259414, 0.18471254316548294, -0.003561286982280988, 0.0654024087117179, 0.1603632456672969, 0.1243743307819154, 0.06064419564791024, -0.14043274961419383, 0.044810925253686754, 0.04710273604496574] |
1,802.05072 | Faster Algorithms for Min-max-min Robustness for Combinatorial Problems
with Budgeted Uncertainty | We consider robust combinatorial optimization problems where the decision
maker can react to a scenario by choosing from a finite set of $k$ solutions.
This approach is appropriate for decision problems under uncertainty where the
implementation of decisions requires preparing the ground. We focus on the case
that the set of possible scenarios is described through a budgeted uncertainty
set and provide three algorithms for the problem. The first algorithm solves
heuristically the dualized problem, a non-convex mixed-integer non-linear
program (MINLP), via an alternating optimization approach. The second algorithm
solves the MINLP exactly for $k=2$ through a dedicated spatial branch-and-bound
algorithm. The third approach enumerates $k$-tuples, relying on strong bounds
to avoid a complete enumeration. We test our methods on shortest path instances
that were used in the previous literature and on randomly generated knapsack
instances, and find that our methods considerably outperform previous
approaches. Many instances that were previously not solved within hours can now
be solved within few minutes, often even faster.
| math.OC | we consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of k solutions this approach is appropriate for decision problems under uncertainty where the implementation of decisions requires preparing the ground we focus on the case that the set of possible scenarios is described through a budgeted uncertainty set and provide three algorithms for the problem the first algorithm solves heuristically the dualized problem a nonconvex mixedinteger nonlinear program minlp via an alternating optimization approach the second algorithm solves the minlp exactly for k2 through a dedicated spatial branchandbound algorithm the third approach enumerates ktuples relying on strong bounds to avoid a complete enumeration we test our methods on shortest path instances that were used in the previous literature and on randomly generated knapsack instances and find that our methods considerably outperform previous approaches many instances that were previously not solved within hours can now be solved within few minutes often even faster | [['we', 'consider', 'robust', 'combinatorial', 'optimization', 'problems', 'where', 'the', 'decision', 'maker', 'can', 'react', 'to', 'a', 'scenario', 'by', 'choosing', 'from', 'a', 'finite', 'set', 'of', 'k', 'solutions', 'this', 'approach', 'is', 'appropriate', 'for', 'decision', 'problems', 'under', 'uncertainty', 'where', 'the', 'implementation', 'of', 'decisions', 'requires', 'preparing', 'the', 'ground', 'we', 'focus', 'on', 'the', 'case', 'that', 'the', 'set', 'of', 'possible', 'scenarios', 'is', 'described', 'through', 'a', 'budgeted', 'uncertainty', 'set', 'and', 'provide', 'three', 'algorithms', 'for', 'the', 'problem', 'the', 'first', 'algorithm', 'solves', 'heuristically', 'the', 'dualized', 'problem', 'a', 'nonconvex', 'mixedinteger', 'nonlinear', 'program', 'minlp', 'via', 'an', 'alternating', 'optimization', 'approach', 'the', 'second', 'algorithm', 'solves', 'the', 'minlp', 'exactly', 'for', 'k2', 'through', 'a', 'dedicated', 'spatial', 'branchandbound', 'algorithm', 'the', 'third', 'approach', 'enumerates', 'ktuples', 'relying', 'on', 'strong', 'bounds', 'to', 'avoid', 'a', 'complete', 'enumeration', 'we', 'test', 'our', 'methods', 'on', 'shortest', 'path', 'instances', 'that', 'were', 'used', 'in', 'the', 'previous', 'literature', 'and', 'on', 'randomly', 'generated', 'knapsack', 'instances', 'and', 'find', 'that', 'our', 'methods', 'considerably', 'outperform', 'previous', 'approaches', 'many', 'instances', 'that', 'were', 'previously', 'not', 'solved', 'within', 'hours', 'can', 'now', 'be', 'solved', 'within', 'few', 'minutes', 'often', 'even', 'faster']] | [-0.09193640494741863, 0.01724317482831993, -0.05954460447892637, 0.07755757896896884, -0.1389410627903644, -0.18073475182556162, 0.10866517076984321, 0.4046649327217715, -0.30317917035710884, -0.3509405007211083, 0.1464204483703858, -0.24317053054663829, -0.1390308995117865, 0.24156584514577578, -0.07077064637588791, 0.10635892078230759, 0.12308856061796045, 0.00784836660821428, -0.04283654410636057, -0.3387871376499988, 0.2588172449741694, -0.017147839128993814, 0.2232769433090963, 0.0001651092820017167, 0.10882495407145698, 0.03792170728783964, 0.008290446281756797, 0.06758392313438491, -0.0853630204597366, 0.10018867565881143, 0.2955783917511836, 0.21145871605812117, 0.3450958499878009, -0.43401122043227275, -0.18937835028031613, 0.12099367441508703, 0.1328611341589017, 0.11618148903759969, 0.01185102615698536, -0.26153691817591784, 0.08846687292538175, -0.11157084262089395, -0.043484545909095465, -0.06684475632316274, -0.044855256837497394, -0.03233409806569221, -0.3138976270906491, 0.01333058449629944, 0.024318818494155094, -0.019697200773829002, -0.06605876278609218, -0.16015808205205448, 0.08836869268661092, 0.05432300934022883, 0.028248021530311147, 0.03437792620388791, 0.08487972068293702, -0.072912304445309, -0.21420734242547484, 0.4094075381574107, 0.005445498178099714, -0.2235667535086821, 0.1280270668978962, -0.006343280422364975, -0.19004262861136983, 0.1667163511823363, 0.20202462116210926, 0.22752726611840288, -0.16565121180042852, 0.09099079528721454, -0.11130917691568867, 0.16844558328242473, 0.05507313032782205, -0.059369888105543285, 0.13730884610985658, 0.18445673769498924, 0.14565385274962442, 0.17829263295691528, -0.012360721055656762, -0.12701301639594376, -0.2573216578954399, -0.06248508587411446, -0.18947141337855833, -0.027875412364753684, -0.09434007885612096, -0.1282440562123467, 0.3681472320189109, 0.18924014785372448, 0.14904168589472225, 0.11566505881548836, 0.33039962818346374, 0.11125421558076264, 0.044796147682507406, 0.13077062748517365, 0.18594867465080603, 0.04231385941979746, 0.06258481949647297, -0.2089718360535122, 0.09937381338492808, 0.11442782847415202] |
1,802.05073 | An Ultra-deep Chandra Catalog of X-ray Point Sources in the Galactic
Center Star Cluster | We present an updated catalog of X-ray point sources in the inner
500$\arcsec$ ($\sim$20 parsec) of the Galactic Center (GC), where the {\it
nuclear star cluster} (NSC) stands, based on a total of $\sim$4.5 Ms of {\it
Chandra} observations taken from September 1999 to April 2013. This ultra-deep
dataset offers unprecedented sensitivity for detecting X-ray sources in the GC,
down to an intrinsic 2--10 keV luminosity of
$1.0\times10^{31}{\rm~erg~s^{-1}}$. A total of 3619 sources are detected in the
2--8 keV band, among which $\sim$3500 are probable GC sources and $\sim$1300
are new identifications. The GC sources collectively account for $\sim$20\% of
the total 2--8 keV flux from the inner 250$\arcsec$ region where detection
sensitivity is the greatest. Taking advantage of this unprecedented sample of
faint X-ray sources that primarily traces the old stellar populations in the
NSC, we revisit global source properties, including long-term variability,
cumulative spectra, luminosity function and spatial distribution. Based on the
equivalent width and relative strength of the iron lines, we suggest that in
addition to the arguably predominant population of magnetic cataclysmic
variables (CVs), non-magnetic CVs contribute substantially to the detected
sources, especially in the lower-luminosity group. On the other hand, the X-ray
sources have a radial distribution closely following the stellar mass
distribution in the NSC, but much flatter than that of the known X-ray
transients, which are presumably low-mass X-ray binaries (LMXBs) caught in
outburst. This, together with the very modest long-term variability of the
detected sources, strongly suggests that quiescent LMXBs are a minor
($\lesssim$ a few percent) population.
| astro-ph.HE | we present an updated catalog of xray point sources in the inner 500arcsec sim20 parsec of the galactic center gc where the it nuclear star cluster nsc stands based on a total of sim45 ms of it chandra observations taken from september 1999 to april 2013 this ultradeep dataset offers unprecedented sensitivity for detecting xray sources in the gc down to an intrinsic 210 kev luminosity of 10times1031rmergs1 a total of 3619 sources are detected in the 28 kev band among which sim3500 are probable gc sources and sim1300 are new identifications the gc sources collectively account for sim20 of the total 28 kev flux from the inner 250arcsec region where detection sensitivity is the greatest taking advantage of this unprecedented sample of faint xray sources that primarily traces the old stellar populations in the nsc we revisit global source properties including longterm variability cumulative spectra luminosity function and spatial distribution based on the equivalent width and relative strength of the iron lines we suggest that in addition to the arguably predominant population of magnetic cataclysmic variables cvs nonmagnetic cvs contribute substantially to the detected sources especially in the lowerluminosity group on the other hand the xray sources have a radial distribution closely following the stellar mass distribution in the nsc but much flatter than that of the known xray transients which are presumably lowmass xray binaries lmxbs caught in outburst this together with the very modest longterm variability of the detected sources strongly suggests that quiescent lmxbs are a minor lesssim a few percent population | [['we', 'present', 'an', 'updated', 'catalog', 'of', 'xray', 'point', 'sources', 'in', 'the', 'inner', '500arcsec', 'sim20', 'parsec', 'of', 'the', 'galactic', 'center', 'gc', 'where', 'the', 'it', 'nuclear', 'star', 'cluster', 'nsc', 'stands', 'based', 'on', 'a', 'total', 'of', 'sim45', 'ms', 'of', 'it', 'chandra', 'observations', 'taken', 'from', 'september', '1999', 'to', 'april', '2013', 'this', 'ultradeep', 'dataset', 'offers', 'unprecedented', 'sensitivity', 'for', 'detecting', 'xray', 'sources', 'in', 'the', 'gc', 'down', 'to', 'an', 'intrinsic', '210', 'kev', 'luminosity', 'of', '10times1031rmergs1', 'a', 'total', 'of', '3619', 'sources', 'are', 'detected', 'in', 'the', '28', 'kev', 'band', 'among', 'which', 'sim3500', 'are', 'probable', 'gc', 'sources', 'and', 'sim1300', 'are', 'new', 'identifications', 'the', 'gc', 'sources', 'collectively', 'account', 'for', 'sim20', 'of', 'the', 'total', '28', 'kev', 'flux', 'from', 'the', 'inner', '250arcsec', 'region', 'where', 'detection', 'sensitivity', 'is', 'the', 'greatest', 'taking', 'advantage', 'of', 'this', 'unprecedented', 'sample', 'of', 'faint', 'xray', 'sources', 'that', 'primarily', 'traces', 'the', 'old', 'stellar', 'populations', 'in', 'the', 'nsc', 'we', 'revisit', 'global', 'source', 'properties', 'including', 'longterm', 'variability', 'cumulative', 'spectra', 'luminosity', 'function', 'and', 'spatial', 'distribution', 'based', 'on', 'the', 'equivalent', 'width', 'and', 'relative', 'strength', 'of', 'the', 'iron', 'lines', 'we', 'suggest', 'that', 'in', 'addition', 'to', 'the', 'arguably', 'predominant', 'population', 'of', 'magnetic', 'cataclysmic', 'variables', 'cvs', 'nonmagnetic', 'cvs', 'contribute', 'substantially', 'to', 'the', 'detected', 'sources', 'especially', 'in', 'the', 'lowerluminosity', 'group', 'on', 'the', 'other', 'hand', 'the', 'xray', 'sources', 'have', 'a', 'radial', 'distribution', 'closely', 'following', 'the', 'stellar', 'mass', 'distribution', 'in', 'the', 'nsc', 'but', 'much', 'flatter', 'than', 'that', 'of', 'the', 'known', 'xray', 'transients', 'which', 'are', 'presumably', 'lowmass', 'xray', 'binaries', 'lmxbs', 'caught', 'in', 'outburst', 'this', 'together', 'with', 'the', 'very', 'modest', 'longterm', 'variability', 'of', 'the', 'detected', 'sources', 'strongly', 'suggests', 'that', 'quiescent', 'lmxbs', 'are', 'a', 'minor', 'lesssim', 'a', 'few', 'percent', 'population']] | [-0.046136651286605025, 0.11378839957031325, -0.05692371204093958, 0.14356464533992996, -0.10409967375002625, -0.03562027910400344, 0.10132844316135363, 0.4374896727443448, -0.15749519174042426, -0.39979226305609633, 0.06429766080426899, -0.3600417835984872, 0.015454975283509599, 0.22160686793867793, -0.04447252883425391, -0.043922978290218656, 0.07265862521417292, -0.06238171512540798, -0.048485281146517976, -0.2643738142992351, 0.26121432389493426, 0.0937405784481864, 0.1741702425120612, -0.04818794589854129, 0.07793918073088991, -0.05385344041872166, -0.07195922763665712, -0.05361535703476238, -0.06893459729458713, 0.06344983015824184, 0.24526894868723312, 0.12487914565588962, 0.21518131997436285, -0.33683412013700936, -0.20689692841695526, 0.06477249711945196, 0.18909878374846734, -0.02492851126118169, -0.052380441780489215, -0.2620414613374314, 0.05105832775179554, -0.18776218581525056, -0.16713699307893182, 0.11246850377633402, 0.07746141440356555, 0.058317781439356564, -0.15586759253438856, 0.15643796546517214, 0.031649273902500136, 0.07789030885360693, -0.1736070404258067, -0.1345243532829016, -0.042186080537029644, 0.05185045559592398, 0.04396935632100822, 0.09371533114536713, 0.17580508492728733, -0.1295057332332765, -0.049524358689063505, 0.3446999358688757, -0.024490543382378983, 0.05421765588383603, 0.18980974623134633, -0.21725238072630682, -0.23859852997368944, 0.16680820576714078, 0.16050180925052657, 0.12476396548015106, -0.19674765503056083, -0.015029004520760562, -0.017887888698960127, 0.2903711295916962, 0.014948913634279854, 0.11112103890765665, 0.31358094789316, 0.10346835538866403, 0.05057613012148988, 0.13918761823629122, -0.2930131770218097, -0.02495525597701431, -0.22655641959737177, -0.0487936344347423, -0.10186928971173617, 0.11508545604269407, -0.10473546205189037, -0.12051207782275489, 0.3740346612382989, 0.11324640749419926, 0.19319790784773885, 0.013812339220015634, 0.2741924502257361, 0.11248008907209389, 0.11295969110247292, 0.1338380148336144, 0.32541383936883433, 0.1632994034579723, 0.0782332049025657, -0.22731510749116188, 0.0776208726111284, -0.05852463825379421] |
1,802.05074 | L4: Practical loss-based stepsize adaptation for deep learning | We propose a stepsize adaptation scheme for stochastic gradient descent. It
operates directly with the loss function and rescales the gradient in order to
make fixed predicted progress on the loss. We demonstrate its capabilities by
conclusively improving the performance of Adam and Momentum optimizers. The
enhanced optimizers with default hyperparameters consistently outperform their
constant stepsize counterparts, even the best ones, without a measurable
increase in computational cost. The performance is validated on multiple
architectures including dense nets, CNNs, ResNets, and the recurrent
Differential Neural Computer on classical datasets MNIST, fashion MNIST,
CIFAR10 and others.
| cs.LG stat.ML | we propose a stepsize adaptation scheme for stochastic gradient descent it operates directly with the loss function and rescales the gradient in order to make fixed predicted progress on the loss we demonstrate its capabilities by conclusively improving the performance of adam and momentum optimizers the enhanced optimizers with default hyperparameters consistently outperform their constant stepsize counterparts even the best ones without a measurable increase in computational cost the performance is validated on multiple architectures including dense nets cnns resnets and the recurrent differential neural computer on classical datasets mnist fashion mnist cifar10 and others | [['we', 'propose', 'a', 'stepsize', 'adaptation', 'scheme', 'for', 'stochastic', 'gradient', 'descent', 'it', 'operates', 'directly', 'with', 'the', 'loss', 'function', 'and', 'rescales', 'the', 'gradient', 'in', 'order', 'to', 'make', 'fixed', 'predicted', 'progress', 'on', 'the', 'loss', 'we', 'demonstrate', 'its', 'capabilities', 'by', 'conclusively', 'improving', 'the', 'performance', 'of', 'adam', 'and', 'momentum', 'optimizers', 'the', 'enhanced', 'optimizers', 'with', 'default', 'hyperparameters', 'consistently', 'outperform', 'their', 'constant', 'stepsize', 'counterparts', 'even', 'the', 'best', 'ones', 'without', 'a', 'measurable', 'increase', 'in', 'computational', 'cost', 'the', 'performance', 'is', 'validated', 'on', 'multiple', 'architectures', 'including', 'dense', 'nets', 'cnns', 'resnets', 'and', 'the', 'recurrent', 'differential', 'neural', 'computer', 'on', 'classical', 'datasets', 'mnist', 'fashion', 'mnist', 'cifar10', 'and', 'others']] | [-0.06545738163159082, -0.01964262078859304, -0.04224864271604211, 0.08990148584922089, -0.10682691558950434, -0.19729998823941539, 0.08584655901711238, 0.5106934913875241, -0.28585298867209963, -0.32413086989208273, 0.10054577951147957, -0.2483034645501328, -0.18548621125519277, 0.21602866651098196, -0.1471901187967313, 0.1537272860927164, 0.16689771878484047, -0.0017408055792513648, -0.11536893794178277, -0.3927536916808764, 0.23984281067908006, 0.08504047602611153, 0.3299813918499766, -0.010564213689710748, 0.1672462134450478, -0.06204538546306522, 0.014574616350919792, -0.024092858327601694, -0.029041344466570175, 0.1238826123188789, 0.19421754702435512, 0.1555757248725154, 0.3491207064395942, -0.39641767425560637, -0.2184218227471176, 0.10890438143212937, 0.11579624707779945, 0.07458114196243083, -0.03292107378671828, -0.3055845784709642, 0.07175731288367196, -0.15551508198443212, 0.0033904103513218856, -0.20493584399993875, -0.06417518796791372, 0.06449917917948608, -0.3026593058639647, 0.05930204617447759, 0.0891691907676623, 0.06475051141245977, -0.018599579562923234, -0.1786509675119305, 0.0015822810169897582, 0.09792745181996572, 0.02322310129008991, 0.08890799701605973, 0.1972099478993761, -0.1913035066069202, -0.20211247982163177, 0.3004779056596913, -0.138177845176726, -0.2504474673126089, 0.20501876669494729, -0.012521256021174945, -0.09260166957484264, 0.07561627742711846, 0.21719264863549095, 0.1438606930847623, -0.09145047135258975, 0.06943582688752366, 0.021964110793104688, 0.16454867699036474, 0.05695011306946215, 0.0021457704274277936, 0.09387357408965105, 0.2540378012645401, 0.08160558768891191, 0.13378957730570906, -0.10049549284832258, -0.1420460567098895, -0.19295508781705345, -0.08619239416561629, -0.1892687461878124, -0.008269433799738947, -0.1592903157346882, -0.1155977402531885, 0.3568329678641213, 0.2019834782407423, 0.2320584386538126, 0.19107948766812977, 0.3651542026010391, 0.04841410385346726, 0.1638851674322627, 0.15300853799930528, 0.2393941957748642, 0.04156015987851118, 0.15715638576075436, -0.2572448118418259, 0.11121068026772456, 0.06287529845476934] |
1,802.05075 | Nonlinear elasticity of the extracellular matrix fibers facilitates
efficient inter-cellular mechanical communication | Biological cells embedded in fibrous matrices have been observed to form
inter-cellular bands of dense and aligned fibers, through which they
mechanically interact over long distances. Such matrix-mediated cellular
interactions have been shown to regulate a variety of biological processes. The
current study was aimed at exploring the effects of elastic nonlinearity of the
fibers contained in the extracellular matrix (ECM) on the transmission of
mechanical loads between contracting cells. Based on our biological
experiments, we developed a finite-element model of two contracting cells
embedded within a fibrous network. The individual fibers were modeled as
showing either linear elasticity, compression-microbuckling, tension-stiffening
or both of the latter. Compression-buckling resulted in smaller loads occurring
in the ECM, but these were more directed toward the neighboring cell. The
latter decreased with increasing cell-to-cell distance; when cells were >15
cell-diameters apart, no such inter-cellular interaction was observed.
Tension-stiffening further contributed to directing the loads toward the
neighboring cell, though to a smaller extent. The contraction of two
neighboring cells resulted in mutual attraction forces, which were considerably
increased by tension-stiffening, and decayed with increasing cell-to-cell
distances. Nonlinear elasticity contributed also to the onset of force polarity
on the cell boundary. The density and alignment of the fibers within the
inter-cellular band were considerably greater when fibers buckled under
compression, with tension-stiffening further contributing to this structural
remodeling. Our model demonstrates the contribution of nonlinear elasticity of
biological gels to directionality and efficiency of mechanical-signal transfer
between distant cells.
| physics.bio-ph | biological cells embedded in fibrous matrices have been observed to form intercellular bands of dense and aligned fibers through which they mechanically interact over long distances such matrixmediated cellular interactions have been shown to regulate a variety of biological processes the current study was aimed at exploring the effects of elastic nonlinearity of the fibers contained in the extracellular matrix ecm on the transmission of mechanical loads between contracting cells based on our biological experiments we developed a finiteelement model of two contracting cells embedded within a fibrous network the individual fibers were modeled as showing either linear elasticity compressionmicrobuckling tensionstiffening or both of the latter compressionbuckling resulted in smaller loads occurring in the ecm but these were more directed toward the neighboring cell the latter decreased with increasing celltocell distance when cells were 15 celldiameters apart no such intercellular interaction was observed tensionstiffening further contributed to directing the loads toward the neighboring cell though to a smaller extent the contraction of two neighboring cells resulted in mutual attraction forces which were considerably increased by tensionstiffening and decayed with increasing celltocell distances nonlinear elasticity contributed also to the onset of force polarity on the cell boundary the density and alignment of the fibers within the intercellular band were considerably greater when fibers buckled under compression with tensionstiffening further contributing to this structural remodeling our model demonstrates the contribution of nonlinear elasticity of biological gels to directionality and efficiency of mechanicalsignal transfer between distant cells | [['biological', 'cells', 'embedded', 'in', 'fibrous', 'matrices', 'have', 'been', 'observed', 'to', 'form', 'intercellular', 'bands', 'of', 'dense', 'and', 'aligned', 'fibers', 'through', 'which', 'they', 'mechanically', 'interact', 'over', 'long', 'distances', 'such', 'matrixmediated', 'cellular', 'interactions', 'have', 'been', 'shown', 'to', 'regulate', 'a', 'variety', 'of', 'biological', 'processes', 'the', 'current', 'study', 'was', 'aimed', 'at', 'exploring', 'the', 'effects', 'of', 'elastic', 'nonlinearity', 'of', 'the', 'fibers', 'contained', 'in', 'the', 'extracellular', 'matrix', 'ecm', 'on', 'the', 'transmission', 'of', 'mechanical', 'loads', 'between', 'contracting', 'cells', 'based', 'on', 'our', 'biological', 'experiments', 'we', 'developed', 'a', 'finiteelement', 'model', 'of', 'two', 'contracting', 'cells', 'embedded', 'within', 'a', 'fibrous', 'network', 'the', 'individual', 'fibers', 'were', 'modeled', 'as', 'showing', 'either', 'linear', 'elasticity', 'compressionmicrobuckling', 'tensionstiffening', 'or', 'both', 'of', 'the', 'latter', 'compressionbuckling', 'resulted', 'in', 'smaller', 'loads', 'occurring', 'in', 'the', 'ecm', 'but', 'these', 'were', 'more', 'directed', 'toward', 'the', 'neighboring', 'cell', 'the', 'latter', 'decreased', 'with', 'increasing', 'celltocell', 'distance', 'when', 'cells', 'were', '15', 'celldiameters', 'apart', 'no', 'such', 'intercellular', 'interaction', 'was', 'observed', 'tensionstiffening', 'further', 'contributed', 'to', 'directing', 'the', 'loads', 'toward', 'the', 'neighboring', 'cell', 'though', 'to', 'a', 'smaller', 'extent', 'the', 'contraction', 'of', 'two', 'neighboring', 'cells', 'resulted', 'in', 'mutual', 'attraction', 'forces', 'which', 'were', 'considerably', 'increased', 'by', 'tensionstiffening', 'and', 'decayed', 'with', 'increasing', 'celltocell', 'distances', 'nonlinear', 'elasticity', 'contributed', 'also', 'to', 'the', 'onset', 'of', 'force', 'polarity', 'on', 'the', 'cell', 'boundary', 'the', 'density', 'and', 'alignment', 'of', 'the', 'fibers', 'within', 'the', 'intercellular', 'band', 'were', 'considerably', 'greater', 'when', 'fibers', 'buckled', 'under', 'compression', 'with', 'tensionstiffening', 'further', 'contributing', 'to', 'this', 'structural', 'remodeling', 'our', 'model', 'demonstrates', 'the', 'contribution', 'of', 'nonlinear', 'elasticity', 'of', 'biological', 'gels', 'to', 'directionality', 'and', 'efficiency', 'of', 'mechanicalsignal', 'transfer', 'between', 'distant', 'cells']] | [-0.12210712113678768, 0.17378911757247453, 0.017112816482047828, -0.017697863199428565, -0.011266114564308562, -0.11550040266605165, 0.04922098592878417, 0.42427711285042835, -0.2979009168643395, -0.2549653562140421, 0.03584849423676277, -0.2790860604927349, -0.2147258102891881, 0.14353364214172518, -0.04383987181714763, -0.002652528391815878, 0.03175296055573861, -0.009542619006778406, 0.0278247740079754, -0.20989814823762237, 0.2167109777687203, 0.06832421642838234, 0.3158009004638877, 0.04957229760256265, 0.08327663869491805, -0.03593307284289527, -0.017195204777495008, 0.05775682755529678, -0.09883506025604623, 0.17345902143985376, 0.23034613067503418, 0.04240488145738123, 0.2746157397001701, -0.5285968987512788, -0.29296328782719644, 0.1052670095887456, 0.15570891721789806, 0.07758188138863999, 0.0012314570430207365, -0.24678635778817423, 0.08257713837054204, -0.13114590464339096, -0.10999762548803971, 0.006218119984722568, 0.02926712044783591, 0.0874340181466909, -0.2176612523232419, 0.08697284042002792, 0.04900098556972198, 0.0912623785350425, -0.08258076886077524, -0.11321712003935082, -0.08643205840993969, 0.16728252944050387, 0.05044440414598718, -0.012867202917035966, 0.21823615971738355, -0.11748516826040918, -0.04219748359952886, 0.3649497721066589, 0.01442761598330256, -0.17916184920324676, 0.22977622757104682, -0.13227698867132295, -0.06506883413297081, 0.19227684393844657, 0.2020018022277521, 0.026817492832854454, -0.15017238085581452, -0.007939437771543361, 0.04084079777656287, 0.17688355247673254, 0.1417944717998363, -0.010176044501555171, 0.1879585469399762, 0.20786652503394867, 0.018407928776853256, 0.12153037539468961, -0.088347753827464, -0.11551174741027931, -0.19897564013951816, -0.13115730962207517, -0.13464384537704568, 0.04942277645123304, -0.1087697345106356, -0.14753374590080087, 0.363865097303715, 0.05607524151411141, 0.18589750665462104, 0.032588799670143796, 0.25109187339843647, 0.013503091063722578, 0.15533352816656668, -0.0009125411066238352, 0.29643487845348765, 0.1581018395131555, 0.10287449399942618, -0.24925166074474922, 0.10063322061462382, 0.01580710244310482] |
1,802.05076 | Pulsars probe the low-frequency gravitational sky: Pulsar Timing Arrays
basics and recent results | Pulsar Timing Array (PTA) experiments exploit the clock-like behaviour of an
array of millisecond pulsars, with the goal of detecting low-frequency
gravitational waves. PTA experiments have been in operation over the last
decade, led by groups in Europe, Australia, and North America. These
experiments use the most sensitive radio telescopes in the world, extremely
precise pulsar timing models and sophisticated detection algorithms to increase
the sensitivity of PTAs. No detection of gravitational waves has been made to
date with this technique, but PTA upper limits already contributed to rule out
some models of galaxy formation. Moreover, a new generation of radio
telescopes, such as the Five hundred metre Aperture Spherical Telescope and, in
particular, the Square Kilometre Array, will offer a significant improvement to
the PTA sensitivity. In this article, we review the basic concepts of PTA
experiments, and discuss the latest results from the established PTA
collaborations.
| astro-ph.IM astro-ph.HE | pulsar timing array pta experiments exploit the clocklike behaviour of an array of millisecond pulsars with the goal of detecting lowfrequency gravitational waves pta experiments have been in operation over the last decade led by groups in europe australia and north america these experiments use the most sensitive radio telescopes in the world extremely precise pulsar timing models and sophisticated detection algorithms to increase the sensitivity of ptas no detection of gravitational waves has been made to date with this technique but pta upper limits already contributed to rule out some models of galaxy formation moreover a new generation of radio telescopes such as the five hundred metre aperture spherical telescope and in particular the square kilometre array will offer a significant improvement to the pta sensitivity in this article we review the basic concepts of pta experiments and discuss the latest results from the established pta collaborations | [['pulsar', 'timing', 'array', 'pta', 'experiments', 'exploit', 'the', 'clocklike', 'behaviour', 'of', 'an', 'array', 'of', 'millisecond', 'pulsars', 'with', 'the', 'goal', 'of', 'detecting', 'lowfrequency', 'gravitational', 'waves', 'pta', 'experiments', 'have', 'been', 'in', 'operation', 'over', 'the', 'last', 'decade', 'led', 'by', 'groups', 'in', 'europe', 'australia', 'and', 'north', 'america', 'these', 'experiments', 'use', 'the', 'most', 'sensitive', 'radio', 'telescopes', 'in', 'the', 'world', 'extremely', 'precise', 'pulsar', 'timing', 'models', 'and', 'sophisticated', 'detection', 'algorithms', 'to', 'increase', 'the', 'sensitivity', 'of', 'ptas', 'no', 'detection', 'of', 'gravitational', 'waves', 'has', 'been', 'made', 'to', 'date', 'with', 'this', 'technique', 'but', 'pta', 'upper', 'limits', 'already', 'contributed', 'to', 'rule', 'out', 'some', 'models', 'of', 'galaxy', 'formation', 'moreover', 'a', 'new', 'generation', 'of', 'radio', 'telescopes', 'such', 'as', 'the', 'five', 'hundred', 'metre', 'aperture', 'spherical', 'telescope', 'and', 'in', 'particular', 'the', 'square', 'kilometre', 'array', 'will', 'offer', 'a', 'significant', 'improvement', 'to', 'the', 'pta', 'sensitivity', 'in', 'this', 'article', 'we', 'review', 'the', 'basic', 'concepts', 'of', 'pta', 'experiments', 'and', 'discuss', 'the', 'latest', 'results', 'from', 'the', 'established', 'pta', 'collaborations']] | [-0.12869670312392298, 0.10130946573298315, -0.010304920280956337, 0.08051873603521066, -0.16494956441424988, -0.06260666015205553, 0.05459287107412426, 0.39909826086305483, -0.15965706931633208, -0.33032548927223765, 0.19895628265677825, -0.3051476183542478, -0.14629271505652247, 0.29434253226311224, 0.015360048852508535, 0.035333419622180076, 0.14493699861073717, -0.0638562129335352, -0.03464259255702633, -0.2595334729992681, 0.18458383802538486, 0.1973201407251779, 0.24686649666369162, 0.01694839761114201, 0.11294428666587919, -0.08865946115032342, -0.10716635547342358, -0.02637224370689207, -0.08137008100999771, 0.10608349558016336, 0.3228794487348677, 0.2096167170853929, 0.22397190361988503, -0.46630879705520095, -0.17771060572153688, 0.12311906506530815, 0.12309379474105742, 0.06589975172549178, -0.036409467607390486, -0.3544112164448519, 0.020055597432498896, -0.26882706680083396, -0.1749751839104008, 0.025111805307804734, 0.04159462192832064, 0.08532802680998135, -0.13902178885276756, -0.029363214167313197, 0.004055428719840239, 0.04507374228430579, -0.027660412540835504, -0.16325430667682275, 0.12097079276399864, 0.11313870081967498, 0.05081900053129003, 0.034695507193965885, 0.07529073086452381, -0.13656055003505302, -0.16767223583175675, 0.33849779881357617, -0.07541641234294386, -0.057957649993949346, 0.17651265584454695, -0.2515212770935299, -0.2426661133256464, 0.12050982465105434, 0.20222742452500136, 0.05624478694045212, -0.16311152673930535, 0.05203419167240075, -0.022222802675379492, 0.23524825302003002, 0.12684620929114218, 0.06255109104844254, 0.3378914541665565, 0.2406808799502402, 0.12905185208246867, 0.11208505945349415, -0.2385557655534531, -0.006637363537290209, -0.20817926278451104, -0.028381614568265708, -0.14425814379245747, 0.055194336639377416, -0.06169891972810571, -0.10053342751485321, 0.4181888011233831, 0.1885781032473755, 0.05132631123273608, 0.05021737976789449, 0.3229267638101167, 0.021062160081488104, 0.10761351049390018, 0.0014526031949129458, 0.3605062539268024, 0.12328016614491069, 0.11507089372104462, -0.15977734905459942, 0.04338603566803441, -0.04987415757873473] |
1,802.05077 | Fast dynamics perspective on the breakdown of the Stokes-Einstein law in
fragile glassformers | The breakdown of the Stokes-Einstein (SE) law in fragile glassformers is
examined by Molecular-Dynamics simulations of atomic liquids and polymers and
consideration of the experimental data concerning the archetypical OTP
glassformer. All the four systems comply with the universal scaling between the
viscosity (or the structural relaxation) and the Debye-Waller factor $\langle
u^2\rangle$, the mean square amplitude of the particle rattling in the cage
formed by the surrounding neighbors. It is found that the SE breakdown is
scaled in a master curve by a reduced $\langle u^2\rangle$. Two approximated
expressions of the latter, with no and one adjustable parameters respectively,
are derived.
| cond-mat.soft cond-mat.dis-nn | the breakdown of the stokeseinstein se law in fragile glassformers is examined by moleculardynamics simulations of atomic liquids and polymers and consideration of the experimental data concerning the archetypical otp glassformer all the four systems comply with the universal scaling between the viscosity or the structural relaxation and the debyewaller factor langle u2rangle the mean square amplitude of the particle rattling in the cage formed by the surrounding neighbors it is found that the se breakdown is scaled in a master curve by a reduced langle u2rangle two approximated expressions of the latter with no and one adjustable parameters respectively are derived | [['the', 'breakdown', 'of', 'the', 'stokeseinstein', 'se', 'law', 'in', 'fragile', 'glassformers', 'is', 'examined', 'by', 'moleculardynamics', 'simulations', 'of', 'atomic', 'liquids', 'and', 'polymers', 'and', 'consideration', 'of', 'the', 'experimental', 'data', 'concerning', 'the', 'archetypical', 'otp', 'glassformer', 'all', 'the', 'four', 'systems', 'comply', 'with', 'the', 'universal', 'scaling', 'between', 'the', 'viscosity', 'or', 'the', 'structural', 'relaxation', 'and', 'the', 'debyewaller', 'factor', 'langle', 'u2rangle', 'the', 'mean', 'square', 'amplitude', 'of', 'the', 'particle', 'rattling', 'in', 'the', 'cage', 'formed', 'by', 'the', 'surrounding', 'neighbors', 'it', 'is', 'found', 'that', 'the', 'se', 'breakdown', 'is', 'scaled', 'in', 'a', 'master', 'curve', 'by', 'a', 'reduced', 'langle', 'u2rangle', 'two', 'approximated', 'expressions', 'of', 'the', 'latter', 'with', 'no', 'and', 'one', 'adjustable', 'parameters', 'respectively', 'are', 'derived']] | [-0.1536223815443615, 0.1689912811396461, -0.08028325854855425, 0.03968027107960855, 0.03945072946211725, -0.1493932014084695, 0.04196939600047236, 0.3284625576845571, -0.26631878915370677, -0.26248832616735907, 0.05444808393447459, -0.323804927786399, -0.1326567392736929, 0.14546940024992377, 0.04251000116232271, 0.03322451741562462, -0.011361189917022107, 0.019207952382024742, -0.09046388515408206, -0.20390632006969742, 0.2251998938793572, 0.05131900778289099, 0.28729276770871937, 0.036473652873503265, 0.09424605746137198, -0.0019430737707343902, 0.02443620344331744, 0.0749876634400411, -0.1785566383667031, 0.07139921898716221, 0.16682730195929715, 0.01439378475633395, 0.2053375720393424, -0.419395790289284, -0.19865738977586814, 0.05487223386801049, 0.11462784024850264, 0.056321211926771475, 0.00022704491629173943, -0.2318717602129076, 0.04481346907514129, -0.16587388490363225, -0.1579199272673577, -0.033295357816421206, 0.0528404582657066, 0.0756263902054771, -0.220988458807708, 0.18379286474630455, 0.06315843286175354, 0.07413920482584074, -0.07050149369637902, -0.13673896091424076, -0.037255147134191265, 0.07572176657484699, 0.048426273792489045, 0.016134524537597363, 0.19228071104004688, -0.13204318265814116, -0.06949622446771565, 0.43039320051377894, -0.037054983538338075, -0.16397872621047438, 0.17553990832119085, -0.1655883242367018, -0.07552588653440277, 0.15420708459728927, 0.04809978001924487, 0.036651251953241856, -0.16800290755653643, 0.05859924105678539, -0.03192251618476767, 0.19122696755563512, 0.03812122855828527, -0.002345430035847148, 0.15430353095700197, 0.1576773909493532, -0.029419532739648632, 0.12441423258689396, -0.07593708402732861, -0.13681211757391473, -0.2645433146013495, -0.15020005410427556, -0.23959194053553373, 0.037461328493686864, -0.14876388514119968, -0.1253452509203378, 0.32822716541990055, 0.04531272338228483, 0.1856192411927908, 0.047390534019773355, 0.21602395470779134, 0.1269772001039967, 0.06367835000741716, 0.061769178169140335, 0.26028807907748747, 0.1446039023131187, 0.07132066318801805, -0.3245590453072652, 0.09983228072615377, 0.05238113932165445] |
1,802.05078 | Characterisation of nuclear effects in muon-neutrino scattering on
hydrocarbon with a measurement of final-state kinematics and correlations in
charged-current pionless interactions at T2K | This paper reports measurements of final-state proton multiplicity, muon and
proton kinematics, and their correlations in charged-current pionless neutrino
interactions, measured by the T2K ND280 near detector in its plastic
scintillator (C$_8$H$_8$) target. The data were taken between years 2010 and
2013, corresponding to approximately 6$\times10^{20}$ protons on target. Thanks
to their exploration of the proton kinematics and of kinematic imbalances
between the proton and muon kinematics, the results offer a novel probe of the
nuclear-medium effects most pertinent to the (sub-)GeV neutrino-nucleus
interactions that are used in accelerator-based long-baseline neutrino
oscillation measurements. These results are compared to many neutrino-nucleus
interaction models which all fail to describe at least part of the observed
phase space. In case of events without a proton above a detection threshold in
the final state, a fully consistent implementation of the local Fermi gas model
with multinucleon interactions gives the best description of the data. In the
case of at least one proton in the final state the spectral function model
agrees well with the data, most notably when measuring the kinematic imbalance
between the muon and the proton in the plane transverse to the incoming
neutrino. A clear indication of existence of multinucleon interactions is
observed. The effect of final-state interactions is also discussed.
| hep-ex | this paper reports measurements of finalstate proton multiplicity muon and proton kinematics and their correlations in chargedcurrent pionless neutrino interactions measured by the t2k nd280 near detector in its plastic scintillator c_8h_8 target the data were taken between years 2010 and 2013 corresponding to approximately 6times1020 protons on target thanks to their exploration of the proton kinematics and of kinematic imbalances between the proton and muon kinematics the results offer a novel probe of the nuclearmedium effects most pertinent to the subgev neutrinonucleus interactions that are used in acceleratorbased longbaseline neutrino oscillation measurements these results are compared to many neutrinonucleus interaction models which all fail to describe at least part of the observed phase space in case of events without a proton above a detection threshold in the final state a fully consistent implementation of the local fermi gas model with multinucleon interactions gives the best description of the data in the case of at least one proton in the final state the spectral function model agrees well with the data most notably when measuring the kinematic imbalance between the muon and the proton in the plane transverse to the incoming neutrino a clear indication of existence of multinucleon interactions is observed the effect of finalstate interactions is also discussed | [['this', 'paper', 'reports', 'measurements', 'of', 'finalstate', 'proton', 'multiplicity', 'muon', 'and', 'proton', 'kinematics', 'and', 'their', 'correlations', 'in', 'chargedcurrent', 'pionless', 'neutrino', 'interactions', 'measured', 'by', 'the', 't2k', 'nd280', 'near', 'detector', 'in', 'its', 'plastic', 'scintillator', 'c_8h_8', 'target', 'the', 'data', 'were', 'taken', 'between', 'years', '2010', 'and', '2013', 'corresponding', 'to', 'approximately', '6times1020', 'protons', 'on', 'target', 'thanks', 'to', 'their', 'exploration', 'of', 'the', 'proton', 'kinematics', 'and', 'of', 'kinematic', 'imbalances', 'between', 'the', 'proton', 'and', 'muon', 'kinematics', 'the', 'results', 'offer', 'a', 'novel', 'probe', 'of', 'the', 'nuclearmedium', 'effects', 'most', 'pertinent', 'to', 'the', 'subgev', 'neutrinonucleus', 'interactions', 'that', 'are', 'used', 'in', 'acceleratorbased', 'longbaseline', 'neutrino', 'oscillation', 'measurements', 'these', 'results', 'are', 'compared', 'to', 'many', 'neutrinonucleus', 'interaction', 'models', 'which', 'all', 'fail', 'to', 'describe', 'at', 'least', 'part', 'of', 'the', 'observed', 'phase', 'space', 'in', 'case', 'of', 'events', 'without', 'a', 'proton', 'above', 'a', 'detection', 'threshold', 'in', 'the', 'final', 'state', 'a', 'fully', 'consistent', 'implementation', 'of', 'the', 'local', 'fermi', 'gas', 'model', 'with', 'multinucleon', 'interactions', 'gives', 'the', 'best', 'description', 'of', 'the', 'data', 'in', 'the', 'case', 'of', 'at', 'least', 'one', 'proton', 'in', 'the', 'final', 'state', 'the', 'spectral', 'function', 'model', 'agrees', 'well', 'with', 'the', 'data', 'most', 'notably', 'when', 'measuring', 'the', 'kinematic', 'imbalance', 'between', 'the', 'muon', 'and', 'the', 'proton', 'in', 'the', 'plane', 'transverse', 'to', 'the', 'incoming', 'neutrino', 'a', 'clear', 'indication', 'of', 'existence', 'of', 'multinucleon', 'interactions', 'is', 'observed', 'the', 'effect', 'of', 'finalstate', 'interactions', 'is', 'also', 'discussed']] | [-0.061572905141374534, 0.19437053641382354, -0.06370225320174693, 0.15617959215205485, -0.022617815347593367, -0.07407080748538447, 0.012222329369059912, 0.3424684982212109, -0.19879871612382968, -0.331285992904642, -0.016452076555225268, -0.3648202855041937, 0.00552144125727803, 0.16589049681571075, 0.060344074070442504, 0.04981024013069106, 0.10006606738800494, 0.008232029301947668, -0.08378138450201619, -0.18984114093166826, 0.3009422607051485, 0.13154067956000282, 0.25318421974096395, 0.12005745541776695, 0.11149057761557694, 0.044127510916263435, -0.06861836053475595, -0.05012766082905362, -0.0890353005681965, 0.04959194108834891, 0.2849206417613546, 0.08144728215210781, 0.12412879102680671, -0.4283235703804419, -0.14131996672350966, 0.12736546165759913, 0.11773284431546926, 0.0919059746409655, -0.03331777951557582, -0.3012456206190422, 0.01566242281588142, -0.19982782895253462, -0.14138039033726285, -0.03197788596476326, -0.01980223119677753, 0.0317928661307115, -0.26179595889844465, 0.07420417302247453, 0.008613215229678988, 0.035666904561488966, -0.08423163370467704, -0.16323985390222528, -0.01395437479772244, 0.09560972462482327, 0.1194733253648977, 0.07303333066796001, 0.1365293331018707, -0.18144968035484665, -0.11325883110717795, 0.3615630218563111, -0.019853864336368498, -0.13824365316538148, 0.17872730786043206, -0.24245396909486663, -0.09365282209955476, 0.1748649696552119, 0.19746918778122363, 0.05838098748627177, -0.2115411265304398, 0.02978886211453603, -0.038241624722979144, 0.1585258177000334, 0.0364066972809456, 0.02770416747386518, 0.20490446147557936, 0.24222391304887528, 0.037291541931488995, 0.025064045055346054, -0.19373405007890573, -0.045541673743847814, -0.3575057770731596, -0.07844683478929494, -0.09500859284541752, 0.01813305224320945, -0.019427141530743385, -0.0936710389117091, 0.39758510853088147, 0.11874156490619446, 0.23492657802954459, -0.046096531805163474, 0.31882037696067655, 0.02336362144312683, 0.05657240413975986, 0.025148416405909084, 0.33119960549247396, 0.1607283066758222, 0.13375927427222142, -0.2864997913107347, 0.09356403967998388, 0.02816722577807614] |
1,802.05079 | Using Two Independent Channels with Gateway for FlexRay Static Segment
Scheduling | The FlexRay bus is a communication standard used in the automotive industry.
It offers a deterministic message transmission in the static segment following
a time-triggered schedule. Even if its bandwidth is ten times higher than the
bandwidth of CAN, its throughput limits are going to be reached in high-class
car models soon. A solution that could postpone this problem is to use an
efficient scheduling algorithm that exploits both channels of the FlexRay. The
significant and often neglected feature that can theoretically double the
bandwidth is the possibility to use two independent communication channels that
can intercommunicate through the gateway.
In this paper, we propose a heuristic algorithm that decomposes the
scheduling problem to the ECU-to-channel assignment subproblem which decides
which channel the ECUs (Electronic Control Units) should be connected to and
the channel scheduling subproblem which creates static segment communication
schedules for both channels. The algorithm is able to create a schedule for
cases where channels are configured in the independent mode as well as in the
fault-tolerant mode or in cases where just part of the signals are
fault-tolerant. Finally, the algorithm is evaluated on real data and
synthesized data, and the relation between the portion of fault-tolerant
signals and the number of allocated slots is presented.
| cs.SY | the flexray bus is a communication standard used in the automotive industry it offers a deterministic message transmission in the static segment following a timetriggered schedule even if its bandwidth is ten times higher than the bandwidth of can its throughput limits are going to be reached in highclass car models soon a solution that could postpone this problem is to use an efficient scheduling algorithm that exploits both channels of the flexray the significant and often neglected feature that can theoretically double the bandwidth is the possibility to use two independent communication channels that can intercommunicate through the gateway in this paper we propose a heuristic algorithm that decomposes the scheduling problem to the ecutochannel assignment subproblem which decides which channel the ecus electronic control units should be connected to and the channel scheduling subproblem which creates static segment communication schedules for both channels the algorithm is able to create a schedule for cases where channels are configured in the independent mode as well as in the faulttolerant mode or in cases where just part of the signals are faulttolerant finally the algorithm is evaluated on real data and synthesized data and the relation between the portion of faulttolerant signals and the number of allocated slots is presented | [['the', 'flexray', 'bus', 'is', 'a', 'communication', 'standard', 'used', 'in', 'the', 'automotive', 'industry', 'it', 'offers', 'a', 'deterministic', 'message', 'transmission', 'in', 'the', 'static', 'segment', 'following', 'a', 'timetriggered', 'schedule', 'even', 'if', 'its', 'bandwidth', 'is', 'ten', 'times', 'higher', 'than', 'the', 'bandwidth', 'of', 'can', 'its', 'throughput', 'limits', 'are', 'going', 'to', 'be', 'reached', 'in', 'highclass', 'car', 'models', 'soon', 'a', 'solution', 'that', 'could', 'postpone', 'this', 'problem', 'is', 'to', 'use', 'an', 'efficient', 'scheduling', 'algorithm', 'that', 'exploits', 'both', 'channels', 'of', 'the', 'flexray', 'the', 'significant', 'and', 'often', 'neglected', 'feature', 'that', 'can', 'theoretically', 'double', 'the', 'bandwidth', 'is', 'the', 'possibility', 'to', 'use', 'two', 'independent', 'communication', 'channels', 'that', 'can', 'intercommunicate', 'through', 'the', 'gateway', 'in', 'this', 'paper', 'we', 'propose', 'a', 'heuristic', 'algorithm', 'that', 'decomposes', 'the', 'scheduling', 'problem', 'to', 'the', 'ecutochannel', 'assignment', 'subproblem', 'which', 'decides', 'which', 'channel', 'the', 'ecus', 'electronic', 'control', 'units', 'should', 'be', 'connected', 'to', 'and', 'the', 'channel', 'scheduling', 'subproblem', 'which', 'creates', 'static', 'segment', 'communication', 'schedules', 'for', 'both', 'channels', 'the', 'algorithm', 'is', 'able', 'to', 'create', 'a', 'schedule', 'for', 'cases', 'where', 'channels', 'are', 'configured', 'in', 'the', 'independent', 'mode', 'as', 'well', 'as', 'in', 'the', 'faulttolerant', 'mode', 'or', 'in', 'cases', 'where', 'just', 'part', 'of', 'the', 'signals', 'are', 'faulttolerant', 'finally', 'the', 'algorithm', 'is', 'evaluated', 'on', 'real', 'data', 'and', 'synthesized', 'data', 'and', 'the', 'relation', 'between', 'the', 'portion', 'of', 'faulttolerant', 'signals', 'and', 'the', 'number', 'of', 'allocated', 'slots', 'is', 'presented']] | [-0.19539765402188766, 0.07491801440518109, -0.05145263951721687, 0.027731864546664094, -0.08571660295938668, -0.21552374327312346, 0.13203778495879367, 0.40925852050959777, -0.30756110557161526, -0.2964511875846032, 0.14556252591678612, -0.2550920256624979, -0.1266661371331626, 0.19918378979386087, -0.09278542975949096, 0.058209204679053585, 0.07155883772150222, 0.060473666017974055, 0.016760844372860764, -0.24643479493235187, 0.22880242946490215, 0.07113815130269974, 0.3059985867064842, 0.04507278361254268, 0.06790332991746817, 0.0034329465979593245, 0.012769381488686886, -0.02424999222075097, -0.0445075102219966, 0.06391561625565848, 0.31267802007035544, 0.18038761619401697, 0.2749928979783494, -0.4393680257011871, -0.1869604999192761, 0.11851823995531546, 0.17814520971876555, 0.08410296917629792, -0.007932743783095393, -0.23506483727625171, 0.128551880683851, -0.17396182669911553, -0.027039726642140407, -0.019451245791526232, -0.005280144546396922, -0.010813917935452456, -0.31876542113703377, 0.008600564597057547, -0.00803784170280242, -0.045437300501274314, -0.03460736415188103, -0.06644297552421287, 0.014705446979552868, 0.16505260324074125, -0.002105153441330157, 0.02723581941600367, 0.13785193345266517, -0.10011304442991237, -0.1554592731161322, 0.40494068835047636, -0.00562752512963275, -0.2153981983029522, 0.1403361430649245, -0.03201134296489547, -0.09598430578151475, 0.12044175614598365, 0.20413928056824143, 0.09035458872859604, -0.164923419105114, 0.028894730369787628, -0.024008168368757778, 0.18343895119569908, 0.0430631808248227, 0.04627218682111965, 0.159125203365721, 0.1954815709369554, 0.11599873665489362, 0.1515061697728059, -0.09691990462608707, -0.10554394562580231, -0.26086382732101254, -0.1588739257008917, -0.1864977184025647, -0.02727522762213352, -0.04846543082842268, -0.11319238685773335, 0.40288114685853177, 0.15405368080794596, 0.14687824366695207, 0.07629448418102816, 0.3800482251062755, 0.11409861163420666, 0.10629666886620835, 0.1487299764758327, 0.2105412935289208, 0.0537707351436636, 0.11205364053378304, -0.1953110127205902, 0.08419206816082199, -0.019672519935672914] |
1,802.0508 | Solutions to the Einstein constraint equations with a small TT-tensor
and vanishing Yamabe invariant | In this note we prove an existence result for the Einstein conformal
constraint equations for metrics with vanishing Yamabe invariant assuming that
the TT-tensor is small in $L^2$.
| math.AP gr-qc math.DG | in this note we prove an existence result for the einstein conformal constraint equations for metrics with vanishing yamabe invariant assuming that the tttensor is small in l2 | [['in', 'this', 'note', 'we', 'prove', 'an', 'existence', 'result', 'for', 'the', 'einstein', 'conformal', 'constraint', 'equations', 'for', 'metrics', 'with', 'vanishing', 'yamabe', 'invariant', 'assuming', 'that', 'the', 'tttensor', 'is', 'small', 'in', 'l2']] | [-0.2430792615881988, 0.06982431749150107, -0.08489827645410385, 0.09336937541541245, -0.07587310166231223, -0.14021587671179855, -0.12186247477906623, 0.26309570729998605, -0.2286287367876087, -0.22984037787786551, 0.13202594035205298, -0.28045058835830006, -0.1553183944363679, 0.12240714832608189, -0.1268720497776355, 0.0783972134148436, 0.07481911224645696, 0.09063197579234838, -0.17074257756550132, -0.26943423885053824, 0.4653996117413044, -0.017860569658556154, 0.2206476011113929, 0.14511389827488788, 0.12776761292479932, -0.05406325406927083, 0.009822416135908238, 0.01431385095098189, -0.22606134894600213, 0.0470645362178662, 0.23710756030465877, 0.0729845837008075, 0.20971720705607108, -0.33055695578722016, -0.1733503964330469, 0.1836155057452353, 0.09678070743601504, 0.11177989251778594, -0.0638739143697811, -0.2993713415760015, 0.2017719627723896, -0.07901769084855914, -0.2319295249679791, -0.05699571861519611, 0.03799862454512289, -0.03822823109138491, -0.2660467019304633, 0.10162456011000488, 0.15016354457475245, 0.041894110052713325, -0.20428133383393288, -0.025328392279334366, 0.02704630246652024, 0.024976618255355527, 0.171603116955209, 0.06726576650648244, 0.005312188678154988, -0.07024100775223426, -0.04446065492395844, 0.3368017165256398, -0.2282977582820292, -0.34170620968299253, 0.050960127314153524, -0.10717745714022645, -0.24533075370293642, 0.04756233615002462, 0.12370694310603929, 0.18594859414068715, -0.12487764530149954, 0.16544308862648904, -0.12170730797307831, 0.1107038193648415, 0.13897980596604093, 0.017633418170070008, 0.11508123693056405, 0.0694530001741701, 0.23702691186086408, 0.10691457717413348, 0.023365749578390802, -0.062266650227164586, -0.42274510275040356, -0.20626924715803138, -0.15286148055123963, 0.2118612596033407, -0.14461875800043344, -0.1803247852783118, 0.2824931209241705, 0.06280075591296606, 0.1623690762290997, 0.19230261834205262, 0.21728750398116453, 0.13535541419072875, 0.037353717539060326, 0.175860216192502, 0.29011120088398457, 0.15099837670900992, 0.09459664896712638, -0.18703409924637526, -0.07025738762292479, 0.18913602396579726] |
1,802.05081 | Analysis of angular momentum properties of photons emitted in
fundamental atomic processes | Many atomic processes result in the emission of photons. Analysis of the
properties of emitted photons, such as energy and angular distribution as well
as polarization, is regarded as a powerful tool for gaining more insight into
the physics of corresponding processes. Another characteristic of light is the
projection of its angular momentum upon propagation direction. This property
has attracted a special attention over the last decades due to studies of
twisted (or vortex) light beams. Measurements being sensitive to this
projection may provide valuable information about the role of angular momentum
in the fundamental atomic processes. Here we describe a simple theoretical
method for determination of the angular momentum properties of the photons
emitted in various atomic processes. This method is based on the evaluation of
expectation value of the total angular momentum projection operator. To
illustrate the method, we apply it to the text-book examples of plane-wave,
spherical-wave, and Bessel light. Moreover, we investigate the projection of
angular momentum for the photons emitted in the process of the radiative
recombination with ionic targets. It is found that the recombination photons do
carry a non-zero projection of the orbital angular momentum.
| physics.atom-ph | many atomic processes result in the emission of photons analysis of the properties of emitted photons such as energy and angular distribution as well as polarization is regarded as a powerful tool for gaining more insight into the physics of corresponding processes another characteristic of light is the projection of its angular momentum upon propagation direction this property has attracted a special attention over the last decades due to studies of twisted or vortex light beams measurements being sensitive to this projection may provide valuable information about the role of angular momentum in the fundamental atomic processes here we describe a simple theoretical method for determination of the angular momentum properties of the photons emitted in various atomic processes this method is based on the evaluation of expectation value of the total angular momentum projection operator to illustrate the method we apply it to the textbook examples of planewave sphericalwave and bessel light moreover we investigate the projection of angular momentum for the photons emitted in the process of the radiative recombination with ionic targets it is found that the recombination photons do carry a nonzero projection of the orbital angular momentum | [['many', 'atomic', 'processes', 'result', 'in', 'the', 'emission', 'of', 'photons', 'analysis', 'of', 'the', 'properties', 'of', 'emitted', 'photons', 'such', 'as', 'energy', 'and', 'angular', 'distribution', 'as', 'well', 'as', 'polarization', 'is', 'regarded', 'as', 'a', 'powerful', 'tool', 'for', 'gaining', 'more', 'insight', 'into', 'the', 'physics', 'of', 'corresponding', 'processes', 'another', 'characteristic', 'of', 'light', 'is', 'the', 'projection', 'of', 'its', 'angular', 'momentum', 'upon', 'propagation', 'direction', 'this', 'property', 'has', 'attracted', 'a', 'special', 'attention', 'over', 'the', 'last', 'decades', 'due', 'to', 'studies', 'of', 'twisted', 'or', 'vortex', 'light', 'beams', 'measurements', 'being', 'sensitive', 'to', 'this', 'projection', 'may', 'provide', 'valuable', 'information', 'about', 'the', 'role', 'of', 'angular', 'momentum', 'in', 'the', 'fundamental', 'atomic', 'processes', 'here', 'we', 'describe', 'a', 'simple', 'theoretical', 'method', 'for', 'determination', 'of', 'the', 'angular', 'momentum', 'properties', 'of', 'the', 'photons', 'emitted', 'in', 'various', 'atomic', 'processes', 'this', 'method', 'is', 'based', 'on', 'the', 'evaluation', 'of', 'expectation', 'value', 'of', 'the', 'total', 'angular', 'momentum', 'projection', 'operator', 'to', 'illustrate', 'the', 'method', 'we', 'apply', 'it', 'to', 'the', 'textbook', 'examples', 'of', 'planewave', 'sphericalwave', 'and', 'bessel', 'light', 'moreover', 'we', 'investigate', 'the', 'projection', 'of', 'angular', 'momentum', 'for', 'the', 'photons', 'emitted', 'in', 'the', 'process', 'of', 'the', 'radiative', 'recombination', 'with', 'ionic', 'targets', 'it', 'is', 'found', 'that', 'the', 'recombination', 'photons', 'do', 'carry', 'a', 'nonzero', 'projection', 'of', 'the', 'orbital', 'angular', 'momentum']] | [-0.08820900979177775, 0.15317633436219089, -0.11596666258992627, 0.07325611013210202, -0.06323121954968276, -0.05968328466648624, 0.01836074910897878, 0.3886067835846916, -0.2739702415716844, -0.28983511154122726, 0.035141152848761216, -0.2787505495737908, -0.03384059491145308, 0.22349179204744965, 0.023778657118479412, 0.05126056243564866, 0.05446690005434599, -0.01387301305279228, -0.07321021102325176, -0.14541940168176856, 0.3169901259546653, 0.11413998035520005, 0.2642257212464756, 0.08465363144690248, 0.1440823282052103, 0.05572206633830016, -0.08676396774080786, -0.04721324619337489, -0.09784087645391537, 0.10294532517339879, 0.19594460164080374, 0.10891515815698465, 0.24105147811739394, -0.4028270331133778, -0.20492020293265037, 0.1026987505829311, 0.17461090319193318, 0.1269956815134113, -0.06907455889184651, -0.2279300978698302, -0.027714870033984578, -0.13663697627028645, -0.17175265900004888, -0.08261542136218243, 0.0450994024904503, 0.04099846339522628, -0.2317295244477767, 0.06791496998872996, 0.09233339814575932, 0.025606613421890263, -0.02623376814578175, -0.1337999850147753, -0.060616903293824485, 0.08692970003539813, 0.08473611413000981, 0.038105620726431276, 0.15336985558921393, -0.12021809445286635, -0.10905497645156477, 0.3994673070070955, -0.03025684393711951, -0.20305395723456363, 0.14441627555909994, -0.19315682138934184, -0.08215641016674151, 0.1754140835309954, 0.2046538408709845, 0.15321476570776818, -0.12024021965771681, 0.031341276181895715, -0.04780579814784384, 0.1275713098129927, 0.06475619839208473, 0.15470729703035127, 0.24995747044643699, 0.15619375245053865, 0.02411379386315578, 0.1221444626765636, -0.1386758458611439, -0.1026088909432777, -0.2738771814959667, -0.20164568067411892, -0.20906550945073832, 0.09326446090259803, -0.04665907005240418, -0.12173511622919857, 0.41672186263410066, 0.13779333676029637, 0.2157078562678786, -0.04213369141992492, 0.34880510001191095, 0.1332441381400713, 0.08210916593573832, 0.03264499745030965, 0.2822668708953036, 0.19469853953341953, 0.12784782930430083, -0.23917998411828498, 0.033964086636842694, 0.028310923795894876] |
1,802.05082 | Synchronization of a double pendulum with moving pivots: a study of the
spectrum | The model we consider consists in a double pendulum set, where the pivot
points are free to shift along a horizontal line. Moreover, the two pendula are
coupled by means of a spring whose extremities connect two points of each
pendulum, at a fixed distance from the corresponding pivot. The mathematical
model is first written encompassing a large class of setting for the device
(different sizes, different physical properties, ...). In order to carry on the
problem of synchronization via analytical me\-thods, we focus on the
circumstance of identical pendula: in that case, some classical theorems
concerning the zeroes of polynomial equations are used in order to locate the
eigenvalues governing the process, so that the possibility of synchronization
of the device can be better understood.
| physics.class-ph | the model we consider consists in a double pendulum set where the pivot points are free to shift along a horizontal line moreover the two pendula are coupled by means of a spring whose extremities connect two points of each pendulum at a fixed distance from the corresponding pivot the mathematical model is first written encompassing a large class of setting for the device different sizes different physical properties in order to carry on the problem of synchronization via analytical methods we focus on the circumstance of identical pendula in that case some classical theorems concerning the zeroes of polynomial equations are used in order to locate the eigenvalues governing the process so that the possibility of synchronization of the device can be better understood | [['the', 'model', 'we', 'consider', 'consists', 'in', 'a', 'double', 'pendulum', 'set', 'where', 'the', 'pivot', 'points', 'are', 'free', 'to', 'shift', 'along', 'a', 'horizontal', 'line', 'moreover', 'the', 'two', 'pendula', 'are', 'coupled', 'by', 'means', 'of', 'a', 'spring', 'whose', 'extremities', 'connect', 'two', 'points', 'of', 'each', 'pendulum', 'at', 'a', 'fixed', 'distance', 'from', 'the', 'corresponding', 'pivot', 'the', 'mathematical', 'model', 'is', 'first', 'written', 'encompassing', 'a', 'large', 'class', 'of', 'setting', 'for', 'the', 'device', 'different', 'sizes', 'different', 'physical', 'properties', 'in', 'order', 'to', 'carry', 'on', 'the', 'problem', 'of', 'synchronization', 'via', 'analytical', 'methods', 'we', 'focus', 'on', 'the', 'circumstance', 'of', 'identical', 'pendula', 'in', 'that', 'case', 'some', 'classical', 'theorems', 'concerning', 'the', 'zeroes', 'of', 'polynomial', 'equations', 'are', 'used', 'in', 'order', 'to', 'locate', 'the', 'eigenvalues', 'governing', 'the', 'process', 'so', 'that', 'the', 'possibility', 'of', 'synchronization', 'of', 'the', 'device', 'can', 'be', 'better', 'understood']] | [-0.15585158236254937, 0.10498562275897712, -0.06516315312311054, 0.02282658417763014, -0.06954581751860678, -0.1482066958285868, 0.04707893863040954, 0.3518917457908392, -0.2871952785253525, -0.27376144525781276, 0.10185938355978578, -0.2703570499382913, -0.1418203464942053, 0.22865787103725596, -0.03165615856274962, 0.05226770374923945, 0.04577881346642971, 0.08524184827506542, -0.05349292736314237, -0.1895747024221346, 0.33944058045186104, -0.005728057831525803, 0.24346732557751238, -0.033527133256196974, 0.11107656173408031, -0.027148041255772113, 0.010338066957890987, 0.01310640811547637, -0.12037444423756097, 0.09207584693562239, 0.21029627576842905, 0.04911475328356028, 0.2676895328499377, -0.43435509403049943, -0.14720496395975352, 0.10884460347145795, 0.1447837340719998, 0.0993408410102129, 0.023708515057340264, -0.23459750107116997, 0.08706007025577128, -0.11567649595066905, -0.15933828767389058, -0.005578499000519514, -0.028572885803878307, 0.06626367396023125, -0.23848502622917295, 0.029527354896068572, 0.04994067121110857, 0.06300885581970214, -0.04103290496394038, -0.09274261347949504, 0.005027160694822669, 0.169849591717124, 0.02669089733506553, -0.04266630361974239, 0.10004187145456672, -0.07992429491505026, -0.11934334013983608, 0.4054946548640728, -0.04505450608022511, -0.24843962617218496, 0.17528293232060968, -0.12462163074873388, -0.12557961094379425, 0.0954089485630393, 0.17440104860067368, 0.11886255949735641, -0.16012765099480747, 0.08321168896369636, -0.054241416811943055, 0.1342957372814417, 0.11013454036042095, -0.024918719317764043, 0.23714716783910988, 0.15131202501058577, 0.08542679284140467, 0.17206012565176934, -0.05727411126345396, -0.1589652813486755, -0.3394256481230259, -0.12123845102544874, -0.17387810922414065, 0.013729984439909458, -0.09539431133773178, -0.1814300550222397, 0.42747573935985567, 0.1393651810376905, 0.22811873519420625, 0.03842569529637695, 0.25973105496168136, 0.11760876391746569, 0.04161862377077341, 0.030561293203383685, 0.22868051819060928, 0.11629183416627348, 0.07807166294846683, -0.20906663967110217, 0.02266186386719346, 0.09908975081145763] |
1,802.05083 | A Study of the Abundance of Low-Z Elements in the Sun During its Whole
Predicted Life | The study of the elemental composition of stars and galaxies is a key topic
for understanding their origin and evolution. In this study, we present the
results of the calculation of solar abundances of the isotopes $^{1}$H,
$^{4}$He, $^{12}$C, $^{14}$N, $^{15}$O, $^{16}$O, $^{17}$O, and $^{18}$O during
the four phases of the solar life; Hydrogen burning, Onset of rapid growth and
red giant, Helium burning and Helium exhaustion. The open source package
nucnet-tools from the Webnucleo Group in Clemson University, SC, USA was used
for this purpose. The results for all isotopes are listed in tables for future
use. Abundances found, globally, agree fairly well with those predicted in the
literature. Results obtained for the last two phases have no equivalent
elsewhere.
| astro-ph.SR | the study of the elemental composition of stars and galaxies is a key topic for understanding their origin and evolution in this study we present the results of the calculation of solar abundances of the isotopes 1h 4he 12c 14n 15o 16o 17o and 18o during the four phases of the solar life hydrogen burning onset of rapid growth and red giant helium burning and helium exhaustion the open source package nucnettools from the webnucleo group in clemson university sc usa was used for this purpose the results for all isotopes are listed in tables for future use abundances found globally agree fairly well with those predicted in the literature results obtained for the last two phases have no equivalent elsewhere | [['the', 'study', 'of', 'the', 'elemental', 'composition', 'of', 'stars', 'and', 'galaxies', 'is', 'a', 'key', 'topic', 'for', 'understanding', 'their', 'origin', 'and', 'evolution', 'in', 'this', 'study', 'we', 'present', 'the', 'results', 'of', 'the', 'calculation', 'of', 'solar', 'abundances', 'of', 'the', 'isotopes', '1h', '4he', '12c', '14n', '15o', '16o', '17o', 'and', '18o', 'during', 'the', 'four', 'phases', 'of', 'the', 'solar', 'life', 'hydrogen', 'burning', 'onset', 'of', 'rapid', 'growth', 'and', 'red', 'giant', 'helium', 'burning', 'and', 'helium', 'exhaustion', 'the', 'open', 'source', 'package', 'nucnettools', 'from', 'the', 'webnucleo', 'group', 'in', 'clemson', 'university', 'sc', 'usa', 'was', 'used', 'for', 'this', 'purpose', 'the', 'results', 'for', 'all', 'isotopes', 'are', 'listed', 'in', 'tables', 'for', 'future', 'use', 'abundances', 'found', 'globally', 'agree', 'fairly', 'well', 'with', 'those', 'predicted', 'in', 'the', 'literature', 'results', 'obtained', 'for', 'the', 'last', 'two', 'phases', 'have', 'no', 'equivalent', 'elsewhere']] | [-0.008667797691525281, 0.18945772788182152, -0.011287887510256608, 0.08138410849477157, 0.04949759963524191, -0.03812180745254952, 0.06162422856373689, 0.3766524634370972, -0.13281218176942414, -0.3212660583981271, 0.05755490818287896, -0.3147917596873741, -0.04406938482733334, 0.19942433385084532, 0.0034933092088258568, 0.00450855416065755, 0.1244766044962619, 3.5009468209092356e-05, -0.07925332369705458, -0.25331383715814154, 0.29533539062851116, 0.08323518237091225, 0.22733129207983988, 0.027366770548792947, -0.05206985411257679, -0.11878623045783318, -0.05142386268213892, -0.10217106244878985, -0.1651896602557796, 0.07808633579896028, 0.30562293546728225, 0.1384849448516151, 0.17294128874645515, -0.42902179777684835, -0.18645911792989237, 0.05921683893656405, 0.15716767891411895, 0.1216986438478617, -0.12705049703426918, -0.2517465102728926, 0.03883515503854264, -0.20372301823373476, -0.1873224112322601, 0.0077367096262819625, 0.06027815787575575, 0.06812404140785039, -0.18316548423325063, 0.05056780088837689, 0.02058889646525299, 0.11664309876211801, -0.16613568882497043, -0.24291473157124735, -0.06102035130264566, 0.15321159615189212, 0.035112078964882415, -0.010827621805066821, 0.1555393231492646, -0.057067725463073794, -0.022345677812528962, 0.4234910181590489, -0.07230690682792112, 0.022457143949235186, 0.15982792675964722, -0.17501301830071964, -0.2163217804480751, 0.13587800822682491, 0.10556100534877795, 0.1302493916806851, -0.17298791611551487, 0.02519519705503412, -0.006748350016271868, 0.15049313752571544, 0.07928556205994379, 0.011807605987140798, 0.19711465663237482, 0.20616563631049475, -0.03052642594772477, 0.027999093065413982, -0.14894796677810304, -0.07617034989667415, -0.24094410739964298, -0.18789134597984933, -0.08188939890178594, 0.032142812317675525, -0.04192145110805961, -0.14351514732013182, 0.3790230901066621, 0.05824452190769508, 0.17089615710189238, -0.05105723728652762, 0.25713258252690446, 0.031945338993168926, 0.022683553301784044, 0.0922284212252986, 0.2914483423869149, 0.24438750227529774, 0.13134740008835627, -0.2705707569712256, 0.14186007234839207, 0.03710297071727134] |
1,802.05084 | Do Programmers Work at Night or During the Weekend? | Abnormal working hours can reduce work health, general well-being, and
productivity, independent from a profession. To inform future approaches for
automatic stress and overload detection, this paper establishes empirically
collected measures of the work patterns of software engineers. To this aim, we
perform the first large-scale study of software engineers' working hours by
investigating the time stamps of commit activities of 86 large open source
software projects, both containing hired and volunteer developers. We find that
two thirds of software engineers mainly follow typical office hours,
empirically established to be from 10h to 18h, and do not usually work during
nights and weekends. Large variations between projects and individuals exist.
Surprisingly, we found no support that project maturation would decrease
abnormal working hours. In the Firefox case study, we found that hired
developers work more during office hours while seniority, either in terms of
number of commits or job status, did not impact working hours. We conclude that
the use of working hours or timestamps of work products for stress detection
requires establishing baselines at the level of individuals.
| cs.SE | abnormal working hours can reduce work health general wellbeing and productivity independent from a profession to inform future approaches for automatic stress and overload detection this paper establishes empirically collected measures of the work patterns of software engineers to this aim we perform the first largescale study of software engineers working hours by investigating the time stamps of commit activities of 86 large open source software projects both containing hired and volunteer developers we find that two thirds of software engineers mainly follow typical office hours empirically established to be from 10h to 18h and do not usually work during nights and weekends large variations between projects and individuals exist surprisingly we found no support that project maturation would decrease abnormal working hours in the firefox case study we found that hired developers work more during office hours while seniority either in terms of number of commits or job status did not impact working hours we conclude that the use of working hours or timestamps of work products for stress detection requires establishing baselines at the level of individuals | [['abnormal', 'working', 'hours', 'can', 'reduce', 'work', 'health', 'general', 'wellbeing', 'and', 'productivity', 'independent', 'from', 'a', 'profession', 'to', 'inform', 'future', 'approaches', 'for', 'automatic', 'stress', 'and', 'overload', 'detection', 'this', 'paper', 'establishes', 'empirically', 'collected', 'measures', 'of', 'the', 'work', 'patterns', 'of', 'software', 'engineers', 'to', 'this', 'aim', 'we', 'perform', 'the', 'first', 'largescale', 'study', 'of', 'software', 'engineers', 'working', 'hours', 'by', 'investigating', 'the', 'time', 'stamps', 'of', 'commit', 'activities', 'of', '86', 'large', 'open', 'source', 'software', 'projects', 'both', 'containing', 'hired', 'and', 'volunteer', 'developers', 'we', 'find', 'that', 'two', 'thirds', 'of', 'software', 'engineers', 'mainly', 'follow', 'typical', 'office', 'hours', 'empirically', 'established', 'to', 'be', 'from', '10h', 'to', '18h', 'and', 'do', 'not', 'usually', 'work', 'during', 'nights', 'and', 'weekends', 'large', 'variations', 'between', 'projects', 'and', 'individuals', 'exist', 'surprisingly', 'we', 'found', 'no', 'support', 'that', 'project', 'maturation', 'would', 'decrease', 'abnormal', 'working', 'hours', 'in', 'the', 'firefox', 'case', 'study', 'we', 'found', 'that', 'hired', 'developers', 'work', 'more', 'during', 'office', 'hours', 'while', 'seniority', 'either', 'in', 'terms', 'of', 'number', 'of', 'commits', 'or', 'job', 'status', 'did', 'not', 'impact', 'working', 'hours', 'we', 'conclude', 'that', 'the', 'use', 'of', 'working', 'hours', 'or', 'timestamps', 'of', 'work', 'products', 'for', 'stress', 'detection', 'requires', 'establishing', 'baselines', 'at', 'the', 'level', 'of', 'individuals']] | [-0.1073623036454541, 0.09678755969384051, -0.04966314997284689, 0.04520001920465609, -0.1284065422947992, -0.14937606101885553, 0.1167936884679743, 0.41803180403466333, -0.1599316211058316, -0.40691013421145317, 0.1314354992651136, -0.28640030811419814, -0.12824459430435153, 0.18833798850566544, -0.12345794657526236, 0.008776942783102976, 0.1573115261473209, 0.007868425862072816, -0.025110177837530744, -0.3225883604729725, 0.24254860043754625, 0.09232676554309964, 0.3088763675147761, 0.054761839848448776, 0.02452757920518351, -0.01715116719481166, -0.12098720296567005, -0.04321423998068727, -0.08864409005849534, 0.08439669784876472, 0.356119530006213, 0.2119973799718694, 0.367510508215211, -0.472185938114394, -0.13353456492150753, 0.10245591332855004, 0.11666270985018316, 0.023086290027394724, 0.0178436581808755, -0.30855747436006764, 0.0624587068565264, -0.21648879259091142, -0.11247399313292107, -0.03393284889341621, 0.03901479887260988, -0.009534215748728925, -0.18654425436755714, 0.047758696226184595, 0.012972077757080135, 0.18566596627172977, -0.07357818740498087, -0.10693336666793193, 0.014231308400184639, 0.2436860230017724, 0.11244966814492169, 0.0037932379072721963, 0.18024717453690298, -0.09496052395916602, -0.1415929959035952, 0.3459519586114827, -0.020405514004468585, -0.07047498853637853, 0.20984116075404363, -0.10779180813336214, -0.1791197238906219, 0.07805523109315328, 0.24591337828298604, 0.07168367932948633, -0.20481204117684723, -0.034956978479863336, 0.041077834541009293, 0.24026985748120785, 0.11184734082130414, -0.04939363751587765, 0.19559016437191704, 0.16809457919544765, 0.023899772082840474, 0.09196800495011409, -0.05994767804406375, -0.0532141379002669, -0.24353145407356697, -0.16401715454900398, -0.10994587462608749, 0.05388439062988651, -0.005720638045189153, -0.12559221098563692, 0.4107632324692673, 0.1970973008379923, 0.07470543348807945, 0.07816515227291322, 0.2748881740932608, -0.008410613234649157, 0.11030392595904999, 0.12383860659098783, 0.18711141188363623, -0.06065970290629141, 0.1932412124558888, -0.1554036636302877, 0.13320126924949943, -0.06938782595124034] |
1,802.05085 | Hard production of a Z boson plus heavy flavor jets at LHC and the
intrinsic charm content of a proton | The cross section of associated production of a Z boson with heavy flavor
jets in $pp$ collisions is calculated using the SHERPA Monte Carlo generator
and the analytical combined QCD approach based on kt-factorization at small x
and conventional collinear QCD at large x. A satisfactory description of the
ATLAS and CMS data on the $p_T$ spectra of Z bosons and c-jets in the whole
rapidity, y, region is shown. Searching for the intrinsic charm (IC)
contribution in these processes, which could be visible at large y > 1.5, we
study observables very sensitive to non-zero IC contributions and less affected
by theoretical QCD scale uncertainties. One of such observables is the
so-called double ratio: the ratio of the differential cross section of Z + c
production in the central region of |y| < 1.5 and in the forward region 1.5 <
|y| < 2.5, divided by the same ratio for Z + b production. These observables
could be more promising for the search of IC at LHC as compared to the
observables considered earlier.
| hep-ph | the cross section of associated production of a z boson with heavy flavor jets in pp collisions is calculated using the sherpa monte carlo generator and the analytical combined qcd approach based on ktfactorization at small x and conventional collinear qcd at large x a satisfactory description of the atlas and cms data on the p_t spectra of z bosons and cjets in the whole rapidity y region is shown searching for the intrinsic charm ic contribution in these processes which could be visible at large y 15 we study observables very sensitive to nonzero ic contributions and less affected by theoretical qcd scale uncertainties one of such observables is the socalled double ratio the ratio of the differential cross section of z c production in the central region of y 15 and in the forward region 15 y 25 divided by the same ratio for z b production these observables could be more promising for the search of ic at lhc as compared to the observables considered earlier | [['the', 'cross', 'section', 'of', 'associated', 'production', 'of', 'a', 'z', 'boson', 'with', 'heavy', 'flavor', 'jets', 'in', 'pp', 'collisions', 'is', 'calculated', 'using', 'the', 'sherpa', 'monte', 'carlo', 'generator', 'and', 'the', 'analytical', 'combined', 'qcd', 'approach', 'based', 'on', 'ktfactorization', 'at', 'small', 'x', 'and', 'conventional', 'collinear', 'qcd', 'at', 'large', 'x', 'a', 'satisfactory', 'description', 'of', 'the', 'atlas', 'and', 'cms', 'data', 'on', 'the', 'p_t', 'spectra', 'of', 'z', 'bosons', 'and', 'cjets', 'in', 'the', 'whole', 'rapidity', 'y', 'region', 'is', 'shown', 'searching', 'for', 'the', 'intrinsic', 'charm', 'ic', 'contribution', 'in', 'these', 'processes', 'which', 'could', 'be', 'visible', 'at', 'large', 'y', '15', 'we', 'study', 'observables', 'very', 'sensitive', 'to', 'nonzero', 'ic', 'contributions', 'and', 'less', 'affected', 'by', 'theoretical', 'qcd', 'scale', 'uncertainties', 'one', 'of', 'such', 'observables', 'is', 'the', 'socalled', 'double', 'ratio', 'the', 'ratio', 'of', 'the', 'differential', 'cross', 'section', 'of', 'z', 'c', 'production', 'in', 'the', 'central', 'region', 'of', 'y', '15', 'and', 'in', 'the', 'forward', 'region', '15', 'y', '25', 'divided', 'by', 'the', 'same', 'ratio', 'for', 'z', 'b', 'production', 'these', 'observables', 'could', 'be', 'more', 'promising', 'for', 'the', 'search', 'of', 'ic', 'at', 'lhc', 'as', 'compared', 'to', 'the', 'observables', 'considered', 'earlier']] | [-0.07061927478358193, 0.17070774026711047, -0.07678810015634893, 0.1336020514918023, 0.021170679402686434, -0.12388085260485801, 0.038235177684123434, 0.33869960348496553, -0.22854385760023133, -0.26731941524959174, 0.00617557724582351, -0.33756432120175756, 0.07619335934707135, 0.16608546241517205, 0.05105714471655975, 0.07372517032085879, 0.08195605257955882, -0.01920115065446796, -0.06455950667673843, -0.23055007788710868, 0.28559361542051537, 0.09554900405322306, 0.226300972629581, 0.09827978602891578, 0.07300270612547229, 0.05369865956589492, -0.10399309999947354, -0.02040370073191513, -0.12401091363473889, 0.0662969735624288, 0.2605034873184346, 0.04485288690968511, 0.11299103540366656, -0.3041674463497199, -0.11297925689516689, 0.10430472836273133, 0.17609036371205553, 0.026984339025417154, -0.0496049649995709, -0.2738583024436905, 0.13947173516602207, -0.20085850855633175, -0.10850063742402963, -0.013512578130198212, 0.01718505104375485, -0.022130219730102187, -0.30632568079256317, 0.09255710218691394, -0.04489331574526412, 0.03841643513024636, 0.04686932471724084, -0.22894666088778062, -0.08895335526525225, 0.020374462329479454, 0.07098564067676377, 0.1177235755769084, 0.15862217256813116, -0.16473965602616927, -0.15224501912167968, 0.36442169024107546, -0.04686924012118851, -0.13583404152824946, 0.17384641859873293, -0.2339366390176955, -0.16097605174693924, 0.19796321337034142, 0.22934577385646968, 0.11717581398493732, -0.1809711744003108, 0.1340218384153645, 0.020685861669701232, 0.13983736788446205, 0.024619144701657915, 0.055341678969810036, 0.18354528497755748, 0.1909743467698524, -0.03293426658203219, 0.03742339718431102, -0.14817988118962744, -0.08650117311227142, -0.42223282231117143, -0.11148950188371116, -0.07997561572739557, 0.07101992989708422, -0.11271790225632604, -0.06628738233827182, 0.30884335952474784, 0.08739727326068124, 0.30549246966618404, -0.03430517669560487, 0.30163755445856844, 0.10470300360022046, 0.08514417002229681, 0.05512432308286186, 0.2934393975553075, 0.16552783163903645, 0.15800326674096507, -0.19617119287801962, 0.053364764615210024, 0.058059880388735316] |
1,802.05086 | Non-Hermitian lattices with a flat band and polynomial power increase | In this work we first discuss systematically three general approaches to
construct a non-Hermitian flat band, defined by its dispersionless real part.
They resort to, respectively, spontaneous restoration of non-Hermitian
particle-hole symmetry, a persisting flat band from the underlying Hermitian
system, and a compact Wannier function that is an eigenstate of the entire
system. For the last approach in particular, we show the simplest lattice
structure where it can be applied, and we further identify a special case of
such a flat band where every point in the Brillouin zone is an exceptional
point of order 3. A localized excitation in this "EP3 flat band" can display
either a conserved power, quadratic power increase, or even quartic power
increase, depending on whether the localized eigenstate or one of the two
generalized eigenvectors is initially excited. Nevertheless, the asymptotic
wave function in the long time limit is always given by the eigenstate, and in
this case, the compact Wannier function or its superposition in two or more
unit cells.
| physics.optics cond-mat.mtrl-sci | in this work we first discuss systematically three general approaches to construct a nonhermitian flat band defined by its dispersionless real part they resort to respectively spontaneous restoration of nonhermitian particlehole symmetry a persisting flat band from the underlying hermitian system and a compact wannier function that is an eigenstate of the entire system for the last approach in particular we show the simplest lattice structure where it can be applied and we further identify a special case of such a flat band where every point in the brillouin zone is an exceptional point of order 3 a localized excitation in this ep3 flat band can display either a conserved power quadratic power increase or even quartic power increase depending on whether the localized eigenstate or one of the two generalized eigenvectors is initially excited nevertheless the asymptotic wave function in the long time limit is always given by the eigenstate and in this case the compact wannier function or its superposition in two or more unit cells | [['in', 'this', 'work', 'we', 'first', 'discuss', 'systematically', 'three', 'general', 'approaches', 'to', 'construct', 'a', 'nonhermitian', 'flat', 'band', 'defined', 'by', 'its', 'dispersionless', 'real', 'part', 'they', 'resort', 'to', 'respectively', 'spontaneous', 'restoration', 'of', 'nonhermitian', 'particlehole', 'symmetry', 'a', 'persisting', 'flat', 'band', 'from', 'the', 'underlying', 'hermitian', 'system', 'and', 'a', 'compact', 'wannier', 'function', 'that', 'is', 'an', 'eigenstate', 'of', 'the', 'entire', 'system', 'for', 'the', 'last', 'approach', 'in', 'particular', 'we', 'show', 'the', 'simplest', 'lattice', 'structure', 'where', 'it', 'can', 'be', 'applied', 'and', 'we', 'further', 'identify', 'a', 'special', 'case', 'of', 'such', 'a', 'flat', 'band', 'where', 'every', 'point', 'in', 'the', 'brillouin', 'zone', 'is', 'an', 'exceptional', 'point', 'of', 'order', '3', 'a', 'localized', 'excitation', 'in', 'this', 'ep3', 'flat', 'band', 'can', 'display', 'either', 'a', 'conserved', 'power', 'quadratic', 'power', 'increase', 'or', 'even', 'quartic', 'power', 'increase', 'depending', 'on', 'whether', 'the', 'localized', 'eigenstate', 'or', 'one', 'of', 'the', 'two', 'generalized', 'eigenvectors', 'is', 'initially', 'excited', 'nevertheless', 'the', 'asymptotic', 'wave', 'function', 'in', 'the', 'long', 'time', 'limit', 'is', 'always', 'given', 'by', 'the', 'eigenstate', 'and', 'in', 'this', 'case', 'the', 'compact', 'wannier', 'function', 'or', 'its', 'superposition', 'in', 'two', 'or', 'more', 'unit', 'cells']] | [-0.15708503738763588, 0.12518055512104875, -0.04376903371857701, 0.06946129459469202, -0.04740034278836988, -0.14456309002569123, 0.053319401473605206, 0.38643873431941583, -0.2689503177746138, -0.20810913443399062, 0.1059478581335584, -0.26575942225671106, -0.17293444602650457, 0.13002586138567754, -0.0004372354355187521, 0.025071108499625034, 0.01901841307075561, 0.04642238510340186, -0.11372907124972526, -0.2092704473193624, 0.3508048724227895, 0.017120306373856562, 0.2564432398926112, 0.04751393958992724, 0.04069828622353574, 0.018587718288125915, 0.07529184103865798, -0.031423879166444145, -0.059286904107119925, 0.06651994879246645, 0.2574551091058224, 0.03503944715096926, 0.25637933417982867, -0.417721003506553, -0.18844460331768328, 0.13310784653627447, 0.1614625694097153, 0.11898573847290772, -0.0011395383623624053, -0.25728073449239935, 0.06048085094551511, -0.17634058659452767, -0.1928362901145149, -0.04044911470763119, 0.019632964209276474, -0.04481415111444048, -0.23944385430305765, 0.07748456384606903, 0.07663220695013435, 0.042239663241031976, -0.06715915137014929, -0.06393763260053847, -0.08239332696012709, 0.08366626633297918, 0.036473607806588655, 0.03387743395952774, 0.08906528785293977, -0.0866526601450806, -0.09892397950447741, 0.4033652313006487, -0.061047679008056764, -0.22757379196229435, 0.15269588241131887, -0.1649860575673215, -0.09802810343084968, 0.14586080458234174, 0.1388306357992059, 0.1293549895275473, -0.10523253676746251, 0.1271456744056888, -0.049027613286463226, 0.1738970281082965, 0.06987786806365918, 0.03450330695271814, 0.23215978139723165, 0.12624045691336505, 0.09915762727836236, 0.13824817519621102, -0.06563899617425964, -0.08816448798392057, -0.30305469948299496, -0.15454144415257143, -0.26144834715939524, 0.09490908849719355, -0.06313649835205329, -0.1942905915091701, 0.485839028349368, 0.06614213665514919, 0.20021026194029087, 0.016478817458153657, 0.23809186620859518, 0.19076873271288128, 0.05689161678310484, 0.08695332135262322, 0.23991327113028438, 0.0683374453261162, 0.0557620110394921, -0.19876225122355945, -0.05147450111135619, 0.02826005452689493] |
1,802.05087 | Are Cold Dynamical Dark Energy Models Distinguishable in the Light of
the Data? | In this paper we obtain observational constraints on three dynamical cold
dark energy models ,include PL , CPL and FSL, with most recent cosmological
data and investigate their implication for structure formation, dark energy
clustering and abundance of CMB local peaks. From the joint analysis of the CMB
temperature power spectrum from observation of the Planck, SNIa light-curve,
baryon acoustic oscillation, $f\sigma_8$ for large scale structure observations
and the Hubble parameter, the PL model has the highest growth of matter
density, $ \Delta_{m} $, and matter power spectrum, $ P(k) $, compared to
$\Lambda$CDM and other models. For the CPL on the other hand, the structure
formation is considerably suppressed while the FSL has behavior similar to
standard model of cosmology. Studying the clustering of dark energy, $
\Delta_{DE}$, yields positive but small value with maximum of $
\Delta_{DE}\simeq10^{-3} $ at early time due to matter behaviour of the PL,
while for the CPL and FSL cross $ \Delta_{DE}=0 $ several time which
demonstrate void of dark energy with $ \Delta_{DE}\simeq-10^{-11} $ in certain
periods of the history of dark energy evolution. Among these three models, the
PL model demonstrate that is more compatible with $ f\sigma_{8} $ data. We also
investigated a certain geometrical measure, namely the abundance of local
maxima as a function of threshold for three DDE models and find that the method
is potentially capable to discriminate between the models, especially far from
mean threshold. The contribution of PL and CPL for late ISW are significant
compared to cosmological constant and FSL model. The tension in the Hubble
parameters is almost alleviated in the PL model.
| astro-ph.CO | in this paper we obtain observational constraints on three dynamical cold dark energy models include pl cpl and fsl with most recent cosmological data and investigate their implication for structure formation dark energy clustering and abundance of cmb local peaks from the joint analysis of the cmb temperature power spectrum from observation of the planck snia lightcurve baryon acoustic oscillation fsigma_8 for large scale structure observations and the hubble parameter the pl model has the highest growth of matter density delta_m and matter power spectrum pk compared to lambdacdm and other models for the cpl on the other hand the structure formation is considerably suppressed while the fsl has behavior similar to standard model of cosmology studying the clustering of dark energy delta_de yields positive but small value with maximum of delta_desimeq103 at early time due to matter behaviour of the pl while for the cpl and fsl cross delta_de0 several time which demonstrate void of dark energy with delta_desimeq1011 in certain periods of the history of dark energy evolution among these three models the pl model demonstrate that is more compatible with fsigma_8 data we also investigated a certain geometrical measure namely the abundance of local maxima as a function of threshold for three dde models and find that the method is potentially capable to discriminate between the models especially far from mean threshold the contribution of pl and cpl for late isw are significant compared to cosmological constant and fsl model the tension in the hubble parameters is almost alleviated in the pl model | [['in', 'this', 'paper', 'we', 'obtain', 'observational', 'constraints', 'on', 'three', 'dynamical', 'cold', 'dark', 'energy', 'models', 'include', 'pl', 'cpl', 'and', 'fsl', 'with', 'most', 'recent', 'cosmological', 'data', 'and', 'investigate', 'their', 'implication', 'for', 'structure', 'formation', 'dark', 'energy', 'clustering', 'and', 'abundance', 'of', 'cmb', 'local', 'peaks', 'from', 'the', 'joint', 'analysis', 'of', 'the', 'cmb', 'temperature', 'power', 'spectrum', 'from', 'observation', 'of', 'the', 'planck', 'snia', 'lightcurve', 'baryon', 'acoustic', 'oscillation', 'fsigma_8', 'for', 'large', 'scale', 'structure', 'observations', 'and', 'the', 'hubble', 'parameter', 'the', 'pl', 'model', 'has', 'the', 'highest', 'growth', 'of', 'matter', 'density', 'delta_m', 'and', 'matter', 'power', 'spectrum', 'pk', 'compared', 'to', 'lambdacdm', 'and', 'other', 'models', 'for', 'the', 'cpl', 'on', 'the', 'other', 'hand', 'the', 'structure', 'formation', 'is', 'considerably', 'suppressed', 'while', 'the', 'fsl', 'has', 'behavior', 'similar', 'to', 'standard', 'model', 'of', 'cosmology', 'studying', 'the', 'clustering', 'of', 'dark', 'energy', 'delta_de', 'yields', 'positive', 'but', 'small', 'value', 'with', 'maximum', 'of', 'delta_desimeq103', 'at', 'early', 'time', 'due', 'to', 'matter', 'behaviour', 'of', 'the', 'pl', 'while', 'for', 'the', 'cpl', 'and', 'fsl', 'cross', 'delta_de0', 'several', 'time', 'which', 'demonstrate', 'void', 'of', 'dark', 'energy', 'with', 'delta_desimeq1011', 'in', 'certain', 'periods', 'of', 'the', 'history', 'of', 'dark', 'energy', 'evolution', 'among', 'these', 'three', 'models', 'the', 'pl', 'model', 'demonstrate', 'that', 'is', 'more', 'compatible', 'with', 'fsigma_8', 'data', 'we', 'also', 'investigated', 'a', 'certain', 'geometrical', 'measure', 'namely', 'the', 'abundance', 'of', 'local', 'maxima', 'as', 'a', 'function', 'of', 'threshold', 'for', 'three', 'dde', 'models', 'and', 'find', 'that', 'the', 'method', 'is', 'potentially', 'capable', 'to', 'discriminate', 'between', 'the', 'models', 'especially', 'far', 'from', 'mean', 'threshold', 'the', 'contribution', 'of', 'pl', 'and', 'cpl', 'for', 'late', 'isw', 'are', 'significant', 'compared', 'to', 'cosmological', 'constant', 'and', 'fsl', 'model', 'the', 'tension', 'in', 'the', 'hubble', 'parameters', 'is', 'almost', 'alleviated', 'in', 'the', 'pl', 'model']] | [-0.06877987266089325, 0.08996302050284365, -0.12831482194040134, 0.11187504769510888, -0.09050471480133329, -0.12804594883840648, -0.010754005039725525, 0.33823567444988684, -0.259384910791851, -0.3643211447983509, 0.04431386349222111, -0.292372500178475, -0.044658006271973194, 0.2128537216255066, 0.03785180584380307, 0.0385066674384491, 0.007125202776208932, 0.011159184405381382, -0.028856607109838325, -0.249555765896881, 0.3260853461932258, 0.12432240730836222, 0.28173080840807874, 0.009226773379613524, 0.06866537089820347, -0.07220674701874318, -0.0792082107557801, 0.015740919589955847, -0.18997649086314655, 0.07588530384858135, 0.17868893196864807, 0.1324756194707632, 0.18180216415766848, -0.37394630470453016, -0.2676744105610923, 0.17154597734163696, 0.11701672152420985, 0.10424396353672542, -0.055166384102438445, -0.2357141089850205, 0.05640228815457743, -0.15129844262080613, -0.06910629957749162, -0.036255331415491615, 0.001118368864898743, 0.010573010757085112, -0.2278101128945219, 0.19624549612159503, -0.017075553207530313, -0.016335116277850073, -0.11690252895739386, -0.13611387126810348, -0.06890765223146546, 0.01809690657380983, 0.08458049458188369, 0.004306477453585405, 0.11677729163738519, -0.19112096052674812, -0.05340310968937198, 0.40973564781425265, -0.14152763489626435, -0.07211957800776327, 0.14998858331301407, -0.17160048633961103, -0.14780792989768088, 0.0675723444957566, 0.12800290750656204, 0.04015265070564544, -0.12026536196958929, 0.12232306064152539, 0.04285672125029249, 0.21822679851557544, 0.06475821038958407, 0.03002250368298278, 0.2636418203996281, 0.18589766720574893, 0.06328969688445565, 0.04181310339700136, -0.12122974355922268, -0.06657805976093463, -0.27103530783427093, -0.0874674722063171, -0.13703689713899797, 0.018815297292446048, -0.16162379288053408, -0.1329693209781153, 0.41052382012733474, 0.10479342825747584, 0.26154786975053046, 0.10011254236692924, 0.3286745176345051, 0.0765422633897399, 0.054223890777533736, 0.038819696578443814, 0.2996402983903414, 0.10581098413444584, 0.09919520302789779, -0.2642278090504039, 0.0390228167431164, -0.03822608165564421] |
1,802.05088 | Investigating the relation between sunspots and umbral dots | Umbral dots (UDs) are transient, bright features observed in the umbral
region of a sunspot. We study the physical properties of UDs observed in
sunspots of different sizes. The aim of our study is to relate the physical
properties of umbral dots with the large-scale properties of sunspots. For this
purpose, we analyze high-resolution G-band images of 42 sunspots observed by
{\em Hinode}/SOT, located close to disk center. The images were corrected for
instrumental stray-light and restored with the modeled PSF. An automated
multi-level tracking algorithm was employed to identify the UDs located in
selected G-band images. Furthermore, we employed HMI/SDO, limb-darkening
corrected, full disk continuum images to estimate the sunspot phase and epoch
for the selected sunspots. The number of UDs identified in different umbrae
exhibits a linear relation with the umbral size. The observed filling factor
ranges from 3\% to 7\% and increases with the mean umbral intensity. Moreover,
the filling factor shows a decreasing trend with the umbral size. We also found
that the observed mean and maximum intensities of UDs are correlated with the
mean umbral intensity. However, we do not find any significant relationship
between the mean (and maximum) intensity and effective diameter of umbral dots
with the sunspot area, epoch, and decay rate. We suggest that this lack of
relation could either be due to the distinct transition of spatial scales
associated with overturning convection in the umbra or the shallow depth
associated with umbral dots, or both the above.
| astro-ph.SR | umbral dots uds are transient bright features observed in the umbral region of a sunspot we study the physical properties of uds observed in sunspots of different sizes the aim of our study is to relate the physical properties of umbral dots with the largescale properties of sunspots for this purpose we analyze highresolution gband images of 42 sunspots observed by em hinodesot located close to disk center the images were corrected for instrumental straylight and restored with the modeled psf an automated multilevel tracking algorithm was employed to identify the uds located in selected gband images furthermore we employed hmisdo limbdarkening corrected full disk continuum images to estimate the sunspot phase and epoch for the selected sunspots the number of uds identified in different umbrae exhibits a linear relation with the umbral size the observed filling factor ranges from 3 to 7 and increases with the mean umbral intensity moreover the filling factor shows a decreasing trend with the umbral size we also found that the observed mean and maximum intensities of uds are correlated with the mean umbral intensity however we do not find any significant relationship between the mean and maximum intensity and effective diameter of umbral dots with the sunspot area epoch and decay rate we suggest that this lack of relation could either be due to the distinct transition of spatial scales associated with overturning convection in the umbra or the shallow depth associated with umbral dots or both the above | [['umbral', 'dots', 'uds', 'are', 'transient', 'bright', 'features', 'observed', 'in', 'the', 'umbral', 'region', 'of', 'a', 'sunspot', 'we', 'study', 'the', 'physical', 'properties', 'of', 'uds', 'observed', 'in', 'sunspots', 'of', 'different', 'sizes', 'the', 'aim', 'of', 'our', 'study', 'is', 'to', 'relate', 'the', 'physical', 'properties', 'of', 'umbral', 'dots', 'with', 'the', 'largescale', 'properties', 'of', 'sunspots', 'for', 'this', 'purpose', 'we', 'analyze', 'highresolution', 'gband', 'images', 'of', '42', 'sunspots', 'observed', 'by', 'em', 'hinodesot', 'located', 'close', 'to', 'disk', 'center', 'the', 'images', 'were', 'corrected', 'for', 'instrumental', 'straylight', 'and', 'restored', 'with', 'the', 'modeled', 'psf', 'an', 'automated', 'multilevel', 'tracking', 'algorithm', 'was', 'employed', 'to', 'identify', 'the', 'uds', 'located', 'in', 'selected', 'gband', 'images', 'furthermore', 'we', 'employed', 'hmisdo', 'limbdarkening', 'corrected', 'full', 'disk', 'continuum', 'images', 'to', 'estimate', 'the', 'sunspot', 'phase', 'and', 'epoch', 'for', 'the', 'selected', 'sunspots', 'the', 'number', 'of', 'uds', 'identified', 'in', 'different', 'umbrae', 'exhibits', 'a', 'linear', 'relation', 'with', 'the', 'umbral', 'size', 'the', 'observed', 'filling', 'factor', 'ranges', 'from', '3', 'to', '7', 'and', 'increases', 'with', 'the', 'mean', 'umbral', 'intensity', 'moreover', 'the', 'filling', 'factor', 'shows', 'a', 'decreasing', 'trend', 'with', 'the', 'umbral', 'size', 'we', 'also', 'found', 'that', 'the', 'observed', 'mean', 'and', 'maximum', 'intensities', 'of', 'uds', 'are', 'correlated', 'with', 'the', 'mean', 'umbral', 'intensity', 'however', 'we', 'do', 'not', 'find', 'any', 'significant', 'relationship', 'between', 'the', 'mean', 'and', 'maximum', 'intensity', 'and', 'effective', 'diameter', 'of', 'umbral', 'dots', 'with', 'the', 'sunspot', 'area', 'epoch', 'and', 'decay', 'rate', 'we', 'suggest', 'that', 'this', 'lack', 'of', 'relation', 'could', 'either', 'be', 'due', 'to', 'the', 'distinct', 'transition', 'of', 'spatial', 'scales', 'associated', 'with', 'overturning', 'convection', 'in', 'the', 'umbra', 'or', 'the', 'shallow', 'depth', 'associated', 'with', 'umbral', 'dots', 'or', 'both', 'the', 'above']] | [-0.07454454683797146, 0.1614646260467253, -0.04219372807793713, 0.12675133988600057, -0.03661346980143429, -0.060325749748484876, 0.010954378716973209, 0.45221476070582867, -0.2393966253650019, -0.3793280878590753, 0.0674921939858402, -0.2886210720561638, -0.12325851222224783, 0.17250993462304048, -0.06079517872504818, 0.009808255640867477, 0.05151893895751668, 0.003762749990550574, -0.02184599606183971, -0.20255034878126882, 0.2462092900565424, 0.0434561722781282, 0.25137892765621467, -0.002817526456736202, 0.03122798461709323, -0.07763641572947984, -0.09717366061120378, 0.06776345515343535, -0.14598715261631215, 0.09613600194433371, 0.20267403196937184, 0.07854100067227156, 0.2354195321251343, -0.4361627649523439, -0.17361205305555852, 0.0400991550906054, 0.17877021043398608, 0.028100127734743605, -0.01116009564441818, -0.287744667636594, 0.08885119992523166, -0.025209657605586012, -0.13197109516808475, 0.09066534851397562, 0.04233339066026596, 0.06743144554727734, -0.2246521895228908, 0.1133202135894633, 0.005888314819251134, 0.16387608446317112, -0.04944272478663824, -0.117317916399504, -0.04246334186698333, 0.16286186195817223, 0.03912197892711217, 0.0161625179930044, 0.15471735448818805, -0.14798089525117197, -0.05327225142116923, 0.3296512550280649, -0.08140575995846705, -0.03355650681002838, 0.12365381976559274, -0.24204910281625372, -0.10342023779822199, 0.18074032224760186, 0.1441475129515932, 0.07582827619791818, -0.0678324975618502, -0.00028708561231775923, -0.05685885715425181, 0.20580934803190876, 0.08455345991003228, 0.037104639870197915, 0.24013574647800467, 0.07704888822934855, 0.02813209609291327, 0.14240906687739222, -0.30313287717072535, -0.08820764891182382, -0.28366960339036174, -0.10886127897348952, -0.11649148627392554, 0.030689205557008072, -0.11550382916145717, -0.18966508678887495, 0.4198704239215732, 0.15874257341133263, 0.20177479448152813, 0.053672547390631486, 0.24115635236778213, 0.13024377717463323, 0.14381132626951468, 0.11293174502273219, 0.2631445270281558, 0.21258898767097512, 0.13958659094315384, -0.2484140466710333, 0.010898266818631834, 0.0051715877948222844] |
1,802.05089 | Gravitational lensing of gravitational waves: A statistical perspective | In this paper, we study the strong gravitational lensing of gravitational
waves (GWs) from a statistical perspective, with particular focus on the high
frequency GWs from stellar binary black hole coalescences. These are most
promising targets for ground-based detectors such as Advanced Laser
Interferometer Gravitational Wave Observatory (aLIGO) and the proposed Einstein
Telescope (ET) and can be safely treated under the geometrical optics limit for
GW propagation. We perform a thorough calculation of the lensing rate, by
taking account of effects caused by the ellipticity of lensing galaxies, lens
environments, and magnification bias. We find that in certain GW source rate
scenarios, we should be able to observe strongly lensed GW events once per year
($\sim1~\text{yr}^{-1}$) in the aLIGO survey at its design sensitivity; for the
proposed ET survey, the rate could be as high as $\sim80~\text{yr}^{-1}$. These
results depend on the estimate of GW source abundance, and hence can be
correspondingly modified with an improvement in our understanding of the merger
rate of stellar binary black holes. We also compute the fraction of four-image
lens systems in each survey, predicting it to be $\sim30$ per cent for the
aLIGO survey and $\sim6$ per cent for the ET survey. Finally, we evaluate the
possibility of missing some images due to the finite survey duration, by
presenting the probability distribution of lensing time delays. We predict that
this selection bias will be insignificant in future GW surveys, as most of the
lens systems ($\sim90$ per cent) will have time delays less than $\sim1$ month,
which will be far shorter than survey durations.
| astro-ph.CO gr-qc | in this paper we study the strong gravitational lensing of gravitational waves gws from a statistical perspective with particular focus on the high frequency gws from stellar binary black hole coalescences these are most promising targets for groundbased detectors such as advanced laser interferometer gravitational wave observatory aligo and the proposed einstein telescope et and can be safely treated under the geometrical optics limit for gw propagation we perform a thorough calculation of the lensing rate by taking account of effects caused by the ellipticity of lensing galaxies lens environments and magnification bias we find that in certain gw source rate scenarios we should be able to observe strongly lensed gw events once per year sim1textyr1 in the aligo survey at its design sensitivity for the proposed et survey the rate could be as high as sim80textyr1 these results depend on the estimate of gw source abundance and hence can be correspondingly modified with an improvement in our understanding of the merger rate of stellar binary black holes we also compute the fraction of fourimage lens systems in each survey predicting it to be sim30 per cent for the aligo survey and sim6 per cent for the et survey finally we evaluate the possibility of missing some images due to the finite survey duration by presenting the probability distribution of lensing time delays we predict that this selection bias will be insignificant in future gw surveys as most of the lens systems sim90 per cent will have time delays less than sim1 month which will be far shorter than survey durations | [['in', 'this', 'paper', 'we', 'study', 'the', 'strong', 'gravitational', 'lensing', 'of', 'gravitational', 'waves', 'gws', 'from', 'a', 'statistical', 'perspective', 'with', 'particular', 'focus', 'on', 'the', 'high', 'frequency', 'gws', 'from', 'stellar', 'binary', 'black', 'hole', 'coalescences', 'these', 'are', 'most', 'promising', 'targets', 'for', 'groundbased', 'detectors', 'such', 'as', 'advanced', 'laser', 'interferometer', 'gravitational', 'wave', 'observatory', 'aligo', 'and', 'the', 'proposed', 'einstein', 'telescope', 'et', 'and', 'can', 'be', 'safely', 'treated', 'under', 'the', 'geometrical', 'optics', 'limit', 'for', 'gw', 'propagation', 'we', 'perform', 'a', 'thorough', 'calculation', 'of', 'the', 'lensing', 'rate', 'by', 'taking', 'account', 'of', 'effects', 'caused', 'by', 'the', 'ellipticity', 'of', 'lensing', 'galaxies', 'lens', 'environments', 'and', 'magnification', 'bias', 'we', 'find', 'that', 'in', 'certain', 'gw', 'source', 'rate', 'scenarios', 'we', 'should', 'be', 'able', 'to', 'observe', 'strongly', 'lensed', 'gw', 'events', 'once', 'per', 'year', 'sim1textyr1', 'in', 'the', 'aligo', 'survey', 'at', 'its', 'design', 'sensitivity', 'for', 'the', 'proposed', 'et', 'survey', 'the', 'rate', 'could', 'be', 'as', 'high', 'as', 'sim80textyr1', 'these', 'results', 'depend', 'on', 'the', 'estimate', 'of', 'gw', 'source', 'abundance', 'and', 'hence', 'can', 'be', 'correspondingly', 'modified', 'with', 'an', 'improvement', 'in', 'our', 'understanding', 'of', 'the', 'merger', 'rate', 'of', 'stellar', 'binary', 'black', 'holes', 'we', 'also', 'compute', 'the', 'fraction', 'of', 'fourimage', 'lens', 'systems', 'in', 'each', 'survey', 'predicting', 'it', 'to', 'be', 'sim30', 'per', 'cent', 'for', 'the', 'aligo', 'survey', 'and', 'sim6', 'per', 'cent', 'for', 'the', 'et', 'survey', 'finally', 'we', 'evaluate', 'the', 'possibility', 'of', 'missing', 'some', 'images', 'due', 'to', 'the', 'finite', 'survey', 'duration', 'by', 'presenting', 'the', 'probability', 'distribution', 'of', 'lensing', 'time', 'delays', 'we', 'predict', 'that', 'this', 'selection', 'bias', 'will', 'be', 'insignificant', 'in', 'future', 'gw', 'surveys', 'as', 'most', 'of', 'the', 'lens', 'systems', 'sim90', 'per', 'cent', 'will', 'have', 'time', 'delays', 'less', 'than', 'sim1', 'month', 'which', 'will', 'be', 'far', 'shorter', 'than', 'survey', 'durations']] | [-0.12015061854550248, 0.09533158019163716, -0.04756104457641603, 0.11752868521554956, -0.11220556474425632, -0.05159151485966497, 0.04312702968606948, 0.37019843022019017, -0.1765397008280108, -0.36323214920136976, 0.09216644292388068, -0.31677312036961836, -0.11231716304705532, 0.27205162861071613, -0.027797232445825652, 0.01712647546105209, 0.11005182635276417, -0.05269949052044151, -0.0730230475876581, -0.31890164584939057, 0.2709417871728137, 0.18593402958967684, 0.17098183167332417, -0.016820572707918924, 0.08234217989485006, 0.0036048024306685076, -0.07987536413911514, 0.009750575071711337, -0.13172918463477093, 0.008248680632140732, 0.28020770341233425, 0.19034378305005636, 0.2579354454374883, -0.38549644765749747, -0.23488378761026965, 0.09863812446191504, 0.1337198643058783, 0.136560987882068, -0.054510592584566545, -0.33738351976193315, 0.10714070264337239, -0.22772935175251047, -0.11195989089216102, 0.03134516894486535, 0.02243417047755703, 0.0808098278445296, -0.1767563933909342, 0.12297709507255952, -0.010159145057215768, -0.018503178202306212, -0.08600850697403636, -0.07670588617017098, -0.0023371204981062575, 0.07596469069849053, 0.01903199602968444, 0.09317437498866217, 0.15249830765854638, -0.1361939723894859, -0.06521181358585429, 0.4030591752308216, -0.0962299878607211, -0.08796822312234048, 0.13925267772346334, -0.22725385771270995, -0.16624224584362682, 0.13113188277615384, 0.2401113716560024, 0.1318282807887708, -0.16126109275231534, -0.02203425471819254, 0.06912736892597938, 0.25793966176222044, 0.12441342855573535, 0.10196844667590019, 0.3502528322177389, 0.13656848818728967, 0.07974998576118895, 0.08742829266590386, -0.23378617667977816, 0.012789985515594368, -0.27659744999468555, -0.08466015978229527, -0.14531231384443902, 0.1039040649983862, -0.11001658283908264, -0.08548902025856221, 0.3550375016122107, 0.1899401222510285, 0.14244401665102388, 0.07657136227423145, 0.3042457886227447, 0.11950679093511221, 0.07118627210651096, 0.012970778901439203, 0.3719384851259796, 0.0767289863316824, 0.06737965102438746, -0.18262490032521225, 0.044530910521594656, -0.006814711455716015] |
1,802.0509 | Cognitive UAV Communication via Joint Trajectory and Power Control | This paper investigates a new spectrum sharing scenario between unmanned
aerial vehicle (UAV) and terrestrial wireless communication systems. We
consider that a cognitive/secondary UAV transmitter communicates with a ground
secondary receiver (SR), in the presence of a number of primary terrestrial
communication links that operate over the same frequency band. We exploit the
UAV's controllable mobility via trajectory design, to improve the cognitive UAV
communication performance while controlling the co-channel interference at each
of the primary receivers (PRs). In particular, we maximize the average
achievable rate from the UAV to the SR over a finite mission/communication
period by jointly optimizing the UAV trajectory and transmit power allocation,
subject to constraints on the UAV's maximum speed, initial/final locations, and
average transmit power, as well as a set of interference temperature (IT)
constraints imposed at each of the PRs for protecting their communications.
However, the joint trajectory and power optimization problem is non-convex and
thus difficult to be solved optimally. To tackle this problem, we propose an
efficient algorithm that ensures to obtain a locally optimal solution by
applying the techniques of alternating optimization and successive convex
approximation (SCA). Numerical results show that our proposed joint UAV
trajectory and power control scheme significantly enhances the achievable rate
of the cognitive UAV communication system, as compared to benchmark schemes.
| eess.SP | this paper investigates a new spectrum sharing scenario between unmanned aerial vehicle uav and terrestrial wireless communication systems we consider that a cognitivesecondary uav transmitter communicates with a ground secondary receiver sr in the presence of a number of primary terrestrial communication links that operate over the same frequency band we exploit the uavs controllable mobility via trajectory design to improve the cognitive uav communication performance while controlling the cochannel interference at each of the primary receivers prs in particular we maximize the average achievable rate from the uav to the sr over a finite missioncommunication period by jointly optimizing the uav trajectory and transmit power allocation subject to constraints on the uavs maximum speed initialfinal locations and average transmit power as well as a set of interference temperature it constraints imposed at each of the prs for protecting their communications however the joint trajectory and power optimization problem is nonconvex and thus difficult to be solved optimally to tackle this problem we propose an efficient algorithm that ensures to obtain a locally optimal solution by applying the techniques of alternating optimization and successive convex approximation sca numerical results show that our proposed joint uav trajectory and power control scheme significantly enhances the achievable rate of the cognitive uav communication system as compared to benchmark schemes | [['this', 'paper', 'investigates', 'a', 'new', 'spectrum', 'sharing', 'scenario', 'between', 'unmanned', 'aerial', 'vehicle', 'uav', 'and', 'terrestrial', 'wireless', 'communication', 'systems', 'we', 'consider', 'that', 'a', 'cognitivesecondary', 'uav', 'transmitter', 'communicates', 'with', 'a', 'ground', 'secondary', 'receiver', 'sr', 'in', 'the', 'presence', 'of', 'a', 'number', 'of', 'primary', 'terrestrial', 'communication', 'links', 'that', 'operate', 'over', 'the', 'same', 'frequency', 'band', 'we', 'exploit', 'the', 'uavs', 'controllable', 'mobility', 'via', 'trajectory', 'design', 'to', 'improve', 'the', 'cognitive', 'uav', 'communication', 'performance', 'while', 'controlling', 'the', 'cochannel', 'interference', 'at', 'each', 'of', 'the', 'primary', 'receivers', 'prs', 'in', 'particular', 'we', 'maximize', 'the', 'average', 'achievable', 'rate', 'from', 'the', 'uav', 'to', 'the', 'sr', 'over', 'a', 'finite', 'missioncommunication', 'period', 'by', 'jointly', 'optimizing', 'the', 'uav', 'trajectory', 'and', 'transmit', 'power', 'allocation', 'subject', 'to', 'constraints', 'on', 'the', 'uavs', 'maximum', 'speed', 'initialfinal', 'locations', 'and', 'average', 'transmit', 'power', 'as', 'well', 'as', 'a', 'set', 'of', 'interference', 'temperature', 'it', 'constraints', 'imposed', 'at', 'each', 'of', 'the', 'prs', 'for', 'protecting', 'their', 'communications', 'however', 'the', 'joint', 'trajectory', 'and', 'power', 'optimization', 'problem', 'is', 'nonconvex', 'and', 'thus', 'difficult', 'to', 'be', 'solved', 'optimally', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'an', 'efficient', 'algorithm', 'that', 'ensures', 'to', 'obtain', 'a', 'locally', 'optimal', 'solution', 'by', 'applying', 'the', 'techniques', 'of', 'alternating', 'optimization', 'and', 'successive', 'convex', 'approximation', 'sca', 'numerical', 'results', 'show', 'that', 'our', 'proposed', 'joint', 'uav', 'trajectory', 'and', 'power', 'control', 'scheme', 'significantly', 'enhances', 'the', 'achievable', 'rate', 'of', 'the', 'cognitive', 'uav', 'communication', 'system', 'as', 'compared', 'to', 'benchmark', 'schemes']] | [-0.259254617660054, 0.02009393544667716, -0.008908227319985838, -0.0059437015791266945, -0.07385605147160659, -0.24018962457166793, 0.13972781440645682, 0.3900213236006621, -0.319159790098876, -0.3184787247060128, 0.0752580517774587, -0.22571193555883506, -0.1795838923611304, 0.1754503415823505, -0.1571990508960438, 0.10172322238403782, 0.06050496782115269, 0.04453773695483769, -0.015522807647425694, -0.23573563013891646, 0.24603998951970765, 0.1418159474579565, 0.3475162823788961, 0.024793810309041465, 0.12970879460819867, 0.04528048186819722, 0.02791395529962654, -0.034565931216543805, -0.09664134601107689, 0.11408429146552825, 0.3378549220516982, 0.21931540018173856, 0.28598325834043814, -0.4179330329262765, -0.25801746618159327, 0.11018671795168769, 0.16492221198832424, 0.026025184383398254, -0.03477268676038518, -0.28286631153374214, 0.11518473569064393, -0.2245233611575824, -0.03500457870269142, 0.039486447392710455, -0.08133246120779175, 0.08218673487094875, -0.3500039170356903, -0.03009651607570508, -0.04721336697704794, 0.03897971062263839, -0.1079827775421474, -0.06982846413989265, 0.012073217789973263, 0.19857266486979255, 0.05776264077535543, 0.009407481715022195, 0.1313423827433606, -0.08248339602549638, -0.11565273413506365, 0.3982838738330454, 0.026288342915658153, -0.21251573504784327, 0.12891286578917197, -0.07056721283784398, -0.08230788966806205, 0.16888473420425656, 0.2764112471916199, 0.09936569449622358, -0.16097519926402595, 0.020501343649540045, 0.01004551338558477, 0.15766847720935454, 0.08590314951050748, 0.0801016336750831, 0.17850396785967784, 0.18612245748376596, 0.2538023497310911, 0.1155368765564766, -0.13128214670458338, -0.11918123829435279, -0.19109314038618425, -0.10518432167689447, -0.2269866724670473, -0.015738792188691897, -0.06684378749060185, -0.021494784657342933, 0.3833614199158427, 0.1422042402495395, 0.13210367206832238, 0.14328836157447963, 0.455009932638468, 0.1135871934266701, 0.00728874314647379, 0.14081318366665516, 0.21657990800895702, 0.058237696772334646, 0.1223601842251232, -0.2900248854100121, 0.047231284764412546, -0.0048353839034615] |
1,802.05091 | Why Did They #Unfollow Me? Early Detection of Follower Loss on Twitter | Having more followers has become a norm in recent social media and
micro-blogging communities. This battle has been taking shape from the early
days of Twitter. Despite this strong competition for followers, many Twitter
users are continuously losing their followers. This work addresses the problem
of identifying the reasons behind the drop of followers of users in Twitter. As
a first step, we extract various features by analyzing the content of the posts
made by the Twitter users who lose followers consistently. We then leverage
these features to early detect follower loss. We propose various models and
yield an overall accuracy of 73% with high precision and recall. Our model
outperforms baseline model by 19.67% (w.r.t accuracy), 33.8% (w.r.t precision)
and 14.3% (w.r.t recall).
| cs.SI | having more followers has become a norm in recent social media and microblogging communities this battle has been taking shape from the early days of twitter despite this strong competition for followers many twitter users are continuously losing their followers this work addresses the problem of identifying the reasons behind the drop of followers of users in twitter as a first step we extract various features by analyzing the content of the posts made by the twitter users who lose followers consistently we then leverage these features to early detect follower loss we propose various models and yield an overall accuracy of 73 with high precision and recall our model outperforms baseline model by 1967 wrt accuracy 338 wrt precision and 143 wrt recall | [['having', 'more', 'followers', 'has', 'become', 'a', 'norm', 'in', 'recent', 'social', 'media', 'and', 'microblogging', 'communities', 'this', 'battle', 'has', 'been', 'taking', 'shape', 'from', 'the', 'early', 'days', 'of', 'twitter', 'despite', 'this', 'strong', 'competition', 'for', 'followers', 'many', 'twitter', 'users', 'are', 'continuously', 'losing', 'their', 'followers', 'this', 'work', 'addresses', 'the', 'problem', 'of', 'identifying', 'the', 'reasons', 'behind', 'the', 'drop', 'of', 'followers', 'of', 'users', 'in', 'twitter', 'as', 'a', 'first', 'step', 'we', 'extract', 'various', 'features', 'by', 'analyzing', 'the', 'content', 'of', 'the', 'posts', 'made', 'by', 'the', 'twitter', 'users', 'who', 'lose', 'followers', 'consistently', 'we', 'then', 'leverage', 'these', 'features', 'to', 'early', 'detect', 'follower', 'loss', 'we', 'propose', 'various', 'models', 'and', 'yield', 'an', 'overall', 'accuracy', 'of', '73', 'with', 'high', 'precision', 'and', 'recall', 'our', 'model', 'outperforms', 'baseline', 'model', 'by', '1967', 'wrt', 'accuracy', '338', 'wrt', 'precision', 'and', '143', 'wrt', 'recall']] | [-0.07146951236368736, 0.02852259026833288, -0.08287314194908944, 0.0720011173651719, -0.12861346038463975, -0.15864453019493074, 0.10745614409942421, 0.4321565130319927, -0.2193661770865982, -0.3744517513400605, 0.06969690621988248, -0.4017012622883363, -0.16700637452642345, 0.11279595936350469, -0.11798684986218089, 0.004367550065170133, 0.09134375695289383, 0.08913883961166345, 0.01135296010292105, -0.3826977926693226, 0.2705735280704234, 0.09604133356497774, 0.300502558584295, 0.06909595254898793, 0.10998978127440016, -0.0174213707289328, -0.1038991064518585, 0.012889708369790066, -0.06875650126359335, 0.13377145293916035, 0.2957653620353613, 0.21041181491830596, 0.39225629311535626, -0.3795633674974764, -0.2040399092685191, 0.08758221847575999, 0.12783306501355143, 0.09238270616098758, -0.018781441281340273, -0.3852819702212488, 0.11360569740645587, -0.24251878586777997, -0.0580425540571131, -0.08784063658752148, 0.06676595293045524, 0.036908787059327285, -0.19660253185617377, 0.08073368585187822, 0.03370909587359957, 0.11300101922073912, -0.015945393404352567, -0.10171035013251728, 0.009803190451836395, 0.2356283645325851, 0.13348252209646988, -0.02115118313926242, 0.1389047803146945, -0.20242861336690463, -0.159934000097095, 0.40195789398445236, -0.04163752129909793, -0.0886076451504543, 0.18037118821314746, -0.05827186734700996, -0.11193335590313279, 0.07536149636331585, 0.25239308726703447, 0.08314881587132057, -0.1561564375541263, -0.039630336200653184, -0.06186518008865777, 0.20503047619751025, 0.12774745683606353, 0.009572791412562853, 0.19018102862596167, 0.19964278173715538, 0.0594649128611162, 0.07582656106340789, -0.05342197500266916, -0.0650223673156072, -0.15304899030935862, -0.10129376953878935, -0.12910318291265396, 0.0305703078742109, -0.11521845194088641, -0.06957340992296175, 0.43121694067057464, 0.17175242539885785, 0.1838137354502725, 0.09207802938087092, 0.26927373268934446, 0.007977553158848277, 0.02244618673801362, 0.12414423544185176, 0.22312030451928055, 0.005050383483795749, 0.20338745527870714, -0.16092969662877882, 0.15190903197376868, -0.006335131065439313] |
1,802.05092 | Linguistic unit discovery from multi-modal inputs in unwritten
languages: Summary of the "Speaking Rosetta" JSALT 2017 Workshop | We summarize the accomplishments of a multi-disciplinary workshop exploring
the computational and scientific issues surrounding the discovery of linguistic
units (subwords and words) in a language without orthography. We study the
replacement of orthographic transcriptions by images and/or translated text in
a well-resourced language to help unsupervised discovery from raw speech.
| cs.CL | we summarize the accomplishments of a multidisciplinary workshop exploring the computational and scientific issues surrounding the discovery of linguistic units subwords and words in a language without orthography we study the replacement of orthographic transcriptions by images andor translated text in a wellresourced language to help unsupervised discovery from raw speech | [['we', 'summarize', 'the', 'accomplishments', 'of', 'a', 'multidisciplinary', 'workshop', 'exploring', 'the', 'computational', 'and', 'scientific', 'issues', 'surrounding', 'the', 'discovery', 'of', 'linguistic', 'units', 'subwords', 'and', 'words', 'in', 'a', 'language', 'without', 'orthography', 'we', 'study', 'the', 'replacement', 'of', 'orthographic', 'transcriptions', 'by', 'images', 'andor', 'translated', 'text', 'in', 'a', 'wellresourced', 'language', 'to', 'help', 'unsupervised', 'discovery', 'from', 'raw', 'speech']] | [-0.03911254911993941, 0.04897022312141809, -0.02520911461290191, 0.07407938541077516, -0.22510276508389734, -0.09343739362506598, 0.11037625620762508, 0.3585810789874956, -0.3011967239937946, -0.3634840323299845, 0.06272404706196896, -0.3577467161687274, -0.13967755436897278, 0.16039399002957175, -0.1713733288240345, -0.010351423822416394, 0.14494402275658122, 0.06936385391243532, -0.062918160749855, -0.2391207881463582, 0.26573231320499496, 0.02017295568743173, 0.3194411979148201, 0.009540309764298737, 0.1011314302792444, -0.0389596816134073, -0.15975939651823365, -0.09072311290119793, -0.048520382110248596, 0.2525189773855256, 0.4154764995271084, 0.28822294729487863, 0.3296284272572866, -0.4305553119264397, -0.16943168223780744, 0.02558662842356545, 0.12034231129412849, 0.09559981047869752, -0.0652960489604476, -0.42161301373704974, 0.04681997139956437, -0.15482340035412243, 0.06667951796678644, -0.06862107434255235, -0.0058799382440709305, -0.018405222340815645, -0.16116371521653206, -0.018812427644197847, 0.15029450636539682, 0.20876845816497272, -0.03865961417300152, -0.1315710567230103, 0.07353187222764188, 0.1643190401889168, 0.08204330149901044, 0.0832019299588294, 0.11620049857917954, -0.24738228108332144, -0.15092294300705486, 0.42839854528360505, -0.06772351020253171, -0.17734596416281134, 0.18746072490352625, -0.06858437354950343, -0.20246846260795115, 0.03262972404413363, 0.24969780043351883, 0.02331694084511814, -0.20703347502093689, 0.07480294115078982, 0.016885240909223463, 0.24040485752344715, 0.14755647291666737, -0.0036374761850810518, 0.25676472973210884, 0.25104312105652166, -0.13582189527212404, 0.15202532614143016, -0.06132424840082725, -0.0004229408816671839, -0.21755073882420273, -0.17758747918860002, -0.1361146751499059, -0.02754381509936031, -0.05886171002103034, -0.13052716628447467, 0.41538710733327794, 0.2208440301611143, 0.1660971197427488, 0.061654783091416546, 0.2727795001849824, -0.07162810891738855, 0.12727666357714756, 0.020716377406143675, 0.05670621425059496, -0.007542192675721119, 0.1897349271777214, -0.13927942311263405, 0.10037267786067199, 0.054795746774699165] |
1,802.05093 | X-ray flare oscillations track plasma sloshing along star-disk magnetic
tubes in Orion star-forming region | Pulsing X-ray emission tracks the plasma echo traveling in an extremely long
magnetic tube that flares in an Orion Pre-Main Sequence (PMS) star. On the Sun,
flares last from minutes to a few hours and the longest-lasting typically
involve arcades of closed magnetic tubes. Long-lasting X-ray flares are
observed in PMS stars. Large-amplitude (~20%) long-period (~3 hours) pulsations
are detected in the light curve of day-long flares observed by the Advanced CCD
Imaging Spectrometer (ACIS) on-board Chandra from PMS stars in the Orion
cluster. Detailed hydrodynamic modeling of two flares observed on V772 Ori and
OW Ori shows that these pulsations may track the sloshing of plasma along a
single long magnetic tube, triggered by a sufficiently short (~1 hour) heat
pulse. This magnetic tubes are as long (>= 20 solar radii) as to connect the
star with the surrounding disk.
| astro-ph.SR | pulsing xray emission tracks the plasma echo traveling in an extremely long magnetic tube that flares in an orion premain sequence pms star on the sun flares last from minutes to a few hours and the longestlasting typically involve arcades of closed magnetic tubes longlasting xray flares are observed in pms stars largeamplitude 20 longperiod 3 hours pulsations are detected in the light curve of daylong flares observed by the advanced ccd imaging spectrometer acis onboard chandra from pms stars in the orion cluster detailed hydrodynamic modeling of two flares observed on v772 ori and ow ori shows that these pulsations may track the sloshing of plasma along a single long magnetic tube triggered by a sufficiently short 1 hour heat pulse this magnetic tubes are as long 20 solar radii as to connect the star with the surrounding disk | [['pulsing', 'xray', 'emission', 'tracks', 'the', 'plasma', 'echo', 'traveling', 'in', 'an', 'extremely', 'long', 'magnetic', 'tube', 'that', 'flares', 'in', 'an', 'orion', 'premain', 'sequence', 'pms', 'star', 'on', 'the', 'sun', 'flares', 'last', 'from', 'minutes', 'to', 'a', 'few', 'hours', 'and', 'the', 'longestlasting', 'typically', 'involve', 'arcades', 'of', 'closed', 'magnetic', 'tubes', 'longlasting', 'xray', 'flares', 'are', 'observed', 'in', 'pms', 'stars', 'largeamplitude', '20', 'longperiod', '3', 'hours', 'pulsations', 'are', 'detected', 'in', 'the', 'light', 'curve', 'of', 'daylong', 'flares', 'observed', 'by', 'the', 'advanced', 'ccd', 'imaging', 'spectrometer', 'acis', 'onboard', 'chandra', 'from', 'pms', 'stars', 'in', 'the', 'orion', 'cluster', 'detailed', 'hydrodynamic', 'modeling', 'of', 'two', 'flares', 'observed', 'on', 'v772', 'ori', 'and', 'ow', 'ori', 'shows', 'that', 'these', 'pulsations', 'may', 'track', 'the', 'sloshing', 'of', 'plasma', 'along', 'a', 'single', 'long', 'magnetic', 'tube', 'triggered', 'by', 'a', 'sufficiently', 'short', '1', 'hour', 'heat', 'pulse', 'this', 'magnetic', 'tubes', 'are', 'as', 'long', '20', 'solar', 'radii', 'as', 'to', 'connect', 'the', 'star', 'with', 'the', 'surrounding', 'disk']] | [-0.10984024743837632, 0.27475066274499166, -0.027801981778407515, 0.12842558721237876, -0.11796874155310526, -0.057963367420912, 0.016830079155310772, 0.5090821504043482, -0.16776933057381094, -0.3872417607177183, 0.06654488719353224, -0.2673416317709047, -0.012155467751536439, 0.2548819926882283, -0.07801480662988887, -0.00957923185787157, 0.21419191515247385, -0.04607300020807938, 0.007013201830814854, -0.20582683247735176, 0.1780745374313522, 0.03732949780889036, 0.08002438568409613, -0.08061509948180279, 0.05508490506787416, -0.1254601149062673, -0.027655506097852327, -0.08602712849463276, -0.08650495399829426, -0.024206905900467215, 0.18903698660969306, 0.08353382561074423, 0.21655757376830354, -0.4850018275834674, -0.2826899942278648, -0.04276642843364008, 0.21651269174214427, -0.10007529061207239, -0.004655147877541913, -0.28268607866300416, 0.06519104567651214, -0.15319383183658364, -0.14386446789751273, 0.09747564213739025, 0.10153048986354642, 0.09563875397359081, -0.18220017808187994, 0.0892223016812848, 0.022696836988053037, 0.16568209922356572, -0.1845687088362283, -0.023818432008378583, 0.0033566463544375176, 0.06893997449133037, 0.10324631547496702, 0.1600487797400452, 0.18788761476711405, -0.12270482242100691, -0.07462071126708827, 0.29885179750125507, -0.07365964684072587, 0.11191638026440101, 0.19175647540862184, -0.25405819352260595, -0.20303185296868034, 0.2542083975088468, 0.09819590170505932, 0.1565807100733836, -0.1841044289515548, -0.09726387148190344, 0.009205007811726855, 0.24198372341129634, 0.107781582224692, 0.03784951116058895, 0.35627930697636584, 0.16881417544565344, -0.027215361481251046, 0.14291115432790072, -0.3531243120346942, -0.02996099375777965, -0.24479697335833053, -0.06715610744465116, -0.08529378963373066, 0.12033235484218265, -0.09579612634780402, -0.20451710449545074, 0.39648406161330374, 0.05306525823656845, 0.15117502442339983, -0.07104346924042665, 0.30217471119793626, 0.051755899883364494, 0.1072647689151571, 0.16986227637197046, 0.3126631843716764, 0.22318428077755106, 0.22175985550601707, -0.2519121067765966, 0.02685856275769661, 0.016419591420671814] |
1,802.05094 | A mathematical study of CD8+ T cell responses calibrated with human data | Complete understanding of the mechanisms regulating the proliferation and
differentiation that takes place during human immune CD8+ T cell responses is
still lacking. Human clinical data is usually limited to blood cell counts, yet
the initiation of these responses occurs in the draining lymph nodes;
antigen-specific effector and memory CD8+ T cells generated in the lymph nodes
migrate to those tissues where they are required. We use approximate Bayesian
computation with deterministic mathematical models of CD8+ T cell populations
(naive, central memory, effector memory and effector) and yellow fever virus
vaccine data to infer the dynamics of these CD8+ T cell populations in three
spatial compartments: draining lymph nodes, circulation and skin. We have made
use of the literature to obtain rates of division and death for human CD8+ T
cell population subsets and thymic export rates. Under the decreasing potential
hypothesis for differentiation during an immune response, we find that, as the
number of T cell clonotypes driven to an immune response increases, there is a
reduction in the number of divisions required to differentiate from a naive to
an effector CD8+ T cell, supporting the "division of labour" hypothesis
observed in murine studies. We have also considered the reverse differentiation
scenario, the increasing potential hypothesis. The decreasing potential model
is better supported by the yellow fever virus vaccine data.
| q-bio.CB q-bio.QM | complete understanding of the mechanisms regulating the proliferation and differentiation that takes place during human immune cd8 t cell responses is still lacking human clinical data is usually limited to blood cell counts yet the initiation of these responses occurs in the draining lymph nodes antigenspecific effector and memory cd8 t cells generated in the lymph nodes migrate to those tissues where they are required we use approximate bayesian computation with deterministic mathematical models of cd8 t cell populations naive central memory effector memory and effector and yellow fever virus vaccine data to infer the dynamics of these cd8 t cell populations in three spatial compartments draining lymph nodes circulation and skin we have made use of the literature to obtain rates of division and death for human cd8 t cell population subsets and thymic export rates under the decreasing potential hypothesis for differentiation during an immune response we find that as the number of t cell clonotypes driven to an immune response increases there is a reduction in the number of divisions required to differentiate from a naive to an effector cd8 t cell supporting the division of labour hypothesis observed in murine studies we have also considered the reverse differentiation scenario the increasing potential hypothesis the decreasing potential model is better supported by the yellow fever virus vaccine data | [['complete', 'understanding', 'of', 'the', 'mechanisms', 'regulating', 'the', 'proliferation', 'and', 'differentiation', 'that', 'takes', 'place', 'during', 'human', 'immune', 'cd8', 't', 'cell', 'responses', 'is', 'still', 'lacking', 'human', 'clinical', 'data', 'is', 'usually', 'limited', 'to', 'blood', 'cell', 'counts', 'yet', 'the', 'initiation', 'of', 'these', 'responses', 'occurs', 'in', 'the', 'draining', 'lymph', 'nodes', 'antigenspecific', 'effector', 'and', 'memory', 'cd8', 't', 'cells', 'generated', 'in', 'the', 'lymph', 'nodes', 'migrate', 'to', 'those', 'tissues', 'where', 'they', 'are', 'required', 'we', 'use', 'approximate', 'bayesian', 'computation', 'with', 'deterministic', 'mathematical', 'models', 'of', 'cd8', 't', 'cell', 'populations', 'naive', 'central', 'memory', 'effector', 'memory', 'and', 'effector', 'and', 'yellow', 'fever', 'virus', 'vaccine', 'data', 'to', 'infer', 'the', 'dynamics', 'of', 'these', 'cd8', 't', 'cell', 'populations', 'in', 'three', 'spatial', 'compartments', 'draining', 'lymph', 'nodes', 'circulation', 'and', 'skin', 'we', 'have', 'made', 'use', 'of', 'the', 'literature', 'to', 'obtain', 'rates', 'of', 'division', 'and', 'death', 'for', 'human', 'cd8', 't', 'cell', 'population', 'subsets', 'and', 'thymic', 'export', 'rates', 'under', 'the', 'decreasing', 'potential', 'hypothesis', 'for', 'differentiation', 'during', 'an', 'immune', 'response', 'we', 'find', 'that', 'as', 'the', 'number', 'of', 't', 'cell', 'clonotypes', 'driven', 'to', 'an', 'immune', 'response', 'increases', 'there', 'is', 'a', 'reduction', 'in', 'the', 'number', 'of', 'divisions', 'required', 'to', 'differentiate', 'from', 'a', 'naive', 'to', 'an', 'effector', 'cd8', 't', 'cell', 'supporting', 'the', 'division', 'of', 'labour', 'hypothesis', 'observed', 'in', 'murine', 'studies', 'we', 'have', 'also', 'considered', 'the', 'reverse', 'differentiation', 'scenario', 'the', 'increasing', 'potential', 'hypothesis', 'the', 'decreasing', 'potential', 'model', 'is', 'better', 'supported', 'by', 'the', 'yellow', 'fever', 'virus', 'vaccine', 'data']] | [-0.11481729042081332, 0.17717387035710006, 0.019378852456892755, 0.053344697486185894, -0.048501515257256954, -0.1658155493692241, 0.1647684322857954, 0.3601423235821792, -0.241558572252027, -0.2368879613487727, 0.07416487283295613, -0.27686824048022657, -0.21673620887185363, 0.13169175450245596, -0.16617378857269863, -0.03578787188717714, 0.04039207643628205, 0.04651260839944536, 0.14160398830321025, -0.2626851257910444, 0.19902107167713853, 0.04271338719620623, 0.3115628725933758, -0.011093895844003948, 0.11109234334805726, -0.03480692238514497, -0.047451093759049066, -0.03717342541045086, -0.11742903399314276, 0.054124081135060724, 0.2670262048409396, 0.19937490821360948, 0.3555066193369302, -0.5323877422477711, -0.24058912854049017, 0.15181631575740703, 0.1826515425017781, 0.0999494371978058, -0.03572472300412218, -0.19103242707840928, 0.08399027699011971, -0.17257508124140175, -0.12923294813107614, -0.014837966108991003, 0.0683930905268591, 0.014453987566098062, -0.30633836038495327, 0.13116810840477808, -0.0013187745713036168, 0.12718877895862202, -0.11994493142278358, -0.11380495659329674, -0.08447362667118961, 0.23196223506820388, 0.0714796802076638, 0.030006574030796235, 0.23772444454529745, -0.13727908090010962, -0.11877321676478128, 0.28126903411678295, 0.036364548992026936, -0.17524424302603372, 0.22898881756700576, -0.16573542889673262, -0.08275288807093271, 0.13587761443023655, 0.1673422179669036, 0.06145087768196721, -0.18567213869060983, -0.03993439260124102, 0.04578138116154481, 0.15195122780278325, 0.10774700074901127, -0.04477648521159691, 0.1615939629264176, 0.2615009244531393, -0.02175617576259273, 0.07908105746715922, -0.12978937556459144, -0.10643907132537359, -0.2039745151467452, -0.15581995883998884, -0.11019511006095192, 0.01675070908174596, -0.09377044929377999, -0.18231131273575804, 0.3559030727070587, 0.11544349614784799, 0.18371814203935422, 0.10642210277834568, 0.2498925130179321, 0.02607429272188297, 0.16286407662767238, 0.014456459177149968, 0.09901864913038232, 0.06837442600887945, 0.13899049578361553, -0.32326178502143277, 0.1636549534809257, 0.003178079950157553] |
1,802.05095 | Bardeen Regular Black Hole With an Electric Source | If some energy conditions on the stress-energy tensor are violated, is
possible construct regular black holes in General Relativity and in alternative
theories of gravity. This type of solution has horizons but does not present
singularities. The first regular black hole was presented by Bardeen and can be
obtained from Einstein equations in the presence of an electromagnetic field.
E. Ayon-Beato and A. Garcia reinterpreted the Bardeen metric as a magnetic
solution of General Relativity coupled to a nonlinear electrodynamics. In this
work show that the Bardeen model may also be interpreted as a solutions of
Einstein equations in the presence of a electric source, whose electric field
does not behaves as a Coulomb field. We analyzed the asymptotic forms of the
Lagrangian for the electric case and also analyzed the energy conditions.
| gr-qc hep-th | if some energy conditions on the stressenergy tensor are violated is possible construct regular black holes in general relativity and in alternative theories of gravity this type of solution has horizons but does not present singularities the first regular black hole was presented by bardeen and can be obtained from einstein equations in the presence of an electromagnetic field e ayonbeato and a garcia reinterpreted the bardeen metric as a magnetic solution of general relativity coupled to a nonlinear electrodynamics in this work show that the bardeen model may also be interpreted as a solutions of einstein equations in the presence of a electric source whose electric field does not behaves as a coulomb field we analyzed the asymptotic forms of the lagrangian for the electric case and also analyzed the energy conditions | [['if', 'some', 'energy', 'conditions', 'on', 'the', 'stressenergy', 'tensor', 'are', 'violated', 'is', 'possible', 'construct', 'regular', 'black', 'holes', 'in', 'general', 'relativity', 'and', 'in', 'alternative', 'theories', 'of', 'gravity', 'this', 'type', 'of', 'solution', 'has', 'horizons', 'but', 'does', 'not', 'present', 'singularities', 'the', 'first', 'regular', 'black', 'hole', 'was', 'presented', 'by', 'bardeen', 'and', 'can', 'be', 'obtained', 'from', 'einstein', 'equations', 'in', 'the', 'presence', 'of', 'an', 'electromagnetic', 'field', 'e', 'ayonbeato', 'and', 'a', 'garcia', 'reinterpreted', 'the', 'bardeen', 'metric', 'as', 'a', 'magnetic', 'solution', 'of', 'general', 'relativity', 'coupled', 'to', 'a', 'nonlinear', 'electrodynamics', 'in', 'this', 'work', 'show', 'that', 'the', 'bardeen', 'model', 'may', 'also', 'be', 'interpreted', 'as', 'a', 'solutions', 'of', 'einstein', 'equations', 'in', 'the', 'presence', 'of', 'a', 'electric', 'source', 'whose', 'electric', 'field', 'does', 'not', 'behaves', 'as', 'a', 'coulomb', 'field', 'we', 'analyzed', 'the', 'asymptotic', 'forms', 'of', 'the', 'lagrangian', 'for', 'the', 'electric', 'case', 'and', 'also', 'analyzed', 'the', 'energy', 'conditions']] | [-0.18529959967801055, 0.08221143294185754, -0.09682797027849838, 0.11100896621994759, -0.09453177993024763, -0.151506788706533, -0.06561743793396377, 0.2678361449082543, -0.17611154672668727, -0.27997967561608866, 0.07416283426354674, -0.2602566748969537, -0.1507507035494747, 0.17858530395783315, -0.06936918145843915, 0.001063643086393525, -0.014110685511723273, 0.08856726069479509, -0.09006530805394627, -0.2180147048758161, 0.3493057637163823, 0.07492373319328728, 0.2325226368480607, 0.045481691248995024, 0.08852343533286139, -0.009680678745857756, 0.04829947345126841, 0.14319662772175065, -0.11515611621816652, 0.029333599004544374, 0.2243842404594827, 0.10304089448820884, 0.21794962407530924, -0.44106835100267616, -0.2336937517235826, 0.08211708975661743, 0.1264105160174457, 0.17411726998179256, -0.09199768962089981, -0.29213375361335175, 0.050183276575814964, -0.19090179190095655, -0.19703766063233852, -0.07280864859616062, 0.04339578104138907, 0.004743407567948999, -0.2553394828534412, 0.08589826358606535, 0.08134915503582224, -0.04266074711554929, -0.1538894902757208, -0.037376689255461656, -0.03301087918838388, 0.029449150386385452, 0.1088730446036723, 0.044275306543349324, 0.09956918398086402, -0.11801082736469413, -0.09526402378258736, 0.37877652757710084, -0.12085579170432306, -0.25418326605979663, 0.1322302190740978, -0.17929543127284797, -0.07116362236919847, 0.07125063127001285, 0.1295536162044601, 0.21533464215681852, -0.18917575576587728, 0.18411134576417953, -0.0194904055195612, 0.1170153020727063, 0.12288303859882001, 0.016645374442660774, 0.29191666035527797, 0.06612428057854786, 0.01108455231161158, 0.12762730835964972, -0.01746238912525762, -0.07053180881364524, -0.3704662108286179, -0.15878854983983406, -0.16682946608450852, 0.12889377623328177, -0.09788728743838408, -0.21437624919305281, 0.36171539013271387, 0.10288475766949552, 0.11404366747351867, 0.0011644528520510608, 0.23852957173962785, 0.12632680543316738, 0.0522638410960037, 0.10393836045693747, 0.3537238003325883, 0.16191953545982452, 0.14809351156227626, -0.21750127156335103, -0.04059770623137964, 0.1027994962002998] |
1,802.05096 | Material, size and environment dependence of plasmon-induced hot
carriers in metallic nanoparticles | Harnessing hot electrons and holes resulting from the decay of localized
surface plasmons in nanomaterials has recently led to new devices for
photovoltaics, photocatalysis and optoelectronics. Properties of hot carriers
are highly tunable and in this work we investigate their dependence on the
material, size and environment of spherical metallic nanoparticles. In
particular, we carry out theoretical calculations of hot carrier generation
rates and energy distributions for six different plasmonic materials (Na, K,
Al, Cu, Ag and Au). The plasmon decay into hot electron-hole pairs is described
via Fermi's Golden Rule using the quasistatic approximation for optical
properties and a spherical well potential for the electronic structure. We
present results for nanoparticles with diameters up to 40 nm, which are
embedded in different dielectric media. We find that small nanoparticles with
diameters of 16 nm or less in media with large dielectric constants produce
most hot carriers. Among the different materials, Na, K and Au generate most
hot carriers. We also investigate hot-carrier induced water splitting and find
that simple-metal nanoparticles are useful for initiating the hydrogen
evolution reaction, while transition-metal nanoparticles produce dominantly
holes for the oxygen evolution reaction.
| cond-mat.mtrl-sci | harnessing hot electrons and holes resulting from the decay of localized surface plasmons in nanomaterials has recently led to new devices for photovoltaics photocatalysis and optoelectronics properties of hot carriers are highly tunable and in this work we investigate their dependence on the material size and environment of spherical metallic nanoparticles in particular we carry out theoretical calculations of hot carrier generation rates and energy distributions for six different plasmonic materials na k al cu ag and au the plasmon decay into hot electronhole pairs is described via fermis golden rule using the quasistatic approximation for optical properties and a spherical well potential for the electronic structure we present results for nanoparticles with diameters up to 40 nm which are embedded in different dielectric media we find that small nanoparticles with diameters of 16 nm or less in media with large dielectric constants produce most hot carriers among the different materials na k and au generate most hot carriers we also investigate hotcarrier induced water splitting and find that simplemetal nanoparticles are useful for initiating the hydrogen evolution reaction while transitionmetal nanoparticles produce dominantly holes for the oxygen evolution reaction | [['harnessing', 'hot', 'electrons', 'and', 'holes', 'resulting', 'from', 'the', 'decay', 'of', 'localized', 'surface', 'plasmons', 'in', 'nanomaterials', 'has', 'recently', 'led', 'to', 'new', 'devices', 'for', 'photovoltaics', 'photocatalysis', 'and', 'optoelectronics', 'properties', 'of', 'hot', 'carriers', 'are', 'highly', 'tunable', 'and', 'in', 'this', 'work', 'we', 'investigate', 'their', 'dependence', 'on', 'the', 'material', 'size', 'and', 'environment', 'of', 'spherical', 'metallic', 'nanoparticles', 'in', 'particular', 'we', 'carry', 'out', 'theoretical', 'calculations', 'of', 'hot', 'carrier', 'generation', 'rates', 'and', 'energy', 'distributions', 'for', 'six', 'different', 'plasmonic', 'materials', 'na', 'k', 'al', 'cu', 'ag', 'and', 'au', 'the', 'plasmon', 'decay', 'into', 'hot', 'electronhole', 'pairs', 'is', 'described', 'via', 'fermis', 'golden', 'rule', 'using', 'the', 'quasistatic', 'approximation', 'for', 'optical', 'properties', 'and', 'a', 'spherical', 'well', 'potential', 'for', 'the', 'electronic', 'structure', 'we', 'present', 'results', 'for', 'nanoparticles', 'with', 'diameters', 'up', 'to', '40', 'nm', 'which', 'are', 'embedded', 'in', 'different', 'dielectric', 'media', 'we', 'find', 'that', 'small', 'nanoparticles', 'with', 'diameters', 'of', '16', 'nm', 'or', 'less', 'in', 'media', 'with', 'large', 'dielectric', 'constants', 'produce', 'most', 'hot', 'carriers', 'among', 'the', 'different', 'materials', 'na', 'k', 'and', 'au', 'generate', 'most', 'hot', 'carriers', 'we', 'also', 'investigate', 'hotcarrier', 'induced', 'water', 'splitting', 'and', 'find', 'that', 'simplemetal', 'nanoparticles', 'are', 'useful', 'for', 'initiating', 'the', 'hydrogen', 'evolution', 'reaction', 'while', 'transitionmetal', 'nanoparticles', 'produce', 'dominantly', 'holes', 'for', 'the', 'oxygen', 'evolution', 'reaction']] | [-0.07210858006912627, 0.21558177904716055, -0.004802079579645866, 0.017139992970164473, -0.008558909456539704, -0.14433323885620522, 0.059392780503013026, 0.45667249964256035, -0.22382197815214136, -0.31431538667774905, -0.024819785558103928, -0.35149780702532124, -0.11106056035128667, 0.2014593510741466, 0.0363449699631402, 0.0006735179253538311, 0.015072746128824196, -0.13230135687871983, -0.02463866493321563, -0.16822137524263542, 0.25058282423200773, 0.05614895564565239, 0.26725807868826545, 0.13847432791647551, 0.004744336346017295, -0.020070625587954725, 0.05493622371240666, -0.02295733424589822, -0.15730672799040085, 0.13296312300892743, 0.23786520994832053, -0.04207697034029192, 0.2087575958257443, -0.4831930997046201, -0.2489783779178795, 0.0052666201819910816, 0.15163798012010948, 0.12672095998423175, -0.15916071962626455, -0.2178962473304158, 0.09730187807615852, -0.12164249900532396, -0.11891858315969953, -0.06426385631294627, 0.048091659701037175, 0.052185135081680004, -0.236634656827664, 0.06498993118523351, 0.035024500131227175, 0.06272772756603541, -0.1017362256838456, -0.17141238172955223, -0.060879490609084694, 0.07588063455309327, 0.029974602172028665, -0.05274423886133407, 0.24502694164127062, -0.07931476051300324, -0.048480875476410515, 0.4134479945574544, -0.06803326101385448, -0.08601007220874492, 0.2228615203308628, -0.18391204981721546, -0.026301472631626223, 0.2102476744226327, 0.2009162337543737, 0.17861156709688275, -0.18589736349684627, 0.03601355580586211, 0.01243218573998954, 0.1850567887022503, 0.11847292861018918, 0.1526369465441492, 0.2803422244657811, 0.18671655722550656, -0.022508031159247224, 0.10857079937735474, -0.11716745269766665, -0.02365801835242708, -0.16009671351823368, -0.21255487719256627, -0.19287208827996724, 0.0673212957580721, -0.09209389407363855, -0.18762666303419362, 0.3547688467330054, 0.08072899248892147, 0.1539406299321471, -0.054693671241770256, 0.22342360503929454, 0.03851686977830372, 0.08565594208010129, 0.07621095112868045, 0.280438665879008, 0.18760838498802562, 0.12203058868793673, -0.2453599868722162, 0.03427691777530861, -0.015557665043314428] |
1,802.05097 | The Multiscale Bowler-Hat Transform for Vessel Enhancement in 3D
Biomedical Images | Enhancement and detection of 3D vessel-like structures has long been an open
problem as most existing image processing methods fail in many aspects,
including a lack of uniform enhancement between vessels of different radii and
a lack of enhancement at the junctions.
Here, we propose a method based on mathematical morphology to enhance 3D
vessel-like structures in biomedical images. The proposed method, 3D bowler-hat
transform, combines sphere and line structuring elements to enhance vessel-like
structures. The proposed method is validated on synthetic and real data and
compared with state-of-the-art methods.
Our results show that the proposed method achieves a high-quality vessel-like
structures enhancement in both synthetic and real biomedical images, and is
able to cope with variations in vessels thickness throughout vascular networks
while remaining robust at junctions.
| cs.CV | enhancement and detection of 3d vessellike structures has long been an open problem as most existing image processing methods fail in many aspects including a lack of uniform enhancement between vessels of different radii and a lack of enhancement at the junctions here we propose a method based on mathematical morphology to enhance 3d vessellike structures in biomedical images the proposed method 3d bowlerhat transform combines sphere and line structuring elements to enhance vessellike structures the proposed method is validated on synthetic and real data and compared with stateoftheart methods our results show that the proposed method achieves a highquality vessellike structures enhancement in both synthetic and real biomedical images and is able to cope with variations in vessels thickness throughout vascular networks while remaining robust at junctions | [['enhancement', 'and', 'detection', 'of', '3d', 'vessellike', 'structures', 'has', 'long', 'been', 'an', 'open', 'problem', 'as', 'most', 'existing', 'image', 'processing', 'methods', 'fail', 'in', 'many', 'aspects', 'including', 'a', 'lack', 'of', 'uniform', 'enhancement', 'between', 'vessels', 'of', 'different', 'radii', 'and', 'a', 'lack', 'of', 'enhancement', 'at', 'the', 'junctions', 'here', 'we', 'propose', 'a', 'method', 'based', 'on', 'mathematical', 'morphology', 'to', 'enhance', '3d', 'vessellike', 'structures', 'in', 'biomedical', 'images', 'the', 'proposed', 'method', '3d', 'bowlerhat', 'transform', 'combines', 'sphere', 'and', 'line', 'structuring', 'elements', 'to', 'enhance', 'vessellike', 'structures', 'the', 'proposed', 'method', 'is', 'validated', 'on', 'synthetic', 'and', 'real', 'data', 'and', 'compared', 'with', 'stateoftheart', 'methods', 'our', 'results', 'show', 'that', 'the', 'proposed', 'method', 'achieves', 'a', 'highquality', 'vessellike', 'structures', 'enhancement', 'in', 'both', 'synthetic', 'and', 'real', 'biomedical', 'images', 'and', 'is', 'able', 'to', 'cope', 'with', 'variations', 'in', 'vessels', 'thickness', 'throughout', 'vascular', 'networks', 'while', 'remaining', 'robust', 'at', 'junctions']] | [-0.03699290541579991, -0.046432248675003174, -0.03140263471112579, 0.022366453682651787, -0.06349217988125334, -0.1067663163650693, -0.03071794664765906, 0.4735948099996748, -0.22346400410233902, -0.3525618312488068, 0.08406430934592495, -0.2708338114880319, -0.21580509918441218, 0.25698217564797776, -0.11194257719779578, 0.08288134753751737, 0.10716923247329803, -0.023308586380554466, -0.06091648613663728, -0.2170729628721927, 0.25776301783428884, 0.01779807590710835, 0.41365091355634837, 0.08502108206253821, 0.1149707508363255, -0.07687012611991015, -0.040184959710582974, 0.04656324093780062, -0.05262692734686425, 0.17857278273605895, 0.27378130132171113, 0.12399868507810875, 0.22823178132731967, -0.463553470288088, -0.27635343216623615, 0.044398678793007226, 0.1681152128167157, 0.10480993200372171, -0.09349711631116729, -0.31729799291250976, 0.14735595525543052, -0.08114129275919532, -0.04762928299312517, -0.11350200952976708, 0.006095136957624414, -0.00029843385325832746, -0.2732114436207559, 0.06052574081856053, 0.02211956254859257, 0.10436076346755498, -0.08543852690101315, -0.09919069591528318, 0.007961250432788974, 0.16210099781577395, -0.017882910120762943, 0.015563485777284216, 0.14303279947856162, -0.1628008284826037, -0.14012855088602252, 0.39353524086864916, -0.060273146586800656, -0.20028056284984735, 0.2526613694274666, -0.07706603664523504, -0.10700467779249774, 0.18162430193656542, 0.20613680609344234, 0.12969573819276503, -0.10268135577821591, 0.028590773630568275, 0.002587245653500766, 0.1934785203170398, 0.0626209905283071, -0.0029981045353072366, 0.17044581805803175, 0.25324032784945616, 0.01810114680354916, 0.1216552843702737, -0.1930279924138266, -0.04418486985194636, -0.16311481515840281, -0.13173921644599654, -0.16056085623595423, -0.06669217420697916, -0.07976683803687815, -0.18766955618460582, 0.38841871377520676, 0.2110567277482542, 0.22345158696269954, 0.0156635579792416, 0.3777321761283349, -0.008082243837562836, 0.12912206900284046, 0.039330822606314354, 0.16752687998952007, 0.10584734752774239, 0.12482071149678109, -0.21767510924906303, 0.059399236998278794, 0.013987360800814442] |
1,802.05098 | DiCE: The Infinitely Differentiable Monte-Carlo Estimator | The score function estimator is widely used for estimating gradients of
stochastic objectives in stochastic computation graphs (SCG), eg, in
reinforcement learning and meta-learning. While deriving the first-order
gradient estimators by differentiating a surrogate loss (SL) objective is
computationally and conceptually simple, using the same approach for
higher-order derivatives is more challenging. Firstly, analytically deriving
and implementing such estimators is laborious and not compliant with automatic
differentiation. Secondly, repeatedly applying SL to construct new objectives
for each order derivative involves increasingly cumbersome graph manipulations.
Lastly, to match the first-order gradient under differentiation, SL treats part
of the cost as a fixed sample, which we show leads to missing and wrong terms
for estimators of higher-order derivatives. To address all these shortcomings
in a unified way, we introduce DiCE, which provides a single objective that can
be differentiated repeatedly, generating correct estimators of derivatives of
any order in SCGs. Unlike SL, DiCE relies on automatic differentiation for
performing the requisite graph manipulations. We verify the correctness of DiCE
both through a proof and numerical evaluation of the DiCE derivative estimates.
We also use DiCE to propose and evaluate a novel approach for multi-agent
learning. Our code is available at https://www.github.com/alshedivat/lola.
| cs.LG cs.AI cs.NE | the score function estimator is widely used for estimating gradients of stochastic objectives in stochastic computation graphs scg eg in reinforcement learning and metalearning while deriving the firstorder gradient estimators by differentiating a surrogate loss sl objective is computationally and conceptually simple using the same approach for higherorder derivatives is more challenging firstly analytically deriving and implementing such estimators is laborious and not compliant with automatic differentiation secondly repeatedly applying sl to construct new objectives for each order derivative involves increasingly cumbersome graph manipulations lastly to match the firstorder gradient under differentiation sl treats part of the cost as a fixed sample which we show leads to missing and wrong terms for estimators of higherorder derivatives to address all these shortcomings in a unified way we introduce dice which provides a single objective that can be differentiated repeatedly generating correct estimators of derivatives of any order in scgs unlike sl dice relies on automatic differentiation for performing the requisite graph manipulations we verify the correctness of dice both through a proof and numerical evaluation of the dice derivative estimates we also use dice to propose and evaluate a novel approach for multiagent learning our code is available at httpswwwgithubcomalshedivatlola | [['the', 'score', 'function', 'estimator', 'is', 'widely', 'used', 'for', 'estimating', 'gradients', 'of', 'stochastic', 'objectives', 'in', 'stochastic', 'computation', 'graphs', 'scg', 'eg', 'in', 'reinforcement', 'learning', 'and', 'metalearning', 'while', 'deriving', 'the', 'firstorder', 'gradient', 'estimators', 'by', 'differentiating', 'a', 'surrogate', 'loss', 'sl', 'objective', 'is', 'computationally', 'and', 'conceptually', 'simple', 'using', 'the', 'same', 'approach', 'for', 'higherorder', 'derivatives', 'is', 'more', 'challenging', 'firstly', 'analytically', 'deriving', 'and', 'implementing', 'such', 'estimators', 'is', 'laborious', 'and', 'not', 'compliant', 'with', 'automatic', 'differentiation', 'secondly', 'repeatedly', 'applying', 'sl', 'to', 'construct', 'new', 'objectives', 'for', 'each', 'order', 'derivative', 'involves', 'increasingly', 'cumbersome', 'graph', 'manipulations', 'lastly', 'to', 'match', 'the', 'firstorder', 'gradient', 'under', 'differentiation', 'sl', 'treats', 'part', 'of', 'the', 'cost', 'as', 'a', 'fixed', 'sample', 'which', 'we', 'show', 'leads', 'to', 'missing', 'and', 'wrong', 'terms', 'for', 'estimators', 'of', 'higherorder', 'derivatives', 'to', 'address', 'all', 'these', 'shortcomings', 'in', 'a', 'unified', 'way', 'we', 'introduce', 'dice', 'which', 'provides', 'a', 'single', 'objective', 'that', 'can', 'be', 'differentiated', 'repeatedly', 'generating', 'correct', 'estimators', 'of', 'derivatives', 'of', 'any', 'order', 'in', 'scgs', 'unlike', 'sl', 'dice', 'relies', 'on', 'automatic', 'differentiation', 'for', 'performing', 'the', 'requisite', 'graph', 'manipulations', 'we', 'verify', 'the', 'correctness', 'of', 'dice', 'both', 'through', 'a', 'proof', 'and', 'numerical', 'evaluation', 'of', 'the', 'dice', 'derivative', 'estimates', 'we', 'also', 'use', 'dice', 'to', 'propose', 'and', 'evaluate', 'a', 'novel', 'approach', 'for', 'multiagent', 'learning', 'our', 'code', 'is', 'available', 'at', 'httpswwwgithubcomalshedivatlola']] | [-0.049203201942028235, -0.009159418338006644, -0.09481104020607856, 0.09345527440180174, -0.1325018926737642, -0.17234406306060276, 0.06039843363322863, 0.42628051559534863, -0.24439973142374344, -0.3166425968990708, 0.11490717415716688, -0.24576793171905187, -0.19098483159140955, 0.17965809364375104, -0.12796896842241903, 0.0977848505841173, 0.055948505462664694, -0.003439418545858276, -0.09667318154771981, -0.26677961231031777, 0.2804637103173364, 0.00452361685444949, 0.26774318677354414, 0.007627055898833211, 0.1681126301621341, 0.028514965286835878, -0.04274437732693523, 0.023372559102647232, -0.09971557570183491, 0.16915237117850343, 0.2668667881446185, 0.15819781937523547, 0.36864797821776435, -0.38106908557819397, -0.18006593597502532, 0.09147792590800861, 0.14052541618054024, 0.10701656266411935, -0.03993460862649513, -0.24682204754590387, 0.06916317273627477, -0.16722769532917123, -0.030225115702393456, -0.1952340950580276, -0.036234888142313466, 0.0003478800583362692, -0.34978348163727935, 0.08289331409976126, 0.024095247518459356, 0.06300278440837494, -0.02437658021179489, -0.12215951481035021, 0.015807623502262162, 0.13051753786317252, 0.010927382472727178, 0.034236751941286704, 0.10620438974030842, -0.11500705183436477, -0.15521478124381505, 0.3575640936391522, -0.07627165979926823, -0.2572300156879455, 0.1651672743039789, -0.04591785964786517, -0.15271500729946325, 0.08097898335591992, 0.1667309896902868, 0.15218244468901457, -0.19629908180231173, 0.012659870481149133, 0.032818147143574825, 0.15851575764709838, 0.07130506427281282, -0.04250266513965949, 0.14821947966655247, 0.17659896217531176, 0.09947979239972704, 0.1537314882552524, -0.04329115022420695, -0.10442117217344919, -0.2978789136730925, -0.1823486707683634, -0.20427423815367593, -0.03543094914243968, -0.11707406312956609, -0.20219942707229743, 0.3830798580452348, 0.19331027859600844, 0.14244387970503533, 0.143473478043546, 0.3422789451656769, 0.14654575645626108, 0.07748611188832331, 0.07376525508277494, 0.18517829203093894, 0.0701608333402699, 0.0603492452346748, -0.18475572663333473, 0.1512594437873405, 0.11357318344608307] |
1,802.05099 | Unconditional Security of a $K$-State Quantum Key Distribution Protocol | Quantum key distribution protocols constitute an important part of quantum
cryptography, where the security of sensitive information arises from the laws
of physics. In this paper we introduce a new family of key distribution
protocols and we compare its key with the well-known protocols such as BB84,
PBC0 and generation rate to the well-known protocols such as BB84, PBC0 and
R04. We also state the security analysis of these protocols based on the
entanglement distillation and CSS codes techniques.
| quant-ph | quantum key distribution protocols constitute an important part of quantum cryptography where the security of sensitive information arises from the laws of physics in this paper we introduce a new family of key distribution protocols and we compare its key with the wellknown protocols such as bb84 pbc0 and generation rate to the wellknown protocols such as bb84 pbc0 and r04 we also state the security analysis of these protocols based on the entanglement distillation and css codes techniques | [['quantum', 'key', 'distribution', 'protocols', 'constitute', 'an', 'important', 'part', 'of', 'quantum', 'cryptography', 'where', 'the', 'security', 'of', 'sensitive', 'information', 'arises', 'from', 'the', 'laws', 'of', 'physics', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'family', 'of', 'key', 'distribution', 'protocols', 'and', 'we', 'compare', 'its', 'key', 'with', 'the', 'wellknown', 'protocols', 'such', 'as', 'bb84', 'pbc0', 'and', 'generation', 'rate', 'to', 'the', 'wellknown', 'protocols', 'such', 'as', 'bb84', 'pbc0', 'and', 'r04', 'we', 'also', 'state', 'the', 'security', 'analysis', 'of', 'these', 'protocols', 'based', 'on', 'the', 'entanglement', 'distillation', 'and', 'css', 'codes', 'techniques']] | [-0.14122324468350256, 0.053246673155922214, -0.11868166676782943, 0.06956494772994237, 0.07518469466670573, -0.25059067225688464, 0.05767002873963301, 0.3071220524415567, -0.2817949912232625, -0.26095100760750184, 0.10780512327298086, -0.2297662803540369, -0.13617985018879755, 0.26856225547562174, -0.15129411004048277, 0.1949019753608502, -0.010045816166350594, -0.015214008073528091, -0.022577484210880547, -0.23405783575983694, 0.42146213372032365, 0.0916494475375232, 0.3479467287581027, 0.06451356916555337, 0.08410303211202483, 0.04283244756667258, -0.04396670773722135, -0.09448522895381048, -0.17623058269888936, 0.14696536875970953, 0.24450384206803782, 0.2177134626424061, 0.26408060565107055, -0.36360695555370737, -0.19166368681502033, 0.09235876542213675, 0.14732195793306335, 0.19439495196142656, -0.08204501335865927, -0.2725586181010616, 0.041683699276491806, -0.2596909755224048, -0.08458309761224339, -0.08522584510047908, -0.052523929480608404, 0.06595735680070017, -0.21518377635579605, 0.04982498570234974, 0.0691594863824498, 0.04889307627091547, 0.04714965838303959, -0.09602312137699359, 0.042195354663924156, 0.19108233098908292, -0.021302391666096526, -0.0203682427285481, 0.14936083754110333, -0.1403014065014416, -0.2307090074694776, 0.39107282378925495, -0.018342504843271205, -0.12354242743609788, 0.1477949964396607, -0.018847134641625664, -0.18844206452780923, -0.0219982091289062, 0.18966002485339906, 0.11796210510293384, -0.08948507159948349, -0.0018257359314903423, -0.026359590426595372, 0.22710570988136453, -0.012768721077954034, 0.22329475391994824, 0.13536168915497793, 0.10930334181561098, 0.06655239192889882, 0.16324331120333888, -0.10103361140452809, -0.1930348120097603, -0.33542344453986495, -0.2129184217131757, -0.204277896080408, 0.08466407481441879, -0.07176774669689574, -0.14278448429623886, 0.3986967278571872, 0.19995799086165505, 0.11478732453126993, -0.014680964388437086, 0.37997192289535103, 0.04306820993214942, 0.08623152997272161, 0.15276922257738068, 0.20543936390411593, 0.14861107366038606, 0.10782972881086654, -0.15224076228899663, 0.1523493583822115, 0.029497659329760385] |
1,802.051 | SAPA: Self-Aware Polymorphic Architecture | In this work, we introduce a Self-Aware Polymorphic Architecture (SAPA)
design approach to support emerging context-aware applications and mitigate the
programming challenges caused by the ever-increasing complexity and
heterogeneity of high performance computing systems. Through the SAPA design,
we examined the salient software-hardware features of adaptive computing
systems that allow for (1) the dynamic allocation of computing resources
depending on program needs (e.g., the amount of parallelism in the program) and
(2) automatic approximation to meet program and system goals (e.g., execution
time budget, power constraints and computation resiliency) without the
programming complexity of current multicore and many-core systems. The proposed
adaptive computer architecture framework applies machine learning algorithms
and control theory techniques to the application execution based on information
collected about the system runtime performance trade-offs. It has heterogeneous
reconfigurable cores with fast hardware-level migration capability,
self-organizing memory structures and hierarchies, an adaptive
application-aware network-on-chip, and a built-in hardware layer for dynamic,
autonomous resource management. Our prototyped architecture performs extremely
well on a large pool of applications.
| cs.AR cs.SE | in this work we introduce a selfaware polymorphic architecture sapa design approach to support emerging contextaware applications and mitigate the programming challenges caused by the everincreasing complexity and heterogeneity of high performance computing systems through the sapa design we examined the salient softwarehardware features of adaptive computing systems that allow for 1 the dynamic allocation of computing resources depending on program needs eg the amount of parallelism in the program and 2 automatic approximation to meet program and system goals eg execution time budget power constraints and computation resiliency without the programming complexity of current multicore and manycore systems the proposed adaptive computer architecture framework applies machine learning algorithms and control theory techniques to the application execution based on information collected about the system runtime performance tradeoffs it has heterogeneous reconfigurable cores with fast hardwarelevel migration capability selforganizing memory structures and hierarchies an adaptive applicationaware networkonchip and a builtin hardware layer for dynamic autonomous resource management our prototyped architecture performs extremely well on a large pool of applications | [['in', 'this', 'work', 'we', 'introduce', 'a', 'selfaware', 'polymorphic', 'architecture', 'sapa', 'design', 'approach', 'to', 'support', 'emerging', 'contextaware', 'applications', 'and', 'mitigate', 'the', 'programming', 'challenges', 'caused', 'by', 'the', 'everincreasing', 'complexity', 'and', 'heterogeneity', 'of', 'high', 'performance', 'computing', 'systems', 'through', 'the', 'sapa', 'design', 'we', 'examined', 'the', 'salient', 'softwarehardware', 'features', 'of', 'adaptive', 'computing', 'systems', 'that', 'allow', 'for', '1', 'the', 'dynamic', 'allocation', 'of', 'computing', 'resources', 'depending', 'on', 'program', 'needs', 'eg', 'the', 'amount', 'of', 'parallelism', 'in', 'the', 'program', 'and', '2', 'automatic', 'approximation', 'to', 'meet', 'program', 'and', 'system', 'goals', 'eg', 'execution', 'time', 'budget', 'power', 'constraints', 'and', 'computation', 'resiliency', 'without', 'the', 'programming', 'complexity', 'of', 'current', 'multicore', 'and', 'manycore', 'systems', 'the', 'proposed', 'adaptive', 'computer', 'architecture', 'framework', 'applies', 'machine', 'learning', 'algorithms', 'and', 'control', 'theory', 'techniques', 'to', 'the', 'application', 'execution', 'based', 'on', 'information', 'collected', 'about', 'the', 'system', 'runtime', 'performance', 'tradeoffs', 'it', 'has', 'heterogeneous', 'reconfigurable', 'cores', 'with', 'fast', 'hardwarelevel', 'migration', 'capability', 'selforganizing', 'memory', 'structures', 'and', 'hierarchies', 'an', 'adaptive', 'applicationaware', 'networkonchip', 'and', 'a', 'builtin', 'hardware', 'layer', 'for', 'dynamic', 'autonomous', 'resource', 'management', 'our', 'prototyped', 'architecture', 'performs', 'extremely', 'well', 'on', 'a', 'large', 'pool', 'of', 'applications']] | [-0.19013718775351576, -0.0253002098448806, -0.0481199955199069, 0.023003446381023553, -0.1326669960537748, -0.2103514201700732, 0.07733992518305535, 0.3923022697480129, -0.30519876341679175, -0.39091409132760463, 0.1446187620100924, -0.192310644837562, -0.18902505809230552, 0.20434115098379108, -0.13414381341048975, 0.157145693324613, 0.09246458948889215, -0.056566209600229435, -0.026994048053720257, -0.27623434838772354, 0.24661414411717228, 0.11467198464639036, 0.3673695860918434, 0.027875963975107186, 0.11525834121996359, 0.0009344784470851577, -0.004568339854900148, -0.004976458922707631, -0.047762488950692863, 0.1933446117064228, 0.3254187525848725, 0.26364299991733525, 0.36875450932642534, -0.4683482498096834, -0.16744491379774576, 0.03057973334493692, 0.12876073214820713, 0.038264192838271684, -0.0666651608792433, -0.26066351773001123, 0.09086228688829578, -0.23261033851719862, -0.05039624912370484, -0.1381006379988754, -0.011313669461136064, 0.03072207958237933, -0.2583198339090727, -0.0725588876022292, 0.027957724234771116, 0.07905468539822669, -0.04764897008204744, -0.1049796166854711, 0.059514880696605404, 0.1299938773181999, -0.06581038968925852, -0.00921611575800593, 0.20302044802034894, -0.14953685400602504, -0.21491845347641392, 0.37721371306993423, 0.028218768636829088, -0.17285458609001667, 0.21770227943419568, 0.030510670969739466, -0.19192607836642614, 0.09338463457970647, 0.3053550086527442, 0.051640022008325015, -0.1556226422461415, 0.08366413345218116, 0.09563350128952325, 0.2286078924898036, 0.006199654698970595, 0.08462214814166405, 0.1872229097269675, 0.3152376653050028, 0.09064728855099972, 0.13854823895477844, -0.05064773990722772, -0.1339520302433465, -0.18231483070468085, -0.16556549289019867, -0.16339684952288822, -0.05726403263231207, -0.0945776511042433, -0.1383171143714294, 0.3481380878005266, 0.20490510660567365, 0.07821411771389346, 0.13617189962644174, 0.42815300214680885, 0.045381944146486476, 0.16338801986005688, 0.18606260774235817, 0.08825275149969716, -0.0025520863585240606, 0.2420265822189062, -0.27818086028162814, 0.0956420516345783, -0.007174708963637906] |
1,802.05101 | Democratizing AI: Non-expert design of prediction tasks | Non-experts have long made important contributions to machine learning (ML)
by contributing training data, and recent work has shown that non-experts can
also help with feature engineering by suggesting novel predictive features.
However, non-experts have only contributed features to prediction tasks already
posed by experienced ML practitioners. Here we study how non-experts can design
prediction tasks themselves, what types of tasks non-experts will design, and
whether predictive models can be automatically trained on data sourced for
their tasks. We use a crowdsourcing platform where non-experts design
predictive tasks that are then categorized and ranked by the crowd.
Crowdsourced data are collected for top-ranked tasks and predictive models are
then trained and evaluated automatically using those data. We show that
individuals without ML experience can collectively construct useful datasets
and that predictive models can be learned on these datasets, but challenges
remain. The prediction tasks designed by non-experts covered a broad range of
domains, from politics and current events to health behavior, demographics, and
more. Proper instructions are crucial for non-experts, so we also conducted a
randomized trial to understand how different instructions may influence the
types of prediction tasks being proposed. In general, understanding better how
non-experts can contribute to ML can further leverage advances in Automatic ML
and has important implications as ML continues to drive workplace automation.
| cs.HC cs.AI cs.CY stat.ML | nonexperts have long made important contributions to machine learning ml by contributing training data and recent work has shown that nonexperts can also help with feature engineering by suggesting novel predictive features however nonexperts have only contributed features to prediction tasks already posed by experienced ml practitioners here we study how nonexperts can design prediction tasks themselves what types of tasks nonexperts will design and whether predictive models can be automatically trained on data sourced for their tasks we use a crowdsourcing platform where nonexperts design predictive tasks that are then categorized and ranked by the crowd crowdsourced data are collected for topranked tasks and predictive models are then trained and evaluated automatically using those data we show that individuals without ml experience can collectively construct useful datasets and that predictive models can be learned on these datasets but challenges remain the prediction tasks designed by nonexperts covered a broad range of domains from politics and current events to health behavior demographics and more proper instructions are crucial for nonexperts so we also conducted a randomized trial to understand how different instructions may influence the types of prediction tasks being proposed in general understanding better how nonexperts can contribute to ml can further leverage advances in automatic ml and has important implications as ml continues to drive workplace automation | [['nonexperts', 'have', 'long', 'made', 'important', 'contributions', 'to', 'machine', 'learning', 'ml', 'by', 'contributing', 'training', 'data', 'and', 'recent', 'work', 'has', 'shown', 'that', 'nonexperts', 'can', 'also', 'help', 'with', 'feature', 'engineering', 'by', 'suggesting', 'novel', 'predictive', 'features', 'however', 'nonexperts', 'have', 'only', 'contributed', 'features', 'to', 'prediction', 'tasks', 'already', 'posed', 'by', 'experienced', 'ml', 'practitioners', 'here', 'we', 'study', 'how', 'nonexperts', 'can', 'design', 'prediction', 'tasks', 'themselves', 'what', 'types', 'of', 'tasks', 'nonexperts', 'will', 'design', 'and', 'whether', 'predictive', 'models', 'can', 'be', 'automatically', 'trained', 'on', 'data', 'sourced', 'for', 'their', 'tasks', 'we', 'use', 'a', 'crowdsourcing', 'platform', 'where', 'nonexperts', 'design', 'predictive', 'tasks', 'that', 'are', 'then', 'categorized', 'and', 'ranked', 'by', 'the', 'crowd', 'crowdsourced', 'data', 'are', 'collected', 'for', 'topranked', 'tasks', 'and', 'predictive', 'models', 'are', 'then', 'trained', 'and', 'evaluated', 'automatically', 'using', 'those', 'data', 'we', 'show', 'that', 'individuals', 'without', 'ml', 'experience', 'can', 'collectively', 'construct', 'useful', 'datasets', 'and', 'that', 'predictive', 'models', 'can', 'be', 'learned', 'on', 'these', 'datasets', 'but', 'challenges', 'remain', 'the', 'prediction', 'tasks', 'designed', 'by', 'nonexperts', 'covered', 'a', 'broad', 'range', 'of', 'domains', 'from', 'politics', 'and', 'current', 'events', 'to', 'health', 'behavior', 'demographics', 'and', 'more', 'proper', 'instructions', 'are', 'crucial', 'for', 'nonexperts', 'so', 'we', 'also', 'conducted', 'a', 'randomized', 'trial', 'to', 'understand', 'how', 'different', 'instructions', 'may', 'influence', 'the', 'types', 'of', 'prediction', 'tasks', 'being', 'proposed', 'in', 'general', 'understanding', 'better', 'how', 'nonexperts', 'can', 'contribute', 'to', 'ml', 'can', 'further', 'leverage', 'advances', 'in', 'automatic', 'ml', 'and', 'has', 'important', 'implications', 'as', 'ml', 'continues', 'to', 'drive', 'workplace', 'automation']] | [-0.004722034217381518, 0.06018548712270445, -0.09014405555529817, 0.11447161449476669, -0.1908648311687829, -0.21859234901672425, 0.045300006436941015, 0.4657909582670965, -0.2511605841669012, -0.4062995835373255, 0.11244861210743444, -0.27085918207444487, -0.19507076167905507, 0.2528492337109768, -0.1436724526420678, 0.0855146282773516, 0.13257161213922822, 0.011278091070824834, -0.04483114840403267, -0.3578885271518011, 0.27874364059835194, 0.05989559228451217, 0.35435394492621225, 0.06256535233393924, 0.03778356892698908, -0.0714395306355928, -0.044150690308115, 0.009716327548809519, -0.08468722627186175, 0.17234412317704326, 0.4337275855841861, 0.24844855059625462, 0.3627050883374836, -0.44384983501324776, -0.20967783132083204, 0.0791796997198027, 0.18829515949316902, 0.08855764781240243, -0.04131876272884289, -0.3443437982605745, 0.09523342650906783, -0.17344205335131316, -0.028739963662406626, -0.2082036640197379, -0.021323586899157802, -0.0082801482842206, -0.24689665234931554, 0.001868530905105973, 0.04211744891807063, 0.08995095578332742, -0.011969072107421277, -0.15432316222128173, 0.00524330734473028, 0.23082319667486295, 0.07277840608518281, 0.021927868185105594, 0.18788670533502552, -0.1977816127117332, -0.19444214955363506, 0.3658761858140633, 0.004776597210125292, -0.21145622741450135, 0.22100940909445047, -0.025444223738985656, -0.15415349921858, 0.03116830521726717, 0.2903461240882641, 0.07263511278335384, -0.20104844016636952, -0.014710384874219782, 0.02882614271655747, 0.1914219110821412, 0.0006687872722579089, -0.03777567787626418, 0.2665359898987035, 0.21597585045481654, -0.04038894493701617, 0.07964672464303264, -0.01773378983157002, -0.047679436884259116, -0.17147006401919748, -0.07199029111596819, -0.12354418969517532, 0.004144180313041901, -0.032915473783207465, -0.06852123592212077, 0.3797351134830414, 0.2620877846825621, 0.15063028754326238, 0.053730788052753976, 0.3107604083996351, 0.010805411842124342, 0.11763266033756645, 0.08998704509443889, 0.17678226570101224, -0.03948849251974357, 0.12834884813182976, -0.11638271343707188, 0.13015972433843517, -0.030773528123308466] |
1,802.05102 | Experimental two-way communication with one photon | Superposition of two or more states is one of the fundamental concepts of
quantum mechanics and provides the basis for several advantages quantum
information processing offers. In this work, we experimentally demonstrate that
quantum superposition permits two-way communication between two distant parties
that can exchange only one particle once, an impossible task in classical
physics. This is achieved by preparing a single photon in a coherent
superposition of the two parties' locations. Furthermore, we show that this
concept allows the parties to perform secure quantum communication, where the
transmitted bits and even the direction of communication remain private. These
important features can lead to the development of new quantum communication
schemes, which are simultaneously secure and resource-efficient.
| quant-ph | superposition of two or more states is one of the fundamental concepts of quantum mechanics and provides the basis for several advantages quantum information processing offers in this work we experimentally demonstrate that quantum superposition permits twoway communication between two distant parties that can exchange only one particle once an impossible task in classical physics this is achieved by preparing a single photon in a coherent superposition of the two parties locations furthermore we show that this concept allows the parties to perform secure quantum communication where the transmitted bits and even the direction of communication remain private these important features can lead to the development of new quantum communication schemes which are simultaneously secure and resourceefficient | [['superposition', 'of', 'two', 'or', 'more', 'states', 'is', 'one', 'of', 'the', 'fundamental', 'concepts', 'of', 'quantum', 'mechanics', 'and', 'provides', 'the', 'basis', 'for', 'several', 'advantages', 'quantum', 'information', 'processing', 'offers', 'in', 'this', 'work', 'we', 'experimentally', 'demonstrate', 'that', 'quantum', 'superposition', 'permits', 'twoway', 'communication', 'between', 'two', 'distant', 'parties', 'that', 'can', 'exchange', 'only', 'one', 'particle', 'once', 'an', 'impossible', 'task', 'in', 'classical', 'physics', 'this', 'is', 'achieved', 'by', 'preparing', 'a', 'single', 'photon', 'in', 'a', 'coherent', 'superposition', 'of', 'the', 'two', 'parties', 'locations', 'furthermore', 'we', 'show', 'that', 'this', 'concept', 'allows', 'the', 'parties', 'to', 'perform', 'secure', 'quantum', 'communication', 'where', 'the', 'transmitted', 'bits', 'and', 'even', 'the', 'direction', 'of', 'communication', 'remain', 'private', 'these', 'important', 'features', 'can', 'lead', 'to', 'the', 'development', 'of', 'new', 'quantum', 'communication', 'schemes', 'which', 'are', 'simultaneously', 'secure', 'and', 'resourceefficient']] | [-0.1998413717165255, 0.17101041758425523, -0.10080728836707835, 0.039789610531909436, -0.030284984598461635, -0.26633029950098097, 0.0813532897657277, 0.3544753887730404, -0.3126273070557568, -0.29137913085138184, 0.029125006342083853, -0.23999818386701552, -0.13552759181604618, 0.23072494526938972, -0.07538955089930668, 0.08648656574515705, 0.04693689231529959, 0.020337560508623082, -0.007244412114014889, -0.27835593593872, 0.2954222173390225, 0.018109284698541284, 0.32587041369137854, 0.02293606502457689, 0.0972626519540691, 0.058803829153538004, -0.0010002956322183371, -0.06043115434133344, -0.053334625938279916, 0.18464700307480147, 0.33119179792383796, 0.17975766485970882, 0.3195493223193364, -0.4478261707207331, -0.20523444721554843, 0.09331417137072381, 0.15400640144730265, 0.19004323118879723, -0.05480751763936232, -0.27751350010800946, 0.03128976011489574, -0.18549048635137513, -0.05794548856603921, -0.08437524414044192, -0.03768143333040942, -0.050354538588888116, -0.24108131799815047, 0.052468503260204934, 0.034774553739668757, 0.02200758758868672, 0.05788888252672588, 2.2927967783732292e-06, 0.055730457280356534, 0.20375608852029675, -0.055603042532466986, -0.0266393326376127, 0.10841745622336674, -0.12254569969840474, -0.23096386996758544, 0.3910671281707911, 0.00883130262243665, -0.20253618367207357, 0.19461337104041734, -0.08996543205247666, -0.1120485479099692, 0.05356697126044931, 0.14205307049406135, 0.07185764219930284, -0.15917057749361563, 0.015238936567125825, -0.023625405493359536, 0.2216712510249076, 0.07537898155820803, 0.16194150557852963, 0.2163047306577906, 0.1046993745586429, 0.08784410673886156, 0.1475517979890713, -0.08901939604980633, -0.19159121563037237, -0.28868604231621814, -0.23167920829608846, -0.23312464393834528, 0.05616410519195418, -0.05578052389406118, -0.05939082973278486, 0.381595984642577, 0.16642709562115166, 0.12131306540189135, 0.002251248465429068, 0.3890516327686098, 0.04147669253074843, 0.04492290448556598, 0.10585535382085806, 0.27249144640966105, 0.1077336629665592, 0.06437957391111004, -0.16169134408044508, 0.0822791904449845, -0.01566058383562053] |
1,802.05103 | Conceptual design of electron beam diagnostics for high brightness
plasma accelerator | A design study of the diagnostics of a high brightness linac, based on X-band
structures, and a plasma accelerator stage, has been delivered in the framework
of the EuPRAXIA@SPARC_LAB project. In this paper, we present a conceptual
design of the proposed diagnostics, using state of the art systems and new and
under development devices. Single shot measurements are preferable for plasma
accelerated beams, including emittance, while $\mu$m level and fs scale beam
size and bunch length respectively are requested. The needed to separate the
driver pulse (both laser or beam) from the witness accelerated bunch imposes
additional constrains for the diagnostics. We plan to use betatron radiation
for the emittance measurement just at the end of the plasma booster, while
other single-shot methods must be proven before to be implemented. Longitudinal
measurements, being in any case not trivial for the fs level bunch length, seem
to have already a wider range of possibilities.
| physics.acc-ph | a design study of the diagnostics of a high brightness linac based on xband structures and a plasma accelerator stage has been delivered in the framework of the eupraxiasparc_lab project in this paper we present a conceptual design of the proposed diagnostics using state of the art systems and new and under development devices single shot measurements are preferable for plasma accelerated beams including emittance while mum level and fs scale beam size and bunch length respectively are requested the needed to separate the driver pulse both laser or beam from the witness accelerated bunch imposes additional constrains for the diagnostics we plan to use betatron radiation for the emittance measurement just at the end of the plasma booster while other singleshot methods must be proven before to be implemented longitudinal measurements being in any case not trivial for the fs level bunch length seem to have already a wider range of possibilities | [['a', 'design', 'study', 'of', 'the', 'diagnostics', 'of', 'a', 'high', 'brightness', 'linac', 'based', 'on', 'xband', 'structures', 'and', 'a', 'plasma', 'accelerator', 'stage', 'has', 'been', 'delivered', 'in', 'the', 'framework', 'of', 'the', 'eupraxiasparc_lab', 'project', 'in', 'this', 'paper', 'we', 'present', 'a', 'conceptual', 'design', 'of', 'the', 'proposed', 'diagnostics', 'using', 'state', 'of', 'the', 'art', 'systems', 'and', 'new', 'and', 'under', 'development', 'devices', 'single', 'shot', 'measurements', 'are', 'preferable', 'for', 'plasma', 'accelerated', 'beams', 'including', 'emittance', 'while', 'mum', 'level', 'and', 'fs', 'scale', 'beam', 'size', 'and', 'bunch', 'length', 'respectively', 'are', 'requested', 'the', 'needed', 'to', 'separate', 'the', 'driver', 'pulse', 'both', 'laser', 'or', 'beam', 'from', 'the', 'witness', 'accelerated', 'bunch', 'imposes', 'additional', 'constrains', 'for', 'the', 'diagnostics', 'we', 'plan', 'to', 'use', 'betatron', 'radiation', 'for', 'the', 'emittance', 'measurement', 'just', 'at', 'the', 'end', 'of', 'the', 'plasma', 'booster', 'while', 'other', 'singleshot', 'methods', 'must', 'be', 'proven', 'before', 'to', 'be', 'implemented', 'longitudinal', 'measurements', 'being', 'in', 'any', 'case', 'not', 'trivial', 'for', 'the', 'fs', 'level', 'bunch', 'length', 'seem', 'to', 'have', 'already', 'a', 'wider', 'range', 'of', 'possibilities']] | [-0.07542167498510988, 0.16123940368803838, -0.09023989992082314, 0.036399006485190316, -0.023748407736907597, -0.17339006286522288, -0.0015585976995199041, 0.44073039616893345, -0.22005833652299628, -0.3166242292747388, 0.09660232726414536, -0.22627579341825171, 0.04308495716019868, 0.2854771028421941, -0.03995014290672307, 0.10069368367868603, 0.07799134064417064, -0.019094314237484356, -0.05870714243992195, -0.19298420310266973, 0.254438671513211, 0.1668655662523473, 0.3175347167085491, 0.06906986503300312, 0.1318219281646295, -0.013529116747401704, 0.0059706763622314465, -0.03251290996863318, -0.09478564494302012, 0.07541309889357269, 0.2485596609341431, 0.13082857999631647, 0.28050912216494434, -0.45891019835873365, -0.22079030155003362, 0.04759445808237431, 0.14087292417469952, 0.11225777307793108, -0.05971713493855098, -0.2246090120033306, 0.07167290523039554, -0.17301808597118246, -0.13941932141655689, -0.013632202654882195, -0.032273150919601805, 0.05197839003156725, -0.26306023498924047, -0.0035466076471398467, 0.023915338603889242, 0.06615828716019595, -0.01942649451238514, -0.10490565142728193, 0.03603469446800601, 0.06257437383360381, 0.014931956141748848, 0.08486410359938756, 0.17871723771460502, -0.12628804572882266, -0.0959680498230691, 0.3611253725693506, -0.009312335106550284, -0.10603220465599127, 0.15741800726239197, -0.19517080686389912, -0.06878312200013384, 0.15388927015238532, 0.20053793425562189, 0.09181340921706721, -0.1462365155925463, 0.005072442822697043, 0.058323109367241464, 0.20605469987274214, 0.13252352645432006, 0.05660792835379397, 0.21646709894925795, 0.20456661371775944, 0.05902456882519319, 0.12929678327758534, -0.1590767972904799, 0.015344467994093506, -0.3119124856113998, -0.1312796122111453, -0.11580328638756685, 0.0005169167485600946, 0.021656241523291386, -0.09760445138794108, 0.4674568707792977, 0.1723580979261326, 0.12453786017726255, -0.037594049811375395, 0.3504043963731699, 0.0894016775552159, 0.0928395412743603, 0.05930306575888025, 0.23913093045159103, 0.09623800519301429, 0.13086181471513864, -0.21682884631331498, 0.03543690869925556, 0.0004969888910410767] |
1,802.05104 | An adaptive procedure for Fourier estimators: illustration to
deconvolution and decompounding | We introduce a new procedure to select the optimal cutoff parameter for
Fourier density estimators that leads to adaptive rate optimal estimators, up
to a logarithmic factor. This adaptive procedure applies for different inverse
problems. We illustrate it on two classical examples: deconvolution and
decompounding, i.e. non-parametric estimation of the jump density of a compound
Poisson process from the observation of n increments of length $\Delta$ > 0.
For this latter example, we first build an estimator for which we provide an
upper bound for its L 2-risk that is valid simultaneously for sampling rates
$\Delta$ that can vanish, $\Delta$ := $\Delta$ n $\rightarrow$ 0, can be fixed,
$\Delta$ n $\rightarrow$ $\Delta$ 0 > 0 or can get large, $\Delta$ n
$\rightarrow$ $\infty$ slowly. This last result is new and presents interest on
its own. Then, we show that the adaptive procedure we present leads to an
adaptive and rate optimal (up to a logarithmic factor) estimator of the jump
density.
| math.ST stat.TH | we introduce a new procedure to select the optimal cutoff parameter for fourier density estimators that leads to adaptive rate optimal estimators up to a logarithmic factor this adaptive procedure applies for different inverse problems we illustrate it on two classical examples deconvolution and decompounding ie nonparametric estimation of the jump density of a compound poisson process from the observation of n increments of length delta 0 for this latter example we first build an estimator for which we provide an upper bound for its l 2risk that is valid simultaneously for sampling rates delta that can vanish delta delta n rightarrow 0 can be fixed delta n rightarrow delta 0 0 or can get large delta n rightarrow infty slowly this last result is new and presents interest on its own then we show that the adaptive procedure we present leads to an adaptive and rate optimal up to a logarithmic factor estimator of the jump density | [['we', 'introduce', 'a', 'new', 'procedure', 'to', 'select', 'the', 'optimal', 'cutoff', 'parameter', 'for', 'fourier', 'density', 'estimators', 'that', 'leads', 'to', 'adaptive', 'rate', 'optimal', 'estimators', 'up', 'to', 'a', 'logarithmic', 'factor', 'this', 'adaptive', 'procedure', 'applies', 'for', 'different', 'inverse', 'problems', 'we', 'illustrate', 'it', 'on', 'two', 'classical', 'examples', 'deconvolution', 'and', 'decompounding', 'ie', 'nonparametric', 'estimation', 'of', 'the', 'jump', 'density', 'of', 'a', 'compound', 'poisson', 'process', 'from', 'the', 'observation', 'of', 'n', 'increments', 'of', 'length', 'delta', '0', 'for', 'this', 'latter', 'example', 'we', 'first', 'build', 'an', 'estimator', 'for', 'which', 'we', 'provide', 'an', 'upper', 'bound', 'for', 'its', 'l', '2risk', 'that', 'is', 'valid', 'simultaneously', 'for', 'sampling', 'rates', 'delta', 'that', 'can', 'vanish', 'delta', 'delta', 'n', 'rightarrow', '0', 'can', 'be', 'fixed', 'delta', 'n', 'rightarrow', 'delta', '0', '0', 'or', 'can', 'get', 'large', 'delta', 'n', 'rightarrow', 'infty', 'slowly', 'this', 'last', 'result', 'is', 'new', 'and', 'presents', 'interest', 'on', 'its', 'own', 'then', 'we', 'show', 'that', 'the', 'adaptive', 'procedure', 'we', 'present', 'leads', 'to', 'an', 'adaptive', 'and', 'rate', 'optimal', 'up', 'to', 'a', 'logarithmic', 'factor', 'estimator', 'of', 'the', 'jump', 'density']] | [-0.10556603491211393, 0.11085475191641168, -0.09258302774244717, 0.056090481099241155, -0.05835621559156022, -0.19495546786933188, 0.10422061661526763, 0.38517954262792115, -0.2990124909041129, -0.25990538245695793, 0.08769907748436401, -0.24896166241686246, -0.12856238970538944, 0.18463552816604875, -0.07025382812446351, 0.07018279161965653, 0.004280156713975653, 0.049086775154855614, -0.08911452391392487, -0.24036764167694102, 0.26331934872584617, 0.05799424301856642, 0.2244764666227256, -0.008066021840260097, 0.1066504385541816, -0.0038957160535701522, -0.011580310333342215, -0.0307094747360772, -0.23030549087090815, 0.05502974669965115, 0.24134363076252163, 0.11283290739079262, 0.3208175386142009, -0.3083860267451994, -0.1479621692041564, 0.144460572214548, 0.18409872403854777, 0.07552006268936097, 0.0021110216858589155, -0.22482149199297902, 0.11679773508633375, -0.14378249806879906, -0.1488819323008536, -0.08803313721718777, 0.029172608427181366, 0.005627760043735527, -0.4080199752489378, 0.11163244110822773, 0.08488131067448645, -0.01830136480130949, 0.0024830671138527573, -0.17532472614685346, 0.05430508758813427, 0.09110298577939296, 0.04840668540275181, 0.06081546205956086, 0.0948398125915533, -0.08061887013909828, -0.06574040239344642, 0.26504942218351896, -0.10820438907404614, -0.19969210951888614, 0.12314405644632828, -0.14000613698557873, -0.15490679490041864, 0.14957331838738766, 0.18509841085097212, 0.16181007116902502, -0.11075863755859766, 0.14815112572514813, -0.019418101496015718, 0.17392693408972518, 0.06691463395454891, -0.011996051379639631, 0.09492888448724321, 0.15188343672802565, 0.172499077172155, 0.1275167520681491, -0.126831559096552, -0.03249358717399608, -0.3630615349170888, -0.15613357291281058, -0.18571096297745018, 0.09725641862601991, -0.16658436303788124, -0.15945617657653086, 0.3001564587258799, 0.1478763813116576, 0.23417729961057046, 0.12668318988437985, 0.24207935731407185, 0.18984608658571628, -0.004327688576760375, 0.09606739798572603, 0.15192762819255234, 0.1043662582472216, 0.033990740977749706, -0.21882363877579522, 0.04961971246643336, 0.06854984398848217] |
1,802.05105 | Long-Term Decline of the Mid-Infrared Emission of Normal Galaxies: Dust
Echo of Tidal Disruption Flare? | We report the discovery of a sample of 19 low redshift (z<0.22)
spectroscopically non-Seyfert galaxies that show slow declining mid-infrared
(MIR) light-curves (LCs), similar to those of tidal disruption event (TDE)
candidates with extreme coronal lines. Two sources also showed a relatively
fast rising MIR LCs. They consist of 61% sample of the WISE MIR variable
non-Seyfert galaxies with SDSS spectra. In a comparison sample of optically
selected Seyfert galaxies, the fraction of sources with such a LC is only 15%.
After rejecting 5 plausible obscured Seyfert galaxies with red MIR colours,
remaining 14 objects are studied in detail in this paper. We fit the declining
part of LC with an exponential law, and the decay time is typically one year.
The observed peak MIR luminosities ($\nu L_\nu$) after subtracting host
galaxies are in the range of a few 10^42 to 10^44 erg~s^-1 with a median of
5x10^43 erg~s^-1 in the W2 band. The black hole masses distribute in a wide
range with more than half in between 10^7 to 10^8 ~M_sun, but significantly
different from that of optical/UV selected TDEs. Furthermore, MIR luminosities
are correlated with black hole masses, the stellar mass or luminosity of their
host bulges. Most galaxies in the sample are red and luminous with an absolute
magnitude of r between -20 to -23. We estimate the rate of event about 10^-4
gal^-1~yr^-1 among luminous red galaxies. We discuss several possibilities for
the variable infrared sources, and conclude that most likely, they are caused
by short sporadic fueling to the supermassive black holes via either the
instability of accretion flows or tidal disruption of stars.
| astro-ph.HE astro-ph.GA | we report the discovery of a sample of 19 low redshift z022 spectroscopically nonseyfert galaxies that show slow declining midinfrared mir lightcurves lcs similar to those of tidal disruption event tde candidates with extreme coronal lines two sources also showed a relatively fast rising mir lcs they consist of 61 sample of the wise mir variable nonseyfert galaxies with sdss spectra in a comparison sample of optically selected seyfert galaxies the fraction of sources with such a lc is only 15 after rejecting 5 plausible obscured seyfert galaxies with red mir colours remaining 14 objects are studied in detail in this paper we fit the declining part of lc with an exponential law and the decay time is typically one year the observed peak mir luminosities nu l_nu after subtracting host galaxies are in the range of a few 1042 to 1044 ergs1 with a median of 5x1043 ergs1 in the w2 band the black hole masses distribute in a wide range with more than half in between 107 to 108 m_sun but significantly different from that of opticaluv selected tdes furthermore mir luminosities are correlated with black hole masses the stellar mass or luminosity of their host bulges most galaxies in the sample are red and luminous with an absolute magnitude of r between 20 to 23 we estimate the rate of event about 104 gal1yr1 among luminous red galaxies we discuss several possibilities for the variable infrared sources and conclude that most likely they are caused by short sporadic fueling to the supermassive black holes via either the instability of accretion flows or tidal disruption of stars | [['we', 'report', 'the', 'discovery', 'of', 'a', 'sample', 'of', '19', 'low', 'redshift', 'z022', 'spectroscopically', 'nonseyfert', 'galaxies', 'that', 'show', 'slow', 'declining', 'midinfrared', 'mir', 'lightcurves', 'lcs', 'similar', 'to', 'those', 'of', 'tidal', 'disruption', 'event', 'tde', 'candidates', 'with', 'extreme', 'coronal', 'lines', 'two', 'sources', 'also', 'showed', 'a', 'relatively', 'fast', 'rising', 'mir', 'lcs', 'they', 'consist', 'of', '61', 'sample', 'of', 'the', 'wise', 'mir', 'variable', 'nonseyfert', 'galaxies', 'with', 'sdss', 'spectra', 'in', 'a', 'comparison', 'sample', 'of', 'optically', 'selected', 'seyfert', 'galaxies', 'the', 'fraction', 'of', 'sources', 'with', 'such', 'a', 'lc', 'is', 'only', '15', 'after', 'rejecting', '5', 'plausible', 'obscured', 'seyfert', 'galaxies', 'with', 'red', 'mir', 'colours', 'remaining', '14', 'objects', 'are', 'studied', 'in', 'detail', 'in', 'this', 'paper', 'we', 'fit', 'the', 'declining', 'part', 'of', 'lc', 'with', 'an', 'exponential', 'law', 'and', 'the', 'decay', 'time', 'is', 'typically', 'one', 'year', 'the', 'observed', 'peak', 'mir', 'luminosities', 'nu', 'l_nu', 'after', 'subtracting', 'host', 'galaxies', 'are', 'in', 'the', 'range', 'of', 'a', 'few', '1042', 'to', '1044', 'ergs1', 'with', 'a', 'median', 'of', '5x1043', 'ergs1', 'in', 'the', 'w2', 'band', 'the', 'black', 'hole', 'masses', 'distribute', 'in', 'a', 'wide', 'range', 'with', 'more', 'than', 'half', 'in', 'between', '107', 'to', '108', 'm_sun', 'but', 'significantly', 'different', 'from', 'that', 'of', 'opticaluv', 'selected', 'tdes', 'furthermore', 'mir', 'luminosities', 'are', 'correlated', 'with', 'black', 'hole', 'masses', 'the', 'stellar', 'mass', 'or', 'luminosity', 'of', 'their', 'host', 'bulges', 'most', 'galaxies', 'in', 'the', 'sample', 'are', 'red', 'and', 'luminous', 'with', 'an', 'absolute', 'magnitude', 'of', 'r', 'between', '20', 'to', '23', 'we', 'estimate', 'the', 'rate', 'of', 'event', 'about', '104', 'gal1yr1', 'among', 'luminous', 'red', 'galaxies', 'we', 'discuss', 'several', 'possibilities', 'for', 'the', 'variable', 'infrared', 'sources', 'and', 'conclude', 'that', 'most', 'likely', 'they', 'are', 'caused', 'by', 'short', 'sporadic', 'fueling', 'to', 'the', 'supermassive', 'black', 'holes', 'via', 'either', 'the', 'instability', 'of', 'accretion', 'flows', 'or', 'tidal', 'disruption', 'of', 'stars']] | [-0.041096945665166314, 0.1291661071546388, -0.014689091692437952, 0.14711574932572533, -0.08490900583443152, -0.0829800468649757, 0.07867291467628365, 0.4889960108248147, -0.07532325604309638, -0.3811408937402935, 0.07830288070114504, -0.37264674396536657, 0.008499109570577057, 0.2251444342142581, -0.06468378110092887, -0.03779004721323286, 0.013690509234314387, -0.1287208435584334, -0.04776155726921139, -0.3119527921394518, 0.26274769318949304, 0.030674048331444072, 0.13531763764265714, -0.11288886472115411, 0.045426815737750426, -0.09745340801017666, -0.09630469700028554, -0.057934442367613984, -0.13365285051765843, 0.013584885170704194, 0.27011180079318864, 0.11189209086269364, 0.2471779611215435, -0.31086578178217317, -0.15897682375293784, 0.10610113506404202, 0.20713912821392275, -0.003957522482993186, -0.08104951143700129, -0.22080078234630968, 0.10008025229760281, -0.22156033009429782, -0.15082281978263726, 0.10838862450284123, 0.10294266483831055, 0.05301702103825209, -0.18002737574157224, 0.19349108718404082, 0.02008928349398579, 0.08850475001996488, -0.1252768702372518, -0.07297631370580375, -0.08776392758743705, 0.008608034747384126, 0.07225380862072417, 0.06746394293293817, 0.21233204255501428, -0.14743673987076217, -0.03869166869926528, 0.3907366267750772, -0.033529786467441, 0.09189055745632907, 0.24580546204098377, -0.24269234232974243, -0.15180200865066676, 0.19155589639721962, 0.14500667762241504, 0.1467332241003812, -0.17382367081549507, -0.06525198944326759, 0.019485961609870574, 0.25084593379782855, 0.029331053982136514, 0.1411161456468135, 0.3393934543143386, 0.09423951552622718, -0.002055092143550627, 0.09540241249258828, -0.23514272807138076, 0.021197102970900605, -0.241784900229787, -0.053161353450564997, -0.11538822675116835, 0.15962351077543188, -0.17940620565596202, -0.10447001479123981, 0.3525764053052619, 0.05954283827759695, 0.2692512657043388, 0.07488907150373086, 0.2653762322372901, 0.08397861982533125, 0.129720458320485, 0.15222752744066315, 0.35436585186265607, 0.12722394367582288, 0.0593859479454789, -0.19922355989479087, 0.01124184896335815, 0.0027255883234577455] |
1,802.05106 | A simple simulation of quantum like behavior with a classical oscillator
/ Einfache Simulation von Quantensystemen mittels eines klassischen
Oszillator | Since years a classical oscillator is known representing fundamental
properties of quantum mechanical systems without the use of the demanding
mathematics of quantum theory. This allows to develop an intuitive notion in
introductory quantum theory lessons in high school and university. Spontaneous
and stimulated emission, quantization and collapse of the oscillator in analogy
to the collapse of the wave function and the probability interpretation are
clearly demonstrated, The simulation of the oscillator with the GNU Octave
software and the related code are presented.
----
Seit Jahren ist ein klassischer Oszillator bekannt, der es erlaubt einige
grundlegende Eigenschaften von quantenmechanischen Systemen darzustellen, ohne
die anspruchsvolle Mathematik der Quantenmechanik benutzen zu m\"ussen. Dadurch
ist es m\"oglich in der Schule und Hochschule in Kursen zur Einf\"uhrung in die
Quantenmechanik eine intuitive Vorstellung zur Quantenmechanik zu entwickeln
und Eigenschafen wie spontane und stimulierte Emission, Quantisierung und
Kollaps des Oszillator analog zum Kollaps der Wellenfunktion sowie die
zwanglose Einf\"uhrung der Wahrscheinlichkeitsinterpretation anschaulich
darzustellen. Die Simulation des Oszillator mittels der GNU Octave Software und
dem zugeh\"origen Quelltext wird gezeigt.
| physics.ed-ph physics.class-ph | since years a classical oscillator is known representing fundamental properties of quantum mechanical systems without the use of the demanding mathematics of quantum theory this allows to develop an intuitive notion in introductory quantum theory lessons in high school and university spontaneous and stimulated emission quantization and collapse of the oscillator in analogy to the collapse of the wave function and the probability interpretation are clearly demonstrated the simulation of the oscillator with the gnu octave software and the related code are presented seit jahren ist ein klassischer oszillator bekannt der es erlaubt einige grundlegende eigenschaften von quantenmechanischen systemen darzustellen ohne die anspruchsvolle mathematik der quantenmechanik benutzen zu mussen dadurch ist es moglich in der schule und hochschule in kursen zur einfuhrung in die quantenmechanik eine intuitive vorstellung zur quantenmechanik zu entwickeln und eigenschafen wie spontane und stimulierte emission quantisierung und kollaps des oszillator analog zum kollaps der wellenfunktion sowie die zwanglose einfuhrung der wahrscheinlichkeitsinterpretation anschaulich darzustellen die simulation des oszillator mittels der gnu octave software und dem zugehorigen quelltext wird gezeigt | [['since', 'years', 'a', 'classical', 'oscillator', 'is', 'known', 'representing', 'fundamental', 'properties', 'of', 'quantum', 'mechanical', 'systems', 'without', 'the', 'use', 'of', 'the', 'demanding', 'mathematics', 'of', 'quantum', 'theory', 'this', 'allows', 'to', 'develop', 'an', 'intuitive', 'notion', 'in', 'introductory', 'quantum', 'theory', 'lessons', 'in', 'high', 'school', 'and', 'university', 'spontaneous', 'and', 'stimulated', 'emission', 'quantization', 'and', 'collapse', 'of', 'the', 'oscillator', 'in', 'analogy', 'to', 'the', 'collapse', 'of', 'the', 'wave', 'function', 'and', 'the', 'probability', 'interpretation', 'are', 'clearly', 'demonstrated', 'the', 'simulation', 'of', 'the', 'oscillator', 'with', 'the', 'gnu', 'octave', 'software', 'and', 'the', 'related', 'code', 'are', 'presented', 'seit', 'jahren', 'ist', 'ein', 'klassischer', 'oszillator', 'bekannt', 'der', 'es', 'erlaubt', 'einige', 'grundlegende', 'eigenschaften', 'von', 'quantenmechanischen', 'systemen', 'darzustellen', 'ohne', 'die', 'anspruchsvolle', 'mathematik', 'der', 'quantenmechanik', 'benutzen', 'zu', 'mussen', 'dadurch', 'ist', 'es', 'moglich', 'in', 'der', 'schule', 'und', 'hochschule', 'in', 'kursen', 'zur', 'einfuhrung', 'in', 'die', 'quantenmechanik', 'eine', 'intuitive', 'vorstellung', 'zur', 'quantenmechanik', 'zu', 'entwickeln', 'und', 'eigenschafen', 'wie', 'spontane', 'und', 'stimulierte', 'emission', 'quantisierung', 'und', 'kollaps', 'des', 'oszillator', 'analog', 'zum', 'kollaps', 'der', 'wellenfunktion', 'sowie', 'die', 'zwanglose', 'einfuhrung', 'der', 'wahrscheinlichkeitsinterpretation', 'anschaulich', 'darzustellen', 'die', 'simulation', 'des', 'oszillator', 'mittels', 'der', 'gnu', 'octave', 'software', 'und', 'dem', 'zugehorigen', 'quelltext', 'wird', 'gezeigt']] | [-0.09482860462418918, 0.052885210484462986, -0.13180599858791664, 0.028619893540724597, -0.020459616312692906, -0.2675745617566181, -0.05341034758001052, 0.2032537374998732, -0.14993668650076242, -0.17296674732472106, 0.03627515780851887, -0.40216228277432525, -0.17270581786609093, 0.2373025172968106, -0.16598914440657045, 0.05150947252465091, 0.04986711709021494, -0.16602440321625306, 0.036861154799959786, -0.20121113108310462, 0.18362383745482255, 0.13240052601402819, 0.2809336751378302, 0.0695656954118147, 0.056143801312508256, 0.07431681943928888, 0.02815823443063358, -0.12309710439294577, -0.23560327685855587, 0.04542556584266753, 0.3244910144086542, 0.10333574327062173, 0.38572461947413356, -0.39086717530314263, -0.04591079628544635, -0.00047644675339989623, 0.08764600717173568, 0.07960966334774576, 0.05938953514178765, -0.376882244363941, 0.006227015878940965, -0.3532875358383974, -0.032460896677241245, 0.002496056505559205, 0.032015653995090515, 0.0884772120300552, -0.13427095876942421, 0.15956692951891957, 0.05310388212112292, 0.12040041764106216, -0.042151470877760056, -0.1547856735499126, -0.058789442057303826, 0.053652164298270286, -0.21536600015302798, 0.017690652244371073, 0.15288118909209453, -0.026999192419943623, -0.024638224611508434, 0.3952945215563322, 0.002500005464615493, 0.002558277393209523, 0.185819796535336, -0.04273940674189863, -0.07937428617914175, -0.011276073988270144, 0.06818089979411714, 0.002229745107991942, -0.09079777480520565, 0.181476279558084, 0.10277186264293992, 0.15194604588463775, 0.2116640234622976, -0.07816680609248579, 0.15925523424842233, 0.05446934397412657, -0.09719975695399374, 0.041073032179526216, 0.0714207234025676, -0.09205786499098458, -0.19589533027389955, -0.25297490408451395, -0.12656469595265285, 0.1345360560731055, 0.059292426102108255, -0.3167488103282863, 0.2350991550736643, 0.09219743275236146, -0.06942042230853233, 0.05756423135352289, 0.19001194074236114, 0.008653415347738513, 0.031038023852582634, 0.09279266349842837, 0.20319679337714253, 0.14962942004043223, 0.2041841809091897, -0.2572508160121225, -0.07279682926962087, 0.1640020186659591] |
1,802.05107 | Engineering Dzyaloshinskii-Moriya interaction in B20 thin film chiral
magnets | Chiral magnetic Mn$_x$Fe$_{1-x}$Ge compounds have an antisymmetric exchange
interaction that is tunable with the manganese stoichiometric fraction, $x$.
Although millimeter-scale, polycrystalline bulk samples of this family of
compounds have been produced, thin-film versions of these materials will be
necessary for devices. In this study, we demonstrate the growth of epitaxial
Mn$_x$Fe$_{1-x}$Ge thin films on Si (111) substrates with a pure B20 crystal
structure in the stoichiometric fraction range x from 0 to 0.81. Following
systematic physical and magnetic characterization including microwave
absorption spectroscopy, we quantify the antisymmetric exchange interaction and
helical period as a function of $x$, which ranges from 200 nm to 8 nm. Our
results demonstrate an approach to engineering the size of magnetic skyrmions
in epitaxial films that are grown using scalable techniques.
| cond-mat.mtrl-sci | chiral magnetic mn_xfe_1xge compounds have an antisymmetric exchange interaction that is tunable with the manganese stoichiometric fraction x although millimeterscale polycrystalline bulk samples of this family of compounds have been produced thinfilm versions of these materials will be necessary for devices in this study we demonstrate the growth of epitaxial mn_xfe_1xge thin films on si 111 substrates with a pure b20 crystal structure in the stoichiometric fraction range x from 0 to 081 following systematic physical and magnetic characterization including microwave absorption spectroscopy we quantify the antisymmetric exchange interaction and helical period as a function of x which ranges from 200 nm to 8 nm our results demonstrate an approach to engineering the size of magnetic skyrmions in epitaxial films that are grown using scalable techniques | [['chiral', 'magnetic', 'mn_xfe_1xge', 'compounds', 'have', 'an', 'antisymmetric', 'exchange', 'interaction', 'that', 'is', 'tunable', 'with', 'the', 'manganese', 'stoichiometric', 'fraction', 'x', 'although', 'millimeterscale', 'polycrystalline', 'bulk', 'samples', 'of', 'this', 'family', 'of', 'compounds', 'have', 'been', 'produced', 'thinfilm', 'versions', 'of', 'these', 'materials', 'will', 'be', 'necessary', 'for', 'devices', 'in', 'this', 'study', 'we', 'demonstrate', 'the', 'growth', 'of', 'epitaxial', 'mn_xfe_1xge', 'thin', 'films', 'on', 'si', '111', 'substrates', 'with', 'a', 'pure', 'b20', 'crystal', 'structure', 'in', 'the', 'stoichiometric', 'fraction', 'range', 'x', 'from', '0', 'to', '081', 'following', 'systematic', 'physical', 'and', 'magnetic', 'characterization', 'including', 'microwave', 'absorption', 'spectroscopy', 'we', 'quantify', 'the', 'antisymmetric', 'exchange', 'interaction', 'and', 'helical', 'period', 'as', 'a', 'function', 'of', 'x', 'which', 'ranges', 'from', '200', 'nm', 'to', '8', 'nm', 'our', 'results', 'demonstrate', 'an', 'approach', 'to', 'engineering', 'the', 'size', 'of', 'magnetic', 'skyrmions', 'in', 'epitaxial', 'films', 'that', 'are', 'grown', 'using', 'scalable', 'techniques']] | [-0.13793250344949023, 0.1991634592322366, -0.011123962354876341, -0.0814323710163139, -0.02425280996718474, -0.1146711326662391, 0.059576512406384875, 0.47955483480191397, -0.2664539930410683, -0.33452550309800333, 0.014145484506790977, -0.31865282268864253, -0.07966376553175054, 0.21931046253209183, 0.04889732066752209, 0.008512698925070224, -0.02916726506819325, -0.12308313466623545, -0.10507909392547463, -0.2269794389825209, 0.24400773774569615, -0.004977254895493388, 0.3519198355985986, 0.062032823449220405, 0.03855340793022826, -0.04273811559147772, 0.14534449826568296, -0.010343939649887503, -0.20746877800070984, 0.08774164793712477, 0.2498792953884995, -0.094965152117619, 0.17220890453468346, -0.4565141263207601, -0.21031591650699416, 0.018952057418984272, 0.10906133544772127, 0.11298997355181435, -0.1256594146543648, -0.23862867484117048, 0.13686318899459776, -0.11640488485441423, -0.09265545356984442, -0.0867621612457198, -0.0045556940341127975, 0.002249501015138512, -0.26336506145138805, 0.05675488388195874, 0.021234847359723533, 0.1363169383407841, -0.1153794328543412, -0.1610290772045001, -0.1226177733906004, 0.020189184357502287, 0.029864420665563236, 0.054465333570636085, 0.19696853778910853, -0.08213005080113127, -0.12342045431385838, 0.33214322461947543, -0.052363796223465715, -0.07092592801387992, 0.13971734785797796, -0.18326923695783462, -0.09537710490140823, 0.17491702197284828, 0.16290644079121958, 0.14916554330604062, -0.1628914488288912, 0.09354520115659633, -0.012435888534509427, 0.26098308358397787, 0.08311768338429712, 0.09031639295825435, 0.21256999282406702, 0.20855832929279836, -0.02183849923500431, 0.14864389965688105, -0.12308433436274138, 0.032973723230703224, -0.18818452834520646, -0.21146810107353714, -0.19216051761759445, 0.13483061830629595, -0.1157478773044028, -0.20656635342616467, 0.35231188917532563, 0.14107048938110953, 0.13903491515215607, -0.07973407412364689, 0.19098269137283486, -0.0036649560018803084, 0.09151332557819607, -0.025593656479501195, 0.26488343906878015, 0.20223329777476348, 0.12969664858305366, -0.19453988635007502, 0.10654321835083407, -0.05535877855765002] |
1,802.05108 | Propagation of symmetric and non-symmetric lean hydrogen flames in
narrow channels: influence of heat losses | In this paper we present results of direct numerical simulations of lean
hydrogen/air flames freely propagating in a planar narrow channel with varying
flow rate, using detailed chemistry and transport and including heat losses
through the channel walls. Our simulations show that double solutions,
symmetric and non symmetric, can coexist for a given set of parameters. The
symmetric solutions are calculated imposing symmetric boundary conditions in
the channel mid plane and when this restriction is relaxed non symmetric
solutions can develop. This indicates that the symmetric solutions are unstable
to non symmetric perturbations, as predicted before within the context of a
thermo diffusive model and simplified chemistry. It is also found that for lean
hydrogen/air mixtures an increase in heat losses leads to a discontinuity of
the steady state response curve, with flames extinguishing inside a finite
interval of the flow rate. Non symmetric flames burn more intensely and in
consequence are much more robust to flame quenching by heat losses to the
walls. The inclusion of the non symmetric solutions extends therefore the
parametric range for which flames can propagate in the channel. This analysis
seems to have received no attention in the literature, even if it can have
important safety implications in micro scale combustion devices burning
hydrogen in a lean premixed way.
| physics.flu-dyn | in this paper we present results of direct numerical simulations of lean hydrogenair flames freely propagating in a planar narrow channel with varying flow rate using detailed chemistry and transport and including heat losses through the channel walls our simulations show that double solutions symmetric and non symmetric can coexist for a given set of parameters the symmetric solutions are calculated imposing symmetric boundary conditions in the channel mid plane and when this restriction is relaxed non symmetric solutions can develop this indicates that the symmetric solutions are unstable to non symmetric perturbations as predicted before within the context of a thermo diffusive model and simplified chemistry it is also found that for lean hydrogenair mixtures an increase in heat losses leads to a discontinuity of the steady state response curve with flames extinguishing inside a finite interval of the flow rate non symmetric flames burn more intensely and in consequence are much more robust to flame quenching by heat losses to the walls the inclusion of the non symmetric solutions extends therefore the parametric range for which flames can propagate in the channel this analysis seems to have received no attention in the literature even if it can have important safety implications in micro scale combustion devices burning hydrogen in a lean premixed way | [['in', 'this', 'paper', 'we', 'present', 'results', 'of', 'direct', 'numerical', 'simulations', 'of', 'lean', 'hydrogenair', 'flames', 'freely', 'propagating', 'in', 'a', 'planar', 'narrow', 'channel', 'with', 'varying', 'flow', 'rate', 'using', 'detailed', 'chemistry', 'and', 'transport', 'and', 'including', 'heat', 'losses', 'through', 'the', 'channel', 'walls', 'our', 'simulations', 'show', 'that', 'double', 'solutions', 'symmetric', 'and', 'non', 'symmetric', 'can', 'coexist', 'for', 'a', 'given', 'set', 'of', 'parameters', 'the', 'symmetric', 'solutions', 'are', 'calculated', 'imposing', 'symmetric', 'boundary', 'conditions', 'in', 'the', 'channel', 'mid', 'plane', 'and', 'when', 'this', 'restriction', 'is', 'relaxed', 'non', 'symmetric', 'solutions', 'can', 'develop', 'this', 'indicates', 'that', 'the', 'symmetric', 'solutions', 'are', 'unstable', 'to', 'non', 'symmetric', 'perturbations', 'as', 'predicted', 'before', 'within', 'the', 'context', 'of', 'a', 'thermo', 'diffusive', 'model', 'and', 'simplified', 'chemistry', 'it', 'is', 'also', 'found', 'that', 'for', 'lean', 'hydrogenair', 'mixtures', 'an', 'increase', 'in', 'heat', 'losses', 'leads', 'to', 'a', 'discontinuity', 'of', 'the', 'steady', 'state', 'response', 'curve', 'with', 'flames', 'extinguishing', 'inside', 'a', 'finite', 'interval', 'of', 'the', 'flow', 'rate', 'non', 'symmetric', 'flames', 'burn', 'more', 'intensely', 'and', 'in', 'consequence', 'are', 'much', 'more', 'robust', 'to', 'flame', 'quenching', 'by', 'heat', 'losses', 'to', 'the', 'walls', 'the', 'inclusion', 'of', 'the', 'non', 'symmetric', 'solutions', 'extends', 'therefore', 'the', 'parametric', 'range', 'for', 'which', 'flames', 'can', 'propagate', 'in', 'the', 'channel', 'this', 'analysis', 'seems', 'to', 'have', 'received', 'no', 'attention', 'in', 'the', 'literature', 'even', 'if', 'it', 'can', 'have', 'important', 'safety', 'implications', 'in', 'micro', 'scale', 'combustion', 'devices', 'burning', 'hydrogen', 'in', 'a', 'lean', 'premixed', 'way']] | [-0.11389048400681552, 0.1525725449008331, -0.08774506828563591, 0.017451797368351455, -0.06466197208717986, -0.13908510810132463, 0.01907037864547483, 0.3815643879649944, -0.247115147503656, -0.22074490905587757, 0.14797616610249376, -0.24445976082582113, -0.08196489194213132, 0.20177438051526456, -0.028565966962771708, 0.03734096517613114, 0.08471323098922365, -0.01423448869568664, -0.053899046215553616, -0.17564634332205928, 0.2971941815450961, 0.04161412489822481, 0.30062501725502483, 0.0515408118666951, 0.035783081174135034, -0.06396408034705145, -0.006393516837987443, 0.0319868125584583, -0.15245997205015874, 0.03394121860240608, 0.25472282973290045, 0.04358356264744734, 0.24298191676999248, -0.45947499441546064, -0.28660330807053763, 0.10570317404507118, 0.16008201075371267, 0.13520501749752478, -0.09852247123557771, -0.23228785935356172, 0.07852092401969225, -0.1988145747324885, -0.14756922246989804, -0.028163762158865846, 0.029091870140955718, 0.034952114587433115, -0.27691031556663126, 0.10233565040763878, 0.06186305571585721, 0.041198801713844026, -0.05493020146610053, -0.07322929998816446, -0.06855255520880915, 0.09306089155183737, 0.02636902252547876, -0.031554382099488444, 0.12614497015209392, -0.15357770630574566, -0.01706486420467669, 0.3906068995852175, -0.08047345370097563, -0.22277667551019856, 0.2205581808852595, -0.1529699950608923, -0.05722977154736602, 0.17596909297890095, 0.18340953231550927, 0.14531047769583935, -0.1454792231357207, 0.049653678021913526, -0.051455971876397555, 0.13951795351485788, 0.09929786441349532, -0.02619476588388775, 0.18090339210100992, 0.17069581005354087, 0.049357817876477576, 0.1744494258436959, -0.04378165439269397, -0.1445230091293884, -0.2899481430519805, -0.13785865858825314, -0.08320950938681097, 0.04885275021336193, -0.06330825500298551, -0.18406951292688678, 0.3426709203006223, 0.08055695809889585, 0.13837900346166693, 0.012578963263631733, 0.2828159040500691, 0.09734125770851808, 0.029946114175389844, 0.13671776274175837, 0.2590254072468121, 0.17647174667610332, 0.1203267280792081, -0.20795560733436846, 0.07817944586926769, 0.002167996538932933] |
1,802.05109 | Simple General Neron Desingularization in local ${\bf Q}$-algebras | In this form will appear in Communications in Algebra.
| math.AC | in this form will appear in communications in algebra | [['in', 'this', 'form', 'will', 'appear', 'in', 'communications', 'in', 'algebra']] | [-0.31648577604856754, 0.08325880434778002, -0.0923537847896417, 0.01730657859136247, -0.025859135306543775, -0.054375505074858665, -0.07510551520519787, 0.39548175036907196, -0.3121743036641015, -0.2358481710155805, 0.1245295040231819, -0.20870075250665346, -0.24276709142658445, 0.14147487231012848, -0.25600216786066693, -0.11474394301573436, 0.022666272681413427, 0.11510009856687652, -0.07434156702624427, -0.20957623318665558, 0.2381842186053594, -0.028780991004572973, 0.234513354073796, 0.006486418346563975, -0.1730140314127008, -0.0020579324207372135, -0.05074505590730243, -0.07949696346703503, -0.07674401284505923, 0.09464867185387346, 0.5150532523790995, 0.1344755683094263, 0.2903640907671716, -0.49487988981935715, -0.0838961982064777, 0.1019185965673791, 0.35508672065205044, 0.0544921358426412, -0.08349772873851988, -0.19378769232167137, -0.010328240692615509, -0.2625378287500805, -0.09364952064222759, 0.0010754416386286418, 0.04622418247163296, 0.0014871354732248518, -0.20251147738761371, 0.05722570367571381, 0.012119802128937509, 0.04467314316166772, -0.07488953818877538, -0.0008758082985877991, 0.029339201955331698, 0.030945432889792655, -0.14659333808554542, 0.02966290298435423, 0.02845842008375459, -0.18882830479803184, -0.1163729793495602, 0.424712799075577, -0.04779594805505541, -0.28431366311593187, 0.10358920610613293, -0.3185319784614775, -0.32154027600255275, 0.047140217282705836, 0.2914300031132168, -0.030302161971728008, -0.1414700465069877, 0.16217109633402693, -0.003023190216885673, -0.015833957741657894, 0.10158515949216154, 0.11567704503734906, 0.20931259045998254, 0.1236006658938196, 0.040925325722330146, 0.11820199764851066, 0.06251343505250083, -0.07034090823597378, -0.34894895263844067, -0.20801019171873728, -0.12657005774478117, 0.13871091769801247, 0.05526057879130045, -0.08180874751673804, 0.31177783516856533, 0.23991670293940437, 0.12433876428339216, -0.06113624880607757, 0.190165633128749, 0.07937358899248971, 0.2506579276588228, 0.12207728541559643, 0.3153674461775356, 0.10916874661213821, 0.22383871633145544, -0.003393714212709003, -0.053101325103650905, 0.04709259337849087] |
1,802.0511 | Geometry- and field-diversified electronic and optical properties in
bilayer silicene | The generalized tight-binding model has been developed to thoroughly explore
the essential electronic and optical properties of AB-bt bilayer silicene. They
are greatly diversified by the buckled structure, stacking configuration,
intralayer and interlayer hopping integrals, spin-orbital couplings; electric
and magnetic fields (${E_z\hat z}$ $\&$ ${B_z\hat z}$). There exist the linear,
parabolic and constant-energy-loop dispersions, multi-valley band structure and
semiconductor-metal transition as $E_z$ varies. The $E_z$-dependent magnetic
quantization exhibits the rich and unique Landau Levels (LLs) and
magneto-optical spectra. The LLs have the lower degeneracy, valley-created
localization centers, unusual distributions of quantum numbers, well-behaved
and abnormal energy spectra in $B_z$-dependences, and the absence of
anti-crossing behavior. A lot of pronounced magneto-absorption peaks occur at a
very narrow frequency range, being attributed to diverse excitation categories.
They have no specific selection rules except that the Dirac-cone band
structures are driven by the critical electric fields. The optical gaps are
reduced by $E_z$, but enhanced by $B_z$, in which the threshold channel might
dramatically change in the formed case. The above-mentioned characteristics are
in sharp contrast with those of layered graphenes.
| cond-mat.mtrl-sci | the generalized tightbinding model has been developed to thoroughly explore the essential electronic and optical properties of abbt bilayer silicene they are greatly diversified by the buckled structure stacking configuration intralayer and interlayer hopping integrals spinorbital couplings electric and magnetic fields e_zhat z b_zhat z there exist the linear parabolic and constantenergyloop dispersions multivalley band structure and semiconductormetal transition as e_z varies the e_zdependent magnetic quantization exhibits the rich and unique landau levels lls and magnetooptical spectra the lls have the lower degeneracy valleycreated localization centers unusual distributions of quantum numbers wellbehaved and abnormal energy spectra in b_zdependences and the absence of anticrossing behavior a lot of pronounced magnetoabsorption peaks occur at a very narrow frequency range being attributed to diverse excitation categories they have no specific selection rules except that the diraccone band structures are driven by the critical electric fields the optical gaps are reduced by e_z but enhanced by b_z in which the threshold channel might dramatically change in the formed case the abovementioned characteristics are in sharp contrast with those of layered graphenes | [['the', 'generalized', 'tightbinding', 'model', 'has', 'been', 'developed', 'to', 'thoroughly', 'explore', 'the', 'essential', 'electronic', 'and', 'optical', 'properties', 'of', 'abbt', 'bilayer', 'silicene', 'they', 'are', 'greatly', 'diversified', 'by', 'the', 'buckled', 'structure', 'stacking', 'configuration', 'intralayer', 'and', 'interlayer', 'hopping', 'integrals', 'spinorbital', 'couplings', 'electric', 'and', 'magnetic', 'fields', 'e_zhat', 'z', 'b_zhat', 'z', 'there', 'exist', 'the', 'linear', 'parabolic', 'and', 'constantenergyloop', 'dispersions', 'multivalley', 'band', 'structure', 'and', 'semiconductormetal', 'transition', 'as', 'e_z', 'varies', 'the', 'e_zdependent', 'magnetic', 'quantization', 'exhibits', 'the', 'rich', 'and', 'unique', 'landau', 'levels', 'lls', 'and', 'magnetooptical', 'spectra', 'the', 'lls', 'have', 'the', 'lower', 'degeneracy', 'valleycreated', 'localization', 'centers', 'unusual', 'distributions', 'of', 'quantum', 'numbers', 'wellbehaved', 'and', 'abnormal', 'energy', 'spectra', 'in', 'b_zdependences', 'and', 'the', 'absence', 'of', 'anticrossing', 'behavior', 'a', 'lot', 'of', 'pronounced', 'magnetoabsorption', 'peaks', 'occur', 'at', 'a', 'very', 'narrow', 'frequency', 'range', 'being', 'attributed', 'to', 'diverse', 'excitation', 'categories', 'they', 'have', 'no', 'specific', 'selection', 'rules', 'except', 'that', 'the', 'diraccone', 'band', 'structures', 'are', 'driven', 'by', 'the', 'critical', 'electric', 'fields', 'the', 'optical', 'gaps', 'are', 'reduced', 'by', 'e_z', 'but', 'enhanced', 'by', 'b_z', 'in', 'which', 'the', 'threshold', 'channel', 'might', 'dramatically', 'change', 'in', 'the', 'formed', 'case', 'the', 'abovementioned', 'characteristics', 'are', 'in', 'sharp', 'contrast', 'with', 'those', 'of', 'layered', 'graphenes']] | [-0.21425825165045498, 0.19250874571796311, -0.009955902638360423, 0.08052545763437816, -0.04003267007613043, -0.17723908767577978, 0.07098892572668125, 0.44827472019058306, -0.275084974492045, -0.32079058776647723, -0.020060424064217975, -0.2718452216222697, -0.1416246756163769, 0.14152968228707494, 0.04131062985370643, -0.0024313206024664013, 0.0038405687851853104, -0.06386565579896608, -0.06862056147503226, -0.1769870143146826, 0.29195715929653865, 0.024685689136494843, 0.3426666521243969, 0.0503101901679534, -0.006510111442031829, -0.0009582322540186476, 0.10711915936009218, 0.028324333477046406, -0.14296019292588527, 0.06584400540402932, 0.2579905645723035, -0.11665793110300618, 0.2171925912850825, -0.39540509273684776, -0.18330253606283634, 0.02483483185387102, 0.1750579620823836, 0.12016883893251659, -0.043687224682224426, -0.2806706005116456, 0.056257697961930385, -0.13091574786574722, -0.11380411600911913, -0.10426884655818909, -0.0003590614246258959, 0.02676768284611001, -0.19473071548643886, 0.11642116109421205, 0.044765078470829806, 0.11696866034851437, -0.10178039369325845, -0.16181680477191612, -0.14461174748064567, 0.06800523900279873, 0.039898406291429545, 0.0017534817088319108, 0.17174429539318758, -0.15348909770808758, -0.09225842097300317, 0.38370315087904705, -0.036674450288461356, -0.09411580133487059, 0.1929750353651399, -0.21453732509392026, -0.08300451982673802, 0.20696756069150846, 0.10387165510035747, 0.05500061122417363, -0.0944426781470664, 0.12796627560443904, 0.01200460967109457, 0.12058023151557631, 0.09744509437655191, 0.132020938566924, 0.2532686603783864, 0.09974777408159333, 0.03461434585123993, 0.08677515658490055, -0.1265628722697845, -0.04739161213173678, -0.17935995481450828, -0.09583688831523235, -0.16646311892338142, 0.06706966159998695, -0.06778483357944605, -0.21333371972316625, 0.44344794395657483, 0.08804072314141147, 0.20104233187855472, -0.070729730916972, 0.21712797360865083, 0.1933649387802896, 0.12422710702324297, 0.02584866990865622, 0.27734997955134566, 0.167992833005101, 0.11461919674252252, -0.23490755922911274, 0.043530399755885206, -0.02194175147723777] |
1,802.05111 | Bounds for twists of $\rm GL(3)$ $L$-functions | Let $\pi$ be a fixed Hecke--Maass cusp form for $\mathrm{SL}(3,\mathbb{Z})$
and $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be
a prime. Let $L(s,\pi\otimes \chi)$ be the $L$-function associated to
$\pi\otimes \chi$. In this paper, for any given $\varepsilon>0$, we establish a
subconvex bound $L(1/2+it, \pi\otimes \chi)\ll_{\pi, \varepsilon}
(M(|t|+1))^{3/4-1/36+\varepsilon}$, uniformly in both the $M$- and $t$-aspects.
| math.NT | let pi be a fixed heckemaass cusp form for mathrmsl3mathbbz and chi be a primitive dirichlet character modulo m which we assume to be a prime let lspiotimes chi be the lfunction associated to piotimes chi in this paper for any given varepsilon0 we establish a subconvex bound l12it piotimes chill_pi varepsilon mt134136varepsilon uniformly in both the m and taspects | [['let', 'pi', 'be', 'a', 'fixed', 'heckemaass', 'cusp', 'form', 'for', 'mathrmsl3mathbbz', 'and', 'chi', 'be', 'a', 'primitive', 'dirichlet', 'character', 'modulo', 'm', 'which', 'we', 'assume', 'to', 'be', 'a', 'prime', 'let', 'lspiotimes', 'chi', 'be', 'the', 'lfunction', 'associated', 'to', 'piotimes', 'chi', 'in', 'this', 'paper', 'for', 'any', 'given', 'varepsilon0', 'we', 'establish', 'a', 'subconvex', 'bound', 'l12it', 'piotimes', 'chill_pi', 'varepsilon', 'mt134136varepsilon', 'uniformly', 'in', 'both', 'the', 'm', 'and', 'taspects']] | [-0.2528512659736655, 0.13801585601812058, -0.16661288546906275, 0.001078756964257495, -0.12470878107388589, -0.2054224974729798, 0.042164722696708686, 0.24113153198903256, -0.32090481218289246, -0.22666423419617454, 0.05477198768322441, -0.2713201308114962, -0.08933597560548646, 0.19943547234447165, -0.058968992192636835, -0.0024745524903251365, 0.050304423124444754, 0.2007288677787239, -0.040277733221988785, -0.23105975064364345, 0.3384256234376649, -0.08973626419901848, 0.0693175366825678, 0.027252436259930783, 0.020180031750351192, -0.006664476475932381, 0.12151006351817738, -0.08389222849668428, -0.19951839843256908, 0.10397883958437226, 0.3266813454641537, -0.00736403146928007, 0.25753056997306306, -0.3508255395699631, -0.10757182406430894, 0.3259422276846387, 0.16819505214013836, -0.1305114417527379, 0.014398074802011251, -0.25551323518157004, 0.2512002945962277, -0.1700843813914451, -0.1452320272610946, -0.08370906422761354, 0.09140541235154326, -0.0037969294575635683, -0.4307920318096876, 0.00610126739537174, 0.11986419188959355, 0.10300581079315055, -0.08217483860525218, -0.19916717605665327, 0.057278341258114034, 0.03268904774026437, -0.015455207804387265, 0.156525272723626, 0.014659852593798529, -0.10754487856121903, -0.0035833976316181097, 0.3449022243646058, -0.13231242725794964, -0.29098536338318476, 0.026992015409368006, -0.23804282302206212, -0.16235480650582096, 0.07995776784690943, 0.14979880310764368, 0.15591005869209767, -0.007584644617004828, 0.2270936039170589, -0.13029007490047, 0.1682649779048833, 0.1340320105410435, -0.09361878081478855, 0.18916618776592342, 0.012089724212207578, 0.06648724662478675, 0.13317069515839897, -0.019199988517952574, 0.1032495931129564, -0.3769516266205094, -0.24742738681697202, -0.20392820217053997, 0.18660326417196882, -0.11805659325909801, -0.15535737342116507, 0.28245358278720895, 0.033220533179965886, 0.25403730313886297, 0.15710887260608036, 0.16197604587809605, 0.17423983170566235, 0.03265994016970084, 0.15463215739212252, 0.001150931151245128, 0.15787750408053397, -0.0753577336160974, -0.15936436521058733, 0.028232380383732644, 0.12690151919695464] |
1,802.05112 | Estimating Un-propped Fracture Conductivity and Fracture Compliance from
Diagnostic Fracture Injection Tests | Fractures are ubiquitous in the subsurface. The flow and mechanical
properties of these fractures are controlled by its compliance or stiffness.
Characterizing fracture compliance and conductivity is crucial in applications
such as fault zone studies, underground CO2 sequestration, nuclear waste
repositories, geothermal energy exploitation and hydrocarbon reservoir
development. In this study, we present a time convolution solution of pressure
transient behavior of a closing fracture. From Diagnostic Fracture Injection
Tests, our presented method can be used to estimate subsurface fracture
conductivity and compliance as a function of effective stress.
| physics.geo-ph | fractures are ubiquitous in the subsurface the flow and mechanical properties of these fractures are controlled by its compliance or stiffness characterizing fracture compliance and conductivity is crucial in applications such as fault zone studies underground co2 sequestration nuclear waste repositories geothermal energy exploitation and hydrocarbon reservoir development in this study we present a time convolution solution of pressure transient behavior of a closing fracture from diagnostic fracture injection tests our presented method can be used to estimate subsurface fracture conductivity and compliance as a function of effective stress | [['fractures', 'are', 'ubiquitous', 'in', 'the', 'subsurface', 'the', 'flow', 'and', 'mechanical', 'properties', 'of', 'these', 'fractures', 'are', 'controlled', 'by', 'its', 'compliance', 'or', 'stiffness', 'characterizing', 'fracture', 'compliance', 'and', 'conductivity', 'is', 'crucial', 'in', 'applications', 'such', 'as', 'fault', 'zone', 'studies', 'underground', 'co2', 'sequestration', 'nuclear', 'waste', 'repositories', 'geothermal', 'energy', 'exploitation', 'and', 'hydrocarbon', 'reservoir', 'development', 'in', 'this', 'study', 'we', 'present', 'a', 'time', 'convolution', 'solution', 'of', 'pressure', 'transient', 'behavior', 'of', 'a', 'closing', 'fracture', 'from', 'diagnostic', 'fracture', 'injection', 'tests', 'our', 'presented', 'method', 'can', 'be', 'used', 'to', 'estimate', 'subsurface', 'fracture', 'conductivity', 'and', 'compliance', 'as', 'a', 'function', 'of', 'effective', 'stress']] | [-0.0704846866114923, 0.14902113006565343, -0.04447398935915547, 0.007713835027194425, -0.03743700304309304, -0.07630579876765776, 0.02569796369683123, 0.35884126598078214, -0.32425836183842316, -0.26401727596622254, 0.1815780243441316, -0.28075949598647904, -0.1570269464877476, 0.19728023642307838, -0.05764368382083734, 0.1366402130682555, 0.06195653832025088, -0.08800169772185971, 0.026916411914601084, -0.13678220924502763, 0.20498972566630902, 0.09027166494032306, 0.34387713680410065, 0.16396861620184577, 0.009180176788627098, -0.03824797204402642, 0.009497488623882612, 0.06494206930981593, -0.1620841125926275, 0.11685064548019612, 0.3597576117216285, 0.05739839504514768, 0.25985319150632685, -0.5262821009268153, -0.29637539495577975, 0.05410096241851871, 0.0621984001848156, 0.04972883855944939, -0.02997094045884991, -0.21897997581033726, 0.009346510356899058, -0.17359631715781904, -0.13060303970522594, -0.10039003293639509, -0.0014276060830341296, 0.05382656635457566, -0.2164467023979883, 0.15074165571537235, 0.01703114259276497, 0.14591543697699738, -0.15334238640812298, -0.10929534854262732, -0.06430528606052688, 0.15113390771557023, 0.08535389881450264, -0.04564878815690872, 0.30484460160826865, -0.1650168628028327, -0.017424190490182196, 0.4282943263566226, -0.008579559507125759, -0.12994342812159088, 0.20903510946173515, -0.061621481555336144, -0.058143841646862836, 0.15746630704176895, 0.24641983014311683, 0.05019151000829225, -0.20970515796935627, -0.023147877821112783, 0.04498765078697647, 0.1173243418001057, 0.07231530550281319, -0.05918917411498809, 0.20319724797135155, 0.2894994333972422, 0.06667376434158408, 0.15806305465900622, -0.1189019849492509, 0.0018422700663547167, -0.31302967875819193, -0.23309450703306814, -0.17378436844649442, 0.050085997140934965, -0.10537747676638635, -0.2118201972445829, 0.3496247614953625, 0.11030412445974987, 0.08801682145345245, -0.012178607640808888, 0.28494336623489186, 0.03821672938549577, 0.10097163068156773, 0.0770269906765708, 0.25636398775523966, 0.14386113214285604, 0.14995060057452556, -0.2800575562705694, 0.17488608625455854, 0.03274104230660485] |
1,802.05113 | Multi-Criteria Virtual Machine Placement in Cloud Computing
Environments: A literature Review | Cloud computing is a revolutionary process that has impacted the manner of
using networks. It allows a high level of flexibility as Virtual Machines (VMs)
run elastically workloads on physical machines in data centers. The issue of
placing virtual machines (VMP) in cloud environments is an important challenge
that has been thoroughly addressed, although not yet completely resolved. This
article discusses the different problems that may disrupt the placement of VMs
and Virtual Network Functions (VNFs), and classifies the existing solutions
into five major objective functions based on multiple performance metrics such
as energy consumption, Quality of Service, Service Level Agreement, and
incurred cost. The existing solutions are also classified based on whether they
adopt heuristic, deterministic, meta-heuristic or approximation algorithms. The
VNF placement in 5G network is also discussed to highlight the convergence
toward optimal usage of mobile services by including
NFV/Software-Defined-Network technologies.
| cs.NI | cloud computing is a revolutionary process that has impacted the manner of using networks it allows a high level of flexibility as virtual machines vms run elastically workloads on physical machines in data centers the issue of placing virtual machines vmp in cloud environments is an important challenge that has been thoroughly addressed although not yet completely resolved this article discusses the different problems that may disrupt the placement of vms and virtual network functions vnfs and classifies the existing solutions into five major objective functions based on multiple performance metrics such as energy consumption quality of service service level agreement and incurred cost the existing solutions are also classified based on whether they adopt heuristic deterministic metaheuristic or approximation algorithms the vnf placement in 5g network is also discussed to highlight the convergence toward optimal usage of mobile services by including nfvsoftwaredefinednetwork technologies | [['cloud', 'computing', 'is', 'a', 'revolutionary', 'process', 'that', 'has', 'impacted', 'the', 'manner', 'of', 'using', 'networks', 'it', 'allows', 'a', 'high', 'level', 'of', 'flexibility', 'as', 'virtual', 'machines', 'vms', 'run', 'elastically', 'workloads', 'on', 'physical', 'machines', 'in', 'data', 'centers', 'the', 'issue', 'of', 'placing', 'virtual', 'machines', 'vmp', 'in', 'cloud', 'environments', 'is', 'an', 'important', 'challenge', 'that', 'has', 'been', 'thoroughly', 'addressed', 'although', 'not', 'yet', 'completely', 'resolved', 'this', 'article', 'discusses', 'the', 'different', 'problems', 'that', 'may', 'disrupt', 'the', 'placement', 'of', 'vms', 'and', 'virtual', 'network', 'functions', 'vnfs', 'and', 'classifies', 'the', 'existing', 'solutions', 'into', 'five', 'major', 'objective', 'functions', 'based', 'on', 'multiple', 'performance', 'metrics', 'such', 'as', 'energy', 'consumption', 'quality', 'of', 'service', 'service', 'level', 'agreement', 'and', 'incurred', 'cost', 'the', 'existing', 'solutions', 'are', 'also', 'classified', 'based', 'on', 'whether', 'they', 'adopt', 'heuristic', 'deterministic', 'metaheuristic', 'or', 'approximation', 'algorithms', 'the', 'vnf', 'placement', 'in', '5g', 'network', 'is', 'also', 'discussed', 'to', 'highlight', 'the', 'convergence', 'toward', 'optimal', 'usage', 'of', 'mobile', 'services', 'by', 'including', 'nfvsoftwaredefinednetwork', 'technologies']] | [-0.17416674482727332, 0.024721880037263458, -0.05197485518589668, 0.07378678417557671, -0.06292840739275765, -0.17687925302351898, 0.12436804745567741, 0.43073702918795437, -0.26161185898199363, -0.32727735784959855, 0.10377603343775874, -0.2326869540311554, -0.13603011798276404, 0.18008260023853437, -0.11530592029757954, 0.10475204844057065, 0.10186382521178339, -0.021230905968044604, 0.004659751595007712, -0.30641790791137885, 0.34182285127422113, 0.07648929057421384, 0.38149837481014276, 0.09165211103960767, 0.06334710290323343, -0.033003682015020845, -0.01605601701661586, 4.5299109957226505e-05, -0.03490756786752198, 0.12688887186700126, 0.31054616708249844, 0.2431564387894672, 0.3342411147521718, -0.48635500574393287, -0.17901485620743848, 0.08650875801462322, 0.20808687867023623, 0.012316949085912087, -0.04621766318664381, -0.24726150513112127, 0.10138140124809387, -0.2068636862241982, -0.11306789873568407, -0.06567149316416597, -0.020472322375728533, 0.06540904384940029, -0.19993468653085036, -0.042037074969042666, -0.04851646817100423, 0.012635978658836648, -0.08284228165850525, -0.14006940730345938, 0.023419587325851816, 0.16471574780648457, 0.01885156396436961, 0.031811824599622875, 0.19222132352480364, -0.15192079054268234, -0.1778154771179091, 0.44175724907928, 0.028129308406341744, -0.19957815386253977, 0.22199102178202956, 0.01765515812561958, -0.1913997607559643, 0.09790003510400444, 0.2474460196648757, 0.07067988279692412, -0.22312057524381396, 0.06452628124669728, 0.021856604535555976, 0.13216304572598708, 0.058710219686968136, 0.05300043493632831, 0.18684001228368313, 0.2504661030549608, 0.08582213812774711, 0.1092926565284183, -0.0246895499498147, -0.13325991492939893, -0.17474855133861472, -0.13343874587501575, -0.19360318954486946, 0.0024609656197912794, -0.06869837709092388, -0.15876471319795957, 0.3396294220054353, 0.1471275301443387, 0.13351904985924753, 0.07640516963767839, 0.4070676966485652, 0.0775802584065424, 0.1264788857742597, 0.14539391120205392, 0.19586720868743226, -0.022997312259150447, 0.18060508602904482, -0.1471778559612462, 0.14463850798189537, 0.02553394074727605] |
1,802.05114 | Comparison between CS and JPEG in terms of image compression | The comparison between two approaches, JPEG and Compressive Sensing, is done
in the paper. The approaches are compared in terms of image compression.
Comparison is done by measuring the image quality versus number of samples used
for image recovering. Images are visually compared. Also, numerical quality
value, PSNR, is calculated and compared for the two approaches. It is shown
that images, recovered by using the Compressive Sensing approach, have higher
PSNR values compared to the images under JPEG compression. Difference is larger
in grayscale images with small number of details, like e.g. medical images
(x-ray). The theory is supported by the experimental results.
| eess.IV cs.MM | the comparison between two approaches jpeg and compressive sensing is done in the paper the approaches are compared in terms of image compression comparison is done by measuring the image quality versus number of samples used for image recovering images are visually compared also numerical quality value psnr is calculated and compared for the two approaches it is shown that images recovered by using the compressive sensing approach have higher psnr values compared to the images under jpeg compression difference is larger in grayscale images with small number of details like eg medical images xray the theory is supported by the experimental results | [['the', 'comparison', 'between', 'two', 'approaches', 'jpeg', 'and', 'compressive', 'sensing', 'is', 'done', 'in', 'the', 'paper', 'the', 'approaches', 'are', 'compared', 'in', 'terms', 'of', 'image', 'compression', 'comparison', 'is', 'done', 'by', 'measuring', 'the', 'image', 'quality', 'versus', 'number', 'of', 'samples', 'used', 'for', 'image', 'recovering', 'images', 'are', 'visually', 'compared', 'also', 'numerical', 'quality', 'value', 'psnr', 'is', 'calculated', 'and', 'compared', 'for', 'the', 'two', 'approaches', 'it', 'is', 'shown', 'that', 'images', 'recovered', 'by', 'using', 'the', 'compressive', 'sensing', 'approach', 'have', 'higher', 'psnr', 'values', 'compared', 'to', 'the', 'images', 'under', 'jpeg', 'compression', 'difference', 'is', 'larger', 'in', 'grayscale', 'images', 'with', 'small', 'number', 'of', 'details', 'like', 'eg', 'medical', 'images', 'xray', 'the', 'theory', 'is', 'supported', 'by', 'the', 'experimental', 'results']] | [-0.03874051755235431, 0.008244372818402006, -0.057295835296650534, 0.059263686344334945, 0.018907150796171533, -0.12074475069202537, -0.03456195247657959, 0.4771584286670951, -0.22300767265621899, -0.354573807055221, 0.1270412590492571, -0.31988098336727294, -0.14670791370269742, 0.2542134209273799, -0.16356408787728513, 0.10508901568808371, 0.10232440923856011, 0.04652380125904546, -0.11279734027644311, -0.2902449511570259, 0.2520925659116683, 0.06339597413587628, 0.4039259635147105, -0.05015514377624393, 0.04400836983333948, -0.03393688567719667, -0.0845608508069683, 0.07989856096219669, -0.053276441293190466, 0.11862649331863934, 0.28225907592274685, 0.14195134509811874, 0.24367551678719307, -0.3941495208955795, -0.22914398015811316, 0.02079826389954796, 0.1317990986336174, 0.062351341612492374, -0.10770938884991321, -0.30614438325673055, 0.17513814598132033, -0.10030834476273616, 0.07288134792023926, -0.10132140949259973, -0.033087343812775484, -0.016435447192254763, -0.2946629202336941, 0.11810275547300213, -0.028809518282057592, 0.10266325545036098, -0.10912241191304858, -0.16465803086124722, 0.04855784702395062, 0.14492322677787103, 0.08044231340777382, 0.0945137280120867, 0.16737639387725917, -0.2086979558745634, -0.07458545461758176, 0.4605478983625625, -0.04957856167360995, -0.2216258175824814, 0.1717828608307879, -0.07076172866560157, -0.03641548783527416, 0.17727420429328403, 0.09303685834233477, 0.09246811658162081, -0.09198273144192198, 0.007246422453656865, -0.019651736422143514, 0.19436183850534117, 0.17171566671176444, 0.027378404405628085, 0.09509560663379657, 0.1692416545792564, -0.011649727149984067, 0.1940940999385259, -0.17657081128179447, 0.012297284744173577, -0.17029723938265182, -0.10830443998057286, -0.2523389206882747, -0.05310124755855107, -0.13948918402040134, -0.0812764125799837, 0.37126164724688654, 0.22557643827195595, 0.213098067202542, 0.051551077677642256, 0.4294067529364697, 0.08480120802894958, 0.09392783118104472, -0.008278295216919149, 0.23197329453038937, 0.10441423257026207, 0.10357488046210368, -0.14031370741188598, 0.07551025288875748, 0.05502430719856932] |
1,802.05115 | The Hermite and Fourier transforms in sparse reconstruction of
sinusoidal signals | The paper observes the Hermite and the Fourier Transform domains in terms of
Frequency Hopping Spread Spectrum signals sparsification. Sparse signals can be
recovered from a reduced set of samples by using the Compressive Sensing
approach. The under-sampling and the reconstruction of those signals are also
analyzed in this paper. The number of measurements (available signal samples)
is varied and reconstruction performance is tested in all considered cases and
for both observed domains. The signal recovery is done using an adaptive
gradient based algorithm. The theory is verified with the experimental results.
| eess.SP cs.MM | the paper observes the hermite and the fourier transform domains in terms of frequency hopping spread spectrum signals sparsification sparse signals can be recovered from a reduced set of samples by using the compressive sensing approach the undersampling and the reconstruction of those signals are also analyzed in this paper the number of measurements available signal samples is varied and reconstruction performance is tested in all considered cases and for both observed domains the signal recovery is done using an adaptive gradient based algorithm the theory is verified with the experimental results | [['the', 'paper', 'observes', 'the', 'hermite', 'and', 'the', 'fourier', 'transform', 'domains', 'in', 'terms', 'of', 'frequency', 'hopping', 'spread', 'spectrum', 'signals', 'sparsification', 'sparse', 'signals', 'can', 'be', 'recovered', 'from', 'a', 'reduced', 'set', 'of', 'samples', 'by', 'using', 'the', 'compressive', 'sensing', 'approach', 'the', 'undersampling', 'and', 'the', 'reconstruction', 'of', 'those', 'signals', 'are', 'also', 'analyzed', 'in', 'this', 'paper', 'the', 'number', 'of', 'measurements', 'available', 'signal', 'samples', 'is', 'varied', 'and', 'reconstruction', 'performance', 'is', 'tested', 'in', 'all', 'considered', 'cases', 'and', 'for', 'both', 'observed', 'domains', 'the', 'signal', 'recovery', 'is', 'done', 'using', 'an', 'adaptive', 'gradient', 'based', 'algorithm', 'the', 'theory', 'is', 'verified', 'with', 'the', 'experimental', 'results']] | [-0.10565908267365201, 0.07688706255984194, -0.07791342072026886, 0.014928902037512593, -0.02657575378417159, -0.11030318166392492, 0.009419042218486657, 0.39778984052574506, -0.307987500817272, -0.2992583834566176, 0.17027370129716987, -0.27993008061109675, -0.17826235411263516, 0.22133951403362595, -0.06892032924351162, 0.08438042958226541, 0.09660041971010683, 0.030460961507228407, -0.06860953767824432, -0.24796085349162636, 0.24557341404927327, 0.06611615412301668, 0.3216869166708025, -0.044609697819080044, 0.0699763760102265, 0.025890985321577475, -0.07670029735638072, 0.03457689213291815, -0.06018881739684097, 0.10231227894394618, 0.2879338093942193, 0.1535768450253272, 0.20747430024304145, -0.4024218007841188, -0.2393993169028798, 0.09874950920272133, 0.1446436706996199, 0.09253497831725879, -0.10857167695750199, -0.31150383941080095, 0.0962539057135987, -0.08940441916575251, -0.01673687671048, -0.0695739151282317, -0.06980427467952603, 0.030832835149181927, -0.35641237091192085, 0.11013021993004139, 0.009341380234969698, 0.06370852522693736, -0.06932284808515207, -0.13692860741613674, 0.046208508730278874, 0.12806173947983948, 0.03097559320335479, 0.020442384335657825, 0.1239199967973906, -0.09404697561504967, -0.12016077557295236, 0.37127599800410477, -0.06287135960756922, -0.21760904023666744, 0.15427188458093238, -0.14428517166221433, -0.08454839083487573, 0.16739613509170062, 0.17517868923428265, 0.11361947378305637, -0.15658657787666333, 0.07558738988186435, 0.004579236953640761, 0.17348043428248036, 0.0691334976784318, 0.02270395820454249, 0.08035132059898309, 0.16161458535403336, 0.042099007760913555, 0.14771719737378272, -0.16305991284468252, 0.0018485228128670512, -0.2445442902510125, -0.07982810497607874, -0.2946660116874188, -0.0691087783855872, -0.09527514042755407, -0.11090273614567907, 0.442417043969845, 0.15960938940533315, 0.1915135483621903, 0.05731602209245624, 0.35007137959094153, 0.14885919943781514, 0.038397441673821406, 0.03719771295563196, 0.22397284038648332, 0.15116845613153165, 0.10467085584431239, -0.17927878593479324, 0.06857433739502955, 0.014184242352316885] |
1,802.05116 | Thermodynamic Properties of Holographic superfluids | Using the holographic model for spontaneous symmetry breaking, we study some
properties of the dual superfluid such as the thermodynamic exponents,
Joule-Thomson coefficient, compressibility etc. Our focus is on how these
properties vary with the scaling dimension and the charge of the operator that
undergoes condensation.
| hep-th cond-mat.quant-gas | using the holographic model for spontaneous symmetry breaking we study some properties of the dual superfluid such as the thermodynamic exponents joulethomson coefficient compressibility etc our focus is on how these properties vary with the scaling dimension and the charge of the operator that undergoes condensation | [['using', 'the', 'holographic', 'model', 'for', 'spontaneous', 'symmetry', 'breaking', 'we', 'study', 'some', 'properties', 'of', 'the', 'dual', 'superfluid', 'such', 'as', 'the', 'thermodynamic', 'exponents', 'joulethomson', 'coefficient', 'compressibility', 'etc', 'our', 'focus', 'is', 'on', 'how', 'these', 'properties', 'vary', 'with', 'the', 'scaling', 'dimension', 'and', 'the', 'charge', 'of', 'the', 'operator', 'that', 'undergoes', 'condensation']] | [-0.12207771465182304, 0.22684926201548913, -0.08295453157599854, 0.021533733833601455, -0.056838211309893624, -0.10543010665265762, 0.029513546913538292, 0.3153395367224458, -0.2635750481049004, -0.19253745478699388, 0.10457039732769456, -0.34312836801552254, -0.18198688781779745, 0.13025847797626225, 0.04459157827026818, 0.06504631321877241, -0.11710888062320325, 0.05996170065001301, -0.15118449399470474, -0.17260324377971498, 0.3702080010679429, 0.02000914785363104, 0.35595277399229613, 0.13692368968875837, 0.0408915170043221, -0.02542608945820931, 0.05921320759934252, 0.021379394132805908, -0.23103114504587924, 0.022524076351976913, 0.14951986708404982, 0.04678363788812219, 0.12005079526494702, -0.4028711180891032, -0.257279129759611, 0.09772749702729609, 0.11747659026118724, 0.09364559853692418, -0.077687281581229, -0.22485842748099696, 0.02815287987418149, -0.1767845514189938, -0.17529335298130047, -0.13355672693527912, 0.00016722023365614206, 0.014731716136853009, -0.21327620660683708, 0.17283535179803552, 0.08097351097461322, 0.10008907677484272, -0.07971493597142398, -0.0571975613458325, -0.06594678102081399, 0.12194331322098151, 0.10669587533566696, -0.026255965774433444, 0.18389559236770173, -0.1717987776045566, -0.0779552407886671, 0.3869680228906319, -0.04792634685240362, -0.18972461786040146, 0.16980108175345737, -0.12769696930342395, -0.16177994652610758, 0.0655296667397994, 0.13443634875559085, 0.1157480537203019, -0.06552100716077763, 0.08478553797518228, -0.060627821465933936, 0.16738887353921714, 0.031292945890606425, 0.10228203079136818, 0.18645529084555482, 0.15927164522050272, -0.013853086938109735, 0.21100922217390136, -0.05519835415559456, -0.14387369621545076, -0.33769220134000416, -0.1722703264904735, -0.19598335607746697, 0.06526106525131542, -0.16160081865477285, -0.15853072522440925, 0.40238448750713596, 0.19185129972174764, 0.24257888873715117, 0.02711039196456904, 0.22042567786031766, 0.1597490030158635, 0.07353330642470847, 0.026114534121006727, 0.24375514218231925, 0.12859165769718264, 0.11686711378759988, -0.3716091289812618, 0.023307943331968527, 0.16712090972325075] |
1,802.05117 | Frechet bounds of the 1-st kind for sets of half-rare events | Frechet bounds of the 1-st kind for sets of events and its main properties
are considered. The lemma on not more than two nonzero values of lower
Frechet-bounds of the 1-st kind for a set of half-rare events is proved with
the corollary on the analogous assertion for sets of events with arbitrary
event-probability distributions.
| math.GM | frechet bounds of the 1st kind for sets of events and its main properties are considered the lemma on not more than two nonzero values of lower frechetbounds of the 1st kind for a set of halfrare events is proved with the corollary on the analogous assertion for sets of events with arbitrary eventprobability distributions | [['frechet', 'bounds', 'of', 'the', '1st', 'kind', 'for', 'sets', 'of', 'events', 'and', 'its', 'main', 'properties', 'are', 'considered', 'the', 'lemma', 'on', 'not', 'more', 'than', 'two', 'nonzero', 'values', 'of', 'lower', 'frechetbounds', 'of', 'the', '1st', 'kind', 'for', 'a', 'set', 'of', 'halfrare', 'events', 'is', 'proved', 'with', 'the', 'corollary', 'on', 'the', 'analogous', 'assertion', 'for', 'sets', 'of', 'events', 'with', 'arbitrary', 'eventprobability', 'distributions']] | [-0.12082382071933423, 0.10287656781908411, -0.07121998225696959, 0.13450848163651805, -0.03420966919153356, -0.03456695558718191, 0.0591652961447835, 0.2855268548815869, -0.19066845468030527, -0.3109390559212233, 0.12788532321484616, -0.32096148061548146, -0.08927400871359098, 0.3137987467746895, -0.04761307462691688, 0.03373261403808451, 0.06926255968685907, 0.1149176406996468, -0.06717800162956476, -0.26300341417439854, 0.37916144155539, -0.026656492577435877, 0.22947157708516058, 0.04726867341937927, 0.10993626243613946, -0.011828850874175819, -0.05061938208886064, -0.013376525352494074, -0.11992907461423713, 0.12702705534264588, 0.19717040689339718, 0.11374517749600972, 0.2555449475050689, -0.3663335860563585, -0.1465675805050593, 0.1627341148739036, 0.0431797691853717, 0.04750182010376683, 0.004428469082015978, -0.2904821718111634, 0.15812722074602228, -0.11595740441519481, -0.14652509587064672, -0.025645549032980434, 0.07658171868668152, 0.060062809560734495, -0.2835163119105765, 0.06502842999851474, 0.14187431371269318, 0.07844456253000177, -0.07073641890131582, -0.14788808730932382, -0.040442963753146335, 0.09622633513600494, 0.03857758166178918, -0.016653927947537832, 0.02874674556705241, -0.0919318611984356, -0.1634391130736241, 0.3835254112043633, -0.04297863867255868, -0.2089437387095621, 0.18540348313175714, -0.20164597863689637, -0.15638842013700363, 0.10353268341770253, 0.14730716537899122, 0.15364493954425248, -0.11536212138330135, 0.0347924539808166, -0.04558853308956783, 0.10460953156535442, 0.12985638558613852, 0.06436417429134823, 0.1434902919886204, 0.11552203368717948, 0.14692792024176854, 0.15463844135117072, -0.05563429389328051, -0.07406583614647388, -0.3826185098061195, -0.1397404964440144, -0.2152969791338994, 0.024752955225826902, -0.10718922573113769, -0.20143418253820317, 0.36807276480473006, 0.09498558032702512, 0.22286452990598404, 0.0914399388891, 0.23635020178671068, 0.13874847545594093, 0.048894890754197076, 0.04676165033239298, 0.2125930913294164, 0.15830178694942823, 0.04547156302186732, -0.05501840443153364, 0.15521030468293107, 0.1445527950910708] |
1,802.05118 | Key Lessons from Tailoring Agile Methods for Large-Scale Software
Development | We describe advice derived from one of the largest development programs in
Norway, where twelve Scrum teams combined agile practices with traditional
project management. The Perform program delivered 12 releases over a four-year
period, and finished on budget and on time. In this article, we summarize 12
key lessons on five crucial topics, relevant to other large development
projects seeking to combine Scrum with traditional project management.
| cs.SE | we describe advice derived from one of the largest development programs in norway where twelve scrum teams combined agile practices with traditional project management the perform program delivered 12 releases over a fouryear period and finished on budget and on time in this article we summarize 12 key lessons on five crucial topics relevant to other large development projects seeking to combine scrum with traditional project management | [['we', 'describe', 'advice', 'derived', 'from', 'one', 'of', 'the', 'largest', 'development', 'programs', 'in', 'norway', 'where', 'twelve', 'scrum', 'teams', 'combined', 'agile', 'practices', 'with', 'traditional', 'project', 'management', 'the', 'perform', 'program', 'delivered', '12', 'releases', 'over', 'a', 'fouryear', 'period', 'and', 'finished', 'on', 'budget', 'and', 'on', 'time', 'in', 'this', 'article', 'we', 'summarize', '12', 'key', 'lessons', 'on', 'five', 'crucial', 'topics', 'relevant', 'to', 'other', 'large', 'development', 'projects', 'seeking', 'to', 'combine', 'scrum', 'with', 'traditional', 'project', 'management']] | [-0.054434238599418705, 0.04015554394572973, -0.05357310939371697, 0.03729480825913653, -0.12419593155578669, -0.11455452219068782, 0.06416629040752773, 0.3646309473013172, -0.20689210668206215, -0.38185770759609206, 0.18898435473727035, -0.3122538545572046, -0.07423134277915276, 0.23631820405152307, -0.10154795300549091, 0.02480763517282799, 0.12219868753619714, -0.022657636386245045, -0.0029926544008429035, -0.3574552735897587, 0.278850594452068, 0.11412796789585654, 0.3221054145955105, -0.04886869902708637, 0.04535118579419691, 0.02825064523451364, -0.16775640128953592, -0.07432825953713548, -0.16375670618196922, 0.15786438279632312, 0.38638474640728376, 0.2684995452482462, 0.37129984962851253, -0.4471421262888766, -0.10709329479054283, 0.02989535609524308, 0.08940514236855418, -0.007398363953428482, -0.0034547649765275974, -0.26747984758842347, -0.020178523456761195, -0.24280102678866528, -0.11423575955985198, -0.06100966104127314, -0.01631340050180234, 0.0034005965050587905, -0.14775939507552407, -0.10158416768535972, -0.03957941156547906, 0.1266410542241951, -0.06148278237139778, -0.24087408073802494, 0.052008268937690935, 0.22054461794974867, 0.06812756411286432, 0.06431288973414409, 0.13529750999626217, -0.08658736314165837, -0.19243827114687928, 0.3894010498674948, -0.05540403479070806, -0.046764039121735004, 0.17714031935502678, -0.11690872143120018, -0.25281567140412864, 0.07459953204909367, 0.292530494227783, 0.05576127800228658, -0.21493217333762057, 0.01665098750994214, 0.08248201431706548, 0.22842446722979867, 0.009361542389491823, -0.0450344609041045, 0.2162708899478859, 0.26205350878412154, 0.06075276138691871, 0.08473349454440872, -0.03776903424773421, -0.14960816811158587, -0.278925961578515, -0.11671354576472694, -0.07725669285490998, 0.05101327149809074, 0.034077608951370915, -0.0601893340084535, 0.4190709079379466, 0.1809163180722007, 0.056069049588057085, 0.006055988913485364, 0.29844300920115924, -0.04359226001760186, 0.1253654113130161, 0.09973206387749359, 0.17372294730826546, -0.05764020448411578, 0.22418300120625645, -0.14862649743584222, 0.058387943953553685, -0.010534725798321749] |
1,802.05119 | Random Switching for High Performance DC-DC Power Converters | Random Pulse Width Modulation (RPWM) has been successfully applied in power
electronics for nearly 30 years. The effects of the various possible RPWM
strategies on the Power Spectral Density have been thoroughly studied. Despite
the effectiveness of RPWM in spreading harmonic content, an appeal is
consistently made to maintain the textbook Pulse Width Modulation scheme 'on
average'. Random Switching (RS) does away with this notion and
probabilistically operates the switch. In addition to fulfilling several
optimality conditions, including being the only viable switching strategy at
the theoretical limit of performance and having lower switching losses than any
other RPWM; RS allows for design of the DC behaviour separately from that of
the PSD. The pulse amplitude probability affects the DC and total PSD. The
first and second moment of the pulse length probability distribution affects
the shape of the envelope of the noise of the PSD. The minimum pulse length
acts like a selective harmonic filter. The PSD can therefore be shaped without
external filtering by changing these probabilities. Gaussian and Huffman pulse
length probabilities are shown to be good choices depending on whether
real-time PSD control or spectrum usage are the design goal. In addition, it is
shown that C\'uk's state space averaging model applies to RS, with $D \to p$,
hence no new tools are needed to understand the low frequency behavior or
control performance. A benefit of closed loop random switching is that no
filtering of the controlled variable is required. Randomly responding in a
biased manner dependent on the error is hence shown to be useful. There are
several good reasons to consider RS for high performance applications.
| eess.SP | random pulse width modulation rpwm has been successfully applied in power electronics for nearly 30 years the effects of the various possible rpwm strategies on the power spectral density have been thoroughly studied despite the effectiveness of rpwm in spreading harmonic content an appeal is consistently made to maintain the textbook pulse width modulation scheme on average random switching rs does away with this notion and probabilistically operates the switch in addition to fulfilling several optimality conditions including being the only viable switching strategy at the theoretical limit of performance and having lower switching losses than any other rpwm rs allows for design of the dc behaviour separately from that of the psd the pulse amplitude probability affects the dc and total psd the first and second moment of the pulse length probability distribution affects the shape of the envelope of the noise of the psd the minimum pulse length acts like a selective harmonic filter the psd can therefore be shaped without external filtering by changing these probabilities gaussian and huffman pulse length probabilities are shown to be good choices depending on whether realtime psd control or spectrum usage are the design goal in addition it is shown that cuks state space averaging model applies to rs with d to p hence no new tools are needed to understand the low frequency behavior or control performance a benefit of closed loop random switching is that no filtering of the controlled variable is required randomly responding in a biased manner dependent on the error is hence shown to be useful there are several good reasons to consider rs for high performance applications | [['random', 'pulse', 'width', 'modulation', 'rpwm', 'has', 'been', 'successfully', 'applied', 'in', 'power', 'electronics', 'for', 'nearly', '30', 'years', 'the', 'effects', 'of', 'the', 'various', 'possible', 'rpwm', 'strategies', 'on', 'the', 'power', 'spectral', 'density', 'have', 'been', 'thoroughly', 'studied', 'despite', 'the', 'effectiveness', 'of', 'rpwm', 'in', 'spreading', 'harmonic', 'content', 'an', 'appeal', 'is', 'consistently', 'made', 'to', 'maintain', 'the', 'textbook', 'pulse', 'width', 'modulation', 'scheme', 'on', 'average', 'random', 'switching', 'rs', 'does', 'away', 'with', 'this', 'notion', 'and', 'probabilistically', 'operates', 'the', 'switch', 'in', 'addition', 'to', 'fulfilling', 'several', 'optimality', 'conditions', 'including', 'being', 'the', 'only', 'viable', 'switching', 'strategy', 'at', 'the', 'theoretical', 'limit', 'of', 'performance', 'and', 'having', 'lower', 'switching', 'losses', 'than', 'any', 'other', 'rpwm', 'rs', 'allows', 'for', 'design', 'of', 'the', 'dc', 'behaviour', 'separately', 'from', 'that', 'of', 'the', 'psd', 'the', 'pulse', 'amplitude', 'probability', 'affects', 'the', 'dc', 'and', 'total', 'psd', 'the', 'first', 'and', 'second', 'moment', 'of', 'the', 'pulse', 'length', 'probability', 'distribution', 'affects', 'the', 'shape', 'of', 'the', 'envelope', 'of', 'the', 'noise', 'of', 'the', 'psd', 'the', 'minimum', 'pulse', 'length', 'acts', 'like', 'a', 'selective', 'harmonic', 'filter', 'the', 'psd', 'can', 'therefore', 'be', 'shaped', 'without', 'external', 'filtering', 'by', 'changing', 'these', 'probabilities', 'gaussian', 'and', 'huffman', 'pulse', 'length', 'probabilities', 'are', 'shown', 'to', 'be', 'good', 'choices', 'depending', 'on', 'whether', 'realtime', 'psd', 'control', 'or', 'spectrum', 'usage', 'are', 'the', 'design', 'goal', 'in', 'addition', 'it', 'is', 'shown', 'that', 'cuks', 'state', 'space', 'averaging', 'model', 'applies', 'to', 'rs', 'with', 'd', 'to', 'p', 'hence', 'no', 'new', 'tools', 'are', 'needed', 'to', 'understand', 'the', 'low', 'frequency', 'behavior', 'or', 'control', 'performance', 'a', 'benefit', 'of', 'closed', 'loop', 'random', 'switching', 'is', 'that', 'no', 'filtering', 'of', 'the', 'controlled', 'variable', 'is', 'required', 'randomly', 'responding', 'in', 'a', 'biased', 'manner', 'dependent', 'on', 'the', 'error', 'is', 'hence', 'shown', 'to', 'be', 'useful', 'there', 'are', 'several', 'good', 'reasons', 'to', 'consider', 'rs', 'for', 'high', 'performance', 'applications']] | [-0.117368465099171, 0.12271547746442721, -0.0853847241737086, 0.0545491103780528, -0.08148079814055996, -0.17596622748382912, 0.057169415662623596, 0.44987662113099824, -0.2529911094197378, -0.29399607067316, 0.11016265825347844, -0.22471979164826208, -0.12234175093025244, 0.21261851914932375, -0.08878226971728005, 0.0719423482720345, 0.002396845889605953, 0.06024963973688024, -0.0552369569296385, -0.2417006075568669, 0.23862597054537263, 0.09556962907352104, 0.3289406023390344, 0.014680118088668892, 0.07824613446905879, 0.01373553508548994, -0.007758204704404008, -0.0025853042876755137, -0.07810125764537447, 0.0568229704652827, 0.2231522478211355, 0.11266308107904788, 0.26174463035291357, -0.4103039635759452, -0.24208923453650683, 0.11057080857359505, 0.12376807653731786, 0.08120873953624735, -0.0376696958480664, -0.2187637011572114, 0.11528899120527743, -0.1548439071606501, -0.10646712867976114, -0.03910704681218509, 0.03558660293044351, 0.0692804025656224, -0.2784864129258038, 0.027299001553470467, 0.06664625527418813, 0.01623374007116467, -0.010175706516492534, -0.1258177853161916, -0.010401827538801818, 0.13520710024706903, 0.03873280750594456, 0.005982086330487279, 0.15559778164391752, -0.10262802313683328, -0.10266914764226748, 0.3381931658463065, -0.054874152544212726, -0.20504430857421727, 0.14544299102261168, -0.12630059157852153, -0.06969337180820448, 0.1829652758306614, 0.1644519855735679, 0.09001902740196767, -0.1294654339493503, 0.05620554797649916, 0.04385556084511121, 0.23881555580455857, 0.10973943266467745, 0.062288255460828376, 0.1854584080227685, 0.15701197596974378, 0.09837666865716589, 0.1351699150978017, -0.10541906231340722, -0.09802741245121774, -0.2599673526317768, -0.07860843561966886, -0.17804705869832602, 0.04105949567586211, -0.07277878562075032, -0.13251899723636396, 0.4219537157788279, 0.1337955829711473, 0.17280163349260702, 0.04555360524231272, 0.31402891956792106, 0.16051571097953513, 0.04233045738046075, 0.058770495442831645, 0.22997104087191533, 0.1292020742617362, 0.08880055913138049, -0.24600559461836505, 0.12042074062005785, -0.016227820989649186] |
1,802.0512 | Brightness temperatures of galactic masers observed in the RadioAstron
project | We present estimates of brightness temperature for 5 galactic masers in
star-forming regions detected at space baselines. Very compact features with
angular sizes of about 23-60 micro arcsec were detected in these regions with
corresponding linear sizes of about 4-10 million km. Brightness temperatures
range from 1e+14 up to 1e+16 K.
| astro-ph.GA | we present estimates of brightness temperature for 5 galactic masers in starforming regions detected at space baselines very compact features with angular sizes of about 2360 micro arcsec were detected in these regions with corresponding linear sizes of about 410 million km brightness temperatures range from 1e14 up to 1e16 k | [['we', 'present', 'estimates', 'of', 'brightness', 'temperature', 'for', '5', 'galactic', 'masers', 'in', 'starforming', 'regions', 'detected', 'at', 'space', 'baselines', 'very', 'compact', 'features', 'with', 'angular', 'sizes', 'of', 'about', '2360', 'micro', 'arcsec', 'were', 'detected', 'in', 'these', 'regions', 'with', 'corresponding', 'linear', 'sizes', 'of', 'about', '410', 'million', 'km', 'brightness', 'temperatures', 'range', 'from', '1e14', 'up', 'to', '1e16', 'k']] | [-0.028307009524866648, 0.17249531781656996, 0.016595795230173013, 0.00145450533897269, -0.02924421688486986, -0.06876880993299625, 0.03554746484402202, 0.4959578324182361, -0.13275791012554192, -0.4524732503820868, 0.08208527527840845, -0.3259785250924966, 0.1332419354048576, 0.22630692675125366, -0.014221171136288083, -0.05985289571039817, -0.002612340254891737, -0.05282964478543613, -0.14129405959929323, -0.23725622882336087, 0.20371694088566536, 0.05634889828369898, 0.12432136070713692, -0.003004201441345846, 0.12870038518061241, -0.22134681926200203, -0.0431504442046086, -0.025464210276350416, -0.17155597212852217, 0.05632047977140995, 0.36834592096434504, 0.06711924118309409, 0.20117994218918622, -0.2799327804652207, -0.19693241761449506, 0.025256360059275347, 0.12157269806473278, -0.02346315406555054, 0.04308109469346556, -0.3436221099075149, 0.13830767929846166, -0.1007596783559112, -0.22435213842739662, 0.050813499717133156, 0.11059417508031223, 0.009850641712546349, -0.17464339952258504, 0.1924933178861644, -0.008171716120605375, 0.208918670283667, -0.09095832300098504, -0.2182093266507282, -0.021436664202780117, 0.05317340491741311, -0.04558967791643797, 0.08058585595412582, 0.22703772127701372, -0.07334492834029245, 0.01614046499461812, 0.3315871116139141, -0.08321605644681875, 0.043881880922936926, 0.23714551201784143, -0.2856775367376851, -0.1384427390910466, 0.2897233698224905, 0.20833293854386783, 0.13990406862770519, -0.14423233142816552, -0.06633651584350303, -0.003976252843059746, 0.2904774801002121, 0.2021880741687674, 0.1301483040305731, 0.3247735811872225, 0.1095882601049893, 0.08229672918826633, 0.08806954007413165, -0.3685644768981957, -0.01087041606432667, -0.23827974933802204, 0.008062198420292606, -0.06602982210232784, 0.10298125832980755, -0.20957320452868647, -0.010876003141496695, 0.3483196225510362, 0.1418964332791374, 0.24184110179981766, 0.11796942245507357, 0.22926418052292338, -0.021509924396762952, 0.15828918421860128, 0.1909471472871362, 0.25938541935208964, 0.17812631818392843, 0.09650447072607338, -0.13821320353970662, -0.009334274248092198, -0.056163910958989] |
1,802.05121 | Co-training for Extraction of Adverse Drug Reaction Mentions from Tweets | Adverse drug reactions (ADRs) are one of the leading causes of mortality in
health care. Current ADR surveillance systems are often associated with a
substantial time lag before such events are officially published. On the other
hand, online social media such as Twitter contain information about ADR events
in real-time, much before any official reporting. Current state-of-the-art
methods in ADR mention extraction use Recurrent Neural Networks (RNN), which
typically need large labeled corpora. Towards this end, we propose a
semi-supervised method based on co-training which can exploit a large pool of
unlabeled tweets to augment the limited supervised training data, and as a
result enhance the performance. Experiments with 0.1M tweets show that the
proposed approach outperforms the state-of-the-art methods for the ADR mention
extraction task by 5% in terms of F1 score.
| cs.IR cs.CL | adverse drug reactions adrs are one of the leading causes of mortality in health care current adr surveillance systems are often associated with a substantial time lag before such events are officially published on the other hand online social media such as twitter contain information about adr events in realtime much before any official reporting current stateoftheart methods in adr mention extraction use recurrent neural networks rnn which typically need large labeled corpora towards this end we propose a semisupervised method based on cotraining which can exploit a large pool of unlabeled tweets to augment the limited supervised training data and as a result enhance the performance experiments with 01m tweets show that the proposed approach outperforms the stateoftheart methods for the adr mention extraction task by 5 in terms of f1 score | [['adverse', 'drug', 'reactions', 'adrs', 'are', 'one', 'of', 'the', 'leading', 'causes', 'of', 'mortality', 'in', 'health', 'care', 'current', 'adr', 'surveillance', 'systems', 'are', 'often', 'associated', 'with', 'a', 'substantial', 'time', 'lag', 'before', 'such', 'events', 'are', 'officially', 'published', 'on', 'the', 'other', 'hand', 'online', 'social', 'media', 'such', 'as', 'twitter', 'contain', 'information', 'about', 'adr', 'events', 'in', 'realtime', 'much', 'before', 'any', 'official', 'reporting', 'current', 'stateoftheart', 'methods', 'in', 'adr', 'mention', 'extraction', 'use', 'recurrent', 'neural', 'networks', 'rnn', 'which', 'typically', 'need', 'large', 'labeled', 'corpora', 'towards', 'this', 'end', 'we', 'propose', 'a', 'semisupervised', 'method', 'based', 'on', 'cotraining', 'which', 'can', 'exploit', 'a', 'large', 'pool', 'of', 'unlabeled', 'tweets', 'to', 'augment', 'the', 'limited', 'supervised', 'training', 'data', 'and', 'as', 'a', 'result', 'enhance', 'the', 'performance', 'experiments', 'with', '01m', 'tweets', 'show', 'that', 'the', 'proposed', 'approach', 'outperforms', 'the', 'stateoftheart', 'methods', 'for', 'the', 'adr', 'mention', 'extraction', 'task', 'by', '5', 'in', 'terms', 'of', 'f1', 'score']] | [-0.029458571946654553, 0.020902028638183287, 0.023496446598853384, 0.10859851065508433, -0.162662325721038, -0.1670066402678875, 0.08050589358672164, 0.43095760827505947, -0.2131246001340617, -0.32031812291256245, 0.13947994932768643, -0.3691886316956882, -0.1560507617467188, 0.22313383928171002, -0.1424291950918821, 0.033595968799357466, 0.20941820539029918, 0.13068406103192864, -0.01181485200882014, -0.3359553650217621, 0.2787424322634347, 0.026206803284025283, 0.35357584222394944, 0.06647014158910938, 0.11899627801170923, -0.03093078321973352, -0.11006659486320541, -0.02663288419695109, -0.033613212450673974, 0.15058399776094838, 0.39765513305643335, 0.21978316845414334, 0.36828168026430713, -0.4141587923942624, -0.2568269382420003, 0.11480881628769457, 0.12344814382171385, 0.13965175095709265, -0.01231100680078975, -0.36431215341462003, 0.056853400875947306, -0.2328969506350787, 0.03491720626536841, -0.13564762358266608, -0.008169067680005937, 0.029900662681522003, -0.253841409424698, 0.10742826761390761, 0.05780333659044446, 0.10068959293578912, -0.03385429719245916, -0.1478813960062886, 0.009309360869508936, 0.16405048787495807, 0.08661022167162676, 0.0702152767006826, 0.16749022561790688, -0.18300829051041456, -0.19056326050059239, 0.33985657081063975, -0.05835682550914362, -0.1729655632735195, 0.1882587503125415, -0.010558379680982657, -0.17280489489212073, 0.11021931673911281, 0.2653610074321067, 0.1179878902407118, -0.2052760696024599, -0.06582102502557918, -0.004080944638559245, 0.19688654681177517, 0.08327030457899366, -0.026334743638683978, 0.1387047172590558, 0.2749922208424966, 0.020772465032042192, 0.09002879271117438, -0.11841646275575854, -0.029279911347937986, -0.19437957377194015, -0.08758429716222156, -0.1410509510862088, 0.020789115444609995, -0.09955387444030125, -0.14492889482499963, 0.34925118384924825, 0.25220077076254593, 0.17673229846641197, 0.05019221612413351, 0.33441881952401165, -0.006662547940220264, 0.15452902104103364, 0.08108166847299238, 0.14805228935022438, -0.08323612977764604, 0.20282276385442766, -0.16800224256642246, 0.15333497458438677, 0.02749702891621991] |
1,802.05122 | Geometric probabilities for a cluster of needles and a lattice of
rectangles | A cluster of $n$ needles ($1\leq n<\infty$) is dropped at random onto a plane
lattice of rectangles. Each needle is fixed at one end in the cluster centre
and can rotate independently about this centre. The distribution of the
relative number of needles intersecting the lattice is shown to converge
uniformly to the limit distribution as $n\rightarrow\infty$.
| math.PR | a cluster of n needles 1leq ninfty is dropped at random onto a plane lattice of rectangles each needle is fixed at one end in the cluster centre and can rotate independently about this centre the distribution of the relative number of needles intersecting the lattice is shown to converge uniformly to the limit distribution as nrightarrowinfty | [['a', 'cluster', 'of', 'n', 'needles', '1leq', 'ninfty', 'is', 'dropped', 'at', 'random', 'onto', 'a', 'plane', 'lattice', 'of', 'rectangles', 'each', 'needle', 'is', 'fixed', 'at', 'one', 'end', 'in', 'the', 'cluster', 'centre', 'and', 'can', 'rotate', 'independently', 'about', 'this', 'centre', 'the', 'distribution', 'of', 'the', 'relative', 'number', 'of', 'needles', 'intersecting', 'the', 'lattice', 'is', 'shown', 'to', 'converge', 'uniformly', 'to', 'the', 'limit', 'distribution', 'as', 'nrightarrowinfty']] | [-0.12540600278717057, 0.18341232427771678, -0.08523581830555932, -0.017208700407329098, -0.019674357194290087, -0.11547498970308848, 0.06900376506280481, 0.3949116618094737, -0.2669375001191439, -0.22034354945808127, 0.11325786596678786, -0.3496678434965903, 0.03953254970378781, 0.08635189099923561, -0.05248443623024382, 0.03450152385783823, 0.03404076173574778, 0.08851885565213467, -0.029883776824071742, -0.29635589238125504, 0.25372094222295444, 0.019608387413124245, 0.2709681883519679, -0.04578146514923949, 0.09739827961056378, 0.06157679483294487, 0.08916145517376431, 0.03674725133092388, -0.12908653550568902, 0.05741381434429633, 0.19848295281592168, 0.04163344201158013, 0.2534585960470794, -0.3523652671525876, -0.1231969046128685, 0.12231705620427404, 0.24095220025628805, 0.1069919918255325, 0.0546499139878474, -0.20805490933554738, 0.12300835935431614, -0.08952435155056025, -0.27040636068896245, 0.10813038315820067, 0.06615263494875348, 0.10044277407098234, -0.24823561683297157, -0.0007391743721407757, 0.06807134051773014, 0.030578378130469406, -0.01016602335138279, -0.15535067819189607, -0.06782750123621602, 0.17055715356643, 0.01076617152756897, 0.14646857045590878, 0.18335567146801113, -0.05625011306256056, -0.033110774122178555, 0.39819831152757007, 0.018179885748969882, -0.21441225733673364, 0.1505638146446201, -0.21805862695991732, -0.1342179705797319, 0.13098390480470762, 0.137117030768933, 0.12222086128435637, -0.08420289708138035, 0.10537332065889546, -0.11407629328600147, 0.13828251190614282, 0.17143418556569437, -0.06209556415284935, 0.27792333537026453, 0.12783006610136413, 0.15811888968343274, 0.21059251213936428, -0.12151149284552064, -0.10521531242289041, -0.32502478661767226, -0.10216120754679044, -0.28289108472802726, 0.08746141763894182, -0.14820917894253957, -0.16155657711542995, 0.25069644442645084, 0.10023693833500147, 0.287196851155737, 0.07839094849074618, 0.19800200819838465, 0.07100335751831728, 0.06079687687911486, 0.09576300280822213, 0.14913171229540909, 0.15410673843794748, 0.03134446297036974, -0.1731730092300527, -0.0049318309481206695, 0.10941119249419946] |
1,802.05123 | Selecting Microarchitecture Configuration of Processors for Internet of
Things | The Internet of Things (IoT) makes use of ubiquitous internet connectivity to
form a network of everyday physical objects for purposes of automation, remote
data sensing and centralized management/control. IoT objects need to be
embedded with processing capabilities to fulfill these services. The design of
processing units for IoT objects is constrained by various stringent
requirements, such as performance, power, thermal dissipation etc. In order to
meet these diverse requirements, a multitude of processor design parameters
need to be tuned accordingly. In this paper, we propose a temporally efficient
design space exploration methodology which determines power and performance
optimized microarchitecture configurations. We also discuss the possible
combinations of these microarchitecture configurations to form an effective
two-tiered heterogeneous processor for IoT applications. We evaluate our design
space exploration methodology using a cycle-accurate simulator (ESESC) and a
standard set of PARSEC and SPLASH2 benchmarks. The results show that our
methodology determines microarchitecture configurations which are within
2.23%-3.69% of the configurations obtained from fully exhaustive exploration
while only exploring 3%-5% of the design space. Our methodology achieves on
average 24.16x speedup in design space exploration as compared to fully
exhaustive exploration in finding power and performance optimized
microarchitecture configurations for processors.
| eess.SP | the internet of things iot makes use of ubiquitous internet connectivity to form a network of everyday physical objects for purposes of automation remote data sensing and centralized managementcontrol iot objects need to be embedded with processing capabilities to fulfill these services the design of processing units for iot objects is constrained by various stringent requirements such as performance power thermal dissipation etc in order to meet these diverse requirements a multitude of processor design parameters need to be tuned accordingly in this paper we propose a temporally efficient design space exploration methodology which determines power and performance optimized microarchitecture configurations we also discuss the possible combinations of these microarchitecture configurations to form an effective twotiered heterogeneous processor for iot applications we evaluate our design space exploration methodology using a cycleaccurate simulator esesc and a standard set of parsec and splash2 benchmarks the results show that our methodology determines microarchitecture configurations which are within 223369 of the configurations obtained from fully exhaustive exploration while only exploring 35 of the design space our methodology achieves on average 2416x speedup in design space exploration as compared to fully exhaustive exploration in finding power and performance optimized microarchitecture configurations for processors | [['the', 'internet', 'of', 'things', 'iot', 'makes', 'use', 'of', 'ubiquitous', 'internet', 'connectivity', 'to', 'form', 'a', 'network', 'of', 'everyday', 'physical', 'objects', 'for', 'purposes', 'of', 'automation', 'remote', 'data', 'sensing', 'and', 'centralized', 'managementcontrol', 'iot', 'objects', 'need', 'to', 'be', 'embedded', 'with', 'processing', 'capabilities', 'to', 'fulfill', 'these', 'services', 'the', 'design', 'of', 'processing', 'units', 'for', 'iot', 'objects', 'is', 'constrained', 'by', 'various', 'stringent', 'requirements', 'such', 'as', 'performance', 'power', 'thermal', 'dissipation', 'etc', 'in', 'order', 'to', 'meet', 'these', 'diverse', 'requirements', 'a', 'multitude', 'of', 'processor', 'design', 'parameters', 'need', 'to', 'be', 'tuned', 'accordingly', 'in', 'this', 'paper', 'we', 'propose', 'a', 'temporally', 'efficient', 'design', 'space', 'exploration', 'methodology', 'which', 'determines', 'power', 'and', 'performance', 'optimized', 'microarchitecture', 'configurations', 'we', 'also', 'discuss', 'the', 'possible', 'combinations', 'of', 'these', 'microarchitecture', 'configurations', 'to', 'form', 'an', 'effective', 'twotiered', 'heterogeneous', 'processor', 'for', 'iot', 'applications', 'we', 'evaluate', 'our', 'design', 'space', 'exploration', 'methodology', 'using', 'a', 'cycleaccurate', 'simulator', 'esesc', 'and', 'a', 'standard', 'set', 'of', 'parsec', 'and', 'splash2', 'benchmarks', 'the', 'results', 'show', 'that', 'our', 'methodology', 'determines', 'microarchitecture', 'configurations', 'which', 'are', 'within', '223369', 'of', 'the', 'configurations', 'obtained', 'from', 'fully', 'exhaustive', 'exploration', 'while', 'only', 'exploring', '35', 'of', 'the', 'design', 'space', 'our', 'methodology', 'achieves', 'on', 'average', '2416x', 'speedup', 'in', 'design', 'space', 'exploration', 'as', 'compared', 'to', 'fully', 'exhaustive', 'exploration', 'in', 'finding', 'power', 'and', 'performance', 'optimized', 'microarchitecture', 'configurations', 'for', 'processors']] | [-0.15902671556302933, 0.019385580703830372, -0.028145876380653342, 0.006394597125652525, -0.12112698398924135, -0.13665207629284062, 0.07449848997135426, 0.42029219804350865, -0.2426975281793893, -0.40391742504326644, 0.10886500529781676, -0.19600163931603132, -0.15812492066425435, 0.26369405926454853, -0.0829076912078872, 0.09916387530542987, 0.0948777826714147, -0.02380120971830581, -0.045704417744363846, -0.2600651923807088, 0.25115267346017833, 0.077188466694182, 0.34785627521401674, 7.920803684626044e-06, 0.06707196628984506, -0.03762149207471611, -0.011407502960490505, -0.006742825977667475, -0.10297344295091515, 0.1826901186471229, 0.32583294089369896, 0.21785518288199512, 0.281903248919971, -0.4387222640696414, -0.19578072516074807, 0.080165106705966, 0.14855338318739086, 0.02493785297469303, -0.054665985378585566, -0.29072651654462683, 0.10971906301673483, -0.2056240015711213, -0.08316436408750098, -0.1473015568833606, 0.004259548354029809, 0.03640547090362441, -0.29629574702649386, -0.06231383707334729, -0.027806973226426036, 0.030722311693099663, -0.048479242908009854, -0.08998129467393473, 0.024985177927295266, 0.16253318432382471, -0.0468065148278274, -0.0082876000465758, 0.21604478568769991, -0.13528923115109606, -0.1586241145124995, 0.4076150277456672, 0.04434178679996679, -0.18357832723898157, 0.17714855426648804, -0.00890543556426527, -0.17391561353867202, 0.08693828086186316, 0.2563031332365708, 0.06171199806591438, -0.1893328850532008, 0.04714356758241715, 0.04812755001968099, 0.18940996141388974, 0.023548032859215494, 0.09976874561692328, 0.21653027104372255, 0.2908293967778535, 0.10524359681240293, 0.15018085227827974, -0.04999103626001088, -0.10980589355290483, -0.25285299535487904, -0.16392187891031745, -0.16425958797743678, -0.0016628386195960273, -0.10832047612925681, -0.12861769667288922, 0.37242099853021277, 0.2301751995199965, 0.1392585051236386, 0.07377935707036253, 0.39220831253249006, 0.0016168374292937723, 0.12745427300423845, 0.13000639658373273, 0.16532077813597837, -0.0049177681272321375, 0.15632288967236424, -0.1775820722261002, 0.026435934960093235, -0.03199260844969066] |
1,802.05124 | Complete sets | In this paper we introduce the concept of completeness of sets. We study this
property on the set of integers. We examine how this property is preserved as
we carry out various operations compatible with sets. We also introduce the
problem of counting the number of complete subsets of any given set. That is,
given any interval of integers $\mathcal{H}:=[1,N]$ and letting
$\mathcal{C}(N)$ denotes the complete set counting function, we establish the
lower bound $\mathcal{C}(N)\gg N\log N$.
| math.GM | in this paper we introduce the concept of completeness of sets we study this property on the set of integers we examine how this property is preserved as we carry out various operations compatible with sets we also introduce the problem of counting the number of complete subsets of any given set that is given any interval of integers mathcalh1n and letting mathcalcn denotes the complete set counting function we establish the lower bound mathcalcngg nlog n | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'concept', 'of', 'completeness', 'of', 'sets', 'we', 'study', 'this', 'property', 'on', 'the', 'set', 'of', 'integers', 'we', 'examine', 'how', 'this', 'property', 'is', 'preserved', 'as', 'we', 'carry', 'out', 'various', 'operations', 'compatible', 'with', 'sets', 'we', 'also', 'introduce', 'the', 'problem', 'of', 'counting', 'the', 'number', 'of', 'complete', 'subsets', 'of', 'any', 'given', 'set', 'that', 'is', 'given', 'any', 'interval', 'of', 'integers', 'mathcalh1n', 'and', 'letting', 'mathcalcn', 'denotes', 'the', 'complete', 'set', 'counting', 'function', 'we', 'establish', 'the', 'lower', 'bound', 'mathcalcngg', 'nlog', 'n']] | [-0.19913449538250763, 0.09402548119425774, -0.045088771581649784, 0.048938020609008766, -0.05085508908455571, -0.0411462032298247, 0.12073381025499354, 0.3375664984683196, -0.2753902346392473, -0.277952254700164, 0.056786157704579336, -0.28401785797129075, -0.1374808968572567, 0.17044185777505239, -0.10204610325396062, 0.026282943512002627, 0.048984963844219846, 0.08082676666478315, -0.059271380947902796, -0.3160447174993654, 0.38787935331463813, -0.03217380541066329, 0.20520359657704831, 0.060784253484259046, 0.10931120797991753, 0.05956252336502075, -0.03713494023308158, 0.05735079045097033, -0.21586307685870754, 0.12668488390588512, 0.19841996983935437, 0.2478470164972047, 0.30036383257557947, -0.37811070238550504, -0.09482272421009838, 0.26190562680363655, 0.1218036216776818, 0.04944405516609549, 0.010251598176546394, -0.20546571982403597, 0.2026935890254875, -0.1272392938286066, -0.12545793789128462, -0.08517945611383766, 0.026677106395363807, 0.02143111971206963, -0.25590355607680976, -0.032824580958501125, 0.09935934953391552, 0.08580442120631536, -0.006389583895603816, -0.10547627005105217, 0.03849976506239424, 0.11705354292566578, -0.03733913255855441, 0.020476663097118337, 0.039559527871509396, -0.033954655798152086, -0.11595553572289646, 0.3564703311274449, -0.04267270341515541, -0.24274967466791472, 0.11941694862209261, -0.18289711080491544, -0.18435220488657553, 0.043639123955120644, 0.12376602984964848, 0.16581267525752386, -0.09134696340809266, 0.16123889110904807, -0.1649461967870593, 0.1669682498027881, 0.10744290308405956, 0.09597555852495133, 0.12835404781003792, 0.15756777697553237, 0.11938173548628886, 0.23813082098960878, -0.03113379534644385, 0.0182334058607618, -0.40358881548047065, -0.15101185581103588, -0.1933711612597108, 0.09310517092545827, -0.07636259467011162, -0.20855739740033943, 0.37108759020765625, 0.17290391988431414, 0.2354944898188114, 0.15029799102495114, 0.2419083714981874, 0.13219444052064014, -0.011259999728451172, 0.08567429301639398, 0.07772501265009245, 0.1011529934561501, -0.02442124531293909, -0.16795895263552665, 0.028140190113335847, 0.12583369651188453] |
1,802.05125 | Enhancement of Noisy Speech with Low Speech Distortion Based on
Probabilistic Geometric Spectral Subtraction | A speech enhancement method based on probabilistic geometric approach to
spectral subtraction (PGA) performed on short time magnitude spectrum is
presented in this paper. A confidence parameter of noise estimation is
introduced in the gain function of the proposed method to prevent subtraction
of the overestimated and underestimated noise, which not only removes the noise
efficiently but also prevents the speech distortion. The noise compensated
magnitude spectrum is then recombined with the unchanged phase spectrum to
produce a modified complex spectrum prior to synthesize an enhanced frame.
Extensive simulations are carried out using the speech files available in the
NOIZEUS database in order to evaluate the performance of the proposed method.
| eess.AS cs.SD | a speech enhancement method based on probabilistic geometric approach to spectral subtraction pga performed on short time magnitude spectrum is presented in this paper a confidence parameter of noise estimation is introduced in the gain function of the proposed method to prevent subtraction of the overestimated and underestimated noise which not only removes the noise efficiently but also prevents the speech distortion the noise compensated magnitude spectrum is then recombined with the unchanged phase spectrum to produce a modified complex spectrum prior to synthesize an enhanced frame extensive simulations are carried out using the speech files available in the noizeus database in order to evaluate the performance of the proposed method | [['a', 'speech', 'enhancement', 'method', 'based', 'on', 'probabilistic', 'geometric', 'approach', 'to', 'spectral', 'subtraction', 'pga', 'performed', 'on', 'short', 'time', 'magnitude', 'spectrum', 'is', 'presented', 'in', 'this', 'paper', 'a', 'confidence', 'parameter', 'of', 'noise', 'estimation', 'is', 'introduced', 'in', 'the', 'gain', 'function', 'of', 'the', 'proposed', 'method', 'to', 'prevent', 'subtraction', 'of', 'the', 'overestimated', 'and', 'underestimated', 'noise', 'which', 'not', 'only', 'removes', 'the', 'noise', 'efficiently', 'but', 'also', 'prevents', 'the', 'speech', 'distortion', 'the', 'noise', 'compensated', 'magnitude', 'spectrum', 'is', 'then', 'recombined', 'with', 'the', 'unchanged', 'phase', 'spectrum', 'to', 'produce', 'a', 'modified', 'complex', 'spectrum', 'prior', 'to', 'synthesize', 'an', 'enhanced', 'frame', 'extensive', 'simulations', 'are', 'carried', 'out', 'using', 'the', 'speech', 'files', 'available', 'in', 'the', 'noizeus', 'database', 'in', 'order', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'method']] | [-0.08485034050059144, 0.018338182824794918, -0.11285651955482978, 0.05982185262234395, -0.05979832970780564, -0.11307489231379854, 0.04900526491241312, 0.4194380579734439, -0.24675144126789794, -0.32667884232658845, 0.08154325887586016, -0.25388705664154915, -0.12705870356142251, 0.2005909078309799, -0.11908500274089542, 0.05387937686582272, 0.08491347638705561, 0.02979991983240554, -0.06672382386619444, -0.2689314666749524, 0.2590654630797101, 0.1368676008455254, 0.3086200593257541, 0.00270641572786042, 0.08991366055970257, -0.01801387062464077, -0.11294043906502896, -0.022617563068329752, -0.06507669094538836, 0.09641424300535037, 0.23642316385726067, 0.11546412045723414, 0.2439032492336926, -0.358923032581974, -0.23410779084204822, 0.10591719835275062, 0.14906124745889962, 0.11148705399230223, -0.050346574362216366, -0.32330574518119964, 0.10337564562707469, -0.17942754403260108, -0.045726360828691234, -0.09742329369072576, -0.05220381534649982, -0.054766391043190484, -0.2972639259496318, 0.07888343020500657, 0.06802830147045152, 0.034619159527701907, -0.028408695768768404, -0.12196960714477878, -0.0076831129740353105, 0.12949364116889434, 0.04487667937746255, 0.04069193096848221, 0.1511773723009806, -0.08832586768468965, -0.0653439824860585, 0.36070568753859483, -0.12174534542708414, -0.20820559777722164, 0.12532138561427192, -0.09939437745105442, -0.10167196972362764, 0.23276772085778616, 0.17887773879946353, 0.11123729545438478, -0.17805843666900653, 0.023285971320473362, 0.06351093012369699, 0.2729071780770749, 0.06645008317994054, 0.01427062730481093, 0.12318706458124022, 0.15228691067848657, 0.02403272268874151, 0.1705224632478512, -0.1389955648489565, -0.053045730132490046, -0.23125140551846843, -0.054510673113704264, -0.22967623759833006, -0.027150854419970356, -0.05962805281724122, -0.16859778390173707, 0.4182348107029726, 0.24416886475608424, 0.17666017872424009, 0.03167056183116762, 0.40120547698802306, 0.13407216458539437, 0.07214871696028691, 0.02518936523513214, 0.2397209791249495, 0.06083850417630159, 0.09608540741877782, -0.22755494857257283, 0.0509700072039892, 0.030485635763873253] |
1,802.05126 | Interference of Laguerre--Gaussian beams for reflection by dielectric
slab | We study reflection of TE Laguerre-Gaussian light beam by dielectric slab and
show that the Goos-H\"{a}nchen and the Imbert-Federov shifts show resonant
behavior following to the behavior of the reflection. Moreover the
Imbert-Federov linear and the Goos-H\"{a}nchen angular shifts strongly depend
on the orbital angular momentum m. Due to destructive interference of two beams
reflected from upper and down interfaces of the slab profile of the reflected
light beam acquires structure which distinctively displays an amount of m.
| physics.optics | we study reflection of te laguerregaussian light beam by dielectric slab and show that the gooshanchen and the imbertfederov shifts show resonant behavior following to the behavior of the reflection moreover the imbertfederov linear and the gooshanchen angular shifts strongly depend on the orbital angular momentum m due to destructive interference of two beams reflected from upper and down interfaces of the slab profile of the reflected light beam acquires structure which distinctively displays an amount of m | [['we', 'study', 'reflection', 'of', 'te', 'laguerregaussian', 'light', 'beam', 'by', 'dielectric', 'slab', 'and', 'show', 'that', 'the', 'gooshanchen', 'and', 'the', 'imbertfederov', 'shifts', 'show', 'resonant', 'behavior', 'following', 'to', 'the', 'behavior', 'of', 'the', 'reflection', 'moreover', 'the', 'imbertfederov', 'linear', 'and', 'the', 'gooshanchen', 'angular', 'shifts', 'strongly', 'depend', 'on', 'the', 'orbital', 'angular', 'momentum', 'm', 'due', 'to', 'destructive', 'interference', 'of', 'two', 'beams', 'reflected', 'from', 'upper', 'and', 'down', 'interfaces', 'of', 'the', 'slab', 'profile', 'of', 'the', 'reflected', 'light', 'beam', 'acquires', 'structure', 'which', 'distinctively', 'displays', 'an', 'amount', 'of', 'm']] | [-0.19055605609304246, 0.2258474235141199, -0.11974831901562329, 0.0034672228906017085, -0.09539055794429703, -0.12461214615270877, 0.030871857865116537, 0.44616952983853525, -0.29229230214005864, -0.2872463779237408, -0.006493814773141191, -0.3080320452363827, -0.11758133860973594, 0.18978614727250084, 0.002537787008361939, 0.005680178411495991, 0.012717351956197467, -0.03706343711401599, -0.0589998685172759, -0.08868396554130296, 0.36085224356979895, 0.06390824019670105, 0.30121313004444045, 0.08333691103288378, 0.09392069075375986, 0.09823149629534246, 0.006666533822098222, -0.038975581765556946, -0.10884384715749408, 0.07035571267494024, 0.13846371148545772, -0.01011134777815105, 0.11270537325598969, -0.39387319275201893, -0.1771565888566562, 0.020581166355464704, 0.14852037074086136, 0.09913038130915271, -0.06327825787817486, -0.26947663908298963, -0.04668692376416845, -0.0731069803572236, -0.16688005506204298, 0.019675123409774058, 0.01549202853288406, 0.04301812367525716, -0.21697561834261228, 0.04947742152338227, 0.1111414275991802, 0.057722188767794974, -0.00787488250539471, -0.12775500765882242, -0.12930592089795914, 0.01720086357389123, 0.059791702120445475, -0.05682427514320574, 0.13729059540380079, -0.08061189814590108, -0.0581249260248091, 0.39886987078725955, -0.08941539863679701, -0.13739390444392577, 0.10183689458809124, -0.29550402330306286, 0.07147989247459918, 0.21854207930990902, 0.21080620097032246, 0.08585047954693437, -0.05296909459344207, 0.03841407149910736, -0.028836229290717687, 0.21583557401139003, 0.20862460754907283, 0.11442684167279647, 0.23348800452330556, 0.06672177395114723, 0.05686167880253962, 0.1299626985564828, -0.14729252577317545, -0.011277326430456761, -0.2365671444015625, -0.13611170681057652, -0.1584980638984304, 0.04274712548030015, -0.0471789587150292, -0.14820358337452397, 0.3987444405658887, 0.09051057316052417, 0.21638163840636992, -0.01908101608755831, 0.3174961519738038, 0.17167974343427864, 0.00926595320328115, 0.04370391207974022, 0.2722959476403701, 0.20100081223958674, 0.14796691645796484, -0.36912562073363614, 0.01104631803285044, -0.05565474045056945] |
1,802.05127 | Clustering Properties of Spatial Preferential Attachment Model | In this paper, we study the clustering properties of the Spatial Preferential
Attachment (SPA) model introduced by Aiello et al. in 2009. This model
naturally combines geometry and preferential attachment using the notion of
spheres of influence. It was previously shown in several research papers that
graphs generated by the SPA model are similar to real-world networks in many
aspects. For example, the vertex degree distribution was shown to follow a
power law. In the current paper, we study the behaviour of C(d), which is the
average local clustering coefficient for the vertices of degree d. This
characteristic was not previously analyzed in the SPA model. However, it was
empirically shown that in real-world networks C(d) usually decreases as d^{-a}
for some a>0 and it was often observed that a=1. We prove that in the SPA model
C(d) decreases as 1/d. Furthermore, we are also able to prove that not only the
average but the individual local clustering coefficient of a vertex v of degree
d behaves as 1/d if d is large enough. The obtained results are illustrated by
numerous experiments with simulated graphs.
| cs.SI math.PR physics.soc-ph | in this paper we study the clustering properties of the spatial preferential attachment spa model introduced by aiello et al in 2009 this model naturally combines geometry and preferential attachment using the notion of spheres of influence it was previously shown in several research papers that graphs generated by the spa model are similar to realworld networks in many aspects for example the vertex degree distribution was shown to follow a power law in the current paper we study the behaviour of cd which is the average local clustering coefficient for the vertices of degree d this characteristic was not previously analyzed in the spa model however it was empirically shown that in realworld networks cd usually decreases as da for some a0 and it was often observed that a1 we prove that in the spa model cd decreases as 1d furthermore we are also able to prove that not only the average but the individual local clustering coefficient of a vertex v of degree d behaves as 1d if d is large enough the obtained results are illustrated by numerous experiments with simulated graphs | [['in', 'this', 'paper', 'we', 'study', 'the', 'clustering', 'properties', 'of', 'the', 'spatial', 'preferential', 'attachment', 'spa', 'model', 'introduced', 'by', 'aiello', 'et', 'al', 'in', '2009', 'this', 'model', 'naturally', 'combines', 'geometry', 'and', 'preferential', 'attachment', 'using', 'the', 'notion', 'of', 'spheres', 'of', 'influence', 'it', 'was', 'previously', 'shown', 'in', 'several', 'research', 'papers', 'that', 'graphs', 'generated', 'by', 'the', 'spa', 'model', 'are', 'similar', 'to', 'realworld', 'networks', 'in', 'many', 'aspects', 'for', 'example', 'the', 'vertex', 'degree', 'distribution', 'was', 'shown', 'to', 'follow', 'a', 'power', 'law', 'in', 'the', 'current', 'paper', 'we', 'study', 'the', 'behaviour', 'of', 'cd', 'which', 'is', 'the', 'average', 'local', 'clustering', 'coefficient', 'for', 'the', 'vertices', 'of', 'degree', 'd', 'this', 'characteristic', 'was', 'not', 'previously', 'analyzed', 'in', 'the', 'spa', 'model', 'however', 'it', 'was', 'empirically', 'shown', 'that', 'in', 'realworld', 'networks', 'cd', 'usually', 'decreases', 'as', 'da', 'for', 'some', 'a0', 'and', 'it', 'was', 'often', 'observed', 'that', 'a1', 'we', 'prove', 'that', 'in', 'the', 'spa', 'model', 'cd', 'decreases', 'as', '1d', 'furthermore', 'we', 'are', 'also', 'able', 'to', 'prove', 'that', 'not', 'only', 'the', 'average', 'but', 'the', 'individual', 'local', 'clustering', 'coefficient', 'of', 'a', 'vertex', 'v', 'of', 'degree', 'd', 'behaves', 'as', '1d', 'if', 'd', 'is', 'large', 'enough', 'the', 'obtained', 'results', 'are', 'illustrated', 'by', 'numerous', 'experiments', 'with', 'simulated', 'graphs']] | [-0.07734216684916032, 0.07684027951059712, -0.05813047589381804, 0.05114880941392904, -0.04540592531447072, -0.14619046391138957, -0.002539139984779664, 0.40850099548319907, -0.26299198049347144, -0.3167789511986681, 0.03957102396399588, -0.28778824036991274, -0.23195459181694567, 0.15008720037074308, -0.057538386499760924, 0.031658606217683266, 0.03841523744442777, 0.05945022965504511, 0.01785968939610128, -0.30169118551185004, 0.27303055460829084, 0.10057864638825728, 0.29182922928971616, 0.05797923860970784, 0.06002592820976232, -0.005891667787187003, -0.0387273840102795, 0.09907578238462274, -0.12646055099199607, 0.07640686972771545, 0.2055325780818994, 0.1295208564047022, 0.24682819983242332, -0.36029938266084, -0.2625402871720694, 0.12889657036678212, 0.14136472019442434, 0.09601832781729565, -0.017941583053687135, -0.22834578586893306, 0.1294764093110791, -0.1648539828497608, -0.12545753168445584, -0.04287767238612916, 0.0809779522814662, 0.06905106201805677, -0.27395590039825923, 0.08642590074859735, 0.12253339119331055, 0.04947451850575571, -0.0005365974483759822, -0.1319031674641411, -0.04623547543117122, 0.07607348021119834, 0.025482892143741453, 0.01582038387832408, 0.07712398573403825, -0.09770627032990592, -0.13031731744775096, 0.3651297874043922, -0.05907679047636889, -0.16623699619761995, 0.18713367423042654, -0.1524628516840371, -0.16082020220220894, 0.08058813533091264, 0.1492068901123177, 0.14423009044497834, -0.15545671477511122, 0.08868062923775634, -0.09749102350324393, 0.1468878736367097, 0.0845912334597292, -0.04393623257559296, 0.0916117224640943, 0.13451568831664484, 0.041494767709849154, 0.1438636315111826, -0.07662854125798756, -0.09131182671203655, -0.23521634107203904, -0.10405165862191368, -0.22060891947130093, 0.014558765940475152, -0.09160105972912641, -0.1194213427806185, 0.39428915447882706, 0.13661514663930377, 0.24832742857067167, 0.04809933502063457, 0.23944015003161856, 0.09010325315193277, 0.057636842695442406, 0.08777857938831722, 0.2293048942041571, 0.1222481737102105, 0.09313007824475299, -0.17502925625775714, 0.11431887088393843, 0.0582800783896567] |
1,802.05128 | Simulation design for forthcoming high quality plasma wakefield
acceleration experiment in linear regime at SPARC_LAB | In the context of plasma wakefield acceleration beam driven, we exploit a
high density charge trailing bunch whose self-fields act by mitigating the
energy spread increase via beam loading compensation, together with bunch
self-contain operated by the self-consistent transverse field. The work, that
will be experimentally tested in the SPARC_LAB test facility, consists of a
parametric scan that allows to find optimized parameters in order to preserve
the high quality of the trailing bunch over the entire centimeters acceleration
length, with a final energy spread increase of 0.1% and an emittance increase
of 5 nm. The stability of trailing bunch parameters after acceleration is
tested employing a systematic scan of the parameters of the bunches at the
injection. The results show that the energy spread increase keeps lower than 1%
and the emittance increase is lower than 0.02 mm mrad in all the simulations
performed. The energy jitter is of the order of 5%.
| physics.acc-ph | in the context of plasma wakefield acceleration beam driven we exploit a high density charge trailing bunch whose selffields act by mitigating the energy spread increase via beam loading compensation together with bunch selfcontain operated by the selfconsistent transverse field the work that will be experimentally tested in the sparc_lab test facility consists of a parametric scan that allows to find optimized parameters in order to preserve the high quality of the trailing bunch over the entire centimeters acceleration length with a final energy spread increase of 01 and an emittance increase of 5 nm the stability of trailing bunch parameters after acceleration is tested employing a systematic scan of the parameters of the bunches at the injection the results show that the energy spread increase keeps lower than 1 and the emittance increase is lower than 002 mm mrad in all the simulations performed the energy jitter is of the order of 5 | [['in', 'the', 'context', 'of', 'plasma', 'wakefield', 'acceleration', 'beam', 'driven', 'we', 'exploit', 'a', 'high', 'density', 'charge', 'trailing', 'bunch', 'whose', 'selffields', 'act', 'by', 'mitigating', 'the', 'energy', 'spread', 'increase', 'via', 'beam', 'loading', 'compensation', 'together', 'with', 'bunch', 'selfcontain', 'operated', 'by', 'the', 'selfconsistent', 'transverse', 'field', 'the', 'work', 'that', 'will', 'be', 'experimentally', 'tested', 'in', 'the', 'sparc_lab', 'test', 'facility', 'consists', 'of', 'a', 'parametric', 'scan', 'that', 'allows', 'to', 'find', 'optimized', 'parameters', 'in', 'order', 'to', 'preserve', 'the', 'high', 'quality', 'of', 'the', 'trailing', 'bunch', 'over', 'the', 'entire', 'centimeters', 'acceleration', 'length', 'with', 'a', 'final', 'energy', 'spread', 'increase', 'of', '01', 'and', 'an', 'emittance', 'increase', 'of', '5', 'nm', 'the', 'stability', 'of', 'trailing', 'bunch', 'parameters', 'after', 'acceleration', 'is', 'tested', 'employing', 'a', 'systematic', 'scan', 'of', 'the', 'parameters', 'of', 'the', 'bunches', 'at', 'the', 'injection', 'the', 'results', 'show', 'that', 'the', 'energy', 'spread', 'increase', 'keeps', 'lower', 'than', '1', 'and', 'the', 'emittance', 'increase', 'is', 'lower', 'than', '002', 'mm', 'mrad', 'in', 'all', 'the', 'simulations', 'performed', 'the', 'energy', 'jitter', 'is', 'of', 'the', 'order', 'of', '5']] | [-0.12000868542065077, 0.2063243751745295, -0.057037410881747706, 0.047375482527593916, 0.023029895490218028, -0.09994574155950663, -0.004856453179016563, 0.39004504668459394, -0.2090002577508392, -0.3673590347901279, 0.055174136476506014, -0.2585767528874034, 0.06909240804174367, 0.22152561169068993, -0.02219822767245419, 0.05169092769448469, 0.06213142468709669, -0.024186341238080288, -0.08245060985962696, -0.21863748654007936, 0.22830104028571738, 0.20509538957788273, 0.3010355991073975, 0.05998406603055842, 0.14451329121244402, 0.0024269394826880518, 0.007327689548796103, -0.0015676324651424402, -0.13753988039307943, 0.06548119950552586, 0.17716459509934865, 0.05146122742611672, 0.29956503076405794, -0.4304577274266265, -0.2183835920421224, 0.0519108934209262, 0.16147441668983767, 0.0791428410052474, -0.0739749967435594, -0.18785182810905907, 0.10231671593109377, -0.19222143306417827, -0.18793737054406817, 0.02601817423733426, -0.01751660833400035, 0.09857717032233874, -0.27700943915626897, 0.0745971756728573, 0.006322794813005363, 0.046662364362014666, -0.01779231640359606, -0.08930292731041417, -0.040247797579474116, 0.0714382545457958, 0.05435509778090503, 0.11371349710727634, 0.19949301616197415, -0.09993310254432407, -0.0767891049199415, 0.3492842387781612, -0.05663213895932844, -0.12601906770925506, 0.08565215581382801, -0.19972735339641765, 0.010570369234759043, 0.24400241121808006, 0.1947507206143224, 0.05531684467203769, -0.10389110227145888, 0.01001427194417083, 0.05795878594592092, 0.22737151508834336, 0.17959181025770365, 0.010543868376331684, 0.18236619841575233, 0.20717788487064098, 0.09345254002845073, 0.14055007553790252, -0.19171362073812026, -0.019356033358467268, -0.32099133705434213, -0.10994971950167144, -0.1254125799309596, -0.0026058720583035278, -0.07477008415598367, -0.09358722788777836, 0.47463070607311975, 0.17673132189677335, 0.17154177796899103, -0.011194246296095205, 0.32268863840917356, 0.13174218597389709, 0.09510913486227247, 0.07505509892046403, 0.265542588630399, 0.07924770115908186, 0.10908766064162859, -0.26200788581950796, 0.031636887065628, -0.011263230844443433] |
1,802.05129 | Non-Twisting and Twisting Solutions of the Einstein Field Equations of a
Skyrmionic String | We construct non-linear sigma model plus Skyrme term (Skyrme model) with a
twist in the gravitational field. We try to solve the Einstein field equations
for small and large values of $r$, with and without twist. We prove that no
non-twisting or twisting solutions extending from $r=0$ to $r=\infty$ exist. At
last, we try to solve non-twisting and twisting solutions of the Einstein field
equations with a finite radius. We find that there are no solutions with a
finite radius that can satisfy the junction conditions at the boundary radius
$r=r_b$, where $r_b$ is a finite radius.
| gr-qc | we construct nonlinear sigma model plus skyrme term skyrme model with a twist in the gravitational field we try to solve the einstein field equations for small and large values of r with and without twist we prove that no nontwisting or twisting solutions extending from r0 to rinfty exist at last we try to solve nontwisting and twisting solutions of the einstein field equations with a finite radius we find that there are no solutions with a finite radius that can satisfy the junction conditions at the boundary radius rr_b where r_b is a finite radius | [['we', 'construct', 'nonlinear', 'sigma', 'model', 'plus', 'skyrme', 'term', 'skyrme', 'model', 'with', 'a', 'twist', 'in', 'the', 'gravitational', 'field', 'we', 'try', 'to', 'solve', 'the', 'einstein', 'field', 'equations', 'for', 'small', 'and', 'large', 'values', 'of', 'r', 'with', 'and', 'without', 'twist', 'we', 'prove', 'that', 'no', 'nontwisting', 'or', 'twisting', 'solutions', 'extending', 'from', 'r0', 'to', 'rinfty', 'exist', 'at', 'last', 'we', 'try', 'to', 'solve', 'nontwisting', 'and', 'twisting', 'solutions', 'of', 'the', 'einstein', 'field', 'equations', 'with', 'a', 'finite', 'radius', 'we', 'find', 'that', 'there', 'are', 'no', 'solutions', 'with', 'a', 'finite', 'radius', 'that', 'can', 'satisfy', 'the', 'junction', 'conditions', 'at', 'the', 'boundary', 'radius', 'rr_b', 'where', 'r_b', 'is', 'a', 'finite', 'radius']] | [-0.1799911457814814, 0.0872421308910263, -0.08283646929932316, 0.06511885774461072, -0.11384320886296787, -0.18807005217855738, -0.05587585197915275, 0.3370423843104815, -0.21078265820793116, -0.25182364754301984, 0.10034131873567041, -0.2964273203721212, -0.08835547910187125, 0.1232132122698288, -0.039127233355082856, 0.004312359263607992, 0.03425281927872872, 0.08623735177493894, -0.1428435710906867, -0.19622249929378405, 0.356152551008638, -0.028808069741833454, 0.15680572564339207, 0.05095745400842471, 0.12567562363638551, -0.0365208429764457, 0.05936525660307752, 0.12190667870358478, -0.2496291393516603, 0.03034638326864728, 0.1995139961159721, 0.05804547830244776, 0.23833289508198954, -0.44206229551244025, -0.19748221739128077, 0.1409511964470532, 0.10068120605542719, 0.1492727260614179, -0.00804792903123673, -0.23484521535388433, 0.15045690990998842, -0.182348506966817, -0.212176476586034, -0.04712893992432, 0.06702513110310261, 0.028049072346736474, -0.2791693435271376, 0.07712151608477856, 0.023995242628554535, 0.02353393464089976, -0.13693369531850377, -0.09672302635537806, -0.007490473511369573, 0.05007292481965011, 0.10740754746630327, 0.07245310559057505, 0.06605388261089773, -0.1413868574195148, -0.02704923713253331, 0.34960339744527313, -0.12090326160115679, -0.2619176779095967, 0.11475835722803916, -0.15675555820788076, -0.08900427573466117, 0.11897911256198417, 0.1140698263872914, 0.13133478468072782, -0.0918218027872331, 0.1724691073363407, -0.05501176145998281, 0.19953792918588698, 0.13815657911130907, -0.0502626786402129, 0.2169731529141517, 0.060117004016779135, 0.11243194465995911, 0.10163912591380403, -0.07546293729983423, -0.1086240901237296, -0.3981721006410638, -0.0907382368465367, -0.09082611877538417, 0.10232664339397986, -0.12028818911606969, -0.19979141476880952, 0.3092398472015083, 0.1329663174188475, 0.18850355191137066, 0.09305444805638038, 0.21124996895873055, 0.12838934431183777, 0.1345397118711844, 0.1375738763269613, 0.25382571743282767, 0.1684236357891068, 0.06429310216443594, -0.21219395071006447, -0.09401620866865226, 0.12368555270020187] |
1,802.0513 | Multi-Task Learning for Extraction of Adverse Drug Reaction Mentions
from Tweets | Adverse drug reactions (ADRs) are one of the leading causes of mortality in
health care. Current ADR surveillance systems are often associated with a
substantial time lag before such events are officially published. On the other
hand, online social media such as Twitter contain information about ADR events
in real-time, much before any official reporting. Current state-of-the-art in
ADR mention extraction uses Recurrent Neural Networks (RNN), which typically
need large labeled corpora. Towards this end, we propose a multi-task learning
based method which can utilize a similar auxiliary task (adverse drug event
detection) to enhance the performance of the main task, i.e., ADR extraction.
Furthermore, in the absence of auxiliary task dataset, we propose a novel joint
multi-task learning method to automatically generate weak supervision dataset
for the auxiliary task when a large pool of unlabeled tweets is available.
Experiments with 0.48M tweets show that the proposed approach outperforms the
state-of-the-art methods for the ADR mention extraction task by 7.2% in terms
of F1 score.
| cs.IR cs.CL | adverse drug reactions adrs are one of the leading causes of mortality in health care current adr surveillance systems are often associated with a substantial time lag before such events are officially published on the other hand online social media such as twitter contain information about adr events in realtime much before any official reporting current stateoftheart in adr mention extraction uses recurrent neural networks rnn which typically need large labeled corpora towards this end we propose a multitask learning based method which can utilize a similar auxiliary task adverse drug event detection to enhance the performance of the main task ie adr extraction furthermore in the absence of auxiliary task dataset we propose a novel joint multitask learning method to automatically generate weak supervision dataset for the auxiliary task when a large pool of unlabeled tweets is available experiments with 048m tweets show that the proposed approach outperforms the stateoftheart methods for the adr mention extraction task by 72 in terms of f1 score | [['adverse', 'drug', 'reactions', 'adrs', 'are', 'one', 'of', 'the', 'leading', 'causes', 'of', 'mortality', 'in', 'health', 'care', 'current', 'adr', 'surveillance', 'systems', 'are', 'often', 'associated', 'with', 'a', 'substantial', 'time', 'lag', 'before', 'such', 'events', 'are', 'officially', 'published', 'on', 'the', 'other', 'hand', 'online', 'social', 'media', 'such', 'as', 'twitter', 'contain', 'information', 'about', 'adr', 'events', 'in', 'realtime', 'much', 'before', 'any', 'official', 'reporting', 'current', 'stateoftheart', 'in', 'adr', 'mention', 'extraction', 'uses', 'recurrent', 'neural', 'networks', 'rnn', 'which', 'typically', 'need', 'large', 'labeled', 'corpora', 'towards', 'this', 'end', 'we', 'propose', 'a', 'multitask', 'learning', 'based', 'method', 'which', 'can', 'utilize', 'a', 'similar', 'auxiliary', 'task', 'adverse', 'drug', 'event', 'detection', 'to', 'enhance', 'the', 'performance', 'of', 'the', 'main', 'task', 'ie', 'adr', 'extraction', 'furthermore', 'in', 'the', 'absence', 'of', 'auxiliary', 'task', 'dataset', 'we', 'propose', 'a', 'novel', 'joint', 'multitask', 'learning', 'method', 'to', 'automatically', 'generate', 'weak', 'supervision', 'dataset', 'for', 'the', 'auxiliary', 'task', 'when', 'a', 'large', 'pool', 'of', 'unlabeled', 'tweets', 'is', 'available', 'experiments', 'with', '048m', 'tweets', 'show', 'that', 'the', 'proposed', 'approach', 'outperforms', 'the', 'stateoftheart', 'methods', 'for', 'the', 'adr', 'mention', 'extraction', 'task', 'by', '72', 'in', 'terms', 'of', 'f1', 'score']] | [-0.04733127593517122, 0.013600518627421612, 0.017388104279412002, 0.09918751647531214, -0.17860844478056562, -0.1806021366558015, 0.06034843079609478, 0.43922786538421016, -0.2128001102331526, -0.3443725340000195, 0.11301066054360623, -0.3406759735719278, -0.16326715244780998, 0.20878307095433518, -0.1477441491531131, 0.0501696753625122, 0.21380910241022344, 0.13888651810631883, -0.008078086878479709, -0.31368533470213594, 0.29921114093499124, 0.03437734410030449, 0.3613015889337786, 0.06064921670462709, 0.14838262933246768, -0.0028401414278849233, -0.10425798227462531, -0.05463695404028929, -0.013015280297622667, 0.1606956243361687, 0.39950116626952387, 0.2193982811650352, 0.37756181780884907, -0.39012094517806317, -0.2448131694208558, 0.11824719387208815, 0.11293518655967512, 0.15483478908714549, -0.01715785400550131, -0.3754050142597407, 0.054698200024687116, -0.22400775839710926, 0.04269629790981459, -0.13673330276988718, -0.009942051698666679, -0.006590644744148183, -0.27685335397765765, 0.1140897458592407, 0.05679961859259936, 0.0924006157040755, -0.047913591347623435, -0.12685867446679167, 0.021915125813925775, 0.175300643514741, 0.08106706769733758, 0.06792316932398712, 0.1744902785469937, -0.1935350889075269, -0.17483174398246154, 0.33264120292236526, -0.056215812234923515, -0.1790513316532824, 0.18431795625904826, -0.003191464932680857, -0.18736902787634058, 0.10903919681838554, 0.2656154601278192, 0.12706024209910538, -0.22784603413710125, -0.07689944967178901, -0.016705879686036852, 0.19772584358139372, 0.0666080605587922, -0.03338418746219448, 0.14881882798522938, 0.27284114175652174, 0.022018853944112977, 0.126466204466585, -0.1396901848738042, -0.025095020659358765, -0.21002931060360336, -0.09272139554377645, -0.13257514255507508, 0.02124852338442352, -0.0855999240749686, -0.14292040646712229, 0.3557333060562974, 0.26158811699701245, 0.15650189253955898, 0.04498591334218296, 0.3388311657202771, -0.0019387800662448947, 0.14340409685335145, 0.07909830941686623, 0.13876634049967568, -0.09935305303206848, 0.18731055592425258, -0.1967557162506415, 0.14912539203764824, 0.04819590331015473] |
1,802.05131 | Locomoting robots composed of immobile robots | Robotic materials are multi-robot systems formulated to leverage the
low-order computation and actuation of the constituents to manipulate the
high-order behavior of the entire material. We study the behaviors of ensembles
composed of smart active particles, smarticles. Smarticles are small, low cost
robots equipped with basic actuation and sensing abilities that are
individually incapable of rotating or displacing. We demonstrate that a
"supersmarticle", composed of many smarticles constrained within a bounding
membrane, can harness the internal collisions of the robotic material among the
constituents and the membrane to achieve diffusive locomotion. The emergent
diffusion can be directed by modulating the robotic material properties in
response to a light source, analogous to biological phototaxis. The light
source introduces asymmetries within the robotic material, resulting in
modified populations of interaction modes and dynamics which ultimately result
in supersmarticle biased locomotion. We present experimental methods and
results for the robotic material which moves with a directed displacement in
response to a light source.
| cs.RO | robotic materials are multirobot systems formulated to leverage the loworder computation and actuation of the constituents to manipulate the highorder behavior of the entire material we study the behaviors of ensembles composed of smart active particles smarticles smarticles are small low cost robots equipped with basic actuation and sensing abilities that are individually incapable of rotating or displacing we demonstrate that a supersmarticle composed of many smarticles constrained within a bounding membrane can harness the internal collisions of the robotic material among the constituents and the membrane to achieve diffusive locomotion the emergent diffusion can be directed by modulating the robotic material properties in response to a light source analogous to biological phototaxis the light source introduces asymmetries within the robotic material resulting in modified populations of interaction modes and dynamics which ultimately result in supersmarticle biased locomotion we present experimental methods and results for the robotic material which moves with a directed displacement in response to a light source | [['robotic', 'materials', 'are', 'multirobot', 'systems', 'formulated', 'to', 'leverage', 'the', 'loworder', 'computation', 'and', 'actuation', 'of', 'the', 'constituents', 'to', 'manipulate', 'the', 'highorder', 'behavior', 'of', 'the', 'entire', 'material', 'we', 'study', 'the', 'behaviors', 'of', 'ensembles', 'composed', 'of', 'smart', 'active', 'particles', 'smarticles', 'smarticles', 'are', 'small', 'low', 'cost', 'robots', 'equipped', 'with', 'basic', 'actuation', 'and', 'sensing', 'abilities', 'that', 'are', 'individually', 'incapable', 'of', 'rotating', 'or', 'displacing', 'we', 'demonstrate', 'that', 'a', 'supersmarticle', 'composed', 'of', 'many', 'smarticles', 'constrained', 'within', 'a', 'bounding', 'membrane', 'can', 'harness', 'the', 'internal', 'collisions', 'of', 'the', 'robotic', 'material', 'among', 'the', 'constituents', 'and', 'the', 'membrane', 'to', 'achieve', 'diffusive', 'locomotion', 'the', 'emergent', 'diffusion', 'can', 'be', 'directed', 'by', 'modulating', 'the', 'robotic', 'material', 'properties', 'in', 'response', 'to', 'a', 'light', 'source', 'analogous', 'to', 'biological', 'phototaxis', 'the', 'light', 'source', 'introduces', 'asymmetries', 'within', 'the', 'robotic', 'material', 'resulting', 'in', 'modified', 'populations', 'of', 'interaction', 'modes', 'and', 'dynamics', 'which', 'ultimately', 'result', 'in', 'supersmarticle', 'biased', 'locomotion', 'we', 'present', 'experimental', 'methods', 'and', 'results', 'for', 'the', 'robotic', 'material', 'which', 'moves', 'with', 'a', 'directed', 'displacement', 'in', 'response', 'to', 'a', 'light', 'source']] | [-0.13932714059774298, 0.2000468676298624, -0.06354837480757851, -0.03322485812386731, -0.1066447000936023, -0.1610645527829547, 0.002707055403152481, 0.4059660274069756, -0.2896848043106729, -0.3375983998004813, 0.053169325733324516, -0.26407077725743877, -0.18083159788657213, 0.18542794568202225, -0.09481923905532312, 0.05242317905067466, 0.0630385305848904, -0.032212736736983064, 0.0262472444865125, -0.14257489854935557, 0.21781549050028842, 0.025224578750203362, 0.23886071466840803, 0.004055121818964835, 0.14297779825283213, 0.010113794515928021, 0.04794456670369982, 0.03803126288985368, -0.06532531108287003, 0.1682460777914457, 0.2740411161157681, 0.05473243062624533, 0.23961723800748586, -0.46004405594430864, -0.22740289830508117, 0.07897599020434427, 0.14694295544031774, 0.0856088043181444, -0.05571502629609313, -0.2774240221711807, 0.031053576756676193, -0.13866673936427104, -0.1738162634181208, -0.0643661515918211, 0.002349741333455313, 0.09013426896708551, -0.23989086587098427, 0.018238553195260465, 0.026596229411370586, 0.06086170539565501, -0.09330663852451834, -0.06638641530735186, -0.012222455599112437, 0.1720690161761013, 0.0095293577585835, -0.029872862943739163, 0.24570640636738972, -0.18369759449633422, -0.1024674218155269, 0.415979670942761, -0.014875167863283422, -0.21509558435645887, 0.23134651749860496, -0.10902724637999199, -0.08836282079864759, 0.13617477052175672, 0.2485063195868861, 0.12409891066490672, -0.18955054169055074, -0.0105327218569073, 0.004094033592264168, 0.15656741635757498, 0.038282327872002496, 0.029350058769341558, 0.2367559274411178, 0.23115030493208905, 0.03875605155444646, 0.16328561153568444, -0.06082654256897513, -0.10653468458040152, -0.24120142752071844, -0.13165446487255394, -0.17122806164552457, 0.006259086666977965, -0.06698569947284341, -0.13371496603267588, 0.37486450488795525, 0.13710142145573628, 0.15829352953497278, 0.038856799528002736, 0.31731627114058936, 0.017629471847612876, 0.0918606300954707, 0.07403404752258211, 0.2847429423040012, 0.09860202370909973, 0.12759426340053323, -0.2668875539675355, 0.07429584859419265, 0.0030334504845086485] |
1,802.05132 | Close Miking Empirical Practice Verification: A Source Separation
Approach | Close miking represents a widely employed practice of placing a microphone
very near to the sound source in order to capture more direct sound and
minimize any pickup of ambient sound, including other, concurrently active
sources. It is used by the audio engineering community for decades for audio
recording, based on a number of empirical rules that were evolved during the
recording practice itself. But can this empirical knowledge and close miking
practice be systematically verified? In this work we aim to address this
question based on an analytic methodology that employs techniques and metrics
originating from the sound source separation evaluation field. In particular,
we apply a quantitative analysis of the source separation capabilities of the
close miking technique. The analysis is applied on a recording dataset obtained
at multiple positions of a typical musical hall, multiple distances between the
microphone and the sound source multiple microphone types and multiple level
differences between the sound source and the ambient acoustic component. For
all the above cases we compute the Source to Interference Ratio (SIR) metric.
The results obtained clearly demonstrate an optimum close-miking performance
that matches the current empirical knowledge of professional audio recording.
| eess.AS cs.SD | close miking represents a widely employed practice of placing a microphone very near to the sound source in order to capture more direct sound and minimize any pickup of ambient sound including other concurrently active sources it is used by the audio engineering community for decades for audio recording based on a number of empirical rules that were evolved during the recording practice itself but can this empirical knowledge and close miking practice be systematically verified in this work we aim to address this question based on an analytic methodology that employs techniques and metrics originating from the sound source separation evaluation field in particular we apply a quantitative analysis of the source separation capabilities of the close miking technique the analysis is applied on a recording dataset obtained at multiple positions of a typical musical hall multiple distances between the microphone and the sound source multiple microphone types and multiple level differences between the sound source and the ambient acoustic component for all the above cases we compute the source to interference ratio sir metric the results obtained clearly demonstrate an optimum closemiking performance that matches the current empirical knowledge of professional audio recording | [['close', 'miking', 'represents', 'a', 'widely', 'employed', 'practice', 'of', 'placing', 'a', 'microphone', 'very', 'near', 'to', 'the', 'sound', 'source', 'in', 'order', 'to', 'capture', 'more', 'direct', 'sound', 'and', 'minimize', 'any', 'pickup', 'of', 'ambient', 'sound', 'including', 'other', 'concurrently', 'active', 'sources', 'it', 'is', 'used', 'by', 'the', 'audio', 'engineering', 'community', 'for', 'decades', 'for', 'audio', 'recording', 'based', 'on', 'a', 'number', 'of', 'empirical', 'rules', 'that', 'were', 'evolved', 'during', 'the', 'recording', 'practice', 'itself', 'but', 'can', 'this', 'empirical', 'knowledge', 'and', 'close', 'miking', 'practice', 'be', 'systematically', 'verified', 'in', 'this', 'work', 'we', 'aim', 'to', 'address', 'this', 'question', 'based', 'on', 'an', 'analytic', 'methodology', 'that', 'employs', 'techniques', 'and', 'metrics', 'originating', 'from', 'the', 'sound', 'source', 'separation', 'evaluation', 'field', 'in', 'particular', 'we', 'apply', 'a', 'quantitative', 'analysis', 'of', 'the', 'source', 'separation', 'capabilities', 'of', 'the', 'close', 'miking', 'technique', 'the', 'analysis', 'is', 'applied', 'on', 'a', 'recording', 'dataset', 'obtained', 'at', 'multiple', 'positions', 'of', 'a', 'typical', 'musical', 'hall', 'multiple', 'distances', 'between', 'the', 'microphone', 'and', 'the', 'sound', 'source', 'multiple', 'microphone', 'types', 'and', 'multiple', 'level', 'differences', 'between', 'the', 'sound', 'source', 'and', 'the', 'ambient', 'acoustic', 'component', 'for', 'all', 'the', 'above', 'cases', 'we', 'compute', 'the', 'source', 'to', 'interference', 'ratio', 'sir', 'metric', 'the', 'results', 'obtained', 'clearly', 'demonstrate', 'an', 'optimum', 'closemiking', 'performance', 'that', 'matches', 'the', 'current', 'empirical', 'knowledge', 'of', 'professional', 'audio', 'recording']] | [-0.10148426135773915, 0.041908147600965485, -0.08041228296849684, 0.07347575825886302, -0.10721541463383041, -0.11183692397040881, 0.06646538448889654, 0.4109700920597948, -0.23625293653458357, -0.3347326828018023, 0.09177305819598727, -0.28752558314500704, -0.129503706410124, 0.2537696967861548, -0.056720050925523346, 0.042454111533834764, 0.07622755309278817, 0.07424394004695002, -0.03885525321232673, -0.19342863823817658, 0.2833413591166747, 0.06673859976491286, 0.3485608481629224, 0.04803176884558628, 0.10901804831414244, 0.0027744231443160897, -0.0664128533746932, -0.007695229306328965, -0.05986902339214587, 0.13236946529185534, 0.30811344336036633, 0.16829636584986576, 0.2576973847276771, -0.4133713812154439, -0.21466096094389417, 0.04826224605749678, 0.11737760291380818, 0.10112068886129358, -0.028739002593639956, -0.3089074910301523, 0.09219696220567393, -0.13423970342462538, -0.0676340322207045, -0.025558235517405357, -0.010521795494438716, 0.00183856206437208, -0.2404773459918605, 0.03725735731326889, 0.0425172394439194, 0.09428691404233158, -0.05069565991559018, -0.10104419563215264, 0.07393894567797632, 0.20504347037898435, 0.045672840788029134, 0.039664134381551384, 0.12833837437270612, -0.11331093429495369, -0.08421074379158695, 0.3585659821719392, -0.08053986452935148, -0.18215000589339772, 0.2260711698711264, -0.07342349347351215, -0.08204795456894663, 0.11934444564394653, 0.1977952344789525, 0.10060908776568729, -0.18288713104341217, -0.01112554242447998, 0.0031864572383617003, 0.23157774142623333, 0.12692126827602535, 0.002472337431360766, 0.21647492375347244, 0.16744638605825796, 0.01760149595613313, 0.15480142181406767, -0.14281984259849703, -0.034122884433150064, -0.27551354047453475, -0.10563376015916313, -0.2054515374757196, -0.02638137214409053, -0.08288109819578804, -0.14869309882075316, 0.3850578501551729, 0.20398786662088841, 0.15380025905159125, 0.04034804662247909, 0.3629221847549695, 0.06476048317968308, 0.03673124936956566, 0.07086074720112819, 0.2371781172270445, 0.08233645037968748, 0.1440335352360223, -0.19587371484484503, 0.09073214248763685, -0.002774883906558617] |
1,802.05133 | RadioAstron space-VLBI project: studies of masers in star forming
regions of our Galaxy and megamasers in external galaxies | Observations of the masers in the course of RadioAstron mission yielded
detections of fringes for a number of sources in both water and hydroxyl maser
transitions. Several sources display numerous ultra-compact details. This
proves that implementation of the space VLBI technique for maser studies is
possible technically and is not always prevented by the interstellar
scattering, maser beaming and other effects related to formation, transfer, and
detection of the cosmic maser emission. For the first time, cosmic water maser
emission was detected with projected baselines exceeding Earth Diameter. It was
detected in a number of star-forming regions in the Galaxy and megamaser
galaxies NGC 4258 and NGC 3079. RadioAstron observations provided the absolute
record of the angular resolution in astronomy. Fringes from the NGC 4258
megamaser were detected on baseline exceeding 25 Earth Diameters. This means
that the angular resolution sufficient to measure the parallax of the water
maser source in the nearby galaxy LMC was directly achieved in the cosmic maser
observations. Very compact features with angular sizes about 20 microarcsec
have been detected in star-forming regions of our Galaxy. Corresponding linear
sizes are about 5-10 million kilometers. So, the major step from milli- to
micro-arcsecond resolution in maser studies is done in the RadioAstron mission.
The existence of the features with extremely small angular sizes is
established. Further implementations of the space-VLBI maser instrument for
studies of the nature of cosmic objects, studies of the interaction of
extremely high radiation field with molecular material and studies of the
matter on the line of sight are planned.
| astro-ph.GA | observations of the masers in the course of radioastron mission yielded detections of fringes for a number of sources in both water and hydroxyl maser transitions several sources display numerous ultracompact details this proves that implementation of the space vlbi technique for maser studies is possible technically and is not always prevented by the interstellar scattering maser beaming and other effects related to formation transfer and detection of the cosmic maser emission for the first time cosmic water maser emission was detected with projected baselines exceeding earth diameter it was detected in a number of starforming regions in the galaxy and megamaser galaxies ngc 4258 and ngc 3079 radioastron observations provided the absolute record of the angular resolution in astronomy fringes from the ngc 4258 megamaser were detected on baseline exceeding 25 earth diameters this means that the angular resolution sufficient to measure the parallax of the water maser source in the nearby galaxy lmc was directly achieved in the cosmic maser observations very compact features with angular sizes about 20 microarcsec have been detected in starforming regions of our galaxy corresponding linear sizes are about 510 million kilometers so the major step from milli to microarcsecond resolution in maser studies is done in the radioastron mission the existence of the features with extremely small angular sizes is established further implementations of the spacevlbi maser instrument for studies of the nature of cosmic objects studies of the interaction of extremely high radiation field with molecular material and studies of the matter on the line of sight are planned | [['observations', 'of', 'the', 'masers', 'in', 'the', 'course', 'of', 'radioastron', 'mission', 'yielded', 'detections', 'of', 'fringes', 'for', 'a', 'number', 'of', 'sources', 'in', 'both', 'water', 'and', 'hydroxyl', 'maser', 'transitions', 'several', 'sources', 'display', 'numerous', 'ultracompact', 'details', 'this', 'proves', 'that', 'implementation', 'of', 'the', 'space', 'vlbi', 'technique', 'for', 'maser', 'studies', 'is', 'possible', 'technically', 'and', 'is', 'not', 'always', 'prevented', 'by', 'the', 'interstellar', 'scattering', 'maser', 'beaming', 'and', 'other', 'effects', 'related', 'to', 'formation', 'transfer', 'and', 'detection', 'of', 'the', 'cosmic', 'maser', 'emission', 'for', 'the', 'first', 'time', 'cosmic', 'water', 'maser', 'emission', 'was', 'detected', 'with', 'projected', 'baselines', 'exceeding', 'earth', 'diameter', 'it', 'was', 'detected', 'in', 'a', 'number', 'of', 'starforming', 'regions', 'in', 'the', 'galaxy', 'and', 'megamaser', 'galaxies', 'ngc', '4258', 'and', 'ngc', '3079', 'radioastron', 'observations', 'provided', 'the', 'absolute', 'record', 'of', 'the', 'angular', 'resolution', 'in', 'astronomy', 'fringes', 'from', 'the', 'ngc', '4258', 'megamaser', 'were', 'detected', 'on', 'baseline', 'exceeding', '25', 'earth', 'diameters', 'this', 'means', 'that', 'the', 'angular', 'resolution', 'sufficient', 'to', 'measure', 'the', 'parallax', 'of', 'the', 'water', 'maser', 'source', 'in', 'the', 'nearby', 'galaxy', 'lmc', 'was', 'directly', 'achieved', 'in', 'the', 'cosmic', 'maser', 'observations', 'very', 'compact', 'features', 'with', 'angular', 'sizes', 'about', '20', 'microarcsec', 'have', 'been', 'detected', 'in', 'starforming', 'regions', 'of', 'our', 'galaxy', 'corresponding', 'linear', 'sizes', 'are', 'about', '510', 'million', 'kilometers', 'so', 'the', 'major', 'step', 'from', 'milli', 'to', 'microarcsecond', 'resolution', 'in', 'maser', 'studies', 'is', 'done', 'in', 'the', 'radioastron', 'mission', 'the', 'existence', 'of', 'the', 'features', 'with', 'extremely', 'small', 'angular', 'sizes', 'is', 'established', 'further', 'implementations', 'of', 'the', 'spacevlbi', 'maser', 'instrument', 'for', 'studies', 'of', 'the', 'nature', 'of', 'cosmic', 'objects', 'studies', 'of', 'the', 'interaction', 'of', 'extremely', 'high', 'radiation', 'field', 'with', 'molecular', 'material', 'and', 'studies', 'of', 'the', 'matter', 'on', 'the', 'line', 'of', 'sight', 'are', 'planned']] | [-0.0962346155633437, 0.0737288786786926, -0.032239411083995834, 0.032739323824680186, -0.09167503695321348, -0.05270928711663794, -0.014475963417307091, 0.4511314062257261, -0.1316836839498927, -0.3701422891774496, 0.07734325043261485, -0.28742326406559854, 0.009035726307977944, 0.22420817860149483, -0.014345983053803942, -0.0014543052972113902, 0.09353905661544193, -0.09593321407636152, -0.020640006395374503, -0.23381336305882464, 0.23473977863196602, 0.16463955717482567, 0.18457118142396212, 0.006842426121841336, 0.12288595409860813, -0.16849971715137074, -0.12094700510086592, -0.03323435939520385, -0.12038935678172902, 0.08137338533961438, 0.3022838216186988, 0.13715373806189746, 0.2096127417415034, -0.3445973353344918, -0.22930745478690595, 0.04737553006406267, 0.13612068710124928, 0.05847425019375749, -0.01599361244706408, -0.35966927816643735, 0.02262414496955137, -0.13917865310506822, -0.20385474726456657, 0.08871415798243698, 0.06614452302446877, 0.05504355330752565, -0.1607266177365542, 0.1179016638337815, -0.005228371256980467, 0.1426198438677193, -0.13246746947483498, -0.12464142131597497, 0.0019070851966709822, 0.09179278917415717, 0.01046433533941641, 0.0768650781377688, 0.17347958675033393, -0.11836470284701375, -0.06940320868526997, 0.42149366468169486, -0.06834552322095622, -0.02538843763281064, 0.22451313199067502, -0.2726919489308953, -0.21773887377459278, 0.20355496156325406, 0.13067299534039672, 0.13651929174318853, -0.14894225604131875, -0.037446289668680896, -0.029836590490267836, 0.2321925826240764, 0.11693370121697239, 0.1102381136415363, 0.3079927409782486, 0.12863451505960652, 0.09211777674138921, 0.10164484878042676, -0.3186134822619718, -0.027617179637264042, -0.22338432031809966, -0.10310426023211186, -0.17100071165595174, 0.08802300449574678, -0.10368721695286773, -0.04152420653610548, 0.3435915309372683, 0.11360168354423326, 0.15463032038943741, -0.0043011852377635796, 0.3203793965323373, -0.010467112838433218, 0.13292512386836935, 0.07010174593743831, 0.3507083838357944, 0.15255671936040383, 0.0923929526578895, -0.24552342488228293, 0.09566172049561328, -0.026300578453946254] |
1,802.05134 | Quantum versus Classical Online Streaming Algorithms with Advice | We consider online algorithms with respect to the competitive ratio. Here, we
investigate quantum and classical one-way automata with non-constant size of
memory (streaming algorithms) as a model for online algorithms. We construct
problems that can be solved by quantum online streaming algorithms better than
by classical ones in a case of logarithmic or sublogarithmic size of memory,
even if classical online algorithms get advice bits. Furthermore, we show that
a quantum online algorithm with a constant number of qubits can be better than
any deterministic online algorithm with a constant number of advice bits and
unlimited computational power.
| cs.DS cs.CC quant-ph | we consider online algorithms with respect to the competitive ratio here we investigate quantum and classical oneway automata with nonconstant size of memory streaming algorithms as a model for online algorithms we construct problems that can be solved by quantum online streaming algorithms better than by classical ones in a case of logarithmic or sublogarithmic size of memory even if classical online algorithms get advice bits furthermore we show that a quantum online algorithm with a constant number of qubits can be better than any deterministic online algorithm with a constant number of advice bits and unlimited computational power | [['we', 'consider', 'online', 'algorithms', 'with', 'respect', 'to', 'the', 'competitive', 'ratio', 'here', 'we', 'investigate', 'quantum', 'and', 'classical', 'oneway', 'automata', 'with', 'nonconstant', 'size', 'of', 'memory', 'streaming', 'algorithms', 'as', 'a', 'model', 'for', 'online', 'algorithms', 'we', 'construct', 'problems', 'that', 'can', 'be', 'solved', 'by', 'quantum', 'online', 'streaming', 'algorithms', 'better', 'than', 'by', 'classical', 'ones', 'in', 'a', 'case', 'of', 'logarithmic', 'or', 'sublogarithmic', 'size', 'of', 'memory', 'even', 'if', 'classical', 'online', 'algorithms', 'get', 'advice', 'bits', 'furthermore', 'we', 'show', 'that', 'a', 'quantum', 'online', 'algorithm', 'with', 'a', 'constant', 'number', 'of', 'qubits', 'can', 'be', 'better', 'than', 'any', 'deterministic', 'online', 'algorithm', 'with', 'a', 'constant', 'number', 'of', 'advice', 'bits', 'and', 'unlimited', 'computational', 'power']] | [-0.10459624986267752, 0.13467988666297512, -0.03965131099326442, 0.08370680739806796, -0.09022437868583383, -0.2849446572786705, 0.10821661819154726, 0.4141569458362129, -0.2815499322470089, -0.34147995932208786, 0.10599353812832499, -0.24098395526108116, -0.15557372726904548, 0.2445719099246116, -0.116104367824102, 0.10881383355819818, 0.09345199585412488, 0.09379108353621429, -0.019920764187576646, -0.37426644744530246, 0.21609766317079915, 0.07153369771490682, 0.21329828218622793, -0.04431683927153548, 0.08321236508587997, -0.009903834977497658, 0.00011892938008061563, 0.10736502196423409, -0.12402515654817266, 0.0977897831107104, 0.28122006434796737, 0.1895242068220419, 0.3408589005056355, -0.4449086745429521, -0.1717806053677141, 0.18764668985063004, 0.1801617287682614, 0.1782701927368915, -0.045824609729790626, -0.2301265330011533, 0.1218277924209645, -0.15912380262814235, -0.023302010795562482, -0.08109289108107638, -0.023684600819692467, 0.02529456427160914, -0.31335011813225166, 0.02767346781499759, 0.0652851103193531, 0.006637939929284833, 0.00243867633657323, -0.09423802304787166, 0.14799665016677194, 0.08293439637201679, -0.016656662984233763, 0.04372735955103329, 0.10866457982120489, -0.15206979169990076, -0.2898223888166625, 0.3804688672111793, -0.06676728723981099, -0.20104869113849344, 0.12762496979775453, -0.02263876051651408, -0.09858311101267433, 0.09050358200652732, 0.2532931619860006, 0.09664075066702384, -0.06476610152032038, 0.1268611463066661, -0.07859067963154028, 0.2668759628396594, 0.0684091601652479, 0.08548322032121095, 0.044221175194840236, 0.1407424049602464, 0.12841094863798583, 0.18009738252272434, 0.052959468789549186, -0.12358939793958056, -0.1976566229655285, -0.1921413645261165, -0.20852077351483245, 0.06047543048896272, -0.2002944176157612, -0.17330059881270346, 0.30469246817790346, 0.13468224538967596, 0.16111445296179466, 0.1881120427784444, 0.37795170352352087, 0.07665525780252247, 0.04639731639657508, 0.2471924568902739, 0.13920544124810458, 0.027711799495260824, 0.09992873757099262, -0.20391012191998237, 0.10663399261638823, 0.07796313155517735] |
1,802.05135 | Uniform result for solutions of an equation with boundary singularity | We consider a variational problem with boundary singularity and Dirichlet
condition. We give a blow-up analysis for sequences of solutions of an equation
with exponential nonlinearity. Also, we derive a compactness criterion under
some conditions.
| math.AP | we consider a variational problem with boundary singularity and dirichlet condition we give a blowup analysis for sequences of solutions of an equation with exponential nonlinearity also we derive a compactness criterion under some conditions | [['we', 'consider', 'a', 'variational', 'problem', 'with', 'boundary', 'singularity', 'and', 'dirichlet', 'condition', 'we', 'give', 'a', 'blowup', 'analysis', 'for', 'sequences', 'of', 'solutions', 'of', 'an', 'equation', 'with', 'exponential', 'nonlinearity', 'also', 'we', 'derive', 'a', 'compactness', 'criterion', 'under', 'some', 'conditions']] | [-0.18761176530803952, -0.0306570565689721, -0.18376592775540693, 0.11651394505585944, -0.12812852938659489, -0.1969701367563435, 0.041577076193477426, 0.30988649023430687, -0.2595290032814124, -0.1937661479626383, 0.20739234389205063, -0.22738947878990853, -0.15011830037193638, 0.1555016084773732, -0.09592339122401816, 0.11221902389079333, 0.13379388475524528, 0.04070894954992192, -0.11445476596376726, -0.22806998444055873, 0.44787519137774195, -0.07168126931147915, 0.2177312250648226, 0.09800454135152645, 0.1333450150807039, -0.03860939198306629, 0.0787581925147346, -0.021044602271701608, -0.34029482772706876, 0.06710064047614911, 0.17077500969171525, 0.12117671711104257, 0.33409059457480905, -0.4375440252678735, -0.2264110435731709, 0.16265444297875678, 0.10740528954192996, 0.1339558190533093, -0.08067534996994905, -0.27917152132306783, 0.12794913985500378, -0.07889145399842944, -0.2243279961070844, -0.06716440085853849, -0.032837333476969176, 0.07139409836714289, -0.39671687499753067, 0.1356836397924261, 0.12993401805205004, 0.094207826562758, -0.2314696881654007, -0.01130732489483697, 0.05955890025610903, -0.03268376660666295, 0.06348903715011797, -0.07446210980415344, -0.030961132142692804, -0.1427714204548725, -0.03236656884795853, 0.311446083762816, -0.0814371854599033, -0.32328508943319323, 0.14488186610064335, -0.06650896354445389, -0.14596404286899736, 0.05256498212526951, 0.11452761927087392, 0.17912519185670783, -0.1630670583939978, 0.11359514883952215, -0.0513785876300452, 0.11738997439720801, 0.1549882097169757, 0.007464121548192842, 0.062476155640823504, 0.13838548325002192, 0.22057875634304114, 0.24566305742066885, -0.031235827964597514, -0.049514817100550446, -0.4089342975190708, -0.1602082511144025, -0.08816364830625908, 0.1299836518808401, -0.15897048408390088, -0.26064332712973864, 0.33671256362327506, 0.08467372683808208, 0.22911695324416673, 0.12833193253193584, 0.17956131760563168, 0.25009525758879525, -0.07633282181341201, 0.06754120713095679, 0.106820352466145, 0.1697893746729408, 0.09602189480460116, -0.18164193016210836, -0.004562337483678546, 0.18181121349334717] |
1,802.05136 | Yukawa couplings from magnetized D-brane models on non-factorisable tori | We compute Yukawa couplings in type IIB string theory compactified on a non
factorisable six-torus in the presence of D9 branes and fluxes. The setting
studied in detail, is obtained by T-dualising an intersecting brane
configuration of type IIA theory compactified on a torus generated by the
SO(12) root lattice. Particular deformations of such torus are taken into
account and provide moduli dependent couplings. Agreement with the type IIA
result is found in a non trivial way. The classical type IIB calculation gives
also information on a factor accessible only by quantum computations on the
type IIA side.
| hep-th | we compute yukawa couplings in type iib string theory compactified on a non factorisable sixtorus in the presence of d9 branes and fluxes the setting studied in detail is obtained by tdualising an intersecting brane configuration of type iia theory compactified on a torus generated by the so12 root lattice particular deformations of such torus are taken into account and provide moduli dependent couplings agreement with the type iia result is found in a non trivial way the classical type iib calculation gives also information on a factor accessible only by quantum computations on the type iia side | [['we', 'compute', 'yukawa', 'couplings', 'in', 'type', 'iib', 'string', 'theory', 'compactified', 'on', 'a', 'non', 'factorisable', 'sixtorus', 'in', 'the', 'presence', 'of', 'd9', 'branes', 'and', 'fluxes', 'the', 'setting', 'studied', 'in', 'detail', 'is', 'obtained', 'by', 'tdualising', 'an', 'intersecting', 'brane', 'configuration', 'of', 'type', 'iia', 'theory', 'compactified', 'on', 'a', 'torus', 'generated', 'by', 'the', 'so12', 'root', 'lattice', 'particular', 'deformations', 'of', 'such', 'torus', 'are', 'taken', 'into', 'account', 'and', 'provide', 'moduli', 'dependent', 'couplings', 'agreement', 'with', 'the', 'type', 'iia', 'result', 'is', 'found', 'in', 'a', 'non', 'trivial', 'way', 'the', 'classical', 'type', 'iib', 'calculation', 'gives', 'also', 'information', 'on', 'a', 'factor', 'accessible', 'only', 'by', 'quantum', 'computations', 'on', 'the', 'type', 'iia', 'side']] | [-0.16881080914516838, 0.11217652441003023, -0.019845215850794802, 0.1329842766019877, -0.09424475510129515, -0.21453758169972928, 0.023697216099375213, 0.2864902240594811, -0.1425403158551044, -0.21525466353727543, 0.12321489826272412, -0.2608891860011737, -0.12399876314424435, 0.15968305165214197, -0.08494174271840982, -0.11032687001671566, 0.022077955101255556, 0.053017691345897275, -0.09054737936287206, -0.3166061015668971, 0.368497439873956, -0.01384015702072303, 0.3025018298732383, 0.017538640845319902, 0.06304080810930048, 0.02446817199709084, -0.033350698207980214, 0.0359240558036432, -0.16469220461591733, 0.13979994623722242, 0.18396238706131673, -0.002608166052484695, 0.03480012911580959, -0.4799225675512333, -0.2145888640032131, 0.07013762640120576, 0.18758608667389015, 0.14207301878522396, -0.012532310973738834, -0.2741406489714828, 0.027492552206908563, -0.16762525178206972, -0.19873108113260599, -0.06022437408979868, 0.0033691888627577194, -0.05896309996023774, -0.226362138806025, 0.022831814489220458, -0.000530766679582243, 0.0511597269761129, -0.037312505975821794, -0.07294851450049984, -0.07687144400551915, 0.028845693848965386, 0.09252595469794814, 0.056245383909874956, 0.11986313098613934, -0.14118938958414887, -0.13650689008455646, 0.3722008649563911, -0.07352406233406569, -0.23141506850263294, 0.1244641127520982, -0.08463555682754638, -0.15247580125376733, 0.12983014454532946, 0.06539869724478269, 0.1543930262156135, -0.10252491968721912, 0.26420537683499823, -0.020021007201463287, 0.14193633823104354, 0.07064695901959678, 0.0629692197941708, 0.22355696734763225, 0.11835932232943193, 0.0064580743486175735, 0.11214528526939756, -0.04131516021657355, -0.15056698543627803, -0.4413672341223882, -0.05911587534605393, -0.09676729699558749, 0.21562756910178887, -0.1777498172878226, -0.20110239869230712, 0.32587504845910836, -0.005152923062714577, 0.1818200298513723, -0.0013659639926674795, 0.1414863946562519, 0.043219802297689784, 0.06950633319531929, 0.024674291446881026, 0.237994023351645, 0.17016826285648026, 0.06128749559272309, -0.22683633956107863, -0.10045578409632554, 0.25459249146586777] |
1,802.05137 | A Space Time Domain Decomposition Approach using Enhanced Velocity Mixed
Finite Element Method | A space-time domain decomposition approach is presented as a natural
extension of the enhanced velocity mixed finite element (EVMFE) [Wheeler et.
al] for spatial domain decomposition. The proposed approach allows for
different space-time discretizations on non-overlapping, subdomains by
enforcing a mass continuity argument at the non-matching interface to preserve
the local mass conservation property inherent to the mixed finite element
methods. To this effect, we consider three different model formulations: (1) a
linear single phase flow problem, (2) a non-linear slightly compressible flow
and tracer transport, and (3) a non-linear slightly compressible, multiphase
flow and transport. We also present a numerical solution algorithm for the
proposed domain decomposition approach where a monolithic (fully coupled in
space and time) system is constructed that does not require subdomain
iterations. This space-time EVMFE method accurately resolves
advection-diffusion transport features, in a heterogeneous medium, while
circumventing non-linear solver convergence issues associated with large
time-step sizes for non-linear problems. Numerical results are presented for
the aforementioned, three, model formulations to demonstrate the applicability
of this approach to a general class of problems in flow and transport in porous
media.
| math.NA | a spacetime domain decomposition approach is presented as a natural extension of the enhanced velocity mixed finite element evmfe wheeler et al for spatial domain decomposition the proposed approach allows for different spacetime discretizations on nonoverlapping subdomains by enforcing a mass continuity argument at the nonmatching interface to preserve the local mass conservation property inherent to the mixed finite element methods to this effect we consider three different model formulations 1 a linear single phase flow problem 2 a nonlinear slightly compressible flow and tracer transport and 3 a nonlinear slightly compressible multiphase flow and transport we also present a numerical solution algorithm for the proposed domain decomposition approach where a monolithic fully coupled in space and time system is constructed that does not require subdomain iterations this spacetime evmfe method accurately resolves advectiondiffusion transport features in a heterogeneous medium while circumventing nonlinear solver convergence issues associated with large timestep sizes for nonlinear problems numerical results are presented for the aforementioned three model formulations to demonstrate the applicability of this approach to a general class of problems in flow and transport in porous media | [['a', 'spacetime', 'domain', 'decomposition', 'approach', 'is', 'presented', 'as', 'a', 'natural', 'extension', 'of', 'the', 'enhanced', 'velocity', 'mixed', 'finite', 'element', 'evmfe', 'wheeler', 'et', 'al', 'for', 'spatial', 'domain', 'decomposition', 'the', 'proposed', 'approach', 'allows', 'for', 'different', 'spacetime', 'discretizations', 'on', 'nonoverlapping', 'subdomains', 'by', 'enforcing', 'a', 'mass', 'continuity', 'argument', 'at', 'the', 'nonmatching', 'interface', 'to', 'preserve', 'the', 'local', 'mass', 'conservation', 'property', 'inherent', 'to', 'the', 'mixed', 'finite', 'element', 'methods', 'to', 'this', 'effect', 'we', 'consider', 'three', 'different', 'model', 'formulations', '1', 'a', 'linear', 'single', 'phase', 'flow', 'problem', '2', 'a', 'nonlinear', 'slightly', 'compressible', 'flow', 'and', 'tracer', 'transport', 'and', '3', 'a', 'nonlinear', 'slightly', 'compressible', 'multiphase', 'flow', 'and', 'transport', 'we', 'also', 'present', 'a', 'numerical', 'solution', 'algorithm', 'for', 'the', 'proposed', 'domain', 'decomposition', 'approach', 'where', 'a', 'monolithic', 'fully', 'coupled', 'in', 'space', 'and', 'time', 'system', 'is', 'constructed', 'that', 'does', 'not', 'require', 'subdomain', 'iterations', 'this', 'spacetime', 'evmfe', 'method', 'accurately', 'resolves', 'advectiondiffusion', 'transport', 'features', 'in', 'a', 'heterogeneous', 'medium', 'while', 'circumventing', 'nonlinear', 'solver', 'convergence', 'issues', 'associated', 'with', 'large', 'timestep', 'sizes', 'for', 'nonlinear', 'problems', 'numerical', 'results', 'are', 'presented', 'for', 'the', 'aforementioned', 'three', 'model', 'formulations', 'to', 'demonstrate', 'the', 'applicability', 'of', 'this', 'approach', 'to', 'a', 'general', 'class', 'of', 'problems', 'in', 'flow', 'and', 'transport', 'in', 'porous', 'media']] | [-0.09281488766402497, 0.048409646337309466, -0.09034388168755877, 0.007965804785771479, -0.09801525805032925, -0.15541405703074165, -0.03065918634676344, 0.34959796122735837, -0.32716568231398424, -0.2873439465158179, 0.11685149582834649, -0.22531374755891484, -0.11073339476690187, 0.150430252298375, -0.05743397729711832, 0.11490805266625861, 0.08215650458625712, -0.08589841602600415, -0.07869068181505529, -0.20063197112944142, 0.3197388760336153, -0.028591177774245267, 0.3177443146398598, 0.045179633324221286, 0.16641051720336572, -0.03866982207874061, -0.04214718704019765, 0.09994629965976756, -0.12094855783424874, 0.09214239973500678, 0.2336970025386948, 0.05771630968844805, 0.31321810829135904, -0.42638263274700594, -0.29521410318685104, 0.04707700792945676, 0.1626880922237063, 0.12727703656719813, -0.067498554402686, -0.2453210136807104, 0.0936789162070644, -0.14018142051933394, -0.1407846776988603, -0.06729007203510584, -0.01592332787381915, -0.025502360818951113, -0.31774078862444793, 0.12829714526718478, 0.06642562684674676, 0.012290923721873416, -0.08976161700275542, -0.09049093555838156, 0.017402247344092518, 0.054663143742440655, -0.006593502077381485, -0.022055272655152194, 0.08557582210306754, -0.09463287002002758, -0.07150579187289842, 0.41575965399925524, -0.04274891932612633, -0.31914764662800293, 0.21976217992378624, -0.08863871729840617, -0.09871984040236693, 0.13851293815033777, 0.21888370287110825, 0.17864425518488572, -0.14266535555329787, 0.08144322623195546, -0.06848063529341143, 0.17033330457551138, 0.04012303203753718, -0.025250042876635504, 0.11670197577888637, 0.19791526693570433, 0.11667642720647484, 0.09689994712915415, -0.041030910321841384, -0.13415678124778885, -0.3096637751108834, -0.1545929653726129, -0.1641703951019016, -0.021398692954620116, -0.14013491423023738, -0.18075095763133203, 0.3828901406652601, 0.14955504119119883, 0.12774386542470573, 0.05216454836325003, 0.3193059103246164, 0.11081983579852321, 0.027459669084247244, 0.11821470265839618, 0.17499346007685085, 0.13932325125027162, 0.1765941244660068, -0.2638671603568722, 0.0009431613859935448, 0.1655805398055076] |
1,802.05138 | Study of diffuse HII regions potentially forming part of the gas streams
around Sgr A* | We present a study of diffuse extended ionised gas toward three clouds
located in the Galactic Centre (GC). One line of sight (LOS) is toward the 20
km s$^{-1}$ cloud (LOS$-$0.11) in the Sgr A region, another LOS is toward the
50 km s$^{-1}$ cloud (LOS$-$0.02), also in Sgr A, while the third is toward the
Sgr B2 cloud (LOS+0.693). The emission from the ionised gas is detected from
H$n\alpha$ and H$m\beta$ radio recombination lines (RRLs). He$n\alpha$ and
He$m\beta$ RRL emission is detected with the same $n$ and $m$ as those from the
hydrogen RRLs only toward LOS+0.693. RRLs probe gas with positive and negative
velocities toward the two Sgr A sources. The H$m\beta$ to H$n\alpha$ ratios
reveal that the ionised gas is emitted under local thermodynamic equilibrium
conditions in these regions. We find a He to H mass fraction of 0.29$\pm$0.01
consistent with the typical GC value, supporting the idea that massive stars
have increased the He abundance compared to its primordial value. Physical
properties are derived for the studied sources. We propose that the negative
velocity component of both Sgr A sources is part of gas streams considered
previously to model the GC cloud kinematics. Associated massive stars with what
are presumably the closest HII regions to LOS$-$0.11 (positive velocity gas),
LOS$-$0.02 and LOS+0.693 could be the main sources of UV photons ionising the
gas. The negative velocity components of both Sgr A sources might be ionised by
the same massive stars, but only if they are in the same gas stream.
| astro-ph.GA | we present a study of diffuse extended ionised gas toward three clouds located in the galactic centre gc one line of sight los is toward the 20 km s1 cloud los011 in the sgr a region another los is toward the 50 km s1 cloud los002 also in sgr a while the third is toward the sgr b2 cloud los0693 the emission from the ionised gas is detected from hnalpha and hmbeta radio recombination lines rrls henalpha and hembeta rrl emission is detected with the same n and m as those from the hydrogen rrls only toward los0693 rrls probe gas with positive and negative velocities toward the two sgr a sources the hmbeta to hnalpha ratios reveal that the ionised gas is emitted under local thermodynamic equilibrium conditions in these regions we find a he to h mass fraction of 029pm001 consistent with the typical gc value supporting the idea that massive stars have increased the he abundance compared to its primordial value physical properties are derived for the studied sources we propose that the negative velocity component of both sgr a sources is part of gas streams considered previously to model the gc cloud kinematics associated massive stars with what are presumably the closest hii regions to los011 positive velocity gas los002 and los0693 could be the main sources of uv photons ionising the gas the negative velocity components of both sgr a sources might be ionised by the same massive stars but only if they are in the same gas stream | [['we', 'present', 'a', 'study', 'of', 'diffuse', 'extended', 'ionised', 'gas', 'toward', 'three', 'clouds', 'located', 'in', 'the', 'galactic', 'centre', 'gc', 'one', 'line', 'of', 'sight', 'los', 'is', 'toward', 'the', '20', 'km', 's1', 'cloud', 'los011', 'in', 'the', 'sgr', 'a', 'region', 'another', 'los', 'is', 'toward', 'the', '50', 'km', 's1', 'cloud', 'los002', 'also', 'in', 'sgr', 'a', 'while', 'the', 'third', 'is', 'toward', 'the', 'sgr', 'b2', 'cloud', 'los0693', 'the', 'emission', 'from', 'the', 'ionised', 'gas', 'is', 'detected', 'from', 'hnalpha', 'and', 'hmbeta', 'radio', 'recombination', 'lines', 'rrls', 'henalpha', 'and', 'hembeta', 'rrl', 'emission', 'is', 'detected', 'with', 'the', 'same', 'n', 'and', 'm', 'as', 'those', 'from', 'the', 'hydrogen', 'rrls', 'only', 'toward', 'los0693', 'rrls', 'probe', 'gas', 'with', 'positive', 'and', 'negative', 'velocities', 'toward', 'the', 'two', 'sgr', 'a', 'sources', 'the', 'hmbeta', 'to', 'hnalpha', 'ratios', 'reveal', 'that', 'the', 'ionised', 'gas', 'is', 'emitted', 'under', 'local', 'thermodynamic', 'equilibrium', 'conditions', 'in', 'these', 'regions', 'we', 'find', 'a', 'he', 'to', 'h', 'mass', 'fraction', 'of', '029pm001', 'consistent', 'with', 'the', 'typical', 'gc', 'value', 'supporting', 'the', 'idea', 'that', 'massive', 'stars', 'have', 'increased', 'the', 'he', 'abundance', 'compared', 'to', 'its', 'primordial', 'value', 'physical', 'properties', 'are', 'derived', 'for', 'the', 'studied', 'sources', 'we', 'propose', 'that', 'the', 'negative', 'velocity', 'component', 'of', 'both', 'sgr', 'a', 'sources', 'is', 'part', 'of', 'gas', 'streams', 'considered', 'previously', 'to', 'model', 'the', 'gc', 'cloud', 'kinematics', 'associated', 'massive', 'stars', 'with', 'what', 'are', 'presumably', 'the', 'closest', 'hii', 'regions', 'to', 'los011', 'positive', 'velocity', 'gas', 'los002', 'and', 'los0693', 'could', 'be', 'the', 'main', 'sources', 'of', 'uv', 'photons', 'ionising', 'the', 'gas', 'the', 'negative', 'velocity', 'components', 'of', 'both', 'sgr', 'a', 'sources', 'might', 'be', 'ionised', 'by', 'the', 'same', 'massive', 'stars', 'but', 'only', 'if', 'they', 'are', 'in', 'the', 'same', 'gas', 'stream']] | [-0.09649031517012913, 0.10397407585502365, -0.03185649671467391, 0.04598044407512024, -0.05888953474435111, -0.08798499012494135, 0.056228992467942204, 0.4214662689911692, -0.1577829374660274, -0.2827591129393894, 0.029185694868125864, -0.3210411047495087, 0.03971544600672537, 0.14813722267196427, 0.005007874048461097, -0.0813588651775209, 0.03129752078173712, -0.04841191512400563, -0.00281439053586605, -0.1969938429119572, 0.30286465861989176, 0.07085916221609362, 0.15633994327228412, 0.0004215898500804446, 0.06684164079245526, -0.19163482546663055, -0.050851519355316635, -0.019391999157665953, -0.07938603553783713, 0.0802524540618605, 0.22162855571128337, 0.1389938455625524, 0.20273548200997987, -0.34734495364220036, -0.24726794891602355, 0.051485442434841024, 0.23326017164251944, 0.049790869222818175, -0.04839553339651933, -0.3095865759900526, 0.05382807157709365, -0.17424562296864052, -0.24334493531894527, 0.13640878080326294, 0.06968361947111416, 0.036324444606566524, -0.18580471968414028, 0.13362497538702867, -0.014546637825841303, 0.058162977619224836, -0.09720919872417307, -0.11692888390363348, -0.0695335558834316, 0.07756758578543962, 0.01269770951362832, 0.0876192140736078, 0.2501779927133096, -0.1194196679225938, 0.01676103788916293, 0.426451319775842, -0.1037579240835449, -0.013510689253424886, 0.23457363085644056, -0.24258277567031866, -0.22193150882710994, 0.20508933223139209, 0.11650587481103446, 0.10590004909176545, -0.15024818102395546, -0.014225279938981978, -0.07073546398189748, 0.17036582490331248, 0.06004248786838311, 0.06111411715910472, 0.3480088810246958, 0.011623817627970507, 0.06627271150430049, 0.11774052000488626, -0.2711523207423451, -0.08214704235091896, -0.22407457431559621, -0.15050157355210605, -0.10348509424479173, 0.07140398530481828, -0.12152235303044664, -0.09123757755257064, 0.27612250260744803, 0.0951066446765835, 0.24583465274166966, -0.0020043621488247325, 0.34672862489854817, 0.09981120896887652, 0.0966214568520093, 0.19285481581596378, 0.28730523748783326, 0.1957169425106317, 0.1115843462611658, -0.21837786461230413, 0.0962916804733969, -0.006564704448678474] |
1,802.05139 | Structural changes in the interbank market across the financial crisis
from multiple core-periphery analysis | Interbank markets are often characterised in terms of a core-periphery
network structure, with a highly interconnected core of banks holding the
market together, and a periphery of banks connected mostly to the core but not
internally. This paradigm has recently been challenged for short time scales,
where interbank markets seem better characterised by a bipartite structure with
more core-periphery connections than inside the core. Using a novel
core-periphery detection method on the eMID interbank market, we enrich this
picture by showing that the network is actually characterised by multiple
core-periphery pairs. Moreover, a transition from core-periphery to bipartite
structures occurs by shortening the temporal scale of data aggregation. We
further show how the global financial crisis transformed the market, in terms
of composition, multiplicity and internal organisation of core-periphery pairs.
By unveiling such a fine-grained organisation and transformation of the
interbank market, our method can find important applications in the
understanding of how distress can propagate over financial networks.
| q-fin.RM physics.soc-ph | interbank markets are often characterised in terms of a coreperiphery network structure with a highly interconnected core of banks holding the market together and a periphery of banks connected mostly to the core but not internally this paradigm has recently been challenged for short time scales where interbank markets seem better characterised by a bipartite structure with more coreperiphery connections than inside the core using a novel coreperiphery detection method on the emid interbank market we enrich this picture by showing that the network is actually characterised by multiple coreperiphery pairs moreover a transition from coreperiphery to bipartite structures occurs by shortening the temporal scale of data aggregation we further show how the global financial crisis transformed the market in terms of composition multiplicity and internal organisation of coreperiphery pairs by unveiling such a finegrained organisation and transformation of the interbank market our method can find important applications in the understanding of how distress can propagate over financial networks | [['interbank', 'markets', 'are', 'often', 'characterised', 'in', 'terms', 'of', 'a', 'coreperiphery', 'network', 'structure', 'with', 'a', 'highly', 'interconnected', 'core', 'of', 'banks', 'holding', 'the', 'market', 'together', 'and', 'a', 'periphery', 'of', 'banks', 'connected', 'mostly', 'to', 'the', 'core', 'but', 'not', 'internally', 'this', 'paradigm', 'has', 'recently', 'been', 'challenged', 'for', 'short', 'time', 'scales', 'where', 'interbank', 'markets', 'seem', 'better', 'characterised', 'by', 'a', 'bipartite', 'structure', 'with', 'more', 'coreperiphery', 'connections', 'than', 'inside', 'the', 'core', 'using', 'a', 'novel', 'coreperiphery', 'detection', 'method', 'on', 'the', 'emid', 'interbank', 'market', 'we', 'enrich', 'this', 'picture', 'by', 'showing', 'that', 'the', 'network', 'is', 'actually', 'characterised', 'by', 'multiple', 'coreperiphery', 'pairs', 'moreover', 'a', 'transition', 'from', 'coreperiphery', 'to', 'bipartite', 'structures', 'occurs', 'by', 'shortening', 'the', 'temporal', 'scale', 'of', 'data', 'aggregation', 'we', 'further', 'show', 'how', 'the', 'global', 'financial', 'crisis', 'transformed', 'the', 'market', 'in', 'terms', 'of', 'composition', 'multiplicity', 'and', 'internal', 'organisation', 'of', 'coreperiphery', 'pairs', 'by', 'unveiling', 'such', 'a', 'finegrained', 'organisation', 'and', 'transformation', 'of', 'the', 'interbank', 'market', 'our', 'method', 'can', 'find', 'important', 'applications', 'in', 'the', 'understanding', 'of', 'how', 'distress', 'can', 'propagate', 'over', 'financial', 'networks']] | [-0.13172357322856104, 0.09579970069674763, -0.10142220893827905, 0.11995548328440402, -0.08934404483795716, -0.08399723733353587, 0.063001234119512, 0.4039071550674783, -0.29661896303237517, -0.2756710621651332, 0.11770048157719064, -0.2621646195433378, -0.24447561894490752, 0.12852557312108506, -0.05526360099162883, -0.02953867139821907, 0.09348388262819382, 0.013054772329944297, 0.03536370114663853, -0.22741957790505304, 0.3409369334028653, 0.07998182164774563, 0.33007105129460496, 0.05842884290452172, 0.07261590100312312, -0.03789670887599412, -0.050445973712792795, 0.08381417361322392, -0.06912307462490452, 0.1971126053154281, 0.29569887993974414, 0.1512095204762435, 0.34138651092320027, -0.4857698320147564, -0.2245532640449281, 0.1284427223419595, 0.10792090894607534, 0.016868799743271847, 0.02663297378544113, -0.3350156586172071, 0.05259398170219699, -0.27175198664080424, -0.08028095338527265, -0.09630643866323638, 0.001750467485695515, 0.024884077233449795, -0.21838928803687319, 0.08054935538843579, 0.06422464486281827, 0.04519488535962015, -0.016633279510310985, -0.03806019293103344, -0.09135428108948535, 0.1328055647277982, 0.023179513655614648, -0.059628702407269356, 0.15286329909924817, -0.15819918463861793, -0.15825165531439883, 0.3748706042409271, -0.01886010006461483, -0.10861345713829282, 0.17261479863071078, -0.12717373064373555, -0.16094714725967027, 0.1219871161599298, 0.18562077077796812, -0.00035113938271401905, -0.16951241431561587, -0.007427375132156501, -0.07975003082281763, 0.18271285542374793, 0.09603207119968983, 0.000757818886389335, 0.2319393289764558, 0.26527657931261994, 0.10520166113574363, 0.1289297413321083, -0.0372927835165031, -0.1645968232667015, -0.18068827947919439, -0.07774819746765795, -0.16085052671520123, 0.02780459008229759, -0.15061839484236622, -0.15931997051002728, 0.43586849511466313, 0.07805603771300623, 0.19564398949959977, 0.03601764033273237, 0.2312043871871143, 0.0042368359212125156, 0.10402892856220217, 0.12391179042382154, 0.18312084155487418, 0.04036525789349568, 0.1512431964188896, -0.1377462086402489, 0.20474405847958424, 0.011786429179281747] |
1,802.0514 | MOND and the dynamics of NGC 628 | Aniyan et al. (2018) have recently published direct measurements of the
baryonic mass distribution and the rotation curve of the almost-face-on disc
galaxy NGC 628. While its very low inclination makes this galaxy anything but
ideal for rotation-curve analysis, these new results, taken at face value, have
interesting ramifications for MOND. The methods employed afford a direct
determination of the stellar mass in the disc, which, in turn, affords a
parameter-free MOND prediction of the rotation curve, which I show. In
comparison, the dark-matter fits that Aniyan et al. present have two free
parameters. To boot, these results further negate an earlier claim deleterious
to MOND. It is that stellar $M/L$ ratios deduced from vertical velocity
dispersions in disc galaxies are rather lower than what is required by MOND
fits to rotation curves. Specifically, it was claimed that even
high-surface-density discs are, by and large, sub maximal; viz., that they show
substantial mass discrepancies near their center. This is contrary to the
prediction of MOND that in such high-acceleration regions only small
discrepancies should appear, if any to speak of. Such claims of low $M/L$
values have been rebutted before, and the fallacy that may have led to them
pointed out. The new results strongly buttress these rebuttals.
| astro-ph.GA astro-ph.CO gr-qc hep-ph | aniyan et al 2018 have recently published direct measurements of the baryonic mass distribution and the rotation curve of the almostfaceon disc galaxy ngc 628 while its very low inclination makes this galaxy anything but ideal for rotationcurve analysis these new results taken at face value have interesting ramifications for mond the methods employed afford a direct determination of the stellar mass in the disc which in turn affords a parameterfree mond prediction of the rotation curve which i show in comparison the darkmatter fits that aniyan et al present have two free parameters to boot these results further negate an earlier claim deleterious to mond it is that stellar ml ratios deduced from vertical velocity dispersions in disc galaxies are rather lower than what is required by mond fits to rotation curves specifically it was claimed that even highsurfacedensity discs are by and large sub maximal viz that they show substantial mass discrepancies near their center this is contrary to the prediction of mond that in such highacceleration regions only small discrepancies should appear if any to speak of such claims of low ml values have been rebutted before and the fallacy that may have led to them pointed out the new results strongly buttress these rebuttals | [['aniyan', 'et', 'al', '2018', 'have', 'recently', 'published', 'direct', 'measurements', 'of', 'the', 'baryonic', 'mass', 'distribution', 'and', 'the', 'rotation', 'curve', 'of', 'the', 'almostfaceon', 'disc', 'galaxy', 'ngc', '628', 'while', 'its', 'very', 'low', 'inclination', 'makes', 'this', 'galaxy', 'anything', 'but', 'ideal', 'for', 'rotationcurve', 'analysis', 'these', 'new', 'results', 'taken', 'at', 'face', 'value', 'have', 'interesting', 'ramifications', 'for', 'mond', 'the', 'methods', 'employed', 'afford', 'a', 'direct', 'determination', 'of', 'the', 'stellar', 'mass', 'in', 'the', 'disc', 'which', 'in', 'turn', 'affords', 'a', 'parameterfree', 'mond', 'prediction', 'of', 'the', 'rotation', 'curve', 'which', 'i', 'show', 'in', 'comparison', 'the', 'darkmatter', 'fits', 'that', 'aniyan', 'et', 'al', 'present', 'have', 'two', 'free', 'parameters', 'to', 'boot', 'these', 'results', 'further', 'negate', 'an', 'earlier', 'claim', 'deleterious', 'to', 'mond', 'it', 'is', 'that', 'stellar', 'ml', 'ratios', 'deduced', 'from', 'vertical', 'velocity', 'dispersions', 'in', 'disc', 'galaxies', 'are', 'rather', 'lower', 'than', 'what', 'is', 'required', 'by', 'mond', 'fits', 'to', 'rotation', 'curves', 'specifically', 'it', 'was', 'claimed', 'that', 'even', 'highsurfacedensity', 'discs', 'are', 'by', 'and', 'large', 'sub', 'maximal', 'viz', 'that', 'they', 'show', 'substantial', 'mass', 'discrepancies', 'near', 'their', 'center', 'this', 'is', 'contrary', 'to', 'the', 'prediction', 'of', 'mond', 'that', 'in', 'such', 'highacceleration', 'regions', 'only', 'small', 'discrepancies', 'should', 'appear', 'if', 'any', 'to', 'speak', 'of', 'such', 'claims', 'of', 'low', 'ml', 'values', 'have', 'been', 'rebutted', 'before', 'and', 'the', 'fallacy', 'that', 'may', 'have', 'led', 'to', 'them', 'pointed', 'out', 'the', 'new', 'results', 'strongly', 'buttress', 'these', 'rebuttals']] | [-0.07096622067444858, 0.07861981521541699, -0.13930136428748086, 0.10531889428994935, -0.11936643575114714, -0.12564395527915975, 0.025993151225158672, 0.38528692420770966, -0.1729677424447394, -0.3512361664324999, 0.058820477702645854, -0.2377290094454402, -0.09439468471948238, 0.23411166520328125, -0.10323219882432842, 0.03681502578582545, 0.06898504695448193, -0.055185515076392196, -0.05635665176951697, -0.309097224417554, 0.2818246228932358, 0.07453956020977891, 0.20107242276155146, 0.0013004307029316727, 0.03797243345354783, -0.07128404773284627, -0.04983120229777889, 0.019106213977668905, -0.1891837368506087, 0.05725360585566502, 0.22825053478964125, 0.12322663015672412, 0.23170371211893423, -0.3773821759426478, -0.20549719080157144, 0.08476281647222315, 0.1679460918903803, 0.10356497660378736, -0.06779846283878443, -0.23357096350598103, 0.09138646314838376, -0.18857767044914686, -0.15310674575519143, -0.04090760014465224, 0.07849354979817222, -0.006810875047926194, -0.2001812303398094, 0.1121291538965504, 0.06685870822046622, 0.0671910951060295, -0.05563875640351416, -0.15733568326036618, -0.0459625241143213, 0.06593275351452108, 0.08517093388974052, 0.06566434089451557, 0.1479480785308677, -0.12311059350681319, -0.044009787666281344, 0.4050626978549419, -0.03593276186714241, -0.10387004024995654, 0.22983864009841198, -0.19095341292621332, -0.16118131540670486, 0.0999279630614006, 0.1174045645154886, 0.05243176567702762, -0.11354645836738941, 0.05295183763045872, -0.0865813909365244, 0.17083142289792377, 0.07395354648419086, -0.008137468833931794, 0.28571506136874625, 0.0517781637043882, 0.023788921450246667, -0.017372108320592567, -0.12402727114145748, -0.0636057348981798, -0.2198779137615223, -0.11830322175129607, -0.1278237043823414, 0.04475978705568637, -0.08538747486355772, -0.10256087812549859, 0.29754689644154125, 0.15218494414607317, 0.25307164230673274, 0.05215097731318397, 0.29102317124234456, 0.09636495071542404, 0.11388649957342688, 0.09871433591537937, 0.35686009537283947, 0.11844103300980138, 0.059916058203738944, -0.2273615236581728, 0.09931139576726919, -0.008164745154202853] |
1,802.05141 | Deep Learning and Data Assimilation for Real-Time Production Prediction
in Natural Gas Wells | The prediction of the gas production from mature gas wells, due to their
complex end-of-life behavior, is challenging and crucial for operational
decision making. In this paper, we apply a modified deep LSTM model for
prediction of the gas flow rates in mature gas wells, including the
uncertainties in input parameters. Additionally, due to changes in the system
in time and in order to increase the accuracy and robustness of the prediction,
the Ensemble Kalman Filter (EnKF) is used to update the flow rate predictions
based on new observations. The developed approach was tested on the data from
two mature gas production wells in which their production is highly dynamic and
suffering from salt deposition. The results show that the flow predictions
using the EnKF updated model leads to better Jeffreys' J-divergences than the
predictions without the EnKF model updating scheme.
| cs.LG cs.AI physics.flu-dyn physics.geo-ph stat.ML | the prediction of the gas production from mature gas wells due to their complex endoflife behavior is challenging and crucial for operational decision making in this paper we apply a modified deep lstm model for prediction of the gas flow rates in mature gas wells including the uncertainties in input parameters additionally due to changes in the system in time and in order to increase the accuracy and robustness of the prediction the ensemble kalman filter enkf is used to update the flow rate predictions based on new observations the developed approach was tested on the data from two mature gas production wells in which their production is highly dynamic and suffering from salt deposition the results show that the flow predictions using the enkf updated model leads to better jeffreys jdivergences than the predictions without the enkf model updating scheme | [['the', 'prediction', 'of', 'the', 'gas', 'production', 'from', 'mature', 'gas', 'wells', 'due', 'to', 'their', 'complex', 'endoflife', 'behavior', 'is', 'challenging', 'and', 'crucial', 'for', 'operational', 'decision', 'making', 'in', 'this', 'paper', 'we', 'apply', 'a', 'modified', 'deep', 'lstm', 'model', 'for', 'prediction', 'of', 'the', 'gas', 'flow', 'rates', 'in', 'mature', 'gas', 'wells', 'including', 'the', 'uncertainties', 'in', 'input', 'parameters', 'additionally', 'due', 'to', 'changes', 'in', 'the', 'system', 'in', 'time', 'and', 'in', 'order', 'to', 'increase', 'the', 'accuracy', 'and', 'robustness', 'of', 'the', 'prediction', 'the', 'ensemble', 'kalman', 'filter', 'enkf', 'is', 'used', 'to', 'update', 'the', 'flow', 'rate', 'predictions', 'based', 'on', 'new', 'observations', 'the', 'developed', 'approach', 'was', 'tested', 'on', 'the', 'data', 'from', 'two', 'mature', 'gas', 'production', 'wells', 'in', 'which', 'their', 'production', 'is', 'highly', 'dynamic', 'and', 'suffering', 'from', 'salt', 'deposition', 'the', 'results', 'show', 'that', 'the', 'flow', 'predictions', 'using', 'the', 'enkf', 'updated', 'model', 'leads', 'to', 'better', 'jeffreys', 'jdivergences', 'than', 'the', 'predictions', 'without', 'the', 'enkf', 'model', 'updating', 'scheme']] | [-0.00764219267668003, 0.05223403562725123, -0.09864168308642028, 0.07449679572767179, -0.0139635181187519, -0.15500185214581766, 0.04736022088410599, 0.3815944618811565, -0.25336890088926467, -0.3231586919066363, 0.1141695916228595, -0.27284370581619444, -0.09825641128700227, 0.19842451760778204, -0.08874738293566874, 0.10745033335738949, 0.11067037757186751, 0.0034140465265539077, -0.04628382595754894, -0.26720229685556013, 0.26286788848228754, 0.13450859669142767, 0.31618370431076204, 0.020823497042459036, 0.09600298247782381, -0.01272979231518028, -0.04690747545142326, -0.028824957301964917, -0.11311333847890118, 0.12275665036000387, 0.2049274274829908, 0.09091900904396814, 0.2637411330427442, -0.4338654016809804, -0.2292163674270601, 0.08035143964391733, 0.1382540815360179, 0.1274361590580416, -0.04216786137299745, -0.2843541360476853, 0.01582889294285061, -0.20627342933522805, -0.08823380818191384, -0.06646579423520182, -0.03106280168784516, 0.0025729194932085065, -0.3124188032304768, 0.11295989969845063, 0.008361577536977296, 0.008099884924013168, -0.07856060473547716, -0.10687128152016417, -0.0238725006912968, 0.11460900717481438, 0.051363563962513584, 0.028257736686750183, 0.19428936545737088, -0.16317866373241746, -0.08270924107969872, 0.394704659585841, -0.11271603527514214, -0.16569090043527207, 0.2133443150286829, -0.1171083642036787, -0.10114852185361087, 0.16007659513769404, 0.23232925008051097, 0.06318721765585776, -0.16596926050260663, 5.7538587134331466e-05, 0.02653354463566627, 0.16593939997541643, 0.008479262648948601, -0.009399534592271915, 0.18627717545854727, 0.23995603785983155, 0.0016881924255618026, 0.11030344023934699, -0.14016441989889636, -0.15064582443530006, -0.2058077946762621, -0.13465154296053308, -0.1346827676619536, -0.02634000377729535, -0.08536524293802879, -0.1325560030793505, 0.3679781078952146, 0.261119470765282, 0.19689432074249322, 0.054722177896681906, 0.34519674626312086, 0.09417285978228652, 0.09346100936776826, 0.07719835641993476, 0.2478234496632857, 0.12226535274780222, 0.13444621392326164, -0.2268624203595599, 0.12469622004677408, 0.020276874581551446] |
1,802.05142 | Morphologic for knowledge dynamics: revision, fusion, abduction | Several tasks in artificial intelligence require to be able to find models
about knowledge dynamics. They include belief revision, fusion and belief
merging, and abduction. In this paper we exploit the algebraic framework of
mathematical morphology in the context of propositional logic, and define
operations such as dilation or erosion of a set of formulas. We derive concrete
operators, based on a semantic approach, that have an intuitive interpretation
and that are formally well behaved, to perform revision, fusion and abduction.
Computation and tractability are addressed, and simple examples illustrate the
typical results that can be obtained.
| cs.AI | several tasks in artificial intelligence require to be able to find models about knowledge dynamics they include belief revision fusion and belief merging and abduction in this paper we exploit the algebraic framework of mathematical morphology in the context of propositional logic and define operations such as dilation or erosion of a set of formulas we derive concrete operators based on a semantic approach that have an intuitive interpretation and that are formally well behaved to perform revision fusion and abduction computation and tractability are addressed and simple examples illustrate the typical results that can be obtained | [['several', 'tasks', 'in', 'artificial', 'intelligence', 'require', 'to', 'be', 'able', 'to', 'find', 'models', 'about', 'knowledge', 'dynamics', 'they', 'include', 'belief', 'revision', 'fusion', 'and', 'belief', 'merging', 'and', 'abduction', 'in', 'this', 'paper', 'we', 'exploit', 'the', 'algebraic', 'framework', 'of', 'mathematical', 'morphology', 'in', 'the', 'context', 'of', 'propositional', 'logic', 'and', 'define', 'operations', 'such', 'as', 'dilation', 'or', 'erosion', 'of', 'a', 'set', 'of', 'formulas', 'we', 'derive', 'concrete', 'operators', 'based', 'on', 'a', 'semantic', 'approach', 'that', 'have', 'an', 'intuitive', 'interpretation', 'and', 'that', 'are', 'formally', 'well', 'behaved', 'to', 'perform', 'revision', 'fusion', 'and', 'abduction', 'computation', 'and', 'tractability', 'are', 'addressed', 'and', 'simple', 'examples', 'illustrate', 'the', 'typical', 'results', 'that', 'can', 'be', 'obtained']] | [-0.03492922969546515, 0.02810681846665492, -0.10646479617151403, 0.13379529817389882, -0.15908717815572224, -0.11058491563482076, 0.0551010869196184, 0.4316375696186706, -0.275340248523376, -0.33829607440101117, 0.09692392044475052, -0.20375441416579576, -0.20991688005904638, 0.19299141133981804, -0.13333694006393773, 0.05582173354923725, 0.08266212433437366, 0.06719253983194988, -0.0740949740614166, -0.22983065154403448, 0.32037357190268634, 0.013428880679469133, 0.23439291725415237, 0.06427053606963341, 0.07976843245788333, 0.0036407657418899317, -0.04500137297100551, 0.03267942098228587, -0.09680964907062103, 0.15719038049796039, 0.31371771981244334, 0.26573427195766386, 0.27647213368993445, -0.4937247103944267, -0.20973257594693875, 0.057464543691615466, 0.12754407574989132, 0.09886573027512155, -0.008805277326489924, -0.2893197443912324, 0.06355369603501383, -0.2160359069551389, -0.06908872501310154, -0.18916910079298252, 0.0018408886377805286, 0.007565153746496041, -0.25190688296192393, -0.016597022864122672, 0.1650894286564657, 0.09858770627221189, -0.0462566121846207, -0.09537071855042667, 0.03722019453254557, 0.09030314450651485, -0.017224153017711623, -0.011866626137694748, 0.1522662864191477, -0.1098906663414475, -0.21679056904365107, 0.38079526781863005, -0.00095138393016052, -0.21761430840286397, 0.20816229946536885, -0.04729188422278799, -0.1782881224710379, 0.043713472687552886, 0.1864289838494253, 0.1104855887668649, -0.16081167714305453, 0.0555461173854317, -0.041894008496718614, 0.13987492164116852, 0.08408827352884811, 0.053410790884656084, 0.19112528336340004, 0.17686502923516884, 0.011542663523044014, 0.11091375683035855, -0.0035600860761574554, -0.14316524626187904, -0.3175649646208766, -0.13852273901809276, -0.09981428827015087, -0.007254102310530611, -0.04608895914696911, -0.16998526075682074, 0.3398945268013121, 0.23626871206845665, 0.20312062602912642, 0.1232988334587324, 0.29044203261230334, 0.1145865981031711, 0.07961697275414295, 0.0682924177579236, 0.19547623437085218, 0.12332985247725371, 0.08241503832612149, -0.13772621346618405, 0.10686646889626365, 0.06774690172145355] |
1,802.05143 | On completeness and parametricity in the realizability semantics of
System F | We investigate completeness and parametricity for a general class of
realizability semantics for System F defined in terms of closure operators over
sets of $\lambda$-terms. This class includes most semantics used for
normalization theorems, as those arising from Tait's saturated sets and
Girard's reducibility candidates.
We establish a completeness result for positive types which subsumes those
existing in the literature, and we show that closed realizers satisfy
parametricity conditions expressed either as invariance with respect to logical
relations or as dinaturality. Our results imply that, for positive types,
typability, realizability and parametricity are equivalent properties of closed
normal $\lambda$-terms.
| cs.LO math.LO | we investigate completeness and parametricity for a general class of realizability semantics for system f defined in terms of closure operators over sets of lambdaterms this class includes most semantics used for normalization theorems as those arising from taits saturated sets and girards reducibility candidates we establish a completeness result for positive types which subsumes those existing in the literature and we show that closed realizers satisfy parametricity conditions expressed either as invariance with respect to logical relations or as dinaturality our results imply that for positive types typability realizability and parametricity are equivalent properties of closed normal lambdaterms | [['we', 'investigate', 'completeness', 'and', 'parametricity', 'for', 'a', 'general', 'class', 'of', 'realizability', 'semantics', 'for', 'system', 'f', 'defined', 'in', 'terms', 'of', 'closure', 'operators', 'over', 'sets', 'of', 'lambdaterms', 'this', 'class', 'includes', 'most', 'semantics', 'used', 'for', 'normalization', 'theorems', 'as', 'those', 'arising', 'from', 'taits', 'saturated', 'sets', 'and', 'girards', 'reducibility', 'candidates', 'we', 'establish', 'a', 'completeness', 'result', 'for', 'positive', 'types', 'which', 'subsumes', 'those', 'existing', 'in', 'the', 'literature', 'and', 'we', 'show', 'that', 'closed', 'realizers', 'satisfy', 'parametricity', 'conditions', 'expressed', 'either', 'as', 'invariance', 'with', 'respect', 'to', 'logical', 'relations', 'or', 'as', 'dinaturality', 'our', 'results', 'imply', 'that', 'for', 'positive', 'types', 'typability', 'realizability', 'and', 'parametricity', 'are', 'equivalent', 'properties', 'of', 'closed', 'normal', 'lambdaterms']] | [-0.11160689082985022, 0.013447416627931655, -0.027479275718939548, 0.15597688007923982, -0.10520729213734442, -0.130181733718408, 0.04203998046566029, 0.31478913014336507, -0.29491382975687214, -0.268868421863085, 0.0709403407432101, -0.23861069485012973, -0.09294169675722143, 0.2465754611541194, -0.14023076495801917, 0.046056379456006526, 0.03948692738762177, 0.05510761232676022, -0.10164127297558684, -0.23423750903837534, 0.3992696484284742, -0.0950323073003365, 0.25451926230357924, 0.0008887386814291988, 0.09403891844332826, 0.026397624943994592, -0.01659549939047013, 0.11425451744271785, -0.1582827882002861, 0.1124033584278457, 0.3062789929004348, 0.23163894806247282, 0.21328198487612915, -0.3791238051668114, -0.1365961405657688, 0.11398098401117082, 0.06444987866134212, 0.03489468643342012, 0.02770866212739172, -0.2938449067272702, 0.13381551925511082, -0.17196763638164658, -0.10631628282254144, -0.1402568435581515, 0.04462691318547847, 0.06765988182126291, -0.2761615069668588, 0.02700941454220031, 0.21822136593982577, 0.13996427701976227, -0.10981259371714705, -0.11943470033560405, -0.012472580121687556, 0.07943545826663244, -0.016401206532835354, -0.020114497877942512, 0.06705627016983308, -0.08963029155251095, -0.15153636736795306, 0.3744422716221639, -0.07919975110491244, -0.22579166813924603, 0.22408840588617082, -0.05543824700562625, -0.2057492063257235, 0.042697665177057594, 0.06574036582487122, 0.1233026445178049, -0.11654700506098416, 0.13512574804100988, -0.10068672416465622, 0.12131323252937623, 0.1542771801647103, 0.14732707738318024, 0.1527972669811083, 0.08074117308881666, 0.04736898496404898, 0.1816294922146528, 0.08878053816472542, -0.09252448813343535, -0.4010754603208328, -0.15553959327920966, -0.025946755876897702, 0.029489167205685257, -0.06988378914907023, -0.2252110027736623, 0.3242680071948134, 0.12506377847142974, 0.12543015942281607, 0.21427463496944923, 0.21205622866293605, 0.12640827658766768, 0.08776296542159148, 0.0537111778691297, 0.13697498909444833, 0.17899254586889732, 0.028850490473239322, -0.11809134236014239, 0.10774735941988778, 0.1599763448787283] |
1,802.05144 | Maximum Total Correntropy Diffusion Adaptation over Networks with Noisy
Links | Distributed estimation over networks draws much attraction in recent years.
In many situations, due to imperfect information communication among nodes, the
performance of traditional diffusion adaptive algorithms such as the diffusion
LMS (DLMS) may degrade. To deal with this problem, several modified DLMS
algorithms have been proposed. However, these DLMS based algorithms still
suffer from biased estimation and are not robust to impulsive link noise. In
this paper, we focus on improving the performance of diffusion adaptation with
noisy links from two aspects: accuracy and robustness. A new algorithm called
diffusion maximum total correntropy (DMTC) is proposed. The new algorithm is
theoretically unbiased in Gaussian noise, and can efficiently handle the link
noises in the presence of large outliers. The adaptive combination rule is
applied to further improve the performance. The stability analysis of the
proposed algorithm is given. Simulation results show that the DMTC algorithm
can achieve good performance in both Gaussian and non-Gaussian noise
environments.
| cs.IT eess.SP math.IT | distributed estimation over networks draws much attraction in recent years in many situations due to imperfect information communication among nodes the performance of traditional diffusion adaptive algorithms such as the diffusion lms dlms may degrade to deal with this problem several modified dlms algorithms have been proposed however these dlms based algorithms still suffer from biased estimation and are not robust to impulsive link noise in this paper we focus on improving the performance of diffusion adaptation with noisy links from two aspects accuracy and robustness a new algorithm called diffusion maximum total correntropy dmtc is proposed the new algorithm is theoretically unbiased in gaussian noise and can efficiently handle the link noises in the presence of large outliers the adaptive combination rule is applied to further improve the performance the stability analysis of the proposed algorithm is given simulation results show that the dmtc algorithm can achieve good performance in both gaussian and nongaussian noise environments | [['distributed', 'estimation', 'over', 'networks', 'draws', 'much', 'attraction', 'in', 'recent', 'years', 'in', 'many', 'situations', 'due', 'to', 'imperfect', 'information', 'communication', 'among', 'nodes', 'the', 'performance', 'of', 'traditional', 'diffusion', 'adaptive', 'algorithms', 'such', 'as', 'the', 'diffusion', 'lms', 'dlms', 'may', 'degrade', 'to', 'deal', 'with', 'this', 'problem', 'several', 'modified', 'dlms', 'algorithms', 'have', 'been', 'proposed', 'however', 'these', 'dlms', 'based', 'algorithms', 'still', 'suffer', 'from', 'biased', 'estimation', 'and', 'are', 'not', 'robust', 'to', 'impulsive', 'link', 'noise', 'in', 'this', 'paper', 'we', 'focus', 'on', 'improving', 'the', 'performance', 'of', 'diffusion', 'adaptation', 'with', 'noisy', 'links', 'from', 'two', 'aspects', 'accuracy', 'and', 'robustness', 'a', 'new', 'algorithm', 'called', 'diffusion', 'maximum', 'total', 'correntropy', 'dmtc', 'is', 'proposed', 'the', 'new', 'algorithm', 'is', 'theoretically', 'unbiased', 'in', 'gaussian', 'noise', 'and', 'can', 'efficiently', 'handle', 'the', 'link', 'noises', 'in', 'the', 'presence', 'of', 'large', 'outliers', 'the', 'adaptive', 'combination', 'rule', 'is', 'applied', 'to', 'further', 'improve', 'the', 'performance', 'the', 'stability', 'analysis', 'of', 'the', 'proposed', 'algorithm', 'is', 'given', 'simulation', 'results', 'show', 'that', 'the', 'dmtc', 'algorithm', 'can', 'achieve', 'good', 'performance', 'in', 'both', 'gaussian', 'and', 'nongaussian', 'noise', 'environments']] | [-0.0950708296598576, 0.002740274376241834, -0.0728992034909523, 0.06740756402575192, -0.07632745495125366, -0.19044876987245052, 0.030038959294065217, 0.4347212055555669, -0.2783391814987371, -0.3247830663825486, 0.12411346094190458, -0.23088462361591353, -0.23341600918196212, 0.20412322503342561, -0.19117092422452892, 0.11617294845473804, 0.11697836607623442, 0.007190435798542135, -0.04320751704982998, -0.32123229252530416, 0.24592662535705692, 0.10272223130758305, 0.35016554233968067, 0.0009573732330730767, 0.09500017585114214, -0.01826128496041011, -0.06778277483750965, 0.056563944383791295, -0.06819007786868213, 0.09672051810052922, 0.2574115843559574, 0.13636631762555498, 0.33917800475884774, -0.3792053631263649, -0.2682621603546913, 0.15650533546640236, 0.17587198747639324, 0.11000756441562135, -0.050518214593605865, -0.3044895211021137, 0.08960087225434317, -0.1521459864511801, -0.01045111047139593, -0.10768875700590694, -0.07641819402854297, 0.06131632570518406, -0.3158038446863603, 0.09994204342958464, 0.06069762065449053, 0.012890142201784121, 0.00646833520216547, -0.16148655693444192, 0.08358659618979047, 0.1251388401813378, 0.03506747660505923, -0.006136219142520931, 0.11762188160258114, -0.12705801072631293, -0.15972016823543295, 0.32297244656142915, -0.06447614945773818, -0.25782000460323823, 0.21325069052689252, -0.04306838309220305, -0.14129470116725773, 0.18329970448894817, 0.25122698824734063, 0.06986160026744577, -0.1649202371526296, 0.04530076873429404, 0.017663763663998456, 0.14270575110842088, 0.028683155772104195, 0.06048786839658237, 0.10534322607497074, 0.2066657790220135, 0.11408702743048395, 0.1279752757791415, -0.12748572578843517, -0.12556401049943677, -0.16538792386484943, -0.09433198698268384, -0.21738974453145815, -0.03235240858469001, -0.10952470604008491, -0.1490857793006358, 0.3639638200876819, 0.252154920161939, 0.16748462986663742, 0.08176772636924959, 0.38263026252388954, 0.0813988487689999, 0.02071881163153489, 0.132547280574692, 0.23288083800476542, 0.11853735080095613, 0.10568025286953042, -0.2252766953182116, 0.1331830539223056, -0.005176230769746813] |
1,802.05145 | Sub-logarithmic Distributed Oblivious RAM with Small Block Size | Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to
securely execute RAM programs over data that is stored in an untrusted server.
Distributed Oblivious RAM is a variant of ORAM, where the data is stored in
$m>1$ servers. Extensive research over the last few decades have succeeded to
reduce the bandwidth overhead of ORAM schemes, both in the single-server and
the multi-server setting, from $O(\sqrt{N})$ to $O(1)$. However, all known
protocols that achieve a sub-logarithmic overhead either require heavy
server-side computation (e.g. homomorphic encryption), or a large block size of
at least $\Omega(\log^3 N)$.
In this paper, we present a family of distributed ORAM constructions that
follow the hierarchical approach of Goldreich and Ostrovsky [GO96]. We enhance
known techniques, and develop new ones, to take better advantage of the
existence of multiple servers. By plugging efficient known hashing schemes in
our constructions, we get the following results:
1. For any $m\geq 2$, we show an $m$-server ORAM scheme with $O(\log
N/\log\log N)$ overhead, and block size $\Omega(\log^2 N)$. This scheme is
private even against an $(m-1)$-server collusion. 2. A 3-server ORAM
construction with $O(\omega(1)\log N/\log\log N)$ overhead and a block size
almost logarithmic, i.e. $\Omega(\log^{1+\epsilon}N)$.
We also investigate a model where the servers are allowed to perform a linear
amount of light local computations, and show that constant overhead is
achievable in this model, through a simple four-server ORAM protocol.
| cs.CR | oblivious ram oram is a cryptographic primitive that allows a client to securely execute ram programs over data that is stored in an untrusted server distributed oblivious ram is a variant of oram where the data is stored in m1 servers extensive research over the last few decades have succeeded to reduce the bandwidth overhead of oram schemes both in the singleserver and the multiserver setting from osqrtn to o1 however all known protocols that achieve a sublogarithmic overhead either require heavy serverside computation eg homomorphic encryption or a large block size of at least omegalog3 n in this paper we present a family of distributed oram constructions that follow the hierarchical approach of goldreich and ostrovsky go96 we enhance known techniques and develop new ones to take better advantage of the existence of multiple servers by plugging efficient known hashing schemes in our constructions we get the following results 1 for any mgeq 2 we show an mserver oram scheme with olog nloglog n overhead and block size omegalog2 n this scheme is private even against an m1server collusion 2 a 3server oram construction with oomega1log nloglog n overhead and a block size almost logarithmic ie omegalog1epsilonn we also investigate a model where the servers are allowed to perform a linear amount of light local computations and show that constant overhead is achievable in this model through a simple fourserver oram protocol | [['oblivious', 'ram', 'oram', 'is', 'a', 'cryptographic', 'primitive', 'that', 'allows', 'a', 'client', 'to', 'securely', 'execute', 'ram', 'programs', 'over', 'data', 'that', 'is', 'stored', 'in', 'an', 'untrusted', 'server', 'distributed', 'oblivious', 'ram', 'is', 'a', 'variant', 'of', 'oram', 'where', 'the', 'data', 'is', 'stored', 'in', 'm1', 'servers', 'extensive', 'research', 'over', 'the', 'last', 'few', 'decades', 'have', 'succeeded', 'to', 'reduce', 'the', 'bandwidth', 'overhead', 'of', 'oram', 'schemes', 'both', 'in', 'the', 'singleserver', 'and', 'the', 'multiserver', 'setting', 'from', 'osqrtn', 'to', 'o1', 'however', 'all', 'known', 'protocols', 'that', 'achieve', 'a', 'sublogarithmic', 'overhead', 'either', 'require', 'heavy', 'serverside', 'computation', 'eg', 'homomorphic', 'encryption', 'or', 'a', 'large', 'block', 'size', 'of', 'at', 'least', 'omegalog3', 'n', 'in', 'this', 'paper', 'we', 'present', 'a', 'family', 'of', 'distributed', 'oram', 'constructions', 'that', 'follow', 'the', 'hierarchical', 'approach', 'of', 'goldreich', 'and', 'ostrovsky', 'go96', 'we', 'enhance', 'known', 'techniques', 'and', 'develop', 'new', 'ones', 'to', 'take', 'better', 'advantage', 'of', 'the', 'existence', 'of', 'multiple', 'servers', 'by', 'plugging', 'efficient', 'known', 'hashing', 'schemes', 'in', 'our', 'constructions', 'we', 'get', 'the', 'following', 'results', '1', 'for', 'any', 'mgeq', '2', 'we', 'show', 'an', 'mserver', 'oram', 'scheme', 'with', 'olog', 'nloglog', 'n', 'overhead', 'and', 'block', 'size', 'omegalog2', 'n', 'this', 'scheme', 'is', 'private', 'even', 'against', 'an', 'm1server', 'collusion', '2', 'a', '3server', 'oram', 'construction', 'with', 'oomega1log', 'nloglog', 'n', 'overhead', 'and', 'a', 'block', 'size', 'almost', 'logarithmic', 'ie', 'omegalog1epsilonn', 'we', 'also', 'investigate', 'a', 'model', 'where', 'the', 'servers', 'are', 'allowed', 'to', 'perform', 'a', 'linear', 'amount', 'of', 'light', 'local', 'computations', 'and', 'show', 'that', 'constant', 'overhead', 'is', 'achievable', 'in', 'this', 'model', 'through', 'a', 'simple', 'fourserver', 'oram', 'protocol']] | [-0.22801274194101911, 0.04503373462114168, -0.058039868147466825, 0.01779279667643039, -0.04401387080686183, -0.26627711826251343, 0.13855463119475603, 0.3835866334806897, -0.2829861376698302, -0.3215502476303187, 0.11281545437044109, -0.23945593606147234, -0.0909362811712647, 0.17688651609057313, -0.13517620053234514, 0.08562963027548276, 0.03801265585574165, 0.007925746701266287, -0.014552436278621971, -0.3868903212261642, 0.24655388728138553, 0.07463425285475477, 0.24554071650403528, -0.010001908823954913, 0.07398889498863435, 0.0006044805441381393, -0.03238231720880861, -0.06681300273404119, -0.0912832482386006, 0.0952773433522758, 0.26184507445700106, 0.17329923179725895, 0.2965985714623795, -0.45472546450719564, -0.1636679561156316, 0.11313084886250688, 0.18755359549107045, 0.1488388036377728, -0.05882716179537933, -0.18807726813401962, 0.16415605376076892, -0.25412740625556457, -0.04773518656776081, -0.055146960028554355, 0.012369398072988322, -0.031285134493373334, -0.3155953444054235, -0.021226198611439998, 0.08088815513487278, 0.003348818143615417, 0.03568475140208189, -0.08928929383256597, 0.0805212514613038, 0.10509624909707427, -0.03507471010885413, 0.041389395105261025, 0.10501958936580613, -0.0668390623192855, -0.18096681284631677, 0.36245031404361516, -0.015075997317588963, -0.16315538432568608, 0.11851696134544909, -0.03095813890902606, -0.17447965431740028, 0.12834017067958098, 0.18640363833813442, 0.11292496294430168, -0.08025577836628772, 0.1216751447718063, -0.10010304567774972, 0.26701467494228937, 0.08616784655806337, 0.08852453141234222, 0.03766354758795186, 0.14810487906967776, 0.1136482880137597, 0.14792431293125471, -0.02729743503784118, -0.11305944115516886, -0.23863103318381518, -0.18904831057810534, -0.20799944088825198, 0.02856195331097836, -0.1395808535148194, -0.1234369654444343, 0.29012445440068113, 0.16906964355684093, 0.19235649009531908, 0.16990310262344713, 0.42468678310876135, -0.00568616581180306, 0.13305591072668774, 0.26006064789196626, 0.10749023468223343, 0.02604018577242649, 0.09648778592957497, -0.15576918926208477, 0.1166436964917961, 0.04761047574868673] |
1,802.05146 | Channel Reconstruction-Based Hybrid Precoding for Millimeter Wave
Multi-User MIMO Systems | The focus of this paper is on multi-user MIMO transmissions for millimeter
wave systems with a hybrid precoding architecture at the base-station. To
enable multi-user transmissions, the base-station uses a cell-specific codebook
of beamforming vectors over an initial beam alignment phase. Each user uses a
user-specific codebook of beamforming vectors to learn the top-P (where P >= 1)
beam pairs in terms of the observed SNR in a single-user setting. The top-P
beam indices along with their SNRs are fed back from each user and the
base-station leverages this information to generate beam weights for
simultaneous transmissions. A typical method to generate the beam weights is to
use only the best beam for each user and either steer energy along this beam,
or to utilize this information to reduce multi-user interference. The other
beams are used as fall back options to address blockage or mobility. Such an
approach completely discards information learned about the channel condition(s)
even though each user feeds back this information. With this background, this
work develops an advanced directional precoding structure for simultaneous
transmissions at the cost of an additional marginal feedback overhead. This
construction relies on three main innovations: 1) Additional feedback to allow
the base-station to reconstruct a rank-P approximation of the channel matrix
between it and each user, 2) A zeroforcing structure that leverages this
information to combat multi-user interference by remaining agnostic of the
receiver beam knowledge in the precoder design, and 3) A hybrid precoding
architecture that allows both amplitude and phase control at low-complexity and
cost to allow the implementation of the zeroforcing structure. Numerical
studies show that the proposed scheme results in a significant sum rate
performance improvement over naive schemes even with a coarse initial beam
alignment codebook.
| cs.IT math.IT | the focus of this paper is on multiuser mimo transmissions for millimeter wave systems with a hybrid precoding architecture at the basestation to enable multiuser transmissions the basestation uses a cellspecific codebook of beamforming vectors over an initial beam alignment phase each user uses a userspecific codebook of beamforming vectors to learn the topp where p 1 beam pairs in terms of the observed snr in a singleuser setting the topp beam indices along with their snrs are fed back from each user and the basestation leverages this information to generate beam weights for simultaneous transmissions a typical method to generate the beam weights is to use only the best beam for each user and either steer energy along this beam or to utilize this information to reduce multiuser interference the other beams are used as fall back options to address blockage or mobility such an approach completely discards information learned about the channel conditions even though each user feeds back this information with this background this work develops an advanced directional precoding structure for simultaneous transmissions at the cost of an additional marginal feedback overhead this construction relies on three main innovations 1 additional feedback to allow the basestation to reconstruct a rankp approximation of the channel matrix between it and each user 2 a zeroforcing structure that leverages this information to combat multiuser interference by remaining agnostic of the receiver beam knowledge in the precoder design and 3 a hybrid precoding architecture that allows both amplitude and phase control at lowcomplexity and cost to allow the implementation of the zeroforcing structure numerical studies show that the proposed scheme results in a significant sum rate performance improvement over naive schemes even with a coarse initial beam alignment codebook | [['the', 'focus', 'of', 'this', 'paper', 'is', 'on', 'multiuser', 'mimo', 'transmissions', 'for', 'millimeter', 'wave', 'systems', 'with', 'a', 'hybrid', 'precoding', 'architecture', 'at', 'the', 'basestation', 'to', 'enable', 'multiuser', 'transmissions', 'the', 'basestation', 'uses', 'a', 'cellspecific', 'codebook', 'of', 'beamforming', 'vectors', 'over', 'an', 'initial', 'beam', 'alignment', 'phase', 'each', 'user', 'uses', 'a', 'userspecific', 'codebook', 'of', 'beamforming', 'vectors', 'to', 'learn', 'the', 'topp', 'where', 'p', '1', 'beam', 'pairs', 'in', 'terms', 'of', 'the', 'observed', 'snr', 'in', 'a', 'singleuser', 'setting', 'the', 'topp', 'beam', 'indices', 'along', 'with', 'their', 'snrs', 'are', 'fed', 'back', 'from', 'each', 'user', 'and', 'the', 'basestation', 'leverages', 'this', 'information', 'to', 'generate', 'beam', 'weights', 'for', 'simultaneous', 'transmissions', 'a', 'typical', 'method', 'to', 'generate', 'the', 'beam', 'weights', 'is', 'to', 'use', 'only', 'the', 'best', 'beam', 'for', 'each', 'user', 'and', 'either', 'steer', 'energy', 'along', 'this', 'beam', 'or', 'to', 'utilize', 'this', 'information', 'to', 'reduce', 'multiuser', 'interference', 'the', 'other', 'beams', 'are', 'used', 'as', 'fall', 'back', 'options', 'to', 'address', 'blockage', 'or', 'mobility', 'such', 'an', 'approach', 'completely', 'discards', 'information', 'learned', 'about', 'the', 'channel', 'conditions', 'even', 'though', 'each', 'user', 'feeds', 'back', 'this', 'information', 'with', 'this', 'background', 'this', 'work', 'develops', 'an', 'advanced', 'directional', 'precoding', 'structure', 'for', 'simultaneous', 'transmissions', 'at', 'the', 'cost', 'of', 'an', 'additional', 'marginal', 'feedback', 'overhead', 'this', 'construction', 'relies', 'on', 'three', 'main', 'innovations', '1', 'additional', 'feedback', 'to', 'allow', 'the', 'basestation', 'to', 'reconstruct', 'a', 'rankp', 'approximation', 'of', 'the', 'channel', 'matrix', 'between', 'it', 'and', 'each', 'user', '2', 'a', 'zeroforcing', 'structure', 'that', 'leverages', 'this', 'information', 'to', 'combat', 'multiuser', 'interference', 'by', 'remaining', 'agnostic', 'of', 'the', 'receiver', 'beam', 'knowledge', 'in', 'the', 'precoder', 'design', 'and', '3', 'a', 'hybrid', 'precoding', 'architecture', 'that', 'allows', 'both', 'amplitude', 'and', 'phase', 'control', 'at', 'lowcomplexity', 'and', 'cost', 'to', 'allow', 'the', 'implementation', 'of', 'the', 'zeroforcing', 'structure', 'numerical', 'studies', 'show', 'that', 'the', 'proposed', 'scheme', 'results', 'in', 'a', 'significant', 'sum', 'rate', 'performance', 'improvement', 'over', 'naive', 'schemes', 'even', 'with', 'a', 'coarse', 'initial', 'beam', 'alignment', 'codebook']] | [-0.20681585549702383, 0.014753147163935922, -0.04790997002789409, 0.0051320943073852945, -0.11660956589192487, -0.2529878923093423, 0.09094715594099738, 0.41733777787291465, -0.28210883756300315, -0.26180045178504885, 0.06082712444331768, -0.25375923445911724, -0.14383505181986259, 0.09644150386856881, -0.09991837437925248, 0.04404929497548966, 0.07242729813569454, 0.026394849406252373, -0.07320887495797437, -0.2506741771263402, 0.306086974562497, 0.14735785328418943, 0.3523075555992606, -0.034283547911947675, 0.14739630535179685, 0.047643717074650746, -0.025622519443720373, -0.09445092094108257, -0.06756749340277354, 0.08582062167067171, 0.32583528808011936, 0.21249605497701018, 0.28980169280522394, -0.40871208370904916, -0.23181853040472353, 0.06335936094207043, 0.16787201103232285, 0.11112679677345116, -0.05404208692444881, -0.2660581481523786, 0.12124090768504811, -0.20269064639073034, -0.024343479417464262, 0.030439036120064426, -0.13286475027721234, 0.04161971464242223, -0.38926843956421425, -0.02208573004282418, 0.012753657835324627, 0.010859671962418462, -0.018793476823029336, -0.14291937438977373, 0.03763032377662079, 0.13940329604482465, 0.021634618332770663, 0.03303604982398566, 0.10483632244453298, -0.09437933970914644, -0.1136692861452776, 0.3545639022031096, 0.0312189802738506, -0.25589858345078326, 0.13894794627929036, -0.10918530913965718, -0.07500418619926258, 0.20776491319908919, 0.2786411157983217, 0.03540934452780597, -0.15925886797550323, -0.0189737624752216, -0.00015907183004129085, 0.2164562689253229, 0.10878825770363947, 0.10732108642021677, 0.16880103669155092, 0.17721674293537454, 0.16137868700271865, 0.12388268154062923, -0.13666654701882838, -0.06166611100824157, -0.23010326499944378, -0.12390377167316241, -0.20696356184587245, -0.004293892894975058, -0.0946466401409701, -0.06763286660506937, 0.3780471631791921, 0.1564597535026856, 0.15038184307605854, 0.10681116777378744, 0.43735278344626144, 0.06742449897497725, 0.07833263844615783, 0.1200979769247613, 0.17180588478657535, 0.10424778749924604, 0.1519059401209334, -0.22345725694029983, 0.04162489425448965, -0.015768823244489704] |
1,802.05147 | Some central limit theorems for random walks associated with
hypergeometric functions of type BC | The spherical functions of the noncompact Grassmann manifolds over the real
or complex numbers or the quaternions with rank q and dimension parameter p can
be seen as Heckman-Opdam hypergeometric functions of type BC, when the double
coset space is identified with some Weyl chamber of type B. The associated
double coset hypergroups may be embedded into a continuous family of
commutative hypergroups with these hypergeometric functions as multiplicative
functions with p in some continuous parameter range by a result of R\"osler.
Several limit theorems for random walks associated with these hypergroups were
recently derived by the second author. We here present further limit theorems
in particular for the case where the time parameter as well as p tend to
infinity. For integers p, these results admit interpretations for
group-invariant random walks on the Grassmann manifolds.
| math.PR math.CA math.RT | the spherical functions of the noncompact grassmann manifolds over the real or complex numbers or the quaternions with rank q and dimension parameter p can be seen as heckmanopdam hypergeometric functions of type bc when the double coset space is identified with some weyl chamber of type b the associated double coset hypergroups may be embedded into a continuous family of commutative hypergroups with these hypergeometric functions as multiplicative functions with p in some continuous parameter range by a result of rosler several limit theorems for random walks associated with these hypergroups were recently derived by the second author we here present further limit theorems in particular for the case where the time parameter as well as p tend to infinity for integers p these results admit interpretations for groupinvariant random walks on the grassmann manifolds | [['the', 'spherical', 'functions', 'of', 'the', 'noncompact', 'grassmann', 'manifolds', 'over', 'the', 'real', 'or', 'complex', 'numbers', 'or', 'the', 'quaternions', 'with', 'rank', 'q', 'and', 'dimension', 'parameter', 'p', 'can', 'be', 'seen', 'as', 'heckmanopdam', 'hypergeometric', 'functions', 'of', 'type', 'bc', 'when', 'the', 'double', 'coset', 'space', 'is', 'identified', 'with', 'some', 'weyl', 'chamber', 'of', 'type', 'b', 'the', 'associated', 'double', 'coset', 'hypergroups', 'may', 'be', 'embedded', 'into', 'a', 'continuous', 'family', 'of', 'commutative', 'hypergroups', 'with', 'these', 'hypergeometric', 'functions', 'as', 'multiplicative', 'functions', 'with', 'p', 'in', 'some', 'continuous', 'parameter', 'range', 'by', 'a', 'result', 'of', 'rosler', 'several', 'limit', 'theorems', 'for', 'random', 'walks', 'associated', 'with', 'these', 'hypergroups', 'were', 'recently', 'derived', 'by', 'the', 'second', 'author', 'we', 'here', 'present', 'further', 'limit', 'theorems', 'in', 'particular', 'for', 'the', 'case', 'where', 'the', 'time', 'parameter', 'as', 'well', 'as', 'p', 'tend', 'to', 'infinity', 'for', 'integers', 'p', 'these', 'results', 'admit', 'interpretations', 'for', 'groupinvariant', 'random', 'walks', 'on', 'the', 'grassmann', 'manifolds']] | [-0.12537319004973946, 0.15162037979633383, -0.054189618031480626, 0.053385472107466365, -0.09031522014137248, -0.1734788251821609, 0.007221281403497628, 0.34949667900389825, -0.2901747551171438, -0.21736984817749438, 0.12418197227046168, -0.23790096955866935, -0.15196057021453538, 0.2324747208656524, -0.0768042361806318, 0.0662800729247358, 0.0002668163022676976, 0.09748606857508146, -0.11693477998008295, -0.2900134289144155, 0.3927146014611935, -0.04054734117680175, 0.16225917771225795, -0.018589994719471124, 0.05132623939468484, 0.023790295804193354, -0.031726508023840486, -0.0009006954053748975, -0.14224809793728022, 0.048257028132759255, 0.2981221758116804, 0.0602122908920351, 0.22926211217589512, -0.3671967640163048, -0.1980212828527917, 0.19893319705870988, 0.1681762235444587, -0.016688405344372288, 0.002967470745823127, -0.31683689635075796, 0.0665308586184812, -0.17042805092162727, -0.186431811810882, -0.09000412919147707, 0.037509703057688006, 0.09670164161156315, -0.2684723496683599, 0.049908270794035425, 0.09575982204242951, 0.06924646343652378, -0.036662797221010006, -0.19052195543190464, -0.025245822300134665, 0.05784152854111573, 0.03386537847622736, 0.0370717231896432, 0.06480356182916747, -0.058497656129903215, -0.18359222221325205, 0.33900595889623647, -0.01746584167909425, -0.2886926988413667, 0.12510241253253565, -0.1811161385917598, -0.17496839759405702, 0.10488899850957643, 0.14248738793300136, 0.14682104339954094, -0.03898738886057211, 0.17728387095635031, -0.09766791882815168, 0.054807397071272135, 0.12174729244810913, 0.05495394127416041, 0.11875642571061797, 0.02845927857218639, 0.03277637912234401, 0.15207695825066528, -0.03094375925737789, -0.1050233708400115, -0.3635623501630856, -0.16633699923370251, -0.14875405102943393, 0.1357494196820292, -0.16168363076822595, -0.2019399443833048, 0.35892272989183444, -0.02201944037583684, 0.20399142335415543, 0.11649039469878464, 0.17028685149681919, 0.13353433216552196, 0.06749225271093617, 0.004502055598148967, 0.09821255596034462, 0.21363820701748515, 0.04122577811529696, -0.08867448016248733, -0.0171227560049909, 0.17806073401794387] |
1,802.05148 | Stepwise Transmit Antenna Selection in Downlink Massive Multiuser MIMO | Due to the large power consumption in RF-circuitry of massive MIMO systems,
practically relevant performance measures such as energy efficiency or
bandwidth efficiency are neither necessarily monotonous functions of the total
transmit power nor the number of active antennas. Optimal antenna selection is
however computationally infeasible in these systems. In this paper, we propose
an iterative algorithm to optimize the transmit power and the subset of
selected antennas subject to non-monotonous performance measures in massive
multiuser MIMO settings. Numerical results are given for energy efficiency and
demonstrate that for several settings the optimal number of selected antennas
reported by the proposed algorithm is significantly smaller than the total
number of transmit antennas. This fact indicates that antenna selection in
several massive MIMO scenarios not only reduces the hardware complexity and
RF-costs, but also enhances the energy efficiency of the system.
| cs.IT math.IT | due to the large power consumption in rfcircuitry of massive mimo systems practically relevant performance measures such as energy efficiency or bandwidth efficiency are neither necessarily monotonous functions of the total transmit power nor the number of active antennas optimal antenna selection is however computationally infeasible in these systems in this paper we propose an iterative algorithm to optimize the transmit power and the subset of selected antennas subject to nonmonotonous performance measures in massive multiuser mimo settings numerical results are given for energy efficiency and demonstrate that for several settings the optimal number of selected antennas reported by the proposed algorithm is significantly smaller than the total number of transmit antennas this fact indicates that antenna selection in several massive mimo scenarios not only reduces the hardware complexity and rfcosts but also enhances the energy efficiency of the system | [['due', 'to', 'the', 'large', 'power', 'consumption', 'in', 'rfcircuitry', 'of', 'massive', 'mimo', 'systems', 'practically', 'relevant', 'performance', 'measures', 'such', 'as', 'energy', 'efficiency', 'or', 'bandwidth', 'efficiency', 'are', 'neither', 'necessarily', 'monotonous', 'functions', 'of', 'the', 'total', 'transmit', 'power', 'nor', 'the', 'number', 'of', 'active', 'antennas', 'optimal', 'antenna', 'selection', 'is', 'however', 'computationally', 'infeasible', 'in', 'these', 'systems', 'in', 'this', 'paper', 'we', 'propose', 'an', 'iterative', 'algorithm', 'to', 'optimize', 'the', 'transmit', 'power', 'and', 'the', 'subset', 'of', 'selected', 'antennas', 'subject', 'to', 'nonmonotonous', 'performance', 'measures', 'in', 'massive', 'multiuser', 'mimo', 'settings', 'numerical', 'results', 'are', 'given', 'for', 'energy', 'efficiency', 'and', 'demonstrate', 'that', 'for', 'several', 'settings', 'the', 'optimal', 'number', 'of', 'selected', 'antennas', 'reported', 'by', 'the', 'proposed', 'algorithm', 'is', 'significantly', 'smaller', 'than', 'the', 'total', 'number', 'of', 'transmit', 'antennas', 'this', 'fact', 'indicates', 'that', 'antenna', 'selection', 'in', 'several', 'massive', 'mimo', 'scenarios', 'not', 'only', 'reduces', 'the', 'hardware', 'complexity', 'and', 'rfcosts', 'but', 'also', 'enhances', 'the', 'energy', 'efficiency', 'of', 'the', 'system']] | [-0.2357900183819963, 0.04841081562810122, 0.05099015258272867, 0.024186129901099248, -0.06569540591073642, -0.1943328183286054, 0.09126147817553737, 0.38297343513239984, -0.19957048823868018, -0.3543336708503573, 0.05966940698588429, -0.2564330969876407, -0.16247407208783957, 0.213852584238866, -0.11540100084064339, 0.07964574102231342, 0.05508447682444492, 0.03787471884962819, -0.010856225965139658, -0.29179134743247664, 0.26921669800050446, 0.17034206920357395, 0.3692646806222805, 0.009588691591541621, 0.07024042123753199, 0.0010429354269813368, -0.023538713749207935, 0.014144238606736442, -0.048449141328223894, 0.061331334874789784, 0.3361436099461887, 0.22394207387190798, 0.30360223491932603, -0.3937302419132944, -0.22460525311391288, 0.145556692344447, 0.1943782222173784, 0.03326461370022077, -0.06138863620614849, -0.18169009833650637, 0.131571922161063, -0.21772484969983782, -0.0575998703851297, -0.019534303772978594, -0.04447869012685682, 0.08258346750559556, -0.3334856990529089, 0.04658353763807099, 0.00100883474384529, -0.001620617199122258, -0.03175196155359078, -0.1693344541219657, 0.01384480568188904, 0.08354880722354342, 0.07199630943849089, -0.05973245892032603, 0.13534281831032233, -0.11664789605656288, -0.0915765679366972, 0.35345029042007914, 0.06693035288850112, -0.2635905916694606, 0.1979535318897578, -0.1362753033644749, -0.09819096338300817, 0.21661660594163815, 0.2770988274520884, 0.11261571806086146, -0.14006607636026497, 0.04134089445595737, 0.009091896875558989, 0.23884115230116615, 0.06072433041813581, 0.1690891124645545, 0.13598308169984838, 0.18413108372993336, 0.14612657119574, 0.15794209248649524, -0.10483223605927154, -0.08959606138692386, -0.20645991228925792, -0.11730718897466642, -0.27061259765447915, 0.018433240165957588, -0.12954946316787516, -0.0613578493281713, 0.34371980787187384, 0.16529326157414934, 0.11453738202597352, 0.13030579905835507, 0.4061008428182939, 0.13424113415100652, 0.09592627260607897, 0.12758882511812059, 0.23675435309406315, 0.07747933697259135, 0.11049223688525567, -0.2795824058171686, 0.007453710984681611, -0.06107704281348033] |
1,802.05149 | A Convection-Diffusion Model for Gang Territoriality | We present an agent-based model to simulate gang territorial development
motivated by graffiti marking on a two-dimensional discrete lattice. For
simplicity, we assume that there are two rival gangs present, and they compete
for territory. In this model, agents represent gang members and move according
to a biased random walk, adding graffiti with some probability as they move and
preferentially avoiding the other gang's graffiti. All agent interactions are
indirect, with the interactions occurring through the graffiti field. We show
numerically that as parameters vary, a phase transition occurs between a
well-mixed state and a well-segregated state. The numerical results show that
system mass, decay rate and graffiti rate influence the critical parameter.
From the discrete model, we derive a continuum system of convection-diffusion
equations for territorial development. Using the continuum equations, we
perform a linear stability analysis to determine the stability of the
equilibrium solutions and we find that we can determine the precise location of
the phase transition in parameter space as a function of the system mass and
the graffiti creation and decay rates.
| nlin.CG math.DS nlin.AO nlin.PS physics.soc-ph | we present an agentbased model to simulate gang territorial development motivated by graffiti marking on a twodimensional discrete lattice for simplicity we assume that there are two rival gangs present and they compete for territory in this model agents represent gang members and move according to a biased random walk adding graffiti with some probability as they move and preferentially avoiding the other gangs graffiti all agent interactions are indirect with the interactions occurring through the graffiti field we show numerically that as parameters vary a phase transition occurs between a wellmixed state and a wellsegregated state the numerical results show that system mass decay rate and graffiti rate influence the critical parameter from the discrete model we derive a continuum system of convectiondiffusion equations for territorial development using the continuum equations we perform a linear stability analysis to determine the stability of the equilibrium solutions and we find that we can determine the precise location of the phase transition in parameter space as a function of the system mass and the graffiti creation and decay rates | [['we', 'present', 'an', 'agentbased', 'model', 'to', 'simulate', 'gang', 'territorial', 'development', 'motivated', 'by', 'graffiti', 'marking', 'on', 'a', 'twodimensional', 'discrete', 'lattice', 'for', 'simplicity', 'we', 'assume', 'that', 'there', 'are', 'two', 'rival', 'gangs', 'present', 'and', 'they', 'compete', 'for', 'territory', 'in', 'this', 'model', 'agents', 'represent', 'gang', 'members', 'and', 'move', 'according', 'to', 'a', 'biased', 'random', 'walk', 'adding', 'graffiti', 'with', 'some', 'probability', 'as', 'they', 'move', 'and', 'preferentially', 'avoiding', 'the', 'other', 'gangs', 'graffiti', 'all', 'agent', 'interactions', 'are', 'indirect', 'with', 'the', 'interactions', 'occurring', 'through', 'the', 'graffiti', 'field', 'we', 'show', 'numerically', 'that', 'as', 'parameters', 'vary', 'a', 'phase', 'transition', 'occurs', 'between', 'a', 'wellmixed', 'state', 'and', 'a', 'wellsegregated', 'state', 'the', 'numerical', 'results', 'show', 'that', 'system', 'mass', 'decay', 'rate', 'and', 'graffiti', 'rate', 'influence', 'the', 'critical', 'parameter', 'from', 'the', 'discrete', 'model', 'we', 'derive', 'a', 'continuum', 'system', 'of', 'convectiondiffusion', 'equations', 'for', 'territorial', 'development', 'using', 'the', 'continuum', 'equations', 'we', 'perform', 'a', 'linear', 'stability', 'analysis', 'to', 'determine', 'the', 'stability', 'of', 'the', 'equilibrium', 'solutions', 'and', 'we', 'find', 'that', 'we', 'can', 'determine', 'the', 'precise', 'location', 'of', 'the', 'phase', 'transition', 'in', 'parameter', 'space', 'as', 'a', 'function', 'of', 'the', 'system', 'mass', 'and', 'the', 'graffiti', 'creation', 'and', 'decay', 'rates']] | [-0.13216946653450246, 0.1557390518171153, -0.06918512711589839, 0.0640874663453856, -0.06325199267435395, -0.14109754407863048, 0.10890249952949076, 0.37171148553236644, -0.2617102356069319, -0.27911453979322687, 0.10564337591296696, -0.2662516694558276, -0.14572247424009468, 0.13035116403030275, -0.00033443177182396704, 0.011043103221295909, 0.05721406004820231, 0.0178714586667907, -0.00511158905018502, -0.1984291270908381, 0.3086183208929883, 0.016402371262136676, 0.24181535343681884, 0.011207857497290453, 0.08369111651766369, -0.005920199072782204, -0.0033046002155804836, 0.010047265093775919, -0.18463782574905385, 0.05454406825910238, 0.1919507279022086, 0.09864517179614102, 0.2755143328104168, -0.4235056030394679, -0.2128482591942884, 0.13384977502706039, 0.13874120356261052, 0.1288708763683892, -0.06954254497660176, -0.30463435600474686, 0.03813849532426419, -0.1978763165428642, -0.14302150320409882, -0.061558729233431884, -0.006479640491968233, 0.07198903680546209, -0.28742960846284404, 0.08830372948696921, 0.021711935495576738, 0.03502534938955002, -0.09550682174846191, -0.07726305616366021, -0.05382959501267495, 0.17439360670554874, 0.029727764359532474, -0.005887422660386867, 0.14222942472604866, -0.1558793239356336, -0.12129950133914297, 0.3746502234293571, -0.0731206978896146, -0.18607665942876006, 0.22207643318688497, -0.11597316889145243, -0.10682892667748754, 0.10321340276806784, 0.194653962175256, 0.09999967697182331, -0.12660216054328802, 0.031259957227369094, -0.023642637936229057, 0.164191464529722, 0.0081126474277963, -0.005468619741308926, 0.19963898717436346, 0.17913491098443046, 0.07389453393195501, 0.11482625868103985, -0.049602843302471396, -0.177405945943478, -0.2727755347441416, -0.14271400298854464, -0.12552664224230367, 0.023863166466815692, -0.0643014926417064, -0.15856787066546862, 0.35857574696472677, 0.1729538145565047, 0.21958160392453216, 0.07781277973183685, 0.2310022830973718, 0.11521373836612012, 0.019490646198391914, 0.07255961695707148, 0.2523483287323787, 0.07250376743402077, 0.08237620576454158, -0.23096275265561417, 0.09867846121778712, 0.07032805854131849] |
1,802.0515 | Study of the feasibility of a compact gamma camera for real-time cancer
assessment | Results from the simulations of a Compton gamma camera based on compact
configuration of detectors consisting in two detection modules, each of them
having two stages of high-resolution position- and energy-sensitive radiation
detectors operated in time-coincidence are presented. Monolithic scintillation
crystals instead of pixelated crystals in order to reduce dead areas have been
simulated. In order to study the system feasibility to produce real-time
images, different setups are considered. Performance in terms of acquisition
times have been calculated to determine the real-time capabilities and
limitations of such a system.
| physics.med-ph | results from the simulations of a compton gamma camera based on compact configuration of detectors consisting in two detection modules each of them having two stages of highresolution position and energysensitive radiation detectors operated in timecoincidence are presented monolithic scintillation crystals instead of pixelated crystals in order to reduce dead areas have been simulated in order to study the system feasibility to produce realtime images different setups are considered performance in terms of acquisition times have been calculated to determine the realtime capabilities and limitations of such a system | [['results', 'from', 'the', 'simulations', 'of', 'a', 'compton', 'gamma', 'camera', 'based', 'on', 'compact', 'configuration', 'of', 'detectors', 'consisting', 'in', 'two', 'detection', 'modules', 'each', 'of', 'them', 'having', 'two', 'stages', 'of', 'highresolution', 'position', 'and', 'energysensitive', 'radiation', 'detectors', 'operated', 'in', 'timecoincidence', 'are', 'presented', 'monolithic', 'scintillation', 'crystals', 'instead', 'of', 'pixelated', 'crystals', 'in', 'order', 'to', 'reduce', 'dead', 'areas', 'have', 'been', 'simulated', 'in', 'order', 'to', 'study', 'the', 'system', 'feasibility', 'to', 'produce', 'realtime', 'images', 'different', 'setups', 'are', 'considered', 'performance', 'in', 'terms', 'of', 'acquisition', 'times', 'have', 'been', 'calculated', 'to', 'determine', 'the', 'realtime', 'capabilities', 'and', 'limitations', 'of', 'such', 'a', 'system']] | [-0.10194005099324029, 0.08597213132934792, -0.04636801409880432, -0.0217578874618401, -0.013097042950351587, -0.11205031675694699, -0.04653684339051794, 0.43752772453125943, -0.17030108497174604, -0.3514273271718052, 0.13089738141488955, -0.30836804907015536, -0.04797630116678356, 0.2518039064460926, -0.06377001691693335, 0.09431733142354348, 0.08696919625227371, -0.011027789700860054, -0.07896333088407691, -0.23086658461422271, 0.2566669691940037, 0.062295870761271945, 0.29533668519573264, -0.03376534794656078, 0.14578728704828392, -0.0212197397741374, -0.04777147449563477, 0.01272128236720736, -0.0724188964264572, 0.05704293006068368, 0.32219374736540773, 0.09970481196167262, 0.20802672732663288, -0.4945318065583706, -0.22230700607505743, 0.0812928684329185, 0.11025960741857632, 0.014463682938890342, -0.058280082842010715, -0.2891779308824727, 0.11176114812430539, -0.18433094161740515, -0.09230380095122906, -0.024029240638718762, -0.023546334359993676, 0.060092940149577646, -0.22201771170602003, -0.03339628948505675, -0.03896833947870169, 0.019409996551576623, -0.06466915010045586, -0.0948456098728426, 0.05193909312064728, 0.1429867832411311, -0.037064875892018165, -0.030734104070331107, 0.17414847434906477, -0.15426889586189155, -0.14673812374776082, 0.37199859046952777, -0.022367585572058313, -0.17445529507096397, 0.22030459183498463, -0.15945080036736942, -0.10005238768906238, 0.2009379935694147, 0.22369160751676123, 0.12430807988923252, -0.17812868524238132, 0.014299119737658524, 0.04357378948165962, 0.1838735276807016, 0.10017084280091725, 0.07577867417732316, 0.20986729047491393, 0.24102021743323696, -0.001032650957323527, 0.14660788110059716, -0.18815982974365908, -0.027761758987927872, -0.24922579608522774, -0.16515793955330266, -0.15911608704187896, -0.008185742229348822, -0.02457647155309776, -0.12427013879118676, 0.38704354583882217, 0.16912114375344153, 0.14440938725994293, -0.02017350242606605, 0.3449630553551604, 0.05116272073898339, 0.11817585051143437, -0.03399022366705068, 0.26215045864620573, 0.07295232721907871, 0.09528511708727881, -0.1945324437431154, 0.022850728598998837, 0.024494982489353317] |
1,802.05151 | The Effect of Dielectric Crystals on the Electron Diffraction | A dynamic diffraction theory is developed for describing electron diffraction
by dielectric crystals in a strong electromagnetic field. It is shown that
additional diffraction maxima arise in an electromagnetic field, their
intensity appreciably depending on the field strength. In some cases the
intensity of the diffraction maxima is modulated by the electromagnetic field
frequency.
| physics.atom-ph | a dynamic diffraction theory is developed for describing electron diffraction by dielectric crystals in a strong electromagnetic field it is shown that additional diffraction maxima arise in an electromagnetic field their intensity appreciably depending on the field strength in some cases the intensity of the diffraction maxima is modulated by the electromagnetic field frequency | [['a', 'dynamic', 'diffraction', 'theory', 'is', 'developed', 'for', 'describing', 'electron', 'diffraction', 'by', 'dielectric', 'crystals', 'in', 'a', 'strong', 'electromagnetic', 'field', 'it', 'is', 'shown', 'that', 'additional', 'diffraction', 'maxima', 'arise', 'in', 'an', 'electromagnetic', 'field', 'their', 'intensity', 'appreciably', 'depending', 'on', 'the', 'field', 'strength', 'in', 'some', 'cases', 'the', 'intensity', 'of', 'the', 'diffraction', 'maxima', 'is', 'modulated', 'by', 'the', 'electromagnetic', 'field', 'frequency']] | [-0.18910002060605352, 0.23493256867691847, -0.073092521685693, 0.06559015606762841, -0.06907716379673393, -0.05354545789736288, 0.013758881420707676, 0.4547238643108695, -0.24945061420159484, -0.2693836454784981, 0.03581076941702998, -0.27039764923285003, -0.16373491608882668, 0.22679420588193117, 0.04337931331247091, 0.035869413055479527, -0.07367524822001104, 0.0695134806877899, -0.020472702031299746, -0.14860364849489457, 0.2742331577551172, 0.09798627615802818, 0.326908315014508, 0.06375287605139117, 0.06082369497528783, 0.13352529557111362, 0.03239309120302399, 0.08640395627268542, -0.06770044624338173, 0.014391694390387446, 0.23109112114266114, 0.014905369387836091, 0.19410475102011804, -0.4691721540703266, -0.2787376881611568, -0.008896870616202554, 0.093354970298673, 0.08450172793258119, -0.08889144856732821, -0.26663160417228937, -0.010283967980218155, -0.021936869472955114, -0.157216579032441, -0.06821566005668568, -0.03711471647127635, 0.09844504241590146, -0.28842568928720774, 0.054754799162900006, 0.05392017454788503, 0.11773934097760098, -0.1121956553241169, -0.04794040361971215, 0.030487507141919598, -0.008648496302258637, 0.12425039119207887, 0.08713915897533298, 0.18093044773020125, -0.19280229574414315, -0.08678048700784091, 0.35500125242052255, -0.06286524255173626, -0.1221282448257423, 0.09802686658912096, -0.26695371219129477, -0.022971337212732545, 0.27532416072035965, 0.10502489525134917, 0.09446710299407304, -0.17035954873965778, 0.12468369455180234, -0.048123695991105504, 0.2381833319172815, 0.19167541948802494, 0.048856658835171, 0.25825241183931075, 0.10015137231460323, 0.009100740419752482, 0.11788835881829814, -0.14183699333160701, -0.012618864869215974, -0.2459878659186264, -0.08210724109300861, -0.1955064715196689, 0.05420242355170625, -0.09866159313268899, -0.21441769675099445, 0.40032567334775293, 0.13032404074652326, 0.0908347905130574, -0.0859385281973691, 0.29871584054220607, 0.21034008345601182, 0.06487710845949887, -0.010387267490538457, 0.3183541563970114, 0.2491640650443043, 0.16785054630599916, -0.2777942914981395, -0.005477330104137461, -0.02113712753203732] |
1,802.05152 | Interaction of a Supernova with a Circumstellar Disk | Interaction between supernova (SN) ejecta and a dense circumstellar medium
(CSM) can power a luminous light curve and create narrow emission lines in the
spectra. While theoretical studies of interaction often assume a spherically
symmetric CSM, there are observational indications that the gas surrounding
some SN has a disk-like geometry. Here, we use moving-mesh hydrodynamics
simulations to study the interaction of a SN with a disk and determine how the
dynamics and observable signatures may depend on the disk mass, thickness, and
radial extent. We find that simple modifications to standard
spherically-symmetric scaling laws can be used to describe the propagation and
heating rate of the interaction shock. We use the resulting shock heating rates
to derive approximate bolometric light curves, and provide analytic formulas
that can be used to generate simple synthetic light curves for general
supernova-disk interactions. For certain disk parameters and explosion
energies, we are able to produce luminosities akin to those seen in
super-luminous SN. Because the SN ejecta can flow around and engulf the CSM
disk, the interaction region may become embedded and from certain viewing
angles the narrow emission lines indicative of interaction may be hidden.
| astro-ph.HE | interaction between supernova sn ejecta and a dense circumstellar medium csm can power a luminous light curve and create narrow emission lines in the spectra while theoretical studies of interaction often assume a spherically symmetric csm there are observational indications that the gas surrounding some sn has a disklike geometry here we use movingmesh hydrodynamics simulations to study the interaction of a sn with a disk and determine how the dynamics and observable signatures may depend on the disk mass thickness and radial extent we find that simple modifications to standard sphericallysymmetric scaling laws can be used to describe the propagation and heating rate of the interaction shock we use the resulting shock heating rates to derive approximate bolometric light curves and provide analytic formulas that can be used to generate simple synthetic light curves for general supernovadisk interactions for certain disk parameters and explosion energies we are able to produce luminosities akin to those seen in superluminous sn because the sn ejecta can flow around and engulf the csm disk the interaction region may become embedded and from certain viewing angles the narrow emission lines indicative of interaction may be hidden | [['interaction', 'between', 'supernova', 'sn', 'ejecta', 'and', 'a', 'dense', 'circumstellar', 'medium', 'csm', 'can', 'power', 'a', 'luminous', 'light', 'curve', 'and', 'create', 'narrow', 'emission', 'lines', 'in', 'the', 'spectra', 'while', 'theoretical', 'studies', 'of', 'interaction', 'often', 'assume', 'a', 'spherically', 'symmetric', 'csm', 'there', 'are', 'observational', 'indications', 'that', 'the', 'gas', 'surrounding', 'some', 'sn', 'has', 'a', 'disklike', 'geometry', 'here', 'we', 'use', 'movingmesh', 'hydrodynamics', 'simulations', 'to', 'study', 'the', 'interaction', 'of', 'a', 'sn', 'with', 'a', 'disk', 'and', 'determine', 'how', 'the', 'dynamics', 'and', 'observable', 'signatures', 'may', 'depend', 'on', 'the', 'disk', 'mass', 'thickness', 'and', 'radial', 'extent', 'we', 'find', 'that', 'simple', 'modifications', 'to', 'standard', 'sphericallysymmetric', 'scaling', 'laws', 'can', 'be', 'used', 'to', 'describe', 'the', 'propagation', 'and', 'heating', 'rate', 'of', 'the', 'interaction', 'shock', 'we', 'use', 'the', 'resulting', 'shock', 'heating', 'rates', 'to', 'derive', 'approximate', 'bolometric', 'light', 'curves', 'and', 'provide', 'analytic', 'formulas', 'that', 'can', 'be', 'used', 'to', 'generate', 'simple', 'synthetic', 'light', 'curves', 'for', 'general', 'supernovadisk', 'interactions', 'for', 'certain', 'disk', 'parameters', 'and', 'explosion', 'energies', 'we', 'are', 'able', 'to', 'produce', 'luminosities', 'akin', 'to', 'those', 'seen', 'in', 'superluminous', 'sn', 'because', 'the', 'sn', 'ejecta', 'can', 'flow', 'around', 'and', 'engulf', 'the', 'csm', 'disk', 'the', 'interaction', 'region', 'may', 'become', 'embedded', 'and', 'from', 'certain', 'viewing', 'angles', 'the', 'narrow', 'emission', 'lines', 'indicative', 'of', 'interaction', 'may', 'be', 'hidden']] | [-0.06453857892247755, 0.10332330608623425, -0.08312681797771174, 0.1425773525873872, -0.14331888671262258, -0.1340698299841731, -0.0010603525534428227, 0.47189151015893327, -0.22300760493447994, -0.28546343851073874, 0.0527055166327731, -0.26973977799561477, -0.05343871466396133, 0.1967280416544129, -0.008737340104825311, -0.05498909959520813, 0.08221026785191421, -0.09125855379888462, -0.09264108569041889, -0.19647210002364834, 0.3078062644481893, 0.05754458245514107, 0.16459405981034714, 0.05580885257298878, 0.024193428248942328, -0.08996025093767733, 0.004057871738536507, -0.004691230245324642, -0.15315124857984086, 0.06140177299607428, 0.1867898223640218, 0.13887052047822177, 0.13748122711363614, -0.46034203259961887, -0.2859445632118744, 0.11699161402127188, 0.20875188977767212, 0.08948458341091715, -0.0833322451211005, -0.22828364300819515, 0.014851960613049752, -0.2082603256320532, -0.21219009039094622, 0.0009214525349945298, 0.02170976066318248, 0.062329623798829996, -0.2707719207005039, 0.07473366295050889, 0.008452064310156628, 0.03765056692843974, -0.0651355951619749, -0.01641000222709732, -0.07483906715776752, 0.04450948740519017, 0.05164465864057316, 0.011514043780433804, 0.16825452680012007, -0.13371456206736354, 0.005272874394090388, 0.4410912737650163, -0.06706647011232002, -0.06911598502034175, 0.2580633830493657, -0.165464050039443, -0.07096835429882582, 0.20717610098928682, 0.2155139931454445, 0.08907642046291947, -0.13224915432358522, -0.012210854327340284, -0.040450998551470684, 0.16930531917069186, 0.029119490995681334, 0.05056308019810743, 0.2973852802204524, 0.07703484139034612, -0.05066600637583559, 0.1087613650597632, -0.17455079199877904, -0.06337996060760077, -0.2774877924099077, -0.09598869295347072, -0.11410512240281748, 0.12000868085367088, -0.15633080096556365, -0.13928267653758458, 0.3448958724532374, 0.12034200857264228, 0.2315405975169068, 0.005834604608606918, 0.2703023463175559, 0.09134959298337161, 0.07587734550842284, 0.15847091456748427, 0.3281418963621007, 0.1716642371959087, 0.09669293351447043, -0.22669956641496009, 0.10433843944536239, 0.03449192835281344] |
1,802.05153 | The Solar Wind Environment in Time | We use magnetograms of 8 solar analogues of ages 30~Myr to 3.6~Gyr obtained
from Zeeman Doppler Imaging (ZDI) and taken from the literature, together with
two solar magnetograms, to drive magnetohydrodynamical (MHD) wind simulations
and construct an evolutionary scenario of the solar wind environment and its
angular momentum loss rate. With observed magnetograms of the radial field
strength as the only variant in the wind model, we find that power law model
fitted to the derived angular momentum loss rate against time, $t$, results in
a spin down relation $\Omega\propto t^{-0.51}$, for angular speed $\Omega$,
which is remarkably consistent with the well-established Skumanich law
$\Omega\propto t^{-0.5}$. We use the model wind conditions to estimate the
magnetospheric standoff distances for an Earth-like test planet situated at
1~AU for each of the stellar cases, and to obtain trends of minimum and maximum
wind ram pressure and average ram pressure in the solar system through time.
The wind ram pressure declines with time as $\overline{P_{ram}}\propto
t^{2/3}$, amounting to a factor of 50 or so over the present lifetime of the
solar system.
| astro-ph.SR | we use magnetograms of 8 solar analogues of ages 30myr to 36gyr obtained from zeeman doppler imaging zdi and taken from the literature together with two solar magnetograms to drive magnetohydrodynamical mhd wind simulations and construct an evolutionary scenario of the solar wind environment and its angular momentum loss rate with observed magnetograms of the radial field strength as the only variant in the wind model we find that power law model fitted to the derived angular momentum loss rate against time t results in a spin down relation omegapropto t051 for angular speed omega which is remarkably consistent with the wellestablished skumanich law omegapropto t05 we use the model wind conditions to estimate the magnetospheric standoff distances for an earthlike test planet situated at 1au for each of the stellar cases and to obtain trends of minimum and maximum wind ram pressure and average ram pressure in the solar system through time the wind ram pressure declines with time as overlinep_rampropto t23 amounting to a factor of 50 or so over the present lifetime of the solar system | [['we', 'use', 'magnetograms', 'of', '8', 'solar', 'analogues', 'of', 'ages', '30myr', 'to', '36gyr', 'obtained', 'from', 'zeeman', 'doppler', 'imaging', 'zdi', 'and', 'taken', 'from', 'the', 'literature', 'together', 'with', 'two', 'solar', 'magnetograms', 'to', 'drive', 'magnetohydrodynamical', 'mhd', 'wind', 'simulations', 'and', 'construct', 'an', 'evolutionary', 'scenario', 'of', 'the', 'solar', 'wind', 'environment', 'and', 'its', 'angular', 'momentum', 'loss', 'rate', 'with', 'observed', 'magnetograms', 'of', 'the', 'radial', 'field', 'strength', 'as', 'the', 'only', 'variant', 'in', 'the', 'wind', 'model', 'we', 'find', 'that', 'power', 'law', 'model', 'fitted', 'to', 'the', 'derived', 'angular', 'momentum', 'loss', 'rate', 'against', 'time', 't', 'results', 'in', 'a', 'spin', 'down', 'relation', 'omegapropto', 't051', 'for', 'angular', 'speed', 'omega', 'which', 'is', 'remarkably', 'consistent', 'with', 'the', 'wellestablished', 'skumanich', 'law', 'omegapropto', 't05', 'we', 'use', 'the', 'model', 'wind', 'conditions', 'to', 'estimate', 'the', 'magnetospheric', 'standoff', 'distances', 'for', 'an', 'earthlike', 'test', 'planet', 'situated', 'at', '1au', 'for', 'each', 'of', 'the', 'stellar', 'cases', 'and', 'to', 'obtain', 'trends', 'of', 'minimum', 'and', 'maximum', 'wind', 'ram', 'pressure', 'and', 'average', 'ram', 'pressure', 'in', 'the', 'solar', 'system', 'through', 'time', 'the', 'wind', 'ram', 'pressure', 'declines', 'with', 'time', 'as', 'overlinep_rampropto', 't23', 'amounting', 'to', 'a', 'factor', 'of', '50', 'or', 'so', 'over', 'the', 'present', 'lifetime', 'of', 'the', 'solar', 'system']] | [-0.10370902446381726, 0.15201583563562468, -0.04171619499208067, 0.07023570890834724, -0.06359754630995501, -0.07990740348098123, 0.049692512296711684, 0.3796689254483102, -0.26388711308986373, -0.3774930773175914, 0.05459979802848962, -0.2458473995978817, -0.018320189789268294, 0.2543712818475218, -0.032917813884771684, 0.03488021842382626, 0.07262322204901879, -0.016419965845257553, -0.04477766671334393, -0.18458018246614796, 0.2544012008028486, 0.12489675452128392, 0.15698117478777104, -0.02465235988016833, 0.12846811301212505, -0.10601958509968509, -0.008933526831573214, 0.01134468318004813, -0.15223203708613006, 0.02134441515822387, 0.1435064778575617, 0.122242534305604, 0.22993086077423702, -0.42511195783894934, -0.23601837224057157, 0.009464207716519013, 0.12878176573312058, 0.016448825455551163, -0.03223175096817696, -0.19606461360606112, 0.0452983099219802, -0.21835473596531135, -0.16414301020135594, 0.0327992804761214, 0.05159005956441185, 0.03288698103014295, -0.3284540011782982, 0.13344098675853192, 0.02236569367497313, 0.13635091016344217, -0.1678178362523216, -0.09134284767655614, -0.08789587790273469, 0.10152352957745527, 0.10362054151416734, 0.09840303693305362, 0.1715379011875484, -0.10557429844629951, -0.04401633514366536, 0.393029513080943, -0.11108095818318278, -0.0640233634357256, 0.19566333596065472, -0.2295177424060636, -0.05513959317944351, 0.1177470739719204, 0.1956794260913739, 0.06634159752510724, -0.1260634311823775, -0.008075844085727691, -0.025620819656813346, 0.1879106463232099, 0.06542462191613264, 0.0004614505768668923, 0.2375612480788153, 0.09739053472268014, 0.05180716960339024, 0.09353189075971552, -0.23814175256517378, -0.06943405626357575, -0.22607538506748492, -0.11799827242661691, -0.12638456057307354, 0.06383259233552963, -0.14765846230495133, -0.11667863207879815, 0.35227049263829197, 0.19917616905877367, 0.19947474370498888, 0.0863199259322507, 0.347181407851167, 0.14036096350305757, 0.07776367287045684, 0.17394531674058686, 0.291244691952174, 0.1877858353149019, 0.18510749131978213, -0.2763033492665272, 0.051302369956498624, 0.043609586766582324] |
1,802.05154 | Linear recurrence sequences and twisted binary forms | Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and
let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the
family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in
{\mathbb Z}$, which we write as $$ X^d-U_1(a)X^{d-1}Y+\cdots+(-1)^{d-1}
U_{d-1}(a) XY^{d-1}+(-1)^d U_d(a) Y^d.$$ In this paper we study these sequences
$\bigl(U_h(a)\bigr)_{a\in {\mathbb Z}}$ which turn out to be linear recurrence
sequences.
| math.NT | let prod_i1d xalpha_i y inmathbb cxy be a binary form and let epsilon_1dotsepsilon_d be nonzero complex numbers we consider the family of binary forms prod_i1d xalpha_i epsilon_iay ain mathbb z which we write as xdu_1axd1ycdots1d1 u_d1a xyd11d u_da yd in this paper we study these sequences biglu_habigr_ain mathbb z which turn out to be linear recurrence sequences | [['let', 'prod_i1d', 'xalpha_i', 'y', 'inmathbb', 'cxy', 'be', 'a', 'binary', 'form', 'and', 'let', 'epsilon_1dotsepsilon_d', 'be', 'nonzero', 'complex', 'numbers', 'we', 'consider', 'the', 'family', 'of', 'binary', 'forms', 'prod_i1d', 'xalpha_i', 'epsilon_iay', 'ain', 'mathbb', 'z', 'which', 'we', 'write', 'as', 'xdu_1axd1ycdots1d1', 'u_d1a', 'xyd11d', 'u_da', 'yd', 'in', 'this', 'paper', 'we', 'study', 'these', 'sequences', 'biglu_habigr_ain', 'mathbb', 'z', 'which', 'turn', 'out', 'to', 'be', 'linear', 'recurrence', 'sequences']] | [-0.2308753168132777, 0.12098541613280152, -0.03950284284655936, -0.010116347899990311, -0.07089245885921021, -0.19930005802113251, 0.0001802927023769977, 0.33819346507031395, -0.3727663493094345, -0.12737695515776673, 0.08189545765587052, -0.2757964473615478, -0.1378321512893308, 0.16107493716602525, -0.06541754544014111, -0.048900367226451635, 0.016289152428119753, 0.048115585232153535, -0.09359121117934895, -0.3149319848792705, 0.31804544385522604, -0.10069418818845104, 0.07690914011133525, -0.0817184845994537, 0.07023427733414185, 0.04345235971656317, 0.027193584421183914, -0.028712286410154775, -0.2307716780148136, 0.054198345130619906, 0.31793492240831256, 0.11385288236973186, 0.24001402431167662, -0.3177420657593757, -0.12903007133475816, 0.3136397878018518, 0.19994822423905134, -0.075293666125314, -0.010658964534134915, -0.2448425096081337, 0.1738939397376574, -0.1861037137399156, -0.12181863592316707, -0.09379467450586769, 0.10406287546114375, 0.08719792630290613, -0.36675432219635695, 0.007428590247097115, 0.11373767422628589, 0.06164176943032847, 0.010377475147834048, -0.13923372165299952, -0.054139823138636224, 0.03158123384006709, -0.024064532978324376, 0.19512767323855465, 0.01812335749855265, 0.02573590283767165, -0.05115947884041816, 0.3654257256263615, -0.07598062030350168, -0.26990144955925643, 0.06766007012629416, -0.23395935620646924, -0.20293015406059567, 0.058645928860642016, 0.22547212621429935, 0.16926948095594221, -0.10488997956660266, 0.1950200618193776, -0.12342028376103069, 0.13839240009353185, 0.13323464946976551, 0.021207683050306514, 0.2472298124145406, 0.007661711735030015, -0.010022624977864325, 0.12791416166631583, 0.004008842913511519, 0.019773448739821713, -0.31524692149832845, -0.20054265080640712, -0.07779061384887125, 0.2824176636834939, -0.08570314270976571, -0.1572324801236391, 0.2959698179571812, 0.05738503650839751, 0.24464695419495305, 0.12769740387739148, 0.11359582045891632, 0.12953296638200604, 0.008822451845238296, 0.0413913232817625, -0.0049002279217044515, 0.1712940945290029, -0.0183693920650209, -0.10657789333102603, -0.0008672126083790014, 0.17411971295950934] |
1,802.05155 | A Diffusion Approximation Theory of Momentum SGD in Nonconvex
Optimization | Momentum Stochastic Gradient Descent (MSGD) algorithm has been widely applied
to many nonconvex optimization problems in machine learning, e.g., training
deep neural networks, variational Bayesian inference, and etc. Despite its
empirical success, there is still a lack of theoretical understanding of
convergence properties of MSGD. To fill this gap, we propose to analyze the
algorithmic behavior of MSGD by diffusion approximations for nonconvex
optimization problems with strict saddle points and isolated local optima. Our
study shows that the momentum helps escape from saddle points, but hurts the
convergence within the neighborhood of optima (if without the step size
annealing or momentum annealing). Our theoretical discovery partially
corroborates the empirical success of MSGD in training deep neural networks.
| cs.LG math.OC stat.ML | momentum stochastic gradient descent msgd algorithm has been widely applied to many nonconvex optimization problems in machine learning eg training deep neural networks variational bayesian inference and etc despite its empirical success there is still a lack of theoretical understanding of convergence properties of msgd to fill this gap we propose to analyze the algorithmic behavior of msgd by diffusion approximations for nonconvex optimization problems with strict saddle points and isolated local optima our study shows that the momentum helps escape from saddle points but hurts the convergence within the neighborhood of optima if without the step size annealing or momentum annealing our theoretical discovery partially corroborates the empirical success of msgd in training deep neural networks | [['momentum', 'stochastic', 'gradient', 'descent', 'msgd', 'algorithm', 'has', 'been', 'widely', 'applied', 'to', 'many', 'nonconvex', 'optimization', 'problems', 'in', 'machine', 'learning', 'eg', 'training', 'deep', 'neural', 'networks', 'variational', 'bayesian', 'inference', 'and', 'etc', 'despite', 'its', 'empirical', 'success', 'there', 'is', 'still', 'a', 'lack', 'of', 'theoretical', 'understanding', 'of', 'convergence', 'properties', 'of', 'msgd', 'to', 'fill', 'this', 'gap', 'we', 'propose', 'to', 'analyze', 'the', 'algorithmic', 'behavior', 'of', 'msgd', 'by', 'diffusion', 'approximations', 'for', 'nonconvex', 'optimization', 'problems', 'with', 'strict', 'saddle', 'points', 'and', 'isolated', 'local', 'optima', 'our', 'study', 'shows', 'that', 'the', 'momentum', 'helps', 'escape', 'from', 'saddle', 'points', 'but', 'hurts', 'the', 'convergence', 'within', 'the', 'neighborhood', 'of', 'optima', 'if', 'without', 'the', 'step', 'size', 'annealing', 'or', 'momentum', 'annealing', 'our', 'theoretical', 'discovery', 'partially', 'corroborates', 'the', 'empirical', 'success', 'of', 'msgd', 'in', 'training', 'deep', 'neural', 'networks']] | [-0.062447004253044724, -0.05642691210736162, -0.12140003500235641, 0.11745815112605755, -0.07729389221590553, -0.14083879390874735, 0.10646032528458242, 0.4463763662860689, -0.3259224845812871, -0.32462183276239115, 0.07029787861168958, -0.2385401180228935, -0.18626540668436095, 0.13227356429625717, -0.13493205591614366, 0.15042909025960866, 0.13298096076354513, -0.04243466359141291, -0.10647918741043626, -0.3137000626227699, 0.26034418140283316, 0.056220454760353505, 0.3188107161699102, 0.027156986398164693, 0.11315895374426539, -0.017974251558860906, 0.061903685379104734, 0.015292288496708259, -0.08086167804681164, 0.15890637173120362, 0.30466775042124283, 0.19684905239428657, 0.44401975740224886, -0.42806096070915717, -0.248301492490543, 0.17435801326163894, 0.21352286604404724, 0.09801086883705395, -0.08976200305554284, -0.25130663703307193, 0.07308574836167833, -0.06129663345268649, -0.06634263566129991, -0.17145496751848432, -0.0394932694064501, 0.04997531414971265, -0.23990612934367397, 0.077037152251165, 0.07786673044738097, 0.09845408611795586, -0.03538416227640218, -0.15052215087139964, 0.010556720590226863, 0.053832570092879936, 0.10966810886350134, 0.05863880455438207, 0.14900375261472967, -0.16656447480369008, -0.1573296041908459, 0.30827050524739885, 0.0073061345670467764, -0.16010506514213088, 0.21009436939070877, -0.022912088343794018, -0.1661994658036428, 0.16603968198148486, 0.22238117751752973, 0.12886148853362817, -0.17427499901153085, 0.09960660985850084, -0.0032665109118589987, 0.09942678760928221, 0.01926105151661377, -0.04162411423973166, 0.14523992869350263, 0.2595393028683387, 0.13952355266650182, 0.12104672533420162, -0.09365724998578015, -0.19713316958111066, -0.20681238495028362, -0.08187620559434654, -0.2236962781768316, 0.06148397743713875, -0.11052169948075022, -0.19923491936781976, 0.3727285412944153, 0.19586812571869192, 0.232189822754958, 0.13207151666761208, 0.31865087592910624, 0.07132794259466295, 0.06596412145508787, 0.16601041918142867, 0.2648785110149119, 0.11452059678008987, 0.14027053199740303, -0.22710110664638317, 0.13247286322582355, 0.07286943972078908] |
1,802.05156 | On Cohen-Macaulay Auslander algebras | Cohen-Macaulay Auslander algebras are the endomorphism algebras of
representation generators of the subcategory of Gorenstein projective modules
over $\rm{CM}$-finite algebras. In this paper, we study Cohen-Macaulay
Auslander algebras over $1$-Gorenstein algebras and
$\Omega_{\mathcal{G}}$-algebras. $1$-Gorenstein algebras are those of algebras
with global Gorenstein projective dimension at most one and
$\Omega_{\mathcal{G}}$-algebras are a class of algebras introduced in this
paper, including some important class of algebras for example Gentle algebras
and more generally quadratic monomial algebras. It will be shown how the
results for Gorenstein projective representations of a quiver over an Artin
algebra, including the submodule category introduced in [RS], or more
generally, the (separated) monomorphism category defined in [LZh2] and [XZZ],
can be applied to study the Cohen-Macaulay Auslander algebras.
| math.RT | cohenmacaulay auslander algebras are the endomorphism algebras of representation generators of the subcategory of gorenstein projective modules over rmcmfinite algebras in this paper we study cohenmacaulay auslander algebras over 1gorenstein algebras and omega_mathcalgalgebras 1gorenstein algebras are those of algebras with global gorenstein projective dimension at most one and omega_mathcalgalgebras are a class of algebras introduced in this paper including some important class of algebras for example gentle algebras and more generally quadratic monomial algebras it will be shown how the results for gorenstein projective representations of a quiver over an artin algebra including the submodule category introduced in rs or more generally the separated monomorphism category defined in lzh2 and xzz can be applied to study the cohenmacaulay auslander algebras | [['cohenmacaulay', 'auslander', 'algebras', 'are', 'the', 'endomorphism', 'algebras', 'of', 'representation', 'generators', 'of', 'the', 'subcategory', 'of', 'gorenstein', 'projective', 'modules', 'over', 'rmcmfinite', 'algebras', 'in', 'this', 'paper', 'we', 'study', 'cohenmacaulay', 'auslander', 'algebras', 'over', '1gorenstein', 'algebras', 'and', 'omega_mathcalgalgebras', '1gorenstein', 'algebras', 'are', 'those', 'of', 'algebras', 'with', 'global', 'gorenstein', 'projective', 'dimension', 'at', 'most', 'one', 'and', 'omega_mathcalgalgebras', 'are', 'a', 'class', 'of', 'algebras', 'introduced', 'in', 'this', 'paper', 'including', 'some', 'important', 'class', 'of', 'algebras', 'for', 'example', 'gentle', 'algebras', 'and', 'more', 'generally', 'quadratic', 'monomial', 'algebras', 'it', 'will', 'be', 'shown', 'how', 'the', 'results', 'for', 'gorenstein', 'projective', 'representations', 'of', 'a', 'quiver', 'over', 'an', 'artin', 'algebra', 'including', 'the', 'submodule', 'category', 'introduced', 'in', 'rs', 'or', 'more', 'generally', 'the', 'separated', 'monomorphism', 'category', 'defined', 'in', 'lzh2', 'and', 'xzz', 'can', 'be', 'applied', 'to', 'study', 'the', 'cohenmacaulay', 'auslander', 'algebras']] | [-0.1612137345013064, -0.018674777563664348, -0.036530660549660435, 0.11105789323457806, -0.10193318560125371, -0.24985352734200142, -0.21166304403169336, 0.4036705192371175, -0.4732639760648077, -0.11463448850052624, 0.1549527326695107, -0.21042836808342616, -0.12061278421857298, 0.1938814952295145, -0.2784778489731252, -0.1268826785029699, 0.08165795496737199, 0.13275940010950354, -0.11679572991802004, -0.42309554224906104, 0.5222785295517152, 0.013823523210233142, 0.22190699456580754, -0.0025543485635666757, 0.08872602220046623, 0.03407440577424934, -0.014210967579856515, 0.05021058268652394, -0.19570007392582645, 0.09832018422733607, 0.46252728642189295, 0.0476929785157875, 0.18693338358646322, -0.3247832841207755, -0.006682729075566448, 0.287742162179523, 0.21639264595357638, 0.018148780278540378, -0.022823801177106237, -0.25206344956853266, 0.08508020193930234, -0.31738561682467314, -0.08576356505589752, -0.08118230633533977, 0.12332494226123752, -0.02931201987466293, -0.2572543670539744, -0.016456903175226058, 0.10023271823442413, 0.2686049174878682, -0.12707033115318686, -0.06838362138911054, -0.17788303099524486, -0.018767707590776464, -0.17649802833731318, -0.02273205714701707, 0.13654729938696555, -0.1106920509422519, -0.2188388566358079, 0.31570456166960426, 0.07320678244136146, -0.2094218951312761, 0.14147938212534364, -0.23562323595878892, -0.15710270206106763, 0.1031173385382662, -0.04126074056719141, 0.17476076792508108, -0.005107173792504031, 0.19450863911408994, -0.17600764147937298, -0.07942761227604933, 0.1207711151279188, 0.05585732327870511, 0.13583156920905257, 0.1405662828815523, 0.019789546896735656, 0.12959427948527294, 0.11284820237628522, 0.044032217163977955, -0.34631879435017193, -0.20588156049027398, -0.012625043422931099, 0.1612059011651958, -0.11040963462889114, -0.13330858146268995, 0.4785844136414857, 0.1714476394980889, 0.1286886293874604, 0.16820906515128847, 0.15750162360451087, -0.060153936465463506, 0.19644428950991352, 0.029795014867102447, 0.09738338877098707, 0.37304386832141156, -0.03188287346033733, 0.00656800212916629, -0.055442486044645696, 0.29120299044257864] |
1,802.05157 | Plasmofluidic Single-Molecule Surface Enhanced Raman Scattering from
Dynamic Assembly of Plasmonic Nanoparticles | Single-molecule surface enhanced Raman scattering (SM-SERS) is one of the
vital applications of plasmonic nanoparticles. The SM-SERS sensitivity
critically depends on plasmonic hot-spots created at the vicinity of such
nanoparticles. In conventional fluid-phase SM-SERS experiments, plasmonic
hot-spots are facilitated by chemical aggregation of nanoparticles. Such
aggregation is usually irreversible, and hence, nanoparticles cannot be
re-dispersed in the fluid for further use. Here, we show how to combine SM-SERS
with plasmon-polariton assisted, reversible assembly of plasmonic nanoparticles
at an unstructured metal-fluid interface. One of the unique features of our
method is that we use a single evanescent-wave optical excitation for
nanoparticle-assembly, manipulation and SM-SERS measurements. Furthermore, by
utilizing dual excitation of plasmons at metal-fluid interface, we create
interacting assemblies of metal nanoparticles, which may be further harnessed
in dynamic lithography of dispersed nanostructures. Our work will have
implications in realizing optically addressable, plasmofluidic, single-molecule
detection platforms.
| physics.optics cond-mat.mes-hall cond-mat.soft physics.app-ph physics.chem-ph | singlemolecule surface enhanced raman scattering smsers is one of the vital applications of plasmonic nanoparticles the smsers sensitivity critically depends on plasmonic hotspots created at the vicinity of such nanoparticles in conventional fluidphase smsers experiments plasmonic hotspots are facilitated by chemical aggregation of nanoparticles such aggregation is usually irreversible and hence nanoparticles cannot be redispersed in the fluid for further use here we show how to combine smsers with plasmonpolariton assisted reversible assembly of plasmonic nanoparticles at an unstructured metalfluid interface one of the unique features of our method is that we use a single evanescentwave optical excitation for nanoparticleassembly manipulation and smsers measurements furthermore by utilizing dual excitation of plasmons at metalfluid interface we create interacting assemblies of metal nanoparticles which may be further harnessed in dynamic lithography of dispersed nanostructures our work will have implications in realizing optically addressable plasmofluidic singlemolecule detection platforms | [['singlemolecule', 'surface', 'enhanced', 'raman', 'scattering', 'smsers', 'is', 'one', 'of', 'the', 'vital', 'applications', 'of', 'plasmonic', 'nanoparticles', 'the', 'smsers', 'sensitivity', 'critically', 'depends', 'on', 'plasmonic', 'hotspots', 'created', 'at', 'the', 'vicinity', 'of', 'such', 'nanoparticles', 'in', 'conventional', 'fluidphase', 'smsers', 'experiments', 'plasmonic', 'hotspots', 'are', 'facilitated', 'by', 'chemical', 'aggregation', 'of', 'nanoparticles', 'such', 'aggregation', 'is', 'usually', 'irreversible', 'and', 'hence', 'nanoparticles', 'can', 'not', 'be', 'redispersed', 'in', 'the', 'fluid', 'for', 'further', 'use', 'here', 'we', 'show', 'how', 'to', 'combine', 'smsers', 'with', 'plasmonpolariton', 'assisted', 'reversible', 'assembly', 'of', 'plasmonic', 'nanoparticles', 'at', 'an', 'unstructured', 'metalfluid', 'interface', 'one', 'of', 'the', 'unique', 'features', 'of', 'our', 'method', 'is', 'that', 'we', 'use', 'a', 'single', 'evanescentwave', 'optical', 'excitation', 'for', 'nanoparticleassembly', 'manipulation', 'and', 'smsers', 'measurements', 'furthermore', 'by', 'utilizing', 'dual', 'excitation', 'of', 'plasmons', 'at', 'metalfluid', 'interface', 'we', 'create', 'interacting', 'assemblies', 'of', 'metal', 'nanoparticles', 'which', 'may', 'be', 'further', 'harnessed', 'in', 'dynamic', 'lithography', 'of', 'dispersed', 'nanostructures', 'our', 'work', 'will', 'have', 'implications', 'in', 'realizing', 'optically', 'addressable', 'plasmofluidic', 'singlemolecule', 'detection', 'platforms']] | [-0.09252436348347814, 0.19023806586712225, -0.05413870697098595, -0.04003895406116295, -0.03733335236466809, -0.16018877945306315, 0.037251443178816276, 0.4777489711979886, -0.2523522427553064, -0.2782640901257421, 0.01783225287062969, -0.3020319581500717, -0.19761845532485603, 0.22463450046301775, 0.0073648678900843315, 0.03762183757173223, 0.018573310668254597, -0.10238974067297849, 0.027222731520285034, -0.13617819728707517, 0.2381230766748215, 0.06846183575559538, 0.31875244852715545, 0.1362976765885324, 0.0506523336068942, 0.020075399785178836, 0.05735175376692852, -0.005428926902009057, -0.1186121432259748, 0.16741648870617984, 0.2954329395865357, -0.015114549094798056, 0.2191020253967572, -0.5208194462543393, -0.23962976405774797, 0.02546367619570892, 0.23900124343711285, 0.16009981110871124, -0.1342821491017638, -0.25573667658532, 0.08383244604289115, -0.0809707910512815, -0.10649477172043774, -0.0897287719108008, -0.050167501089977216, 0.06179673552278664, -0.22506543689804687, 0.025713942005540003, 0.046079383081906324, 0.09840046998660465, -0.047764383749775846, -0.046676534944428846, -0.03478767670743115, 0.07540158987846356, -0.055106218879834024, -0.05610218965708949, 0.29311572734943847, -0.1250195253601337, -0.1422366975135841, 0.3529294036390664, -0.051006448025313705, -0.1482269636622363, 0.233065859877042, -0.12439537168092947, -0.06407299577063146, 0.19070518391949315, 0.17831466989298644, 0.1674578591116372, -0.16245126665791276, 0.028776776217334495, 0.023938265915673513, 0.21362452553194408, 0.12422469240723999, 0.10629812343749445, 0.272021367012725, 0.2597395988194259, 0.006318218669026986, 0.16167614419319362, -0.11331360587987896, 0.007585217153744681, -0.16536714925619583, -0.2171665822543282, -0.23784121557080246, 0.041175866625015295, -0.06683271822997473, -0.16269364375034934, 0.3279391923150816, 0.13654582177116242, 0.10637983754179538, -0.06250902799925265, 0.2798720927765736, 0.05068296151499466, 0.10268799866504082, -0.03253517448706748, 0.2706510231315673, 0.1106957348219894, 0.09766183973622176, -0.28154161843060926, 0.05090690989346875, -0.03467468690237851] |
1,802.05158 | Algebraically grid-like graphs have large tree-width | By the Grid Minor Theorem of Robertson and Seymour, every graph of
sufficiently large tree-width contains a large grid as a minor. Tree-width may
therefore be regarded as a measure of 'grid-likeness' of a graph.
The grid contains a long cycle on the perimeter, which is the
$\mathbb{F}_2$-sum of the rectangles inside. Moreover, the grid distorts the
metric of the cycle only by a factor of two. We prove that every graph that
resembles the grid in this algebraic sense has large tree-width:
Let $k, p$ be integers, $\gamma$ a real number and $G$ a graph. Suppose that
$G$ contains a cycle of length at least $2 \gamma p k$ which is the
$\mathbb{F}_2$-sum of cycles of length at most $p$ and whose metric is
distorted by a factor of at most $\gamma$. Then $G$ has tree-width at least
$k$.
| math.CO | by the grid minor theorem of robertson and seymour every graph of sufficiently large treewidth contains a large grid as a minor treewidth may therefore be regarded as a measure of gridlikeness of a graph the grid contains a long cycle on the perimeter which is the mathbbf_2sum of the rectangles inside moreover the grid distorts the metric of the cycle only by a factor of two we prove that every graph that resembles the grid in this algebraic sense has large treewidth let k p be integers gamma a real number and g a graph suppose that g contains a cycle of length at least 2 gamma p k which is the mathbbf_2sum of cycles of length at most p and whose metric is distorted by a factor of at most gamma then g has treewidth at least k | [['by', 'the', 'grid', 'minor', 'theorem', 'of', 'robertson', 'and', 'seymour', 'every', 'graph', 'of', 'sufficiently', 'large', 'treewidth', 'contains', 'a', 'large', 'grid', 'as', 'a', 'minor', 'treewidth', 'may', 'therefore', 'be', 'regarded', 'as', 'a', 'measure', 'of', 'gridlikeness', 'of', 'a', 'graph', 'the', 'grid', 'contains', 'a', 'long', 'cycle', 'on', 'the', 'perimeter', 'which', 'is', 'the', 'mathbbf_2sum', 'of', 'the', 'rectangles', 'inside', 'moreover', 'the', 'grid', 'distorts', 'the', 'metric', 'of', 'the', 'cycle', 'only', 'by', 'a', 'factor', 'of', 'two', 'we', 'prove', 'that', 'every', 'graph', 'that', 'resembles', 'the', 'grid', 'in', 'this', 'algebraic', 'sense', 'has', 'large', 'treewidth', 'let', 'k', 'p', 'be', 'integers', 'gamma', 'a', 'real', 'number', 'and', 'g', 'a', 'graph', 'suppose', 'that', 'g', 'contains', 'a', 'cycle', 'of', 'length', 'at', 'least', '2', 'gamma', 'p', 'k', 'which', 'is', 'the', 'mathbbf_2sum', 'of', 'cycles', 'of', 'length', 'at', 'most', 'p', 'and', 'whose', 'metric', 'is', 'distorted', 'by', 'a', 'factor', 'of', 'at', 'most', 'gamma', 'then', 'g', 'has', 'treewidth', 'at', 'least', 'k']] | [-0.2161101440671342, 0.14906500394151878, -0.07288224904553244, -0.014138970046514904, -0.07521450632408153, -0.14200440182411758, 0.051418271477429375, 0.3403878129039803, -0.2886472895364812, -0.30577507090965544, 0.09956601765057765, -0.28982927171635803, -0.09333489786316879, 0.15708264821067955, -0.07215197348328185, -0.05239182751605383, 0.11147645170915954, 0.13820043148092218, 0.04014877908876723, -0.23212443447559664, 0.2984379410036724, 0.0055367814540101664, 0.10720999287373394, 0.06770752960421743, 0.10061106689097564, 0.015430402469542557, 0.007239091910258697, 0.1270632769718739, -0.13173030310621217, 0.055082559911874086, 0.25541637951752894, 0.130847067422621, 0.3029421568732627, -0.3465448521654611, -0.19372806766743425, 0.19854914935400886, 0.09473942519321929, 0.005189888962768834, 0.04982777775425029, -0.16483577259265594, 0.17391725878373984, -0.08801662457603825, -0.10955200242694385, 0.04256695310456039, 0.16528155407902315, -0.00231905747205019, -0.26134592201560736, -0.03567535960519972, 0.12679331747978165, 0.07521291401400401, 0.10712314957419723, -0.1695846681318239, -0.07448013252612666, 0.08541306933850376, -0.04423013429266204, 0.13101738130751941, 0.06217962575066889, -0.08524462907599714, -0.12317849721259906, 0.405160165779347, -0.06309400476433717, -0.11964332477536298, 0.09521842228561422, -0.19056955357524055, -0.17002793326701995, 0.17025680333566273, 0.1418509630513561, 0.1394822257604912, -0.05632528096410262, 0.18554107872573794, -0.12249417883772266, 0.17392857666433292, 0.1341325075630724, -0.05296646798858895, 0.1542141212551535, 0.16482695806805506, 0.1579433954592767, 0.14316712978744647, -0.03923238814386954, 0.06197049429327467, -0.3230154172306622, -0.10953782639894498, -0.26953018975213006, 0.11109792017105995, -0.22450828940718498, -0.21744399988194452, 0.40355046455116167, 0.022860373401790042, 0.22307682994508396, 0.07837072627306202, 0.2483328515935662, 0.09074768884087077, 0.09503994510257549, 0.1982643636534956, 0.11239761762647298, 0.17393622437940678, -0.02025085987767925, -0.16470196409776372, 0.07788828714499182, 0.12824416612308934] |
1,802.05159 | SAT solving techniques: a bibliography | We present a selective bibliography about efficient SAT solving, focused on
optimizations for the CDCL-based algorithms.
| cs.LO | we present a selective bibliography about efficient sat solving focused on optimizations for the cdclbased algorithms | [['we', 'present', 'a', 'selective', 'bibliography', 'about', 'efficient', 'sat', 'solving', 'focused', 'on', 'optimizations', 'for', 'the', 'cdclbased', 'algorithms']] | [-0.1049648336484097, -0.0779424590873532, -0.051674150611688674, 0.10306753352051601, -0.18344204686582088, -0.19700292611378245, 0.1320018398546381, 0.4872094101156108, -0.1744198757223785, -0.36757081747055054, 0.16316042837570421, -0.20250806107651442, -0.09614677494391799, 0.29485509265214205, -0.001574173045810312, 0.13950572907924652, 0.15385809340295964, -0.09156894264742732, -0.15534414281137288, -0.2917792060179636, 0.21568651590496302, 0.06521734473062679, 0.2263106345781125, 0.08645782837993465, 0.11192143382504582, 0.06386698622372933, -0.09233322079307982, 0.016149640316143632, -0.14277658285573125, 0.22325636135064997, 0.317975226091221, 0.2758862665796187, 0.3982377089560032, -0.4991760579869151, -0.10618037212407216, -0.019418472482357174, 0.1360172781860456, 0.20165289822034538, -0.1105089645498083, -0.2630391619168222, 0.05064114273409359, -0.0694256629794836, 0.0603405530564487, -0.13760869507677853, 0.04535730910720304, 0.0038619436800217954, -0.22517241328023374, -0.07008992950432003, 0.09297177696134895, 0.11892256709268167, -0.013165526266675442, -0.289694887585938, 0.20664903544820845, -0.024072594969766214, -0.04469526489265263, 0.004786777164554223, 0.12097875439212658, -0.13318521669134498, -0.18462325574364513, 0.3554315420333296, 0.012553516775369644, -0.19834372645709664, 0.09342022374039516, 0.11623094091191888, -0.2759618228301406, 0.1338020529365167, 0.29878477548481897, 0.29824059875681996, -0.12718329136259854, 0.04895351533195935, -0.059736548049841076, 0.2768974076025188, 0.05853550066240132, -0.052180625149048865, 0.14961093850433826, 0.24064115673536435, 0.13770881918026134, 0.20629036077298224, 0.04893253017507959, -0.08888907471555285, -0.17050738912075758, -0.0959354218794033, -0.093439898257202, -0.0274507615249604, -0.01252183283213526, -0.1459899615510949, 0.41677075531333685, 0.2369901982601732, 0.05533777171513066, 0.04513521963963285, 0.3483601617626846, 0.09717197349527851, 0.06284196174237877, 0.15943577740108594, 0.14236273158167023, 0.07361542491707951, 0.1873308198119048, -0.20427939272485673, 0.1025407190900296, 0.11057031649397686] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.