id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.02667 | A limit theorem for the six-length of random functional graphs with a
fixed degree sequence | We obtain results on the limiting distribution of the six-length of a random
functional graph, also called a functional digraph or random mapping, with
given in-degree sequence. The six-length of a vertex $v\in V$ is defined from
the associated mapping, $f:V\to V$, to be the maximum $i\in V$ such that the
elements $v, f(v), \ldots, f^{i-1}(v)$ are all distinct. This has relevance to
the study of algorithms for integer factorisation.
| math.CO | we obtain results on the limiting distribution of the sixlength of a random functional graph also called a functional digraph or random mapping with given indegree sequence the sixlength of a vertex vin v is defined from the associated mapping fvto v to be the maximum iin v such that the elements v fv ldots fi1v are all distinct this has relevance to the study of algorithms for integer factorisation | [['we', 'obtain', 'results', 'on', 'the', 'limiting', 'distribution', 'of', 'the', 'sixlength', 'of', 'a', 'random', 'functional', 'graph', 'also', 'called', 'a', 'functional', 'digraph', 'or', 'random', 'mapping', 'with', 'given', 'indegree', 'sequence', 'the', 'sixlength', 'of', 'a', 'vertex', 'vin', 'v', 'is', 'defined', 'from', 'the', 'associated', 'mapping', 'fvto', 'v', 'to', 'be', 'the', 'maximum', 'iin', 'v', 'such', 'that', 'the', 'elements', 'v', 'fv', 'ldots', 'fi1v', 'are', 'all', 'distinct', 'this', 'has', 'relevance', 'to', 'the', 'study', 'of', 'algorithms', 'for', 'integer', 'factorisation']] | [-0.14564781189798864, 0.08145591638176077, -0.04595699661703252, 6.0948105389947325e-05, -0.08026178672548327, -0.1561334132800685, 0.03707081566168579, 0.42387397620660155, -0.3332125555946311, -0.1969685888529491, 0.058142823479902836, -0.3653384511317335, -0.1684670206194104, 0.09538732399232686, -0.049096362422039706, 0.021379739400555393, 0.08250904857500721, 0.1282081089621938, -0.03561325861599797, -0.21189494344358917, 0.3241222671497224, -0.10337570951834543, 0.17237712629139423, 0.026156361610976172, 0.140145357156089, 0.023476835124806236, -0.030329392242954292, 0.09659935689684171, -0.15796267123488492, 0.09864179516183351, 0.2263515262739427, 0.2056840968373885, 0.29752813629917246, -0.3281449680286112, -0.1958458795865525, 0.209817959454411, 0.08399951858133245, -0.002705860855196839, -0.0022866451129345084, -0.25159591261241865, 0.1910671329945882, -0.14160070892722249, -0.07592840015943815, 0.020365946300661388, 0.1393249687919421, 0.11882610315693293, -0.35543714798708903, -0.006689215413100996, 0.0681767309390342, 0.04580945021180964, 0.023325114705558144, -0.19793470251832657, -0.07401049336237805, 0.13010937912014328, -0.040333640931952575, 0.149275142202543, 0.023943474794279284, -0.12711178056492622, -0.12346162596967683, 0.39894356653650304, -0.06506431084682247, -0.1644515966190331, 0.1280517021347004, -0.12745839083539462, -0.15147472539944434, 0.0835438789660806, 0.13062241545586445, 0.11987735792549688, -0.12845955263656467, 0.13962459017925744, -0.09018594930087452, 0.06844720693388537, 0.036440295299320524, 0.04833503198851623, 0.12852002260511491, 0.11110948486976437, 0.12088022305310439, 0.10984851964992652, -0.042427663514981354, 0.05123925227810865, -0.3415054969155966, -0.12048265720203297, -0.2758548942745538, 0.0958271428226813, -0.17077696445022725, -0.18324372583805626, 0.44712090214241795, 0.1252421972397437, 0.242617731079904, 0.083281420796776, 0.18000894587542585, 0.17706825970776324, 0.041763503465857076, 0.10205779442174444, 0.05429611459666335, 0.15767709486909323, -0.007640590703587478, -0.20452169280624322, 0.07124811421676691, 0.14655464581811606] |
1,803.02668 | Systematic parameter study of dynamo bifurcations in geodynamo
simulations | We investigate the nature of the dynamo bifurcation in a configuration
applicable to the Earth's liquid outer core. Numerical studies on the stability
domain of dipolar magnetic fields found a dichotomy between non-reversing
dipole-dominated dynamos and the reversing non-dipole-dominated multipolar
solutions. We show that, by considering weak initial fields, the above
transition disappears and is replaced by a region of bistability. Such a result
was also observed in models with free-slip boundaries in which the geostrophic
zonal flow can develop and participate to the dynamo mechanism for non-dipolar
fields. We show that a similar process develops in no-slip models when viscous
effects are reduced sufficiently.
The following three regimes are distinguished: (i) Close to the onset of
convection ($Ra_c$) with only the most critical convective mode (wave number)
being present, dynamos set in supercritically and are dipole-dominated. (ii) in
the range $3<Ra/Ra_c<Ra_c$, the bifurcations are subcritical and only
dipole-dominated dynamos exist. (iii) $(Ra/Ra_c>10)$, the relative importance
of zonal flows increases with $Ra$ in non-magnetic models. The field topology
depends on the magnitude of the initial magnetic field. The dipolar branch has
a subcritical behavior whereas the multipolar branch has a supercritical
behavior. By approaching more realistic parameters, the extension of this
bistable regime increases. A hysteretic behavior questions the common
interpretation for geomagnetic reversals.
Far above the dynamo threshold (by increasing the magnetic Prandtl number),
Lorentz forces contribute to the first order force balance, as predicted for
planetary dynamos. When $Ra$ is sufficiently high, dipolar fields affect
significantly the flow speed, the flow structure and heat transfer which is
reduced by the Lorentz force regardless of the field strength.
| physics.geo-ph astro-ph.EP | we investigate the nature of the dynamo bifurcation in a configuration applicable to the earths liquid outer core numerical studies on the stability domain of dipolar magnetic fields found a dichotomy between nonreversing dipoledominated dynamos and the reversing nondipoledominated multipolar solutions we show that by considering weak initial fields the above transition disappears and is replaced by a region of bistability such a result was also observed in models with freeslip boundaries in which the geostrophic zonal flow can develop and participate to the dynamo mechanism for nondipolar fields we show that a similar process develops in noslip models when viscous effects are reduced sufficiently the following three regimes are distinguished i close to the onset of convection ra_c with only the most critical convective mode wave number being present dynamos set in supercritically and are dipoledominated ii in the range 3rara_cra_c the bifurcations are subcritical and only dipoledominated dynamos exist iii rara_c10 the relative importance of zonal flows increases with ra in nonmagnetic models the field topology depends on the magnitude of the initial magnetic field the dipolar branch has a subcritical behavior whereas the multipolar branch has a supercritical behavior by approaching more realistic parameters the extension of this bistable regime increases a hysteretic behavior questions the common interpretation for geomagnetic reversals far above the dynamo threshold by increasing the magnetic prandtl number lorentz forces contribute to the first order force balance as predicted for planetary dynamos when ra is sufficiently high dipolar fields affect significantly the flow speed the flow structure and heat transfer which is reduced by the lorentz force regardless of the field strength | [['we', 'investigate', 'the', 'nature', 'of', 'the', 'dynamo', 'bifurcation', 'in', 'a', 'configuration', 'applicable', 'to', 'the', 'earths', 'liquid', 'outer', 'core', 'numerical', 'studies', 'on', 'the', 'stability', 'domain', 'of', 'dipolar', 'magnetic', 'fields', 'found', 'a', 'dichotomy', 'between', 'nonreversing', 'dipoledominated', 'dynamos', 'and', 'the', 'reversing', 'nondipoledominated', 'multipolar', 'solutions', 'we', 'show', 'that', 'by', 'considering', 'weak', 'initial', 'fields', 'the', 'above', 'transition', 'disappears', 'and', 'is', 'replaced', 'by', 'a', 'region', 'of', 'bistability', 'such', 'a', 'result', 'was', 'also', 'observed', 'in', 'models', 'with', 'freeslip', 'boundaries', 'in', 'which', 'the', 'geostrophic', 'zonal', 'flow', 'can', 'develop', 'and', 'participate', 'to', 'the', 'dynamo', 'mechanism', 'for', 'nondipolar', 'fields', 'we', 'show', 'that', 'a', 'similar', 'process', 'develops', 'in', 'noslip', 'models', 'when', 'viscous', 'effects', 'are', 'reduced', 'sufficiently', 'the', 'following', 'three', 'regimes', 'are', 'distinguished', 'i', 'close', 'to', 'the', 'onset', 'of', 'convection', 'ra_c', 'with', 'only', 'the', 'most', 'critical', 'convective', 'mode', 'wave', 'number', 'being', 'present', 'dynamos', 'set', 'in', 'supercritically', 'and', 'are', 'dipoledominated', 'ii', 'in', 'the', 'range', '3rara_cra_c', 'the', 'bifurcations', 'are', 'subcritical', 'and', 'only', 'dipoledominated', 'dynamos', 'exist', 'iii', 'rara_c10', 'the', 'relative', 'importance', 'of', 'zonal', 'flows', 'increases', 'with', 'ra', 'in', 'nonmagnetic', 'models', 'the', 'field', 'topology', 'depends', 'on', 'the', 'magnitude', 'of', 'the', 'initial', 'magnetic', 'field', 'the', 'dipolar', 'branch', 'has', 'a', 'subcritical', 'behavior', 'whereas', 'the', 'multipolar', 'branch', 'has', 'a', 'supercritical', 'behavior', 'by', 'approaching', 'more', 'realistic', 'parameters', 'the', 'extension', 'of', 'this', 'bistable', 'regime', 'increases', 'a', 'hysteretic', 'behavior', 'questions', 'the', 'common', 'interpretation', 'for', 'geomagnetic', 'reversals', 'far', 'above', 'the', 'dynamo', 'threshold', 'by', 'increasing', 'the', 'magnetic', 'prandtl', 'number', 'lorentz', 'forces', 'contribute', 'to', 'the', 'first', 'order', 'force', 'balance', 'as', 'predicted', 'for', 'planetary', 'dynamos', 'when', 'ra', 'is', 'sufficiently', 'high', 'dipolar', 'fields', 'affect', 'significantly', 'the', 'flow', 'speed', 'the', 'flow', 'structure', 'and', 'heat', 'transfer', 'which', 'is', 'reduced', 'by', 'the', 'lorentz', 'force', 'regardless', 'of', 'the', 'field', 'strength']] | [-0.2076102088987162, 0.2373104248286918, -0.019290243895178225, 0.0849565275478137, -0.068051183927118, -0.08567069552460671, 0.01634639360210193, 0.3011306215679847, -0.250211719176697, -0.3009710885213226, 0.07400338792923096, -0.21308449580495184, -0.12949315667033365, 0.20925871649743022, 0.0006460445578327347, -0.014365522109962916, 0.026855060391310127, 0.01677481227736444, -0.008095887372326246, -0.1574996831871506, 0.33068786237977055, 0.0312268428195485, 0.27367758883961607, 0.012276972858480326, 0.030466224886196897, -0.09260740232324802, 0.06196397725694911, 0.06449644583718557, -0.16263936356059494, 0.005715935068254016, 0.18307731547787612, 0.012529513242398914, 0.25471565591721074, -0.45871727703195203, -0.25809754258287804, 0.06057340174360215, 0.1791321970194165, 0.10310587067335591, -0.03354431466234251, -0.23112135399413064, 0.07669582703156061, -0.13067108476394437, -0.14587455049255177, -0.06158579309747547, 0.0464712599247757, 0.0691681695300902, -0.3041655444428482, 0.10357527872379012, 0.1201217970190733, 0.12756199352845857, -0.1112416375785562, -0.06856476394739702, -0.07233020358218259, 0.10631971943119534, 0.11313830155000017, 0.05314368090095153, 0.1685715874016313, -0.21237372952912534, -0.04397023645320669, 0.35393450227811146, -0.06290898175955631, -0.16514553311298413, 0.22705327857222715, -0.2207296435113758, -0.05954626732076084, 0.17526560689889847, 0.1624119927856329, 0.10745926094381489, -0.05182592979438876, 0.056352035906183345, -0.019393049796666385, 0.13503466153918253, 0.07218641214618894, -0.0622571259238092, 0.2334825073750042, 0.18184397461354956, 0.07264902236122162, 0.11889506357413877, -0.12908121513355308, -0.12094330218186448, -0.279579270937431, -0.07953839318470546, -0.12171491948549401, 0.02182301007887599, -0.09813728912602637, -0.16371611799673647, 0.37361425026565004, 0.14323363694164523, 0.16040888013269164, -0.00497739560397944, 0.26932306341910944, 0.13658035791894163, 0.05324471419628121, 0.12935783328397438, 0.34889087820761744, 0.1984181356549795, 0.15878352953499197, -0.2799756621775179, 0.06921184946313724, 0.06333311582579368] |
1,803.02669 | Study on Dynamics of an Elastic Oscillator Coupled with a Rocking Wall | This paper studies the dynamics of an elastic single degree of freedom
oscillator (representing an elastic frame) coupled with a rocking wall. Two
types of rocking walls namely stepping rocking wall and pinned rocking wall are
presented and analyzed. For each case, full nonlinear equations of motions are
calculated. The dynamic behavior of the systems shows mixed results in
suppressing the dynamic response of the elastic oscillator. Through
comprehensive analysis, pinned rocking wall amplifies the displacement along
wide range of the spectrum, in the other hand, stepping rocking wall is the
most effective especially in relatively flexible structures and with a heavier
wall. This is mainly because of the pinned wall's mass works against its
stability. In this study, a simple, oscillator-rocking-wall model is defined
and analyzed using OpenSees and, the results from OpenSees shows a good
agreement with equation of motion solution using MATLAB.
| physics.geo-ph | this paper studies the dynamics of an elastic single degree of freedom oscillator representing an elastic frame coupled with a rocking wall two types of rocking walls namely stepping rocking wall and pinned rocking wall are presented and analyzed for each case full nonlinear equations of motions are calculated the dynamic behavior of the systems shows mixed results in suppressing the dynamic response of the elastic oscillator through comprehensive analysis pinned rocking wall amplifies the displacement along wide range of the spectrum in the other hand stepping rocking wall is the most effective especially in relatively flexible structures and with a heavier wall this is mainly because of the pinned walls mass works against its stability in this study a simple oscillatorrockingwall model is defined and analyzed using opensees and the results from opensees shows a good agreement with equation of motion solution using matlab | [['this', 'paper', 'studies', 'the', 'dynamics', 'of', 'an', 'elastic', 'single', 'degree', 'of', 'freedom', 'oscillator', 'representing', 'an', 'elastic', 'frame', 'coupled', 'with', 'a', 'rocking', 'wall', 'two', 'types', 'of', 'rocking', 'walls', 'namely', 'stepping', 'rocking', 'wall', 'and', 'pinned', 'rocking', 'wall', 'are', 'presented', 'and', 'analyzed', 'for', 'each', 'case', 'full', 'nonlinear', 'equations', 'of', 'motions', 'are', 'calculated', 'the', 'dynamic', 'behavior', 'of', 'the', 'systems', 'shows', 'mixed', 'results', 'in', 'suppressing', 'the', 'dynamic', 'response', 'of', 'the', 'elastic', 'oscillator', 'through', 'comprehensive', 'analysis', 'pinned', 'rocking', 'wall', 'amplifies', 'the', 'displacement', 'along', 'wide', 'range', 'of', 'the', 'spectrum', 'in', 'the', 'other', 'hand', 'stepping', 'rocking', 'wall', 'is', 'the', 'most', 'effective', 'especially', 'in', 'relatively', 'flexible', 'structures', 'and', 'with', 'a', 'heavier', 'wall', 'this', 'is', 'mainly', 'because', 'of', 'the', 'pinned', 'walls', 'mass', 'works', 'against', 'its', 'stability', 'in', 'this', 'study', 'a', 'simple', 'oscillatorrockingwall', 'model', 'is', 'defined', 'and', 'analyzed', 'using', 'opensees', 'and', 'the', 'results', 'from', 'opensees', 'shows', 'a', 'good', 'agreement', 'with', 'equation', 'of', 'motion', 'solution', 'using', 'matlab']] | [-0.15723937774129526, 0.11744949393631057, -0.08750555479471099, -0.02799374684789808, -0.06578550765349885, -0.1505583624624398, -0.0030722332647739265, 0.39121381983711895, -0.2661750812229412, -0.2520185266162308, 0.09117809233163864, -0.2582048061566139, -0.11647721647586622, 0.2202493427239332, -0.02883721423059912, 0.03979317931840393, 0.06268922657653375, 0.009171507377046305, -0.012062765642325066, -0.12930660080295844, 0.2342250712911113, 0.023152308197508395, 0.31994997772460304, 0.031745751467074305, 0.08319392482238547, 0.03318781587688751, 0.0023136239229950687, 0.07176390507350296, -0.1495119860448258, 0.10086485879285864, 0.168264925470051, -0.051680582103280116, 0.2309292675796109, -0.443451486121286, -0.218771300934465, 0.04438268529041342, 0.16256877596975422, 0.12960555674639387, -0.044693209335837564, -0.28448127258509975, 0.031148509797968075, -0.1243805548687126, -0.18853471359310994, -0.035576538012271196, 0.026448703964542544, 0.08100768254453343, -0.19484057807376687, 0.12577427611387051, 0.050747341233712266, 0.11666536665009991, -0.13113545183941697, -0.06629687086941385, -0.0710744863231732, 0.08933634772686891, 0.06273636574656899, 0.027452519623411845, 0.17351390483041465, -0.15461566966046697, -0.10719515969747231, 0.42463887135275236, -0.06793784232757671, -0.2380186435045071, 0.20999012312943666, -0.11942109493801081, -0.0399025089507529, 0.16713455240045424, 0.15734653596677753, 0.13689122801895817, -0.16114911063521786, 0.033537762480194376, -0.019610595898407603, 0.18242248566657251, 0.0793835317689768, -0.04083953908047988, 0.20441846148124043, 0.2726213160613683, 0.01928727312380789, 0.19016231935263062, -0.09943536958250572, -0.15093757256432633, -0.3034936533716153, -0.10647880068396441, -0.14357090672530548, -0.02592637123864695, -0.07491773319326941, -0.18048019642846555, 0.40277783741230067, 0.07734309510954222, 0.18459287575039435, 0.021178109576256657, 0.30226390777339396, 0.09846485532413592, 0.03533609695142319, 0.053662718381916344, 0.2600767239206799, 0.14693449494514194, 0.13262867357608088, -0.2698219748964848, 0.026905352731799365, -0.001911735201490597] |
1,803.0267 | Bayesian Unmixing using Sparse Dirichlet Prior with Polynomial
Post-nonlinear Mixing Model | A sparse Dirichlet prior is proposed for estimating the abundance vector of
hyperspectral images with a nonlinear mixing model. This sparse prior is led to
an unmixing procedure in a semi-supervised scenario in which exact materials
are unknown. The nonlinear model is a polynomial post-nonlinear mixing model
that represents each hyperspectral pixel as a nonlinear function of pure
spectral signatures corrupted by additive white noise. Simulation results show
more than 50% improvement in the estimation error.
| eess.SP | a sparse dirichlet prior is proposed for estimating the abundance vector of hyperspectral images with a nonlinear mixing model this sparse prior is led to an unmixing procedure in a semisupervised scenario in which exact materials are unknown the nonlinear model is a polynomial postnonlinear mixing model that represents each hyperspectral pixel as a nonlinear function of pure spectral signatures corrupted by additive white noise simulation results show more than 50 improvement in the estimation error | [['a', 'sparse', 'dirichlet', 'prior', 'is', 'proposed', 'for', 'estimating', 'the', 'abundance', 'vector', 'of', 'hyperspectral', 'images', 'with', 'a', 'nonlinear', 'mixing', 'model', 'this', 'sparse', 'prior', 'is', 'led', 'to', 'an', 'unmixing', 'procedure', 'in', 'a', 'semisupervised', 'scenario', 'in', 'which', 'exact', 'materials', 'are', 'unknown', 'the', 'nonlinear', 'model', 'is', 'a', 'polynomial', 'postnonlinear', 'mixing', 'model', 'that', 'represents', 'each', 'hyperspectral', 'pixel', 'as', 'a', 'nonlinear', 'function', 'of', 'pure', 'spectral', 'signatures', 'corrupted', 'by', 'additive', 'white', 'noise', 'simulation', 'results', 'show', 'more', 'than', '50', 'improvement', 'in', 'the', 'estimation', 'error']] | [-0.039933334060295145, 0.04828459201062766, -0.05843534818115203, 0.04288764466304871, -0.08529311312687289, -0.18315195808750823, -0.010349808478311292, 0.40324824528866693, -0.26827735043326884, -0.3000232372126591, 0.10844804099791586, -0.2613532380691092, -0.19170363790257589, 0.1429823527532311, -0.1348492967479519, 0.12416391875931847, 0.11285516080495558, 0.010739500302741746, -0.08154275210414964, -0.25422928891585844, 0.25013735867105424, 0.06536082305185693, 0.24957189490822584, -0.09996165887232085, 0.12208440975825254, -0.04217312755185718, -0.07495733013523645, -0.046257890304427986, -0.0385248867193073, 0.10784816636556857, 0.29300777908218534, 0.11210057353845944, 0.31657982286752057, -0.32519768552830147, -0.33351697548488646, 0.14894103055427732, 0.11182290638527392, 0.10010305987395297, -0.07467760833529419, -0.3032327848609145, 0.0788631163350625, -0.14454625569602572, -0.01152830771446277, -0.04852112760081103, -0.026000079507388075, -0.06946517491412937, -0.4399780828603788, 0.15074953685612663, 0.0715910141037679, 0.030965419339114113, -0.08810940609730192, -0.17966477805748582, 0.027468879290513303, 0.04227648030255774, 0.0022805689107994304, 0.02358676578181698, 0.08925283105284172, -0.16772699455032125, -0.09235272361700864, 0.33703876022742696, -0.1272580937681931, -0.25832146224964064, 0.12389283876032814, -0.07109560226212795, -0.12235611977398787, 0.17932601143777566, 0.19248219946472855, 0.1085100309359596, -0.16806505906003477, 0.07748068942026676, -0.10207908178410052, 0.21031442720835147, 0.028085165503925008, -0.003930172509219693, 0.13868057547676327, 0.2484191087025561, 0.09460600317872472, 0.136589425925386, -0.15771382435923442, -0.0393560658466365, -0.25556701112930713, -0.10828165618525083, -0.2438868151971531, -0.004091028981891118, -0.16923698401660658, -0.21273683489447362, 0.41237994229519054, 0.18176187951068737, 0.22437412957170685, 0.04057447378382724, 0.37405831001600937, 0.11365780057722556, 0.004901447045420737, 0.03655884085884808, 0.17360858711119936, 0.16727011008065587, 0.06212964256012224, -0.16740306547083156, 0.10026719258473206, 0.01744808664998824] |
1,803.02671 | Negative immersions for one-relator groups | We prove a freeness theorem for low-rank subgroups of one-relator groups. Let
$F$ be a free group, and let $w\in F$ be a non-primitive element. The
primitivity rank of $w$, $\pi(w)$, is the smallest rank of a subgroup of $F$
containing $w$ as an imprimitive element. Then any subgroup of the one-relator
group $G=F/\langle\langle w\rangle\rangle$ generated by fewer than $\pi(w)$
elements is free. In particular, if $\pi(w)>2$ then $G$ doesn't contain any
Baumslag--Solitar groups.
The hypothesis that $\pi(w)>2$ implies that the presentation complex $X$ of
the one-relator group $G$ has negative immersions: if a compact, connected
complex $Y$ immerses into $X$ and $\chi(Y)\geq 0$ then $Y$ is Nielsen
equivalent to a graph.
The freeness theorem is a consequence of a dependence theorem for free
groups, which implies several classical facts about free and one-relator
groups, including Magnus' Freiheitssatz and theorems of Lyndon, Baumslag,
Stallings and Duncan--Howie. The dependence theorem strengthens Wise's
$w$-cycles conjecture, proved independently by the authors and Helfer--Wise,
which implies that the one-relator complex $X$ has non-positive immersions when
$\pi(w)>1$.
| math.GR math.GT | we prove a freeness theorem for lowrank subgroups of onerelator groups let f be a free group and let win f be a nonprimitive element the primitivity rank of w piw is the smallest rank of a subgroup of f containing w as an imprimitive element then any subgroup of the onerelator group gflanglelangle wranglerangle generated by fewer than piw elements is free in particular if piw2 then g doesnt contain any baumslagsolitar groups the hypothesis that piw2 implies that the presentation complex x of the onerelator group g has negative immersions if a compact connected complex y immerses into x and chiygeq 0 then y is nielsen equivalent to a graph the freeness theorem is a consequence of a dependence theorem for free groups which implies several classical facts about free and onerelator groups including magnus freiheitssatz and theorems of lyndon baumslag stallings and duncanhowie the dependence theorem strengthens wises wcycles conjecture proved independently by the authors and helferwise which implies that the onerelator complex x has nonpositive immersions when piw1 | [['we', 'prove', 'a', 'freeness', 'theorem', 'for', 'lowrank', 'subgroups', 'of', 'onerelator', 'groups', 'let', 'f', 'be', 'a', 'free', 'group', 'and', 'let', 'win', 'f', 'be', 'a', 'nonprimitive', 'element', 'the', 'primitivity', 'rank', 'of', 'w', 'piw', 'is', 'the', 'smallest', 'rank', 'of', 'a', 'subgroup', 'of', 'f', 'containing', 'w', 'as', 'an', 'imprimitive', 'element', 'then', 'any', 'subgroup', 'of', 'the', 'onerelator', 'group', 'gflanglelangle', 'wranglerangle', 'generated', 'by', 'fewer', 'than', 'piw', 'elements', 'is', 'free', 'in', 'particular', 'if', 'piw2', 'then', 'g', 'doesnt', 'contain', 'any', 'baumslagsolitar', 'groups', 'the', 'hypothesis', 'that', 'piw2', 'implies', 'that', 'the', 'presentation', 'complex', 'x', 'of', 'the', 'onerelator', 'group', 'g', 'has', 'negative', 'immersions', 'if', 'a', 'compact', 'connected', 'complex', 'y', 'immerses', 'into', 'x', 'and', 'chiygeq', '0', 'then', 'y', 'is', 'nielsen', 'equivalent', 'to', 'a', 'graph', 'the', 'freeness', 'theorem', 'is', 'a', 'consequence', 'of', 'a', 'dependence', 'theorem', 'for', 'free', 'groups', 'which', 'implies', 'several', 'classical', 'facts', 'about', 'free', 'and', 'onerelator', 'groups', 'including', 'magnus', 'freiheitssatz', 'and', 'theorems', 'of', 'lyndon', 'baumslag', 'stallings', 'and', 'duncanhowie', 'the', 'dependence', 'theorem', 'strengthens', 'wises', 'wcycles', 'conjecture', 'proved', 'independently', 'by', 'the', 'authors', 'and', 'helferwise', 'which', 'implies', 'that', 'the', 'onerelator', 'complex', 'x', 'has', 'nonpositive', 'immersions', 'when', 'piw1']] | [-0.18487430934044646, 0.14372500164298377, -0.1438339488274168, 0.05492666303804826, -0.11478970375440152, -0.17038687929034052, 0.02727782608381836, 0.34899137780161166, -0.3205198590280261, -0.22303175785498575, 0.09061385141742392, -0.2791478967552482, -0.08775227792311187, 0.20761496605487859, -0.16456654605387552, -0.0891903532617839, 0.07038420778358491, 0.1423681808817314, -0.07723727098257258, -0.2892289187905745, 0.3655201243605783, -0.10194222256541252, 0.18974832951931692, 0.06549012778247366, 0.11397736634925666, 0.04112975369704456, -0.014680227435125811, -0.007638123973908766, -0.12888688518872118, 0.08882735829045088, 0.2772232241610565, 0.07887865726058031, 0.27453666428180706, -0.3139877248010257, -0.17827941886881912, 0.2599083038910133, 0.09981036425224596, -0.0626442939307109, -0.05571984919497925, -0.27377415590255133, 0.18561221221916196, -0.17158665703240464, -0.15614820890577238, -0.01729128236041927, 0.13786434751463963, -0.012206104038873823, -0.24746952775337666, 0.028771256954159316, 0.16931677305014667, 0.092830890233106, 0.0021070334038174733, -0.13011475615544107, -0.08242915355225616, 0.11111551006100986, 0.010641706096599014, 0.0655811910983175, 0.10127580740273272, -0.04538290436300108, -0.1217541838087505, 0.40534146960608936, -0.0551402750897978, -0.1887462259292966, 0.10551164430997721, -0.1746272715206099, -0.21252765327623888, 0.13036381649904, 0.02939374100916633, 0.14975685599045657, -0.0051426832474911555, 0.2389719402623397, -0.19949029656922126, 0.1356832933521307, 0.12579775673178276, -0.05804267353321448, 0.04720429348242583, 0.03390646883479615, 0.11373318216150127, 0.10417876202505218, 0.10853519243161228, 0.12013150217837126, -0.33305649277072674, -0.228295140922433, -0.1327996790570934, 0.1812368365027374, -0.1283647373040766, -0.18835716657397314, 0.35066578679763505, 0.019519839277874294, 0.08806371329374975, 0.12766410844690143, 0.16768387269523993, 0.030429955572599726, 0.05801991047053712, 0.10976881672991667, 0.023171893082468246, 0.2998779196343271, -0.1399301076805675, -0.09711462490135668, 0.013009487672583996, 0.2559325513302167] |
1,803.02672 | Fractional Fokker-Planck Equation with General Confinement Force | This article studies a Fokker-Planck type equation of fractional diffusion
with conservative drift $\partial$f/$\partial$t = $\Delta$^($\alpha$/2) f +
div(Ef), where $\Delta$^($\alpha$/2) denotes the fractional Laplacian and E is
a confining force field. The main interest of the present paper is that it
applies to a wide variety of force fields, with a few local regularity and a
polynomial growth at infinity. We first prove the existence and uniqueness of a
solution in weighted Lebesgue spaces depending on E under the form of a
strongly continuous semigroup. We also prove the existence and uniqueness of a
stationary state, by using an appropriate splitting of the fractional Laplacian
and by proving a weak and strong maximum principle. We then study the rate of
convergence to equilibrium of the solution. The semigroup has a property of
regularization in fractional Sobolev spaces, as well as a gain of integrability
and positivity which we use to obtain polynomial or exponential convergence to
equilibrium in weighted Lebesgue spaces. Mathematics Subject Classification
(2000): 47D06 One-parameter semi-groups and linear evolution equations [See
also 34G10, 34K30], 35P15 Estimation of eigenvalues, upper and lower bounds
[See also 35P05, 45C05, 47A10], 35B40 Partial differential equations,
Asymptotic behavior of solutions [see also 45C05, 45K05, 35410],
| math.AP math.DS math.FA | this article studies a fokkerplanck type equation of fractional diffusion with conservative drift partialfpartialt deltaalpha2 f divef where deltaalpha2 denotes the fractional laplacian and e is a confining force field the main interest of the present paper is that it applies to a wide variety of force fields with a few local regularity and a polynomial growth at infinity we first prove the existence and uniqueness of a solution in weighted lebesgue spaces depending on e under the form of a strongly continuous semigroup we also prove the existence and uniqueness of a stationary state by using an appropriate splitting of the fractional laplacian and by proving a weak and strong maximum principle we then study the rate of convergence to equilibrium of the solution the semigroup has a property of regularization in fractional sobolev spaces as well as a gain of integrability and positivity which we use to obtain polynomial or exponential convergence to equilibrium in weighted lebesgue spaces mathematics subject classification 2000 47d06 oneparameter semigroups and linear evolution equations see also 34g10 34k30 35p15 estimation of eigenvalues upper and lower bounds see also 35p05 45c05 47a10 35b40 partial differential equations asymptotic behavior of solutions see also 45c05 45k05 35410 | [['this', 'article', 'studies', 'a', 'fokkerplanck', 'type', 'equation', 'of', 'fractional', 'diffusion', 'with', 'conservative', 'drift', 'partialfpartialt', 'deltaalpha2', 'f', 'divef', 'where', 'deltaalpha2', 'denotes', 'the', 'fractional', 'laplacian', 'and', 'e', 'is', 'a', 'confining', 'force', 'field', 'the', 'main', 'interest', 'of', 'the', 'present', 'paper', 'is', 'that', 'it', 'applies', 'to', 'a', 'wide', 'variety', 'of', 'force', 'fields', 'with', 'a', 'few', 'local', 'regularity', 'and', 'a', 'polynomial', 'growth', 'at', 'infinity', 'we', 'first', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'a', 'solution', 'in', 'weighted', 'lebesgue', 'spaces', 'depending', 'on', 'e', 'under', 'the', 'form', 'of', 'a', 'strongly', 'continuous', 'semigroup', 'we', 'also', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'a', 'stationary', 'state', 'by', 'using', 'an', 'appropriate', 'splitting', 'of', 'the', 'fractional', 'laplacian', 'and', 'by', 'proving', 'a', 'weak', 'and', 'strong', 'maximum', 'principle', 'we', 'then', 'study', 'the', 'rate', 'of', 'convergence', 'to', 'equilibrium', 'of', 'the', 'solution', 'the', 'semigroup', 'has', 'a', 'property', 'of', 'regularization', 'in', 'fractional', 'sobolev', 'spaces', 'as', 'well', 'as', 'a', 'gain', 'of', 'integrability', 'and', 'positivity', 'which', 'we', 'use', 'to', 'obtain', 'polynomial', 'or', 'exponential', 'convergence', 'to', 'equilibrium', 'in', 'weighted', 'lebesgue', 'spaces', 'mathematics', 'subject', 'classification', '2000', '47d06', 'oneparameter', 'semigroups', 'and', 'linear', 'evolution', 'equations', 'see', 'also', '34g10', '34k30', '35p15', 'estimation', 'of', 'eigenvalues', 'upper', 'and', 'lower', 'bounds', 'see', 'also', '35p05', '45c05', '47a10', '35b40', 'partial', 'differential', 'equations', 'asymptotic', 'behavior', 'of', 'solutions', 'see', 'also', '45c05', '45k05', '35410']] | [-0.11760016640479815, 0.05950600245512063, -0.10352224689299003, 0.08186939317222804, -0.09756689896172982, -0.10638393921420929, 0.022615847548722548, 0.2873060285495198, -0.3224488195041789, -0.22195870689354202, 0.1619653113915813, -0.2740318949700908, -0.12985891869484864, 0.16929648883833967, -0.07055353793375035, 0.09230408571819042, 0.03694060104626647, 0.057530357973016005, -0.0930373983128254, -0.23664202558946737, 0.3634712523805532, -0.024115262679418825, 0.22231764740563256, 0.06615908954266528, 0.13871612696706545, -0.03364774082698166, -0.004625156303208837, 0.008412229689828892, -0.22275715756145376, 0.10235578732371846, 0.20248460790149847, 0.06265882787076717, 0.35019833076883977, -0.37382450189560334, -0.18241579285723733, 0.1772311490779604, 0.12903974190084364, 0.027937789377632572, -0.05315314961456139, -0.2830088277188863, 0.07778577486231447, -0.1311373423953402, -0.1791760983748084, -0.08856455760542303, 0.06671556363568364, 0.09796143146237962, -0.33016044349766316, 0.1096177648479228, 0.1384528605217867, 0.05797823127888594, -0.120859051549292, -0.07934283806962218, -0.02844097907778787, 0.03350795477881354, 0.042702134748167815, 0.02187468334499925, 0.06601762669557269, -0.09948793431481426, -0.11562196398711208, 0.3298309376423663, -0.12808273610797652, -0.2628557199793075, 0.14756510045101984, -0.1838536092477722, -0.12010109040048964, 0.1025637216591078, 0.1584243673182271, 0.1612557227961085, -0.12386882096340761, 0.16315515582948834, -0.07011020544419769, 0.11018973768520307, 0.10480241476498703, 0.041384601207608555, 0.06223474324438127, 0.11835238742245797, 0.21087714189544637, 0.14550821661225896, -0.010584797570389012, -0.10069800915594083, -0.36361604453896745, -0.16956322806382038, -0.16344524024331825, 0.14264665879903637, -0.1266064376043474, -0.2132059057841345, 0.3649261096762394, 0.10103965573944151, 0.16855259107405993, 0.10551900431536079, 0.2029733259671744, 0.19480412067137065, -0.04976980871535798, 0.07904820895004996, 0.1828398028527327, 0.22097144443838995, 0.12305839037265073, -0.20108291160741307, 0.02945611594452899, 0.1723185045201272] |
1,803.02673 | Quantum Earth mover's distance, No-go Quantum Kantorovich-Rubinstein
theorem, and Quantum Marginal Problem | The earth mover's distance is a measure of the distance between two
probabilistic measures. It plays a fundamental role in mathematics and computer
science. The Kantorovich-Rubinstein theorem provides a formula for the earth
mover's distance on the space of regular probability Borel measures on a
compact metric space. In this paper, we investigate the quantum earth mover's
distance. We show a no-go Kantorovich-Rubinstein theorem in the quantum
setting. More precisely, we show that the trace distance between two quantum
states can not be determined by their earth mover's distance. The technique
here is to track the bipartite quantum marginal problem. Then we provide
inequality to describe the structure of quantum coupling, which can be regarded
as quantum generalization of Kantorovich-Rubinstein theorem. After that, we
generalize it to obtain into the tripartite version, and build a new class of
necessary criteria for the tripartite marginal problem.
| quant-ph | the earth movers distance is a measure of the distance between two probabilistic measures it plays a fundamental role in mathematics and computer science the kantorovichrubinstein theorem provides a formula for the earth movers distance on the space of regular probability borel measures on a compact metric space in this paper we investigate the quantum earth movers distance we show a nogo kantorovichrubinstein theorem in the quantum setting more precisely we show that the trace distance between two quantum states can not be determined by their earth movers distance the technique here is to track the bipartite quantum marginal problem then we provide inequality to describe the structure of quantum coupling which can be regarded as quantum generalization of kantorovichrubinstein theorem after that we generalize it to obtain into the tripartite version and build a new class of necessary criteria for the tripartite marginal problem | [['the', 'earth', 'movers', 'distance', 'is', 'a', 'measure', 'of', 'the', 'distance', 'between', 'two', 'probabilistic', 'measures', 'it', 'plays', 'a', 'fundamental', 'role', 'in', 'mathematics', 'and', 'computer', 'science', 'the', 'kantorovichrubinstein', 'theorem', 'provides', 'a', 'formula', 'for', 'the', 'earth', 'movers', 'distance', 'on', 'the', 'space', 'of', 'regular', 'probability', 'borel', 'measures', 'on', 'a', 'compact', 'metric', 'space', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'quantum', 'earth', 'movers', 'distance', 'we', 'show', 'a', 'nogo', 'kantorovichrubinstein', 'theorem', 'in', 'the', 'quantum', 'setting', 'more', 'precisely', 'we', 'show', 'that', 'the', 'trace', 'distance', 'between', 'two', 'quantum', 'states', 'can', 'not', 'be', 'determined', 'by', 'their', 'earth', 'movers', 'distance', 'the', 'technique', 'here', 'is', 'to', 'track', 'the', 'bipartite', 'quantum', 'marginal', 'problem', 'then', 'we', 'provide', 'inequality', 'to', 'describe', 'the', 'structure', 'of', 'quantum', 'coupling', 'which', 'can', 'be', 'regarded', 'as', 'quantum', 'generalization', 'of', 'kantorovichrubinstein', 'theorem', 'after', 'that', 'we', 'generalize', 'it', 'to', 'obtain', 'into', 'the', 'tripartite', 'version', 'and', 'build', 'a', 'new', 'class', 'of', 'necessary', 'criteria', 'for', 'the', 'tripartite', 'marginal', 'problem']] | [-0.08948726863038309, 0.12856589130382856, -0.15417838921641996, 0.14485056194524956, -0.05596068617084931, -0.13970387137398638, 0.06851286930754652, 0.3633898246904899, -0.31687754901318715, -0.2632824508023673, 0.06949990455880119, -0.2628927919628291, -0.1780710622025975, 0.21921998449312202, -0.11494251098162656, 0.039613334529487225, 0.05748442004691681, 0.09662034984152154, -0.10332296271969019, -0.2025330986040805, 0.3099347736750697, 0.031472252522884256, 0.255474336827495, 0.09338720544434057, 0.10716180083630927, 0.029821671715712754, 0.005261473139298373, 0.012420569933099864, -0.1720698445655028, 0.15474971890216693, 0.23973585760285115, 0.19972694092911894, 0.2721499954205777, -0.35588300204996404, -0.17481253829881035, 0.15174999211690035, 0.0516279554251453, 0.09944234143958652, -0.007814006273462116, -0.332680977489157, 0.06900217211323566, -0.16270617873504245, -0.13527897405277553, -0.047095527898134856, 0.03985048714896728, -0.07816158658985434, -0.22770304211278863, 0.07776177364626322, 0.1053061447844937, 0.034690951826231525, -0.01595087511272266, -0.043780825139376624, 0.0371300569317978, 0.1588794100098312, -0.015610461794482222, 0.04706167851028771, 0.09315293461469741, -0.03971406182852285, -0.15268432656624195, 0.37859885122241643, -0.048684197323846407, -0.228307036834504, 0.1644591440438646, -0.10698722227444422, -0.12579193551350257, -0.04235435730360192, 0.17696212984878443, 0.13717014140866954, -0.1443976956295203, 0.11248202790136866, -0.07601416118699929, 0.11707961235500487, 0.10211476881121254, 0.1134693393933362, 0.22439939809385046, 0.0858032719232142, 0.16964494395872642, 0.17180928564309303, -0.09120363409727297, -0.129612754436274, -0.28094526422691757, -0.24247454957201564, -0.2489455556400634, 0.09095965801298635, -0.11063162016758599, -0.17673837731367556, 0.3416109241288284, 0.13792756523872757, 0.161371298204979, 0.0756747507144986, 0.23670520666858247, 0.0927936389343813, 0.021776784122856295, 0.08680440829906227, 0.2533865843662703, 0.17781865342584408, 0.036260742398685424, -0.17319343760689912, 0.05254812760535499, 0.17951141675484591] |
1,803.02674 | Massive electrodynamics for London's superconductivity and Josephson
effect | Massive electrodynamics for London's superconductivity and Josephson effect
are derived. The propagation of massive boson inside a medium yields electric
phenomena that are reflected in the Josephson effect. Critical force, magnetic
field and temperature are found to be related to the critical current of the
junction. The mass of the boson depends only on the critical current of the
junction. The electromagnetic interaction between the Cooper pairs in the two
sides of the superconductor in the josephson junction is mediated by a massive
boson. The propagation of the electromagnetic waves mediated by the massive
bosons gives rise to the electric properties of the Josephson junction. Of
these properties are a quantized resistance of Hall type corresponding to a
non-quantized magnetic flux, and a quantized capacitance. A non zero magnetic
flux encompassing a magnetic charge is found to arise despite the fact that it
is not a priori assumed.
| physics.gen-ph | massive electrodynamics for londons superconductivity and josephson effect are derived the propagation of massive boson inside a medium yields electric phenomena that are reflected in the josephson effect critical force magnetic field and temperature are found to be related to the critical current of the junction the mass of the boson depends only on the critical current of the junction the electromagnetic interaction between the cooper pairs in the two sides of the superconductor in the josephson junction is mediated by a massive boson the propagation of the electromagnetic waves mediated by the massive bosons gives rise to the electric properties of the josephson junction of these properties are a quantized resistance of hall type corresponding to a nonquantized magnetic flux and a quantized capacitance a non zero magnetic flux encompassing a magnetic charge is found to arise despite the fact that it is not a priori assumed | [['massive', 'electrodynamics', 'for', 'londons', 'superconductivity', 'and', 'josephson', 'effect', 'are', 'derived', 'the', 'propagation', 'of', 'massive', 'boson', 'inside', 'a', 'medium', 'yields', 'electric', 'phenomena', 'that', 'are', 'reflected', 'in', 'the', 'josephson', 'effect', 'critical', 'force', 'magnetic', 'field', 'and', 'temperature', 'are', 'found', 'to', 'be', 'related', 'to', 'the', 'critical', 'current', 'of', 'the', 'junction', 'the', 'mass', 'of', 'the', 'boson', 'depends', 'only', 'on', 'the', 'critical', 'current', 'of', 'the', 'junction', 'the', 'electromagnetic', 'interaction', 'between', 'the', 'cooper', 'pairs', 'in', 'the', 'two', 'sides', 'of', 'the', 'superconductor', 'in', 'the', 'josephson', 'junction', 'is', 'mediated', 'by', 'a', 'massive', 'boson', 'the', 'propagation', 'of', 'the', 'electromagnetic', 'waves', 'mediated', 'by', 'the', 'massive', 'bosons', 'gives', 'rise', 'to', 'the', 'electric', 'properties', 'of', 'the', 'josephson', 'junction', 'of', 'these', 'properties', 'are', 'a', 'quantized', 'resistance', 'of', 'hall', 'type', 'corresponding', 'to', 'a', 'nonquantized', 'magnetic', 'flux', 'and', 'a', 'quantized', 'capacitance', 'a', 'non', 'zero', 'magnetic', 'flux', 'encompassing', 'a', 'magnetic', 'charge', 'is', 'found', 'to', 'arise', 'despite', 'the', 'fact', 'that', 'it', 'is', 'not', 'a', 'priori', 'assumed']] | [-0.2745905290420696, 0.22885989846513807, -0.012496270396671182, 0.06237149884770121, -0.09357180700297593, -0.1320026854204165, 0.0461801955212109, 0.30786296951811054, -0.21786057970461412, -0.2879760691501213, -0.0339328712977255, -0.29123065173877655, -0.1012621999378442, 0.22072087630717638, 0.04060227737283787, -0.015291826944244472, -0.034707495038133314, 0.061755540887699335, -0.04597183567081654, -0.18323912470588913, 0.3495967863316371, -0.010477597253771525, 0.33459652716772176, 0.08545379200950265, 0.06323666726176098, -0.04471883899846894, 0.07145414730326298, 0.060412922429669697, -0.08230412010517604, 0.02640366107005173, 0.16321628912693406, -0.06479704531060683, 0.17636523385079125, -0.4683451260742102, -0.18414639674026417, 0.06811103563931947, 0.15151284182620411, 0.15170443792374352, -0.05215917997269866, -0.3100427563390317, 0.06197385617053589, -0.1221204393376546, -0.11125239105643453, 0.024904801296321926, 0.008990630171595243, 0.02716425877077052, -0.2777782107319532, 0.11371811551539027, 0.028932576116514265, 0.02687367286558288, -0.03293524279473098, -0.06269139691878967, -0.08739655053029088, 0.04412977116786548, 0.08532020334324271, 0.06461920369278036, 0.1966811664578681, -0.2094784369566352, -0.09449404535022236, 0.3187188491307048, -0.04210984800640192, -0.16305321389557542, 0.16650884140226235, -0.18147216278334413, -0.011786449548782076, 0.17041392642233796, 0.11689516584187545, 0.061160651301474286, -0.18911754254981675, 0.087170804742601, -0.022786296142667934, 0.11280380305834115, 0.03231953009270836, 0.09269115199473359, 0.3442237870327222, 0.19031196703656098, 0.017696868772996036, 0.12474902970260135, -0.11758564798180265, -0.058660213086703744, -0.3154774933826883, -0.17579631657753378, -0.17270598512746999, 0.10252733077514505, -0.03259706039583811, -0.23326960915221354, 0.3931446335014157, 0.18485956446494203, 0.1676988628491558, -0.05756268072621645, 0.2820383049799381, 0.19744033526276816, 0.10221246091217885, 0.04748124182790618, 0.3145876673846254, 0.25388186458007406, 0.15342063727360722, -0.31512737922949363, 0.01479102938901633, 0.02496203439266144] |
1,803.02675 | Global stability in a mathematical model of de-radicalization | Radicalization is the process by which people come to adopt increasingly
extreme political, social or religious ideologies. When radicalization leads to
violence, radical thinking becomes a threat to national security.
De-radicalization programs are part of an effort to combat violent extremism
and terrorism. This type of initiatives attempt to alter violent extremists
radical beliefs and violent behavior with the aim to reintegrate them into
society. In this paper we introduce a simple compartmental model suitable to
describe de-radicalization programs. The population is divided into four
compartments: $ (S) $ susceptible, $ (E) $ extremists, $ (R) $ recruiters, and
$ (T) $ treatment. We calculate the basic reproduction number $ \mathcal{R}_0
$. For $ \mathcal{R}_0< 1 $ the system has one globally asymptotically stable
equilibrium where no extremist or recruiters are present. For $ \mathcal{R}_0
>1 $ the system has an additional equilibrium where extremists and recruiters
are endemic to the population. A Lyapunov function is used to show that, for $
\mathcal{R}_0 >1 $, the endemic equilibrium is globally asymptotically stable.
We use numerical simulations to support our analytical results. Based on our
model we asses strategies to counter violent extremism.
| physics.soc-ph math.DS q-bio.PE | radicalization is the process by which people come to adopt increasingly extreme political social or religious ideologies when radicalization leads to violence radical thinking becomes a threat to national security deradicalization programs are part of an effort to combat violent extremism and terrorism this type of initiatives attempt to alter violent extremists radical beliefs and violent behavior with the aim to reintegrate them into society in this paper we introduce a simple compartmental model suitable to describe deradicalization programs the population is divided into four compartments s susceptible e extremists r recruiters and t treatment we calculate the basic reproduction number mathcalr_0 for mathcalr_0 1 the system has one globally asymptotically stable equilibrium where no extremist or recruiters are present for mathcalr_0 1 the system has an additional equilibrium where extremists and recruiters are endemic to the population a lyapunov function is used to show that for mathcalr_0 1 the endemic equilibrium is globally asymptotically stable we use numerical simulations to support our analytical results based on our model we asses strategies to counter violent extremism | [['radicalization', 'is', 'the', 'process', 'by', 'which', 'people', 'come', 'to', 'adopt', 'increasingly', 'extreme', 'political', 'social', 'or', 'religious', 'ideologies', 'when', 'radicalization', 'leads', 'to', 'violence', 'radical', 'thinking', 'becomes', 'a', 'threat', 'to', 'national', 'security', 'deradicalization', 'programs', 'are', 'part', 'of', 'an', 'effort', 'to', 'combat', 'violent', 'extremism', 'and', 'terrorism', 'this', 'type', 'of', 'initiatives', 'attempt', 'to', 'alter', 'violent', 'extremists', 'radical', 'beliefs', 'and', 'violent', 'behavior', 'with', 'the', 'aim', 'to', 'reintegrate', 'them', 'into', 'society', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'simple', 'compartmental', 'model', 'suitable', 'to', 'describe', 'deradicalization', 'programs', 'the', 'population', 'is', 'divided', 'into', 'four', 'compartments', 's', 'susceptible', 'e', 'extremists', 'r', 'recruiters', 'and', 't', 'treatment', 'we', 'calculate', 'the', 'basic', 'reproduction', 'number', 'mathcalr_0', 'for', 'mathcalr_0', '1', 'the', 'system', 'has', 'one', 'globally', 'asymptotically', 'stable', 'equilibrium', 'where', 'no', 'extremist', 'or', 'recruiters', 'are', 'present', 'for', 'mathcalr_0', '1', 'the', 'system', 'has', 'an', 'additional', 'equilibrium', 'where', 'extremists', 'and', 'recruiters', 'are', 'endemic', 'to', 'the', 'population', 'a', 'lyapunov', 'function', 'is', 'used', 'to', 'show', 'that', 'for', 'mathcalr_0', '1', 'the', 'endemic', 'equilibrium', 'is', 'globally', 'asymptotically', 'stable', 'we', 'use', 'numerical', 'simulations', 'to', 'support', 'our', 'analytical', 'results', 'based', 'on', 'our', 'model', 'we', 'asses', 'strategies', 'to', 'counter', 'violent', 'extremism']] | [-0.11006571737930954, 0.098492381160418, -0.09774535777574847, 0.12808808441059752, -0.0854066161955626, -0.1922324101946645, 0.06828970238674066, 0.3400306993061838, -0.23202962357270923, -0.2396542428632003, 0.11596164909780908, -0.31856036655647907, -0.17181369999552823, 0.10105518967376192, -0.1203166528287306, -0.033162117957250575, 0.033590486219335844, 0.028883036110291763, 0.09869626786888205, -0.29118940616268774, 0.33571764790167696, 0.034981133073105374, 0.2590074806980186, 0.008869972354544037, 0.06474929636699615, -0.035086290550154414, -0.017850575925556222, 0.01008045053071843, -0.16528964437689192, 0.07090783830479089, 0.3087011338669182, 0.2229620149127622, 0.4093189315515102, -0.45964776588377754, -0.1472262791115683, 0.15627905127264, 0.1502908019731198, 0.10366144143108875, 0.0014723599546035816, -0.2734942706113391, 0.10091513058714396, -0.23719974600230856, -0.1653841178570847, -0.07169783854859779, 0.06331520025333055, -0.0015635984793986393, -0.282630684699411, 0.05261545148112871, 0.02443534303779547, 0.10272182121797535, -0.05124480298025846, -0.10132090798094653, -0.04842714822011316, 0.16608471941284303, 0.11501342232989799, -0.019926110588382888, 0.17937308365500645, -0.12129212397748249, -0.10869432558881582, 0.35715091683918, 0.0031562016017175135, -0.1536125244375593, 0.24012374436830014, -0.10628949163795848, -0.11416863951552121, 0.112454466317172, 0.20128517504781485, 0.08022780790171355, -0.14598019489376857, -0.0287373132634951, 0.00032318669463497063, 0.161509625021519, 0.019777395650798273, -0.062330605575917124, 0.18845982198210465, 0.19212093613261216, 0.09951827272697422, 0.06901045958242363, 0.005991979757683201, -0.15314632563513966, -0.20890605948983848, -0.1357841689188055, -0.055546656156629085, 0.09523531214624772, -0.03134413618786863, -0.1621963806111215, 0.3683662127509627, 0.16097942146478017, 0.1280161698343437, 0.06569203162751554, 0.27586894440383924, 0.04074361769050478, 0.01134397652850761, 0.09699747235799543, 0.18292670096728325, 0.03090374248808538, 0.09648446915227102, -0.1946530220088027, 0.16017850019532992, 0.005123612787197694] |
1,803.02676 | Experiments and modelling of rate-dependent transition delay in a
stochastic subcritical bifurcation | Complex systems exhibiting critical transitions when one of their governing
parameters varies are ubiquitous in nature and in engineering applications.
Despite a vast literature focusing on this topic, there are few studies dealing
with the effect of the rate of change of the bifurcation parameter on the
tipping points. In this work, we consider a subcritical stochastic Hopf
bifurcation under two scenarios: the bifurcation parameter is first changed in
a quasi-steady manner and then, with a finite ramping rate. In the latter case,
a rate-dependent bifurcation delay is observed and exemplified experimentally
using a thermoacoustic instability in a combustion chamber. This delay
increases with the rate of change. This leads to a state transition of larger
amplitude compared to the one that would be experienced by the system with a
quasi-steady change of the parameter. We also bring experimental evidence of a
dynamic hysteresis caused by the bifurcation delay when the parameter is ramped
back. A surrogate model is derived in order to predict the statistic of these
delays and to scrutinise the underlying stochastic dynamics. Our study
highlights the dramatic influence of a finite rate of change of bifurcation
parameters upon tipping points and it pinpoints the crucial need of considering
this effect when investigating critical transitions.
| physics.flu-dyn | complex systems exhibiting critical transitions when one of their governing parameters varies are ubiquitous in nature and in engineering applications despite a vast literature focusing on this topic there are few studies dealing with the effect of the rate of change of the bifurcation parameter on the tipping points in this work we consider a subcritical stochastic hopf bifurcation under two scenarios the bifurcation parameter is first changed in a quasisteady manner and then with a finite ramping rate in the latter case a ratedependent bifurcation delay is observed and exemplified experimentally using a thermoacoustic instability in a combustion chamber this delay increases with the rate of change this leads to a state transition of larger amplitude compared to the one that would be experienced by the system with a quasisteady change of the parameter we also bring experimental evidence of a dynamic hysteresis caused by the bifurcation delay when the parameter is ramped back a surrogate model is derived in order to predict the statistic of these delays and to scrutinise the underlying stochastic dynamics our study highlights the dramatic influence of a finite rate of change of bifurcation parameters upon tipping points and it pinpoints the crucial need of considering this effect when investigating critical transitions | [['complex', 'systems', 'exhibiting', 'critical', 'transitions', 'when', 'one', 'of', 'their', 'governing', 'parameters', 'varies', 'are', 'ubiquitous', 'in', 'nature', 'and', 'in', 'engineering', 'applications', 'despite', 'a', 'vast', 'literature', 'focusing', 'on', 'this', 'topic', 'there', 'are', 'few', 'studies', 'dealing', 'with', 'the', 'effect', 'of', 'the', 'rate', 'of', 'change', 'of', 'the', 'bifurcation', 'parameter', 'on', 'the', 'tipping', 'points', 'in', 'this', 'work', 'we', 'consider', 'a', 'subcritical', 'stochastic', 'hopf', 'bifurcation', 'under', 'two', 'scenarios', 'the', 'bifurcation', 'parameter', 'is', 'first', 'changed', 'in', 'a', 'quasisteady', 'manner', 'and', 'then', 'with', 'a', 'finite', 'ramping', 'rate', 'in', 'the', 'latter', 'case', 'a', 'ratedependent', 'bifurcation', 'delay', 'is', 'observed', 'and', 'exemplified', 'experimentally', 'using', 'a', 'thermoacoustic', 'instability', 'in', 'a', 'combustion', 'chamber', 'this', 'delay', 'increases', 'with', 'the', 'rate', 'of', 'change', 'this', 'leads', 'to', 'a', 'state', 'transition', 'of', 'larger', 'amplitude', 'compared', 'to', 'the', 'one', 'that', 'would', 'be', 'experienced', 'by', 'the', 'system', 'with', 'a', 'quasisteady', 'change', 'of', 'the', 'parameter', 'we', 'also', 'bring', 'experimental', 'evidence', 'of', 'a', 'dynamic', 'hysteresis', 'caused', 'by', 'the', 'bifurcation', 'delay', 'when', 'the', 'parameter', 'is', 'ramped', 'back', 'a', 'surrogate', 'model', 'is', 'derived', 'in', 'order', 'to', 'predict', 'the', 'statistic', 'of', 'these', 'delays', 'and', 'to', 'scrutinise', 'the', 'underlying', 'stochastic', 'dynamics', 'our', 'study', 'highlights', 'the', 'dramatic', 'influence', 'of', 'a', 'finite', 'rate', 'of', 'change', 'of', 'bifurcation', 'parameters', 'upon', 'tipping', 'points', 'and', 'it', 'pinpoints', 'the', 'crucial', 'need', 'of', 'considering', 'this', 'effect', 'when', 'investigating', 'critical', 'transitions']] | [-0.18946228052552144, 0.13650334233982273, -0.06206821039533959, 0.04116952766008371, -0.05462054829919138, -0.12547359811231637, 0.12110108991831882, 0.2999640170780297, -0.273437824192045, -0.2684352813834826, 0.12327868166175904, -0.24271714477352083, -0.19137444529377928, 0.22382973096794628, -0.05504434778749083, 0.05416423106698158, 0.04512651242279949, 0.03896900254207699, -0.0672355611873522, -0.1967894708874295, 0.33426353955068266, 0.04669059117273159, 0.2770991373646001, 0.024877526969458604, 0.07701915096885596, -0.04597703561236043, -0.0020859127830940103, 0.02865250577115848, -0.15754765370607296, 0.030165154076082848, 0.235325422704381, 0.06524546054760531, 0.3017558764415578, -0.3988943058782472, -0.25975512793341365, 0.1392027255620073, 0.139272406478155, 0.1386362430997766, -0.041640275040453374, -0.25702434708924, 0.043804961333919964, -0.16857675614524992, -0.13634187505326387, -0.02021545768590071, 0.03371495039671292, 0.04950366770768037, -0.25740647605254285, 0.08949910346718053, 0.05509022846840358, 0.09170555652347573, -0.0632498675314799, -0.0328308504551667, -0.03833646396266816, 0.11825301725506367, 0.09406909553049794, 0.020443141206319872, 0.14992616921573734, -0.12884100481908087, -0.0844797111729769, 0.37467516674839246, -0.04041595376363078, -0.1632368091623693, 0.17954719969398306, -0.16471615720253724, -0.11781949871916507, 0.17485403937798066, 0.1720409114451076, 0.08059591178607661, -0.10074787444311649, 0.03364974655666559, 0.032846672021640606, 0.16950915119685725, 0.05141408494091593, -0.029104526674088377, 0.16716080585208076, 0.24290059708045403, 0.06482255467339061, 0.16560301157061566, -0.07404274197044568, -0.16899087698234674, -0.2795834006078971, -0.11329915573738757, -0.12328933242959185, 0.04529079595914272, -0.09554044533342676, -0.1641719488655396, 0.4212646753260812, 0.15955042293017657, 0.2403478975107786, -0.021359965776075393, 0.2793033223872324, 0.171116497039083, 0.026820124486291137, 0.029070631159881417, 0.297364982300888, 0.10013358346231353, 0.13841878194272375, -0.254504258644794, 0.12588533985455377, 0.01593752326152753] |
1,803.02677 | Joint User Association, Power Control and Scheduling in Multi-Cell 5G
Networks | -The focus of this paper is targeted towards multi-cell 5G networks which are
composed of HPNs (High Power Node) such as evolved NodeBs (HPNs) that control
signaling and system broadcasting information and of simplified LPNs (Low Power
Node) co-existing in the same operating area and sharing the scare radio
resources. Consequently, greater emphasis is given to Inter-Cell Interference
Coordination (ICIC) based on multi-resource management techniques that take in
particular user association into account. Beside user association to HPNs, this
paper takes also power control and scheduling into consideration. This
addressed problem is remained largely unsolved, mainly due to its non-convex
nature that makes the global optimal solution difficult to obtain. We address
the user association challenge according to the two broadly adopted approaches
in wireless networks: the network-centric approach where user association is
allocated efficiently in a centralized fashion; and the user-centric approach
where distributed allocation prevails for reduced complexity. The scheduling
and HPNs power allocation are solved in a centralized fashion, in order to
reach an optimal solution of the joint optimization problem.
| cs.NI | the focus of this paper is targeted towards multicell 5g networks which are composed of hpns high power node such as evolved nodebs hpns that control signaling and system broadcasting information and of simplified lpns low power node coexisting in the same operating area and sharing the scare radio resources consequently greater emphasis is given to intercell interference coordination icic based on multiresource management techniques that take in particular user association into account beside user association to hpns this paper takes also power control and scheduling into consideration this addressed problem is remained largely unsolved mainly due to its nonconvex nature that makes the global optimal solution difficult to obtain we address the user association challenge according to the two broadly adopted approaches in wireless networks the networkcentric approach where user association is allocated efficiently in a centralized fashion and the usercentric approach where distributed allocation prevails for reduced complexity the scheduling and hpns power allocation are solved in a centralized fashion in order to reach an optimal solution of the joint optimization problem | [['the', 'focus', 'of', 'this', 'paper', 'is', 'targeted', 'towards', 'multicell', '5g', 'networks', 'which', 'are', 'composed', 'of', 'hpns', 'high', 'power', 'node', 'such', 'as', 'evolved', 'nodebs', 'hpns', 'that', 'control', 'signaling', 'and', 'system', 'broadcasting', 'information', 'and', 'of', 'simplified', 'lpns', 'low', 'power', 'node', 'coexisting', 'in', 'the', 'same', 'operating', 'area', 'and', 'sharing', 'the', 'scare', 'radio', 'resources', 'consequently', 'greater', 'emphasis', 'is', 'given', 'to', 'intercell', 'interference', 'coordination', 'icic', 'based', 'on', 'multiresource', 'management', 'techniques', 'that', 'take', 'in', 'particular', 'user', 'association', 'into', 'account', 'beside', 'user', 'association', 'to', 'hpns', 'this', 'paper', 'takes', 'also', 'power', 'control', 'and', 'scheduling', 'into', 'consideration', 'this', 'addressed', 'problem', 'is', 'remained', 'largely', 'unsolved', 'mainly', 'due', 'to', 'its', 'nonconvex', 'nature', 'that', 'makes', 'the', 'global', 'optimal', 'solution', 'difficult', 'to', 'obtain', 'we', 'address', 'the', 'user', 'association', 'challenge', 'according', 'to', 'the', 'two', 'broadly', 'adopted', 'approaches', 'in', 'wireless', 'networks', 'the', 'networkcentric', 'approach', 'where', 'user', 'association', 'is', 'allocated', 'efficiently', 'in', 'a', 'centralized', 'fashion', 'and', 'the', 'usercentric', 'approach', 'where', 'distributed', 'allocation', 'prevails', 'for', 'reduced', 'complexity', 'the', 'scheduling', 'and', 'hpns', 'power', 'allocation', 'are', 'solved', 'in', 'a', 'centralized', 'fashion', 'in', 'order', 'to', 'reach', 'an', 'optimal', 'solution', 'of', 'the', 'joint', 'optimization', 'problem']] | [-0.20882445532758587, -0.008104750416103637, -0.015731233761597404, 0.042775722161995926, -0.1216125595766911, -0.23936480537024624, 0.13657995674764534, 0.38608783648236294, -0.30249948310800373, -0.28799991620263093, 0.09676625200606495, -0.22395778576842768, -0.1535809262268073, 0.10693814682793087, -0.13880157651345595, 0.054763752823282365, 0.02938885937008813, 0.016457984238766092, 0.03609339471211969, -0.24448904964932902, 0.2894402960015224, 0.1108509559497894, 0.3852340960834778, 0.04321736708482609, 0.06943166484130005, 0.0019175420499089135, -0.04197341878225521, -0.004485842014497719, -0.05928117451536425, 0.12626945846068074, 0.3656015668085889, 0.1960061587893937, 0.35045715077441036, -0.4342286601727236, -0.2149757566199654, 0.1044856057410812, 0.21939792451542947, 0.013205611660425158, -0.040307889488590286, -0.21652732077296932, 0.13075185799365593, -0.24209611662636601, -0.021845262217728388, 0.00541805798144785, -0.03988769617082411, 0.011945411923605239, -0.3224030378990607, 0.018131449144176137, -0.005799784082811692, 0.014254601735546324, -0.0948328137151477, -0.09921345575187743, 0.060484688470646135, 0.1684749547171412, 0.043464577905537635, 0.002667262438264799, 0.10882933217240767, -0.12588569929828664, -0.12511510144504637, 0.43243254781727586, 0.07865017043652735, -0.21740244681451665, 0.15183153321476642, -0.04599285735129621, -0.1846512069634964, 0.1346997354984434, 0.2661833833052502, 0.0758378924748112, -0.21081835990287148, 0.03378216678769909, 0.007033246795436895, 0.1613994457004787, 0.05584521530965892, 0.07537992124451119, 0.1640786282392488, 0.2301651503139773, 0.16736873951969355, 0.1431674048159207, -0.05433367728558504, -0.17310198464140167, -0.16564383585202155, -0.08994798379347288, -0.18538392961262107, 0.01082749578649598, -0.04218309781479789, -0.0771630087146008, 0.36837112167957803, 0.13629346825397773, 0.12253155191886546, 0.08995662055266321, 0.39950899799647765, 0.12272218093370232, 0.042263173430921196, 0.13985170307972958, 0.17882127308917925, 0.036882249154608075, 0.17476074367618952, -0.2329361800076117, 0.07345386723129112, -0.026467020779503563] |
1,803.02678 | Interface height fluctuations and surface tension of driven liquids with
time-dependent dynamics | Interfaces in phase-separated driven liquids are one example of how energy
input at the single-particle level changes the long-length-scale material
properties of nonequilibrium systems. Here, we measure interfacial fluctuations
in simulations of two liquids driven by time-dependent forces, one with
repulsive interactions and one with attractive interactions. The time-dependent
forces lead to currents along the interface, which can modify the scaling of
interface height fluctuations with respect to predictions from capillary wave
theory (CWT). We therefore characterize the whole spectrum of fluctuations to
determine whether CWT applies. In the system with repulsive interactions, we
find that the interface fluctuations are well-described by CWT at one amplitude
of the driving forces but not at others. In the system with attractive
interactions, they obey CWT for all amplitudes of driving, allowing us to
extract an effective surface tension. The surface tension increases linearly
over two orders of magnitude of the driving forces, more than doubling its
equilibrium value. Our results show how the interfaces of nonequilibrium
liquids with time-dependent forces are modified by energy input.
| cond-mat.stat-mech cond-mat.soft | interfaces in phaseseparated driven liquids are one example of how energy input at the singleparticle level changes the longlengthscale material properties of nonequilibrium systems here we measure interfacial fluctuations in simulations of two liquids driven by timedependent forces one with repulsive interactions and one with attractive interactions the timedependent forces lead to currents along the interface which can modify the scaling of interface height fluctuations with respect to predictions from capillary wave theory cwt we therefore characterize the whole spectrum of fluctuations to determine whether cwt applies in the system with repulsive interactions we find that the interface fluctuations are welldescribed by cwt at one amplitude of the driving forces but not at others in the system with attractive interactions they obey cwt for all amplitudes of driving allowing us to extract an effective surface tension the surface tension increases linearly over two orders of magnitude of the driving forces more than doubling its equilibrium value our results show how the interfaces of nonequilibrium liquids with timedependent forces are modified by energy input | [['interfaces', 'in', 'phaseseparated', 'driven', 'liquids', 'are', 'one', 'example', 'of', 'how', 'energy', 'input', 'at', 'the', 'singleparticle', 'level', 'changes', 'the', 'longlengthscale', 'material', 'properties', 'of', 'nonequilibrium', 'systems', 'here', 'we', 'measure', 'interfacial', 'fluctuations', 'in', 'simulations', 'of', 'two', 'liquids', 'driven', 'by', 'timedependent', 'forces', 'one', 'with', 'repulsive', 'interactions', 'and', 'one', 'with', 'attractive', 'interactions', 'the', 'timedependent', 'forces', 'lead', 'to', 'currents', 'along', 'the', 'interface', 'which', 'can', 'modify', 'the', 'scaling', 'of', 'interface', 'height', 'fluctuations', 'with', 'respect', 'to', 'predictions', 'from', 'capillary', 'wave', 'theory', 'cwt', 'we', 'therefore', 'characterize', 'the', 'whole', 'spectrum', 'of', 'fluctuations', 'to', 'determine', 'whether', 'cwt', 'applies', 'in', 'the', 'system', 'with', 'repulsive', 'interactions', 'we', 'find', 'that', 'the', 'interface', 'fluctuations', 'are', 'welldescribed', 'by', 'cwt', 'at', 'one', 'amplitude', 'of', 'the', 'driving', 'forces', 'but', 'not', 'at', 'others', 'in', 'the', 'system', 'with', 'attractive', 'interactions', 'they', 'obey', 'cwt', 'for', 'all', 'amplitudes', 'of', 'driving', 'allowing', 'us', 'to', 'extract', 'an', 'effective', 'surface', 'tension', 'the', 'surface', 'tension', 'increases', 'linearly', 'over', 'two', 'orders', 'of', 'magnitude', 'of', 'the', 'driving', 'forces', 'more', 'than', 'doubling', 'its', 'equilibrium', 'value', 'our', 'results', 'show', 'how', 'the', 'interfaces', 'of', 'nonequilibrium', 'liquids', 'with', 'timedependent', 'forces', 'are', 'modified', 'by', 'energy', 'input']] | [-0.16121802236790075, 0.22790639077086167, -0.12137792960653991, 0.07392183861283716, -0.00884112755248193, -0.15953268111564306, 0.0010723526322900122, 0.34301177053820603, -0.29154190382118833, -0.30124678171874664, 0.0216494875927564, -0.32534327580008743, -0.13427692812022773, 0.1789852050024756, 0.059199128134804234, 0.016420858895587517, -0.011138439645481751, -0.011554127112355863, -0.04783434645465012, -0.1661881716153043, 0.33052321194486994, 0.03597670089626728, 0.26829188871928383, 0.08700685379322791, 0.05633225134671341, 0.001730237516228023, 0.02275424008257687, 0.04824671240761703, -0.1529118269914169, 0.07051744058882706, 0.20663404129486163, -0.054496308512509216, 0.21393885568791438, -0.493604360191628, -0.2269635817813037, 0.06734662461581878, 0.11465828742853604, 0.12776860895872572, -0.002563745250839464, -0.2631255829771764, -0.018000550371822143, -0.14270402846159413, -0.18370830535964477, -0.0894687968701514, 0.04333481721060221, 0.08180276055408772, -0.23309186039774052, 0.13044768561210435, 0.029003217215324905, 0.025968318564822724, -0.10418596615145784, -0.057018891566427594, -0.06526159161707214, 0.1388515065035642, 0.06438161701310513, 0.03937544530547944, 0.2224090897564798, -0.17198400635970756, -0.06616300030416528, 0.38014385577285836, -0.08691677660588243, -0.22497837772582072, 0.2661002831815114, -0.15837249049083005, -0.06690535706357603, 0.18401090811320775, 0.1501732331668135, 0.031402673361806716, -0.14875403575350118, 0.02784843024016672, 0.06474208786041641, 0.19480949676552312, 0.051950785147329405, -0.0011765654875658625, 0.2449403748195077, 0.14389236055200832, 0.06031542178243399, 0.1359253883927649, -0.0550220993233758, -0.1188573767485227, -0.26589875111118133, -0.0900196231993695, -0.18159189324103145, -0.001019236394461396, -0.06698357337145988, -0.16505282421374348, 0.3904166070766054, 0.19970241795987065, 0.1486613947659904, 0.03884704775199955, 0.26373297342933105, 0.12634145003150563, 0.07982528841916234, 0.052833145993306886, 0.2853322086157277, 0.11664784901645468, 0.07965242246173994, -0.2699061017957256, 0.057579506681365675, 0.046201839753383295] |
1,803.02679 | Inner Product in Highest-Weight Representation | In this paper, we study the inner product of states corresponding to weights
of finite-dimensional highest-weight representations of classical groups.
We prove that the action of the raising operators would reduce a state of
hight-weight representation to a linear combination of states of highest-weight
representation, with the level decreased by one.
Then we propose an iterative algorithm for calculating the inner products of
sates efficiently, revealing the intricate structure of the representation.
As applications, we discuss the unitarity of the highest-weight
representation and propose a conjecture. We determine the norm of a special
class of states. And we completely determine the inner products of states of
the minuscule representations. The algorithm proposed is applicable to the
highest-weight representation of affine Lie algebra without modifications.
These findings can be used to study the construction of solutions to
Kapustin-Witten equations which are based on the fundamental solutions of Toda
systems.
| math-ph math.MP | in this paper we study the inner product of states corresponding to weights of finitedimensional highestweight representations of classical groups we prove that the action of the raising operators would reduce a state of hightweight representation to a linear combination of states of highestweight representation with the level decreased by one then we propose an iterative algorithm for calculating the inner products of sates efficiently revealing the intricate structure of the representation as applications we discuss the unitarity of the highestweight representation and propose a conjecture we determine the norm of a special class of states and we completely determine the inner products of states of the minuscule representations the algorithm proposed is applicable to the highestweight representation of affine lie algebra without modifications these findings can be used to study the construction of solutions to kapustinwitten equations which are based on the fundamental solutions of toda systems | [['in', 'this', 'paper', 'we', 'study', 'the', 'inner', 'product', 'of', 'states', 'corresponding', 'to', 'weights', 'of', 'finitedimensional', 'highestweight', 'representations', 'of', 'classical', 'groups', 'we', 'prove', 'that', 'the', 'action', 'of', 'the', 'raising', 'operators', 'would', 'reduce', 'a', 'state', 'of', 'hightweight', 'representation', 'to', 'a', 'linear', 'combination', 'of', 'states', 'of', 'highestweight', 'representation', 'with', 'the', 'level', 'decreased', 'by', 'one', 'then', 'we', 'propose', 'an', 'iterative', 'algorithm', 'for', 'calculating', 'the', 'inner', 'products', 'of', 'sates', 'efficiently', 'revealing', 'the', 'intricate', 'structure', 'of', 'the', 'representation', 'as', 'applications', 'we', 'discuss', 'the', 'unitarity', 'of', 'the', 'highestweight', 'representation', 'and', 'propose', 'a', 'conjecture', 'we', 'determine', 'the', 'norm', 'of', 'a', 'special', 'class', 'of', 'states', 'and', 'we', 'completely', 'determine', 'the', 'inner', 'products', 'of', 'states', 'of', 'the', 'minuscule', 'representations', 'the', 'algorithm', 'proposed', 'is', 'applicable', 'to', 'the', 'highestweight', 'representation', 'of', 'affine', 'lie', 'algebra', 'without', 'modifications', 'these', 'findings', 'can', 'be', 'used', 'to', 'study', 'the', 'construction', 'of', 'solutions', 'to', 'kapustinwitten', 'equations', 'which', 'are', 'based', 'on', 'the', 'fundamental', 'solutions', 'of', 'toda', 'systems']] | [-0.13648629542891583, 0.0868471863959341, -0.10198954471444781, 0.0471518273484342, -0.08901752426200324, -0.08464247384900545, 0.022783487971054808, 0.3155918886416218, -0.3344676267913207, -0.24204100034244003, 0.12725673832449125, -0.21716434306458754, -0.17918080901790437, 0.16747342665255271, -0.06603608239872925, 0.02478914986345537, 0.08731881407767433, 0.09280600957255684, -0.15585706981538863, -0.2369626701689091, 0.4033665157423741, 0.019261805296299003, 0.2484720276960102, 0.022727771826899376, 0.1315340988975902, 0.021764549958918775, -0.016505871278544266, -0.05307244727083919, -0.10125924511932409, 0.21668238040585655, 0.2815847667757751, 0.12732327659614384, 0.22169659854242338, -0.4132492567482246, -0.14013960636137718, 0.13927485961086897, 0.15922075103600922, 0.11609699395025896, -0.006730782988696632, -0.29859048416869727, 0.09340707164041565, -0.2021924601075854, -0.15989556927930842, -0.12234132577582789, -0.01849232088666739, -0.029155192271486354, -0.26057587197679255, 0.03678892778318223, 0.06797550051935575, 0.015812523080175427, -0.13834789061766803, -0.1166616444647008, -0.01752928652971679, 0.12769982872252056, -0.013019637765400872, -0.021762317932507047, 0.09147267442728792, -0.16080788862384654, -0.14915910778491168, 0.35759514487874344, -0.03034703530130439, -0.23413036042685006, 0.1728358113406492, -0.1307606431022033, -0.14667802600056998, 0.08063292750204933, 0.17926489286200734, 0.13342500889205, -0.07939137073691466, 0.11806732609307355, -0.09003755555735254, 0.10203018689331707, 0.055094495558236936, 0.045081424900666384, 0.15578684915287966, 0.1022935771814161, 0.06239487915965063, 0.18536262580931667, -0.015303347600294517, -0.07204615644046239, -0.3132895862962417, -0.20221879226207054, -0.1321998093574986, 0.05576330098342531, -0.07668634333634325, -0.17671887526687766, 0.44325057075669366, 0.1168645965739242, 0.20205529324938448, 0.0801393571206793, 0.2158368156563972, 0.15912236064137117, 0.09681010479424275, 0.08316277365079847, 0.17548675681812828, 0.20331068705216201, -0.016047497681456104, -0.21971812260140772, 0.004529356102769573, 0.16607883890305145] |
1,803.0268 | The origin of the mass of the Nambu-Goldstone bosons | We explain the origin of the mass for the Nambu-Goldstone bosons when there
is a chemical potential in the action which breaks explicitly the symmetry. The
method is based on the number of independent histories for the interaction of
the pair of Nambu-Goldstone bosons with the degenerate vacuum (triangle
relations). The analysis suggests that under some circumstances, pairs of
massive Nambu-Goldstone bosons can become a single degree of freedom with an
effective mass defined by the superposition of the individual masses of each
boson. Possible mass oscillations for the Nambu-Goldstone bosons are discussed.
| physics.gen-ph hep-th | we explain the origin of the mass for the nambugoldstone bosons when there is a chemical potential in the action which breaks explicitly the symmetry the method is based on the number of independent histories for the interaction of the pair of nambugoldstone bosons with the degenerate vacuum triangle relations the analysis suggests that under some circumstances pairs of massive nambugoldstone bosons can become a single degree of freedom with an effective mass defined by the superposition of the individual masses of each boson possible mass oscillations for the nambugoldstone bosons are discussed | [['we', 'explain', 'the', 'origin', 'of', 'the', 'mass', 'for', 'the', 'nambugoldstone', 'bosons', 'when', 'there', 'is', 'a', 'chemical', 'potential', 'in', 'the', 'action', 'which', 'breaks', 'explicitly', 'the', 'symmetry', 'the', 'method', 'is', 'based', 'on', 'the', 'number', 'of', 'independent', 'histories', 'for', 'the', 'interaction', 'of', 'the', 'pair', 'of', 'nambugoldstone', 'bosons', 'with', 'the', 'degenerate', 'vacuum', 'triangle', 'relations', 'the', 'analysis', 'suggests', 'that', 'under', 'some', 'circumstances', 'pairs', 'of', 'massive', 'nambugoldstone', 'bosons', 'can', 'become', 'a', 'single', 'degree', 'of', 'freedom', 'with', 'an', 'effective', 'mass', 'defined', 'by', 'the', 'superposition', 'of', 'the', 'individual', 'masses', 'of', 'each', 'boson', 'possible', 'mass', 'oscillations', 'for', 'the', 'nambugoldstone', 'bosons', 'are', 'discussed']] | [-0.17112265019527367, 0.2825984896540264, -0.06101585365831852, 0.10828424000021031, -0.04770177101806527, -0.11903438916409849, 0.03771607007240496, 0.300834688047568, -0.22528330076445816, -0.2739863314575726, 0.025131573193326033, -0.27882536820146026, -0.07983285620287862, 0.11718591821369945, 0.03258226578554479, 0.028660634742869485, 0.03114832413973667, 0.09529689978307454, -0.043137533398049696, -0.26960978527823765, 0.38654913488895665, -0.0027403799786923392, 0.24578852956533753, 0.0465285700253932, 0.1006299897587748, 0.0545803498919873, 0.03843964976809358, -0.06470260977925311, -0.07785403596978041, 0.05223319880659341, 0.11729995141329083, 0.0704850036811593, 0.21729436831709037, -0.32790388206961335, -0.14841310663889812, 0.13364614895795301, 0.2002334137026581, 0.13381667707180503, -0.10151881187958943, -0.3058708157810953, 0.03666379120731626, -0.14998996326269867, -0.19304427512050157, -0.048319327121760736, -0.003311983740297697, -0.029774262920342465, -0.296625382597408, 0.14606452731118957, -0.0014909493582954088, 0.05299946384364238, -0.03855525849947846, -0.118473709120305, -0.11714184269689584, 0.06390060570562929, 0.14113068487995895, -0.007982081953956876, 0.12055010371716313, -0.19370460184791716, -0.1120398821595866, 0.4561853006842636, -0.07544119176905482, -0.20726696112423496, 0.19618359674018637, -0.09640930716689396, -0.14810704553539875, 0.1439887793908041, 0.15031357790513705, 0.06904417420587232, -0.17644100348663552, 0.09451270182066226, -0.05866048617729096, 0.1530959192783602, 0.037393834749837554, 0.09904439826946586, 0.31971876096901714, 0.1376411940737237, -0.011004338441516763, 0.09109478147440059, -0.04987529897811993, -0.09429475280608962, -0.3696576716598644, -0.16249160788282352, -0.15292572466436252, 0.032859231171358416, -0.09795442478285642, -0.1358331313747312, 0.40578973685861913, 0.10459232283630959, 0.2367825009259245, 0.014186242170962355, 0.24058156230697228, 0.1520129437107713, 0.1326998753713504, 0.037114405785486984, 0.3043298452497355, 0.17066108332120725, -0.003371832887291588, -0.2561856654813133, -0.06180660379549829, 0.0840033172374411] |
1,803.02681 | Toward Coordinated Transmission and Distribution Operations | Proliferation of smart grid technologies has enhanced observability and
controllability of distribution systems. If coordinated with the transmission
system, resources of both systems can be used more efficiently. This paper
proposes a model to operate transmission and distribution systems in a
coordinated manner. The proposed model is solved using a Surrogate Lagrangian
Relaxation (SLR) approach. The computational performance of this approach is
compared against existing methods (e.g. subgradient method). Finally, the
usefulness of the proposed model and solution approach is demonstrated via
numerical experiments on the illustrative example and IEEE benchmarks.
| eess.SP | proliferation of smart grid technologies has enhanced observability and controllability of distribution systems if coordinated with the transmission system resources of both systems can be used more efficiently this paper proposes a model to operate transmission and distribution systems in a coordinated manner the proposed model is solved using a surrogate lagrangian relaxation slr approach the computational performance of this approach is compared against existing methods eg subgradient method finally the usefulness of the proposed model and solution approach is demonstrated via numerical experiments on the illustrative example and ieee benchmarks | [['proliferation', 'of', 'smart', 'grid', 'technologies', 'has', 'enhanced', 'observability', 'and', 'controllability', 'of', 'distribution', 'systems', 'if', 'coordinated', 'with', 'the', 'transmission', 'system', 'resources', 'of', 'both', 'systems', 'can', 'be', 'used', 'more', 'efficiently', 'this', 'paper', 'proposes', 'a', 'model', 'to', 'operate', 'transmission', 'and', 'distribution', 'systems', 'in', 'a', 'coordinated', 'manner', 'the', 'proposed', 'model', 'is', 'solved', 'using', 'a', 'surrogate', 'lagrangian', 'relaxation', 'slr', 'approach', 'the', 'computational', 'performance', 'of', 'this', 'approach', 'is', 'compared', 'against', 'existing', 'methods', 'eg', 'subgradient', 'method', 'finally', 'the', 'usefulness', 'of', 'the', 'proposed', 'model', 'and', 'solution', 'approach', 'is', 'demonstrated', 'via', 'numerical', 'experiments', 'on', 'the', 'illustrative', 'example', 'and', 'ieee', 'benchmarks']] | [-0.12538608592796743, -0.05326445944156948, -0.0748343058339842, 0.0017890692496631336, -0.007030173644914732, -0.19186264755982127, 0.04868266308951386, 0.3972361574952419, -0.25837968570272346, -0.3312221041133443, 0.1472262388317856, -0.26637470244256023, -0.22489055626831211, 0.2339838757083731, -0.08327647268127364, 0.12904259302540794, 0.10560062760998914, -0.03361234492315286, -0.034264677618681405, -0.2743343743163028, 0.24367853478211296, 0.09130251566255158, 0.3560967168535341, 0.03624791367961974, 0.08237594813824846, -0.027777403329529767, 0.0021766736565521087, 0.046458072561238496, -0.04695236969964354, 0.18101622737371004, 0.24644202763818532, 0.21297984341272042, 0.3049399937083433, -0.4342097481815042, -0.262512341735291, 0.07947406767621883, 0.18131596748867446, 0.09437303882665359, -0.07774019834875247, -0.2872140647966292, 0.0691762213482634, -0.25018413465183514, -0.08835321077360557, -0.13280786006905876, -0.06948340521961614, 0.04252310851486502, -0.3225541681788125, 0.04736127105418716, 0.00039688751081025207, 0.05916803614696958, -0.07235222950495862, -0.06666002549092889, 0.007077757105395034, 0.0754099116087533, 0.012594731431198563, -0.024038043508950908, 0.13793293808351506, -0.05258253123099496, -0.1687948346153352, 0.41698962355871777, -0.03753110522898119, -0.2506008450719681, 0.21650544123130513, -0.022932158731906623, -0.07975610364023801, 0.09049396915873001, 0.23723667443494548, 0.1739603771730889, -0.1916974355763459, 0.06482659529761545, -0.011978077477069346, 0.16417346233604374, -0.01272055648195629, -0.015712611244193146, 0.14720457277751967, 0.2898873405039802, 0.09357021757207074, 0.13059531402861146, -0.07574134476349823, -0.1263125113590242, -0.21884524224807028, -0.11633506523711341, -0.20257572250461187, -0.034903587231023624, -0.04253321619906494, -0.0765261251305404, 0.3864919374911831, 0.23823626665398479, 0.11593086985298075, 0.06265037024015008, 0.4084828346148952, 0.12470550791125048, 0.06182309878723962, 0.07831930942772018, 0.17017364607366559, 0.07196163242570237, 0.13027022895147347, -0.23945560604640906, 0.076639917515382, 0.06721155942100418] |
1,803.02682 | A Suboptimality Approach to Distributed Linear Quadratic Optimal Control | This paper is concerned with the distributed linear quadratic optimal control
problem. In particular, we consider a suboptimal version of the distributed
optimal control problem for undirected multi-agent networks. Given a
multi-agent system with identical agent dynamics and an associated global
quadratic cost functional, our objective is to design suboptimal distributed
control laws that guarantee the controlled network to reach consensus and the
associated cost to be smaller than an a priori given upper bound. We first
analyze the suboptimality for a given linear system and then apply the results
to linear multiagent systems. Two design methods are then provided to compute
such suboptimal distributed controllers, involving the solution of a single
Riccati inequality of dimension equal to the dimension of the agent dynamics,
and the smallest nonzero and the largest eigenvalue of the graph Laplacian.
Furthermore, we relax the requirement of exact knowledge of the smallest
nonzero and largest eigenvalue of the graph Laplacian by using only lower and
upper bounds on these eigenvalues. Finally, a simulation example is provided to
illustrate our design method.
| math.OC | this paper is concerned with the distributed linear quadratic optimal control problem in particular we consider a suboptimal version of the distributed optimal control problem for undirected multiagent networks given a multiagent system with identical agent dynamics and an associated global quadratic cost functional our objective is to design suboptimal distributed control laws that guarantee the controlled network to reach consensus and the associated cost to be smaller than an a priori given upper bound we first analyze the suboptimality for a given linear system and then apply the results to linear multiagent systems two design methods are then provided to compute such suboptimal distributed controllers involving the solution of a single riccati inequality of dimension equal to the dimension of the agent dynamics and the smallest nonzero and the largest eigenvalue of the graph laplacian furthermore we relax the requirement of exact knowledge of the smallest nonzero and largest eigenvalue of the graph laplacian by using only lower and upper bounds on these eigenvalues finally a simulation example is provided to illustrate our design method | [['this', 'paper', 'is', 'concerned', 'with', 'the', 'distributed', 'linear', 'quadratic', 'optimal', 'control', 'problem', 'in', 'particular', 'we', 'consider', 'a', 'suboptimal', 'version', 'of', 'the', 'distributed', 'optimal', 'control', 'problem', 'for', 'undirected', 'multiagent', 'networks', 'given', 'a', 'multiagent', 'system', 'with', 'identical', 'agent', 'dynamics', 'and', 'an', 'associated', 'global', 'quadratic', 'cost', 'functional', 'our', 'objective', 'is', 'to', 'design', 'suboptimal', 'distributed', 'control', 'laws', 'that', 'guarantee', 'the', 'controlled', 'network', 'to', 'reach', 'consensus', 'and', 'the', 'associated', 'cost', 'to', 'be', 'smaller', 'than', 'an', 'a', 'priori', 'given', 'upper', 'bound', 'we', 'first', 'analyze', 'the', 'suboptimality', 'for', 'a', 'given', 'linear', 'system', 'and', 'then', 'apply', 'the', 'results', 'to', 'linear', 'multiagent', 'systems', 'two', 'design', 'methods', 'are', 'then', 'provided', 'to', 'compute', 'such', 'suboptimal', 'distributed', 'controllers', 'involving', 'the', 'solution', 'of', 'a', 'single', 'riccati', 'inequality', 'of', 'dimension', 'equal', 'to', 'the', 'dimension', 'of', 'the', 'agent', 'dynamics', 'and', 'the', 'smallest', 'nonzero', 'and', 'the', 'largest', 'eigenvalue', 'of', 'the', 'graph', 'laplacian', 'furthermore', 'we', 'relax', 'the', 'requirement', 'of', 'exact', 'knowledge', 'of', 'the', 'smallest', 'nonzero', 'and', 'largest', 'eigenvalue', 'of', 'the', 'graph', 'laplacian', 'by', 'using', 'only', 'lower', 'and', 'upper', 'bounds', 'on', 'these', 'eigenvalues', 'finally', 'a', 'simulation', 'example', 'is', 'provided', 'to', 'illustrate', 'our', 'design', 'method']] | [-0.16295223063471811, 0.014561373596403759, -0.039544709608890116, 0.03371175368639259, -0.10668944265820425, -0.17606568805323067, 0.05086807024583157, 0.3406800246183676, -0.3156465798806907, -0.2970058684136761, 0.14054921310096027, -0.2620398160123097, -0.18691822240891104, 0.17282917840533296, -0.09107838244447274, 0.13662165667367596, 0.0700341799238231, 0.08375993754915809, -0.03144952068594813, -0.2583175797907726, 0.31375890622174746, 0.03943452827992256, 0.24030215565025256, 0.0108817227486394, 0.14578850554839431, -0.02663351943060248, 0.02789883116797269, 0.02968940525798561, -0.15321029409580494, 0.16500189259981693, 0.27413302067725454, 0.14457028203072364, 0.3356773357319815, -0.42607142275664955, -0.12733276052842318, 0.180556929231071, 0.13124011181869058, 0.08344439042478123, -0.01666251689907354, -0.2560888332637577, 0.1488780124822039, -0.1470389890336347, -0.12260469574671747, -0.029300363080851224, -0.01976378032387319, 0.020104177511794576, -0.3400040617773563, 0.032935972084735775, 0.058017518334302375, 0.028294992328565884, -0.0959394660907988, -0.1330810068386861, 0.012186585523357446, 0.1161362385120645, -0.006125692999789449, -0.02445951351282102, 0.1044036084296584, -0.08737095501088664, -0.1580454324192198, 0.33677937676706776, -0.02102252525161351, -0.2532330645714286, 0.12469273000368214, -0.0704444003118128, -0.12858411360304506, 0.09890202182048763, 0.2519002327885987, 0.14265527517471294, -0.15716411036555655, 0.08404966403064794, -0.061626667045691814, 0.19397200929233804, 0.010808369768545328, 0.024566539314533162, 0.08715605814226861, 0.1796830276871333, 0.23548162031643602, 0.16412676656314448, 0.024511188368209827, -0.14961793886455285, -0.3015242238920605, -0.11519247598764858, -0.2554208583513338, 0.021561649248310874, -0.14838061700794986, -0.1497863469432394, 0.3778343104588037, 0.14039006559389897, 0.16814847044654677, 0.14757967609726952, 0.31172349106517766, 0.172154971897147, -0.001959350769704377, 0.14414866184233688, 0.2026517174460671, 0.12453244540533474, 0.06264551706474529, -0.26262225407514384, 0.07142275020107097, 0.07143022793620317] |
1,803.02683 | Strongly Rickart objects in abelian categories: Applications to strongly
regular and strongly Baer objects | We show how the theory of (dual) strongly relative Rickart objects may be
employed in order to study strongly relative regular objects and (dual)
strongly relative Baer objects in abelian categories. For each of them, we
prove general properties, we analyze the behaviour with respect to
(co)products, and we study the transfer via functors. We also give applications
to Grothendieck categories, (graded) module categories and comodule categories.
| math.CT math.RA | we show how the theory of dual strongly relative rickart objects may be employed in order to study strongly relative regular objects and dual strongly relative baer objects in abelian categories for each of them we prove general properties we analyze the behaviour with respect to coproducts and we study the transfer via functors we also give applications to grothendieck categories graded module categories and comodule categories | [['we', 'show', 'how', 'the', 'theory', 'of', 'dual', 'strongly', 'relative', 'rickart', 'objects', 'may', 'be', 'employed', 'in', 'order', 'to', 'study', 'strongly', 'relative', 'regular', 'objects', 'and', 'dual', 'strongly', 'relative', 'baer', 'objects', 'in', 'abelian', 'categories', 'for', 'each', 'of', 'them', 'we', 'prove', 'general', 'properties', 'we', 'analyze', 'the', 'behaviour', 'with', 'respect', 'to', 'coproducts', 'and', 'we', 'study', 'the', 'transfer', 'via', 'functors', 'we', 'also', 'give', 'applications', 'to', 'grothendieck', 'categories', 'graded', 'module', 'categories', 'and', 'comodule', 'categories']] | [-0.10598082745572858, 0.04289793424697509, -0.07624172946132386, 0.12457136832066436, -0.10489325572514156, -0.1268161942959944, -0.04336358534012323, 0.4601233995505678, -0.40564008752134306, -0.2161193757166794, 0.06786889864006705, -0.20828515969550432, -0.1569776862526118, 0.15216913606985402, -0.23005399730668138, -0.11017896640879005, 0.08745710665721503, 0.09879277864429377, -0.08017790803699684, -0.29088707943794445, 0.4492436660828986, 0.006340057130402594, 0.2642269535963215, 0.026987741687404577, 0.062482334722055874, 0.017576622894840008, -0.05342538287835335, 0.09123844030632902, -0.18123271317679934, 0.18112653443840013, 0.3246829341263024, 0.05815858237963142, 0.14092024704163422, -0.36926361629322396, -0.029130219488835603, 0.17292348794472306, 0.08570044882484336, 0.0458740818717364, -0.0026185024501894838, -0.3213325730566658, 0.14551284541193493, -0.28304644696303266, -0.07507338369293, -0.13488469549468649, 0.09402651606655832, 0.07618132038319957, -0.23442292096677111, -0.05552402130760767, 0.05763974256017298, 0.0787783100394838, -0.11764256175218234, -0.019695729224025203, -0.04840270169913324, 0.11160012043373131, -0.014882844052652814, -0.0762723064772896, 0.18011715480668553, -0.16573031110438838, -0.1714603501969754, 0.3798421068923242, -0.05839801066270126, -0.20778337528289698, 0.27597333344895003, -0.1761057311251982, -0.1284961896225699, 0.06580517199168455, 0.09095083563519057, 0.20952588064012242, -0.051059420234454214, 0.10903545108418773, -0.11429559016850457, 0.1057375316410812, 0.07224664906623648, 0.10088713591963526, 0.17869854930991572, 0.06958847215621551, 0.025844805818329108, 0.21782883057030222, 0.02116746579448053, -0.03693839346072567, -0.32247289228461573, -0.2154063189457824, 0.010461730340412303, 0.06048983221512232, -0.05871612895492972, -0.1418882293710068, 0.40925083216279745, 0.18585794631204108, 0.18992483874421512, 0.10344604131723963, 0.1964264185126148, 0.043225075215546055, 0.06251566048099924, 0.027390050618394987, 0.1665898173380254, 0.2666966079442359, -0.00035170689503203576, -0.12693754380652264, -0.034985624045244794, 0.21240036277128244] |
1,803.02684 | A CNN and LSTM-Based Approach to Classifying Transient Radio Frequency
Interference | Transient radio frequency interference (RFI) is detrimental to radio
astronomy. It is particularly difficult to identify the sources of transient
RFI, which is broadband and intermittent. Such RFI is often generated by
devices like mechanical relays, fluorescent lighting or AC machines, which may
be present in the surrounding infrastructure of a radio telescope array. One
mitigating approach is to deploy independent RFI monitoring stations at radio
telescope arrays. Once the sources of RFI signals are identified, they may be
removed or replaced where possible. For the first time in the open literature,
we demonstrate an approach to classifying the sources of transient RFI (in time
domain data) that makes use of deep learning techniques including CNNs and
LSTMs. Applied to a previously obtained dataset of experimentally recorded
transient RFI signals, our proposed approach offers good results. It shows
potential for development into a tool for identifying the sources of transient
RFI signals recorded by independent RFI monitoring stations.
| eess.SP | transient radio frequency interference rfi is detrimental to radio astronomy it is particularly difficult to identify the sources of transient rfi which is broadband and intermittent such rfi is often generated by devices like mechanical relays fluorescent lighting or ac machines which may be present in the surrounding infrastructure of a radio telescope array one mitigating approach is to deploy independent rfi monitoring stations at radio telescope arrays once the sources of rfi signals are identified they may be removed or replaced where possible for the first time in the open literature we demonstrate an approach to classifying the sources of transient rfi in time domain data that makes use of deep learning techniques including cnns and lstms applied to a previously obtained dataset of experimentally recorded transient rfi signals our proposed approach offers good results it shows potential for development into a tool for identifying the sources of transient rfi signals recorded by independent rfi monitoring stations | [['transient', 'radio', 'frequency', 'interference', 'rfi', 'is', 'detrimental', 'to', 'radio', 'astronomy', 'it', 'is', 'particularly', 'difficult', 'to', 'identify', 'the', 'sources', 'of', 'transient', 'rfi', 'which', 'is', 'broadband', 'and', 'intermittent', 'such', 'rfi', 'is', 'often', 'generated', 'by', 'devices', 'like', 'mechanical', 'relays', 'fluorescent', 'lighting', 'or', 'ac', 'machines', 'which', 'may', 'be', 'present', 'in', 'the', 'surrounding', 'infrastructure', 'of', 'a', 'radio', 'telescope', 'array', 'one', 'mitigating', 'approach', 'is', 'to', 'deploy', 'independent', 'rfi', 'monitoring', 'stations', 'at', 'radio', 'telescope', 'arrays', 'once', 'the', 'sources', 'of', 'rfi', 'signals', 'are', 'identified', 'they', 'may', 'be', 'removed', 'or', 'replaced', 'where', 'possible', 'for', 'the', 'first', 'time', 'in', 'the', 'open', 'literature', 'we', 'demonstrate', 'an', 'approach', 'to', 'classifying', 'the', 'sources', 'of', 'transient', 'rfi', 'in', 'time', 'domain', 'data', 'that', 'makes', 'use', 'of', 'deep', 'learning', 'techniques', 'including', 'cnns', 'and', 'lstms', 'applied', 'to', 'a', 'previously', 'obtained', 'dataset', 'of', 'experimentally', 'recorded', 'transient', 'rfi', 'signals', 'our', 'proposed', 'approach', 'offers', 'good', 'results', 'it', 'shows', 'potential', 'for', 'development', 'into', 'a', 'tool', 'for', 'identifying', 'the', 'sources', 'of', 'transient', 'rfi', 'signals', 'recorded', 'by', 'independent', 'rfi', 'monitoring', 'stations']] | [-0.15090826526284218, 0.08281889786036417, -0.0527990277284827, 0.08249211018754735, -0.11840596841942944, -0.17127430858974688, 0.09013958104968636, 0.4477199343139235, -0.22671140759853245, -0.29440646588690345, 0.1665551684880806, -0.2772635804501044, -0.17839821140411533, 0.2689260555213152, -0.0891834829928047, 0.015426204576307341, 0.09590026285629012, -0.07000570167799162, 0.05180153145367881, -0.20981795825373642, 0.21474311168930388, 0.1330192827520512, 0.320981137259993, -0.014623464745339713, 0.1149125673175978, -0.04947242084772715, -0.1277554805605684, -0.027446010600940526, 0.049312342121625025, 0.021672645635325227, 0.4103616459082954, 0.1879568243953893, 0.2271659325283681, -0.4336546379011832, -0.260884503338816, 0.11956043352219689, 0.13505505063774395, 0.07680890603945885, -0.02300034831292762, -0.4053486872794507, 0.10230008648897085, -0.1710914373014688, -0.13519389435044368, -0.034641337681184464, 0.013427828462157823, 0.04354929832647307, -0.25808152947221186, 0.018405904613223067, 0.0007972282481297284, 0.060948554777151234, -0.04838142362307194, -0.06556306077061291, 0.07342403938203956, 0.16313893373324712, 0.014168559219555552, 0.016331257160069255, 0.16593285821837997, -0.12282920186997309, -0.12169817065867254, 0.34770384023873774, -0.015440269660711572, -0.0989636444306897, 0.21601862162484234, -0.1265319822491677, -0.1578448136319418, 0.17281955304331606, 0.1962366634213566, 0.06191348441717321, -0.23920774023870855, -0.030633726978786524, 0.09340359395829655, 0.17660738953574903, 0.09744849556738723, 0.09379197756577094, 0.2286524585377472, 0.1996906214759131, 0.10329068594470714, 0.16646014565095021, -0.22577910182431718, 0.04923596978445443, -0.21058369366801344, -0.03765505832167566, -0.23257218296580676, 0.057403796205084914, -0.0224636326545092, -0.1371539537662263, 0.3884568404468201, 0.18006014477614832, 0.060016655674074555, 0.012147401519933173, 0.39992063541902534, 0.07165165914626367, 0.1277730029630416, 0.08175226001222205, 0.23356939503360138, 0.05586888150111595, 0.16103194333329984, -0.1720617350148143, 0.054513489854038706, -0.0721750349554976] |
1,803.02685 | Reconstruction of light-cone parton distribution functions from lattice
QCD simulations at the physical point | We present the unpolarized and helicity parton distribution functions
calculated within lattice QCD simulations using physical values of the light
quark mass. Non-perturbative renormalization is employed and the lattice data
are converted to the MSbar-scheme at a scale of 2 GeV. A matching process is
applied together with target mass corrections leading to the reconstruction of
light-cone parton distribution functions. For both cases we find a similar
behavior between the lattice and phenomenological data, and for the polarized
PDF a nice overlap for a range of Bjorken-x values. This presents a major
success for the emerging field of direct calculations of quark distributions
using lattice QCD.
| hep-lat hep-ex hep-ph nucl-th | we present the unpolarized and helicity parton distribution functions calculated within lattice qcd simulations using physical values of the light quark mass nonperturbative renormalization is employed and the lattice data are converted to the msbarscheme at a scale of 2 gev a matching process is applied together with target mass corrections leading to the reconstruction of lightcone parton distribution functions for both cases we find a similar behavior between the lattice and phenomenological data and for the polarized pdf a nice overlap for a range of bjorkenx values this presents a major success for the emerging field of direct calculations of quark distributions using lattice qcd | [['we', 'present', 'the', 'unpolarized', 'and', 'helicity', 'parton', 'distribution', 'functions', 'calculated', 'within', 'lattice', 'qcd', 'simulations', 'using', 'physical', 'values', 'of', 'the', 'light', 'quark', 'mass', 'nonperturbative', 'renormalization', 'is', 'employed', 'and', 'the', 'lattice', 'data', 'are', 'converted', 'to', 'the', 'msbarscheme', 'at', 'a', 'scale', 'of', '2', 'gev', 'a', 'matching', 'process', 'is', 'applied', 'together', 'with', 'target', 'mass', 'corrections', 'leading', 'to', 'the', 'reconstruction', 'of', 'lightcone', 'parton', 'distribution', 'functions', 'for', 'both', 'cases', 'we', 'find', 'a', 'similar', 'behavior', 'between', 'the', 'lattice', 'and', 'phenomenological', 'data', 'and', 'for', 'the', 'polarized', 'pdf', 'a', 'nice', 'overlap', 'for', 'a', 'range', 'of', 'bjorkenx', 'values', 'this', 'presents', 'a', 'major', 'success', 'for', 'the', 'emerging', 'field', 'of', 'direct', 'calculations', 'of', 'quark', 'distributions', 'using', 'lattice', 'qcd']] | [-0.07358191774297014, 0.18780616180584678, -0.15485917354652765, 0.13052784533738304, -0.028090272448025644, -0.025232136627342902, 0.06479734904352435, 0.41128010782501045, -0.18407914731739405, -0.2472662953659892, 0.01702383774297558, -0.28302494862626465, 0.015079809675643326, 0.12865957168572284, 0.07350694373873819, 0.13583366842396813, 0.06416432648229431, -0.03935044751950663, -0.12878198756502485, -0.18411460086562723, 0.35482862737592097, 0.02721520870888852, 0.25866745548972964, 0.14099164380920384, 0.09996894973479563, 0.05871714279604724, -0.04462668793890977, -0.0377468113568816, -0.13706638500586432, 0.09323944157551763, 0.20785864864647352, 0.04336364432853067, 0.13937716333872094, -0.3610313647022506, -0.18280141958461651, 0.04507406143787897, 0.12839404218127284, 0.11846463326891919, -0.07051347490215569, -0.22092799927582438, 0.060358024812918507, -0.208961970814205, -0.1495893540054138, -0.1167621875296013, -0.015801623093517812, 0.009734429970366072, -0.3627866623431163, 0.082672548352934, -0.10215831476808437, 0.03264258024089185, 0.004386177343615102, -0.21880465070277733, -0.04232727726130694, 0.09722460504239074, 0.08176761500966814, 0.13133175656164311, 0.11683652015569848, -0.2141566399796778, -0.12244899286273515, 0.454529275344509, -0.03520179036477546, -0.1798327480923859, 0.09530774668245665, -0.19574551448832214, -0.1378388621093143, 0.13721139867403456, 0.19974182682103073, 0.0816988656028253, -0.16579267452910262, 0.0768637523551489, -0.040867586013913715, 0.16726672223039885, 0.04992385951687916, 0.028950819341500976, 0.2245155402968796, 0.1871509979619592, -0.038949279207955906, 0.09186208871399702, -0.1051237478430541, -0.13952207036386682, -0.3633043163473595, -0.06784884397265555, -0.18153774054756142, 0.06180382606722766, -0.1325044491098214, -0.15841724978373298, 0.4133670882427327, 0.13620386011063843, 0.2530374816917586, 0.0648504881834049, 0.29002219139826746, 0.1351948992287705, 0.094212315803095, 0.0666465740914474, 0.21745329559341353, 0.17625193823269517, 0.11803330431912229, -0.21801431671241825, -0.013701643289576442, 0.05461569114605773] |
1,803.02686 | On the total neighbour sum distinguishing index of graphs with bounded
maximum average degree | A proper total $k$-colouring of a graph $G=(V,E)$ is an assignment $c : V
\cup E\to \{1,2,\ldots,k\}$ of colours to the edges and the vertices of $G$
such that no two adjacent edges or vertices and no edge and its end-vertices
are associated with the same colour. A total neighbour sum distinguishing
$k$-colouring, or tnsd $k$-colouring for short, is a proper total $k$-colouring
such that $\sum_{e\ni u}c(e)+c(u)\neq \sum_{e\ni v}c(e)+c(v)$ for every edge
$uv$ of $G$. We denote by $\chi''_{\Sigma}(G)$ the total neighbour sum
distinguishing index of $G$, which is the least integer $k$ such that a tnsd
edge $k$-colouring of $G$ exists. It has been conjectured that
$\chi''_{\Sigma}(G) \leq \Delta(G) + 3$ for every graph $G$. In this paper we
confirm this conjecture for any graph $G$ with ${\rm mad}(G)<\frac{14}{3}$ and
$\Delta(G) \geq 8$.
| math.CO | a proper total kcolouring of a graph gve is an assignment c v cup eto 12ldotsk of colours to the edges and the vertices of g such that no two adjacent edges or vertices and no edge and its endvertices are associated with the same colour a total neighbour sum distinguishing kcolouring or tnsd kcolouring for short is a proper total kcolouring such that sum_eni ucecuneq sum_eni vcecv for every edge uv of g we denote by chi_sigmag the total neighbour sum distinguishing index of g which is the least integer k such that a tnsd edge kcolouring of g exists it has been conjectured that chi_sigmag leq deltag 3 for every graph g in this paper we confirm this conjecture for any graph g with rm madgfrac143 and deltag geq 8 | [['a', 'proper', 'total', 'kcolouring', 'of', 'a', 'graph', 'gve', 'is', 'an', 'assignment', 'c', 'v', 'cup', 'eto', '12ldotsk', 'of', 'colours', 'to', 'the', 'edges', 'and', 'the', 'vertices', 'of', 'g', 'such', 'that', 'no', 'two', 'adjacent', 'edges', 'or', 'vertices', 'and', 'no', 'edge', 'and', 'its', 'endvertices', 'are', 'associated', 'with', 'the', 'same', 'colour', 'a', 'total', 'neighbour', 'sum', 'distinguishing', 'kcolouring', 'or', 'tnsd', 'kcolouring', 'for', 'short', 'is', 'a', 'proper', 'total', 'kcolouring', 'such', 'that', 'sum_eni', 'ucecuneq', 'sum_eni', 'vcecv', 'for', 'every', 'edge', 'uv', 'of', 'g', 'we', 'denote', 'by', 'chi_sigmag', 'the', 'total', 'neighbour', 'sum', 'distinguishing', 'index', 'of', 'g', 'which', 'is', 'the', 'least', 'integer', 'k', 'such', 'that', 'a', 'tnsd', 'edge', 'kcolouring', 'of', 'g', 'exists', 'it', 'has', 'been', 'conjectured', 'that', 'chi_sigmag', 'leq', 'deltag', '3', 'for', 'every', 'graph', 'g', 'in', 'this', 'paper', 'we', 'confirm', 'this', 'conjecture', 'for', 'any', 'graph', 'g', 'with', 'rm', 'madgfrac143', 'and', 'deltag', 'geq', '8']] | [-0.23254886400834548, 0.14798565419845916, -0.03110552147969486, -0.03429203215843492, -0.11739709943268947, -0.16359276223311744, 0.06569814074538853, 0.45557388126498133, -0.23848791075063738, -0.34767777125138466, 0.03113156892120926, -0.39515501059643104, -0.12083999603559578, 0.020336996532947293, -0.07062223514974646, -0.04586609055179971, 0.11625887686386704, 0.12089086456341654, 0.06997328712128278, -0.22130377201237864, 0.2360250528417821, -0.12798150731470642, 0.1124015264781412, 0.11922222895430416, 0.10899480644202843, 0.08297213154485611, 0.009882262427594483, 0.11055480716126699, -0.19026113356079533, 0.020348794321991562, 0.23280257610310837, 0.16450605797214712, 0.2889241168246143, -0.32974316919814634, -0.1548573260881212, 0.28814862407450603, 0.08543541869441942, -0.06026619525101975, 0.011727422409815582, -0.152264718699643, 0.21153889245932966, -0.13547529605781938, -0.055142309732999155, 0.10965921390273674, 0.26227997310870277, -0.03906796652618356, -0.33174338873373127, -0.030960939795248152, 0.100870346525816, 0.05286290206695269, 0.09112047356293046, -0.22887644538010551, -0.15902836293011435, 0.10819280636496842, -0.10392366686109894, 0.18337562962207854, -0.014711028248196336, -0.13494739469918093, -0.18618643055779963, 0.3977143518392026, -0.06617668082966931, -0.07342651465130369, 0.10244943765835382, -0.1118398449442342, -0.18154515206857813, 0.10568741803959482, 0.05240022593478518, 0.16755891192381775, -0.0756095223876787, 0.12891038379441272, -0.13459626716510284, 0.10550914513401863, 0.11200046615939088, 0.010477239872864265, 0.16569779915955124, 0.09616668543624361, 0.20828059582611708, 0.11267292746489384, -0.031172163872961248, 0.17769145953842974, -0.3541571821680102, -0.1455225246045445, -0.2949634998978123, 0.10875617140742737, -0.18720342519493247, -0.15426497629249658, 0.39005382892888363, 0.05503505659582988, 0.20015799782172902, 0.10115398101482952, 0.22663575245386475, 0.10182415456401081, 0.05282692623775687, 0.22925389091315584, 0.08080847075531684, 0.17402130961014822, -0.120382937844696, -0.20932046044984554, 0.042968130349658254, 0.1325183978568264] |
1,803.02687 | Interaction-Induced Wave Function Collapse Respects Conservation Laws | Because quantum measurements have probabilistic outcomes they can seem to
violate conservation laws in individual experiments. Despite these appearances,
strict conservation of momentum, orbital angular momentum, and energy can be
shown to be consistent with the assumption that the entangling interactions
that constitute measurements induce a real collapse of the wave function. The
essential idea is that measured systems always have some pre-existing
entanglement relations with (usually larger) systems, and that apparent changes
in conserved quantities in the measured system are correlated with compensating
changes in these larger systems. Since wave function collapse is mediated by
entanglement relations a full accounting of the relevant quantities requires a
computation over all interacting, entangled systems. The demonstrations by
Gemmer and Mahler[1], and by Durt[2,3], that entanglement is a generic result
of interaction are central to the argument. A stochastic collapse equation
based on interaction potentials is described and shown to guarantee
conservation of the relevant quantities at all stages of evolution.
| quant-ph | because quantum measurements have probabilistic outcomes they can seem to violate conservation laws in individual experiments despite these appearances strict conservation of momentum orbital angular momentum and energy can be shown to be consistent with the assumption that the entangling interactions that constitute measurements induce a real collapse of the wave function the essential idea is that measured systems always have some preexisting entanglement relations with usually larger systems and that apparent changes in conserved quantities in the measured system are correlated with compensating changes in these larger systems since wave function collapse is mediated by entanglement relations a full accounting of the relevant quantities requires a computation over all interacting entangled systems the demonstrations by gemmer and mahler1 and by durt23 that entanglement is a generic result of interaction are central to the argument a stochastic collapse equation based on interaction potentials is described and shown to guarantee conservation of the relevant quantities at all stages of evolution | [['because', 'quantum', 'measurements', 'have', 'probabilistic', 'outcomes', 'they', 'can', 'seem', 'to', 'violate', 'conservation', 'laws', 'in', 'individual', 'experiments', 'despite', 'these', 'appearances', 'strict', 'conservation', 'of', 'momentum', 'orbital', 'angular', 'momentum', 'and', 'energy', 'can', 'be', 'shown', 'to', 'be', 'consistent', 'with', 'the', 'assumption', 'that', 'the', 'entangling', 'interactions', 'that', 'constitute', 'measurements', 'induce', 'a', 'real', 'collapse', 'of', 'the', 'wave', 'function', 'the', 'essential', 'idea', 'is', 'that', 'measured', 'systems', 'always', 'have', 'some', 'preexisting', 'entanglement', 'relations', 'with', 'usually', 'larger', 'systems', 'and', 'that', 'apparent', 'changes', 'in', 'conserved', 'quantities', 'in', 'the', 'measured', 'system', 'are', 'correlated', 'with', 'compensating', 'changes', 'in', 'these', 'larger', 'systems', 'since', 'wave', 'function', 'collapse', 'is', 'mediated', 'by', 'entanglement', 'relations', 'a', 'full', 'accounting', 'of', 'the', 'relevant', 'quantities', 'requires', 'a', 'computation', 'over', 'all', 'interacting', 'entangled', 'systems', 'the', 'demonstrations', 'by', 'gemmer', 'and', 'mahler1', 'and', 'by', 'durt23', 'that', 'entanglement', 'is', 'a', 'generic', 'result', 'of', 'interaction', 'are', 'central', 'to', 'the', 'argument', 'a', 'stochastic', 'collapse', 'equation', 'based', 'on', 'interaction', 'potentials', 'is', 'described', 'and', 'shown', 'to', 'guarantee', 'conservation', 'of', 'the', 'relevant', 'quantities', 'at', 'all', 'stages', 'of', 'evolution']] | [-0.17060382291226864, 0.19740289218652135, -0.09651415794080374, 0.08855714121511063, -0.023274585174826477, -0.14163020669291607, -0.02219698774532821, 0.32032726977904064, -0.22625746033512628, -0.33333780309662986, 0.06506501379697464, -0.29185180842446595, -0.11784499787385218, 0.19059930951633036, -0.005689347816372994, 0.07752699381970347, 0.07802286653000359, 0.006272865027989237, -0.08956845987361306, -0.1962261548719536, 0.3459515107753806, 0.04474269924610734, 0.2772017045973394, 0.057247338067286484, 0.11348130816044524, -0.008337543566878408, -0.02590416410030463, 0.05384344172265488, -0.08137927503435677, 0.07529931026818723, 0.2369246913085823, 0.12281696296308954, 0.23067474633288115, -0.44627471134448665, -0.22816930949939446, 0.11830856802594215, 0.14443010784658, 0.13499595801262423, -0.024836453262907572, -0.26171285227144087, 0.02776140845171773, -0.1748206350289715, -0.13121623358725068, -0.11955461593177648, 0.06248911892254956, 0.07227690528648403, -0.2572643660152188, 0.143711189520008, 0.06491700380604762, 0.021774497563735798, -0.0828906670317221, -0.02822087423872943, -0.07942480440191829, 0.11327135404094289, 0.04316531370829743, 0.004343292666957355, 0.15572313722431994, -0.11976274498439847, -0.11175213305679603, 0.38835895248354435, -0.009697828380665623, -0.23603024209539095, 0.2070304141887344, -0.17305162787297143, -0.11306166865053968, 0.12861806461706948, 0.13334013936065064, 0.08912074418428044, -0.16664997462887698, 0.026949789901594228, -0.0014276463500722551, 0.1666818607526903, 0.0325187851207701, 0.10906753862181152, 0.2675989910673637, 0.08921811685043697, 0.03271329898136453, 0.07551912118633015, 0.0011147489810052018, -0.16242870339789453, -0.32285565813669026, -0.14037679038749326, -0.22285354284320372, 0.06467829338688692, -0.06282163117905909, -0.10351049737782421, 0.33948169617603224, 0.1548181252542119, 0.19472847342303096, 0.03341060110743946, 0.2749363149110323, 0.16461795629211104, 0.1566340820177291, 0.05915335305512716, 0.2920645134408215, 0.13102759953247956, 0.09023139681234263, -0.22833752647663155, 0.11576579913544731, 0.01980250655936125] |
1,803.02688 | Ordering states with various coherence measures | Quantum coherence is one of the most significant theories in quantum physics.
Ordering states with various coherence measures is an intriguing task in
quantification theory of coherence. In this paper, we study this problem by use
of four important coherence measures -- the $l_1$ norm of coherence, the
relative entropy of coherence, the geometric measure of coherence and the
modified trace distance measure of coherence. We show that each pair of these
measures give a different ordering of qudit states when $d\geq 3$. However, for
single-qubit states, the $l_1$ norm of coherence and the geometric coherence
provide the same ordering. We also show that the relative entropy of coherence
and the geometric coherence give a different ordering for single-qubit states.
Then we partially answer the open question proposed in [Quantum Inf. Process.
15, 4189 (2016)] whether all the coherence measures give a different ordering
of states.
| quant-ph | quantum coherence is one of the most significant theories in quantum physics ordering states with various coherence measures is an intriguing task in quantification theory of coherence in this paper we study this problem by use of four important coherence measures the l_1 norm of coherence the relative entropy of coherence the geometric measure of coherence and the modified trace distance measure of coherence we show that each pair of these measures give a different ordering of qudit states when dgeq 3 however for singlequbit states the l_1 norm of coherence and the geometric coherence provide the same ordering we also show that the relative entropy of coherence and the geometric coherence give a different ordering for singlequbit states then we partially answer the open question proposed in quantum inf process 15 4189 2016 whether all the coherence measures give a different ordering of states | [['quantum', 'coherence', 'is', 'one', 'of', 'the', 'most', 'significant', 'theories', 'in', 'quantum', 'physics', 'ordering', 'states', 'with', 'various', 'coherence', 'measures', 'is', 'an', 'intriguing', 'task', 'in', 'quantification', 'theory', 'of', 'coherence', 'in', 'this', 'paper', 'we', 'study', 'this', 'problem', 'by', 'use', 'of', 'four', 'important', 'coherence', 'measures', 'the', 'l_1', 'norm', 'of', 'coherence', 'the', 'relative', 'entropy', 'of', 'coherence', 'the', 'geometric', 'measure', 'of', 'coherence', 'and', 'the', 'modified', 'trace', 'distance', 'measure', 'of', 'coherence', 'we', 'show', 'that', 'each', 'pair', 'of', 'these', 'measures', 'give', 'a', 'different', 'ordering', 'of', 'qudit', 'states', 'when', 'dgeq', '3', 'however', 'for', 'singlequbit', 'states', 'the', 'l_1', 'norm', 'of', 'coherence', 'and', 'the', 'geometric', 'coherence', 'provide', 'the', 'same', 'ordering', 'we', 'also', 'show', 'that', 'the', 'relative', 'entropy', 'of', 'coherence', 'and', 'the', 'geometric', 'coherence', 'give', 'a', 'different', 'ordering', 'for', 'singlequbit', 'states', 'then', 'we', 'partially', 'answer', 'the', 'open', 'question', 'proposed', 'in', 'quantum', 'inf', 'process', '15', '4189', '2016', 'whether', 'all', 'the', 'coherence', 'measures', 'give', 'a', 'different', 'ordering', 'of', 'states']] | [-0.14950852805812812, 0.22356667926882248, -0.09885688584402268, 0.12570254766942526, 0.07282390452696588, -0.13614652637263824, 0.037866896023203075, 0.3689036225129304, -0.31338626566776556, -0.2590470378608282, 0.07491207648518271, -0.2859771977210867, -0.1031587020333471, 0.13025078121572733, -0.07102692807414408, 0.11420071620799216, 0.043692253663300956, 0.09318026585428141, -0.12177413401097573, -0.2655401719348698, 0.33981368811158785, -0.004446185087174948, 0.3019365287546454, 0.11918335524467943, 0.11479407303549093, 0.016074448393593576, 0.03950698868339432, -0.010964612987149378, -0.15852950910509742, 0.1522330974489611, 0.2523598244285275, 0.20312357517922747, 0.26575548111878594, -0.36929861181255047, -0.20461535088011418, 0.09546386629768551, 0.07871810883636876, 0.10266172531430193, -0.0003191044618343485, -0.3125360837013557, 0.042672806326299904, -0.1278997419723149, -0.02171279551975172, -0.09349737666097695, 0.0708692939117037, -0.05159338096012201, -0.20942061177358545, 0.10865608201952298, 0.1436512790464772, 0.09957732807459502, -0.03693858831157458, -0.0670354543510696, 0.05598197232867623, 0.13757791029678754, -0.019332394933541042, 0.03708483137928977, 0.081281995355826, -0.08574419926916217, -0.20499526690370565, 0.3194193187073387, -0.0391216109121411, -0.19360835579191815, 0.15701904946231637, -0.1575485048590806, -0.11384535323314626, 0.029479823179607248, 0.11432320015697643, 0.10750640304116853, -0.1238464243040653, 0.03778330190950234, -0.05164043167927142, 0.18650111097697938, 0.08130227665834386, 0.2061947595970384, 0.14764407566138382, 0.09483176204375923, 0.1597285546972577, 0.1884960639708001, -0.07548871054956369, -0.12146108820070994, -0.32007555641747754, -0.23377673281998984, -0.20464008761457456, 0.1026056170013958, -0.10233504834297869, -0.12244832646744004, 0.4167947171063259, 0.18487845720273668, 0.21840067744126607, 0.02437114285401486, 0.22623533548723007, 0.10022582237383929, 0.009639598231698418, 0.040257670081236624, 0.1951478252508517, 0.19365469324683512, 0.014716423254717012, -0.297489629252332, 0.0643426977708165, 0.05153488240622241] |
1,803.02689 | Understanding the anomalous thermal behavior of sigma 3 grain boundaries
in a variety of FCC metals | We present a case study of the complex temperature dependence of grain
boundary mobility. The same general incoherent twin boundary in different FCC
metals is found to display antithermal, thermal, and mixed mobility during
molecular dynamics synthetic driving force simulations. A recently developed
energy metric known as the generalized interfacial fault energy (GIFE) surface
is used to show that twin boundaries moving in an antithermal manner have a
lower energetic barrier to motion than twin boundaries moving in a thermally
activated manner. Predicting the temperature dependence of grain boundary
motion with GIFE curves stands to accelerate research in grain boundary
science.
| cond-mat.mtrl-sci | we present a case study of the complex temperature dependence of grain boundary mobility the same general incoherent twin boundary in different fcc metals is found to display antithermal thermal and mixed mobility during molecular dynamics synthetic driving force simulations a recently developed energy metric known as the generalized interfacial fault energy gife surface is used to show that twin boundaries moving in an antithermal manner have a lower energetic barrier to motion than twin boundaries moving in a thermally activated manner predicting the temperature dependence of grain boundary motion with gife curves stands to accelerate research in grain boundary science | [['we', 'present', 'a', 'case', 'study', 'of', 'the', 'complex', 'temperature', 'dependence', 'of', 'grain', 'boundary', 'mobility', 'the', 'same', 'general', 'incoherent', 'twin', 'boundary', 'in', 'different', 'fcc', 'metals', 'is', 'found', 'to', 'display', 'antithermal', 'thermal', 'and', 'mixed', 'mobility', 'during', 'molecular', 'dynamics', 'synthetic', 'driving', 'force', 'simulations', 'a', 'recently', 'developed', 'energy', 'metric', 'known', 'as', 'the', 'generalized', 'interfacial', 'fault', 'energy', 'gife', 'surface', 'is', 'used', 'to', 'show', 'that', 'twin', 'boundaries', 'moving', 'in', 'an', 'antithermal', 'manner', 'have', 'a', 'lower', 'energetic', 'barrier', 'to', 'motion', 'than', 'twin', 'boundaries', 'moving', 'in', 'a', 'thermally', 'activated', 'manner', 'predicting', 'the', 'temperature', 'dependence', 'of', 'grain', 'boundary', 'motion', 'with', 'gife', 'curves', 'stands', 'to', 'accelerate', 'research', 'in', 'grain', 'boundary', 'science']] | [-0.13309649525136494, 0.20382619745430589, -0.10692000686015823, 0.039346144232659204, -0.06991211769383142, -0.13875901036075142, 0.015163224212949782, 0.40332531652385645, -0.26995939715352774, -0.3370266636962643, 0.04052601176046646, -0.23541902653909852, -0.0993502477211601, 0.16032454521754885, -0.06072134182152758, 0.049413706581707635, 0.029310547136834196, -0.008419147406769271, -0.014999854680390494, -0.17158072569988447, 0.2658807165173832, 0.05361371590078135, 0.335605214054853, 0.07375146499039642, 0.03253606030957239, -0.032705456739992346, 0.04435127877139274, 0.047966769020451175, -0.16788535103431526, 0.08342487866169598, 0.2187716059276078, -0.07763338852489349, 0.20796621335430607, -0.47228307701130906, -0.29055671889500895, 0.06998162175007717, 0.11457260192768408, 0.10061114339508337, -0.08421429537126038, -0.21991095769606384, 0.030319649816057323, -0.09932130355258832, -0.18763920473681744, -0.006558875790751069, 0.04505549799097647, -0.023195156931305434, -0.23738759338606777, 0.13001229082888896, 0.014154065093763246, 0.10292356463822325, -0.14023046720182836, -0.09665794686142282, -0.10791899143063491, 0.08597749990000768, 0.028923249619063174, 0.032188411993389524, 0.21411921428332087, -0.09402985283978155, -0.09219615925380056, 0.3756211455358137, -0.037818317354736286, -0.15573756935508312, 0.25086899494549425, -0.16635658198248338, -0.07354452707205374, 0.17064516638903557, 0.17520865041066402, 0.11986698639016635, -0.18297068474556108, 0.0329901039465515, 0.026217351132764084, 0.11244655382764147, 0.11007914896870014, -0.039883670523315484, 0.21143012521511848, 0.20019159225359706, 0.05153326399273949, 0.18042153367279373, -0.13737257044891468, -0.1126328934408208, -0.24873291724130953, -0.18057089021410977, -0.1636227423297518, 0.012946369476837687, -0.08548632316221598, -0.21819039327000259, 0.309647438356118, 0.1425233011843987, 0.17059432798166677, -0.028602187733839053, 0.2553233944829369, 0.0853622322798347, 0.04620655489126497, 0.10805084464131015, 0.20348250426554887, 0.10076530484279783, 0.1280189432332864, -0.25242649727860594, 0.07989169360774726, 0.04011258527193919] |
1,803.0269 | Comparison of 35 and 50 {\mu}m thin HPK UFSD after neutron irradiation
up to 6*10^15 neq/cm^2 | We report results from the testing of 35 {\mu}m thick Ultra-Fast Silicon
Detectors (UFSD produced by Hamamatsu Photonics (HPK), Japan and the comparison
of these new results to data reported before on 50 {\mu}m thick UFSD produced
by HPK. The 35 {\mu}m thick sensors were irradiated with neutrons to fluences
of 0, 1*10^14, 1*10^15, 3*10^15, 6*10^15 neq/cm^2. The sensors were tested
pre-irradiation and post-irradiation with minimum ionizing particles (MIPs)
from a 90Sr \b{eta}-source. The leakage current, capacitance, internal gain and
the timing resolution were measured as a function of bias voltage at -20C and
-27C. The timing resolution was extracted from the time difference with a
second calibrated UFSD in coincidence, using the constant fraction method for
both. Within the fluence range measured, the advantage of the 35 {\mu}m thick
UFSD in timing accuracy, bias voltage and power can be established.
| physics.ins-det hep-ex | we report results from the testing of 35 mum thick ultrafast silicon detectors ufsd produced by hamamatsu photonics hpk japan and the comparison of these new results to data reported before on 50 mum thick ufsd produced by hpk the 35 mum thick sensors were irradiated with neutrons to fluences of 0 11014 11015 31015 61015 neqcm2 the sensors were tested preirradiation and postirradiation with minimum ionizing particles mips from a 90sr betasource the leakage current capacitance internal gain and the timing resolution were measured as a function of bias voltage at 20c and 27c the timing resolution was extracted from the time difference with a second calibrated ufsd in coincidence using the constant fraction method for both within the fluence range measured the advantage of the 35 mum thick ufsd in timing accuracy bias voltage and power can be established | [['we', 'report', 'results', 'from', 'the', 'testing', 'of', '35', 'mum', 'thick', 'ultrafast', 'silicon', 'detectors', 'ufsd', 'produced', 'by', 'hamamatsu', 'photonics', 'hpk', 'japan', 'and', 'the', 'comparison', 'of', 'these', 'new', 'results', 'to', 'data', 'reported', 'before', 'on', '50', 'mum', 'thick', 'ufsd', 'produced', 'by', 'hpk', 'the', '35', 'mum', 'thick', 'sensors', 'were', 'irradiated', 'with', 'neutrons', 'to', 'fluences', 'of', '0', '11014', '11015', '31015', '61015', 'neqcm2', 'the', 'sensors', 'were', 'tested', 'preirradiation', 'and', 'postirradiation', 'with', 'minimum', 'ionizing', 'particles', 'mips', 'from', 'a', '90sr', 'betasource', 'the', 'leakage', 'current', 'capacitance', 'internal', 'gain', 'and', 'the', 'timing', 'resolution', 'were', 'measured', 'as', 'a', 'function', 'of', 'bias', 'voltage', 'at', '20c', 'and', '27c', 'the', 'timing', 'resolution', 'was', 'extracted', 'from', 'the', 'time', 'difference', 'with', 'a', 'second', 'calibrated', 'ufsd', 'in', 'coincidence', 'using', 'the', 'constant', 'fraction', 'method', 'for', 'both', 'within', 'the', 'fluence', 'range', 'measured', 'the', 'advantage', 'of', 'the', '35', 'mum', 'thick', 'ufsd', 'in', 'timing', 'accuracy', 'bias', 'voltage', 'and', 'power', 'can', 'be', 'established']] | [-0.006261009433572846, 0.14663415028314505, -0.005389720474236778, -0.006595471281824367, 0.03824904590312924, -0.1367056042920532, 0.04141455920679229, 0.4396271086946529, -0.18304186406645126, -0.4386448494823916, 0.0755246868939139, -0.34936710369241025, 0.07081867832291339, 0.24637252800166606, -0.06273914791942974, 0.07865428382813532, 0.03006420927787466, -0.09379816098537828, -0.014581087926801826, -0.19544087913107952, 0.15988144202357424, 0.13393552187959099, 0.2634455463715962, 0.05990726850660784, 0.15271611647788502, -0.06509575404966848, -0.040484064032456704, -0.011825907453229385, -0.1359045948068212, 0.03854010127418275, 0.24975026120331936, 0.02599719184883205, 0.17970391605714603, -0.4093349920452705, -0.16803144796618394, 0.04912163462223751, 0.055443140762924614, 0.0015000127790179769, -0.0684828733800844, -0.28767920478380155, 0.12311831828888639, -0.16491307445768533, -0.09107866535112927, 0.059858245901497346, 0.00831930398552296, 0.0791310710599646, -0.21487143924459814, 0.06288595854046954, -0.038522100248207736, 0.08441434809938073, -0.06647612961491436, -0.1741475925331802, -0.02798978441860527, 0.05986366258543317, -0.03339458703495828, 0.042933527613058686, 0.2392459780144106, -0.07215727332846394, -0.10121277434185945, 0.24785965669101903, -0.09784770890338612, -0.0397034203567143, 0.12867299291143094, -0.18896162493952684, -0.01545355442046587, 0.24558242005296052, 0.11750434729869344, 0.08672855578895126, -0.1761706143418061, 0.011633467885050257, 0.06729459278285503, 0.29622863277659883, 0.18655823621998674, 0.037834915405671514, 0.2009434416491006, 0.21793128225919126, -0.03027538147621921, 0.11734287445100823, -0.2703188035221371, 0.05258923626554731, -0.2697336224963822, -0.10764937372857405, -0.11988637978876275, 0.10810315945626436, -0.07843478814663415, -0.062081354167977616, 0.36121868845075367, 0.11972937583590725, 0.15346102224928992, 0.020315533251102483, 0.32686436930671336, 0.06843734203970858, 0.10354199734616226, 0.005421270556481821, 0.31783953126786013, 0.13960746388183906, 0.14780854827175582, -0.19127509381443294, 0.0341557050872195, -0.048378071729842174] |
1,803.02691 | Bialgebra Coverings and Transfer of Structure | We introduce the bicategory of bialgebras with coverings (which can be
thought of as coalgebra-indexed families of morphisms), and provide a
motivating application to the transfer of formulas for primitives and antipode.
Additionally, we study properties of this bicategory and various
sub-bicategories, and describe some universal constructions. Finally, we
generalize Nichols' result on bialgebra quotients of Hopf algebra, which gives
conditions on when the resulting bialgebra quotient is a Hopf algebra.
| math.RA math.CO | we introduce the bicategory of bialgebras with coverings which can be thought of as coalgebraindexed families of morphisms and provide a motivating application to the transfer of formulas for primitives and antipode additionally we study properties of this bicategory and various subbicategories and describe some universal constructions finally we generalize nichols result on bialgebra quotients of hopf algebra which gives conditions on when the resulting bialgebra quotient is a hopf algebra | [['we', 'introduce', 'the', 'bicategory', 'of', 'bialgebras', 'with', 'coverings', 'which', 'can', 'be', 'thought', 'of', 'as', 'coalgebraindexed', 'families', 'of', 'morphisms', 'and', 'provide', 'a', 'motivating', 'application', 'to', 'the', 'transfer', 'of', 'formulas', 'for', 'primitives', 'and', 'antipode', 'additionally', 'we', 'study', 'properties', 'of', 'this', 'bicategory', 'and', 'various', 'subbicategories', 'and', 'describe', 'some', 'universal', 'constructions', 'finally', 'we', 'generalize', 'nichols', 'result', 'on', 'bialgebra', 'quotients', 'of', 'hopf', 'algebra', 'which', 'gives', 'conditions', 'on', 'when', 'the', 'resulting', 'bialgebra', 'quotient', 'is', 'a', 'hopf', 'algebra']] | [-0.1559129635553699, 0.044667594364263874, -0.06804749292685934, 0.09953978449862072, -0.1911584010737462, -0.1335155375747253, -0.0022167552876677632, 0.37621983820977417, -0.4182394335883251, -0.2118192739730728, 0.12585640559900904, -0.1644480710822171, -0.21565525116317946, 0.22541738827915295, -0.22078263896843925, -0.09238598482224389, 0.1018173208433217, 0.09244471686880401, -0.1343301831866088, -0.2332198295465576, 0.46890928807366383, -0.0049041361291555395, 0.2065872463627138, 0.059333844376943896, 0.12383688601624707, -0.026455809004550825, -0.0036423935865362487, -0.03671674485709788, -0.24464352391120317, 0.08149253823996885, 0.33985396987502126, 0.08063244839887256, 0.1359339344072277, -0.36183243927856285, -0.03552033206906872, 0.13410283149341526, 0.15825082088712658, 0.07364414487223046, -0.020555939851413088, -0.31428562245075253, 0.08171112043783069, -0.28213774936570635, -0.06449637365311492, -0.16022328906895025, 0.06831844105128793, 0.0202588122304313, -0.2573889077209152, -0.06370373184968164, 0.1464331192301883, 0.15275491811874983, -0.09524808691787547, -0.07632424671918261, -0.0788230646243049, 0.08484187587105291, -0.08549708490043986, -0.02571637235055475, 0.1498692612082738, -0.08515676701832833, -0.20458301064976747, 0.3613658570347057, 0.020052556173734203, -0.2370120937720049, 0.1465637055326901, -0.13177037313985435, -0.17736927113509265, 0.044070651110234685, 0.058098421017031956, 0.1077328374258418, -0.046465189099367504, 0.14980437945021127, -0.15250852749939414, -0.025038778430957725, 0.1362545020925556, 0.07149724964646326, 0.12506071815901584, 0.1332263095958995, 0.03873901957295079, 0.23410339148519427, 0.05775035363689497, -0.0466165838736123, -0.3772397773421329, -0.19560256963460773, 0.010585202960351455, 0.1472075584385058, -0.09504339474749388, -0.2147899250621381, 0.42199934452124266, 0.1656113864644768, 0.19314640215125636, 0.1581183013715444, 0.18982356078112902, 0.05001200312593331, 0.13563666001394176, -0.005200662103522083, 0.10021280480651658, 0.332386691433688, -0.008356261175071848, -0.06514655951869444, -0.036592538182562945, 0.25482059877527796] |
1,803.02692 | The joint optimization of critical interdependent infrastructure of an
electricity-water-gas system | Electricity, water, and gas systems are critical infrastructures that are
sustaining our daily lives. This paper studies the joint operation of these
systems through a proposed optimization model and explores the advantage of
considering the system of systems. Individual and joint optimizations are
studied and compared. The numerical results show that the total electricity
cost for these three systems can be reduced by 9% via joint optimization.
Because the water system and gas system intrinsically include the storages in
their systems, the power system can use these storages as the regulation
capacity to shift load from peak hours to off-peak hours. Since the saving on
the power generation cost surpasses the incremental cost in the operation and
maintenance (O&M), the overall economic performance is improved by the joint
optimization.
| cs.SY | electricity water and gas systems are critical infrastructures that are sustaining our daily lives this paper studies the joint operation of these systems through a proposed optimization model and explores the advantage of considering the system of systems individual and joint optimizations are studied and compared the numerical results show that the total electricity cost for these three systems can be reduced by 9 via joint optimization because the water system and gas system intrinsically include the storages in their systems the power system can use these storages as the regulation capacity to shift load from peak hours to offpeak hours since the saving on the power generation cost surpasses the incremental cost in the operation and maintenance om the overall economic performance is improved by the joint optimization | [['electricity', 'water', 'and', 'gas', 'systems', 'are', 'critical', 'infrastructures', 'that', 'are', 'sustaining', 'our', 'daily', 'lives', 'this', 'paper', 'studies', 'the', 'joint', 'operation', 'of', 'these', 'systems', 'through', 'a', 'proposed', 'optimization', 'model', 'and', 'explores', 'the', 'advantage', 'of', 'considering', 'the', 'system', 'of', 'systems', 'individual', 'and', 'joint', 'optimizations', 'are', 'studied', 'and', 'compared', 'the', 'numerical', 'results', 'show', 'that', 'the', 'total', 'electricity', 'cost', 'for', 'these', 'three', 'systems', 'can', 'be', 'reduced', 'by', '9', 'via', 'joint', 'optimization', 'because', 'the', 'water', 'system', 'and', 'gas', 'system', 'intrinsically', 'include', 'the', 'storages', 'in', 'their', 'systems', 'the', 'power', 'system', 'can', 'use', 'these', 'storages', 'as', 'the', 'regulation', 'capacity', 'to', 'shift', 'load', 'from', 'peak', 'hours', 'to', 'offpeak', 'hours', 'since', 'the', 'saving', 'on', 'the', 'power', 'generation', 'cost', 'surpasses', 'the', 'incremental', 'cost', 'in', 'the', 'operation', 'and', 'maintenance', 'om', 'the', 'overall', 'economic', 'performance', 'is', 'improved', 'by', 'the', 'joint', 'optimization']] | [-0.16954798810996202, 0.03864282459812961, -0.011013399398084297, 0.023270174881710504, 0.009452067864264628, -0.11024189081635008, 0.10901720793430456, 0.37366839437637217, -0.2677456386127444, -0.3647665467488673, 0.17464216921095874, -0.2816066544669023, -0.14470958958249971, 0.2351209051282571, -0.10494023258978313, 0.0901499406737817, 0.09477331428680309, -0.01632230418559178, -0.030544450705556937, -0.2881147848196732, 0.26312713953756633, 0.13026923513718586, 0.3337897730688023, 0.040776473115766404, 0.09021715728147317, -0.015552066134779836, -0.024777995364726052, -0.012860021174906991, -0.031586162800663294, 0.15529537879926866, 0.2552375792590685, 0.16490904618300092, 0.304768423629246, -0.46025094267183037, -0.2517026660164327, 0.09216184223020203, 0.11290959978129628, 0.029665663268041702, -0.0035572171593879084, -0.2159777123971965, 0.05232389119242556, -0.22953553567820972, -0.03667701225612284, -0.10785042480637803, -0.022727862520273343, 0.08371620459929686, -0.24069732652260567, 0.048497764563346785, 0.02585262984448914, 0.04418321337926295, -0.09963849158380036, -0.13285913384454542, -0.05528059256147565, 0.15444376196169887, 0.036451363467698006, -0.04159154910630323, 0.20401656527258094, -0.11061205532827754, -0.11444505838706165, 0.4116526984775713, -0.01605475554603708, -0.1444463574060405, 0.18689127075810766, -0.09127874434167563, -0.11942452313775528, 0.14820476503349667, 0.24585465615156807, 0.03980221702760562, -0.18425749143397854, 0.0189030195754238, 0.034470320758662486, 0.18094399340573497, 0.027120851994629287, 0.04020943090882759, 0.2144404829429217, 0.20960555559154168, 0.11370051281829906, 0.1406301154525835, -0.059010163900738426, -0.12188931808503735, -0.20781193083773056, -0.15743032690902897, -0.16364843053914707, -0.00011064539945056272, -0.06214185890334644, -0.02694541519569132, 0.389446793362325, 0.14256052255572738, 0.12379822643950235, 0.09077875621981428, 0.38044001554795936, 0.15491619960643177, 0.07406207738389385, 0.11399695183359837, 0.2146748481607137, 0.006721596901355557, 0.20063116132144548, -0.28262386855293903, 0.07742137133049988, -0.0028720422640673873] |
1,803.02693 | Generic smooth representations | Let $F$ be a non-archimedean local field. In this paper we explore genericity
of irreducible smooth representations of $GL_n(F)$ by restriction to a maximal
compact subgroup $K$ of $GL_n(F)$. Let $(J, \lambda)$ be a Bushnell--Kutzko
type for a Bernstein component $\Omega$. The work of Schneider--Zink gives an
irreducible $K$-representation $\sigma_{min}(\lambda)$, which appears with
multiplicity one in $\mathrm{Ind}_J^K \lambda$. Let $\pi$ be an irreducible
smooth representation of $GL_n(F)$ in $\Omega$. We will prove that $\pi$ is
generic if and only if $\sigma_{min}(\lambda)$ is contained in $\pi$ with
multiplicity one.
| math.NT math.RT | let f be a nonarchimedean local field in this paper we explore genericity of irreducible smooth representations of gl_nf by restriction to a maximal compact subgroup k of gl_nf let j lambda be a bushnellkutzko type for a bernstein component omega the work of schneiderzink gives an irreducible krepresentation sigma_minlambda which appears with multiplicity one in mathrmind_jk lambda let pi be an irreducible smooth representation of gl_nf in omega we will prove that pi is generic if and only if sigma_minlambda is contained in pi with multiplicity one | [['let', 'f', 'be', 'a', 'nonarchimedean', 'local', 'field', 'in', 'this', 'paper', 'we', 'explore', 'genericity', 'of', 'irreducible', 'smooth', 'representations', 'of', 'gl_nf', 'by', 'restriction', 'to', 'a', 'maximal', 'compact', 'subgroup', 'k', 'of', 'gl_nf', 'let', 'j', 'lambda', 'be', 'a', 'bushnellkutzko', 'type', 'for', 'a', 'bernstein', 'component', 'omega', 'the', 'work', 'of', 'schneiderzink', 'gives', 'an', 'irreducible', 'krepresentation', 'sigma_minlambda', 'which', 'appears', 'with', 'multiplicity', 'one', 'in', 'mathrmind_jk', 'lambda', 'let', 'pi', 'be', 'an', 'irreducible', 'smooth', 'representation', 'of', 'gl_nf', 'in', 'omega', 'we', 'will', 'prove', 'that', 'pi', 'is', 'generic', 'if', 'and', 'only', 'if', 'sigma_minlambda', 'is', 'contained', 'in', 'pi', 'with', 'multiplicity', 'one']] | [-0.22096378394607677, 0.1242267177748588, -0.1770918539924813, -0.046720510541317276, -0.137932071040961, -0.16084185136216028, -0.07042856807016679, 0.30611015582412837, -0.33325341303411515, -0.12845940270372444, 0.015034619380631262, -0.24818814271185102, -0.06558986068038004, 0.17077852874561877, -0.12549261640136442, -0.11605705354096633, 0.04919478638718525, 0.17636116512031072, -0.06680629709790949, -0.2187776310990254, 0.3863773936228383, -0.1179845754633702, 0.13424255053541856, 0.041194130378287466, 0.07906229070864529, 0.04238768779517462, 0.04517234603519596, -0.051833225962972004, -0.15345653851970079, 0.14453118679618152, 0.3864039591557923, 0.09730147444255029, 0.2527351601221155, -0.3146509918428603, -0.12519904431177392, 0.3260772635417414, 0.1821081657018069, -0.06782738762004079, 0.02275628216531394, -0.2954056020618217, 0.2041631141744022, -0.1614097886541415, -0.19991983851927908, -0.0748544356370292, 0.14862888466727564, -0.02335030607701767, -0.3315895748369041, 0.017815998237589763, 0.13243224003928758, 0.1498200908702399, -0.0370873895839655, -0.140337567676657, -0.04472733201414701, -0.0019604168011851256, -0.03379639390567761, 0.19201048392070724, 0.037068999908764715, -0.08901825719346691, -0.07171379076871312, 0.3619127698863546, -0.12166056448283295, -0.26097551647052614, 0.11407645518470201, -0.21442312730054947, -0.13995630646656668, 0.13243598799731227, 0.11725898589273649, 0.13522697037496118, -0.047193168984016494, 0.2551513338964599, -0.13481814405670212, 0.1258400506152871, 0.07304370014130004, -0.03591740238230808, 0.1445085778139487, 0.07295174324618918, 0.10316075588620845, 0.1108001217348612, 0.019498661847873813, 0.120118213994872, -0.39918238678503604, -0.17567012301601825, -0.12767846369838698, 0.19988703479369482, -0.0749631983647608, -0.11795860293897845, 0.37135245588918525, 0.012903980367506543, 0.22736077937519267, 0.10276047621958978, 0.19238844182386639, 0.1193882931173513, 0.010288980257298266, 0.11306696092443806, 0.052321684679814746, 0.23706394306749903, -0.10231454750256878, -0.15971976819093384, -0.00705044605447689, 0.15215476771395298] |
1,803.02694 | Non-uniform dependence for a generalized Degasperis-Procesi equation | In the paper, we consider the Cauchy problem for a generalized
Degasperis-Procesi equation. We prove that the data-to-solution map is not
uniformly continuous.
| math.AP | in the paper we consider the cauchy problem for a generalized degasperisprocesi equation we prove that the datatosolution map is not uniformly continuous | [['in', 'the', 'paper', 'we', 'consider', 'the', 'cauchy', 'problem', 'for', 'a', 'generalized', 'degasperisprocesi', 'equation', 'we', 'prove', 'that', 'the', 'datatosolution', 'map', 'is', 'not', 'uniformly', 'continuous']] | [-0.13473298003816087, 0.024476969533640404, -0.08742423993332879, 0.09122544400009286, -0.0962440176340549, -0.11243802064057926, -0.04118365486172716, 0.32400030545566394, -0.4164582060083099, -0.08124264191998087, 0.14778167182964314, -0.3063444620322274, -0.22178474781305893, 0.15777116528023843, -0.1195641235731866, 0.10445282835027446, 0.09419305663069953, 0.03058560646098593, -0.11162685273903543, -0.20891943161942714, 0.4315764729095542, -0.1290114746560626, 0.22697851968848187, 0.056829461260982185, 0.20895167262009953, 0.02387329334717082, 0.03471621117838051, -0.010791718149962633, -0.2109073038917141, 0.04241547664202264, 0.24872936130217885, 0.10904089445450707, 0.30045070563969406, -0.36483142954175884, -0.246962395861097, 0.26192899501842, 0.13230427362672662, 0.082058718468508, -0.03774081228260437, -0.27267572162267956, 0.10987475750279492, -0.12262665901495062, -0.20379560080397388, -0.0008235011735688086, 0.005625811445972194, 0.07616176739658999, -0.2838670157260545, 0.12960672054601752, 0.14741773692810017, -0.04753952862127968, -0.21986160856550155, -0.0015363790013867876, 0.015755852279455765, 0.01551467234916661, -0.007979529337836024, 0.048093526765866125, -0.047023477154257504, -0.0630332310076641, -0.028814008945356243, 0.3940921655815581, -0.12965562729083974, -0.3530618598603684, 0.04086901073384544, -0.13699696241351572, -0.208490372473455, 0.02835506848666979, 0.1586173188103282, 0.20646649696256802, -0.17727841833687347, 0.19748096293567316, -0.19661269968618517, 0.17489124595633018, 0.07160297117155531, -0.1020164069638628, 0.08783065381905307, 0.0938062277501044, 0.19819417162595884, 0.22615353669971228, -0.02234172989087908, -0.10235508758088817, -0.3421573331174643, -0.21290900946959204, -0.1720541696185651, 0.09816680448800427, -0.03373243673907026, -0.20337344436784802, 0.35121024489078834, 0.17478224635124207, 0.15926956919872243, 0.19709085227678652, 0.20448089148039403, 0.23612845749796732, -0.10301936685067156, 0.14575169755793785, 0.17208255982309903, 0.08669642359018326, 0.16441050795433315, -0.16524464298930505, 0.0013658802389450695, 0.20757404354441425] |
1,803.02695 | The Altes Family of Log-Periodic Chirplets and the Hyperbolic Chirplet
Transform | This work revisits a class of biomimetically inspired log-periodic waveforms
first introduced by R.A. Altes in the 1970s for generalized target description.
It was later observed that there is a close connection between such sonar
techniques and wavelet decomposition for multiresolution analysis. Motivated by
this, we formalize the original Altes waveforms as a family of hyperbolic
chirplets suitable for the detection of accelerating time-series oscillations.
The formalism results in a remarkably flexible set of wavelets with desirable
properties of admissibility, regularity, vanishing moments, and time-frequency
localization. These "Altes wavelets" also facilitate efficient implementation
of the scale invariant hyperbolic chirplet transform (HCT).
From a practical perspective, log-periodic oscillations with an acceleration
towards criticality can serve as indicators of an incipient bifurcation. Such
signals abound in nature, often as precursors to phase transitions in the
non-linear dynamics of complex systems. For example, the authors' interest lies
in automatic detection of the well documented phenomenon of log-periodic price
dynamics during financial bubbles and preceding market crashes. However, the
methodology presented here is more widely applicable in such diverse domains as
prediction of critical failures in mechanical systems, and fault detection in
electrical networks. Examples beyond failure diagnostics include animal species
identification via call recordings, commercial \& military radar, and there are
many more. A synthetic application is presented in this report for illustrative
purposes.
| eess.SP physics.data-an | this work revisits a class of biomimetically inspired logperiodic waveforms first introduced by ra altes in the 1970s for generalized target description it was later observed that there is a close connection between such sonar techniques and wavelet decomposition for multiresolution analysis motivated by this we formalize the original altes waveforms as a family of hyperbolic chirplets suitable for the detection of accelerating timeseries oscillations the formalism results in a remarkably flexible set of wavelets with desirable properties of admissibility regularity vanishing moments and timefrequency localization these altes wavelets also facilitate efficient implementation of the scale invariant hyperbolic chirplet transform hct from a practical perspective logperiodic oscillations with an acceleration towards criticality can serve as indicators of an incipient bifurcation such signals abound in nature often as precursors to phase transitions in the nonlinear dynamics of complex systems for example the authors interest lies in automatic detection of the well documented phenomenon of logperiodic price dynamics during financial bubbles and preceding market crashes however the methodology presented here is more widely applicable in such diverse domains as prediction of critical failures in mechanical systems and fault detection in electrical networks examples beyond failure diagnostics include animal species identification via call recordings commercial military radar and there are many more a synthetic application is presented in this report for illustrative purposes | [['this', 'work', 'revisits', 'a', 'class', 'of', 'biomimetically', 'inspired', 'logperiodic', 'waveforms', 'first', 'introduced', 'by', 'ra', 'altes', 'in', 'the', '1970s', 'for', 'generalized', 'target', 'description', 'it', 'was', 'later', 'observed', 'that', 'there', 'is', 'a', 'close', 'connection', 'between', 'such', 'sonar', 'techniques', 'and', 'wavelet', 'decomposition', 'for', 'multiresolution', 'analysis', 'motivated', 'by', 'this', 'we', 'formalize', 'the', 'original', 'altes', 'waveforms', 'as', 'a', 'family', 'of', 'hyperbolic', 'chirplets', 'suitable', 'for', 'the', 'detection', 'of', 'accelerating', 'timeseries', 'oscillations', 'the', 'formalism', 'results', 'in', 'a', 'remarkably', 'flexible', 'set', 'of', 'wavelets', 'with', 'desirable', 'properties', 'of', 'admissibility', 'regularity', 'vanishing', 'moments', 'and', 'timefrequency', 'localization', 'these', 'altes', 'wavelets', 'also', 'facilitate', 'efficient', 'implementation', 'of', 'the', 'scale', 'invariant', 'hyperbolic', 'chirplet', 'transform', 'hct', 'from', 'a', 'practical', 'perspective', 'logperiodic', 'oscillations', 'with', 'an', 'acceleration', 'towards', 'criticality', 'can', 'serve', 'as', 'indicators', 'of', 'an', 'incipient', 'bifurcation', 'such', 'signals', 'abound', 'in', 'nature', 'often', 'as', 'precursors', 'to', 'phase', 'transitions', 'in', 'the', 'nonlinear', 'dynamics', 'of', 'complex', 'systems', 'for', 'example', 'the', 'authors', 'interest', 'lies', 'in', 'automatic', 'detection', 'of', 'the', 'well', 'documented', 'phenomenon', 'of', 'logperiodic', 'price', 'dynamics', 'during', 'financial', 'bubbles', 'and', 'preceding', 'market', 'crashes', 'however', 'the', 'methodology', 'presented', 'here', 'is', 'more', 'widely', 'applicable', 'in', 'such', 'diverse', 'domains', 'as', 'prediction', 'of', 'critical', 'failures', 'in', 'mechanical', 'systems', 'and', 'fault', 'detection', 'in', 'electrical', 'networks', 'examples', 'beyond', 'failure', 'diagnostics', 'include', 'animal', 'species', 'identification', 'via', 'call', 'recordings', 'commercial', 'military', 'radar', 'and', 'there', 'are', 'many', 'more', 'a', 'synthetic', 'application', 'is', 'presented', 'in', 'this', 'report', 'for', 'illustrative', 'purposes']] | [-0.11206713288843836, 0.08701423644930759, -0.06761858703730177, 0.08606027370450602, -0.0758382730402869, -0.13148611054657938, 0.02176193955469213, 0.35856839251538664, -0.24326100060716271, -0.25508396136978445, 0.14834413784991984, -0.24250258485569734, -0.2525670127390318, 0.25713944087043134, -0.09900902100856429, 0.08711396320616682, 0.037677135345561656, 0.001700498225363014, -0.02237203019696658, -0.1531028616514278, 0.24503036451649046, 0.07837969752479894, 0.31748812297597256, 0.0053239440849501656, 0.05807756985958717, -0.00618946057272284, -0.04911029295672633, -0.012672479354274634, -0.1021621338186212, 0.08736747059732948, 0.3366771892423329, 0.15591222542756955, 0.2898640251673211, -0.414718540644775, -0.2525813338223454, 0.09470718119986628, 0.14286218031009737, 0.07792700718892696, -0.07983908839122451, -0.3074702186670503, 0.04418541766335277, -0.18196943440989136, -0.1477230785342282, -0.11647002636901524, 0.05837932537090816, 0.04492273015559111, -0.24625485610497527, 0.08857204157901082, 0.071978482786145, 0.12048638961875927, -0.048310327397929995, -0.06611916536601371, 0.02242904497240351, 0.11276013125584686, 0.049175927728323104, -0.027133347350704277, 0.12511037771066982, -0.09149226737043875, -0.15812589212524872, 0.3844050564747368, -0.025251745457918338, -0.16281268330486, 0.20486290143275437, -0.08752960938435116, -0.18484896994791244, 0.12653183822890054, 0.1903403470628644, 0.0879715144109049, -0.14983962302799997, 0.03152575034124045, 0.013511341250157112, 0.13541188551172545, 0.09285268124796825, 0.023376221539979997, 0.19747131554671396, 0.21307852429940607, 0.050358632204949974, 0.14501896527857353, -0.07372729531723206, -0.08859078939254587, -0.27257814037068173, -0.12327902320416319, -0.19296910218707367, 0.024427918991558766, -0.0792124342546372, -0.20231909692483066, 0.4154428208425437, 0.15129901612551988, 0.1501020189240728, 0.019157432173867815, 0.28963507526792315, 0.06922970929925414, 0.0338059487849895, 0.03074570625199677, 0.21355692735717943, 0.08700477839904713, 0.14994700389412405, -0.1365394174529571, 0.06926825027870329, 0.05771714405977427] |
1,803.02696 | Chance-Constrained Optimization for Non-Linear Network Flow Problems | Many engineered systems, such as energy and transportation infrastructures,
are networks governed by non-linear physical laws. A primary challenge for
operators of these networks is to achieve optimal utilization while maintaining
safety and feasibility, especially in the face of uncertainty regarding the
system model. To address this problem, we formulate a Chance Constrained
Optimal Physical Network Flow (CC-OPNF) problem that attempts to optimize the
system while satisfying safety limits with a high probability. However, the
non-linear equality constraints representing the network physics introduce
modelling and optimization challenges which make the chance constraints
numerically intractable in their original form. The main contribution of the
paper is to present a method to obtain tractable polynomial approximations to
the chance constraints using Semidefinite Programming (SDP). The method uses a
combination of existing semi-algebraic techniques for projection and volume
computation in combination with novel set manipulations to provide conservative
inner approximations to the chance constraints. In addition, we develop a new
two-step procedure to improve computational speed. While the method is
applicable to general physical network flow problems with polynomial
constraints, we use the AC optimal power flow problem for electric grids as an
example to demonstrate the method numerically.
| math.OC math.PR | many engineered systems such as energy and transportation infrastructures are networks governed by nonlinear physical laws a primary challenge for operators of these networks is to achieve optimal utilization while maintaining safety and feasibility especially in the face of uncertainty regarding the system model to address this problem we formulate a chance constrained optimal physical network flow ccopnf problem that attempts to optimize the system while satisfying safety limits with a high probability however the nonlinear equality constraints representing the network physics introduce modelling and optimization challenges which make the chance constraints numerically intractable in their original form the main contribution of the paper is to present a method to obtain tractable polynomial approximations to the chance constraints using semidefinite programming sdp the method uses a combination of existing semialgebraic techniques for projection and volume computation in combination with novel set manipulations to provide conservative inner approximations to the chance constraints in addition we develop a new twostep procedure to improve computational speed while the method is applicable to general physical network flow problems with polynomial constraints we use the ac optimal power flow problem for electric grids as an example to demonstrate the method numerically | [['many', 'engineered', 'systems', 'such', 'as', 'energy', 'and', 'transportation', 'infrastructures', 'are', 'networks', 'governed', 'by', 'nonlinear', 'physical', 'laws', 'a', 'primary', 'challenge', 'for', 'operators', 'of', 'these', 'networks', 'is', 'to', 'achieve', 'optimal', 'utilization', 'while', 'maintaining', 'safety', 'and', 'feasibility', 'especially', 'in', 'the', 'face', 'of', 'uncertainty', 'regarding', 'the', 'system', 'model', 'to', 'address', 'this', 'problem', 'we', 'formulate', 'a', 'chance', 'constrained', 'optimal', 'physical', 'network', 'flow', 'ccopnf', 'problem', 'that', 'attempts', 'to', 'optimize', 'the', 'system', 'while', 'satisfying', 'safety', 'limits', 'with', 'a', 'high', 'probability', 'however', 'the', 'nonlinear', 'equality', 'constraints', 'representing', 'the', 'network', 'physics', 'introduce', 'modelling', 'and', 'optimization', 'challenges', 'which', 'make', 'the', 'chance', 'constraints', 'numerically', 'intractable', 'in', 'their', 'original', 'form', 'the', 'main', 'contribution', 'of', 'the', 'paper', 'is', 'to', 'present', 'a', 'method', 'to', 'obtain', 'tractable', 'polynomial', 'approximations', 'to', 'the', 'chance', 'constraints', 'using', 'semidefinite', 'programming', 'sdp', 'the', 'method', 'uses', 'a', 'combination', 'of', 'existing', 'semialgebraic', 'techniques', 'for', 'projection', 'and', 'volume', 'computation', 'in', 'combination', 'with', 'novel', 'set', 'manipulations', 'to', 'provide', 'conservative', 'inner', 'approximations', 'to', 'the', 'chance', 'constraints', 'in', 'addition', 'we', 'develop', 'a', 'new', 'twostep', 'procedure', 'to', 'improve', 'computational', 'speed', 'while', 'the', 'method', 'is', 'applicable', 'to', 'general', 'physical', 'network', 'flow', 'problems', 'with', 'polynomial', 'constraints', 'we', 'use', 'the', 'ac', 'optimal', 'power', 'flow', 'problem', 'for', 'electric', 'grids', 'as', 'an', 'example', 'to', 'demonstrate', 'the', 'method', 'numerically']] | [-0.11316160963764653, -0.0286835873349516, -0.05644139556500774, 0.07214965519125167, -0.10939155694527122, -0.16941760623684296, 0.0729335265705744, 0.34308377709717325, -0.32810434710520964, -0.35666855841588513, 0.12907408469905837, -0.22522821579462823, -0.1648470637627328, 0.20658609316541024, -0.09822145859719827, 0.16830235971257282, 0.060736971371210154, -0.023268663269342283, -0.07861333338137812, -0.2456174096916444, 0.29521277176741606, 0.05016824576812677, 0.2817570288498432, 0.0666617923296797, 0.13526338775857136, -0.016540216559615847, 0.008319521189118042, 0.0374147910427732, -0.09819938208305617, 0.17990811727224634, 0.28435167451150334, 0.19800502956391144, 0.3148616513953759, -0.45787476143584804, -0.21051775721403268, 0.12213121852419602, 0.12079661001439373, 0.10855306792729653, -0.01176719578126302, -0.23200923921540378, 0.08714904247108513, -0.1625077546072694, -0.11523618090745563, -0.11443622929688829, -0.03667095284789609, 0.004761600982433615, -0.3229572765576916, 0.047137671467872004, 0.028456836599761094, 0.003213599195274023, -0.050954944358613245, -0.09670274060231467, 0.034704142509219355, 0.11040515368565534, 0.02488995172047558, 0.008076982395962263, 0.12191903840941497, -0.13796500069423553, -0.13140839444509206, 0.4160962094194614, -0.0001833226125782881, -0.2547421092740618, 0.16795952041179707, -0.05594162542480402, -0.16718158300440664, 0.11315062336074427, 0.25333543446583623, 0.117503087891218, -0.1894707505674794, 0.06273724449058182, -0.002666182109178641, 0.14166775862089334, 0.021893632419120807, 0.031354385568127516, 0.18746020583889614, 0.21139074938031488, 0.16711371529530972, 0.15746435914397575, -0.0185977448673489, -0.10045338793156239, -0.24422976488295273, -0.09087312022606149, -0.1563510119437407, -0.001459086278023628, -0.07564543081799713, -0.12485095497029713, 0.36336018326453484, 0.17938507908525375, 0.1572823296707028, 0.13215209123714325, 0.3756374049072082, 0.14640366521295314, 0.022367749470345772, 0.09679093493196445, 0.21087857742304317, 0.10806944320241037, 0.11748166389357394, -0.2305665935921029, 0.07382287052579416, 0.07661579695219795] |
1,803.02697 | Singular spaces, groupoids and metrics of positive scalar curvature | We define and study, under suitable assumptions, the fundamental class, the
index class and the rho class of a spin Dirac operator on the regular part of a
spin stratified pseudomanifold. More singular structures, such as singular
foliations, are also treated. We employ groupoid techniques in a crucial way;
however, an effort has been made in order to make this article accessible to
readers with only a minimal knowledge of groupoids. Finally, whenever
appropriate, a comparison between classical microlocal methods and groupoids
methods has been provided.
| math.KT math.DG | we define and study under suitable assumptions the fundamental class the index class and the rho class of a spin dirac operator on the regular part of a spin stratified pseudomanifold more singular structures such as singular foliations are also treated we employ groupoid techniques in a crucial way however an effort has been made in order to make this article accessible to readers with only a minimal knowledge of groupoids finally whenever appropriate a comparison between classical microlocal methods and groupoids methods has been provided | [['we', 'define', 'and', 'study', 'under', 'suitable', 'assumptions', 'the', 'fundamental', 'class', 'the', 'index', 'class', 'and', 'the', 'rho', 'class', 'of', 'a', 'spin', 'dirac', 'operator', 'on', 'the', 'regular', 'part', 'of', 'a', 'spin', 'stratified', 'pseudomanifold', 'more', 'singular', 'structures', 'such', 'as', 'singular', 'foliations', 'are', 'also', 'treated', 'we', 'employ', 'groupoid', 'techniques', 'in', 'a', 'crucial', 'way', 'however', 'an', 'effort', 'has', 'been', 'made', 'in', 'order', 'to', 'make', 'this', 'article', 'accessible', 'to', 'readers', 'with', 'only', 'a', 'minimal', 'knowledge', 'of', 'groupoids', 'finally', 'whenever', 'appropriate', 'a', 'comparison', 'between', 'classical', 'microlocal', 'methods', 'and', 'groupoids', 'methods', 'has', 'been', 'provided']] | [-0.11681553989318524, 0.05666077174506892, -0.09641397965064835, 0.1090816137811364, -0.14819053613559105, -0.13835682132454633, 0.01063684776403703, 0.42321897941901415, -0.2727981561816536, -0.23782192419694606, 0.11631427444436393, -0.24751167811539976, -0.17101335473802634, 0.21251287391452595, -0.10703804814744047, 0.07480890321177106, 0.06364822739377878, 0.0903565096993779, -0.12544272953731028, -0.19256438711268264, 0.4245340275838105, 0.015569681994790254, 0.2376074844180758, 0.02880988335764837, 0.08456935559204498, -0.008423844403127035, -0.0481678772836837, 0.047687897783552494, -0.17184980642483677, 0.14490998241790506, 0.293563335484197, 0.03790958861950352, 0.3002365702210904, -0.41542551254983556, -0.201786178976384, 0.14501284867481784, 0.09647944892301809, 0.07075658894338926, -0.01966569053911371, -0.28637553085464723, 0.10504892118800388, -0.18853108037458083, -0.16427918651336154, -0.12638799356957248, 0.02675969521298485, -0.04083435795118296, -0.2172023263322677, -0.026988650595993993, 0.10663233193850448, 0.10087684450974298, -0.015845435659325315, -0.08375330557126205, -0.023373152659989373, 0.10936910160384032, 0.03861089071345537, 0.0236941063180999, 0.10569024105491333, -0.07777874331466507, -0.11966985622204321, 0.3743365563203169, -0.0475794697758406, -0.26752040725807813, 0.20426446623385472, -0.10341292679266528, -0.19010305121476048, 0.08681109251974281, 0.11231572715955418, 0.1729990636583331, -0.12757804150541507, 0.1470179756498235, -0.059141812163816636, 0.1206271444815536, 0.0682139330229527, 0.04039303547984292, 0.1556700803231188, 0.1668649398407704, 0.11112135514443697, 0.09905171905492627, -0.030206519225070817, -0.05157422254046122, -0.2988447503858181, -0.19560958190582867, -0.11867245439938161, 0.11945036059613665, -0.023834382491978157, -0.18350492246708897, 0.3952521852889033, 0.14059209977587966, 0.15822946871522553, 0.042369623874249154, 0.2631473047956608, 0.08542011595780549, 0.05223766669934226, 0.05867601196866396, 0.17955580358745443, 0.2003650211425888, 0.06014266061098423, -0.0782213750725807, 0.023891681821497028, 0.11962862411069922] |
1,803.02698 | Open charm and dileptons from relativistic heavy-ion collisions | Dileptons are considered as one of the cleanest signals of the quark-gluon
plasma (QGP), however, the QGP radiation is masked by many 'background' sources
from either hadronic decays or semileptonic decays from correlated charm pairs.
In this study we investigate the relative contribution of these channels in
heavy-ion collisions from $\sqrt{s_{\rm NN}}=$ 8 GeV to 5 TeV with a focus on
the competition between the thermal QGP radiation and the semileptonic decays
from correlated $D-$meson pairs. As a 'tool' we employ the parton-hadron-string
dynamics (PHSD) transport approach to study dilepton spectra in Pb+Pb (Au+Au)
collisions in a wide energy range incorporating for the first time a fully
microscopic treatment of the charm dynamics and their semileptonic decays. We
find that the dileptons from correlated $D-$meson decays dominate the 'thermal'
radiation from the QGP in central Pb+Pb collisions at the intermediate masses
(1.2 GeV $< M <$ 3 GeV) for $\sqrt{s_{\rm NN}} > $ 40 GeV, while for
$\sqrt{s_{\rm NN}}=$ 8 to 20 GeV the contribution from $D,{\bar D}$ decays to
the intermediate mass dilepton spectra is subleading such that one should
observe a rather clear signal from the QGP radiation. We, furthermore, study
the $p_T$-spectra and the $R_{AA}(p_T)$ of single electrons at different
energies as well as the excitation function of the inverse slope of the $m_T$-
spectra for intermediate-mass dileptons from the QGP and from charm decays. We
find moderate but characteristic changes in the inverse slope parameter for
$\sqrt{s_{\rm NN}} > $ 20 GeV which can be observed experimentally in high
statistics data. Additionally, we provide detailed predictions for dilepton
spectra from Pb+Pb collisions at $\sqrt{s_{\rm NN}} = $ 5.02 TeV.
| nucl-th hep-ph | dileptons are considered as one of the cleanest signals of the quarkgluon plasma qgp however the qgp radiation is masked by many background sources from either hadronic decays or semileptonic decays from correlated charm pairs in this study we investigate the relative contribution of these channels in heavyion collisions from sqrts_rm nn 8 gev to 5 tev with a focus on the competition between the thermal qgp radiation and the semileptonic decays from correlated dmeson pairs as a tool we employ the partonhadronstring dynamics phsd transport approach to study dilepton spectra in pbpb auau collisions in a wide energy range incorporating for the first time a fully microscopic treatment of the charm dynamics and their semileptonic decays we find that the dileptons from correlated dmeson decays dominate the thermal radiation from the qgp in central pbpb collisions at the intermediate masses 12 gev m 3 gev for sqrts_rm nn 40 gev while for sqrts_rm nn 8 to 20 gev the contribution from dbar d decays to the intermediate mass dilepton spectra is subleading such that one should observe a rather clear signal from the qgp radiation we furthermore study the p_tspectra and the r_aap_t of single electrons at different energies as well as the excitation function of the inverse slope of the m_t spectra for intermediatemass dileptons from the qgp and from charm decays we find moderate but characteristic changes in the inverse slope parameter for sqrts_rm nn 20 gev which can be observed experimentally in high statistics data additionally we provide detailed predictions for dilepton spectra from pbpb collisions at sqrts_rm nn 502 tev | [['dileptons', 'are', 'considered', 'as', 'one', 'of', 'the', 'cleanest', 'signals', 'of', 'the', 'quarkgluon', 'plasma', 'qgp', 'however', 'the', 'qgp', 'radiation', 'is', 'masked', 'by', 'many', 'background', 'sources', 'from', 'either', 'hadronic', 'decays', 'or', 'semileptonic', 'decays', 'from', 'correlated', 'charm', 'pairs', 'in', 'this', 'study', 'we', 'investigate', 'the', 'relative', 'contribution', 'of', 'these', 'channels', 'in', 'heavyion', 'collisions', 'from', 'sqrts_rm', 'nn', '8', 'gev', 'to', '5', 'tev', 'with', 'a', 'focus', 'on', 'the', 'competition', 'between', 'the', 'thermal', 'qgp', 'radiation', 'and', 'the', 'semileptonic', 'decays', 'from', 'correlated', 'dmeson', 'pairs', 'as', 'a', 'tool', 'we', 'employ', 'the', 'partonhadronstring', 'dynamics', 'phsd', 'transport', 'approach', 'to', 'study', 'dilepton', 'spectra', 'in', 'pbpb', 'auau', 'collisions', 'in', 'a', 'wide', 'energy', 'range', 'incorporating', 'for', 'the', 'first', 'time', 'a', 'fully', 'microscopic', 'treatment', 'of', 'the', 'charm', 'dynamics', 'and', 'their', 'semileptonic', 'decays', 'we', 'find', 'that', 'the', 'dileptons', 'from', 'correlated', 'dmeson', 'decays', 'dominate', 'the', 'thermal', 'radiation', 'from', 'the', 'qgp', 'in', 'central', 'pbpb', 'collisions', 'at', 'the', 'intermediate', 'masses', '12', 'gev', 'm', '3', 'gev', 'for', 'sqrts_rm', 'nn', '40', 'gev', 'while', 'for', 'sqrts_rm', 'nn', '8', 'to', '20', 'gev', 'the', 'contribution', 'from', 'dbar', 'd', 'decays', 'to', 'the', 'intermediate', 'mass', 'dilepton', 'spectra', 'is', 'subleading', 'such', 'that', 'one', 'should', 'observe', 'a', 'rather', 'clear', 'signal', 'from', 'the', 'qgp', 'radiation', 'we', 'furthermore', 'study', 'the', 'p_tspectra', 'and', 'the', 'r_aap_t', 'of', 'single', 'electrons', 'at', 'different', 'energies', 'as', 'well', 'as', 'the', 'excitation', 'function', 'of', 'the', 'inverse', 'slope', 'of', 'the', 'm_t', 'spectra', 'for', 'intermediatemass', 'dileptons', 'from', 'the', 'qgp', 'and', 'from', 'charm', 'decays', 'we', 'find', 'moderate', 'but', 'characteristic', 'changes', 'in', 'the', 'inverse', 'slope', 'parameter', 'for', 'sqrts_rm', 'nn', '20', 'gev', 'which', 'can', 'be', 'observed', 'experimentally', 'in', 'high', 'statistics', 'data', 'additionally', 'we', 'provide', 'detailed', 'predictions', 'for', 'dilepton', 'spectra', 'from', 'pbpb', 'collisions', 'at', 'sqrts_rm', 'nn', '502', 'tev']] | [-0.02385301520907373, 0.2775215939319921, -0.15697650841946872, 0.18204410907698199, 0.02772893360200918, -0.11403839859874251, -0.05503285284338624, 0.3361905383543586, -0.22311791274597745, -0.2779985791247971, -0.0929090975884805, -0.43491604238010523, 0.11155961465072942, 0.15175597751513123, 0.1190187995655919, 0.08689601286490149, 0.14701019948137536, -0.0014860231898294516, -0.036970256529429944, -0.15625845920997408, 0.29602662937821084, 0.08483208904552432, 0.17915374534204603, 0.2076786558635814, 0.004621639227898757, 0.04487586478210705, -0.004624304447744815, -0.06378531072877418, -0.15023273091526035, -0.0024670601345517427, 0.2813240808136058, 0.017842725951681442, 0.12201742601826927, -0.3207233573468226, -0.13898767978655843, 0.1422196054962938, 0.17515011062002125, 0.09681384741583453, -0.07112169750430182, -0.26683893178431495, 0.15143502729786737, -0.2520036152845143, -0.07052753918127702, -0.006418828015162978, -0.024957322457559265, -0.02293643585718149, -0.31388858063849356, 0.18164773423681563, -0.0636251343610501, 0.07968455068854931, -0.02208664284597309, -0.21812290927957534, -0.06426206349289783, 0.018007920816857016, 0.11139593053573989, 0.1235312139268367, 0.22371805343812085, -0.1790496974915512, -0.16335998407283903, 0.4113049884168607, -0.022733024694025515, -0.08072250393342296, 0.20568964468350387, -0.2050178181028591, -0.15469485388866644, 0.20208431196592327, 0.2968211619447003, 0.08320530901821155, -0.2479015587916914, 0.040202495584897, -0.009142917285690893, 0.19668227757309686, 0.08171740301867139, 0.11303192109291284, 0.1894743297003069, 0.1912400452525548, -0.048718507415922534, 0.09066944432506373, -0.12634366981351292, -0.020631398778971074, -0.41074522739025887, -0.039317125378106284, -0.12482688534864277, 0.11180843400751364, -0.09474734414768633, -0.017519951281181695, 0.3903701161333131, 0.09115022728922513, 0.327691555764737, -0.005087690589123599, 0.30965043848802176, 0.06347375481767263, 0.016114609726300497, 0.15375799015164376, 0.3136508261134743, 0.15863250211882846, 0.25552679042349447, -0.27981010364755143, -0.010753619158640504, 0.03923540716498809] |
1,803.02699 | CNN-Based Automatic Urinary Particles Recognition | The urine sediment analysis of particles in microscopic images can assist
physicians in evaluating patients with renal and urinary tract diseases. Manual
urine sediment examination is labor-intensive, subjective and time-consuming,
and the traditional automatic algorithms often extract the hand-crafted
features for recognition. Instead of using the hand-crafted features, in this
paper, we exploit CNN to learn features in an end-to-end manner to recognize
the urine particles. We treat the urine particles recognition as object
detection and exploit two state-of-the-art CNN-based object detection methods,
Faster R-CNN and SSD, as well as their variants for urine particles
recognition. We further investigate different factors involving these CNN-based
object detection methods for urine particles recognition. We comprehensively
evaluate these methods on a dataset consisting of 5,376 annotated images
corresponding to 7 categories of urine particles, i.e., erythrocyte, leukocyte,
epithelial cell, crystal, cast, mycete, epithelial nuclei, and obtain a best
mAP (mean average precision) of 84.1% while taking only 72 ms per image on a
NVIDIA Titan X GPU.
| cs.CV | the urine sediment analysis of particles in microscopic images can assist physicians in evaluating patients with renal and urinary tract diseases manual urine sediment examination is laborintensive subjective and timeconsuming and the traditional automatic algorithms often extract the handcrafted features for recognition instead of using the handcrafted features in this paper we exploit cnn to learn features in an endtoend manner to recognize the urine particles we treat the urine particles recognition as object detection and exploit two stateoftheart cnnbased object detection methods faster rcnn and ssd as well as their variants for urine particles recognition we further investigate different factors involving these cnnbased object detection methods for urine particles recognition we comprehensively evaluate these methods on a dataset consisting of 5376 annotated images corresponding to 7 categories of urine particles ie erythrocyte leukocyte epithelial cell crystal cast mycete epithelial nuclei and obtain a best map mean average precision of 841 while taking only 72 ms per image on a nvidia titan x gpu | [['the', 'urine', 'sediment', 'analysis', 'of', 'particles', 'in', 'microscopic', 'images', 'can', 'assist', 'physicians', 'in', 'evaluating', 'patients', 'with', 'renal', 'and', 'urinary', 'tract', 'diseases', 'manual', 'urine', 'sediment', 'examination', 'is', 'laborintensive', 'subjective', 'and', 'timeconsuming', 'and', 'the', 'traditional', 'automatic', 'algorithms', 'often', 'extract', 'the', 'handcrafted', 'features', 'for', 'recognition', 'instead', 'of', 'using', 'the', 'handcrafted', 'features', 'in', 'this', 'paper', 'we', 'exploit', 'cnn', 'to', 'learn', 'features', 'in', 'an', 'endtoend', 'manner', 'to', 'recognize', 'the', 'urine', 'particles', 'we', 'treat', 'the', 'urine', 'particles', 'recognition', 'as', 'object', 'detection', 'and', 'exploit', 'two', 'stateoftheart', 'cnnbased', 'object', 'detection', 'methods', 'faster', 'rcnn', 'and', 'ssd', 'as', 'well', 'as', 'their', 'variants', 'for', 'urine', 'particles', 'recognition', 'we', 'further', 'investigate', 'different', 'factors', 'involving', 'these', 'cnnbased', 'object', 'detection', 'methods', 'for', 'urine', 'particles', 'recognition', 'we', 'comprehensively', 'evaluate', 'these', 'methods', 'on', 'a', 'dataset', 'consisting', 'of', '5376', 'annotated', 'images', 'corresponding', 'to', '7', 'categories', 'of', 'urine', 'particles', 'ie', 'erythrocyte', 'leukocyte', 'epithelial', 'cell', 'crystal', 'cast', 'mycete', 'epithelial', 'nuclei', 'and', 'obtain', 'a', 'best', 'map', 'mean', 'average', 'precision', 'of', '841', 'while', 'taking', 'only', '72', 'ms', 'per', 'image', 'on', 'a', 'nvidia', 'titan', 'x', 'gpu']] | [0.017476149147698357, 0.002926991131522457, -0.026233757616101222, 0.07267384128975625, -0.07426251548940292, -0.1760996682368173, 0.017926286723476226, 0.4567088384675667, -0.18020874828985536, -0.34461901896851665, 0.07199916003608248, -0.3197023157651226, -0.1573477179174208, 0.17707507272630377, -0.1805345313645106, 0.08542171434390095, 0.1588005200430843, 0.06354882194442146, -0.0259521073334057, -0.2562445653774948, 0.1954674411573689, 0.027346804720798024, 0.3167935742387249, 0.02683061100097005, 0.17026653895327062, -0.028073609618320602, -0.049275324982626906, -0.06734229115205874, -0.08149847966319893, 0.16238224459380876, 0.3282172315111556, 0.1614487424124906, 0.27758075794446524, -0.4563230768156548, -0.1982273204499327, 0.08257390408960666, 0.211155737453445, 0.08056808034400743, -0.0054410477197602575, -0.37462663287181913, 0.07524234205656857, -0.160354064685511, 0.03676208447130328, -0.14091397280643844, -0.0017833356777160073, -0.011153756333644398, -0.2491381996868891, 0.10350233141654804, 0.035098763212222425, 0.16001674808406582, -0.11188271525028495, -0.13045677859307392, 0.04877019933220804, 0.2053158799988321, 0.06213054630796161, 0.02611817204232477, 0.29532941498356746, -0.2595243547682598, -0.1278194210773771, 0.3771687137583892, -0.01829356329880632, -0.2190794201185467, 0.23155365212688245, -0.017950496987014272, -0.140912940794671, 0.1702022811823329, 0.2558536162297385, 0.16059590203552448, -0.19135279152369886, -0.09381525024964278, -0.01772368686089729, 0.21096908360328756, 0.13115238788089267, -0.05760904642994757, 0.168107991721941, 0.275519154276009, -0.0837985492069964, 0.12142507714955252, -0.22775314263654528, 0.023725573444899953, -0.14433351144436057, -0.17687511023271968, -0.14137888448668592, -0.020981046324452086, -0.07694978825406626, -0.17475735630243974, 0.379425226998182, 0.19865278940199427, 0.16669357739774118, 0.09633749660915109, 0.33999662978551637, -0.0665885357604431, 0.1409382702133124, 0.02754725486235578, 0.17774287350964446, -0.03483212392282799, 0.12126081625364697, -0.2180876931215832, 0.0854879998124814, 0.10490000945872363] |
1,803.027 | Co-processor-based Behavior Monitoring: Application to the Detection of
Attacks Against the System Management Mode | Highly privileged software, such as firmware, is an attractive target for
attackers. Thus, BIOS vendors use cryptographic signatures to ensure firmware
integrity at boot time. Nevertheless, such protection does not prevent an
attacker from exploiting vulnerabilities at runtime. To detect such attacks, we
propose an event-based behavior monitoring approach that relies on an isolated
co-processor. We instrument the code executed on the main CPU to send
information about its behavior to the monitor. This information helps to
resolve the semantic gap issue. Our approach does not depend on a specific
model of the behavior nor on a specific target. We apply this approach to
detect attacks targeting the System Management Mode (SMM), a highly privileged
x86 execution mode executing firmware code at runtime. We model the behavior of
SMM using invariants of its control-flow and relevant CPU registers (CR3 and
SMBASE). We instrument two open-source firmware implementations: EDK II and
coreboot. We evaluate the ability of our approach to detect state-of-the-art
attacks and its runtime execution overhead by simulating an x86 system coupled
with an ARM Cortex A5 co-processor. The results show that our solution detects
intrusions from the state of the art, without any false positives, while
remaining acceptable in terms of performance overhead in the context of the SMM
(i.e., less than the 150 $\mu$s threshold defined by Intel).
| cs.CR | highly privileged software such as firmware is an attractive target for attackers thus bios vendors use cryptographic signatures to ensure firmware integrity at boot time nevertheless such protection does not prevent an attacker from exploiting vulnerabilities at runtime to detect such attacks we propose an eventbased behavior monitoring approach that relies on an isolated coprocessor we instrument the code executed on the main cpu to send information about its behavior to the monitor this information helps to resolve the semantic gap issue our approach does not depend on a specific model of the behavior nor on a specific target we apply this approach to detect attacks targeting the system management mode smm a highly privileged x86 execution mode executing firmware code at runtime we model the behavior of smm using invariants of its controlflow and relevant cpu registers cr3 and smbase we instrument two opensource firmware implementations edk ii and coreboot we evaluate the ability of our approach to detect stateoftheart attacks and its runtime execution overhead by simulating an x86 system coupled with an arm cortex a5 coprocessor the results show that our solution detects intrusions from the state of the art without any false positives while remaining acceptable in terms of performance overhead in the context of the smm ie less than the 150 mus threshold defined by intel | [['highly', 'privileged', 'software', 'such', 'as', 'firmware', 'is', 'an', 'attractive', 'target', 'for', 'attackers', 'thus', 'bios', 'vendors', 'use', 'cryptographic', 'signatures', 'to', 'ensure', 'firmware', 'integrity', 'at', 'boot', 'time', 'nevertheless', 'such', 'protection', 'does', 'not', 'prevent', 'an', 'attacker', 'from', 'exploiting', 'vulnerabilities', 'at', 'runtime', 'to', 'detect', 'such', 'attacks', 'we', 'propose', 'an', 'eventbased', 'behavior', 'monitoring', 'approach', 'that', 'relies', 'on', 'an', 'isolated', 'coprocessor', 'we', 'instrument', 'the', 'code', 'executed', 'on', 'the', 'main', 'cpu', 'to', 'send', 'information', 'about', 'its', 'behavior', 'to', 'the', 'monitor', 'this', 'information', 'helps', 'to', 'resolve', 'the', 'semantic', 'gap', 'issue', 'our', 'approach', 'does', 'not', 'depend', 'on', 'a', 'specific', 'model', 'of', 'the', 'behavior', 'nor', 'on', 'a', 'specific', 'target', 'we', 'apply', 'this', 'approach', 'to', 'detect', 'attacks', 'targeting', 'the', 'system', 'management', 'mode', 'smm', 'a', 'highly', 'privileged', 'x86', 'execution', 'mode', 'executing', 'firmware', 'code', 'at', 'runtime', 'we', 'model', 'the', 'behavior', 'of', 'smm', 'using', 'invariants', 'of', 'its', 'controlflow', 'and', 'relevant', 'cpu', 'registers', 'cr3', 'and', 'smbase', 'we', 'instrument', 'two', 'opensource', 'firmware', 'implementations', 'edk', 'ii', 'and', 'coreboot', 'we', 'evaluate', 'the', 'ability', 'of', 'our', 'approach', 'to', 'detect', 'stateoftheart', 'attacks', 'and', 'its', 'runtime', 'execution', 'overhead', 'by', 'simulating', 'an', 'x86', 'system', 'coupled', 'with', 'an', 'arm', 'cortex', 'a5', 'coprocessor', 'the', 'results', 'show', 'that', 'our', 'solution', 'detects', 'intrusions', 'from', 'the', 'state', 'of', 'the', 'art', 'without', 'any', 'false', 'positives', 'while', 'remaining', 'acceptable', 'in', 'terms', 'of', 'performance', 'overhead', 'in', 'the', 'context', 'of', 'the', 'smm', 'ie', 'less', 'than', 'the', '150', 'mus', 'threshold', 'defined', 'by', 'intel']] | [-0.168140937273734, -0.02469589458536633, -0.06564093031388916, 0.025618761641262568, -0.11788842228207244, -0.24216502358431005, 0.07983625364238948, 0.3856994471189536, -0.24159634019754248, -0.35721743345201085, 0.11922786714292247, -0.2726631307374839, -0.09529326497215658, 0.20240838233100839, -0.12131126506677212, 0.0767054649818897, 0.07529558930609835, 0.034594622700045645, -0.027369666351834694, -0.27047552516339474, 0.25732227414314846, 0.10647794503408174, 0.2736523468929798, 0.051209749992018286, 0.09334288379942922, -0.02042470148607204, 0.010164722311204155, -0.07783060667389945, -0.030518210954769073, 0.06407989284925197, 0.27598200048124377, 0.22045523838297418, 0.2859568327588782, -0.46328814217999376, -0.11546317731098327, 0.05588216358183386, 0.13079334993407632, 0.09034288255929719, -0.007370258045710249, -0.330750724694109, 0.13312417809260355, -0.22948300064813568, -0.09007310544110869, -0.1032678767577341, -0.03922808117373553, -0.00950836070061589, -0.21647529241726754, -0.02625831080171105, 0.06159705673631485, 0.07871490489834623, -0.0252977524364163, -0.05320635132096095, -0.0017566936724228129, 0.1562345086545875, 0.006753974702617485, 0.03988223233192172, 0.2363877365839791, -0.12055780583448134, -0.1647713068845048, 0.33743187664480684, -0.023937656766680266, -0.16371945427867826, 0.19818459340285077, -0.017397938043168283, -0.16367927528322423, 0.1252696429279348, 0.1962635444315601, 0.09930267331900594, -0.1569447990370804, 0.018105100822389406, 0.06468869585620418, 0.30657316583392663, 0.029929617081756052, 0.05395779864050312, 0.17461314505884704, 0.20395011110863856, 0.039481076178540686, 0.1597358106123071, -0.11845809544625875, -0.07903256030970138, -0.24817657539382848, -0.17685326448637465, -0.1556020947882893, 0.00033890980587672595, -0.048930312632040875, -0.14269271230571753, 0.38848332180450224, 0.24166892656748667, 0.10929133418147967, 0.0912953667198074, 0.42252527936000256, -0.007214001282096998, 0.15863880516586987, 0.18086225966408373, 0.16159644823938132, -0.026744928311973334, 0.1300418937342777, -0.2603345994213511, 0.1459291592733637, -0.025883493892775136] |
1,803.02701 | The effect of oscillator and dipole-dipole interaction on multiple
optomechanically induced transparency in cavity optomechanical system | We theoretically investigate the optomechanically induced transparency (OMIT)
phenomenon in a N-cavity optomechanical system doped with a pair of Rydberg
atoms with the presence of a strong pump field and a weak probe field applied
to the Nth cavity. 2N-1(N<10) number OMIT windows can be observed in the output
field when N cavities coupled with N mechanical oscillators, respectively. But,
the mechanical oscillators coupled with different even-odd label cavities lead
to different effect on OMIT. On the other hand, two additional transparent
windows (extra resonances) are presented, if two Rydberg atoms are coupled with
the cavity field. With the DDI increasing, it is interesting that the extra
resonances move to right and the left extra resonance moves slowly than the
right one. During this process, Fano resonance is also shown on the output
field.
| quant-ph | we theoretically investigate the optomechanically induced transparency omit phenomenon in a ncavity optomechanical system doped with a pair of rydberg atoms with the presence of a strong pump field and a weak probe field applied to the nth cavity 2n1n10 number omit windows can be observed in the output field when n cavities coupled with n mechanical oscillators respectively but the mechanical oscillators coupled with different evenodd label cavities lead to different effect on omit on the other hand two additional transparent windows extra resonances are presented if two rydberg atoms are coupled with the cavity field with the ddi increasing it is interesting that the extra resonances move to right and the left extra resonance moves slowly than the right one during this process fano resonance is also shown on the output field | [['we', 'theoretically', 'investigate', 'the', 'optomechanically', 'induced', 'transparency', 'omit', 'phenomenon', 'in', 'a', 'ncavity', 'optomechanical', 'system', 'doped', 'with', 'a', 'pair', 'of', 'rydberg', 'atoms', 'with', 'the', 'presence', 'of', 'a', 'strong', 'pump', 'field', 'and', 'a', 'weak', 'probe', 'field', 'applied', 'to', 'the', 'nth', 'cavity', '2n1n10', 'number', 'omit', 'windows', 'can', 'be', 'observed', 'in', 'the', 'output', 'field', 'when', 'n', 'cavities', 'coupled', 'with', 'n', 'mechanical', 'oscillators', 'respectively', 'but', 'the', 'mechanical', 'oscillators', 'coupled', 'with', 'different', 'evenodd', 'label', 'cavities', 'lead', 'to', 'different', 'effect', 'on', 'omit', 'on', 'the', 'other', 'hand', 'two', 'additional', 'transparent', 'windows', 'extra', 'resonances', 'are', 'presented', 'if', 'two', 'rydberg', 'atoms', 'are', 'coupled', 'with', 'the', 'cavity', 'field', 'with', 'the', 'ddi', 'increasing', 'it', 'is', 'interesting', 'that', 'the', 'extra', 'resonances', 'move', 'to', 'right', 'and', 'the', 'left', 'extra', 'resonance', 'moves', 'slowly', 'than', 'the', 'right', 'one', 'during', 'this', 'process', 'fano', 'resonance', 'is', 'also', 'shown', 'on', 'the', 'output', 'field']] | [-0.1716341475222638, 0.2374687407908023, -0.00780516099604897, 0.013111872023960714, -0.0631924558280358, -0.2560548858885142, -0.0012398433391901111, 0.4137255438722502, -0.24774206321182332, -0.2863121698155327, 0.010539956275317678, -0.3148724398526706, -0.0868103188686633, 0.164435637127468, 0.00459135771217875, 0.0003591557287197924, 0.06144346877988568, 0.08430117638116437, 0.059568939224599785, -0.21055366209256499, 0.30947138581607014, 0.008336483447723217, 0.25809362938949715, 0.02960017813138552, 0.09028962309843391, -0.025518714557086725, 0.1019026258561228, -0.013110414402090237, -0.08407507446635894, 0.07911020889878273, 0.17543980483441873, -0.012069644849341279, 0.2669258357964008, -0.46696773199434566, -0.1703725943404873, 0.0968531560348837, 0.17423580982547282, 0.1504142441265145, -0.05116985791408338, -0.32123305869841934, 0.0023214779444094887, -0.10995478530351381, -0.11028317927165811, -0.029780364871949405, -0.002875327811002227, 0.02205748361696426, -0.28839700881923946, 0.0036578147155250235, 0.0633864036544149, 0.06704979177032198, -0.003825196909676201, -0.04831458211489568, -0.014248799182530632, 0.047608193161738054, 0.018351697254202964, -0.0039254748437525635, 0.19988347728267536, -0.12227538932654027, -0.06967624749671458, 0.3464371542677395, -0.11922679654608351, -0.18245296290919405, 0.20236882698351055, -0.18790719635553546, -0.020840311836087165, 0.15131539996377283, 0.1321063535905065, 0.06978960386022254, -0.09288326641634419, 0.06535320704421238, -0.012441148375742193, 0.22660361139691973, 0.1507487885051764, 0.11456817202795212, 0.1945634306919642, 0.13587753691787557, 0.050631315048251836, 0.2044684584843366, -0.04998432074391626, -0.0670416130302684, -0.2627935927760388, -0.10638323673432258, -0.12946085513610334, 0.033696757165821885, -0.06890063090017941, -0.15374542702811322, 0.4044785045080335, 0.14622510995197677, 0.1884986619163949, -0.09701423338768457, 0.3015902758316886, 0.15006979753760466, 0.09729773080312556, 0.0016026506235444905, 0.3102569925437744, 0.18094128877260632, 0.04516442873886317, -0.31070388795429826, -0.02875141291774081, -0.019497787333933876] |
1,803.02702 | On kissing numbers and spherical codes in high dimensions | We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the
kissing number in dimension $d$. This improves the classical lower bound of
Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a
similar linear factor improvement to the best known lower bound on the maximal
size of a spherical code of acute angle $\theta$ in high dimensions.
| math.MG math.CO math.PR | we prove a lower bound of omega d32 cdot 2sqrt3d on the kissing number in dimension d this improves the classical lower bound of chabauty shannon and wyner by a linear factor in the dimension we obtain a similar linear factor improvement to the best known lower bound on the maximal size of a spherical code of acute angle theta in high dimensions | [['we', 'prove', 'a', 'lower', 'bound', 'of', 'omega', 'd32', 'cdot', '2sqrt3d', 'on', 'the', 'kissing', 'number', 'in', 'dimension', 'd', 'this', 'improves', 'the', 'classical', 'lower', 'bound', 'of', 'chabauty', 'shannon', 'and', 'wyner', 'by', 'a', 'linear', 'factor', 'in', 'the', 'dimension', 'we', 'obtain', 'a', 'similar', 'linear', 'factor', 'improvement', 'to', 'the', 'best', 'known', 'lower', 'bound', 'on', 'the', 'maximal', 'size', 'of', 'a', 'spherical', 'code', 'of', 'acute', 'angle', 'theta', 'in', 'high', 'dimensions']] | [-0.17982674056604023, 0.1250432312578684, -0.019234473892157117, 0.07613754517871947, -0.025252716090049473, -0.164614841326951, 0.1326888550012823, 0.23675326107730787, -0.21087698830712226, -0.31601360617505925, 0.069244104854372, -0.24817752994356618, -0.12351795291948703, 0.22597979841145477, -0.11386048465670508, 0.08330958525860502, -0.020946344315645196, 0.12539768552092173, -0.11192567141035632, -0.3261845181545904, 0.2578573839723944, 0.06711048698954043, 0.25253949924221925, 0.07388650236891643, 0.06307933348861913, -0.008665754617522321, 0.016943719530958804, -0.019111849007106597, -0.25062702605200393, 0.18021532956270442, 0.19606703760162478, 0.11884151173440079, 0.21038799865111227, -0.3326898677154414, -0.17656162940294318, 0.10597213862591513, 0.1430387588878793, 0.06408397521403048, 0.034026100183837116, -0.20558889329268207, 0.07339616864731896, -0.12790411725384934, -0.1620258392630926, 0.01724301433310874, 0.0660851868845883, -0.0512200549485222, -0.3042302230793622, 0.12836024938752094, 0.14511906013133063, 0.07468448085109552, -0.002843677937503784, -0.22358875904953288, 0.03523131589134855, 0.06446144887952195, -0.0052065739348050085, 0.10255313654910893, 0.040222794748842716, -0.1232952804176978, -0.09219351774382015, 0.29202912256662406, -0.1227818063850845, -0.22781458127147128, 0.14528672156795377, -0.22178174282664492, -0.10293726774022705, 0.12821615647314297, 0.22077081537234686, 0.15779242720154504, -0.01480920992851738, 0.16613842428177444, -0.14729290698925335, 0.21716589504672634, 0.18296234486925025, 0.05286261657132737, 0.010992615934341185, 0.1478974829698282, 0.181855654449112, 0.19719252759410488, -0.03734618590603913, -0.03169024016355134, -0.26016435567890445, -0.15151089785015961, -0.21007531993992387, 0.10306954337283969, -0.22364373825797473, -0.11546210278127898, 0.30787238551514046, 0.014364543576507018, 0.22530611730255787, 0.11073919568931864, 0.286225542411088, 0.10885295039512247, 0.03734063274215817, 0.17697561400071268, 0.2213331691117116, 0.13829238416491857, -0.04936523178982879, -0.204185108924585, 0.040885106728021654, 0.1597054752881729] |
1,803.02703 | In absence of long chordless cycles, large tree-width becomes a local
phenomenon | We prove that, for all $\ell$ and $s$, every graph of sufficiently large
tree-width contains either a complete bipartite graph $K_{s,s}$ or a chordless
cycle of length greater than $\ell$.
| math.CO | we prove that for all ell and s every graph of sufficiently large treewidth contains either a complete bipartite graph k_ss or a chordless cycle of length greater than ell | [['we', 'prove', 'that', 'for', 'all', 'ell', 'and', 's', 'every', 'graph', 'of', 'sufficiently', 'large', 'treewidth', 'contains', 'either', 'a', 'complete', 'bipartite', 'graph', 'k_ss', 'or', 'a', 'chordless', 'cycle', 'of', 'length', 'greater', 'than', 'ell']] | [-0.27273639213914674, 0.20857596342102624, 0.025577640160918236, 0.053808596326659124, -0.09714441207858424, -0.25051741025721036, 0.04116558444996675, 0.3583334838350614, -0.2305061101913452, -0.2650042954211434, 0.07722008841422696, -0.3498297739773989, -0.06926957593144228, 0.14403386312381675, -0.018531269921610753, -0.041411772711823384, 0.2286499107722193, 0.1656465074668328, 0.07266541577409953, -0.23630669928194645, 0.2285033840686083, -0.10091497581452132, 0.0668759074062109, 0.07361778680545589, 0.08861491029771666, 0.10389191582798958, 0.013420109264552593, 0.15967420053978762, -0.22754797747014285, 0.052127120457589625, 0.2605269322792689, 0.20879961707784483, 0.24999929933498302, -0.38359855352415856, -0.15324173339953026, 0.3443434683916469, 0.1256120579317212, 0.07225358154003819, 0.12033052547679593, -0.09945852148036162, 0.23485552351921796, -0.09676367106537025, -0.05179106400658687, 0.035666606420030195, 0.2475723893692096, -0.07075602536400159, -0.3032794206092755, -0.04361083135008812, 0.20140473215530316, 0.13289188570342958, 0.15486407157344123, -0.2087968942709267, -0.08783549054836233, 0.07102000726542125, -0.12834800803102553, 0.1396189102320932, 0.0007555761355130622, -0.1151469374919543, -0.19145200836161771, 0.3352391518652439, -0.06516604374871046, -0.08908431088396658, 0.09382830471343671, -0.21023692715292175, -0.2046887551744779, 0.1840671172986428, 0.092981912366425, 0.18951458774196606, -0.008579822940131028, 0.12796913025085815, -0.11398888950546583, 0.21699214316904544, 0.1874211780106028, 0.036434261578445634, 0.09394509500513475, 0.14490111457804838, 0.24093407671898603, 0.17232327045251924, 0.03837343156337738, 0.10775369189990064, -0.335353630532821, -0.11228622952476144, -0.2651702661804544, 0.16492912011841934, -0.26775199593927634, -0.21483778258164724, 0.4378554364045461, 0.026274377992376686, 0.2065102911243836, 0.17354479059576988, 0.24105366508786877, -0.016946118387083212, 0.10104209914570675, 0.2812342022545636, 0.036978794688669346, 0.12494275944385057, -0.09838336724787951, -0.1324924608382086, 0.0561834170948714, 0.14058241415768863] |
1,803.02704 | A deterministic balancing score algorithm to avoid common pitfalls of
propensity score matching | Propensity score matching (PSM) is the de-facto standard for estimating
causal effects in observational studies. We show that PSM and its
implementations are susceptible to several major drawbacks and illustrate these
findings using a case study with $17,427$ patients. We derive four formal
properties an optimal statistical matching algorithm should meet, and propose
Deterministic Balancing Score exact Matching (DBSeM) which meets the
aforementioned properties for an exact matching. Furthermore, we investigate
one of the main problems of PSM, that is that common PSM results in one valid
set of matched pairs or a bootstrapped PSM in a selection of possible valid
sets of matched pairs. For exact matchings we provide the mathematical proof,
that DBSeM, as a result, delivers the expected value of all valid sets of
matched pairs for the investigated dataset.
| stat.AP stat.CO stat.ME | propensity score matching psm is the defacto standard for estimating causal effects in observational studies we show that psm and its implementations are susceptible to several major drawbacks and illustrate these findings using a case study with 17427 patients we derive four formal properties an optimal statistical matching algorithm should meet and propose deterministic balancing score exact matching dbsem which meets the aforementioned properties for an exact matching furthermore we investigate one of the main problems of psm that is that common psm results in one valid set of matched pairs or a bootstrapped psm in a selection of possible valid sets of matched pairs for exact matchings we provide the mathematical proof that dbsem as a result delivers the expected value of all valid sets of matched pairs for the investigated dataset | [['propensity', 'score', 'matching', 'psm', 'is', 'the', 'defacto', 'standard', 'for', 'estimating', 'causal', 'effects', 'in', 'observational', 'studies', 'we', 'show', 'that', 'psm', 'and', 'its', 'implementations', 'are', 'susceptible', 'to', 'several', 'major', 'drawbacks', 'and', 'illustrate', 'these', 'findings', 'using', 'a', 'case', 'study', 'with', '17427', 'patients', 'we', 'derive', 'four', 'formal', 'properties', 'an', 'optimal', 'statistical', 'matching', 'algorithm', 'should', 'meet', 'and', 'propose', 'deterministic', 'balancing', 'score', 'exact', 'matching', 'dbsem', 'which', 'meets', 'the', 'aforementioned', 'properties', 'for', 'an', 'exact', 'matching', 'furthermore', 'we', 'investigate', 'one', 'of', 'the', 'main', 'problems', 'of', 'psm', 'that', 'is', 'that', 'common', 'psm', 'results', 'in', 'one', 'valid', 'set', 'of', 'matched', 'pairs', 'or', 'a', 'bootstrapped', 'psm', 'in', 'a', 'selection', 'of', 'possible', 'valid', 'sets', 'of', 'matched', 'pairs', 'for', 'exact', 'matchings', 'we', 'provide', 'the', 'mathematical', 'proof', 'that', 'dbsem', 'as', 'a', 'result', 'delivers', 'the', 'expected', 'value', 'of', 'all', 'valid', 'sets', 'of', 'matched', 'pairs', 'for', 'the', 'investigated', 'dataset']] | [-0.09992946713016583, -0.014365715076564811, -0.05189032408480461, 0.12502489015280913, -0.06433866956414512, -0.12920314260230112, 0.09891078536255428, 0.38542294388350384, -0.21374860413623256, -0.2745986820019495, 0.10477442939926941, -0.2746399361031273, -0.13092996994069275, 0.2076322580759342, -0.10039645661241733, 0.06028501843415702, 0.08480669717268588, 0.04917681861798673, -0.04778500361269555, -0.26967528690942205, 0.27343493967424504, 0.009477572923956009, 0.3308879846335353, 0.0030858199792699174, 0.12021521683961439, 0.016444771455672497, -0.03746329783820189, 0.04682894964308406, -0.14859958850317456, 0.1319041201683621, 0.26863148210104554, 0.18820907794512234, 0.2875938308496888, -0.35652569306548687, -0.16194276554653278, 0.09417137576696964, 0.1341079082590743, 0.11653458029300404, -0.04503623407262449, -0.2179541463444296, 0.14983136801837155, -0.14146691190925104, -0.12007399125544067, -0.0822679430568734, -0.02866108866336827, 0.019773201413828736, -0.34676303058289565, 0.0714005144062237, 0.057523852910022606, 0.023072548092414553, -0.037624066413487665, -0.17425656496690442, 0.011968823405018507, 0.15801259899834313, 0.025146256340667604, -0.0034349106491740364, 0.08085127808690931, -0.11114146786097151, -0.17622936826844054, 0.391367102564814, -0.041236384886388595, -0.1881141625465646, 0.17893848731540718, -0.05875079245664752, -0.1459269005053032, 0.06760746652546984, 0.14333009141712236, 0.11556607394192654, -0.18225520392879843, 0.0042763999649860825, -0.06629731555540974, 0.1533772268690742, 0.08710878111350422, 0.014509704465476366, 0.182090651938835, 0.17660487272346823, 0.0616574232502339, 0.13928221076404532, -0.06349018170999793, -0.10367708741373813, -0.3162291147674505, -0.11746921815927355, -0.15726786977342833, -0.04480607211768914, -0.13328837699653098, -0.19744151947804942, 0.3973472698376729, 0.21388038178332724, 0.16321627180306958, 0.12761670783108386, 0.29858899927483157, 0.08925316921768871, 0.022935162807026736, 0.08432746498594777, 0.22356596345511767, 0.07134891522045318, -0.027526600594417406, -0.1804277719822354, 0.07463126893226917, 0.047880259729348694] |
1,803.02705 | Frontier improvement in the DEA models | Applications of data envelopment analysis (DEA) show that many inefficient
units are projected onto the weakly efficient parts of the frontier when
efficiency scores are computed. However this fact disagrees with the main
concept of the DEA approach, because the efficiency score of an inefficient
unit has to be measured relative to an efficient unit. As a consequence
inaccurate efficiency scores may be obtained. This happens because a
non-countable (continuous) production possibility set is determined on a basis
of a finite number of production units. It has been proposed in the literature
to use artificial production units in the primal space of inputs and outputs as
a starting point in order to improve the frontier of the DEA models. Farrell
was the first who introduced artificial units in the primal space of inputs and
outputs in order to secure convex isoquants. In previous papers we introduced
the notion of terminal units. Moreover, some relationships were established
between terminal units and other sets of units that were proposed for improving
envelopment. In this paper we develop an algorithm for improving the frontier.
The construction of algorithm is based on the notion of terminal units. Our
theoretical results are verified by computational experiments using real-life
data sets and also confirmed by graphical examples.
| math.OC | applications of data envelopment analysis dea show that many inefficient units are projected onto the weakly efficient parts of the frontier when efficiency scores are computed however this fact disagrees with the main concept of the dea approach because the efficiency score of an inefficient unit has to be measured relative to an efficient unit as a consequence inaccurate efficiency scores may be obtained this happens because a noncountable continuous production possibility set is determined on a basis of a finite number of production units it has been proposed in the literature to use artificial production units in the primal space of inputs and outputs as a starting point in order to improve the frontier of the dea models farrell was the first who introduced artificial units in the primal space of inputs and outputs in order to secure convex isoquants in previous papers we introduced the notion of terminal units moreover some relationships were established between terminal units and other sets of units that were proposed for improving envelopment in this paper we develop an algorithm for improving the frontier the construction of algorithm is based on the notion of terminal units our theoretical results are verified by computational experiments using reallife data sets and also confirmed by graphical examples | [['applications', 'of', 'data', 'envelopment', 'analysis', 'dea', 'show', 'that', 'many', 'inefficient', 'units', 'are', 'projected', 'onto', 'the', 'weakly', 'efficient', 'parts', 'of', 'the', 'frontier', 'when', 'efficiency', 'scores', 'are', 'computed', 'however', 'this', 'fact', 'disagrees', 'with', 'the', 'main', 'concept', 'of', 'the', 'dea', 'approach', 'because', 'the', 'efficiency', 'score', 'of', 'an', 'inefficient', 'unit', 'has', 'to', 'be', 'measured', 'relative', 'to', 'an', 'efficient', 'unit', 'as', 'a', 'consequence', 'inaccurate', 'efficiency', 'scores', 'may', 'be', 'obtained', 'this', 'happens', 'because', 'a', 'noncountable', 'continuous', 'production', 'possibility', 'set', 'is', 'determined', 'on', 'a', 'basis', 'of', 'a', 'finite', 'number', 'of', 'production', 'units', 'it', 'has', 'been', 'proposed', 'in', 'the', 'literature', 'to', 'use', 'artificial', 'production', 'units', 'in', 'the', 'primal', 'space', 'of', 'inputs', 'and', 'outputs', 'as', 'a', 'starting', 'point', 'in', 'order', 'to', 'improve', 'the', 'frontier', 'of', 'the', 'dea', 'models', 'farrell', 'was', 'the', 'first', 'who', 'introduced', 'artificial', 'units', 'in', 'the', 'primal', 'space', 'of', 'inputs', 'and', 'outputs', 'in', 'order', 'to', 'secure', 'convex', 'isoquants', 'in', 'previous', 'papers', 'we', 'introduced', 'the', 'notion', 'of', 'terminal', 'units', 'moreover', 'some', 'relationships', 'were', 'established', 'between', 'terminal', 'units', 'and', 'other', 'sets', 'of', 'units', 'that', 'were', 'proposed', 'for', 'improving', 'envelopment', 'in', 'this', 'paper', 'we', 'develop', 'an', 'algorithm', 'for', 'improving', 'the', 'frontier', 'the', 'construction', 'of', 'algorithm', 'is', 'based', 'on', 'the', 'notion', 'of', 'terminal', 'units', 'our', 'theoretical', 'results', 'are', 'verified', 'by', 'computational', 'experiments', 'using', 'reallife', 'data', 'sets', 'and', 'also', 'confirmed', 'by', 'graphical', 'examples']] | [-0.06464665602737417, 0.04317515236290915, -0.05714997779799714, 0.04410245327134838, -0.06328079984301613, -0.0934218271524601, 0.06731840377906337, 0.3746945377616655, -0.29144357663712334, -0.3179459603991182, 0.09524423035604525, -0.2793248153690781, -0.1355323427512, 0.2268293606649552, -0.10562423189569797, 0.07513820835211803, 0.08778145926605378, 0.0315277273544953, -0.027370010074671536, -0.3159605077157418, 0.2947989513742782, 0.0944165367233966, 0.29553124334724135, 0.033439384509498876, 0.12740347194374493, -0.021791005675636587, -0.0660998286881728, 0.02717826010886624, -0.09109824504294443, 0.1920827843869726, 0.2626366181783635, 0.17382142792921512, 0.319689461642078, -0.414983833919368, -0.1826212841605801, 0.10027229137652155, 0.1208615136479715, 0.05948569543349246, -0.045437273952466925, -0.2404595029872975, 0.10304960921362397, -0.15631264379868906, -0.04693113466297897, -0.07663964039834571, 0.023029330459290318, 0.032784669777555835, -0.30261449645317734, 0.04046323394743792, 0.027397029473442153, 0.06297062224143052, -0.05069757810283807, -0.1360268322174393, -0.02589368918422787, 0.11495164561132523, 0.03764360577333718, 0.043811294828940715, 0.11690303863336643, -0.08699796912592969, -0.17612015745336457, 0.35122690761816644, -0.032728338422298074, -0.20828240906550838, 0.20741669815144545, -0.09504608375386202, -0.16391397513050054, 0.08690653891258296, 0.17822987414963012, 0.11783894541052481, -0.1462074671509548, 0.0650618210202083, -0.05271241991514606, 0.1515741786106013, 0.0527270216771978, 0.00256875778903209, 0.16734907801950438, 0.1865266463924421, 0.046803064985544464, 0.14370348411584494, -0.0742357224359044, -0.09589442810309785, -0.2766667603160299, -0.17290774132693298, -0.20419755421933675, -0.035902000291250825, -0.05642419585132129, -0.12331736914015241, 0.34441264705466373, 0.16227958857891195, 0.22012404513855774, 0.0544864266179502, 0.3129451278885383, 0.1253959325542036, 0.06736424136906863, 0.07024292744906796, 0.22372157565564738, 0.1030632267656204, 0.07004272352150154, -0.16082060867920517, 0.0925842833040016, 0.06919949733253036] |
1,803.02706 | On stability of blow up solutions for the critical co-rotational Wave
Maps problem | We show that the finite time blow up solutions for the co-rotational Wave
Maps problem constructed in [7,15] are stable under suitably small
perturbations within the co-rotational class, provided the scaling parameter
$\lambda(t) = t^{-1-\nu}$ is sufficiently close to $t^{-1}$, i. e. the constant
$\nu$ is sufficiently small and positive. The method of proof is inspired by
[3,12], but takes advantage of geometric structures of the Wave Maps problem
already used in [1,21] to simplify the analysis. In particular, we heavily
exploit that the resonance at zero satisfies a natural first order differential
equation.
| math.AP | we show that the finite time blow up solutions for the corotational wave maps problem constructed in 715 are stable under suitably small perturbations within the corotational class provided the scaling parameter lambdat t1nu is sufficiently close to t1 i e the constant nu is sufficiently small and positive the method of proof is inspired by 312 but takes advantage of geometric structures of the wave maps problem already used in 121 to simplify the analysis in particular we heavily exploit that the resonance at zero satisfies a natural first order differential equation | [['we', 'show', 'that', 'the', 'finite', 'time', 'blow', 'up', 'solutions', 'for', 'the', 'corotational', 'wave', 'maps', 'problem', 'constructed', 'in', '715', 'are', 'stable', 'under', 'suitably', 'small', 'perturbations', 'within', 'the', 'corotational', 'class', 'provided', 'the', 'scaling', 'parameter', 'lambdat', 't1nu', 'is', 'sufficiently', 'close', 'to', 't1', 'i', 'e', 'the', 'constant', 'nu', 'is', 'sufficiently', 'small', 'and', 'positive', 'the', 'method', 'of', 'proof', 'is', 'inspired', 'by', '312', 'but', 'takes', 'advantage', 'of', 'geometric', 'structures', 'of', 'the', 'wave', 'maps', 'problem', 'already', 'used', 'in', '121', 'to', 'simplify', 'the', 'analysis', 'in', 'particular', 'we', 'heavily', 'exploit', 'that', 'the', 'resonance', 'at', 'zero', 'satisfies', 'a', 'natural', 'first', 'order', 'differential', 'equation']] | [-0.1578568556391063, 0.12102905294347194, -0.06998874208519376, 0.05702520188780361, -0.0805159869393514, -0.13075614415649925, 0.014084090508760945, 0.2957145038025794, -0.31069170253010847, -0.2410544652131296, 0.11605118049724247, -0.2658343765764467, -0.12159144726171288, 0.1954651411362393, -0.022359189762663777, 0.08539416714100748, 0.024044162804080595, 0.039442668658911544, -0.05911215408755246, -0.22728371638954886, 0.34570784019606726, -0.0037038081916429665, 0.23353633062253076, 0.027946916477058725, 0.14380778762842378, -0.043579583847394555, 0.004264886420901104, 0.0295199518923157, -0.20234509114935237, 0.04581825784407556, 0.22897085758669036, 0.06920729012825333, 0.27750814363600745, -0.3873316612575323, -0.1822269447047704, 0.11728576793565705, 0.1298155575409852, 0.10730906012117543, -0.025163542869831284, -0.25641576422037937, 0.16045373194019802, -0.10201515739042592, -0.15563010480955883, -0.0819054551783108, 0.07673795681486847, 0.020062235829931115, -0.29423264540251226, 0.06985826904494916, 0.0882376231833972, 0.001711501962735608, -0.1093362865804304, -0.09631969657556344, 0.0033946380630055424, 0.07762104534213582, 0.03894384546325572, 0.06290679892039387, 0.07097506154608983, -0.06924576244206838, -0.000915941847388142, 0.3572634990096733, -0.13372322675266293, -0.2197995835474582, 0.1417745999811638, -0.20000821341490072, -0.14100377673223133, 0.192931102553723, 0.12168464762088592, 0.1373717581192332, -0.08676893876925591, 0.17162701393845642, -0.02219372199815748, 0.16328832469079443, 0.11792994149139412, -0.02443805056554015, 0.1303299228330293, 0.11510804827795715, 0.119272203445034, 0.11544632456035063, -0.08111735532480863, -0.08929411771016256, -0.32943908101127994, -0.10730409538072924, -0.19320677179763074, 0.0611917036432167, -0.0947341986765061, -0.1230804312633731, 0.36218514341500496, 0.11553529004055646, 0.2245899571746748, 0.07629659472869568, 0.21298932322170785, 0.16500041019972614, 0.055673827885359684, 0.0832738479479186, 0.22248279789502742, 0.13673409561486413, 0.11915118101563665, -0.20243154240894803, 0.01691762191213427, 0.07496274880544153] |
1,803.02707 | A Dynamic Separable Network Model with Actor Heterogeneity: An
Application to Global Weapons Transfers | In this paper we propose to extend the separable temporal exponential random
graph model (STERGM) to account for time-varying network- and actor-specific
effects. Our application case is the network of international major
conventional weapons transfers, based on data from the Stockholm International
Peace Research Institute (SIPRI). The application is particularly suitable
since it allows to distinguish the potentially differing driving forces for
creating new trade relationships and for the endurance of existing ones. In
accordance with political economy models we expect security- and
network-related covariates to be most important for the formation of transfers,
whereas repeated transfers should prevalently be determined by the receivers'
market size and military spending. Our proposed modelling approach corroborates
the hypothesis and quantifies the corresponding effects. Additionally, we
subject the time-varying heterogeneity effects to a functional principal
component analysis. This serves as exploratory tool and allows to identify
countries that stand out by exceptional increases or decreases of their
tendency to import and export weapons.
| stat.AP | in this paper we propose to extend the separable temporal exponential random graph model stergm to account for timevarying network and actorspecific effects our application case is the network of international major conventional weapons transfers based on data from the stockholm international peace research institute sipri the application is particularly suitable since it allows to distinguish the potentially differing driving forces for creating new trade relationships and for the endurance of existing ones in accordance with political economy models we expect security and networkrelated covariates to be most important for the formation of transfers whereas repeated transfers should prevalently be determined by the receivers market size and military spending our proposed modelling approach corroborates the hypothesis and quantifies the corresponding effects additionally we subject the timevarying heterogeneity effects to a functional principal component analysis this serves as exploratory tool and allows to identify countries that stand out by exceptional increases or decreases of their tendency to import and export weapons | [['in', 'this', 'paper', 'we', 'propose', 'to', 'extend', 'the', 'separable', 'temporal', 'exponential', 'random', 'graph', 'model', 'stergm', 'to', 'account', 'for', 'timevarying', 'network', 'and', 'actorspecific', 'effects', 'our', 'application', 'case', 'is', 'the', 'network', 'of', 'international', 'major', 'conventional', 'weapons', 'transfers', 'based', 'on', 'data', 'from', 'the', 'stockholm', 'international', 'peace', 'research', 'institute', 'sipri', 'the', 'application', 'is', 'particularly', 'suitable', 'since', 'it', 'allows', 'to', 'distinguish', 'the', 'potentially', 'differing', 'driving', 'forces', 'for', 'creating', 'new', 'trade', 'relationships', 'and', 'for', 'the', 'endurance', 'of', 'existing', 'ones', 'in', 'accordance', 'with', 'political', 'economy', 'models', 'we', 'expect', 'security', 'and', 'networkrelated', 'covariates', 'to', 'be', 'most', 'important', 'for', 'the', 'formation', 'of', 'transfers', 'whereas', 'repeated', 'transfers', 'should', 'prevalently', 'be', 'determined', 'by', 'the', 'receivers', 'market', 'size', 'and', 'military', 'spending', 'our', 'proposed', 'modelling', 'approach', 'corroborates', 'the', 'hypothesis', 'and', 'quantifies', 'the', 'corresponding', 'effects', 'additionally', 'we', 'subject', 'the', 'timevarying', 'heterogeneity', 'effects', 'to', 'a', 'functional', 'principal', 'component', 'analysis', 'this', 'serves', 'as', 'exploratory', 'tool', 'and', 'allows', 'to', 'identify', 'countries', 'that', 'stand', 'out', 'by', 'exceptional', 'increases', 'or', 'decreases', 'of', 'their', 'tendency', 'to', 'import', 'and', 'export', 'weapons']] | [-0.08792772777732226, 0.08588396695433656, -0.09163560232006107, 0.1006907912887061, -0.11219796304638156, -0.14667411007376127, 0.07746521057929442, 0.34279478265302654, -0.2649428455573153, -0.31453617706989184, 0.10273139709400461, -0.2848042444876009, -0.1573296234061753, 0.17668388347226915, -0.08884591044551587, 0.013069491044329362, 0.049633208923837574, -0.0010432252185890757, 0.025591881643638865, -0.23238392613767028, 0.30575939677390446, 0.11658643370146474, 0.3448342545889318, 0.07233745239887245, 0.06466633048574617, 0.05200339157629428, -0.08165191745538783, 0.0127837305989476, -0.06612237178171798, 0.1556859855109802, 0.3211203385744278, 0.16754731263588124, 0.3450483931405352, -0.4478568021750337, -0.213029913617522, 0.12409210574070487, 0.10118770583008145, 0.08228466836912439, 0.010560081445735796, -0.27027473892998893, 0.044590719240198876, -0.2358365851024142, -0.11103983406313471, -0.09104238536586112, 0.021871263674118475, 0.024353221082423306, -0.27855664952599174, 0.04609609330426666, 0.0289661363327192, 0.07008105527927887, -0.06557175446643576, -0.11063670395001109, -0.017937360104479935, 0.2108582197821145, 0.08709834108963208, 0.0013103544169777556, 0.16449950506344815, -0.09489668757784404, -0.11290427484207705, 0.39434573110900345, -0.013666373120526536, -0.13676250756764638, 0.1927385684898524, -0.10381544451745038, -0.14978256170682852, 0.037687556541088636, 0.22001819854861573, 0.03593422253498265, -0.13543921120500169, 0.022662016819894337, 0.024114448895465723, 0.16871365567645694, 0.04796691204102922, -0.004577413588891961, 0.19648556660011976, 0.20337253211867773, 0.07808375894349906, 0.14183971112965357, -0.08215472653738069, -0.12507196911094898, -0.2418137169074668, -0.12835690719104972, -0.10725346248732479, 0.020831128739298002, -0.07137427591842885, -0.11394141778081679, 0.36963018495589495, 0.17992497802582347, 0.12589701711895723, 0.043950581190742175, 0.2962162454341409, 0.042648599389498415, 0.09905012271844464, 0.0703067800106648, 0.20757507544034456, 0.08395625572044496, 0.131607078130746, -0.18040584031156487, 0.15176994903337304, -0.023305061632838055] |
1,803.02708 | Linking Entanglement Detection and State Tomography via Quantum
2-Designs | We present an experimentally feasible and efficient method for detecting
entangled states with measurements that extend naturally to a tomographically
complete set. Our detection criterion is based on measurements from subsets of
a quantum 2-design, e.g., mutually unbiased bases or symmetric informationally
complete states, and has several advantages over standard entanglement
witnesses. First, as more detectors in the measurement are applied, there is a
higher chance of witnessing a larger set of entangled states, in such a way
that the measurement setting converges to a complete setup for quantum state
tomography. Secondly, our method is twice as effective as standard witnesses in
the sense that both upper and lower bounds can be derived. Thirdly, the scheme
can be readily applied to measurement-device-independent scenarios.
| quant-ph | we present an experimentally feasible and efficient method for detecting entangled states with measurements that extend naturally to a tomographically complete set our detection criterion is based on measurements from subsets of a quantum 2design eg mutually unbiased bases or symmetric informationally complete states and has several advantages over standard entanglement witnesses first as more detectors in the measurement are applied there is a higher chance of witnessing a larger set of entangled states in such a way that the measurement setting converges to a complete setup for quantum state tomography secondly our method is twice as effective as standard witnesses in the sense that both upper and lower bounds can be derived thirdly the scheme can be readily applied to measurementdeviceindependent scenarios | [['we', 'present', 'an', 'experimentally', 'feasible', 'and', 'efficient', 'method', 'for', 'detecting', 'entangled', 'states', 'with', 'measurements', 'that', 'extend', 'naturally', 'to', 'a', 'tomographically', 'complete', 'set', 'our', 'detection', 'criterion', 'is', 'based', 'on', 'measurements', 'from', 'subsets', 'of', 'a', 'quantum', '2design', 'eg', 'mutually', 'unbiased', 'bases', 'or', 'symmetric', 'informationally', 'complete', 'states', 'and', 'has', 'several', 'advantages', 'over', 'standard', 'entanglement', 'witnesses', 'first', 'as', 'more', 'detectors', 'in', 'the', 'measurement', 'are', 'applied', 'there', 'is', 'a', 'higher', 'chance', 'of', 'witnessing', 'a', 'larger', 'set', 'of', 'entangled', 'states', 'in', 'such', 'a', 'way', 'that', 'the', 'measurement', 'setting', 'converges', 'to', 'a', 'complete', 'setup', 'for', 'quantum', 'state', 'tomography', 'secondly', 'our', 'method', 'is', 'twice', 'as', 'effective', 'as', 'standard', 'witnesses', 'in', 'the', 'sense', 'that', 'both', 'upper', 'and', 'lower', 'bounds', 'can', 'be', 'derived', 'thirdly', 'the', 'scheme', 'can', 'be', 'readily', 'applied', 'to', 'measurementdeviceindependent', 'scenarios']] | [-0.07606249717083131, 0.13039053590484134, -0.11766359822756452, 0.054435789251011016, -0.006305069878424813, -0.1799784314485524, 0.07649691304668965, 0.3744409876947511, -0.2172530667318743, -0.27130745290362135, 0.1190354210197759, -0.27285652656138426, -0.11085871124935405, 0.27526003382229286, -0.0537527183456937, 0.09450902629878402, 0.09298159014925785, 0.028890851801791326, -0.08260487011876108, -0.24887599550732753, 0.2950270615018359, 0.03602495550071987, 0.3038724540180065, 0.019376608261051094, 0.111051706229921, -0.013469905547070794, 0.02423270576353359, 0.06037259644003418, -0.08358049642466665, 0.13147869452359004, 0.30513119749626433, 0.21000334523936234, 0.23654094966113326, -0.3733858968835415, -0.18500440991370054, 0.16722125006078675, 0.13268394961163338, 0.1905044543640158, -0.0492734090890972, -0.31521342114764983, 0.06920103793888073, -0.18673084740625406, -0.09194184559571549, -0.1496495160016769, 0.01273686419112411, -0.08426294173871175, -0.3218199943639035, 0.0839269094940983, 0.029702524381985024, 0.012607331000357427, 0.0011299788967017235, -0.06663960078541886, 0.007657997189013939, 0.0863311841943854, -0.11225112146561647, 0.021486393702254306, 0.10832229070507399, -0.0774291112311033, -0.2124452997288644, 0.35304650155509393, -0.08349816635160184, -0.24095434453376244, 0.17763980091890183, -0.11433667395778788, -0.09952833123005382, 0.08177101703141097, 0.14939472273870455, 0.18335147453964182, -0.14181746709031787, 0.01007354524738072, -0.09670767888457067, 0.1708815670714191, 0.042281569576087766, 0.12317997465341739, 0.17384161794467307, 0.11091665788818665, 0.17791982641920628, 0.1671082021231286, -0.05008421076378384, -0.0829443686634181, -0.3254036174545716, -0.17771184941132864, -0.22653611894409226, 0.07454673553688254, -0.05682515034537736, -0.12827391416209227, 0.3770320074987629, 0.15300215446064627, 0.18704722154075357, 0.041217451203875696, 0.32462565970372376, 0.08669682759796345, 0.06486938062040665, 0.06267388872953693, 0.24299129844942258, 0.1513559740392597, -0.010961005147130085, -0.1264022083676655, 0.10200100191452396, 0.013911859202387978] |
1,803.02709 | Superconducting nanoribbon with a constriction: A quantum-confined
Josephson junction | Extended defects are known to strongly affect nanoscale superconductors. Here
we report the properties of superconducting nanoribbons with a constriction
formed between two adjacent step-edges, by solving the Bogoliubov-de Gennes
equations self-consistently in the regime where quantum confinement is
important. Since the quantum resonances of the superconducting gap in the
constricted area are different from the rest of the nanoribbon, such
constriction forms a quantum-confined S-S'-S Josephson junction, with a broadly
tunable performance depending on the length and width of the constriction with
respect to the nanoribbon, and possible gating. These findings provide an
intriguing approach to further tailor superconducting quantum devices where
Josephson effect is of use.
| cond-mat.supr-con | extended defects are known to strongly affect nanoscale superconductors here we report the properties of superconducting nanoribbons with a constriction formed between two adjacent stepedges by solving the bogoliubovde gennes equations selfconsistently in the regime where quantum confinement is important since the quantum resonances of the superconducting gap in the constricted area are different from the rest of the nanoribbon such constriction forms a quantumconfined sss josephson junction with a broadly tunable performance depending on the length and width of the constriction with respect to the nanoribbon and possible gating these findings provide an intriguing approach to further tailor superconducting quantum devices where josephson effect is of use | [['extended', 'defects', 'are', 'known', 'to', 'strongly', 'affect', 'nanoscale', 'superconductors', 'here', 'we', 'report', 'the', 'properties', 'of', 'superconducting', 'nanoribbons', 'with', 'a', 'constriction', 'formed', 'between', 'two', 'adjacent', 'stepedges', 'by', 'solving', 'the', 'bogoliubovde', 'gennes', 'equations', 'selfconsistently', 'in', 'the', 'regime', 'where', 'quantum', 'confinement', 'is', 'important', 'since', 'the', 'quantum', 'resonances', 'of', 'the', 'superconducting', 'gap', 'in', 'the', 'constricted', 'area', 'are', 'different', 'from', 'the', 'rest', 'of', 'the', 'nanoribbon', 'such', 'constriction', 'forms', 'a', 'quantumconfined', 'sss', 'josephson', 'junction', 'with', 'a', 'broadly', 'tunable', 'performance', 'depending', 'on', 'the', 'length', 'and', 'width', 'of', 'the', 'constriction', 'with', 'respect', 'to', 'the', 'nanoribbon', 'and', 'possible', 'gating', 'these', 'findings', 'provide', 'an', 'intriguing', 'approach', 'to', 'further', 'tailor', 'superconducting', 'quantum', 'devices', 'where', 'josephson', 'effect', 'is', 'of', 'use']] | [-0.20916019593305127, 0.19316551498262993, -0.026870656586079684, -0.01147090243304976, -0.06344658444221649, -0.2181856471191471, 0.05846237181685865, 0.39621335882866, -0.23926502604175498, -0.3048945385601622, -0.03036158967168174, -0.294594006464144, -0.15340247605841054, 0.21376475931524677, 0.023933334724494704, 0.054433780401908466, -0.013839366142982963, -0.06865034703595382, -0.08313764711136981, -0.20678574072748976, 0.3226495250947429, -0.01863768810343808, 0.33323806861881167, 0.12272405286138463, 0.01366424633414243, -0.0421680940306504, 0.12293043410560738, 0.0570105350041693, -0.17951962644993155, 0.07154906640708861, 0.2576282583349557, -0.14243107418857376, 0.23556758794950805, -0.5093443855574286, -0.1953126463211245, -0.02395635220070997, 0.20415582071506866, 0.14491093830265864, -0.013250742699407661, -0.33116503806646774, 0.06391090478023721, -0.10188503001161196, -0.10054265849787582, 0.02008563584510099, -0.000978846249550029, 0.02251413740978697, -0.17027814113276285, 0.05615360972350808, 0.02527034895805021, 0.021101495578747104, -0.022707479535542748, -0.0841238064065153, -0.03545080266754936, 0.046229815175239414, -0.02032565910808949, -0.018812796105285762, 0.21047630244262377, -0.137009270903137, -0.12675546668469906, 0.3272674443131244, -0.014119613467267266, -0.13799733644851517, 0.13953180109038604, -0.11344766401668528, -0.017137633554671926, 0.10587679607474625, 0.09924590575543267, 0.08754207997548359, -0.14637675422407617, 0.07800018231716456, -0.015130868923194983, 0.16315253009950673, 0.0645329548580641, 0.13649202082996015, 0.29435158693619695, 0.23767938987886603, 0.05340641125696021, 0.166743978952851, -0.12568566166252518, -0.07595868347508022, -0.2641489703490623, -0.17610507233270997, -0.2185202241892478, 0.05909844479928897, -0.04668748592154804, -0.24754516791586798, 0.42767702139638086, 0.18801275206971224, 0.18534258568090284, -0.06629244640848979, 0.24462222886116555, 0.13142260489554178, 0.09087874978366825, 0.03761578609097611, 0.23802583516333942, 0.2059826078744933, 0.07086371780476636, -0.3474735761884841, 0.03221843544721465, -0.016894057608657965] |
1,803.0271 | Generating Contradictory, Neutral, and Entailing Sentences | Learning distributed sentence representations remains an interesting problem
in the field of Natural Language Processing (NLP). We want to learn a model
that approximates the conditional latent space over the representations of a
logical antecedent of the given statement. In our paper, we propose an approach
to generating sentences, conditioned on an input sentence and a logical
inference label. We do this by modeling the different possibilities for the
output sentence as a distribution over the latent representation, which we
train using an adversarial objective. We evaluate the model using two
state-of-the-art models for the Recognizing Textual Entailment (RTE) task, and
measure the BLEU scores against the actual sentences as a probe for the
diversity of sentences produced by our model. The experiment results show that,
given our framework, we have clear ways to improve the quality and diversity of
generated sentences.
| cs.CL cs.AI | learning distributed sentence representations remains an interesting problem in the field of natural language processing nlp we want to learn a model that approximates the conditional latent space over the representations of a logical antecedent of the given statement in our paper we propose an approach to generating sentences conditioned on an input sentence and a logical inference label we do this by modeling the different possibilities for the output sentence as a distribution over the latent representation which we train using an adversarial objective we evaluate the model using two stateoftheart models for the recognizing textual entailment rte task and measure the bleu scores against the actual sentences as a probe for the diversity of sentences produced by our model the experiment results show that given our framework we have clear ways to improve the quality and diversity of generated sentences | [['learning', 'distributed', 'sentence', 'representations', 'remains', 'an', 'interesting', 'problem', 'in', 'the', 'field', 'of', 'natural', 'language', 'processing', 'nlp', 'we', 'want', 'to', 'learn', 'a', 'model', 'that', 'approximates', 'the', 'conditional', 'latent', 'space', 'over', 'the', 'representations', 'of', 'a', 'logical', 'antecedent', 'of', 'the', 'given', 'statement', 'in', 'our', 'paper', 'we', 'propose', 'an', 'approach', 'to', 'generating', 'sentences', 'conditioned', 'on', 'an', 'input', 'sentence', 'and', 'a', 'logical', 'inference', 'label', 'we', 'do', 'this', 'by', 'modeling', 'the', 'different', 'possibilities', 'for', 'the', 'output', 'sentence', 'as', 'a', 'distribution', 'over', 'the', 'latent', 'representation', 'which', 'we', 'train', 'using', 'an', 'adversarial', 'objective', 'we', 'evaluate', 'the', 'model', 'using', 'two', 'stateoftheart', 'models', 'for', 'the', 'recognizing', 'textual', 'entailment', 'rte', 'task', 'and', 'measure', 'the', 'bleu', 'scores', 'against', 'the', 'actual', 'sentences', 'as', 'a', 'probe', 'for', 'the', 'diversity', 'of', 'sentences', 'produced', 'by', 'our', 'model', 'the', 'experiment', 'results', 'show', 'that', 'given', 'our', 'framework', 'we', 'have', 'clear', 'ways', 'to', 'improve', 'the', 'quality', 'and', 'diversity', 'of', 'generated', 'sentences']] | [-0.032756254640998135, 0.014225281388449654, -0.0743823303631179, 0.12364585683795846, -0.13618275971794633, -0.0956590974368942, 0.08149502688812249, 0.4492207876813244, -0.31942544933420797, -0.3329498118812769, -0.022424051887355745, -0.28043886215727726, -0.14479639928978147, 0.17852894989790027, -0.12354099589504931, 0.07463505664925603, 0.09778428046216428, 0.11000604322016187, -0.05934358642331626, -0.29159555449740776, 0.3464790895756688, 0.024900921522049417, 0.3155148430058444, -0.008476352397824677, 0.18220378241000015, -0.03489428666144819, -0.020123819777951905, -0.03287767911101134, -0.06075662726089178, 0.19406620121452775, 0.34382716475602776, 0.2786748198493922, 0.3301972377599335, -0.3719677958788324, -0.20487359076948233, 0.08715983088010214, 0.11056553891820597, 0.12449223395604246, -0.011162441749368387, -0.3553736891440103, 0.08197015191061081, -0.18248317170966888, 0.07690824833239468, -0.1384490032706567, -0.01448006484195144, -0.04552698702121836, -0.2884684567738154, -0.005962659352340959, 0.16799655455717175, 0.07677569161300403, -0.07535763466763507, -0.07846033872879098, 0.021239245151379475, 0.1735496637460605, 0.04091180592503162, 0.09963537885112242, 0.08360479268061757, -0.1989309113881281, -0.1963364475564113, 0.3753967052194434, -0.08873493693978854, -0.26409463151554824, 0.15480357941082665, -0.034371018831119676, -0.14291556462199545, 0.035076162177728305, 0.2123074134037843, 0.1088781425611339, -0.15091577189987604, 0.00019285879565179872, -0.1094222410195048, 0.2342536334509135, 0.0859384799546654, -0.01247948574715517, 0.2129289606835326, 0.24046469163674283, -0.04184277153173855, 0.177318891479214, -0.08846252082341226, -0.035877054707232445, -0.2770303369165254, -0.1407876521755587, -0.18601448360738726, -0.025089330809735234, -0.11852838925356915, -0.1663840114952493, 0.44158629705460456, 0.2868562474794371, 0.21578296102111189, 0.17244465981075593, 0.3159121347420757, 0.07809491950484045, 0.04404981216353456, 0.08427537589056851, 0.09763867797126705, 0.03068596945131119, 0.08259891912268973, -0.14953563054679225, 0.13531662603269634, 0.047999363392591476] |
1,803.02711 | A Fourier restriction theorem for a perturbed hyperbolic paraboloid | In contrast to elliptic surfaces, the Fourier restriction problem for
hypersurfaces of non-vanishing Gaussian curvature which admit principal
curvatures of opposite signs is still hardly understood. In fact, even for
2-surfaces, the only case of a hyperbolic surface for which Fourier restriction
estimates could be established that are analogous to the ones known for
elliptic surfaces is the hyperbolic paraboloid or "saddle" z = xy. The bilinear
method gave here sharp results for p > 10/3 (Lee 05, Vargas 05, Stovall 17),
and this result was recently improved to p > 3.25 (Cho-Lee 17, Kim 17). This
paper aims to be a first step in extending those results to more general
hyperbolic surfaces. We consider a specific cubic perturbation of the saddle
and obtain the sharp result, up to the end-point, for p > 10/3. In the
application of the bilinear method, we show that the behavior at small scale in
our surface is drastically different from the saddle. Indeed, as it turns out,
in some regimes the perturbation term assumes a dominant role, which
necessitates the introduction of a number of new techniques that should also be
useful for the study of more general hyperbolic surfaces.
| math.CA | in contrast to elliptic surfaces the fourier restriction problem for hypersurfaces of nonvanishing gaussian curvature which admit principal curvatures of opposite signs is still hardly understood in fact even for 2surfaces the only case of a hyperbolic surface for which fourier restriction estimates could be established that are analogous to the ones known for elliptic surfaces is the hyperbolic paraboloid or saddle z xy the bilinear method gave here sharp results for p 103 lee 05 vargas 05 stovall 17 and this result was recently improved to p 325 cholee 17 kim 17 this paper aims to be a first step in extending those results to more general hyperbolic surfaces we consider a specific cubic perturbation of the saddle and obtain the sharp result up to the endpoint for p 103 in the application of the bilinear method we show that the behavior at small scale in our surface is drastically different from the saddle indeed as it turns out in some regimes the perturbation term assumes a dominant role which necessitates the introduction of a number of new techniques that should also be useful for the study of more general hyperbolic surfaces | [['in', 'contrast', 'to', 'elliptic', 'surfaces', 'the', 'fourier', 'restriction', 'problem', 'for', 'hypersurfaces', 'of', 'nonvanishing', 'gaussian', 'curvature', 'which', 'admit', 'principal', 'curvatures', 'of', 'opposite', 'signs', 'is', 'still', 'hardly', 'understood', 'in', 'fact', 'even', 'for', '2surfaces', 'the', 'only', 'case', 'of', 'a', 'hyperbolic', 'surface', 'for', 'which', 'fourier', 'restriction', 'estimates', 'could', 'be', 'established', 'that', 'are', 'analogous', 'to', 'the', 'ones', 'known', 'for', 'elliptic', 'surfaces', 'is', 'the', 'hyperbolic', 'paraboloid', 'or', 'saddle', 'z', 'xy', 'the', 'bilinear', 'method', 'gave', 'here', 'sharp', 'results', 'for', 'p', '103', 'lee', '05', 'vargas', '05', 'stovall', '17', 'and', 'this', 'result', 'was', 'recently', 'improved', 'to', 'p', '325', 'cholee', '17', 'kim', '17', 'this', 'paper', 'aims', 'to', 'be', 'a', 'first', 'step', 'in', 'extending', 'those', 'results', 'to', 'more', 'general', 'hyperbolic', 'surfaces', 'we', 'consider', 'a', 'specific', 'cubic', 'perturbation', 'of', 'the', 'saddle', 'and', 'obtain', 'the', 'sharp', 'result', 'up', 'to', 'the', 'endpoint', 'for', 'p', '103', 'in', 'the', 'application', 'of', 'the', 'bilinear', 'method', 'we', 'show', 'that', 'the', 'behavior', 'at', 'small', 'scale', 'in', 'our', 'surface', 'is', 'drastically', 'different', 'from', 'the', 'saddle', 'indeed', 'as', 'it', 'turns', 'out', 'in', 'some', 'regimes', 'the', 'perturbation', 'term', 'assumes', 'a', 'dominant', 'role', 'which', 'necessitates', 'the', 'introduction', 'of', 'a', 'number', 'of', 'new', 'techniques', 'that', 'should', 'also', 'be', 'useful', 'for', 'the', 'study', 'of', 'more', 'general', 'hyperbolic', 'surfaces']] | [-0.13339534853548685, 0.11077329291098674, -0.11426742552976066, 0.09368141357299464, -0.08609499357650445, -0.1477454303955407, 0.018418571517031523, 0.3091277006266561, -0.25397138525977425, -0.28271301541341626, 0.103106452551098, -0.2715665554181517, -0.16013679270205708, 0.23988133440040352, -0.08945341429838057, 0.05353691720423134, 0.02424187863471161, 0.02870710286273, -0.08827659762270439, -0.26160286109734443, 0.3384924064024138, 0.0010289295836021968, 0.21995146052358905, 0.08632734264150106, 0.02369719440078673, -0.013538727014141235, -0.002387986210427092, 0.0006264004496188136, -0.14276998064023397, 0.10764106826870072, 0.25890817031662056, 0.0007780559923655043, 0.24059882802733532, -0.380021955735477, -0.21330713996091313, 0.1191401652837764, 0.14401778471437865, 0.083824639291682, -0.050791629784877536, -0.23258594860938805, 0.11213009837043349, -0.10534925737010781, -0.2018428053027795, -0.059961423420948755, 0.0273039199479778, -0.020958918510586955, -0.27306442116969265, 0.09363213152983008, 0.13280678283596595, 0.05476130074384855, -0.043221116189215536, -0.13547270491714394, -0.011827179035511412, 0.0735200852638324, 0.04754020675621481, 0.0788760811725903, 0.06291353955991023, -0.07149897340908258, -0.061569070234933555, 0.3677061135288871, -0.08520833825847755, -0.20968257063699033, 0.15474784004254616, -0.16771734054539897, -0.15641484299339936, 0.1687065852311207, 0.1513017873997645, 0.16010750735586043, -0.11863255136995576, 0.10757340115317977, -0.04622596544504631, 0.11180197555465081, 0.12007130733157585, -0.02975487041536932, 0.13533124173530572, 0.08651347276008892, 0.11678100876451936, 0.11509987566932978, -0.07084166322238161, -0.07124360971162484, -0.3165395260390748, -0.1761668559993268, -0.15864243905283124, 0.08215545918089144, -0.1029831356795512, -0.15037043019583507, 0.36707330072143424, 0.0796079111475289, 0.21099766534825903, 0.06047663797289715, 0.22362542494859858, 0.10016295037227489, 0.04986442101502083, 0.07015320673478224, 0.26496948269429293, 0.13071300195830796, 0.06956556196140203, -0.13995564030979799, 0.006581883634983872, 0.09731132179149427] |
1,803.02712 | Symmetry breaking via Morse index for equations and systems of
H\'enon-Schr\"odinger type | We consider the Dirichlet problem for the Schr\"odinger-H\'enon system $$
-\Delta u + \mu_1 u = |x|^{\alpha}\partial_u F(u,v),\quad \qquad
-\Delta v + \mu_2 v = |x|^{\alpha}\partial_v F(u,v) $$ in the unit ball
$\Omega \subset \mathbb{R}^N, N\geq 2$, where $\alpha>-1$ is a parameter and
$F: \mathbb{R}^2 \to \mathbb{R}$ is a $p$-homogeneous $C^2$-function for some
$p>2$ with $F(u,v)>0$ for $(u,v) \not = (0,0)$. We show that, as $\alpha \to
\infty$, the Morse index of nontrivial radial solutions of this problem
(positive or sign-changing) tends to infinity. This result is new even for the
corresponding scalar H\'enon equation and extends a previous result by Moreira
dos Santos and Pacella for the case $N=2$. In particular, the result implies
symmetry breaking for ground state solutions, but also for other solutions
obtained by an $\alpha$-independent variational minimax principle.
| math.AP | we consider the dirichlet problem for the schrodingerhenon system delta u mu_1 u xalphapartial_u fuvquad qquad delta v mu_2 v xalphapartial_v fuv in the unit ball omega subset mathbbrn ngeq 2 where alpha1 is a parameter and f mathbbr2 to mathbbr is a phomogeneous c2function for some p2 with fuv0 for uv not 00 we show that as alpha to infty the morse index of nontrivial radial solutions of this problem positive or signchanging tends to infinity this result is new even for the corresponding scalar henon equation and extends a previous result by moreira dos santos and pacella for the case n2 in particular the result implies symmetry breaking for ground state solutions but also for other solutions obtained by an alphaindependent variational minimax principle | [['we', 'consider', 'the', 'dirichlet', 'problem', 'for', 'the', 'schrodingerhenon', 'system', 'delta', 'u', 'mu_1', 'u', 'xalphapartial_u', 'fuvquad', 'qquad', 'delta', 'v', 'mu_2', 'v', 'xalphapartial_v', 'fuv', 'in', 'the', 'unit', 'ball', 'omega', 'subset', 'mathbbrn', 'ngeq', '2', 'where', 'alpha1', 'is', 'a', 'parameter', 'and', 'f', 'mathbbr2', 'to', 'mathbbr', 'is', 'a', 'phomogeneous', 'c2function', 'for', 'some', 'p2', 'with', 'fuv0', 'for', 'uv', 'not', '00', 'we', 'show', 'that', 'as', 'alpha', 'to', 'infty', 'the', 'morse', 'index', 'of', 'nontrivial', 'radial', 'solutions', 'of', 'this', 'problem', 'positive', 'or', 'signchanging', 'tends', 'to', 'infinity', 'this', 'result', 'is', 'new', 'even', 'for', 'the', 'corresponding', 'scalar', 'henon', 'equation', 'and', 'extends', 'a', 'previous', 'result', 'by', 'moreira', 'dos', 'santos', 'and', 'pacella', 'for', 'the', 'case', 'n2', 'in', 'particular', 'the', 'result', 'implies', 'symmetry', 'breaking', 'for', 'ground', 'state', 'solutions', 'but', 'also', 'for', 'other', 'solutions', 'obtained', 'by', 'an', 'alphaindependent', 'variational', 'minimax', 'principle']] | [-0.15965491489984465, 0.07877606100391708, -0.0016079344017015508, 0.039481922510284005, -0.05644116302074726, -0.21139738694495283, 0.023111856219258684, 0.31839888693749413, -0.27366695676984126, -0.18873089260478457, 0.08650371348408382, -0.3591468377146593, -0.0956076026166797, 0.15203452752306595, -0.077748586816236, 0.07971466186048448, 0.016033900820857976, 0.06928943504034811, -0.029257505433152867, -0.21725430212768704, 0.35826476974305044, -0.1246570130456085, 0.15648215728973555, 0.062454596839167854, 0.031070821587100225, -0.026506182069944078, 0.09989621695313865, -0.03992052215020642, -0.26483673709166894, 0.037444989541391575, 0.22274427850199632, 0.08356477510692044, 0.3177813760135785, -0.32681717497319723, -0.20302894250451287, 0.1940005635265415, 0.1630504715048577, -0.002620834237626515, 0.0007740801839111758, -0.29605555020018737, 0.10667465915249214, -0.1037076627604725, -0.23995297553002343, -0.037264270904235355, 0.11786586858913271, 0.019472314228596212, -0.37629361903826003, 0.110737367988947, 0.11969714099541306, 0.004809098703063224, -0.12725564575184536, -0.1797787776622875, -0.04890250693333204, 0.03950446599532565, 0.06572856440320457, 0.174146241776853, -0.004941694610675196, -0.09477717288931416, -0.026970080392481374, 0.34000452835697775, -0.10129439819811974, -0.25141492151185746, 0.09962902860456216, -0.17663540505642486, -0.16326227229596538, 0.06869271055464286, 0.05813417946996768, 0.17460264588806254, -0.06267570569526312, 0.2405341146037575, -0.07342685177568192, 0.15298058305990167, 0.13313741462443732, -0.01953635915290287, 0.05505468343646258, 0.054465062741174804, 0.1906470084906371, 0.11034966124970204, -0.03160623188153648, -0.01188681804005457, -0.3440467619745076, -0.13633431684348948, -0.18398876677552037, 0.15276344578286483, -0.11029067486180627, -0.1427359782497991, 0.30369559688539793, 0.05552484126124639, 0.20178079099802315, 0.10915854473190367, 0.16849396980275239, 0.14736220574541373, -0.060222368348728524, 0.09044857999629317, 0.1370526421230675, 0.105606164290639, 0.10419928772020931, -0.2018645786322376, -0.03257617053829811, 0.1318969613649259] |
1,803.02713 | Exponential Lyapunov Stability Analysis of a Drilling Mechanism | This article deals with the stability analysis of a drilling system which is
modelled as a coupled ordinary differential equation / string equation. The
string is damped at the two boundaries but leading to a stable open-loop
system. The aim is to derive a linear matrix inequality ensuring the
exponential stability with a guaranteed decay-rate of this interconnected
system. A strictly proper dynamic controller based on boundary measurements is
proposed to accelerate the system dynamics and its effects are investigated
through the stability theorem and simulations. It results in an efficient
finite dimension controller which subsequently improves the system
performances.
| math.OC math.AP | this article deals with the stability analysis of a drilling system which is modelled as a coupled ordinary differential equation string equation the string is damped at the two boundaries but leading to a stable openloop system the aim is to derive a linear matrix inequality ensuring the exponential stability with a guaranteed decayrate of this interconnected system a strictly proper dynamic controller based on boundary measurements is proposed to accelerate the system dynamics and its effects are investigated through the stability theorem and simulations it results in an efficient finite dimension controller which subsequently improves the system performances | [['this', 'article', 'deals', 'with', 'the', 'stability', 'analysis', 'of', 'a', 'drilling', 'system', 'which', 'is', 'modelled', 'as', 'a', 'coupled', 'ordinary', 'differential', 'equation', 'string', 'equation', 'the', 'string', 'is', 'damped', 'at', 'the', 'two', 'boundaries', 'but', 'leading', 'to', 'a', 'stable', 'openloop', 'system', 'the', 'aim', 'is', 'to', 'derive', 'a', 'linear', 'matrix', 'inequality', 'ensuring', 'the', 'exponential', 'stability', 'with', 'a', 'guaranteed', 'decayrate', 'of', 'this', 'interconnected', 'system', 'a', 'strictly', 'proper', 'dynamic', 'controller', 'based', 'on', 'boundary', 'measurements', 'is', 'proposed', 'to', 'accelerate', 'the', 'system', 'dynamics', 'and', 'its', 'effects', 'are', 'investigated', 'through', 'the', 'stability', 'theorem', 'and', 'simulations', 'it', 'results', 'in', 'an', 'efficient', 'finite', 'dimension', 'controller', 'which', 'subsequently', 'improves', 'the', 'system', 'performances']] | [-0.18824621617107304, 0.058678197440593695, -0.12541280319735484, 0.027270326120402626, -0.052592125123912335, -0.17566018637664843, 0.021248346754359177, 0.2982886620900697, -0.28821561718594774, -0.2593453953964542, 0.18516279872144675, -0.26417866198703494, -0.14381978317690694, 0.1849228589927232, -0.0593630502028673, 0.11626269058688929, 0.08009155319458006, 0.055957425976021574, -0.05104404812292995, -0.23289051025428556, 0.29067399416758555, 0.06510780180682137, 0.28311470168115893, -0.0008540285440782706, 0.15729452653628107, -0.021494648120638848, 0.000848583256204923, 0.051402015108238865, -0.12339385345841598, 0.10556722976822368, 0.2090949924907299, 0.06802233484235, 0.29327559425975336, -0.40718959926655796, -0.1933846747164022, 0.0673217297898549, 0.13319973201218127, 0.10267906457055219, -0.03270596952172881, -0.2785895686747149, 0.10755336679743999, -0.15168532922939218, -0.1883731120068467, -0.04381999177058613, -0.03246255446639326, 0.018864582471474253, -0.30793947625830015, 0.057309653308957514, 0.08710696473435471, 0.03524409466413687, -0.09992908107262631, -0.021077181945197435, -0.039754547634999256, 0.0861492156041692, -0.004081112492566157, -0.00352169635395209, 0.1303132215768776, -0.070839995998099, -0.092653938710238, 0.3485589002310816, -0.06542008416962368, -0.26597768981762304, 0.18172521181075335, -0.09445375221019442, -0.08486696987676275, 0.14786570930307863, 0.1796745651476838, 0.13259344595905412, -0.19451913978866855, 0.09203162938803246, -0.0035528928092022362, 0.2068345452672943, 0.016748117701611435, 0.009014510337940672, 0.14493619291243529, 0.23156057416715406, 0.12232889216205087, 0.16519944862029845, 0.013687055120526842, -0.15635645446000676, -0.29780125485338044, -0.12882410861890425, -0.11913935805322846, 0.021338551729738787, -0.06836611553620914, -0.18540694772952585, 0.3746194610503888, 0.1019398831983445, 0.14919658436562228, 0.06223039511788749, 0.3354056283003754, 0.17914075924394032, -3.889870989804316e-07, 0.06988248273145556, 0.24204454405440223, 0.17202956512608011, 0.1278048182197969, -0.2794956125535372, 0.04929314580078077, 0.10185640971317436] |
1,803.02714 | Varying Coefficient Panel Data Model with Interactive Fixed Effects | In this paper, we propose a varying coefficient panel data model with
unobservable multiple interactive fixed effects that are correlated with the
regressors. We approximate each coefficient function by B-spline, and propose a
robust nonlinear iteration scheme based on the least squares method to estimate
the coefficient functions of interest. We also establish the asymptotic theory
of the resulting estimators under certain regularity assumptions, including the
consistency, the convergence rate and the asymptotic distribution. Furthermore,
we develop a least squares dummy variable method to study an important special
case of the proposed model: the varying coefficient panel data model with
additive fixed effects. To construct the pointwise confidence intervals for the
coefficient functions, a residual-based block bootstrap method is proposed to
reduce the computational burden as well as to avoid the accumulative errors.
Simulation studies and a real data analysis are also carried out to assess the
performance of our proposed methods.
| stat.ME | in this paper we propose a varying coefficient panel data model with unobservable multiple interactive fixed effects that are correlated with the regressors we approximate each coefficient function by bspline and propose a robust nonlinear iteration scheme based on the least squares method to estimate the coefficient functions of interest we also establish the asymptotic theory of the resulting estimators under certain regularity assumptions including the consistency the convergence rate and the asymptotic distribution furthermore we develop a least squares dummy variable method to study an important special case of the proposed model the varying coefficient panel data model with additive fixed effects to construct the pointwise confidence intervals for the coefficient functions a residualbased block bootstrap method is proposed to reduce the computational burden as well as to avoid the accumulative errors simulation studies and a real data analysis are also carried out to assess the performance of our proposed methods | [['in', 'this', 'paper', 'we', 'propose', 'a', 'varying', 'coefficient', 'panel', 'data', 'model', 'with', 'unobservable', 'multiple', 'interactive', 'fixed', 'effects', 'that', 'are', 'correlated', 'with', 'the', 'regressors', 'we', 'approximate', 'each', 'coefficient', 'function', 'by', 'bspline', 'and', 'propose', 'a', 'robust', 'nonlinear', 'iteration', 'scheme', 'based', 'on', 'the', 'least', 'squares', 'method', 'to', 'estimate', 'the', 'coefficient', 'functions', 'of', 'interest', 'we', 'also', 'establish', 'the', 'asymptotic', 'theory', 'of', 'the', 'resulting', 'estimators', 'under', 'certain', 'regularity', 'assumptions', 'including', 'the', 'consistency', 'the', 'convergence', 'rate', 'and', 'the', 'asymptotic', 'distribution', 'furthermore', 'we', 'develop', 'a', 'least', 'squares', 'dummy', 'variable', 'method', 'to', 'study', 'an', 'important', 'special', 'case', 'of', 'the', 'proposed', 'model', 'the', 'varying', 'coefficient', 'panel', 'data', 'model', 'with', 'additive', 'fixed', 'effects', 'to', 'construct', 'the', 'pointwise', 'confidence', 'intervals', 'for', 'the', 'coefficient', 'functions', 'a', 'residualbased', 'block', 'bootstrap', 'method', 'is', 'proposed', 'to', 'reduce', 'the', 'computational', 'burden', 'as', 'well', 'as', 'to', 'avoid', 'the', 'accumulative', 'errors', 'simulation', 'studies', 'and', 'a', 'real', 'data', 'analysis', 'are', 'also', 'carried', 'out', 'to', 'assess', 'the', 'performance', 'of', 'our', 'proposed', 'methods']] | [-0.06567134691316537, -0.00684591882322581, -0.10499223424305551, 0.07308528489757966, -0.06871139411171164, -0.16137522605162016, 0.07446438865889304, 0.36799351291387883, -0.2657050924302128, -0.28209161665290594, 0.15607066218064192, -0.2701992642419339, -0.18017155452099887, 0.17584113969841333, -0.08223147288969669, 0.1342048190999776, 0.06257833630508303, 0.0018934668164308135, -0.08484489835437241, -0.3067393265182067, 0.2804141632223036, 0.10109597774173476, 0.31585286827267783, 0.005042071403295267, 0.15028336338352682, 0.02579425773001276, -0.07029645344683606, 0.01550657564994732, -0.13885715164690882, 0.12270162161592835, 0.23866697674690696, 0.09513873689942748, 0.359801682226948, -0.3787302278598011, -0.21873434660588637, 0.10898028786974273, 0.10950746805725717, 0.07483926126855965, -0.017863249734785456, -0.23966078888961898, 0.09195662124119208, -0.17587974863770223, -0.1368078528413255, -0.09853790128162425, -0.06681218355477445, 0.0377375264759298, -0.38188001862727106, 0.10503638534167917, 0.020803114480498295, 0.04719877717893963, -0.029846942694061192, -0.13829331265725686, 0.015598563002544995, 0.09158183078244819, 0.11189631381497939, -0.024331078569766282, 0.10317676361209076, -0.07143254577654022, -0.08960822242079303, 0.31018237371340784, -0.0882090913188509, -0.2843471068006597, 0.14921194018097594, -0.11147054864130423, -0.1320720195898933, 0.09318913235466952, 0.2397014481794031, 0.13643937071135856, -0.15917523370712602, 0.045090001096755976, -0.04330792485148107, 0.17337671970017254, 0.01652022163493951, -0.004939258913509548, 0.09658437799570445, 0.1484348703785432, 0.07723522275428925, 0.16669308017988346, -0.12190676427532085, -0.07374175337118734, -0.32741043927174024, -0.10494670127273391, -0.16294505451744618, -0.04499242606030557, -0.17174870189017766, -0.20723015225820218, 0.3941352252878268, 0.20804685772562057, 0.19849986514983406, 0.11416799819562584, 0.31384159334150974, 0.16075058088953434, 0.028549556025322283, 0.0733910992949907, 0.16091859207402817, 0.11793074225945595, 0.015520009736064821, -0.2183675180820405, 0.1116790427706866, 0.09222095178464722] |
1,803.02715 | Optimal performances of a global allocation of radio resources in
heterogeneous networks system | The evolution of wireless and mobile networks becomes faster and faster, so
the optimal allocation of radio resources is a problem which is imperative.
This development of telecommunication networks is accompanied with an efficient
deployment of wireless networks such Wireless Fidelity and networks mobile as
LongTerm Evolution (LTE). In this paper, we propose an algorithm improving the
global allocation of radio resources within the framework of a heterogeneous
mobile and wireless networks system by using the dynamic programming in
particular the Bellman principle of optimality. We took into account the
mobility of users by using the \textbf{2D model Fluid Flow} to obtain the best
performances which are numerically tested by the Network Simulator 3 (NS3).
| math.OC cs.NI | the evolution of wireless and mobile networks becomes faster and faster so the optimal allocation of radio resources is a problem which is imperative this development of telecommunication networks is accompanied with an efficient deployment of wireless networks such wireless fidelity and networks mobile as longterm evolution lte in this paper we propose an algorithm improving the global allocation of radio resources within the framework of a heterogeneous mobile and wireless networks system by using the dynamic programming in particular the bellman principle of optimality we took into account the mobility of users by using the textbf2d model fluid flow to obtain the best performances which are numerically tested by the network simulator 3 ns3 | [['the', 'evolution', 'of', 'wireless', 'and', 'mobile', 'networks', 'becomes', 'faster', 'and', 'faster', 'so', 'the', 'optimal', 'allocation', 'of', 'radio', 'resources', 'is', 'a', 'problem', 'which', 'is', 'imperative', 'this', 'development', 'of', 'telecommunication', 'networks', 'is', 'accompanied', 'with', 'an', 'efficient', 'deployment', 'of', 'wireless', 'networks', 'such', 'wireless', 'fidelity', 'and', 'networks', 'mobile', 'as', 'longterm', 'evolution', 'lte', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'improving', 'the', 'global', 'allocation', 'of', 'radio', 'resources', 'within', 'the', 'framework', 'of', 'a', 'heterogeneous', 'mobile', 'and', 'wireless', 'networks', 'system', 'by', 'using', 'the', 'dynamic', 'programming', 'in', 'particular', 'the', 'bellman', 'principle', 'of', 'optimality', 'we', 'took', 'into', 'account', 'the', 'mobility', 'of', 'users', 'by', 'using', 'the', 'textbf2d', 'model', 'fluid', 'flow', 'to', 'obtain', 'the', 'best', 'performances', 'which', 'are', 'numerically', 'tested', 'by', 'the', 'network', 'simulator', '3', 'ns3']] | [-0.2059522111360964, -0.0009478796985747881, -0.011325947082552471, 0.007456474991621482, -0.039884951537507665, -0.1759342328040746, 0.05187717120044685, 0.423273819008548, -0.2674219360526063, -0.30956926169037297, 0.1194453780567927, -0.20716004238643668, -0.2055385111128552, 0.1653701405249242, -0.07674966567694291, 0.1002936816055393, 0.09100997665888842, -0.0037427680799737573, 0.009080540805466865, -0.24723398539629815, 0.28728326582023056, 0.12702388855579652, 0.3718749997614507, 0.06446855245648246, 0.06508375566223995, -0.01218337473957881, -0.010529662482440472, -0.008506899177742173, -0.06949139559404566, 0.16874598093196064, 0.3024277316994573, 0.20677441371637478, 0.35586753618298916, -0.4940879326477124, -0.2683263324658599, 0.08299179992377105, 0.16418452915049306, 0.06497304424390263, 0.00563932261674812, -0.30618335733092145, 0.12180761020557072, -0.26413991717262225, -0.05823566983127149, -0.023893511845942652, -0.018462291436694693, 0.05154713492415715, -0.3105057488408005, 0.009319718600365153, -0.017356602859013436, 0.05108250075493727, -0.07893272350836349, -0.043074961999847894, 0.017098525502277834, 0.19539993740168907, 0.005772840142813756, -0.016544421705858486, 0.11849810100332099, -0.14479455653692416, -0.16072530380303138, 0.41997055219192253, -0.004028944394616573, -0.14198010712821169, 0.13158589540858215, -0.0017559859746446211, -0.10636315468224909, 0.10299254564993214, 0.26010953361911926, 0.09256090870992027, -0.23449498861864732, 0.023254315742585612, -0.0041469208745024445, 0.1529446739311281, 0.008250704760205719, 0.054262772406729165, 0.16946056988417058, 0.3161500486475824, 0.14393508107515804, 0.13792547049703435, -0.08715413324177478, -0.12364479869281415, -0.18274220156691676, -0.13090320868956806, -0.21980054451054648, 0.049545434189208766, -0.11846047288507403, -0.1039212922516622, 0.4014762488210149, 0.1671926255435928, 0.09635374911554288, 0.1400445612788756, 0.38480559501208755, 0.09833009328525677, 0.0783746015574587, 0.21300664044540832, 0.18057635723074017, 0.04625902130276684, 0.25417154833772465, -0.21149433974846543, 0.07810073979852493, 0.009513851518644706] |
1,803.02716 | Minimal surfaces and the Allen-Cahn equation on 3-manifolds: index,
multiplicity, and curvature estimates | The Allen-Cahn equation is a semilinear PDE which is deeply linked to the
theory of minimal hypersurfaces via a singular limit. We prove curvature
estimates and strong sheet separation estimates for stable solutions (building
on recent work of Wang-Wei) of the Allen-Cahn equation on a 3-manifold. Using
these, we are able to show for generic metrics on a 3-manifold, minimal
surfaces arising from Allen-Cahn solutions with bounded energy and bounded
Morse index are two-sided and occur with multiplicity one and the expected
Morse index. This confirms, in the Allen-Cahn setting, a strong form of the
multiplicity one conjecture and the index lower bound conjecture of
Marques-Neves in 3-dimensions regarding min-max constructions of minimal
surfaces.
Allen-Cahn min-max constructions were recently carried out by Guaraco and
Gaspar-Guaraco. Our resolution of the multiplicity one and the index lower
bound conjectures shows that these constructions can be applied to give a new
proof of Yau's conjecture on infinitely many minimal surfaces in a 3-manifold
with a generic metric (recently proven by Irie-Marques-Neves) with new
geometric conclusions. Namely, we prove that a 3-manifold with a generic metric
contains, for every $p$ = 1, 2, 3, ..., a two-sided embedded minimal surface
with Morse index $p$ and area $p^{1/3}$, as conjectured by Marques-Neves.
| math.DG math.AP | the allencahn equation is a semilinear pde which is deeply linked to the theory of minimal hypersurfaces via a singular limit we prove curvature estimates and strong sheet separation estimates for stable solutions building on recent work of wangwei of the allencahn equation on a 3manifold using these we are able to show for generic metrics on a 3manifold minimal surfaces arising from allencahn solutions with bounded energy and bounded morse index are twosided and occur with multiplicity one and the expected morse index this confirms in the allencahn setting a strong form of the multiplicity one conjecture and the index lower bound conjecture of marquesneves in 3dimensions regarding minmax constructions of minimal surfaces allencahn minmax constructions were recently carried out by guaraco and gasparguaraco our resolution of the multiplicity one and the index lower bound conjectures shows that these constructions can be applied to give a new proof of yaus conjecture on infinitely many minimal surfaces in a 3manifold with a generic metric recently proven by iriemarquesneves with new geometric conclusions namely we prove that a 3manifold with a generic metric contains for every p 1 2 3 a twosided embedded minimal surface with morse index p and area p13 as conjectured by marquesneves | [['the', 'allencahn', 'equation', 'is', 'a', 'semilinear', 'pde', 'which', 'is', 'deeply', 'linked', 'to', 'the', 'theory', 'of', 'minimal', 'hypersurfaces', 'via', 'a', 'singular', 'limit', 'we', 'prove', 'curvature', 'estimates', 'and', 'strong', 'sheet', 'separation', 'estimates', 'for', 'stable', 'solutions', 'building', 'on', 'recent', 'work', 'of', 'wangwei', 'of', 'the', 'allencahn', 'equation', 'on', 'a', '3manifold', 'using', 'these', 'we', 'are', 'able', 'to', 'show', 'for', 'generic', 'metrics', 'on', 'a', '3manifold', 'minimal', 'surfaces', 'arising', 'from', 'allencahn', 'solutions', 'with', 'bounded', 'energy', 'and', 'bounded', 'morse', 'index', 'are', 'twosided', 'and', 'occur', 'with', 'multiplicity', 'one', 'and', 'the', 'expected', 'morse', 'index', 'this', 'confirms', 'in', 'the', 'allencahn', 'setting', 'a', 'strong', 'form', 'of', 'the', 'multiplicity', 'one', 'conjecture', 'and', 'the', 'index', 'lower', 'bound', 'conjecture', 'of', 'marquesneves', 'in', '3dimensions', 'regarding', 'minmax', 'constructions', 'of', 'minimal', 'surfaces', 'allencahn', 'minmax', 'constructions', 'were', 'recently', 'carried', 'out', 'by', 'guaraco', 'and', 'gasparguaraco', 'our', 'resolution', 'of', 'the', 'multiplicity', 'one', 'and', 'the', 'index', 'lower', 'bound', 'conjectures', 'shows', 'that', 'these', 'constructions', 'can', 'be', 'applied', 'to', 'give', 'a', 'new', 'proof', 'of', 'yaus', 'conjecture', 'on', 'infinitely', 'many', 'minimal', 'surfaces', 'in', 'a', '3manifold', 'with', 'a', 'generic', 'metric', 'recently', 'proven', 'by', 'iriemarquesneves', 'with', 'new', 'geometric', 'conclusions', 'namely', 'we', 'prove', 'that', 'a', '3manifold', 'with', 'a', 'generic', 'metric', 'contains', 'for', 'every', 'p', '1', '2', '3', 'a', 'twosided', 'embedded', 'minimal', 'surface', 'with', 'morse', 'index', 'p', 'and', 'area', 'p13', 'as', 'conjectured', 'by', 'marquesneves']] | [-0.16213297934068532, 0.07296797295613473, -0.11664182354124392, 0.09026100282559614, -0.051031835524752586, -0.20289091248812136, 0.005131441365658319, 0.2825528152983193, -0.23881070908518637, -0.3069099201498055, 0.12200148947972639, -0.29268541566608014, -0.1669855170634271, 0.23539692005557517, -0.15513928292439053, 0.0677858488219283, 0.06748636185922337, 0.04780656487063164, -0.040561315529786125, -0.24205989162160987, 0.3796591204060887, -0.03605709935879648, 0.20486069264784823, 0.13854401277454276, 0.08350065813196988, -0.030487214271578533, -0.0017260375079966271, 0.03711757956921022, -0.23818916173648644, 0.184647746776037, 0.23119502970464711, 0.036963526973279544, 0.22088662070230988, -0.36889302437490495, -0.2450041132760096, 0.1413416141150796, 0.09966020295887755, 0.04326352773702215, -0.07063175281417547, -0.2595189023223512, 0.13915831301508857, -0.11141284075703951, -0.21494547620480234, -0.0316823555414777, 0.01480173912950524, 0.02385319922508967, -0.2277403918076491, 0.04557527842387409, 0.1161185055002939, 0.060158408399081174, -0.09188932299125238, -0.1092119419043607, -0.05764390925282041, 0.039315251101011243, 0.04804190387373034, 0.043749865755959794, 0.030509736314865456, -0.06939421222608025, -0.1354718393240456, 0.30821454100481394, -0.10884719428670879, -0.2583423400768033, 0.15544358235760822, -0.10692026259810987, -0.1644214549065005, 0.1297606515725798, 0.11462119815866509, 0.15831537112722746, -0.06457071079144089, 0.16719562552943087, -0.08425305256767586, 0.14719785002318422, 0.14094992101856388, -0.03574935783456901, 0.12819762332341864, 0.11353503985533325, 0.1425663096052802, 0.1374095110764432, -0.019978995520234254, -0.07176498080013634, -0.3281040846019762, -0.19315230828712204, -0.16269921024657305, 0.12458780743550546, -0.14688979429515578, -0.20256317550740618, 0.34812981346138006, 0.00803545962023263, 0.1716871539103144, 0.1387411351309914, 0.21331709994136883, 0.10632745086418299, -0.0034331188751569037, 0.12544335281974314, 0.18464100522238133, 0.18397067188017882, 0.027672702169949465, -0.11374243811155568, -0.012393364093224933, 0.19686412576186624] |
1,803.02717 | Geometric structures related to the braided Thompson groups | In previous work, joint with Bux, Fluch, Marschler and Witzel, we proved that
the braided Thompson groups are of type $\textrm{F}_\infty$. The proof utilized
certain contractible cube complexes, which in this paper we prove are CAT(0).
We then use this fact to compute the geometric invariants
$\Sigma^m(F_{\textrm{br}})$ of the pure braided Thompson group
$F_{\textrm{br}}$. Only the first invariant $\Sigma^1(F_{\textrm{br}})$ was
previously known. A consequence of our computation is that as soon as a
subgroup of $F_{\textrm{br}}$ containing the commutator subgroup
$[F_{\textrm{br}},F_{\textrm{br}}]$ is finitely presented, it is automatically
of type $\textrm{F}_\infty$.
| math.GR math.GT | in previous work joint with bux fluch marschler and witzel we proved that the braided thompson groups are of type textrmf_infty the proof utilized certain contractible cube complexes which in this paper we prove are cat0 we then use this fact to compute the geometric invariants sigmamf_textrmbr of the pure braided thompson group f_textrmbr only the first invariant sigma1f_textrmbr was previously known a consequence of our computation is that as soon as a subgroup of f_textrmbr containing the commutator subgroup f_textrmbrf_textrmbr is finitely presented it is automatically of type textrmf_infty | [['in', 'previous', 'work', 'joint', 'with', 'bux', 'fluch', 'marschler', 'and', 'witzel', 'we', 'proved', 'that', 'the', 'braided', 'thompson', 'groups', 'are', 'of', 'type', 'textrmf_infty', 'the', 'proof', 'utilized', 'certain', 'contractible', 'cube', 'complexes', 'which', 'in', 'this', 'paper', 'we', 'prove', 'are', 'cat0', 'we', 'then', 'use', 'this', 'fact', 'to', 'compute', 'the', 'geometric', 'invariants', 'sigmamf_textrmbr', 'of', 'the', 'pure', 'braided', 'thompson', 'group', 'f_textrmbr', 'only', 'the', 'first', 'invariant', 'sigma1f_textrmbr', 'was', 'previously', 'known', 'a', 'consequence', 'of', 'our', 'computation', 'is', 'that', 'as', 'soon', 'as', 'a', 'subgroup', 'of', 'f_textrmbr', 'containing', 'the', 'commutator', 'subgroup', 'f_textrmbrf_textrmbr', 'is', 'finitely', 'presented', 'it', 'is', 'automatically', 'of', 'type', 'textrmf_infty']] | [-0.11301104590387606, 0.10198965981579954, -0.09675051560398282, 0.072056121841675, -0.13809223228031997, -0.09116671134422465, 0.013102622012034194, 0.3868730600196414, -0.35286425237498453, -0.2473616564714509, 0.12779145409273573, -0.22435833445591172, -0.18791409916948618, 0.19748432119093018, -0.18509992278463536, -0.023016889187757197, 0.038595632888467575, 0.10649690572626708, -0.027964162367691354, -0.27314546407859136, 0.37336672733469706, -0.007429950734282412, 0.24222577449570343, 0.03344598914093406, 0.09663476149846868, -0.003187222962790146, -0.04598872047826284, -0.004748693560874771, -0.13406545045965199, 0.10919298807147709, 0.2594239124573949, 0.06144096865602655, 0.2050284406897135, -0.31966790886277835, -0.15503695114549795, 0.16469573842435395, 0.15405408487223635, 0.07758495718575786, -0.07047100699642991, -0.2940154118099954, 0.14511800133736757, -0.21144221480879025, -0.11813368276897364, -0.06423944138308488, 0.06431357106534628, -0.01311721839578595, -0.20893618396324357, 0.025368259367873756, 0.11999061244835214, 0.061740511196392886, -0.0394030553004818, -0.08549463097733678, -0.03427659500129067, 0.11778309095151178, -0.004142165362903076, 0.055182957382185566, 0.09608702475159633, -0.022372570110303237, -0.13133933205475531, 0.37634886367382797, -0.0382437352091074, -0.1879964913355141, 0.1598465372297186, -0.1311980895016615, -0.23684449371223043, 0.09490738663731552, 0.04854014259195182, 0.19802538395245992, -0.09203309068320001, 0.15418413900358535, -0.17506793720602262, 0.06092531263839635, 0.06499316237821448, -0.0067224726535198166, 0.043140051914833305, 0.10066941084067632, 0.07785472140942769, 0.1711327163559362, -0.0035545952481830993, 0.0036398364776154845, -0.3658637412505724, -0.22843722678243933, -0.1575324641023876, 0.10464543824527049, -0.0318736784646739, -0.17121465844045416, 0.3530267006831198, 0.09801439001656524, 0.1352853562069557, 0.1137407810594773, 0.23186704725390528, 0.04234463652658344, 0.08754430896966015, 0.10313052456206982, 0.1714750457350619, 0.2100581955164671, -0.0457381431422219, -0.09484312104674555, 0.016463154818998967, 0.21098292110169806] |
1,803.02718 | Bosonic Double Ring Lattice Under Artificial Gauge Fields | We consider a system of weakly interacting bosons confined on a planar double
ring lattice subjected to two artificial gauge fields. We determine its ground
state by solving coupled discrete non-linear Schr\"odinger equations at mean
field level. At varying inter-ring tunnel coupling, flux and interactions we
identify the vortex, Meissner and biased-ladder phases also predicted for a
bosonic linear ladder by a variational Ansatz. We also find peculiar features
associated to the ring geometry, in particular parity effects in the number of
vortices, and the appearance of a single vortex in the Meissner phase. We show
that the persistent currents on the rings carry precise information on the
various phases. Finally, we propose a way of observing the Meissner and vortex
phases via spiral interferogram techniques.
| cond-mat.quant-gas | we consider a system of weakly interacting bosons confined on a planar double ring lattice subjected to two artificial gauge fields we determine its ground state by solving coupled discrete nonlinear schrodinger equations at mean field level at varying interring tunnel coupling flux and interactions we identify the vortex meissner and biasedladder phases also predicted for a bosonic linear ladder by a variational ansatz we also find peculiar features associated to the ring geometry in particular parity effects in the number of vortices and the appearance of a single vortex in the meissner phase we show that the persistent currents on the rings carry precise information on the various phases finally we propose a way of observing the meissner and vortex phases via spiral interferogram techniques | [['we', 'consider', 'a', 'system', 'of', 'weakly', 'interacting', 'bosons', 'confined', 'on', 'a', 'planar', 'double', 'ring', 'lattice', 'subjected', 'to', 'two', 'artificial', 'gauge', 'fields', 'we', 'determine', 'its', 'ground', 'state', 'by', 'solving', 'coupled', 'discrete', 'nonlinear', 'schrodinger', 'equations', 'at', 'mean', 'field', 'level', 'at', 'varying', 'interring', 'tunnel', 'coupling', 'flux', 'and', 'interactions', 'we', 'identify', 'the', 'vortex', 'meissner', 'and', 'biasedladder', 'phases', 'also', 'predicted', 'for', 'a', 'bosonic', 'linear', 'ladder', 'by', 'a', 'variational', 'ansatz', 'we', 'also', 'find', 'peculiar', 'features', 'associated', 'to', 'the', 'ring', 'geometry', 'in', 'particular', 'parity', 'effects', 'in', 'the', 'number', 'of', 'vortices', 'and', 'the', 'appearance', 'of', 'a', 'single', 'vortex', 'in', 'the', 'meissner', 'phase', 'we', 'show', 'that', 'the', 'persistent', 'currents', 'on', 'the', 'rings', 'carry', 'precise', 'information', 'on', 'the', 'various', 'phases', 'finally', 'we', 'propose', 'a', 'way', 'of', 'observing', 'the', 'meissner', 'and', 'vortex', 'phases', 'via', 'spiral', 'interferogram', 'techniques']] | [-0.2130852583795786, 0.18865786749677407, -0.06524612549774175, 0.06798768599539817, -0.05317909066520986, -0.14494841504797695, 0.04832749842806527, 0.3580110929906368, -0.2592884537741719, -0.2601355611760583, 0.056770659919406864, -0.25515197928521843, -0.13582104470743428, 0.12790540704089734, 0.046508414705934385, 0.008686547314966216, 0.005843693708320932, 0.03720460987154631, -0.09191455649736796, -0.21977857589196886, 0.33759120146610905, -0.03333143252021973, 0.3008626943310013, 0.004174962147353365, 0.1159238308919446, 0.014380627361658429, 0.03754537761588359, 0.06077738790698941, -0.16375274444951737, 0.048027365516486856, 0.1609557996231911, -0.037531204267459484, 0.16815468787940013, -0.48702276027983143, -0.173641249764755, 0.08234934002855822, 0.15431043418033774, 0.17396759112284238, -0.04390060246759464, -0.3272974408039498, -0.0017714414002728603, -0.1569072756988351, -0.1592775298336092, -0.09480824772756369, 0.011132860453688494, 0.015061109905622693, -0.23869605954655165, 0.0808707568752912, 0.03891818857629828, 0.06502831377650774, -0.0676419863427457, -0.05348414353867401, -0.0342663359913295, 0.0373906186441817, -0.01336426416315907, 0.013903668472064763, 0.1282150117820868, -0.20578428246875455, -0.14540580365925082, 0.3313246357942089, -0.08993344052023963, -0.17776189152417438, 0.18575765581298914, -0.14098808237585694, -0.09770793864496112, 0.1573946652305682, 0.15779892597643155, 0.10497809310872404, -0.10987496372711446, 0.06786964016057373, -0.07077935672852964, 0.13135173766400723, 0.03806294281301754, 0.04736143093817638, 0.30148647848280175, 0.13459075652321595, 0.05132144846304852, 0.20343760965347646, -0.13192244904394823, -0.11578440975900443, -0.2963599995636041, -0.12926897457024702, -0.14977216067546534, 0.045473503717590895, -0.027443002960700097, -0.16739305346051142, 0.4251378599317774, 0.13853231076953104, 0.1746760340241645, -0.04019247949130774, 0.24515269778018434, 0.11103962425379053, 0.061065537385672095, 0.030427757280117405, 0.24203125624788097, 0.19666538258186644, 0.089468639907113, -0.3205415517884484, -0.053058333835372375, 0.09245332612449096] |
1,803.02719 | Constraints on the diffuse high-energy neutrino flux from the third
flight of ANITA | The Antarctic Impulsive Transient Antenna (ANITA), a NASA long-duration
balloon payload, searches for radio emission from interactions of
ultra-high-energy neutrinos in polar ice. The third flight of ANITA (ANITA-III)
was launched in December 2014 and completed a 22-day flight. We present the
results of three analyses searching for Askaryan radio emission of neutrino
origin. In the most sensitive of the analyses, we find one event in the signal
region on an expected a priori background of $0.7^{+0.5}_{-0.3}$. Though
consistent with the background estimate, the candidate event remains compatible
with a neutrino hypothesis even after additional post-unblinding scrutiny.
| astro-ph.HE astro-ph.IM hep-ex | the antarctic impulsive transient antenna anita a nasa longduration balloon payload searches for radio emission from interactions of ultrahighenergy neutrinos in polar ice the third flight of anita anitaiii was launched in december 2014 and completed a 22day flight we present the results of three analyses searching for askaryan radio emission of neutrino origin in the most sensitive of the analyses we find one event in the signal region on an expected a priori background of 0705_03 though consistent with the background estimate the candidate event remains compatible with a neutrino hypothesis even after additional postunblinding scrutiny | [['the', 'antarctic', 'impulsive', 'transient', 'antenna', 'anita', 'a', 'nasa', 'longduration', 'balloon', 'payload', 'searches', 'for', 'radio', 'emission', 'from', 'interactions', 'of', 'ultrahighenergy', 'neutrinos', 'in', 'polar', 'ice', 'the', 'third', 'flight', 'of', 'anita', 'anitaiii', 'was', 'launched', 'in', 'december', '2014', 'and', 'completed', 'a', '22day', 'flight', 'we', 'present', 'the', 'results', 'of', 'three', 'analyses', 'searching', 'for', 'askaryan', 'radio', 'emission', 'of', 'neutrino', 'origin', 'in', 'the', 'most', 'sensitive', 'of', 'the', 'analyses', 'we', 'find', 'one', 'event', 'in', 'the', 'signal', 'region', 'on', 'an', 'expected', 'a', 'priori', 'background', 'of', '0705_03', 'though', 'consistent', 'with', 'the', 'background', 'estimate', 'the', 'candidate', 'event', 'remains', 'compatible', 'with', 'a', 'neutrino', 'hypothesis', 'even', 'after', 'additional', 'postunblinding', 'scrutiny']] | [-0.15045382938486465, 0.21008323704804654, -0.057419967867973994, 0.12656163392068961, -0.09072404628262874, -0.08141880345956838, 0.035931554687348134, 0.37247430322136965, -0.1333286516687912, -0.348466837761349, 0.13278008782443532, -0.3255389902066994, -0.09434105034612932, 0.2305306359194219, 0.01223647775483922, -0.002928217084077682, 0.12502317628922296, -0.022283582403225467, -0.011933476463495258, -0.18885160522396735, 0.20207757694508008, 0.24240783867525292, 0.20706386306382557, -0.027261429471261006, 0.11903605878630534, -0.017779096383898657, -0.14365660943440162, -0.09461743538168833, -0.06487596068194414, 0.007807966876537242, 0.2280914278978363, 0.17345392141005697, 0.12186341300269866, -0.41528289481759706, -0.23360720220482611, 0.1291754589505256, 0.059899460717520496, 0.01042616464125805, -0.11165533776201823, -0.3677770878941296, 0.024864906588807068, -0.22139917352692562, -0.16168229879831222, 0.11627517922464362, 0.001065543763577304, -0.01762278981387932, -0.25283341940264514, 0.018914173951649918, -0.014078221256606915, 0.04733048837156372, -0.1257606408771801, -0.0888588214937122, 0.013252283473736904, 0.08317988247987121, 0.11786306710997993, 0.014919398917241934, 0.1159065294951359, -0.10649660112772216, -0.14613767136928646, 0.40773225761950016, -0.06609473007414093, 0.0005991927526415663, 0.1699949314698894, -0.22189135441403005, -0.19485314733824355, 0.23928640860113057, 0.19598796148289074, 0.06552493687164276, -0.20494781332486806, 0.020899282168334428, -0.01568617329912934, 0.17730769256942291, 0.06492788715912227, -0.000807830612447628, 0.3299155124522587, 0.22241227718644796, 0.11690296441752543, 0.08765721098926077, -0.2642975570312008, 0.019019525760705484, -0.34136876902800606, -0.09294845262899044, -0.15388957511118434, 0.062400083511478285, 0.007560455944219436, -0.12456968058138451, 0.3955346196394493, 0.12936717618573854, 0.1010476414490729, -0.029359931069267715, 0.3099763301656918, -0.004655130920892066, 0.02276167973004123, 0.07364944272743974, 0.37254867587793383, 0.07475394748666501, 0.16622413786504656, -0.16921213699970394, 0.08374631623341207, -0.0028091338908973525] |
1,803.0272 | Byzantine Preferential Voting | In the Byzantine agreement problem, n nodes with possibly different input
values aim to reach agreement on a common value in the presence of t < n/3
Byzantine nodes which represent arbitrary failures in the system. This paper
introduces a generalization of Byzantine agreement, where the input values of
the nodes are preference rankings of three or more candidates. We show that
consensus on preferences, which is an important question in social choice
theory, complements already known results from Byzantine agreement. In addition
preferential voting raises new questions about how to approximate consensus
vectors. We propose a deterministic algorithm to solve Byzantine agreement on
rankings under a generalized validity condition, which we call Pareto-Validity.
These results are then extended by considering a special voting rule which
chooses the Kemeny median as the consensus vector. For this rule, we derive a
lower bound on the approximation ratio of the Kemeny median that can be
guaranteed by any deterministic algorithm. We then provide an algorithm
matching this lower bound. To our knowledge, this is the first non-trivial
multi-dimensional approach which can tolerate a constant fraction of Byzantine
nodes.
| cs.DC | in the byzantine agreement problem n nodes with possibly different input values aim to reach agreement on a common value in the presence of t n3 byzantine nodes which represent arbitrary failures in the system this paper introduces a generalization of byzantine agreement where the input values of the nodes are preference rankings of three or more candidates we show that consensus on preferences which is an important question in social choice theory complements already known results from byzantine agreement in addition preferential voting raises new questions about how to approximate consensus vectors we propose a deterministic algorithm to solve byzantine agreement on rankings under a generalized validity condition which we call paretovalidity these results are then extended by considering a special voting rule which chooses the kemeny median as the consensus vector for this rule we derive a lower bound on the approximation ratio of the kemeny median that can be guaranteed by any deterministic algorithm we then provide an algorithm matching this lower bound to our knowledge this is the first nontrivial multidimensional approach which can tolerate a constant fraction of byzantine nodes | [['in', 'the', 'byzantine', 'agreement', 'problem', 'n', 'nodes', 'with', 'possibly', 'different', 'input', 'values', 'aim', 'to', 'reach', 'agreement', 'on', 'a', 'common', 'value', 'in', 'the', 'presence', 'of', 't', 'n3', 'byzantine', 'nodes', 'which', 'represent', 'arbitrary', 'failures', 'in', 'the', 'system', 'this', 'paper', 'introduces', 'a', 'generalization', 'of', 'byzantine', 'agreement', 'where', 'the', 'input', 'values', 'of', 'the', 'nodes', 'are', 'preference', 'rankings', 'of', 'three', 'or', 'more', 'candidates', 'we', 'show', 'that', 'consensus', 'on', 'preferences', 'which', 'is', 'an', 'important', 'question', 'in', 'social', 'choice', 'theory', 'complements', 'already', 'known', 'results', 'from', 'byzantine', 'agreement', 'in', 'addition', 'preferential', 'voting', 'raises', 'new', 'questions', 'about', 'how', 'to', 'approximate', 'consensus', 'vectors', 'we', 'propose', 'a', 'deterministic', 'algorithm', 'to', 'solve', 'byzantine', 'agreement', 'on', 'rankings', 'under', 'a', 'generalized', 'validity', 'condition', 'which', 'we', 'call', 'paretovalidity', 'these', 'results', 'are', 'then', 'extended', 'by', 'considering', 'a', 'special', 'voting', 'rule', 'which', 'chooses', 'the', 'kemeny', 'median', 'as', 'the', 'consensus', 'vector', 'for', 'this', 'rule', 'we', 'derive', 'a', 'lower', 'bound', 'on', 'the', 'approximation', 'ratio', 'of', 'the', 'kemeny', 'median', 'that', 'can', 'be', 'guaranteed', 'by', 'any', 'deterministic', 'algorithm', 'we', 'then', 'provide', 'an', 'algorithm', 'matching', 'this', 'lower', 'bound', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'nontrivial', 'multidimensional', 'approach', 'which', 'can', 'tolerate', 'a', 'constant', 'fraction', 'of', 'byzantine', 'nodes']] | [-0.1777245582419235, 0.04538747336751523, -0.04074508611254556, 0.05293300320424706, -0.08672059629790728, -0.19545184640098698, 0.1693037190429016, 0.36504941855294065, -0.24660412248340435, -0.33791378029095737, 0.06356057095146515, -0.2517337169379259, -0.17528628477695116, 0.12357489227408382, -0.11144232547983689, 0.05219914634479843, 0.0775531343963888, 0.10616667412044911, -0.00913512564274361, -0.32553540091232763, 0.28247604515332647, 0.04840819070902754, 0.2593919016248749, 0.010182996526924873, 0.06639905787786753, -0.0015812847578553888, 0.022456781864014414, 0.05337993269938085, -0.1435879637603806, 0.10416218960903201, 0.2973516100192564, 0.14960902959465666, 0.3109652350312504, -0.3839556169088768, -0.1307593289276828, 0.15844508245050826, 0.14725052855362225, 0.1476940973503667, -0.022053124134206726, -0.27102774251556105, 0.12511879659470412, -0.169934953321227, -0.09168074683301435, -0.05761914766575817, -0.0040340089522626086, 0.02573139291084574, -0.32695125854376744, 0.05339808576568232, 0.06135899718640797, 0.018055090154714137, -0.07047970337114985, -0.10559979959013974, 0.06497458959600645, 0.09163456549235295, 0.012122180374243053, 0.05082218133864681, 0.0767322757063717, -0.1156159363201131, -0.1848833251076386, 0.37873420310611633, -0.030959430939021884, -0.19913745526355342, 0.12812329196300276, -0.04999902712322934, -0.1979920432254996, 0.08989857322518693, 0.1865503502700923, 0.12366180989952029, -0.1462777358500044, 0.022598109415570354, -0.1513755732774608, 0.1869803359327109, 0.07962367367809234, 0.000421146617475682, 0.15522045032728626, 0.11737455911529453, 0.13461375315724264, 0.1198119481629439, -0.004218203714117408, -0.14925794708340065, -0.27142116120692505, -0.09835998391265646, -0.17728380427085896, 0.04386551516464628, -0.15433614405692028, -0.15075709155770828, 0.35059118748683, 0.2114459937033446, 0.23750017448986435, 0.1347329455944102, 0.2974607168270386, 0.10233853900306554, 0.005500227392906748, 0.15648904878079242, 0.22879152117378038, 0.08606370685574012, 0.04168039033855008, -0.16138665969723978, 0.17318328761093257, 0.049716986196986196] |
1,803.02721 | A new mixed isogeometric approach to Kirchhoff-Love shells | For Kichhoff-Love shell problems a new mixed formulation solely based on
standard $H^1$ spaces is presented. This allows for flexibility in the
construction of discretization spaces, e.g., standard $C^0$-coupling of
multi-patch isogeometric spaces is sufficient. In terms of solution strategies,
for iterative solvers efficient methods for standard second-order problems like
multigrid can be used as building blocks of a preconditioner. Furthermore, a
combination of the proposed mixed formulation of the bending part with a
popular mixed formulation of the membrane part in order to avoid membrane
locking is considered. The performance of both mixed formulations is
demonstrated by numerical benchmark studies.
| math.NA | for kichhofflove shell problems a new mixed formulation solely based on standard h1 spaces is presented this allows for flexibility in the construction of discretization spaces eg standard c0coupling of multipatch isogeometric spaces is sufficient in terms of solution strategies for iterative solvers efficient methods for standard secondorder problems like multigrid can be used as building blocks of a preconditioner furthermore a combination of the proposed mixed formulation of the bending part with a popular mixed formulation of the membrane part in order to avoid membrane locking is considered the performance of both mixed formulations is demonstrated by numerical benchmark studies | [['for', 'kichhofflove', 'shell', 'problems', 'a', 'new', 'mixed', 'formulation', 'solely', 'based', 'on', 'standard', 'h1', 'spaces', 'is', 'presented', 'this', 'allows', 'for', 'flexibility', 'in', 'the', 'construction', 'of', 'discretization', 'spaces', 'eg', 'standard', 'c0coupling', 'of', 'multipatch', 'isogeometric', 'spaces', 'is', 'sufficient', 'in', 'terms', 'of', 'solution', 'strategies', 'for', 'iterative', 'solvers', 'efficient', 'methods', 'for', 'standard', 'secondorder', 'problems', 'like', 'multigrid', 'can', 'be', 'used', 'as', 'building', 'blocks', 'of', 'a', 'preconditioner', 'furthermore', 'a', 'combination', 'of', 'the', 'proposed', 'mixed', 'formulation', 'of', 'the', 'bending', 'part', 'with', 'a', 'popular', 'mixed', 'formulation', 'of', 'the', 'membrane', 'part', 'in', 'order', 'to', 'avoid', 'membrane', 'locking', 'is', 'considered', 'the', 'performance', 'of', 'both', 'mixed', 'formulations', 'is', 'demonstrated', 'by', 'numerical', 'benchmark', 'studies']] | [-0.06933195389056993, -0.010288178017645172, -0.08733113846892133, 0.04914037531331144, -0.087414186485488, -0.1382611086780224, -0.04650410040601561, 0.3461954879640329, -0.28513895567845216, -0.27431271142429775, 0.17367957383888125, -0.18985159390601872, -0.1530431668753877, 0.21801996251775158, -0.11870523302279638, 0.10317905743916829, 0.10262088570743799, -0.046565347275875434, -0.13928703239864923, -0.22571936759138198, 0.30294926846493975, 0.022099767933891276, 0.29986133357754563, 0.027675320488410166, 0.12145386618383304, -0.02910392728135592, -0.033256423565549684, 0.057210403645053656, -0.08590094224582756, 0.1758162079360148, 0.27794286251571404, 0.08207488251906453, 0.32912692711735614, -0.43848158629855727, -0.23653216343672917, 0.07336114694110372, 0.13352491197954144, 0.1064562038001087, -0.04721608918484752, -0.24458524584770203, 0.08680486097235722, -0.14557744797337988, -0.12849831012914878, -0.1199367255762671, -0.05270809538878801, -0.0007692793798115519, -0.35362402592418773, 0.06426294443357472, 0.02871605447220682, 0.011952868822698642, -0.07113121537023666, -0.17424824766137384, 0.02420910954889324, 0.03871687209572305, 0.008473881326305369, -0.025368233023192546, 0.07864787634650264, -0.07443021814282419, -0.14823980587816826, 0.430073820713042, -0.07724926167407609, -0.3029703276956247, 0.17773582620988365, 0.019732022963727665, -0.11168096935131935, 0.1132951286630799, 0.1957877412005657, 0.19946699697674827, -0.10997247252839082, 0.11599913118124912, -0.005481145118899418, 0.1592297882330839, 0.047489955024135236, -0.0015994241705747567, 0.11980553001701606, 0.24994607417458536, 0.11382423182290913, 0.1440678558799184, -0.0362209894746128, -0.14872996603677313, -0.32858622012979755, -0.1647826803103207, -0.17772859996043597, -0.07918084564741061, -0.11310500080574944, -0.22257904727200065, 0.35770021168270494, 0.10349707491695881, 0.07224280125640258, 0.05787619359490245, 0.33006424955421626, 0.08823025387046257, 0.08071424749049574, 0.03593277540340117, 0.21057502042050613, 0.1578232447400388, 0.10181594081693376, -0.22239949512577645, 0.03133759461813653, 0.17596595597011272] |
1,803.02722 | Physical, spectral, and dynamical properties of asteroid (107) Camilla
and its satellites | The population of large asteroids is thought to be primordial and they are
the most direct witnesses of the early history of our Solar System. Those
satellites allow study of the mass, and hence density and internal structure.
We study here the properties of the triple asteroid (107) Camilla from
lightcurves, stellar occultations, optical spectroscopy, and high-contrast and
high-angular-resolution images and spectro-images. Using 80 positions over 15
years, we determine the orbit of its larger satellite to be circular,
equatorial, and prograde, with RMS residuals of 7.8 mas. From 11 positions in
three epochs only, in 2015 and 2016, we determine a preliminary orbit for the
second satellite. We find the orbit to be somewhat eccentric and slightly
inclined to the primary's equatorial plane, reminiscent of the inner satellites
of other asteroid triple systems. Comparison of the near-infrared spectrum of
the larger satellite reveals no significant difference with Camilla. Hence,
these properties argue for a formation of the satellites by excavation from
impact and re-accumulation of ejecta. We determine the spin and 3-D shape of
Camilla. The model fits well each data set. We determine Camilla to be larger
than reported from modeling of mid-infrared photometry, with a
spherical-volume-equivalent diameter of 254 $\pm$ 36 km (3 $\sigma$
uncertainty), in agreement with recent results from shape modeling
(Hanus2017+). Combining the mass of (1.12 $\pm$ 0.01) $\times$ 10$^{19}$ kg
determined from the dynamics of the satellites and the volume from the 3-D
shape model, we determine a density of 1,280 $\pm$ 130 SI. From this density,
and considering Camilla's spectral similarities with (24) Themis and (65)
Cybele (for which water ice coating on surface grains was reported), we infer a
silicate-to-ice mass ratio of 1-6, with a 10-30% macroporosity.
| astro-ph.EP | the population of large asteroids is thought to be primordial and they are the most direct witnesses of the early history of our solar system those satellites allow study of the mass and hence density and internal structure we study here the properties of the triple asteroid 107 camilla from lightcurves stellar occultations optical spectroscopy and highcontrast and highangularresolution images and spectroimages using 80 positions over 15 years we determine the orbit of its larger satellite to be circular equatorial and prograde with rms residuals of 78 mas from 11 positions in three epochs only in 2015 and 2016 we determine a preliminary orbit for the second satellite we find the orbit to be somewhat eccentric and slightly inclined to the primarys equatorial plane reminiscent of the inner satellites of other asteroid triple systems comparison of the nearinfrared spectrum of the larger satellite reveals no significant difference with camilla hence these properties argue for a formation of the satellites by excavation from impact and reaccumulation of ejecta we determine the spin and 3d shape of camilla the model fits well each data set we determine camilla to be larger than reported from modeling of midinfrared photometry with a sphericalvolumeequivalent diameter of 254 pm 36 km 3 sigma uncertainty in agreement with recent results from shape modeling hanus2017 combining the mass of 112 pm 001 times 1019 kg determined from the dynamics of the satellites and the volume from the 3d shape model we determine a density of 1280 pm 130 si from this density and considering camillas spectral similarities with 24 themis and 65 cybele for which water ice coating on surface grains was reported we infer a silicatetoice mass ratio of 16 with a 1030 macroporosity | [['the', 'population', 'of', 'large', 'asteroids', 'is', 'thought', 'to', 'be', 'primordial', 'and', 'they', 'are', 'the', 'most', 'direct', 'witnesses', 'of', 'the', 'early', 'history', 'of', 'our', 'solar', 'system', 'those', 'satellites', 'allow', 'study', 'of', 'the', 'mass', 'and', 'hence', 'density', 'and', 'internal', 'structure', 'we', 'study', 'here', 'the', 'properties', 'of', 'the', 'triple', 'asteroid', '107', 'camilla', 'from', 'lightcurves', 'stellar', 'occultations', 'optical', 'spectroscopy', 'and', 'highcontrast', 'and', 'highangularresolution', 'images', 'and', 'spectroimages', 'using', '80', 'positions', 'over', '15', 'years', 'we', 'determine', 'the', 'orbit', 'of', 'its', 'larger', 'satellite', 'to', 'be', 'circular', 'equatorial', 'and', 'prograde', 'with', 'rms', 'residuals', 'of', '78', 'mas', 'from', '11', 'positions', 'in', 'three', 'epochs', 'only', 'in', '2015', 'and', '2016', 'we', 'determine', 'a', 'preliminary', 'orbit', 'for', 'the', 'second', 'satellite', 'we', 'find', 'the', 'orbit', 'to', 'be', 'somewhat', 'eccentric', 'and', 'slightly', 'inclined', 'to', 'the', 'primarys', 'equatorial', 'plane', 'reminiscent', 'of', 'the', 'inner', 'satellites', 'of', 'other', 'asteroid', 'triple', 'systems', 'comparison', 'of', 'the', 'nearinfrared', 'spectrum', 'of', 'the', 'larger', 'satellite', 'reveals', 'no', 'significant', 'difference', 'with', 'camilla', 'hence', 'these', 'properties', 'argue', 'for', 'a', 'formation', 'of', 'the', 'satellites', 'by', 'excavation', 'from', 'impact', 'and', 'reaccumulation', 'of', 'ejecta', 'we', 'determine', 'the', 'spin', 'and', '3d', 'shape', 'of', 'camilla', 'the', 'model', 'fits', 'well', 'each', 'data', 'set', 'we', 'determine', 'camilla', 'to', 'be', 'larger', 'than', 'reported', 'from', 'modeling', 'of', 'midinfrared', 'photometry', 'with', 'a', 'sphericalvolumeequivalent', 'diameter', 'of', '254', 'pm', '36', 'km', '3', 'sigma', 'uncertainty', 'in', 'agreement', 'with', 'recent', 'results', 'from', 'shape', 'modeling', 'hanus2017', 'combining', 'the', 'mass', 'of', '112', 'pm', '001', 'times', '1019', 'kg', 'determined', 'from', 'the', 'dynamics', 'of', 'the', 'satellites', 'and', 'the', 'volume', 'from', 'the', '3d', 'shape', 'model', 'we', 'determine', 'a', 'density', 'of', '1280', 'pm', '130', 'si', 'from', 'this', 'density', 'and', 'considering', 'camillas', 'spectral', 'similarities', 'with', '24', 'themis', 'and', '65', 'cybele', 'for', 'which', 'water', 'ice', 'coating', 'on', 'surface', 'grains', 'was', 'reported', 'we', 'infer', 'a', 'silicatetoice', 'mass', 'ratio', 'of', '16', 'with', 'a', '1030', 'macroporosity']] | [-0.07910865094749646, 0.1148155065312613, -0.07625253043917432, 0.03389252086462907, -0.030461871068284588, -0.04003313739780771, 0.03720085917850265, 0.36822390698172913, -0.17775410357282692, -0.41237846968116326, 0.09955437439228507, -0.30443918738882764, -0.07017774175845955, 0.2157158951354032, -0.06778385763055754, 0.008826717098988923, 0.09520577200747658, -0.0493895755241569, -0.07785432511042185, -0.19966981247768412, 0.24549936413001466, 0.07637057774009137, 0.14623472142829674, -0.02767147541119365, 0.06941977756648314, -0.024773981371177065, -0.06475177605376438, -0.026805647757470397, -0.189901132559463, 0.11189342962821465, 0.17698787235368582, 0.0884257918593964, 0.14417735079563365, -0.3661124718744907, -0.161221042176702, 0.057548379608534456, 0.1053668963665294, 0.053643571089067935, -0.010562513412351558, -0.2795193119817035, 0.08496150542618279, -0.20820533885544845, -0.16186430712901845, 0.06476404190733173, 0.08797078995509633, 0.017006798453181454, -0.21853292219208342, 0.11438667494289464, 0.01996287731363277, 0.12628809538054486, -0.13514093184874923, -0.15749796417619139, -0.10597204100982328, 0.08696332635759464, 0.017720995046356332, 0.04235193788653154, 0.16160006341723931, -0.06539776916089123, -0.036347672643136666, 0.4203109773609774, -0.08036984253927527, -0.0409627887620895, 0.20702439314741708, -0.23942191687588624, -0.11086451039689037, 0.18672758666880745, 0.17482408036415337, 0.10304543013518261, -0.1363986240399182, 0.003817808386119405, -0.03216145215383254, 0.2377628573979985, 0.09339798943965627, 0.03519471095112961, 0.3021878068717509, 0.13303677572427786, 0.048357026457339, 0.0607181262856764, -0.24948943418602035, -0.0358390049649363, -0.18927381410985006, -0.12009214601880959, -0.13108608896050983, 0.06789839982265745, -0.13150328349909504, -0.0890921620148573, 0.37613156803162906, 0.1416519551941888, 0.25088005929579793, 0.02657405971327316, 0.2653997854951624, 0.05563110364408704, 0.08980598227226244, 0.10114008928780763, 0.32275513663572053, 0.1432339843097653, 0.061571248730911146, -0.2088728681563148, 0.03402127562355672, -0.01929820456719783] |
1,803.02723 | Heterogeneous Vehicles Routing for Water Canal Damage Assessment | In Japan, inspection of irrigation water canals has been mostly conducted
manually. However, the huge demand for more regular inspections as
infrastructure ages, coupled with the limited time window available for
inspection, has rendered manual inspection increasingly insufficient. With
shortened inspection time and reduced labor cost, automated inspection using a
combination of unmanned aerial vehicles (UAVs) and ground vehicles (cars) has
emerged as an attractive alternative to manual inspection. In this paper, we
propose a path planning framework that generates optimal plans for UAVs and
cars to inspect water canals in a large agricultural area (tens of square
kilometers). In addition to optimality, the paths need to satisfy several
constraints, in order to guarantee UAV navigation safety and to abide by local
traffic regulations. In the proposed framework, the canal and road networks are
first modeled as two graphs, which are then partitioned into smaller subgraphs
that can be covered by a given fleet of UAVs within one battery charge. The
problem of finding optimal paths for both UAVs and cars on the graphs, subject
to the constraints, is formulated as a mixed-integer quadratic program (MIQP).
The proposed framework can also quickly generate new plans when a current plan
is interrupted. The effectiveness of the proposed framework is validated by
simulation results showing the successful generation of plans covering all
given canal segments, and the ability to quickly revise the plan when
conditions change.
| cs.RO | in japan inspection of irrigation water canals has been mostly conducted manually however the huge demand for more regular inspections as infrastructure ages coupled with the limited time window available for inspection has rendered manual inspection increasingly insufficient with shortened inspection time and reduced labor cost automated inspection using a combination of unmanned aerial vehicles uavs and ground vehicles cars has emerged as an attractive alternative to manual inspection in this paper we propose a path planning framework that generates optimal plans for uavs and cars to inspect water canals in a large agricultural area tens of square kilometers in addition to optimality the paths need to satisfy several constraints in order to guarantee uav navigation safety and to abide by local traffic regulations in the proposed framework the canal and road networks are first modeled as two graphs which are then partitioned into smaller subgraphs that can be covered by a given fleet of uavs within one battery charge the problem of finding optimal paths for both uavs and cars on the graphs subject to the constraints is formulated as a mixedinteger quadratic program miqp the proposed framework can also quickly generate new plans when a current plan is interrupted the effectiveness of the proposed framework is validated by simulation results showing the successful generation of plans covering all given canal segments and the ability to quickly revise the plan when conditions change | [['in', 'japan', 'inspection', 'of', 'irrigation', 'water', 'canals', 'has', 'been', 'mostly', 'conducted', 'manually', 'however', 'the', 'huge', 'demand', 'for', 'more', 'regular', 'inspections', 'as', 'infrastructure', 'ages', 'coupled', 'with', 'the', 'limited', 'time', 'window', 'available', 'for', 'inspection', 'has', 'rendered', 'manual', 'inspection', 'increasingly', 'insufficient', 'with', 'shortened', 'inspection', 'time', 'and', 'reduced', 'labor', 'cost', 'automated', 'inspection', 'using', 'a', 'combination', 'of', 'unmanned', 'aerial', 'vehicles', 'uavs', 'and', 'ground', 'vehicles', 'cars', 'has', 'emerged', 'as', 'an', 'attractive', 'alternative', 'to', 'manual', 'inspection', 'in', 'this', 'paper', 'we', 'propose', 'a', 'path', 'planning', 'framework', 'that', 'generates', 'optimal', 'plans', 'for', 'uavs', 'and', 'cars', 'to', 'inspect', 'water', 'canals', 'in', 'a', 'large', 'agricultural', 'area', 'tens', 'of', 'square', 'kilometers', 'in', 'addition', 'to', 'optimality', 'the', 'paths', 'need', 'to', 'satisfy', 'several', 'constraints', 'in', 'order', 'to', 'guarantee', 'uav', 'navigation', 'safety', 'and', 'to', 'abide', 'by', 'local', 'traffic', 'regulations', 'in', 'the', 'proposed', 'framework', 'the', 'canal', 'and', 'road', 'networks', 'are', 'first', 'modeled', 'as', 'two', 'graphs', 'which', 'are', 'then', 'partitioned', 'into', 'smaller', 'subgraphs', 'that', 'can', 'be', 'covered', 'by', 'a', 'given', 'fleet', 'of', 'uavs', 'within', 'one', 'battery', 'charge', 'the', 'problem', 'of', 'finding', 'optimal', 'paths', 'for', 'both', 'uavs', 'and', 'cars', 'on', 'the', 'graphs', 'subject', 'to', 'the', 'constraints', 'is', 'formulated', 'as', 'a', 'mixedinteger', 'quadratic', 'program', 'miqp', 'the', 'proposed', 'framework', 'can', 'also', 'quickly', 'generate', 'new', 'plans', 'when', 'a', 'current', 'plan', 'is', 'interrupted', 'the', 'effectiveness', 'of', 'the', 'proposed', 'framework', 'is', 'validated', 'by', 'simulation', 'results', 'showing', 'the', 'successful', 'generation', 'of', 'plans', 'covering', 'all', 'given', 'canal', 'segments', 'and', 'the', 'ability', 'to', 'quickly', 'revise', 'the', 'plan', 'when', 'conditions', 'change']] | [-0.12850877022719942, 0.07323000772910154, -0.03724144922512679, 0.03727564180536498, -0.10668652483488983, -0.1337973622756445, 0.09606793305973928, 0.4140020231795935, -0.2398187679787859, -0.38076268925140494, 0.16140311692456286, -0.26484785891838497, -0.12232175605912876, 0.20708949860925666, -0.15602766460953996, 0.11446781341647172, 0.12268470964965641, 0.0017623549589095488, 0.036643666215987206, -0.25418309033967745, 0.20621469933655298, 0.048373368767718986, 0.30298718645309025, 0.0715453972060902, 0.11195601178651564, 0.01427724053705127, -0.025421978444115728, 0.0678965262568687, -0.09028719685421749, 0.13411939744270432, 0.360833463150586, 0.19116501876602793, 0.31526636758134663, -0.4995944018308551, -0.2026662085455062, 0.12080392870518705, 0.13333853657962355, 0.040192959053565264, -0.022876624061547432, -0.3327158275896158, 0.08175091832949835, -0.19766471111892253, -0.101310377561937, -0.052480615285408296, 0.038516852036058806, 0.038752136718428046, -0.26678979189461494, -0.051747407870786064, -0.027771967229369678, 0.08179735252633691, -0.07277175241088271, -0.07172213198490736, -0.042695934406648844, 0.19843995739316814, 0.04668937157864412, 0.021833491130556878, 0.15341485615219705, -0.12227530247093035, -0.11383330911939216, 0.4283882747603278, 0.01587114081883198, -0.17610055942617708, 0.15463802382662398, -0.03505136591032084, -0.10046751797497751, 0.15848027609396154, 0.2181279490854587, 0.12228121236066183, -0.2131860342269025, -0.012331492010589577, -0.020662693304316197, 0.12298214933476768, 0.08651827077548473, -0.032761380975890875, 0.19867567664190044, 0.2453379618963147, 0.1825844925782508, 0.1309834026127584, -0.08852593015290351, -0.10819423621874621, -0.22195447916483396, -0.11996693139036115, -0.17322302994698396, -0.02042084685417338, -0.050333649745476175, -0.10481406698743694, 0.3640002593329439, 0.16351328069606844, 0.11719626465286964, 0.09463247470308939, 0.3674084976570219, 0.054076932516679346, 0.10592313970112775, 0.09314042764156659, 0.1841601358107729, -0.013683926812611902, 0.1436963732768264, -0.18536184846152925, 0.09580467782743499, 0.04257124238727121] |
1,803.02724 | Small oscillations of non-dissipative Lagrangian systems | The small oscillations of an arbitrary scleronomous system subject to
time-independent non dissipative forces are discussed. The linearized equations
of motion are solved by quadratures. As in the conservative case, the general
integral is shown to consist of a superposition of harmonic oscillations. A
complexification of the resolving algorithm is presented.
| math-ph gr-qc math.MP | the small oscillations of an arbitrary scleronomous system subject to timeindependent non dissipative forces are discussed the linearized equations of motion are solved by quadratures as in the conservative case the general integral is shown to consist of a superposition of harmonic oscillations a complexification of the resolving algorithm is presented | [['the', 'small', 'oscillations', 'of', 'an', 'arbitrary', 'scleronomous', 'system', 'subject', 'to', 'timeindependent', 'non', 'dissipative', 'forces', 'are', 'discussed', 'the', 'linearized', 'equations', 'of', 'motion', 'are', 'solved', 'by', 'quadratures', 'as', 'in', 'the', 'conservative', 'case', 'the', 'general', 'integral', 'is', 'shown', 'to', 'consist', 'of', 'a', 'superposition', 'of', 'harmonic', 'oscillations', 'a', 'complexification', 'of', 'the', 'resolving', 'algorithm', 'is', 'presented']] | [-0.23488238595193253, 0.13539823745173635, -0.050514442324638364, 0.04240076848771423, -0.05543904984369874, -0.12315915441140532, -0.09550281287170946, 0.276277454867959, -0.2839976649731398, -0.24228899624198674, 0.08314411687431857, -0.2483375924266875, -0.11247701185755432, 0.24944297771900892, -0.045739149861037734, 0.0939889084175229, 0.08763867150992155, 0.05990263124462217, -0.020207795053720473, -0.22572301678359508, 0.3179074900597334, 0.03687078808085062, 0.1986902269627899, -0.028636739030480383, 0.15332720790058374, -0.012071612090803683, -0.02129748195409775, 0.05549859542399645, -0.062709236718365, 0.06449268722906709, 0.21682680427562445, 0.03911778554320335, 0.2745976453949697, -0.43345135502517224, -0.2092007417604327, 0.07240829676389694, 0.14321357062552123, 0.142069522831589, 0.007252732198685408, -0.31309086225461213, 0.021703274212777613, -0.11377025053312537, -0.21411630508489907, -0.10105047017335891, 0.04236925549805164, 0.08795573303475976, -0.27226174280047416, 0.12949124589562416, 0.0909595055540558, 0.022712613940238952, -0.11479878704994917, -0.044713645786978305, 0.012269609039649368, 0.07105157159268856, 0.009880140019813553, -0.0004239130672067404, 0.0904130206257105, -0.07071622371673585, -0.08794122366234661, 0.4350510160624981, -0.07837920515332371, -0.31070683009922506, 0.1432743421662599, -0.1139345553610474, -0.06131379986181855, 0.1711347219720483, 0.1431060678511858, 0.16034233935177325, -0.1850169177725911, 0.09614086050540209, -0.025848958026617765, 0.10508547209203244, 0.08189238857477904, -0.017267052180832253, 0.181208954192698, 0.12946941746398807, 0.07770285537466406, 0.15869522674009204, -0.0009557611588388681, -0.1536628944799304, -0.36149080395698546, -0.09159722600597889, -0.1939677705988288, 0.0632427167147398, -0.021069498145952822, -0.20045931793923955, 0.3753449338302016, 0.07985862724483013, 0.13308699388056994, 0.007434557396918535, 0.2874086219072342, 0.23198725824942812, 0.024420218728482723, 0.05535433277487755, 0.2892481826618314, 0.21794046614784748, 0.072387635842897, -0.2755706744082272, -0.039663233449682596, 0.09357999922242016] |
1,803.02725 | Discovery of a brown dwarf companion to the star HIP 64892 | We report the discovery of a bright, brown dwarf companion to the star HIP
64892, imaged with VLT/SPHERE during the SHINE exoplanet survey. The host is a
B9.5V member of the Lower-Centaurus-Crux subgroup of the Scorpius Centaurus OB
association. The measured angular separation of the companion
($1.2705\pm0.0023$") corresponds to a projected distance of $159\pm12$ AU. We
observed the target with the dual-band imaging and long-slit spectroscopy modes
of the IRDIS imager to obtain its SED and astrometry. In addition, we
reprocessed archival NACO L-band data, from which we also recover the
companion. Its SED is consistent with a young (<30 Myr), low surface gravity
object with a spectral type of M9$_{\gamma}\pm1$. From comparison with the
BT-Settl atmospheric models we estimate an effective temperature of
$T_{\textrm{eff}}=2600 \pm 100$ K, and comparison of the companion photometry
to the COND evolutionary models yields a mass of $\sim29-37$ M$_{\text{J}}$ at
the estimated age of $16^{+15}_{-7}$ Myr for the system. HIP 64892 is a rare
example of an extreme-mass ratio system ($q\sim0.01$) and will be useful for
testing models relating to the formation and evolution of such low-mass
objects.
| astro-ph.EP astro-ph.SR | we report the discovery of a bright brown dwarf companion to the star hip 64892 imaged with vltsphere during the shine exoplanet survey the host is a b95v member of the lowercentauruscrux subgroup of the scorpius centaurus ob association the measured angular separation of the companion 12705pm00023 corresponds to a projected distance of 159pm12 au we observed the target with the dualband imaging and longslit spectroscopy modes of the irdis imager to obtain its sed and astrometry in addition we reprocessed archival naco lband data from which we also recover the companion its sed is consistent with a young 30 myr low surface gravity object with a spectral type of m9_gammapm1 from comparison with the btsettl atmospheric models we estimate an effective temperature of t_textrmeff2600 pm 100 k and comparison of the companion photometry to the cond evolutionary models yields a mass of sim2937 m_textj at the estimated age of 1615_7 myr for the system hip 64892 is a rare example of an extrememass ratio system qsim001 and will be useful for testing models relating to the formation and evolution of such lowmass objects | [['we', 'report', 'the', 'discovery', 'of', 'a', 'bright', 'brown', 'dwarf', 'companion', 'to', 'the', 'star', 'hip', '64892', 'imaged', 'with', 'vltsphere', 'during', 'the', 'shine', 'exoplanet', 'survey', 'the', 'host', 'is', 'a', 'b95v', 'member', 'of', 'the', 'lowercentauruscrux', 'subgroup', 'of', 'the', 'scorpius', 'centaurus', 'ob', 'association', 'the', 'measured', 'angular', 'separation', 'of', 'the', 'companion', '12705pm00023', 'corresponds', 'to', 'a', 'projected', 'distance', 'of', '159pm12', 'au', 'we', 'observed', 'the', 'target', 'with', 'the', 'dualband', 'imaging', 'and', 'longslit', 'spectroscopy', 'modes', 'of', 'the', 'irdis', 'imager', 'to', 'obtain', 'its', 'sed', 'and', 'astrometry', 'in', 'addition', 'we', 'reprocessed', 'archival', 'naco', 'lband', 'data', 'from', 'which', 'we', 'also', 'recover', 'the', 'companion', 'its', 'sed', 'is', 'consistent', 'with', 'a', 'young', '30', 'myr', 'low', 'surface', 'gravity', 'object', 'with', 'a', 'spectral', 'type', 'of', 'm9_gammapm1', 'from', 'comparison', 'with', 'the', 'btsettl', 'atmospheric', 'models', 'we', 'estimate', 'an', 'effective', 'temperature', 'of', 't_textrmeff2600', 'pm', '100', 'k', 'and', 'comparison', 'of', 'the', 'companion', 'photometry', 'to', 'the', 'cond', 'evolutionary', 'models', 'yields', 'a', 'mass', 'of', 'sim2937', 'm_textj', 'at', 'the', 'estimated', 'age', 'of', '1615_7', 'myr', 'for', 'the', 'system', 'hip', '64892', 'is', 'a', 'rare', 'example', 'of', 'an', 'extrememass', 'ratio', 'system', 'qsim001', 'and', 'will', 'be', 'useful', 'for', 'testing', 'models', 'relating', 'to', 'the', 'formation', 'and', 'evolution', 'of', 'such', 'lowmass', 'objects']] | [-0.06384836927836024, 0.07093354261112751, -0.13249505881144297, 0.05022867790120112, -0.13057209803116357, -0.09882555930972706, 0.07153130303438872, 0.3995994102686297, -0.1807532204629117, -0.3847892755469264, 0.0998057167033589, -0.29384543720719425, -0.03181193683730969, 0.1865547979304697, -0.09639347421525177, -0.021381712976848533, 0.165428338003843, -0.0334227369214289, -0.05448244449609436, -0.21829892883921953, 0.26668310957300195, 0.10689624263309376, 0.07999220943392449, -0.05070771495974081, 0.0912905316471615, -0.07332281844059634, -0.07431908524703494, -0.09126124602504247, -0.1913209455737541, 0.06944243998272172, 0.2102674176717618, 0.13148311685857383, 0.18626015197464027, -0.255939039921518, -0.17379819077093067, 0.038331273190547216, 0.15627866355853892, -0.009357242317745722, -0.06150990427163061, -0.3107985789064578, 0.09829029328931599, -0.20545049226128084, -0.18151437200952408, 0.0790527373996325, 0.05004394653004183, 0.0012875653716713884, -0.27536052848797204, 0.10864478103961352, -0.012448914628272854, 0.1586967834290442, -0.1940146303846674, -0.13966907547694782, -0.05777900304028028, 0.10568613663781434, -0.010041983385277954, 0.1020054440717971, 0.1110976709886779, -0.1395401556077305, -0.035154851003912774, 0.3751410080206602, -0.12104638213789913, 0.00805061321765141, 0.2715681268898554, -0.20263615306426208, -0.14169077551619116, 0.12017116665388024, 0.16436163625452493, 0.18056104926738975, -0.1904753666468571, 0.0006232360527826321, -0.02094261457623784, 0.21720465159769234, 0.028827483884903582, 0.05649377354880968, 0.3423369821745816, 0.1722040733102192, 0.014919301375833362, 0.1233902808839217, -0.33263881622304664, 0.005757453063567884, -0.21662040047285278, -0.14520123220308748, -0.14952687200952083, 0.08044975021648286, -0.11829149581958624, -0.1122348083610928, 0.35333137037124224, 0.12388203338568293, 0.205210889467623, 0.03847289200246789, 0.30079391656232307, 0.07749941049490211, 0.1293888356628676, 0.08026921623934678, 0.31381832888934674, 0.2137625013304831, 0.0900029431971678, -0.24563699322793264, 0.021747308096924232, 0.0005818466211907393] |
1,803.02726 | Stochastic Block Models with Multiple Continuous Attributes | The stochastic block model (SBM) is a probabilistic model for community
structure in networks. Typically, only the adjacency matrix is used to perform
SBM parameter inference. In this paper, we consider circumstances in which
nodes have an associated vector of continuous attributes that are also used to
learn the node-to-community assignments and corresponding SBM parameters. While
this assumption is not realistic for every application, our model assumes that
the attributes associated with the nodes in a network's community can be
described by a common multivariate Gaussian model. In this augmented,
attributed SBM, the objective is to simultaneously learn the SBM connectivity
probabilities with the multivariate Gaussian parameters describing each
community. While there are recent examples in the literature that combine
connectivity and attribute information to inform community detection, our model
is the first augmented stochastic block model to handle multiple continuous
attributes. This provides the flexibility in biological data to, for example,
augment connectivity information with continuous measurements from multiple
experimental modalities. Because the lack of labeled network data often makes
community detection results difficult to validate, we highlight the usefulness
of our model for two network prediction tasks: link prediction and
collaborative filtering. As a result of fitting this attributed stochastic
block model, one can predict the attribute vector or connectivity patterns for
a new node in the event of the complementary source of information
(connectivity or attributes, respectively). We also highlight two biological
examples where the attributed stochastic block model provides satisfactory
performance in the link prediction and collaborative filtering tasks.
| cs.SI physics.soc-ph stat.ML | the stochastic block model sbm is a probabilistic model for community structure in networks typically only the adjacency matrix is used to perform sbm parameter inference in this paper we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the nodetocommunity assignments and corresponding sbm parameters while this assumption is not realistic for every application our model assumes that the attributes associated with the nodes in a networks community can be described by a common multivariate gaussian model in this augmented attributed sbm the objective is to simultaneously learn the sbm connectivity probabilities with the multivariate gaussian parameters describing each community while there are recent examples in the literature that combine connectivity and attribute information to inform community detection our model is the first augmented stochastic block model to handle multiple continuous attributes this provides the flexibility in biological data to for example augment connectivity information with continuous measurements from multiple experimental modalities because the lack of labeled network data often makes community detection results difficult to validate we highlight the usefulness of our model for two network prediction tasks link prediction and collaborative filtering as a result of fitting this attributed stochastic block model one can predict the attribute vector or connectivity patterns for a new node in the event of the complementary source of information connectivity or attributes respectively we also highlight two biological examples where the attributed stochastic block model provides satisfactory performance in the link prediction and collaborative filtering tasks | [['the', 'stochastic', 'block', 'model', 'sbm', 'is', 'a', 'probabilistic', 'model', 'for', 'community', 'structure', 'in', 'networks', 'typically', 'only', 'the', 'adjacency', 'matrix', 'is', 'used', 'to', 'perform', 'sbm', 'parameter', 'inference', 'in', 'this', 'paper', 'we', 'consider', 'circumstances', 'in', 'which', 'nodes', 'have', 'an', 'associated', 'vector', 'of', 'continuous', 'attributes', 'that', 'are', 'also', 'used', 'to', 'learn', 'the', 'nodetocommunity', 'assignments', 'and', 'corresponding', 'sbm', 'parameters', 'while', 'this', 'assumption', 'is', 'not', 'realistic', 'for', 'every', 'application', 'our', 'model', 'assumes', 'that', 'the', 'attributes', 'associated', 'with', 'the', 'nodes', 'in', 'a', 'networks', 'community', 'can', 'be', 'described', 'by', 'a', 'common', 'multivariate', 'gaussian', 'model', 'in', 'this', 'augmented', 'attributed', 'sbm', 'the', 'objective', 'is', 'to', 'simultaneously', 'learn', 'the', 'sbm', 'connectivity', 'probabilities', 'with', 'the', 'multivariate', 'gaussian', 'parameters', 'describing', 'each', 'community', 'while', 'there', 'are', 'recent', 'examples', 'in', 'the', 'literature', 'that', 'combine', 'connectivity', 'and', 'attribute', 'information', 'to', 'inform', 'community', 'detection', 'our', 'model', 'is', 'the', 'first', 'augmented', 'stochastic', 'block', 'model', 'to', 'handle', 'multiple', 'continuous', 'attributes', 'this', 'provides', 'the', 'flexibility', 'in', 'biological', 'data', 'to', 'for', 'example', 'augment', 'connectivity', 'information', 'with', 'continuous', 'measurements', 'from', 'multiple', 'experimental', 'modalities', 'because', 'the', 'lack', 'of', 'labeled', 'network', 'data', 'often', 'makes', 'community', 'detection', 'results', 'difficult', 'to', 'validate', 'we', 'highlight', 'the', 'usefulness', 'of', 'our', 'model', 'for', 'two', 'network', 'prediction', 'tasks', 'link', 'prediction', 'and', 'collaborative', 'filtering', 'as', 'a', 'result', 'of', 'fitting', 'this', 'attributed', 'stochastic', 'block', 'model', 'one', 'can', 'predict', 'the', 'attribute', 'vector', 'or', 'connectivity', 'patterns', 'for', 'a', 'new', 'node', 'in', 'the', 'event', 'of', 'the', 'complementary', 'source', 'of', 'information', 'connectivity', 'or', 'attributes', 'respectively', 'we', 'also', 'highlight', 'two', 'biological', 'examples', 'where', 'the', 'attributed', 'stochastic', 'block', 'model', 'provides', 'satisfactory', 'performance', 'in', 'the', 'link', 'prediction', 'and', 'collaborative', 'filtering', 'tasks']] | [-0.07191512302823158, 0.008180654594886832, -0.04191586435698856, 0.09116304925690762, -0.12135533620180054, -0.18429789925362222, 0.04604165079927978, 0.41862144796067313, -0.31026413120888907, -0.31224833401619445, 0.09223888164686164, -0.2676710883751806, -0.2184835142214882, 0.11983572092117087, -0.09326353901260985, 0.058639080957564794, 0.10403482747547653, 0.10150858552817241, -0.0172113307375321, -0.2083160396768406, 0.28368169873982313, 0.06688368795881335, 0.305761078792245, -0.005339011056679982, 0.09429287385028003, 0.024144896133085014, -0.07226035210189848, 0.008807614794472167, -0.0762268534227145, 0.14626403047202574, 0.32343922283780197, 0.18456719174480485, 0.3028991112914378, -0.42849296501599776, -0.28029050303277053, 0.129883444060023, 0.11857291600315394, 0.10520404507624623, -0.0008082727923724256, -0.30549157803267124, 0.07936276737766215, -0.17700757236098466, -0.06006592944477917, -0.09247002149508758, -0.045513246283892236, 0.01365019440450319, -0.324707793658314, 0.0654033540079477, 0.05556091916192463, 0.028358305919811446, -0.03631129928794598, -0.09835115253691573, -0.002147642867050682, 0.14600740616088329, 0.029820698830611975, 0.0098425226194946, 0.12221724745562565, -0.1448049575187958, -0.17148499810339315, 0.35557121070462605, -0.028358153631660367, -0.23818568445709, 0.19956737659179527, -0.04206818906800166, -0.20011964827783318, 0.0966104952942418, 0.21564477587877054, 0.06098532683506844, -0.20617466856722752, 0.028006145948749596, -0.06266201809122275, 0.17588105024733092, -0.006450453756575881, -0.0018284206211096662, 0.18376072952634262, 0.22204073562135868, 0.056403119883614156, 0.12474906497879741, -0.10294226222816973, -0.11550126243345882, -0.2158038781099058, -0.10253330642401642, -0.21082807875610152, -0.047578833447785386, -0.14566642425842988, -0.15773726363996277, 0.4375426776775273, 0.2386574403828253, 0.24032163081999883, 0.08254202045021733, 0.29584546154549, 0.055380093622602995, 0.07478505583560985, 0.07142888597974723, 0.16846386685515588, 0.11005401539730401, 0.08913338618728484, -0.14213473613285588, 0.1628794114334553, 0.01348770583111042] |
1,803.02727 | On the calculation of potential of mean force between atomistic
nanoparticles | We study the potential of mean force (PMF) between atomistic silica and gold
nanoparticles in the vacuum by using molecular dynamics simulations. Such an
investigation is devised in order to fully characterize the effective
interactions between atomistic nanoparticles, a crucial step to describe the
PMF in high-density coarse-grained polymer nanocomposites. In our study, we
first investigate the behavior of silica nanoparticles, considering cases
corresponding to different particle sizes and assessing results against an
analytic theory developed by Hamaker for a system of Lennard-Jones interacting
particles [H. C. Hamaker, Physica A, 1937, 4, 1058]. Once validated the
procedure, we calculate effective interactions between gold nanoparticles,
which are considered both bare and coated with polyethylene chains, in order to
investigate the effects of the grafting density \rho_g on the PMF. Upon
performing atomistic molecular dynamics simulations, it turns out that silica
nanoparticles experience similar interactions regardless of the particle size,
the most remarkable difference being a peak in the PMF due to surface
interactions, clearly apparent for the larger size. As for bare gold
nanoparticles, they are slightly interacting, the strength of the effective
force increasing for the coated cases. The profile of the resulting PMF
resembles a Lennard-Jones potentials for intermediate \rho_g , becoming
progressively more repulsive for high \rho_g and low interparticle separations.
| cond-mat.soft physics.chem-ph | we study the potential of mean force pmf between atomistic silica and gold nanoparticles in the vacuum by using molecular dynamics simulations such an investigation is devised in order to fully characterize the effective interactions between atomistic nanoparticles a crucial step to describe the pmf in highdensity coarsegrained polymer nanocomposites in our study we first investigate the behavior of silica nanoparticles considering cases corresponding to different particle sizes and assessing results against an analytic theory developed by hamaker for a system of lennardjones interacting particles h c hamaker physica a 1937 4 1058 once validated the procedure we calculate effective interactions between gold nanoparticles which are considered both bare and coated with polyethylene chains in order to investigate the effects of the grafting density rho_g on the pmf upon performing atomistic molecular dynamics simulations it turns out that silica nanoparticles experience similar interactions regardless of the particle size the most remarkable difference being a peak in the pmf due to surface interactions clearly apparent for the larger size as for bare gold nanoparticles they are slightly interacting the strength of the effective force increasing for the coated cases the profile of the resulting pmf resembles a lennardjones potentials for intermediate rho_g becoming progressively more repulsive for high rho_g and low interparticle separations | [['we', 'study', 'the', 'potential', 'of', 'mean', 'force', 'pmf', 'between', 'atomistic', 'silica', 'and', 'gold', 'nanoparticles', 'in', 'the', 'vacuum', 'by', 'using', 'molecular', 'dynamics', 'simulations', 'such', 'an', 'investigation', 'is', 'devised', 'in', 'order', 'to', 'fully', 'characterize', 'the', 'effective', 'interactions', 'between', 'atomistic', 'nanoparticles', 'a', 'crucial', 'step', 'to', 'describe', 'the', 'pmf', 'in', 'highdensity', 'coarsegrained', 'polymer', 'nanocomposites', 'in', 'our', 'study', 'we', 'first', 'investigate', 'the', 'behavior', 'of', 'silica', 'nanoparticles', 'considering', 'cases', 'corresponding', 'to', 'different', 'particle', 'sizes', 'and', 'assessing', 'results', 'against', 'an', 'analytic', 'theory', 'developed', 'by', 'hamaker', 'for', 'a', 'system', 'of', 'lennardjones', 'interacting', 'particles', 'h', 'c', 'hamaker', 'physica', 'a', '1937', '4', '1058', 'once', 'validated', 'the', 'procedure', 'we', 'calculate', 'effective', 'interactions', 'between', 'gold', 'nanoparticles', 'which', 'are', 'considered', 'both', 'bare', 'and', 'coated', 'with', 'polyethylene', 'chains', 'in', 'order', 'to', 'investigate', 'the', 'effects', 'of', 'the', 'grafting', 'density', 'rho_g', 'on', 'the', 'pmf', 'upon', 'performing', 'atomistic', 'molecular', 'dynamics', 'simulations', 'it', 'turns', 'out', 'that', 'silica', 'nanoparticles', 'experience', 'similar', 'interactions', 'regardless', 'of', 'the', 'particle', 'size', 'the', 'most', 'remarkable', 'difference', 'being', 'a', 'peak', 'in', 'the', 'pmf', 'due', 'to', 'surface', 'interactions', 'clearly', 'apparent', 'for', 'the', 'larger', 'size', 'as', 'for', 'bare', 'gold', 'nanoparticles', 'they', 'are', 'slightly', 'interacting', 'the', 'strength', 'of', 'the', 'effective', 'force', 'increasing', 'for', 'the', 'coated', 'cases', 'the', 'profile', 'of', 'the', 'resulting', 'pmf', 'resembles', 'a', 'lennardjones', 'potentials', 'for', 'intermediate', 'rho_g', 'becoming', 'progressively', 'more', 'repulsive', 'for', 'high', 'rho_g', 'and', 'low', 'interparticle', 'separations']] | [-0.08885014631493315, 0.1769342442664465, -0.09068844032903281, 0.049537582540959295, 0.04103938048707655, -0.14415096415356152, 0.00443811890315528, 0.40416567167267203, -0.1986321110842186, -0.32414017247809274, -0.013480111687523225, -0.3077083908895663, -0.13043523736996576, 0.12659810165619864, 0.07205275650672123, 0.027152285208257864, 0.025583552277892968, -0.03843032993609086, -0.04617308862485378, -0.18863915219213287, 0.23786495216116682, 0.11079983655495113, 0.26945560135964286, 0.11096095369924475, 0.06248189777548794, 0.03368427317132646, 0.03860762694225656, 0.03957667988890775, -0.20123302319460085, 0.10487551984535355, 0.19048005461095358, -0.06209714276461317, 0.24888014255689, -0.47160762212819085, -0.21255237767255958, 0.06362221772641928, 0.16091303932831957, 0.12998696498052253, -0.06192139948133153, -0.2603358610265203, 0.06566200487948251, -0.15287938211574484, -0.15191751029693856, -0.04458289613007164, 0.05168344080722715, 0.05783823802562009, -0.23993528415426998, 0.0896823876264191, 0.022272465325549315, 0.08216902930003274, -0.07474398018598978, -0.13936144266582867, -0.026296153963315038, 0.09844779230342335, 0.04787418241327066, -0.006681842841471563, 0.24817060639660032, -0.14435912457729672, -0.004823161988136938, 0.40020627401909736, -0.08930838374060772, -0.17710878763497226, 0.25833381301139147, -0.11035977768105508, -0.05271191428028891, 0.1549933018241921, 0.14999792200649367, 0.11726391651527078, -0.16652880664168032, 0.061581929948072184, 0.03977961206747184, 0.2228193831842015, 0.10434322490632525, -0.04437182846650446, 0.21234500963149708, 0.20634033360171466, -0.0040715667539943925, 0.16591585419285726, -0.09207508743648364, -0.11387960570161494, -0.20949290801533763, -0.17483845511495294, -0.22956199963266286, 0.021085473662733077, -0.1456218906280141, -0.1752451861887854, 0.32435296111705025, 0.10928746678576506, 0.14969197589078181, 0.06128821999574836, 0.24618970806148113, 0.04089499614201486, 0.06471518642666645, -0.020644172652677265, 0.2827691698297507, 0.17417946835883172, 0.058613347375044984, -0.25874130890533364, 0.05180926571373898, 0.028438782765319186] |
1,803.02728 | Towards the Creation of a Large Corpus of Synthetically-Identified
Clinical Notes | Clinical notes often describe the most important aspects of a patient's
physiology and are therefore critical to medical research. However, these notes
are typically inaccessible to researchers without prior removal of sensitive
protected health information (PHI), a natural language processing (NLP) task
referred to as deidentification. Tools to automatically de-identify clinical
notes are needed but are difficult to create without access to those very same
notes containing PHI. This work presents a first step toward creating a large
synthetically-identified corpus of clinical notes and corresponding PHI
annotations in order to facilitate the development de-identification tools.
Further, one such tool is evaluated against this corpus in order to understand
the advantages and shortcomings of this approach.
| cs.CL cs.CY | clinical notes often describe the most important aspects of a patients physiology and are therefore critical to medical research however these notes are typically inaccessible to researchers without prior removal of sensitive protected health information phi a natural language processing nlp task referred to as deidentification tools to automatically deidentify clinical notes are needed but are difficult to create without access to those very same notes containing phi this work presents a first step toward creating a large syntheticallyidentified corpus of clinical notes and corresponding phi annotations in order to facilitate the development deidentification tools further one such tool is evaluated against this corpus in order to understand the advantages and shortcomings of this approach | [['clinical', 'notes', 'often', 'describe', 'the', 'most', 'important', 'aspects', 'of', 'a', 'patients', 'physiology', 'and', 'are', 'therefore', 'critical', 'to', 'medical', 'research', 'however', 'these', 'notes', 'are', 'typically', 'inaccessible', 'to', 'researchers', 'without', 'prior', 'removal', 'of', 'sensitive', 'protected', 'health', 'information', 'phi', 'a', 'natural', 'language', 'processing', 'nlp', 'task', 'referred', 'to', 'as', 'deidentification', 'tools', 'to', 'automatically', 'deidentify', 'clinical', 'notes', 'are', 'needed', 'but', 'are', 'difficult', 'to', 'create', 'without', 'access', 'to', 'those', 'very', 'same', 'notes', 'containing', 'phi', 'this', 'work', 'presents', 'a', 'first', 'step', 'toward', 'creating', 'a', 'large', 'syntheticallyidentified', 'corpus', 'of', 'clinical', 'notes', 'and', 'corresponding', 'phi', 'annotations', 'in', 'order', 'to', 'facilitate', 'the', 'development', 'deidentification', 'tools', 'further', 'one', 'such', 'tool', 'is', 'evaluated', 'against', 'this', 'corpus', 'in', 'order', 'to', 'understand', 'the', 'advantages', 'and', 'shortcomings', 'of', 'this', 'approach']] | [-0.0319773604492902, 0.051853844065733845, -0.07294763772536003, 0.1235256444911979, -0.1899426409202677, -0.1663873631654209, 0.009725932397454846, 0.3746485701402682, -0.22196077107831738, -0.34909746563879024, 0.14217832505809175, -0.3148783319915661, -0.1402690886344205, 0.21439253261084096, -0.16369482631010837, 0.08335265001841706, 0.11628203189588691, 0.05452815904930487, -0.012088454340731627, -0.280961212207841, 0.2631508103784239, 0.057381604022035994, 0.3261784861526011, 0.05716433065326623, 0.034054057691001186, -0.05554068456567301, -0.08836178911702805, -0.050482405700900575, -0.10526313558384254, 0.19568121036220537, 0.47063424435787293, 0.2005813841650818, 0.39682133590982277, -0.4553943322113666, -0.1459998412694978, 0.0732355052074254, 0.12705842740506978, 0.13639213471150582, -0.026358307498556218, -0.3280506858749217, 0.12064768123571157, -0.12579033531763248, -0.05980963651050013, -0.14841963070559136, 0.0003638965763935917, -0.04927260157541911, -0.23795704335166273, 0.01183010047105582, 0.039972369044430946, 0.1631015933939795, 0.0013841829863131831, -0.1252140859672963, 0.027514081409511466, 0.2101813838041077, 0.08882839075624616, 0.1115865297074299, 0.17255201039574386, -0.17285370628815144, -0.11914792147938881, 0.402121316837637, 0.03427567689173054, -0.1901428443696268, 0.22280776912444517, -0.04662334508254405, -0.20521727576034896, 0.08732903810634621, 0.22484932665860183, 0.08689812887786773, -0.23541237699917697, -0.028703187830774766, 0.08679311851378052, 0.19698212875396406, 0.06513138425642657, 0.028556576979003455, 0.20344307019146518, 0.16982008270682408, -0.037685227742226664, 0.1292405295192893, -0.02032049786168755, -0.06446755109222099, -0.282144200792046, -0.15555952756518596, -0.1441623260769503, 0.022469743581799168, 0.026650481271580997, -0.19897184761959993, 0.3672942086061659, 0.2643633350084552, 0.12770715986149744, -0.01573493451762356, 0.3244624599209872, -0.008956134671614947, 0.11337586991456255, 0.01671195866309286, 0.07779776802278336, 0.03500635884783901, 0.16420614709179, -0.09777634324130129, 0.10868871533066819, 4.002472626764262e-05] |
1,803.02729 | Frequency and Quadrature Amplitude Modulation for 5G Networks | The emerging fifth generation (5G) wireless access network, aiming at
providing ubiquitous and high data rate connectivity, is envisaged to deploy
large number of base stations with higher density and smaller sizes, where
inter-cell interference (ICI) becomes a critical problem. Frequency quadrature
amplitude modulation (FQAM) has been shown to reduce the ICI at the cell edge
therefore achieve a higher transmission rate for cell edge users. This paper
investigates the detection of FQAM symbols and noise plus ICI in a multi-cell
FQAM communication network. Turbo-coded bit error rate (BER) and frame error
rate (FER) of multi-cell FQAM are studied. Also, the cumulative distribution
function (CDF) of signal to noise plus interference (SINR) of multi-cell FQAM
is computed using stochastic geometry. It is demonstrated via simulations FQAM
outperforms quadrature amplitude modulation (QAM) in BER and FER when ICI is
significant. Furthermore, FQAM can achieve better SINR than QAM.
| cs.IT math.IT | the emerging fifth generation 5g wireless access network aiming at providing ubiquitous and high data rate connectivity is envisaged to deploy large number of base stations with higher density and smaller sizes where intercell interference ici becomes a critical problem frequency quadrature amplitude modulation fqam has been shown to reduce the ici at the cell edge therefore achieve a higher transmission rate for cell edge users this paper investigates the detection of fqam symbols and noise plus ici in a multicell fqam communication network turbocoded bit error rate ber and frame error rate fer of multicell fqam are studied also the cumulative distribution function cdf of signal to noise plus interference sinr of multicell fqam is computed using stochastic geometry it is demonstrated via simulations fqam outperforms quadrature amplitude modulation qam in ber and fer when ici is significant furthermore fqam can achieve better sinr than qam | [['the', 'emerging', 'fifth', 'generation', '5g', 'wireless', 'access', 'network', 'aiming', 'at', 'providing', 'ubiquitous', 'and', 'high', 'data', 'rate', 'connectivity', 'is', 'envisaged', 'to', 'deploy', 'large', 'number', 'of', 'base', 'stations', 'with', 'higher', 'density', 'and', 'smaller', 'sizes', 'where', 'intercell', 'interference', 'ici', 'becomes', 'a', 'critical', 'problem', 'frequency', 'quadrature', 'amplitude', 'modulation', 'fqam', 'has', 'been', 'shown', 'to', 'reduce', 'the', 'ici', 'at', 'the', 'cell', 'edge', 'therefore', 'achieve', 'a', 'higher', 'transmission', 'rate', 'for', 'cell', 'edge', 'users', 'this', 'paper', 'investigates', 'the', 'detection', 'of', 'fqam', 'symbols', 'and', 'noise', 'plus', 'ici', 'in', 'a', 'multicell', 'fqam', 'communication', 'network', 'turbocoded', 'bit', 'error', 'rate', 'ber', 'and', 'frame', 'error', 'rate', 'fer', 'of', 'multicell', 'fqam', 'are', 'studied', 'also', 'the', 'cumulative', 'distribution', 'function', 'cdf', 'of', 'signal', 'to', 'noise', 'plus', 'interference', 'sinr', 'of', 'multicell', 'fqam', 'is', 'computed', 'using', 'stochastic', 'geometry', 'it', 'is', 'demonstrated', 'via', 'simulations', 'fqam', 'outperforms', 'quadrature', 'amplitude', 'modulation', 'qam', 'in', 'ber', 'and', 'fer', 'when', 'ici', 'is', 'significant', 'furthermore', 'fqam', 'can', 'achieve', 'better', 'sinr', 'than', 'qam']] | [-0.3143224281371337, 0.0016796310831393515, 0.029716727126240856, 0.058226521544278834, -0.019255105194597676, -0.22499909342526375, 0.12504302424008065, 0.35132777604724275, -0.20016862841981914, -0.2651059100036921, 0.059426998756002304, -0.24570910769140944, -0.2480163917889451, 0.13440052546294673, -0.17469241776104485, 0.07650387469919867, 0.02190840855671638, 0.03950897791758687, -0.021747193736385326, -0.26434433140925, 0.21156675720486004, 0.21006924893428275, 0.4343265721219636, -0.00011188650605123059, 0.07232518985211774, -0.0052520770842500895, -0.048277000798431995, -0.0908078142698398, -0.059441351022913445, 0.034876535984776205, 0.34827774774986414, 0.18202703690542807, 0.260127329742726, -0.4017552047790516, -0.2815400892543942, 0.09026119752223191, 0.23461247148878436, 0.06086182253764701, -0.031715370717832224, -0.2602722055791896, 0.16197528242494683, -0.27348167688718866, 0.012632371297068134, 0.028777408375575835, -0.059662730033908574, 0.06391186262623463, -0.4160789187592106, 0.09742092081249792, -0.047962515079574726, 0.05914054548076424, 0.01669310083688826, -0.18371019478203082, 0.030704299052131876, 0.14253794075940976, 0.012400114443153143, 0.055911378358446416, 0.09999122585250748, -0.08444745267019133, -0.10177285161794347, 0.3360586838011129, -0.023862625537681724, -0.247371274192317, 0.08046166102408248, -0.1361736174432092, -0.02248979265782602, 0.2441417067343382, 0.2661841802337036, -0.03316000129213417, -0.16897359696427933, 0.0172673778170498, 0.102060809268198, 0.22113489546465806, 0.20377769937016527, 0.15578195329384917, 0.11872493992654645, 0.21929079040625216, 0.15229957369567992, 0.11680477524974517, -0.2369877972709788, -0.10647629128870409, -0.1506035752645155, -0.07074196554314928, -0.22366736086757005, -0.015299216757027978, -0.10200431522844775, -0.0835783830628062, 0.32142387502185277, 0.10689363392152297, 0.07014014070289729, 0.14703072043813664, 0.4561433698475158, 0.18219929977896668, 0.06169567764958456, 0.10218278122875764, 0.1764532844314263, 0.10822945755437574, 0.1362913295081785, -0.24875472488553346, 0.03497113265274536, -0.0017369137364154567] |
1,803.0273 | Single cell and multi-cell performance analysis of OFDM index modulation | This paper addresses the achievable rate of single cell and sum rate of
multi-cell orthogonal frequency division multiplexing (OFDM) index modulation
(IM). The single cell achievable rate of OFDM-IM with Gaussian input is
calculated using a multi-ary symmetric channel. Then, the cumulative
distribution function (CDF) of multi-cell OFDM-IM is investigated by stochastic
geometry. Furthermore, it is proved in this paper that the probability density
function (PDF) of noise plus intercell-interference (ICI) in multi-cell OFDM-IM
with quadrature amplitude modulation (QAM) follows a mixture of Gaussians (MoG)
distribution. Next, parameters of the MoG distribution are estimated using a
simplified expectation maximization (EM) algorithm. Upper bound of sum rates of
multi-cell OFDM-IM is derived. Furthermore, analytic and simulated results are
compared and discussed.
| cs.IT math.IT | this paper addresses the achievable rate of single cell and sum rate of multicell orthogonal frequency division multiplexing ofdm index modulation im the single cell achievable rate of ofdmim with gaussian input is calculated using a multiary symmetric channel then the cumulative distribution function cdf of multicell ofdmim is investigated by stochastic geometry furthermore it is proved in this paper that the probability density function pdf of noise plus intercellinterference ici in multicell ofdmim with quadrature amplitude modulation qam follows a mixture of gaussians mog distribution next parameters of the mog distribution are estimated using a simplified expectation maximization em algorithm upper bound of sum rates of multicell ofdmim is derived furthermore analytic and simulated results are compared and discussed | [['this', 'paper', 'addresses', 'the', 'achievable', 'rate', 'of', 'single', 'cell', 'and', 'sum', 'rate', 'of', 'multicell', 'orthogonal', 'frequency', 'division', 'multiplexing', 'ofdm', 'index', 'modulation', 'im', 'the', 'single', 'cell', 'achievable', 'rate', 'of', 'ofdmim', 'with', 'gaussian', 'input', 'is', 'calculated', 'using', 'a', 'multiary', 'symmetric', 'channel', 'then', 'the', 'cumulative', 'distribution', 'function', 'cdf', 'of', 'multicell', 'ofdmim', 'is', 'investigated', 'by', 'stochastic', 'geometry', 'furthermore', 'it', 'is', 'proved', 'in', 'this', 'paper', 'that', 'the', 'probability', 'density', 'function', 'pdf', 'of', 'noise', 'plus', 'intercellinterference', 'ici', 'in', 'multicell', 'ofdmim', 'with', 'quadrature', 'amplitude', 'modulation', 'qam', 'follows', 'a', 'mixture', 'of', 'gaussians', 'mog', 'distribution', 'next', 'parameters', 'of', 'the', 'mog', 'distribution', 'are', 'estimated', 'using', 'a', 'simplified', 'expectation', 'maximization', 'em', 'algorithm', 'upper', 'bound', 'of', 'sum', 'rates', 'of', 'multicell', 'ofdmim', 'is', 'derived', 'furthermore', 'analytic', 'and', 'simulated', 'results', 'are', 'compared', 'and', 'discussed']] | [-0.21857968804736932, 0.06385124349617399, -0.05172764789313078, 0.0386090681674735, -0.004997277752651522, -0.17188364401226863, 0.11187226817128249, 0.36860751276059694, -0.23492507458140607, -0.21360264127142728, 0.058808078238507734, -0.20741805365153898, -0.21829527096512416, 0.147107369301375, -0.0924959790194407, 0.0914722102189747, 0.013409203230791415, 0.02686268569668755, -0.04932182215270586, -0.2461060014863809, 0.26334107836592013, 0.13596229437583437, 0.3806617305924495, -0.06063285011720533, 0.08784960550256074, 0.04430175510351546, -0.07838139307762806, -0.07177453270026793, -0.14643348931792086, 0.060199068191771704, 0.25567050065728836, 0.22276716884225606, 0.21663706333686908, -0.3162310117079566, -0.2584344760204355, 0.09635804247421523, 0.2171300857771712, 0.028441621165256947, -0.06266074761515483, -0.22636701715916085, 0.10432425619025404, -0.27282028313881407, -0.07644643106420214, 0.05484233658450345, -0.05268495617589603, 0.10891015384113416, -0.4400069172726944, 0.15624641457300945, -0.007727850197503964, 0.023093948140497863, -0.05504429154292059, -0.22319601404014974, 0.03927617454125235, 0.038834856935621546, 0.019126551340256506, 0.025446388861261462, 0.1080994804816631, -0.06448149277130141, -0.1077428358325657, 0.30931294487478833, -0.11154311912056679, -0.2769580202875659, 0.03515089058249335, -0.15613557379159224, -0.018095197097864002, 0.15896163523818055, 0.2005727416020818, 0.05877089082884292, -0.19697752147815967, 0.06683051710764024, -0.045560603325914904, 0.19895259637608737, 0.16252295589074492, 0.08402751816514259, 0.12775773756438866, 0.15164611445895085, 0.059231083902219935, 0.1521318926747578, -0.1753552872998019, -0.1523003955488093, -0.23868872493815918, -0.07878182119699582, -0.2617769661223671, 0.015221794882866865, -0.12244062983627373, -0.10170715333661065, 0.33947593689275285, 0.0547629454638809, 0.12126733699114993, 0.147191613628335, 0.3928198718621085, 0.22075875595910474, -0.0235531966551207, 0.07045530003573125, 0.1854225460633946, 0.18395055799240556, 0.047576701555711524, -0.21161757098743691, 0.030358178839863588, 0.01513507510535419] |
1,803.02731 | Some binary BCH codes with length $n=2^m+1$ | Under research for near sixty years,
Bose-$\!$Ray-$\!$Chaudhuri-$\!$Hocquenghem(BCH) codes have played increasingly
important roles in many applications such as communication systems, data
storage and information security. However, the dimension and minimum distance
of BCH codes are seldom solved until now because of their intractable
characteristics. The objective of this paper is to study the dimensions of some
BCH codes of length $n=2^m+1$ with $m=2t+1$, $4t+2$, $8t+4$ and $m\geq 10$.
Some new techniques are employed to investigate coset leaders modulo $n$. For
each type of $m$ above, the first five largest coset leaders modulo $n$ are
determined, the dimension of some BCH codes of length $n$ with designed
distance $\delta>2^{\lceil \frac{m}{2} \rceil}$ is presented. These new
techniques and results may be helpful to study other families of cyclic codes
over finite fields.
| cs.IT math.IT | under research for near sixty years boseraychaudhurihocquenghembch codes have played increasingly important roles in many applications such as communication systems data storage and information security however the dimension and minimum distance of bch codes are seldom solved until now because of their intractable characteristics the objective of this paper is to study the dimensions of some bch codes of length n2m1 with m2t1 4t2 8t4 and mgeq 10 some new techniques are employed to investigate coset leaders modulo n for each type of m above the first five largest coset leaders modulo n are determined the dimension of some bch codes of length n with designed distance delta2lceil fracm2 rceil is presented these new techniques and results may be helpful to study other families of cyclic codes over finite fields | [['under', 'research', 'for', 'near', 'sixty', 'years', 'boseraychaudhurihocquenghembch', 'codes', 'have', 'played', 'increasingly', 'important', 'roles', 'in', 'many', 'applications', 'such', 'as', 'communication', 'systems', 'data', 'storage', 'and', 'information', 'security', 'however', 'the', 'dimension', 'and', 'minimum', 'distance', 'of', 'bch', 'codes', 'are', 'seldom', 'solved', 'until', 'now', 'because', 'of', 'their', 'intractable', 'characteristics', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'dimensions', 'of', 'some', 'bch', 'codes', 'of', 'length', 'n2m1', 'with', 'm2t1', '4t2', '8t4', 'and', 'mgeq', '10', 'some', 'new', 'techniques', 'are', 'employed', 'to', 'investigate', 'coset', 'leaders', 'modulo', 'n', 'for', 'each', 'type', 'of', 'm', 'above', 'the', 'first', 'five', 'largest', 'coset', 'leaders', 'modulo', 'n', 'are', 'determined', 'the', 'dimension', 'of', 'some', 'bch', 'codes', 'of', 'length', 'n', 'with', 'designed', 'distance', 'delta2lceil', 'fracm2', 'rceil', 'is', 'presented', 'these', 'new', 'techniques', 'and', 'results', 'may', 'be', 'helpful', 'to', 'study', 'other', 'families', 'of', 'cyclic', 'codes', 'over', 'finite', 'fields']] | [-0.19850922632215928, 0.12984175537712872, -0.0075725893977852095, 0.08026169263850158, -0.015386631550629519, -0.24158294167783526, -0.01661536574182618, 0.3515948616614979, -0.2959285200470024, -0.29887091779401376, 0.163040374245842, -0.28112978111982106, -0.13816658162607973, 0.24514344459333057, -0.08686050251200204, 0.09943014042166021, 0.038800335549730953, 0.08300332751842068, -0.0906338139357681, -0.37995384144227184, 0.3038719243569566, 0.10186694770874012, 0.21795146581199434, 0.012378802188091896, 0.03640977666151547, -0.017433147489403684, -0.047088348003666076, -0.010654321158423073, -0.19108435143725871, 0.12374461715161386, 0.33057147124782205, 0.16810395399714628, 0.2572508624584843, -0.3818800473097889, -0.19459624810602574, 0.13435170203003854, 0.190295257099298, 0.09438364047350155, -0.0024465244366890853, -0.1938157695168186, 0.14732803197001063, -0.14456129099966752, -0.10091485730039754, -0.02517903449904499, 0.07542989428879486, 0.029142022117166707, -0.22727739572938946, -0.048904694809203245, 0.0600470713097676, 0.12804681826235045, 0.007777325803458336, -0.22166979320288177, 0.03952278599645647, 0.15995826684160247, 0.04970772319384629, 0.012712132776089544, 0.04063868253964872, -0.07798117797799586, -0.1486569964622576, 0.36512253771994324, 0.03215944679224834, -0.15778039825691229, 0.14602204975450322, -0.07846232466695327, -0.15650510198126236, 0.13012335195191324, 0.2067696776375958, 0.13664603277686097, -0.12126234680088976, 0.11891150001310817, -0.04523008328581613, 0.17241865251627234, 0.13753513814068385, 0.13520465227119285, 0.15222655654337908, 0.09873568156497582, 0.03653156813714535, 0.1163049430031115, -0.0408317375251846, -0.0807960024066565, -0.2652235748689799, -0.1434648876588437, -0.17855037957991635, 0.03958422545757559, -0.12313570400712909, -0.12655777602072155, 0.3408817479882153, 0.12308956092151459, 0.11289753750454457, 0.07650465954516437, 0.21981247009650345, -0.007558931976774826, 0.13014927989939998, 0.15984998886207386, 0.14749048621230204, 0.17454358757407004, 0.00902925453071172, -0.1591962325841277, 0.045333299306794146, 0.10836993870399302] |
1,803.02732 | Massive MIMO performance with imperfect channel reciprocity and channel
estimation error | Channel reciprocity in time-division duplexing (TDD) massive multiple-input
multiple-output (MIMO) systems can be exploited to reduce the overhead required
for the acquisition of channel state information (CSI). However, perfect
reciprocity is unrealistic in practical systems due to random radio-frequency
(RF) circuit mismatches in uplink and downlink channels. This can result in a
significant degradation in the performance of linear precoding schemes, which
are sensitive to the accuracy of the CSI. In this paper, we model and analyse
the impact of RF mismatches on the performance of linear precoding in a TDD
multi-user massive MIMO system, by taking the channel estimation error into
considerations. We use the truncated Gaussian distribution to model the RF
mismatch, and derive closed-form expressions of the output
signal-to-interference-plus-noise ratio for maximum ratio transmission and zero
forcing precoders. We further investigate the asymptotic performance of the
derived expressions, to provide valuable insights into the practical system
designs, including useful guidelines for the selection of the effective
precoding schemes. Simulation results are presented to demonstrate the validity
and accuracy of the proposed analytical results.
| cs.IT math.IT | channel reciprocity in timedivision duplexing tdd massive multipleinput multipleoutput mimo systems can be exploited to reduce the overhead required for the acquisition of channel state information csi however perfect reciprocity is unrealistic in practical systems due to random radiofrequency rf circuit mismatches in uplink and downlink channels this can result in a significant degradation in the performance of linear precoding schemes which are sensitive to the accuracy of the csi in this paper we model and analyse the impact of rf mismatches on the performance of linear precoding in a tdd multiuser massive mimo system by taking the channel estimation error into considerations we use the truncated gaussian distribution to model the rf mismatch and derive closedform expressions of the output signaltointerferenceplusnoise ratio for maximum ratio transmission and zero forcing precoders we further investigate the asymptotic performance of the derived expressions to provide valuable insights into the practical system designs including useful guidelines for the selection of the effective precoding schemes simulation results are presented to demonstrate the validity and accuracy of the proposed analytical results | [['channel', 'reciprocity', 'in', 'timedivision', 'duplexing', 'tdd', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'systems', 'can', 'be', 'exploited', 'to', 'reduce', 'the', 'overhead', 'required', 'for', 'the', 'acquisition', 'of', 'channel', 'state', 'information', 'csi', 'however', 'perfect', 'reciprocity', 'is', 'unrealistic', 'in', 'practical', 'systems', 'due', 'to', 'random', 'radiofrequency', 'rf', 'circuit', 'mismatches', 'in', 'uplink', 'and', 'downlink', 'channels', 'this', 'can', 'result', 'in', 'a', 'significant', 'degradation', 'in', 'the', 'performance', 'of', 'linear', 'precoding', 'schemes', 'which', 'are', 'sensitive', 'to', 'the', 'accuracy', 'of', 'the', 'csi', 'in', 'this', 'paper', 'we', 'model', 'and', 'analyse', 'the', 'impact', 'of', 'rf', 'mismatches', 'on', 'the', 'performance', 'of', 'linear', 'precoding', 'in', 'a', 'tdd', 'multiuser', 'massive', 'mimo', 'system', 'by', 'taking', 'the', 'channel', 'estimation', 'error', 'into', 'considerations', 'we', 'use', 'the', 'truncated', 'gaussian', 'distribution', 'to', 'model', 'the', 'rf', 'mismatch', 'and', 'derive', 'closedform', 'expressions', 'of', 'the', 'output', 'signaltointerferenceplusnoise', 'ratio', 'for', 'maximum', 'ratio', 'transmission', 'and', 'zero', 'forcing', 'precoders', 'we', 'further', 'investigate', 'the', 'asymptotic', 'performance', 'of', 'the', 'derived', 'expressions', 'to', 'provide', 'valuable', 'insights', 'into', 'the', 'practical', 'system', 'designs', 'including', 'useful', 'guidelines', 'for', 'the', 'selection', 'of', 'the', 'effective', 'precoding', 'schemes', 'simulation', 'results', 'are', 'presented', 'to', 'demonstrate', 'the', 'validity', 'and', 'accuracy', 'of', 'the', 'proposed', 'analytical', 'results']] | [-0.25974317531968566, -0.014689523316602308, -0.019913866274609147, 0.022409013473820363, -0.0724819379154889, -0.23212967788144437, 0.11369517769873544, 0.36771565675735474, -0.21405640660271852, -0.25925647016232356, 0.10930054450363968, -0.1937945200162093, -0.19010120139071, 0.1557131693791069, -0.12000167148653418, 0.11171754779802127, 0.06396027250924487, -0.005754399482281191, -0.08316570440034741, -0.2746215812732606, 0.2547865069725297, 0.14571454072244128, 0.42031223519535904, 0.0039055807600644503, 0.08438060616423503, 0.026551830741068858, -0.018910423865732315, -0.07524905595478644, -0.12324833171971311, 0.057006740066836675, 0.3419319471894679, 0.2066458664220673, 0.25699347761374985, -0.41689998176562687, -0.2591615115631033, 0.06708833355911668, 0.20845270182987655, 0.10526848726956152, -0.04693954408007399, -0.25605508930113335, 0.14414636311862108, -0.25553190824327676, -0.01113227858811363, 0.003435016616508206, -0.12761011404853145, 0.0469828232433594, -0.40697487132009963, 0.06411289779614228, 0.028476125621223633, 0.03811772474595769, -0.050110327239963226, -0.1901990908862155, 0.06561809210688807, 0.15384929190093483, 0.012798599579995922, -0.08881787806868405, 0.06236226582826599, -0.11370467220761137, -0.07863923476675568, 0.3665033574480648, -0.02193382982394806, -0.2974107679064301, 0.14780055632681152, -0.12260194639251991, -0.054683119071838024, 0.16540485086046497, 0.3172189345297573, 0.014788017796077342, -0.20248386638096152, 0.020361759386022724, 0.041816389241086487, 0.1767904188812033, 0.0713803677406924, 0.16989261670228603, 0.1476674396597611, 0.19600970413408836, 0.07181475416820665, 0.16906887803700307, -0.11843262031850993, -0.09648732282684333, -0.211155374928322, -0.133301983962321, -0.1928730501981177, 0.011728347550326196, -0.12540992304366227, -0.05969561924575828, 0.3454136132125065, 0.18440596919390373, 0.07317834436650049, 0.11424346411645687, 0.44832732183435425, 0.15562254611656748, 0.044350555441765624, 0.09011027035938407, 0.24021862654163587, 0.18604873443440406, 0.11851708923561753, -0.2851403769454919, 0.03787125283336288, -0.046141779402122746] |
1,803.02733 | Optical Distortion in the NACO Imager | In this research note, we present a set of distortion solutions that may be
used to correct geometric optical distortion in images taken with the S13
camera of the NACO adaptive optics imager.
| astro-ph.IM | in this research note we present a set of distortion solutions that may be used to correct geometric optical distortion in images taken with the s13 camera of the naco adaptive optics imager | [['in', 'this', 'research', 'note', 'we', 'present', 'a', 'set', 'of', 'distortion', 'solutions', 'that', 'may', 'be', 'used', 'to', 'correct', 'geometric', 'optical', 'distortion', 'in', 'images', 'taken', 'with', 'the', 's13', 'camera', 'of', 'the', 'naco', 'adaptive', 'optics', 'imager']] | [-0.12182291808792135, 0.034454375956997726, -0.17851144843029254, 0.036162233922037886, -0.12608939273790878, -0.15197496030084562, -0.043686879269609395, 0.4408093758604743, -0.27241776353030495, -0.33130348620541167, 0.16093768009379733, -0.2607405417119012, -0.1822257466388471, 0.19231217569022468, -0.1993671226964304, 0.0728332418948412, 0.1280824408838243, -0.059735668315128845, -0.0244340061449982, -0.27865591617018887, 0.22741575159527588, 0.13888328214825102, 0.21525576078530514, -0.04182657517252885, 0.13838839691809632, 0.03529114411635832, -0.027308774604038757, 0.0749935434115204, -0.18535993127685893, 0.10713135326902072, 0.3132839853113348, 0.10282800267591621, 0.24507556500082667, -0.3888035521024104, -0.17703299156644128, 0.054629751509337715, 0.12500855357696614, 0.0668165355807904, -0.08922498037502395, -0.307391987436197, 0.017365265186085846, -0.06517575890051597, -0.10834011154700861, -0.017605792364162026, -0.04584205157306948, -0.0052763921998892765, -0.3218707051692587, -0.02040368194381396, 0.0034123552314034014, 0.12288256253426273, -0.1529433305347056, -0.06095884618998477, 0.04859721720585543, 0.133259267955454, -0.04223517921160568, 0.12978326444598762, 0.03932424296032299, -0.1268018341806689, -0.03854352156772758, 0.39011714474834275, -0.054177196597624, -0.13393266758683955, 0.1308035547986175, -0.18196049897056638, -0.15997112432325428, 0.17019300603053786, 0.22191012757971432, 0.07870633866299283, -0.1653282783191764, 0.044696356720206415, -0.005228189074180343, 0.22026142489277956, 0.05424071058179393, 0.12470116377384825, 0.21590079474404003, 0.11858954435835282, 0.05209687778331114, 0.18461937118307548, -0.25119323057658743, 0.023679164718046333, -0.3316241849326726, -0.0954224548274369, -0.17518522683531046, 0.04242682011064255, -0.07673354861749844, -0.11902157471261242, 0.3365010254254395, 0.25761468320816866, 0.1583129552503427, -0.0005147450984540311, 0.3256102811093583, 0.05827389005262927, 0.1293453365903009, 0.005530765336571318, 0.30625559050928464, 0.061488505114208565, 0.16721642824510732, -0.1716583642374837, -0.04369100358224276, 0.0633991254267819] |
1,803.02734 | Sklar's Omega: A Gaussian Copula-Based Framework for Assessing Agreement | The statistical measurement of agreement is important in a number of fields,
e.g., content analysis, education, computational linguistics, biomedical
imaging. We propose Sklar's Omega, a Gaussian copula-based framework for
measuring intra-coder, inter-coder, and inter-method agreement as well as
agreement relative to a gold standard. We demonstrate the efficacy and
advantages of our approach by applying it to both simulated and experimentally
observed datasets, including data from two medical imaging studies. Application
of our proposed methodology is supported by our open-source R package,
sklarsomega, which is available for download from the Comprehensive R Archive
Network.
| stat.ME | the statistical measurement of agreement is important in a number of fields eg content analysis education computational linguistics biomedical imaging we propose sklars omega a gaussian copulabased framework for measuring intracoder intercoder and intermethod agreement as well as agreement relative to a gold standard we demonstrate the efficacy and advantages of our approach by applying it to both simulated and experimentally observed datasets including data from two medical imaging studies application of our proposed methodology is supported by our opensource r package sklarsomega which is available for download from the comprehensive r archive network | [['the', 'statistical', 'measurement', 'of', 'agreement', 'is', 'important', 'in', 'a', 'number', 'of', 'fields', 'eg', 'content', 'analysis', 'education', 'computational', 'linguistics', 'biomedical', 'imaging', 'we', 'propose', 'sklars', 'omega', 'a', 'gaussian', 'copulabased', 'framework', 'for', 'measuring', 'intracoder', 'intercoder', 'and', 'intermethod', 'agreement', 'as', 'well', 'as', 'agreement', 'relative', 'to', 'a', 'gold', 'standard', 'we', 'demonstrate', 'the', 'efficacy', 'and', 'advantages', 'of', 'our', 'approach', 'by', 'applying', 'it', 'to', 'both', 'simulated', 'and', 'experimentally', 'observed', 'datasets', 'including', 'data', 'from', 'two', 'medical', 'imaging', 'studies', 'application', 'of', 'our', 'proposed', 'methodology', 'is', 'supported', 'by', 'our', 'opensource', 'r', 'package', 'sklarsomega', 'which', 'is', 'available', 'for', 'download', 'from', 'the', 'comprehensive', 'r', 'archive', 'network']] | [-0.025371238077571103, -0.030710546361221062, -0.07487110874441626, 0.06320591564008782, -0.06101824628230143, -0.1273787846983216, 0.03434259831332243, 0.3993379152738131, -0.21910688991320657, -0.36872793672667753, 0.11246131491146286, -0.303131768991659, -0.15112436846267063, 0.28268595208582764, -0.04688884201203729, 0.08859714453241654, 0.13484917265864518, -0.009578825143462682, 0.0062920994094603664, -0.2172242154247015, 0.24312071104093894, 0.06847686005326417, 0.3831696051612988, 0.048878568168320174, 0.06555626699112478, 0.017971511955813063, -0.10907348932360637, 0.0570565211563627, -0.14010954263446096, 0.1764245981933897, 0.32660665461322763, 0.21414324280979868, 0.3019570009578224, -0.356125463081708, -0.23492534744174598, 0.027007736979502733, 0.1384100695631587, 0.0734807100445403, -0.11869022316698517, -0.3073704888286826, 0.04451914152110016, -0.18208464830704443, -0.061908687777039444, -0.13953674847649022, -0.004381645404334579, 0.011833117077393191, -0.31449996691342996, 0.08887175307353283, -0.03314656076482996, 0.15018078752353295, -0.055428035654496034, -0.1498274723078114, 0.0009137627842662098, 0.12305138131301686, 0.04084064986219036, 0.07350488885172776, 0.12964744765086325, -0.0994857969120718, -0.11290670499195354, 0.3875581115320489, -0.10077514049116072, -0.14928347632227526, 0.20667143339312963, -0.09063050817125119, -0.1250895509127896, 0.04432734439743089, 0.16940263931506447, 0.09609699634333643, -0.16843747690442826, 0.09570121226619908, -0.030436124437703535, 0.1810933187358327, 0.02896517347851461, -0.016280072599769043, 0.1428978169403438, 0.239049778115209, -0.05994490841096574, 0.16009385055340417, -0.11824679653068165, -0.07331763690460351, -0.28618357827948343, -0.15713964353550922, -0.2227580781378732, -0.01881980222706161, -0.07959767164624741, -0.10851086354763298, 0.38083718176726455, 0.22992817623602166, 0.12631258462647815, 0.05408016973876159, 0.38570360507775137, -0.012893751405619576, 0.06408488085227353, 0.04974368695364139, 0.1592893001705326, 0.0997910813407993, 0.12087168540437143, -0.17188038243170173, 0.0472941687279432, -0.04429564740384704] |
1,803.02735 | Deep Back-Projection Networks For Super-Resolution | The feed-forward architectures of recently proposed deep super-resolution
networks learn representations of low-resolution inputs, and the non-linear
mapping from those to high-resolution output. However, this approach does not
fully address the mutual dependencies of low- and high-resolution images. We
propose Deep Back-Projection Networks (DBPN), that exploit iterative up- and
down-sampling layers, providing an error feedback mechanism for projection
errors at each stage. We construct mutually-connected up- and down-sampling
stages each of which represents different types of image degradation and
high-resolution components. We show that extending this idea to allow
concatenation of features across up- and down-sampling stages (Dense DBPN)
allows us to reconstruct further improve super-resolution, yielding superior
results and in particular establishing new state of the art results for large
scaling factors such as 8x across multiple data sets.
| cs.CV | the feedforward architectures of recently proposed deep superresolution networks learn representations of lowresolution inputs and the nonlinear mapping from those to highresolution output however this approach does not fully address the mutual dependencies of low and highresolution images we propose deep backprojection networks dbpn that exploit iterative up and downsampling layers providing an error feedback mechanism for projection errors at each stage we construct mutuallyconnected up and downsampling stages each of which represents different types of image degradation and highresolution components we show that extending this idea to allow concatenation of features across up and downsampling stages dense dbpn allows us to reconstruct further improve superresolution yielding superior results and in particular establishing new state of the art results for large scaling factors such as 8x across multiple data sets | [['the', 'feedforward', 'architectures', 'of', 'recently', 'proposed', 'deep', 'superresolution', 'networks', 'learn', 'representations', 'of', 'lowresolution', 'inputs', 'and', 'the', 'nonlinear', 'mapping', 'from', 'those', 'to', 'highresolution', 'output', 'however', 'this', 'approach', 'does', 'not', 'fully', 'address', 'the', 'mutual', 'dependencies', 'of', 'low', 'and', 'highresolution', 'images', 'we', 'propose', 'deep', 'backprojection', 'networks', 'dbpn', 'that', 'exploit', 'iterative', 'up', 'and', 'downsampling', 'layers', 'providing', 'an', 'error', 'feedback', 'mechanism', 'for', 'projection', 'errors', 'at', 'each', 'stage', 'we', 'construct', 'mutuallyconnected', 'up', 'and', 'downsampling', 'stages', 'each', 'of', 'which', 'represents', 'different', 'types', 'of', 'image', 'degradation', 'and', 'highresolution', 'components', 'we', 'show', 'that', 'extending', 'this', 'idea', 'to', 'allow', 'concatenation', 'of', 'features', 'across', 'up', 'and', 'downsampling', 'stages', 'dense', 'dbpn', 'allows', 'us', 'to', 'reconstruct', 'further', 'improve', 'superresolution', 'yielding', 'superior', 'results', 'and', 'in', 'particular', 'establishing', 'new', 'state', 'of', 'the', 'art', 'results', 'for', 'large', 'scaling', 'factors', 'such', 'as', '8x', 'across', 'multiple', 'data', 'sets']] | [-0.024699673283933184, 0.0014287815732912594, -0.05950407542684299, 0.010282921153817355, -0.07716269330414907, -0.151894608725185, 0.03600814965861578, 0.4432668266451265, -0.33718079002207424, -0.3262129783227959, 0.07546247851275875, -0.2443067437629298, -0.1776645656631101, 0.17148518598249812, -0.10791402366965658, 0.09433995564211542, 0.13478283642783878, -0.05585101535397134, -0.11198706361767653, -0.26420094471014155, 0.31383387827292436, 0.06012688008435877, 0.3396206817506743, -0.027161879868312613, 0.19243689498215122, -0.031346563337825414, -0.06936753204635043, -0.04488993464056109, -0.06500049680070383, 0.1498738185421923, 0.3000810696902927, 0.17250661200689754, 0.27324837102466737, -0.46165163468158854, -0.2453986355653546, 0.0694409636019795, 0.176740336259387, 0.1291973880651649, -0.019096057491714325, -0.2822889979254073, 0.1242397111715881, -0.14227489552159947, 0.013773167436194467, -0.16331625383853268, -0.06778572036199067, 0.001377251592016615, -0.3383515539403095, 0.039236685966955516, 0.07255244265046011, 0.01565814231830378, -0.05457731430266625, -0.09210215907499898, 0.052498399797005685, 0.2323417970837336, -0.047258046210017494, 0.0437748365976855, 0.094010894223461, -0.18119546077690843, -0.12553569460727684, 0.28909292429186934, -0.05975683528643952, -0.14563310524727416, 0.2318223235454029, -0.08908914091930849, -0.15750948764662456, 0.1476732962984797, 0.21490375922010171, 0.10142102078571329, -0.14020300313177717, -0.023545676891143823, 0.002424610745689766, 0.1959960233432967, 0.10274285449111085, 0.06813515748417988, 0.15864518943323394, 0.20748577087816936, 0.04361660608522893, 0.14913484385589093, -0.17970229133273344, -0.031441731399519175, -0.2083214426337096, -0.10966773315765492, -0.14532472736818172, -0.020390450956155985, -0.1225033475987395, -0.1144544588908137, 0.42301507394643517, 0.21415231982429372, 0.25930456700551463, 0.11186427995975048, 0.3672909548608806, 0.03602519612227691, 0.16382297690165795, 0.08614598911651593, 0.19004150265167782, 0.09280984329543715, 0.09619969725663825, -0.16604551312689647, 0.02439105932006803, 0.04159978979315763] |
1,803.02736 | Complete electrodynamics of a BCS superconductor with $\mu$eV energy
scales: microwave spectroscopy on titanium at mK temperatures | We performed resonant microwave measurements on superconducting titanium (Ti)
down to temperatures of 40~mK, well below its critical temperature
$T_\mathrm{c} \approx 0.5$~K. Our wide frequency range 3.3-40~GHz contains the
zero-temperature energy gap $2\Delta_0$ and allows us to probe the full
electrodynamics of the superconducting state, including excitations across the
gap and the low-frequency responses of superfluid condensate and thermal
quasiparticles. The observed behavior follows the predictions of the BCS-based
Mattis-Bardeen formalism, which implies that superconducting Ti is in the dirty
limit, in agreement with our determination of the scattering rate. We directly
determine the temperature dependence of the energy gap, which is in accordance
with BCS predictions, and $2\Delta_0/k_\mathrm{B}T_\mathrm{c}\approx3.5$ with
$\Delta_0 \approx$ 75~$\mu$eV. We also evaluate the penetration depth, and we
characterize the behavior of superconducting Ti in external magnetic field.
| cond-mat.supr-con | we performed resonant microwave measurements on superconducting titanium ti down to temperatures of 40mk well below its critical temperature t_mathrmc approx 05k our wide frequency range 3340ghz contains the zerotemperature energy gap 2delta_0 and allows us to probe the full electrodynamics of the superconducting state including excitations across the gap and the lowfrequency responses of superfluid condensate and thermal quasiparticles the observed behavior follows the predictions of the bcsbased mattisbardeen formalism which implies that superconducting ti is in the dirty limit in agreement with our determination of the scattering rate we directly determine the temperature dependence of the energy gap which is in accordance with bcs predictions and 2delta_0k_mathrmbt_mathrmcapprox35 with delta_0 approx 75muev we also evaluate the penetration depth and we characterize the behavior of superconducting ti in external magnetic field | [['we', 'performed', 'resonant', 'microwave', 'measurements', 'on', 'superconducting', 'titanium', 'ti', 'down', 'to', 'temperatures', 'of', '40mk', 'well', 'below', 'its', 'critical', 'temperature', 't_mathrmc', 'approx', '05k', 'our', 'wide', 'frequency', 'range', '3340ghz', 'contains', 'the', 'zerotemperature', 'energy', 'gap', '2delta_0', 'and', 'allows', 'us', 'to', 'probe', 'the', 'full', 'electrodynamics', 'of', 'the', 'superconducting', 'state', 'including', 'excitations', 'across', 'the', 'gap', 'and', 'the', 'lowfrequency', 'responses', 'of', 'superfluid', 'condensate', 'and', 'thermal', 'quasiparticles', 'the', 'observed', 'behavior', 'follows', 'the', 'predictions', 'of', 'the', 'bcsbased', 'mattisbardeen', 'formalism', 'which', 'implies', 'that', 'superconducting', 'ti', 'is', 'in', 'the', 'dirty', 'limit', 'in', 'agreement', 'with', 'our', 'determination', 'of', 'the', 'scattering', 'rate', 'we', 'directly', 'determine', 'the', 'temperature', 'dependence', 'of', 'the', 'energy', 'gap', 'which', 'is', 'in', 'accordance', 'with', 'bcs', 'predictions', 'and', '2delta_0k_mathrmbt_mathrmcapprox35', 'with', 'delta_0', 'approx', '75muev', 'we', 'also', 'evaluate', 'the', 'penetration', 'depth', 'and', 'we', 'characterize', 'the', 'behavior', 'of', 'superconducting', 'ti', 'in', 'external', 'magnetic', 'field']] | [-0.1434867463176488, 0.21577108780593335, -0.03726326279138448, 0.02057325629539264, -0.02766622824856313, -0.11146861619272386, 0.13834642436995637, 0.33751446584938094, -0.20721610984401195, -0.32903953759523574, -0.02469919989744085, -0.3514581900909661, -0.021490092105523217, 0.2050840135270846, 0.051206548678237596, 0.04550479253202866, -0.06832655848847935, 0.0014212429828148743, -0.12495788463820645, -0.15813020503173902, 0.3098704846979672, 0.044351661890686955, 0.3653565145305038, 0.13232328537742433, 0.014405720176000614, -0.02271970004949253, 0.10479825980291935, 0.016545643280551303, -0.20491543814779334, 0.005764984016423114, 0.2660382998146815, -0.06949637575780798, 0.15134834100899752, -0.4091085730906343, -0.20066933485577465, 0.046394383993174415, 0.1260494249054318, 0.12753222661922337, 0.014943724464501429, -0.2527946418013016, 0.04009494397905655, -0.13431051868610666, -0.15185725105311576, -0.08226086706054048, -0.022513296974466357, -0.016563236597903597, -0.23987566981304553, 0.11207439867735047, 0.038767923811064975, 0.0632371811880148, -0.10661520918301903, -0.11605649920966243, -0.030297284332846175, 0.05492740161753318, 0.03592382395072491, 0.06086578163012746, 0.17416399701323826, -0.13362678461379573, -0.015941264491630136, 0.3096879290869765, -0.11133475464612275, -0.010733328152127797, 0.1586166250781389, -0.2160357849643333, -0.024099504104924563, 0.150168621758894, 0.07605854484654628, 0.04325625070850947, -0.11375706604576408, 0.09276296077359802, 0.0029096055350237293, 0.2248849732986855, 0.03269744296994759, 0.1060732616492146, 0.2434079710728838, 0.23017765934719137, -0.012645296614209656, 0.1349666957576119, -0.15505147082603798, -0.046647512765048305, -0.27669690853508655, -0.14370481685526215, -0.20325295246402675, 0.04608301894768374, -0.07576566756631564, -0.19646499204282009, 0.4094787332614942, 0.22309251610568026, 0.2053979145057383, 0.011759039256276083, 0.2550246376595169, 0.15682267832107755, 0.06627995311100676, 0.08163576411971007, 0.2862454443165916, 0.20366663877939573, 0.15898079488033545, -0.33604491951609816, 0.0035781852375293965, -0.029408322348899674] |
1,803.02737 | Cubic interactions of massless bosonic fields in three dimensions II:
Parity-odd and Chern-Simons vertices | This work completes the classification of the cubic vertices for arbitrary
spin massless bosons in three dimensions started in a previous companion paper
by constructing parity-odd vertices. Similarly to the parity-even case, there
is a unique parity-odd vertex for any given triple $s_1\geq s_2\geq s_3\geq 2$
of massless bosons if the triangle inequalities are satisfied ($s_1<s_2+s_3$)
and none otherwise. These vertices involve two (three) derivatives for odd
(even) values of the sum $s_1+s_2+s_3$. A non-trivial relation between
parity-even and parity-odd vertices is found. Similarly to the parity-even
case, the scalar and Maxwell matter can couple to higher spins through current
couplings with higher derivatives. We comment on possible lessons for 2d CFT.
We also derive both parity-even and parity-odd vertices with Chern-Simons
fields and comment on the analogous classification in two dimensions.
| hep-th | this work completes the classification of the cubic vertices for arbitrary spin massless bosons in three dimensions started in a previous companion paper by constructing parityodd vertices similarly to the parityeven case there is a unique parityodd vertex for any given triple s_1geq s_2geq s_3geq 2 of massless bosons if the triangle inequalities are satisfied s_1s_2s_3 and none otherwise these vertices involve two three derivatives for odd even values of the sum s_1s_2s_3 a nontrivial relation between parityeven and parityodd vertices is found similarly to the parityeven case the scalar and maxwell matter can couple to higher spins through current couplings with higher derivatives we comment on possible lessons for 2d cft we also derive both parityeven and parityodd vertices with chernsimons fields and comment on the analogous classification in two dimensions | [['this', 'work', 'completes', 'the', 'classification', 'of', 'the', 'cubic', 'vertices', 'for', 'arbitrary', 'spin', 'massless', 'bosons', 'in', 'three', 'dimensions', 'started', 'in', 'a', 'previous', 'companion', 'paper', 'by', 'constructing', 'parityodd', 'vertices', 'similarly', 'to', 'the', 'parityeven', 'case', 'there', 'is', 'a', 'unique', 'parityodd', 'vertex', 'for', 'any', 'given', 'triple', 's_1geq', 's_2geq', 's_3geq', '2', 'of', 'massless', 'bosons', 'if', 'the', 'triangle', 'inequalities', 'are', 'satisfied', 's_1s_2s_3', 'and', 'none', 'otherwise', 'these', 'vertices', 'involve', 'two', 'three', 'derivatives', 'for', 'odd', 'even', 'values', 'of', 'the', 'sum', 's_1s_2s_3', 'a', 'nontrivial', 'relation', 'between', 'parityeven', 'and', 'parityodd', 'vertices', 'is', 'found', 'similarly', 'to', 'the', 'parityeven', 'case', 'the', 'scalar', 'and', 'maxwell', 'matter', 'can', 'couple', 'to', 'higher', 'spins', 'through', 'current', 'couplings', 'with', 'higher', 'derivatives', 'we', 'comment', 'on', 'possible', 'lessons', 'for', '2d', 'cft', 'we', 'also', 'derive', 'both', 'parityeven', 'and', 'parityodd', 'vertices', 'with', 'chernsimons', 'fields', 'and', 'comment', 'on', 'the', 'analogous', 'classification', 'in', 'two', 'dimensions']] | [-0.16900812936875656, 0.20037615626254154, 0.012914493246331015, 0.06679526674703389, -0.1219692415138351, -0.18443493641386846, -0.03485186078020493, 0.32908352238360705, -0.1299694939640898, -0.2763313220614809, 0.029084461506985782, -0.36794739677250843, -0.16179230009767276, 0.08469825964740954, 0.024941265035619716, 0.0172299954655646, 0.020640234519791512, 0.07846747429415811, -0.09571908104263659, -0.3336525234813226, 0.34176361579650155, -0.0909042815492979, 0.1653396109766007, 0.09232822158160613, 0.09054426160349532, 0.06375684753373151, -0.02698928870097201, 0.005917310814252337, -0.1249176960417162, 0.052023939980293504, 0.224066395378309, 0.029285453963768845, 0.1233277274793341, -0.41486334316574663, -0.135402450529958, 0.16518670074527955, 0.14117283771127348, 0.08539477262631741, 0.003304501432029687, -0.2412136815282168, 0.04768828732380999, -0.1595927579826071, -0.13280713475728764, -0.08534140720295201, 0.047375930235045785, -0.09272787180722102, -0.28017161628906795, 0.08509495017409346, 0.06625767530365101, 0.02913250052636731, -0.036027819904648054, -0.17906754684122636, -0.07091896304192434, 0.09320392240396921, 0.07813988056190255, 0.061705069111674345, 0.030398098677254588, -0.18191521298246927, -0.17587826747308621, 0.3620919127955691, -0.07397562942915518, -0.2694638044971489, 0.20048621295460764, -0.19005568094821718, -0.189117209136287, 0.055424735991582846, 0.11427657226392046, 0.1312125682695733, -0.1562150652939809, 0.14921543093616826, -0.033945113422263785, 0.09593966559734451, 0.1472264585824584, 0.04608959269279771, 0.25353171930022766, 0.03179978137082271, 0.07450504980995569, 0.15986421944232274, 0.010342496283750498, -0.04407294913602083, -0.3636479977774256, -0.1584542204078486, -0.17528246970356706, 0.07435574435863558, -0.14683179341855135, -0.13217871466239217, 0.3876592115577282, 0.11411366014179723, 0.1493077743300841, 0.046318851290483964, 0.2581058217795523, 0.09231184327704761, 0.07136168408399547, 0.08950066878611421, 0.2601634538105959, 0.15107389070086522, 0.043817362986249095, -0.18600856322965775, -0.08924740757295535, 0.14066615973720115] |
1,803.02738 | Neural network feedback controller for inertial platform | The paper describes an algorithm for the synthesis of neural networks to
control gyro stabilizer. The neural network performs the role of observer for
state vector. The role of an observer in a feedback of gyro stabilizer is
illustrated. Paper detail a problem specific features stage of classics
algorithm: choosing of network architecture, learning of neural network and
verification of result feedback control. In the article presented optimal
configuration of the neural network like a memory depth, the number of layers
and neuron in these layers and activation functions in layers. Using the
information of dynamic system for improving learning of neural network is
provided. A scheme creation of an optimal training sample is provided.
| cs.NE math.DS | the paper describes an algorithm for the synthesis of neural networks to control gyro stabilizer the neural network performs the role of observer for state vector the role of an observer in a feedback of gyro stabilizer is illustrated paper detail a problem specific features stage of classics algorithm choosing of network architecture learning of neural network and verification of result feedback control in the article presented optimal configuration of the neural network like a memory depth the number of layers and neuron in these layers and activation functions in layers using the information of dynamic system for improving learning of neural network is provided a scheme creation of an optimal training sample is provided | [['the', 'paper', 'describes', 'an', 'algorithm', 'for', 'the', 'synthesis', 'of', 'neural', 'networks', 'to', 'control', 'gyro', 'stabilizer', 'the', 'neural', 'network', 'performs', 'the', 'role', 'of', 'observer', 'for', 'state', 'vector', 'the', 'role', 'of', 'an', 'observer', 'in', 'a', 'feedback', 'of', 'gyro', 'stabilizer', 'is', 'illustrated', 'paper', 'detail', 'a', 'problem', 'specific', 'features', 'stage', 'of', 'classics', 'algorithm', 'choosing', 'of', 'network', 'architecture', 'learning', 'of', 'neural', 'network', 'and', 'verification', 'of', 'result', 'feedback', 'control', 'in', 'the', 'article', 'presented', 'optimal', 'configuration', 'of', 'the', 'neural', 'network', 'like', 'a', 'memory', 'depth', 'the', 'number', 'of', 'layers', 'and', 'neuron', 'in', 'these', 'layers', 'and', 'activation', 'functions', 'in', 'layers', 'using', 'the', 'information', 'of', 'dynamic', 'system', 'for', 'improving', 'learning', 'of', 'neural', 'network', 'is', 'provided', 'a', 'scheme', 'creation', 'of', 'an', 'optimal', 'training', 'sample', 'is', 'provided']] | [-0.1337681368610862, 0.014189706005171224, -0.026062485164679263, -0.005095050816991083, -0.055796254264271775, -0.18281105459546265, 0.03492954960092902, 0.41830308383897596, -0.3093423777178902, -0.3026190592057031, 0.06135708982448863, -0.21929818737604048, -0.2321656482456171, 0.19780387580091052, -0.10667959573152272, 0.11984956035309512, 0.10756160233007825, 0.06306546589805057, -0.011348596903616967, -0.26106114561325344, 0.3527118106332162, 0.12812022741722023, 0.32168495363515354, -0.039708789636421465, 0.17888231036131796, -0.012988475315353793, -0.00894676248907395, -0.026829576746398662, -0.03948327821638921, 0.164804138993318, 0.26848986162399147, 0.20879180733438418, 0.3462097056210041, -0.44892718930413655, -0.21901797465170209, 0.06493307662338181, 0.15429431752544706, 0.14973249917283007, -0.0219384604903019, -0.27528126191995717, 0.08159846744459609, -0.1852701354123976, -0.027140940158911372, -0.055931877976526385, -0.0028727062491943007, 0.0006129618221957176, -0.3274712932093636, -0.015919543673162874, 0.1252287503919038, 0.08638730289050095, -0.08559550602070015, -0.09184406285437391, -0.009313657061885233, 0.18401039818949674, -0.041554318844219264, 0.07850777134198048, 0.17357743917761936, -0.2016947591677308, -0.14992015646041734, 0.28825273832063314, -0.0043735653364464, -0.19770972892318084, 0.09696011672039395, 0.013027616266323172, -0.12339410163138224, 0.0628305705021257, 0.2561852640269891, 0.1023227226090334, -0.16316170566107915, 0.011926144167639154, -0.02138781864196062, 0.1882626228439419, 0.0033349422697463763, 0.0365263554227093, 0.12574679155064666, 0.3206377907737118, 0.06611743168500454, 0.1819868366274497, -0.10957291132729986, -0.07880139251685013, -0.2750925499136033, -0.1391636607925529, -0.20975626728942862, -0.02584006292340548, -0.11260913354104243, -0.16413180560845395, 0.4537421848534786, 0.1586016124581321, 0.17960727117226824, 0.10603129321142384, 0.2988432507152143, 0.06639755622524282, 0.07518902070334424, 0.12810013833172296, 0.20426434842140778, 0.1107580755877754, 0.1474555852053606, -0.2308824155672008, 0.11146879005448326, 0.07929921608580195] |
1,803.02739 | Nonparametric Estimation of Probability Density Functions of Random
Persistence Diagrams | We introduce a nonparametric way to estimate the global probability density
function for a random persistence diagram. Precisely, a kernel density function
centered at a given persistence diagram and a given bandwidth is constructed.
Our approach encapsulates the number of topological features and considers the
appearance or disappearance of features near the diagonal in a stable fashion.
In particular, the structure of our kernel individually tracks long persistence
features, while considering features near the diagonal as a collective unit.
The choice to describe short persistence features as a group reduces
computation time while simultaneously retaining accuracy. Indeed, we prove that
the associated kernel density estimate converges to the true distribution as
the number of persistence diagrams increases and the bandwidth shrinks
accordingly. We also establish the convergence of the mean absolute deviation
estimate, defined according to the bottleneck metric. Lastly, examples of
kernel density estimation are presented for typical underlying datasets.
| math.ST stat.TH | we introduce a nonparametric way to estimate the global probability density function for a random persistence diagram precisely a kernel density function centered at a given persistence diagram and a given bandwidth is constructed our approach encapsulates the number of topological features and considers the appearance or disappearance of features near the diagonal in a stable fashion in particular the structure of our kernel individually tracks long persistence features while considering features near the diagonal as a collective unit the choice to describe short persistence features as a group reduces computation time while simultaneously retaining accuracy indeed we prove that the associated kernel density estimate converges to the true distribution as the number of persistence diagrams increases and the bandwidth shrinks accordingly we also establish the convergence of the mean absolute deviation estimate defined according to the bottleneck metric lastly examples of kernel density estimation are presented for typical underlying datasets | [['we', 'introduce', 'a', 'nonparametric', 'way', 'to', 'estimate', 'the', 'global', 'probability', 'density', 'function', 'for', 'a', 'random', 'persistence', 'diagram', 'precisely', 'a', 'kernel', 'density', 'function', 'centered', 'at', 'a', 'given', 'persistence', 'diagram', 'and', 'a', 'given', 'bandwidth', 'is', 'constructed', 'our', 'approach', 'encapsulates', 'the', 'number', 'of', 'topological', 'features', 'and', 'considers', 'the', 'appearance', 'or', 'disappearance', 'of', 'features', 'near', 'the', 'diagonal', 'in', 'a', 'stable', 'fashion', 'in', 'particular', 'the', 'structure', 'of', 'our', 'kernel', 'individually', 'tracks', 'long', 'persistence', 'features', 'while', 'considering', 'features', 'near', 'the', 'diagonal', 'as', 'a', 'collective', 'unit', 'the', 'choice', 'to', 'describe', 'short', 'persistence', 'features', 'as', 'a', 'group', 'reduces', 'computation', 'time', 'while', 'simultaneously', 'retaining', 'accuracy', 'indeed', 'we', 'prove', 'that', 'the', 'associated', 'kernel', 'density', 'estimate', 'converges', 'to', 'the', 'true', 'distribution', 'as', 'the', 'number', 'of', 'persistence', 'diagrams', 'increases', 'and', 'the', 'bandwidth', 'shrinks', 'accordingly', 'we', 'also', 'establish', 'the', 'convergence', 'of', 'the', 'mean', 'absolute', 'deviation', 'estimate', 'defined', 'according', 'to', 'the', 'bottleneck', 'metric', 'lastly', 'examples', 'of', 'kernel', 'density', 'estimation', 'are', 'presented', 'for', 'typical', 'underlying', 'datasets']] | [-0.11690686798549646, 0.08259161936569441, -0.0990883202470774, 0.1120685056863439, -0.044098531417178594, -0.10620981412908889, 0.087754840876241, 0.3788163707104345, -0.3011606122854332, -0.274805844150829, 0.10050474612554226, -0.2743607406313254, -0.1505385511257957, 0.1274537552774125, -0.05696286047351645, 0.04086853552066925, 0.05172586686977043, 0.08735582653729133, -0.12022049925968495, -0.21755414681095903, 0.285003688229581, 0.05901755498635848, 0.30673855189727434, 0.013886674824602508, 0.11651518645492807, 0.03280977258421727, -0.04369675968958694, 0.02639006971745306, -0.13866731196524157, 0.11455556843275612, 0.2144499924569699, 0.09634832624395745, 0.29395634096442713, -0.3255110156679193, -0.2186033612592084, 0.11936073752878765, 0.15288620583700718, 0.0635111481977653, 0.004183616281012135, -0.25803900307155403, 0.10684602018075669, -0.14344657483257797, -0.17813469458599607, -0.09628162354798309, 0.024829614252185092, 0.04868157941073993, -0.27014830096706516, 0.0951096794808157, 0.04225340759110273, 0.030414159975588224, -0.053451103862954784, -0.1018560328366642, -0.022938240942428047, 0.1453484935263505, 0.025784699062027332, 0.03642054490239316, 0.1452096314323659, -0.15996310336126743, -0.0571172313443971, 0.32434288105797887, -0.10774390676655554, -0.20260693891504347, 0.15622489317782864, -0.12729543570231722, -0.09314521137853955, 0.132521406414345, 0.14405772555311094, 0.08598275192464326, -0.09131404320248372, 0.07034730021757019, -0.025050990387954632, 0.15438976640880897, 0.052624542410300415, 0.05728326539743371, 0.16985791043335238, 0.1797462041406516, 0.11894499530880065, 0.15755029106111765, -0.13929212972635885, -0.11658244158159818, -0.3298641596458211, -0.14303690908994798, -0.2073953290152308, 0.0032260853562824775, -0.1320349327262548, -0.21621794137634978, 0.4442436019057371, 0.14126350226756557, 0.2753508685174821, 0.1390978995593425, 0.2674751558729651, 0.1343098067168134, 0.061217766800981684, 0.09181857769784597, 0.13113147943027761, 0.11538663032211807, 0.048811723912961236, -0.21390037307406265, 0.1248372159859733, 0.1027763430352958] |
1,803.0274 | Discontinuous homomorphisms, selectors and automorphisms of the complex
field | We show, in Zermelo-Fraenkel set theory without the Axiom of Choice, that the
existence of a discontinuous homomorphism of the additive group of real numbers
induces a selector for the Vitali equivalence relation $\mathbb{R}/\mathbb{Q}$.
This shows that a nonprincipal ultrafilter on the integers is not sufficient to
construct a discontinuous automorphism of the complex field, confirming a
conjecture of Simon Thomas. This is an improved version of our paper in the
Proceedings of the American Mathematical Society, which used a weak version of
the Axiom of Choice for the same result.
| math.LO | we show in zermelofraenkel set theory without the axiom of choice that the existence of a discontinuous homomorphism of the additive group of real numbers induces a selector for the vitali equivalence relation mathbbrmathbbq this shows that a nonprincipal ultrafilter on the integers is not sufficient to construct a discontinuous automorphism of the complex field confirming a conjecture of simon thomas this is an improved version of our paper in the proceedings of the american mathematical society which used a weak version of the axiom of choice for the same result | [['we', 'show', 'in', 'zermelofraenkel', 'set', 'theory', 'without', 'the', 'axiom', 'of', 'choice', 'that', 'the', 'existence', 'of', 'a', 'discontinuous', 'homomorphism', 'of', 'the', 'additive', 'group', 'of', 'real', 'numbers', 'induces', 'a', 'selector', 'for', 'the', 'vitali', 'equivalence', 'relation', 'mathbbrmathbbq', 'this', 'shows', 'that', 'a', 'nonprincipal', 'ultrafilter', 'on', 'the', 'integers', 'is', 'not', 'sufficient', 'to', 'construct', 'a', 'discontinuous', 'automorphism', 'of', 'the', 'complex', 'field', 'confirming', 'a', 'conjecture', 'of', 'simon', 'thomas', 'this', 'is', 'an', 'improved', 'version', 'of', 'our', 'paper', 'in', 'the', 'proceedings', 'of', 'the', 'american', 'mathematical', 'society', 'which', 'used', 'a', 'weak', 'version', 'of', 'the', 'axiom', 'of', 'choice', 'for', 'the', 'same', 'result']] | [-0.18309003121943937, 0.0599254059490502, -0.14651818797509703, 0.0557724564594941, -0.1287410599903928, -0.08985410954596268, 0.06861095716400693, 0.2624315516505804, -0.2837453773814357, -0.23695084453663892, 0.0842044874585958, -0.20110605782570523, -0.14097809799325964, 0.18150370322659404, -0.15944944191724061, -0.02776752181040744, 0.0799963196946515, 0.06232870670242442, -0.034393222666242056, -0.257520333949166, 0.35506465594129016, -0.0014075961998767322, 0.26096342624061636, 0.08057181396418148, 0.13877369255965782, 0.02540205240042673, -0.014024391457334988, 0.044920970571951734, -0.11915120395084765, 0.12370126635198378, 0.2447912794434362, 0.1456243511237618, 0.32610428562491306, -0.34818269258571993, -0.14224252148479638, 0.1429547727211482, 0.033474130152414246, 0.07293100036654829, -0.03911702400720161, -0.28037580543508134, 0.118093843675322, -0.1814477045295967, -0.1826185876658807, -0.03557169980162548, 0.05951852816182913, 0.009002818819135427, -0.2976502534467727, 0.023634322453290224, 0.17477690000087023, 0.14662078112984697, -0.05204772367142141, -0.08123250355840557, -0.012877893815230992, 0.0719905675181912, 0.002236575514285101, 0.05021531424459277, 0.05467977459128532, -0.08749877976046669, -0.14487289536951317, 0.40109014485238326, -0.0890620467873911, -0.2075384560558531, 0.1568380495429867, -0.12994151523129807, -0.2150016497199734, 0.07994936775778316, 0.08044523965153429, 0.10240779523220327, -0.08117949990555644, 0.16172430923519035, -0.17778209091759184, 0.19900226816534997, 0.09915613996175428, -0.021829199004504415, 0.1221569173089746, 0.10083842419294847, 0.08311022352685946, 0.13783837081347075, 0.018598303113443158, -0.05713953273370862, -0.3787763821995921, -0.18770242004344861, -0.16507163704890343, 0.09732623131599717, -0.09422606278417839, -0.24474003550906975, 0.37915021949965094, 0.15131288430550033, 0.1219196823425591, 0.085615168502813, 0.2103299441229966, 0.08319489100071628, 0.02042569710045225, 0.021867100594358313, 0.1772610179459055, 0.19038177815576393, 0.026385423608331217, -0.17496006670925351, 0.0550093988267084, 0.16756290550757613] |
1,803.02741 | Genetic Algorithm Assisted Hybrid Beamforming for Wireless Fronthaul | This paper proposes a genetic algorithm assisted hybrid signal to leakage
plus noise ratio (SLNR) beamforming design for wireless fronthaul scenario. The
digital precoder of the proposed hybrid SLNR beamforming is expressed in
closed-form. Highly limited phase resolution (one-bit resolution) is assumed at
the phase shifters at the analog precoder. The analog precoders maximizing the
approximated sum rate are presented. Genetic algorithms are used to search for
optimal solutions of one-bit analog precoders. In contrast to common
assumptions on perfect knowledge of the true channel matrix at the transmitter,
the proposed method relies only on the distorted channel matrix after the
analog precoder. Performance of the proposed hybrid SLNR beamforming with
limited phase resolution at the analog precoder can achieve performance close
to digital beamforming in single cell wireless fronthaul scenarios. It is also
shown that hybrid beamforming can result in undesired beams causing intercell
interference in multicell wireless fronthaul scenarios.
| cs.IT math.IT | this paper proposes a genetic algorithm assisted hybrid signal to leakage plus noise ratio slnr beamforming design for wireless fronthaul scenario the digital precoder of the proposed hybrid slnr beamforming is expressed in closedform highly limited phase resolution onebit resolution is assumed at the phase shifters at the analog precoder the analog precoders maximizing the approximated sum rate are presented genetic algorithms are used to search for optimal solutions of onebit analog precoders in contrast to common assumptions on perfect knowledge of the true channel matrix at the transmitter the proposed method relies only on the distorted channel matrix after the analog precoder performance of the proposed hybrid slnr beamforming with limited phase resolution at the analog precoder can achieve performance close to digital beamforming in single cell wireless fronthaul scenarios it is also shown that hybrid beamforming can result in undesired beams causing intercell interference in multicell wireless fronthaul scenarios | [['this', 'paper', 'proposes', 'a', 'genetic', 'algorithm', 'assisted', 'hybrid', 'signal', 'to', 'leakage', 'plus', 'noise', 'ratio', 'slnr', 'beamforming', 'design', 'for', 'wireless', 'fronthaul', 'scenario', 'the', 'digital', 'precoder', 'of', 'the', 'proposed', 'hybrid', 'slnr', 'beamforming', 'is', 'expressed', 'in', 'closedform', 'highly', 'limited', 'phase', 'resolution', 'onebit', 'resolution', 'is', 'assumed', 'at', 'the', 'phase', 'shifters', 'at', 'the', 'analog', 'precoder', 'the', 'analog', 'precoders', 'maximizing', 'the', 'approximated', 'sum', 'rate', 'are', 'presented', 'genetic', 'algorithms', 'are', 'used', 'to', 'search', 'for', 'optimal', 'solutions', 'of', 'onebit', 'analog', 'precoders', 'in', 'contrast', 'to', 'common', 'assumptions', 'on', 'perfect', 'knowledge', 'of', 'the', 'true', 'channel', 'matrix', 'at', 'the', 'transmitter', 'the', 'proposed', 'method', 'relies', 'only', 'on', 'the', 'distorted', 'channel', 'matrix', 'after', 'the', 'analog', 'precoder', 'performance', 'of', 'the', 'proposed', 'hybrid', 'slnr', 'beamforming', 'with', 'limited', 'phase', 'resolution', 'at', 'the', 'analog', 'precoder', 'can', 'achieve', 'performance', 'close', 'to', 'digital', 'beamforming', 'in', 'single', 'cell', 'wireless', 'fronthaul', 'scenarios', 'it', 'is', 'also', 'shown', 'that', 'hybrid', 'beamforming', 'can', 'result', 'in', 'undesired', 'beams', 'causing', 'intercell', 'interference', 'in', 'multicell', 'wireless', 'fronthaul', 'scenarios']] | [-0.2996913715788404, -0.03044094748498983, 0.010017462888892912, -0.012183484085527132, -0.09567589862603657, -0.27440512404524237, 0.10134119897023065, 0.3957870847511642, -0.27268047913884286, -0.24409660411418865, 0.09706109530825957, -0.2110498644941986, -0.24756559224904126, 0.10344603269620004, -0.18083171466279108, 0.08844301353720639, 0.03998699830690806, -0.0025429401349350315, -0.08365656165498624, -0.246748747569293, 0.21683803735152873, 0.17952965069808904, 0.43960579667265054, -0.08763160522632449, 0.1268481593887439, 0.00019419545443444852, 0.002999713693726931, -0.11607407757531334, -0.0697349610791749, 0.00032941954802499703, 0.39911907885396325, 0.20533702035884785, 0.2177140498348814, -0.41720381118850597, -0.23120461727511013, 0.12256667871546272, 0.22305220709142232, 0.05708564407136661, -0.1012974141045344, -0.24009139840460278, 0.18115384657003775, -0.21931321403344736, 0.02450304859570715, 0.045066515850334964, -0.2034256760253022, 0.02184152773377911, -0.41164976136453624, 0.0554367558017222, -0.019745822894134072, -0.017326604895639103, -0.026944282944221666, -0.2191088099452044, 0.054031393256359146, 0.08024806396369606, -0.02008027480051711, -0.012595782700975408, 0.1031998710750004, -0.06268959425679649, -0.0971520659791318, 0.34775968806799623, 0.03158971931884028, -0.30477647936674734, 0.10091003782458184, -0.0979180886712394, -0.03940388823578763, 0.22671211850736908, 0.2680774831563074, 0.03839049812110252, -0.18736607975801392, 0.027542950132158617, 0.04328038583552798, 0.19180179530354172, 0.12285709795187419, 0.16262986511917205, 0.16728131935333476, 0.22856875617883557, 0.1591079854067193, 0.13345722185867215, -0.13371734539261212, -0.11065921740335048, -0.1871102864334409, -0.06506723173684287, -0.2871801668326278, -0.007893843406700338, -0.10383694631275751, -0.041102650680768904, 0.30437851436004437, 0.11791764127263268, 0.032590415125207, 0.09104795983317154, 0.4934746364982712, 0.11882727951835224, 0.06584024455842395, 0.08278676691551427, 0.23162386326785414, 0.17288160519612744, 0.1778262163796123, -0.2732248950984008, 0.012708797816507864, 0.04091208221526533] |
1,803.02742 | HENet:A Highly Efficient Convolutional Neural Networks Optimized for
Accuracy, Speed and Storage | In order to enhance the real-time performance of convolutional neural
networks(CNNs), more and more researchers are focusing on improving the
efficiency of CNN. Based on the analysis of some CNN architectures, such as
ResNet, DenseNet, ShuffleNet and so on, we combined their advantages and
proposed a very efficient model called Highly Efficient Networks(HENet). The
new architecture uses an unusual way to combine group convolution and channel
shuffle which was mentioned in ShuffleNet. Inspired by ResNet and DenseNet, we
also proposed a new way to use element-wise addition and concatenation
connection with each block. In order to make greater use of feature maps,
pooling operations are removed from HENet. The experiments show that our
model's efficiency is more than 1 times higher than ShuffleNet on many open
source datasets, such as CIFAR-10/100 and SVHN.
| cs.CV | in order to enhance the realtime performance of convolutional neural networkscnns more and more researchers are focusing on improving the efficiency of cnn based on the analysis of some cnn architectures such as resnet densenet shufflenet and so on we combined their advantages and proposed a very efficient model called highly efficient networkshenet the new architecture uses an unusual way to combine group convolution and channel shuffle which was mentioned in shufflenet inspired by resnet and densenet we also proposed a new way to use elementwise addition and concatenation connection with each block in order to make greater use of feature maps pooling operations are removed from henet the experiments show that our models efficiency is more than 1 times higher than shufflenet on many open source datasets such as cifar10100 and svhn | [['in', 'order', 'to', 'enhance', 'the', 'realtime', 'performance', 'of', 'convolutional', 'neural', 'networkscnns', 'more', 'and', 'more', 'researchers', 'are', 'focusing', 'on', 'improving', 'the', 'efficiency', 'of', 'cnn', 'based', 'on', 'the', 'analysis', 'of', 'some', 'cnn', 'architectures', 'such', 'as', 'resnet', 'densenet', 'shufflenet', 'and', 'so', 'on', 'we', 'combined', 'their', 'advantages', 'and', 'proposed', 'a', 'very', 'efficient', 'model', 'called', 'highly', 'efficient', 'networkshenet', 'the', 'new', 'architecture', 'uses', 'an', 'unusual', 'way', 'to', 'combine', 'group', 'convolution', 'and', 'channel', 'shuffle', 'which', 'was', 'mentioned', 'in', 'shufflenet', 'inspired', 'by', 'resnet', 'and', 'densenet', 'we', 'also', 'proposed', 'a', 'new', 'way', 'to', 'use', 'elementwise', 'addition', 'and', 'concatenation', 'connection', 'with', 'each', 'block', 'in', 'order', 'to', 'make', 'greater', 'use', 'of', 'feature', 'maps', 'pooling', 'operations', 'are', 'removed', 'from', 'henet', 'the', 'experiments', 'show', 'that', 'our', 'models', 'efficiency', 'is', 'more', 'than', '1', 'times', 'higher', 'than', 'shufflenet', 'on', 'many', 'open', 'source', 'datasets', 'such', 'as', 'cifar10100', 'and', 'svhn']] | [-0.0367189567813043, -0.006102539195787606, -0.052902686769481407, 0.05721956572343708, -0.09676004939440948, -0.1993330012950482, 0.026478292043038615, 0.472405612059502, -0.23880097473209555, -0.31003146089444106, 0.10610379218070937, -0.26977710199725785, -0.22610182416180827, 0.257395627783174, -0.11292061395237618, 0.07587285277038587, 0.11298663335654771, 0.020009285759773444, -0.09888838573224899, -0.30322446356347593, 0.2712530685786271, 0.10012929394812972, 0.31847283238488616, 0.015434123896711477, 0.12924679795414154, -0.05701250314472638, -0.024524101128477152, -0.030555620796583367, -0.02572333512354376, 0.19473855085953168, 0.2153937942360823, 0.14866071012731868, 0.27214623138901184, -0.4490369544082293, -0.21844083253227203, 0.0511010983239182, 0.15185368583876302, 0.05405901652193279, -0.018959299756357777, -0.3032433227177314, 0.1461492955010423, -0.22085706725942367, 0.03728899651094142, -0.15842813110176587, -0.026787215995489423, 0.0015735181055567932, -0.2620744113669251, 0.017919078269738802, 0.07724810653775366, 0.02515608150861226, -0.007731431781201426, -0.17924644042751892, 0.004738980052273043, 0.13281500578115368, -0.023767775313568894, 0.06510174015508682, 0.11765043579031374, -0.18418041310823438, -0.13495852199919295, 0.34145308980915806, -0.08563617515932437, -0.19309335249955906, 0.2238962178962538, -0.021813296878738613, -0.15325053354062027, 0.05616754638895421, 0.21114254353398626, 0.11505132591154313, -0.12425827483688905, -0.021235177629877755, -0.03076637414933154, 0.18952889648657714, 0.0818934173122133, 0.04458471129041617, 0.11114975633090855, 0.2784706265453927, 0.07908770718186685, 0.14917498845677596, -0.12822795930057482, -0.059393666334499634, -0.19246866559666215, -0.1324473730584776, -0.15061964531372668, -0.0120123035449069, -0.10851839648934071, -0.10008718626693625, 0.4234138564982762, 0.24030287546162127, 0.22524524259268108, 0.10901166711471777, 0.3192459811795164, 0.019002461999083276, 0.1938209756273974, 0.12920604322712417, 0.16944779539379384, 0.07729891494664391, 0.08269580942578614, -0.12941037348619747, 0.025078619198845416, 0.07051782872330284] |
1,803.02743 | Adapting Everyday Manipulation Skills to Varied Scenarios | We address the problem of executing tool-using manipulation skills in
scenarios where the objects to be used may vary. We assume that point clouds of
the tool and target object can be obtained, but no interpretation or further
knowledge about these objects is provided. The system must interpret the point
clouds and decide how to use the tool to complete a manipulation task with a
target object; this means it must adjust motion trajectories appropriately to
complete the task. We tackle three everyday manipulations: scraping material
from a tool into a container, cutting, and scooping from a container. Our
solution encodes these manipulation skills in a generic way, with parameters
that can be filled in at run-time via queries to a robot perception module; the
perception module abstracts the functional parts for the tool and extracts key
parameters that are needed for the task. The approach is evaluated in
simulation and with selected examples on a PR2 robot.
| cs.RO | we address the problem of executing toolusing manipulation skills in scenarios where the objects to be used may vary we assume that point clouds of the tool and target object can be obtained but no interpretation or further knowledge about these objects is provided the system must interpret the point clouds and decide how to use the tool to complete a manipulation task with a target object this means it must adjust motion trajectories appropriately to complete the task we tackle three everyday manipulations scraping material from a tool into a container cutting and scooping from a container our solution encodes these manipulation skills in a generic way with parameters that can be filled in at runtime via queries to a robot perception module the perception module abstracts the functional parts for the tool and extracts key parameters that are needed for the task the approach is evaluated in simulation and with selected examples on a pr2 robot | [['we', 'address', 'the', 'problem', 'of', 'executing', 'toolusing', 'manipulation', 'skills', 'in', 'scenarios', 'where', 'the', 'objects', 'to', 'be', 'used', 'may', 'vary', 'we', 'assume', 'that', 'point', 'clouds', 'of', 'the', 'tool', 'and', 'target', 'object', 'can', 'be', 'obtained', 'but', 'no', 'interpretation', 'or', 'further', 'knowledge', 'about', 'these', 'objects', 'is', 'provided', 'the', 'system', 'must', 'interpret', 'the', 'point', 'clouds', 'and', 'decide', 'how', 'to', 'use', 'the', 'tool', 'to', 'complete', 'a', 'manipulation', 'task', 'with', 'a', 'target', 'object', 'this', 'means', 'it', 'must', 'adjust', 'motion', 'trajectories', 'appropriately', 'to', 'complete', 'the', 'task', 'we', 'tackle', 'three', 'everyday', 'manipulations', 'scraping', 'material', 'from', 'a', 'tool', 'into', 'a', 'container', 'cutting', 'and', 'scooping', 'from', 'a', 'container', 'our', 'solution', 'encodes', 'these', 'manipulation', 'skills', 'in', 'a', 'generic', 'way', 'with', 'parameters', 'that', 'can', 'be', 'filled', 'in', 'at', 'runtime', 'via', 'queries', 'to', 'a', 'robot', 'perception', 'module', 'the', 'perception', 'module', 'abstracts', 'the', 'functional', 'parts', 'for', 'the', 'tool', 'and', 'extracts', 'key', 'parameters', 'that', 'are', 'needed', 'for', 'the', 'task', 'the', 'approach', 'is', 'evaluated', 'in', 'simulation', 'and', 'with', 'selected', 'examples', 'on', 'a', 'pr2', 'robot']] | [-0.06248124193527612, 0.05650570245954809, -0.12362350272368404, 0.042341904204097114, -0.148496010337803, -0.15067844750666165, 0.06148269990034684, 0.4265776310953064, -0.279593137128255, -0.36556414697507894, 0.09965121237151443, -0.25033066649862296, -0.1510604878937637, 0.22246454540445598, -0.11349223628993842, 0.05214793955070214, 0.11967871476998523, 0.05004697363039691, 0.010364448597147777, -0.21656220004292606, 0.3044430668144546, 0.008133443735563491, 0.213957419035414, 0.030804178096896298, 0.13502958523333544, 0.018109883905294104, -0.010390006453741956, 0.023860722181941324, -0.0678542600096851, 0.14422667600270478, 0.3166890902403459, 0.18830990671074088, 0.28075698116216574, -0.4399480565062052, -0.1783957707377363, 0.06480363488220904, 0.1350414887854617, 0.10610253211771008, -0.02756332827045264, -0.31880811400287135, 0.1127129405047273, -0.15726067335639574, -0.1112694542625141, -0.1100645903203212, 0.010318831045510648, -0.030575130069982026, -0.2674267258365415, -0.05722926452437628, 0.04364114007662062, 0.05776621014118501, -0.07934925655091676, -0.042943677099427514, 0.013678673417543214, 0.2333128404364438, 0.0010535404140636607, 0.044202346377563956, 0.20784883690066636, -0.169840977960443, -0.11754804163216319, 0.4224149131723031, 0.019280123309220507, -0.24926274627317452, 0.21196240869562932, -0.08101650399430006, -0.12138675029766804, 0.09282282856587745, 0.18661138971035568, 0.14183294699421223, -0.1720185932309862, 0.01818194101333229, -0.024425816613166958, 0.2166937390376248, 0.047043741265123215, -0.035995902122982745, 0.25785858681590496, 0.1851693814129663, 0.047583983721848154, 0.16181054772423062, -0.05836700999378404, -0.0629027501998257, -0.28327556270398674, -0.17360169044253712, -0.17469169175446836, -0.013704497877013269, -0.05331434627073519, -0.09686423251162213, 0.3737781568418575, 0.19306918844076676, 0.20520674524817004, 0.025882774119595466, 0.33389578502672385, 0.052391491909187196, 0.08641386356299059, 0.0910227301849577, 0.14660172462404433, 0.011208988424048676, 0.11238638893701136, -0.15549693340023013, 0.09852208962658114, 0.04272638458782171] |
1,803.02744 | Towards a Multi Target Quantum Computational Logic | Unlike the standard Quantum Computational Logic (QCL), where the carrier of
information (target) is conventionally assumed to be only the last qubit over a
sequence of many qubits, here we propose an extended version of the QCL (we
call Multi Target Quantum Computational Logic, briefly MTQCL) where the number
and the position of the target qubits are arbitrary.
| quant-ph | unlike the standard quantum computational logic qcl where the carrier of information target is conventionally assumed to be only the last qubit over a sequence of many qubits here we propose an extended version of the qcl we call multi target quantum computational logic briefly mtqcl where the number and the position of the target qubits are arbitrary | [['unlike', 'the', 'standard', 'quantum', 'computational', 'logic', 'qcl', 'where', 'the', 'carrier', 'of', 'information', 'target', 'is', 'conventionally', 'assumed', 'to', 'be', 'only', 'the', 'last', 'qubit', 'over', 'a', 'sequence', 'of', 'many', 'qubits', 'here', 'we', 'propose', 'an', 'extended', 'version', 'of', 'the', 'qcl', 'we', 'call', 'multi', 'target', 'quantum', 'computational', 'logic', 'briefly', 'mtqcl', 'where', 'the', 'number', 'and', 'the', 'position', 'of', 'the', 'target', 'qubits', 'are', 'arbitrary']] | [-0.1060418466498193, 0.17091218737722988, -0.014805920422077179, 0.026697722845710814, -0.04151582190146049, -0.19997559584219726, 0.04402980655472595, 0.3911507862309615, -0.2801005916114439, -0.27509321010949317, 0.08050797757153448, -0.22208919595077373, -0.07725199678782046, 0.20165094455475346, -0.11821049751648516, 0.06745292812692034, 0.0012731314718461874, 0.12472626276052835, -0.058667108857710114, -0.2414620740241126, 0.27097357575896014, 0.019291951055556797, 0.2605287044374436, -0.020326353005019195, 0.12756077350493064, 0.052457952659511774, 0.03708282067326077, -0.027171379576126736, -0.08778487851745204, 0.1342455488711334, 0.30629534954041765, 0.146775085609733, 0.3017962988988872, -0.466788596914787, -0.189168255629116, 0.08889831580515754, 0.13324071779814467, 0.20545907503222688, 0.0026324356889777015, -0.28518897803140836, 0.05170588094634902, -0.19391665235774494, -0.014308326109720949, -0.002500042907501522, -0.006071128849789761, 0.028266622546014555, -0.2041661034812007, -0.04957943524054268, 0.08528143273699179, 0.030562490584296092, 0.029380477002919896, -0.07271678376485381, 0.03398761697309582, 0.09227940598666146, -0.07622085479619145, 0.04397840604896804, 0.17658254710075103, -0.11074438425426356, -0.18036690723608462, 0.33263572674702135, -0.01058961118963596, -0.22801201284062445, 0.14683478910541325, -0.10446729600887027, -0.11883140628618237, 0.08498163351364303, 0.11601747676991579, 0.13634369706963761, -0.1426078552837696, 0.1351117126045242, -0.023561610464464155, 0.2813556354100767, 0.06154012220111071, 0.1514606631377287, 0.18723901709247576, 0.19701089599708976, 0.06065152596841615, 0.17502584010811947, -0.13581697177141905, -0.1671652391618281, -0.32610682051694184, -0.19863089056187228, -0.22862290264630133, 0.05463471677023591, -0.04781881277832374, -0.15337365186005308, 0.4115440994501114, 0.16487492837028153, 0.14906917683159313, 0.03846684408684572, 0.32197183273373203, 0.15343669164729745, 0.05753691945421068, 0.046513529273828395, 0.17875267415748616, 0.13418631322616548, 0.06895934271405597, -0.20333270509645604, 0.039116272629287685, 0.004327129478680722] |
1,803.02745 | Distribution of primordial black holes and 21cm signature | We show that the number of primordial black holes (PBHs) which is originated
from primordial density perturbations with moderately-tilted power spectrum
fluctuates following the log-normal distribution, while it follows the Poisson
distribution if the spectrum is steeply blue. The log-normal, as well as the
Poisson, fluctuation of the PBH number behaves as an isocurvature mode and
affects the matter power spectrum and the halo mass function in a different way
from those for the Poisson case. The future 21cm observation can potentially
put a stronger constraint on the PBH fraction than the current one in a wide
mass range, $10^{-5}M_\odot$--$10M_\odot$.
| astro-ph.CO gr-qc hep-ph | we show that the number of primordial black holes pbhs which is originated from primordial density perturbations with moderatelytilted power spectrum fluctuates following the lognormal distribution while it follows the poisson distribution if the spectrum is steeply blue the lognormal as well as the poisson fluctuation of the pbh number behaves as an isocurvature mode and affects the matter power spectrum and the halo mass function in a different way from those for the poisson case the future 21cm observation can potentially put a stronger constraint on the pbh fraction than the current one in a wide mass range 105m_odot10m_odot | [['we', 'show', 'that', 'the', 'number', 'of', 'primordial', 'black', 'holes', 'pbhs', 'which', 'is', 'originated', 'from', 'primordial', 'density', 'perturbations', 'with', 'moderatelytilted', 'power', 'spectrum', 'fluctuates', 'following', 'the', 'lognormal', 'distribution', 'while', 'it', 'follows', 'the', 'poisson', 'distribution', 'if', 'the', 'spectrum', 'is', 'steeply', 'blue', 'the', 'lognormal', 'as', 'well', 'as', 'the', 'poisson', 'fluctuation', 'of', 'the', 'pbh', 'number', 'behaves', 'as', 'an', 'isocurvature', 'mode', 'and', 'affects', 'the', 'matter', 'power', 'spectrum', 'and', 'the', 'halo', 'mass', 'function', 'in', 'a', 'different', 'way', 'from', 'those', 'for', 'the', 'poisson', 'case', 'the', 'future', '21cm', 'observation', 'can', 'potentially', 'put', 'a', 'stronger', 'constraint', 'on', 'the', 'pbh', 'fraction', 'than', 'the', 'current', 'one', 'in', 'a', 'wide', 'mass', 'range', '105m_odot10m_odot']] | [-0.12353218863813245, 0.17757145720857734, -0.10433145564961799, 0.13762441245430357, -0.07474103881217235, -0.045344587648287416, -0.012488198689926339, 0.2812202467241001, -0.2451602079981596, -0.34037790479309554, 0.02930337810480245, -0.31674027929975823, -0.07078170183361793, 0.22315678589654211, -0.012918298788444728, 0.018136683274155522, -0.01294339590762951, 0.04357928840671571, -0.017302329331275304, -0.20915243580785334, 0.3523883340792369, 0.14729709773115357, 0.26959926224484737, -0.022144651111709525, 0.0055279041193805785, -0.024669191339148248, -0.0232430019187836, -0.0067621598932511955, -0.10706701170784072, -0.0028391873549517927, 0.15461604540014748, 0.14453321518447745, 0.21796132816115812, -0.37645298628402607, -0.2557265548871792, 0.16040535696440053, 0.16759406807547322, 0.07087766334571287, -0.08752235337944549, -0.23163945338812333, 0.07885404386526752, -0.25441474242287937, -0.1204543353096411, 0.03925697450354999, 0.02394503318913737, 0.038196712722217814, -0.2626421830084707, 0.161392913470805, 0.039301987444003095, -0.10086332645020163, -0.05253586592390297, -0.1329312391379582, -0.10310744521046551, 0.04382339898230774, 0.09602485693592046, 0.005041394044160463, 0.2515531446765728, -0.13909920815102833, 0.01174652857031217, 0.4120864414191824, -0.1388619384731045, -0.10215296301686642, 0.09801037583918291, -0.23433230133080968, -0.17607649364413655, 0.10293143771455757, 0.13036786858705157, 0.08999744762799569, -0.08269419967035326, 0.08950842935853276, -0.02254792140934578, 0.21468930590745747, 0.09062050766672711, 0.06243668681447755, 0.3763198312039354, 0.11735188934419837, 0.13355396246081408, 0.09155051062377739, -0.12338152482906091, -0.06490929957897383, -0.25855432919283605, -0.07030238653354974, -0.22115143660392983, 0.11905399669075803, -0.15633582999206347, -0.17551269044396373, 0.39335785424146724, 0.08752163698687693, 0.27191345198572925, 0.11480755094861687, 0.322009431760901, 0.19080205539144024, 0.01174382642576737, 0.06665261262761694, 0.24415472472960853, 0.14436633591492642, 0.12078986111291855, -0.16604699658191935, 0.03681139221262871, -0.055261954857625674] |
1,803.02746 | Collisions of fat points and applications to interpolation theory | We address the problem to determine the limit of the collision of fat points
in $\mathbb{P}^n. We give a description of the limit scheme in many cases, in
particular in low dimension and multiplicities. The problem turns out to be
closely related with interpolation theory, and as an application we exploit
collisions to prove some new cases of Laface-Ugaglia Conjecture.
| math.AG | we address the problem to determine the limit of the collision of fat points in mathbbpn we give a description of the limit scheme in many cases in particular in low dimension and multiplicities the problem turns out to be closely related with interpolation theory and as an application we exploit collisions to prove some new cases of lafaceugaglia conjecture | [['we', 'address', 'the', 'problem', 'to', 'determine', 'the', 'limit', 'of', 'the', 'collision', 'of', 'fat', 'points', 'in', 'mathbbpn', 'we', 'give', 'a', 'description', 'of', 'the', 'limit', 'scheme', 'in', 'many', 'cases', 'in', 'particular', 'in', 'low', 'dimension', 'and', 'multiplicities', 'the', 'problem', 'turns', 'out', 'to', 'be', 'closely', 'related', 'with', 'interpolation', 'theory', 'and', 'as', 'an', 'application', 'we', 'exploit', 'collisions', 'to', 'prove', 'some', 'new', 'cases', 'of', 'lafaceugaglia', 'conjecture']] | [-0.11458680520654987, 0.021796252067700046, -0.10822185171719727, 0.09508048332596229, -0.0006855470641374083, -0.10601413567250563, 0.024815687221096103, 0.30850275337569794, -0.3036007407216071, -0.2507205450812639, 0.10506992095734104, -0.2729275547307364, -0.1426119100207747, 0.2106547896706862, -0.1313269633515659, 0.04915632414868323, 0.0655581039392342, 0.054144593468725175, -0.05311665808687271, -0.29513536459939965, 0.34632218850902835, 0.023589977710428884, 0.23308261588089546, 0.145441910488752, 0.08843396179441174, 0.023850686635064372, -0.002444568232206975, 0.024378294484742612, -0.16473935920966126, 0.11392921237403258, 0.30766210250430187, 0.0933902688024534, 0.22463237135907857, -0.39602124470017724, -0.15006132124749533, 0.16487316967193352, 0.17777286729601732, 0.11510561624841796, 0.016893056801409793, -0.18878671787363493, 0.12212273420892276, -0.1552995942154173, -0.2416725237617048, -0.09077702388483083, -0.005926920393071437, 0.013272277347869793, -0.27241509700572847, 0.035661914362177506, 0.07150315886493615, 0.05141133434628531, -0.05133842037580276, -0.07267796206070994, 0.04346005340753976, 0.09061337576318784, 0.08438542021154347, -0.0060341094178542245, 0.03162319247089958, -0.15049733523224182, -0.13378585736914458, 0.41568940021571216, 0.007996107814675671, -0.21947035357608632, 0.19316824895361343, -0.1574957548972156, -0.18057296500872758, 0.09278806030623994, 0.19815303486282543, 0.15355302522751163, -0.08627679596765567, 0.11499021191522873, -0.0802980032512697, 0.08893188120702565, 0.1306335505540088, 0.04863686916434159, 0.14940981905102352, 0.1311233775271892, 0.11020489715304131, 0.1882554003159847, -0.06369561752525427, -0.08272021825788385, -0.3405150091749127, -0.16742899302014355, -0.13228968859223997, 0.059767356639633236, -0.08111100626460245, -0.1561309407954499, 0.338363102240815, 0.17171403069554245, 0.29223038485052727, 0.0256298686361919, 0.22301136677042913, 0.15211116888568246, -0.006331141383517376, 0.0823725259594493, 0.19430870277327644, 0.16184988769434266, 0.06385449187482818, -0.15895250916354736, -0.021324134076613994, 0.13551641003844345] |
1,803.02747 | Relativistic magnetised perturbations: magnetic pressure vs magnetic
tension | We study the linear evolution of magnetised cosmological perturbations in the
post-recombination epoch. Using full general relativity and adopting the ideal
magnetohydrodynamic approximation, we refine and extend the previous
treatments. More specifically, this is the first relativistic study that
accounts for the effects of the magnetic tension, in addition to those of the
field's pressure. Our solutions show that on sufficiently large scales, larger
than the (purely magnetic) Jeans length, the perturbations evolve essentially
unaffected by the magnetic presence. The magnetic pressure dominates on small
scales, where it forces the perturbations to oscillate and decay. Close to the
Jeans length, however, the field's tension takes over and leads to a weak
growth of the inhomogeneities. These solutions clearly demonstrate the opposing
action of the aforementioned two magnetic agents, namely of the field's
pressure and tension, on the linear evolution of cosmological density
perturbations.
| astro-ph.CO gr-qc | we study the linear evolution of magnetised cosmological perturbations in the postrecombination epoch using full general relativity and adopting the ideal magnetohydrodynamic approximation we refine and extend the previous treatments more specifically this is the first relativistic study that accounts for the effects of the magnetic tension in addition to those of the fields pressure our solutions show that on sufficiently large scales larger than the purely magnetic jeans length the perturbations evolve essentially unaffected by the magnetic presence the magnetic pressure dominates on small scales where it forces the perturbations to oscillate and decay close to the jeans length however the fields tension takes over and leads to a weak growth of the inhomogeneities these solutions clearly demonstrate the opposing action of the aforementioned two magnetic agents namely of the fields pressure and tension on the linear evolution of cosmological density perturbations | [['we', 'study', 'the', 'linear', 'evolution', 'of', 'magnetised', 'cosmological', 'perturbations', 'in', 'the', 'postrecombination', 'epoch', 'using', 'full', 'general', 'relativity', 'and', 'adopting', 'the', 'ideal', 'magnetohydrodynamic', 'approximation', 'we', 'refine', 'and', 'extend', 'the', 'previous', 'treatments', 'more', 'specifically', 'this', 'is', 'the', 'first', 'relativistic', 'study', 'that', 'accounts', 'for', 'the', 'effects', 'of', 'the', 'magnetic', 'tension', 'in', 'addition', 'to', 'those', 'of', 'the', 'fields', 'pressure', 'our', 'solutions', 'show', 'that', 'on', 'sufficiently', 'large', 'scales', 'larger', 'than', 'the', 'purely', 'magnetic', 'jeans', 'length', 'the', 'perturbations', 'evolve', 'essentially', 'unaffected', 'by', 'the', 'magnetic', 'presence', 'the', 'magnetic', 'pressure', 'dominates', 'on', 'small', 'scales', 'where', 'it', 'forces', 'the', 'perturbations', 'to', 'oscillate', 'and', 'decay', 'close', 'to', 'the', 'jeans', 'length', 'however', 'the', 'fields', 'tension', 'takes', 'over', 'and', 'leads', 'to', 'a', 'weak', 'growth', 'of', 'the', 'inhomogeneities', 'these', 'solutions', 'clearly', 'demonstrate', 'the', 'opposing', 'action', 'of', 'the', 'aforementioned', 'two', 'magnetic', 'agents', 'namely', 'of', 'the', 'fields', 'pressure', 'and', 'tension', 'on', 'the', 'linear', 'evolution', 'of', 'cosmological', 'density', 'perturbations']] | [-0.18390710989478976, 0.18028838116630025, -0.07425866399869693, 0.09099778000564947, -0.06325451042047227, -0.03673713170708372, -0.04449829861596617, 0.2882686995582043, -0.26893216132518505, -0.2904704352059252, 0.0665417329597098, -0.2425508933285108, -0.0771916927183633, 0.16946574064440556, 0.05348704807896662, 0.0056868346922516405, 0.014406393698931158, 0.012802312339467185, -0.05155258720831855, -0.2536660509796201, 0.38983612476320534, 0.09006839877945351, 0.2551844743034848, 0.01214292710795559, 0.060221891573441405, -0.04305933044337622, -0.02728329519773801, 0.10515426404096863, -0.17523666152494904, 0.03120184764005504, 0.12862894720995435, 0.032882843081924046, 0.2699821463760015, -0.4848114101906548, -0.26340347879494613, 0.06558536237978435, 0.11876040625620399, 0.17612916012978427, -0.03268770872376341, -0.2518780280158601, 0.07162159618146562, -0.11242951444916792, -0.11623822404657835, -0.054742365184083736, 0.023585972157990808, 0.025754513200681815, -0.28401782551220245, 0.1373499206176119, 0.06443106253074574, 0.017421902811897177, -0.148807030224072, -0.0670853802410013, -0.018158905255328213, 0.09858847964372668, 0.13281468897764864, 0.031905862414831676, 0.17917642367261272, -0.15683484813882284, -0.028052443110097487, 0.394432658687807, -0.11654639806831663, -0.15652648082745452, 0.20664633552615458, -0.20285035052232547, -0.10015039141000887, 0.12408274642706334, 0.1762648553594009, 0.12667022559179605, -0.07936763277902574, 0.09456406642928707, 0.010566036896682443, 0.17676593002478977, 0.08808733173157576, -0.016756450146407385, 0.24433074417113737, 0.1315077731281623, 0.05820241900017628, 0.10037971944776136, -0.08549613349458815, -0.09241204974208991, -0.3026126540051057, -0.10347163640581385, -0.1229889453681824, 0.057020743172355254, -0.13444556714427555, -0.19330286380828365, 0.3845930905895425, 0.2062379931607707, 0.1692578128402258, 0.07369433450545151, 0.32033172669214804, 0.08367315945264368, 0.07965320561706395, 0.11464178690465389, 0.3205730064505047, 0.1735675046774005, 0.08956716037550745, -0.29723153397493013, 0.040605015626138115, 0.010518544611612243] |
1,803.02748 | Four-Photon Kapitza-Dirac Effect as Electron Spin Filter | We theoretically demonstrate the feasibility of producing electron beam
splitter using Kapitza-Dirac diffraction on bichromatic standing waves which
are created by the fundamental frequency and the third harmonic. The
relativistic electron in Bragg regime absorbs three photons with frequency of w
and emits a photon with frequency of 3w, four-photon Kapitza-Dirac effect. In
this four-photon Kapitza-Dirac effect distinct spin effects arise in different
polarizations of the third harmonic laser beam. It is shown that the shape of
Rabi oscillation between initial and scattered states is changed and finds two
unequal peaks. In circular polarization for fundamental and third harmonic,
despite Rabi oscillation, the spin down electron in 0.56 fs intervals maintains
its momentum and spin. Also we present an electron spin filter with combination
of a linearly polarized fundamental laser beam and a third harmonic with
circular polarization that scatters the electron beam according to its spin
state.
| physics.atom-ph quant-ph | we theoretically demonstrate the feasibility of producing electron beam splitter using kapitzadirac diffraction on bichromatic standing waves which are created by the fundamental frequency and the third harmonic the relativistic electron in bragg regime absorbs three photons with frequency of w and emits a photon with frequency of 3w fourphoton kapitzadirac effect in this fourphoton kapitzadirac effect distinct spin effects arise in different polarizations of the third harmonic laser beam it is shown that the shape of rabi oscillation between initial and scattered states is changed and finds two unequal peaks in circular polarization for fundamental and third harmonic despite rabi oscillation the spin down electron in 056 fs intervals maintains its momentum and spin also we present an electron spin filter with combination of a linearly polarized fundamental laser beam and a third harmonic with circular polarization that scatters the electron beam according to its spin state | [['we', 'theoretically', 'demonstrate', 'the', 'feasibility', 'of', 'producing', 'electron', 'beam', 'splitter', 'using', 'kapitzadirac', 'diffraction', 'on', 'bichromatic', 'standing', 'waves', 'which', 'are', 'created', 'by', 'the', 'fundamental', 'frequency', 'and', 'the', 'third', 'harmonic', 'the', 'relativistic', 'electron', 'in', 'bragg', 'regime', 'absorbs', 'three', 'photons', 'with', 'frequency', 'of', 'w', 'and', 'emits', 'a', 'photon', 'with', 'frequency', 'of', '3w', 'fourphoton', 'kapitzadirac', 'effect', 'in', 'this', 'fourphoton', 'kapitzadirac', 'effect', 'distinct', 'spin', 'effects', 'arise', 'in', 'different', 'polarizations', 'of', 'the', 'third', 'harmonic', 'laser', 'beam', 'it', 'is', 'shown', 'that', 'the', 'shape', 'of', 'rabi', 'oscillation', 'between', 'initial', 'and', 'scattered', 'states', 'is', 'changed', 'and', 'finds', 'two', 'unequal', 'peaks', 'in', 'circular', 'polarization', 'for', 'fundamental', 'and', 'third', 'harmonic', 'despite', 'rabi', 'oscillation', 'the', 'spin', 'down', 'electron', 'in', '056', 'fs', 'intervals', 'maintains', 'its', 'momentum', 'and', 'spin', 'also', 'we', 'present', 'an', 'electron', 'spin', 'filter', 'with', 'combination', 'of', 'a', 'linearly', 'polarized', 'fundamental', 'laser', 'beam', 'and', 'a', 'third', 'harmonic', 'with', 'circular', 'polarization', 'that', 'scatters', 'the', 'electron', 'beam', 'according', 'to', 'its', 'spin', 'state']] | [-0.16155777688765885, 0.2922678970759522, -0.04266770693750398, 0.012014931798566485, -0.012306057492497604, -0.1584703697464303, 0.02476576722472453, 0.45155106250800797, -0.25747170085339127, -0.2549846213644471, -0.036680496842883575, -0.2929988357276228, -0.016020446675955445, 0.25516482080392716, 0.06461035420589552, 0.05936662407160888, 0.01986821331838901, -0.04335753653651556, -0.020327966147404467, -0.13161699444911368, 0.2974943669852675, 0.05516259112030368, 0.3112585224255265, 0.05255923920147423, 0.18126739718718454, 0.10503166026398036, 0.03909463651881025, -0.08231389305655211, -0.04784227449596762, 0.06371502961603157, 0.20107951553104245, 0.004500013329832016, 0.20067866874317564, -0.40754710656364224, -0.1657534416173459, 0.026606553246745386, 0.12108286068541929, 0.17972709864890832, -0.07059133914063333, -0.25729250804068066, -0.05401876589560227, -0.14443732007497898, -0.16617272924191342, -0.020596015617893253, 0.018134169966435514, 0.0500461084994714, -0.2554315423114678, 0.097407420485389, 0.07814186989373804, 0.01584596700362257, -0.005842766301341455, -0.06854633188561059, -0.07164304862679863, 0.013926495175739448, 0.03573977396307463, 0.04254134028608835, 0.13872580125462264, -0.07635392931547973, -0.15700257733791462, 0.3774199955215728, -0.10124047595230434, -0.13955393617318287, 0.10705195696130898, -0.2947347296316907, -0.019419018622815004, 0.17328050118443128, 0.13906246960804974, 0.08731180925560938, -0.07490142681903357, 0.005922019091903584, -0.023783767866474147, 0.23211570123345843, 0.2210149708191386, 0.09257520473958622, 0.28141518023708284, 0.14412050271671065, 0.060742794510883255, 0.17163062558786288, -0.18878006872155556, -0.015118691191624699, -0.24167228449840802, -0.060128765435168846, -0.1920829305072894, 0.058471599578026785, -0.004784403903023623, -0.1035049845898332, 0.4772905336906882, 0.08187016701275432, 0.12239450088551117, -0.06998489386122045, 0.3439601494150387, 0.17596657045273664, -0.007306479207063849, 0.0025906697532313097, 0.3142541961530475, 0.21408073195237415, 0.0856013290988788, -0.3364968520236781, -0.05942266243761657, -0.030255398401759274] |
1,803.02749 | Quantum-inspired Minimum Distance Classification in Biomedical Context | We face the problem of pattern classification by proposing a quantum-inspired
version of the widely used minimum distance classifier (i.e. the Nearest Mean
Classifier (NMC)) already introduced in [31,33,28,27] and by applying this
quantum-inspired classifier in a biomedical context. In particular, we show and
compare the NMC and our quantum model performance to solve a problem related to
classify the probability of survival for patients affected by idiopathic
pulmonary fibrosis (IPF).
| quant-ph | we face the problem of pattern classification by proposing a quantuminspired version of the widely used minimum distance classifier ie the nearest mean classifier nmc already introduced in 31332827 and by applying this quantuminspired classifier in a biomedical context in particular we show and compare the nmc and our quantum model performance to solve a problem related to classify the probability of survival for patients affected by idiopathic pulmonary fibrosis ipf | [['we', 'face', 'the', 'problem', 'of', 'pattern', 'classification', 'by', 'proposing', 'a', 'quantuminspired', 'version', 'of', 'the', 'widely', 'used', 'minimum', 'distance', 'classifier', 'ie', 'the', 'nearest', 'mean', 'classifier', 'nmc', 'already', 'introduced', 'in', '31332827', 'and', 'by', 'applying', 'this', 'quantuminspired', 'classifier', 'in', 'a', 'biomedical', 'context', 'in', 'particular', 'we', 'show', 'and', 'compare', 'the', 'nmc', 'and', 'our', 'quantum', 'model', 'performance', 'to', 'solve', 'a', 'problem', 'related', 'to', 'classify', 'the', 'probability', 'of', 'survival', 'for', 'patients', 'affected', 'by', 'idiopathic', 'pulmonary', 'fibrosis', 'ipf']] | [-0.007426356085176979, -0.017105652205646037, -0.03647903000403728, 0.09789422736336877, -0.020711806190333196, -0.1656741848681122, 0.06644527804039951, 0.3647752562371482, -0.27721156792582147, -0.2801368226829384, 0.1008964130937654, -0.2852093169731753, -0.2291797454734998, 0.17169022270432574, -0.1612827853549139, 0.10595146490793143, 0.08815659885959966, 0.08201051008821066, -0.02383304564282298, -0.3010665897812162, 0.31618993605620094, 0.06790550733484062, 0.3422361622963633, 0.006294444866944105, 0.11323074041865766, 0.0579014703980647, -0.050818243782435144, 0.06975595726232443, -0.09815439195372164, 0.15464453440093037, 0.2680250150284597, 0.17675335832121034, 0.32387243013030714, -0.342966503277421, -0.22791780629195274, 0.1387052227476878, 0.11442107439839415, 0.10455788483044931, -0.032358078219528706, -0.3415779512641685, 0.10522287059575319, -0.16424215510487555, -0.07248711696759398, -0.037890740964628224, -0.028576198646000455, -0.011013958197353142, -0.2813877735153905, 0.10422222942246923, 0.011678538777466331, 0.06585247977636755, -0.07221897760006998, -0.12741277471983006, 0.04587496045777308, 0.10769111771868276, 0.027513409633788146, 0.10538760131624128, 0.09661194993449108, -0.163582391428229, -0.18992158525756428, 0.35141867997923065, -0.05631497318723372, -0.20480006406349796, 0.1597195429461343, -0.01771505451761186, -0.1217132539222283, 0.03405642176845244, 0.233248335908034, 0.10622536897925394, -0.21591170837304421, 0.018152130060064206, 0.006814162429821279, 0.14003207893776043, 0.07389003896553602, -0.10415435760681119, 0.1441646877310372, 0.2221835409257827, 0.012283691990056208, 0.19276192043907941, -0.13644949926861694, -0.06626680549234151, -0.19107602475477117, -0.13562716492451726, -0.17432515874970705, -0.033007825698171345, -0.07318943027078473, -0.16883664367986576, 0.4063886469230056, 0.19704933099980865, 0.19782452411683543, 0.07789434085467033, 0.25698107940344406, 0.05235236229408266, 0.08074776339760449, 0.07365938263413097, 0.1875602370726743, 0.10942360214290342, 0.038099369393395525, -0.2387931409508123, 0.12010317740828863, 0.1211263920712684] |
1,803.0275 | Efficient Synchronization of State-based CRDTs | To ensure high availability in large scale distributed systems, Conflict-free
Replicated Data Types (CRDTs) relax consistency by allowing immediate query and
update operations at the local replica, with no need for remote
synchronization. State-based CRDTs synchronize replicas by periodically sending
their full state to other replicas, which can become extremely costly as the
CRDT state grows. Delta-based CRDTs address this problem by producing small
incremental states (deltas) to be used in synchronization instead of the full
state. However, current synchronisation algorithms for Delta-based CRDTs induce
redundant wasteful delta propagation, performing worse than expected, and
surprisingly, no better than State-based. In this paper we: 1) identify two
sources of inefficiency in current synchronization algorithms for delta-based
CRDTs; 2) bring the concept of join decomposition to state-based CRDTs; 3)
exploit join decompositions to obtain optimal deltas and 4) improve the
efficiency of synchronization algorithms; and finally, 5) evaluate the improved
algorithms.
| cs.DC cs.DS | to ensure high availability in large scale distributed systems conflictfree replicated data types crdts relax consistency by allowing immediate query and update operations at the local replica with no need for remote synchronization statebased crdts synchronize replicas by periodically sending their full state to other replicas which can become extremely costly as the crdt state grows deltabased crdts address this problem by producing small incremental states deltas to be used in synchronization instead of the full state however current synchronisation algorithms for deltabased crdts induce redundant wasteful delta propagation performing worse than expected and surprisingly no better than statebased in this paper we 1 identify two sources of inefficiency in current synchronization algorithms for deltabased crdts 2 bring the concept of join decomposition to statebased crdts 3 exploit join decompositions to obtain optimal deltas and 4 improve the efficiency of synchronization algorithms and finally 5 evaluate the improved algorithms | [['to', 'ensure', 'high', 'availability', 'in', 'large', 'scale', 'distributed', 'systems', 'conflictfree', 'replicated', 'data', 'types', 'crdts', 'relax', 'consistency', 'by', 'allowing', 'immediate', 'query', 'and', 'update', 'operations', 'at', 'the', 'local', 'replica', 'with', 'no', 'need', 'for', 'remote', 'synchronization', 'statebased', 'crdts', 'synchronize', 'replicas', 'by', 'periodically', 'sending', 'their', 'full', 'state', 'to', 'other', 'replicas', 'which', 'can', 'become', 'extremely', 'costly', 'as', 'the', 'crdt', 'state', 'grows', 'deltabased', 'crdts', 'address', 'this', 'problem', 'by', 'producing', 'small', 'incremental', 'states', 'deltas', 'to', 'be', 'used', 'in', 'synchronization', 'instead', 'of', 'the', 'full', 'state', 'however', 'current', 'synchronisation', 'algorithms', 'for', 'deltabased', 'crdts', 'induce', 'redundant', 'wasteful', 'delta', 'propagation', 'performing', 'worse', 'than', 'expected', 'and', 'surprisingly', 'no', 'better', 'than', 'statebased', 'in', 'this', 'paper', 'we', '1', 'identify', 'two', 'sources', 'of', 'inefficiency', 'in', 'current', 'synchronization', 'algorithms', 'for', 'deltabased', 'crdts', '2', 'bring', 'the', 'concept', 'of', 'join', 'decomposition', 'to', 'statebased', 'crdts', '3', 'exploit', 'join', 'decompositions', 'to', 'obtain', 'optimal', 'deltas', 'and', '4', 'improve', 'the', 'efficiency', 'of', 'synchronization', 'algorithms', 'and', 'finally', '5', 'evaluate', 'the', 'improved', 'algorithms']] | [-0.17402112490853808, 0.09767810207472852, -0.012178528607016641, 0.0860195151989617, -0.0748733778565422, -0.2213961053405257, 0.1503743293652961, 0.3639275720655518, -0.2984512854748774, -0.3426832915752526, 0.14594957945968381, -0.24926591821439914, -0.05394895400714454, 0.11352786507876278, -0.09601213542850776, 0.0869254391490413, 0.10023721820993611, 0.025250494303556796, -0.06328967776799561, -0.25186289557812097, 0.24313244285474486, 0.027966699778608627, 0.30362798587884754, -0.05130110227271614, 0.05232565868536523, 0.04098906973064346, -0.02883295071055025, 0.0017068184249653111, -0.050700407808071515, 0.10195183700252161, 0.31579628630522516, 0.22587822934912655, 0.3105522653950541, -0.5190352749504499, -0.12245591428605902, 0.1739564530735823, 0.18840711905258464, 0.11691332025837853, 0.03798721678048722, -0.27025892814596325, 0.1439324075124858, -0.19590513672657786, -0.06291664021414699, -0.13754648545947576, -0.015970641703363632, 0.020885935848603814, -0.27786433725811593, 0.02811561569715256, 0.05188762670814141, 0.03666324361271206, -0.005754542015117887, -0.0714192455290698, 0.02267307909705595, 0.148991323014465, -0.021807983792668222, 0.019240222886929777, 0.10799011681853925, -0.10753836314112453, -0.18609020591794745, 0.3396704631088764, 0.0013629720499817183, -0.1664112319047844, 0.1978666454033251, -0.024539071807736255, -0.16407458135395642, 0.10895885423375856, 0.15635188576380954, 0.09042958423320278, -0.13806710949780157, 0.022492017267246874, 0.07987393176920662, 0.2141334989956649, 0.11916509313874522, 0.10764295019478155, 0.12169769541329185, 0.16590074240073763, 0.17601793298135268, 0.13388600463208575, 0.0010766609378109041, -0.11099970933274934, -0.1954655715978498, -0.10354243480247265, -0.14762879320539085, 0.013547033718345694, -0.10311577981298839, -0.1566673483689403, 0.3406341956590846, 0.21301950314379103, 0.16841842782067998, 0.09618957600034399, 0.3616911679406294, 0.03084563298366539, 0.0787540674092398, 0.15532194253451023, 0.19090933547255226, 0.04002529950171784, 0.15422754109080805, -0.2014026835204521, 0.10679580643773079, 0.013336784387594901] |
1,803.02751 | Aspiration-based Perturbed Learning Automata | This paper introduces a novel payoff-based learning scheme for distributed
optimization in repeatedly-played strategic-form games. Standard
reinforcement-based learning exhibits several limitations with respect to their
asymptotic stability. For example, in two-player coordination games,
payoff-dominant (or efficient) Nash equilibria may not be stochastically
stable. In this work, we present an extension of perturbed learning automata,
namely aspiration-based perturbed learning automata (APLA) that overcomes these
limitations. We provide a stochastic stability analysis of APLA in multi-player
coordination games. We further show that payoff-dominant Nash equilibria are
the only stochastically stable states.
| cs.GT | this paper introduces a novel payoffbased learning scheme for distributed optimization in repeatedlyplayed strategicform games standard reinforcementbased learning exhibits several limitations with respect to their asymptotic stability for example in twoplayer coordination games payoffdominant or efficient nash equilibria may not be stochastically stable in this work we present an extension of perturbed learning automata namely aspirationbased perturbed learning automata apla that overcomes these limitations we provide a stochastic stability analysis of apla in multiplayer coordination games we further show that payoffdominant nash equilibria are the only stochastically stable states | [['this', 'paper', 'introduces', 'a', 'novel', 'payoffbased', 'learning', 'scheme', 'for', 'distributed', 'optimization', 'in', 'repeatedlyplayed', 'strategicform', 'games', 'standard', 'reinforcementbased', 'learning', 'exhibits', 'several', 'limitations', 'with', 'respect', 'to', 'their', 'asymptotic', 'stability', 'for', 'example', 'in', 'twoplayer', 'coordination', 'games', 'payoffdominant', 'or', 'efficient', 'nash', 'equilibria', 'may', 'not', 'be', 'stochastically', 'stable', 'in', 'this', 'work', 'we', 'present', 'an', 'extension', 'of', 'perturbed', 'learning', 'automata', 'namely', 'aspirationbased', 'perturbed', 'learning', 'automata', 'apla', 'that', 'overcomes', 'these', 'limitations', 'we', 'provide', 'a', 'stochastic', 'stability', 'analysis', 'of', 'apla', 'in', 'multiplayer', 'coordination', 'games', 'we', 'further', 'show', 'that', 'payoffdominant', 'nash', 'equilibria', 'are', 'the', 'only', 'stochastically', 'stable', 'states']] | [-0.15447926951901, 0.04541030773937511, -0.1196400253321318, 0.09268754373085411, -0.027595583974000287, -0.22798741094987182, 0.08935304057702204, 0.42419254166238446, -0.31020864608752374, -0.24063638897735953, 0.07858083333943368, -0.21685965661616885, -0.21031150004059515, 0.07781331958317692, -0.19947939566336573, 0.05425639900871936, 0.10889032030039851, -0.014149261892923867, 0.01947937597904135, -0.2533663485199213, 0.33736777030725906, 0.010670319813139298, 0.2434427136226612, -0.02548241661861539, 0.08477301737841438, -0.03135405740536311, 0.05724860346766517, 0.10164711593705066, -0.11997212890402058, 0.13006234990145243, 0.3370100311934948, 0.20215420949765864, 0.4175691051518216, -0.4057098065448158, -0.17459174310514594, 0.20753379617543782, 0.17463199139593225, 0.13634673031594824, -0.09936768695821657, -0.2778656445114928, 0.090508597804343, -0.19923870986437095, -0.05606125745484058, -0.1530902095796431, -0.053703669129925614, 0.06975807639605859, -0.3012599259669728, -0.020496763508109486, 0.10992808450999506, 0.09994729706360136, -0.10008974369916626, -0.11201639607110445, 0.05926338252885377, 0.080471139305326, -0.025722904536215698, -0.09736065595575115, 0.11539474921301007, -0.11679516457199283, -0.260784666086821, 0.356897617032861, -0.0776867018574301, -0.20892819242880625, 0.19357258125263102, 0.012390563856152927, -0.21427422045620487, 0.1068334344363607, 0.2113210041075945, 0.20802879088065204, -0.12307379009092555, 0.07527102019966525, -0.08515127916984698, 0.17060702717589105, 0.04581087597317117, 0.018794525851605133, 0.11699225998154897, 0.20668568944229798, 0.21263281633967862, 0.16656745877527795, 0.03822040347491994, -0.2794595474267707, -0.23590198646244756, -0.10902377712156842, -0.07151436279253924, 0.02761076941199409, -0.07411006773438523, -0.19777019034852, 0.3388821613359837, 0.15495653371189666, 0.06633046489099369, 0.17356617911992706, 0.291228172796614, 0.09399897077066056, -0.048580407058162724, 0.14970493936801657, 0.2338854493573308, 0.08859840388245442, 0.157801182787208, -0.2224722028709948, 0.10608232809121118, 0.05605990755207398] |
1,803.02752 | Interference Management via Space and Frequency Domain Resource
Partitioning | One key requirement for the fifth-Generation (5G) mobile system is the
enhancement of cell edge user performance to ensure that every user is
supported with consistent experience anywhere in the network. An active
interference design to improve anywhere performance, particularly in the low
SINR regime, can be achieved by applying a recently proposed new type of
modulation scheme, frequency quadrature-amplitude modulation (FQAM), which
could change the distribution of interference and therefore improve channel
capacity. In this paper, a resource partitioning scheme to support FQAM in
interference intensive scenarios is proposed. The proposed scheme slices radio
resources into orthogonal parts for QAM and FQAM, respectively, along two
different resource dimensions, namely, space and frequency. This can be
achieved by incorporating advanced beamforming algorithms, e.g., full-dimension
(FD-MIMO), and performing a frequency-based split of FQAM resources to
effectively improve the data rate of the edge users experiencing heavy
interference. Two resource partitioning mechanisms are proposed followed by
complexity analysis. Evaluation results on both space and frequency-based FQAM
interference management are presented, showing significant performance
improvements when compared to the regular QAM modulation.
| cs.IT math.IT | one key requirement for the fifthgeneration 5g mobile system is the enhancement of cell edge user performance to ensure that every user is supported with consistent experience anywhere in the network an active interference design to improve anywhere performance particularly in the low sinr regime can be achieved by applying a recently proposed new type of modulation scheme frequency quadratureamplitude modulation fqam which could change the distribution of interference and therefore improve channel capacity in this paper a resource partitioning scheme to support fqam in interference intensive scenarios is proposed the proposed scheme slices radio resources into orthogonal parts for qam and fqam respectively along two different resource dimensions namely space and frequency this can be achieved by incorporating advanced beamforming algorithms eg fulldimension fdmimo and performing a frequencybased split of fqam resources to effectively improve the data rate of the edge users experiencing heavy interference two resource partitioning mechanisms are proposed followed by complexity analysis evaluation results on both space and frequencybased fqam interference management are presented showing significant performance improvements when compared to the regular qam modulation | [['one', 'key', 'requirement', 'for', 'the', 'fifthgeneration', '5g', 'mobile', 'system', 'is', 'the', 'enhancement', 'of', 'cell', 'edge', 'user', 'performance', 'to', 'ensure', 'that', 'every', 'user', 'is', 'supported', 'with', 'consistent', 'experience', 'anywhere', 'in', 'the', 'network', 'an', 'active', 'interference', 'design', 'to', 'improve', 'anywhere', 'performance', 'particularly', 'in', 'the', 'low', 'sinr', 'regime', 'can', 'be', 'achieved', 'by', 'applying', 'a', 'recently', 'proposed', 'new', 'type', 'of', 'modulation', 'scheme', 'frequency', 'quadratureamplitude', 'modulation', 'fqam', 'which', 'could', 'change', 'the', 'distribution', 'of', 'interference', 'and', 'therefore', 'improve', 'channel', 'capacity', 'in', 'this', 'paper', 'a', 'resource', 'partitioning', 'scheme', 'to', 'support', 'fqam', 'in', 'interference', 'intensive', 'scenarios', 'is', 'proposed', 'the', 'proposed', 'scheme', 'slices', 'radio', 'resources', 'into', 'orthogonal', 'parts', 'for', 'qam', 'and', 'fqam', 'respectively', 'along', 'two', 'different', 'resource', 'dimensions', 'namely', 'space', 'and', 'frequency', 'this', 'can', 'be', 'achieved', 'by', 'incorporating', 'advanced', 'beamforming', 'algorithms', 'eg', 'fulldimension', 'fdmimo', 'and', 'performing', 'a', 'frequencybased', 'split', 'of', 'fqam', 'resources', 'to', 'effectively', 'improve', 'the', 'data', 'rate', 'of', 'the', 'edge', 'users', 'experiencing', 'heavy', 'interference', 'two', 'resource', 'partitioning', 'mechanisms', 'are', 'proposed', 'followed', 'by', 'complexity', 'analysis', 'evaluation', 'results', 'on', 'both', 'space', 'and', 'frequencybased', 'fqam', 'interference', 'management', 'are', 'presented', 'showing', 'significant', 'performance', 'improvements', 'when', 'compared', 'to', 'the', 'regular', 'qam', 'modulation']] | [-0.23105251216381664, 0.040300132678876964, -0.03707073183272388, 0.0290166159443974, -0.07501201117125095, -0.2130487849233495, 0.11763918611634648, 0.4027330706614023, -0.23559707945327185, -0.2976274725840578, 0.09185390829176293, -0.20255541048330053, -0.18728721778262303, 0.19260160211348834, -0.13340965405304256, 0.05575948151338367, 0.0822179411380557, -0.018137568055116182, -0.018369103699932967, -0.2787407884067289, 0.26739411438651406, 0.12380177668144916, 0.42036992800552087, 0.04358217883438871, 0.034261313311927354, 0.004541088471855115, -0.05179787404879449, -0.02035344649183007, -0.03289228204824583, 0.09318760121189183, 0.3219999528890632, 0.18248077336563495, 0.26175705044837305, -0.4014607127487605, -0.2701598357190716, 0.0748535995423669, 0.21098136962884087, 0.030433622110171983, -0.06117671771643569, -0.30626264776951273, 0.13063750097361607, -0.2276810371998552, -0.02950335746662244, -0.03260338759601283, -0.06069555640085366, 0.02709667651274101, -0.35392097011208534, 0.01625038384506739, 0.013346488715029796, 0.025002842088745043, -0.027876833607260575, -0.12707023163698095, 0.03903773600526945, 0.15367885432664602, -0.00954050496324647, 0.0266571082044705, 0.10154196267717325, -0.07999008700418073, -0.16962960264879648, 0.36303606050807, -0.014627344564238157, -0.23231340289719443, 0.15192527947303522, -0.077752473629496, -0.08290378967112752, 0.16545142056992768, 0.23693712669107334, 0.004045087652926088, -0.1513468577769909, 0.0033786876604166506, 0.06274652614013693, 0.18042513708305655, 0.10827067851475258, 0.1396248596561058, 0.1638100963156129, 0.2198828390302584, 0.10413762922893023, 0.12351515899573624, -0.10501314856647904, -0.09909343212457926, -0.1753039644841188, -0.12442413901301444, -0.19959947649472753, -0.05872668053593237, -0.08827162008007726, -0.057025419930568456, 0.39144791555856356, 0.12690084315732372, 0.1136307469413059, 0.04527471683380928, 0.41889693072929396, 0.12002205908787567, 0.08948006264490788, 0.11395826578490155, 0.1887067114328185, 0.03862462038117039, 0.1355566421534096, -0.23107481211497527, 0.03530725820364649, 0.005588587936711128] |
1,803.02753 | Estimating localizable entanglement from witnesses | Computing localizable entanglement for noisy many-particle quantum states is
difficult due to the optimization over all possible sets of local projection
measurements. Therefore, it is crucial to develop lower bounds, which can
provide useful information about the behaviour of localizable entanglement, and
which can be determined by measuring a limited number of operators, or by
performing least number of measurements on the state, preferably without
performing a full state tomography. In this paper, we adopt two different yet
related approaches to obtain a witness-based, and a measurement-based lower
bounds for localizable entanglement. The former is determined by the minimal
amount of entanglement that can be present in a subsystem of the multipartite
quantum state, which is consistent with the expectation value of an
entanglement witness. Determining this bound does not require any information
about the state beyond the expectation value of the witness operator, which
renders this approach highly practical in experiments. The latter bound of
localizable entanglement is computed by restricting the local projection
measurements over the qubits outside the subsystem of interest to a suitably
chosen basis. We discuss the behaviour of both lower bounds against local
physical noise on the qubits, and discuss their dependence on noise strength
and system size. We also analytically determine the measurement-based lower
bound in the case of graph states under local uncorrelated Pauli noise.
| quant-ph | computing localizable entanglement for noisy manyparticle quantum states is difficult due to the optimization over all possible sets of local projection measurements therefore it is crucial to develop lower bounds which can provide useful information about the behaviour of localizable entanglement and which can be determined by measuring a limited number of operators or by performing least number of measurements on the state preferably without performing a full state tomography in this paper we adopt two different yet related approaches to obtain a witnessbased and a measurementbased lower bounds for localizable entanglement the former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state which is consistent with the expectation value of an entanglement witness determining this bound does not require any information about the state beyond the expectation value of the witness operator which renders this approach highly practical in experiments the latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis we discuss the behaviour of both lower bounds against local physical noise on the qubits and discuss their dependence on noise strength and system size we also analytically determine the measurementbased lower bound in the case of graph states under local uncorrelated pauli noise | [['computing', 'localizable', 'entanglement', 'for', 'noisy', 'manyparticle', 'quantum', 'states', 'is', 'difficult', 'due', 'to', 'the', 'optimization', 'over', 'all', 'possible', 'sets', 'of', 'local', 'projection', 'measurements', 'therefore', 'it', 'is', 'crucial', 'to', 'develop', 'lower', 'bounds', 'which', 'can', 'provide', 'useful', 'information', 'about', 'the', 'behaviour', 'of', 'localizable', 'entanglement', 'and', 'which', 'can', 'be', 'determined', 'by', 'measuring', 'a', 'limited', 'number', 'of', 'operators', 'or', 'by', 'performing', 'least', 'number', 'of', 'measurements', 'on', 'the', 'state', 'preferably', 'without', 'performing', 'a', 'full', 'state', 'tomography', 'in', 'this', 'paper', 'we', 'adopt', 'two', 'different', 'yet', 'related', 'approaches', 'to', 'obtain', 'a', 'witnessbased', 'and', 'a', 'measurementbased', 'lower', 'bounds', 'for', 'localizable', 'entanglement', 'the', 'former', 'is', 'determined', 'by', 'the', 'minimal', 'amount', 'of', 'entanglement', 'that', 'can', 'be', 'present', 'in', 'a', 'subsystem', 'of', 'the', 'multipartite', 'quantum', 'state', 'which', 'is', 'consistent', 'with', 'the', 'expectation', 'value', 'of', 'an', 'entanglement', 'witness', 'determining', 'this', 'bound', 'does', 'not', 'require', 'any', 'information', 'about', 'the', 'state', 'beyond', 'the', 'expectation', 'value', 'of', 'the', 'witness', 'operator', 'which', 'renders', 'this', 'approach', 'highly', 'practical', 'in', 'experiments', 'the', 'latter', 'bound', 'of', 'localizable', 'entanglement', 'is', 'computed', 'by', 'restricting', 'the', 'local', 'projection', 'measurements', 'over', 'the', 'qubits', 'outside', 'the', 'subsystem', 'of', 'interest', 'to', 'a', 'suitably', 'chosen', 'basis', 'we', 'discuss', 'the', 'behaviour', 'of', 'both', 'lower', 'bounds', 'against', 'local', 'physical', 'noise', 'on', 'the', 'qubits', 'and', 'discuss', 'their', 'dependence', 'on', 'noise', 'strength', 'and', 'system', 'size', 'we', 'also', 'analytically', 'determine', 'the', 'measurementbased', 'lower', 'bound', 'in', 'the', 'case', 'of', 'graph', 'states', 'under', 'local', 'uncorrelated', 'pauli', 'noise']] | [-0.13327870939987724, 0.16998901908791514, -0.07678751307831985, 0.061500917137663126, -0.01504774722312431, -0.17453431896447735, 0.08182526017683286, 0.3095575263786376, -0.24558313516795535, -0.3048210323312123, 0.12210680437879845, -0.24539299761707323, -0.07579791907642888, 0.21004969599832166, -0.04448326903023661, 0.09513920088895834, 0.05432476261443698, 0.08302964265325165, -0.09078588501593064, -0.2500398550324837, 0.3212527938734222, 0.07214177352159112, 0.28656885392897063, 0.07925860951795564, 0.07308399499991215, 0.02067974840098733, 0.00207088530823722, 0.028883440062954954, -0.12786866309144873, 0.13314170411927834, 0.24627192338068254, 0.15850705197999762, 0.26116457903515466, -0.41869459937706655, -0.1902649696131191, 0.1654361568792251, 0.13377123768545787, 0.15780986219147564, 0.010569117747776047, -0.3065841547046441, 0.05246972703717382, -0.15838684060823824, -0.09226480072245186, -0.11608427664841371, 0.0037889920964402734, -0.06906591986949168, -0.2630339606037059, 0.08575017895273376, 0.06475471370647799, 0.03165403510456395, -0.017860904327622978, -0.07160253232217607, 0.009319697393964758, 0.13459047485631578, -0.051308696743651246, -0.006726718956141027, 0.14589494604391834, -0.14560562291708795, -0.11925611907987951, 0.3183984347045392, -0.04762434432462626, -0.23355401102782355, 0.16781730026908787, -0.14311196416357508, -0.08712192832084055, 0.08253082605454687, 0.1229467918089332, 0.1235648249359509, -0.1553748885191551, 0.0805095723786312, -0.054447156356255036, 0.19047592720564982, 0.030358271856036356, 0.15595482127644925, 0.16895773404720552, 0.08355265946415641, 0.15176317905443365, 0.19044219428410278, -0.053926184726461365, -0.1153490006354128, -0.3166891948023452, -0.15313857382204124, -0.26673533338447825, 0.07440748680368611, -0.09935257727078751, -0.13953416876029223, 0.4064039301989608, 0.16227565911982728, 0.20334739191039997, 0.03721532311432498, 0.29473698392276537, 0.14284371728163145, 0.05654339922483459, 0.10335497130460268, 0.25383510730634423, 0.14523555836932642, 0.016359398986166968, -0.2445487575271405, 0.12463137502427059, 0.04747743869718214] |
1,803.02754 | On the Galois group over Q of a truncated binomial expansion | For positive integers $n$, the truncated binomial expansions of $(1+x)^n$
which consist of all the terms of degree $\le r$ where $1 \le r \le n-2$ appear
always to be irreducible. For fixed $r$ and $n$ sufficiently large, this is
known to be the case. We show here that for a fixed positive integer $r \ne 6$
and $n$ sufficiently large, the Galois group of such a polynomial over the
rationals is the symmetric group $S_{r}$. For $r = 6$, we show the number of
exceptional $n \le N$ for which the Galois group of this polynomial is not
$S_r$ is at most $O(\log N)$.
| math.NT | for positive integers n the truncated binomial expansions of 1xn which consist of all the terms of degree le r where 1 le r le n2 appear always to be irreducible for fixed r and n sufficiently large this is known to be the case we show here that for a fixed positive integer r ne 6 and n sufficiently large the galois group of such a polynomial over the rationals is the symmetric group s_r for r 6 we show the number of exceptional n le n for which the galois group of this polynomial is not s_r is at most olog n | [['for', 'positive', 'integers', 'n', 'the', 'truncated', 'binomial', 'expansions', 'of', '1xn', 'which', 'consist', 'of', 'all', 'the', 'terms', 'of', 'degree', 'le', 'r', 'where', '1', 'le', 'r', 'le', 'n2', 'appear', 'always', 'to', 'be', 'irreducible', 'for', 'fixed', 'r', 'and', 'n', 'sufficiently', 'large', 'this', 'is', 'known', 'to', 'be', 'the', 'case', 'we', 'show', 'here', 'that', 'for', 'a', 'fixed', 'positive', 'integer', 'r', 'ne', '6', 'and', 'n', 'sufficiently', 'large', 'the', 'galois', 'group', 'of', 'such', 'a', 'polynomial', 'over', 'the', 'rationals', 'is', 'the', 'symmetric', 'group', 's_r', 'for', 'r', '6', 'we', 'show', 'the', 'number', 'of', 'exceptional', 'n', 'le', 'n', 'for', 'which', 'the', 'galois', 'group', 'of', 'this', 'polynomial', 'is', 'not', 's_r', 'is', 'at', 'most', 'olog', 'n']] | [-0.21435594439613992, 0.1610148768298901, -0.046377260609565735, -0.005661343374343302, -0.00524182685274774, -0.19946462323423475, -0.03407282824628055, 0.2874910788825498, -0.3064238995172603, -0.26757476227178884, 0.0899350337881165, -0.2990432860544668, -0.09871637728960755, 0.13700314077477044, -0.009957142917510983, -0.03287871476473251, -0.038596106675238565, 0.14703535267975754, -0.03894771014725288, -0.3691640791948885, 0.2750501602780647, -0.05215267079004731, 0.10133453558843869, 0.021434776001394942, 0.07065887774045293, 0.033024458413889915, 0.00834555539320438, 0.008913649138636313, -0.144796677670666, 0.04278706662500134, 0.34362398747068185, 0.1051220135190166, 0.26554003798474485, -0.31466718421926576, -0.08493111157216705, 0.2433036666177661, 0.2151895175831249, 0.0013140988460061355, 0.010657493003796285, -0.15395801558490627, 0.22130653238071737, -0.17010812019543664, -0.14455933537549123, -0.019269412132696465, 0.1688501030126085, 0.03176774232773683, -0.36725361024190745, -0.00031806674535171344, 0.09129428451594251, 0.134439753762518, 0.0644360292779031, -0.23609254880844113, -0.007340127284316203, 0.07425037536393994, -0.045280797398076035, 0.05682355876286657, 0.023048910851894807, -0.0887226129640252, -0.01348407998179587, 0.3409640360086297, -0.08518301367495532, -0.18787002319004387, 0.11199829546072018, -0.23175328798130906, -0.18883086522468007, 0.1453566441240792, 0.08264200597141798, 0.22084913381303733, 0.0528577836857249, 0.24120123667727547, -0.155458689129983, 0.17445594072677734, 0.11684392782178922, -0.011920865721409567, 0.11674786086838979, 0.02157344587612897, 0.1012998101001498, 0.056974197269972555, -0.023466423127012186, 0.020321485984963007, -0.38274392320846135, -0.18482118416935778, -0.24873689501300061, 0.14053879417000503, -0.19419176577866892, -0.13907371026177245, 0.31907189164597255, 0.058888692972966686, 0.20408394642604086, 0.16635176802922685, 0.1548935028258711, 0.06277594083132079, 0.01783637306652963, 0.12619299213670623, 0.08301912517680858, 0.11935821934961356, -0.03028650748288223, -0.18368975882633373, -0.010671346251911018, 0.11969273407549526] |
1,803.02755 | Measuring the last burst of non-singular black holes | Non-perturbative quantum gravity prevents the formation of curvature
singularities and may allow black holes to decay with a lifetime shorter than
evaporation time. This, in connection with the existence of primordial black
holes, could open a new window for quantum-gravity phenomenology. I discuss the
possibility of observing astrophysical emissions from the explosion of old
black holes in the radio and in the gamma wavelengths. These emissions can be
discriminated from other astrophysical sources because of a peculiar way the
emitted wavelength scales with the distance. The spectrum of the diffuse
radiation produced by those objects presents a peculiar distortion due to this
scaling.
| gr-qc physics.hist-ph | nonperturbative quantum gravity prevents the formation of curvature singularities and may allow black holes to decay with a lifetime shorter than evaporation time this in connection with the existence of primordial black holes could open a new window for quantumgravity phenomenology i discuss the possibility of observing astrophysical emissions from the explosion of old black holes in the radio and in the gamma wavelengths these emissions can be discriminated from other astrophysical sources because of a peculiar way the emitted wavelength scales with the distance the spectrum of the diffuse radiation produced by those objects presents a peculiar distortion due to this scaling | [['nonperturbative', 'quantum', 'gravity', 'prevents', 'the', 'formation', 'of', 'curvature', 'singularities', 'and', 'may', 'allow', 'black', 'holes', 'to', 'decay', 'with', 'a', 'lifetime', 'shorter', 'than', 'evaporation', 'time', 'this', 'in', 'connection', 'with', 'the', 'existence', 'of', 'primordial', 'black', 'holes', 'could', 'open', 'a', 'new', 'window', 'for', 'quantumgravity', 'phenomenology', 'i', 'discuss', 'the', 'possibility', 'of', 'observing', 'astrophysical', 'emissions', 'from', 'the', 'explosion', 'of', 'old', 'black', 'holes', 'in', 'the', 'radio', 'and', 'in', 'the', 'gamma', 'wavelengths', 'these', 'emissions', 'can', 'be', 'discriminated', 'from', 'other', 'astrophysical', 'sources', 'because', 'of', 'a', 'peculiar', 'way', 'the', 'emitted', 'wavelength', 'scales', 'with', 'the', 'distance', 'the', 'spectrum', 'of', 'the', 'diffuse', 'radiation', 'produced', 'by', 'those', 'objects', 'presents', 'a', 'peculiar', 'distortion', 'due', 'to', 'this', 'scaling']] | [-0.1346460617204181, 0.19814186900836026, -0.11161728261165249, 0.14013432771124587, -0.1006687807497903, -0.10855867097027672, 0.028928257739713904, 0.3261660436186397, -0.23698688141585697, -0.3272077530730986, 0.060571562529324545, -0.2979639023915385, -0.018031501997877092, 0.21067837003654646, -0.02829898181326181, -0.011076054208034885, 0.026197520598940986, -0.04432482454356131, -0.04310660949089899, -0.15979300060499352, 0.36256040680647184, 0.15036230664858505, 0.1856293304307947, 0.035432219550519894, -0.005413352023556973, -0.07870565269038407, -0.04983738265497592, 0.00799520674966348, -0.12379759490643673, 0.09063274192723256, 0.21299033023719902, 0.13896625358340087, 0.17967712276985923, -0.3999901348815381, -0.293045090855036, 0.10012420554401226, 0.16758103007269862, 0.138428595583904, -0.1311268290522897, -0.3062996476599314, 0.0363593151480936, -0.1559886933096404, -0.16301547419008555, 0.05928465639449005, 0.06000694279893509, -0.0174428503417853, -0.18162072880772276, 0.11908997193846887, 0.014859863360823828, -0.0660629703536702, -0.07420794076729313, -0.04990888687610192, 0.0024572147318677414, 0.08759319440470738, 0.11733875938609821, -0.0039554262438843265, 0.16763932561700784, -0.12786512256563795, -0.12853808688379606, 0.40776624194192657, -0.05980028736349127, -0.05758138508558527, 0.2176757410611704, -0.2510217379606826, -0.12493276663658037, 0.18660998970125486, 0.14875828428533, 0.15319737345794016, -0.1379148569500562, 0.06403258996134063, 0.06528848031246402, 0.16647475097414324, 0.12016423732874174, 0.15934312092230737, 0.40806139709012024, 0.12777598203132742, -0.0009418401134751954, 0.14832173116918815, -0.15191351012010307, -0.03289074340871381, -0.2970611702795457, -0.10578083633038315, -0.12539370300121677, 0.1719095374636117, -0.12717623496399877, -0.14839893326251452, 0.3653163724461371, 0.1299868410202286, 0.18549782616420857, 0.02833756462905954, 0.25980174224661945, 0.04592887220397881, 0.07976843221836442, 0.08642031893007529, 0.3387382662339697, 0.11479805948131365, 0.1102038917642593, -0.23870670496603674, 0.021961790925452432, 0.016399337024002977] |
1,803.02756 | FQAM-FBMC Design and Its Application to Machine Type Communication | In this paper, we propose a novel waveform design which efficiently combines
two air interface components: Frequency and Quadrature-Amplitude Modulation
(FQAM) and Filter Bank Multicarrier (FBMC). The proposed approach takes the
unique characteristics of FQAM into consideration and exploits the design of
prototype filters for FBMC to effectively avoid self-interference between
adjacent subcarriers in the complex domain, thus providing improved performance
compared with conventional solutions in terms of self-interference, spectrum
confinement and complexity with negligible rate loss.
| cs.IT math.IT | in this paper we propose a novel waveform design which efficiently combines two air interface components frequency and quadratureamplitude modulation fqam and filter bank multicarrier fbmc the proposed approach takes the unique characteristics of fqam into consideration and exploits the design of prototype filters for fbmc to effectively avoid selfinterference between adjacent subcarriers in the complex domain thus providing improved performance compared with conventional solutions in terms of selfinterference spectrum confinement and complexity with negligible rate loss | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'waveform', 'design', 'which', 'efficiently', 'combines', 'two', 'air', 'interface', 'components', 'frequency', 'and', 'quadratureamplitude', 'modulation', 'fqam', 'and', 'filter', 'bank', 'multicarrier', 'fbmc', 'the', 'proposed', 'approach', 'takes', 'the', 'unique', 'characteristics', 'of', 'fqam', 'into', 'consideration', 'and', 'exploits', 'the', 'design', 'of', 'prototype', 'filters', 'for', 'fbmc', 'to', 'effectively', 'avoid', 'selfinterference', 'between', 'adjacent', 'subcarriers', 'in', 'the', 'complex', 'domain', 'thus', 'providing', 'improved', 'performance', 'compared', 'with', 'conventional', 'solutions', 'in', 'terms', 'of', 'selfinterference', 'spectrum', 'confinement', 'and', 'complexity', 'with', 'negligible', 'rate', 'loss']] | [-0.20077435700101898, -0.017591241281479597, -0.04319811929863962, -0.010202839784626546, -0.09591341565375204, -0.20525760569476656, 0.054150501037826884, 0.41760765712756615, -0.24069141134522953, -0.2721192413433032, 0.06987972127639555, -0.21123271829459223, -0.23331277066382108, 0.15405085690126016, -0.12904799892869476, 0.05617673551155762, 0.05422364291432616, -0.09351923215118321, -0.05067799119399739, -0.17078833402944849, 0.23588971325420086, 0.12363458566319246, 0.3956017093612002, 0.0003337460243469709, 0.1444977018619319, 0.045814581324237505, -0.045274640929389307, -0.06655164027901052, -0.045088183872595236, 0.09625110580501231, 0.30578357853636434, 0.13230937228284098, 0.27062552197921, -0.4125857948047387, -0.25105008017271757, 0.05321572299490308, 0.17888122391524156, 0.051754518198877476, -0.08235101139493432, -0.2921509763177533, 0.10488194650547071, -0.2284717897600313, -0.01597962334038472, -0.02243681066342956, -0.10291550124015708, 0.03757373255665426, -0.34452978675193213, 0.025085953463401114, 0.04475239563926861, -0.010173818492632988, -0.0332677574078371, -0.14929812963955202, 0.03962591343692371, 0.11929616096804475, 0.0059893596312635905, -0.04314371252843699, 0.05918183452268312, -0.049167998591679835, -0.0994981432140067, 0.3670177756288609, -0.05076641585169868, -0.25387850258644523, 0.1658133855573349, -0.08535871970430985, -0.007982637430843594, 0.21396567376765918, 0.25335063191294044, 0.004789742822577427, -0.16414874407928437, 0.028517993242637096, 0.106833468602559, 0.2275958454067057, 0.11883168270835628, 0.17102918027621972, 0.155415452023448, 0.1965951852911672, 0.09198747409192781, 0.20368738979246323, -0.1448979793576064, -0.0691907742233076, -0.1883193122392351, -0.14249301719624405, -0.181537481968279, -0.06430974018203651, -0.09244367969449149, -0.11801530709853034, 0.4572558262228192, 0.1656787814058412, 0.11748375036669048, 0.06638499310802572, 0.42356685505478414, 0.12321684739322632, 0.11120515557417235, 0.06603137491897955, 0.19144365212021322, 0.0635883367829049, 0.11511870169431551, -0.27646196825889413, 0.009835103581139407, 0.02168453788360605] |
1,803.02757 | The evaluation of infinite sums of products of Bessel functions | We examine convergent representations for the sum of Bessel functions
\[\sum_{n=1}^\infty \frac{J_\mu(na) J_\nu(nb)}{n^{\alpha}}\] for $\mu$,
$\nu\geq0$ and positive values of $a$ and $b$. Such representations enable easy
computation of the series in the limit $a, b\to0+$. Particular attention is
given to logarithmic cases that occur both when $a=b$ and $a\neq b$ for certain
values of $\alpha$, $\mu$ and $\nu$. The series when the first Bessel function
is replaced by the modified Bessel function $K_\mu(na)$ is also investigated,
as well as the series with two modified Bessel functions.
| math.CA | we examine convergent representations for the sum of bessel functions sum_n1infty fracj_muna j_nunbnalpha for mu nugeq0 and positive values of a and b such representations enable easy computation of the series in the limit a bto0 particular attention is given to logarithmic cases that occur both when ab and aneq b for certain values of alpha mu and nu the series when the first bessel function is replaced by the modified bessel function k_muna is also investigated as well as the series with two modified bessel functions | [['we', 'examine', 'convergent', 'representations', 'for', 'the', 'sum', 'of', 'bessel', 'functions', 'sum_n1infty', 'fracj_muna', 'j_nunbnalpha', 'for', 'mu', 'nugeq0', 'and', 'positive', 'values', 'of', 'a', 'and', 'b', 'such', 'representations', 'enable', 'easy', 'computation', 'of', 'the', 'series', 'in', 'the', 'limit', 'a', 'bto0', 'particular', 'attention', 'is', 'given', 'to', 'logarithmic', 'cases', 'that', 'occur', 'both', 'when', 'ab', 'and', 'aneq', 'b', 'for', 'certain', 'values', 'of', 'alpha', 'mu', 'and', 'nu', 'the', 'series', 'when', 'the', 'first', 'bessel', 'function', 'is', 'replaced', 'by', 'the', 'modified', 'bessel', 'function', 'k_muna', 'is', 'also', 'investigated', 'as', 'well', 'as', 'the', 'series', 'with', 'two', 'modified', 'bessel', 'functions']] | [-0.10171990938125605, 0.10667835483720234, -0.050982130668967604, 0.08539958520201933, -0.04330105079809226, -0.12320145144385386, 0.022881584904010755, 0.3655439583831523, -0.2957472162130457, -0.18695938394191752, 0.08721837841103369, -0.2707229967801327, -0.16830323571451458, 0.22779268448252277, 0.02585108142313884, 0.09111364178832183, 0.0012635728288217481, 0.06276470237602312, -0.08811566830298538, -0.24143835099930144, 0.31703381721107066, -0.013350941173462983, 0.17730020342327385, 0.019588048895259936, 0.07865173494196441, 0.036173344471951925, -0.03683773038560996, -0.03238956756027312, -0.17112968299099235, 0.04701011328318392, 0.20624365427542524, 0.07472944292744779, 0.3059713691416903, -0.34436529029878865, -0.128731473248048, 0.13598005160554705, 0.13899342445320034, -0.047783991181661926, 0.0013722401359174624, -0.25108999036342267, 0.10466897795650076, -0.1724067618509373, -0.11064225313511777, -0.12538197884582972, 0.09299357158008469, 0.1324015171772026, -0.3929550356444824, 0.05814599906373488, 0.04504579937517508, 0.02672794945986874, -0.046323197071878125, -0.19777133562097168, 0.02915560846576041, 0.10250047510503847, 0.0809175033285002, 0.06359153648092221, 0.057031250182898285, -0.1334200191412525, -0.06555050660867288, 0.3902832304452916, -0.11540398569440985, -0.26901586492916185, 0.11468398408313472, -0.24655375702598367, -0.11921665921852172, 0.0800890227420682, 0.10315837262265654, 0.14907779338691068, -0.0710670962128143, 0.11619228954954319, -0.01700494089444359, 0.07162963948212564, 0.15686359920774598, 0.014666547572397324, 0.15350436305217668, 0.06510705002078629, 0.03890885864749147, 0.1600260452243937, -0.05413204348500235, -0.05181421021403498, -0.3626359826604645, -0.2059664201133054, -0.21906830303662692, 0.05431014031216682, -0.08546994823937204, -0.17589211844872818, 0.3669182670987155, 0.01625824748280357, 0.22660646548337607, 0.12172456918261855, 0.22658178195671505, 0.21975698542826058, 0.06018718935308013, 0.009728056272065425, 0.11328071973802724, 0.13311701881452406, 0.0721888652924134, -0.16391728299456726, 0.017234222774803413, 0.09020745257162545] |
1,803.02758 | RTSeg: Real-time Semantic Segmentation Comparative Study | Semantic segmentation benefits robotics related applications especially
autonomous driving. Most of the research on semantic segmentation is only on
increasing the accuracy of segmentation models with little attention to
computationally efficient solutions. The few work conducted in this direction
does not provide principled methods to evaluate the different design choices
for segmentation. In this paper, we address this gap by presenting a real-time
semantic segmentation benchmarking framework with a decoupled design for
feature extraction and decoding methods. The framework is comprised of
different network architectures for feature extraction such as VGG16, Resnet18,
MobileNet, and ShuffleNet. It is also comprised of multiple meta-architectures
for segmentation that define the decoding methodology. These include SkipNet,
UNet, and Dilation Frontend. Experimental results are presented on the
Cityscapes dataset for urban scenes. The modular design allows novel
architectures to emerge, that lead to 143x GFLOPs reduction in comparison to
SegNet. This benchmarking framework is publicly available at
"https://github.com/MSiam/TFSegmentation".
| cs.CV | semantic segmentation benefits robotics related applications especially autonomous driving most of the research on semantic segmentation is only on increasing the accuracy of segmentation models with little attention to computationally efficient solutions the few work conducted in this direction does not provide principled methods to evaluate the different design choices for segmentation in this paper we address this gap by presenting a realtime semantic segmentation benchmarking framework with a decoupled design for feature extraction and decoding methods the framework is comprised of different network architectures for feature extraction such as vgg16 resnet18 mobilenet and shufflenet it is also comprised of multiple metaarchitectures for segmentation that define the decoding methodology these include skipnet unet and dilation frontend experimental results are presented on the cityscapes dataset for urban scenes the modular design allows novel architectures to emerge that lead to 143x gflops reduction in comparison to segnet this benchmarking framework is publicly available at httpsgithubcommsiamtfsegmentation | [['semantic', 'segmentation', 'benefits', 'robotics', 'related', 'applications', 'especially', 'autonomous', 'driving', 'most', 'of', 'the', 'research', 'on', 'semantic', 'segmentation', 'is', 'only', 'on', 'increasing', 'the', 'accuracy', 'of', 'segmentation', 'models', 'with', 'little', 'attention', 'to', 'computationally', 'efficient', 'solutions', 'the', 'few', 'work', 'conducted', 'in', 'this', 'direction', 'does', 'not', 'provide', 'principled', 'methods', 'to', 'evaluate', 'the', 'different', 'design', 'choices', 'for', 'segmentation', 'in', 'this', 'paper', 'we', 'address', 'this', 'gap', 'by', 'presenting', 'a', 'realtime', 'semantic', 'segmentation', 'benchmarking', 'framework', 'with', 'a', 'decoupled', 'design', 'for', 'feature', 'extraction', 'and', 'decoding', 'methods', 'the', 'framework', 'is', 'comprised', 'of', 'different', 'network', 'architectures', 'for', 'feature', 'extraction', 'such', 'as', 'vgg16', 'resnet18', 'mobilenet', 'and', 'shufflenet', 'it', 'is', 'also', 'comprised', 'of', 'multiple', 'metaarchitectures', 'for', 'segmentation', 'that', 'define', 'the', 'decoding', 'methodology', 'these', 'include', 'skipnet', 'unet', 'and', 'dilation', 'frontend', 'experimental', 'results', 'are', 'presented', 'on', 'the', 'cityscapes', 'dataset', 'for', 'urban', 'scenes', 'the', 'modular', 'design', 'allows', 'novel', 'architectures', 'to', 'emerge', 'that', 'lead', 'to', '143x', 'gflops', 'reduction', 'in', 'comparison', 'to', 'segnet', 'this', 'benchmarking', 'framework', 'is', 'publicly', 'available', 'at', 'httpsgithubcommsiamtfsegmentation']] | [-0.06130530744159937, -0.020353518735072084, -0.027626661283743727, 0.03241895480344905, -0.1095252277874878, -0.19705031505222187, -0.00031617696406197195, 0.47413368373619097, -0.21767610458329345, -0.3543206332373972, 0.07818521357426346, -0.24127878706703518, -0.1844455729434757, 0.2394642082631196, -0.14668962308266936, 0.09265612390989095, 0.18140647642576369, -0.009137155642651794, -0.07738429896141354, -0.26668757146322414, 0.25696847921139315, 0.06076132984047657, 0.3837375194937187, 0.06958597778085325, 0.11145501541077944, -0.05098168031844053, -0.04882994027330393, -0.05388520254315441, -0.08643525158789232, 0.19730734730929775, 0.3566654040856568, 0.19106342796371073, 0.3111596301099972, -0.38872833277932123, -0.22652808892369075, 0.032529031036813795, 0.14523546393703377, 0.08356005956547481, -0.04622161669402359, -0.33922990860638064, 0.10931319988096795, -0.19599969484720772, 0.03646283625532401, -0.16800450510039044, -0.015445201542828918, -0.05807708020285262, -0.25035067138531686, 0.023129734985942424, 0.05723282651926734, 0.07192656401266025, -0.07271672980162916, -0.1292385686476911, 0.05937950849827183, 0.16584339454819105, -0.011587825913202801, 0.07981616989586894, 0.14861271595643638, -0.186213999384228, -0.14865037793979832, 0.3642898668338986, -0.0010469533881405368, -0.2254184598385013, 0.2128298434365302, 0.029058716517235888, -0.20434853612249226, 0.08796581772989348, 0.24207924053036167, 0.1112162771417532, -0.16405894008992045, -0.005011224771136001, -0.020122321702441888, 0.18505342015046872, 0.06347759577635627, -0.01690478860186168, 0.148121629455617, 0.321193830777989, 0.0468720751515847, 0.158999777360709, -0.14836141219328916, -0.07959053563306377, -0.2428934628509236, -0.11582658789426971, -0.1500584186272279, -0.06701174179024268, -0.10315810843942592, -0.16430383717555455, 0.4087736343254188, 0.2738147081966561, 0.16746905763897016, 0.1028635304514625, 0.3777419374076233, -0.010497545634279959, 0.14878994791376354, 0.0805312291938064, 0.17258760276481075, -0.010642937952836388, 0.14297601025196185, -0.1523778672620354, 0.05590408074740002, 0.07120788597507942] |
1,803.02759 | Quasi-local holographic dualities in non-perturbative 3d quantum gravity | We present a line of research aimed at investigating holographic dualities in
the context of three dimensional quantum gravity within finite bounded regions.
The bulk quantum geometrodynamics is provided by the Ponzano-Regge state-sum
model, which defines 3d quantum gravity as a discrete topological quantum field
theory (TQFT). This formulation provides an explicit and detailed definition of
the quantum boundary states, which allows a rich correspondence between quantum
boundary conditions and boundary theories, thereby leading to holographic
dualities between 3d quantum gravity and 2d statistical models as used in
condensed matter. After presenting the general framework, we focus on the
concrete example of the coherent twisted torus boundary, which allows for a
direct comparison with other approaches to 3d/2d holography at asymptotic
infinity. We conclude with the most interesting questions to pursue in this
framework.
| hep-th gr-qc | we present a line of research aimed at investigating holographic dualities in the context of three dimensional quantum gravity within finite bounded regions the bulk quantum geometrodynamics is provided by the ponzanoregge statesum model which defines 3d quantum gravity as a discrete topological quantum field theory tqft this formulation provides an explicit and detailed definition of the quantum boundary states which allows a rich correspondence between quantum boundary conditions and boundary theories thereby leading to holographic dualities between 3d quantum gravity and 2d statistical models as used in condensed matter after presenting the general framework we focus on the concrete example of the coherent twisted torus boundary which allows for a direct comparison with other approaches to 3d2d holography at asymptotic infinity we conclude with the most interesting questions to pursue in this framework | [['we', 'present', 'a', 'line', 'of', 'research', 'aimed', 'at', 'investigating', 'holographic', 'dualities', 'in', 'the', 'context', 'of', 'three', 'dimensional', 'quantum', 'gravity', 'within', 'finite', 'bounded', 'regions', 'the', 'bulk', 'quantum', 'geometrodynamics', 'is', 'provided', 'by', 'the', 'ponzanoregge', 'statesum', 'model', 'which', 'defines', '3d', 'quantum', 'gravity', 'as', 'a', 'discrete', 'topological', 'quantum', 'field', 'theory', 'tqft', 'this', 'formulation', 'provides', 'an', 'explicit', 'and', 'detailed', 'definition', 'of', 'the', 'quantum', 'boundary', 'states', 'which', 'allows', 'a', 'rich', 'correspondence', 'between', 'quantum', 'boundary', 'conditions', 'and', 'boundary', 'theories', 'thereby', 'leading', 'to', 'holographic', 'dualities', 'between', '3d', 'quantum', 'gravity', 'and', '2d', 'statistical', 'models', 'as', 'used', 'in', 'condensed', 'matter', 'after', 'presenting', 'the', 'general', 'framework', 'we', 'focus', 'on', 'the', 'concrete', 'example', 'of', 'the', 'coherent', 'twisted', 'torus', 'boundary', 'which', 'allows', 'for', 'a', 'direct', 'comparison', 'with', 'other', 'approaches', 'to', '3d2d', 'holography', 'at', 'asymptotic', 'infinity', 'we', 'conclude', 'with', 'the', 'most', 'interesting', 'questions', 'to', 'pursue', 'in', 'this', 'framework']] | [-0.10435760781905655, 0.13736705704856708, -0.13142810012439765, 0.07977030292386189, -0.08989794448594939, -0.20651602480254733, 0.005267440239766807, 0.29670511298715624, -0.2090553289475684, -0.27145696525225665, 0.04524068739838592, -0.22553219353287557, -0.17749302771547115, 0.1745379755130983, -0.06529652580111496, 0.10286699324835842, -0.012347920314728547, 0.03108705407175333, -0.13645660723455305, -0.19775779310738972, 0.3507996463084788, 0.023806886376514198, 0.2987086533554899, 0.08145976753961016, 0.08942120357758866, -0.005231879513846266, -0.008808591945180253, 0.04152642814581519, -0.20240635093329334, 0.16194847378481889, 0.28066480783659314, 0.07407524263305562, 0.21584199490929162, -0.47787207084249206, -0.2784300617484459, 0.017941127642433146, 0.11716970430236177, 0.1650421205923698, -0.05029528003286765, -0.32810944263865033, 0.027962352768622283, -0.16014001485127122, -0.13622847978901395, -0.06395666029151362, -0.0228641895784079, -0.14099488019727782, -0.20369564552892194, 0.04672672742770971, 0.03483056338893166, 0.09179963142769203, -0.03504521225895316, -0.015066399936626819, 0.0069585079483604475, 0.129795563848578, 0.014045844317601522, 0.023687468992838107, 0.07280517603034403, -0.18754003481287204, -0.14967068742331702, 0.39056198525506614, -0.040722610310776466, -0.20541150576726935, 0.236880729371098, -0.11410680103094888, -0.15867713165344366, 0.04066914438144929, 0.09706236680608187, 0.1475236692301644, -0.09824269150953684, 0.16462965798260185, -0.04602187400364053, 0.09521050128951988, 0.03222245097146439, 0.059822263782096805, 0.31209599977331376, 0.13013286530839474, 0.050025921238502906, 0.2062730586661005, -0.0418320213220388, -0.18615906205334104, -0.3997964404745778, -0.21083743796586546, -0.13093452103463793, 0.07691419974782629, -0.12055124898313861, -0.1873716919182508, 0.38045698612817186, 0.15512628648421423, 0.16192846653510384, 0.029582379709663383, 0.2590489823426773, 0.09300587647907269, 0.012027061287202497, 0.03970209987305883, 0.18098695207658266, 0.1923629323076179, 0.08490307378381101, -0.21702928706280775, -0.07731792258460131, 0.17449194550505098] |
1,803.0276 | To gap or not to gap? Mass distortions and edge modes in graphene
armchair nanoribbons | We investigate, in the framework of macroscopic Dirac model, the spectrum,
charge density and conductivity of metallic armchair graphene nanoribbons in
presence of different mass terms. We reveal the conditions and symmetries
governing the presence of edge modes in the system. Depending on the mass terms
present they are exponentially localized gapless or gapped modes. The latter
situation is realized, in particular, for a full Kekule distortion. For this
case, we calculate the mean charge and conductivity of the ribbon, and derive
the traces of the presence of edge modes suitable for experimental
verification.
| cond-mat.mes-hall hep-th | we investigate in the framework of macroscopic dirac model the spectrum charge density and conductivity of metallic armchair graphene nanoribbons in presence of different mass terms we reveal the conditions and symmetries governing the presence of edge modes in the system depending on the mass terms present they are exponentially localized gapless or gapped modes the latter situation is realized in particular for a full kekule distortion for this case we calculate the mean charge and conductivity of the ribbon and derive the traces of the presence of edge modes suitable for experimental verification | [['we', 'investigate', 'in', 'the', 'framework', 'of', 'macroscopic', 'dirac', 'model', 'the', 'spectrum', 'charge', 'density', 'and', 'conductivity', 'of', 'metallic', 'armchair', 'graphene', 'nanoribbons', 'in', 'presence', 'of', 'different', 'mass', 'terms', 'we', 'reveal', 'the', 'conditions', 'and', 'symmetries', 'governing', 'the', 'presence', 'of', 'edge', 'modes', 'in', 'the', 'system', 'depending', 'on', 'the', 'mass', 'terms', 'present', 'they', 'are', 'exponentially', 'localized', 'gapless', 'or', 'gapped', 'modes', 'the', 'latter', 'situation', 'is', 'realized', 'in', 'particular', 'for', 'a', 'full', 'kekule', 'distortion', 'for', 'this', 'case', 'we', 'calculate', 'the', 'mean', 'charge', 'and', 'conductivity', 'of', 'the', 'ribbon', 'and', 'derive', 'the', 'traces', 'of', 'the', 'presence', 'of', 'edge', 'modes', 'suitable', 'for', 'experimental', 'verification']] | [-0.21497965281571638, 0.16428335714822714, -0.012347068162040507, 0.00995942749122673, 0.01250648203781469, -0.11616429683078636, 0.04175182390819363, 0.35757314770462667, -0.22569815530887546, -0.2646321276044275, 0.06792313537183911, -0.2899889930131588, -0.14302102969513533, 0.1087960134176141, 0.011875901019517729, 0.038108977699479546, 0.03532881587941913, 0.0002902317346331287, -0.09618472464090372, -0.16471536360094954, 0.32302410756931343, -0.01031672103489016, 0.3292388122806207, 0.11735812204449061, -0.008608612231910229, 0.030079399797807823, 0.049019638290430635, 0.02464599816247504, -0.16569664922265454, 0.07262077004688376, 0.19601025831628036, -0.06607195633919315, 0.1602614014013175, -0.4761538017501539, -0.19262754853735578, 0.049851896163284226, 0.15314563400201262, 0.14318734536224859, -0.019215965728978924, -0.28342688961222057, 0.08124924644312644, -0.14045910709141257, -0.17105421980724056, -0.06386012071743608, -0.005784348792772978, -0.04553032040278962, -0.24768310422672235, 0.1635302514769137, 0.049554727377092586, 0.039044678280565966, -0.1227910761186417, -0.10571236815179717, -0.1185344185140182, 0.10159621532124645, 0.07160304419007747, -0.0669467292027548, 0.15504835623792035, -0.1635671689625869, -0.09460242563967612, 0.3956953211033598, -0.06893828001239911, -0.18051451446607392, 0.16897973638186428, -0.17511919496501696, -0.07868839786982441, 0.12261972352713743, 0.15139603092672027, 0.10660054858655055, -0.1075007505584855, 0.10831503098721597, -0.046385600812426035, 0.12053530046498363, 0.05152774929623813, 0.14420455492453332, 0.2732701424727256, 0.13920365437181628, 0.0773908547720218, 0.1666180135297064, -0.11544636132423469, -0.041338515415926404, -0.3044670918124153, -0.19811048766380138, -0.20631871628079643, 0.013281005999430063, -0.07832696876287995, -0.22187920371466813, 0.48750869513667644, 0.13565659516074874, 0.16988279482726246, 0.009102510754019022, 0.23722547352155474, 0.1808425017355129, 0.04387511798438239, 0.06516000993074254, 0.24290981734706524, 0.15001100283908717, 0.06973568521975045, -0.2953120398959343, 0.02187784585328971, 0.020319934560362487] |
1,803.02761 | Revisiting Photon Statistics Effects on Multi-photon Ionization | We present a detailed analysis of the effects of photon statistics on
multi-photon ionization. Through a detailed study of the role of intermediate
states, we evaluate the conditions under which the premise of non-resonant
processes is valid. The limitations of its validity are manifested in the
dependence of the process on the stochastic properties of the radiation and
found to be quite sensitive to the intensity. The results are quantified
through detailed calculations for coherent, chaotic and squeezed vacuum
radiation. Their significance in the context of recent developments in
radiation sources such as the short wavelength Free Electron Laser and squeezed
vacuum radiation are also discussed.
| physics.atom-ph quant-ph | we present a detailed analysis of the effects of photon statistics on multiphoton ionization through a detailed study of the role of intermediate states we evaluate the conditions under which the premise of nonresonant processes is valid the limitations of its validity are manifested in the dependence of the process on the stochastic properties of the radiation and found to be quite sensitive to the intensity the results are quantified through detailed calculations for coherent chaotic and squeezed vacuum radiation their significance in the context of recent developments in radiation sources such as the short wavelength free electron laser and squeezed vacuum radiation are also discussed | [['we', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'effects', 'of', 'photon', 'statistics', 'on', 'multiphoton', 'ionization', 'through', 'a', 'detailed', 'study', 'of', 'the', 'role', 'of', 'intermediate', 'states', 'we', 'evaluate', 'the', 'conditions', 'under', 'which', 'the', 'premise', 'of', 'nonresonant', 'processes', 'is', 'valid', 'the', 'limitations', 'of', 'its', 'validity', 'are', 'manifested', 'in', 'the', 'dependence', 'of', 'the', 'process', 'on', 'the', 'stochastic', 'properties', 'of', 'the', 'radiation', 'and', 'found', 'to', 'be', 'quite', 'sensitive', 'to', 'the', 'intensity', 'the', 'results', 'are', 'quantified', 'through', 'detailed', 'calculations', 'for', 'coherent', 'chaotic', 'and', 'squeezed', 'vacuum', 'radiation', 'their', 'significance', 'in', 'the', 'context', 'of', 'recent', 'developments', 'in', 'radiation', 'sources', 'such', 'as', 'the', 'short', 'wavelength', 'free', 'electron', 'laser', 'and', 'squeezed', 'vacuum', 'radiation', 'are', 'also', 'discussed']] | [-0.10130388153615882, 0.16799623463390712, -0.09516141328626787, 0.11513921255550914, -0.000924179214052856, -0.03909776393622863, 0.04145266265467793, 0.37993507371020485, -0.21274116287394515, -0.2694088832457673, 0.06929344734515257, -0.25873244688231145, -0.08392278107217038, 0.266936953643003, 0.0025083247993914586, 0.05622628655774466, 0.04833490198548391, -0.022957128595631076, -0.01881460682928281, -0.17009194731220323, 0.3406967575626694, 0.12508037296686111, 0.29721392703655547, 0.1204528605344679, 0.08537083775472809, 0.023711748913211643, -0.06927010029079919, -0.019825596493045043, -0.12144730105679834, 0.05861563762410474, 0.19630054527682797, 0.09864045464310725, 0.24931697333055847, -0.45413126271077486, -0.21565580194077963, 0.05936375721127129, 0.09351302311263697, 0.12954244545094212, -0.05412759486682502, -0.28519415174487905, 0.022111719131540013, -0.12286077140180289, -0.13159089177772226, -0.06262798549361387, -0.012056121470863526, 0.0439391528181556, -0.2430171096600803, 0.08577625639050242, 0.04084369211176516, 0.046252731446279456, -0.032523481479520853, -0.0650981370060933, -0.03004173677467372, 0.09278397236616825, 0.05364779739411117, -0.051117169951914614, 0.20155181665026214, -0.16903095134199797, -0.10563832570201243, 0.38627233581160597, -0.09057459706563573, -0.15402418063988663, 0.17690165640505137, -0.18544561259518816, -0.12294095586370325, 0.15292075183352385, 0.14636799237989592, 0.1493240794768768, -0.13606095027160953, 0.06117912967313731, 0.026023333360669466, 0.1442255845363691, 0.07409326472530528, 0.1544840200979895, 0.22526897050501815, 0.14986013988349237, -0.03906168163103877, 0.19299886580271083, -0.10131435972673572, -0.1008458827218076, -0.3564565492407331, -0.1053552035646478, -0.1427894655158216, 0.054008352639425966, -0.04719637482350732, -0.158991414073411, 0.4206291925698027, 0.16604044951744518, 0.14036990817249664, -0.03891158402998457, 0.32181707353173, 0.14898794913062616, -0.01759121675738397, -0.01624652569155859, 0.3184444052035446, 0.16653129372763326, 0.09696411155164242, -0.25479411822743714, 0.05370513332748504, -0.04855953204612476] |
1,803.02762 | Search for electroweak production of supersymmetric particles in final
states with two or three leptons at $\sqrt{s}=13$ TeV with the ATLAS detector | A search for the electroweak production of charginos, neutralinos and
sleptons decaying into final states involving two or three electrons or muons
is presented. The analysis is based on 36.1 fb$^{-1}$ of $\sqrt{s}=13$ TeV
proton-proton collisions recorded by the ATLAS detector at the Large Hadron
Collider. Several scenarios based on simplified models are considered. These
include the associated production of the next-to-lightest neutralino and the
lightest chargino, followed by their decays into final states with leptons and
the lightest neutralino via either sleptons or Standard Model gauge bosons;
direct production of chargino pairs, which in turn decay into leptons and the
lightest neutralino via intermediate sleptons; and slepton pair production,
where each slepton decays directly into the lightest neutralino and a lepton.
No significant deviations from the Standard Model expectation are observed and
stringent limits at 95% confidence level are placed on the masses of relevant
supersymmetric particles in each of these scenarios. For a massless lightest
neutralino, masses up to 580 GeV are excluded for the associated production of
the next-to-lightest neutralino and the lightest chargino, assuming gauge-boson
mediated decays, whereas for slepton-pair production masses up to 500 GeV are
excluded assuming three generations of mass-degenerate sleptons.
| hep-ex | a search for the electroweak production of charginos neutralinos and sleptons decaying into final states involving two or three electrons or muons is presented the analysis is based on 361 fb1 of sqrts13 tev protonproton collisions recorded by the atlas detector at the large hadron collider several scenarios based on simplified models are considered these include the associated production of the nexttolightest neutralino and the lightest chargino followed by their decays into final states with leptons and the lightest neutralino via either sleptons or standard model gauge bosons direct production of chargino pairs which in turn decay into leptons and the lightest neutralino via intermediate sleptons and slepton pair production where each slepton decays directly into the lightest neutralino and a lepton no significant deviations from the standard model expectation are observed and stringent limits at 95 confidence level are placed on the masses of relevant supersymmetric particles in each of these scenarios for a massless lightest neutralino masses up to 580 gev are excluded for the associated production of the nexttolightest neutralino and the lightest chargino assuming gaugeboson mediated decays whereas for sleptonpair production masses up to 500 gev are excluded assuming three generations of massdegenerate sleptons | [['a', 'search', 'for', 'the', 'electroweak', 'production', 'of', 'charginos', 'neutralinos', 'and', 'sleptons', 'decaying', 'into', 'final', 'states', 'involving', 'two', 'or', 'three', 'electrons', 'or', 'muons', 'is', 'presented', 'the', 'analysis', 'is', 'based', 'on', '361', 'fb1', 'of', 'sqrts13', 'tev', 'protonproton', 'collisions', 'recorded', 'by', 'the', 'atlas', 'detector', 'at', 'the', 'large', 'hadron', 'collider', 'several', 'scenarios', 'based', 'on', 'simplified', 'models', 'are', 'considered', 'these', 'include', 'the', 'associated', 'production', 'of', 'the', 'nexttolightest', 'neutralino', 'and', 'the', 'lightest', 'chargino', 'followed', 'by', 'their', 'decays', 'into', 'final', 'states', 'with', 'leptons', 'and', 'the', 'lightest', 'neutralino', 'via', 'either', 'sleptons', 'or', 'standard', 'model', 'gauge', 'bosons', 'direct', 'production', 'of', 'chargino', 'pairs', 'which', 'in', 'turn', 'decay', 'into', 'leptons', 'and', 'the', 'lightest', 'neutralino', 'via', 'intermediate', 'sleptons', 'and', 'slepton', 'pair', 'production', 'where', 'each', 'slepton', 'decays', 'directly', 'into', 'the', 'lightest', 'neutralino', 'and', 'a', 'lepton', 'no', 'significant', 'deviations', 'from', 'the', 'standard', 'model', 'expectation', 'are', 'observed', 'and', 'stringent', 'limits', 'at', '95', 'confidence', 'level', 'are', 'placed', 'on', 'the', 'masses', 'of', 'relevant', 'supersymmetric', 'particles', 'in', 'each', 'of', 'these', 'scenarios', 'for', 'a', 'massless', 'lightest', 'neutralino', 'masses', 'up', 'to', '580', 'gev', 'are', 'excluded', 'for', 'the', 'associated', 'production', 'of', 'the', 'nexttolightest', 'neutralino', 'and', 'the', 'lightest', 'chargino', 'assuming', 'gaugeboson', 'mediated', 'decays', 'whereas', 'for', 'sleptonpair', 'production', 'masses', 'up', 'to', '500', 'gev', 'are', 'excluded', 'assuming', 'three', 'generations', 'of', 'massdegenerate', 'sleptons']] | [-0.04951246721303147, 0.39882516518889016, 0.02054581685800745, 0.26557474775884227, -0.031774491907774725, -0.22027531711177695, 0.039554024406243116, 0.28955956578790915, -0.1731885182630092, -0.317859210958234, 0.0014181665880981871, -0.36709684539572196, 0.19439900969978272, 0.14473007101744337, 0.14365699505692142, 0.10760260224248273, 0.19422512515118778, -0.012320303576857303, -0.0037796459786330508, -0.273646525685873, 0.253189972936966, -0.003921655513524934, 0.11862694482187355, 0.13315947118304633, 0.028972877361200224, 0.0034502338420486812, -0.012372273340882414, -0.21415487490829568, -0.07161963162379283, 0.0710104998238467, 0.15171257438070293, 0.0853046269715773, 0.06733074688324422, -0.33426908805679456, -0.0415438010918157, 0.24744024386422503, 0.21422745429468576, 0.0075444729364891015, -0.10709234989998448, -0.41993710346933866, 0.1395880899114553, -0.25826450085239205, -0.009848443032218839, 0.021150243128743963, -0.08129202970538778, -0.17251313927482267, -0.3535581764417014, 0.14795641284530062, -0.13319088211000868, -0.03596176902852915, 0.02203131093046242, -0.2576505281889548, -0.19624539550318562, -0.06698517616005671, 0.2254327168168425, -0.08079992590964222, 0.24998716371265625, -0.16667093160724494, -0.2328636492108644, 0.4380334475256427, -0.09468022855751292, -0.16920062164644326, 0.2197208903363031, -0.12507558955970888, -0.15266492527279288, 0.19997070150713275, 0.2973816552777972, 0.10429889653724703, -0.21353269769161037, 0.17500050817239993, -0.0071717511481520805, 0.19969740057730992, 0.12963375866629484, 0.05898455606075004, 0.3405106476992557, 0.27365491109914286, 0.02166820986836095, 0.04316468821424577, -0.08395315846487071, -0.08546780955018193, -0.49598454539146686, -0.1272066271337069, -0.012787933550737422, 0.01667690817196148, -0.03744613126521775, -0.04432096129231569, 0.39299103129194163, 0.05338136566040868, 0.31998368803261207, 0.03237503211924129, 0.34454909002060313, 0.05305149416072351, 0.06928591749168148, 0.04019968498948282, 0.368390969962653, 0.1405789265044579, 0.08661723098567113, -0.16616524290999002, -0.060855027972579454, 0.09283918220634488] |
1,803.02763 | A Convergent Star Product on the Poincar\'e Disc | On the Poincar\'e disc and its higher-dimensional analogs one has a canonical
formal star product of Wick type. We define a locally convex topology on a
certain class of real-analytic functions on the disc for which the star product
is continuous and converges as a series. The resulting Fr\'echet algebra is
characterized explicitly in terms of the set of all holomorphic functions on an
extended and doubled disc of twice the dimension endowed with the natural
topology of locally uniform convergence. We discuss the holomorphic dependence
on the deformation parameter and the positive functionals and their GNS
representations of the resulting Fr\'echet algebra.
| math.CV math.FA math.OA math.QA | on the poincare disc and its higherdimensional analogs one has a canonical formal star product of wick type we define a locally convex topology on a certain class of realanalytic functions on the disc for which the star product is continuous and converges as a series the resulting frechet algebra is characterized explicitly in terms of the set of all holomorphic functions on an extended and doubled disc of twice the dimension endowed with the natural topology of locally uniform convergence we discuss the holomorphic dependence on the deformation parameter and the positive functionals and their gns representations of the resulting frechet algebra | [['on', 'the', 'poincare', 'disc', 'and', 'its', 'higherdimensional', 'analogs', 'one', 'has', 'a', 'canonical', 'formal', 'star', 'product', 'of', 'wick', 'type', 'we', 'define', 'a', 'locally', 'convex', 'topology', 'on', 'a', 'certain', 'class', 'of', 'realanalytic', 'functions', 'on', 'the', 'disc', 'for', 'which', 'the', 'star', 'product', 'is', 'continuous', 'and', 'converges', 'as', 'a', 'series', 'the', 'resulting', 'frechet', 'algebra', 'is', 'characterized', 'explicitly', 'in', 'terms', 'of', 'the', 'set', 'of', 'all', 'holomorphic', 'functions', 'on', 'an', 'extended', 'and', 'doubled', 'disc', 'of', 'twice', 'the', 'dimension', 'endowed', 'with', 'the', 'natural', 'topology', 'of', 'locally', 'uniform', 'convergence', 'we', 'discuss', 'the', 'holomorphic', 'dependence', 'on', 'the', 'deformation', 'parameter', 'and', 'the', 'positive', 'functionals', 'and', 'their', 'gns', 'representations', 'of', 'the', 'resulting', 'frechet', 'algebra']] | [-0.13002406827454427, 0.06586461349345803, -0.07412913188482952, 0.09430663192020819, -0.09218619119158937, -0.018161524182131277, -0.007225886197507526, 0.3445509493857333, -0.31985745253493486, -0.18000618072940958, 0.1323959860663626, -0.23343110571895698, -0.1385322108105259, 0.20245985520406834, -0.09430725375208461, 0.02348463420102879, 0.010249469573926, 0.10412274792935085, -0.1654896163155587, -0.2607668415887408, 0.43816014586323965, -0.008743766586757401, 0.2095384368406229, -0.010555593929823163, 0.14893043735200195, 0.01506455482358963, -0.030821653354225806, -0.0016834821362156892, -0.16278397260477892, 0.13959034172551327, 0.18912817928849637, 0.09492850269968577, 0.23986593671640363, -0.38272293508776184, -0.14310869260790568, 0.13852164477507756, 0.09814718057338184, -0.05815417947726849, -0.002022467509535982, -0.2687486816306137, 0.0587340457096766, -0.18630631049208848, -0.14464511149517686, -0.09407443520658225, 0.049057671221569905, 0.024044824330118095, -0.25035831539267767, 0.03138851445819278, 0.11911372411137139, 0.08995736956379367, -0.12432066153269261, -0.04225333657531628, -0.11087480330166126, 0.06275367775583839, 0.007360246706102948, 0.1065664629992188, 0.15520614584076028, -0.07974332741922835, -0.09608574089361355, 0.3494251230867236, -0.06719010845911734, -0.2783546251362389, 0.18955540780014205, -0.20197705259022203, -0.14446202212564865, 0.0747804280587481, 0.1330113094209612, 0.16819926432686524, -0.05577648195971563, 0.20725458965905788, -0.08057205947748955, 0.07307326549876626, 0.08746534538934532, 0.045050780822351144, 0.17673349632764035, 0.09883082863757188, 0.13241417213677636, 0.1672174531098419, -0.02874194781603382, -0.11898251040612609, -0.3552982633011144, -0.16946149031401078, -0.16963638478632365, 0.12196777959679733, -0.17618341496577644, -0.24948409331727375, 0.44703480246865634, -0.0350625903200973, 0.21044706593005402, 0.12090216202376573, 0.20114132615588426, 0.15319270686513758, 0.08871564163500895, 0.06974488669934059, 0.16192453022304815, 0.19390536043612125, 0.021225908838972015, -0.17483914351244503, 0.03361932544073867, 0.15627494728355443] |
1,803.02764 | Placebo inference on treatment effects when the number of clusters is
small | I introduce a general, Fisher-style randomization testing framework to
conduct nearly exact inference about the lack of effect of a binary treatment
in the presence of very few, large clusters when the treatment effect is
identified across clusters. The proposed randomization test formalizes and
extends the intuitive notion of generating null distributions by assigning
placebo treatments to untreated clusters. I show that under simple and easily
verifiable conditions, the placebo test leads to asymptotically valid inference
in a very large class of empirically relevant models. Examples discussed
explicitly are (i) least squares regression with cluster-level treatment, (ii)
difference-in-differences estimation, and (iii) binary choice models with
cluster-level treatment. A simulation study and an empirical example are
provided. The proposed inference procedure is easy to implement and performs
well with as few as three treated and three untreated clusters.
| stat.ME | i introduce a general fisherstyle randomization testing framework to conduct nearly exact inference about the lack of effect of a binary treatment in the presence of very few large clusters when the treatment effect is identified across clusters the proposed randomization test formalizes and extends the intuitive notion of generating null distributions by assigning placebo treatments to untreated clusters i show that under simple and easily verifiable conditions the placebo test leads to asymptotically valid inference in a very large class of empirically relevant models examples discussed explicitly are i least squares regression with clusterlevel treatment ii differenceindifferences estimation and iii binary choice models with clusterlevel treatment a simulation study and an empirical example are provided the proposed inference procedure is easy to implement and performs well with as few as three treated and three untreated clusters | [['i', 'introduce', 'a', 'general', 'fisherstyle', 'randomization', 'testing', 'framework', 'to', 'conduct', 'nearly', 'exact', 'inference', 'about', 'the', 'lack', 'of', 'effect', 'of', 'a', 'binary', 'treatment', 'in', 'the', 'presence', 'of', 'very', 'few', 'large', 'clusters', 'when', 'the', 'treatment', 'effect', 'is', 'identified', 'across', 'clusters', 'the', 'proposed', 'randomization', 'test', 'formalizes', 'and', 'extends', 'the', 'intuitive', 'notion', 'of', 'generating', 'null', 'distributions', 'by', 'assigning', 'placebo', 'treatments', 'to', 'untreated', 'clusters', 'i', 'show', 'that', 'under', 'simple', 'and', 'easily', 'verifiable', 'conditions', 'the', 'placebo', 'test', 'leads', 'to', 'asymptotically', 'valid', 'inference', 'in', 'a', 'very', 'large', 'class', 'of', 'empirically', 'relevant', 'models', 'examples', 'discussed', 'explicitly', 'are', 'i', 'least', 'squares', 'regression', 'with', 'clusterlevel', 'treatment', 'ii', 'differenceindifferences', 'estimation', 'and', 'iii', 'binary', 'choice', 'models', 'with', 'clusterlevel', 'treatment', 'a', 'simulation', 'study', 'and', 'an', 'empirical', 'example', 'are', 'provided', 'the', 'proposed', 'inference', 'procedure', 'is', 'easy', 'to', 'implement', 'and', 'performs', 'well', 'with', 'as', 'few', 'as', 'three', 'treated', 'and', 'three', 'untreated', 'clusters']] | [-0.048743221347275024, 0.03872715005822743, -0.061961411491639036, 0.12564141947779503, -0.09253731796771343, -0.21670183632351622, 0.07256014362706885, 0.4148642387624611, -0.17928708532674456, -0.3482196128119112, 0.10585875194930636, -0.22172013132641202, -0.13282884418731555, 0.18391868906088776, -0.0732257882345413, 0.04116606144303018, 0.09271060105717932, -0.01994767564568011, -0.04664984389091842, -0.2996073273979538, 0.26519443825065325, 0.07086607382756055, 0.31100736325606704, -0.02463919009802767, 0.09250845633419778, 0.038140278502182545, -0.06676477515686523, 0.08249915928086814, -0.10007358937523617, 0.07153917452823781, 0.26875414630049976, 0.18388912181356265, 0.3614298625239719, -0.378941919955918, -0.19740955805515542, 0.0737766228369711, 0.10279420813303124, 0.11839235334157232, -0.047122725405429, -0.25836714218295287, 0.06172879642176935, -0.19729583239292398, -0.10481259536840405, -0.12284633869336069, -0.030312603161505917, -0.016179361560395646, -0.32478489480940076, 0.11411602810874362, 0.057795961299287976, 0.08392636903890353, -0.055698855711585456, -0.14702695810753058, 0.043605639071970737, 0.11104380370820496, 0.08549475005266312, -0.04094260858597837, 0.11114330190535196, -0.08761085740715156, -0.09859212429771158, 0.3698988171321723, 0.002717908920364126, -0.2294626874191796, 0.22652888150461128, -0.10018819348153878, -0.13957972933456084, 0.05385049224338111, 0.15998644909739276, 0.15619961147689643, -0.19192348336272355, 0.01285718179818051, -0.031031306099869066, 0.12953620731337545, 0.02761979738373638, -0.039913492692850175, 0.1734409464235582, 0.17343006788081872, 0.018912207629695973, 0.1576623778845019, -0.10834642877179089, -0.11469837224028785, -0.3314761624616735, -0.09546446566973292, -0.12367638350491796, 0.013827941620119792, -0.10014010031698169, -0.21318734357106117, 0.34060844653012123, 0.17776217791534316, 0.18418189513099872, 0.10522768597665537, 0.273203763528727, 0.05048987182261258, 0.06216381112512061, 0.07057412057046723, 0.16063153798527577, 0.12240005217951394, -0.0232219690189916, -0.19441510634907685, 0.1498079344010501, -0.018394034221701612] |
1,803.02765 | Realizing Intelligence | Order exists in the world. The intelligence process enables us to realize
that order, to some extent. We provide a high level description of intelligence
using simple definitions, basic building blocks, a conceptual framework and
general hierarchy. This perspective includes multiple levels of abstraction
occurring in space and in time. The resulting model offers simple, useful ways
to help realize the essence of intelligence.
| q-bio.NC cs.AI | order exists in the world the intelligence process enables us to realize that order to some extent we provide a high level description of intelligence using simple definitions basic building blocks a conceptual framework and general hierarchy this perspective includes multiple levels of abstraction occurring in space and in time the resulting model offers simple useful ways to help realize the essence of intelligence | [['order', 'exists', 'in', 'the', 'world', 'the', 'intelligence', 'process', 'enables', 'us', 'to', 'realize', 'that', 'order', 'to', 'some', 'extent', 'we', 'provide', 'a', 'high', 'level', 'description', 'of', 'intelligence', 'using', 'simple', 'definitions', 'basic', 'building', 'blocks', 'a', 'conceptual', 'framework', 'and', 'general', 'hierarchy', 'this', 'perspective', 'includes', 'multiple', 'levels', 'of', 'abstraction', 'occurring', 'in', 'space', 'and', 'in', 'time', 'the', 'resulting', 'model', 'offers', 'simple', 'useful', 'ways', 'to', 'help', 'realize', 'the', 'essence', 'of', 'intelligence']] | [-0.09821285816360614, 0.06403345112630632, -0.1082205142301973, 0.09252932825907578, -0.1481635325762909, -0.13011329756409395, 0.0885359423191403, 0.34016272565349936, -0.28412860442040255, -0.34461508481763303, 0.0243715990200144, -0.17470321246946696, -0.20880814549309434, 0.17034088431319105, -0.09813458466669545, 0.009763875917997211, 0.002771910840237979, 0.015395957391319826, -0.02375881387706613, -0.22409454734588508, 0.30230733125063125, 0.07720863878057571, 0.32138101145392284, 0.03661155611916911, 0.14217143559653778, -0.01200761235668324, 0.006186089836774045, -0.007466414150712808, -0.11924870675522925, 0.23258280019217636, 0.33618146099252044, 0.21520863378827926, 0.2990965727949515, -0.4783132756128907, -0.1828963088009914, 0.08215819965698756, 0.11046870160498656, 0.13975764758060905, -0.013102940582029987, -0.23785693163517863, 0.05235575582628371, -0.1876102475944208, -0.18593293143203482, -0.17402546672383323, -0.023816168803023174, -0.0961966592585668, -0.24387439617566997, -0.023408752764225937, 0.07257079182363668, 0.05891812450136058, -0.005093421852507163, -0.07405792586905591, 0.08329050071188249, 0.20208771259785863, -0.030664400494515576, -0.003975272270963615, 0.09641308522986947, -0.08839123823781847, -0.17060083762044087, 0.44692057743668556, -0.023313287882047007, -0.1830369077870273, 0.2634343928657472, -0.08248243343405193, -0.17639248151681386, 0.08543921814634814, 0.1988415169489599, 0.028400143230101094, -0.15595644092536531, 0.0965525598712702, 0.02052296561305411, 0.1619794006983284, 0.05479305910921539, 0.057870263209224504, 0.24646567381569184, 0.23915820506590535, 0.04919570928905159, 0.11674682848388329, -0.026104489792487584, -0.17190307192868204, -0.28804586250862485, -0.18581243029620964, -0.07024079086841084, 0.017051386003004154, -0.06957400520286683, -0.12465988102485426, 0.427812652393186, 0.24315027022385038, 0.19265242641267832, 0.0455019418586744, 0.28116816322108207, 0.11476901029527653, 0.06810035993112251, 0.01021971189766191, 0.127032180144397, 0.0861832601876813, 0.12345518906658981, -0.1224337064086285, 0.056647510529728606, 0.06943101563956589] |
1,803.02766 | Fractal Dimension of the Kronecker Product Based Fractals | A simple method of calculating the Hausdorff-Besicovitch dimension of the
Kronecker Product based fractals is presented together with a compact R script
realizing it. The proposed new formula is based on traditionally used values of
the number of self-similar objects and the scale factor that are now calculated
using appropriate values of both the initial fractal matrix and the second
order resultant matrix. This method is reliable and producing dimensions equal
to many already determined values of well-known fractals.
| math.DS | a simple method of calculating the hausdorffbesicovitch dimension of the kronecker product based fractals is presented together with a compact r script realizing it the proposed new formula is based on traditionally used values of the number of selfsimilar objects and the scale factor that are now calculated using appropriate values of both the initial fractal matrix and the second order resultant matrix this method is reliable and producing dimensions equal to many already determined values of wellknown fractals | [['a', 'simple', 'method', 'of', 'calculating', 'the', 'hausdorffbesicovitch', 'dimension', 'of', 'the', 'kronecker', 'product', 'based', 'fractals', 'is', 'presented', 'together', 'with', 'a', 'compact', 'r', 'script', 'realizing', 'it', 'the', 'proposed', 'new', 'formula', 'is', 'based', 'on', 'traditionally', 'used', 'values', 'of', 'the', 'number', 'of', 'selfsimilar', 'objects', 'and', 'the', 'scale', 'factor', 'that', 'are', 'now', 'calculated', 'using', 'appropriate', 'values', 'of', 'both', 'the', 'initial', 'fractal', 'matrix', 'and', 'the', 'second', 'order', 'resultant', 'matrix', 'this', 'method', 'is', 'reliable', 'and', 'producing', 'dimensions', 'equal', 'to', 'many', 'already', 'determined', 'values', 'of', 'wellknown', 'fractals']] | [-0.07252458557250756, 0.09945056964702244, -0.08848983625869584, 0.06570856478890474, -0.07247097117684875, -0.12847078546492643, -0.00516300051932848, 0.3292203801507248, -0.2194249733127182, -0.2681487584486604, 0.13597331061676332, -0.2183298779816567, -0.15299568930640817, 0.24037707104241546, -0.003475534305259397, 0.09258556307814396, 0.02463470723279575, 0.0625805629334778, -0.06967655122221177, -0.25129373953972434, 0.35367087187552, 0.05062646738288901, 0.2824363894808501, 0.0344075650342186, 0.13263054674535862, -0.021206734984924522, -0.0747229152630213, 0.0617291464682527, -0.12461439752113147, 0.19692291368294176, 0.19988066425747414, 0.09913355639140649, 0.20642764010478423, -0.3498343816970157, -0.1591432193364901, 0.11645360833293275, 0.11161437615917265, 0.07312617005921807, -0.01579579354199003, -0.26095372213262924, 0.1347274768602433, -0.18022127464101237, -0.15516009439914663, -0.08843891647396775, 0.07563087030585054, 0.007174281715828029, -0.2950358229653933, 0.050364008745107845, 0.03132518891339438, 0.04754851652380032, -0.03384573046778199, -0.18740615087172277, -0.002969535960686169, 0.14169193373232655, 0.014448832257804049, -0.005382971779172179, 0.09799718663473672, -0.06197839005425855, -0.09191266022316075, 0.38647996190393086, -0.029969938413263595, -0.22228240306139924, 0.17303483070263379, -0.1426682171022779, -0.1182535815618555, 0.13801149736288226, 0.11737674319250155, 0.12575359523437823, -0.13127081405041338, 0.0818464957697824, -0.05707667703162643, 0.17692505419283774, 0.09116291330797197, -0.008220438597888886, 0.12104261310511752, 0.1620701802128195, 0.014397728320983344, 0.12684010988384298, -0.05233572374055268, -0.08714359513000597, -0.27581235745632904, -0.14827507606389212, -0.26238600553685354, 0.022453928171786704, -0.17547613497225928, -0.2079005563938165, 0.3970855457613928, 0.1119009891194822, 0.23181852149111043, 0.05887440102811478, 0.2757702098475604, 0.17292086139639629, 0.1100196229777287, 0.08497104942916503, 0.15154671492762392, 0.15948516778836522, 0.04218722013402966, -0.1419917675287056, 0.05445815840311631, 0.1663442449113708] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.