id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0146 | Diamagnetism of 2D-Fermions in the Strong Nonhomogeneous Static Magnetic
Field $( {\bf B} =B( 0, 0, 1/cosh^{2}( \frac{x-x_{0} }{ \delta })))$ : gas
magnetization, ... and gas compressibility | We study diamagnetism of a gas of fermions moving in a nonhomogeneous
magnetic field $( {\bf B} =B( 0, 0, 1/cosh^{2}( \frac{x-x_{0} }{ \delta })))$
The gas magnetization, the static magnetic susceptibility, the chemical
potential and the gas compressibility are discussed and compared with the
uniform field case. General need to study dynamics of electrons in different
types of magnetic fields follows from a large number of experimental situations
in which its understanding enables physicists to obtain new information.
| cond-mat.mes-hall quant-ph | we study diamagnetism of a gas of fermions moving in a nonhomogeneous magnetic field bf b b 0 0 1cosh2 fracxx_0 delta the gas magnetization the static magnetic susceptibility the chemical potential and the gas compressibility are discussed and compared with the uniform field case general need to study dynamics of electrons in different types of magnetic fields follows from a large number of experimental situations in which its understanding enables physicists to obtain new information | [['we', 'study', 'diamagnetism', 'of', 'a', 'gas', 'of', 'fermions', 'moving', 'in', 'a', 'nonhomogeneous', 'magnetic', 'field', 'bf', 'b', 'b', '0', '0', '1cosh2', 'fracxx_0', 'delta', 'the', 'gas', 'magnetization', 'the', 'static', 'magnetic', 'susceptibility', 'the', 'chemical', 'potential', 'and', 'the', 'gas', 'compressibility', 'are', 'discussed', 'and', 'compared', 'with', 'the', 'uniform', 'field', 'case', 'general', 'need', 'to', 'study', 'dynamics', 'of', 'electrons', 'in', 'different', 'types', 'of', 'magnetic', 'fields', 'follows', 'from', 'a', 'large', 'number', 'of', 'experimental', 'situations', 'in', 'which', 'its', 'understanding', 'enables', 'physicists', 'to', 'obtain', 'new', 'information']] | [-0.17569070412837146, 0.1851288973718781, -0.01994191107617037, 0.02465760300086962, -0.0639884857762907, -0.12325688850487003, 0.05234814168550263, 0.3218663077096681, -0.2534427744009205, -0.3065921576674776, 0.004980706243234611, -0.2627135419374886, -0.06643925872757225, 0.1685143617309026, 0.02139293265252097, -0.005997342951878956, -0.022215411985746107, 0.058956205303705225, -0.07545558092061656, -0.20309857739689383, 0.3021442509646452, -0.010827055389716013, 0.25521631802218286, 0.06906227618959304, 0.01169800155519231, -0.006193829178054993, 0.0175223659119896, 0.0729409331405485, -0.15784635425016685, 0.03067943765278402, 0.16802145441289287, -0.0022221754015599553, 0.23970452262516562, -0.42686988974644524, -0.22270759049098235, 0.08290894907219587, 0.11490977306321666, 0.12068906401730822, -0.07941380396762208, -0.27955926675034837, 0.030319532329166256, -0.12343042053131235, -0.18568075508684725, -0.12132148077157703, 0.027845736640203442, 0.06676482683601412, -0.3205088375992066, 0.12596828809536592, 0.05677638654251004, 0.11491623761233043, -0.11538636739636343, -0.13183484165268522, -0.013332316242913539, 0.10384450423707431, 0.08743465090220845, 0.11162986665353733, 0.1666224840241862, -0.18543675729400805, -0.0718912341493509, 0.3938807674582947, -0.0670416823154114, -0.14395713215895198, 0.22395669342163396, -0.22962811938486993, -0.08847257160153743, 0.13057814489081, 0.1740387559402734, 0.11210579138148476, -0.15227755609698393, 0.1208939824640323, -0.0455079547466232, 0.10352965519839041, 0.027149099258806656, 0.019525518015536758, 0.2616358155359489, 0.14165062741754023, 0.009446937534202999, 0.15508770262444946, -0.11141620717967886, -0.07449245386807299, -0.26701237910704034, -0.1949590395355748, -0.16859105395505558, 0.0983813597216598, -0.08008255347620533, -0.17619688550916476, 0.38007677517629956, 0.18074628896382008, 0.17134668640918224, -0.05069403357747187, 0.27261562232632897, 0.07291854487109073, 0.020282631187787833, 0.09983385945796161, 0.18649525972511116, 0.24074322051947583, 0.18024582186764157, -0.25162196597965386, -0.021666098725856155, -0.008256507971374368] |
1,802.01461 | The expressiveness of quasiperiodic and minimal shifts of finite type | We study multidimensional minimal and quasiperiodic shifts of finite type. We
prove for these classes several results that were previously known for the
shifts of finite type in general, without restriction. We show that some
quasiperiodic shifts of finite type admit only non-computable configurations;
we characterize the classes of Turing degrees that can be represented by
quasiperiodic shifts of finite type. We also transpose to the classes of
minimal/quasiperiodic shifts of finite type some results on subdynamics
previously known for the effective shifts without restrictions: every effective
minimal (quasiperiodic) shift of dimension $d$ can be represented as a
projection of a subdynamics of a minimal (respectively, quasiperiodic) shift of
finite type of dimension $d+1$.
| cs.DM | we study multidimensional minimal and quasiperiodic shifts of finite type we prove for these classes several results that were previously known for the shifts of finite type in general without restriction we show that some quasiperiodic shifts of finite type admit only noncomputable configurations we characterize the classes of turing degrees that can be represented by quasiperiodic shifts of finite type we also transpose to the classes of minimalquasiperiodic shifts of finite type some results on subdynamics previously known for the effective shifts without restrictions every effective minimal quasiperiodic shift of dimension d can be represented as a projection of a subdynamics of a minimal respectively quasiperiodic shift of finite type of dimension d1 | [['we', 'study', 'multidimensional', 'minimal', 'and', 'quasiperiodic', 'shifts', 'of', 'finite', 'type', 'we', 'prove', 'for', 'these', 'classes', 'several', 'results', 'that', 'were', 'previously', 'known', 'for', 'the', 'shifts', 'of', 'finite', 'type', 'in', 'general', 'without', 'restriction', 'we', 'show', 'that', 'some', 'quasiperiodic', 'shifts', 'of', 'finite', 'type', 'admit', 'only', 'noncomputable', 'configurations', 'we', 'characterize', 'the', 'classes', 'of', 'turing', 'degrees', 'that', 'can', 'be', 'represented', 'by', 'quasiperiodic', 'shifts', 'of', 'finite', 'type', 'we', 'also', 'transpose', 'to', 'the', 'classes', 'of', 'minimalquasiperiodic', 'shifts', 'of', 'finite', 'type', 'some', 'results', 'on', 'subdynamics', 'previously', 'known', 'for', 'the', 'effective', 'shifts', 'without', 'restrictions', 'every', 'effective', 'minimal', 'quasiperiodic', 'shift', 'of', 'dimension', 'd', 'can', 'be', 'represented', 'as', 'a', 'projection', 'of', 'a', 'subdynamics', 'of', 'a', 'minimal', 'respectively', 'quasiperiodic', 'shift', 'of', 'finite', 'type', 'of', 'dimension', 'd1']] | [-0.15338090335768936, 0.20787447824480787, -0.008497316157445312, 0.10782277401726265, -0.0996551933426377, -0.14912755679817194, 0.06398816849208082, 0.3690231224167598, -0.29251551611629206, -0.20439131988163015, 0.12781222457111507, -0.2302531986044044, -0.15376696265838316, 0.24723401317883908, -0.07918097265064716, 0.0006767978842279552, 0.04506941860854889, 0.09796756735912203, -0.14558604403514316, -0.23380650404791256, 0.35782230876188365, -0.09581572956413822, 0.18649099752372872, 0.019919795816582916, 0.0781898540568299, -0.012305093958017837, -0.0011163653179475691, 0.10220900450552921, -0.12817750490301205, 0.11220105020823863, 0.22299749310235534, 0.10607368751857595, 0.20624829552639112, -0.34363737319409643, -0.2619091314140015, 0.20133545108971937, 0.13198109378675577, 0.14949090173055904, -0.004385891113949494, -0.25877992088486135, 0.13123236281335748, -0.16739032814069033, -0.21013239409918258, -0.08963770521557436, 0.06610767389194364, 0.08233211496721261, -0.25320163546377317, 0.03914335766004654, 0.14710917182893088, 0.12772540535481103, -0.08611599692201193, -0.1049938766868884, -0.011005113498859964, 0.12840028236974524, -0.0385470917547303, -0.051951501504064794, 0.02545942802062522, -0.029171489951802434, -0.17773675947425377, 0.3515653424212231, -0.11139131701691488, -0.23166406169879886, 0.2031013440274823, -0.14395264402213218, -0.16105281122325532, 0.1430800961726139, 0.1349230041084564, 0.10850425183245566, -0.06955791244373978, 0.12534661574517914, -0.08831265546068286, 0.16523606534655808, 0.1578327363307497, 0.07444017217958149, 0.107483316592015, 0.0711444345574859, 0.0848424235210482, 0.15650886591663996, -0.045889096373725125, -0.04384237267406641, -0.37060160432999906, -0.0945152578694103, -0.14491147182848865, 0.07069427403003241, -0.09490038594630221, -0.2161503563165269, 0.4068617314364003, 0.05162608119519015, 0.19986052675156202, 0.054699947682530746, 0.16134617517216016, 0.13438245429826357, 0.06579456575610469, 0.03840870082592674, 0.15327819122415678, 0.1169739123804709, 0.007161509175578841, -0.2367854099020164, 0.016158897058823996, 0.14449344452602408] |
1,802.01462 | Compact group actions with the Rokhlin property | We provide a systematic and in-depth study of compact group actions with the
Rokhlin property. It is show that the Rokhlin property is generic in some cases
of interest; the case of totally disconnected groups being the most
satisfactory one. One of our main results asserts that the inclusion of the
fixed point algebra induces an order-embedding on K-theory, and that it has a
splitting whenever it is restricted to finitely generated subgroups.
We develop new results in the context of equivariant semiprojectivity to
study actions with the Rokhlin property. For example, we characterize when the
translation action of a compact group on itself is equivariantly
semiprojective. As an application, it is shown that every Rokhlin action of a
compact Lie group of dimension at most one is a dual action. Similarly, for an
action of a compact Lie group G on C(X), the Rokhlin property is equivalent to
freeness together with triviality of the principal G-bundle $X\to X/G$.
| math.OA math.DS | we provide a systematic and indepth study of compact group actions with the rokhlin property it is show that the rokhlin property is generic in some cases of interest the case of totally disconnected groups being the most satisfactory one one of our main results asserts that the inclusion of the fixed point algebra induces an orderembedding on ktheory and that it has a splitting whenever it is restricted to finitely generated subgroups we develop new results in the context of equivariant semiprojectivity to study actions with the rokhlin property for example we characterize when the translation action of a compact group on itself is equivariantly semiprojective as an application it is shown that every rokhlin action of a compact lie group of dimension at most one is a dual action similarly for an action of a compact lie group g on cx the rokhlin property is equivalent to freeness together with triviality of the principal gbundle xto xg | [['we', 'provide', 'a', 'systematic', 'and', 'indepth', 'study', 'of', 'compact', 'group', 'actions', 'with', 'the', 'rokhlin', 'property', 'it', 'is', 'show', 'that', 'the', 'rokhlin', 'property', 'is', 'generic', 'in', 'some', 'cases', 'of', 'interest', 'the', 'case', 'of', 'totally', 'disconnected', 'groups', 'being', 'the', 'most', 'satisfactory', 'one', 'one', 'of', 'our', 'main', 'results', 'asserts', 'that', 'the', 'inclusion', 'of', 'the', 'fixed', 'point', 'algebra', 'induces', 'an', 'orderembedding', 'on', 'ktheory', 'and', 'that', 'it', 'has', 'a', 'splitting', 'whenever', 'it', 'is', 'restricted', 'to', 'finitely', 'generated', 'subgroups', 'we', 'develop', 'new', 'results', 'in', 'the', 'context', 'of', 'equivariant', 'semiprojectivity', 'to', 'study', 'actions', 'with', 'the', 'rokhlin', 'property', 'for', 'example', 'we', 'characterize', 'when', 'the', 'translation', 'action', 'of', 'a', 'compact', 'group', 'on', 'itself', 'is', 'equivariantly', 'semiprojective', 'as', 'an', 'application', 'it', 'is', 'shown', 'that', 'every', 'rokhlin', 'action', 'of', 'a', 'compact', 'lie', 'group', 'of', 'dimension', 'at', 'most', 'one', 'is', 'a', 'dual', 'action', 'similarly', 'for', 'an', 'action', 'of', 'a', 'compact', 'lie', 'group', 'g', 'on', 'cx', 'the', 'rokhlin', 'property', 'is', 'equivalent', 'to', 'freeness', 'together', 'with', 'triviality', 'of', 'the', 'principal', 'gbundle', 'xto', 'xg']] | [-0.17588111481105076, 0.08569989618199142, -0.14229521001015538, 0.049459451548140146, -0.1123638279932264, -0.1273281765961141, -0.00477916660642474, 0.4077363846729855, -0.29763219842786826, -0.15745431134102386, 0.1394140698651215, -0.2822534054251968, -0.14731655198254817, 0.21352755992362896, -0.16925888950204324, -0.054560870042000456, 0.07496839320966564, 0.18359885569358003, -0.06682573740792302, -0.2445518221475884, 0.4258419306679342, -0.015016703579410817, 0.25056554426866695, 0.05562793226244877, 0.13445556387832425, 0.012093026911453256, -0.002462285421803336, 0.016302770609262603, -0.07467484861738986, 0.10054704970416595, 0.2565435543217046, 0.07249719499458072, 0.2488992718991431, -0.29649413766360655, -0.17858719067214607, 0.1808037825496926, 0.05978349762611419, 0.0029491177004463266, -0.071544998135775, -0.2924022782438745, 0.1513957390971716, -0.22109656725898855, -0.1460344847467429, -0.09364953534765486, 0.08689029783057342, -0.07705783295011698, -0.24271812467431686, -0.043404578831655986, 0.14852537908854913, 0.11005469032053677, -0.06516317980475712, -0.038333270780789026, -0.0632720654405677, 0.14618107105869618, 0.04947044486736398, 0.071097560566645, 0.13467819776361128, -0.06184272570154811, -0.1250737982717161, 0.4186810195627593, -0.07429432995769682, -0.2095018040254103, 0.19857463323798194, -0.18266140257810834, -0.25139660742016706, 0.12914199442397686, 0.060793026645503845, 0.15938802395871132, -0.04051109458916197, 0.1747740843917577, -0.15069145210813614, 0.1111137188721006, 0.007250807394490302, 0.015793941376156778, 0.10020995923609373, 0.14532768723713058, 0.1532164407892551, 0.13766915701716295, 0.05698599279623877, 0.0017647419473355483, -0.34210659814822786, -0.20152690134497372, -0.1178058011635974, 0.13904152196720712, -0.08919913957130497, -0.15565156492564985, 0.3900917220989582, 0.10240409125532932, 0.1569876801735083, 0.09424807560636, 0.2359155218597244, 0.07658360963804448, 0.07894533790308256, 0.0718985303047365, 0.14860182782761758, 0.2330175947233941, -0.10499328815044379, -0.16422787368145286, -0.03197955620422397, 0.1980308641902165] |
1,802.01463 | Exploring the making of a galactic wind in the star-bursting dwarf
irregular galaxy IC 10 with LOFAR | Low-mass galaxies are subject to strong galactic outflows, in which cosmic
rays may play an important role, they can be best traced with low-frequency
radio continuum observations, which are less affected by spectral ageing. We
present a study of the nearby star burst dwarf irregular galaxy IC 10 using
observations at 140 MHz with the LOw-Frequency ARray (LOFAR), at 1580 MHz with
the Very Large Array (VLA) and at 6200 MHz with the VLA and the 100-m
Effelsberg telescope. We find that IC 10 has a low-frequency radio halo, which
manifests itself as a second component (thick disc) in the minor axis profiles
of the non-thermal radio continuum emission at 140 and 1580 MHz. These profiles
are then fitted with 1D cosmic-ray transport models for pure diffusion and
advection. We find that a diffusion model fits best, with a diffusion
coefficient of $D=(0.4$-$0.8) \times 10^{26}(E/{\rm GeV})^{0.5}~{\rm
cm^2\,s^{-1}}$, which is at least an order of magnitude smaller than estimates
both from anisotropic diffusion and the diffusion length. In contrast,
advection models, which cannot be ruled out due to the mild inclination, while
providing poorer fits, result in advection speeds close to the escape velocity
of $\approx$$50~\rm km\,s^{-1}$, as expected for a cosmic-ray driven wind. Our
favoured model with an accelerating wind provides a self-consistent solution,
where the magnetic field is in energy equipartition with both the warm neutral
and warm ionized medium with an important contribution from cosmic rays.
Consequently, cosmic rays can play a vital role for the launching of galactic
winds in the disc--halo interface.
| astro-ph.GA | lowmass galaxies are subject to strong galactic outflows in which cosmic rays may play an important role they can be best traced with lowfrequency radio continuum observations which are less affected by spectral ageing we present a study of the nearby star burst dwarf irregular galaxy ic 10 using observations at 140 mhz with the lowfrequency array lofar at 1580 mhz with the very large array vla and at 6200 mhz with the vla and the 100m effelsberg telescope we find that ic 10 has a lowfrequency radio halo which manifests itself as a second component thick disc in the minor axis profiles of the nonthermal radio continuum emission at 140 and 1580 mhz these profiles are then fitted with 1d cosmicray transport models for pure diffusion and advection we find that a diffusion model fits best with a diffusion coefficient of d0408 times 1026erm gev05rm cm2s1 which is at least an order of magnitude smaller than estimates both from anisotropic diffusion and the diffusion length in contrast advection models which cannot be ruled out due to the mild inclination while providing poorer fits result in advection speeds close to the escape velocity of approx50rm kms1 as expected for a cosmicray driven wind our favoured model with an accelerating wind provides a selfconsistent solution where the magnetic field is in energy equipartition with both the warm neutral and warm ionized medium with an important contribution from cosmic rays consequently cosmic rays can play a vital role for the launching of galactic winds in the dischalo interface | [['lowmass', 'galaxies', 'are', 'subject', 'to', 'strong', 'galactic', 'outflows', 'in', 'which', 'cosmic', 'rays', 'may', 'play', 'an', 'important', 'role', 'they', 'can', 'be', 'best', 'traced', 'with', 'lowfrequency', 'radio', 'continuum', 'observations', 'which', 'are', 'less', 'affected', 'by', 'spectral', 'ageing', 'we', 'present', 'a', 'study', 'of', 'the', 'nearby', 'star', 'burst', 'dwarf', 'irregular', 'galaxy', 'ic', '10', 'using', 'observations', 'at', '140', 'mhz', 'with', 'the', 'lowfrequency', 'array', 'lofar', 'at', '1580', 'mhz', 'with', 'the', 'very', 'large', 'array', 'vla', 'and', 'at', '6200', 'mhz', 'with', 'the', 'vla', 'and', 'the', '100m', 'effelsberg', 'telescope', 'we', 'find', 'that', 'ic', '10', 'has', 'a', 'lowfrequency', 'radio', 'halo', 'which', 'manifests', 'itself', 'as', 'a', 'second', 'component', 'thick', 'disc', 'in', 'the', 'minor', 'axis', 'profiles', 'of', 'the', 'nonthermal', 'radio', 'continuum', 'emission', 'at', '140', 'and', '1580', 'mhz', 'these', 'profiles', 'are', 'then', 'fitted', 'with', '1d', 'cosmicray', 'transport', 'models', 'for', 'pure', 'diffusion', 'and', 'advection', 'we', 'find', 'that', 'a', 'diffusion', 'model', 'fits', 'best', 'with', 'a', 'diffusion', 'coefficient', 'of', 'd0408', 'times', '1026erm', 'gev05rm', 'cm2s1', 'which', 'is', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'smaller', 'than', 'estimates', 'both', 'from', 'anisotropic', 'diffusion', 'and', 'the', 'diffusion', 'length', 'in', 'contrast', 'advection', 'models', 'which', 'can', 'not', 'be', 'ruled', 'out', 'due', 'to', 'the', 'mild', 'inclination', 'while', 'providing', 'poorer', 'fits', 'result', 'in', 'advection', 'speeds', 'close', 'to', 'the', 'escape', 'velocity', 'of', 'approx50rm', 'kms1', 'as', 'expected', 'for', 'a', 'cosmicray', 'driven', 'wind', 'our', 'favoured', 'model', 'with', 'an', 'accelerating', 'wind', 'provides', 'a', 'selfconsistent', 'solution', 'where', 'the', 'magnetic', 'field', 'is', 'in', 'energy', 'equipartition', 'with', 'both', 'the', 'warm', 'neutral', 'and', 'warm', 'ionized', 'medium', 'with', 'an', 'important', 'contribution', 'from', 'cosmic', 'rays', 'consequently', 'cosmic', 'rays', 'can', 'play', 'a', 'vital', 'role', 'for', 'the', 'launching', 'of', 'galactic', 'winds', 'in', 'the', 'dischalo', 'interface']] | [-0.07834846445767894, 0.1549981949548835, -0.014968585048106466, 0.06677904688447656, -0.10051255623290956, -0.09347154048875181, -0.02192442301428866, 0.4332923731571542, -0.20917162136818934, -0.3340577848086303, 0.06811359168302725, -0.2817226766292079, -0.020708702839156354, 0.22109980946922078, 0.044763961361478206, -0.07488552810280978, 0.044235611270023546, -0.1012266340532999, 0.011196048417461763, -0.18017878393153017, 0.2323948149514116, 0.1937068801441344, 0.18022591906614424, 0.010774739307494974, 0.08415365883874157, -0.13861211217118966, -0.06002148807972758, -0.024948017443475044, -0.11305470060836202, 0.032935310294115436, 0.24906071938295124, 0.04900249921838227, 0.20109156431932104, -0.40579627230468945, -0.243838581499062, 0.07277116825870375, 0.20163127073370243, 0.04067756606149947, -0.04950924624406858, -0.2553789381512069, 0.0573973141816765, -0.1801292009397664, -0.19419842076270652, 0.07740193680977898, 0.003979266143087371, 0.045447846520632294, -0.2527343610472671, 0.1547535939432916, 0.01866345116344056, 0.08461007579798505, -0.11318111800029138, -0.1085154993557132, -0.02302350900908969, 0.056881680742289005, 0.0570469471854213, 0.09343485850307046, 0.17785480639459234, -0.12869878633411624, -0.026094088540688568, 0.4132869417517788, -0.12375600675928265, -0.04488367366644999, 0.22881996790922648, -0.22051869495311685, -0.14723354913551995, 0.21852958936468797, 0.15826566343489307, 0.053035508725320986, -0.1469165277381482, 0.015125950575684723, -0.023512661091710917, 0.2200509858218283, 0.06040039516455335, 0.028338360385805932, 0.3117997401979248, 0.11182707949199165, 0.07858909101854906, 0.09267449289608172, -0.23184749427741105, -0.02139776803759247, -0.24946186337364643, -0.07282068642415843, -0.11674749120985242, 0.1366096151813339, -0.14598720139451601, -0.11892944414917704, 0.3486623739871553, 0.10384052153032552, 0.20448575011142375, 0.031024030253765995, 0.3174149864426862, 0.10347544587527406, 0.0758753518993587, 0.18767684744855043, 0.302282547055497, 0.17163638364046946, 0.11932508083356713, -0.22198498883413928, 0.06478716471423893, -0.025837871963857662] |
1,802.01464 | Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a
Clustering Method | A blind source separation method is described to extract sources from data
mixtures where the underlying sources are assumed to be sparse and
uncorrelated. The approach used is to detect and analyse segments of time where
one source exists on its own. Information from these segments is combined to
counteract the effects of noise and small random correlations between the
sources that would occur in practice. This combined information can then be
used to estimate the sources one at a time using a deflationary method.
Probability density functions are not assumed for any of the sources. A
comparison is made between the proposed method, the Minimum Heading Change
method, Fast-ICA and Clusterwise PCA. It is shown, for the dataset used in this
paper, that the proposed method has the best performance for clean signals if
the input parameters are chosen correctly. However the performance of this
method can be very sensitive to these input parameters and can also be more
sensitive to noise than the Fast-ICA and Clusterwise methods.
| eess.SP | a blind source separation method is described to extract sources from data mixtures where the underlying sources are assumed to be sparse and uncorrelated the approach used is to detect and analyse segments of time where one source exists on its own information from these segments is combined to counteract the effects of noise and small random correlations between the sources that would occur in practice this combined information can then be used to estimate the sources one at a time using a deflationary method probability density functions are not assumed for any of the sources a comparison is made between the proposed method the minimum heading change method fastica and clusterwise pca it is shown for the dataset used in this paper that the proposed method has the best performance for clean signals if the input parameters are chosen correctly however the performance of this method can be very sensitive to these input parameters and can also be more sensitive to noise than the fastica and clusterwise methods | [['a', 'blind', 'source', 'separation', 'method', 'is', 'described', 'to', 'extract', 'sources', 'from', 'data', 'mixtures', 'where', 'the', 'underlying', 'sources', 'are', 'assumed', 'to', 'be', 'sparse', 'and', 'uncorrelated', 'the', 'approach', 'used', 'is', 'to', 'detect', 'and', 'analyse', 'segments', 'of', 'time', 'where', 'one', 'source', 'exists', 'on', 'its', 'own', 'information', 'from', 'these', 'segments', 'is', 'combined', 'to', 'counteract', 'the', 'effects', 'of', 'noise', 'and', 'small', 'random', 'correlations', 'between', 'the', 'sources', 'that', 'would', 'occur', 'in', 'practice', 'this', 'combined', 'information', 'can', 'then', 'be', 'used', 'to', 'estimate', 'the', 'sources', 'one', 'at', 'a', 'time', 'using', 'a', 'deflationary', 'method', 'probability', 'density', 'functions', 'are', 'not', 'assumed', 'for', 'any', 'of', 'the', 'sources', 'a', 'comparison', 'is', 'made', 'between', 'the', 'proposed', 'method', 'the', 'minimum', 'heading', 'change', 'method', 'fastica', 'and', 'clusterwise', 'pca', 'it', 'is', 'shown', 'for', 'the', 'dataset', 'used', 'in', 'this', 'paper', 'that', 'the', 'proposed', 'method', 'has', 'the', 'best', 'performance', 'for', 'clean', 'signals', 'if', 'the', 'input', 'parameters', 'are', 'chosen', 'correctly', 'however', 'the', 'performance', 'of', 'this', 'method', 'can', 'be', 'very', 'sensitive', 'to', 'these', 'input', 'parameters', 'and', 'can', 'also', 'be', 'more', 'sensitive', 'to', 'noise', 'than', 'the', 'fastica', 'and', 'clusterwise', 'methods']] | [-0.0340313030761245, 0.05566902475751187, -0.12953628046360946, 0.09820602966345758, -0.07012299596905135, -0.15738195676588007, 0.038774383362498374, 0.41105984721591793, -0.27241959414009514, -0.30887128610009623, 0.13401992591621475, -0.297555031039967, -0.12036802581292384, 0.2137892608415093, -0.07372848964544267, 0.044639659695225334, 0.0655279704906906, 0.04857083671786905, -0.04649342060607125, -0.24347912968748067, 0.27396361748329723, 0.07174523596337737, 0.2888891258781236, 0.004884497678601707, 0.10146160308649135, -0.038681894900021004, -0.062248623326659126, 0.03465847638518323, -0.04023873743770944, 0.0862407986523815, 0.26802510391650775, 0.1511060369597781, 0.245544426435241, -0.3775790953049822, -0.22013692111438196, 0.15459157524839837, 0.12179942760952699, 0.1242737248085285, 0.00574538337103623, -0.2953128000258429, 0.11138077157469654, -0.12199583947217676, -0.07587006105076985, -0.08272837290330928, -0.00540284041216123, 0.030939175396711295, -0.32250218757169224, 0.0745876718468526, 0.02370378896098077, -0.02842734741548506, -0.020490840585081226, -0.11449067470667189, 0.005290713917585255, 0.16866939440066514, 0.049671762329443585, 0.05787684435449188, 0.12758866504810135, -0.07626432423016949, -0.07248034380850267, 0.3803169737165634, -0.07446191559820202, -0.25285196767089413, 0.19368124492576666, -0.08861277882318348, -0.1259820348605205, 0.14702080139758053, 0.20315474780970777, 0.11855226267506672, -0.187723049709364, -0.0018011023484279963, 0.010012779728586637, 0.23918021210199278, 0.029175748957662718, 0.036457403798549046, 0.18409183363777382, 0.14075260363056286, 0.07026772529917312, 0.12746998687280264, -0.16739586800110895, -0.03498458596064913, -0.25848087068122244, -0.08108421126325455, -0.2497241818704284, -0.02632390015430338, -0.07552330597588303, -0.1310308709061779, 0.38876681883417114, 0.22698593456380775, 0.18597370160181495, 0.021610796583827432, 0.34323244739789516, 0.10566587784718832, 0.08200614080218786, 0.09717754912480006, 0.2278258204129497, 0.10721922860640658, 0.05321364985646669, -0.17003080087642258, 0.1378760061739288, -0.005669862884730542] |
1,802.01465 | Dense Power-law Networks and Simplicial Complexes | There is increasing evidence that dense networks occur in on-line social
networks, recommendation networks and in the brain. In addition to being dense,
these networks are often also scale-free, i.e. their degree distributions
follow $P(k)\propto k^{-\gamma}$ with $\gamma\in(1,2]$. Models of growing
networks have been successfully employed to produce scale-free networks using
preferential attachment, however these models can only produce sparse networks
as the numbers of links and nodes being added at each time-step is constant.
Here we present a modelling framework which produces networks that are both
dense and scale-free. The mechanism by which the networks grow in this model is
based on the Pitman-Yor process. Variations on the model are able to produce
undirected scale-free networks with exponent $\gamma=2$ or directed networks
with power-law out-degree distribution with tunable exponent $\gamma \in
(1,2)$. We also extend the model to that of directed $2$-dimensional simplicial
complexes. Simplicial complexes are generalization of networks that can encode
the many body interactions between the parts of a complex system and as such
are becoming increasingly popular to characterize different data sets ranging
from social interacting systems to the brain. Our model produces dense directed
simplicial complexes with power-law distribution of the generalized out-degrees
of the nodes.
| physics.soc-ph cond-mat.dis-nn cond-mat.stat-mech cs.SI | there is increasing evidence that dense networks occur in online social networks recommendation networks and in the brain in addition to being dense these networks are often also scalefree ie their degree distributions follow pkpropto kgamma with gammain12 models of growing networks have been successfully employed to produce scalefree networks using preferential attachment however these models can only produce sparse networks as the numbers of links and nodes being added at each timestep is constant here we present a modelling framework which produces networks that are both dense and scalefree the mechanism by which the networks grow in this model is based on the pitmanyor process variations on the model are able to produce undirected scalefree networks with exponent gamma2 or directed networks with powerlaw outdegree distribution with tunable exponent gamma in 12 we also extend the model to that of directed 2dimensional simplicial complexes simplicial complexes are generalization of networks that can encode the many body interactions between the parts of a complex system and as such are becoming increasingly popular to characterize different data sets ranging from social interacting systems to the brain our model produces dense directed simplicial complexes with powerlaw distribution of the generalized outdegrees of the nodes | [['there', 'is', 'increasing', 'evidence', 'that', 'dense', 'networks', 'occur', 'in', 'online', 'social', 'networks', 'recommendation', 'networks', 'and', 'in', 'the', 'brain', 'in', 'addition', 'to', 'being', 'dense', 'these', 'networks', 'are', 'often', 'also', 'scalefree', 'ie', 'their', 'degree', 'distributions', 'follow', 'pkpropto', 'kgamma', 'with', 'gammain12', 'models', 'of', 'growing', 'networks', 'have', 'been', 'successfully', 'employed', 'to', 'produce', 'scalefree', 'networks', 'using', 'preferential', 'attachment', 'however', 'these', 'models', 'can', 'only', 'produce', 'sparse', 'networks', 'as', 'the', 'numbers', 'of', 'links', 'and', 'nodes', 'being', 'added', 'at', 'each', 'timestep', 'is', 'constant', 'here', 'we', 'present', 'a', 'modelling', 'framework', 'which', 'produces', 'networks', 'that', 'are', 'both', 'dense', 'and', 'scalefree', 'the', 'mechanism', 'by', 'which', 'the', 'networks', 'grow', 'in', 'this', 'model', 'is', 'based', 'on', 'the', 'pitmanyor', 'process', 'variations', 'on', 'the', 'model', 'are', 'able', 'to', 'produce', 'undirected', 'scalefree', 'networks', 'with', 'exponent', 'gamma2', 'or', 'directed', 'networks', 'with', 'powerlaw', 'outdegree', 'distribution', 'with', 'tunable', 'exponent', 'gamma', 'in', '12', 'we', 'also', 'extend', 'the', 'model', 'to', 'that', 'of', 'directed', '2dimensional', 'simplicial', 'complexes', 'simplicial', 'complexes', 'are', 'generalization', 'of', 'networks', 'that', 'can', 'encode', 'the', 'many', 'body', 'interactions', 'between', 'the', 'parts', 'of', 'a', 'complex', 'system', 'and', 'as', 'such', 'are', 'becoming', 'increasingly', 'popular', 'to', 'characterize', 'different', 'data', 'sets', 'ranging', 'from', 'social', 'interacting', 'systems', 'to', 'the', 'brain', 'our', 'model', 'produces', 'dense', 'directed', 'simplicial', 'complexes', 'with', 'powerlaw', 'distribution', 'of', 'the', 'generalized', 'outdegrees', 'of', 'the', 'nodes']] | [-0.11370915116852906, 0.12976515848918052, -0.04511856224928466, 0.0766583479054395, -0.0526264849583397, -0.17592133857807754, -0.0126515358449006, 0.4557196616763099, -0.2794085722831585, -0.2906708076969711, 0.034221005060659296, -0.312071034836924, -0.23789831585052543, 0.12683235210168295, -0.03213634000258926, 0.02633562192348487, 0.07484506498411353, 0.052322441663611496, 0.06067003173255684, -0.22881990815927783, 0.35482445688189773, 0.054304454272202596, 0.2821082052668686, 0.028534975294761435, 0.0605500540759479, -0.06399461183360418, -0.005148279198818831, 0.061692034876398225, -0.09987985251870786, 0.1689685475805055, 0.2441603925076874, 0.1194399068360263, 0.24101710147777627, -0.4449885910708863, -0.3075070165335155, 0.21382296344468205, 0.16172269136428205, 0.07377946236986888, 0.014768738592375475, -0.27051746463956367, 0.1360982550160572, -0.18984730917642567, -0.07449885420870073, -0.08097657468400453, 0.030642283086821733, 0.1121600016756767, -0.2749922833921812, 0.06278843483812692, 0.047973468208150696, 0.046072234612060274, 0.008890548705971698, -0.09727299093248064, -0.06829577366162165, 0.1605645954933958, -0.018149558580532386, 0.024165557911803963, 0.11718266065426097, -0.1703526474314161, -0.16109045327060145, 0.3660830527654674, 0.007423975017373588, -0.18771212341697277, 0.2333182579697119, -0.09568693062364317, -0.1841220211601899, 0.12523847769503252, 0.22967085038486978, 0.0949945997315376, -0.13449807518558338, 0.03294211999042937, -0.059111643855178746, 0.14349455484488777, 0.04518345565452139, 0.012991171856964061, 0.16296535894150227, 0.20134217527897863, 0.052908454536135296, 0.12040947710560394, -0.053404413332521807, -0.14786269174575215, -0.18001817826107883, -0.053691087115445346, -0.21713954667874272, 0.04108828566288391, -0.18071574696983986, -0.19466950824152274, 0.363884599833279, 0.1311463624075295, 0.249952140547183, 0.15418596116083647, 0.24879416291219283, 0.04900317824253176, 0.10975480625073951, 0.11202879968366705, 0.14417115920384663, 0.14054137225940566, 0.11814126243704173, -0.07709303051221765, 0.1320848649512921, 0.013823457624726367] |
1,802.01466 | Trapping Light in Plain Sight: Embedded Photonic Eigenstates in
Zero-Index Metamaterials | Confining electromagnetic energy is crucial to enhance light-matter
interactions, with important implications for science and technology. Here, we
discuss the opportunities offered by trapping and confining light in open
structures, based on the concept of embedded eigenstates within the radiation
continuum enabled by zero-index metamaterials. Building upon the physical
insights offered by our analysis, we put forward a general platform that allows
realizing extremely high field enhancements in open structures under external
illumination. Structures supporting embedded eigenstates represent a rare
example of physical systems in which extreme - in principle unbounded -
responses can be tamed. Our proposed design recipe to realize bound states in
the continuum also offers a simple model that allows testing important
questions that surround the concept of embedded eigenstates, such as their
effect on the local density of photonic states. Our findings help clarifying
which nano-optical and radio-wave applications may benefit from this unusual
and singular response.
| physics.optics | confining electromagnetic energy is crucial to enhance lightmatter interactions with important implications for science and technology here we discuss the opportunities offered by trapping and confining light in open structures based on the concept of embedded eigenstates within the radiation continuum enabled by zeroindex metamaterials building upon the physical insights offered by our analysis we put forward a general platform that allows realizing extremely high field enhancements in open structures under external illumination structures supporting embedded eigenstates represent a rare example of physical systems in which extreme in principle unbounded responses can be tamed our proposed design recipe to realize bound states in the continuum also offers a simple model that allows testing important questions that surround the concept of embedded eigenstates such as their effect on the local density of photonic states our findings help clarifying which nanooptical and radiowave applications may benefit from this unusual and singular response | [['confining', 'electromagnetic', 'energy', 'is', 'crucial', 'to', 'enhance', 'lightmatter', 'interactions', 'with', 'important', 'implications', 'for', 'science', 'and', 'technology', 'here', 'we', 'discuss', 'the', 'opportunities', 'offered', 'by', 'trapping', 'and', 'confining', 'light', 'in', 'open', 'structures', 'based', 'on', 'the', 'concept', 'of', 'embedded', 'eigenstates', 'within', 'the', 'radiation', 'continuum', 'enabled', 'by', 'zeroindex', 'metamaterials', 'building', 'upon', 'the', 'physical', 'insights', 'offered', 'by', 'our', 'analysis', 'we', 'put', 'forward', 'a', 'general', 'platform', 'that', 'allows', 'realizing', 'extremely', 'high', 'field', 'enhancements', 'in', 'open', 'structures', 'under', 'external', 'illumination', 'structures', 'supporting', 'embedded', 'eigenstates', 'represent', 'a', 'rare', 'example', 'of', 'physical', 'systems', 'in', 'which', 'extreme', 'in', 'principle', 'unbounded', 'responses', 'can', 'be', 'tamed', 'our', 'proposed', 'design', 'recipe', 'to', 'realize', 'bound', 'states', 'in', 'the', 'continuum', 'also', 'offers', 'a', 'simple', 'model', 'that', 'allows', 'testing', 'important', 'questions', 'that', 'surround', 'the', 'concept', 'of', 'embedded', 'eigenstates', 'such', 'as', 'their', 'effect', 'on', 'the', 'local', 'density', 'of', 'photonic', 'states', 'our', 'findings', 'help', 'clarifying', 'which', 'nanooptical', 'and', 'radiowave', 'applications', 'may', 'benefit', 'from', 'this', 'unusual', 'and', 'singular', 'response']] | [-0.1203100345066438, 0.15222106632310897, -0.10004795829649084, 0.06327546598389745, -0.09296704635024071, -0.16864993827107053, 0.06245471411695083, 0.3871079321205616, -0.22358362780263027, -0.32151364530126253, 0.063319973879649, -0.22144821852154564, -0.21231797651130668, 0.227576742968522, -0.02834276319326212, 0.06097301570000127, 0.029041881232211988, -0.0675407047693928, -0.006082178151700646, -0.1639120595001926, 0.30213893475029785, 0.09119829626133044, 0.31872171457546455, 0.1318723816839823, 0.07000456019304693, 0.02125310121414562, 0.007824051696807145, 0.004513999096428354, -0.0830298887565247, 0.18971213961252942, 0.2721437489675979, 0.08799172002356499, 0.2694929674935217, -0.47747041112432875, -0.25887182999402286, 0.029271404409470656, 0.1619089768268168, 0.10295995390197883, -0.13855194730994602, -0.32015007647375265, 0.012318391762673854, -0.1336575814926376, -0.22228332947939633, -0.10314939204137773, -0.00128191415569745, -0.003584223755557711, -0.23180977268338515, -0.01777148303439996, 0.047600444502507645, 0.008410198933755358, -0.0801461476945163, -0.06620956194276612, 0.03150557855609804, 0.11804193927906453, -0.0351591000915505, -0.016096426729733746, 0.15929852054143945, -0.13337187275368098, -0.1389836419870456, 0.39578364323358983, -0.04540556361510729, -0.1767312615690753, 0.22467763354536147, -0.10450540592273076, -0.11893195515188078, 0.10869652837514877, 0.20681964398672184, 0.05120026578505834, -0.13338836723938585, 0.0846364732265162, 0.0032569365079204242, 0.1369610100875919, 0.041593223537007964, 0.14713068929539683, 0.2898801253549755, 0.19801948230713606, 0.029552211230620743, 0.15353723312960937, -0.024838659428060055, -0.0817592020581166, -0.2794960586850842, -0.15692771592992358, -0.14547407443324725, 0.077937597183045, -0.06708860093446371, -0.14778229478669042, 0.390642004692927, 0.19638906293471034, 0.15265416231316825, -0.05619821647337327, 0.27751416858285666, 0.06943244731985032, 0.09505318570105979, 0.059721089753632745, 0.25981400089338424, 0.13377972783947675, 0.09186648870507876, -0.2027841562513883, 0.034930024795078986, -0.013314562722419699] |
1,802.01467 | Simple description of generalized electromagnetic and gravitational
hopfions | The generalization of electromagnetic and gravitational hopfions is performed
in terms of a complex scalar field. New definition of topological charge for
linearized gravity is given. Quasi-local (super-)energy densities are compared
for gravitational hopfion.
| gr-qc | the generalization of electromagnetic and gravitational hopfions is performed in terms of a complex scalar field new definition of topological charge for linearized gravity is given quasilocal superenergy densities are compared for gravitational hopfion | [['the', 'generalization', 'of', 'electromagnetic', 'and', 'gravitational', 'hopfions', 'is', 'performed', 'in', 'terms', 'of', 'a', 'complex', 'scalar', 'field', 'new', 'definition', 'of', 'topological', 'charge', 'for', 'linearized', 'gravity', 'is', 'given', 'quasilocal', 'superenergy', 'densities', 'are', 'compared', 'for', 'gravitational', 'hopfion']] | [-0.2351687590536826, 0.16177777244764216, -0.05236055252744871, 0.12408211970400504, -0.1427761680610916, -0.07668881062144305, -0.12600850675474196, 0.2522878977196181, -0.1400152020265951, -0.2731940316803315, -0.04574310803196996, -0.2373664330910234, -0.1511614146258901, 0.18552414316903143, -0.010058928363244323, 0.07257159621290424, -0.033601859652930326, 0.08922178999466054, -0.14162902186131654, -0.1666850846479921, 0.3923312125056434, 0.04774408184868448, 0.20497878303970485, 0.057805062997538376, 0.11341496355667272, -0.02223731789683156, -0.05043232106768033, 0.0934904792212525, -0.11039664286791402, 0.0631949652588981, 0.17851957178893774, 0.0815472866559182, 0.17151600978446796, -0.41593690358978863, -0.26078063904253, 0.07422646041959524, 0.10020958009066389, 0.144295042654609, -0.05969590810127556, -0.34496670523110556, 0.1370084278340287, -0.22611320040681782, -0.12794482855893233, -0.12744934133747043, 0.06217755047563354, 0.0043788977953441, -0.23542567841051257, 0.13033687360310817, -0.020486694815404275, 0.039256103065032646, -0.1466820774024681, -0.07662905097993858, -0.050211859620450175, -0.006659069646369009, 0.08843487716855153, 0.12131017604021027, 0.17881473833147218, -0.19934451884097037, -0.11948930371128132, 0.41637953830992475, -0.1018636145574205, -0.3375142717405277, 0.12248696137548369, -0.11208923662471694, -0.09532631176304729, 0.14113837244975216, 0.10179826817201341, 0.18568027293419137, -0.1459670809974127, 0.16541926420177333, 0.011887644143665539, 0.05551911583718132, 0.15052420450100565, 0.12043827288674519, 0.36047448984840336, 0.09127035983564223, 0.07875399566803347, 0.14761957575512283, -0.02039882436613826, -0.12240645459250492, -0.3842775534619303, -0.20797532936558127, -0.22815874596948132, 0.08102091275812949, -0.12013185877774102, -0.1981123219079831, 0.417343900703332, 0.08833159796674461, 0.0326108041438548, 0.06085319061051397, 0.23951505688840852, 0.14189264488488654, 0.0491830314961536, 0.048785902847371554, 0.32271686128532406, 0.24899509708013604, 0.11971063259304227, -0.20644765051752878, -0.1052760285571875, 0.16035500087994425] |
1,802.01468 | PinMe: Tracking a Smartphone User around the World | With the pervasive use of smartphones that sense, collect, and process
valuable information about the environment, ensuring location privacy has
become one of the most important concerns in the modern age. A few recent
research studies discuss the feasibility of processing data gathered by a
smartphone to locate the phone's owner, even when the user does not intend to
share his location information, e.g., when the Global Positioning System (GPS)
is off. Previous research efforts rely on at least one of the two following
fundamental requirements, which significantly limit the ability of the
adversary: (i) the attacker must accurately know either the user's initial
location or the set of routes through which the user travels and/or (ii) the
attacker must measure a set of features, e.g., the device's acceleration, for
potential routes in advance and construct a training dataset. In this paper, we
demonstrate that neither of the above-mentioned requirements is essential for
compromising the user's location privacy. We describe PinMe, a novel
user-location mechanism that exploits non-sensory/sensory data stored on the
smartphone, e.g., the environment's air pressure, along with publicly-available
auxiliary information, e.g., elevation maps, to estimate the user's location
when all location services, e.g., GPS, are turned off.
| cs.CR | with the pervasive use of smartphones that sense collect and process valuable information about the environment ensuring location privacy has become one of the most important concerns in the modern age a few recent research studies discuss the feasibility of processing data gathered by a smartphone to locate the phones owner even when the user does not intend to share his location information eg when the global positioning system gps is off previous research efforts rely on at least one of the two following fundamental requirements which significantly limit the ability of the adversary i the attacker must accurately know either the users initial location or the set of routes through which the user travels andor ii the attacker must measure a set of features eg the devices acceleration for potential routes in advance and construct a training dataset in this paper we demonstrate that neither of the abovementioned requirements is essential for compromising the users location privacy we describe pinme a novel userlocation mechanism that exploits nonsensorysensory data stored on the smartphone eg the environments air pressure along with publiclyavailable auxiliary information eg elevation maps to estimate the users location when all location services eg gps are turned off | [['with', 'the', 'pervasive', 'use', 'of', 'smartphones', 'that', 'sense', 'collect', 'and', 'process', 'valuable', 'information', 'about', 'the', 'environment', 'ensuring', 'location', 'privacy', 'has', 'become', 'one', 'of', 'the', 'most', 'important', 'concerns', 'in', 'the', 'modern', 'age', 'a', 'few', 'recent', 'research', 'studies', 'discuss', 'the', 'feasibility', 'of', 'processing', 'data', 'gathered', 'by', 'a', 'smartphone', 'to', 'locate', 'the', 'phones', 'owner', 'even', 'when', 'the', 'user', 'does', 'not', 'intend', 'to', 'share', 'his', 'location', 'information', 'eg', 'when', 'the', 'global', 'positioning', 'system', 'gps', 'is', 'off', 'previous', 'research', 'efforts', 'rely', 'on', 'at', 'least', 'one', 'of', 'the', 'two', 'following', 'fundamental', 'requirements', 'which', 'significantly', 'limit', 'the', 'ability', 'of', 'the', 'adversary', 'i', 'the', 'attacker', 'must', 'accurately', 'know', 'either', 'the', 'users', 'initial', 'location', 'or', 'the', 'set', 'of', 'routes', 'through', 'which', 'the', 'user', 'travels', 'andor', 'ii', 'the', 'attacker', 'must', 'measure', 'a', 'set', 'of', 'features', 'eg', 'the', 'devices', 'acceleration', 'for', 'potential', 'routes', 'in', 'advance', 'and', 'construct', 'a', 'training', 'dataset', 'in', 'this', 'paper', 'we', 'demonstrate', 'that', 'neither', 'of', 'the', 'abovementioned', 'requirements', 'is', 'essential', 'for', 'compromising', 'the', 'users', 'location', 'privacy', 'we', 'describe', 'pinme', 'a', 'novel', 'userlocation', 'mechanism', 'that', 'exploits', 'nonsensorysensory', 'data', 'stored', 'on', 'the', 'smartphone', 'eg', 'the', 'environments', 'air', 'pressure', 'along', 'with', 'publiclyavailable', 'auxiliary', 'information', 'eg', 'elevation', 'maps', 'to', 'estimate', 'the', 'users', 'location', 'when', 'all', 'location', 'services', 'eg', 'gps', 'are', 'turned', 'off']] | [-0.13284250829122998, 0.022057327147582687, -0.05727242494503102, 0.05704490241196208, -0.14524841442619105, -0.19814268424208772, 0.0978662871671746, 0.3743402776757473, -0.273299582655362, -0.3497331428913598, 0.15754659939616408, -0.34345896009989274, -0.1035651467060363, 0.18608800153517482, -0.12098814441638096, 0.02670923073310405, 0.06816716363823731, 0.10769776259265311, 0.004090941154166376, -0.25825013188458507, 0.31713277303382076, 0.06695036291083331, 0.3210346115147931, 0.06157815906805397, 0.0812476874631416, 0.02669738718251778, -0.052210820642616694, -0.04913443885507242, -0.07111384319362371, 0.14847549134841764, 0.2774107671593349, 0.22403174209252455, 0.3401792957967497, -0.4672112114169649, -0.214455313555693, 0.10784259094823587, 0.1450092080866931, 0.08433485317497802, -0.07821473965615147, -0.32205916076974217, 0.09482742756425502, -0.15235931674954553, -0.1254720719019867, -0.024952081119556567, -0.005614055214251207, 0.04249969000460079, -0.2415988655633241, -0.04284725755661121, 0.01641743736067399, 0.07794020728203398, -0.030176995350251822, -0.04465689124045468, -0.023657127456068235, 0.244948542161418, 0.05097903048032824, -0.009436167825632705, 0.21287293698128104, -0.15540313896448896, -0.0827604181926253, 0.3838745281478475, 0.02764795346984517, -0.16039244873628852, 0.1888916872827062, -0.1154136988801201, -0.12514560539712705, 0.09097273209070797, 0.21410638442477814, 0.06551952643182866, -0.19397382842378896, 0.029353825456396615, -0.0038405339408495703, 0.207113819448561, 0.05411623335244881, 0.05693517081902793, 0.2212000131384862, 0.15457567132520134, 0.11394364894946876, 0.05430914101847991, -0.11025806414914852, -0.05482622480190118, -0.24248696633893524, -0.13739581338158302, -0.1817644988180748, 0.02979109101535204, -0.06330026564206621, -0.10484391997383936, 0.37746946949530674, 0.23652318590864313, 0.1861638210608676, 0.013999721317830954, 0.3937604058543362, 0.023080906226934372, 0.09016919619495967, 0.13992742869322222, 0.1741188134960263, -0.026437835778502113, 0.18008847737703756, -0.14939248300426958, 0.16284248222500028, -0.006591892418295599] |
1,802.01469 | Losses in plasmonics: from mitigating energy dissipation to embracing
loss-enabled functionalities | Unlike conventional optics, plasmonics enables unrivalled concentration of
optical energy well beyond the diffraction limit of light. However, a
significant part of this energy is dissipated as heat. Plasmonic losses present
a major hurdle in the development of plasmonic devices and circuits that can
compete with other mature technologies. Until recently, they have largely kept
the use of plasmonics to a few niche areas where loss is not a key factor, such
as surface enhanced Raman scattering and biochemical sensing. Here, we discuss
the origin of plasmonic losses and various approaches to either minimize or
mitigate them based on understanding of fundamental processes underlying
surface plasmon modes excitation and decay. Along with the ongoing effort to
find and synthesize better plasmonic materials, optical designs that modify the
optical powerflow through plasmonic nanostructures can help in reducing both
radiative damping and dissipative losses of surface plasmons. Another strategy
relies on the development of hybrid photonic-plasmonic devices by coupling
plasmonic nanostructures to resonant optical elements. Hybrid integration not
only helps to reduce dissipative losses and radiative damping of surface
plasmons, but also makes possible passive radiative cooling of nano-devices.
Finally, we review emerging applications of thermoplasmonics that leverage
Ohmic losses to achieve new enhanced functionalities. The most successful
commercialized example of a loss-enabled novel application of plasmonics is
heat-assisted magnetic recording. Other promising technological directions
include thermal emission manipulation, cancer therapy, nanofabrication,
nano-manipulation, plasmon-enabled material spectroscopy and thermo-catalysis,
and solar water treatment.
| physics.optics cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.plasm-ph | unlike conventional optics plasmonics enables unrivalled concentration of optical energy well beyond the diffraction limit of light however a significant part of this energy is dissipated as heat plasmonic losses present a major hurdle in the development of plasmonic devices and circuits that can compete with other mature technologies until recently they have largely kept the use of plasmonics to a few niche areas where loss is not a key factor such as surface enhanced raman scattering and biochemical sensing here we discuss the origin of plasmonic losses and various approaches to either minimize or mitigate them based on understanding of fundamental processes underlying surface plasmon modes excitation and decay along with the ongoing effort to find and synthesize better plasmonic materials optical designs that modify the optical powerflow through plasmonic nanostructures can help in reducing both radiative damping and dissipative losses of surface plasmons another strategy relies on the development of hybrid photonicplasmonic devices by coupling plasmonic nanostructures to resonant optical elements hybrid integration not only helps to reduce dissipative losses and radiative damping of surface plasmons but also makes possible passive radiative cooling of nanodevices finally we review emerging applications of thermoplasmonics that leverage ohmic losses to achieve new enhanced functionalities the most successful commercialized example of a lossenabled novel application of plasmonics is heatassisted magnetic recording other promising technological directions include thermal emission manipulation cancer therapy nanofabrication nanomanipulation plasmonenabled material spectroscopy and thermocatalysis and solar water treatment | [['unlike', 'conventional', 'optics', 'plasmonics', 'enables', 'unrivalled', 'concentration', 'of', 'optical', 'energy', 'well', 'beyond', 'the', 'diffraction', 'limit', 'of', 'light', 'however', 'a', 'significant', 'part', 'of', 'this', 'energy', 'is', 'dissipated', 'as', 'heat', 'plasmonic', 'losses', 'present', 'a', 'major', 'hurdle', 'in', 'the', 'development', 'of', 'plasmonic', 'devices', 'and', 'circuits', 'that', 'can', 'compete', 'with', 'other', 'mature', 'technologies', 'until', 'recently', 'they', 'have', 'largely', 'kept', 'the', 'use', 'of', 'plasmonics', 'to', 'a', 'few', 'niche', 'areas', 'where', 'loss', 'is', 'not', 'a', 'key', 'factor', 'such', 'as', 'surface', 'enhanced', 'raman', 'scattering', 'and', 'biochemical', 'sensing', 'here', 'we', 'discuss', 'the', 'origin', 'of', 'plasmonic', 'losses', 'and', 'various', 'approaches', 'to', 'either', 'minimize', 'or', 'mitigate', 'them', 'based', 'on', 'understanding', 'of', 'fundamental', 'processes', 'underlying', 'surface', 'plasmon', 'modes', 'excitation', 'and', 'decay', 'along', 'with', 'the', 'ongoing', 'effort', 'to', 'find', 'and', 'synthesize', 'better', 'plasmonic', 'materials', 'optical', 'designs', 'that', 'modify', 'the', 'optical', 'powerflow', 'through', 'plasmonic', 'nanostructures', 'can', 'help', 'in', 'reducing', 'both', 'radiative', 'damping', 'and', 'dissipative', 'losses', 'of', 'surface', 'plasmons', 'another', 'strategy', 'relies', 'on', 'the', 'development', 'of', 'hybrid', 'photonicplasmonic', 'devices', 'by', 'coupling', 'plasmonic', 'nanostructures', 'to', 'resonant', 'optical', 'elements', 'hybrid', 'integration', 'not', 'only', 'helps', 'to', 'reduce', 'dissipative', 'losses', 'and', 'radiative', 'damping', 'of', 'surface', 'plasmons', 'but', 'also', 'makes', 'possible', 'passive', 'radiative', 'cooling', 'of', 'nanodevices', 'finally', 'we', 'review', 'emerging', 'applications', 'of', 'thermoplasmonics', 'that', 'leverage', 'ohmic', 'losses', 'to', 'achieve', 'new', 'enhanced', 'functionalities', 'the', 'most', 'successful', 'commercialized', 'example', 'of', 'a', 'lossenabled', 'novel', 'application', 'of', 'plasmonics', 'is', 'heatassisted', 'magnetic', 'recording', 'other', 'promising', 'technological', 'directions', 'include', 'thermal', 'emission', 'manipulation', 'cancer', 'therapy', 'nanofabrication', 'nanomanipulation', 'plasmonenabled', 'material', 'spectroscopy', 'and', 'thermocatalysis', 'and', 'solar', 'water', 'treatment']] | [-0.11235472152327906, 0.15980741863368858, -0.0019935917665293824, 0.008325932907993721, -0.12138109593082393, -0.19023642780550043, 0.049472533898302334, 0.4490092115472798, -0.25867230753868203, -0.3097351038305851, 0.05452195580366936, -0.2896358193456341, -0.19521292007355343, 0.2734282634718116, -0.05427504783861716, 0.08401628479387077, 0.03142109825000764, -0.10827898655974852, 0.0066642950562551964, -0.14448434437864818, 0.24226886224205987, 0.08892883940595929, 0.3334481317563698, 0.12281535534612552, 0.054434605131420906, -0.013637297423281373, 0.022836583144353696, -0.06171649095309085, -0.10263263704478107, 0.16199827920016735, 0.29125532148335176, 0.02458912105877188, 0.30295649678780373, -0.5209580354533995, -0.29288967989408704, 0.038565731524855276, 0.18906679039109767, 0.1390636254078414, -0.11982620680677206, -0.19187292065628597, 0.008814702358662704, -0.13476579329824145, -0.12265906554540199, -0.09085443919170393, -0.029051237995048617, 0.02443953926620007, -0.20676623029194238, -0.00048118660863555714, 0.04253899485446544, 0.04758081078492026, -0.05094528768615864, -0.11059505404818033, -0.022394459436741905, 0.09416312181768066, 0.010914267336248267, -0.028366428955147665, 0.24704232362083273, -0.15639702935176528, -0.14190568534248676, 0.37834174190363, -0.052878229102003876, -0.11140765614300684, 0.22057294882077505, -0.13335353962562288, -0.011942202465526193, 0.17203327263842969, 0.2190309057782408, 0.09252115262609431, -0.16669101487522953, 0.015770066948754925, 0.09640793677530927, 0.15286701177591325, 0.07480861452400275, 0.17187621875642503, 0.24269879779008213, 0.2407538006809159, 0.033644454497726094, 0.11419960476737076, -0.09080068131858181, -0.005947307033419121, -0.22361985137804022, -0.189670759347515, -0.16714871399505418, 0.0675050643507739, -0.026648506661619154, -0.1903338655986615, 0.36448840711870967, 0.16425364525037728, 0.09369996740862632, -0.04614141895455399, 0.3726113322760737, 0.08575547142111488, 0.14305578865000845, 0.013642821319495575, 0.304011659794939, 0.15720711710454133, 0.12048140045192549, -0.2879668524624379, 0.04050871528358933, -0.04748047730700754] |
1,802.0147 | Anomalous Spectral Characteristics of Ultrathin sub-nm Colloidal CdSe
Nanoplatelets | We demonstrate high quantum yield broad photoluminescence emission of
ultrathin sub-nanometer CdSe nanoplatelets (two-monolayer). They also exhibit
polarization-characterized lateral size dependent anomalous heavy hole and
light/split-off hole absorption intensities.
| physics.app-ph cond-mat.mes-hall physics.optics | we demonstrate high quantum yield broad photoluminescence emission of ultrathin subnanometer cdse nanoplatelets twomonolayer they also exhibit polarizationcharacterized lateral size dependent anomalous heavy hole and lightsplitoff hole absorption intensities | [['we', 'demonstrate', 'high', 'quantum', 'yield', 'broad', 'photoluminescence', 'emission', 'of', 'ultrathin', 'subnanometer', 'cdse', 'nanoplatelets', 'twomonolayer', 'they', 'also', 'exhibit', 'polarizationcharacterized', 'lateral', 'size', 'dependent', 'anomalous', 'heavy', 'hole', 'and', 'lightsplitoff', 'hole', 'absorption', 'intensities']] | [-0.045231363449532255, 0.23879787128848526, -9.800837590144231e-05, 0.06882756679820326, 0.019490849710284516, -0.3149096458218992, -0.015563323404281758, 0.6332288318528578, -0.19121251670786968, -0.3492386361870628, -0.10356486312901744, -0.351534998187652, -0.06038109734296226, 0.19542753571071303, 0.006981355782884818, 0.11244242441338989, -0.020204168995125935, -0.2310631268012982, -0.046132293408915684, -0.11491861402128752, 0.20267533520773912, 0.07340921470089458, 0.3753272886746205, 0.24459234309884217, 0.04475876531348778, -0.010866320584542476, 0.1185119605730646, 0.043469777617316976, -0.15163572583920681, 0.1007061880081892, 0.24079392470705968, -0.13838526993416822, 0.1329603339366328, -0.4354502342354793, -0.2089620688571953, -0.05915101959656637, 0.23773352257334268, 0.2232087106945423, -0.18645153398840472, -0.2736717314692214, 0.0341027258680417, -0.11965734470420732, -0.12039800912428361, -0.06236887339932414, 0.023860955610871315, 0.026664294517384127, -0.15649534324900463, 0.13908967052366977, 0.04220652298625702, 0.07515500904992223, -0.0948006548703863, -0.0914576040724149, -0.08958452610442272, 0.008442364487564191, 0.0047135201927561024, -0.14906634177224568, 0.4018352776228522, -0.05314085632562637, -0.18290707211081797, 0.27799322278811955, -0.09676138321475054, 0.032671844121068716, 0.14202110161288425, -0.36627354100346565, -0.06533430305381234, 0.31317239415903503, 0.18232146750849026, 0.2347567125868339, -0.04260344004545074, 0.05546658958729285, 0.02609600857473337, 0.28283465510377515, 0.15046785496032009, 0.28662176351421154, 0.35274203909704316, 0.1641801195935561, -0.07338811869088274, 0.13071325643417928, -0.20255543356044933, 0.04338763390954297, -0.14590414900046128, -0.18126487160603014, -0.1670854828463724, 0.19547709507437852, -0.22784075031645792, -0.2889394026536208, 0.3123158225073264, 0.11520998702886012, 0.19324942445382476, -0.0669760129127938, 0.1851787495498474, 0.1342872093574932, 0.06736865700580753, -0.02012175565155653, 0.3177969725086139, 0.18808088086258906, 0.15989187001608884, -0.3560931239850246, 0.060340123215260416, -0.13513175355127224] |
1,802.01471 | Review of LiFi visible light communications : research and use cases | LiFi is a networked wireless communication technology transforming
solid-state indoor lighting into a backbone for information. The technology has
reached maturity, with the first LiFi LED luminaire commercialized in 2016.
Real life deployments with a variety of use cases, as well as staggering
bandwidth improvements in the lab superior to 10 Gbps, hint to a luminous
future for LiFi as a powerful complement or alternative to WiFi and 4G/5G.
| physics.app-ph cs.NI | lifi is a networked wireless communication technology transforming solidstate indoor lighting into a backbone for information the technology has reached maturity with the first lifi led luminaire commercialized in 2016 real life deployments with a variety of use cases as well as staggering bandwidth improvements in the lab superior to 10 gbps hint to a luminous future for lifi as a powerful complement or alternative to wifi and 4g5g | [['lifi', 'is', 'a', 'networked', 'wireless', 'communication', 'technology', 'transforming', 'solidstate', 'indoor', 'lighting', 'into', 'a', 'backbone', 'for', 'information', 'the', 'technology', 'has', 'reached', 'maturity', 'with', 'the', 'first', 'lifi', 'led', 'luminaire', 'commercialized', 'in', '2016', 'real', 'life', 'deployments', 'with', 'a', 'variety', 'of', 'use', 'cases', 'as', 'well', 'as', 'staggering', 'bandwidth', 'improvements', 'in', 'the', 'lab', 'superior', 'to', '10', 'gbps', 'hint', 'to', 'a', 'luminous', 'future', 'for', 'lifi', 'as', 'a', 'powerful', 'complement', 'or', 'alternative', 'to', 'wifi', 'and', '4g5g']] | [-0.13130094200331607, 0.003546076326850144, 0.0008692286073175423, 0.010047301206641886, -0.09353248281952213, -0.21207306977114915, 0.07115897760890863, 0.4161560573779485, -0.16926458784762552, -0.31040722449902475, 0.16164066679159397, -0.2655354233129936, -0.14821590758819023, 0.27790945501408926, -0.15268593962194726, 0.06254563729196568, 0.0674160796984592, -0.0017887028139632415, 0.004503184275509899, -0.23328585128354676, 0.1545927183709436, 0.10808421224903535, 0.358143854269977, 0.08823873588185319, 0.09794586633934695, -0.029711409725303596, 0.010575424813021742, -0.08448288429626165, -0.012291249810111956, 0.1181380970759646, 0.3913539119119592, 0.16489545922890744, 0.31030110285192836, -0.43543395490440373, -0.276998285573962, 0.10399845345219706, 0.15901210256304374, 0.030701130489914623, -0.0890501622137997, -0.33695089959827085, 0.08301405256925672, -0.27585090227041614, -0.14355146637706853, -0.017611128641018534, 0.02538473218994434, 0.021550178116954425, -0.27294334114583974, -0.056905119323774296, -0.09501703405882889, 0.11236218229511424, -0.0032350134570151567, -0.09556381360572927, 0.052184046838459945, 0.17646298988599002, -0.03397166133543257, 0.04970379391349578, 0.15576190515147412, -0.14095484883086207, -0.16414506282821736, 0.4258452084134607, -0.051459357926539856, -0.08117713673067663, 0.22164922306204543, -0.04894851583658772, -0.12157465840744622, 0.09887973623870708, 0.21929478241979858, -0.0026732480482143514, -0.1499711873663781, 0.009032506645513316, 0.04119051995632403, 0.1287012191776953, 0.07765853058491998, 0.13011411792489097, 0.21132762939669192, 0.31213067407610223, 0.1473707273561398, 0.07638845479745857, -0.10349160068504074, -0.0858705349622623, -0.20793720794608817, -0.1939048046410522, -0.19385987323681442, 0.11693072256029528, -0.06488269077839076, -0.09473574341630892, 0.35502283461391926, 0.14826384978368878, 0.12916812953806264, 0.032099496970391446, 0.3995122505242334, -0.006200060130247627, 0.1479393829975058, 0.05330183783628266, 0.19454085037988775, 0.0654706764856682, 0.25053138458443913, -0.08122776224798359, 0.05120023700317902, -0.07416734757134691] |
1,802.01472 | Coefficient of Thermal Expansion Balancing for Field Assisted Bonding of
Silicon to Glass | Stresses caused by thermal expansion coefficients mismatch of anodically
bonded glass and silicon samples are studied. An analytical model to determine
graphically the optimum bonding temperature is presented. It is essentially a
model for thin-film stress but uses integration of the linear coefficient of
thermal expansion difference between the bonding temperature and the working
temperature. Recommendations for choosing the bonding temperature of silicon to
two brands of glass (Corning 7740 and LK5) are made. Keywords: anodic bonding,
field assisted bonding, thermal expansion, stress.
| physics.app-ph | stresses caused by thermal expansion coefficients mismatch of anodically bonded glass and silicon samples are studied an analytical model to determine graphically the optimum bonding temperature is presented it is essentially a model for thinfilm stress but uses integration of the linear coefficient of thermal expansion difference between the bonding temperature and the working temperature recommendations for choosing the bonding temperature of silicon to two brands of glass corning 7740 and lk5 are made keywords anodic bonding field assisted bonding thermal expansion stress | [['stresses', 'caused', 'by', 'thermal', 'expansion', 'coefficients', 'mismatch', 'of', 'anodically', 'bonded', 'glass', 'and', 'silicon', 'samples', 'are', 'studied', 'an', 'analytical', 'model', 'to', 'determine', 'graphically', 'the', 'optimum', 'bonding', 'temperature', 'is', 'presented', 'it', 'is', 'essentially', 'a', 'model', 'for', 'thinfilm', 'stress', 'but', 'uses', 'integration', 'of', 'the', 'linear', 'coefficient', 'of', 'thermal', 'expansion', 'difference', 'between', 'the', 'bonding', 'temperature', 'and', 'the', 'working', 'temperature', 'recommendations', 'for', 'choosing', 'the', 'bonding', 'temperature', 'of', 'silicon', 'to', 'two', 'brands', 'of', 'glass', 'corning', '7740', 'and', 'lk5', 'are', 'made', 'keywords', 'anodic', 'bonding', 'field', 'assisted', 'bonding', 'thermal', 'expansion', 'stress']] | [-0.11133046420404642, 0.1824544856352121, -0.06550519206992737, -0.06754457238187059, -0.020156595697654864, -0.15828924725490917, 0.031489763908633374, 0.42833016749198843, -0.261939216802669, -0.2451039652181108, 0.0390243417833273, -0.3310423379099542, -0.0976371648607821, 0.13391032067082095, 0.03995027958710746, 0.012072707776252816, -0.044856274148403874, -0.06527590651701136, -0.05953301963532662, -0.22171836114160592, 0.23280286349401605, 0.12099646363498234, 0.3654553711686919, 0.13597895366866597, 0.08947570487947726, -0.03083164660578094, 0.012443869988002428, 0.0479186689708291, -0.18554282300855693, 0.07907544396726823, 0.27011359869161755, -0.07335419462221425, 0.17648569999898717, -0.45860112115468193, -0.17183793436951664, -0.0021557522960370633, 0.037567838901517596, 0.09960963417741857, -0.037358207670721885, -0.17615530131066717, -0.00015214537043215298, -0.16102927473441855, -0.11300302925519645, -0.07104059996700238, 0.0028152802473547438, 0.01867781131721397, -0.2781660864924694, 0.12728918643622864, 0.0244588088717137, 0.09832344956060009, -0.09596648328176631, -0.1757597866036543, -0.08379212846388905, 0.07597100103796436, -0.005918325558191211, -0.03368178530164608, 0.2934172583606219, -0.08565347868290435, -0.0005889620586502842, 0.3688258607303951, -0.04272830092189152, -0.1122517896384546, 0.19673792914510135, -0.08359935980222029, 0.013985754166752464, 0.15303640940976215, 0.085813888961949, 0.02864745000331867, -0.2271300683297762, 0.02987047775276573, 0.09398043381970195, 0.18540329607941847, 0.1790857972668075, -0.03128629993851774, 0.2071928582509139, 0.2188221436993378, -0.020059762108026118, 0.16296318420436143, -0.03859132958757805, -0.07074725027082533, -0.21911740280324365, -0.20449127474936044, -0.23138807484562077, 0.01165608202516124, -0.17247172929406898, -0.24402653250883038, 0.34273737778591856, 0.10830615709603923, 0.11387578970802346, -0.028960743247142356, 0.24590346648743966, 0.061641877914619884, 0.06477794617346329, -0.0064404822954135695, 0.28604596019608947, 0.22987857003548615, 0.1453466256995254, -0.2638962200115912, 0.11658560710663839, 0.04992775235143376] |
1,802.01473 | Two $q$-analogues of Euler's formula $\zeta(2)=\pi^2/6$ | It is well known that $\zeta(2)=\pi^2/6$ as discovered by Euler. In this
paper we present the following two $q$-analogues of this celebrated formula:
$$\sum_{k=0}^\infty\frac{q^k(1+q^{2k+1})}{(1-q^{2k+1})^2}=\prod_{n=1}^\infty\frac{(1-q^{2n})^4}{(1-q^{2n-1})^4}$$
and $$\sum_{k=0}^\infty\frac{q^{2k-\lfloor(-1)^kk/2\rfloor}}{(1-q^{2k+1})^2}
=\prod_{n=1}^\infty\frac{(1-q^{2n})^2(1-q^{4n})^2}{(1-q^{2n-1})^2(1-q^{4n-2})^2},$$
where $q$ is any complex number with $|q|<1$. We also give a $q$-analogue of
the identity $\zeta(4)=\pi^4/90$, and pose a problem on $q$-analogues of
Euler's formula for $\zeta(2m)\ (m=3,4,\ldots)$.
| math.NT math.CO | it is well known that zeta2pi26 as discovered by euler in this paper we present the following two qanalogues of this celebrated formula sum_k0inftyfracqk1q2k11q2k12prod_n1inftyfrac1q2n41q2n14 and sum_k0inftyfracq2klfloor1kk2rfloor1q2k12 prod_n1inftyfrac1q2n21q4n21q2n121q4n22 where q is any complex number with q1 we also give a qanalogue of the identity zeta4pi490 and pose a problem on qanalogues of eulers formula for zeta2m m34ldots | [['it', 'is', 'well', 'known', 'that', 'zeta2pi26', 'as', 'discovered', 'by', 'euler', 'in', 'this', 'paper', 'we', 'present', 'the', 'following', 'two', 'qanalogues', 'of', 'this', 'celebrated', 'formula', 'sum_k0inftyfracqk1q2k11q2k12prod_n1inftyfrac1q2n41q2n14', 'and', 'sum_k0inftyfracq2klfloor1kk2rfloor1q2k12', 'prod_n1inftyfrac1q2n21q4n21q2n121q4n22', 'where', 'q', 'is', 'any', 'complex', 'number', 'with', 'q1', 'we', 'also', 'give', 'a', 'qanalogue', 'of', 'the', 'identity', 'zeta4pi490', 'and', 'pose', 'a', 'problem', 'on', 'qanalogues', 'of', 'eulers', 'formula', 'for', 'zeta2m', 'm34ldots']] | [-0.15628078196830344, 0.04595285699755516, -0.09786245293634117, 0.07275621600027354, -0.11412557443814739, -0.1560916504031926, 0.030220289923303393, 0.24434294881966878, -0.2557868117220559, -0.28416280894768686, 0.08988543491555764, -0.2531886492583479, -0.24684070124519322, 0.23543546700252677, -0.13971263215929833, 0.03685179057548631, 0.004613690912934407, 0.061453314076335926, -0.046897956635802984, -0.2569692060702814, 0.358588400033285, -0.05666398575072581, 0.1539362731196408, 0.0664359969218736, 0.1233374494246541, 0.04508469014577919, 0.012016597028189111, -0.03143882992202943, -0.17945877612057198, 0.09845384386728324, 0.21703693267168864, 0.133345156301797, 0.23282543583860937, -0.33293777950248626, -0.0912492729213862, 0.11585504925625294, 0.182236712540166, 0.04777536600968748, -0.07267450679418684, -0.22506834928578925, 0.07929078047603087, -0.21877547659261046, -0.16329098407635992, -0.042240147197724516, 0.0869326070038918, 0.08535317743618814, -0.2595448467950776, 0.08607725069346346, 0.11327324038204509, 0.0583412687838921, -0.03369503325062259, -0.1982472281692163, 0.08856288058560272, 0.062419903192247425, 0.0808312422420197, 0.04974159130932025, -0.051963208449723304, -0.1349112307213528, -0.1203662679653685, 0.39506817004590666, -0.0023840700082902637, -0.2236101111080849, 0.09308020709925946, -0.1450011961706826, -0.1942282584583703, 0.031674319702499315, 0.07935380524041939, 0.17876316631599418, -0.0776761731282228, 0.07321215152766837, -0.19513314719891772, 0.06020662206980699, 0.1520881755628957, -0.02210965714821557, 0.10480393775967213, 0.04948151705540576, 0.020109704080617654, 0.2235269518876624, -0.056638110793670114, -0.019180883618317685, -0.30169543300597174, -0.24875735605733013, -0.2009792268311359, 0.12380751208314356, -0.06757825093710672, -0.17716472989545679, 0.3466460697774617, 0.11509353894178036, 0.21457339744171444, 0.14473255945123592, 0.2801278276843423, 0.15506628818836343, 0.017059908722931484, 0.008189600558494622, 0.10440937411655092, 0.14735404364896482, 0.0828805918067272, -0.12862426770042698, 0.04733437037025139, 0.22275604383211653] |
1,802.01474 | Van der Waal's gas equation for an adiabatic process and its Carnot
engine efficiency | There has been many studies on gases which obeys Van der Waal's equation of
state. However there is no specific and direct studies of Van der Waal's gas
which undergoes adiabatic processes are available in the undergraduate text
books and also in literature. In an adiabatic process there is no heat energy
exchange between the system and its surroundings. In this article, we find that
the Van der Waal's equation for the adiabatic process as
$\left(P+\frac{n^2a}{V^2}\right) \left(V-nb\right)^{\Gamma}=\mbox{constant}$,
where $P$ is the pressure, $V$ is the volume, $n$ is the number of moles of the
Van der Waal's gas, $a$ and $b$ are Van der Waal's constant and $\Gamma$ is a
factor which relates the specific heat at constant pressure and at constant
volume. We use this relation explicitly and obtained the efficiency of a Carnot
engine whose working substance obeys Van der Waal's equation of state. Our
simplest approach may provide clear idea to the undergraduate students that
$\Gamma$ is different from $\gamma$ of the ideal gas for an adiabatic process.
We also shown that the efficiency of the Carnot engine is independent of the
working substance.
| cond-mat.stat-mech | there has been many studies on gases which obeys van der waals equation of state however there is no specific and direct studies of van der waals gas which undergoes adiabatic processes are available in the undergraduate text books and also in literature in an adiabatic process there is no heat energy exchange between the system and its surroundings in this article we find that the van der waals equation for the adiabatic process as leftpfracn2av2right leftvnbrightgammamboxconstant where p is the pressure v is the volume n is the number of moles of the van der waals gas a and b are van der waals constant and gamma is a factor which relates the specific heat at constant pressure and at constant volume we use this relation explicitly and obtained the efficiency of a carnot engine whose working substance obeys van der waals equation of state our simplest approach may provide clear idea to the undergraduate students that gamma is different from gamma of the ideal gas for an adiabatic process we also shown that the efficiency of the carnot engine is independent of the working substance | [['there', 'has', 'been', 'many', 'studies', 'on', 'gases', 'which', 'obeys', 'van', 'der', 'waals', 'equation', 'of', 'state', 'however', 'there', 'is', 'no', 'specific', 'and', 'direct', 'studies', 'of', 'van', 'der', 'waals', 'gas', 'which', 'undergoes', 'adiabatic', 'processes', 'are', 'available', 'in', 'the', 'undergraduate', 'text', 'books', 'and', 'also', 'in', 'literature', 'in', 'an', 'adiabatic', 'process', 'there', 'is', 'no', 'heat', 'energy', 'exchange', 'between', 'the', 'system', 'and', 'its', 'surroundings', 'in', 'this', 'article', 'we', 'find', 'that', 'the', 'van', 'der', 'waals', 'equation', 'for', 'the', 'adiabatic', 'process', 'as', 'leftpfracn2av2right', 'leftvnbrightgammamboxconstant', 'where', 'p', 'is', 'the', 'pressure', 'v', 'is', 'the', 'volume', 'n', 'is', 'the', 'number', 'of', 'moles', 'of', 'the', 'van', 'der', 'waals', 'gas', 'a', 'and', 'b', 'are', 'van', 'der', 'waals', 'constant', 'and', 'gamma', 'is', 'a', 'factor', 'which', 'relates', 'the', 'specific', 'heat', 'at', 'constant', 'pressure', 'and', 'at', 'constant', 'volume', 'we', 'use', 'this', 'relation', 'explicitly', 'and', 'obtained', 'the', 'efficiency', 'of', 'a', 'carnot', 'engine', 'whose', 'working', 'substance', 'obeys', 'van', 'der', 'waals', 'equation', 'of', 'state', 'our', 'simplest', 'approach', 'may', 'provide', 'clear', 'idea', 'to', 'the', 'undergraduate', 'students', 'that', 'gamma', 'is', 'different', 'from', 'gamma', 'of', 'the', 'ideal', 'gas', 'for', 'an', 'adiabatic', 'process', 'we', 'also', 'shown', 'that', 'the', 'efficiency', 'of', 'the', 'carnot', 'engine', 'is', 'independent', 'of', 'the', 'working', 'substance']] | [-0.1295594696386566, 0.12105315911246942, -0.07960595629379355, -0.0015905473622075767, -0.05642139123047928, -0.15277170502404505, 0.0708564428946104, 0.3093629239278065, -0.24996707303027899, -0.2812109392337702, -0.049361900912245384, -0.3479798276354936, -0.14658659789837092, 0.26190578620377425, 0.008308003440096572, 0.033999248175894385, 0.021802058486217583, 0.018522418995318632, -0.024542567563067014, -0.2552093049058238, 0.34811044171754574, 0.0904632718516262, 0.2439924993967587, 0.11678016300539712, 0.09816384670148427, -0.02477319148841874, 0.04432225799741777, 0.005907370776844186, -0.23638517835890918, 0.0792969622164713, 0.26789266563876457, -0.02216020712752455, 0.32895768554629506, -0.40806251692308765, -0.1990865166273874, 0.07624892599226253, 0.06914018885408704, 0.12526718192368846, -0.03394970545809515, -0.22405762238478338, 0.019997927959303597, -0.2261182085636097, -0.07023889117849035, -0.05285310629406013, 0.07265951186921951, 0.07501497523846558, -0.19213541068539425, 0.1500946169590099, 0.12134272916961424, 0.010979126785202204, -0.05878051148563925, -0.09985818135413668, 0.001859145552373013, 0.12334655806220866, -0.028321086328847937, 0.010403240872295322, 0.20127762491638596, -0.14118690415210014, -0.01991072565449301, 0.42040316514872217, -0.06274703446196744, -0.11532571488437621, 0.22993791309512548, -0.09693633724708815, -0.10206902940329668, 0.09483081939428843, 0.0639869762584567, 0.023178219697060617, -0.15612685341337645, 0.17062242946593795, 0.009312766631813468, 0.17909964333112174, 0.1474965598069232, -0.0643508162563415, 0.1881804294003224, 0.12512069708994916, 0.023661915340926497, 0.10590077186242451, -0.014293626100580032, -0.09102718873402557, -0.2899555409679542, -0.2700388814851239, -0.2571229411930953, 0.10238783923481164, -0.09269425321261814, -0.23203521851698766, 0.27486115540755357, 0.07864476427313166, 0.12252359716095836, -0.0399764214066562, 0.26060043624979823, 0.1498137228971196, 0.01138431619682878, 0.09037445847549148, 0.28621759146099557, 0.11629664546029793, 0.1358658902070208, -0.22878881652738797, 0.053083274646888716, 0.08500338350548535] |
1,802.01475 | Damage identification on spatial Timoshenko arches by means of genetic
algorithms | In this paper a procedure for the dynamic identification of damage in spatial
Timoshenko arches is presented. The proposed approach is based on the
calculation of an arbitrary number of exact eigen-properties of a damaged
spatial arch by means of the Wittrick and Williams algorithm. The proposed
damage model considers a reduction of the volume in a part of the arch, and is
therefore suitable, differently than what is commonly proposed in the main part
of the dedicated literature, not only for concentrated cracks but also for
diffused damaged zones which may involve a loss of mass. Different damage
scenarios can be taken into account with variable location, intensity and
extension of the damage as well as number of damaged segments. An optimization
procedure, aiming at identifying which damage configuration minimizes the
difference between its eigen-properties and a set of measured modal quantities
for the structure, is implemented making use of genetic algorithms. In this
context, an initial random population of chromosomes, representing different
damage distributions along the arch, is forced to evolve towards the fittest
solution. Several applications with different, single or multiple, damaged
zones and boundary conditions confirm the validity and the applicability of the
proposed procedure even in presence of instrumental errors on the measured
data.
| physics.app-ph | in this paper a procedure for the dynamic identification of damage in spatial timoshenko arches is presented the proposed approach is based on the calculation of an arbitrary number of exact eigenproperties of a damaged spatial arch by means of the wittrick and williams algorithm the proposed damage model considers a reduction of the volume in a part of the arch and is therefore suitable differently than what is commonly proposed in the main part of the dedicated literature not only for concentrated cracks but also for diffused damaged zones which may involve a loss of mass different damage scenarios can be taken into account with variable location intensity and extension of the damage as well as number of damaged segments an optimization procedure aiming at identifying which damage configuration minimizes the difference between its eigenproperties and a set of measured modal quantities for the structure is implemented making use of genetic algorithms in this context an initial random population of chromosomes representing different damage distributions along the arch is forced to evolve towards the fittest solution several applications with different single or multiple damaged zones and boundary conditions confirm the validity and the applicability of the proposed procedure even in presence of instrumental errors on the measured data | [['in', 'this', 'paper', 'a', 'procedure', 'for', 'the', 'dynamic', 'identification', 'of', 'damage', 'in', 'spatial', 'timoshenko', 'arches', 'is', 'presented', 'the', 'proposed', 'approach', 'is', 'based', 'on', 'the', 'calculation', 'of', 'an', 'arbitrary', 'number', 'of', 'exact', 'eigenproperties', 'of', 'a', 'damaged', 'spatial', 'arch', 'by', 'means', 'of', 'the', 'wittrick', 'and', 'williams', 'algorithm', 'the', 'proposed', 'damage', 'model', 'considers', 'a', 'reduction', 'of', 'the', 'volume', 'in', 'a', 'part', 'of', 'the', 'arch', 'and', 'is', 'therefore', 'suitable', 'differently', 'than', 'what', 'is', 'commonly', 'proposed', 'in', 'the', 'main', 'part', 'of', 'the', 'dedicated', 'literature', 'not', 'only', 'for', 'concentrated', 'cracks', 'but', 'also', 'for', 'diffused', 'damaged', 'zones', 'which', 'may', 'involve', 'a', 'loss', 'of', 'mass', 'different', 'damage', 'scenarios', 'can', 'be', 'taken', 'into', 'account', 'with', 'variable', 'location', 'intensity', 'and', 'extension', 'of', 'the', 'damage', 'as', 'well', 'as', 'number', 'of', 'damaged', 'segments', 'an', 'optimization', 'procedure', 'aiming', 'at', 'identifying', 'which', 'damage', 'configuration', 'minimizes', 'the', 'difference', 'between', 'its', 'eigenproperties', 'and', 'a', 'set', 'of', 'measured', 'modal', 'quantities', 'for', 'the', 'structure', 'is', 'implemented', 'making', 'use', 'of', 'genetic', 'algorithms', 'in', 'this', 'context', 'an', 'initial', 'random', 'population', 'of', 'chromosomes', 'representing', 'different', 'damage', 'distributions', 'along', 'the', 'arch', 'is', 'forced', 'to', 'evolve', 'towards', 'the', 'fittest', 'solution', 'several', 'applications', 'with', 'different', 'single', 'or', 'multiple', 'damaged', 'zones', 'and', 'boundary', 'conditions', 'confirm', 'the', 'validity', 'and', 'the', 'applicability', 'of', 'the', 'proposed', 'procedure', 'even', 'in', 'presence', 'of', 'instrumental', 'errors', 'on', 'the', 'measured', 'data']] | [-0.08161181439950618, 0.07965881013401835, -0.060602619899257734, 0.052013009529148876, -0.04027146991463199, -0.09931527073450315, 0.043571460095476, 0.35145187909634285, -0.23910620807929753, -0.31301807732178044, 0.12352980138754131, -0.23215357370925352, -0.12930953637330206, 0.16965250423527323, -0.09024948204888425, 0.06666216052102615, 0.0500197019875766, 0.020508080781347908, -0.001341756420515594, -0.22314607772736614, 0.2984307205344801, 0.08566983950060184, 0.2887419364515853, 0.027574563627310384, 0.09217382937976464, 0.04147860541259153, -0.05194914843125913, 0.05092017541979798, -0.06738267607355598, 0.10662911400252667, 0.22475751928197077, 0.1373315325416535, 0.32365725470299367, -0.4354031333943847, -0.24086756583374852, 0.09215980818127999, 0.13070150167914107, 0.09761082871409599, -0.004503560881578148, -0.26100391801446676, 0.08218025504846502, -0.13597681414998639, -0.14005745866989644, 0.0036884329366820077, 0.006731180355508024, 0.025982711643267136, -0.2782018331583039, 0.08110534200820368, 0.05100834330984911, 0.060617918466540195, -0.0815881021324178, -0.11841788663318417, -0.04122031882378416, 0.13338697548225845, 0.04887206637235627, -0.005988250142413913, 0.16616924905974884, -0.10412406075136879, -0.08076868222157757, 0.3723236609590598, 0.003408024840539908, -0.2207853363182109, 0.18422716187678118, -0.10010987717172472, -0.09862930393921068, 0.17251469780547687, 0.18984917999813872, 0.10749590208601709, -0.17273633307671005, 0.027527138860023115, 0.0008312282247621064, 0.15846424691531305, 0.09453459508502139, -0.022605383929868158, 0.1726950635515655, 0.19885252285278582, 0.053252395909601964, 0.16400694818254963, -0.1272117127921844, -0.09365492072090721, -0.30460747076414496, -0.15862589350805278, -0.16667220216857878, -0.03278317618011128, -0.0764911091236382, -0.20078644798083517, 0.40636662967825454, 0.16141673967481787, 0.20368714712318392, 0.030178996569772538, 0.3051582396269973, 0.08047386327969154, 0.07316752959517404, 0.04286106979438605, 0.1990412418683543, 0.09632443652841315, 0.07487258299415071, -0.21904383455806126, 0.1381535296565674, 0.026170786519427426] |
1,802.01476 | Trade-off Between Antenna Efficiency and Q-Factor | The trade-off between radiation efficiency and antenna bandwidth, expressed
in terms of Q-factor, for small antennas is formulated as a multi-objective
optimization problem in current distributions of predefined support. Variants
on the problem are constructed to demonstrate the consequences of requiring a
self-resonant current as opposed to one tuned by an external reactance. The
resulting Pareto-optimal sets reveal the relative cost of valuing low radiation
Q-factor over high efficiency, the cost in efficiency to require a
self-resonant current, the effects of lossy parasitic loading, and other
insights.
| physics.app-ph | the tradeoff between radiation efficiency and antenna bandwidth expressed in terms of qfactor for small antennas is formulated as a multiobjective optimization problem in current distributions of predefined support variants on the problem are constructed to demonstrate the consequences of requiring a selfresonant current as opposed to one tuned by an external reactance the resulting paretooptimal sets reveal the relative cost of valuing low radiation qfactor over high efficiency the cost in efficiency to require a selfresonant current the effects of lossy parasitic loading and other insights | [['the', 'tradeoff', 'between', 'radiation', 'efficiency', 'and', 'antenna', 'bandwidth', 'expressed', 'in', 'terms', 'of', 'qfactor', 'for', 'small', 'antennas', 'is', 'formulated', 'as', 'a', 'multiobjective', 'optimization', 'problem', 'in', 'current', 'distributions', 'of', 'predefined', 'support', 'variants', 'on', 'the', 'problem', 'are', 'constructed', 'to', 'demonstrate', 'the', 'consequences', 'of', 'requiring', 'a', 'selfresonant', 'current', 'as', 'opposed', 'to', 'one', 'tuned', 'by', 'an', 'external', 'reactance', 'the', 'resulting', 'paretooptimal', 'sets', 'reveal', 'the', 'relative', 'cost', 'of', 'valuing', 'low', 'radiation', 'qfactor', 'over', 'high', 'efficiency', 'the', 'cost', 'in', 'efficiency', 'to', 'require', 'a', 'selfresonant', 'current', 'the', 'effects', 'of', 'lossy', 'parasitic', 'loading', 'and', 'other', 'insights']] | [-0.15938424137046284, 0.04320990215152657, 0.03485116992017318, 0.026003798915490765, -0.07430608893059537, -0.1113694831889508, 0.09788389182274883, 0.3800450637936592, -0.2819536791193759, -0.37428940262581256, 0.06800686444113052, -0.23371602929111612, -0.08954709955630288, 0.24049037921874003, -0.10643215043919868, 0.07270532934230635, 0.03782412544128367, -0.003532021330541064, -0.03183051190023235, -0.21758891925396032, 0.25058388612875393, 0.12386409963358022, 0.3613226008440914, 0.08902952737635238, 0.12763597021928463, -0.010945729309179145, 0.019636939028170944, 0.038851105715094626, -0.054813687539734375, 0.09681229104673297, 0.2900814299428857, 0.1577970749570121, 0.31895895117636897, -0.43470766376061687, -0.21983560196648555, 0.0779020308072668, 0.12290033091919432, 0.041735076827221905, -0.02801585591253664, -0.20135278854219393, 0.07593510115262249, -0.17330444776238982, -0.0658637123696249, -0.03314242781214844, -0.05069712735712528, 0.06674001165719211, -0.322019983211468, 0.02766513807134403, -0.016361977120486072, 0.027542446341215707, -0.05973876719416558, -0.15298760531138328, -0.0016859255988022376, 0.10414465173179734, 0.03937492922922575, -0.007782007936902088, 0.17783124230122302, -0.1627848649266358, -0.14736899555842767, 0.38166921393110836, -0.04574163826503631, -0.25978152938829413, 0.16707098137201934, -0.09358421565654378, -0.00310329242406049, 0.17955073701410457, 0.21012468156458317, 0.09512902122932947, -0.09772361724519696, 0.030552845862065175, 0.06324204155404506, 0.18167650273562164, 0.1312484809989645, 0.11497855412334888, 0.20090683519936584, 0.20092316417441028, 0.10794683950203846, 0.21251166478166056, -0.04543325561633997, -0.057422090846317254, -0.24635757394563193, -0.10993060770433867, -0.18010652712920958, 0.029610984851659715, -0.1294015426795539, -0.1451192120339015, 0.3797764420220307, 0.11493197472059521, 0.18100946267060508, 0.05900436332556366, 0.35973982808404953, 0.14384723255469667, 0.06424335379624503, 0.04687080249704163, 0.26349756216908665, 0.08198839535497814, 0.07910229756641363, -0.297718117255102, 0.05289251316504703, -0.031166436627036196] |
1,802.01477 | Indirect interaction in graphene nanostructures | In this paper, the form of the indirect interaction between local impurities
in flakes and in graphene ring is analytically investigated. We calculate this
characteristic in the framework of the tight-binding model for a finite
nanocarbon system with periodic boundary conditions. A pronounced dependence of
the bond value on the impurity position inside the graphene sample is found,
which is due to quantum size effects. The influence of the flake size on the
value of the indirect interaction constant is also studied.
| cond-mat.mes-hall | in this paper the form of the indirect interaction between local impurities in flakes and in graphene ring is analytically investigated we calculate this characteristic in the framework of the tightbinding model for a finite nanocarbon system with periodic boundary conditions a pronounced dependence of the bond value on the impurity position inside the graphene sample is found which is due to quantum size effects the influence of the flake size on the value of the indirect interaction constant is also studied | [['in', 'this', 'paper', 'the', 'form', 'of', 'the', 'indirect', 'interaction', 'between', 'local', 'impurities', 'in', 'flakes', 'and', 'in', 'graphene', 'ring', 'is', 'analytically', 'investigated', 'we', 'calculate', 'this', 'characteristic', 'in', 'the', 'framework', 'of', 'the', 'tightbinding', 'model', 'for', 'a', 'finite', 'nanocarbon', 'system', 'with', 'periodic', 'boundary', 'conditions', 'a', 'pronounced', 'dependence', 'of', 'the', 'bond', 'value', 'on', 'the', 'impurity', 'position', 'inside', 'the', 'graphene', 'sample', 'is', 'found', 'which', 'is', 'due', 'to', 'quantum', 'size', 'effects', 'the', 'influence', 'of', 'the', 'flake', 'size', 'on', 'the', 'value', 'of', 'the', 'indirect', 'interaction', 'constant', 'is', 'also', 'studied']] | [-0.16380851837329385, 0.13309170406811485, -0.05303792543027822, 0.02570766589047796, -0.004286934243992153, -0.11583213527437027, 0.058801230345568736, 0.3691707049473757, -0.2769322289017642, -0.2716772092801587, 0.03271230320991358, -0.2779071871461006, -0.1367557627296575, 0.14190499576251592, 0.03469522945900879, 0.008962894568401502, 0.010322366951873935, 0.02915390192178964, -0.06641286455957991, -0.21463006162993248, 0.3179241655360362, 0.049456401766425497, 0.30332531700501353, 0.15315353395644485, 0.006362705622095524, 0.03372890688195007, 0.07180756921652795, 0.05564125794235889, -0.18495091757305512, 0.07585621442895656, 0.16815044419277778, -0.08832900588423377, 0.25137870178398924, -0.44297611628183114, -0.17871518236607675, 0.050613357040962974, 0.11644273663575692, 0.15555159818443537, -0.050848393627192554, -0.26039147718309813, 0.06692368052218382, -0.14394745705989984, -0.14238917674136733, 0.039884813970363725, 0.08123786960978334, -0.00831436580785255, -0.26383459959860617, 0.09845911983717176, 0.019595767490611208, 0.06622121797692848, -0.10496505167017259, -0.08987329269208513, -0.04024687437794921, 0.08068242600959975, 0.03791944298156922, -0.016489947021643563, 0.1824356008480053, -0.12213556795017566, -0.04066889939216397, 0.3919516364793952, -0.0801915735795685, -0.1929972350807497, 0.1451270733846397, -0.1714019432618487, -0.047207802005975345, 0.11057064624321533, 0.16449670411828088, 0.12084924566514063, -0.1531326475541857, 0.14042836132888092, -0.06344694416918906, 0.16161699837255405, 0.047788787076658595, 0.047463211764740505, 0.19616877278540193, 0.19824254755839343, 0.07754752367611395, 0.17943616799737622, -0.1302063996696322, -0.08899009962588912, -0.26443522870994923, -0.15084429343072017, -0.23928704932786343, 0.048102755565196276, -0.09785014877032643, -0.22016823964715912, 0.4316123151759867, 0.16012434889676003, 0.20183891602564694, -0.025494852987765448, 0.2476121029282761, 0.14153325226067043, 0.07810432339802657, 0.013753318886567906, 0.26416006965119754, 0.15344223991979095, 0.04716143435685009, -0.30348239425660634, 0.11196115950872076, 0.028673922342089254] |
1,802.01478 | Proposal and implementation of a novel perturb and observe algorithm
using embedded software | The aim of this paper is to implement a modified Perturb and Observe
algorithm (P\&O), in order to solve the oscillations problem of photovoltaic
(PV) power output generated by the conventional P\&O algorithm. A comparison
between the novel and the basic P\&O algorithms is made. The first is
implemented using embedded C language; the second is implemented using analog
blocks. Next, the simulation study is made to present the response of the
modified method to rapid temperature, solar irradiance and load change.
| physics.app-ph hep-ex | the aim of this paper is to implement a modified perturb and observe algorithm po in order to solve the oscillations problem of photovoltaic pv power output generated by the conventional po algorithm a comparison between the novel and the basic po algorithms is made the first is implemented using embedded c language the second is implemented using analog blocks next the simulation study is made to present the response of the modified method to rapid temperature solar irradiance and load change | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'implement', 'a', 'modified', 'perturb', 'and', 'observe', 'algorithm', 'po', 'in', 'order', 'to', 'solve', 'the', 'oscillations', 'problem', 'of', 'photovoltaic', 'pv', 'power', 'output', 'generated', 'by', 'the', 'conventional', 'po', 'algorithm', 'a', 'comparison', 'between', 'the', 'novel', 'and', 'the', 'basic', 'po', 'algorithms', 'is', 'made', 'the', 'first', 'is', 'implemented', 'using', 'embedded', 'c', 'language', 'the', 'second', 'is', 'implemented', 'using', 'analog', 'blocks', 'next', 'the', 'simulation', 'study', 'is', 'made', 'to', 'present', 'the', 'response', 'of', 'the', 'modified', 'method', 'to', 'rapid', 'temperature', 'solar', 'irradiance', 'and', 'load', 'change']] | [-0.10788672456018082, 0.04303276820517168, -0.02672843518666923, 0.01715809558291079, -0.050982241223498086, -0.11866386043384852, 0.036245558628096905, 0.3660608120574957, -0.29099482152520156, -0.322006060401114, 0.08462957620319751, -0.22469570558154728, -0.17872877833547024, 0.19628313844228482, -0.08037215380406962, 0.07391347441958582, 0.0361697197914487, 0.01805202026919621, -0.04993315602485204, -0.21138115161348406, 0.2539452672652083, 0.10175301013060095, 0.28272294342835863, 0.007422930208920706, 0.09181725386552876, -0.045163266110182856, -0.03543511406722956, 0.03556704655198789, -0.08511100628391255, 0.149624245313689, 0.22284507522609356, 0.12780742943514048, 0.2643634236059947, -0.45175737235695124, -0.1721354868467443, 0.0955019369267109, 0.08949016482092259, 0.0823968296267927, -0.057508963909817905, -0.20279721343299237, 0.11106395828906765, -0.16778694626466348, -0.10951667679644121, -0.038061380397710134, -0.02338261975020897, 0.018088731627979474, -0.301714047481499, -0.00651741372180035, 0.024839051363126533, 0.026684128236389014, -0.029259206005939987, -0.08173187149734032, 0.016569773433730006, 0.12806463379004016, -0.007970653556673446, 0.05234608610399158, 0.1333116872645006, -0.03248112884253582, -0.1239751842917829, 0.40090552958228237, -0.07506260946648559, -0.13113191865225574, 0.13251864594384666, -0.07708566601774315, -0.1068620936825826, 0.11261290294776966, 0.21396997498302925, 0.1213834949984874, -0.1692365944930693, 0.07645186049105576, 0.023296644911170006, 0.20666666612846823, 0.04711415638533852, -0.040862160916553765, 0.1788250505583497, 0.21632018846618692, 0.0350912684552008, 0.17870450094796536, -0.10087196487917781, -0.08049022674236855, -0.24494516322809476, -0.18758489625392163, -0.1578330473304249, -0.01667334354573452, 0.001150472425229609, -0.14190118980207822, 0.4203769830396263, 0.18792192551602677, 0.15448174839725765, 0.029585839317339224, 0.3716052937571232, 0.15321206675115517, 0.05640267681191312, 0.05562518495021433, 0.2429757247275741, 0.130672907823038, 0.1664359816236467, -0.28513028334986656, 0.06821886166680331, 0.09437851359174734] |
1,802.01479 | Characterising bars in low surface brightness galaxies | In this paper, we use $\textit{B}$-band, $\textit{I}$-band, and 3.6 $\mu$m
azimuthal light profiles of four low surface brightness (LSB) galaxies (UGC
628, F568-1, F568-3, F563-V2) to characterise three bar parameters: length,
strength, and corotation radius. We employ three techniques to measure the
radius of the bars, including a new method using the azimuthal light profiles.
We find comparable bar radii between the $\textit{I}$-band and 3.6 $\mu$m for
all four galaxies when using our azimuthal light profile method, and that our
bar lengths are comparable to those in high surface brightness galaxies (HSBs).
In addition, we find the bar strengths for our galaxies to be smaller than
those for HSBs. Finally, we use Fourier transforms of the $\textit{B}$-band,
$\textit{I}$-band, and 3.6 $\mu$m images to characterise the bars as either
`fast' or `slow' by measuring the corotation radius via phase profiles. When
using the $\textit{B}$ and $\textit{I}$-band phase crossings, we find three of
our galaxies have faster than expected relative bar pattern speeds for galaxies
expected to be embedded in centrally-dense cold dark matter haloes. When using
the $\textit{B}$-band and 3.6 $\mu$m phase crossings, we find more ambiguous
results, although the relative bar pattern speeds are still faster than
expected. Since we find a very slow bar in F563-V2, we are confident that we
are able to differentiate between fast and slow bars. Finally, we find no
relation between bar strength and relative bar pattern speed when comparing our
LSBs to HSBs.
| astro-ph.GA | in this paper we use textitbband textitiband and 36 mum azimuthal light profiles of four low surface brightness lsb galaxies ugc 628 f5681 f5683 f563v2 to characterise three bar parameters length strength and corotation radius we employ three techniques to measure the radius of the bars including a new method using the azimuthal light profiles we find comparable bar radii between the textitiband and 36 mum for all four galaxies when using our azimuthal light profile method and that our bar lengths are comparable to those in high surface brightness galaxies hsbs in addition we find the bar strengths for our galaxies to be smaller than those for hsbs finally we use fourier transforms of the textitbband textitiband and 36 mum images to characterise the bars as either fast or slow by measuring the corotation radius via phase profiles when using the textitb and textitiband phase crossings we find three of our galaxies have faster than expected relative bar pattern speeds for galaxies expected to be embedded in centrallydense cold dark matter haloes when using the textitbband and 36 mum phase crossings we find more ambiguous results although the relative bar pattern speeds are still faster than expected since we find a very slow bar in f563v2 we are confident that we are able to differentiate between fast and slow bars finally we find no relation between bar strength and relative bar pattern speed when comparing our lsbs to hsbs | [['in', 'this', 'paper', 'we', 'use', 'textitbband', 'textitiband', 'and', '36', 'mum', 'azimuthal', 'light', 'profiles', 'of', 'four', 'low', 'surface', 'brightness', 'lsb', 'galaxies', 'ugc', '628', 'f5681', 'f5683', 'f563v2', 'to', 'characterise', 'three', 'bar', 'parameters', 'length', 'strength', 'and', 'corotation', 'radius', 'we', 'employ', 'three', 'techniques', 'to', 'measure', 'the', 'radius', 'of', 'the', 'bars', 'including', 'a', 'new', 'method', 'using', 'the', 'azimuthal', 'light', 'profiles', 'we', 'find', 'comparable', 'bar', 'radii', 'between', 'the', 'textitiband', 'and', '36', 'mum', 'for', 'all', 'four', 'galaxies', 'when', 'using', 'our', 'azimuthal', 'light', 'profile', 'method', 'and', 'that', 'our', 'bar', 'lengths', 'are', 'comparable', 'to', 'those', 'in', 'high', 'surface', 'brightness', 'galaxies', 'hsbs', 'in', 'addition', 'we', 'find', 'the', 'bar', 'strengths', 'for', 'our', 'galaxies', 'to', 'be', 'smaller', 'than', 'those', 'for', 'hsbs', 'finally', 'we', 'use', 'fourier', 'transforms', 'of', 'the', 'textitbband', 'textitiband', 'and', '36', 'mum', 'images', 'to', 'characterise', 'the', 'bars', 'as', 'either', 'fast', 'or', 'slow', 'by', 'measuring', 'the', 'corotation', 'radius', 'via', 'phase', 'profiles', 'when', 'using', 'the', 'textitb', 'and', 'textitiband', 'phase', 'crossings', 'we', 'find', 'three', 'of', 'our', 'galaxies', 'have', 'faster', 'than', 'expected', 'relative', 'bar', 'pattern', 'speeds', 'for', 'galaxies', 'expected', 'to', 'be', 'embedded', 'in', 'centrallydense', 'cold', 'dark', 'matter', 'haloes', 'when', 'using', 'the', 'textitbband', 'and', '36', 'mum', 'phase', 'crossings', 'we', 'find', 'more', 'ambiguous', 'results', 'although', 'the', 'relative', 'bar', 'pattern', 'speeds', 'are', 'still', 'faster', 'than', 'expected', 'since', 'we', 'find', 'a', 'very', 'slow', 'bar', 'in', 'f563v2', 'we', 'are', 'confident', 'that', 'we', 'are', 'able', 'to', 'differentiate', 'between', 'fast', 'and', 'slow', 'bars', 'finally', 'we', 'find', 'no', 'relation', 'between', 'bar', 'strength', 'and', 'relative', 'bar', 'pattern', 'speed', 'when', 'comparing', 'our', 'lsbs', 'to', 'hsbs']] | [-0.06384556115661917, 0.11394069264426765, -0.09374451550816182, 0.10801614601438166, -0.037190314644617556, -0.08978905464730812, 0.01617008448187419, 0.44906165604852927, -0.1850950153120145, -0.33057913988954407, 0.04227874207925366, -0.2882702145332526, -0.0854130682785001, 0.21103304231496142, -0.019471391565893396, -0.006201067619135737, 0.012678520717139392, -0.07697138397753993, -0.09588111506112879, -0.23712658235864156, 0.2513240872615092, 0.0024447542623094115, 0.19353750027433225, -0.01710035466247156, 0.013135895614398305, -0.06952132479943933, -0.05608961207572104, -0.009720119294014912, -0.18709682333726438, 0.028737169844913788, 0.19717348817704472, 0.09301318109569921, 0.16031457272943753, -0.4142838004614985, -0.10762188178811316, 0.10007564656491458, 0.20099035841864749, 0.08202514413917115, -0.04064735557835103, -0.2529069639758093, 0.1458945613519489, -0.12987994095349864, -0.13423550525240066, -0.0009491035070286018, 0.09141618950451619, 0.01915281196419574, -0.22218700515632892, 0.1423647492880371, 0.020481587740766298, 0.11216802514287867, -0.0418082639783275, -0.13759761886869631, -0.042043117208029085, 0.05692314301698001, 0.029056751854984946, 0.10590852400433381, 0.19514931999107643, -0.13875894532106692, -0.009415289849820959, 0.37155623325315706, -0.1197355993544336, -0.09968511583818956, 0.2546668963129573, -0.19681249152798252, -0.07246022612467518, 0.13182792584863706, 0.17864480043883252, 0.08531878208191397, -0.0783376505940795, -0.04434910013828179, 0.002569018413689978, 0.23347168699339957, 0.1177804857405995, 0.053685286722366034, 0.24840561021966684, 0.07062204333929982, 0.053693990163182846, 0.09164888047483526, -0.2500426184881148, -0.038859137710682924, -0.22906975403333765, -0.12263010331588692, -0.06391726085328682, -0.008117210713336992, -0.1325839651519023, -0.062044344154748486, 0.3681839788489767, 0.11726269499646334, 0.2741321898242341, 0.10944628057301925, 0.3189158820063819, 0.054146172484689496, 0.12691049947833666, 0.16005978727406717, 0.31346619287790645, 0.14096454978195502, 0.0194355378571882, -0.2438524647567712, 0.020433525014511518, -0.02693681132818576] |
1,802.0148 | Anelasticity in Flexure Strips Revisited | This note reviews previous analyses by the author of the damping produced by
the anelasticity of a simple flexure element that is loaded in tension by an
extended object such as a beam balance. The correct calculation of the
anelasticity of a simple flexure appeared in an appendix in Quinn et al (1995)
where the change in the gravitational potential energy due to the shortening of
the flexure was calculated enabling expressions for the elastic energy and its
associated losses to be derived. Publications prior to this paper did not
include this lossless term which led to incorrect predictions of the anelastic
losses in flexure pivots in Quinn et al (1987). In this current paper the
derivation of the result is given in such a way that it can be easily
contrasted with the expressions in these earlier papers. I also extend the
methodology to calculate the elastic and gravitational energy associated with
the motion of a suspended object whose dimensions are significantly smaller
than the length of the flexure.
| physics.class-ph | this note reviews previous analyses by the author of the damping produced by the anelasticity of a simple flexure element that is loaded in tension by an extended object such as a beam balance the correct calculation of the anelasticity of a simple flexure appeared in an appendix in quinn et al 1995 where the change in the gravitational potential energy due to the shortening of the flexure was calculated enabling expressions for the elastic energy and its associated losses to be derived publications prior to this paper did not include this lossless term which led to incorrect predictions of the anelastic losses in flexure pivots in quinn et al 1987 in this current paper the derivation of the result is given in such a way that it can be easily contrasted with the expressions in these earlier papers i also extend the methodology to calculate the elastic and gravitational energy associated with the motion of a suspended object whose dimensions are significantly smaller than the length of the flexure | [['this', 'note', 'reviews', 'previous', 'analyses', 'by', 'the', 'author', 'of', 'the', 'damping', 'produced', 'by', 'the', 'anelasticity', 'of', 'a', 'simple', 'flexure', 'element', 'that', 'is', 'loaded', 'in', 'tension', 'by', 'an', 'extended', 'object', 'such', 'as', 'a', 'beam', 'balance', 'the', 'correct', 'calculation', 'of', 'the', 'anelasticity', 'of', 'a', 'simple', 'flexure', 'appeared', 'in', 'an', 'appendix', 'in', 'quinn', 'et', 'al', '1995', 'where', 'the', 'change', 'in', 'the', 'gravitational', 'potential', 'energy', 'due', 'to', 'the', 'shortening', 'of', 'the', 'flexure', 'was', 'calculated', 'enabling', 'expressions', 'for', 'the', 'elastic', 'energy', 'and', 'its', 'associated', 'losses', 'to', 'be', 'derived', 'publications', 'prior', 'to', 'this', 'paper', 'did', 'not', 'include', 'this', 'lossless', 'term', 'which', 'led', 'to', 'incorrect', 'predictions', 'of', 'the', 'anelastic', 'losses', 'in', 'flexure', 'pivots', 'in', 'quinn', 'et', 'al', '1987', 'in', 'this', 'current', 'paper', 'the', 'derivation', 'of', 'the', 'result', 'is', 'given', 'in', 'such', 'a', 'way', 'that', 'it', 'can', 'be', 'easily', 'contrasted', 'with', 'the', 'expressions', 'in', 'these', 'earlier', 'papers', 'i', 'also', 'extend', 'the', 'methodology', 'to', 'calculate', 'the', 'elastic', 'and', 'gravitational', 'energy', 'associated', 'with', 'the', 'motion', 'of', 'a', 'suspended', 'object', 'whose', 'dimensions', 'are', 'significantly', 'smaller', 'than', 'the', 'length', 'of', 'the', 'flexure']] | [-0.07983368187047103, 0.10648876332886764, -0.08276390475220978, 0.012571232042768422, -0.0823202492970535, -0.06827692912946291, 0.022443402792765375, 0.32792312122662276, -0.23474379374426516, -0.32206311780301966, 0.07300885510185788, -0.24877758558072588, -0.14899511264691898, 0.19523908247185104, -0.11895571020705735, 0.031293482779566305, 0.05208994146737763, 0.0007514813147923526, -0.036267892076798224, -0.24560533417662717, 0.27999313137877513, 0.1423330011038, 0.24821610092596316, 0.0630306501626311, 0.03740339502692223, 0.005642858666696531, -0.08815070802674574, 0.040262630893437956, -0.16505945493400384, 0.1281983927508597, 0.22206731857731937, 0.04769795755581821, 0.22820965632358017, -0.4242757159120896, -0.22159059193902922, 0.05897595228572541, 0.12159305117640863, 0.14908915230771527, -0.01737078866263961, -0.2602621737319757, 0.06685692493201179, -0.2129271908553646, -0.13534628905301146, -0.010195978243342218, 0.06756715338868911, 0.02017113758415422, -0.245999032535645, 0.0845341486580711, 0.12174780859563993, 0.02251116908977137, -0.07279485574142788, -0.116142674179419, 0.0024934006386448508, 0.07031899635022616, 0.06791246511891265, 0.05688619382186409, 0.09197254109963336, -0.10392484815024278, -0.0913927479291006, 0.3865409952314461, -0.05281836788130664, -0.19267183123704265, 0.16237143909092994, -0.09429319652126116, -0.0796541421838543, 0.1425621602081639, 0.14598762728410827, 0.0847859989386052, -0.1557318670072538, 0.06207213544711361, -0.031978896447895644, 0.12743970529203685, 0.129377935002284, -0.0352847201475764, 0.1698802426786107, 0.10369362738257383, -0.009271769274902694, 0.12452289309962104, -0.05802775367217906, -0.03194226452820551, -0.32264175147283825, -0.16697213226203422, -0.15831940989831791, 0.02385103336530258, -0.025303172047407476, -0.1587163185591207, 0.38552063887610155, 0.1504868666340104, 0.20264977356448927, 0.017999705623643582, 0.291531331193469, 0.1301950777928783, 0.06797973297892466, 0.06952339486794218, 0.31159419608507855, 0.09889023695894353, 0.11912264540681944, -0.20852223699364592, 0.06715009302613051, 0.05817179324598435] |
1,802.01481 | An efficient counting method for the colored triad census | The triad census is an important approach to understand local structure in
network science, providing comprehensive assessments of the observed relational
configurations between triples of actors in a network. However, researchers are
often interested in combinations of relational and categorical nodal
attributes. In this case, it is desirable to account for the label, or color,
of the nodes in the triad census. In this paper, we describe an efficient
algorithm for constructing the colored triad census, based, in part, on
existing methods for the classic triad census. We evaluate the performance of
the algorithm using empirical and simulated data for both undirected and
directed graphs. The results of the simulation demonstrate that the proposed
algorithm reduces computational time many-fold over the naive approach. We also
apply the colored triad census to the Zachary karate club network dataset. We
simultaneously show the efficiency of the algorithm, and a way to conduct a
statistical test on the census by forming a null distribution from 1,000
realizations of a mixing-matrix conditioned graph and comparing the observed
colored triad counts to the expected. From this, we demonstrate the method's
utility in our discussion of results about homophily, heterophily, and
bridging, simultaneously gained via the colored triad census. In sum, the
proposed algorithm for the colored triad census brings novel utility to social
network analysis in an efficient package.
| cs.DS cs.SI | the triad census is an important approach to understand local structure in network science providing comprehensive assessments of the observed relational configurations between triples of actors in a network however researchers are often interested in combinations of relational and categorical nodal attributes in this case it is desirable to account for the label or color of the nodes in the triad census in this paper we describe an efficient algorithm for constructing the colored triad census based in part on existing methods for the classic triad census we evaluate the performance of the algorithm using empirical and simulated data for both undirected and directed graphs the results of the simulation demonstrate that the proposed algorithm reduces computational time manyfold over the naive approach we also apply the colored triad census to the zachary karate club network dataset we simultaneously show the efficiency of the algorithm and a way to conduct a statistical test on the census by forming a null distribution from 1000 realizations of a mixingmatrix conditioned graph and comparing the observed colored triad counts to the expected from this we demonstrate the methods utility in our discussion of results about homophily heterophily and bridging simultaneously gained via the colored triad census in sum the proposed algorithm for the colored triad census brings novel utility to social network analysis in an efficient package | [['the', 'triad', 'census', 'is', 'an', 'important', 'approach', 'to', 'understand', 'local', 'structure', 'in', 'network', 'science', 'providing', 'comprehensive', 'assessments', 'of', 'the', 'observed', 'relational', 'configurations', 'between', 'triples', 'of', 'actors', 'in', 'a', 'network', 'however', 'researchers', 'are', 'often', 'interested', 'in', 'combinations', 'of', 'relational', 'and', 'categorical', 'nodal', 'attributes', 'in', 'this', 'case', 'it', 'is', 'desirable', 'to', 'account', 'for', 'the', 'label', 'or', 'color', 'of', 'the', 'nodes', 'in', 'the', 'triad', 'census', 'in', 'this', 'paper', 'we', 'describe', 'an', 'efficient', 'algorithm', 'for', 'constructing', 'the', 'colored', 'triad', 'census', 'based', 'in', 'part', 'on', 'existing', 'methods', 'for', 'the', 'classic', 'triad', 'census', 'we', 'evaluate', 'the', 'performance', 'of', 'the', 'algorithm', 'using', 'empirical', 'and', 'simulated', 'data', 'for', 'both', 'undirected', 'and', 'directed', 'graphs', 'the', 'results', 'of', 'the', 'simulation', 'demonstrate', 'that', 'the', 'proposed', 'algorithm', 'reduces', 'computational', 'time', 'manyfold', 'over', 'the', 'naive', 'approach', 'we', 'also', 'apply', 'the', 'colored', 'triad', 'census', 'to', 'the', 'zachary', 'karate', 'club', 'network', 'dataset', 'we', 'simultaneously', 'show', 'the', 'efficiency', 'of', 'the', 'algorithm', 'and', 'a', 'way', 'to', 'conduct', 'a', 'statistical', 'test', 'on', 'the', 'census', 'by', 'forming', 'a', 'null', 'distribution', 'from', '1000', 'realizations', 'of', 'a', 'mixingmatrix', 'conditioned', 'graph', 'and', 'comparing', 'the', 'observed', 'colored', 'triad', 'counts', 'to', 'the', 'expected', 'from', 'this', 'we', 'demonstrate', 'the', 'methods', 'utility', 'in', 'our', 'discussion', 'of', 'results', 'about', 'homophily', 'heterophily', 'and', 'bridging', 'simultaneously', 'gained', 'via', 'the', 'colored', 'triad', 'census', 'in', 'sum', 'the', 'proposed', 'algorithm', 'for', 'the', 'colored', 'triad', 'census', 'brings', 'novel', 'utility', 'to', 'social', 'network', 'analysis', 'in', 'an', 'efficient', 'package']] | [-0.0775385422540629, 0.0030768128081685325, -0.06897752257334235, 0.08461355032289118, -0.10573658912159901, -0.06376281629491132, 0.08357053222789546, 0.40221273136817864, -0.23755398525099736, -0.37152122946489335, 0.018314172128157225, -0.29282286424618825, -0.19305511412884307, 0.16984695811385922, -0.07059626959796463, 0.010374667754928981, 0.11972421660487141, 0.05821180064023273, 0.0256569877144232, -0.2633354524707881, 0.30717875042630893, 0.08051063820935919, 0.28208498484413475, 0.024338599107328003, 0.0935775532379921, 0.0021045769099146128, -0.12149674632070985, 0.04684473766870464, -0.11530949892679539, 0.15260902458664663, 0.25367718989790383, 0.21078156099455164, 0.2900471244034374, -0.400686986889923, -0.16919572264721086, 0.11169541549108024, 0.13072093917747094, 0.08061786506316691, -0.015074774939941043, -0.30764956795922316, 0.08948283929359084, -0.16903358177764208, -0.0697840617233721, -0.10489750531685006, -0.021907230200927837, 0.001556945791630174, -0.25910367091507525, 0.04463866763074163, 0.06421012530336156, 0.07574165541778452, -0.025236168923064333, -0.11816721084090075, -0.017593877443037594, 0.14852909817065146, 0.001436742275213224, 0.007331759305088781, 0.08120862706294117, -0.14598650105546898, -0.18476803014345933, 0.36457401841263554, -0.03403598038961978, -0.1738086645920183, 0.1601240777662107, -0.10267994027734469, -0.19565353592458581, 0.08311816098077023, 0.21180847898150595, 0.10619645192179762, -0.1681924255371996, 0.0285432366753022, -0.07304975133800846, 0.11918801425677625, 0.03667314151555599, -0.004547190045871373, 0.193422083891554, 0.20993645056816085, 0.07805184913221248, 0.16445703327459732, -0.09467332437322641, -0.13865076210017183, -0.24144893587383973, -0.1449660190202329, -0.18139200135919964, 0.0060766915687833845, -0.12423638604442593, -0.16826819288170164, 0.41459932017616147, 0.19111663240437338, 0.19085021932135401, 0.09075940953542679, 0.3317445129245503, 0.02407067918569997, 0.05745602592235498, 0.10305559806667068, 0.1409311775023525, 0.10665359487029491, 0.08848707223816225, -0.1893449014439414, 0.06624873265848562, 0.03515828162198886] |
1,802.01482 | The Sea Exploration Problem: Data-driven Orienteering on a Continuous
Surface | This paper describes a problem arising in sea exploration, where the aim is
to schedule the expedition of a ship for collecting information about the
resources on the seafloor. The aim is to collect data by probing on a set of
carefully chosen locations, so that the information available is optimally
enriched. This problem has similarities with the orienteering problem, where
the aim is to plan a time-limited trip for visiting a set of vertices,
collecting a prize at each of them, in such a way that the total value
collected is maximum. In our problem, the score at each vertex is associated
with an estimation of the level of the resource on the given surface, which is
done by regression using Gaussian processes. Hence, there is a correlation
among scores on the selected vertices; this is a first difference with respect
to the standard orienteering problem. The second difference is the location of
each vertex, which in our problem is a freely chosen point on a given surface.
| cs.AI | this paper describes a problem arising in sea exploration where the aim is to schedule the expedition of a ship for collecting information about the resources on the seafloor the aim is to collect data by probing on a set of carefully chosen locations so that the information available is optimally enriched this problem has similarities with the orienteering problem where the aim is to plan a timelimited trip for visiting a set of vertices collecting a prize at each of them in such a way that the total value collected is maximum in our problem the score at each vertex is associated with an estimation of the level of the resource on the given surface which is done by regression using gaussian processes hence there is a correlation among scores on the selected vertices this is a first difference with respect to the standard orienteering problem the second difference is the location of each vertex which in our problem is a freely chosen point on a given surface | [['this', 'paper', 'describes', 'a', 'problem', 'arising', 'in', 'sea', 'exploration', 'where', 'the', 'aim', 'is', 'to', 'schedule', 'the', 'expedition', 'of', 'a', 'ship', 'for', 'collecting', 'information', 'about', 'the', 'resources', 'on', 'the', 'seafloor', 'the', 'aim', 'is', 'to', 'collect', 'data', 'by', 'probing', 'on', 'a', 'set', 'of', 'carefully', 'chosen', 'locations', 'so', 'that', 'the', 'information', 'available', 'is', 'optimally', 'enriched', 'this', 'problem', 'has', 'similarities', 'with', 'the', 'orienteering', 'problem', 'where', 'the', 'aim', 'is', 'to', 'plan', 'a', 'timelimited', 'trip', 'for', 'visiting', 'a', 'set', 'of', 'vertices', 'collecting', 'a', 'prize', 'at', 'each', 'of', 'them', 'in', 'such', 'a', 'way', 'that', 'the', 'total', 'value', 'collected', 'is', 'maximum', 'in', 'our', 'problem', 'the', 'score', 'at', 'each', 'vertex', 'is', 'associated', 'with', 'an', 'estimation', 'of', 'the', 'level', 'of', 'the', 'resource', 'on', 'the', 'given', 'surface', 'which', 'is', 'done', 'by', 'regression', 'using', 'gaussian', 'processes', 'hence', 'there', 'is', 'a', 'correlation', 'among', 'scores', 'on', 'the', 'selected', 'vertices', 'this', 'is', 'a', 'first', 'difference', 'with', 'respect', 'to', 'the', 'standard', 'orienteering', 'problem', 'the', 'second', 'difference', 'is', 'the', 'location', 'of', 'each', 'vertex', 'which', 'in', 'our', 'problem', 'is', 'a', 'freely', 'chosen', 'point', 'on', 'a', 'given', 'surface']] | [-0.09399090605765889, 0.0686540588738773, -0.079464450114842, 0.03021002184536264, -0.08998497611341569, -0.095309704478786, 0.09945370388126343, 0.36019699128355676, -0.2909466158047583, -0.31392609168115465, 0.12140622530297855, -0.3484135465971993, -0.10148301040450629, 0.14755531035077113, -0.09448820619551829, 0.029718033535428037, 0.08269330191828267, 0.11572445678929716, -0.019399969481284276, -0.2682203106449906, 0.3375159916219979, 0.06347439084312267, 0.25426431394804866, 0.02758728256504211, 0.1453566414134621, 0.010232876939423515, -0.038232580525800586, 0.03018318091315278, -0.09806030640730251, 0.15056629937290925, 0.2752305115476669, 0.17469683179036666, 0.3500893348898996, -0.3606276599106175, -0.16902440657822645, 0.12217023529487073, 0.0622818078094895, 0.07802910954944965, -0.02682689296566611, -0.255347144630181, 0.0844825439943144, -0.10283298868294695, -0.08684689114586665, 0.05832407988894444, 0.038207537709520414, -0.014303916563781409, -0.28931870859821696, -0.013130108208654548, -0.009051124196080767, 0.033460750867276505, -0.017397560297715418, -0.10667756080252708, -0.014342806946772795, 0.17525440517857055, 0.017427858255924824, 0.08846414351671213, 0.08071739024023894, -0.12764118172051991, -0.10273196409868363, 0.41628476836272243, -0.02280213107966636, -0.22200912886888846, 0.14720179922961404, -0.10495868796508859, -0.1184844162959892, 0.11621952275387369, 0.19375400352925504, 0.12069175190143508, -0.20394736914702596, 0.057365823741010305, -0.08269298552761417, 0.16396302051002506, 0.04935181215570788, -0.03910812757600694, 0.21192071998778444, 0.22949898162217447, 0.14112948396480118, 0.14469851486484062, -0.088477350344858, -0.05004306788385444, -0.31133170020849216, -0.12380336673059583, -0.23570988913474483, -0.005595308422667564, -0.045679675900107304, -0.14166816331710688, 0.4206116856571794, 0.15004813389510974, 0.22162328451491628, 0.052996137233164445, 0.2963611195800749, 0.10791640949022913, 0.0556795721678697, 0.10277400508291534, 0.16541406313045579, 0.036368532979739666, 0.07918802421187332, -0.21862430870412441, 0.11323334294861767, 0.057072389168945865] |
1,802.01483 | Explicit Inductive Bias for Transfer Learning with Convolutional
Networks | In inductive transfer learning, fine-tuning pre-trained convolutional
networks substantially outperforms training from scratch. When using
fine-tuning, the underlying assumption is that the pre-trained model extracts
generic features, which are at least partially relevant for solving the target
task, but would be difficult to extract from the limited amount of data
available on the target task. However, besides the initialization with the
pre-trained model and the early stopping, there is no mechanism in fine-tuning
for retaining the features learned on the source task. In this paper, we
investigate several regularization schemes that explicitly promote the
similarity of the final solution with the initial model. We show the benefit of
having an explicit inductive bias towards the initial model, and we eventually
recommend a simple $L^2$ penalty with the pre-trained model being a reference
as the baseline of penalty for transfer learning tasks.
| cs.LG | in inductive transfer learning finetuning pretrained convolutional networks substantially outperforms training from scratch when using finetuning the underlying assumption is that the pretrained model extracts generic features which are at least partially relevant for solving the target task but would be difficult to extract from the limited amount of data available on the target task however besides the initialization with the pretrained model and the early stopping there is no mechanism in finetuning for retaining the features learned on the source task in this paper we investigate several regularization schemes that explicitly promote the similarity of the final solution with the initial model we show the benefit of having an explicit inductive bias towards the initial model and we eventually recommend a simple l2 penalty with the pretrained model being a reference as the baseline of penalty for transfer learning tasks | [['in', 'inductive', 'transfer', 'learning', 'finetuning', 'pretrained', 'convolutional', 'networks', 'substantially', 'outperforms', 'training', 'from', 'scratch', 'when', 'using', 'finetuning', 'the', 'underlying', 'assumption', 'is', 'that', 'the', 'pretrained', 'model', 'extracts', 'generic', 'features', 'which', 'are', 'at', 'least', 'partially', 'relevant', 'for', 'solving', 'the', 'target', 'task', 'but', 'would', 'be', 'difficult', 'to', 'extract', 'from', 'the', 'limited', 'amount', 'of', 'data', 'available', 'on', 'the', 'target', 'task', 'however', 'besides', 'the', 'initialization', 'with', 'the', 'pretrained', 'model', 'and', 'the', 'early', 'stopping', 'there', 'is', 'no', 'mechanism', 'in', 'finetuning', 'for', 'retaining', 'the', 'features', 'learned', 'on', 'the', 'source', 'task', 'in', 'this', 'paper', 'we', 'investigate', 'several', 'regularization', 'schemes', 'that', 'explicitly', 'promote', 'the', 'similarity', 'of', 'the', 'final', 'solution', 'with', 'the', 'initial', 'model', 'we', 'show', 'the', 'benefit', 'of', 'having', 'an', 'explicit', 'inductive', 'bias', 'towards', 'the', 'initial', 'model', 'and', 'we', 'eventually', 'recommend', 'a', 'simple', 'l2', 'penalty', 'with', 'the', 'pretrained', 'model', 'being', 'a', 'reference', 'as', 'the', 'baseline', 'of', 'penalty', 'for', 'transfer', 'learning', 'tasks']] | [-0.014749357016123038, 0.029655197649432103, -0.06761376501939503, 0.0684775940401823, -0.1286100412104675, -0.21934263730514134, 0.03428945197733713, 0.4488103738886879, -0.3131510669510838, -0.3423516221867927, 0.10185754595486222, -0.2648135685421368, -0.12144204484404507, 0.15551636124472298, -0.0859926872294346, 0.05980958646586072, 0.17747389828350316, 0.0799243955192625, -0.08786847143506644, -0.26407307375830114, 0.36242478600940964, 0.0787031705316209, 0.3126468898609598, 0.02895257199275578, 0.1500500855077362, -0.0481011955164941, -0.016456164979022525, -0.05436418745798845, -0.04570473996802243, 0.15076036637331894, 0.27787744087713656, 0.1913360598569749, 0.3148938764666095, -0.39207098592099143, -0.24106911688065485, 0.11070785587587466, 0.1117313615548431, 0.17103140264112132, -0.039696977248395535, -0.28087574341301375, 0.09297845070745717, -0.16999130860195621, 0.000501176322552752, -0.1209922748360228, -0.04119443457824647, -0.04811088754778979, -0.32363099467623585, 0.04915052930021936, 0.0961418571677191, 0.045452199615406016, -0.09194440775425404, -0.1380013261148904, -0.02160458248570984, 0.15710558868380733, 0.059095182901096416, 0.05079254366668826, 0.1252432754065128, -0.23132612883007642, -0.06985903265167702, 0.3468067149849648, -0.06877985068577085, -0.23834294582063215, 0.17988615126368848, -0.014814848427046487, -0.13286999838116267, 0.08581018003846473, 0.18345977577458447, 0.1239827503656625, -0.14949706470784122, 0.030691244004538668, -0.022636843280510067, 0.20365436922458285, 0.04430663521923389, -0.02294058077522811, 0.16385026155568078, 0.2546162635652705, 0.031116301913791937, 0.14696554642035262, -0.11439468078843668, -0.06953452692651158, -0.2904305902329531, -0.05309560738754927, -0.21534293368194543, 0.013677298335741597, -0.11521332738702252, -0.1216922750273812, 0.3911961773162747, 0.23961236258532773, 0.23231150841353632, 0.1133858416508553, 0.3267906458704924, 0.046191429573190494, 0.13868489232680475, 0.10336407221538338, 0.22539795164335916, -0.03409338805779934, 0.11297699044861481, -0.20430774684559475, 0.12440885105401489, 0.06942226517787005] |
1,802.01484 | Discrete superconducting phases in FeSe-derived superconductors | A general feature of unconventional superconductors is the existence of a
superconducting dome in the phase diagram as a function of carrier
concentration. For the simplest iron-based superconductor FeSe (with transition
temperature Tc ~ 8 K), its Tc can be greatly enhanced by doping electrons via
many routes, even up to 65 K in monolayer FeSe/SiTiO3. However, a clear phase
diagram with carrier concentration for FeSe-derived superconductors is still
lacking. Here, we report the observation of a series of discrete
superconducting phases in FeSe thin flakes by continuously tuning carrier
concentration through the intercalation of Li and Na ions with a solid ionic
gating technique. Such discrete superconducting phases are robust against the
substitution of Se by 20% S, but are vulnerable to the substitution of Fe by 2%
Cu, highlighting the importance of the iron site being intact. A complete
superconducting phase diagram for FeSe-derivatives is given, which is distinct
from other unconventional superconductors.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | a general feature of unconventional superconductors is the existence of a superconducting dome in the phase diagram as a function of carrier concentration for the simplest ironbased superconductor fese with transition temperature tc 8 k its tc can be greatly enhanced by doping electrons via many routes even up to 65 k in monolayer fesesitio3 however a clear phase diagram with carrier concentration for fesederived superconductors is still lacking here we report the observation of a series of discrete superconducting phases in fese thin flakes by continuously tuning carrier concentration through the intercalation of li and na ions with a solid ionic gating technique such discrete superconducting phases are robust against the substitution of se by 20 s but are vulnerable to the substitution of fe by 2 cu highlighting the importance of the iron site being intact a complete superconducting phase diagram for fesederivatives is given which is distinct from other unconventional superconductors | [['a', 'general', 'feature', 'of', 'unconventional', 'superconductors', 'is', 'the', 'existence', 'of', 'a', 'superconducting', 'dome', 'in', 'the', 'phase', 'diagram', 'as', 'a', 'function', 'of', 'carrier', 'concentration', 'for', 'the', 'simplest', 'ironbased', 'superconductor', 'fese', 'with', 'transition', 'temperature', 'tc', '8', 'k', 'its', 'tc', 'can', 'be', 'greatly', 'enhanced', 'by', 'doping', 'electrons', 'via', 'many', 'routes', 'even', 'up', 'to', '65', 'k', 'in', 'monolayer', 'fesesitio3', 'however', 'a', 'clear', 'phase', 'diagram', 'with', 'carrier', 'concentration', 'for', 'fesederived', 'superconductors', 'is', 'still', 'lacking', 'here', 'we', 'report', 'the', 'observation', 'of', 'a', 'series', 'of', 'discrete', 'superconducting', 'phases', 'in', 'fese', 'thin', 'flakes', 'by', 'continuously', 'tuning', 'carrier', 'concentration', 'through', 'the', 'intercalation', 'of', 'li', 'and', 'na', 'ions', 'with', 'a', 'solid', 'ionic', 'gating', 'technique', 'such', 'discrete', 'superconducting', 'phases', 'are', 'robust', 'against', 'the', 'substitution', 'of', 'se', 'by', '20', 's', 'but', 'are', 'vulnerable', 'to', 'the', 'substitution', 'of', 'fe', 'by', '2', 'cu', 'highlighting', 'the', 'importance', 'of', 'the', 'iron', 'site', 'being', 'intact', 'a', 'complete', 'superconducting', 'phase', 'diagram', 'for', 'fesederivatives', 'is', 'given', 'which', 'is', 'distinct', 'from', 'other', 'unconventional', 'superconductors']] | [-0.16923918331648516, 0.2590253079757339, 0.010135593741372424, -0.018337624104644516, -0.025701599967616954, -0.22454830092426978, 0.2166071276327497, 0.3921667620643826, -0.23316426508532268, -0.2838871293995333, -0.0013762457674602047, -0.34324409231837644, -0.09678556729647282, 0.15829412925430866, 0.01880172165845962, 0.0023529232861811147, -0.09234517345229458, -0.057464605425545746, -0.16685687436409735, -0.2568503058711557, 0.28926314497259326, 0.010940690478922701, 0.32652834171619216, 0.07186932838521898, -0.006830372504497829, -0.056303287949719415, 0.1406316420267869, 0.03048481443271923, -0.12692406256457234, 0.03948287215691954, 0.32759488696587813, -0.07586653464501356, 0.18558956204766505, -0.40761629338866395, -0.27048610511203725, -0.0030549116429603217, 0.14014970415614939, 0.14642266604029205, -0.11916903112892453, -0.25885363018575225, 0.07998898358231313, -0.12378526212475997, -0.10511799591691479, -0.07114017729671966, -0.004201602515470432, 0.007687615968231847, -0.2120056068666408, 0.08927045077526648, 0.07244516868683461, 0.14299177511987327, -0.06555649917802504, -0.1449454572552656, -0.08993807104783819, -0.007888188383443967, 0.023251584145902216, 0.08045971421387021, 0.16734200424980372, -0.08875600117454796, -0.051859425766834694, 0.33998515803097307, -0.01684810984021935, -0.014052414068780644, 0.16214672880136946, -0.1438450698442466, -0.07083247832978438, 0.22617223396235586, 0.027397402035268515, 0.0782061260175205, -0.15559552995469667, 0.0862919489610297, -0.011918342500728997, 0.22038222203187424, 0.035999149990905276, 0.09213732078090911, 0.2527798049053864, 0.24665483667960966, 0.050121943940834364, 0.12349247173245347, -0.11348398068864633, 0.006862563123975538, -0.19222615854079395, -0.2447144127084022, -0.2045285801470623, 0.029028893718005794, -0.09384302907509616, -0.21150744026281723, 0.3987627841630264, 0.13285875828832536, 0.20415901139035428, -0.13219077621301709, 0.19742379082967282, 0.06830594788908984, 0.05714983935774255, 0.004515873386959643, 0.19948459938045984, 0.16475787279839432, 0.13778957126726854, -0.2789006101436251, 0.15708457304801987, 0.05113309416705497] |
1,802.01485 | High permittivity processed SrTiO3 for metamaterials applications at terahertz frequencies | High permittivity SrTiO3 for the realization of all-dielectric metamaterials operating at terahertz frequencies was fabricated. A comparison of different processing routes evidences that Spark Plasma Sintering is the most effective sintering process to yield high density ceramic with high permittivity. We compare this sintering process with two others. The elaborated samples are characterized in the low frequency and in the terahertz frequency ranges. Their relative permittivities are compared with that a reference \sto single crystal. The permittivity of the sample elaborated by Spark Plasma Sintering is as high as that the single crystal. | physics.app-ph physics.chem-ph | high permittivity srtio3 for the realization of alldielectric metamaterials operating at terahertz frequencies was fabricated a comparison of different processing routes evidences that spark plasma sintering is the most effective sintering process to yield high density ceramic with high permittivity we compare this sintering process with two others the elaborated samples are characterized in the low frequency and in the terahertz frequency ranges their relative permittivities are compared with that a reference sto single crystal the permittivity of the sample elaborated by spark plasma sintering is as high as that the single crystal | [['high', 'permittivity', 'srtio3', 'for', 'the', 'realization', 'of', 'alldielectric', 'metamaterials', 'operating', 'at', 'terahertz', 'frequencies', 'was', 'fabricated', 'a', 'comparison', 'of', 'different', 'processing', 'routes', 'evidences', 'that', 'spark', 'plasma', 'sintering', 'is', 'the', 'most', 'effective', 'sintering', 'process', 'to', 'yield', 'high', 'density', 'ceramic', 'with', 'high', 'permittivity', 'we', 'compare', 'this', 'sintering', 'process', 'with', 'two', 'others', 'the', 'elaborated', 'samples', 'are', 'characterized', 'in', 'the', 'low', 'frequency', 'and', 'in', 'the', 'terahertz', 'frequency', 'ranges', 'their', 'relative', 'permittivities', 'are', 'compared', 'with', 'that', 'a', 'reference', 'sto', 'single', 'crystal', 'the', 'permittivity', 'of', 'the', 'sample', 'elaborated', 'by', 'spark', 'plasma', 'sintering', 'is', 'as', 'high', 'as', 'that', 'the', 'single', 'crystal']] | [-0.08223489135684024, 0.2546126043864636, -0.0635312115473132, -0.094469499315931, -0.06432708783165342, -0.1608832292559166, 0.0380736291283361, 0.536306881455965, -0.19655637236397153, -0.3124371784268528, 0.06015389083924713, -0.2903280748675267, -0.047069338631005056, 0.21894028081348346, -0.005717059357031699, 0.08467598647625256, -0.03402604809611715, -0.09928923643003869, -0.04534512315876782, -0.1518887398033453, 0.21767900042956875, 0.12424340061996739, 0.40879579268956695, 0.027908425690839067, 0.06929509648652647, -0.07023578329119451, 0.08382097277690166, 0.00592858933152691, -0.09713330271524585, 0.054240720165062255, 0.32297780362748973, -0.03379947544446075, 0.22956783040076173, -0.4115837563366112, -0.258419956691483, -0.030896138950621568, 0.07182217770386287, 0.06234423473717705, -0.14473666093482446, -0.19466794731836484, 0.09849208558443934, -0.11201896703731949, -0.09430750290692974, -0.05258173031872639, -0.034225917150897366, 0.028380012690460168, -0.24651637231750834, 0.028218862126513776, 0.00022651457206799238, 0.09133603140431386, -0.11379032737014674, -0.16591787270160133, -0.0380578583396811, 0.020998826200362815, 0.006773234369428528, -0.005440637834810762, 0.2683944529753619, -0.10403881943784654, -0.09266642617282048, 0.38645616552281764, -0.05041130100907658, -0.0965355658723462, 0.2383696001063111, -0.20823183065650844, -0.019307691000542172, 0.2006397559007089, 0.15673745305262385, 0.09857623816858377, -0.1714110106945799, 0.031127777693840744, 0.05475396682478247, 0.18884940446424547, 0.20805717333750698, 0.05057642602371753, 0.18652957685852564, 0.2607151253389255, -0.05428394681263354, 0.18860995805551928, -0.046627723887282355, 0.06274689412024874, -0.2213798739574349, -0.1778752868068755, -0.2343578745751211, -0.005930001504458888, -0.18103562292416944, -0.21431821219683175, 0.35328870183557914, 0.1378803446949009, 0.16788403637787347, -0.0286627222905286, 0.30091683001768205, 0.12460864547349673, 0.09308539407818468, 0.016800058034238636, 0.25086946224653595, 0.147696107408152, 0.18632572754136018, -0.23375457518243342, 0.06104883895460917, -0.07380690178533475] |
1,802.01486 | Search for single production of vector-like quarks decaying to a b quark
and a Higgs boson | A search is presented for single production of heavy vector-like quarks (B)
that decay to a Higgs boson and a b quark, with the Higgs boson decaying to a
highly boosted $\mathrm{b\overline{b}}$ pair reconstructed as a single
collimated jet. The analysis is based on data collected by the CMS experiment
in proton-proton collisions at $\sqrt{s} =$ 13 TeV, corresponding to an
integrated luminosity of 35.9 fb$^{-1}$. The data are consistent with
background expectations, and upper limits at 95% confidence level on the
product of the B quark cross section and the branching fraction are obtained in
the range 1.28-0.07 pb, for a narrow B quark with a mass between 700 and 1800
GeV. The production of B quarks with widths of 10, 20 and 30% of the resonance
mass is also considered, and the sensitivities obtained are similar to those
achieved in the narrow width case. This is the first search at the CERN LHC for
the single production of a B quark through its fully hadronic decay channel,
and the first study considering finite resonance widths of the B quark.
| hep-ex | a search is presented for single production of heavy vectorlike quarks b that decay to a higgs boson and a b quark with the higgs boson decaying to a highly boosted mathrmboverlineb pair reconstructed as a single collimated jet the analysis is based on data collected by the cms experiment in protonproton collisions at sqrts 13 tev corresponding to an integrated luminosity of 359 fb1 the data are consistent with background expectations and upper limits at 95 confidence level on the product of the b quark cross section and the branching fraction are obtained in the range 128007 pb for a narrow b quark with a mass between 700 and 1800 gev the production of b quarks with widths of 10 20 and 30 of the resonance mass is also considered and the sensitivities obtained are similar to those achieved in the narrow width case this is the first search at the cern lhc for the single production of a b quark through its fully hadronic decay channel and the first study considering finite resonance widths of the b quark | [['a', 'search', 'is', 'presented', 'for', 'single', 'production', 'of', 'heavy', 'vectorlike', 'quarks', 'b', 'that', 'decay', 'to', 'a', 'higgs', 'boson', 'and', 'a', 'b', 'quark', 'with', 'the', 'higgs', 'boson', 'decaying', 'to', 'a', 'highly', 'boosted', 'mathrmboverlineb', 'pair', 'reconstructed', 'as', 'a', 'single', 'collimated', 'jet', 'the', 'analysis', 'is', 'based', 'on', 'data', 'collected', 'by', 'the', 'cms', 'experiment', 'in', 'protonproton', 'collisions', 'at', 'sqrts', '13', 'tev', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'the', 'data', 'are', 'consistent', 'with', 'background', 'expectations', 'and', 'upper', 'limits', 'at', '95', 'confidence', 'level', 'on', 'the', 'product', 'of', 'the', 'b', 'quark', 'cross', 'section', 'and', 'the', 'branching', 'fraction', 'are', 'obtained', 'in', 'the', 'range', '128007', 'pb', 'for', 'a', 'narrow', 'b', 'quark', 'with', 'a', 'mass', 'between', '700', 'and', '1800', 'gev', 'the', 'production', 'of', 'b', 'quarks', 'with', 'widths', 'of', '10', '20', 'and', '30', 'of', 'the', 'resonance', 'mass', 'is', 'also', 'considered', 'and', 'the', 'sensitivities', 'obtained', 'are', 'similar', 'to', 'those', 'achieved', 'in', 'the', 'narrow', 'width', 'case', 'this', 'is', 'the', 'first', 'search', 'at', 'the', 'cern', 'lhc', 'for', 'the', 'single', 'production', 'of', 'a', 'b', 'quark', 'through', 'its', 'fully', 'hadronic', 'decay', 'channel', 'and', 'the', 'first', 'study', 'considering', 'finite', 'resonance', 'widths', 'of', 'the', 'b', 'quark']] | [-0.04131868780055994, 0.24241838599797455, -0.041696271039649596, 0.10343463991979376, -0.03221045751332737, -0.13056600654195974, 0.0725055918222366, 0.34365679878304456, -0.18453903165099592, -0.3223244078436544, 0.013146029960223625, -0.33939512498031615, 0.14168644615308532, 0.15504934791964609, 0.10627258491998944, 0.105745129848833, 0.14829746356712623, 0.04601723220207151, -0.04241266352509528, -0.22644981675307843, 0.26854195150770455, 0.048890200797364364, 0.21069575659540488, 0.12343836016952991, 0.049646142928720605, 0.014258068221407896, -0.04373022624682999, -0.09225094340242154, -0.08887261552522356, 0.09431253599575928, 0.17258386654934102, 0.0716304160152463, 0.1388381673127163, -0.27167568192947344, -0.045667171683786804, 0.10656292404584046, 0.1487522784063811, 0.024118974010132296, -0.07222859317556482, -0.3544165322897883, 0.1767828029244826, -0.22848116118440082, -0.08828568019690877, 0.03782307272959064, 0.030687113833618898, -0.07193512079441222, -0.3598817784704044, 0.08803684175695428, -0.07346677400468322, 0.06764937891978016, -0.002688915734751639, -0.2051365205851597, -0.10762281399272257, -0.03941712612494327, 0.07892042623609097, 0.0825654685969774, 0.18856446505342117, -0.16977418633956282, -0.18401367051524303, 0.369005765661847, -0.11055564092128803, -0.1421611895888794, 0.21136931295268624, -0.2142518154532758, -0.09205050519199304, 0.19337900392398988, 0.2728315511596124, 0.07421049762480793, -0.23157241654467858, 0.09531962416068437, -0.03938474774090105, 0.17823548057485974, 0.07768417011644671, 0.04078717975924052, 0.2302952423501843, 0.24212530614319128, -0.032646691260141365, 0.06711138980515176, -0.16376256651645682, -0.049858643447033356, -0.4423529130137427, -0.11248672354898764, -0.058002753224869016, 0.04728954852371367, -0.052932685187204176, -0.07999355337054433, 0.374818306228968, 0.06275464318089145, 0.3428338483631528, 0.01617810756420748, 0.27489318606552965, 0.13039740130914032, 0.068809556976083, 0.0761843683801633, 0.3435300001172172, 0.19251320108006495, 0.17702834287530864, -0.19231769879473445, -0.017241313668519425, 0.02249596028474248] |
1,802.01487 | Plasticity models of material variability based on uncertainty
quantification techniques | The advent of fabrication techniques like additive manufacturing has focused
attention on the considerable variability of material response due to defects
and other micro-structural aspects. This variability motivates the development
of an enhanced design methodology that incorporates inherent material
variability to provide robust predictions of performance. In this work, we
develop plasticity models capable of representing the distribution of
mechanical responses observed in experiments using traditional plasticity
models of the mean response and recently developed uncertainty quantification
(UQ) techniques. We demonstrate that the new method provides predictive
realizations that are superior to more traditional ones, and how these UQ
techniques can be used in model selection and assessing the quality of
calibrated physical parameters.
| physics.app-ph | the advent of fabrication techniques like additive manufacturing has focused attention on the considerable variability of material response due to defects and other microstructural aspects this variability motivates the development of an enhanced design methodology that incorporates inherent material variability to provide robust predictions of performance in this work we develop plasticity models capable of representing the distribution of mechanical responses observed in experiments using traditional plasticity models of the mean response and recently developed uncertainty quantification uq techniques we demonstrate that the new method provides predictive realizations that are superior to more traditional ones and how these uq techniques can be used in model selection and assessing the quality of calibrated physical parameters | [['the', 'advent', 'of', 'fabrication', 'techniques', 'like', 'additive', 'manufacturing', 'has', 'focused', 'attention', 'on', 'the', 'considerable', 'variability', 'of', 'material', 'response', 'due', 'to', 'defects', 'and', 'other', 'microstructural', 'aspects', 'this', 'variability', 'motivates', 'the', 'development', 'of', 'an', 'enhanced', 'design', 'methodology', 'that', 'incorporates', 'inherent', 'material', 'variability', 'to', 'provide', 'robust', 'predictions', 'of', 'performance', 'in', 'this', 'work', 'we', 'develop', 'plasticity', 'models', 'capable', 'of', 'representing', 'the', 'distribution', 'of', 'mechanical', 'responses', 'observed', 'in', 'experiments', 'using', 'traditional', 'plasticity', 'models', 'of', 'the', 'mean', 'response', 'and', 'recently', 'developed', 'uncertainty', 'quantification', 'uq', 'techniques', 'we', 'demonstrate', 'that', 'the', 'new', 'method', 'provides', 'predictive', 'realizations', 'that', 'are', 'superior', 'to', 'more', 'traditional', 'ones', 'and', 'how', 'these', 'uq', 'techniques', 'can', 'be', 'used', 'in', 'model', 'selection', 'and', 'assessing', 'the', 'quality', 'of', 'calibrated', 'physical', 'parameters']] | [-0.027192784198600668, 0.05205891102773501, -0.0894083110697306, 0.03677462386743476, -0.10822511811560967, -0.13420533651093902, 0.022903892219785536, 0.4204104903497194, -0.2537025208952592, -0.32119194457252315, 0.08467370598220059, -0.24743176410138085, -0.21747484745196344, 0.23567055619787425, -0.1458268366884767, 0.1262785695542238, 0.059970882645677445, -0.06103616699820442, -0.05870135021886151, -0.21639168721198904, 0.2400490324209003, 0.10309291763329193, 0.3811842415547162, 0.016696220516071964, 0.08507589965838154, -0.005615653680523106, -0.06452369255324204, 0.037338046030255784, -0.13407780597972624, 0.20990874094729262, 0.25819314476348953, 0.13728419462986813, 0.326005194091091, -0.4507420719519519, -0.3148059442051147, 0.07600395712723727, 0.09792438533010059, 0.0823720211587977, -0.052943182560403854, -0.2377368848476755, 0.04248691118616415, -0.1870888022406194, -0.09581648182581391, -0.1681166773890717, -0.010495364567951151, 0.013972983111447672, -0.2458649971359001, 0.06112477168432649, 0.0653000585755268, 0.07505331985170446, -0.06725663681955714, -0.12610880839393326, 0.02778791054560427, 0.12767433920842514, 0.04811750038980359, -0.018591455944707583, 0.16068863977367678, -0.14748090874452732, -0.16133235912594387, 0.4049204268018928, -0.03678399131617002, -0.20166214591243484, 0.20432082867135473, -0.07858854908447124, -0.14532031980343163, 0.1276973372492776, 0.23647779053518256, 0.057382745939927794, -0.17963798562260835, 0.02199670526386941, 0.08774326087318753, 0.1997395456592928, -0.025982872542124568, 0.05853458116517255, 0.18422837736975534, 0.2718759856366536, -0.0259807125952201, 0.12199030604218326, -0.11793587336994774, -0.05666059062391389, -0.21920978221552154, -0.09173731441331799, -0.11019891738613839, 0.00732132241440316, -0.07083773574528382, -0.17834917823845325, 0.4161171656379705, 0.2536170257279943, 0.1411040436722575, 0.030175974382201962, 0.2989257966217242, 0.07495075755082724, 0.10461827066191881, -0.011716347861740934, 0.2573351819352083, 0.11625766391016282, 0.07435705980465732, -0.229590125395222, 0.15486379452213123, -0.01698577558834171] |
1,802.01488 | Non-Euclidean elastodynamic cloaking theory and application to control
of surface seismic waves with pillars atop a thick plate | In [AIP Advances 6, 121707 (2016)], a soil structured with concrete columns
distributed within two specially designed seismic cloaks thanks to a
combination of transformational elastodynamics and effective medium theory was
shown to detour Rayleigh waves of frequencies lower than 10 Hz around a
cylindrical region. The aforementioned studies motivate our exploration of
interactions of surface elastic waves propagating in a thick plate (with soil
parameters) structured with concrete pillars above it. Pillars are 40 m in
height and the plate is 100 m in thickness, so that typical frequencies under
study are below 1 Hz, a frequency range of particular interest in earthquake
engineering. We demonstrate that three seismic cloaks allow for an
unprecedented flow of elastodynamic energy. These designs are achieved by first
computing ideal cloaks' parameters deduced from a geometric transform in the
Navier equations that leads to almost isotropic and symmetric elasticity (4th
order) and density (2nd order) tensors. To do this we extend the theory of
Non-Euclidean cloaking for light as proposed by the theoretical physicists
Leonhardt and Tyc. In a second step, ideal heterogeneous nearly isotropic
cloak's parameters are approximated by averaging elastic properties of sets of
pillars placed at the nodes of a bipolar coordinate grid, which is an essential
ingredient in our Non-Euclidean cloaking theory for elastodynamic waves.
Cloaking effects are studied for a clamped obstacle (reduction of the
disturbance of the wave wavefront and its amplitude behind a clamped obstacle).
Protection is achieved through reduction of the wave amplitude within the
center of the cloak.These results represent a first step towards designs of
Non-Euclidean seismic cloaks for surface (Rayleigh and Love) waves propagating
in semi-infinite elastic media structured with pillars.
| physics.class-ph | in aip advances 6 121707 2016 a soil structured with concrete columns distributed within two specially designed seismic cloaks thanks to a combination of transformational elastodynamics and effective medium theory was shown to detour rayleigh waves of frequencies lower than 10 hz around a cylindrical region the aforementioned studies motivate our exploration of interactions of surface elastic waves propagating in a thick plate with soil parameters structured with concrete pillars above it pillars are 40 m in height and the plate is 100 m in thickness so that typical frequencies under study are below 1 hz a frequency range of particular interest in earthquake engineering we demonstrate that three seismic cloaks allow for an unprecedented flow of elastodynamic energy these designs are achieved by first computing ideal cloaks parameters deduced from a geometric transform in the navier equations that leads to almost isotropic and symmetric elasticity 4th order and density 2nd order tensors to do this we extend the theory of noneuclidean cloaking for light as proposed by the theoretical physicists leonhardt and tyc in a second step ideal heterogeneous nearly isotropic cloaks parameters are approximated by averaging elastic properties of sets of pillars placed at the nodes of a bipolar coordinate grid which is an essential ingredient in our noneuclidean cloaking theory for elastodynamic waves cloaking effects are studied for a clamped obstacle reduction of the disturbance of the wave wavefront and its amplitude behind a clamped obstacle protection is achieved through reduction of the wave amplitude within the center of the cloakthese results represent a first step towards designs of noneuclidean seismic cloaks for surface rayleigh and love waves propagating in semiinfinite elastic media structured with pillars | [['in', 'aip', 'advances', '6', '121707', '2016', 'a', 'soil', 'structured', 'with', 'concrete', 'columns', 'distributed', 'within', 'two', 'specially', 'designed', 'seismic', 'cloaks', 'thanks', 'to', 'a', 'combination', 'of', 'transformational', 'elastodynamics', 'and', 'effective', 'medium', 'theory', 'was', 'shown', 'to', 'detour', 'rayleigh', 'waves', 'of', 'frequencies', 'lower', 'than', '10', 'hz', 'around', 'a', 'cylindrical', 'region', 'the', 'aforementioned', 'studies', 'motivate', 'our', 'exploration', 'of', 'interactions', 'of', 'surface', 'elastic', 'waves', 'propagating', 'in', 'a', 'thick', 'plate', 'with', 'soil', 'parameters', 'structured', 'with', 'concrete', 'pillars', 'above', 'it', 'pillars', 'are', '40', 'm', 'in', 'height', 'and', 'the', 'plate', 'is', '100', 'm', 'in', 'thickness', 'so', 'that', 'typical', 'frequencies', 'under', 'study', 'are', 'below', '1', 'hz', 'a', 'frequency', 'range', 'of', 'particular', 'interest', 'in', 'earthquake', 'engineering', 'we', 'demonstrate', 'that', 'three', 'seismic', 'cloaks', 'allow', 'for', 'an', 'unprecedented', 'flow', 'of', 'elastodynamic', 'energy', 'these', 'designs', 'are', 'achieved', 'by', 'first', 'computing', 'ideal', 'cloaks', 'parameters', 'deduced', 'from', 'a', 'geometric', 'transform', 'in', 'the', 'navier', 'equations', 'that', 'leads', 'to', 'almost', 'isotropic', 'and', 'symmetric', 'elasticity', '4th', 'order', 'and', 'density', '2nd', 'order', 'tensors', 'to', 'do', 'this', 'we', 'extend', 'the', 'theory', 'of', 'noneuclidean', 'cloaking', 'for', 'light', 'as', 'proposed', 'by', 'the', 'theoretical', 'physicists', 'leonhardt', 'and', 'tyc', 'in', 'a', 'second', 'step', 'ideal', 'heterogeneous', 'nearly', 'isotropic', 'cloaks', 'parameters', 'are', 'approximated', 'by', 'averaging', 'elastic', 'properties', 'of', 'sets', 'of', 'pillars', 'placed', 'at', 'the', 'nodes', 'of', 'a', 'bipolar', 'coordinate', 'grid', 'which', 'is', 'an', 'essential', 'ingredient', 'in', 'our', 'noneuclidean', 'cloaking', 'theory', 'for', 'elastodynamic', 'waves', 'cloaking', 'effects', 'are', 'studied', 'for', 'a', 'clamped', 'obstacle', 'reduction', 'of', 'the', 'disturbance', 'of', 'the', 'wave', 'wavefront', 'and', 'its', 'amplitude', 'behind', 'a', 'clamped', 'obstacle', 'protection', 'is', 'achieved', 'through', 'reduction', 'of', 'the', 'wave', 'amplitude', 'within', 'the', 'center', 'of', 'the', 'cloakthese', 'results', 'represent', 'a', 'first', 'step', 'towards', 'designs', 'of', 'noneuclidean', 'seismic', 'cloaks', 'for', 'surface', 'rayleigh', 'and', 'love', 'waves', 'propagating', 'in', 'semiinfinite', 'elastic', 'media', 'structured', 'with', 'pillars']] | [-0.13747453999126477, 0.14801993868694077, -0.03260641164564114, -0.0018759675665223964, -0.11265269674979392, -0.08397365289711686, -0.00982741185292494, 0.38989201127904527, -0.24831378510026833, -0.2835900300621166, 0.11880770049331918, -0.271446162902007, -0.16093704303632414, 0.20817057949399226, -0.04165178092120225, 0.10660177541855514, 0.014766495131016692, -0.0256377602280168, -0.053410399104182736, -0.16144155198161822, 0.28394294135307807, 0.05768592290442424, 0.3042991499640115, -0.010002376318998326, 0.1002500030737024, -0.007805300188092818, -0.003719880743227926, 0.02700363938437795, -0.13005458509222423, 0.1253977730964388, 0.2930791214216057, 0.028252849475537772, 0.24089204223947566, -0.48955709441978523, -0.26375139924648827, 0.006185842925070748, 0.11899161015091705, 0.09462748880208964, -0.03316510678689241, -0.2739879483548716, 0.04542978373709192, -0.1362252644740637, -0.20416402776426357, 0.0020271006281090908, 0.050684917383635626, 0.03436959330715401, -0.24944949158953186, 0.05785620101466556, 0.0807074119642861, 0.06950983987105774, -0.08511368659726724, -0.11628293326891125, 0.0038375874925808246, 0.06689482930684564, 0.030870083477415333, -0.017640599484188946, 0.11972403419388976, -0.1110409216741806, -0.05785455937171187, 0.41260678114685556, -0.03207132811575081, -0.19460408082937936, 0.15265052367946544, -0.12038983906987409, -0.0016233108799891137, 0.18094715743413067, 0.22732059224021187, 0.0831570994522463, -0.13316080559129972, 0.04977583157302919, -0.029598435683622252, 0.1630854482013591, 0.16844544917788853, -0.023301439094172274, 0.21074531450157394, 0.19756765912004515, 0.076427334123787, 0.12914527417412733, -0.10443312239695327, -0.021014869455180874, -0.32499759485575264, -0.12054263551749746, -0.18178644331024174, 0.011197211058950725, -0.11863296252339348, -0.18478438931646327, 0.34939368706136026, 0.12360262266605662, 0.1274552675697865, 0.014101606203219602, 0.284867990515716, 0.07025104354174357, 0.06647350865043028, 0.09146961016119845, 0.33502015815408975, 0.1899188693557338, 0.10925321432590376, -0.13828645720382368, 0.0028922744221407046, 0.03335034145153252] |
1,802.01489 | Shoulder Physiotherapy Exercise Recognition: Machine Learning the
Inertial Signals from a Smartwatch | Objective: Participation in a physical therapy program is considered one of
the greatest predictors of successful conservative management of common
shoulder disorders. However, adherence to these protocols is often poor and
typically worse for unsupervised home exercise programs. Currently, there are
limited tools available for objective measurement of adherence in the home
setting. The goal of this study was to develop and evaluate the potential for
performing home shoulder physiotherapy monitoring using a commercial
smartwatch.
Approach: Twenty healthy adult subjects with no prior shoulder disorders
performed seven exercises from an evidence-based rotator cuff physiotherapy
protocol, while 6-axis inertial sensor data was collected from the active
extremity. Within an activity recognition chain (ARC) framework, four
supervised learning algorithms were trained and optimized to classify the
exercises: k-nearest neighbor (k-NN), random forest (RF), support vector
machine classifier (SVC), and a convolutional recurrent neural network (CRNN).
Algorithm performance was evaluated using 5-fold cross-validation stratified
first temporally and then by subject.
Main Results: Categorical classification accuracy was above 94% for all
algorithms on the temporally stratified cross validation, with the best
performance achieved by the CRNN algorithm (99.4%). The subject stratified
cross validation, which evaluated classifier performance on unseen subjects,
yielded lower accuracies scores again with CRNN performing best (88.9%).
Significance: This proof of concept study demonstrates the technical
feasibility of a smartwatch device and supervised machine learning approach to
more easily monitor and assess the at-home adherence of shoulder physiotherapy
exercise protocols.
| cs.HC | objective participation in a physical therapy program is considered one of the greatest predictors of successful conservative management of common shoulder disorders however adherence to these protocols is often poor and typically worse for unsupervised home exercise programs currently there are limited tools available for objective measurement of adherence in the home setting the goal of this study was to develop and evaluate the potential for performing home shoulder physiotherapy monitoring using a commercial smartwatch approach twenty healthy adult subjects with no prior shoulder disorders performed seven exercises from an evidencebased rotator cuff physiotherapy protocol while 6axis inertial sensor data was collected from the active extremity within an activity recognition chain arc framework four supervised learning algorithms were trained and optimized to classify the exercises knearest neighbor knn random forest rf support vector machine classifier svc and a convolutional recurrent neural network crnn algorithm performance was evaluated using 5fold crossvalidation stratified first temporally and then by subject main results categorical classification accuracy was above 94 for all algorithms on the temporally stratified cross validation with the best performance achieved by the crnn algorithm 994 the subject stratified cross validation which evaluated classifier performance on unseen subjects yielded lower accuracies scores again with crnn performing best 889 significance this proof of concept study demonstrates the technical feasibility of a smartwatch device and supervised machine learning approach to more easily monitor and assess the athome adherence of shoulder physiotherapy exercise protocols | [['objective', 'participation', 'in', 'a', 'physical', 'therapy', 'program', 'is', 'considered', 'one', 'of', 'the', 'greatest', 'predictors', 'of', 'successful', 'conservative', 'management', 'of', 'common', 'shoulder', 'disorders', 'however', 'adherence', 'to', 'these', 'protocols', 'is', 'often', 'poor', 'and', 'typically', 'worse', 'for', 'unsupervised', 'home', 'exercise', 'programs', 'currently', 'there', 'are', 'limited', 'tools', 'available', 'for', 'objective', 'measurement', 'of', 'adherence', 'in', 'the', 'home', 'setting', 'the', 'goal', 'of', 'this', 'study', 'was', 'to', 'develop', 'and', 'evaluate', 'the', 'potential', 'for', 'performing', 'home', 'shoulder', 'physiotherapy', 'monitoring', 'using', 'a', 'commercial', 'smartwatch', 'approach', 'twenty', 'healthy', 'adult', 'subjects', 'with', 'no', 'prior', 'shoulder', 'disorders', 'performed', 'seven', 'exercises', 'from', 'an', 'evidencebased', 'rotator', 'cuff', 'physiotherapy', 'protocol', 'while', '6axis', 'inertial', 'sensor', 'data', 'was', 'collected', 'from', 'the', 'active', 'extremity', 'within', 'an', 'activity', 'recognition', 'chain', 'arc', 'framework', 'four', 'supervised', 'learning', 'algorithms', 'were', 'trained', 'and', 'optimized', 'to', 'classify', 'the', 'exercises', 'knearest', 'neighbor', 'knn', 'random', 'forest', 'rf', 'support', 'vector', 'machine', 'classifier', 'svc', 'and', 'a', 'convolutional', 'recurrent', 'neural', 'network', 'crnn', 'algorithm', 'performance', 'was', 'evaluated', 'using', '5fold', 'crossvalidation', 'stratified', 'first', 'temporally', 'and', 'then', 'by', 'subject', 'main', 'results', 'categorical', 'classification', 'accuracy', 'was', 'above', '94', 'for', 'all', 'algorithms', 'on', 'the', 'temporally', 'stratified', 'cross', 'validation', 'with', 'the', 'best', 'performance', 'achieved', 'by', 'the', 'crnn', 'algorithm', '994', 'the', 'subject', 'stratified', 'cross', 'validation', 'which', 'evaluated', 'classifier', 'performance', 'on', 'unseen', 'subjects', 'yielded', 'lower', 'accuracies', 'scores', 'again', 'with', 'crnn', 'performing', 'best', '889', 'significance', 'this', 'proof', 'of', 'concept', 'study', 'demonstrates', 'the', 'technical', 'feasibility', 'of', 'a', 'smartwatch', 'device', 'and', 'supervised', 'machine', 'learning', 'approach', 'to', 'more', 'easily', 'monitor', 'and', 'assess', 'the', 'athome', 'adherence', 'of', 'shoulder', 'physiotherapy', 'exercise', 'protocols']] | [-0.029786057125827665, -0.005350982469665354, -0.04448416846839392, 0.06581232225362632, -0.09208089280430282, -0.2565049625629711, 0.10055113965294725, 0.45616585741045584, -0.17684164096184354, -0.33246617091461145, 0.10837317932354262, -0.2874061202785175, -0.14384672877858062, 0.21341274875042293, -0.1405192345272283, 0.12134950755750487, 0.135423729390054, 0.07776745414326287, 0.00437730165280277, -0.33432051449211386, 0.22570644491878203, 0.09054401265087081, 0.3737030619732007, 0.0014487301977546146, 0.09129932869340694, 0.018885990024142933, -0.04878857080258671, -0.01969768994665124, -0.0474571294899422, 0.1377218605801424, 0.34463877594449155, 0.19543901076111708, 0.37452010412907, -0.36368940995858057, -0.1838559493311451, 0.0677044070462178, 0.10168495004198798, 0.04377502718965706, 0.0042226243296917725, -0.3562758876610875, 0.09437088044087508, -0.19537294885167017, -0.02837739802169259, -0.09124672183816644, -0.04513312252550133, -0.0165598209307794, -0.2770387768576401, 0.046843615878825406, 0.02709090971742527, 0.19179391060570045, -0.09589211066023576, -0.1458847205072766, 0.01917030497465797, 0.16490189709835082, 0.03688555082430962, 0.06952389124654249, 0.201234806913524, -0.13868496172048153, -0.18612654659523, 0.3309293778712577, -0.012989334208758306, -0.1423449008024169, 0.19544039551893475, -0.018309685987104744, -0.12430831140967157, 0.12632297671294798, 0.23354334874486815, 0.10170157562924752, -0.21018949677684504, -0.03624008423317551, 0.012933373959758417, 0.18870154852593107, 0.06154769139216285, -0.09323675673947938, 0.13069877597463422, 0.2837819826699575, 0.008608217286842263, 0.13243017288287284, -0.12137753996514875, -0.035790264273303944, -0.2108822900755136, -0.09760446049600341, -0.15886016929508517, -0.022592778956209734, -0.07059001661677577, -0.14554299923365305, 0.3763562524691224, 0.17739661442928267, 0.12682425289777222, 0.09436204077950659, 0.35900074242376506, -0.02192204036831731, 0.09506765792485342, 0.06897363346070051, 0.22619838130350564, 0.048135273465419105, 0.11740155653759182, -0.15607910420429974, 0.13538774986611093, 0.026716964970957525] |
1,802.0149 | Coefficient of Thermal Expansion Mismatch Induced Stress Calculation for
Field Assisted Bonding of Silicon to Glass | The residual stress induced in assembly is a common concern in electronic
packaging. The mismatch in coefficient of thermal expansion between
borosilicate glass and silicon, upon temperature variation, generates an
internal stress state. This affects important characteristics of
microelectromechanical devices or constituent elements. Such as self frequence
or stiffness. Stresses caused by thermal expansion coefficients mismatch of
anodically bonded glass and silicon samples are studied in this paper. Stress
calculation based on lamination theory is presented. Usage examples of such
calculations are described. For bonded silicon and LK-5 glass several results
of calculations are presented. Stress distribution in bonded silicon and glass
of several thicknesses is evaluated. Stress distribution in bonded
glass-silicon-glass structure is evaluated. Bonded silicon surface stress
dependence of glass to silicon wafer thickness ratio is evaluated. Experimental
study of thermal mismatch stress in glass based on birefringence phenomenon was
conducted. It's results are presented in this paper. Keywords: anodic bonding,
field assisted bonding, thermal expansion, stress.
| physics.app-ph cond-mat.mtrl-sci | the residual stress induced in assembly is a common concern in electronic packaging the mismatch in coefficient of thermal expansion between borosilicate glass and silicon upon temperature variation generates an internal stress state this affects important characteristics of microelectromechanical devices or constituent elements such as self frequence or stiffness stresses caused by thermal expansion coefficients mismatch of anodically bonded glass and silicon samples are studied in this paper stress calculation based on lamination theory is presented usage examples of such calculations are described for bonded silicon and lk5 glass several results of calculations are presented stress distribution in bonded silicon and glass of several thicknesses is evaluated stress distribution in bonded glasssiliconglass structure is evaluated bonded silicon surface stress dependence of glass to silicon wafer thickness ratio is evaluated experimental study of thermal mismatch stress in glass based on birefringence phenomenon was conducted its results are presented in this paper keywords anodic bonding field assisted bonding thermal expansion stress | [['the', 'residual', 'stress', 'induced', 'in', 'assembly', 'is', 'a', 'common', 'concern', 'in', 'electronic', 'packaging', 'the', 'mismatch', 'in', 'coefficient', 'of', 'thermal', 'expansion', 'between', 'borosilicate', 'glass', 'and', 'silicon', 'upon', 'temperature', 'variation', 'generates', 'an', 'internal', 'stress', 'state', 'this', 'affects', 'important', 'characteristics', 'of', 'microelectromechanical', 'devices', 'or', 'constituent', 'elements', 'such', 'as', 'self', 'frequence', 'or', 'stiffness', 'stresses', 'caused', 'by', 'thermal', 'expansion', 'coefficients', 'mismatch', 'of', 'anodically', 'bonded', 'glass', 'and', 'silicon', 'samples', 'are', 'studied', 'in', 'this', 'paper', 'stress', 'calculation', 'based', 'on', 'lamination', 'theory', 'is', 'presented', 'usage', 'examples', 'of', 'such', 'calculations', 'are', 'described', 'for', 'bonded', 'silicon', 'and', 'lk5', 'glass', 'several', 'results', 'of', 'calculations', 'are', 'presented', 'stress', 'distribution', 'in', 'bonded', 'silicon', 'and', 'glass', 'of', 'several', 'thicknesses', 'is', 'evaluated', 'stress', 'distribution', 'in', 'bonded', 'glasssiliconglass', 'structure', 'is', 'evaluated', 'bonded', 'silicon', 'surface', 'stress', 'dependence', 'of', 'glass', 'to', 'silicon', 'wafer', 'thickness', 'ratio', 'is', 'evaluated', 'experimental', 'study', 'of', 'thermal', 'mismatch', 'stress', 'in', 'glass', 'based', 'on', 'birefringence', 'phenomenon', 'was', 'conducted', 'its', 'results', 'are', 'presented', 'in', 'this', 'paper', 'keywords', 'anodic', 'bonding', 'field', 'assisted', 'bonding', 'thermal', 'expansion', 'stress']] | [-0.10140040989145872, 0.2191550573371859, -0.03625076794643191, -0.09684739112883477, 0.009704318952295765, -0.1145472047921223, -0.04967418344045954, 0.46347386985309896, -0.23505951709974604, -0.2549874976902163, 0.05560851989747202, -0.3323580483328315, -0.16870831536671407, 0.1364328074033219, -0.027592059299998174, 0.06392771688981064, 0.018167688562888418, -0.06885052154347583, -0.06952227056733792, -0.18862289109888422, 0.24443358714291472, 0.08808505278956764, 0.4028645552461967, 0.15414410499970818, 0.08108111749745056, -0.011041803943447155, 0.008779765902487914, 0.038810495581902284, -0.17341571158281516, 0.08101735090176705, 0.24914722287838784, -0.08506917596877187, 0.18668678954473544, -0.5091303551946825, -0.1734057097118112, 0.006708712096007753, 0.04754991588312425, 0.08094271705662713, -0.07142852371870953, -0.1833835784581643, 0.04239769501882735, -0.16427558656970534, -0.11224321861332504, -0.04002327537989315, -0.002454981976151879, 0.018979068431425605, -0.20385792727554158, 0.12301398063361456, 0.026642530701193913, 0.10340156615039413, -0.10720288387952517, -0.17463494991865952, -0.07439055666916922, 0.04487897804348812, 0.01935758055453012, -0.022875536732741078, 0.33186890160159466, -0.10009888545580538, -0.0397368678263141, 0.3671775635779847, -0.04419880623257236, -0.15269644767710205, 0.17456537797970437, -0.08670754579803612, -0.04664071167441957, 0.14702688486468565, 0.15673101853278665, 0.06388630529075767, -0.18906234345093806, 0.020459379539635295, 0.07279494589878412, 0.19511297697059904, 0.13428596394207282, -0.003923921391980935, 0.19699175011284084, 0.28775110986390257, -0.05589453393558064, 0.19473442071282504, -0.07056138680104308, -0.04261275095558619, -0.24839073851633864, -0.19733703467122551, -0.24885516465402832, 0.02420349553362997, -0.11835782900504191, -0.24861274284083704, 0.3343343303503492, 0.09716351167004131, 0.12045952635581451, -0.03364268517050939, 0.2709352376080955, 0.02511639237224089, 0.10692814396269902, -0.03787767514881171, 0.3021812140293231, 0.2252160565812683, 0.09115519498981818, -0.23818206883483578, 0.1387259252487293, 0.0368370760137899] |
1,802.01491 | Poisson ratio effects on the mechanics of auxetic nanobeams | Poisson ratio is an important mechanical property that reveals the
deformation patterns of materials. A positive Poisson ratio is a feature of the
majority of materials. Some materials, however, display auxetic behaviors (i.e.
possess negative Poisson ratios). Indeed, auxetic and non-auxetic materials
display different deformation mechanisms. Revealing these differences and their
effects on the mechanics of these materials is of a significant importance. In
this study, effects of Poisson ratio on the mechanics of auxetic and
non-auxetic nanobeams are revealed. A parametric study is provided on effects
of Poisson ratio on the static bending and free vibration behaviors of auxetic
nanobeams. The general nonlocal theory is employed to model the nonlocal
effects. Unlike Eringen nonlocal theory, the general nonlocal theory uses
different attenuation functions for the longitudinal and lateral strains. This
theory can reveal the Poisson ratio-nonlocal coupling effects on the mechanics
of nanomaterials. The obtained results showed that Poisson ratio is an
essential parameter for determining mechanical behaviors of nanobeams. It is
revealed that auxetic and non-auxetic nanobeams may reflect softening or
hardening behaviors depending on the ratio of the nonlocal fields of the
longitudinal and lateral strains of the beam.
| physics.class-ph physics.app-ph | poisson ratio is an important mechanical property that reveals the deformation patterns of materials a positive poisson ratio is a feature of the majority of materials some materials however display auxetic behaviors ie possess negative poisson ratios indeed auxetic and nonauxetic materials display different deformation mechanisms revealing these differences and their effects on the mechanics of these materials is of a significant importance in this study effects of poisson ratio on the mechanics of auxetic and nonauxetic nanobeams are revealed a parametric study is provided on effects of poisson ratio on the static bending and free vibration behaviors of auxetic nanobeams the general nonlocal theory is employed to model the nonlocal effects unlike eringen nonlocal theory the general nonlocal theory uses different attenuation functions for the longitudinal and lateral strains this theory can reveal the poisson rationonlocal coupling effects on the mechanics of nanomaterials the obtained results showed that poisson ratio is an essential parameter for determining mechanical behaviors of nanobeams it is revealed that auxetic and nonauxetic nanobeams may reflect softening or hardening behaviors depending on the ratio of the nonlocal fields of the longitudinal and lateral strains of the beam | [['poisson', 'ratio', 'is', 'an', 'important', 'mechanical', 'property', 'that', 'reveals', 'the', 'deformation', 'patterns', 'of', 'materials', 'a', 'positive', 'poisson', 'ratio', 'is', 'a', 'feature', 'of', 'the', 'majority', 'of', 'materials', 'some', 'materials', 'however', 'display', 'auxetic', 'behaviors', 'ie', 'possess', 'negative', 'poisson', 'ratios', 'indeed', 'auxetic', 'and', 'nonauxetic', 'materials', 'display', 'different', 'deformation', 'mechanisms', 'revealing', 'these', 'differences', 'and', 'their', 'effects', 'on', 'the', 'mechanics', 'of', 'these', 'materials', 'is', 'of', 'a', 'significant', 'importance', 'in', 'this', 'study', 'effects', 'of', 'poisson', 'ratio', 'on', 'the', 'mechanics', 'of', 'auxetic', 'and', 'nonauxetic', 'nanobeams', 'are', 'revealed', 'a', 'parametric', 'study', 'is', 'provided', 'on', 'effects', 'of', 'poisson', 'ratio', 'on', 'the', 'static', 'bending', 'and', 'free', 'vibration', 'behaviors', 'of', 'auxetic', 'nanobeams', 'the', 'general', 'nonlocal', 'theory', 'is', 'employed', 'to', 'model', 'the', 'nonlocal', 'effects', 'unlike', 'eringen', 'nonlocal', 'theory', 'the', 'general', 'nonlocal', 'theory', 'uses', 'different', 'attenuation', 'functions', 'for', 'the', 'longitudinal', 'and', 'lateral', 'strains', 'this', 'theory', 'can', 'reveal', 'the', 'poisson', 'rationonlocal', 'coupling', 'effects', 'on', 'the', 'mechanics', 'of', 'nanomaterials', 'the', 'obtained', 'results', 'showed', 'that', 'poisson', 'ratio', 'is', 'an', 'essential', 'parameter', 'for', 'determining', 'mechanical', 'behaviors', 'of', 'nanobeams', 'it', 'is', 'revealed', 'that', 'auxetic', 'and', 'nonauxetic', 'nanobeams', 'may', 'reflect', 'softening', 'or', 'hardening', 'behaviors', 'depending', 'on', 'the', 'ratio', 'of', 'the', 'nonlocal', 'fields', 'of', 'the', 'longitudinal', 'and', 'lateral', 'strains', 'of', 'the', 'beam']] | [-0.16088272243036025, 0.14126063394375482, -0.10291183588012116, 0.0331447780460207, -0.06492754017186951, -0.15372046494749203, -0.011381760378568116, 0.3734651937281118, -0.267586834963377, -0.2554510123832688, 0.018702403375883806, -0.29889301756757714, -0.24554953468763585, 0.17656323682097474, -0.038283641080290365, 0.04081349938386242, 0.005000504289145907, -0.03864626152713963, -0.0470637386349025, -0.14339061206308315, 0.30271614556010634, 0.0696798253917813, 0.3819581465503074, 0.0767461931922946, 0.10594541270283407, 0.002288740062452268, -0.0009056421762322568, 0.08031599836287465, -0.1475597560109436, 0.08303134125859735, 0.20449353696008002, -0.044177739783458375, 0.23361091557353814, -0.41911422684593663, -0.25542067653555617, 0.06682728525709497, 0.06756565865880142, 0.09346590707010312, -0.01358960629002001, -0.2326045544301184, 0.05336058845607008, -0.07876932187583688, -0.12752511431536204, -0.05836084042066289, 0.016979710575612504, 0.04449704338135734, -0.2452055415094718, 0.13245993817020305, 0.07591549209404386, 0.09146176097202675, -0.11154046323618495, -0.16315106787787098, -0.024147028725165193, 0.07796754533332328, 0.07129250193338997, -0.07622886668702987, 0.18939998959976184, -0.13574712742510112, -0.11376381765975475, 0.4282927883308044, 0.010214147466376267, -0.2123914939517165, 0.19072811828965214, -0.135451131748372, -0.10172557721587376, 0.1448574125308407, 0.17717980590761098, 0.07708511281885323, -0.11880801033706487, 0.0492038577200762, 0.005735114979903891, 0.1456816921800531, 0.05390630099746881, 0.05030140563868796, 0.20769143946156765, 0.15789306498771408, -0.002518241035298527, 0.12586286449829281, -0.053068689526551215, -0.07538723784464738, -0.26842309062061975, -0.14420245372061252, -0.14317910341638584, 0.09109522729956043, -0.14961892454795045, -0.2527938488705074, 0.3684753299110535, 0.08919559480265546, 0.14198399595099537, -0.006310671143701875, 0.18799902474341904, 0.116983935824493, 0.07469561424823136, -0.04574689454126601, 0.2908563183077199, 0.16260802910629055, 0.1245793408436301, -0.2525734347291291, 0.12531010373995313, -0.008603069086495729] |
1,802.01492 | Analysing the Degree of Meshing in Medium Voltage Target Grids - An
Automated Technical and Economical Impact Assessment | There are different MV grid concepts with regard to mode of operation and
protection system layout. The increasing installation of DG raises the question
if the currently used concepts are still optimal for future power systems. We
present a methodology that allows the automated calculation and comparison of
target grids within different concepts. Specifically, we consider radial grids,
closed ring grids and grids with switching stations. A target grid structure is
optimized for each of those grid concepts based on geographical information. To
model a realistic planning process, compliance with technical constraints for
normal operation, contingency behaviour and reliability figures are ensured in
all grid concepts. We present a multiphase approach to solve the optimization
problem based on an iterated local search meta-heuristic. We then economically
compare the grids with regards to CAPEX and OPEX for primary and secondary
equipment, to analyse which concept leads to the most overall cost-efficient
target grids. Since the methodology allows an automated evaluation of a large
number of grids, it can be used to draw general conclusions about the
cost-efficiency of specific concepts. The methodology is applied to 44 real MV
grids spanning about 4800km of lines, for which the results show that a radial
grid structure is overall cost efficient compared to grid topologies with
switching stations or closed rings even in grid areas with a large DG
penetration. The contribution of this paper is threefold: first, a
comprehensive methodology to compile automated target grid plans under
realistic premises is presented. Second, the practical applicability of the
approach is demonstrated with a large scale case study with a high degree of
automation. And third, the results of the case study allow to draw conclusions
about the techno-economical differences of different MV grid concepts.
| cs.CE | there are different mv grid concepts with regard to mode of operation and protection system layout the increasing installation of dg raises the question if the currently used concepts are still optimal for future power systems we present a methodology that allows the automated calculation and comparison of target grids within different concepts specifically we consider radial grids closed ring grids and grids with switching stations a target grid structure is optimized for each of those grid concepts based on geographical information to model a realistic planning process compliance with technical constraints for normal operation contingency behaviour and reliability figures are ensured in all grid concepts we present a multiphase approach to solve the optimization problem based on an iterated local search metaheuristic we then economically compare the grids with regards to capex and opex for primary and secondary equipment to analyse which concept leads to the most overall costefficient target grids since the methodology allows an automated evaluation of a large number of grids it can be used to draw general conclusions about the costefficiency of specific concepts the methodology is applied to 44 real mv grids spanning about 4800km of lines for which the results show that a radial grid structure is overall cost efficient compared to grid topologies with switching stations or closed rings even in grid areas with a large dg penetration the contribution of this paper is threefold first a comprehensive methodology to compile automated target grid plans under realistic premises is presented second the practical applicability of the approach is demonstrated with a large scale case study with a high degree of automation and third the results of the case study allow to draw conclusions about the technoeconomical differences of different mv grid concepts | [['there', 'are', 'different', 'mv', 'grid', 'concepts', 'with', 'regard', 'to', 'mode', 'of', 'operation', 'and', 'protection', 'system', 'layout', 'the', 'increasing', 'installation', 'of', 'dg', 'raises', 'the', 'question', 'if', 'the', 'currently', 'used', 'concepts', 'are', 'still', 'optimal', 'for', 'future', 'power', 'systems', 'we', 'present', 'a', 'methodology', 'that', 'allows', 'the', 'automated', 'calculation', 'and', 'comparison', 'of', 'target', 'grids', 'within', 'different', 'concepts', 'specifically', 'we', 'consider', 'radial', 'grids', 'closed', 'ring', 'grids', 'and', 'grids', 'with', 'switching', 'stations', 'a', 'target', 'grid', 'structure', 'is', 'optimized', 'for', 'each', 'of', 'those', 'grid', 'concepts', 'based', 'on', 'geographical', 'information', 'to', 'model', 'a', 'realistic', 'planning', 'process', 'compliance', 'with', 'technical', 'constraints', 'for', 'normal', 'operation', 'contingency', 'behaviour', 'and', 'reliability', 'figures', 'are', 'ensured', 'in', 'all', 'grid', 'concepts', 'we', 'present', 'a', 'multiphase', 'approach', 'to', 'solve', 'the', 'optimization', 'problem', 'based', 'on', 'an', 'iterated', 'local', 'search', 'metaheuristic', 'we', 'then', 'economically', 'compare', 'the', 'grids', 'with', 'regards', 'to', 'capex', 'and', 'opex', 'for', 'primary', 'and', 'secondary', 'equipment', 'to', 'analyse', 'which', 'concept', 'leads', 'to', 'the', 'most', 'overall', 'costefficient', 'target', 'grids', 'since', 'the', 'methodology', 'allows', 'an', 'automated', 'evaluation', 'of', 'a', 'large', 'number', 'of', 'grids', 'it', 'can', 'be', 'used', 'to', 'draw', 'general', 'conclusions', 'about', 'the', 'costefficiency', 'of', 'specific', 'concepts', 'the', 'methodology', 'is', 'applied', 'to', '44', 'real', 'mv', 'grids', 'spanning', 'about', '4800km', 'of', 'lines', 'for', 'which', 'the', 'results', 'show', 'that', 'a', 'radial', 'grid', 'structure', 'is', 'overall', 'cost', 'efficient', 'compared', 'to', 'grid', 'topologies', 'with', 'switching', 'stations', 'or', 'closed', 'rings', 'even', 'in', 'grid', 'areas', 'with', 'a', 'large', 'dg', 'penetration', 'the', 'contribution', 'of', 'this', 'paper', 'is', 'threefold', 'first', 'a', 'comprehensive', 'methodology', 'to', 'compile', 'automated', 'target', 'grid', 'plans', 'under', 'realistic', 'premises', 'is', 'presented', 'second', 'the', 'practical', 'applicability', 'of', 'the', 'approach', 'is', 'demonstrated', 'with', 'a', 'large', 'scale', 'case', 'study', 'with', 'a', 'high', 'degree', 'of', 'automation', 'and', 'third', 'the', 'results', 'of', 'the', 'case', 'study', 'allow', 'to', 'draw', 'conclusions', 'about', 'the', 'technoeconomical', 'differences', 'of', 'different', 'mv', 'grid', 'concepts']] | [-0.11603208111288647, 0.02698076310813728, -0.04858175595816445, 0.05110977163534219, -0.08881845607053644, -0.1432691931849048, 0.07283680727171789, 0.39379381657797946, -0.24005037493649675, -0.3613464588011589, 0.1358361669303526, -0.24226923962618863, -0.10412167246249737, 0.20600781787025982, -0.12745679446783875, 0.03923193450100371, 0.08967144264251045, -0.020393584976166796, -0.046718501497404454, -0.23269809218133256, 0.3030451882550551, 0.08256483313258893, 0.3252024257477994, 0.040244997494988236, 0.08067577203109977, -0.024559054988357174, -0.07091822437036575, 0.047515336708683104, -0.10213742727031179, 0.1659478532171003, 0.2848223839359384, 0.15726499009906547, 0.27102312296402586, -0.44769070410661194, -0.17950406424885537, 0.08700027532702531, 0.09003048923881983, 0.07880645245879553, -0.029360327366298913, -0.19414932017065845, 0.12097235377930499, -0.1917202494337289, -0.15462107735543718, -0.07272962241929942, 0.01763504556341407, 0.07259184297274462, -0.30319452960854204, -0.03191415600364659, 0.029862699663984433, 0.09629888770319263, -0.03940449498784599, -0.12805292769674756, -0.016001658329009336, 0.16165634914472726, -0.013270333335842426, -0.014755781826857451, 0.12474983200920381, -0.08426216677940425, -0.12542919549943893, 0.41551668859837165, 0.023825759269331885, -0.20985365188729097, 0.169726711314676, -0.11174629360256302, -0.13574837218200425, 0.105564380120389, 0.20317993632973716, 0.11817488162907669, -0.16576235627952782, 0.03149455711071722, 0.014015237712657027, 0.16761417744176774, 0.02888328884000657, -0.019215679607643525, 0.19367591008227059, 0.24634026135107787, 0.13062545422235416, 0.13137134092842948, -0.09123154586672576, -0.11523576604182988, -0.25618633440010147, -0.11222532871761359, -0.13782890883794607, 0.002126166934936514, -0.09716812073955022, -0.15976449069017284, 0.40455882486680317, 0.18785003077861498, 0.1444779210368223, 0.0556956565576709, 0.35584170250028063, 0.07872471934772168, 0.059323870173708805, 0.07774576535707133, 0.15428084806732537, 0.08007615721726324, 0.14411411736121713, -0.16944147739165297, 0.03759140021348786, 0.02510313786721478] |
1,802.01493 | Variable Modified Newtonian Mechanics III: Milky Way Rotational Curve | For a point mass residing in an expanding universe, within General Relativity (GR), a new metric [1} is found to lead to a cosmological background dependent MOND-like acceleration in addition to the Newtonian acceleration. In [2], we study the monolithic evolution of a spherical overdensity at recombination in this combined acceleration, called VMOND. Under reasonable relaxation assumptions we find that a massive spherical galaxy with a stable core can from at $z>7$. For galaxy mass $M=10^{10.5}M_{\odot}$ and a realistic initial overdensity, the model late time MOND acceleration $a_0^{VM}(r)$ at radius r takes on values similar to the canonical MOND acceleration $a_0$ at large radius r.
In this work, we consider an idealised model of rotating galaxy formation in which a Milky Way mass overdensity under VMOND monolithically evolves into a virialised sphere. We assume that this virialised sphere is given an uniform systematic angular velocity which equilibriates into a flat disk according to Mestel's analysis \cite{mestel}. We apply Mestel to o the Mestel's disk potential due to the flatten virialised sphere under VMOND to calculate the rotational curve at $17.77kpc-27.30kpc$, We find that the model combined acceleration leads to a Baryonic Tully-Fisher Relation (BTFR) with radius dependent acceleration $a_0^{VM}(25kpc)\sim O(a_0)$. The model rotational velocity in the same radius range matches Gaia DR3 measurements very closely. | astro-ph.GA | for a point mass residing in an expanding universe within general relativity gr a new metric 1 is found to lead to a cosmological background dependent mondlike acceleration in addition to the newtonian acceleration in 2 we study the monolithic evolution of a spherical overdensity at recombination in this combined acceleration called vmond under reasonable relaxation assumptions we find that a massive spherical galaxy with a stable core can from at z7 for galaxy mass m10105m_odot and a realistic initial overdensity the model late time mond acceleration a_0vmr at radius r takes on values similar to the canonical mond acceleration a_0 at large radius r in this work we consider an idealised model of rotating galaxy formation in which a milky way mass overdensity under vmond monolithically evolves into a virialised sphere we assume that this virialised sphere is given an uniform systematic angular velocity which equilibriates into a flat disk according to mestels analysis citemestel we apply mestel to o the mestels disk potential due to the flatten virialised sphere under vmond to calculate the rotational curve at 1777kpc2730kpc we find that the model combined acceleration leads to a baryonic tullyfisher relation btfr with radius dependent acceleration a_0vm25kpcsim oa_0 the model rotational velocity in the same radius range matches gaia dr3 measurements very closely | [['for', 'a', 'point', 'mass', 'residing', 'in', 'an', 'expanding', 'universe', 'within', 'general', 'relativity', 'gr', 'a', 'new', 'metric', '1', 'is', 'found', 'to', 'lead', 'to', 'a', 'cosmological', 'background', 'dependent', 'mondlike', 'acceleration', 'in', 'addition', 'to', 'the', 'newtonian', 'acceleration', 'in', '2', 'we', 'study', 'the', 'monolithic', 'evolution', 'of', 'a', 'spherical', 'overdensity', 'at', 'recombination', 'in', 'this', 'combined', 'acceleration', 'called', 'vmond', 'under', 'reasonable', 'relaxation', 'assumptions', 'we', 'find', 'that', 'a', 'massive', 'spherical', 'galaxy', 'with', 'a', 'stable', 'core', 'can', 'from', 'at', 'z7', 'for', 'galaxy', 'mass', 'm10105m_odot', 'and', 'a', 'realistic', 'initial', 'overdensity', 'the', 'model', 'late', 'time', 'mond', 'acceleration', 'a_0vmr', 'at', 'radius', 'r', 'takes', 'on', 'values', 'similar', 'to', 'the', 'canonical', 'mond', 'acceleration', 'a_0', 'at', 'large', 'radius', 'r', 'in', 'this', 'work', 'we', 'consider', 'an', 'idealised', 'model', 'of', 'rotating', 'galaxy', 'formation', 'in', 'which', 'a', 'milky', 'way', 'mass', 'overdensity', 'under', 'vmond', 'monolithically', 'evolves', 'into', 'a', 'virialised', 'sphere', 'we', 'assume', 'that', 'this', 'virialised', 'sphere', 'is', 'given', 'an', 'uniform', 'systematic', 'angular', 'velocity', 'which', 'equilibriates', 'into', 'a', 'flat', 'disk', 'according', 'to', 'mestels', 'analysis', 'citemestel', 'we', 'apply', 'mestel', 'to', 'o', 'the', 'mestels', 'disk', 'potential', 'due', 'to', 'the', 'flatten', 'virialised', 'sphere', 'under', 'vmond', 'to', 'calculate', 'the', 'rotational', 'curve', 'at', '1777kpc2730kpc', 'we', 'find', 'that', 'the', 'model', 'combined', 'acceleration', 'leads', 'to', 'a', 'baryonic', 'tullyfisher', 'relation', 'btfr', 'with', 'radius', 'dependent', 'acceleration', 'a_0vm25kpcsim', 'oa_0', 'the', 'model', 'rotational', 'velocity', 'in', 'the', 'same', 'radius', 'range', 'matches', 'gaia', 'dr3', 'measurements', 'very', 'closely']] | [-0.09248536777054293, 0.09150502319929789, -0.14826547635910514, 0.10072667248553761, -0.1075237955470262, -0.09468870026251061, -0.025829165585174195, 0.38703125973486086, -0.1888405418571566, -0.2901132177593828, -0.02010056525903295, -0.20814143389499073, -0.015835601689392013, 0.16675013922484655, -0.0438465703179632, -0.03149806353469373, 0.02235113904863244, -0.013833817630966135, -0.09651652370517155, -0.23393180919922532, 0.30308828717732633, 0.10283697711562283, 0.18323031500534434, -0.046541550868184144, 0.083120660798437, -0.07554380782839784, -0.004122825990025507, 0.04368482296252439, -0.22677270456215975, 0.006029866435275409, 0.15330394784113366, 0.0924463257523316, 0.24789102942321858, -0.3726445296823836, -0.1996740142917305, 0.07841692412601846, 0.18068829228272706, 0.10260402040308761, -0.09672283071358398, -0.23552682578037873, 0.05372500099439751, -0.18707332769453383, -0.2091865420706891, 0.042675955266731846, 0.07571010215377266, -0.02179590512944929, -0.24790563394480417, 0.1601883823778391, 0.03159350443310572, 0.009695559909397905, -0.10853871159282241, -0.044193412750986136, -0.01789313919383266, 0.00922488348957365, 0.03493047259585335, 0.1044689933368357, 0.2055838333084092, -0.08937571238744202, 0.035405809200105914, 0.4545084977584878, -0.11074217577001445, -0.11877744451486037, 0.17985657523230217, -0.2040158542447933, -0.1530772095532758, 0.09608762146700084, 0.19114010975558007, 0.07372577888579175, -0.12980268286701524, 0.08893133326223049, -0.02795823491468099, 0.20652950338812648, 0.08570246413933853, -0.04396555545294499, 0.33727824466490147, 0.11935124388432496, 0.06490729281591902, 0.059359037749576224, -0.14070121062647675, -0.09049888940430001, -0.3074790476203081, -0.1043482986833058, -0.13744813303182427, 0.0785399999287933, -0.15388522609285998, -0.15459295219416466, 0.32291146484092237, 0.10378833417669295, 0.24520886278795925, 0.10555520148007322, 0.30473696063473177, 0.07032948577443458, 0.09333541062014382, 0.14601389731338435, 0.288831167520162, 0.13322302445983203, 0.06725765089170214, -0.2526030453828801, -0.014683663613345634, 0.02764357096720576] |
1,802.01494 | Paradoxes of differential nonlocal cantilever beams: Reasons and a novel
solution | The paradoxes of differential nonlocal models have been attributed to the
inconsistency in forming the nonlocal boundary conditions. To overcome these
paradoxes, nonlocal boundary conditions should be correctly formed. However,
still forming these boundary conditions for differential nonlocal models is a
challenging task. To resolve the trouble, in this study, the iterative nonlocal
residual approach is employed. In the context of this approach, the field
equation is solved in the local field with an imposed nonlocal residuals. This
nonlocal residual is iteratively formed (not determined) depending on a
pre-determined local field. The iterative nonlocal residual approach permits
applying the local boundary conditions. Thus, the paradoxes of differential
nonlocal models due to the nonlocal boundary conditions are effectively solved.
The paradoxes of differential nonlocal models and reasons behind them are
discussed. Moreover, a nonlocal beam model based on the iterative nonlocal
residual approach is proposed. This nonlocal beam model is employed to
investigate the static bending and free vibration of differential nonlocal
cantilever beams. Comparisons between the results of the iterative nonlocal
residual approach and results of integral nonlocal beam models are carried out.
It is demonstrated that the iterative nonlocal residual approach gives the same
results as integral nonlocal models.
| physics.class-ph physics.app-ph | the paradoxes of differential nonlocal models have been attributed to the inconsistency in forming the nonlocal boundary conditions to overcome these paradoxes nonlocal boundary conditions should be correctly formed however still forming these boundary conditions for differential nonlocal models is a challenging task to resolve the trouble in this study the iterative nonlocal residual approach is employed in the context of this approach the field equation is solved in the local field with an imposed nonlocal residuals this nonlocal residual is iteratively formed not determined depending on a predetermined local field the iterative nonlocal residual approach permits applying the local boundary conditions thus the paradoxes of differential nonlocal models due to the nonlocal boundary conditions are effectively solved the paradoxes of differential nonlocal models and reasons behind them are discussed moreover a nonlocal beam model based on the iterative nonlocal residual approach is proposed this nonlocal beam model is employed to investigate the static bending and free vibration of differential nonlocal cantilever beams comparisons between the results of the iterative nonlocal residual approach and results of integral nonlocal beam models are carried out it is demonstrated that the iterative nonlocal residual approach gives the same results as integral nonlocal models | [['the', 'paradoxes', 'of', 'differential', 'nonlocal', 'models', 'have', 'been', 'attributed', 'to', 'the', 'inconsistency', 'in', 'forming', 'the', 'nonlocal', 'boundary', 'conditions', 'to', 'overcome', 'these', 'paradoxes', 'nonlocal', 'boundary', 'conditions', 'should', 'be', 'correctly', 'formed', 'however', 'still', 'forming', 'these', 'boundary', 'conditions', 'for', 'differential', 'nonlocal', 'models', 'is', 'a', 'challenging', 'task', 'to', 'resolve', 'the', 'trouble', 'in', 'this', 'study', 'the', 'iterative', 'nonlocal', 'residual', 'approach', 'is', 'employed', 'in', 'the', 'context', 'of', 'this', 'approach', 'the', 'field', 'equation', 'is', 'solved', 'in', 'the', 'local', 'field', 'with', 'an', 'imposed', 'nonlocal', 'residuals', 'this', 'nonlocal', 'residual', 'is', 'iteratively', 'formed', 'not', 'determined', 'depending', 'on', 'a', 'predetermined', 'local', 'field', 'the', 'iterative', 'nonlocal', 'residual', 'approach', 'permits', 'applying', 'the', 'local', 'boundary', 'conditions', 'thus', 'the', 'paradoxes', 'of', 'differential', 'nonlocal', 'models', 'due', 'to', 'the', 'nonlocal', 'boundary', 'conditions', 'are', 'effectively', 'solved', 'the', 'paradoxes', 'of', 'differential', 'nonlocal', 'models', 'and', 'reasons', 'behind', 'them', 'are', 'discussed', 'moreover', 'a', 'nonlocal', 'beam', 'model', 'based', 'on', 'the', 'iterative', 'nonlocal', 'residual', 'approach', 'is', 'proposed', 'this', 'nonlocal', 'beam', 'model', 'is', 'employed', 'to', 'investigate', 'the', 'static', 'bending', 'and', 'free', 'vibration', 'of', 'differential', 'nonlocal', 'cantilever', 'beams', 'comparisons', 'between', 'the', 'results', 'of', 'the', 'iterative', 'nonlocal', 'residual', 'approach', 'and', 'results', 'of', 'integral', 'nonlocal', 'beam', 'models', 'are', 'carried', 'out', 'it', 'is', 'demonstrated', 'that', 'the', 'iterative', 'nonlocal', 'residual', 'approach', 'gives', 'the', 'same', 'results', 'as', 'integral', 'nonlocal', 'models']] | [-0.11611353992717341, 0.027229624937244807, -0.13621699246810748, 0.10453820128634106, -0.1027238262083847, -0.1950402536871843, -0.04760552978841588, 0.3578490689955652, -0.30437985285185276, -0.2920365232415497, 0.0765931415441446, -0.24239559254376217, -0.15603973830118775, 0.14274122355069266, -0.07545658759772778, 0.10961000818759203, 0.0712203024374321, -0.018431362728588283, -0.10027127346605993, -0.23732188081135974, 0.34893521457910537, 0.02963830531574786, 0.27912682310678066, 0.0653348054527305, 0.1355560090416111, -0.043647317732684314, -0.0633959029847756, 0.07211097199819051, -0.1096547203477894, 0.0981134728892357, 0.21220013151436434, 0.023843926762929187, 0.3072618225752376, -0.5164428707957268, -0.2673717831925023, 0.07977216192055493, 0.0847739635873586, 0.14509710494428874, 0.015612493110820651, -0.3167997910827398, 0.060682988478802144, -0.09409457395202481, -0.1490664470777847, -0.06379285679664463, -0.04108895729441429, -0.010263479868299327, -0.293475424151402, 0.155544870570302, 0.08094659800641239, 0.012153456518426538, -0.07215218708966858, -0.07629511965205893, -0.01132250072900206, 0.06443322757608257, 0.02351235242560506, -0.019471418907633053, 0.10174424586351961, -0.14153745139250531, -0.09348678895272315, 0.3522069249674678, -0.052432689242996273, -0.249239291317499, 0.15855397447245195, -0.05720357788261026, -0.07426328004570677, 0.11490040900862368, 0.11841279787709937, 0.16455675008844992, -0.24350992343388497, 0.06036969185719499, -0.03253915802051779, 0.11922964758239686, 0.06658233417430892, 0.004683880827215035, 0.16362801667302848, 0.12353197581134737, 0.09141990274074488, 0.1208705624594586, -0.05678646891625249, -0.14334059099317528, -0.351513894200325, -0.06895715677179397, -0.1408578519243747, 0.005519382690035855, -0.045503827694119536, -0.15580174129921942, 0.35250586324371397, 0.18939048100728542, 0.13890047253109514, -0.03971245042979717, 0.2785328372800723, 0.18765086079889443, 0.1183207524009049, 0.013884883578575681, 0.24427199612138792, 0.16462190189631656, 0.12040023841429502, -0.3236225222120993, 0.06376204100844916, 0.09871747312368825] |
1,802.01495 | Instability, finite amplitude pulsation and mass-loss in models of
massive OB-type stars | Variability and mass-loss are common phenomena in massive OB-type stars. It
is argued that they are caused by violent strange mode instabilities identified
in corresponding stellar models. We present a systematic linear stability
analysis with respect to radial perturbations of massive OB-type stars with
solar chemical composition and masses between 23 to 100 M$_{\odot}$. For
selected unstable stellar models, we perform non-linear simulations of the
evolution of the instabilities into the non-linear regime. Finite amplitude
pulsations with periods in the range between hours and 100 days are found to be
the final result of the instabilities. The pulsations are associated with a
mean acoustic luminosity which can be the origin of a pulsationally driven
wind. Corresponding mass-loss rates lie in the range between 10$^{-9}$ and
10$^{-4}$ M$_{\odot}$ yr$^{-1}$ and may thus affect the evolution of massive
stars.
| astro-ph.SR | variability and massloss are common phenomena in massive obtype stars it is argued that they are caused by violent strange mode instabilities identified in corresponding stellar models we present a systematic linear stability analysis with respect to radial perturbations of massive obtype stars with solar chemical composition and masses between 23 to 100 m_odot for selected unstable stellar models we perform nonlinear simulations of the evolution of the instabilities into the nonlinear regime finite amplitude pulsations with periods in the range between hours and 100 days are found to be the final result of the instabilities the pulsations are associated with a mean acoustic luminosity which can be the origin of a pulsationally driven wind corresponding massloss rates lie in the range between 109 and 104 m_odot yr1 and may thus affect the evolution of massive stars | [['variability', 'and', 'massloss', 'are', 'common', 'phenomena', 'in', 'massive', 'obtype', 'stars', 'it', 'is', 'argued', 'that', 'they', 'are', 'caused', 'by', 'violent', 'strange', 'mode', 'instabilities', 'identified', 'in', 'corresponding', 'stellar', 'models', 'we', 'present', 'a', 'systematic', 'linear', 'stability', 'analysis', 'with', 'respect', 'to', 'radial', 'perturbations', 'of', 'massive', 'obtype', 'stars', 'with', 'solar', 'chemical', 'composition', 'and', 'masses', 'between', '23', 'to', '100', 'm_odot', 'for', 'selected', 'unstable', 'stellar', 'models', 'we', 'perform', 'nonlinear', 'simulations', 'of', 'the', 'evolution', 'of', 'the', 'instabilities', 'into', 'the', 'nonlinear', 'regime', 'finite', 'amplitude', 'pulsations', 'with', 'periods', 'in', 'the', 'range', 'between', 'hours', 'and', '100', 'days', 'are', 'found', 'to', 'be', 'the', 'final', 'result', 'of', 'the', 'instabilities', 'the', 'pulsations', 'are', 'associated', 'with', 'a', 'mean', 'acoustic', 'luminosity', 'which', 'can', 'be', 'the', 'origin', 'of', 'a', 'pulsationally', 'driven', 'wind', 'corresponding', 'massloss', 'rates', 'lie', 'in', 'the', 'range', 'between', '109', 'and', '104', 'm_odot', 'yr1', 'and', 'may', 'thus', 'affect', 'the', 'evolution', 'of', 'massive', 'stars']] | [-0.12112617668063536, 0.2273487277026458, -0.037137881601161334, 0.11352712238278838, -0.0852478621663512, -0.02595128707016689, 0.04000005872926953, 0.37607585778799807, -0.18123835754023362, -0.36406911717749874, 0.0910878662006372, -0.2877001046370052, -0.045746577108265275, 0.2268352890285208, -0.024416401604170076, -0.002891064386977984, 0.11865385135391006, -0.03970069158482399, -0.0698695768573301, -0.23213448141613147, 0.3010837595610723, 0.03667761806915276, 0.1430010871662602, -0.04903635391234726, 0.03018911978923274, -0.16586494215859277, -0.03929384968100782, -0.05497395736590218, -0.1573356915876396, -0.010174138060206697, 0.2305943247902842, 0.1145712046163415, 0.2438668405643943, -0.37568518732857964, -0.23669044830476063, 0.07129829999970368, 0.19972340810201028, 0.052439701630407606, -0.048616196227091686, -0.24015127048134313, 0.10829951867026134, -0.19775222979628745, -0.17345420582505472, 0.015444303279824174, 0.06720325777674244, 0.052844265931333505, -0.27049239624944266, 0.20540665179052572, 0.023495521868857807, 0.090997544361999, -0.13995481909245905, -0.0654268352260446, -0.11703668043262115, 0.05878549019286042, 0.08811370808678767, 0.04662095386803449, 0.14396024686386333, -0.08700470768771794, -0.036871988469068584, 0.41019588686444247, -0.10279543858606123, -0.07523766138257772, 0.2601793913415422, -0.19370762868886338, -0.11458657304484425, 0.16076843329385793, 0.22324354249141076, 0.12019183187589158, -0.16965178844185858, -0.03896393166917859, 0.07599502528956445, 0.1942548297386426, 0.05995022235812116, 0.0737424883702566, 0.3408286377624439, 0.16484147736150093, -0.038931555706110316, 0.04047435324088446, -0.15539759760221167, -0.07161876623158472, -0.23074989379757513, -0.04315978027268374, -0.032513445644957235, 0.08985038532919665, -0.13500301622780103, -0.1260863282874118, 0.359414815617195, 0.1263217329320389, 0.20382837132367232, 0.012932165696652755, 0.2462867760527743, 0.1441090977104911, 0.10555987896220963, 0.14670898912501704, 0.3384866604622263, 0.21703167089233924, 0.09097321347816147, -0.268435664233636, 0.041625201491380694, -0.0038624298435900985] |
1,802.01496 | Is Human Atrial Fibrillation Stochastic or Deterministic? | Atrial fibrillation (AF) is the most common cardiac arrhythmia in human
beings, and is associated with significant morbidity and mortality. The current
standard of care includes interventional catheter ablation in selected
patients, but the success rate is limited. The major limitation of the current
approach to AF is the lack of fundamental understanding of its underlying
mechanism. Specifically, it remains unclear whether human AF dynamics are a
deterministic or a stochastic process. Here we assess for determinism in human
AF by evaluating the properties of the symbolic representation of intracardiac
electrical recordings obtained from patients. Specifically, we evaluate (a) the
number of the missing ordinal patterns, (b) the rate of missing ordinal pattern
decay for increased length of the time series, and (c) the causal-entropy
complexity plane of the Bandt-Pompe symbolic representation. When used
together, these are powerful tools to detect determinism, even in the presence
of experimental noise and brief time series.
| q-bio.TO q-bio.NC | atrial fibrillation af is the most common cardiac arrhythmia in human beings and is associated with significant morbidity and mortality the current standard of care includes interventional catheter ablation in selected patients but the success rate is limited the major limitation of the current approach to af is the lack of fundamental understanding of its underlying mechanism specifically it remains unclear whether human af dynamics are a deterministic or a stochastic process here we assess for determinism in human af by evaluating the properties of the symbolic representation of intracardiac electrical recordings obtained from patients specifically we evaluate a the number of the missing ordinal patterns b the rate of missing ordinal pattern decay for increased length of the time series and c the causalentropy complexity plane of the bandtpompe symbolic representation when used together these are powerful tools to detect determinism even in the presence of experimental noise and brief time series | [['atrial', 'fibrillation', 'af', 'is', 'the', 'most', 'common', 'cardiac', 'arrhythmia', 'in', 'human', 'beings', 'and', 'is', 'associated', 'with', 'significant', 'morbidity', 'and', 'mortality', 'the', 'current', 'standard', 'of', 'care', 'includes', 'interventional', 'catheter', 'ablation', 'in', 'selected', 'patients', 'but', 'the', 'success', 'rate', 'is', 'limited', 'the', 'major', 'limitation', 'of', 'the', 'current', 'approach', 'to', 'af', 'is', 'the', 'lack', 'of', 'fundamental', 'understanding', 'of', 'its', 'underlying', 'mechanism', 'specifically', 'it', 'remains', 'unclear', 'whether', 'human', 'af', 'dynamics', 'are', 'a', 'deterministic', 'or', 'a', 'stochastic', 'process', 'here', 'we', 'assess', 'for', 'determinism', 'in', 'human', 'af', 'by', 'evaluating', 'the', 'properties', 'of', 'the', 'symbolic', 'representation', 'of', 'intracardiac', 'electrical', 'recordings', 'obtained', 'from', 'patients', 'specifically', 'we', 'evaluate', 'a', 'the', 'number', 'of', 'the', 'missing', 'ordinal', 'patterns', 'b', 'the', 'rate', 'of', 'missing', 'ordinal', 'pattern', 'decay', 'for', 'increased', 'length', 'of', 'the', 'time', 'series', 'and', 'c', 'the', 'causalentropy', 'complexity', 'plane', 'of', 'the', 'bandtpompe', 'symbolic', 'representation', 'when', 'used', 'together', 'these', 'are', 'powerful', 'tools', 'to', 'detect', 'determinism', 'even', 'in', 'the', 'presence', 'of', 'experimental', 'noise', 'and', 'brief', 'time', 'series']] | [-0.11842312209792956, 0.09019181720213965, -0.02750377462392575, 0.10836932838074781, -0.09084509291967965, -0.13700515139039213, 0.07377168678948165, 0.3627503481203396, -0.28455865448478634, -0.23881807606391559, 0.13069853661306152, -0.2784507674820672, -0.17672555374385984, 0.19943834047023157, -0.1186121652411346, 0.06147548554221621, 0.07275254581748557, 0.09708038528792952, 0.004403700577217694, -0.2365930985420403, 0.2674300643771666, 0.04343640379872676, 0.305251496346165, 0.0024236018683663325, 0.08716004129535959, 0.0028988474146708063, -0.06901583125344539, -0.024566029353177567, -0.07114706048052635, 0.12263085103998157, 0.30297254788456485, 0.20102117181216417, 0.32370684580191184, -0.4458092044070853, -0.21908469857819574, 0.10659732736990248, 0.11618560733940715, 0.08196864516694884, -0.005530941730524462, -0.2833686097476043, 0.129083473449818, -0.15519549206855068, -0.06777827707839224, -0.06334923867650918, 0.030673955576371793, -0.019257855880392815, -0.26773188942675724, 0.13763074212903648, 0.07420795624095358, 0.1652382766019161, -0.07890049243532733, -0.09316229265746906, 0.007187406001321506, 0.2146974786096268, 0.0970219271653868, 0.05858935074693842, 0.12994482415562839, -0.1762452513682882, -0.14661405122330362, 0.3426197211343893, 0.0072532414648632864, -0.15929762722685395, 0.22863519208074554, -0.16267629188185215, -0.11051814499507218, 0.1439618545057448, 0.16607685981733467, 0.060492056216676963, -0.16807353938977604, 0.013585843628358194, 0.04234621084699603, 0.1770406174749185, 0.042723839266201186, -0.0005208447232450309, 0.17060206558150975, 0.22860869408529988, -0.024384861348248944, 0.1023796742543039, -0.11754352115148274, -0.07332012020694827, -0.24077457045572564, -0.15135056623502782, -0.12657549372172644, 0.030475547909430276, -0.08360914439598625, -0.1734012036743623, 0.40842467899997964, 0.17202252222494663, 0.12588429820760594, 0.04502680367103925, 0.31523710567700236, 0.06853548706031258, 0.03481358673544539, 0.004621334998917423, 0.1639478509957706, 0.07136765096603133, 0.08197037107052701, -0.2843557430820319, 0.18670023805584365, 0.01911077233135553] |
1,802.01497 | High-resolution IR absorption spectroscopy of polycyclic aromatic
hydrocarbons in the 3 micron region: role of hydrogenation and alkylation | Aims. We aim to elucidate the spectral changes in the 3 micron region that
result from chemical changes in the molecular periphery of polycyclic aromatic
hydrocarbons (PAHs) with extra hydrogens (H-PAHs) and methyl groups (Me-PAHs).
Methods. Advanced laser spectroscopic techniques combined with mass
spectrometry were applied on supersonically cooled
1,2,3,4-tetrahydronaphthalene, 9,10-dihydroanthracene, 9,10-dihydrophenathrene,
1,2,3,6,7,8-hexahydropyrene, 9-methylanthracene, and 9,10-dimethylanthracene,
allowing us to record mass-selective and conformationally selective absorption
spectra of the aromatic, aliphatic, and alkyl CH-stretches in the 3.175-3.636
micron region with laser-limited resolution. We compared the experimental
absorption spectra with standard harmonic calculations and with second-order
vibrational perturbation theory anharmonic calculations that use the SPECTRO
program for treating resonances. Results. We show that anharmonicity plays an
important if not dominant role, affecting not only aromatic, but also aliphatic
and alkyl CH-stretch vibrations. The experimental high-resolution data lead to
the conclusion that the variation in Me- and H-PAHs composition might well
account for the observed variations in the 3 micron emission spectra of
carbon-rich and star-forming regions. Our laboratory studies also suggest that
heavily hydrogenated PAHs form a significant fraction of the carriers of IR
emission in regions in which an anomalously strong 3 micron plateau is
observed.
| astro-ph.GA | aims we aim to elucidate the spectral changes in the 3 micron region that result from chemical changes in the molecular periphery of polycyclic aromatic hydrocarbons pahs with extra hydrogens hpahs and methyl groups mepahs methods advanced laser spectroscopic techniques combined with mass spectrometry were applied on supersonically cooled 1234tetrahydronaphthalene 910dihydroanthracene 910dihydrophenathrene 123678hexahydropyrene 9methylanthracene and 910dimethylanthracene allowing us to record massselective and conformationally selective absorption spectra of the aromatic aliphatic and alkyl chstretches in the 31753636 micron region with laserlimited resolution we compared the experimental absorption spectra with standard harmonic calculations and with secondorder vibrational perturbation theory anharmonic calculations that use the spectro program for treating resonances results we show that anharmonicity plays an important if not dominant role affecting not only aromatic but also aliphatic and alkyl chstretch vibrations the experimental highresolution data lead to the conclusion that the variation in me and hpahs composition might well account for the observed variations in the 3 micron emission spectra of carbonrich and starforming regions our laboratory studies also suggest that heavily hydrogenated pahs form a significant fraction of the carriers of ir emission in regions in which an anomalously strong 3 micron plateau is observed | [['aims', 'we', 'aim', 'to', 'elucidate', 'the', 'spectral', 'changes', 'in', 'the', '3', 'micron', 'region', 'that', 'result', 'from', 'chemical', 'changes', 'in', 'the', 'molecular', 'periphery', 'of', 'polycyclic', 'aromatic', 'hydrocarbons', 'pahs', 'with', 'extra', 'hydrogens', 'hpahs', 'and', 'methyl', 'groups', 'mepahs', 'methods', 'advanced', 'laser', 'spectroscopic', 'techniques', 'combined', 'with', 'mass', 'spectrometry', 'were', 'applied', 'on', 'supersonically', 'cooled', '1234tetrahydronaphthalene', '910dihydroanthracene', '910dihydrophenathrene', '123678hexahydropyrene', '9methylanthracene', 'and', '910dimethylanthracene', 'allowing', 'us', 'to', 'record', 'massselective', 'and', 'conformationally', 'selective', 'absorption', 'spectra', 'of', 'the', 'aromatic', 'aliphatic', 'and', 'alkyl', 'chstretches', 'in', 'the', '31753636', 'micron', 'region', 'with', 'laserlimited', 'resolution', 'we', 'compared', 'the', 'experimental', 'absorption', 'spectra', 'with', 'standard', 'harmonic', 'calculations', 'and', 'with', 'secondorder', 'vibrational', 'perturbation', 'theory', 'anharmonic', 'calculations', 'that', 'use', 'the', 'spectro', 'program', 'for', 'treating', 'resonances', 'results', 'we', 'show', 'that', 'anharmonicity', 'plays', 'an', 'important', 'if', 'not', 'dominant', 'role', 'affecting', 'not', 'only', 'aromatic', 'but', 'also', 'aliphatic', 'and', 'alkyl', 'chstretch', 'vibrations', 'the', 'experimental', 'highresolution', 'data', 'lead', 'to', 'the', 'conclusion', 'that', 'the', 'variation', 'in', 'me', 'and', 'hpahs', 'composition', 'might', 'well', 'account', 'for', 'the', 'observed', 'variations', 'in', 'the', '3', 'micron', 'emission', 'spectra', 'of', 'carbonrich', 'and', 'starforming', 'regions', 'our', 'laboratory', 'studies', 'also', 'suggest', 'that', 'heavily', 'hydrogenated', 'pahs', 'form', 'a', 'significant', 'fraction', 'of', 'the', 'carriers', 'of', 'ir', 'emission', 'in', 'regions', 'in', 'which', 'an', 'anomalously', 'strong', '3', 'micron', 'plateau', 'is', 'observed']] | [-0.031082336050471046, 0.10783794564645927, -0.05003609102741293, 0.0324295061227231, -0.01190372721732154, -0.11518099308935004, 0.04372955998597708, 0.4695940349906028, -0.21186784431235967, -0.28893536938211095, 0.008199318839815332, -0.31865376497076436, -0.08649271369942434, 0.13669961113431542, -0.013586794919459723, -0.049526424608372435, 0.05188189508300019, -0.13094947497350173, 0.046532573543007966, -0.18779223740668866, 0.23614438542594704, 0.12543166935914657, 0.22827894718560215, 0.10311495825094376, 0.004908685800798524, -0.073793849224675, -0.04860969697212248, -0.027977856515732768, -0.15193991079274213, 0.14278345284825203, 0.29597843840595456, -0.012570478344479432, 0.17806051518757837, -0.4158859223480449, -0.22726904421246477, 0.06271470266721815, 0.162595181326781, 0.11420124299647696, -0.057927924004296395, -0.24165577354462264, 0.040567108180187134, -0.11969860820713771, -0.12781494739209556, -0.04524991490013365, 0.020244797852253645, 0.02075377876542836, -0.22095436235419014, 0.1017180308645238, 0.02300877898872656, 0.12255759653563363, -0.1541052996244916, -0.16510173932560923, -0.09452054062909396, 0.0885791442725439, 0.030923699815552888, -0.01890107076154551, 0.24869147960575053, -0.09340527417089606, -0.04777821188326925, 0.41542390197679235, -0.16016702707421934, -0.028317790695947115, 0.26018270412920513, -0.19962422526185655, -0.20552167443447916, 0.26084599262717495, 0.09036363195883786, 0.12278540179921457, -0.11354696162167814, 0.02230354800697539, -0.006823662713881336, 0.26798862055107786, 0.08290029818621966, 0.12015843813967697, 0.22467862706373007, 0.10641128124520796, -0.02201733947219839, 0.1271753541518842, -0.19222354655445728, -0.008419745484019046, -0.2348763212820024, -0.14380455347658186, -0.1262412586730424, 0.04239356685650489, -0.06707953409852133, -0.12494043119195439, 0.3205489052541472, 0.10111561832836942, 0.17134331754193857, -0.017065430553195034, 0.28120368451985356, 0.03737270955129394, 0.15411103424708267, 0.024977709481410763, 0.27247660178601596, 0.167521748186478, 0.08657299692084972, -0.2969649497420875, 0.07224948380582526, -0.01803953801077064] |
1,802.01498 | Investigations on a bi-chiral scalar field | Chiral boson fields in (1+1) dimensions obey a first order equation of
motion. A second order equation which classically describes two chiral boson
fields of the same chirality leads, however, to an unacceptable quantum theory
| hep-th | chiral boson fields in 11 dimensions obey a first order equation of motion a second order equation which classically describes two chiral boson fields of the same chirality leads however to an unacceptable quantum theory | [['chiral', 'boson', 'fields', 'in', '11', 'dimensions', 'obey', 'a', 'first', 'order', 'equation', 'of', 'motion', 'a', 'second', 'order', 'equation', 'which', 'classically', 'describes', 'two', 'chiral', 'boson', 'fields', 'of', 'the', 'same', 'chirality', 'leads', 'however', 'to', 'an', 'unacceptable', 'quantum', 'theory']] | [-0.19658816242590546, 0.2691147617367928, -0.07851701168609516, 0.05720180964895657, -0.11332296654582023, -0.14604131720427957, -0.04840907495069716, 0.2551775003384267, -0.20268502581332412, -0.2648910703403609, -0.014973259747161396, -0.25168859506292, -0.14647784743990216, 0.07677743115595409, 0.008168798844729151, 0.10089453059647764, -0.05539788959015693, 0.12399148941040039, -0.04623039583010333, -0.2725762542337179, 0.30144966586626004, -0.10565382565837353, 0.27591921484896115, -0.004506348392793111, 0.16349564357660712, 0.0009425481664948165, 0.07001864510987486, -0.018645519656794413, -0.09456194383757455, 0.08258972056210041, 0.181241315204118, -0.0809712588986648, 0.2115894255760525, -0.4192815884681685, -0.18009734121816498, 0.05937956493081791, 0.17055609098502567, 0.2176454821468464, -0.04228313480104719, -0.3027356233979974, 0.05315460199490189, -0.190437146941466, -0.21468994840979577, -0.0967573085400675, -0.041209589024739604, -0.0918876735127664, -0.2868626392313412, 0.1607742464435952, 0.0705566433724016, 0.022669560834765436, -0.06443923596026642, -0.04247098726419998, -0.022993453592061997, 0.06342037779146008, 0.09735559839755296, 0.05423517233825156, 0.06343291432463698, -0.24184596541204623, -0.22988247251404184, 0.4540263452700206, -0.06706715700482684, -0.21524567854191576, 0.15859951501978295, -0.1569225319794246, -0.12910444110498898, 0.16428097477847978, 0.15337443756205696, 0.10394566655158996, -0.20749100276402066, 0.1611597828567028, 0.009808760242802757, 0.2140310485381633, 0.10141824276319572, 0.025605430001659053, 0.24492139563496623, 0.08261469560010093, 0.05290819025997605, 0.06745041361344713, -0.018334408503557956, -0.21543067526072263, -0.41302513714347566, -0.21319739744067193, -0.15274132708353655, 0.09528298056019203, -0.07380710054588105, -0.18278534412384034, 0.37468568837004046, 0.18400205565350397, 0.1907954175823501, -0.040312485952329426, 0.23204050117305347, 0.21703160405158997, 0.08860499528901918, 0.022684445870774134, 0.2570598781108856, 0.25806213351232665, 0.1236218975590808, -0.2068053448381501, -0.11400654484917011, 0.135974198553179] |
1,802.01499 | An extreme function which is nonnegative and discontinuous everywhere | We consider Gomory and Johnson's infinite group model with a single row.
Valid inequalities for this model are expressed by valid functions and it has
been recently shown that any valid function is dominated by some nonnegative
valid function, modulo the affine hull of the model. Within the set of
nonnegative valid functions, extreme functions are the ones that cannot be
expressed as convex combinations of two distinct valid functions. In this paper
we construct an extreme function $\pi:\mathbb{R} \to [0,1]$ whose graph is
dense in $\mathbb{R} \times [0,1]$. Therefore, $\pi$ is discontinuous
everywhere.
| math.OC math.FA | we consider gomory and johnsons infinite group model with a single row valid inequalities for this model are expressed by valid functions and it has been recently shown that any valid function is dominated by some nonnegative valid function modulo the affine hull of the model within the set of nonnegative valid functions extreme functions are the ones that cannot be expressed as convex combinations of two distinct valid functions in this paper we construct an extreme function pimathbbr to 01 whose graph is dense in mathbbr times 01 therefore pi is discontinuous everywhere | [['we', 'consider', 'gomory', 'and', 'johnsons', 'infinite', 'group', 'model', 'with', 'a', 'single', 'row', 'valid', 'inequalities', 'for', 'this', 'model', 'are', 'expressed', 'by', 'valid', 'functions', 'and', 'it', 'has', 'been', 'recently', 'shown', 'that', 'any', 'valid', 'function', 'is', 'dominated', 'by', 'some', 'nonnegative', 'valid', 'function', 'modulo', 'the', 'affine', 'hull', 'of', 'the', 'model', 'within', 'the', 'set', 'of', 'nonnegative', 'valid', 'functions', 'extreme', 'functions', 'are', 'the', 'ones', 'that', 'can', 'not', 'be', 'expressed', 'as', 'convex', 'combinations', 'of', 'two', 'distinct', 'valid', 'functions', 'in', 'this', 'paper', 'we', 'construct', 'an', 'extreme', 'function', 'pimathbbr', 'to', '01', 'whose', 'graph', 'is', 'dense', 'in', 'mathbbr', 'times', '01', 'therefore', 'pi', 'is', 'discontinuous', 'everywhere']] | [-0.10910494771087542, 0.12609608733591232, -0.061928352975147836, 0.08545187688952788, -0.03143217470100586, -0.15432526200435104, -0.0010427485363795719, 0.3723398983637069, -0.28928281305397446, -0.20124826542636814, 0.11725170893763054, -0.26298111857489703, -0.16474915425382317, 0.17637569066186615, -0.06578367090774105, 0.08909726237997095, -0.00886039892607864, 0.030283996290428206, -0.09956052899360657, -0.24206142999297453, 0.3218945668059144, -0.0718958936334449, 0.19069135884576022, 0.050696197327503814, 0.13863401807487963, 0.032630136053256216, -0.0068594040479164255, 0.05110995133129999, -0.09860352818693773, 0.05790012280278383, 0.286622119948585, 0.15404993930999983, 0.277484693614013, -0.3992436030641832, -0.18513306549334146, 0.20668209305508656, 0.14484411629134827, -0.008397876507939493, 0.004760888405144215, -0.21763059086701336, 0.1290501195050657, -0.16655635284854375, -0.1477668044068157, -0.08201266501217763, 0.07596852111214018, 0.045189095462890384, -0.34052601657272813, 0.08310784174604936, 0.06669189275286973, 0.01931773533455116, -0.07022126950323582, -0.1712354106749309, 0.021915918842770478, 0.07761446360815713, -0.006844860293525964, 0.11931986221052865, 0.07580413864529197, -0.041512198632265976, -0.07912032533080336, 0.3693500371412077, -0.05766967433366053, -0.3034989462887987, 0.1458325476108238, -0.18837928963191014, -0.1493532714790645, 0.11373750382955088, 0.11528564730171173, 0.19730677703355856, -0.16210392028331122, 0.16195846127935665, -0.12426317569383598, 0.12406790028623443, 0.06971366247013608, 0.0004380973095589496, 0.16751642500426858, 0.057836641537699296, 0.07542942635259255, 0.14972460110290373, 0.049244777220202256, -0.07437824949057416, -0.37092531676542884, -0.09427301068183411, -0.2211943596324071, 0.044828483322294714, -0.12453957811026448, -0.21461359639323882, 0.35622780714580354, 0.07055669728210791, 0.18385689224096688, 0.13419070132968433, 0.22096279695471552, 0.21684344593163685, 0.07665629535566698, 0.0912417159366243, 0.16205798457234236, 0.09748017192729055, -0.025191611332937756, -0.06931195922314803, 0.10424056423560499, 0.10603441964795297] |
1,802.015 | Exploring Spatial Context for 3D Semantic Segmentation of Point Clouds | Deep learning approaches have made tremendous progress in the field of
semantic segmentation over the past few years. However, most current approaches
operate in the 2D image space. Direct semantic segmentation of unstructured 3D
point clouds is still an open research problem. The recently proposed PointNet
architecture presents an interesting step ahead in that it can operate on
unstructured point clouds, achieving encouraging segmentation results. However,
it subdivides the input points into a grid of blocks and processes each such
block individually. In this paper, we investigate the question how such an
architecture can be extended to incorporate larger-scale spatial context. We
build upon PointNet and propose two extensions that enlarge the receptive field
over the 3D scene. We evaluate the proposed strategies on challenging indoor
and outdoor datasets and show improved results in both scenarios.
| cs.CV | deep learning approaches have made tremendous progress in the field of semantic segmentation over the past few years however most current approaches operate in the 2d image space direct semantic segmentation of unstructured 3d point clouds is still an open research problem the recently proposed pointnet architecture presents an interesting step ahead in that it can operate on unstructured point clouds achieving encouraging segmentation results however it subdivides the input points into a grid of blocks and processes each such block individually in this paper we investigate the question how such an architecture can be extended to incorporate largerscale spatial context we build upon pointnet and propose two extensions that enlarge the receptive field over the 3d scene we evaluate the proposed strategies on challenging indoor and outdoor datasets and show improved results in both scenarios | [['deep', 'learning', 'approaches', 'have', 'made', 'tremendous', 'progress', 'in', 'the', 'field', 'of', 'semantic', 'segmentation', 'over', 'the', 'past', 'few', 'years', 'however', 'most', 'current', 'approaches', 'operate', 'in', 'the', '2d', 'image', 'space', 'direct', 'semantic', 'segmentation', 'of', 'unstructured', '3d', 'point', 'clouds', 'is', 'still', 'an', 'open', 'research', 'problem', 'the', 'recently', 'proposed', 'pointnet', 'architecture', 'presents', 'an', 'interesting', 'step', 'ahead', 'in', 'that', 'it', 'can', 'operate', 'on', 'unstructured', 'point', 'clouds', 'achieving', 'encouraging', 'segmentation', 'results', 'however', 'it', 'subdivides', 'the', 'input', 'points', 'into', 'a', 'grid', 'of', 'blocks', 'and', 'processes', 'each', 'such', 'block', 'individually', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'question', 'how', 'such', 'an', 'architecture', 'can', 'be', 'extended', 'to', 'incorporate', 'largerscale', 'spatial', 'context', 'we', 'build', 'upon', 'pointnet', 'and', 'propose', 'two', 'extensions', 'that', 'enlarge', 'the', 'receptive', 'field', 'over', 'the', '3d', 'scene', 'we', 'evaluate', 'the', 'proposed', 'strategies', 'on', 'challenging', 'indoor', 'and', 'outdoor', 'datasets', 'and', 'show', 'improved', 'results', 'in', 'both', 'scenarios']] | [-0.06546135628869866, 0.004765129664733917, -0.030388267394086784, 0.027891738573089242, -0.07685043636593036, -0.11773264701546662, 0.005621416260563659, 0.48338761498384614, -0.2593743227095247, -0.32318938376984613, 0.09562704069385826, -0.22370113786446916, -0.18915782722144606, 0.20858298166293773, -0.14087190168827554, 0.06579942975462044, 0.13278626447872205, 0.006202517214285976, -0.05753249295316089, -0.3090783673653598, 0.29568264577948655, 0.03583493813515387, 0.35132157021914334, 0.05658229746554485, 0.13952899744617753, -0.055521372692002094, -0.054173819106140664, 0.0010801486691086799, -0.07655897376442976, 0.1530858966815525, 0.3314001800471862, 0.17888427719299216, 0.3015149713576059, -0.4795951930303572, -0.2918350233042421, 0.06670794168980244, 0.20356400494518526, 0.10951212450259738, -0.06611281004926936, -0.3531256275703473, 0.07898558915236636, -0.14370768976753906, -0.021586369675145867, -0.10153344488678746, -0.008746996279703179, -0.057569183174671384, -0.24318237245247207, -0.02972213988473146, 0.07624137043475297, 0.05845142047003131, -0.06275816751911086, -0.11535685697419788, 0.06579683010247261, 0.20138539766605176, 0.0030876711329363067, 0.08447668670936871, 0.1443619006600142, -0.1987974199851926, -0.13444490517106125, 0.364407332477105, -0.01958293077768758, -0.21344000114870998, 0.22050346436855547, -0.05460672485231258, -0.1684425227165989, 0.1009451591731597, 0.2428922099266749, 0.11908566105001442, -0.14315953315235674, 0.06812350919148337, -0.08777216164162382, 0.15035392606574427, 0.055219052410821486, 0.0053361320032683365, 0.24315824749646708, 0.27234738834394034, 0.08353824998972842, 0.1104429767369498, -0.15026578602641272, -0.1082270568175077, -0.19167550377931228, -0.12833439330964158, -0.15418883786632626, -0.04726821070310988, -0.09748939843698548, -0.13814489941989236, 0.3918504034757943, 0.2930792677421671, 0.21917167161454393, 0.02022973692510277, 0.3554511737217099, 0.015563599349287175, 0.12146807946127784, 0.10577479627510697, 0.1822015496676185, -0.0011314350241959533, 0.13980510301018298, -0.12634300548234023, 0.028685793344801126, 0.05545003352316973] |
1,802.01501 | Renormalization, Conformal Ward Identities and the Origin of a Conformal
Anomaly Pole | We investigate the emergence of a conformal anomaly pole in conformal field
theories in the case of the $TJJ$ correlator. We show how it comes to be
generated in dimensional renormalization, using a basis of 13 form factors (the
$F$-basis), where only one of them requires renormalization $(F_{13})$,
extending previous studies. We then combine recent results on the structure of
the non-perturbative solutions of the conformal Ward identities (CWI's) for the
$TJJ$ in momentum space, expressed in terms of a minimal set of 4 form factors
($A-$ basis), with the properties of the $F$-basis, and show how the singular
behaviour of the corresponding form factors in both basis can be related. The
result proves the centrality of such massless effective interactions induced by
the anomaly, which have recently found realization in solid state, in the
theory of topological insulators and of Weyl semimetals. This pattern is
confirmed in massless abelian and nonabelian theories (QED and QCD)
investigated at one-loop.
| hep-th cond-mat.str-el hep-ph | we investigate the emergence of a conformal anomaly pole in conformal field theories in the case of the tjj correlator we show how it comes to be generated in dimensional renormalization using a basis of 13 form factors the fbasis where only one of them requires renormalization f_13 extending previous studies we then combine recent results on the structure of the nonperturbative solutions of the conformal ward identities cwis for the tjj in momentum space expressed in terms of a minimal set of 4 form factors a basis with the properties of the fbasis and show how the singular behaviour of the corresponding form factors in both basis can be related the result proves the centrality of such massless effective interactions induced by the anomaly which have recently found realization in solid state in the theory of topological insulators and of weyl semimetals this pattern is confirmed in massless abelian and nonabelian theories qed and qcd investigated at oneloop | [['we', 'investigate', 'the', 'emergence', 'of', 'a', 'conformal', 'anomaly', 'pole', 'in', 'conformal', 'field', 'theories', 'in', 'the', 'case', 'of', 'the', 'tjj', 'correlator', 'we', 'show', 'how', 'it', 'comes', 'to', 'be', 'generated', 'in', 'dimensional', 'renormalization', 'using', 'a', 'basis', 'of', '13', 'form', 'factors', 'the', 'fbasis', 'where', 'only', 'one', 'of', 'them', 'requires', 'renormalization', 'f_13', 'extending', 'previous', 'studies', 'we', 'then', 'combine', 'recent', 'results', 'on', 'the', 'structure', 'of', 'the', 'nonperturbative', 'solutions', 'of', 'the', 'conformal', 'ward', 'identities', 'cwis', 'for', 'the', 'tjj', 'in', 'momentum', 'space', 'expressed', 'in', 'terms', 'of', 'a', 'minimal', 'set', 'of', '4', 'form', 'factors', 'a', 'basis', 'with', 'the', 'properties', 'of', 'the', 'fbasis', 'and', 'show', 'how', 'the', 'singular', 'behaviour', 'of', 'the', 'corresponding', 'form', 'factors', 'in', 'both', 'basis', 'can', 'be', 'related', 'the', 'result', 'proves', 'the', 'centrality', 'of', 'such', 'massless', 'effective', 'interactions', 'induced', 'by', 'the', 'anomaly', 'which', 'have', 'recently', 'found', 'realization', 'in', 'solid', 'state', 'in', 'the', 'theory', 'of', 'topological', 'insulators', 'and', 'of', 'weyl', 'semimetals', 'this', 'pattern', 'is', 'confirmed', 'in', 'massless', 'abelian', 'and', 'nonabelian', 'theories', 'qed', 'and', 'qcd', 'investigated', 'at', 'oneloop']] | [-0.16532072667091055, 0.16097213063058122, -0.09065999077455837, 0.0512934536350973, -0.05461230605500955, -0.07237401232709112, 0.009116232675593932, 0.3073987271255995, -0.20705715590888787, -0.24215606027927086, 0.06393424887283349, -0.2838765357872881, -0.19806767871995815, 0.1405026857527383, 0.018435525839691453, 0.053523052996317357, -0.004982711477849468, 0.07429886568607118, -0.10437411646967835, -0.2451114806818114, 0.36439134085363467, -0.004272462548278038, 0.26995384308828757, 0.09878229457920171, 0.07505580823306206, 0.004135156373212219, -0.038039405118533466, 0.04235818851486569, -0.10029792992116988, 0.11214587695416321, 0.24040299493112197, 0.046891958871563465, 0.17256830469412296, -0.4103651163548981, -0.19938691807383635, 0.03984567513337956, 0.1408511511234672, 0.10368197427626184, -0.03687783441602973, -0.284329499675945, 0.08147046745479482, -0.18758007055207057, -0.17321583165336144, -0.12105237766397449, -0.017181517218778485, -0.06761220391582018, -0.24762264759105532, 0.07947278286549321, 0.012755766729150646, 0.06539399412888214, -0.0487779451112421, -0.10042367362836083, -0.028325065012740076, 0.1073729443076834, 0.09967018045783746, 0.05088361224112739, 0.0813353866420733, -0.213049657800121, -0.16609685201748456, 0.4041772868159174, -0.0794070669795451, -0.21023087784554223, 0.14273959313630588, -0.1835175915357639, -0.1696763662621379, 0.08081959282434634, 0.1187102456252038, 0.12304383946242947, -0.13041706341091813, 0.17406551747395416, -0.06743510912096351, 0.09289082979092246, 0.07332531395573286, 0.043791264793454854, 0.18992201471994133, 0.09854402100087477, 0.0021645409192702493, 0.13775449090947708, 0.00305078330624749, -0.07478414725039283, -0.3620089349254919, -0.18085148884788882, -0.1626696351523154, 0.09029644525041745, -0.09858647640318603, -0.1657260397504781, 0.4263423303502418, 0.13472246040662225, 0.19846792412781208, 0.004264607190142778, 0.2038447322241915, 0.14359758246359458, 0.12588330309211318, 0.0577188892225565, 0.2449208537977681, 0.15845212374474127, 0.04504449486969707, -0.23618010762176891, -0.039545499740180165, 0.14431567261663247] |
1,802.01502 | Vectorized Calculation of Short Circuit Currents Considering Distributed
Generation - An Open Source Implementation of IEC 60909 | An important task in grid planning is to ensure that faults in the grid are
detected and cut off without damage in any grid element. Calculating short
circuit currents is therefore a vital grid analysis functionality for grid
planning applications. The standard IEC 60909 provides guidelines for short
circuit calculations and is routinely applied in grid planning applications.
This paper presents a method for the vectorized calculation of short circuit
currents according to IEC 60909. Distributed generation units are considered
according to the latest revision of the standard. The method is implemented in
the python based open source tool pandapower and validated against commercial
software and examples from literature. The implementation presented in this
paper is the first comprehensive implementation of the IEC 60909 standard which
is available under an open source license. It can be used to evaluate fault
currents in grid studies with a high degree of automation and is shown to scale
well for large grids. Its practical applicability is shown in a case study with
a real MV grid with a high degree of DG penetration.
| cs.CE | an important task in grid planning is to ensure that faults in the grid are detected and cut off without damage in any grid element calculating short circuit currents is therefore a vital grid analysis functionality for grid planning applications the standard iec 60909 provides guidelines for short circuit calculations and is routinely applied in grid planning applications this paper presents a method for the vectorized calculation of short circuit currents according to iec 60909 distributed generation units are considered according to the latest revision of the standard the method is implemented in the python based open source tool pandapower and validated against commercial software and examples from literature the implementation presented in this paper is the first comprehensive implementation of the iec 60909 standard which is available under an open source license it can be used to evaluate fault currents in grid studies with a high degree of automation and is shown to scale well for large grids its practical applicability is shown in a case study with a real mv grid with a high degree of dg penetration | [['an', 'important', 'task', 'in', 'grid', 'planning', 'is', 'to', 'ensure', 'that', 'faults', 'in', 'the', 'grid', 'are', 'detected', 'and', 'cut', 'off', 'without', 'damage', 'in', 'any', 'grid', 'element', 'calculating', 'short', 'circuit', 'currents', 'is', 'therefore', 'a', 'vital', 'grid', 'analysis', 'functionality', 'for', 'grid', 'planning', 'applications', 'the', 'standard', 'iec', '60909', 'provides', 'guidelines', 'for', 'short', 'circuit', 'calculations', 'and', 'is', 'routinely', 'applied', 'in', 'grid', 'planning', 'applications', 'this', 'paper', 'presents', 'a', 'method', 'for', 'the', 'vectorized', 'calculation', 'of', 'short', 'circuit', 'currents', 'according', 'to', 'iec', '60909', 'distributed', 'generation', 'units', 'are', 'considered', 'according', 'to', 'the', 'latest', 'revision', 'of', 'the', 'standard', 'the', 'method', 'is', 'implemented', 'in', 'the', 'python', 'based', 'open', 'source', 'tool', 'pandapower', 'and', 'validated', 'against', 'commercial', 'software', 'and', 'examples', 'from', 'literature', 'the', 'implementation', 'presented', 'in', 'this', 'paper', 'is', 'the', 'first', 'comprehensive', 'implementation', 'of', 'the', 'iec', '60909', 'standard', 'which', 'is', 'available', 'under', 'an', 'open', 'source', 'license', 'it', 'can', 'be', 'used', 'to', 'evaluate', 'fault', 'currents', 'in', 'grid', 'studies', 'with', 'a', 'high', 'degree', 'of', 'automation', 'and', 'is', 'shown', 'to', 'scale', 'well', 'for', 'large', 'grids', 'its', 'practical', 'applicability', 'is', 'shown', 'in', 'a', 'case', 'study', 'with', 'a', 'real', 'mv', 'grid', 'with', 'a', 'high', 'degree', 'of', 'dg', 'penetration']] | [-0.11160566175482624, 0.020346028769240042, -0.019590498743410636, 0.028645353197741013, -0.06021388282275034, -0.15107852057424478, 0.02571161764814557, 0.41141288162519535, -0.23277803071412362, -0.32617042906996274, 0.1491701569356438, -0.22514803297559005, -0.09016171998939373, 0.27192149994920733, -0.10601278297350897, 0.08881108493304864, 0.0991726036512571, -0.021979456374214754, 0.0040734463932393635, -0.20758662160822294, 0.2207033702385767, 0.09717370951030817, 0.32566201971559267, 0.10291375395706079, 0.057794094561702675, -0.010788738862093953, -0.04751684393268078, 0.019480185962796288, -0.05359034808890202, 0.1346681002048879, 0.286868923695551, 0.13371069476577557, 0.2638186357035819, -0.4474811693756945, -0.18232513125921185, 0.051564024496150926, 0.11100233618894385, 0.09276956829772745, -0.05121956531527556, -0.22323841731348593, 0.13544402058081081, -0.21382369924637412, -0.1213305364569856, -0.06622916096304025, 0.02316721981494791, 0.05197393384943199, -0.29419368896633386, -0.032512188705408736, 0.016777699001573235, 0.1126106633995126, -0.004714502813941281, -0.1088743440185984, 0.00980524172514884, 0.1417964279367071, -0.01614807933672435, 0.05531663523288444, 0.12498325136095648, -0.08532388845758558, -0.14032310217929383, 0.4261764334928658, -0.02150091799493465, -0.2136228180613317, 0.15084181266494043, -0.04556649652982338, -0.13065804803174816, 0.07945549719863468, 0.1903049193904735, 0.10279647446134024, -0.21093071339871838, 0.10868039653319607, 0.04746776632770586, 0.18761313683224015, -0.0028714395231670803, -0.04427201942437225, 0.18308827660124127, 0.2578273227671161, 0.06925165655815767, 0.1603602406665838, -0.06187760315111114, -0.10166048214822594, -0.2990371665192975, -0.15164642565262815, -0.1764729695394635, -0.0068133892924783545, -0.04893081848107007, -0.20384241949553447, 0.409744301215849, 0.20830599116678866, 0.08372716630239868, 0.025534947351681898, 0.3763425802191099, 0.10193277140044504, 0.10902197771550466, 0.10518690326684413, 0.16126973330457178, 0.07381522328230655, 0.14102556960553758, -0.17412391266940783, 0.07047537968545738, 0.03026048149396148] |
1,802.01503 | Motivic Chern classes and K-theoretic stable envelopes | We study a K-theoretic characteristic class of singular varieties, namely the
equivariant motivic Chern class. We prove that the motivic Chern class is
characterized by an axiom system inspired by that of "K-theoretic stable
envelopes," recently defined by Okounkov and studied in relation with quantum
group actions on the K-theory algebra of moduli spaces. We also give explicit
formulas for the equivariant motivic Chern classes of Schubert cells and matrix
Schubert cells. Lastly, we calculate the equivariant motivic Chern class of the
orbits of the A2 quiver representation, which yields formulas for the motivic
Chern classes of determinantal varieties and more general degeneracy loci.
| math.AG | we study a ktheoretic characteristic class of singular varieties namely the equivariant motivic chern class we prove that the motivic chern class is characterized by an axiom system inspired by that of ktheoretic stable envelopes recently defined by okounkov and studied in relation with quantum group actions on the ktheory algebra of moduli spaces we also give explicit formulas for the equivariant motivic chern classes of schubert cells and matrix schubert cells lastly we calculate the equivariant motivic chern class of the orbits of the a2 quiver representation which yields formulas for the motivic chern classes of determinantal varieties and more general degeneracy loci | [['we', 'study', 'a', 'ktheoretic', 'characteristic', 'class', 'of', 'singular', 'varieties', 'namely', 'the', 'equivariant', 'motivic', 'chern', 'class', 'we', 'prove', 'that', 'the', 'motivic', 'chern', 'class', 'is', 'characterized', 'by', 'an', 'axiom', 'system', 'inspired', 'by', 'that', 'of', 'ktheoretic', 'stable', 'envelopes', 'recently', 'defined', 'by', 'okounkov', 'and', 'studied', 'in', 'relation', 'with', 'quantum', 'group', 'actions', 'on', 'the', 'ktheory', 'algebra', 'of', 'moduli', 'spaces', 'we', 'also', 'give', 'explicit', 'formulas', 'for', 'the', 'equivariant', 'motivic', 'chern', 'classes', 'of', 'schubert', 'cells', 'and', 'matrix', 'schubert', 'cells', 'lastly', 'we', 'calculate', 'the', 'equivariant', 'motivic', 'chern', 'class', 'of', 'the', 'orbits', 'of', 'the', 'a2', 'quiver', 'representation', 'which', 'yields', 'formulas', 'for', 'the', 'motivic', 'chern', 'classes', 'of', 'determinantal', 'varieties', 'and', 'more', 'general', 'degeneracy', 'loci']] | [-0.23328364903192358, 0.062999700139139, -0.09386341237964538, 0.12900649597353409, -0.0718080524283533, -0.18195123558129686, 0.01947563984252226, 0.2835533539048181, -0.33607984398706603, -0.1678806527858027, 0.036682068643410906, -0.1336738529683386, -0.25890654241308, 0.20054897271060887, -0.2576331708458803, 0.025397692520457964, 0.017558561217111465, -0.005208472552252575, -0.14001650643051386, -0.2993222585291033, 0.5442922241412677, -0.08888429183571134, 0.22041350465196258, 0.03733928485486943, 0.10901244109174094, -0.029023548516516503, -0.0061899559446968715, -0.039802908503378816, -0.1724902422604198, 0.190497521519249, 0.3872738180574603, -0.0003497693127988336, 0.13425000969660827, -0.3633949521105163, -0.07039873292580104, 0.21003856225154147, 0.09029123613772054, 0.037179286371191174, 0.040600114016622404, -0.30258471958446675, 0.11188507785286325, -0.2429434996760952, -0.19315670714982283, -0.17161433034477971, 0.1287897274876461, 0.03622285802982962, -0.20137832928090715, -0.062416816455179984, 0.05340886025582082, 0.21509736022338843, -0.1420065428291519, -0.11728829554004523, -0.11270735098290831, 0.06882507136861722, 0.009973464540402906, -0.03672130893280085, 0.11749184502808091, -0.10553924741655535, -0.19076884821809542, 0.35590768711363824, -0.02864470233236296, -0.19690388005871612, 0.04831751379578446, -0.15562304772006777, -0.22647700753385344, 0.180818539354592, -0.009603775969970649, 0.23633117493815148, 0.09027037884348268, 0.16646277682257976, -0.15793818190622216, -0.0019700086447231183, 0.11826783435669942, 0.04576999892742606, 0.17489606085627413, 0.010649797748416089, 0.020099499915466786, 0.16821063224387428, -0.013888954231963279, -0.10293750916417384, -0.3246233519524909, -0.29025591185423905, -0.12544042086049628, 0.21256743814312637, -0.11682986384753, -0.19880442915018648, 0.4663773777249914, 0.018654386718900733, 0.1486948160902382, 0.26042938688344575, 0.1890771441304913, 0.0834181460713108, 0.04889557915269576, -0.04651194436995026, 0.11860647708034286, 0.2763605248093462, -0.00808404249479421, -0.14066567197173405, -0.04024753841132714, 0.36458736470488545] |
1,802.01504 | Linear Convergence of the Primal-Dual Gradient Method for Convex-Concave
Saddle Point Problems without Strong Convexity | We consider the convex-concave saddle point problem $\min_{x}\max_{y}
f(x)+y^\top A x-g(y)$ where $f$ is smooth and convex and $g$ is smooth and
strongly convex. We prove that if the coupling matrix $A$ has full column rank,
the vanilla primal-dual gradient method can achieve linear convergence even if
$f$ is not strongly convex. Our result generalizes previous work which either
requires $f$ and $g$ to be quadratic functions or requires proximal mappings
for both $f$ and $g$. We adopt a novel analysis technique that in each
iteration uses a "ghost" update as a reference, and show that the iterates in
the primal-dual gradient method converge to this "ghost" sequence. Using the
same technique we further give an analysis for the primal-dual stochastic
variance reduced gradient (SVRG) method for convex-concave saddle point
problems with a finite-sum structure.
| math.OC cs.LG stat.ML | we consider the convexconcave saddle point problem min_xmax_y fxytop a xgy where f is smooth and convex and g is smooth and strongly convex we prove that if the coupling matrix a has full column rank the vanilla primaldual gradient method can achieve linear convergence even if f is not strongly convex our result generalizes previous work which either requires f and g to be quadratic functions or requires proximal mappings for both f and g we adopt a novel analysis technique that in each iteration uses a ghost update as a reference and show that the iterates in the primaldual gradient method converge to this ghost sequence using the same technique we further give an analysis for the primaldual stochastic variance reduced gradient svrg method for convexconcave saddle point problems with a finitesum structure | [['we', 'consider', 'the', 'convexconcave', 'saddle', 'point', 'problem', 'min_xmax_y', 'fxytop', 'a', 'xgy', 'where', 'f', 'is', 'smooth', 'and', 'convex', 'and', 'g', 'is', 'smooth', 'and', 'strongly', 'convex', 'we', 'prove', 'that', 'if', 'the', 'coupling', 'matrix', 'a', 'has', 'full', 'column', 'rank', 'the', 'vanilla', 'primaldual', 'gradient', 'method', 'can', 'achieve', 'linear', 'convergence', 'even', 'if', 'f', 'is', 'not', 'strongly', 'convex', 'our', 'result', 'generalizes', 'previous', 'work', 'which', 'either', 'requires', 'f', 'and', 'g', 'to', 'be', 'quadratic', 'functions', 'or', 'requires', 'proximal', 'mappings', 'for', 'both', 'f', 'and', 'g', 'we', 'adopt', 'a', 'novel', 'analysis', 'technique', 'that', 'in', 'each', 'iteration', 'uses', 'a', 'ghost', 'update', 'as', 'a', 'reference', 'and', 'show', 'that', 'the', 'iterates', 'in', 'the', 'primaldual', 'gradient', 'method', 'converge', 'to', 'this', 'ghost', 'sequence', 'using', 'the', 'same', 'technique', 'we', 'further', 'give', 'an', 'analysis', 'for', 'the', 'primaldual', 'stochastic', 'variance', 'reduced', 'gradient', 'svrg', 'method', 'for', 'convexconcave', 'saddle', 'point', 'problems', 'with', 'a', 'finitesum', 'structure']] | [-0.09418513659726489, -0.006180991639914943, -0.1369706462984058, 0.028833863870452413, -0.1033171172126789, -0.18431866152748239, 0.05455883248765586, 0.411813530689952, -0.3561322628732093, -0.21706281119788234, 0.1037632192707282, -0.2357894670302895, -0.19775619736703282, 0.16404116037478106, -0.10753690434450452, 0.05194399659398407, 0.086974378989191, 0.013148183578089105, -0.13838781639721923, -0.26622668497095053, 0.3058033278670557, -0.03856149362400174, 0.20436935722263475, 0.04174428897782822, 0.14445117698051035, 0.009486440170528085, 0.048205995724084925, 0.055103364354705045, -0.06846000012234127, 0.09092886332567132, 0.264990528275534, 0.1718784252827225, 0.38845321457219223, -0.3839627036994154, -0.1752359346393143, 0.19349781844666172, 0.13719646722606602, 0.06097034618494834, -0.08758260924569737, -0.19472084785670493, 0.10960626606317943, -0.08953891114144812, -0.10073508334586001, -0.11823152623908369, -0.062386541898101285, 0.053115920036692514, -0.37757411087857856, 0.05462094268648687, 0.08868836968957278, 0.009788994705586723, -0.034544288498264825, -0.1422138462569847, -0.008135041703512385, 0.0062608839891088956, 0.029489730545637114, 0.1491735204948451, 0.13628217201171952, -0.049189612479301904, -0.09483329803069038, 0.33538355143515, -0.12732984893249744, -0.25552152917071275, 0.14820228987302858, -0.07537544013537241, -0.1609242988827949, 0.13686752092678833, 0.1703082262223082, 0.2524711950507922, -0.1266393231401735, 0.17385718203943476, -0.08253209333457617, 0.12750643361791983, 0.04160308552143926, -0.07839095455622583, 0.0841029823235603, 0.12184051458660344, 0.26594805263095733, 0.15125057301007805, -0.036812860377584446, -0.07341514801020932, -0.2974654138441, -0.11108871613572718, -0.19463225416168853, 0.023168229345504766, -0.14407570406051076, -0.20340469822456891, 0.36689767199145124, 0.09693330557925176, 0.19228785661768846, 0.15654476789253144, 0.31051803944688855, 0.15708870582183768, 0.0310927068684109, 0.15809029815930195, 0.1979346419966808, 0.11763132617554882, 0.0342195142399181, -0.22844830925830387, 0.03066462460750093, 0.19659169514092023] |
1,802.01505 | $H_0$ from cosmic chronometers and Type Ia supernovae, with Gaussian
Processes and the novel Weighted Polynomial Regression method | In this paper we present new constraints on the Hubble parameter $H_0$ using:
(i) the available data on $H(z)$ obtained from cosmic chronometers (CCH); (ii)
the Hubble rate data points extracted from the supernovae of Type Ia (SnIa) of
the Pantheon compilation and the Hubble Space Telescope (HST) CANDELS and CLASH
Multy-Cycle Treasury (MCT) programs; and (iii) the local HST measurement of
$H_0$ provided by Riess et al. (2018), $H_0^{{\rm HST}}=(73.45\pm1.66)$
km/s/Mpc. Various determinations of $H_0$ using the Gaussian processes (GPs)
method and the most updated list of CCH data have been recently provided by Yu,
Ratra and Wang (2018). Using the Gaussian kernel they find $H_0=(67.42\pm
4.75)$ km/s/Mpc. Here we extend their analysis to also include the most
released and complete set of SnIa data, which allows us to reduce the
uncertainty by a factor $\sim 3$ with respect to the result found by only
considering the CCH information. We obtain $H_0=(67.06\pm 1.68)$ km/s/Mpc,
which favors again the lower range of values for $H_0$ and is in tension with
$H_0^{{\rm HST}}$. The tension reaches the $2.71\sigma$ level. We round off the
GPs determination too by taking also into account the error propagation of the
kernel hyperparameters when the CCH with and without $H_0^{{\rm HST}}$ are used
in the analysis. In addition, we present a novel method to reconstruct
functions from data, which consists in a weighted sum of polynomial regressions
(WPR). We apply it from a cosmographic perspective to reconstruct $H(z)$ and
estimate $H_0$ from CCH and SnIa measurements. The result obtained with this
method, $H_0=(68.90\pm 1.96)$ km/s/Mpc, is fully compatible with the GPs ones.
Finally, a more conservative GPs+WPR value is also provided, $H_0=(68.45\pm
2.00)$ km/s/Mpc, which is still almost $2\sigma$ away from $H_0^{{\rm HST}}$.
| astro-ph.CO gr-qc | in this paper we present new constraints on the hubble parameter h_0 using i the available data on hz obtained from cosmic chronometers cch ii the hubble rate data points extracted from the supernovae of type ia snia of the pantheon compilation and the hubble space telescope hst candels and clash multycycle treasury mct programs and iii the local hst measurement of h_0 provided by riess et al 2018 h_0rm hst7345pm166 kmsmpc various determinations of h_0 using the gaussian processes gps method and the most updated list of cch data have been recently provided by yu ratra and wang 2018 using the gaussian kernel they find h_06742pm 475 kmsmpc here we extend their analysis to also include the most released and complete set of snia data which allows us to reduce the uncertainty by a factor sim 3 with respect to the result found by only considering the cch information we obtain h_06706pm 168 kmsmpc which favors again the lower range of values for h_0 and is in tension with h_0rm hst the tension reaches the 271sigma level we round off the gps determination too by taking also into account the error propagation of the kernel hyperparameters when the cch with and without h_0rm hst are used in the analysis in addition we present a novel method to reconstruct functions from data which consists in a weighted sum of polynomial regressions wpr we apply it from a cosmographic perspective to reconstruct hz and estimate h_0 from cch and snia measurements the result obtained with this method h_06890pm 196 kmsmpc is fully compatible with the gps ones finally a more conservative gpswpr value is also provided h_06845pm 200 kmsmpc which is still almost 2sigma away from h_0rm hst | [['in', 'this', 'paper', 'we', 'present', 'new', 'constraints', 'on', 'the', 'hubble', 'parameter', 'h_0', 'using', 'i', 'the', 'available', 'data', 'on', 'hz', 'obtained', 'from', 'cosmic', 'chronometers', 'cch', 'ii', 'the', 'hubble', 'rate', 'data', 'points', 'extracted', 'from', 'the', 'supernovae', 'of', 'type', 'ia', 'snia', 'of', 'the', 'pantheon', 'compilation', 'and', 'the', 'hubble', 'space', 'telescope', 'hst', 'candels', 'and', 'clash', 'multycycle', 'treasury', 'mct', 'programs', 'and', 'iii', 'the', 'local', 'hst', 'measurement', 'of', 'h_0', 'provided', 'by', 'riess', 'et', 'al', '2018', 'h_0rm', 'hst7345pm166', 'kmsmpc', 'various', 'determinations', 'of', 'h_0', 'using', 'the', 'gaussian', 'processes', 'gps', 'method', 'and', 'the', 'most', 'updated', 'list', 'of', 'cch', 'data', 'have', 'been', 'recently', 'provided', 'by', 'yu', 'ratra', 'and', 'wang', '2018', 'using', 'the', 'gaussian', 'kernel', 'they', 'find', 'h_06742pm', '475', 'kmsmpc', 'here', 'we', 'extend', 'their', 'analysis', 'to', 'also', 'include', 'the', 'most', 'released', 'and', 'complete', 'set', 'of', 'snia', 'data', 'which', 'allows', 'us', 'to', 'reduce', 'the', 'uncertainty', 'by', 'a', 'factor', 'sim', '3', 'with', 'respect', 'to', 'the', 'result', 'found', 'by', 'only', 'considering', 'the', 'cch', 'information', 'we', 'obtain', 'h_06706pm', '168', 'kmsmpc', 'which', 'favors', 'again', 'the', 'lower', 'range', 'of', 'values', 'for', 'h_0', 'and', 'is', 'in', 'tension', 'with', 'h_0rm', 'hst', 'the', 'tension', 'reaches', 'the', '271sigma', 'level', 'we', 'round', 'off', 'the', 'gps', 'determination', 'too', 'by', 'taking', 'also', 'into', 'account', 'the', 'error', 'propagation', 'of', 'the', 'kernel', 'hyperparameters', 'when', 'the', 'cch', 'with', 'and', 'without', 'h_0rm', 'hst', 'are', 'used', 'in', 'the', 'analysis', 'in', 'addition', 'we', 'present', 'a', 'novel', 'method', 'to', 'reconstruct', 'functions', 'from', 'data', 'which', 'consists', 'in', 'a', 'weighted', 'sum', 'of', 'polynomial', 'regressions', 'wpr', 'we', 'apply', 'it', 'from', 'a', 'cosmographic', 'perspective', 'to', 'reconstruct', 'hz', 'and', 'estimate', 'h_0', 'from', 'cch', 'and', 'snia', 'measurements', 'the', 'result', 'obtained', 'with', 'this', 'method', 'h_06890pm', '196', 'kmsmpc', 'is', 'fully', 'compatible', 'with', 'the', 'gps', 'ones', 'finally', 'a', 'more', 'conservative', 'gpswpr', 'value', 'is', 'also', 'provided', 'h_06845pm', '200', 'kmsmpc', 'which', 'is', 'still', 'almost', '2sigma', 'away', 'from', 'h_0rm', 'hst']] | [-0.010872300559451209, 0.05017356100132502, -0.05539104771601307, 0.02930029806527426, -0.12953812309030083, -0.10764973263563354, 0.10342812047491858, 0.3597912341222754, -0.22193566024199957, -0.33567335913529434, 0.10508988412826466, -0.2977377231480361, -0.03421645001679372, 0.24654470558827377, -0.032120703183821576, 0.012847976608080439, 0.10976863833099243, -0.050035066612225065, -0.07951515579160544, -0.3161943677798628, 0.28494296153159443, 0.10978164965300204, 0.23650021074459918, -0.04939273188907092, 0.08523723983170806, -0.049299443315874825, -0.1358832163856395, -0.004390494260493846, -0.2288555868694352, 0.11080545811404016, 0.2020848028847487, 0.19421379360853108, 0.22409923156676648, -0.3401171954659124, -0.20115353586986714, 0.12733880318467602, 0.13733356735188393, 0.11762574693608668, 0.026194589580298654, -0.3568515385781485, 0.034602462921598694, -0.13799523683281542, -0.08461091104781382, -0.020518343856451387, -0.0015093778046415484, -0.033358914069547635, -0.28056207577627834, 0.17208564225686498, -0.049961153682368045, 0.05231820342988844, -0.12767508053108148, -0.14022415337373093, -0.03793150518176323, 0.0415388662331549, 0.003467082897181152, 0.10946899343385882, 0.06658011777777105, -0.07304433497723765, -0.042210785563581196, 0.3594325770553882, -0.10862421367411738, -0.06998123889238203, 0.13380192411816463, -0.135474447950518, -0.16051549148515507, 0.08508603076957914, 0.1393768748128286, 0.04457183424416783, -0.1815232322245146, 0.11801176603948597, 0.01996097879277335, 0.18861313485356856, 0.06936725366887332, -0.0057706668802727295, 0.15782883442023696, 0.10293959648770658, 0.06542411774954354, 0.04625101562394964, -0.1995571744553144, 0.006698902443303362, -0.3182201125896052, -0.08581309141294938, -0.16616859725938515, 0.07369490894221944, -0.15385257029239552, -0.1006614226429011, 0.3234715712720722, 0.14563697409368784, 0.25053227127038985, 0.09633137719158257, 0.2969422696532154, 0.04901615880671964, 0.08044299901059185, 0.11295118519041594, 0.3135334660647951, 0.13179197304174436, 0.10329239414487448, -0.1718970326211063, 0.05257139188207446, 0.028700717958107618] |
1,802.01506 | On $q$-analogues of some series for $\pi$ and $\pi^2$ | We obtain a new $q$-analogue of the classical Leibniz series
$\sum_{k=0}^\infty(-1)^k/(2k+1)=\pi/4$, namely \begin{equation*}
\sum_{k=0}^\infty\frac{(-1)^kq^{k(k+3)/2}}{1-q^{2k+1}}=\frac{(q^2;q^2)_{\infty}(q^8;q^8)_{\infty}}{(q;q^2)_{\infty}(q^4;q^8)_{\infty}},
\end{equation*} where $q$ is a complex number with $|q|<1$. We also show that
the Zeilberger-type series
$\sum_{k=1}^\infty(3k-1)16^k/(k\binom{2k}k)^3=\pi^2/2$ has two $q$-analogues
with $|q|<1$, one of which is $$\sum_{n=0}^\infty q^{n(n+1)/2} \frac
{1-q^{3n+2}} {1-q} \cdot\frac{(q;q)_n^3 (-q;q)_n}{(q^3;q^2)_{n}^3} = (1-q)^2
\frac{(q^2;q^2)^4_\infty}{(q;q^2)^4_\infty}.$$
| math.CO math.NT | we obtain a new qanalogue of the classical leibniz series sum_k0infty1k2k1pi4 namely beginequation sum_k0inftyfrac1kqkk321q2k1fracq2q2_inftyq8q8_inftyqq2_inftyq4q8_infty endequation where q is a complex number with q1 we also show that the zeilbergertype series sum_k1infty3k116kkbinom2kk3pi22 has two qanalogues with q1 one of which is sum_n0infty qnn12 frac 1q3n2 1q cdotfracqq_n3 qq_nq3q2_n3 1q2 fracq2q24_inftyqq24_infty | [['we', 'obtain', 'a', 'new', 'qanalogue', 'of', 'the', 'classical', 'leibniz', 'series', 'sum_k0infty1k2k1pi4', 'namely', 'beginequation', 'sum_k0inftyfrac1kqkk321q2k1fracq2q2_inftyq8q8_inftyqq2_inftyq4q8_infty', 'endequation', 'where', 'q', 'is', 'a', 'complex', 'number', 'with', 'q1', 'we', 'also', 'show', 'that', 'the', 'zeilbergertype', 'series', 'sum_k1infty3k116kkbinom2kk3pi22', 'has', 'two', 'qanalogues', 'with', 'q1', 'one', 'of', 'which', 'is', 'sum_n0infty', 'qnn12', 'frac', '1q3n2', '1q', 'cdotfracqq_n3', 'qq_nq3q2_n3', '1q2', 'fracq2q24_inftyqq24_infty']] | [-0.21653063940565762, 0.055595734406535216, -0.06972026611428435, 0.030610902416633397, -0.09655353645566941, -0.21389336922637572, -0.06440199589038767, 0.26039106680489166, -0.30711846521533115, -0.13974247968233214, 0.07166518676719379, -0.3892137805431536, -0.15769289692909252, 0.20524703011643597, -0.07759344952589856, 0.032044028727019704, -0.04901252820996976, 0.15796140068006226, -0.0531567585620484, -0.28414126784574784, 0.3449999444731852, -0.14068419331821, 0.101445192153134, -0.018388725749057967, 0.09821473291461788, -0.012652447312309339, 0.12061055590648477, -0.09203392903252346, -0.24961392250477774, 0.028241534649235445, 0.1926560854402984, 0.06604115811471896, 0.32700641435093997, -0.28728077778728994, -0.07349385548292137, 0.1822564215285749, 0.2324456666119215, -0.06757423421651942, -0.004994445304363602, -0.1851914838274441, 0.11866736421134413, -0.23085398886852512, -0.14548717246095583, -0.1152418679217013, 0.09784248035128523, 0.11767995142854931, -0.406148522001941, 0.1322055341861858, 0.08179334810049069, 0.04227366075828308, -0.002876627735975312, -0.26499602727864574, 0.03361822997231218, 0.02584717871348669, 0.03995412625599562, 0.09879551362246275, -0.07356826481182219, -0.12160225076282896, -0.09659250503087916, 0.38084132333354254, -0.019551512788095308, -0.21517194203305534, 0.027785633747443195, -0.3060558909186866, -0.2525719797193277, 0.04133422000379097, 0.02789715284527075, 0.18544244607229057, -0.013432260988870771, 0.1335531860226538, -0.13762510620148444, 0.1455674260945582, 0.15796881550695838, -0.015229747051418555, 0.06690713399794043, 0.08054521357322611, -0.004887541074578355, 0.17975394068876419, -0.05091030599276831, -0.051850045894885934, -0.33602849003381846, -0.2274381065423169, -0.14998434250038573, 0.17037258488012524, -0.11550342603927342, -0.12323061322293631, 0.2916722649299517, 0.0580345505164232, 0.23106286822386632, 0.12505021048766538, 0.1931177899979691, 0.18944779449574103, -0.001021672426382216, 0.030280080851076578, 0.05021855262358014, 0.12488000211305916, 0.07382207014030073, -0.16512473275112668, -0.05623391600007691, 0.2015559107814802] |
1,802.01507 | Solar type III radio burst time characteristics at LOFAR frequencies and
the implications for electron beam transport | Solar type III radio bursts contain a wealth of information about the
dynamics of electron beams in the solar corona and the inner heliosphere;
currently unobtainable through other means. However, the motion of different
regions of an electron beam (front, middle and back) have never been
systematically analysed before. We characterise the type III burst
frequency-time evolution using the enhanced resolution of LOFAR in the
frequency range 30 to 70 MHz and use this to probe electron beam dynamics.
Methods. The rise, peak and decay times with a 0.2 MHz spectral resolution were
defined for a collection of 31 type III bursts. The frequency evolution is used
to ascertain the apparent velocities of the front, middle and back of the type
III sources and the trends are interpreted using theoretical and numerical
treatments. The type III time profile was better approximated by an asymmetric
Gaussian profile, not an exponential as previously used. Rise and decay times
increased with decreasing frequency and showed a strong correlation. Durations
were smaller than previously observed. Drift rates from the rise times were
faster than from the decay times, corresponding to inferred mean electron beam
speeds for the front, middle and back of 0.2, 0.17, 0, 15 c, respectively.
Faster beam speeds correlate with smaller type III durations. We also find type
III frequency bandwidth decreases as frequency decreases. The different speeds
naturally explain the elongation of an electron beam in space as it propagates
through the heliosphere. The rate of expansion is proportional to the mean
speed of the exciter; faster beams expand faster. Beam speeds are attributed to
varying ensembles of electron energies at the front, middle and back of the
beam.
| astro-ph.SR | solar type iii radio bursts contain a wealth of information about the dynamics of electron beams in the solar corona and the inner heliosphere currently unobtainable through other means however the motion of different regions of an electron beam front middle and back have never been systematically analysed before we characterise the type iii burst frequencytime evolution using the enhanced resolution of lofar in the frequency range 30 to 70 mhz and use this to probe electron beam dynamics methods the rise peak and decay times with a 02 mhz spectral resolution were defined for a collection of 31 type iii bursts the frequency evolution is used to ascertain the apparent velocities of the front middle and back of the type iii sources and the trends are interpreted using theoretical and numerical treatments the type iii time profile was better approximated by an asymmetric gaussian profile not an exponential as previously used rise and decay times increased with decreasing frequency and showed a strong correlation durations were smaller than previously observed drift rates from the rise times were faster than from the decay times corresponding to inferred mean electron beam speeds for the front middle and back of 02 017 0 15 c respectively faster beam speeds correlate with smaller type iii durations we also find type iii frequency bandwidth decreases as frequency decreases the different speeds naturally explain the elongation of an electron beam in space as it propagates through the heliosphere the rate of expansion is proportional to the mean speed of the exciter faster beams expand faster beam speeds are attributed to varying ensembles of electron energies at the front middle and back of the beam | [['solar', 'type', 'iii', 'radio', 'bursts', 'contain', 'a', 'wealth', 'of', 'information', 'about', 'the', 'dynamics', 'of', 'electron', 'beams', 'in', 'the', 'solar', 'corona', 'and', 'the', 'inner', 'heliosphere', 'currently', 'unobtainable', 'through', 'other', 'means', 'however', 'the', 'motion', 'of', 'different', 'regions', 'of', 'an', 'electron', 'beam', 'front', 'middle', 'and', 'back', 'have', 'never', 'been', 'systematically', 'analysed', 'before', 'we', 'characterise', 'the', 'type', 'iii', 'burst', 'frequencytime', 'evolution', 'using', 'the', 'enhanced', 'resolution', 'of', 'lofar', 'in', 'the', 'frequency', 'range', '30', 'to', '70', 'mhz', 'and', 'use', 'this', 'to', 'probe', 'electron', 'beam', 'dynamics', 'methods', 'the', 'rise', 'peak', 'and', 'decay', 'times', 'with', 'a', '02', 'mhz', 'spectral', 'resolution', 'were', 'defined', 'for', 'a', 'collection', 'of', '31', 'type', 'iii', 'bursts', 'the', 'frequency', 'evolution', 'is', 'used', 'to', 'ascertain', 'the', 'apparent', 'velocities', 'of', 'the', 'front', 'middle', 'and', 'back', 'of', 'the', 'type', 'iii', 'sources', 'and', 'the', 'trends', 'are', 'interpreted', 'using', 'theoretical', 'and', 'numerical', 'treatments', 'the', 'type', 'iii', 'time', 'profile', 'was', 'better', 'approximated', 'by', 'an', 'asymmetric', 'gaussian', 'profile', 'not', 'an', 'exponential', 'as', 'previously', 'used', 'rise', 'and', 'decay', 'times', 'increased', 'with', 'decreasing', 'frequency', 'and', 'showed', 'a', 'strong', 'correlation', 'durations', 'were', 'smaller', 'than', 'previously', 'observed', 'drift', 'rates', 'from', 'the', 'rise', 'times', 'were', 'faster', 'than', 'from', 'the', 'decay', 'times', 'corresponding', 'to', 'inferred', 'mean', 'electron', 'beam', 'speeds', 'for', 'the', 'front', 'middle', 'and', 'back', 'of', '02', '017', '0', '15', 'c', 'respectively', 'faster', 'beam', 'speeds', 'correlate', 'with', 'smaller', 'type', 'iii', 'durations', 'we', 'also', 'find', 'type', 'iii', 'frequency', 'bandwidth', 'decreases', 'as', 'frequency', 'decreases', 'the', 'different', 'speeds', 'naturally', 'explain', 'the', 'elongation', 'of', 'an', 'electron', 'beam', 'in', 'space', 'as', 'it', 'propagates', 'through', 'the', 'heliosphere', 'the', 'rate', 'of', 'expansion', 'is', 'proportional', 'to', 'the', 'mean', 'speed', 'of', 'the', 'exciter', 'faster', 'beams', 'expand', 'faster', 'beam', 'speeds', 'are', 'attributed', 'to', 'varying', 'ensembles', 'of', 'electron', 'energies', 'at', 'the', 'front', 'middle', 'and', 'back', 'of', 'the', 'beam']] | [-0.051421690962254823, 0.18424464163151785, -0.02233314590101334, 0.08905039193554311, -0.03572414944025164, -0.12937305940441973, 0.04016087653939896, 0.4188151454467887, -0.2540792787370796, -0.3200577166779334, 0.08949130428429213, -0.2619620848263073, -0.005549156886448676, 0.24117777205830085, 0.0003814426781509512, -0.011879739663680501, 0.02821395262962334, 0.008565934850603984, -0.10006911692828754, -0.16443106269640814, 0.2099205292903194, 0.1339507265931069, 0.28945365370882137, -0.003013655045119825, 0.087173994916815, -0.05372047549247728, -0.04779037538795702, -0.014437631139883065, -0.12841859660411795, 0.03867646971113285, 0.16105899861496356, 0.11173390958117702, 0.23929374877323387, -0.44650857627899204, -0.20982716745777494, 0.04572611206131245, 0.19175471389605905, 0.06149326033029024, -0.0055655066677499365, -0.263391455682996, 0.04583888256414977, -0.17023497535329726, -0.19760483404367787, 0.07625374061224054, 0.050621438839916794, 0.08089550262847815, -0.2389462610262723, 0.12875526742481855, 0.008757504718010999, 0.05795400415957775, -0.052492597455819766, -0.11003912086715407, -0.011440054021148165, 0.09369025442258565, 0.067752179718079, 0.06368452800215826, 0.16267693304126302, -0.08669886390818783, -0.07079938516554032, 0.34105567511932183, -0.08100151076988404, -0.07711568820343677, 0.20034553962434212, -0.21258857868207906, -0.012460802970487477, 0.25178030240482996, 0.1698671569547025, 0.07303144702000217, -0.10826713860821059, -0.01096360006108446, 0.05128023787284784, 0.20049817586905158, 0.15769795726944683, 0.04643218657485874, 0.19701703423534028, 0.1149943815744532, 0.051502361564019085, 0.09695768734881667, -0.1893102044780408, -0.05867513374335343, -0.24464792504824873, -0.12119648322850252, -0.09990631294621181, 0.06287525257845301, -0.08025750821844573, -0.10094361031059956, 0.4235111739207727, 0.08560697023163669, 0.20968323383033008, 0.033396547429069987, 0.25559113635164166, 0.13331607977424056, 0.08278475147396606, 0.09602509073855829, 0.26478441727204133, 0.14367815104603607, 0.15691855055944307, -0.2336856335857182, 0.07673394290469987, 0.004682465660048642] |
1,802.01508 | Deterministic Regular Expressions With Back-References | Most modern libraries for regular expression matching allow back-references
(i.e., repetition operators) that substantially increase expressive power, but
also lead to intractability. In order to find a better balance between
expressiveness and tractability, we combine these with the notion of
determinism for regular expressions used in XML DTDs and XML Schema. This
includes the definition of a suitable automaton model, and a generalization of
the Glushkov construction. We demonstrate that, compared to their
non-deterministic superclass, these deterministic regular expressions with
back-references have desirable algorithmic properties (i.e., efficiently
solvable membership problem and some decidable problems in static analysis),
while, at the same time, their expressive power exceeds that of deterministic
regular expressions without back-references.
| cs.FL cs.DB | most modern libraries for regular expression matching allow backreferences ie repetition operators that substantially increase expressive power but also lead to intractability in order to find a better balance between expressiveness and tractability we combine these with the notion of determinism for regular expressions used in xml dtds and xml schema this includes the definition of a suitable automaton model and a generalization of the glushkov construction we demonstrate that compared to their nondeterministic superclass these deterministic regular expressions with backreferences have desirable algorithmic properties ie efficiently solvable membership problem and some decidable problems in static analysis while at the same time their expressive power exceeds that of deterministic regular expressions without backreferences | [['most', 'modern', 'libraries', 'for', 'regular', 'expression', 'matching', 'allow', 'backreferences', 'ie', 'repetition', 'operators', 'that', 'substantially', 'increase', 'expressive', 'power', 'but', 'also', 'lead', 'to', 'intractability', 'in', 'order', 'to', 'find', 'a', 'better', 'balance', 'between', 'expressiveness', 'and', 'tractability', 'we', 'combine', 'these', 'with', 'the', 'notion', 'of', 'determinism', 'for', 'regular', 'expressions', 'used', 'in', 'xml', 'dtds', 'and', 'xml', 'schema', 'this', 'includes', 'the', 'definition', 'of', 'a', 'suitable', 'automaton', 'model', 'and', 'a', 'generalization', 'of', 'the', 'glushkov', 'construction', 'we', 'demonstrate', 'that', 'compared', 'to', 'their', 'nondeterministic', 'superclass', 'these', 'deterministic', 'regular', 'expressions', 'with', 'backreferences', 'have', 'desirable', 'algorithmic', 'properties', 'ie', 'efficiently', 'solvable', 'membership', 'problem', 'and', 'some', 'decidable', 'problems', 'in', 'static', 'analysis', 'while', 'at', 'the', 'same', 'time', 'their', 'expressive', 'power', 'exceeds', 'that', 'of', 'deterministic', 'regular', 'expressions', 'without', 'backreferences']] | [-0.07250598224937974, 0.022971934061991956, -0.04176996173996445, 0.13745346909648518, -0.14167602075288582, -0.20005459948525295, 0.09079267861799592, 0.38565100716278616, -0.2921104576176988, -0.3184957793229713, 0.07276605435675916, -0.23218498577207194, -0.1102543091792943, 0.20472859251477749, -0.09451639537485235, 0.09332346215337284, 0.059788535707589005, 0.04909658945264476, -0.06719963156527518, -0.23445939256364595, 0.2652786780206437, 0.04059071621478461, 0.2966847497376457, 0.022979762050760005, 0.0719725520345403, -0.009059522828433366, -0.03905693050273035, 0.06467635540983978, -0.1144487564214397, 0.14587723385064608, 0.32045707058787876, 0.244859261380558, 0.24938257497249056, -0.4311554670927271, -0.1315591365994733, 0.1304029320671627, 0.13648158680664096, 0.09893157320566871, -0.010048790473235458, -0.22096607497835583, 0.11765716837274026, -0.225192482096959, -0.07154680455342528, -0.13225203112954587, 0.0436937456447796, 0.050651893240659274, -0.25105771453704984, 0.025084005258472604, 0.16110682372102694, 0.06194988732450653, -0.05244005241934045, -0.09068478700350475, 0.00664681399991093, 0.10862528631232876, -0.03647437491515997, -0.025607291322646546, 0.04283645245106479, -0.1290827810710741, -0.16626523820831712, 0.3756540094428094, -0.016366889851736482, -0.22002836703364037, 0.19594277254000833, -0.10802635697408917, -0.17798493139907323, 0.11151989171924316, 0.14865630588996992, 0.1089846318736013, -0.12449518418912076, 0.10885391415888032, -0.027738086265239832, 0.20228876089429962, 0.16248323620025035, 0.08814411425336668, 0.15579623496572, 0.12949069011626782, 0.0645180060837286, 0.17959786543109563, 0.07149198956054066, -0.11654005388407844, -0.22245788548669193, -0.08710117493287363, -0.07016190456275918, -0.017315415095793398, -0.13823632666773156, -0.2232183993348967, 0.37691364757947426, 0.18312038173816636, 0.11455232940152683, 0.2253293331168526, 0.3067634730739931, 0.11332170886144174, 0.07421806157129791, 0.11860740119261684, 0.11211459282079951, 0.07949019016170528, 0.10258326176100666, -0.1996808494430909, 0.1321800103827289, 0.0831704501091478] |
1,802.01509 | Anti-van der Waerden numbers on Graphs | In this paper arithmetic progressions on the integers and the integers modulo
n are extended to graphs. This allows for the definition of the anti-van der
Waerden number of a graph. Much of the focus of this paper is on 3-term
arithmetic progressions for which general bounds are obtained based on the
radius and diameter of a graph. The general bounds are improved for trees and
Cartesian products and exact values are determined for some classes of graphs.
Larger k-term arithmetic progressions are considered and a connection between
the Ramsey number of paths and the anti-van der Waerden number of graphs is
established.
| math.CO | in this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs this allows for the definition of the antivan der waerden number of a graph much of the focus of this paper is on 3term arithmetic progressions for which general bounds are obtained based on the radius and diameter of a graph the general bounds are improved for trees and cartesian products and exact values are determined for some classes of graphs larger kterm arithmetic progressions are considered and a connection between the ramsey number of paths and the antivan der waerden number of graphs is established | [['in', 'this', 'paper', 'arithmetic', 'progressions', 'on', 'the', 'integers', 'and', 'the', 'integers', 'modulo', 'n', 'are', 'extended', 'to', 'graphs', 'this', 'allows', 'for', 'the', 'definition', 'of', 'the', 'antivan', 'der', 'waerden', 'number', 'of', 'a', 'graph', 'much', 'of', 'the', 'focus', 'of', 'this', 'paper', 'is', 'on', '3term', 'arithmetic', 'progressions', 'for', 'which', 'general', 'bounds', 'are', 'obtained', 'based', 'on', 'the', 'radius', 'and', 'diameter', 'of', 'a', 'graph', 'the', 'general', 'bounds', 'are', 'improved', 'for', 'trees', 'and', 'cartesian', 'products', 'and', 'exact', 'values', 'are', 'determined', 'for', 'some', 'classes', 'of', 'graphs', 'larger', 'kterm', 'arithmetic', 'progressions', 'are', 'considered', 'and', 'a', 'connection', 'between', 'the', 'ramsey', 'number', 'of', 'paths', 'and', 'the', 'antivan', 'der', 'waerden', 'number', 'of', 'graphs', 'is', 'established']] | [-0.22798090078189825, 0.1314157755656656, -0.05852229918525057, 0.10087009211346616, -0.06664647771389161, -0.09262302142197212, 0.05158299699796418, 0.2971837999461924, -0.2272123358601216, -0.3340633783254375, 0.07914558080481636, -0.29871297168595723, -0.12791664124177135, 0.24489354652587722, -0.12043901041457519, 0.05424167170515397, 0.07482737052317673, 0.08219260240009832, 0.0009338119998574257, -0.3140613651722534, 0.34744319834559084, -0.03769799896958962, 0.15568600643824027, 0.08935279649619049, 0.03601188396185058, 0.01852726696276115, -0.03824339862189536, 0.0583025517611249, -0.2110644934283009, 0.20361925540797104, 0.2501228963345904, 0.09757693516072428, 0.2767080841766833, -0.4336921372315259, -0.11139272863171923, 0.19353371896120963, 0.11738567550675673, 0.07358401936130797, 0.038852290667421685, -0.220425578801739, 0.12107647581984407, -0.1021495305761261, -0.051725329912620265, -0.02095948411061347, 0.11110788703109455, 0.1369855795778985, -0.26584255856290023, -0.008569007565366845, 0.11757193669423606, 0.12335088239639129, 0.05486669621907301, -0.21784786881598672, 0.06977188817306774, 0.09044231556681465, -0.030058175244015977, 0.0015566310510762686, 0.01193985772020753, -0.06897837968172452, -0.10743833897472585, 0.3764312645981034, 0.011074592874756137, -0.1754166308066523, 0.09985923917412541, -0.0976772030309132, -0.1789831498465998, 0.06870530301578415, 0.12426726500621264, 0.1535747894311993, -0.038978819021032854, 0.15415094132892318, -0.11435402354600759, 0.16965022579161, 0.21829267832206437, 0.06461368659985912, 0.1196910555483502, 0.07167592872549029, 0.07467107825632234, 0.14752767605761302, 0.023892135420380142, -0.04751239846306808, -0.27677007703092493, -0.1542765341486637, -0.22605391633832483, 0.050634479213469814, -0.1791202711764818, -0.2673196315797028, 0.38571748578722037, 0.07602235193825463, 0.13030190960259982, 0.20467820214853594, 0.250281111468353, 0.07493600242961089, 0.04217645992497796, 0.06988108251695928, 0.13761583608671235, 0.23299501971929398, -0.021337858181971224, -0.11272094471072688, 0.04207031091096476, 0.1942847212686122] |
1,802.0151 | On critical points of the relative fractional perimeter | We study the localization of sets with constant nonlocal mean curvature and
prescribed small volume in a bounded open set with smooth boundary, proving
that they are {\em sufficiently close} to critical points of a suitable
non-local potential. We then consider the fractional perimeter in half-spaces.
We prove the existence of a minimizer under fixed volume constraint, showing
some of its properties such as smoothness and symmetry, being a graph in the
$x_N$-direction, and characterizing its intersection with the hyperplane
$\{x_N=0\}$.
| math.AP math.DG | we study the localization of sets with constant nonlocal mean curvature and prescribed small volume in a bounded open set with smooth boundary proving that they are em sufficiently close to critical points of a suitable nonlocal potential we then consider the fractional perimeter in halfspaces we prove the existence of a minimizer under fixed volume constraint showing some of its properties such as smoothness and symmetry being a graph in the x_ndirection and characterizing its intersection with the hyperplane x_n0 | [['we', 'study', 'the', 'localization', 'of', 'sets', 'with', 'constant', 'nonlocal', 'mean', 'curvature', 'and', 'prescribed', 'small', 'volume', 'in', 'a', 'bounded', 'open', 'set', 'with', 'smooth', 'boundary', 'proving', 'that', 'they', 'are', 'em', 'sufficiently', 'close', 'to', 'critical', 'points', 'of', 'a', 'suitable', 'nonlocal', 'potential', 'we', 'then', 'consider', 'the', 'fractional', 'perimeter', 'in', 'halfspaces', 'we', 'prove', 'the', 'existence', 'of', 'a', 'minimizer', 'under', 'fixed', 'volume', 'constraint', 'showing', 'some', 'of', 'its', 'properties', 'such', 'as', 'smoothness', 'and', 'symmetry', 'being', 'a', 'graph', 'in', 'the', 'x_ndirection', 'and', 'characterizing', 'its', 'intersection', 'with', 'the', 'hyperplane', 'x_n0']] | [-0.19173047300428153, 0.07985630836919881, -0.05843230409082025, 0.046915899406303654, -0.04961775476404, -0.12723887857282534, 0.05270582851953805, 0.33768642155919226, -0.31977677047252656, -0.22399011827656068, 0.1597340211403207, -0.2965304799377918, -0.1333679321978707, 0.12723184819333255, -0.11510584302595817, 0.11583297099423362, 0.02546440528240055, 0.0821418738574721, -0.06811077067250153, -0.2398909639556223, 0.3828932675125543, -0.0779456454445608, 0.19079992336337454, 0.12345267314303783, 0.1083585174754262, -0.007543171424185857, 0.022853576536726906, 0.12651125389966184, -0.2049366192460184, 0.12235829406417906, 0.1951968591136392, 0.07909518429951276, 0.30615096222609284, -0.3965642329538241, -0.1851337687461637, 0.19748053525108844, 0.06714776229055133, 0.04812959876726382, -0.04223628115432802, -0.28410835231188686, 0.14920577107986902, -0.041707056463928895, -0.2126025777979521, -0.0533103687572293, 0.035387812968110666, 0.08443956803239416, -0.2633886834722944, 0.042909187637269496, 0.07842494507785887, 0.08117025905521587, -0.10555316037207377, -0.08389954441227018, -0.03893369354482275, 0.0804954932187684, 0.0329918195711798, 0.06764196938602254, 0.0838375697567244, -0.15044731335365213, -0.05180022579152137, 0.36627810678910466, -0.07187113111140206, -0.2627198251429945, 0.1741166274063289, -0.18133904624846764, -0.10394640861777589, 0.08585792744415813, 0.1411634405842051, 0.1326032599550672, -0.09777180183446035, 0.16125138196293848, -0.07853344884788385, 0.09172869549365714, 0.10294170778361149, 0.029276280471822246, 0.1416914581146557, 0.1300485174404457, 0.20002186611527578, 0.1622900461763493, -0.05051215467101429, -0.08857832610956393, -0.40406222445890305, -0.14374597848509438, -0.21895622480660676, 0.08772337193950079, -0.1622781503649094, -0.24656616041902452, 0.3561831013066694, 0.060633721097838135, 0.25126503298524766, 0.10381920944200829, 0.2165334371617064, 0.11855474835920177, 0.02321651169040706, 0.13867351756198332, 0.1771918431233644, 0.11161312127951532, 0.002269121876452118, -0.18846098604553846, 0.025860472302883863, 0.10241109673570463] |
1,802.01511 | Designing Memory Bits with Dissipation lower than the Landauer's Bound | A Brownian particle in a symmetric double well potential is used as a
representation for a single bit memory, where, the location of the particle in
either well denotes one of the two states of a single bit memory. This article
analyzes the effect of modifications to a symmetric double well potential on
the minimum heat dissipation associated with erasure of the information stored
in a single bit memory. Two types of modifications are considered, viz.,
overlap between the two wells and the asymmetry between the two wells of a bit
of memory. Moreover, the analysis presented here, takes into account the
uncertainty in the success of the erasure process. We quantify the effect of
the proposed modifications on the heat dissipation accompanying erasure of a
bit of information with a comparison to the Landauer's bound. In particular, we
conclude that the proposed modifications could result in the minimum heat
dissipation being lower than the Landauer's bound in quasi-static erasure
processes. Furthermore, we quantify the physical aspect ratio for designing a
memory bit which could improve memory density.
| cond-mat.stat-mech | a brownian particle in a symmetric double well potential is used as a representation for a single bit memory where the location of the particle in either well denotes one of the two states of a single bit memory this article analyzes the effect of modifications to a symmetric double well potential on the minimum heat dissipation associated with erasure of the information stored in a single bit memory two types of modifications are considered viz overlap between the two wells and the asymmetry between the two wells of a bit of memory moreover the analysis presented here takes into account the uncertainty in the success of the erasure process we quantify the effect of the proposed modifications on the heat dissipation accompanying erasure of a bit of information with a comparison to the landauers bound in particular we conclude that the proposed modifications could result in the minimum heat dissipation being lower than the landauers bound in quasistatic erasure processes furthermore we quantify the physical aspect ratio for designing a memory bit which could improve memory density | [['a', 'brownian', 'particle', 'in', 'a', 'symmetric', 'double', 'well', 'potential', 'is', 'used', 'as', 'a', 'representation', 'for', 'a', 'single', 'bit', 'memory', 'where', 'the', 'location', 'of', 'the', 'particle', 'in', 'either', 'well', 'denotes', 'one', 'of', 'the', 'two', 'states', 'of', 'a', 'single', 'bit', 'memory', 'this', 'article', 'analyzes', 'the', 'effect', 'of', 'modifications', 'to', 'a', 'symmetric', 'double', 'well', 'potential', 'on', 'the', 'minimum', 'heat', 'dissipation', 'associated', 'with', 'erasure', 'of', 'the', 'information', 'stored', 'in', 'a', 'single', 'bit', 'memory', 'two', 'types', 'of', 'modifications', 'are', 'considered', 'viz', 'overlap', 'between', 'the', 'two', 'wells', 'and', 'the', 'asymmetry', 'between', 'the', 'two', 'wells', 'of', 'a', 'bit', 'of', 'memory', 'moreover', 'the', 'analysis', 'presented', 'here', 'takes', 'into', 'account', 'the', 'uncertainty', 'in', 'the', 'success', 'of', 'the', 'erasure', 'process', 'we', 'quantify', 'the', 'effect', 'of', 'the', 'proposed', 'modifications', 'on', 'the', 'heat', 'dissipation', 'accompanying', 'erasure', 'of', 'a', 'bit', 'of', 'information', 'with', 'a', 'comparison', 'to', 'the', 'landauers', 'bound', 'in', 'particular', 'we', 'conclude', 'that', 'the', 'proposed', 'modifications', 'could', 'result', 'in', 'the', 'minimum', 'heat', 'dissipation', 'being', 'lower', 'than', 'the', 'landauers', 'bound', 'in', 'quasistatic', 'erasure', 'processes', 'furthermore', 'we', 'quantify', 'the', 'physical', 'aspect', 'ratio', 'for', 'designing', 'a', 'memory', 'bit', 'which', 'could', 'improve', 'memory', 'density']] | [-0.18393378806289998, 0.12359152362273818, -0.0690462360239661, 0.08526594360433448, -0.01131288627204433, -0.1650184162531383, 0.10899748698693146, 0.29892684880047615, -0.28445467968691096, -0.3136143557873837, 0.08555505894911947, -0.2631864525126607, -0.09967192429970699, 0.1848452187867919, -0.08212910883201893, 0.058095364669191366, 0.03206398656063326, 0.10064207328996214, -0.0756121041983094, -0.2222855329628657, 0.28518562336985986, 0.09090412968084258, 0.2816351035562752, 0.0754922738696417, 0.08546875880800942, -0.00021545475530647412, 0.0008240912676647598, -0.015593636480128665, -0.13717673851977125, 0.10247855295336888, 0.16820084621797557, 0.07777960961841549, 0.2746918976824898, -0.4469153525600775, -0.23803754655246653, 0.0752851377016331, 0.12577085965836232, 0.1306038561369962, -0.08280642151314598, -0.21471475163118892, 0.04828379266591889, -0.19377582603960894, -0.02037617707300638, 0.015260183160831586, 0.021360327978880052, 0.02988953070369748, -0.289643441039148, 0.07702778687790884, 0.10419181144856482, -0.02435391105114995, -0.0410195160081631, -0.09708674076756232, 0.006445980739382127, 0.1207836559722514, -0.007776906563582558, 0.004467315172640544, 0.14062812203002487, -0.1280834521049257, -0.15359837581924152, 0.35346670394888924, -0.07475217346409715, -0.2319275209905182, 0.11921549231870875, -0.1337364500589941, -0.09320023870147932, 0.09317460988407557, 0.19212252303717262, 0.054477092480349744, -0.15813797956144207, 0.037422317341480174, 0.017692298536173205, 0.16604547833257324, 0.08898716279452018, 0.12538838656776155, 0.19737351286287808, 0.18473581114935617, 0.010965513792726096, 0.21213456489710827, -0.14774868264565444, -0.16241432483349874, -0.3178872275218535, -0.21618558672384955, -0.23065939753282333, 0.06321079855892033, -0.10741515552585491, -0.13562486356835854, 0.38349387534956836, 0.1284595058964084, 0.19295279494371642, 0.045385324929218235, 0.33529165885515844, 0.10985406821925883, 0.10204817687443803, 0.10069301186307344, 0.2130204765649324, 0.1418095657057809, 0.09702301789807637, -0.24978941013602268, 0.0997361062929097, 0.010335501132982918] |
1,802.01512 | Predictive Management of Electric Vehicles in a Community Microgrid | The charging load from Electric vehicles (EVs) is modeled as deferrable load,
meaning that the power consumption can be shifted to different time windows to
achieve various grid objectives. In local community scenarios, EVs are
considered as controllable storage devices in a global optimization problem
together with other microgrid components, such as the building load, renewable
generations, and battery energy storage system, etc. However, the uncertainties
in the driver behaviors have tremendous impact on the cost effectiveness of
microgrid operations, which has not been fully explored in previous literature.
In this paper, we propose a predictive EV management strategy in a community
microgrid, and evaluate it using real-world datasets of system baseload, solar
generation and EV charging behaviors. A two-stage operation model is
established for cost-effective EV management, i.e. wholesale market
participation in the first stage and load profile following in the second
stage. Predictive control strategies, including receding horizon control, are
adapted to solve the energy allocation problem in a decentralized fashion. The
experimental results indicate the proposed approach can considerably reduce the
total energy cost and decrease the ramping index of total system load up to
56.3%.
| eess.SP math.OC | the charging load from electric vehicles evs is modeled as deferrable load meaning that the power consumption can be shifted to different time windows to achieve various grid objectives in local community scenarios evs are considered as controllable storage devices in a global optimization problem together with other microgrid components such as the building load renewable generations and battery energy storage system etc however the uncertainties in the driver behaviors have tremendous impact on the cost effectiveness of microgrid operations which has not been fully explored in previous literature in this paper we propose a predictive ev management strategy in a community microgrid and evaluate it using realworld datasets of system baseload solar generation and ev charging behaviors a twostage operation model is established for costeffective ev management ie wholesale market participation in the first stage and load profile following in the second stage predictive control strategies including receding horizon control are adapted to solve the energy allocation problem in a decentralized fashion the experimental results indicate the proposed approach can considerably reduce the total energy cost and decrease the ramping index of total system load up to 563 | [['the', 'charging', 'load', 'from', 'electric', 'vehicles', 'evs', 'is', 'modeled', 'as', 'deferrable', 'load', 'meaning', 'that', 'the', 'power', 'consumption', 'can', 'be', 'shifted', 'to', 'different', 'time', 'windows', 'to', 'achieve', 'various', 'grid', 'objectives', 'in', 'local', 'community', 'scenarios', 'evs', 'are', 'considered', 'as', 'controllable', 'storage', 'devices', 'in', 'a', 'global', 'optimization', 'problem', 'together', 'with', 'other', 'microgrid', 'components', 'such', 'as', 'the', 'building', 'load', 'renewable', 'generations', 'and', 'battery', 'energy', 'storage', 'system', 'etc', 'however', 'the', 'uncertainties', 'in', 'the', 'driver', 'behaviors', 'have', 'tremendous', 'impact', 'on', 'the', 'cost', 'effectiveness', 'of', 'microgrid', 'operations', 'which', 'has', 'not', 'been', 'fully', 'explored', 'in', 'previous', 'literature', 'in', 'this', 'paper', 'we', 'propose', 'a', 'predictive', 'ev', 'management', 'strategy', 'in', 'a', 'community', 'microgrid', 'and', 'evaluate', 'it', 'using', 'realworld', 'datasets', 'of', 'system', 'baseload', 'solar', 'generation', 'and', 'ev', 'charging', 'behaviors', 'a', 'twostage', 'operation', 'model', 'is', 'established', 'for', 'costeffective', 'ev', 'management', 'ie', 'wholesale', 'market', 'participation', 'in', 'the', 'first', 'stage', 'and', 'load', 'profile', 'following', 'in', 'the', 'second', 'stage', 'predictive', 'control', 'strategies', 'including', 'receding', 'horizon', 'control', 'are', 'adapted', 'to', 'solve', 'the', 'energy', 'allocation', 'problem', 'in', 'a', 'decentralized', 'fashion', 'the', 'experimental', 'results', 'indicate', 'the', 'proposed', 'approach', 'can', 'considerably', 'reduce', 'the', 'total', 'energy', 'cost', 'and', 'decrease', 'the', 'ramping', 'index', 'of', 'total', 'system', 'load', 'up', 'to', '563']] | [-0.15689806473946713, 0.0655490221242678, -0.02168840627889446, 0.012858142754920025, -0.052105496734123125, -0.16970513109117746, 0.10462573600717463, 0.40784385742401663, -0.2812562843071336, -0.4008704459175785, 0.11269164845323254, -0.2647232729025146, -0.07166122048449247, 0.19155240555305003, -0.1466145344726256, 0.08044746522345837, 0.06512467788304499, -0.01815903326496482, 0.0299591486319959, -0.2462877291904891, 0.22227656768054077, 0.1274449994312005, 0.3958524427020011, 0.07409489563755453, 0.07739315085370649, -0.06432355105867014, 0.007945710656906855, 0.032480918696432555, -0.04438811881013959, 0.11126382102164381, 0.325493254174944, 0.1347281736237532, 0.3434115528188487, -0.4750500401046048, -0.2470426612243829, 0.11977687645443477, 0.09738920397308477, 0.0139224145616723, -0.0405826692232872, -0.2034655056182949, 0.08226719592757364, -0.2803401263093853, -0.07921689218075814, -0.06382641679250654, -0.010165644480173099, 0.07011453335438458, -0.2944707885666929, 0.022129817781573597, -0.02489053350724676, 0.02180093693939543, -0.11607957060519727, -0.12818869531211602, -0.029487517591134865, 0.1439023485600433, 0.0597280939567854, -0.05853342879167263, 0.2055360433466589, -0.09538101889851765, -0.16077939893411314, 0.4153669646475464, 0.01083128007798842, -0.1524062532339582, 0.09744271376799356, -0.02771649467065296, -0.11683846332326016, 0.10478650051060114, 0.2683775475820863, 0.087082490580097, -0.20477478870499058, 0.023285103921885007, 0.03933754798143785, 0.1734686652792895, 0.037412963881890506, 0.005124750054203608, 0.18179518150715554, 0.25570680576059573, 0.19366966277335992, 0.11710367326350991, -0.046024338210043696, -0.1429928704016307, -0.22128017998840463, -0.10676101852763206, -0.15885657287807145, -0.005312598511583464, -0.05719441569500362, -0.08299339362271527, 0.410654389497606, 0.17175235198265773, 0.11740811962257833, 0.05468770180038731, 0.39125492191932937, 0.14565291255031357, 0.07280894332383313, 0.12551070463675212, 0.1965796600700916, -0.009609632454118989, 0.23624895514543862, -0.2556517236437859, 0.07847338426174556, -0.010817537953621371] |
1,802.01513 | Covariance Matrix Estimation for Massive MIMO | We propose a novel pilot structure for covariance matrix estimation in
massive multiple-input multiple-output (MIMO) systems in which each user
transmits two pilot sequences, with the second pilot sequence multiplied by a
random phase-shift. The covariance matrix of a particular user is obtained by
computing the sample cross-correlation of the channel estimates obtained from
the two pilot sequences. This approach relaxes the requirement that all the
users transmit their uplink pilots over the same set of symbols. We derive
expressions for the achievable rate and the mean-squared error of the
covariance matrix estimate when the proposed method is used with staggered
pilots. The performance of the proposed method is compared with existing
methods through simulations.
| cs.IT math.IT | we propose a novel pilot structure for covariance matrix estimation in massive multipleinput multipleoutput mimo systems in which each user transmits two pilot sequences with the second pilot sequence multiplied by a random phaseshift the covariance matrix of a particular user is obtained by computing the sample crosscorrelation of the channel estimates obtained from the two pilot sequences this approach relaxes the requirement that all the users transmit their uplink pilots over the same set of symbols we derive expressions for the achievable rate and the meansquared error of the covariance matrix estimate when the proposed method is used with staggered pilots the performance of the proposed method is compared with existing methods through simulations | [['we', 'propose', 'a', 'novel', 'pilot', 'structure', 'for', 'covariance', 'matrix', 'estimation', 'in', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'systems', 'in', 'which', 'each', 'user', 'transmits', 'two', 'pilot', 'sequences', 'with', 'the', 'second', 'pilot', 'sequence', 'multiplied', 'by', 'a', 'random', 'phaseshift', 'the', 'covariance', 'matrix', 'of', 'a', 'particular', 'user', 'is', 'obtained', 'by', 'computing', 'the', 'sample', 'crosscorrelation', 'of', 'the', 'channel', 'estimates', 'obtained', 'from', 'the', 'two', 'pilot', 'sequences', 'this', 'approach', 'relaxes', 'the', 'requirement', 'that', 'all', 'the', 'users', 'transmit', 'their', 'uplink', 'pilots', 'over', 'the', 'same', 'set', 'of', 'symbols', 'we', 'derive', 'expressions', 'for', 'the', 'achievable', 'rate', 'and', 'the', 'meansquared', 'error', 'of', 'the', 'covariance', 'matrix', 'estimate', 'when', 'the', 'proposed', 'method', 'is', 'used', 'with', 'staggered', 'pilots', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'is', 'compared', 'with', 'existing', 'methods', 'through', 'simulations']] | [-0.19332117814894603, 0.02421237559300726, -0.03025342539438735, -0.0026548726474056425, -0.031301551773820234, -0.18224609428206864, 0.09472444261242029, 0.3628748107661048, -0.23796860672250067, -0.2567369401778864, 0.09476283445508908, -0.26417339932092504, -0.21052580267524995, 0.13900774275357633, -0.07531103842446338, 0.09917281708659847, 0.08936965551794224, 0.06760082074400524, -0.10946325505881206, -0.29247500467033166, 0.31633590869605543, 0.10207334338970807, 0.35162606930117246, -0.11949206906492295, 0.09898359891654843, 0.0541141564593367, -0.0874581847552453, -0.09749439099585921, -0.07023420775462316, 0.0972046152141917, 0.27724394065368435, 0.22794070577491884, 0.30393219468912674, -0.35871707131325664, -0.21132665072446283, 0.09368712499373309, 0.18845934196496789, 0.10149425428016516, -0.07265069359994453, -0.32687213238652635, 0.14681568656764601, -0.2216536402084824, -0.018945140015009954, 0.03092463475085147, -0.13138328970450422, 0.03841975817213888, -0.4257730117700387, 0.06586667289552481, -0.02396199765574673, 0.05256501082735865, -0.044894034379040416, -0.1900272904733277, 0.06878619034693617, 0.18967957666735974, 0.06010653785450141, -0.016414380385337966, 0.08305680557842487, -0.05730381318287033, -0.07333138025473011, 0.33190021905643136, -0.029029888509894197, -0.28862026947671954, 0.09215848826165514, -0.14201270097805915, -0.05575143781936039, 0.17965640331537502, 0.2368977722266446, 0.09085736169034372, -0.2065850172668908, 0.03579558543709066, -0.035313717709125385, 0.209786491073749, 0.05471016895937045, 0.0955347812977498, 0.127066664636621, 0.15046991165322454, 0.11141436360776424, 0.13825532951108788, -0.1585477103398222, -0.0709134812304831, -0.24275269564848556, -0.1073373715352753, -0.2895185742942292, 0.008142622418539679, -0.1564996807277962, -0.09677752923706304, 0.38899015823136207, 0.14537423236862473, 0.11009158851659816, 0.18295078760964553, 0.39511505070587866, 0.1423437482466081, 0.07227073098816301, 0.0975569026099275, 0.15773131421402745, 0.15917271712147024, 0.10762533595400822, -0.25979357076753135, 0.05557371955769865, 0.04394806128643129] |
1,802.01514 | CPT tests with the antihydrogen molecular ion | High precision radio-frequency, microwave and infrared spectroscopic
measurements of the antihydrogen molecular ion $\bar{H}_{2}^{-}$
($\bar{p}\bar{p}e^{+}$) compared with its normal matter counterpart provide
direct tests of the CPT theorem. The sensitivity to a difference between the
positron/antiproton and electron/proton mass ratios, and to a difference
between the positron-antiproton and electron-proton hyperfine interactions, can
exceed that obtained by comparing antihydrogen with hydrogen by several orders
of magnitude. Practical schemes are outlined for measurements on a single
$\bar{H}_{2}^{-}$ ion in a cryogenic Penning trap, that use non-destructive
state identification by measuring the cyclotron frequency and bound-positron
spin-flip frequency; and also for creating an $\bar{H}_{2}^{-}$ ion and
initializing its quantum state.
| physics.atom-ph | high precision radiofrequency microwave and infrared spectroscopic measurements of the antihydrogen molecular ion barh_2 barpbarpe compared with its normal matter counterpart provide direct tests of the cpt theorem the sensitivity to a difference between the positronantiproton and electronproton mass ratios and to a difference between the positronantiproton and electronproton hyperfine interactions can exceed that obtained by comparing antihydrogen with hydrogen by several orders of magnitude practical schemes are outlined for measurements on a single barh_2 ion in a cryogenic penning trap that use nondestructive state identification by measuring the cyclotron frequency and boundpositron spinflip frequency and also for creating an barh_2 ion and initializing its quantum state | [['high', 'precision', 'radiofrequency', 'microwave', 'and', 'infrared', 'spectroscopic', 'measurements', 'of', 'the', 'antihydrogen', 'molecular', 'ion', 'barh_2', 'barpbarpe', 'compared', 'with', 'its', 'normal', 'matter', 'counterpart', 'provide', 'direct', 'tests', 'of', 'the', 'cpt', 'theorem', 'the', 'sensitivity', 'to', 'a', 'difference', 'between', 'the', 'positronantiproton', 'and', 'electronproton', 'mass', 'ratios', 'and', 'to', 'a', 'difference', 'between', 'the', 'positronantiproton', 'and', 'electronproton', 'hyperfine', 'interactions', 'can', 'exceed', 'that', 'obtained', 'by', 'comparing', 'antihydrogen', 'with', 'hydrogen', 'by', 'several', 'orders', 'of', 'magnitude', 'practical', 'schemes', 'are', 'outlined', 'for', 'measurements', 'on', 'a', 'single', 'barh_2', 'ion', 'in', 'a', 'cryogenic', 'penning', 'trap', 'that', 'use', 'nondestructive', 'state', 'identification', 'by', 'measuring', 'the', 'cyclotron', 'frequency', 'and', 'boundpositron', 'spinflip', 'frequency', 'and', 'also', 'for', 'creating', 'an', 'barh_2', 'ion', 'and', 'initializing', 'its', 'quantum', 'state']] | [-0.07495913643035151, 0.20796320730767634, -0.0005594824690238706, 0.014441790387389205, 0.017892261434878622, -0.14823617476615167, 0.08070657328214674, 0.3901096396857784, -0.18670683195371005, -0.3116810594330586, 0.02629365772341511, -0.2788367134119783, 0.055799401294262634, 0.2716712757922886, 0.0771595326407502, 0.06261503094740745, 0.08193899315914938, -0.03400560511204059, -0.08512186618033973, -0.1461873259639279, 0.25525924284454615, 0.14657926805805238, 0.28396243000447396, 0.11152962228017194, 0.12761829231777005, -0.011248213318841798, -0.009431763150773587, -0.02338532969532978, -0.10548071519407953, 0.11897234223073437, 0.25837884218919843, 0.055575813366366286, 0.1940676743330966, -0.42170117209288516, -0.16189071815017433, 0.08921889570940818, 0.09828282303753354, 0.14100626100386893, -0.10709616902528242, -0.31116825072538284, 0.0023244422616525776, -0.1873588070450794, -0.12080792413492288, -0.10756405550055206, -0.0029136481872271925, 0.0506377459104572, -0.2829138498930704, 0.08584920902531372, -0.02116468199085267, 0.09743453467353469, -0.07547894353268757, -0.11281929661830266, 0.03917511820438362, 0.03962564165925696, -0.02760605627582187, 0.032569296047135834, 0.21069231995331522, -0.09954611657719527, -0.1402927305017199, 0.3802058945986487, -0.10994352868237045, -0.10575357503313128, 0.18449465455930858, -0.19066736061746875, -0.05490768738534479, 0.11646926301487145, 0.11241995852351898, 0.06386044063117532, -0.13588767462698298, 0.026309435391643394, 0.03132081050869255, 0.17800182789627192, 0.14040041175183085, 0.09460951214035353, 0.22995221323910214, 0.13620149952669938, 0.04310542130842805, 0.07792775723903018, -0.15804912290713263, -0.006063562392124108, -0.2696882888674736, -0.15652307387485745, -0.1650944247575743, 0.03579347036623706, -0.047602584259445954, -0.07090716353795003, 0.3460193535933892, 0.1089059377355235, 0.1755658624161567, -0.058001887372561865, 0.3800617641458909, 0.11768054082945344, 0.03666905403314602, -0.015779824262218817, 0.3218958486123787, 0.22130638113289716, 0.09769267551600933, -0.34164657507623947, 0.04186528564563819, 0.013386395569181158] |
1,802.01515 | Robust Vertex Enumeration for Convex Hulls in High Dimensions | Computation of the vertices of the convex hull of a set $S$ of $n$ points in
$\mathbb{R} ^m$ is a fundamental problem in computational geometry,
optimization, machine learning and more. We present "All Vertex Triangle
Algorithm" (AVTA), a robust and efficient algorithm for computing the subset
$\overline S$ of all $K$ vertices of $conv(S)$, the convex hull of $S$. If
$\Gamma_*$ is the minimum of the distances from each vertex to the convex hull
of the remaining vertices, given any $\gamma \leq \gamma_* = \Gamma_*/R$, $R$
the diameter of $S$, $AVTA$ computes $\overline S$ in $O(nK(m+ \gamma^{-2}))$
operations. If $\gamma_*$ is unknown but $K$ is known, AVTA computes $\overline
S$ in $O(nK(m+ \gamma_*^{-2})) \log(\gamma_*^{-1})$ operations. More generally,
given $t \in (0,1)$, AVTA computes a subset $\overline S^t$ of $\overline S$ in
$O(n |\overline S^t|(m+ t^{-2}))$ operations, where the distance between any $p
\in conv(S)$ to $conv(\overline S^t)$ is at most $t R$. Next we consider AVTA
where input is $S_\varepsilon$, an $\varepsilon$ perturbation of $S$. Assuming
a bound on $\varepsilon$ in terms of the minimum of the distances of vertices
of $conv(S)$ to the convex hull of the remaining point of $S$, we derive
analogous complexity bounds for computing $\overline S_\varepsilon$. We also
analyze AVTA under random projections of $S$ or $S_\varepsilon$. Finally, via
AVTA we design new practical algorithms for two popular machine learning
problems: topic modeling and non-negative matrix factorization. For topic
models AVTA leads to significantly better reconstruction of the topic-word
matrix than state of the art approaches~\cite{arora2013practical,
bansal2014provable}. For non-negative matrix AVTA is competitive with existing
methods~\cite{arora2012computing}. Empirically AVTA is robust and can handle
larger amounts of noise than existing methods.
| cs.CG | computation of the vertices of the convex hull of a set s of n points in mathbbr m is a fundamental problem in computational geometry optimization machine learning and more we present all vertex triangle algorithm avta a robust and efficient algorithm for computing the subset overline s of all k vertices of convs the convex hull of s if gamma_ is the minimum of the distances from each vertex to the convex hull of the remaining vertices given any gamma leq gamma_ gamma_r r the diameter of s avta computes overline s in onkm gamma2 operations if gamma_ is unknown but k is known avta computes overline s in onkm gamma_2 loggamma_1 operations more generally given t in 01 avta computes a subset overline st of overline s in on overline stm t2 operations where the distance between any p in convs to convoverline st is at most t r next we consider avta where input is s_varepsilon an varepsilon perturbation of s assuming a bound on varepsilon in terms of the minimum of the distances of vertices of convs to the convex hull of the remaining point of s we derive analogous complexity bounds for computing overline s_varepsilon we also analyze avta under random projections of s or s_varepsilon finally via avta we design new practical algorithms for two popular machine learning problems topic modeling and nonnegative matrix factorization for topic models avta leads to significantly better reconstruction of the topicword matrix than state of the art approachescitearora2013practical bansal2014provable for nonnegative matrix avta is competitive with existing methodscitearora2012computing empirically avta is robust and can handle larger amounts of noise than existing methods | [['computation', 'of', 'the', 'vertices', 'of', 'the', 'convex', 'hull', 'of', 'a', 'set', 's', 'of', 'n', 'points', 'in', 'mathbbr', 'm', 'is', 'a', 'fundamental', 'problem', 'in', 'computational', 'geometry', 'optimization', 'machine', 'learning', 'and', 'more', 'we', 'present', 'all', 'vertex', 'triangle', 'algorithm', 'avta', 'a', 'robust', 'and', 'efficient', 'algorithm', 'for', 'computing', 'the', 'subset', 'overline', 's', 'of', 'all', 'k', 'vertices', 'of', 'convs', 'the', 'convex', 'hull', 'of', 's', 'if', 'gamma_', 'is', 'the', 'minimum', 'of', 'the', 'distances', 'from', 'each', 'vertex', 'to', 'the', 'convex', 'hull', 'of', 'the', 'remaining', 'vertices', 'given', 'any', 'gamma', 'leq', 'gamma_', 'gamma_r', 'r', 'the', 'diameter', 'of', 's', 'avta', 'computes', 'overline', 's', 'in', 'onkm', 'gamma2', 'operations', 'if', 'gamma_', 'is', 'unknown', 'but', 'k', 'is', 'known', 'avta', 'computes', 'overline', 's', 'in', 'onkm', 'gamma_2', 'loggamma_1', 'operations', 'more', 'generally', 'given', 't', 'in', '01', 'avta', 'computes', 'a', 'subset', 'overline', 'st', 'of', 'overline', 's', 'in', 'on', 'overline', 'stm', 't2', 'operations', 'where', 'the', 'distance', 'between', 'any', 'p', 'in', 'convs', 'to', 'convoverline', 'st', 'is', 'at', 'most', 't', 'r', 'next', 'we', 'consider', 'avta', 'where', 'input', 'is', 's_varepsilon', 'an', 'varepsilon', 'perturbation', 'of', 's', 'assuming', 'a', 'bound', 'on', 'varepsilon', 'in', 'terms', 'of', 'the', 'minimum', 'of', 'the', 'distances', 'of', 'vertices', 'of', 'convs', 'to', 'the', 'convex', 'hull', 'of', 'the', 'remaining', 'point', 'of', 's', 'we', 'derive', 'analogous', 'complexity', 'bounds', 'for', 'computing', 'overline', 's_varepsilon', 'we', 'also', 'analyze', 'avta', 'under', 'random', 'projections', 'of', 's', 'or', 's_varepsilon', 'finally', 'via', 'avta', 'we', 'design', 'new', 'practical', 'algorithms', 'for', 'two', 'popular', 'machine', 'learning', 'problems', 'topic', 'modeling', 'and', 'nonnegative', 'matrix', 'factorization', 'for', 'topic', 'models', 'avta', 'leads', 'to', 'significantly', 'better', 'reconstruction', 'of', 'the', 'topicword', 'matrix', 'than', 'state', 'of', 'the', 'art', 'approachescitearora2013practical', 'bansal2014provable', 'for', 'nonnegative', 'matrix', 'avta', 'is', 'competitive', 'with', 'existing', 'methodscitearora2012computing', 'empirically', 'avta', 'is', 'robust', 'and', 'can', 'handle', 'larger', 'amounts', 'of', 'noise', 'than', 'existing', 'methods']] | [-0.15127499904030103, 0.09143416564228155, -0.04996588145476881, 0.00761017364481192, -0.047015223085308235, -0.1936318845311982, 0.08024821687888263, 0.34406058838911885, -0.3125436939207544, -0.2471827335816142, 0.05966266313365448, -0.33393226804958187, -0.0975234744850588, 0.1660834692273819, -0.08647074731673317, 0.06834680383304685, 0.06115231958299889, 0.10120017703427246, -0.09668874978140164, -0.27315587578742495, 0.26698959024783486, -0.043373024694565755, 0.16451964315292095, 0.03392827973944355, 0.07976580121334684, 0.024463613390266783, -0.003244778278505269, 0.016021172711381527, -0.17328866297284956, 0.12041377732120384, 0.26828275921934447, 0.2138242169129854, 0.25137038147408336, -0.36844974568166877, -0.11203110125264648, 0.20095347408998812, 0.11154526339369487, -0.009240480987459755, 0.039188691158844366, -0.2069703975748201, 0.1675780613894473, -0.09456303278998536, -0.06081035359473097, -0.04444475475723126, 0.14407420873097823, -0.03150805167998588, -0.3554812434865406, 0.019387415841231402, 0.07415641564091019, 0.02040992548500889, 0.013541696454513441, -0.23535875717879096, -0.00565802438920608, 0.04228965497239099, 0.001334800958295077, 0.12791079897363758, 0.09067480799250222, -0.089165765251476, -0.11792996368451177, 0.3775361678336332, -0.05176542567737551, -0.19056074012747584, 0.11644440250513091, -0.13715255041066068, -0.1221692658322497, 0.1355402437997947, 0.15766358011424425, 0.19085978711379714, -0.09044891194927014, 0.20466869608987442, -0.08109839204942967, 0.1166946678654568, 0.07120302183054779, 0.02131194025464487, 0.08432574614041838, 0.16251188670703617, 0.15846149475149782, 0.11282731682778953, -0.06896179814540436, -0.018650887543614606, -0.33611784147077733, -0.12042125225462166, -0.2358331011044915, 0.06444055441599549, -0.1652498195130528, -0.14886512187848475, 0.34088262079165, 0.08601399323351905, 0.22538741985649874, 0.10619210776670623, 0.27454046655990433, 0.051726789869098184, 0.016744984601177834, 0.18837443392807512, 0.10109434266660139, 0.12308417323955827, -0.02809265348188272, -0.2106353974559306, 0.07194445325124464, 0.11508708190897127] |
1,802.01516 | 3D non-rigid registration using color: Color Coherent Point Drift | Research into object deformations using computer vision techniques has been
under intense study in recent years. A widely used technique is 3D non-rigid
registration to estimate the transformation between two instances of a
deforming structure. Despite many previous developments on this topic, it
remains a challenging problem. In this paper we propose a novel approach to
non-rigid registration combining two data spaces in order to robustly calculate
the correspondences and transformation between two data sets. In particular, we
use point color as well as 3D location as these are the common outputs of RGB-D
cameras. We have propose the Color Coherent Point Drift (CCPD) algorithm (an
extension of the CPD method [1]). Evaluation is performed using synthetic and
real data. The synthetic data includes easy shapes that allow evaluation of the
effect of noise, outliers and missing data. Moreover, an evaluation of
realistic figures obtained using Blensor is carried out. Real data acquired
using a general purpose Primesense Carmine sensor is used to validate the CCPD
for real shapes. For all tests, the proposed method is compared to the original
CPD showing better results in registration accuracy in most cases.
| cs.CV | research into object deformations using computer vision techniques has been under intense study in recent years a widely used technique is 3d nonrigid registration to estimate the transformation between two instances of a deforming structure despite many previous developments on this topic it remains a challenging problem in this paper we propose a novel approach to nonrigid registration combining two data spaces in order to robustly calculate the correspondences and transformation between two data sets in particular we use point color as well as 3d location as these are the common outputs of rgbd cameras we have propose the color coherent point drift ccpd algorithm an extension of the cpd method 1 evaluation is performed using synthetic and real data the synthetic data includes easy shapes that allow evaluation of the effect of noise outliers and missing data moreover an evaluation of realistic figures obtained using blensor is carried out real data acquired using a general purpose primesense carmine sensor is used to validate the ccpd for real shapes for all tests the proposed method is compared to the original cpd showing better results in registration accuracy in most cases | [['research', 'into', 'object', 'deformations', 'using', 'computer', 'vision', 'techniques', 'has', 'been', 'under', 'intense', 'study', 'in', 'recent', 'years', 'a', 'widely', 'used', 'technique', 'is', '3d', 'nonrigid', 'registration', 'to', 'estimate', 'the', 'transformation', 'between', 'two', 'instances', 'of', 'a', 'deforming', 'structure', 'despite', 'many', 'previous', 'developments', 'on', 'this', 'topic', 'it', 'remains', 'a', 'challenging', 'problem', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'nonrigid', 'registration', 'combining', 'two', 'data', 'spaces', 'in', 'order', 'to', 'robustly', 'calculate', 'the', 'correspondences', 'and', 'transformation', 'between', 'two', 'data', 'sets', 'in', 'particular', 'we', 'use', 'point', 'color', 'as', 'well', 'as', '3d', 'location', 'as', 'these', 'are', 'the', 'common', 'outputs', 'of', 'rgbd', 'cameras', 'we', 'have', 'propose', 'the', 'color', 'coherent', 'point', 'drift', 'ccpd', 'algorithm', 'an', 'extension', 'of', 'the', 'cpd', 'method', '1', 'evaluation', 'is', 'performed', 'using', 'synthetic', 'and', 'real', 'data', 'the', 'synthetic', 'data', 'includes', 'easy', 'shapes', 'that', 'allow', 'evaluation', 'of', 'the', 'effect', 'of', 'noise', 'outliers', 'and', 'missing', 'data', 'moreover', 'an', 'evaluation', 'of', 'realistic', 'figures', 'obtained', 'using', 'blensor', 'is', 'carried', 'out', 'real', 'data', 'acquired', 'using', 'a', 'general', 'purpose', 'primesense', 'carmine', 'sensor', 'is', 'used', 'to', 'validate', 'the', 'ccpd', 'for', 'real', 'shapes', 'for', 'all', 'tests', 'the', 'proposed', 'method', 'is', 'compared', 'to', 'the', 'original', 'cpd', 'showing', 'better', 'results', 'in', 'registration', 'accuracy', 'in', 'most', 'cases']] | [-0.048346610416105405, -0.037052696604215674, -0.0989339570191136, 0.06088541496674565, -0.05968355269664351, -0.11336402383129944, -0.018202239168773, 0.46115876606760176, -0.23043365733770224, -0.3500793080971163, 0.11488222341142834, -0.27047607063609647, -0.19291418240147887, 0.23869347163939222, -0.13317230937101027, 0.11467451818678329, 0.12141149699498704, -0.0004045411926958172, -0.08806018468258991, -0.2546477130935453, 0.29856887790324654, 0.011479348827023955, 0.3268154631094897, 0.010770308275590027, 0.1165922159555662, 0.01981290315033838, -0.07375012390703999, 0.031124965486403932, -0.06903476895843688, 0.14209951600682408, 0.2755320780601771, 0.16782703031885393, 0.23967299531313546, -0.4142129004529533, -0.20245007973850362, 0.11167883490247124, 0.11349981116584781, 0.11607780336720787, -0.08858994316038263, -0.3079211627690988, 0.08305015107044043, -0.1306344234499144, -0.06771664776376145, -0.14253424583463606, 0.016580859488025707, -0.028357212398734122, -0.2865434653380323, 0.04086223359724456, 0.01020850561482005, 0.09592080868177992, -0.07230512696109154, -0.09501704148248456, 0.03811338736008315, 0.17421312855038654, 0.04084842741105925, 0.05764085931310002, 0.11998297088097203, -0.11746608687783866, -0.1373785758617628, 0.4035484012699422, -0.029056078971943813, -0.22324130440100948, 0.21042422975792008, -0.0678637980864468, -0.15653486258504704, 0.1251714918886954, 0.18662105238872562, 0.14656217735420096, -0.17454558048667485, 0.03706527905716725, -0.05021121163907297, 0.13976321989616858, 0.03738635164849898, -0.05923028009225251, 0.17144102153970914, 0.21095948939723397, 0.02979626045045617, 0.16912531590554242, -0.19096016511570085, -0.07051111873018899, -0.24717937844910007, -0.1177000580153199, -0.2035551772752956, -0.03161020819682946, -0.06161328461396266, -0.12725861455478213, 0.3876136919672795, 0.22686362522529727, 0.22673254036020865, 0.01249330053056147, 0.3753837622542751, 0.032686965276716266, 0.0829705274498892, 0.03257664836751562, 0.19631094414364786, 0.0797870807588738, 0.09702593942028395, -0.14573997181633558, 0.025849883837431153, 0.041984418920057026] |
1,802.01517 | Smart Contracts Software Metrics: a First Study | Smart contracts (SC) are software codes which reside and run over a
blockchain. The code can be written in different languages with the common
purpose of implementing various kinds of transactions onto the hosting
blockchain, They are ruled by the blockchain infrastructure and work in order
to satisfy conditions typical of traditional contracts. The software code must
satisfy constrains strongly context dependent which are quite different from
traditional software code. In particular, since the bytecode is uploaded in the
hosting blockchain, size, computational resources, interaction between
different parts of software are all limited and even if the specific software
languages implement more or less the same constructs of traditional languages
there is not the same freedom as in normal software development. SC software is
expected to reflect these constrains on SC software metrics which should
display metric values characteristic of the domain and different from more
traditional software metrics. We tested this hypothesis on the code of more
than twelve thousands SC written in Solidity and uploaded on the Ethereum
blockchain. We downloaded the SC from a public repository and computed the
statistics of a set of software metrics related to SC and compared them to the
metrics extracted from more traditional software projects. Our results show
that generally Smart Contracts metrics have ranges more restricted than the
corresponding metrics in traditional software systems. Some of the stylized
facts, like power law in the tail of the distribution of some metrics, are only
approximate but the lines of code follow a log normal distribution which
reminds of the same behavior already found in traditional software systems.
| cs.SE | smart contracts sc are software codes which reside and run over a blockchain the code can be written in different languages with the common purpose of implementing various kinds of transactions onto the hosting blockchain they are ruled by the blockchain infrastructure and work in order to satisfy conditions typical of traditional contracts the software code must satisfy constrains strongly context dependent which are quite different from traditional software code in particular since the bytecode is uploaded in the hosting blockchain size computational resources interaction between different parts of software are all limited and even if the specific software languages implement more or less the same constructs of traditional languages there is not the same freedom as in normal software development sc software is expected to reflect these constrains on sc software metrics which should display metric values characteristic of the domain and different from more traditional software metrics we tested this hypothesis on the code of more than twelve thousands sc written in solidity and uploaded on the ethereum blockchain we downloaded the sc from a public repository and computed the statistics of a set of software metrics related to sc and compared them to the metrics extracted from more traditional software projects our results show that generally smart contracts metrics have ranges more restricted than the corresponding metrics in traditional software systems some of the stylized facts like power law in the tail of the distribution of some metrics are only approximate but the lines of code follow a log normal distribution which reminds of the same behavior already found in traditional software systems | [['smart', 'contracts', 'sc', 'are', 'software', 'codes', 'which', 'reside', 'and', 'run', 'over', 'a', 'blockchain', 'the', 'code', 'can', 'be', 'written', 'in', 'different', 'languages', 'with', 'the', 'common', 'purpose', 'of', 'implementing', 'various', 'kinds', 'of', 'transactions', 'onto', 'the', 'hosting', 'blockchain', 'they', 'are', 'ruled', 'by', 'the', 'blockchain', 'infrastructure', 'and', 'work', 'in', 'order', 'to', 'satisfy', 'conditions', 'typical', 'of', 'traditional', 'contracts', 'the', 'software', 'code', 'must', 'satisfy', 'constrains', 'strongly', 'context', 'dependent', 'which', 'are', 'quite', 'different', 'from', 'traditional', 'software', 'code', 'in', 'particular', 'since', 'the', 'bytecode', 'is', 'uploaded', 'in', 'the', 'hosting', 'blockchain', 'size', 'computational', 'resources', 'interaction', 'between', 'different', 'parts', 'of', 'software', 'are', 'all', 'limited', 'and', 'even', 'if', 'the', 'specific', 'software', 'languages', 'implement', 'more', 'or', 'less', 'the', 'same', 'constructs', 'of', 'traditional', 'languages', 'there', 'is', 'not', 'the', 'same', 'freedom', 'as', 'in', 'normal', 'software', 'development', 'sc', 'software', 'is', 'expected', 'to', 'reflect', 'these', 'constrains', 'on', 'sc', 'software', 'metrics', 'which', 'should', 'display', 'metric', 'values', 'characteristic', 'of', 'the', 'domain', 'and', 'different', 'from', 'more', 'traditional', 'software', 'metrics', 'we', 'tested', 'this', 'hypothesis', 'on', 'the', 'code', 'of', 'more', 'than', 'twelve', 'thousands', 'sc', 'written', 'in', 'solidity', 'and', 'uploaded', 'on', 'the', 'ethereum', 'blockchain', 'we', 'downloaded', 'the', 'sc', 'from', 'a', 'public', 'repository', 'and', 'computed', 'the', 'statistics', 'of', 'a', 'set', 'of', 'software', 'metrics', 'related', 'to', 'sc', 'and', 'compared', 'them', 'to', 'the', 'metrics', 'extracted', 'from', 'more', 'traditional', 'software', 'projects', 'our', 'results', 'show', 'that', 'generally', 'smart', 'contracts', 'metrics', 'have', 'ranges', 'more', 'restricted', 'than', 'the', 'corresponding', 'metrics', 'in', 'traditional', 'software', 'systems', 'some', 'of', 'the', 'stylized', 'facts', 'like', 'power', 'law', 'in', 'the', 'tail', 'of', 'the', 'distribution', 'of', 'some', 'metrics', 'are', 'only', 'approximate', 'but', 'the', 'lines', 'of', 'code', 'follow', 'a', 'log', 'normal', 'distribution', 'which', 'reminds', 'of', 'the', 'same', 'behavior', 'already', 'found', 'in', 'traditional', 'software', 'systems']] | [-0.13409368607217334, 0.03776508594969904, -0.06929509042713203, 0.10131358306288642, -0.08018680892208997, -0.19951486356444376, 0.003958053527140808, 0.379695866467025, -0.25127254283476685, -0.3386652061813756, 0.12379699737083909, -0.2993444093289484, -0.07297308476645276, 0.25256847606423044, -0.0768582332530606, 0.03561596214930795, 0.06393685429383252, 0.016838645021592203, -0.09788520284446965, -0.3037016240344208, 0.3278646675845314, 0.04708477499355611, 0.3275542808565332, 0.023466415620252274, -0.0074466707095629855, -0.06267279030797177, -0.05853160910126298, 0.013882881302221966, -0.0846972423195596, 0.1283616714890262, 0.3074607219018788, 0.24745358894342234, 0.27015586300662026, -0.42744436447291556, -0.15381750663658394, 0.05920361559505442, 0.11744488857220858, 0.059856583339799395, 0.018440111023336703, -0.26379336102049855, 0.10971673121815897, -0.23632696898885183, -0.08392729308837815, -0.03170798496252164, -0.024752849529154207, 0.05980171946654642, -0.18342658316325292, -0.039785507630514805, 0.02978988108050106, 0.09387600614822336, -0.0028312505473193704, -0.12103631465058577, -0.06675513017322182, 0.1510737134514401, 0.04333816751701183, 0.010933751446068903, 0.14444266771131783, -0.09841011871896244, -0.11512920001864825, 0.42157162637694884, 0.0008614802709211686, -0.17642800727617555, 0.2009417406612433, -0.061552081961723924, -0.15088192232765427, 0.08226693158223525, 0.19533363941691892, 0.08200435421952677, -0.19374764301723107, 0.05746923909147088, 0.014756160877956623, 0.2129618733118225, 0.05841755368431708, 0.034507423643674, 0.19808682043186768, 0.1387782165600351, 0.01352635141255516, 0.10395913016855457, 0.011747507171778016, -0.12051310290843319, -0.25670124877627615, -0.1497207172818944, -0.152905380728399, 0.0021902657643199505, -0.10004751286951911, -0.2045302125275191, 0.390994404288555, 0.17426973519566918, 0.09586720539193909, 0.06013207147388082, 0.3115177322739273, 0.026950579756817035, 0.176663813485827, 0.1674513714370507, 0.1520359375616063, -0.011987006968356445, 0.14262836889313057, -0.1294232650075276, 0.14379530029959584, -0.010309438266344123] |
1,802.01518 | Guided Policy Exploration for Markov Decision Processes using an
Uncertainty-Based Value-of-Information Criterion | Reinforcement learning in environments with many action-state pairs is
challenging. At issue is the number of episodes needed to thoroughly search the
policy space. Most conventional heuristics address this search problem in a
stochastic manner. This can leave large portions of the policy space unvisited
during the early training stages. In this paper, we propose an
uncertainty-based, information-theoretic approach for performing guided
stochastic searches that more effectively cover the policy space. Our approach
is based on the value of information, a criterion that provides the optimal
trade-off between expected costs and the granularity of the search process. The
value of information yields a stochastic routine for choosing actions during
learning that can explore the policy space in a coarse to fine manner. We
augment this criterion with a state-transition uncertainty factor, which guides
the search process into previously unexplored regions of the policy space.
| cs.AI | reinforcement learning in environments with many actionstate pairs is challenging at issue is the number of episodes needed to thoroughly search the policy space most conventional heuristics address this search problem in a stochastic manner this can leave large portions of the policy space unvisited during the early training stages in this paper we propose an uncertaintybased informationtheoretic approach for performing guided stochastic searches that more effectively cover the policy space our approach is based on the value of information a criterion that provides the optimal tradeoff between expected costs and the granularity of the search process the value of information yields a stochastic routine for choosing actions during learning that can explore the policy space in a coarse to fine manner we augment this criterion with a statetransition uncertainty factor which guides the search process into previously unexplored regions of the policy space | [['reinforcement', 'learning', 'in', 'environments', 'with', 'many', 'actionstate', 'pairs', 'is', 'challenging', 'at', 'issue', 'is', 'the', 'number', 'of', 'episodes', 'needed', 'to', 'thoroughly', 'search', 'the', 'policy', 'space', 'most', 'conventional', 'heuristics', 'address', 'this', 'search', 'problem', 'in', 'a', 'stochastic', 'manner', 'this', 'can', 'leave', 'large', 'portions', 'of', 'the', 'policy', 'space', 'unvisited', 'during', 'the', 'early', 'training', 'stages', 'in', 'this', 'paper', 'we', 'propose', 'an', 'uncertaintybased', 'informationtheoretic', 'approach', 'for', 'performing', 'guided', 'stochastic', 'searches', 'that', 'more', 'effectively', 'cover', 'the', 'policy', 'space', 'our', 'approach', 'is', 'based', 'on', 'the', 'value', 'of', 'information', 'a', 'criterion', 'that', 'provides', 'the', 'optimal', 'tradeoff', 'between', 'expected', 'costs', 'and', 'the', 'granularity', 'of', 'the', 'search', 'process', 'the', 'value', 'of', 'information', 'yields', 'a', 'stochastic', 'routine', 'for', 'choosing', 'actions', 'during', 'learning', 'that', 'can', 'explore', 'the', 'policy', 'space', 'in', 'a', 'coarse', 'to', 'fine', 'manner', 'we', 'augment', 'this', 'criterion', 'with', 'a', 'statetransition', 'uncertainty', 'factor', 'which', 'guides', 'the', 'search', 'process', 'into', 'previously', 'unexplored', 'regions', 'of', 'the', 'policy', 'space']] | [-0.08662167800260552, 0.08484069302368072, -0.11653896274704796, 0.07832490695497857, -0.1320360067119408, -0.1035466932096622, 0.14494207084984131, 0.42173011858378434, -0.3042869091449474, -0.35073556436691433, 0.10086504095428002, -0.19607063705593142, -0.16036013877277988, 0.1700803883124738, -0.10700701432587165, 0.04396289835131029, 0.08843615624613853, 0.015550707819380073, -0.04568978858232084, -0.26017646280039725, 0.32252802370607647, 0.09958828957233992, 0.28713169232166064, -0.031394157904691786, 0.12354447937418121, 0.015665691869799048, -0.03186044875837979, -0.013468921033563674, -0.11814759652037941, 0.14480022369470033, 0.32046793106322485, 0.22465017034038384, 0.38098147739138866, -0.3696122189026533, -0.20868109695826811, 0.15590234206441286, 0.14632124255816356, 0.10370480941168757, -0.04602869766687137, -0.29061217288189156, 0.047145781323908724, -0.13358394067230014, -0.02403640934790019, -0.08198369773001307, -0.0443863732378102, -0.06828424546822337, -0.31104622698492473, -0.00215043086872255, 0.028531701653264463, -0.006181576434755698, -0.0522502953552046, -0.07072176612564363, 0.03324980898145845, 0.13462091217742353, 0.039499459409449225, 0.056124453641435444, 0.1467356305575878, -0.13893555637009236, -0.1546446015288691, 0.357856907712024, -0.022152266739996977, -0.19694415116423947, 0.16949971133241584, -0.07057023040316482, -0.15060924254875216, 0.15033261028293055, 0.23164756329626673, 0.16838705286904265, -0.18183521555571738, 0.050204571400778754, -0.02800940644616882, 0.15867298093507998, 0.010692361638777785, 0.023818316014512675, 0.16565594635742148, 0.27256260629251805, 0.13557994634053708, 0.14797871535928506, -0.07822459683747082, -0.12336498258324961, -0.2786174602903581, -0.14335869206762356, -0.136956114551544, -0.036679216654091656, -0.11483315113734231, -0.12060306909390622, 0.35292678708922015, 0.20200042396512194, 0.21931185739918468, 0.08067811103359822, 0.3193691124389362, 0.09407902167731663, 0.0478308431605304, 0.11283120019329039, 0.20718557446121444, -0.022917842032863216, 0.1389545152099648, -0.20238170662681418, 0.13537785853420953, 0.09003585696821877] |
1,802.01519 | Turbulence in active fluids caused by self-propulsion | A rigoros analytical justification of turbulence observed in active fluids
and caused by self-propulsion is presented. We prove existence of unstable wave
modes for the generalized Stokes and Navier-Stokes systems by developing an
approach in spaces of Fourier transformed Radon measures.
| math.AP | a rigoros analytical justification of turbulence observed in active fluids and caused by selfpropulsion is presented we prove existence of unstable wave modes for the generalized stokes and navierstokes systems by developing an approach in spaces of fourier transformed radon measures | [['a', 'rigoros', 'analytical', 'justification', 'of', 'turbulence', 'observed', 'in', 'active', 'fluids', 'and', 'caused', 'by', 'selfpropulsion', 'is', 'presented', 'we', 'prove', 'existence', 'of', 'unstable', 'wave', 'modes', 'for', 'the', 'generalized', 'stokes', 'and', 'navierstokes', 'systems', 'by', 'developing', 'an', 'approach', 'in', 'spaces', 'of', 'fourier', 'transformed', 'radon', 'measures']] | [-0.1792590801604092, 0.15559636708676408, -0.11370789660140872, 0.08795718220353592, -0.006475049629807472, -0.10978420231258497, -0.028734004963189362, 0.27411955702118573, -0.2499736532336101, -0.19664274514652788, 0.09599494035937824, -0.23111215885728598, -0.16340369335375726, 0.2171769286505878, -0.059588016313500705, 0.12931919302791356, 0.022659944160841404, -0.0774445045273751, -0.004532948904670775, -0.11965308579092379, 0.3498715226538479, -0.017211699500330725, 0.29264975553378464, -0.015068701782729477, 0.13718077437952161, -0.022164794837590308, -0.08446111553348601, 0.05971316159702837, -0.18257006702478976, 0.08909855707315728, 0.2545715230400674, 0.08385377653758042, 0.28386740842834113, -0.46324808676727114, -0.2655502592679113, 0.07517413480672985, 0.2017181263305247, 0.04776268524583429, -0.09464532531346777, -0.371569399535656, 0.021286534634418784, -0.1213260730728507, -0.20206040483608376, -0.13722633469151332, 0.08683955860324204, 0.0726999611593783, -0.2836462648585439, 0.1310256347991526, 0.11879583140835166, 0.11078734176699072, -0.18581430114572867, -0.07749877418391407, -0.022222341457381844, 0.005792405630927533, 0.09621891753922682, -0.019164217507932336, 0.0888210947974585, -0.10278633896959946, -0.08627432687208056, 0.38318402441218496, -0.07055269423872232, -0.2965423924382776, 0.16917548610363156, -0.13659323216415942, -0.04203600753098726, 0.19374907659366727, 0.18744921213947235, 0.08241408061003312, -0.11173874770756811, 0.02557235185231548, -0.045172647339859394, 0.12568527966504917, 0.11138762563932687, -0.028030239325016738, 0.16964142345823346, 0.17373664737679065, 0.07267799873370677, 0.16587992045097052, -0.06882526311092078, -0.06679860409785761, -0.28722106395289304, -0.18138236184604467, -0.22463057162240146, 0.009371218237720313, -0.053516085806040795, -0.16384296669857576, 0.3504696302115917, 0.08995889613870531, 0.0728231162764132, 0.04256837210268714, 0.2783091341610998, 0.16697632311843336, -0.048647617502138016, 0.10062096518231556, 0.26675973027013244, 0.22652144400635735, 0.140606778440997, -0.21494376804912463, -0.007878400443587452, 0.18545841793529688] |
1,802.0152 | PhD thesis: Homological Quantum Codes Beyond the Toric Code | PhD thesis investigating homological quantum codes derived from curved and
higher dimensional geometries. In the first part we will consider closed
surfaces with constant negative curvature. We show how such surfaces can be
constructed and enumerate all quantum codes derived from them which have less
than 10.000 physical qubits. For codes that are extremal in a certain sense we
perform numerical simulations to determine the value of their threshold.
Furthermore, we give evidence that these codes can be used for more overhead
efficient storage as compared to the surface code by orders of magnitude. We
also show how to read and write the encoded qubits while keeping their
connectivity low. In the second part we consider codes in which qubits are
layed-out according to a four- dimensional geometry. Such codes allow for much
simpler decoding schemes compared to codes which are two-dimensional. In
particular, measurements do not necessarily have to be repeated to obtain
reliable information about the error and the classical hardware performing the
error correction is greatly simplified. We perform numerical simulations to
analyze the performance of these codes using decoders based on local updates.
We also introduce a novel decoder based on techniques from machine learning and
image recognition to decode four-dimensional codes.
| quant-ph | phd thesis investigating homological quantum codes derived from curved and higher dimensional geometries in the first part we will consider closed surfaces with constant negative curvature we show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10000 physical qubits for codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold furthermore we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude we also show how to read and write the encoded qubits while keeping their connectivity low in the second part we consider codes in which qubits are layedout according to a four dimensional geometry such codes allow for much simpler decoding schemes compared to codes which are twodimensional in particular measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified we perform numerical simulations to analyze the performance of these codes using decoders based on local updates we also introduce a novel decoder based on techniques from machine learning and image recognition to decode fourdimensional codes | [['phd', 'thesis', 'investigating', 'homological', 'quantum', 'codes', 'derived', 'from', 'curved', 'and', 'higher', 'dimensional', 'geometries', 'in', 'the', 'first', 'part', 'we', 'will', 'consider', 'closed', 'surfaces', 'with', 'constant', 'negative', 'curvature', 'we', 'show', 'how', 'such', 'surfaces', 'can', 'be', 'constructed', 'and', 'enumerate', 'all', 'quantum', 'codes', 'derived', 'from', 'them', 'which', 'have', 'less', 'than', '10000', 'physical', 'qubits', 'for', 'codes', 'that', 'are', 'extremal', 'in', 'a', 'certain', 'sense', 'we', 'perform', 'numerical', 'simulations', 'to', 'determine', 'the', 'value', 'of', 'their', 'threshold', 'furthermore', 'we', 'give', 'evidence', 'that', 'these', 'codes', 'can', 'be', 'used', 'for', 'more', 'overhead', 'efficient', 'storage', 'as', 'compared', 'to', 'the', 'surface', 'code', 'by', 'orders', 'of', 'magnitude', 'we', 'also', 'show', 'how', 'to', 'read', 'and', 'write', 'the', 'encoded', 'qubits', 'while', 'keeping', 'their', 'connectivity', 'low', 'in', 'the', 'second', 'part', 'we', 'consider', 'codes', 'in', 'which', 'qubits', 'are', 'layedout', 'according', 'to', 'a', 'four', 'dimensional', 'geometry', 'such', 'codes', 'allow', 'for', 'much', 'simpler', 'decoding', 'schemes', 'compared', 'to', 'codes', 'which', 'are', 'twodimensional', 'in', 'particular', 'measurements', 'do', 'not', 'necessarily', 'have', 'to', 'be', 'repeated', 'to', 'obtain', 'reliable', 'information', 'about', 'the', 'error', 'and', 'the', 'classical', 'hardware', 'performing', 'the', 'error', 'correction', 'is', 'greatly', 'simplified', 'we', 'perform', 'numerical', 'simulations', 'to', 'analyze', 'the', 'performance', 'of', 'these', 'codes', 'using', 'decoders', 'based', 'on', 'local', 'updates', 'we', 'also', 'introduce', 'a', 'novel', 'decoder', 'based', 'on', 'techniques', 'from', 'machine', 'learning', 'and', 'image', 'recognition', 'to', 'decode', 'fourdimensional', 'codes']] | [-0.10910074066813671, 0.06886147941553557, -0.059897761997516924, 0.09804797791137655, -0.0393053131802689, -0.23112957683142002, 0.029503803820599143, 0.41361288361012843, -0.25967655550779367, -0.30729787896682575, 0.1307695371166962, -0.24196629092642447, -0.15648321929251457, 0.23932014629301593, -0.11466390799004131, 0.07503868614482444, 0.07563276453534278, 0.04390131926913632, -0.1504827510156646, -0.33868176904961284, 0.3031551795046231, 0.11865140341290432, 0.25044227883492304, 0.0037485614941432707, 0.06538326964804494, -0.023377162247623613, -0.03329520665518031, 0.01761394990235425, -0.18479910836457106, 0.1342794192228012, 0.2882522237407634, 0.13616987375724243, 0.19342736067341232, -0.46096403228073585, -0.22396148560687945, 0.0731544195810651, 0.1568012880592993, 0.20363667078441144, -0.033377018131148184, -0.2248962771102059, 0.1439034209336813, -0.17758335676612105, -0.021739481367943125, -0.12452439391394941, -0.04757645724613856, 0.00605936546372704, -0.23426418310349306, 0.012143436544177282, 0.030660656096822603, 0.07157906554383793, -0.00829418130877723, -0.1189135304527221, 0.023061817711809787, 0.15926804531978944, -0.0013745705824254489, 0.021022426061582094, 0.10567495276151997, -0.08502966148371342, -0.1495025863819869, 0.3630001872323635, -0.027961626920704277, -0.2492932375009376, 0.1749076906114635, -0.09614970539753302, -0.10147552925230163, 0.11447352755860221, 0.22848063351859044, 0.12707409576126716, -0.11143166427614122, 0.04620570428200952, -0.0013047661961669602, 0.188985604313259, 0.07401872947584928, 0.09461624822238597, 0.15995639010741397, 0.08237762025830041, 0.049633543526117756, 0.16818756710385857, -0.07237616920426329, -0.08625661753708633, -0.2735980794526546, -0.15474977361424486, -0.16192085897697636, 0.06605045243184843, -0.07394252765615664, -0.14726159131245278, 0.3738912706740382, 0.19166570000503802, 0.15597934014016263, 0.1012844930363183, 0.2972267666967904, 0.06026637932490103, 0.11773386977317675, 0.17000810100992278, 0.2066662698120969, 0.13247027132410283, 0.023477248716872276, -0.17016492449641568, 0.025484677544999414, 0.08832099439303685] |
1,802.01521 | Heat content estimates for the fractional Schr\"odinger operator
$\F+\ind$ | This paper establishes by employing analytic and probabilistic techniques
estimates concerning the {\it heat content} for the fractional Schr\"odinger
operator $\F+\ind$ with $0<\alpha\leq 2$ in $\Rd$, $d\geq 2$ and $\dom$ a
Lebesgue measure set satisfying some regularity conditions.
| math.PR | this paper establishes by employing analytic and probabilistic techniques estimates concerning the it heat content for the fractional schrodinger operator find with 0alphaleq 2 in rd dgeq 2 and dom a lebesgue measure set satisfying some regularity conditions | [['this', 'paper', 'establishes', 'by', 'employing', 'analytic', 'and', 'probabilistic', 'techniques', 'estimates', 'concerning', 'the', 'it', 'heat', 'content', 'for', 'the', 'fractional', 'schrodinger', 'operator', 'find', 'with', '0alphaleq', '2', 'in', 'rd', 'dgeq', '2', 'and', 'dom', 'a', 'lebesgue', 'measure', 'set', 'satisfying', 'some', 'regularity', 'conditions']] | [-0.08035376584647518, 0.05912990319101434, -0.038274708007903474, 0.08995745341771429, -0.05676222277045446, -0.1533515254023338, 0.05339208037261606, 0.32065687465824577, -0.2448868978964655, -0.1900302393754062, 0.17487236756623084, -0.34842229590408114, -0.1226014762038463, 0.19125813777607523, -0.06453102632229657, 0.16238196169663416, 0.040359213409063066, 0.03205521951282495, -0.09441652460219829, -0.2036919125943984, 0.4123261580733876, -0.07017602433303469, 0.18716426384573998, 0.07873562464833651, 0.09944627566361114, 0.000625226389322626, -0.11584341113063458, -0.04558010085632926, -0.2699510244205349, 0.139704198478476, 0.20250750955586372, 0.12670467740022823, 0.3057197362282558, -0.39893965624076755, -0.24925612168092476, 0.17161693560008548, 0.06723285633090295, -0.03612600634560773, -0.06108815120042939, -0.31130161670673834, 0.09373286829673146, -0.08417112767500312, -0.21763737211739154, -0.09359767360882343, 0.07169678719028046, 0.0730188026117455, -0.399047811049968, 0.10387622111624009, 0.15181441587935152, 0.08140597237568152, -0.1467129892767652, -0.1269029372518784, 0.028134561860688814, 0.025309839530995016, -0.028644849644287637, 0.1089784310836541, 0.023789383029859317, -0.06484634203125576, -0.09346419146382495, 0.3061217975459601, -0.05018099970613165, -0.31457189637187283, 0.13170882084063792, -0.21574502591484865, -0.15439922173850631, 0.03633195579689192, 0.07491141577300273, 0.08015880831762363, -0.1907984873672065, 0.19554702471635355, -0.044524439659557845, 0.1363449216036028, 0.136413477851372, 0.06202318421319911, 0.019919724497748047, 0.13750844169408083, 0.20594469712753044, 0.09174233143168845, 0.004963410601608063, -0.03213599064436398, -0.3459962270173587, -0.17753454795303314, -0.1707412698551228, 0.13130898040866382, -0.1444530074207394, -0.13880862290725896, 0.3286640760550079, 0.13811808361328745, 0.13903428525908998, 0.14679039399580737, 0.21744606591221927, 0.20061618513404697, -0.06486749295819257, 0.135591362063822, 0.07286887297538526, 0.15347572600340323, 0.1929963384509871, -0.1612405721312634, 0.00864651979339358, 0.16781336600941263] |
1,802.01522 | Background subtraction using the factored 3-way restricted Boltzmann
machines | In this paper, we proposed a method for reconstructing the 3D model based on
continuous sensory input. The robot can draw on extremely large data from the
real world using various sensors. However, the sensory inputs are usually too
noisy and high-dimensional data. It is very difficult and time consuming for
robot to process using such raw data when the robot tries to construct 3D
model. Hence, there needs to be a method that can extract useful information
from such sensory inputs. To address this problem our method utilizes the
concept of Object Semantic Hierarchy (OSH). Different from the previous work
that used this hierarchy framework, we extract the motion information using the
Deep Belief Network technique instead of applying classical computer vision
approaches. We have trained on two large sets of random dot images (10,000)
which are translated and rotated, respectively, and have successfully extracted
several bases that explain the translation and rotation motion. Based on this
translation and rotation bases, background subtraction have become possible
using Object Semantic Hierarchy.
| cs.CV cs.LG eess.IV | in this paper we proposed a method for reconstructing the 3d model based on continuous sensory input the robot can draw on extremely large data from the real world using various sensors however the sensory inputs are usually too noisy and highdimensional data it is very difficult and time consuming for robot to process using such raw data when the robot tries to construct 3d model hence there needs to be a method that can extract useful information from such sensory inputs to address this problem our method utilizes the concept of object semantic hierarchy osh different from the previous work that used this hierarchy framework we extract the motion information using the deep belief network technique instead of applying classical computer vision approaches we have trained on two large sets of random dot images 10000 which are translated and rotated respectively and have successfully extracted several bases that explain the translation and rotation motion based on this translation and rotation bases background subtraction have become possible using object semantic hierarchy | [['in', 'this', 'paper', 'we', 'proposed', 'a', 'method', 'for', 'reconstructing', 'the', '3d', 'model', 'based', 'on', 'continuous', 'sensory', 'input', 'the', 'robot', 'can', 'draw', 'on', 'extremely', 'large', 'data', 'from', 'the', 'real', 'world', 'using', 'various', 'sensors', 'however', 'the', 'sensory', 'inputs', 'are', 'usually', 'too', 'noisy', 'and', 'highdimensional', 'data', 'it', 'is', 'very', 'difficult', 'and', 'time', 'consuming', 'for', 'robot', 'to', 'process', 'using', 'such', 'raw', 'data', 'when', 'the', 'robot', 'tries', 'to', 'construct', '3d', 'model', 'hence', 'there', 'needs', 'to', 'be', 'a', 'method', 'that', 'can', 'extract', 'useful', 'information', 'from', 'such', 'sensory', 'inputs', 'to', 'address', 'this', 'problem', 'our', 'method', 'utilizes', 'the', 'concept', 'of', 'object', 'semantic', 'hierarchy', 'osh', 'different', 'from', 'the', 'previous', 'work', 'that', 'used', 'this', 'hierarchy', 'framework', 'we', 'extract', 'the', 'motion', 'information', 'using', 'the', 'deep', 'belief', 'network', 'technique', 'instead', 'of', 'applying', 'classical', 'computer', 'vision', 'approaches', 'we', 'have', 'trained', 'on', 'two', 'large', 'sets', 'of', 'random', 'dot', 'images', '10000', 'which', 'are', 'translated', 'and', 'rotated', 'respectively', 'and', 'have', 'successfully', 'extracted', 'several', 'bases', 'that', 'explain', 'the', 'translation', 'and', 'rotation', 'motion', 'based', 'on', 'this', 'translation', 'and', 'rotation', 'bases', 'background', 'subtraction', 'have', 'become', 'possible', 'using', 'object', 'semantic', 'hierarchy']] | [-0.014341860748173898, 0.04563385833392453, -0.09040484036869037, 0.07166374006759171, -0.12595169760058061, -0.15974685191912086, 0.02646614578538928, 0.4315778020529719, -0.3099831358409808, -0.36208297999586625, 0.11889927634119726, -0.24771129413458862, -0.1931981759047822, 0.22438510000291798, -0.12422000851525723, 0.1239122315759264, 0.12387165875645213, 0.04999229188855977, -0.02078703418271943, -0.23140086011405578, 0.33230228344392443, -0.016236505249402164, 0.3119523098405685, -0.03532544010433189, 0.16887985765784216, -0.005202234654594758, -0.05277857237443742, 0.0029404368625997363, -0.04683502285658043, 0.17926611053302602, 0.29153997729374476, 0.21485257280271566, 0.24464882120533646, -0.4644006765529252, -0.1978857706778149, 0.10465602068853774, 0.13735900672931464, 0.15333051667943576, -0.03635437781405118, -0.34752668601961817, 0.09083897068181582, -0.14590776833155525, 0.008935539670048924, -0.14980805484640647, -0.00455533169898918, -0.03709857363719493, -0.2605145985903273, 0.023386195661467418, 0.03956825818903254, 0.07297836235970837, -0.04846845390492974, -0.0757260614112891, 0.011886283054768125, 0.20644344056344438, 0.021160830261440382, 0.08301401586538693, 0.15730133709328914, -0.11598047184926724, -0.11014751890369238, 0.3769915375017087, -0.020546247441272595, -0.2672666959431872, 0.20611640806337111, -0.0841301451859266, -0.15491982796420042, 0.10493135203747624, 0.22997003224030224, 0.11201019179789426, -0.1816917072689026, 0.028350840339693106, -0.04661734535614824, 0.2031801918450721, 0.06090764183011886, -0.012927588775252912, 0.20202668018064499, 0.20233623483436106, 0.009313225777471188, 0.11754551417077211, -0.15873572351247595, -0.08237010716598166, -0.2136976787962063, -0.07553547883831095, -0.22292299273734292, -0.0025416864408997065, -0.08962548503938828, -0.12105001719281817, 0.3634804801658689, 0.26474595435163856, 0.23690352105870516, 0.07009364983777662, 0.354884591718798, 0.05242874893313546, 0.11268378294220097, 0.05345115383912684, 0.173805758389726, 0.04755626479436082, 0.14837417106705103, -0.15070125617615182, 0.07566695897404258, 0.034496696565125946] |
1,802.01523 | Multilayer Network Modeling of Integrated Biological Systems | Biological systems, from a cell to the human brain, are inherently complex. A
powerful representation of such systems, described by an intricate web of
relationships across multiple scales, is provided by complex networks.
Recently, several studies are highlighting how simple networks -- obtained by
aggregating or neglecting temporal or categorical description of biological
data -- are not able to account for the richness of information characterizing
biological systems. More complex models, namely multilayer networks, are needed
to account for interdependencies, often varying across time, of biological
interacting units within a cell, a tissue or parts of an organism.
| q-bio.QM cond-mat.dis-nn physics.bio-ph | biological systems from a cell to the human brain are inherently complex a powerful representation of such systems described by an intricate web of relationships across multiple scales is provided by complex networks recently several studies are highlighting how simple networks obtained by aggregating or neglecting temporal or categorical description of biological data are not able to account for the richness of information characterizing biological systems more complex models namely multilayer networks are needed to account for interdependencies often varying across time of biological interacting units within a cell a tissue or parts of an organism | [['biological', 'systems', 'from', 'a', 'cell', 'to', 'the', 'human', 'brain', 'are', 'inherently', 'complex', 'a', 'powerful', 'representation', 'of', 'such', 'systems', 'described', 'by', 'an', 'intricate', 'web', 'of', 'relationships', 'across', 'multiple', 'scales', 'is', 'provided', 'by', 'complex', 'networks', 'recently', 'several', 'studies', 'are', 'highlighting', 'how', 'simple', 'networks', 'obtained', 'by', 'aggregating', 'or', 'neglecting', 'temporal', 'or', 'categorical', 'description', 'of', 'biological', 'data', 'are', 'not', 'able', 'to', 'account', 'for', 'the', 'richness', 'of', 'information', 'characterizing', 'biological', 'systems', 'more', 'complex', 'models', 'namely', 'multilayer', 'networks', 'are', 'needed', 'to', 'account', 'for', 'interdependencies', 'often', 'varying', 'across', 'time', 'of', 'biological', 'interacting', 'units', 'within', 'a', 'cell', 'a', 'tissue', 'or', 'parts', 'of', 'an', 'organism']] | [-0.10429175253739231, 0.11505075634613604, -0.018491148861357942, 0.11923756484005328, -0.067128859149913, -0.14392519650573377, -0.013451247825287282, 0.4043540870770812, -0.2914405151047201, -0.31693337958616513, 0.056538119334921554, -0.2546362443504222, -0.2592575543894782, 0.2187896613331759, -0.061083595780170676, 0.038091024791356176, 0.052489989693034055, 0.018936529619774472, 0.03834645829435127, -0.21227897514472716, 0.31944871362065896, 0.0337901529710507, 0.26598555079544894, -0.006200881731274421, 0.1231626601232468, -0.009117313888661252, -0.07870278761159473, 0.0692106268494778, -0.0386884688474917, 0.20534006071587405, 0.331529115997796, 0.1788618630671408, 0.31037006809492595, -0.5409194141975604, -0.34144035711263615, 0.11269474563111241, 0.1712434884684626, 0.08577052453377594, 0.031908651306215084, -0.3039545459517588, 0.06460211677767802, -0.11719138065624672, -0.060389369158656336, -0.14071395684732124, 0.029127071427258972, 0.05326185808128988, -0.24097747186897323, 0.07310863817110658, 0.04469468616783464, 0.1373311709127544, -0.06952320287624995, -0.06206203492668768, -0.03606576385209337, 0.23261868239933392, -0.01688523227009379, -0.05909299051684987, 0.18327585734368768, -0.1909598596879126, -0.1175589829411668, 0.3954294105545462, 0.06926918008684879, -0.22663568755281935, 0.27906773886449326, -0.07096353069452259, -0.1470964346178031, 0.12825214424325773, 0.19822683156235144, 0.047727839167540274, -0.2512495740969219, 0.00697530454885964, 0.0008961863932199776, 0.20952384547854308, 0.042748862666485365, 0.039452450029784814, 0.23722749372245744, 0.25435447427056107, -0.03061523882691593, 0.08568285344032726, -0.021394349241745658, -0.14395237060186142, -0.17461723141544402, -0.10450166753920105, -0.1616566753339915, 0.02872537025617324, -0.14214712741037752, -0.16675620906850477, 0.3856748655671254, 0.10783613902943519, 0.23166177206561164, 0.07335287028339128, 0.2996089299461649, 0.028165447981640074, 0.1255855559805544, -0.020932991765827563, 0.10647666630878423, 0.0961448198625779, 0.12256427766988054, -0.1425860847933412, 0.12771142625085, -0.027186641202812705] |
1,802.01524 | Diffraction of a CW atom laser in the Raman-Nath regime | Atom interferometry is the most successful technique for precision metrology.
However, current interferometers using ultracold atoms allows one to probe the
interference pattern only momentarily and has finite duty cycle, resulting in
an aliasing effect and a low-bandwidth measurement -- also known as Dick
effect. Interferometry with a continuous-wave atom laser shows promise in
overcoming these limitations due a continuous monitoring of the interference
pattern. In this work, we demonstrate a key step towards such an interferometry
by demonstrating a diffraction of an `atom laser' in the Raman-Nath regime. We
outcouple a continuous beam of coherent atoms from a reservoir of $^{87}$Rb
Bose-Einstein condensate (BEC) upto 400 ms. The `atom laser' interacts with a
grating formed by a standing wave of a far detuned laser light. The atom laser
diffracts into several orders going up to 9$^{th}$ order or up to momenta of
$\pm 18\ \hbar k$. We have characterized the diffraction of atom laser for
different conditions and the results match with numerical simulations. Such
atom laser will allow for construction of an atom-interferometer to probe
physics phenomenon continuously up to a time of the order of few hundred
millisecond.
| physics.atom-ph quant-ph | atom interferometry is the most successful technique for precision metrology however current interferometers using ultracold atoms allows one to probe the interference pattern only momentarily and has finite duty cycle resulting in an aliasing effect and a lowbandwidth measurement also known as dick effect interferometry with a continuouswave atom laser shows promise in overcoming these limitations due a continuous monitoring of the interference pattern in this work we demonstrate a key step towards such an interferometry by demonstrating a diffraction of an atom laser in the ramannath regime we outcouple a continuous beam of coherent atoms from a reservoir of 87rb boseeinstein condensate bec upto 400 ms the atom laser interacts with a grating formed by a standing wave of a far detuned laser light the atom laser diffracts into several orders going up to 9th order or up to momenta of pm 18 hbar k we have characterized the diffraction of atom laser for different conditions and the results match with numerical simulations such atom laser will allow for construction of an atominterferometer to probe physics phenomenon continuously up to a time of the order of few hundred millisecond | [['atom', 'interferometry', 'is', 'the', 'most', 'successful', 'technique', 'for', 'precision', 'metrology', 'however', 'current', 'interferometers', 'using', 'ultracold', 'atoms', 'allows', 'one', 'to', 'probe', 'the', 'interference', 'pattern', 'only', 'momentarily', 'and', 'has', 'finite', 'duty', 'cycle', 'resulting', 'in', 'an', 'aliasing', 'effect', 'and', 'a', 'lowbandwidth', 'measurement', 'also', 'known', 'as', 'dick', 'effect', 'interferometry', 'with', 'a', 'continuouswave', 'atom', 'laser', 'shows', 'promise', 'in', 'overcoming', 'these', 'limitations', 'due', 'a', 'continuous', 'monitoring', 'of', 'the', 'interference', 'pattern', 'in', 'this', 'work', 'we', 'demonstrate', 'a', 'key', 'step', 'towards', 'such', 'an', 'interferometry', 'by', 'demonstrating', 'a', 'diffraction', 'of', 'an', 'atom', 'laser', 'in', 'the', 'ramannath', 'regime', 'we', 'outcouple', 'a', 'continuous', 'beam', 'of', 'coherent', 'atoms', 'from', 'a', 'reservoir', 'of', '87rb', 'boseeinstein', 'condensate', 'bec', 'upto', '400', 'ms', 'the', 'atom', 'laser', 'interacts', 'with', 'a', 'grating', 'formed', 'by', 'a', 'standing', 'wave', 'of', 'a', 'far', 'detuned', 'laser', 'light', 'the', 'atom', 'laser', 'diffracts', 'into', 'several', 'orders', 'going', 'up', 'to', '9th', 'order', 'or', 'up', 'to', 'momenta', 'of', 'pm', '18', 'hbar', 'k', 'we', 'have', 'characterized', 'the', 'diffraction', 'of', 'atom', 'laser', 'for', 'different', 'conditions', 'and', 'the', 'results', 'match', 'with', 'numerical', 'simulations', 'such', 'atom', 'laser', 'will', 'allow', 'for', 'construction', 'of', 'an', 'atominterferometer', 'to', 'probe', 'physics', 'phenomenon', 'continuously', 'up', 'to', 'a', 'time', 'of', 'the', 'order', 'of', 'few', 'hundred', 'millisecond']] | [-0.12780953532231873, 0.2282381500751638, -0.05931473630970638, -0.017045977836670844, 0.0010223948703098455, -0.15355076878331603, 0.09694805081909229, 0.4243806196278647, -0.25223050958195115, -0.3107430388195146, 0.0310693722365326, -0.29093339057083206, -0.017873116442933677, 0.2517357300342012, -0.001652857239366169, 0.08640343089845326, 0.048585787292349296, -0.022305896006965715, -0.021927534060944852, -0.18143021809182278, 0.25953472266708943, 0.08252450295947615, 0.24999910361672703, 0.040204378634715744, 0.14199062276686739, -0.011926632715193064, 0.04234581812174599, -0.05580045759285751, -0.08787785819486568, 0.05008476958119948, 0.2416267239623458, 0.045352128586780865, 0.2879318087423024, -0.4655148496361155, -0.20721094385938302, 0.049114547351315485, 0.16332172854592117, 0.19330480779080014, -0.08636341099382232, -0.3163620896858016, -0.0343136332010066, -0.16884599593222926, -0.16944320369021673, -0.06004828222886365, 0.010205668568807212, 0.0373342666866895, -0.26749689720669073, -0.02789693058263143, 0.035956146169796976, 0.07295251732790156, -0.01131434529364158, -0.03914559506918426, 0.0665696535198214, 0.03556098343596156, -0.03645220259817219, 0.09278842248819082, 0.14036605618649015, -0.11882937396141259, -0.10457293213357365, 0.4184752187336256, -0.12460756957481958, -0.05936803964087679, 0.15891152083334562, -0.20004382026626877, -0.05815221764159536, 0.1631403000173649, 0.11160561780592329, 0.12196473864835418, -0.10470130404849586, -0.003314154045840137, -0.007707024344754724, 0.2475981584253819, 0.20104159409131267, 0.1148007350826734, 0.237509460276679, 0.21449141736865338, 0.08367134919022455, 0.14405683839424072, -0.15977031731193786, -0.052907662734536356, -0.2286505798196518, -0.10911887540423777, -0.17761071634135747, 0.06393606452245303, -0.03829786359113457, -0.07952902839384286, 0.37017577706198945, 0.1434980610471317, 0.12974385356432513, -0.05941248597258604, 0.34415575271766435, 0.12796559672447314, 0.060933803706307355, -0.04973311450969624, 0.266808671700327, 0.17311022693144257, 0.09948495140691337, -0.25466316828724783, -0.03715830937542609, -0.017825911875422065] |
1,802.01525 | Non-Radial Pulsations in Post-Outburst Novae | After an optical peak, a classical or recurrent nova settles into a brief
(days to years) period of quasi-stable thermonuclear burning in a compact
configuration nearly at the white dwarf (WD) radius. During this time, the
underlying WD becomes visible as a strong emitter of supersoft X-rays.
Observations during this phase have revealed oscillations in the X-ray emission
with periods on the order of tens of seconds. A proposed explanation for the
source of these oscillations are internal gravity waves excited by nuclear
reactions at the base of the hydrogen-burning layer. In this work, we present
the first models exhibiting unstable surface $g$-modes with periods similar to
oscillation periods found in galactic novae. However, when comparing mode
periods of our models to the observed oscillations of several novae, we find
that the modes which are excited have periods shorter than that observed.
| astro-ph.SR | after an optical peak a classical or recurrent nova settles into a brief days to years period of quasistable thermonuclear burning in a compact configuration nearly at the white dwarf wd radius during this time the underlying wd becomes visible as a strong emitter of supersoft xrays observations during this phase have revealed oscillations in the xray emission with periods on the order of tens of seconds a proposed explanation for the source of these oscillations are internal gravity waves excited by nuclear reactions at the base of the hydrogenburning layer in this work we present the first models exhibiting unstable surface gmodes with periods similar to oscillation periods found in galactic novae however when comparing mode periods of our models to the observed oscillations of several novae we find that the modes which are excited have periods shorter than that observed | [['after', 'an', 'optical', 'peak', 'a', 'classical', 'or', 'recurrent', 'nova', 'settles', 'into', 'a', 'brief', 'days', 'to', 'years', 'period', 'of', 'quasistable', 'thermonuclear', 'burning', 'in', 'a', 'compact', 'configuration', 'nearly', 'at', 'the', 'white', 'dwarf', 'wd', 'radius', 'during', 'this', 'time', 'the', 'underlying', 'wd', 'becomes', 'visible', 'as', 'a', 'strong', 'emitter', 'of', 'supersoft', 'xrays', 'observations', 'during', 'this', 'phase', 'have', 'revealed', 'oscillations', 'in', 'the', 'xray', 'emission', 'with', 'periods', 'on', 'the', 'order', 'of', 'tens', 'of', 'seconds', 'a', 'proposed', 'explanation', 'for', 'the', 'source', 'of', 'these', 'oscillations', 'are', 'internal', 'gravity', 'waves', 'excited', 'by', 'nuclear', 'reactions', 'at', 'the', 'base', 'of', 'the', 'hydrogenburning', 'layer', 'in', 'this', 'work', 'we', 'present', 'the', 'first', 'models', 'exhibiting', 'unstable', 'surface', 'gmodes', 'with', 'periods', 'similar', 'to', 'oscillation', 'periods', 'found', 'in', 'galactic', 'novae', 'however', 'when', 'comparing', 'mode', 'periods', 'of', 'our', 'models', 'to', 'the', 'observed', 'oscillations', 'of', 'several', 'novae', 'we', 'find', 'that', 'the', 'modes', 'which', 'are', 'excited', 'have', 'periods', 'shorter', 'than', 'that', 'observed']] | [-0.1161146904079532, 0.22185576344812766, -0.07557251854655399, 0.09266559790219771, -0.05665455121074764, -0.10334449538528184, 0.09400959608545133, 0.38332252603837513, -0.2056446647874906, -0.3065918854234452, 0.09922883961051308, -0.29269034106429487, -0.06229113324538765, 0.2395163084245877, -0.04202111284445289, -0.025422976915495023, 0.14748791388144167, 0.013225917071087653, -0.06587422692256284, -0.24987467151532003, 0.27027164306491613, 0.06948109927364218, 0.1491173287446965, -0.07527134456986588, 0.03629469538671555, -0.0965861253412506, 0.009321952906632337, -0.11774699733605687, -0.09806468324493092, 0.005678404532504124, 0.24255866132100468, 0.05587086024444918, 0.21654583744271855, -0.4656371967604672, -0.28775013997104726, 0.07522522886349282, 0.1668881094804637, 0.07171318357620589, -0.033622937547707024, -0.25167274366552667, 0.050705748288826624, -0.17765417146417772, -0.15705260154660003, 0.03328221741142276, 0.12067939678836666, 0.0165357280475035, -0.1929119539153631, 0.10749571612367118, 0.08773560345445064, 0.06550400197656799, -0.13860379854909105, -0.07238407315797842, -0.039131128775205096, 0.04978094238260741, 0.11572999071697114, 0.03535690291417422, 0.09036680807123407, -0.07738957395547555, -0.07639540079653158, 0.34975937479478963, -0.11281338989913782, 0.050989266664107843, 0.20451489558302416, -0.1896837479172563, -0.1323833679124503, 0.19252641948963134, 0.15644024982786095, 0.14493930770221994, -0.11324710469632689, -0.0600324803758347, 0.021490752435466404, 0.21228377345595245, 0.11317683906953546, 0.07603172598813306, 0.3376595444885463, 0.2012128944789112, -0.005805887309768775, 0.09137037318711444, -0.21638223018438202, -0.07599757367771276, -0.2550549273162713, -0.05919851222678914, -0.08833311747556263, 0.08823524930999732, -0.025699867767734374, -0.13830026702194567, 0.43651735597014635, 0.05687524173794065, 0.2098337020856184, 0.012869711457850071, 0.285621963743068, 0.10986834318003237, 0.09502305305846984, 0.1250872850355784, 0.3466118538102896, 0.17902473332425972, 0.12946699182076615, -0.243408186741593, 0.06786680417660047, -0.004774807857244577] |
1,802.01526 | Abstractly Interpreting Argumentation Frameworks for Sharpening
Extensions | Cycles of attacking arguments pose non-trivial issues in Dung style
argumentation theory, apparent behavioural difference between odd and even
length cycles being a notable one. While a few methods were proposed for
treating them, to - in particular - enable selection of acceptable arguments in
an odd-length cycle when Dung semantics could select none, so far the issues
have been observed from a purely argument-graph-theoretic perspective. Per
contra, we consider argument graphs together with a certain lattice like
semantic structure over arguments e.g. ontology. As we show, the
semantic-argumentgraphic hybrid theory allows us to apply abstract
interpretation, a widely known methodology in static program analysis, to
formal argumentation. With this, even where no arguments in a cycle could be
selected sensibly, we could say more about arguments acceptability of an
argument framework that contains it. In a certain sense, we can verify Dung
extensions with respect to a semantic structure in this hybrid theory, to
consolidate our confidence in their suitability. By defining the theory, and by
making comparisons to existing approaches, we ultimately discover that whether
Dung semantics, or an alternative semantics such as cf2, is adequate or
problematic depends not just on an argument graph but also on the semantic
relation among the arguments in the graph.
| cs.AI | cycles of attacking arguments pose nontrivial issues in dung style argumentation theory apparent behavioural difference between odd and even length cycles being a notable one while a few methods were proposed for treating them to in particular enable selection of acceptable arguments in an oddlength cycle when dung semantics could select none so far the issues have been observed from a purely argumentgraphtheoretic perspective per contra we consider argument graphs together with a certain lattice like semantic structure over arguments eg ontology as we show the semanticargumentgraphic hybrid theory allows us to apply abstract interpretation a widely known methodology in static program analysis to formal argumentation with this even where no arguments in a cycle could be selected sensibly we could say more about arguments acceptability of an argument framework that contains it in a certain sense we can verify dung extensions with respect to a semantic structure in this hybrid theory to consolidate our confidence in their suitability by defining the theory and by making comparisons to existing approaches we ultimately discover that whether dung semantics or an alternative semantics such as cf2 is adequate or problematic depends not just on an argument graph but also on the semantic relation among the arguments in the graph | [['cycles', 'of', 'attacking', 'arguments', 'pose', 'nontrivial', 'issues', 'in', 'dung', 'style', 'argumentation', 'theory', 'apparent', 'behavioural', 'difference', 'between', 'odd', 'and', 'even', 'length', 'cycles', 'being', 'a', 'notable', 'one', 'while', 'a', 'few', 'methods', 'were', 'proposed', 'for', 'treating', 'them', 'to', 'in', 'particular', 'enable', 'selection', 'of', 'acceptable', 'arguments', 'in', 'an', 'oddlength', 'cycle', 'when', 'dung', 'semantics', 'could', 'select', 'none', 'so', 'far', 'the', 'issues', 'have', 'been', 'observed', 'from', 'a', 'purely', 'argumentgraphtheoretic', 'perspective', 'per', 'contra', 'we', 'consider', 'argument', 'graphs', 'together', 'with', 'a', 'certain', 'lattice', 'like', 'semantic', 'structure', 'over', 'arguments', 'eg', 'ontology', 'as', 'we', 'show', 'the', 'semanticargumentgraphic', 'hybrid', 'theory', 'allows', 'us', 'to', 'apply', 'abstract', 'interpretation', 'a', 'widely', 'known', 'methodology', 'in', 'static', 'program', 'analysis', 'to', 'formal', 'argumentation', 'with', 'this', 'even', 'where', 'no', 'arguments', 'in', 'a', 'cycle', 'could', 'be', 'selected', 'sensibly', 'we', 'could', 'say', 'more', 'about', 'arguments', 'acceptability', 'of', 'an', 'argument', 'framework', 'that', 'contains', 'it', 'in', 'a', 'certain', 'sense', 'we', 'can', 'verify', 'dung', 'extensions', 'with', 'respect', 'to', 'a', 'semantic', 'structure', 'in', 'this', 'hybrid', 'theory', 'to', 'consolidate', 'our', 'confidence', 'in', 'their', 'suitability', 'by', 'defining', 'the', 'theory', 'and', 'by', 'making', 'comparisons', 'to', 'existing', 'approaches', 'we', 'ultimately', 'discover', 'that', 'whether', 'dung', 'semantics', 'or', 'an', 'alternative', 'semantics', 'such', 'as', 'cf2', 'is', 'adequate', 'or', 'problematic', 'depends', 'not', 'just', 'on', 'an', 'argument', 'graph', 'but', 'also', 'on', 'the', 'semantic', 'relation', 'among', 'the', 'arguments', 'in', 'the', 'graph']] | [-0.08880773326779556, 0.04240236559133159, -0.12999335099238812, 0.1392426203490553, -0.15467420284659034, -0.16421499359719569, 0.1015873773137062, 0.39917770002673314, -0.2525747576399093, -0.34376443685103414, 0.09229659041128599, -0.2523522553795795, -0.1670315454191551, 0.1661667546365274, -0.14119462260022397, 0.004111405791396775, 0.05179480266496085, 0.07496246988544376, -0.05144857101301413, -0.2093754096754554, 0.287091332214044, 0.0285594345229428, 0.2476716948536838, 0.04600881611610331, 0.03412056373682146, 0.01506951692252897, -0.04586984319527202, 0.07061913933196082, -0.11575160431711105, 0.14076961696874804, 0.3082962521238298, 0.19758570231383712, 0.3183840885894691, -0.44208285799022856, -0.1981939274847519, 0.0801912772707732, 0.12283029056902373, 0.11757847896170882, 0.02033823302616195, -0.26880270915287663, 0.11036501636774075, -0.18867879320495398, -0.1124034112796369, -0.11680945389642858, 0.02592521860894588, -0.018398666463894542, -0.2103764991724591, -0.015074463383005023, 0.11963528704803959, 0.1011904505603924, -0.031231275248261758, -0.08711271686025146, -0.0038587394142069104, 0.09036509244455729, 0.05270936744764629, 0.01569174080405657, 0.09189240468535345, -0.09477561011600945, -0.18088600258854012, 0.3623364223394452, -0.02330320803193012, -0.20527945771904255, 0.22250282995561818, -0.06329595682540591, -0.20039684179625133, 0.05853355922714932, 0.08520564246843228, 0.11336237967196035, -0.1408454377179335, 0.063359030985228, -0.05737095992648747, 0.21351636550502806, 0.09154787752777338, 0.02457879685353851, 0.22226002011959237, 0.16044274792756613, 0.042006400116810165, 0.09777969106202718, 0.009084580526204507, -0.11204992083423748, -0.2899773902327913, -0.12049722795533697, -0.11390055675405963, 0.03286498491943348, -0.09529818475300378, -0.1718975867599067, 0.34074748303832075, 0.21517758530723613, 0.17618733828251318, 0.05515429155742068, 0.28592420592449785, 0.07785200212639189, 0.09211713552883849, 0.05403877700616538, 0.1951855640131526, 0.09097078111556518, 0.07608524251377165, -0.11387426233168964, 0.09879272380139588, 0.09603448751973125] |
1,802.01527 | Supporting UAV Cellular Communications through Massive MIMO | In this article, we provide a much-needed study of UAV cellular
communications, focusing on the rates achievable for the UAV downlink command
and control (C&C) channel. For this key performance indicator, we perform a
realistic comparison between existing deployments operating in single-user mode
and next-generation multi-user massive MIMO systems. We find that in
single-user deployments under heavy data traffic, UAVs flying at 50 m, 150 m,
and 300 m achieve the C&C target rate of 100 kbps -- as set by the 3GPP -- in a
mere 35%, 2%, and 1% of the cases, respectively. Owing to mitigated
interference, a stronger carrier signal, and a spatial multiplexing gain,
massive MIMO time division duplex systems can dramatically increase such
probability. Indeed, we show that for UAV heights up to 300 m the target rate
is met with massive MIMO in 74% and 96% of the cases with and without uplink
pilot reuse for channel state information (CSI) acquisition, respectively. On
the other hand, the presence of UAVs can significantly degrade the performance
of ground users, whose pilot signals are vulnerable to UAV-generated
contamination and require protection through uplink power control.
| cs.IT math.IT | in this article we provide a muchneeded study of uav cellular communications focusing on the rates achievable for the uav downlink command and control cc channel for this key performance indicator we perform a realistic comparison between existing deployments operating in singleuser mode and nextgeneration multiuser massive mimo systems we find that in singleuser deployments under heavy data traffic uavs flying at 50 m 150 m and 300 m achieve the cc target rate of 100 kbps as set by the 3gpp in a mere 35 2 and 1 of the cases respectively owing to mitigated interference a stronger carrier signal and a spatial multiplexing gain massive mimo time division duplex systems can dramatically increase such probability indeed we show that for uav heights up to 300 m the target rate is met with massive mimo in 74 and 96 of the cases with and without uplink pilot reuse for channel state information csi acquisition respectively on the other hand the presence of uavs can significantly degrade the performance of ground users whose pilot signals are vulnerable to uavgenerated contamination and require protection through uplink power control | [['in', 'this', 'article', 'we', 'provide', 'a', 'muchneeded', 'study', 'of', 'uav', 'cellular', 'communications', 'focusing', 'on', 'the', 'rates', 'achievable', 'for', 'the', 'uav', 'downlink', 'command', 'and', 'control', 'cc', 'channel', 'for', 'this', 'key', 'performance', 'indicator', 'we', 'perform', 'a', 'realistic', 'comparison', 'between', 'existing', 'deployments', 'operating', 'in', 'singleuser', 'mode', 'and', 'nextgeneration', 'multiuser', 'massive', 'mimo', 'systems', 'we', 'find', 'that', 'in', 'singleuser', 'deployments', 'under', 'heavy', 'data', 'traffic', 'uavs', 'flying', 'at', '50', 'm', '150', 'm', 'and', '300', 'm', 'achieve', 'the', 'cc', 'target', 'rate', 'of', '100', 'kbps', 'as', 'set', 'by', 'the', '3gpp', 'in', 'a', 'mere', '35', '2', 'and', '1', 'of', 'the', 'cases', 'respectively', 'owing', 'to', 'mitigated', 'interference', 'a', 'stronger', 'carrier', 'signal', 'and', 'a', 'spatial', 'multiplexing', 'gain', 'massive', 'mimo', 'time', 'division', 'duplex', 'systems', 'can', 'dramatically', 'increase', 'such', 'probability', 'indeed', 'we', 'show', 'that', 'for', 'uav', 'heights', 'up', 'to', '300', 'm', 'the', 'target', 'rate', 'is', 'met', 'with', 'massive', 'mimo', 'in', '74', 'and', '96', 'of', 'the', 'cases', 'with', 'and', 'without', 'uplink', 'pilot', 'reuse', 'for', 'channel', 'state', 'information', 'csi', 'acquisition', 'respectively', 'on', 'the', 'other', 'hand', 'the', 'presence', 'of', 'uavs', 'can', 'significantly', 'degrade', 'the', 'performance', 'of', 'ground', 'users', 'whose', 'pilot', 'signals', 'are', 'vulnerable', 'to', 'uavgenerated', 'contamination', 'and', 'require', 'protection', 'through', 'uplink', 'power', 'control']] | [-0.26855706517905076, 0.0627838012597133, 0.04901602549443362, 0.013482539010139042, -0.016964493101582892, -0.2342887504717275, 0.15067667710176738, 0.3793355304126938, -0.20588980632163184, -0.3245823357669857, 0.11359406482135397, -0.2432293026847014, -0.11862649148209922, 0.1783101573856848, -0.09666592519860515, 0.04425450985323668, 0.07923280671476737, 0.024921559930374714, -0.02994011126468659, -0.25622143914988166, 0.26443115147882174, 0.12886671512638048, 0.3645962599003988, 0.006853287586108631, 0.0489983451108308, 0.0072602604716760855, -0.021306666888556973, -0.100690587608868, -0.08452056495822348, 0.03458854891309735, 0.3461736618360925, 0.21378669365727274, 0.25985784112646054, -0.4097904029160848, -0.24389621446169513, 0.088912984734321, 0.20800184197874078, 0.04038315410575559, -0.06883822445024146, -0.2979681719262253, 0.17439065374601734, -0.25459470952390345, -0.04703585420715152, 0.059397444777411, -0.05883596307768296, 0.04249184931376799, -0.34811995951058244, 0.028398751779096402, -0.021582713411990754, 0.08132636591194227, -0.053503961818072425, -0.12795335020098875, 0.015461361352404359, 0.1606967005382983, 0.008916963625358798, 0.0005966453538877108, 0.14069816237816246, -0.10541479039176177, -0.07487016325060439, 0.39322081529184855, -0.021801869050719805, -0.21817275129198546, 0.20296666241233408, -0.13432358096977096, -0.0595785405797263, 0.1928743401852747, 0.27745447814591623, 0.040006010219835304, -0.1632444883273634, 0.003838032373272243, 0.03158180039846689, 0.19951904167155785, 0.1102604453792415, 0.16247979721920666, 0.16064220824859715, 0.22467255249859824, 0.15577260021906425, 0.08735559531268464, -0.19670701767968876, -0.08696508080378094, -0.17757956961123522, -0.1291178472470605, -0.15525032778477713, 0.060437280325449365, -0.07913256384011719, 0.007916676090849985, 0.33372461074282245, 0.13870438353298734, 0.09304082384117082, 0.12856936622511156, 0.390114052311307, 0.055136133755274964, 0.07762263418846232, 0.10583821241305741, 0.2231372009101574, 0.07720323214282392, 0.16796834544549066, -0.22482958066487505, -0.0015564287351744791, -0.10801315855645445] |
1,802.01528 | The Matrix Calculus You Need For Deep Learning | This paper is an attempt to explain all the matrix calculus you need in order
to understand the training of deep neural networks. We assume no math knowledge
beyond what you learned in calculus 1, and provide links to help you refresh
the necessary math where needed. Note that you do not need to understand this
material before you start learning to train and use deep learning in practice;
rather, this material is for those who are already familiar with the basics of
neural networks, and wish to deepen their understanding of the underlying math.
Don't worry if you get stuck at some point along the way---just go back and
reread the previous section, and try writing down and working through some
examples. And if you're still stuck, we're happy to answer your questions in
the Theory category at forums.fast.ai. Note: There is a reference section at
the end of the paper summarizing all the key matrix calculus rules and
terminology discussed here. See related articles at http://explained.ai
| cs.LG stat.ML | this paper is an attempt to explain all the matrix calculus you need in order to understand the training of deep neural networks we assume no math knowledge beyond what you learned in calculus 1 and provide links to help you refresh the necessary math where needed note that you do not need to understand this material before you start learning to train and use deep learning in practice rather this material is for those who are already familiar with the basics of neural networks and wish to deepen their understanding of the underlying math dont worry if you get stuck at some point along the wayjust go back and reread the previous section and try writing down and working through some examples and if youre still stuck were happy to answer your questions in the theory category at forumsfastai note there is a reference section at the end of the paper summarizing all the key matrix calculus rules and terminology discussed here see related articles at httpexplainedai | [['this', 'paper', 'is', 'an', 'attempt', 'to', 'explain', 'all', 'the', 'matrix', 'calculus', 'you', 'need', 'in', 'order', 'to', 'understand', 'the', 'training', 'of', 'deep', 'neural', 'networks', 'we', 'assume', 'no', 'math', 'knowledge', 'beyond', 'what', 'you', 'learned', 'in', 'calculus', '1', 'and', 'provide', 'links', 'to', 'help', 'you', 'refresh', 'the', 'necessary', 'math', 'where', 'needed', 'note', 'that', 'you', 'do', 'not', 'need', 'to', 'understand', 'this', 'material', 'before', 'you', 'start', 'learning', 'to', 'train', 'and', 'use', 'deep', 'learning', 'in', 'practice', 'rather', 'this', 'material', 'is', 'for', 'those', 'who', 'are', 'already', 'familiar', 'with', 'the', 'basics', 'of', 'neural', 'networks', 'and', 'wish', 'to', 'deepen', 'their', 'understanding', 'of', 'the', 'underlying', 'math', 'dont', 'worry', 'if', 'you', 'get', 'stuck', 'at', 'some', 'point', 'along', 'the', 'wayjust', 'go', 'back', 'and', 'reread', 'the', 'previous', 'section', 'and', 'try', 'writing', 'down', 'and', 'working', 'through', 'some', 'examples', 'and', 'if', 'youre', 'still', 'stuck', 'were', 'happy', 'to', 'answer', 'your', 'questions', 'in', 'the', 'theory', 'category', 'at', 'forumsfastai', 'note', 'there', 'is', 'a', 'reference', 'section', 'at', 'the', 'end', 'of', 'the', 'paper', 'summarizing', 'all', 'the', 'key', 'matrix', 'calculus', 'rules', 'and', 'terminology', 'discussed', 'here', 'see', 'related', 'articles', 'at', 'httpexplainedai']] | [0.010341196439130175, 0.0648510632973877, -0.07531317364650242, 0.13508173843111956, -0.18964903728020463, -0.19632717341353947, 0.09438864220935625, 0.4215913266507965, -0.2851351949527408, -0.318215930885212, 0.1050275175669936, -0.30275647250342774, -0.1859450550467679, 0.10745094865913306, -0.1739141102795574, -0.01673803873585932, 0.06585190803602789, 0.0874954532593785, -0.045906873016307755, -0.3304148607520443, 0.31389487869190896, 0.05286120428160454, 0.21706620179060282, 0.059432155540156545, 0.05286812162746422, 0.0032573883986157, -0.06247629762034525, -0.053384044916002134, -0.15794581691685985, 0.1166417747443175, 0.3371798789636655, 0.16777920695775803, 0.357376487282895, -0.526322733351227, -0.11898922922767022, 0.12086070701056584, 0.13084161264088118, 0.120778325149987, 0.024155029919788695, -0.2476808988940761, 0.1039756034687867, -0.15266187160529873, -0.12885311228985136, -0.10014845877436032, 0.007337800921364264, -0.050539970567280594, -0.1717459827774402, -0.06740739814316234, 0.13208777434990748, 0.06570225930913831, 0.028128346040224034, -0.10755091146424864, 0.0199107362183206, 0.18496360155951344, 0.05314961133059445, 0.08631865900736585, 0.10973244012531005, -0.151375906012783, -0.1018742966211655, 0.36418307667428795, 0.019795783322699594, -0.18346536364970786, 0.18195481354681153, -0.10873370770590775, -0.1620948718197531, 0.06916946665186322, 0.1774193438927107, 0.06599358205937526, -0.15385907929969217, 0.049012119689899866, -0.022956791271766027, 0.15264291915509878, 0.1254349829544398, -0.018341355919696843, 0.19620605189579002, 0.12600734732819327, -0.0012041639635395824, 0.02251497424405181, 0.008352576955362703, -0.07948405634273183, -0.3051489838709434, -0.17761222701943055, -0.1373285765477428, 0.09098722194330273, 0.024965739940914014, -0.09426486917743176, 0.34511153333199523, 0.27319825275970455, 0.18426017045540818, 0.0801718315922754, 0.27826875754434505, 0.023534973058849572, 0.07489455812169718, 0.14214247311042114, 0.207384852564428, 0.09112088973775054, 0.24189367285280516, -0.0735682633761881, 0.07388737715329184, 0.040038306219503286] |
1,802.01529 | Optimal consensus control of the Cucker-Smale model | We study the numerical realisation of optimal consensus control laws for
agent-based models. For a nonlinear multi-agent system of Cucker-Smale type,
consensus control is cast as a dynamic optimisation problem for which we derive
first-order necessary optimality conditions. In the case of a smooth
penalization fo the control energy, the optimality system is numerically
approximated via a gradient-descent method. For sparsity promoting, non-smooth
$\ell_1$-norm control penalizations, the optimal controllers are realised by
means of heuristic methods. For an increasing number of agents, we discuss the
approximation of the consensus control problem by following a mean-field
modelling approach.
| math.OC math.DS math.NA | we study the numerical realisation of optimal consensus control laws for agentbased models for a nonlinear multiagent system of cuckersmale type consensus control is cast as a dynamic optimisation problem for which we derive firstorder necessary optimality conditions in the case of a smooth penalization fo the control energy the optimality system is numerically approximated via a gradientdescent method for sparsity promoting nonsmooth ell_1norm control penalizations the optimal controllers are realised by means of heuristic methods for an increasing number of agents we discuss the approximation of the consensus control problem by following a meanfield modelling approach | [['we', 'study', 'the', 'numerical', 'realisation', 'of', 'optimal', 'consensus', 'control', 'laws', 'for', 'agentbased', 'models', 'for', 'a', 'nonlinear', 'multiagent', 'system', 'of', 'cuckersmale', 'type', 'consensus', 'control', 'is', 'cast', 'as', 'a', 'dynamic', 'optimisation', 'problem', 'for', 'which', 'we', 'derive', 'firstorder', 'necessary', 'optimality', 'conditions', 'in', 'the', 'case', 'of', 'a', 'smooth', 'penalization', 'fo', 'the', 'control', 'energy', 'the', 'optimality', 'system', 'is', 'numerically', 'approximated', 'via', 'a', 'gradientdescent', 'method', 'for', 'sparsity', 'promoting', 'nonsmooth', 'ell_1norm', 'control', 'penalizations', 'the', 'optimal', 'controllers', 'are', 'realised', 'by', 'means', 'of', 'heuristic', 'methods', 'for', 'an', 'increasing', 'number', 'of', 'agents', 'we', 'discuss', 'the', 'approximation', 'of', 'the', 'consensus', 'control', 'problem', 'by', 'following', 'a', 'meanfield', 'modelling', 'approach']] | [-0.16886468041002914, -0.020103894129543106, -0.08182633879892144, 0.07843213983494596, -0.08656756330963186, -0.18309173951424734, 0.07335823233546593, 0.3704560074340744, -0.341330514018203, -0.2912556615264453, 0.1630328313349122, -0.16239913350412832, -0.19236476581121228, 0.16140518943087878, -0.10470549409882617, 0.1645622784367849, 0.024017374019244128, -0.013912594814775223, -0.050840167179895736, -0.2335543700676296, 0.28628636115067396, -0.011044331778263309, 0.24556448187717458, -0.03380019983910408, 0.17625389371508943, 0.02713714649459136, 0.06047827015467679, 0.0637986175811936, -0.1461226404212492, 0.10492944451452223, 0.2943289274817945, 0.16282451830650727, 0.42951394118291814, -0.41526374462799925, -0.22572408983311087, 0.11182778369942584, 0.14437605338963228, 0.11251934304156523, -0.06274358104535177, -0.2703846385438456, 0.0896224854994066, -0.1715366047202158, -0.1335093476185479, -0.10345991561669357, -0.0627305039310271, 0.0857519469843198, -0.38996096777240025, 0.06418826622101143, 0.05441972104467682, 0.06970461020150136, -0.14513961172941112, -0.07196630671687577, 0.04417528657569099, 0.07782202141633085, -0.0008711084848289023, -0.04575314206436046, 0.1261273955004578, -0.13907345140487262, -0.1735120912985012, 0.3514087352632862, 0.007399043764381372, -0.2554429507614521, 0.11606504540583215, 0.01755161944431128, -0.12298593848233216, 0.11770299537894652, 0.2282637373241836, 0.16790947785658628, -0.20183439235942266, 0.09316441281842663, -0.04937648221600762, 0.15759072991894538, -0.004653919925049101, -0.02922150300402847, 0.0931944742789204, 0.26644326811752367, 0.228594901234622, 0.14337887785387868, 0.03654053383362815, -0.1977767766424522, -0.29472092454580917, -0.085370812190639, -0.16029174662358367, -0.012848486859812257, -0.1284955889550662, -0.12273446102770641, 0.35343718579154193, 0.1242648544673299, 0.11527768101965644, 0.12647529037491678, 0.30797110310726866, 0.19097521854924596, -0.035925912080313434, 0.061218580394292, 0.24788854465119003, 0.13173253864251538, 0.09557393496644866, -0.3180117998680234, 0.10898966316287358, 0.13925749174386418] |
1,802.0153 | Relative Recognition Principle | In this paper the relative recognition principle will be proved. It states
that a pair of spaces $(X_o,X_c)$ is weakly equivalent to
$(\Omega^N_\text{rel}(\iota:B\hookrightarrow Y),\Omega^N(Y))$ if and only if
$(X_o,X_c)$ are grouplike $\overline{\mathcal{SC}^N}$-spaces, where
$\overline{\mathcal{SC}^N}$ is any cofibrant resolution of the Swiss-cheese
2-operad $\mathcal{SC}^N$. This principle will be proved for connected
$\overline{\mathcal{SC}^N}$-spaces, and also for grouplike
$\overline{\mathcal{SC}^N}$-spaces for $2<N\leq\infty$, in the form of an
equivalence of homotopy categories.
| math.AT math.QA | in this paper the relative recognition principle will be proved it states that a pair of spaces x_ox_c is weakly equivalent to omegan_textreliotabhookrightarrow yomegany if and only if x_ox_c are grouplike overlinemathcalscnspaces where overlinemathcalscn is any cofibrant resolution of the swisscheese 2operad mathcalscn this principle will be proved for connected overlinemathcalscnspaces and also for grouplike overlinemathcalscnspaces for 2nleqinfty in the form of an equivalence of homotopy categories | [['in', 'this', 'paper', 'the', 'relative', 'recognition', 'principle', 'will', 'be', 'proved', 'it', 'states', 'that', 'a', 'pair', 'of', 'spaces', 'x_ox_c', 'is', 'weakly', 'equivalent', 'to', 'omegan_textreliotabhookrightarrow', 'yomegany', 'if', 'and', 'only', 'if', 'x_ox_c', 'are', 'grouplike', 'overlinemathcalscnspaces', 'where', 'overlinemathcalscn', 'is', 'any', 'cofibrant', 'resolution', 'of', 'the', 'swisscheese', '2operad', 'mathcalscn', 'this', 'principle', 'will', 'be', 'proved', 'for', 'connected', 'overlinemathcalscnspaces', 'and', 'also', 'for', 'grouplike', 'overlinemathcalscnspaces', 'for', '2nleqinfty', 'in', 'the', 'form', 'of', 'an', 'equivalence', 'of', 'homotopy', 'categories']] | [-0.08470470493969819, 0.12204445038053867, -0.07048002829154333, 0.09815904451534152, -0.05500309463823214, -0.1399166364610816, -0.04443392657170383, 0.3924733507757386, -0.32144714292759696, -0.1934689767115439, 0.09704068704741076, -0.20488164878139895, -0.10272862548008561, 0.1997780575727423, -0.17559909106542668, -0.0792180644813925, 0.1144830156234093, 0.12788825177898008, -0.04485326025654406, -0.2704995399651428, 0.4083181312928597, -0.011196733452379704, 0.21858411314393986, 0.06137563183438033, 0.11603792356327176, -0.03671235601650551, 0.025643272325396538, 0.06827660867323478, -0.096238608088485, 0.1266652123333188, 0.319159908980752, 0.11619963825990756, 0.22801724736733983, -0.3260688699161013, -0.09390973209713896, 0.18338702608210344, 0.1480754271382466, 0.04034933508761848, -0.008689399329402174, -0.30182137244070567, 0.2009006638545543, -0.1866099621169269, -0.08486901845317334, -0.06870435862025867, 0.1007507560464243, 0.00739899502756695, -0.29241960155777635, -0.015350796224568815, 0.11982796406045963, 0.022202921472489832, -0.037412392200591664, 0.010237521740297477, -0.05149107022831837, 0.10152912721193084, -0.03749213587337484, 0.0236450772266835, 0.05995346553002794, -0.10080603616855417, -0.07804080763210854, 0.4041619393276051, -0.02546226551445822, -0.23191357233251134, 0.15543231623402487, -0.12008057003840804, -0.2009572706107671, 0.0885392732763042, 0.025399080477654934, 0.15527131812026104, -0.13328046462653825, 0.1501805255014915, -0.12494325550893942, 0.14534876920903722, 0.10951573882096757, 0.033016365580260755, 0.16176540799594175, 0.13556889506677786, 0.1327236464402328, 0.07401225883125638, -0.012770736190335204, 0.002459417948072466, -0.3382755719125271, -0.22888291403651237, -0.14478568791916283, 0.10080078427369396, -0.05751331560265195, -0.16063439027251056, 0.3078882237391857, 0.11357943958913287, 0.12086046805294852, 0.10906175714141379, 0.22803778120627005, 0.0793723181161719, 0.053487234531591335, 0.04621881174001222, 0.24687790031700085, 0.18577741946404178, -0.004748962074518204, -0.0897391824129348, 0.020639667520299554, 0.1750074116435523] |
1,802.01531 | Switching and partially switching the hypercube while maintaining
perfect state transfer | A graph is said to exhibit perfect state transfer (PST) if one of its
corresponding Hamiltonian matrices, which are based on the vertex-edge
structure of the graph, gives rise to PST in a quantum information-theoretic
context, namely with respect to inter-qubit interactions of a quantum system.
We perform various perturbations to the hypercube graph---a graph that is known
to exhibit PST---to create graphs that maintain many of the same properties of
the hypercube, including PST as well as the distance for which PST occurs. We
show that the sensitivity with respect to readout time errors remains
unaffected for the vertices involved in PST. We give motivation for when these
perturbations may be physically desirable or even necessary.
| math.CO quant-ph | a graph is said to exhibit perfect state transfer pst if one of its corresponding hamiltonian matrices which are based on the vertexedge structure of the graph gives rise to pst in a quantum informationtheoretic context namely with respect to interqubit interactions of a quantum system we perform various perturbations to the hypercube grapha graph that is known to exhibit pstto create graphs that maintain many of the same properties of the hypercube including pst as well as the distance for which pst occurs we show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in pst we give motivation for when these perturbations may be physically desirable or even necessary | [['a', 'graph', 'is', 'said', 'to', 'exhibit', 'perfect', 'state', 'transfer', 'pst', 'if', 'one', 'of', 'its', 'corresponding', 'hamiltonian', 'matrices', 'which', 'are', 'based', 'on', 'the', 'vertexedge', 'structure', 'of', 'the', 'graph', 'gives', 'rise', 'to', 'pst', 'in', 'a', 'quantum', 'informationtheoretic', 'context', 'namely', 'with', 'respect', 'to', 'interqubit', 'interactions', 'of', 'a', 'quantum', 'system', 'we', 'perform', 'various', 'perturbations', 'to', 'the', 'hypercube', 'grapha', 'graph', 'that', 'is', 'known', 'to', 'exhibit', 'pstto', 'create', 'graphs', 'that', 'maintain', 'many', 'of', 'the', 'same', 'properties', 'of', 'the', 'hypercube', 'including', 'pst', 'as', 'well', 'as', 'the', 'distance', 'for', 'which', 'pst', 'occurs', 'we', 'show', 'that', 'the', 'sensitivity', 'with', 'respect', 'to', 'readout', 'time', 'errors', 'remains', 'unaffected', 'for', 'the', 'vertices', 'involved', 'in', 'pst', 'we', 'give', 'motivation', 'for', 'when', 'these', 'perturbations', 'may', 'be', 'physically', 'desirable', 'or', 'even', 'necessary']] | [-0.15439288794456435, 0.1365898406837569, -0.05508929639021015, 0.054892353173586185, -0.06177401263668234, -0.17125952534441805, 0.007715709838646881, 0.4139870369710542, -0.2974843898354548, -0.3047043263986466, 0.11794776403834915, -0.2597097003800345, -0.16617403537886025, 0.15094807771122853, -0.0880700630408808, 0.041713527814738034, 0.09964855720192708, 0.11260324084914514, -0.0671584818969834, -0.2218312308950458, 0.3060370172084919, 0.03717861587687492, 0.22302545057328674, 0.05469722657641075, 0.11082711199635704, 0.019251095301648282, 0.04929424452460933, 0.04221178048113682, -0.10910797021887415, 0.06595026737014795, 0.24719704511843357, 0.11540853233349606, 0.19525303737589575, -0.4266912067180564, -0.18362520834639798, 0.16066136306798054, 0.10160780483595866, 0.15401496026656944, -0.0029731630573474705, -0.24653470393366597, 0.1214882090751981, -0.13932146608893728, -0.09381648762039198, -0.09171055201119904, 0.01718120844402463, 0.005381533117354687, -0.2854569750293038, 0.018852647895732058, 0.1011041961720711, -0.014541092015610173, 0.01684769458470641, -0.09504720047096207, -0.05473163669250488, 0.16907784147594518, -0.014342996175400913, 0.03385841494811506, 0.06808187240525952, -0.10959746497121223, -0.16622779038253016, 0.41524146294325653, -0.02695939076887765, -0.20661655472639692, 0.18167077131159926, -0.10821278524938328, -0.1285612595082935, 0.10656795945171074, 0.1285348122232947, 0.08428348910770025, -0.12085947482196858, 0.07551362141485102, -0.011855913550946218, 0.15683199850850385, 0.061534005494242344, 0.14578494048629212, 0.15584990587727776, 0.13968366928647497, 0.15351403576616954, 0.19677593851971825, -0.0014160253400593225, -0.12889929430495048, -0.2639330987545565, -0.13479986361324273, -0.22293244800048656, 0.09324638286187988, -0.11403209984238291, -0.22163540332032175, 0.4236527769986925, 0.1711333722793417, 0.22344869197795875, 0.06995718110681928, 0.2220928067229046, 0.06727866520342449, 0.06811696910379647, 0.09107921022022593, 0.21168954140538798, 0.17033802717121255, 0.014263474547047296, -0.19073039652570953, 0.08033024457259232, 0.024216534985341775] |
1,802.01532 | Real-time Prediction of Intermediate-Horizon Automotive Collision Risk | Advanced collision avoidance and driver hand-off systems can benefit from the
ability to accurately predict, in real time, the probability a vehicle will be
involved in a collision within an intermediate horizon of 10 to 20 seconds. The
rarity of collisions in real-world data poses a significant challenge to
developing this capability because, as we demonstrate empirically,
intermediate-horizon risk prediction depends heavily on high-dimensional driver
behavioral features. As a result, a large amount of data is required to fit an
effective predictive model. In this paper, we assess whether simulated data can
help alleviate this issue. Focusing on highway driving, we present a three-step
approach for generating data and fitting a predictive model capable of
real-time prediction. First, high-risk automotive scenes are generated using
importance sampling on a learned Bayesian network scene model. Second,
collision risk is estimated through Monte Carlo simulation. Third, a neural
network domain adaptation model is trained on real and simulated data to
address discrepancies between the two domains. Experiments indicate that
simulated data can mitigate issues resulting from collision rarity, thereby
improving risk prediction in real-world data.
| cs.CV cs.LG | advanced collision avoidance and driver handoff systems can benefit from the ability to accurately predict in real time the probability a vehicle will be involved in a collision within an intermediate horizon of 10 to 20 seconds the rarity of collisions in realworld data poses a significant challenge to developing this capability because as we demonstrate empirically intermediatehorizon risk prediction depends heavily on highdimensional driver behavioral features as a result a large amount of data is required to fit an effective predictive model in this paper we assess whether simulated data can help alleviate this issue focusing on highway driving we present a threestep approach for generating data and fitting a predictive model capable of realtime prediction first highrisk automotive scenes are generated using importance sampling on a learned bayesian network scene model second collision risk is estimated through monte carlo simulation third a neural network domain adaptation model is trained on real and simulated data to address discrepancies between the two domains experiments indicate that simulated data can mitigate issues resulting from collision rarity thereby improving risk prediction in realworld data | [['advanced', 'collision', 'avoidance', 'and', 'driver', 'handoff', 'systems', 'can', 'benefit', 'from', 'the', 'ability', 'to', 'accurately', 'predict', 'in', 'real', 'time', 'the', 'probability', 'a', 'vehicle', 'will', 'be', 'involved', 'in', 'a', 'collision', 'within', 'an', 'intermediate', 'horizon', 'of', '10', 'to', '20', 'seconds', 'the', 'rarity', 'of', 'collisions', 'in', 'realworld', 'data', 'poses', 'a', 'significant', 'challenge', 'to', 'developing', 'this', 'capability', 'because', 'as', 'we', 'demonstrate', 'empirically', 'intermediatehorizon', 'risk', 'prediction', 'depends', 'heavily', 'on', 'highdimensional', 'driver', 'behavioral', 'features', 'as', 'a', 'result', 'a', 'large', 'amount', 'of', 'data', 'is', 'required', 'to', 'fit', 'an', 'effective', 'predictive', 'model', 'in', 'this', 'paper', 'we', 'assess', 'whether', 'simulated', 'data', 'can', 'help', 'alleviate', 'this', 'issue', 'focusing', 'on', 'highway', 'driving', 'we', 'present', 'a', 'threestep', 'approach', 'for', 'generating', 'data', 'and', 'fitting', 'a', 'predictive', 'model', 'capable', 'of', 'realtime', 'prediction', 'first', 'highrisk', 'automotive', 'scenes', 'are', 'generated', 'using', 'importance', 'sampling', 'on', 'a', 'learned', 'bayesian', 'network', 'scene', 'model', 'second', 'collision', 'risk', 'is', 'estimated', 'through', 'monte', 'carlo', 'simulation', 'third', 'a', 'neural', 'network', 'domain', 'adaptation', 'model', 'is', 'trained', 'on', 'real', 'and', 'simulated', 'data', 'to', 'address', 'discrepancies', 'between', 'the', 'two', 'domains', 'experiments', 'indicate', 'that', 'simulated', 'data', 'can', 'mitigate', 'issues', 'resulting', 'from', 'collision', 'rarity', 'thereby', 'improving', 'risk', 'prediction', 'in', 'realworld', 'data']] | [-0.06585953608206704, 0.02234962951531505, -0.0684506935903607, 0.12703131769336143, -0.09628546248236414, -0.13022451852551192, 0.07236509530313663, 0.4160388769499587, -0.2573030916716677, -0.3851807163333654, 0.11546965628989087, -0.28034197981726605, -0.147469834589209, 0.22425714835462815, -0.1357738838405014, 0.10233592076641276, 0.15888323937928645, -0.0009451403909038691, -0.004412838032093537, -0.2397504433968943, 0.28504979825779303, 0.10538348885901395, 0.32806039820759664, 0.05143035190740796, 0.10645376025886887, -0.012343777450398434, -0.04525363245639353, -0.013077455807222537, -0.048408817043420226, 0.1350782039224425, 0.32380683505547475, 0.20170154883294722, 0.3462916396928756, -0.4477490137861167, -0.25094052727812727, 0.12990820669512476, 0.149584353873146, 0.0938462940365004, -0.06925339776140159, -0.3170397429320529, 0.06491364484642587, -0.19198191972727274, -0.0896068405751036, -0.10016881011539648, -0.023576344657645597, -0.009359265312305472, -0.3119580681173347, 0.05988626223419618, -0.025096509515601134, 0.08018135210082387, -0.05147934040358259, -0.04939513041660992, 0.0020710276774238818, 0.15052886831301435, 0.04593893939510852, 0.027932381571285962, 0.16329882598806233, -0.13839508741206452, -0.16025601472198778, 0.37990727420196513, -0.03574864817423057, -0.18570880899051442, 0.1815217189717194, -0.07815032853238099, -0.13643466014908986, 0.12137293514090677, 0.29790164320150814, 0.06827147832675451, -0.20396713660103757, -0.009316869183940021, 0.0047145043049542775, 0.19541462365465845, 0.0028413933578322935, -0.07846966727240556, 0.17688088189329418, 0.29403946450808555, 0.006873947982444783, 0.10466134227305465, -0.16547486152196333, -0.11478105066755777, -0.24210348506638193, -0.0666092841561822, -0.19697026992010888, -0.016740075281682264, -0.11559109060193132, -0.09495760360732675, 0.3707825524233364, 0.2738657496491375, 0.23548572806600296, 0.07482379749777485, 0.3572711015521492, 0.04449289525570914, 0.06170607547569011, 0.05918307495895176, 0.1724739403261942, -0.021359217175647864, 0.1115596066479885, -0.20701048850517292, 0.1442186048039549, -0.02386277730998619] |
1,802.01533 | Time-reversal-symmetry breaking and unconventional pairing in the
noncentrosymmetric superconductor La$_{7}$Rh$_{3}$ | Noncentrosymmetric superconductors have sparked significant research
interests due to their exciting properties, such as the admixture of
spin-singlet and spin-triplet Cooper pairs. Here we report $\mu$SR and
thermodynamic measurements on the noncentrosymmetric superconductor La7Rh3
which indicate a fully established superconducting gap and spontaneous
time-reversal-symmetry breaking at the onset of superconductivity. We show that
our results pose severe constraints on any microscopic theory of
superconductivity in the system. A symmetry analysis identifies ground states
compatible with time-reversal-symmetry breaking and the resulting gap functions
are discussed. Furthermore, general energetic considerations indicate the
relevance of electron-electron interactions for the pairing mechanism, in
accordance with hints of spin-fluctuations revealed in susceptibility
measurements.
| cond-mat.supr-con | noncentrosymmetric superconductors have sparked significant research interests due to their exciting properties such as the admixture of spinsinglet and spintriplet cooper pairs here we report musr and thermodynamic measurements on the noncentrosymmetric superconductor la7rh3 which indicate a fully established superconducting gap and spontaneous timereversalsymmetry breaking at the onset of superconductivity we show that our results pose severe constraints on any microscopic theory of superconductivity in the system a symmetry analysis identifies ground states compatible with timereversalsymmetry breaking and the resulting gap functions are discussed furthermore general energetic considerations indicate the relevance of electronelectron interactions for the pairing mechanism in accordance with hints of spinfluctuations revealed in susceptibility measurements | [['noncentrosymmetric', 'superconductors', 'have', 'sparked', 'significant', 'research', 'interests', 'due', 'to', 'their', 'exciting', 'properties', 'such', 'as', 'the', 'admixture', 'of', 'spinsinglet', 'and', 'spintriplet', 'cooper', 'pairs', 'here', 'we', 'report', 'musr', 'and', 'thermodynamic', 'measurements', 'on', 'the', 'noncentrosymmetric', 'superconductor', 'la7rh3', 'which', 'indicate', 'a', 'fully', 'established', 'superconducting', 'gap', 'and', 'spontaneous', 'timereversalsymmetry', 'breaking', 'at', 'the', 'onset', 'of', 'superconductivity', 'we', 'show', 'that', 'our', 'results', 'pose', 'severe', 'constraints', 'on', 'any', 'microscopic', 'theory', 'of', 'superconductivity', 'in', 'the', 'system', 'a', 'symmetry', 'analysis', 'identifies', 'ground', 'states', 'compatible', 'with', 'timereversalsymmetry', 'breaking', 'and', 'the', 'resulting', 'gap', 'functions', 'are', 'discussed', 'furthermore', 'general', 'energetic', 'considerations', 'indicate', 'the', 'relevance', 'of', 'electronelectron', 'interactions', 'for', 'the', 'pairing', 'mechanism', 'in', 'accordance', 'with', 'hints', 'of', 'spinfluctuations', 'revealed', 'in', 'susceptibility', 'measurements']] | [-0.23773757266925177, 0.19890838782368314, -0.036137192641171656, 0.07925583812991314, -0.09868128810112721, -0.15756700590914377, 0.13510237613618897, 0.3398507160665554, -0.1995438866700246, -0.285623036642672, -0.010900068574445757, -0.3481128593802313, -0.13807545372537364, 0.15846328644155933, 0.060389465756853604, 0.04326222863953526, -0.0028790196748755036, -0.03902547367169548, -0.14853885591848293, -0.1994686823873563, 0.35843844671307185, -0.007436683532024656, 0.39363955159314745, 0.18500159690852894, 0.01845500955497411, -0.014024263310951189, 0.0886111306374736, -0.004207537113471288, -0.14351410937538234, 0.06969880059124275, 0.2633426727631312, -0.056412747469251956, 0.17747486051102387, -0.4709406250687403, -0.2588703551930245, 0.025380866767438216, 0.1162597031558855, 0.1695337977301695, -0.13727758691355665, -0.3711262168449776, 0.05656592688462305, -0.16620350086400024, -0.1090720115995435, -0.15117208458587666, -0.03642673380063655, -0.04152026966161956, -0.24504994970058727, 0.1208405995515184, 0.07379275756217887, 0.1242460236475568, -0.1258728471410539, -0.11574344855089123, -0.06456220058820028, -0.008910376448010173, 0.13341425770728318, 0.05371582182994652, 0.10377147919650703, -0.13944208856114995, -0.1637357713515374, 0.35300967505062436, 0.0023213973482113298, -0.04666718937212897, 0.17243534334386898, -0.1509259925049808, -0.16107302012409422, 0.1059060618868881, 0.1119520102679799, 0.04644434903661294, -0.09730773347769385, 0.04097956981483812, -0.04714542776172128, 0.17788589886763942, -0.02562137195028835, 0.1675694795726868, 0.27423170384750745, 0.20423102144926578, 0.009729754247171717, 0.10137747984736392, -0.06281869218980667, -0.06082675397117561, -0.2901770897279276, -0.13806777276864676, -0.20286974577650985, 0.022757860265071636, 0.004980678655420404, -0.11976577453837495, 0.3825937861872611, 0.16595579181345196, 0.18541910004514817, -0.07180767420953506, 0.18340717583337676, 0.0623879766322359, 0.11004589991339386, 0.013352028950483095, 0.28150187650364694, 0.1690801070245836, 0.08660423740849038, -0.35655013635476057, 0.11277765091769745, -0.01723588221689042] |
1,802.01534 | The McKay correspondence for isolated singularities via Floer theory | We prove the generalised McKay correspondence for isolated singularities
using Floer theory. Given an isolated singularity \C^n/G for a finite subgroup
G in SL(n,\C) and any crepant resolution Y, we prove that the rank of positive
symplectic cohomology SH_+(Y) is the number of conjugacy classes of G, and that
twice the age grading on conjugacy classes is the \Z-grading on SH_+(Y) by the
Conley-Zehnder index. The generalised McKay correspondence follows as SH_+(Y)
is naturally isomorphic to ordinary cohomology H(Y), due to a vanishing result
for full symplectic cohomology. In the Appendix we construct a novel filtration
on the symplectic chain complex for any non-exact convex symplectic manifold,
which yields both a Morse-Bott spectral sequence and a construction of positive
symplectic cohomology.
| math.SG math.AG | we prove the generalised mckay correspondence for isolated singularities using floer theory given an isolated singularity cng for a finite subgroup g in slnc and any crepant resolution y we prove that the rank of positive symplectic cohomology sh_y is the number of conjugacy classes of g and that twice the age grading on conjugacy classes is the zgrading on sh_y by the conleyzehnder index the generalised mckay correspondence follows as sh_y is naturally isomorphic to ordinary cohomology hy due to a vanishing result for full symplectic cohomology in the appendix we construct a novel filtration on the symplectic chain complex for any nonexact convex symplectic manifold which yields both a morsebott spectral sequence and a construction of positive symplectic cohomology | [['we', 'prove', 'the', 'generalised', 'mckay', 'correspondence', 'for', 'isolated', 'singularities', 'using', 'floer', 'theory', 'given', 'an', 'isolated', 'singularity', 'cng', 'for', 'a', 'finite', 'subgroup', 'g', 'in', 'slnc', 'and', 'any', 'crepant', 'resolution', 'y', 'we', 'prove', 'that', 'the', 'rank', 'of', 'positive', 'symplectic', 'cohomology', 'sh_y', 'is', 'the', 'number', 'of', 'conjugacy', 'classes', 'of', 'g', 'and', 'that', 'twice', 'the', 'age', 'grading', 'on', 'conjugacy', 'classes', 'is', 'the', 'zgrading', 'on', 'sh_y', 'by', 'the', 'conleyzehnder', 'index', 'the', 'generalised', 'mckay', 'correspondence', 'follows', 'as', 'sh_y', 'is', 'naturally', 'isomorphic', 'to', 'ordinary', 'cohomology', 'hy', 'due', 'to', 'a', 'vanishing', 'result', 'for', 'full', 'symplectic', 'cohomology', 'in', 'the', 'appendix', 'we', 'construct', 'a', 'novel', 'filtration', 'on', 'the', 'symplectic', 'chain', 'complex', 'for', 'any', 'nonexact', 'convex', 'symplectic', 'manifold', 'which', 'yields', 'both', 'a', 'morsebott', 'spectral', 'sequence', 'and', 'a', 'construction', 'of', 'positive', 'symplectic', 'cohomology']] | [-0.2125355409696883, 0.02359913370087608, -0.13049299683237126, 0.11982021367414046, -0.1164274556015826, -0.17255294767462395, -0.030803674304750093, 0.31917832765058607, -0.3301373531826395, -0.2340196452819365, 0.07806505985011554, -0.20749168154929787, -0.1554828397313918, 0.1537324223929077, -0.22017581395281494, -0.03886196953687078, 0.09954230412686906, 0.11385826577917357, -0.13003669017617983, -0.24924534992584266, 0.44946320814057444, -0.06316265633930106, 0.21210850316507757, 0.06250501546454577, 0.15459926735440438, 0.009837727127827642, -0.0029883945499323615, -0.03574498322569142, -0.1560193877211389, 0.08799205655963276, 0.33192290327788815, 0.032311639639795255, 0.1517828968478644, -0.32298343167601784, -0.12341205168237394, 0.2135304572591789, 0.12925160967952704, 0.0020530313082147114, -0.03451728907102057, -0.2740748022213455, 0.12862282075865333, -0.18971844658944448, -0.18115104734512769, -0.07209344553445612, 0.062099369867196816, -0.012935124195280893, -0.21296291158742403, -0.01466545547274026, 0.11121911658666843, 0.14441553399367027, -0.03780130432001777, -0.07063189016901388, -0.0962174420806864, 0.06094483459322167, -0.02707784284533517, 0.0745248350349432, 0.08099577612097351, -0.06470244008401209, -0.13429757462013975, 0.34116121406151245, -0.07397815183551659, -0.24414128029703602, 0.1103712540150674, -0.13033688764187915, -0.23627463876546845, 0.14129414738055843, 0.004781646677100461, 0.17929987048307888, 0.02669541555464514, 0.21653780916730742, -0.11640316322599807, 0.05457919694036861, 0.1251451092625945, -0.07613091230053794, 0.11566742783804879, 0.048844504587675544, 0.11574366025642054, 0.10875677817678156, 0.026666415657093826, -0.0353279649126074, -0.35506617828957304, -0.23421471803242241, -0.1503869871077828, 0.21516962598793762, -0.16140833293813692, -0.19527733788540788, 0.41554038648393526, -0.0037155365794995093, 0.17393119039768276, 0.1758807366569565, 0.2160861740304419, 0.06260280513246967, 0.03708368128796747, 0.03283403047614477, 0.06281864276725399, 0.267672284931514, -0.07131275545790298, -0.1666047619540275, -0.0638851851632834, 0.29882924266405836] |
1,802.01535 | Exceedance-based nonlinear regression of tail dependence | The probability and structure of co-occurrences of extreme values in
multivariate data may critically depend on auxiliary information provided by
covariates. In this contribution, we develop a flexible generalized additive
modeling framework based on high threshold exceedances for estimating
covariate-dependent joint tail characteristics for regimes of asymptotic
dependence and asymptotic independence. The framework is based on suitably
defined marginal pretransformations and projections of the random vector along
the directions of the unit simplex, which lead to convenient univariate
representations of multivariate exceedances based on the exponential
distribution. Good performance of our estimators of a nonparametrically
designed influence of covariates on extremal coefficients and tail dependence
coefficients are shown through a simulation study. We illustrate the usefulness
of our modeling framework on a large dataset of nitrogen dioxide measurements
recorded in France between 1999 and 2012, where we use the generalized additive
framework for modeling marginal distributions and tail dependence in monthly
maxima. Our results imply asymptotic independence of data observed at different
stations, and we find that the estimated coefficients of tail dependence
decrease as a function of spatial distance and show distinct patterns for
different years and for different types of stations (traffic vs. background).
| stat.ME | the probability and structure of cooccurrences of extreme values in multivariate data may critically depend on auxiliary information provided by covariates in this contribution we develop a flexible generalized additive modeling framework based on high threshold exceedances for estimating covariatedependent joint tail characteristics for regimes of asymptotic dependence and asymptotic independence the framework is based on suitably defined marginal pretransformations and projections of the random vector along the directions of the unit simplex which lead to convenient univariate representations of multivariate exceedances based on the exponential distribution good performance of our estimators of a nonparametrically designed influence of covariates on extremal coefficients and tail dependence coefficients are shown through a simulation study we illustrate the usefulness of our modeling framework on a large dataset of nitrogen dioxide measurements recorded in france between 1999 and 2012 where we use the generalized additive framework for modeling marginal distributions and tail dependence in monthly maxima our results imply asymptotic independence of data observed at different stations and we find that the estimated coefficients of tail dependence decrease as a function of spatial distance and show distinct patterns for different years and for different types of stations traffic vs background | [['the', 'probability', 'and', 'structure', 'of', 'cooccurrences', 'of', 'extreme', 'values', 'in', 'multivariate', 'data', 'may', 'critically', 'depend', 'on', 'auxiliary', 'information', 'provided', 'by', 'covariates', 'in', 'this', 'contribution', 'we', 'develop', 'a', 'flexible', 'generalized', 'additive', 'modeling', 'framework', 'based', 'on', 'high', 'threshold', 'exceedances', 'for', 'estimating', 'covariatedependent', 'joint', 'tail', 'characteristics', 'for', 'regimes', 'of', 'asymptotic', 'dependence', 'and', 'asymptotic', 'independence', 'the', 'framework', 'is', 'based', 'on', 'suitably', 'defined', 'marginal', 'pretransformations', 'and', 'projections', 'of', 'the', 'random', 'vector', 'along', 'the', 'directions', 'of', 'the', 'unit', 'simplex', 'which', 'lead', 'to', 'convenient', 'univariate', 'representations', 'of', 'multivariate', 'exceedances', 'based', 'on', 'the', 'exponential', 'distribution', 'good', 'performance', 'of', 'our', 'estimators', 'of', 'a', 'nonparametrically', 'designed', 'influence', 'of', 'covariates', 'on', 'extremal', 'coefficients', 'and', 'tail', 'dependence', 'coefficients', 'are', 'shown', 'through', 'a', 'simulation', 'study', 'we', 'illustrate', 'the', 'usefulness', 'of', 'our', 'modeling', 'framework', 'on', 'a', 'large', 'dataset', 'of', 'nitrogen', 'dioxide', 'measurements', 'recorded', 'in', 'france', 'between', '1999', 'and', '2012', 'where', 'we', 'use', 'the', 'generalized', 'additive', 'framework', 'for', 'modeling', 'marginal', 'distributions', 'and', 'tail', 'dependence', 'in', 'monthly', 'maxima', 'our', 'results', 'imply', 'asymptotic', 'independence', 'of', 'data', 'observed', 'at', 'different', 'stations', 'and', 'we', 'find', 'that', 'the', 'estimated', 'coefficients', 'of', 'tail', 'dependence', 'decrease', 'as', 'a', 'function', 'of', 'spatial', 'distance', 'and', 'show', 'distinct', 'patterns', 'for', 'different', 'years', 'and', 'for', 'different', 'types', 'of', 'stations', 'traffic', 'vs', 'background']] | [-0.05952289123147821, 0.06062004946840879, -0.12792263788720354, 0.10245337745604607, -0.049224416818469764, -0.10131677846209361, 0.08270650359694488, 0.37753230046767455, -0.2201040351954408, -0.29228283347418677, 0.08577961819485212, -0.28017111445466675, -0.14876482165299165, 0.17347272933484653, -0.06888107047058069, 0.07855299746905728, 0.053122765730875425, 0.0018314869644550176, -0.0642166237358768, -0.24398423883562478, 0.3089855903664078, 0.08719467679217745, 0.3697291411602726, 0.025197578866321308, 0.15672390540540876, 0.0629244247242474, -0.09867215713199515, 0.008871898892072913, -0.13752880541220433, 0.126898629971756, 0.23809628379411804, 0.11632122380885845, 0.27189139798522377, -0.4022952905581452, -0.2087409880048094, 0.0967285225358911, 0.09987032269008267, -0.00288130484151248, -0.006690124368581634, -0.26861671570401924, 0.05743750979980597, -0.17085985191739522, -0.098751500974863, -0.07452718611651411, 0.0333292034908365, 0.09875563716229338, -0.3616834965071832, 0.11776400847503772, 0.04189607806933614, 0.11176340024775037, -0.03801709576629293, -0.17664504687612256, 0.006454284614525162, 0.1116002256178315, 0.09016182666095213, -0.06296224230721306, 0.12892339447847542, -0.09350921792360262, -0.08732179722103935, 0.2751483052133177, -0.09613198962373039, -0.20538747280071942, 0.16353894162994737, -0.1751109892144226, -0.16938292746169445, 0.08689954128976052, 0.2609434904864965, 0.10866845973218099, -0.1468430850848866, 0.06382628303612224, -0.04284913819283247, 0.12751587302221032, 0.07985758838387062, 0.02940339425769754, 0.18485071470674413, 0.14115545003173444, 0.040432405664931795, 0.13431795567441254, -0.14281155559807443, -0.10549866530375603, -0.2966526587684758, -0.0896533619884091, -0.19609804938499553, -0.01708315916490765, -0.18694481194573037, -0.18435287410199333, 0.4246151051651209, 0.14830527313005848, 0.24062136332743253, 0.0905955329626942, 0.24271581756571928, 0.12272282753599426, -0.003696502413218602, 0.08238854323202618, 0.1406636184009795, 0.12082846177180703, 0.0347977096405931, -0.185715901106596, 0.16283843697000963, 0.01309264952985522] |
1,802.01536 | Expressive Robot Motion Timing | Our goal is to enable robots to \emph{time} their motion in a way that is
purposefully expressive of their internal states, making them more transparent
to people. We start by investigating what types of states motion timing is
capable of expressing, focusing on robot manipulation and keeping the path
constant while systematically varying the timing. We find that users naturally
pick up on certain properties of the robot (like confidence), of the motion
(like naturalness), or of the task (like the weight of the object that the
robot is carrying). We then conduct a hypothesis-driven experiment to tease out
the directions and magnitudes of these effects, and use our findings to develop
candidate mathematical models for how users make these inferences from the
timing. We find a strong correlation between the models and real user data,
suggesting that robots can leverage these models to autonomously optimize the
timing of their motion to be expressive.
| cs.RO | our goal is to enable robots to emphtime their motion in a way that is purposefully expressive of their internal states making them more transparent to people we start by investigating what types of states motion timing is capable of expressing focusing on robot manipulation and keeping the path constant while systematically varying the timing we find that users naturally pick up on certain properties of the robot like confidence of the motion like naturalness or of the task like the weight of the object that the robot is carrying we then conduct a hypothesisdriven experiment to tease out the directions and magnitudes of these effects and use our findings to develop candidate mathematical models for how users make these inferences from the timing we find a strong correlation between the models and real user data suggesting that robots can leverage these models to autonomously optimize the timing of their motion to be expressive | [['our', 'goal', 'is', 'to', 'enable', 'robots', 'to', 'emphtime', 'their', 'motion', 'in', 'a', 'way', 'that', 'is', 'purposefully', 'expressive', 'of', 'their', 'internal', 'states', 'making', 'them', 'more', 'transparent', 'to', 'people', 'we', 'start', 'by', 'investigating', 'what', 'types', 'of', 'states', 'motion', 'timing', 'is', 'capable', 'of', 'expressing', 'focusing', 'on', 'robot', 'manipulation', 'and', 'keeping', 'the', 'path', 'constant', 'while', 'systematically', 'varying', 'the', 'timing', 'we', 'find', 'that', 'users', 'naturally', 'pick', 'up', 'on', 'certain', 'properties', 'of', 'the', 'robot', 'like', 'confidence', 'of', 'the', 'motion', 'like', 'naturalness', 'or', 'of', 'the', 'task', 'like', 'the', 'weight', 'of', 'the', 'object', 'that', 'the', 'robot', 'is', 'carrying', 'we', 'then', 'conduct', 'a', 'hypothesisdriven', 'experiment', 'to', 'tease', 'out', 'the', 'directions', 'and', 'magnitudes', 'of', 'these', 'effects', 'and', 'use', 'our', 'findings', 'to', 'develop', 'candidate', 'mathematical', 'models', 'for', 'how', 'users', 'make', 'these', 'inferences', 'from', 'the', 'timing', 'we', 'find', 'a', 'strong', 'correlation', 'between', 'the', 'models', 'and', 'real', 'user', 'data', 'suggesting', 'that', 'robots', 'can', 'leverage', 'these', 'models', 'to', 'autonomously', 'optimize', 'the', 'timing', 'of', 'their', 'motion', 'to', 'be', 'expressive']] | [-0.08845892129087966, 0.09509144099913054, -0.10552451075598984, 0.05970461181948542, -0.17151119573307888, -0.14823382984931496, 0.0964638843615358, 0.4476424941155068, -0.2698513089902941, -0.37140467476898004, 0.07707582091664678, -0.28910757854955826, -0.15025551465503242, 0.17913395018685707, -0.08169412400646063, 0.05032493685396364, 0.07360294051226471, 0.049029293125374365, -0.009641102772181878, -0.2246903904045436, 0.29615703902007745, 0.06194183802498238, 0.22337628659707578, 0.009315824387111253, 0.11005430856142072, 0.005417797220840615, -0.02540962925700882, -0.000538885167062089, -0.08177256726077002, 0.17375268370393882, 0.2634717133804971, 0.17155439009007017, 0.25998478150599963, -0.45302370040641204, -0.17230085715766416, 0.08316361775633867, 0.10907554698355085, 0.07913801278586366, 0.000688016637929189, -0.33941432369219793, 0.0985503073202676, -0.15929426365326366, -0.11177263300950555, -0.13298239601872763, 0.020892433707913015, 0.040928389189172194, -0.22989175098573233, -0.0013779509606976787, 0.05926635884679854, 0.041113559330523304, -0.05307510246480392, -0.0549418376471436, -0.003153081408810693, 0.2280604196455354, 0.06575236286266477, -0.024070693279749582, 0.16134329543255463, -0.1843339764171389, -0.12632957292840113, 0.3948936642679785, 0.0193061306770262, -0.2248019125227901, 0.2236280261414948, -0.12313028265927713, -0.11665618039861128, 0.06826478656224132, 0.19442464161494916, 0.11417229068253866, -0.16194021172349812, -0.01539410307380528, 0.0026766298725814015, 0.19153046717394034, 0.057423247715349415, 0.013002897756379823, 0.2751349202014129, 0.1640952533071667, 0.07960961879436652, 0.11212015205725133, -0.07962937361780742, -0.08514792415579515, -0.24493870454426106, -0.12824564310722053, -0.10555612872046262, 0.024469818509041705, -0.07127253681250437, -0.10801111724130906, 0.40298031954784186, 0.2522591009536492, 0.19228149585837087, 0.10782043580207731, 0.293961728892785, 0.06243044577762726, 0.07650924044020184, 0.05841739981264396, 0.23034720192058616, 0.023651253060489142, 0.1073501081668542, -0.22287635201158898, 0.08845227764100713, -0.03550017626907725] |
1,802.01537 | The Bach equations in Spin-Coefficient form | Conformal gravity theories are defined by field equations that determine only
the conformal structure of the spacetime manifold. The Bach equations represent
an early example of such a theory, we present them here in component form in
terms of spin- and boost-weighted spin-coefficients using the compacted
spin-coefficient formalism. These equations can be used as an efficient
alternative to the standard tensor form. As a simple application we solve the
Bach equations for pp-wave and static spherically symmetric spacetimes.
| gr-qc | conformal gravity theories are defined by field equations that determine only the conformal structure of the spacetime manifold the bach equations represent an early example of such a theory we present them here in component form in terms of spin and boostweighted spincoefficients using the compacted spincoefficient formalism these equations can be used as an efficient alternative to the standard tensor form as a simple application we solve the bach equations for ppwave and static spherically symmetric spacetimes | [['conformal', 'gravity', 'theories', 'are', 'defined', 'by', 'field', 'equations', 'that', 'determine', 'only', 'the', 'conformal', 'structure', 'of', 'the', 'spacetime', 'manifold', 'the', 'bach', 'equations', 'represent', 'an', 'early', 'example', 'of', 'such', 'a', 'theory', 'we', 'present', 'them', 'here', 'in', 'component', 'form', 'in', 'terms', 'of', 'spin', 'and', 'boostweighted', 'spincoefficients', 'using', 'the', 'compacted', 'spincoefficient', 'formalism', 'these', 'equations', 'can', 'be', 'used', 'as', 'an', 'efficient', 'alternative', 'to', 'the', 'standard', 'tensor', 'form', 'as', 'a', 'simple', 'application', 'we', 'solve', 'the', 'bach', 'equations', 'for', 'ppwave', 'and', 'static', 'spherically', 'symmetric', 'spacetimes']] | [-0.12427402715394764, 0.09155802398125065, -0.0852579018897622, 0.08488220656535735, -0.12709654667904893, -0.13241515119903183, -0.13123898679776558, 0.30367803291760775, -0.20823622806193798, -0.25792688768553107, 0.11626491463118184, -0.23823968210796775, -0.21227085697587186, 0.13194963051692435, -0.00619872832229655, 0.026256049407253925, -0.027472759437698283, 0.06085036247110877, -0.11179096008785755, -0.22797425915670924, 0.369001209340671, 0.016358124361814635, 0.2496303271220409, -0.011733628441824726, 0.15607248021804385, -0.022942785308451244, 0.0031631391948873273, 0.10358885722234845, -0.11439313478264299, 0.08544433841138686, 0.2501779592528596, 0.12292549810617377, 0.16678681806354834, -0.48749421105573054, -0.2214015502556178, 0.05204568445486458, 0.1563909067282159, 0.1689294668260692, -0.03872303240074727, -0.29152812536707834, 0.0687633643821372, -0.21096709821569293, -0.19697276161566965, -0.13385209490201974, 0.004796046942876848, -0.06841176867754639, -0.22926837277957116, 0.09160407203997142, 0.05463562839615502, 0.001116921494126712, -0.13664183404149585, -0.05725088119384294, -0.012761671800705554, 0.07928437264145989, 0.054017529798377505, 0.03543706849143889, 0.10984777454531898, -0.13871656375397978, -0.12980071788555697, 0.3836721827668187, -0.12617796784462898, -0.3206202592945805, 0.1207977054750939, -0.05220548973394264, -0.11861355951374494, 0.042709929301820104, 0.16689246743427297, 0.2346104582722642, -0.1793302873059139, 0.16948615677967227, -0.04167469893582165, 0.08697117733199296, 0.10633244557232645, -0.030500837840679054, 0.23220691400102192, 0.07560494539058327, 0.00446709515036721, 0.12838825777534543, 0.019468536915634393, -0.10335407147144188, -0.36269269060147435, -0.20368099132347675, -0.13038351209711677, 0.13626235462786435, -0.16860845460714222, -0.22622490620338603, 0.3488849652869823, 0.11194909105841744, 0.11135791538751953, 0.03051287146579278, 0.23990917568536183, 0.12682252566293373, 0.06977326575456812, 0.10562020625710782, 0.23775007537762194, 0.20708558808301428, 0.08363473512795999, -0.17480478537465005, -0.04968213327351565, 0.13457900946837312] |
1,802.01538 | Some remarks on PL collapsible covers of 2-dimensional polyhedra | We analyze the topology and geometry of a polyhedron of dimension 2 according
to the minimum size of a cover by PL collapsible polyhedra. We provide partial
characterizations of the polyhedra of dimension 2 that can be decomposed as the
union of two PL collapsible subpolyhedra in terms of their simple homotopy type
and certain local properties. In the process, a special class of polyhedra of
dimension 2 appears naturally. We give a combinatorial description of the
spaces in this class, which includes all closed surfaces and the complexes
associated to one-relator presentations.
| math.GT math.AT | we analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by pl collapsible polyhedra we provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two pl collapsible subpolyhedra in terms of their simple homotopy type and certain local properties in the process a special class of polyhedra of dimension 2 appears naturally we give a combinatorial description of the spaces in this class which includes all closed surfaces and the complexes associated to onerelator presentations | [['we', 'analyze', 'the', 'topology', 'and', 'geometry', 'of', 'a', 'polyhedron', 'of', 'dimension', '2', 'according', 'to', 'the', 'minimum', 'size', 'of', 'a', 'cover', 'by', 'pl', 'collapsible', 'polyhedra', 'we', 'provide', 'partial', 'characterizations', 'of', 'the', 'polyhedra', 'of', 'dimension', '2', 'that', 'can', 'be', 'decomposed', 'as', 'the', 'union', 'of', 'two', 'pl', 'collapsible', 'subpolyhedra', 'in', 'terms', 'of', 'their', 'simple', 'homotopy', 'type', 'and', 'certain', 'local', 'properties', 'in', 'the', 'process', 'a', 'special', 'class', 'of', 'polyhedra', 'of', 'dimension', '2', 'appears', 'naturally', 'we', 'give', 'a', 'combinatorial', 'description', 'of', 'the', 'spaces', 'in', 'this', 'class', 'which', 'includes', 'all', 'closed', 'surfaces', 'and', 'the', 'complexes', 'associated', 'to', 'onerelator', 'presentations']] | [-0.12752883194354914, 0.08059458533722547, -0.05608882519706924, 0.08090936889949331, -0.05897767427227189, -0.09763184814683852, 0.019577177829780086, 0.34897558635441206, -0.3368488261225804, -0.24885079264640808, 0.1022711471236381, -0.2289057584925084, -0.14913946475773568, 0.18655796531307442, -0.15644723345195094, -0.04690507573065578, 0.011155567790371596, 0.04747069146144905, -0.07588191976467515, -0.2843133331306519, 0.37330114087139965, -0.06670812586502682, 0.1996500641876229, 0.06643790499337258, 0.08882987901808755, 0.022741559437245772, 0.0006586447738671816, 0.13722733270446708, -0.19230549169432995, 0.18979217610021512, 0.26644540048374604, 0.127137461557023, 0.18174908167973, -0.3819697051439234, -0.1611395218229342, 0.13860451459624273, 0.11862574417083975, 0.035744396693033156, 0.010696302786449431, -0.20214254139567053, 0.0882424817180201, -0.11539568538747487, -0.16238666984242617, -0.05538336053864294, 0.04556512122633316, 0.046754834462477954, -0.19175596597794725, -0.005516020666247094, 0.15554965925853578, 0.09841286348209026, -0.07292210454902341, -0.10131434016730836, -0.059406889442314384, 0.11559126337724789, -0.0520422254862409, -0.002448330558235607, 0.0597717657645223, -0.09501989163528447, -0.16074606762217578, 0.4116616293998255, -0.003212233825076011, -0.21645997659183078, 0.19480910618859593, -0.17268135992970357, -0.15837490535591559, 0.18446847340918235, 0.15053680336843894, 0.15222488404051351, -0.09056887622441977, 0.15367674202500511, -0.08864045752492804, 0.1069850252680881, 0.10172066685333046, 0.06096049865347243, 0.11800025051499727, 0.13401554349649658, 0.10538933307973929, 0.213460297703052, -0.006692429714690974, -0.044150767233898686, -0.35192702864847514, -0.20328718580065236, -0.13274861240424016, 0.11553626297973096, -0.14148574497069416, -0.21379151543782604, 0.4130634660482086, -0.0170296137421442, 0.21880272437908477, 0.11349953132336058, 0.19421485418914466, 0.02348879761668423, 0.07070983347222609, 0.04704542784020305, 0.13636572530708446, 0.1523214436451634, -0.014334544859906678, -0.13173093159322538, 0.009697872664659254, 0.19854668306276924] |
1,802.01539 | ATLAS Probe: Breakthrough Science of Galaxy Evolution, Cosmology, Milky
Way, and the Solar System | ATLAS (Astrophysics Telescope for Large Area Spectroscopy) Probe is a concept
for a NASA probe-class space mission. It is the follow-up space mission to
WFIRST, boosting its scientific return by obtaining deep IR slit spectroscopy
for 70% of all galaxies imaged by a 2000 sq deg WFIRST High Latitude Survey at
z>0.5. ATLAS will measure accurate and precise redshifts for 200M galaxies out
to z < 7, and deliver spectra that enable a wide range of diagnostic studies of
the physical properties of galaxies over most of cosmic history. ATLAS Probe
science spans four broad categories: (1) Revolutionizing galaxy evolution
studies by tracing the relation between galaxies and dark matter from galaxy
groups to cosmic voids and filaments, from the epoch of reionization through
the peak era of galaxy assembly; (2) Opening a new window into the dark
Universe by weighing the dark matter filaments using 3D weak lensing with
spectroscopic redshifts, and obtaining definitive measurements of dark energy
and modification of General Relativity using galaxy clustering; (3) Probing the
Milky Way's dust-enshrouded regions, reaching the far side of our Galaxy; and
(4) Exploring the formation history of the outer Solar System by characterizing
Kuiper Belt Objects. ATLAS Probe is a 1.5m telescope with a field of view of
0.4 sq deg, and uses Digital Micro-mirror Devices (DMDs) as slit selectors. It
has a spectroscopic resolution of R = 1000 over 1-4 microns, and a
spectroscopic multiplex factor >5,000. ATLAS is designed to fit within the NASA
probe-class space mission cost envelope; it has a single instrument, a
telescope aperture that allows for a lighter launch vehicle, and mature
technology. ATLAS Probe will lead to transformative science over the entire
range of astrophysics: from galaxy evolution to the dark Universe, from Solar
System objects to the dusty regions of the Milky Way.
| astro-ph.IM astro-ph.CO astro-ph.EP astro-ph.GA astro-ph.SR | atlas astrophysics telescope for large area spectroscopy probe is a concept for a nasa probeclass space mission it is the followup space mission to wfirst boosting its scientific return by obtaining deep ir slit spectroscopy for 70 of all galaxies imaged by a 2000 sq deg wfirst high latitude survey at z05 atlas will measure accurate and precise redshifts for 200m galaxies out to z 7 and deliver spectra that enable a wide range of diagnostic studies of the physical properties of galaxies over most of cosmic history atlas probe science spans four broad categories 1 revolutionizing galaxy evolution studies by tracing the relation between galaxies and dark matter from galaxy groups to cosmic voids and filaments from the epoch of reionization through the peak era of galaxy assembly 2 opening a new window into the dark universe by weighing the dark matter filaments using 3d weak lensing with spectroscopic redshifts and obtaining definitive measurements of dark energy and modification of general relativity using galaxy clustering 3 probing the milky ways dustenshrouded regions reaching the far side of our galaxy and 4 exploring the formation history of the outer solar system by characterizing kuiper belt objects atlas probe is a 15m telescope with a field of view of 04 sq deg and uses digital micromirror devices dmds as slit selectors it has a spectroscopic resolution of r 1000 over 14 microns and a spectroscopic multiplex factor 5000 atlas is designed to fit within the nasa probeclass space mission cost envelope it has a single instrument a telescope aperture that allows for a lighter launch vehicle and mature technology atlas probe will lead to transformative science over the entire range of astrophysics from galaxy evolution to the dark universe from solar system objects to the dusty regions of the milky way | [['atlas', 'astrophysics', 'telescope', 'for', 'large', 'area', 'spectroscopy', 'probe', 'is', 'a', 'concept', 'for', 'a', 'nasa', 'probeclass', 'space', 'mission', 'it', 'is', 'the', 'followup', 'space', 'mission', 'to', 'wfirst', 'boosting', 'its', 'scientific', 'return', 'by', 'obtaining', 'deep', 'ir', 'slit', 'spectroscopy', 'for', '70', 'of', 'all', 'galaxies', 'imaged', 'by', 'a', '2000', 'sq', 'deg', 'wfirst', 'high', 'latitude', 'survey', 'at', 'z05', 'atlas', 'will', 'measure', 'accurate', 'and', 'precise', 'redshifts', 'for', '200m', 'galaxies', 'out', 'to', 'z', '7', 'and', 'deliver', 'spectra', 'that', 'enable', 'a', 'wide', 'range', 'of', 'diagnostic', 'studies', 'of', 'the', 'physical', 'properties', 'of', 'galaxies', 'over', 'most', 'of', 'cosmic', 'history', 'atlas', 'probe', 'science', 'spans', 'four', 'broad', 'categories', '1', 'revolutionizing', 'galaxy', 'evolution', 'studies', 'by', 'tracing', 'the', 'relation', 'between', 'galaxies', 'and', 'dark', 'matter', 'from', 'galaxy', 'groups', 'to', 'cosmic', 'voids', 'and', 'filaments', 'from', 'the', 'epoch', 'of', 'reionization', 'through', 'the', 'peak', 'era', 'of', 'galaxy', 'assembly', '2', 'opening', 'a', 'new', 'window', 'into', 'the', 'dark', 'universe', 'by', 'weighing', 'the', 'dark', 'matter', 'filaments', 'using', '3d', 'weak', 'lensing', 'with', 'spectroscopic', 'redshifts', 'and', 'obtaining', 'definitive', 'measurements', 'of', 'dark', 'energy', 'and', 'modification', 'of', 'general', 'relativity', 'using', 'galaxy', 'clustering', '3', 'probing', 'the', 'milky', 'ways', 'dustenshrouded', 'regions', 'reaching', 'the', 'far', 'side', 'of', 'our', 'galaxy', 'and', '4', 'exploring', 'the', 'formation', 'history', 'of', 'the', 'outer', 'solar', 'system', 'by', 'characterizing', 'kuiper', 'belt', 'objects', 'atlas', 'probe', 'is', 'a', '15m', 'telescope', 'with', 'a', 'field', 'of', 'view', 'of', '04', 'sq', 'deg', 'and', 'uses', 'digital', 'micromirror', 'devices', 'dmds', 'as', 'slit', 'selectors', 'it', 'has', 'a', 'spectroscopic', 'resolution', 'of', 'r', '1000', 'over', '14', 'microns', 'and', 'a', 'spectroscopic', 'multiplex', 'factor', '5000', 'atlas', 'is', 'designed', 'to', 'fit', 'within', 'the', 'nasa', 'probeclass', 'space', 'mission', 'cost', 'envelope', 'it', 'has', 'a', 'single', 'instrument', 'a', 'telescope', 'aperture', 'that', 'allows', 'for', 'a', 'lighter', 'launch', 'vehicle', 'and', 'mature', 'technology', 'atlas', 'probe', 'will', 'lead', 'to', 'transformative', 'science', 'over', 'the', 'entire', 'range', 'of', 'astrophysics', 'from', 'galaxy', 'evolution', 'to', 'the', 'dark', 'universe', 'from', 'solar', 'system', 'objects', 'to', 'the', 'dusty', 'regions', 'of', 'the', 'milky', 'way']] | [-0.052942225829271286, 0.09801723545941059, -0.10884389637038111, 0.07585660266379515, -0.14557371529440086, -0.06629015701978157, 0.0029416505728537836, 0.38046504313591867, -0.1699451063282322, -0.4169995951248954, 0.05261335789846877, -0.2968243063839327, -0.010050209055965145, 0.2575216371868737, -0.0015030072590646645, -0.0012776027928339318, 0.08227279241662472, -0.14718084063846618, 0.0043454370762143904, -0.29168936192368466, 0.25942910262732766, 0.1703817402322117, 0.17495573150964144, -0.06628514624355981, 0.13888766951082895, -0.041969390142088135, -0.11851393177406862, -0.01289283209751981, -0.20773618382581238, 0.06717712845808516, 0.29888372991379586, 0.1998108567375069, 0.2593508634475681, -0.3119906838266373, -0.20824362872517668, 0.07429226320236922, 0.17744991512226987, 0.01488992896086226, -0.07782811337926736, -0.3242253959660108, 0.058932885868416635, -0.1958394097792916, -0.15672523614868017, 0.04076598283097459, 0.027471013960506146, 0.001761631293532749, -0.18522191539717217, 0.0508049273941045, -0.07768256827490404, 0.12185881355854992, -0.09992215208840208, -0.06955734088240813, -0.03563908854538264, 0.11526968668059756, -0.050034341690673806, 0.09961330688752544, 0.2318239251865695, -0.1858233849867247, -0.011229918459430338, 0.40206283109107366, -0.06072431150668611, 0.05124072354054079, 0.18615907296383133, -0.2508739730420833, -0.140095165943106, 0.14705672133752765, 0.16177521641288573, 0.08880844483850524, -0.17967613997869195, 0.09239647481086043, 0.005934712387000521, 0.21475839723204748, 0.07520291143795475, 0.08404214017665557, 0.3671569060875724, 0.18744604878127574, 0.11503216011779538, 0.05452201817805569, -0.24237347489998987, -0.010968245818900565, -0.2594535452562074, -0.1377424291377247, -0.13578550238744355, 0.07427258974639699, -0.11336844728590222, -0.07841002608882264, 0.36974667401984335, 0.1011805411412691, 0.18511173129780217, 0.042429582229815424, 0.3330831196097036, -0.060381926762250564, 0.13163121983020876, 0.023778821035909156, 0.3227053989388514, 0.13401288689346985, 0.14735150327517962, -0.15227059345226734, -0.007813258470656972, -0.006281419263832504] |
1,802.0154 | Indexed Markov Chains for financial data: testing for the number of
states of the index process | A new branch based on Markov processes is developing in the recent literature
of financial time series modeling. In this paper, an Indexed Markov Chain has
been used to model high frequency price returns of quoted firms. The
peculiarity of this type of model is that through the introduction of an Index
process it is possible to consider the market volatility endogenously and two
very important stylized facts of financial time series can be taken into
account: long memory and volatility clustering. In this paper, first we propose
a method for the optimal determination of the state space of the Index process
which is based on a change-point approach for Markov chains. Furthermore we
provide an explicit formula for the probability distribution function of the
first change of state of the index process. Results are illustrated with an
application to intra-day prices of a quoted Italian firm from January $1^{st}$,
2007 to December $31^{st}$ 2010.
| q-fin.ST | a new branch based on markov processes is developing in the recent literature of financial time series modeling in this paper an indexed markov chain has been used to model high frequency price returns of quoted firms the peculiarity of this type of model is that through the introduction of an index process it is possible to consider the market volatility endogenously and two very important stylized facts of financial time series can be taken into account long memory and volatility clustering in this paper first we propose a method for the optimal determination of the state space of the index process which is based on a changepoint approach for markov chains furthermore we provide an explicit formula for the probability distribution function of the first change of state of the index process results are illustrated with an application to intraday prices of a quoted italian firm from january 1st 2007 to december 31st 2010 | [['a', 'new', 'branch', 'based', 'on', 'markov', 'processes', 'is', 'developing', 'in', 'the', 'recent', 'literature', 'of', 'financial', 'time', 'series', 'modeling', 'in', 'this', 'paper', 'an', 'indexed', 'markov', 'chain', 'has', 'been', 'used', 'to', 'model', 'high', 'frequency', 'price', 'returns', 'of', 'quoted', 'firms', 'the', 'peculiarity', 'of', 'this', 'type', 'of', 'model', 'is', 'that', 'through', 'the', 'introduction', 'of', 'an', 'index', 'process', 'it', 'is', 'possible', 'to', 'consider', 'the', 'market', 'volatility', 'endogenously', 'and', 'two', 'very', 'important', 'stylized', 'facts', 'of', 'financial', 'time', 'series', 'can', 'be', 'taken', 'into', 'account', 'long', 'memory', 'and', 'volatility', 'clustering', 'in', 'this', 'paper', 'first', 'we', 'propose', 'a', 'method', 'for', 'the', 'optimal', 'determination', 'of', 'the', 'state', 'space', 'of', 'the', 'index', 'process', 'which', 'is', 'based', 'on', 'a', 'changepoint', 'approach', 'for', 'markov', 'chains', 'furthermore', 'we', 'provide', 'an', 'explicit', 'formula', 'for', 'the', 'probability', 'distribution', 'function', 'of', 'the', 'first', 'change', 'of', 'state', 'of', 'the', 'index', 'process', 'results', 'are', 'illustrated', 'with', 'an', 'application', 'to', 'intraday', 'prices', 'of', 'a', 'quoted', 'italian', 'firm', 'from', 'january', '1st', '2007', 'to', 'december', '31st', '2010']] | [-0.06427175988473238, 0.06761298254169824, -0.1331897726402648, 0.0901430711335941, -0.10069817250534412, -0.07678029464047041, 0.095446192516735, 0.415140619867992, -0.2667290969432572, -0.2829061695618645, 0.16933981169450787, -0.25878064795547434, -0.1351869803402693, 0.19723461618526808, -0.10235717010293757, 0.03508450296677409, 0.04050975321010957, 0.002739968074433085, 0.045034764828385726, -0.2713714089379796, 0.28122830692858947, 0.09838672329581553, 0.3004755876237346, 0.012339354180280239, 0.1458985856223491, -0.011839650832717458, -0.06982354604669155, -0.046527408859730064, -0.1291217201556954, 0.14306840056238035, 0.2502100407957069, 0.10291996280842972, 0.3225891807296824, -0.4215056920964872, -0.1781581639192037, 0.11706399492423741, 0.06532893527389294, 0.054645773938917105, 0.017460576118901373, -0.29522476243155615, -0.000899138101827233, -0.2589729626809487, -0.08565074904491343, -0.04644981614283977, 0.0672546831860898, 0.0050520339019356235, -0.296747295270043, 0.07205101914305781, 0.06158211423204311, 0.058751577559873584, -0.05251406502943756, -0.11564583504692681, 0.01430686351152197, 0.16034188194260482, 0.12196779981229244, -0.03509778204944826, 0.059732408579739354, -0.06584438461840393, -0.18641132330221513, 0.33909197845045597, -0.09034432861202907, -0.11199577119381678, 0.10781714981121401, -0.12563459170801985, -0.18451354135759174, 0.12798338453736036, 0.21517844087774715, 0.08324039613888148, -0.19074996124216986, 0.07731479667953306, -0.042127868105777566, 0.19738914186825915, 0.021758407561649238, -0.044757275148144655, 0.17629829089367582, 0.22800460263425784, 0.0639458984977776, 0.15181428865649768, -0.08951756326902298, -0.14887779076290766, -0.3124669249499998, -0.17242269427064927, -0.1925932901520883, 0.03752290368110182, -0.10902956037973655, -0.1989085766381674, 0.4161546687565504, 0.1619123656939278, 0.18461509992879244, 0.0523014152430058, 0.24860565422042724, 0.18706822869698367, -0.055263953414490266, 0.06029985345479461, 0.1652624287792752, 0.05704515565697464, 0.14964078119505317, -0.11012406792987378, 0.1637428693450807, 0.07215155529218815] |
1,802.01541 | Inverse regression for ridge recovery II: Numerics | We investigate the application of sufficient dimension reduction (SDR) to a
noiseless data set derived from a deterministic function of several variables.
In this context, SDR provides a framework for ridge recovery. In this second
part, we explore the numerical subtleties associated with using two inverse
regression methods---sliced inverse regression (SIR) and sliced average
variance estimation (SAVE)---for ridge recovery. This includes a detailed
numerical analysis of the eigenvalues of the resulting matrices and the
subspaces spanned by their columns. After this analysis, we demonstrate the
methods on several numerical test problems.
| math.NA | we investigate the application of sufficient dimension reduction sdr to a noiseless data set derived from a deterministic function of several variables in this context sdr provides a framework for ridge recovery in this second part we explore the numerical subtleties associated with using two inverse regression methodssliced inverse regression sir and sliced average variance estimation savefor ridge recovery this includes a detailed numerical analysis of the eigenvalues of the resulting matrices and the subspaces spanned by their columns after this analysis we demonstrate the methods on several numerical test problems | [['we', 'investigate', 'the', 'application', 'of', 'sufficient', 'dimension', 'reduction', 'sdr', 'to', 'a', 'noiseless', 'data', 'set', 'derived', 'from', 'a', 'deterministic', 'function', 'of', 'several', 'variables', 'in', 'this', 'context', 'sdr', 'provides', 'a', 'framework', 'for', 'ridge', 'recovery', 'in', 'this', 'second', 'part', 'we', 'explore', 'the', 'numerical', 'subtleties', 'associated', 'with', 'using', 'two', 'inverse', 'regression', 'methodssliced', 'inverse', 'regression', 'sir', 'and', 'sliced', 'average', 'variance', 'estimation', 'savefor', 'ridge', 'recovery', 'this', 'includes', 'a', 'detailed', 'numerical', 'analysis', 'of', 'the', 'eigenvalues', 'of', 'the', 'resulting', 'matrices', 'and', 'the', 'subspaces', 'spanned', 'by', 'their', 'columns', 'after', 'this', 'analysis', 'we', 'demonstrate', 'the', 'methods', 'on', 'several', 'numerical', 'test', 'problems']] | [-0.08502017202776636, -0.04786184364197294, -0.05158773801823178, 0.09221870596442121, -0.02748796258519372, -0.09450687008669202, 0.05542398838907103, 0.38044091032587746, -0.29358029553896925, -0.23407083111972118, 0.19924537653072077, -0.24449635456117352, -0.20105761032174813, 0.19515971422948863, -0.05533806564223565, 0.11486952640953359, 0.0759803752723579, -0.020743782218713105, -0.14980345805374423, -0.24107060109505826, 0.30225815797705996, 0.07715751668124386, 0.2679348729807214, -0.01584787733769149, 0.1489271171759877, 0.04722816203040688, -0.10659844567737636, 0.002338537870477257, -0.11188478381673837, 0.1546433176217454, 0.2607821503816319, 0.1869154555508553, 0.33591943185023043, -0.3765510530367996, -0.21702494613794882, 0.12220131378788292, 0.1329877481147061, 0.09303922266856338, -0.03322637454067681, -0.2593009750871511, 0.038169375934711335, -0.14007935110019165, -0.08775184819281227, -0.07147253376923585, -0.041633277760002384, -0.02760287776610322, -0.3257184270677795, 0.10998232958555808, 0.05236332001834271, 0.10341034494758991, -0.05257807866136512, -0.17293829694285653, 0.07400111757020016, 0.06168670834989151, 0.05943106808647346, -0.06045801340591874, 0.1054488856167522, -0.06300212872957581, -0.12853501809321427, 0.31654942254378887, -0.04775423794105817, -0.24217713051841835, 0.19350980460549588, -0.1254033100205275, -0.1168648942970158, 0.1199699089956585, 0.25229037623182776, 0.07479907125967104, -0.15045907181488832, 0.07170320189625988, -0.09076055827854054, 0.140301927882299, 0.020462930778020555, -0.050726696952204275, 0.09693315881304443, 0.19644370491176927, 0.08065552090744624, 0.20909337496405908, -0.13206849726809064, -0.06345461438190234, -0.33546449352851077, -0.13509754850162883, -0.19671160625189207, 0.01843889737030847, -0.15217972024091456, -0.16031990572810173, 0.4454491441295053, 0.14753479586673504, 0.24433597066345508, 0.10107963174330385, 0.3290835438672914, 0.12738749507917327, 0.013209886867239068, 0.09149319048332616, 0.1805374750166378, 0.17912747028147738, 0.05913320638427741, -0.23503951589201494, 0.03507378144357144, 0.08550102272845303] |
1,802.01542 | Function approximation using gradient information with application to
parametric and stochastic differential equations | In the paper we consider the problem of multivariate function approximation
in polynomial basis. In order to solve this problem, we adjust the least
squares method (LSM) by adding information about derivatives of the function.
This modification allows reducing the number of evaluations of approximating
function while keeping the accuracy at the appropriate level. We propose
several techniques for time-efficient calculation of derivatives in various
applications. Numerical examples are given for comparison between the standard
LSM and the proposed approach.
| math.NA | in the paper we consider the problem of multivariate function approximation in polynomial basis in order to solve this problem we adjust the least squares method lsm by adding information about derivatives of the function this modification allows reducing the number of evaluations of approximating function while keeping the accuracy at the appropriate level we propose several techniques for timeefficient calculation of derivatives in various applications numerical examples are given for comparison between the standard lsm and the proposed approach | [['in', 'the', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'multivariate', 'function', 'approximation', 'in', 'polynomial', 'basis', 'in', 'order', 'to', 'solve', 'this', 'problem', 'we', 'adjust', 'the', 'least', 'squares', 'method', 'lsm', 'by', 'adding', 'information', 'about', 'derivatives', 'of', 'the', 'function', 'this', 'modification', 'allows', 'reducing', 'the', 'number', 'of', 'evaluations', 'of', 'approximating', 'function', 'while', 'keeping', 'the', 'accuracy', 'at', 'the', 'appropriate', 'level', 'we', 'propose', 'several', 'techniques', 'for', 'timeefficient', 'calculation', 'of', 'derivatives', 'in', 'various', 'applications', 'numerical', 'examples', 'are', 'given', 'for', 'comparison', 'between', 'the', 'standard', 'lsm', 'and', 'the', 'proposed', 'approach']] | [-0.06068631767993793, -0.009822505246847867, -0.05430624973378144, 0.07786480975046288, -0.05847069753799587, -0.07491637889761478, 0.04766533591464395, 0.35410221768543126, -0.2803318152669817, -0.3614986469910946, 0.11271156152943149, -0.285734050584324, -0.17254827530123293, 0.17610170729458333, -0.042453300947090614, 0.13943765887524934, 0.032720056176185605, 0.02401973007945344, -0.1359078343724832, -0.29232105480332393, 0.2997154928201553, 0.031144069507718086, 0.2535976211191155, 0.06435736766434275, 0.15663129934109749, 0.06787526532207266, -0.06024510451825336, 0.009939969637161993, -0.1100080250937026, 0.16244963800127152, 0.25419368692673744, 0.1354800581932068, 0.35348493070341647, -0.4281091529875994, -0.1747669995384058, 0.12110695088631473, 0.1165887854382163, 0.11188813067565206, -0.011836340499576182, -0.20454583271057344, 0.10676315856835572, -0.16793825697386638, -0.14369094123248943, -0.12225400269962847, -0.0780372489709407, 0.00762728748304653, -0.30683827281463893, 0.07459554675515392, 0.012269833032041788, 0.0414640425122343, -0.04420915786831756, -0.14369372391956858, 0.08460906933614751, 0.10086374456295744, 0.06461034694657428, 0.026053406560458826, 0.05844118827371858, -0.1380828503810335, -0.11085905279032886, 0.3572199802380055, -0.08385619541950291, -0.28484721085987985, 0.14052578392438592, -0.1168997474538628, -0.13922601085505448, 0.09309513082844205, 0.17999379788234365, 0.14297458718065173, -0.12982307457132264, 0.10404465112878825, -0.011705642205197365, 0.14259811149677262, 0.10388275590375998, -0.008607159683015198, 0.0917242698953487, 0.1746874906384619, 0.09865571226109751, 0.16713146634865553, -0.05174743114039302, -0.09825156686129048, -0.31697010141797366, -0.15815898689907043, -0.17922040814301, -0.06665024028043262, -0.11807080992130067, -0.13217635926557705, 0.4464014417957515, 0.19861837605712934, 0.17376838911441156, 0.10278322160011158, 0.34486650077160447, 0.18349502340424806, 0.03973344624755555, 0.05621857030782849, 0.1677544143909472, 0.09882265613414347, 0.05505725780094508, -0.21235225855925818, 0.09286251499434002, 0.1356497270578984] |
1,802.01543 | Deriving loop quantum cosmology dynamics from diffeomorphism invariance | We use the requirement of diffeomorphism invariance in the Bianchi I context
to derive the form of the quantum Hamiltonian constraint. After imposing the
correct classical behavior and making a certain minimality assumption, together
with a certain restriction to "planar loops", we then obtain a unique
expression for the quantum Hamiltonian operator for Bianchi I to both leading
and subleading orders in $\hbar$. Specifically, this expression is found to
exactly match the form proposed by Ashtekar and Wilson-Ewing in the loop
quantum cosmology (LQC) literature. Furthermore, by using the projection map
from the quantum states of the Bianchi I model to the states of the isotropic
model, we constrain the dynamics also in the homogeneous isotropic case, and
obtain, again to both leading and subleading order in $\hbar$, a quantum
constraint which exactly matches the standard `improved dynamics' of Ashtekar,
Pawlowski and Singh. This result in the isotropic case does not require a
restriction to planar loops, but only the minimality assumption. Our results
strengthen confidence in LQC dynamics and its observational predictions as
consequences of more basic fundamental principles. Of the assumptions made in
the isotropic case, the only one not rigidly determined by physical principle
is the minimality principle, our work also shows the exact freedom allowed when
this assumption is relaxed.
| gr-qc hep-th | we use the requirement of diffeomorphism invariance in the bianchi i context to derive the form of the quantum hamiltonian constraint after imposing the correct classical behavior and making a certain minimality assumption together with a certain restriction to planar loops we then obtain a unique expression for the quantum hamiltonian operator for bianchi i to both leading and subleading orders in hbar specifically this expression is found to exactly match the form proposed by ashtekar and wilsonewing in the loop quantum cosmology lqc literature furthermore by using the projection map from the quantum states of the bianchi i model to the states of the isotropic model we constrain the dynamics also in the homogeneous isotropic case and obtain again to both leading and subleading order in hbar a quantum constraint which exactly matches the standard improved dynamics of ashtekar pawlowski and singh this result in the isotropic case does not require a restriction to planar loops but only the minimality assumption our results strengthen confidence in lqc dynamics and its observational predictions as consequences of more basic fundamental principles of the assumptions made in the isotropic case the only one not rigidly determined by physical principle is the minimality principle our work also shows the exact freedom allowed when this assumption is relaxed | [['we', 'use', 'the', 'requirement', 'of', 'diffeomorphism', 'invariance', 'in', 'the', 'bianchi', 'i', 'context', 'to', 'derive', 'the', 'form', 'of', 'the', 'quantum', 'hamiltonian', 'constraint', 'after', 'imposing', 'the', 'correct', 'classical', 'behavior', 'and', 'making', 'a', 'certain', 'minimality', 'assumption', 'together', 'with', 'a', 'certain', 'restriction', 'to', 'planar', 'loops', 'we', 'then', 'obtain', 'a', 'unique', 'expression', 'for', 'the', 'quantum', 'hamiltonian', 'operator', 'for', 'bianchi', 'i', 'to', 'both', 'leading', 'and', 'subleading', 'orders', 'in', 'hbar', 'specifically', 'this', 'expression', 'is', 'found', 'to', 'exactly', 'match', 'the', 'form', 'proposed', 'by', 'ashtekar', 'and', 'wilsonewing', 'in', 'the', 'loop', 'quantum', 'cosmology', 'lqc', 'literature', 'furthermore', 'by', 'using', 'the', 'projection', 'map', 'from', 'the', 'quantum', 'states', 'of', 'the', 'bianchi', 'i', 'model', 'to', 'the', 'states', 'of', 'the', 'isotropic', 'model', 'we', 'constrain', 'the', 'dynamics', 'also', 'in', 'the', 'homogeneous', 'isotropic', 'case', 'and', 'obtain', 'again', 'to', 'both', 'leading', 'and', 'subleading', 'order', 'in', 'hbar', 'a', 'quantum', 'constraint', 'which', 'exactly', 'matches', 'the', 'standard', 'improved', 'dynamics', 'of', 'ashtekar', 'pawlowski', 'and', 'singh', 'this', 'result', 'in', 'the', 'isotropic', 'case', 'does', 'not', 'require', 'a', 'restriction', 'to', 'planar', 'loops', 'but', 'only', 'the', 'minimality', 'assumption', 'our', 'results', 'strengthen', 'confidence', 'in', 'lqc', 'dynamics', 'and', 'its', 'observational', 'predictions', 'as', 'consequences', 'of', 'more', 'basic', 'fundamental', 'principles', 'of', 'the', 'assumptions', 'made', 'in', 'the', 'isotropic', 'case', 'the', 'only', 'one', 'not', 'rigidly', 'determined', 'by', 'physical', 'principle', 'is', 'the', 'minimality', 'principle', 'our', 'work', 'also', 'shows', 'the', 'exact', 'freedom', 'allowed', 'when', 'this', 'assumption', 'is', 'relaxed']] | [-0.12107161672352856, 0.10893756762216582, -0.09559774382483806, 0.07922907249793132, -0.1003301281516797, -0.1505602785390497, 0.03415412870975577, 0.3027905226798258, -0.246298343035671, -0.27656873332110243, 0.08365842400615922, -0.23395450753769098, -0.14157005397507172, 0.1397920931378275, -0.056674612834005156, 0.05484142677317739, 0.04325831360749413, 0.048180169049458946, -0.08647299536381996, -0.25839665878529305, 0.3302956907465949, 0.06642017491046497, 0.27279330814767533, 0.035040268914939436, 0.09462509828915593, 0.001005741569570431, -0.0015005530559927852, 0.027566113677876782, -0.16055043433601401, 0.09623657157138713, 0.18698099073649288, 0.09290289311782918, 0.1885592957270967, -0.43531832319170793, -0.20604221181613264, 0.09713281258488092, 0.10375499730128969, 0.141347369629423, 0.020213097446719425, -0.28277199738114966, 0.058724524022844865, -0.15947630740571592, -0.1791666563748269, -0.06840989323741992, -0.003923952701353581, -0.060864081363646294, -0.2511240829127214, 0.0820491860028265, 0.12042848767699656, 0.014047577637726459, -0.059204970414654536, -0.056879417284388556, -0.0036894007429271658, 0.09685358655528561, 0.05180345646053483, 0.015080420243788823, 0.07992335253125318, -0.13123135500322053, -0.10477716981261428, 0.41087990141012404, -0.06012156855795863, -0.23508987424579106, 0.1198269847266933, -0.15333367275589832, -0.18383500054174007, 0.051824428846136986, 0.050702280784896185, 0.07961589278311634, -0.16023420797755875, 0.17365781321200088, -0.02056697126756483, 0.1304665889055686, 0.06827497709309682, 0.03281934638551184, 0.1634163061161221, 0.04793997135374556, 0.05749728140273245, 0.13281517535356682, -0.0212600604069602, -0.15377806608943773, -0.37542266171495214, -0.1440753627140902, -0.15921126061258403, 0.10511314561473593, -0.11693344190375385, -0.14761472573867243, 0.37163769411767406, 0.1461517323544532, 0.1713587557004817, 0.06279005530718976, 0.26753597056588907, 0.11479365061500728, 0.0418994445941263, 0.10092491822460858, 0.2837189430671213, 0.1586481543545063, 0.06284186484892722, -0.2172199319689056, 0.025991044074697333, 0.09240715273560207] |
1,802.01544 | Experimental tests of the chiral anomaly magnetoresistance in the
Dirac-Weyl semimetals Na$_3$Bi and GdPtBi | In the Dirac/Weyl semimetal, the chiral anomaly appears as an "axial" current
arising from charge-pumping between the lowest (chiral) Landau levels of the
Weyl nodes, when an electric field is applied parallel to a magnetic field $\bf
B$. Evidence for the chiral anomaly was obtained from the longitudinal
magnetoresistance (LMR) in Na$_3$Bi and GdPtBi. However, current jetting
effects (focussing of the current density $\bf J$) have raised general concerns
about LMR experiments. Here we implement a litmus test that allows the
intrinsic LMR in Na$_3$Bi and GdPtBi to be sharply distinguished from pure
current jetting effects (in pure Bi). Current jetting enhances $J$ along the
mid-ridge (spine) of the sample while decreasing it at the edge. We measure the
distortion by comparing the local voltage drop at the spine (expressed as the
resistance $R_{spine}$) with that at the edge ($R_{edge}$). In Bi, $R_{spine}$
sharply increases with $B$ but $R_{edge}$ decreases (jetting effects are
dominant). However, in Na$_3$Bi and GdPtBi, both $R_{spine}$ and $R_{edge}$
decrease (jetting effects are subdominant). A numerical simulation allows the
jetting distortions to be removed entirely. We find that the intrinsic
longitudinal resistivity $\rho_{xx}(B)$ in Na$_3$Bi decreases by a factor of
10.9 between $B$ = 0 and 10 T. A second litmus test is obtained from the
parametric plot of the planar angular magnetoresistance. These results
strenghthen considerably the evidence for the intrinsic nature of the
chiral-anomaly induced LMR. We briefly discuss how the squeeze test may be
extended to test ZrTe$_5$.
| cond-mat.str-el | in the diracweyl semimetal the chiral anomaly appears as an axial current arising from chargepumping between the lowest chiral landau levels of the weyl nodes when an electric field is applied parallel to a magnetic field bf b evidence for the chiral anomaly was obtained from the longitudinal magnetoresistance lmr in na_3bi and gdptbi however current jetting effects focussing of the current density bf j have raised general concerns about lmr experiments here we implement a litmus test that allows the intrinsic lmr in na_3bi and gdptbi to be sharply distinguished from pure current jetting effects in pure bi current jetting enhances j along the midridge spine of the sample while decreasing it at the edge we measure the distortion by comparing the local voltage drop at the spine expressed as the resistance r_spine with that at the edge r_edge in bi r_spine sharply increases with b but r_edge decreases jetting effects are dominant however in na_3bi and gdptbi both r_spine and r_edge decrease jetting effects are subdominant a numerical simulation allows the jetting distortions to be removed entirely we find that the intrinsic longitudinal resistivity rho_xxb in na_3bi decreases by a factor of 109 between b 0 and 10 t a second litmus test is obtained from the parametric plot of the planar angular magnetoresistance these results strenghthen considerably the evidence for the intrinsic nature of the chiralanomaly induced lmr we briefly discuss how the squeeze test may be extended to test zrte_5 | [['in', 'the', 'diracweyl', 'semimetal', 'the', 'chiral', 'anomaly', 'appears', 'as', 'an', 'axial', 'current', 'arising', 'from', 'chargepumping', 'between', 'the', 'lowest', 'chiral', 'landau', 'levels', 'of', 'the', 'weyl', 'nodes', 'when', 'an', 'electric', 'field', 'is', 'applied', 'parallel', 'to', 'a', 'magnetic', 'field', 'bf', 'b', 'evidence', 'for', 'the', 'chiral', 'anomaly', 'was', 'obtained', 'from', 'the', 'longitudinal', 'magnetoresistance', 'lmr', 'in', 'na_3bi', 'and', 'gdptbi', 'however', 'current', 'jetting', 'effects', 'focussing', 'of', 'the', 'current', 'density', 'bf', 'j', 'have', 'raised', 'general', 'concerns', 'about', 'lmr', 'experiments', 'here', 'we', 'implement', 'a', 'litmus', 'test', 'that', 'allows', 'the', 'intrinsic', 'lmr', 'in', 'na_3bi', 'and', 'gdptbi', 'to', 'be', 'sharply', 'distinguished', 'from', 'pure', 'current', 'jetting', 'effects', 'in', 'pure', 'bi', 'current', 'jetting', 'enhances', 'j', 'along', 'the', 'midridge', 'spine', 'of', 'the', 'sample', 'while', 'decreasing', 'it', 'at', 'the', 'edge', 'we', 'measure', 'the', 'distortion', 'by', 'comparing', 'the', 'local', 'voltage', 'drop', 'at', 'the', 'spine', 'expressed', 'as', 'the', 'resistance', 'r_spine', 'with', 'that', 'at', 'the', 'edge', 'r_edge', 'in', 'bi', 'r_spine', 'sharply', 'increases', 'with', 'b', 'but', 'r_edge', 'decreases', 'jetting', 'effects', 'are', 'dominant', 'however', 'in', 'na_3bi', 'and', 'gdptbi', 'both', 'r_spine', 'and', 'r_edge', 'decrease', 'jetting', 'effects', 'are', 'subdominant', 'a', 'numerical', 'simulation', 'allows', 'the', 'jetting', 'distortions', 'to', 'be', 'removed', 'entirely', 'we', 'find', 'that', 'the', 'intrinsic', 'longitudinal', 'resistivity', 'rho_xxb', 'in', 'na_3bi', 'decreases', 'by', 'a', 'factor', 'of', '109', 'between', 'b', '0', 'and', '10', 't', 'a', 'second', 'litmus', 'test', 'is', 'obtained', 'from', 'the', 'parametric', 'plot', 'of', 'the', 'planar', 'angular', 'magnetoresistance', 'these', 'results', 'strenghthen', 'considerably', 'the', 'evidence', 'for', 'the', 'intrinsic', 'nature', 'of', 'the', 'chiralanomaly', 'induced', 'lmr', 'we', 'briefly', 'discuss', 'how', 'the', 'squeeze', 'test', 'may', 'be', 'extended', 'to', 'test', 'zrte_5']] | [-0.15328764091730893, 0.20199755273364037, -0.03305521910030317, 0.012983325825431772, -0.06041193095734343, -0.14021734923201923, 0.05855245993686064, 0.3287783228210174, -0.25717105843359606, -0.29537905293206373, 0.03653463886827619, -0.2984198895808125, -0.12320838679297594, 0.1684615383380636, -0.017168926900679556, -0.012147724789489682, -0.02308877259201836, -0.016353291657287626, -0.09200361733091995, -0.1946559738231978, 0.2640523241716437, 0.05904345133846315, 0.32931500905081823, 0.09579764686350245, 0.028050883638206868, -0.031042097378955684, 0.0010216153740960484, 0.10776862556813285, -0.1284857313686795, -0.011048181077543025, 0.2154412742316102, -0.02098192196378174, 0.20145540968045073, -0.4022813423690422, -0.15493347315544573, 0.020218164435694536, 0.11806433768797434, 0.1276819162487906, -0.03955580507657335, -0.272061433919104, 0.07938079132582061, -0.14750092587977026, -0.12224311173000994, -0.06778460335123479, 0.02801429512425481, -0.04436936407898126, -0.2541716404414425, 0.1575821072551965, 0.0718909534974955, 0.0764707408748412, -0.060057227203894094, -0.15343162552599096, -0.08814638570183889, 0.0627615429245149, 0.1098674623319918, 0.08613332735258154, 0.1627868898678571, -0.15940032309736124, -0.12406009332432101, 0.34041503197101214, -0.08082984506812257, -0.12404189056954541, 0.1624611269760256, -0.2060775361993971, -0.08842245879410864, 0.15197532462577026, 0.13680469086029917, 0.06752577053945667, -0.073081189043963, 0.08096549683032209, -0.004213437553941427, 0.10478938878368353, 0.06093028940085787, -0.014947398129879729, 0.2535133467676739, 0.13170825616980436, 0.031705869451980104, 0.13273487140686485, -0.1268078509592063, -0.013522878800480006, -0.28808794371628516, -0.1425803278994863, -0.16360460150802586, 0.07185461429665642, -0.05620564758398056, -0.15502387639135123, 0.38225651511456815, 0.15181370918611112, 0.2140404769583256, -0.024630956914431106, 0.26395564318518155, 0.13370631431753283, 0.09305201381624405, 0.08335890958551317, 0.28411690207431095, 0.14961808642644125, 0.1347341079779047, -0.28307294224226404, 0.0702733503819521, -0.03674134682381312] |
1,802.01545 | Solution for a bipartite Euclidean traveling-salesman problem in one
dimension | The traveling salesman problem is one of the most studied combinatorial
optimization problems, because of the simplicity in its statement and the
difficulty in its solution. We characterize the optimal cycle for every convex
and increasing cost function when the points are thrown independently and with
an identical probability distribution in a compact interval. We compute the
average optimal cost for every number of points when the distance function is
the square of the Euclidean distance. We also show that the average optimal
cost is not a self-averaging quantity by explicitly computing the variance of
its distribution in the thermodynamic limit. Moreover, we prove that the cost
of the optimal cycle is not smaller than twice the cost of the optimal
assignment of the same set of points. Interestingly, this bound is saturated in
the thermodynamic limit.
| cond-mat.dis-nn math.CO | the traveling salesman problem is one of the most studied combinatorial optimization problems because of the simplicity in its statement and the difficulty in its solution we characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval we compute the average optimal cost for every number of points when the distance function is the square of the euclidean distance we also show that the average optimal cost is not a selfaveraging quantity by explicitly computing the variance of its distribution in the thermodynamic limit moreover we prove that the cost of the optimal cycle is not smaller than twice the cost of the optimal assignment of the same set of points interestingly this bound is saturated in the thermodynamic limit | [['the', 'traveling', 'salesman', 'problem', 'is', 'one', 'of', 'the', 'most', 'studied', 'combinatorial', 'optimization', 'problems', 'because', 'of', 'the', 'simplicity', 'in', 'its', 'statement', 'and', 'the', 'difficulty', 'in', 'its', 'solution', 'we', 'characterize', 'the', 'optimal', 'cycle', 'for', 'every', 'convex', 'and', 'increasing', 'cost', 'function', 'when', 'the', 'points', 'are', 'thrown', 'independently', 'and', 'with', 'an', 'identical', 'probability', 'distribution', 'in', 'a', 'compact', 'interval', 'we', 'compute', 'the', 'average', 'optimal', 'cost', 'for', 'every', 'number', 'of', 'points', 'when', 'the', 'distance', 'function', 'is', 'the', 'square', 'of', 'the', 'euclidean', 'distance', 'we', 'also', 'show', 'that', 'the', 'average', 'optimal', 'cost', 'is', 'not', 'a', 'selfaveraging', 'quantity', 'by', 'explicitly', 'computing', 'the', 'variance', 'of', 'its', 'distribution', 'in', 'the', 'thermodynamic', 'limit', 'moreover', 'we', 'prove', 'that', 'the', 'cost', 'of', 'the', 'optimal', 'cycle', 'is', 'not', 'smaller', 'than', 'twice', 'the', 'cost', 'of', 'the', 'optimal', 'assignment', 'of', 'the', 'same', 'set', 'of', 'points', 'interestingly', 'this', 'bound', 'is', 'saturated', 'in', 'the', 'thermodynamic', 'limit']] | [-0.15127315104388409, 0.08444246034960884, -0.07827698322434495, 0.08198874122055289, -0.019954437180932094, -0.09436093950916054, 0.12036130595935278, 0.34963372684199445, -0.30198257818671936, -0.2735992365305985, 0.1341273384942014, -0.2979542876247072, -0.13726111807364183, 0.17453671046226782, -0.09919668912180583, 0.08649172727825855, 0.058979847719960836, 0.09380160621537344, -0.06607866481860657, -0.2838408555155688, 0.2895217875815778, 0.05009826558241009, 0.27018087800340657, 0.06818237297243718, 0.12666542608338496, 0.027253024284319992, 0.05367178692190099, 0.060821112629406864, -0.12326128547554445, 0.11236449606872986, 0.22056926708043056, 0.16410771914227545, 0.3174479094038235, -0.36708366769377865, -0.15149373839775876, 0.19135359201213195, 0.120049453282688, 0.07728751228253308, 0.017612439928657925, -0.15018297753629894, 0.10065076411803708, -0.1002981930590459, -0.14978862984146732, 0.03918759021602136, 0.06868353668586726, 0.045944481890960995, -0.2516423288501636, 0.04997142726690577, 0.03671115814592608, 0.02394155120599444, -0.06996462873206984, -0.13291447132445164, -0.04027343854600441, 0.14453998494453144, 0.059043631003489784, 0.05409488959210741, 0.10592115133997379, -0.12650286729437346, -0.09438985021467096, 0.3832040837809552, -0.029318011439440222, -0.2355378961809197, 0.12107376794391958, -0.16084699782400128, -0.11505278400111481, 0.15220271163606458, 0.1295677911614265, 0.1498668641259853, -0.13445386126485354, 0.12321178795112106, -0.07459823036036134, 0.153474662500522, 0.07441751967204639, 0.054066347393350006, 0.13031743720588512, 0.15200377191437314, 0.20654198547390146, 0.19757113907907675, -0.052266584879236064, -0.11164539327070008, -0.30255325228981944, -0.1727744621075146, -0.2809365787203458, 0.03174318356059634, -0.16857082801703177, -0.1699761916835704, 0.3702099994096878, 0.12882709706433282, 0.20048528093926227, 0.13764370077486782, 0.28453444260220134, 0.18407465687225977, 0.01781983951779667, 0.15753791231770803, 0.2353894087778282, 0.060614362702344673, 0.03350458673480218, -0.2435601454697223, 0.08814723055850524, 0.08707453777510536] |
1,802.01546 | First-principles theory of giant Rashba-like spin-splitting in bulk
ferroelectrics | Recently large Rashba-like spin splitting has been observed in certain bulk
ferroelectrics. In contrast with the relativistic Rashba effect, the chiral
spin texture and large spin-splitting of the electronic bands depend strongly
on the character of the band and atomic spin-orbit coupling. We establish that
this can be traced back to the so-called orbital Rashba effect, also in the
bulk. This leads to an additional dependence on the orbital composition of the
bands, which is crucial for a complete picture of the effect. Results from
first-principles calculations on ferroelectic GeTe verify the key predictions
of the model.
| cond-mat.mtrl-sci | recently large rashbalike spin splitting has been observed in certain bulk ferroelectrics in contrast with the relativistic rashba effect the chiral spin texture and large spinsplitting of the electronic bands depend strongly on the character of the band and atomic spinorbit coupling we establish that this can be traced back to the socalled orbital rashba effect also in the bulk this leads to an additional dependence on the orbital composition of the bands which is crucial for a complete picture of the effect results from firstprinciples calculations on ferroelectic gete verify the key predictions of the model | [['recently', 'large', 'rashbalike', 'spin', 'splitting', 'has', 'been', 'observed', 'in', 'certain', 'bulk', 'ferroelectrics', 'in', 'contrast', 'with', 'the', 'relativistic', 'rashba', 'effect', 'the', 'chiral', 'spin', 'texture', 'and', 'large', 'spinsplitting', 'of', 'the', 'electronic', 'bands', 'depend', 'strongly', 'on', 'the', 'character', 'of', 'the', 'band', 'and', 'atomic', 'spinorbit', 'coupling', 'we', 'establish', 'that', 'this', 'can', 'be', 'traced', 'back', 'to', 'the', 'socalled', 'orbital', 'rashba', 'effect', 'also', 'in', 'the', 'bulk', 'this', 'leads', 'to', 'an', 'additional', 'dependence', 'on', 'the', 'orbital', 'composition', 'of', 'the', 'bands', 'which', 'is', 'crucial', 'for', 'a', 'complete', 'picture', 'of', 'the', 'effect', 'results', 'from', 'firstprinciples', 'calculations', 'on', 'ferroelectic', 'gete', 'verify', 'the', 'key', 'predictions', 'of', 'the', 'model']] | [-0.1658906740011628, 0.14965958501942594, -0.07228702783930241, 0.028246243031858707, -0.08514346871717074, -0.08312141501162316, 0.046524647955744305, 0.3646571898122424, -0.27019663999029964, -0.30260129175004885, -0.01836424727429703, -0.26172465790716026, -0.14618293746115313, 0.17107118809230856, 0.018115893606403748, -0.009792329873121584, 0.0019115422439483023, -0.06255998629500571, -0.13449823944985426, -0.19697817243736468, 0.3256779205265273, 0.043460733228430304, 0.303480439670576, 0.14853458598462538, 0.029478438798645416, 0.01294127684662637, 0.08182657357382099, 0.010391967102270765, -0.12515665440300788, 0.09201380124642063, 0.18136538803270183, -0.12691050951042665, 0.1869128259215696, -0.4524805484550823, -0.183257665897998, -0.0012658524672625605, 0.10047994250642885, 0.19823522416793155, -0.0415073021389448, -0.2944281299588914, 0.0354575392473297, -0.18413745501491519, -0.1121981720207259, -0.10223767153928344, -0.0019222103520152496, -0.03462669113170855, -0.22843929226138177, 0.07086955298178772, 0.08492644427862671, 0.07180984349152944, -0.10920867578308914, -0.14303136056711532, -0.12368261693621573, 0.08457343846789955, 0.09590617219375004, 0.047353154069926476, 0.10223919470415249, -0.09464933368924659, -0.11229774794186052, 0.42304064734771696, -0.10317046605962683, -0.1442404736659115, 0.16813229883723346, -0.20654548787195043, -0.11152635496013712, 0.1414171095226997, 0.1399759990283163, 0.08813808901600309, -0.10736350493596208, 0.12199370784459386, -0.05142146264852178, 0.15546255641180023, -0.01722891008500586, 0.12146708375015824, 0.28120008761965737, 0.16213458991782337, 0.02839008582511091, 0.10066758747783865, -0.16174854029728503, -0.057303505140769574, -0.20992667957679512, -0.14762288190846898, -0.2565073933423564, 0.07203181394251044, -0.07598125551960469, -0.16689385495811088, 0.43462554900186884, 0.1484938104560157, 0.18528471523703835, -0.06927906273571371, 0.23716855956452718, 0.13136681886005802, 0.13046686412747374, 0.008032959967505993, 0.32056367327219126, 0.18181680318102547, 0.05703413590414392, -0.3591862886438396, 0.10430026668383136, 0.008990218241209375] |
1,802.01547 | Dunkl-Schr\"odinger operators | In this paper, we consider the Schr\"odinger operators $L_k=-\Delta_k+V$,
where $\Delta_k$ is the Dunkl-Laplace operator and $V$ is a non-negative
potential on $R^d$. We establish that $L_k $ is essentially self-adjoint on
$C_0^\infty$. In particular, we develop a bounded $H^\infty$-calculus on $L^p$
spaces for the Dunkl harmonic oscillator operator.
| math.FA | in this paper we consider the schrodinger operators l_kdelta_kv where delta_k is the dunkllaplace operator and v is a nonnegative potential on rd we establish that l_k is essentially selfadjoint on c_0infty in particular we develop a bounded hinftycalculus on lp spaces for the dunkl harmonic oscillator operator | [['in', 'this', 'paper', 'we', 'consider', 'the', 'schrodinger', 'operators', 'l_kdelta_kv', 'where', 'delta_k', 'is', 'the', 'dunkllaplace', 'operator', 'and', 'v', 'is', 'a', 'nonnegative', 'potential', 'on', 'rd', 'we', 'establish', 'that', 'l_k', 'is', 'essentially', 'selfadjoint', 'on', 'c_0infty', 'in', 'particular', 'we', 'develop', 'a', 'bounded', 'hinftycalculus', 'on', 'lp', 'spaces', 'for', 'the', 'dunkl', 'harmonic', 'oscillator', 'operator']] | [-0.13275645833219524, 0.10970140372038535, -0.003083931079701237, 0.05798681896767053, -0.09618365841047109, -0.1480103676693271, -0.045086691052268216, 0.40794330568093323, -0.28138531461034133, -0.03348877062292203, 0.14657276802514072, -0.36309566713221697, -0.17972066080825322, 0.1586339261342326, -0.11817669518210966, 0.06424345857585254, 0.03922869795528443, 0.12121951640786036, -0.07708087431408626, -0.1716779018600431, 0.4743333058026822, -0.07684176528583402, 0.10758746053983012, 0.07998247647091099, 0.0991616627484884, 0.00023900625376921633, 0.016093052417525778, -0.08979825477075318, -0.17913705983743927, 0.14458431136976604, 0.22958698791816182, 0.05014715533015197, 0.3316630122616239, -0.3765575708821416, -0.15592035353588668, 0.2502846892558686, 0.14469327465833529, -0.041897851953525904, -0.03522975080514974, -0.286459780379158, 0.038553121727486345, -0.08726440106882997, -0.12186946090229828, -0.06366955281397246, 0.08229790761580934, 0.009940338465283909, -0.3954118393847476, 0.07438562335648938, 0.1405350228002214, 0.04340660052232282, -0.1458950626825833, -0.1291673074516913, 0.03116968958436147, -0.019613322143888345, -0.09423452438331088, 0.08887655007571954, 0.04006668511251717, 0.024564064993604046, -0.0846228356493394, 0.3501812627174608, -0.14065328098418514, -0.3245089310828758, 0.06589022808222343, -0.23501382431055864, -0.12356522098264616, -0.07345935054953494, 0.18530217980277602, 0.1626106041443089, -0.12456338763560938, 0.30237576120366016, -0.08267373456012296, 0.10762315032922704, 0.04768640521670813, 0.03755619513559277, 0.010135730242599611, 0.1103330805806605, 0.23150531386794604, 0.14760763602047836, 0.049109360167716186, -0.05829072705566195, -0.4037802710157374, -0.16055670977853562, -0.232078961096704, 0.09328645984034824, -0.07263483383418212, -0.1768352676830862, 0.4300834702418955, 0.09824656435976857, 0.19290891874824528, 0.12117625220233331, 0.1923197361883586, 0.2677617467453946, 0.0221656933426857, 0.06305472729930087, 0.16253162070137003, 0.17823812029445948, 0.13654534550606395, -0.1982198034149959, -0.07834635545378146, 0.22344995939024753] |
1,802.01548 | Regularized Evolution for Image Classifier Architecture Search | The effort devoted to hand-crafting neural network image classifiers has
motivated the use of architecture search to discover them automatically.
Although evolutionary algorithms have been repeatedly applied to neural network
topologies, the image classifiers thus discovered have remained inferior to
human-crafted ones. Here, we evolve an image classifier---AmoebaNet-A---that
surpasses hand-designs for the first time. To do this, we modify the tournament
selection evolutionary algorithm by introducing an age property to favor the
younger genotypes. Matching size, AmoebaNet-A has comparable accuracy to
current state-of-the-art ImageNet models discovered with more complex
architecture-search methods. Scaled to larger size, AmoebaNet-A sets a new
state-of-the-art 83.9% / 96.6% top-5 ImageNet accuracy. In a controlled
comparison against a well known reinforcement learning algorithm, we give
evidence that evolution can obtain results faster with the same hardware,
especially at the earlier stages of the search. This is relevant when fewer
compute resources are available. Evolution is, thus, a simple method to
effectively discover high-quality architectures.
| cs.NE cs.AI cs.CV cs.DC | the effort devoted to handcrafting neural network image classifiers has motivated the use of architecture search to discover them automatically although evolutionary algorithms have been repeatedly applied to neural network topologies the image classifiers thus discovered have remained inferior to humancrafted ones here we evolve an image classifieramoebanetathat surpasses handdesigns for the first time to do this we modify the tournament selection evolutionary algorithm by introducing an age property to favor the younger genotypes matching size amoebaneta has comparable accuracy to current stateoftheart imagenet models discovered with more complex architecturesearch methods scaled to larger size amoebaneta sets a new stateoftheart 839 966 top5 imagenet accuracy in a controlled comparison against a well known reinforcement learning algorithm we give evidence that evolution can obtain results faster with the same hardware especially at the earlier stages of the search this is relevant when fewer compute resources are available evolution is thus a simple method to effectively discover highquality architectures | [['the', 'effort', 'devoted', 'to', 'handcrafting', 'neural', 'network', 'image', 'classifiers', 'has', 'motivated', 'the', 'use', 'of', 'architecture', 'search', 'to', 'discover', 'them', 'automatically', 'although', 'evolutionary', 'algorithms', 'have', 'been', 'repeatedly', 'applied', 'to', 'neural', 'network', 'topologies', 'the', 'image', 'classifiers', 'thus', 'discovered', 'have', 'remained', 'inferior', 'to', 'humancrafted', 'ones', 'here', 'we', 'evolve', 'an', 'image', 'classifieramoebanetathat', 'surpasses', 'handdesigns', 'for', 'the', 'first', 'time', 'to', 'do', 'this', 'we', 'modify', 'the', 'tournament', 'selection', 'evolutionary', 'algorithm', 'by', 'introducing', 'an', 'age', 'property', 'to', 'favor', 'the', 'younger', 'genotypes', 'matching', 'size', 'amoebaneta', 'has', 'comparable', 'accuracy', 'to', 'current', 'stateoftheart', 'imagenet', 'models', 'discovered', 'with', 'more', 'complex', 'architecturesearch', 'methods', 'scaled', 'to', 'larger', 'size', 'amoebaneta', 'sets', 'a', 'new', 'stateoftheart', '839', '966', 'top5', 'imagenet', 'accuracy', 'in', 'a', 'controlled', 'comparison', 'against', 'a', 'well', 'known', 'reinforcement', 'learning', 'algorithm', 'we', 'give', 'evidence', 'that', 'evolution', 'can', 'obtain', 'results', 'faster', 'with', 'the', 'same', 'hardware', 'especially', 'at', 'the', 'earlier', 'stages', 'of', 'the', 'search', 'this', 'is', 'relevant', 'when', 'fewer', 'compute', 'resources', 'are', 'available', 'evolution', 'is', 'thus', 'a', 'simple', 'method', 'to', 'effectively', 'discover', 'highquality', 'architectures']] | [-0.04452511659857057, 0.015413378143421141, -0.09171433414571527, 0.09404732660684538, -0.12772504906445792, -0.19328813526264735, 0.049531753297503055, 0.4715560152636547, -0.239677077784252, -0.38532324168083604, 0.07151757651177161, -0.24279963315807676, -0.13650255881887124, 0.19773346738733572, -0.10454483796830143, 0.07098385133461929, 0.14470700097215167, 0.043630056371560054, -0.07266235932260506, -0.3637315717060119, 0.2410014287727934, 0.08236459896924268, 0.2981206982635501, -0.04221179663421169, 0.07470640324295107, -0.09780820969018877, -0.033643036085107415, -0.004174308350469035, -0.10521303084978602, 0.13344234883123518, 0.2791521939640533, 0.18973210661849743, 0.32522701831093354, -0.394560036960205, -0.19495964418226658, 0.1372628708850243, 0.18523121498966297, 0.1549309982219711, -0.03742814704511195, -0.3066191874386277, 0.1216922338820663, -0.16279401850452382, -0.042764121176572335, -0.13416754388814106, 0.0052284904538139115, -0.023668288244057055, -0.2508284401402833, 0.014003196837285558, 0.04010796976523891, 0.04393783312652407, -0.04603340176369162, -0.17204738109017184, 0.012758556614004957, 0.14405315516973802, 0.010392014867025673, 0.09673748064424696, 0.13115665875681626, -0.17497796540173063, -0.1792402368316145, 0.32022087650961784, -0.050838124221435896, -0.15039948570713596, 0.24767333129727231, -0.032477167964986474, -0.16317913234295128, 0.14242813114297428, 0.2146172910977743, 0.12763122674445376, -0.15989481409489695, 0.0003768059893780829, -0.022398345898469223, 0.20868147303056167, 0.04929849044052198, -0.015386120557147814, 0.15068403047227644, 0.2903590011410415, 0.04654608971874328, 0.14240250952609226, -0.09541295718085357, -0.06593566681074567, -0.1413181622629054, -0.07707683833256708, -0.16299445068120563, 0.01195305232019899, -0.08671659409485169, -0.14364397503653126, 0.3731679026417336, 0.24338377572252953, 0.20495536844981344, 0.13599743074002235, 0.3228191856331633, 0.030246820113940264, 0.17952662624271684, 0.12597103689576647, 0.22585787088504922, 0.02331127304933034, 0.10813788719487523, -0.18502368267141528, 0.1296691316621084, 0.05391276564363292] |
1,802.01549 | Blind Pre-Processing: A Robust Defense Method Against Adversarial
Examples | Deep learning algorithms and networks are vulnerable to perturbed inputs
which is known as the adversarial attack. Many defense methodologies have been
investigated to defend against such adversarial attack. In this work, we
propose a novel methodology to defend the existing powerful attack model. We
for the first time introduce a new attacking scheme for the attacker and set a
practical constraint for white box attack. Under this proposed attacking
scheme, we present the best defense ever reported against some of the recent
strong attacks. It consists of a set of nonlinear function to process the input
data which will make it more robust over the adversarial attack. However, we
make this processing layer completely hidden from the attacker. Blind
pre-processing improves the white box attack accuracy of MNIST from 94.3\% to
98.7\%. Even with increasing defense when others defenses completely fail,
blind pre-processing remains one of the strongest ever reported. Another
strength of our defense is that it eliminates the need for adversarial training
as it can significantly increase the MNIST accuracy without adversarial
training as well. Additionally, blind pre-processing can also increase the
inference accuracy in the face of a powerful attack on CIFAR-10 and SVHN data
set as well without much sacrificing clean data accuracy.
| cs.LG cs.AI stat.ML | deep learning algorithms and networks are vulnerable to perturbed inputs which is known as the adversarial attack many defense methodologies have been investigated to defend against such adversarial attack in this work we propose a novel methodology to defend the existing powerful attack model we for the first time introduce a new attacking scheme for the attacker and set a practical constraint for white box attack under this proposed attacking scheme we present the best defense ever reported against some of the recent strong attacks it consists of a set of nonlinear function to process the input data which will make it more robust over the adversarial attack however we make this processing layer completely hidden from the attacker blind preprocessing improves the white box attack accuracy of mnist from 943 to 987 even with increasing defense when others defenses completely fail blind preprocessing remains one of the strongest ever reported another strength of our defense is that it eliminates the need for adversarial training as it can significantly increase the mnist accuracy without adversarial training as well additionally blind preprocessing can also increase the inference accuracy in the face of a powerful attack on cifar10 and svhn data set as well without much sacrificing clean data accuracy | [['deep', 'learning', 'algorithms', 'and', 'networks', 'are', 'vulnerable', 'to', 'perturbed', 'inputs', 'which', 'is', 'known', 'as', 'the', 'adversarial', 'attack', 'many', 'defense', 'methodologies', 'have', 'been', 'investigated', 'to', 'defend', 'against', 'such', 'adversarial', 'attack', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'methodology', 'to', 'defend', 'the', 'existing', 'powerful', 'attack', 'model', 'we', 'for', 'the', 'first', 'time', 'introduce', 'a', 'new', 'attacking', 'scheme', 'for', 'the', 'attacker', 'and', 'set', 'a', 'practical', 'constraint', 'for', 'white', 'box', 'attack', 'under', 'this', 'proposed', 'attacking', 'scheme', 'we', 'present', 'the', 'best', 'defense', 'ever', 'reported', 'against', 'some', 'of', 'the', 'recent', 'strong', 'attacks', 'it', 'consists', 'of', 'a', 'set', 'of', 'nonlinear', 'function', 'to', 'process', 'the', 'input', 'data', 'which', 'will', 'make', 'it', 'more', 'robust', 'over', 'the', 'adversarial', 'attack', 'however', 'we', 'make', 'this', 'processing', 'layer', 'completely', 'hidden', 'from', 'the', 'attacker', 'blind', 'preprocessing', 'improves', 'the', 'white', 'box', 'attack', 'accuracy', 'of', 'mnist', 'from', '943', 'to', '987', 'even', 'with', 'increasing', 'defense', 'when', 'others', 'defenses', 'completely', 'fail', 'blind', 'preprocessing', 'remains', 'one', 'of', 'the', 'strongest', 'ever', 'reported', 'another', 'strength', 'of', 'our', 'defense', 'is', 'that', 'it', 'eliminates', 'the', 'need', 'for', 'adversarial', 'training', 'as', 'it', 'can', 'significantly', 'increase', 'the', 'mnist', 'accuracy', 'without', 'adversarial', 'training', 'as', 'well', 'additionally', 'blind', 'preprocessing', 'can', 'also', 'increase', 'the', 'inference', 'accuracy', 'in', 'the', 'face', 'of', 'a', 'powerful', 'attack', 'on', 'cifar10', 'and', 'svhn', 'data', 'set', 'as', 'well', 'without', 'much', 'sacrificing', 'clean', 'data', 'accuracy']] | [-0.07543666763040864, -0.02253130639795787, -0.03257898408516597, 0.0970381499856785, -0.10950726812454657, -0.2761511391704866, 0.11338665503045867, 0.3826900799467694, -0.2312548509955657, -0.3650369978724764, 0.11994006688585684, -0.29238544513757986, -0.1944208517782569, 0.2050689944757883, -0.17534473516458932, 0.14858770501674512, 0.05661941848050516, 0.02145986050947193, -0.0034846029190633157, -0.3631683118073852, 0.316649034218594, 0.07517475416632526, 0.3076899242921802, 0.01552356894955245, 0.07915153941352261, -0.029750265863325555, 0.001957973403617731, -0.015453152883520279, -0.018783000721144232, 0.06408901590755424, 0.302752213930944, 0.2327507677221617, 0.34486053135389316, -0.3997616895761054, -0.2322234550016359, 0.12854969599832727, 0.12956984500544003, 0.21198364815343387, -0.07908261889826043, -0.3663356361368922, 0.1370315771872321, -0.21864071825537115, -0.025293632960081316, -0.15347627532453492, -0.011903710002885558, -0.029840336819828596, -0.2702762931674862, -0.004993266870559847, 0.11384310714940792, 0.05956420719919082, -0.009069333737268327, -0.1003842424224086, 0.012749623485993093, 0.13828392462794278, 0.05067774348110386, 0.047379864167081766, 0.158733004426512, -0.15148071060628773, -0.12619978146260388, 0.32487473586773447, -0.04506784006102512, -0.1744336029380345, 0.18033472970833267, 0.026833628468851272, -0.15282425650422318, 0.11656152792812254, 0.22914973195964614, 0.12545337479409333, -0.1218199683149718, -0.0019176714018752906, -0.019355168944457546, 0.2068805713094592, 0.06388536005397327, 0.006639963558812339, 0.10301946962135844, 0.25348342216826636, 0.1095792433342677, 0.16860401483091453, -0.17155787854146462, -0.04172904842282431, -0.22846112150895911, -0.07942799560260028, -0.18975733001067197, 0.026663518424566764, -0.06333859058975996, -0.13911323372919399, 0.37008279411226724, 0.27406307170167565, 0.19777939782048073, 0.10499589893012083, 0.44198711811958885, -0.01360539616234746, 0.11358117743601234, 0.12232827874294554, 0.25959894960354946, -0.012421436378365168, 0.07983092466635683, -0.13792654941789806, 0.17743805594475887, -0.019160919977226652] |
1,802.0155 | Prime \'etale groupoid algebras with applications to inverse semigroup
and Leavitt path algebras | In this paper we give some sufficient and some necessary conditions for an
\'etale groupoid algebra to be a prime ring. As an application we recover the
known primeness results for inverse semigroup algebras and Leavitt path
algebras. It turns out that primeness of the algebra is connected with the
dynamical property of topological transitivity of the groupoid. We obtain
analogous results for semiprimeness.
| math.RA math.OA | in this paper we give some sufficient and some necessary conditions for an etale groupoid algebra to be a prime ring as an application we recover the known primeness results for inverse semigroup algebras and leavitt path algebras it turns out that primeness of the algebra is connected with the dynamical property of topological transitivity of the groupoid we obtain analogous results for semiprimeness | [['in', 'this', 'paper', 'we', 'give', 'some', 'sufficient', 'and', 'some', 'necessary', 'conditions', 'for', 'an', 'etale', 'groupoid', 'algebra', 'to', 'be', 'a', 'prime', 'ring', 'as', 'an', 'application', 'we', 'recover', 'the', 'known', 'primeness', 'results', 'for', 'inverse', 'semigroup', 'algebras', 'and', 'leavitt', 'path', 'algebras', 'it', 'turns', 'out', 'that', 'primeness', 'of', 'the', 'algebra', 'is', 'connected', 'with', 'the', 'dynamical', 'property', 'of', 'topological', 'transitivity', 'of', 'the', 'groupoid', 'we', 'obtain', 'analogous', 'results', 'for', 'semiprimeness']] | [-0.17114072185358964, 0.03972583276163277, -0.12533203087514266, 0.11238097579916939, -0.1638033886665653, -0.12893897619687777, -0.040553191627623164, 0.39295755812781863, -0.40580326615599915, -0.1736437183299131, 0.1706493728688656, -0.21407939429627731, -0.18164213295676745, 0.23240412259474397, -0.18872003763681278, -0.027099139897472924, 0.07090825280192803, 0.13316663287696429, -0.09145639530106564, -0.2371405798185151, 0.4167909086027066, 0.032547558999795, 0.1781110663578147, 0.07756086892186431, 0.09131767447979655, 0.014776367250306066, 0.0014847498714516405, 0.022334652749123052, -0.22686857739302013, 0.030889689587638713, 0.323133180703735, 0.07166433538077399, 0.18766700466221664, -0.38352166244294494, -0.06232933658611728, 0.20143279597868968, 0.13222024862625403, 0.005731252254918218, -0.058213146156049334, -0.25699775860994123, 0.14128678352426505, -0.2269465150020551, -0.18205426157510374, -0.1223667803810713, 0.09786874068231555, -0.019020841544261202, -0.2784778412315063, -0.02395599779265467, 0.15474707349994787, 0.13668423394847196, -0.10747305380937178, -0.04308991118159611, -0.0388896856456995, 0.11114241070390563, -0.07275511352418107, -0.002053761767456308, 0.10947153608867666, -0.05306148869203753, -0.1629050798019307, 0.35979650390072493, 0.024169273290681303, -0.1865130700316513, 0.13670444674426108, -0.14673764340113848, -0.21562565577914938, 0.08633582235779613, -0.01475948843290098, 0.11563913230202161, -0.08559817017521709, 0.13266896686218388, -0.17427233862690628, 0.01378230395494029, 0.03643842742894776, 0.06781590457103448, 0.10054615687079149, 0.12739419980789535, 0.1392643432850491, 0.17811922595865326, 0.06723481570224976, 0.0227767219330417, -0.3775573366874596, -0.22440927768184338, -0.08136711176484823, 0.16610111259797122, -0.11399391965051109, -0.15715029428247362, 0.3866211306594778, 0.20919842341390904, 0.15401911818480585, 0.1465059780603042, 0.19448859652038664, 0.11560879652915901, 0.09241230375482701, 0.04813500842283247, 0.1279670044359591, 0.3209061085653957, 0.004774247412569821, -0.12802495421055937, -0.05243539393268293, 0.2024173585959943] |
1,802.01551 | From charge- and spin-ordering to superconductivity in the organic
charge-transfer solids | We review recent progress in understanding the different spatial broken
symmetries that occur in the normal states of the family of charge-transfer
solids (CTS) that exhibit superconductivity (SC), and discuss how this
knowledge gives insight to the mechanism of the unconventional SC in these
systems. We show that a unified theory of the diverse broken symmetry states
necessarily requires explicit incorporation of strong electron-electron
interactions and lattice discreteness, and most importantly, the correct
bandfilling of one-quarter. Uniquely in the quarter-filled band, there is a
very strong tendency to form nearest neighbor spin-singlets, in both one and
two dimensions. The tendency to spin-singlets, a quantum effect, drives a
commensurate charge-order in the correlated quarter-filled band. This
charge-ordered spin-singlet, which we label as a paired-electron crystal (PEC),
is different from and competes with both the antiferromagnetic state and the
Wigner crystal of single electrons. Further, unlike these classical broken
symmetries, the PEC is characterized by a spin gap. The tendency to the PEC in
two dimensions is enhanced by lattice frustration. Following this
characterization of the spatial broken symmetries, we critically reexamine
spin-fluctuation and resonating valence bond theories of frustration-driven SC
within half-filled band Hubbard and Hubbard-Heisenberg Hamiltonians for the
superconducting CTS. We develop a valence-bond theory of SC within which the
superconducting state is reached by the destabilization of the PEC by
additional pressure-induced lattice frustration that makes the spin-singlets
mobile. Our proposed mechanism for SC is the same for CTS in which the
proximate semiconducting state is antiferromagnetic instead of charge-ordered,
with the only difference that SC in the former is generated via a fluctuating
spin-singlet state as opposed to static PEC.
| cond-mat.supr-con cond-mat.str-el | we review recent progress in understanding the different spatial broken symmetries that occur in the normal states of the family of chargetransfer solids cts that exhibit superconductivity sc and discuss how this knowledge gives insight to the mechanism of the unconventional sc in these systems we show that a unified theory of the diverse broken symmetry states necessarily requires explicit incorporation of strong electronelectron interactions and lattice discreteness and most importantly the correct bandfilling of onequarter uniquely in the quarterfilled band there is a very strong tendency to form nearest neighbor spinsinglets in both one and two dimensions the tendency to spinsinglets a quantum effect drives a commensurate chargeorder in the correlated quarterfilled band this chargeordered spinsinglet which we label as a pairedelectron crystal pec is different from and competes with both the antiferromagnetic state and the wigner crystal of single electrons further unlike these classical broken symmetries the pec is characterized by a spin gap the tendency to the pec in two dimensions is enhanced by lattice frustration following this characterization of the spatial broken symmetries we critically reexamine spinfluctuation and resonating valence bond theories of frustrationdriven sc within halffilled band hubbard and hubbardheisenberg hamiltonians for the superconducting cts we develop a valencebond theory of sc within which the superconducting state is reached by the destabilization of the pec by additional pressureinduced lattice frustration that makes the spinsinglets mobile our proposed mechanism for sc is the same for cts in which the proximate semiconducting state is antiferromagnetic instead of chargeordered with the only difference that sc in the former is generated via a fluctuating spinsinglet state as opposed to static pec | [['we', 'review', 'recent', 'progress', 'in', 'understanding', 'the', 'different', 'spatial', 'broken', 'symmetries', 'that', 'occur', 'in', 'the', 'normal', 'states', 'of', 'the', 'family', 'of', 'chargetransfer', 'solids', 'cts', 'that', 'exhibit', 'superconductivity', 'sc', 'and', 'discuss', 'how', 'this', 'knowledge', 'gives', 'insight', 'to', 'the', 'mechanism', 'of', 'the', 'unconventional', 'sc', 'in', 'these', 'systems', 'we', 'show', 'that', 'a', 'unified', 'theory', 'of', 'the', 'diverse', 'broken', 'symmetry', 'states', 'necessarily', 'requires', 'explicit', 'incorporation', 'of', 'strong', 'electronelectron', 'interactions', 'and', 'lattice', 'discreteness', 'and', 'most', 'importantly', 'the', 'correct', 'bandfilling', 'of', 'onequarter', 'uniquely', 'in', 'the', 'quarterfilled', 'band', 'there', 'is', 'a', 'very', 'strong', 'tendency', 'to', 'form', 'nearest', 'neighbor', 'spinsinglets', 'in', 'both', 'one', 'and', 'two', 'dimensions', 'the', 'tendency', 'to', 'spinsinglets', 'a', 'quantum', 'effect', 'drives', 'a', 'commensurate', 'chargeorder', 'in', 'the', 'correlated', 'quarterfilled', 'band', 'this', 'chargeordered', 'spinsinglet', 'which', 'we', 'label', 'as', 'a', 'pairedelectron', 'crystal', 'pec', 'is', 'different', 'from', 'and', 'competes', 'with', 'both', 'the', 'antiferromagnetic', 'state', 'and', 'the', 'wigner', 'crystal', 'of', 'single', 'electrons', 'further', 'unlike', 'these', 'classical', 'broken', 'symmetries', 'the', 'pec', 'is', 'characterized', 'by', 'a', 'spin', 'gap', 'the', 'tendency', 'to', 'the', 'pec', 'in', 'two', 'dimensions', 'is', 'enhanced', 'by', 'lattice', 'frustration', 'following', 'this', 'characterization', 'of', 'the', 'spatial', 'broken', 'symmetries', 'we', 'critically', 'reexamine', 'spinfluctuation', 'and', 'resonating', 'valence', 'bond', 'theories', 'of', 'frustrationdriven', 'sc', 'within', 'halffilled', 'band', 'hubbard', 'and', 'hubbardheisenberg', 'hamiltonians', 'for', 'the', 'superconducting', 'cts', 'we', 'develop', 'a', 'valencebond', 'theory', 'of', 'sc', 'within', 'which', 'the', 'superconducting', 'state', 'is', 'reached', 'by', 'the', 'destabilization', 'of', 'the', 'pec', 'by', 'additional', 'pressureinduced', 'lattice', 'frustration', 'that', 'makes', 'the', 'spinsinglets', 'mobile', 'our', 'proposed', 'mechanism', 'for', 'sc', 'is', 'the', 'same', 'for', 'cts', 'in', 'which', 'the', 'proximate', 'semiconducting', 'state', 'is', 'antiferromagnetic', 'instead', 'of', 'chargeordered', 'with', 'the', 'only', 'difference', 'that', 'sc', 'in', 'the', 'former', 'is', 'generated', 'via', 'a', 'fluctuating', 'spinsinglet', 'state', 'as', 'opposed', 'to', 'static', 'pec']] | [-0.18328403148060554, 0.2176650270125452, -0.028936568107704206, 0.06960762041853741, -0.0527203764885438, -0.16716602121253826, 0.09456354497781243, 0.3819353417664602, -0.24297633620282047, -0.2583079019985983, 0.001593794788384591, -0.29761411778300123, -0.129740045804818, 0.0743911631657016, 0.04351896481239237, -0.020539939835811417, -0.042550856301899975, -0.02729757919031031, -0.14219747333331992, -0.20651075212620473, 0.32834335651611635, -0.0030787884602699813, 0.34482862975667505, 0.08002033991386484, 0.018928146500804682, 0.02595941948846517, 0.13589746279574363, 0.012229700607456514, -0.11252422841514143, 0.08985574515271069, 0.2681680479487541, -0.04873763773203416, 0.20561092497904182, -0.4471395355580813, -0.2262451278823873, 0.018960266213980503, 0.13510197710060953, 0.1699127424529733, -0.05532043130904854, -0.2970836674486397, 0.05515296054492116, -0.18365378159968018, -0.12141524540707263, -0.08621788571069962, -0.03680493023849147, -0.04029673962127965, -0.2391613771649324, 0.0941941126691424, 0.12383463096065338, 0.06200866552984842, -0.08903246969395481, -0.11092916770961464, -0.09525397873178865, 0.06548515168491148, 0.034151816560873106, 0.06598676966249888, 0.055776768278733735, -0.13020796673920224, -0.1432144069660674, 0.4006494459366984, -0.013059956408088672, -0.10748795126811969, 0.18983110141433665, -0.12511098778272486, -0.10057152431716745, 0.16968363006975884, 0.07125048883651341, 0.04565083359963918, -0.1098119331530624, 0.07133123341619092, -0.036055708279223726, 0.18562650185092078, -0.013059409634853877, 0.09053948908352621, 0.2295877683431814, 0.18277973831658634, 0.056201714887078306, 0.15848577583058024, -0.09424577189587152, -0.1471047082279042, -0.26402376562541846, -0.1676663527622997, -0.2354514118153876, 0.029804669550846003, -0.05330746226236977, -0.18579923383453312, 0.4049395191721166, 0.13855834692089153, 0.16264423314714804, -0.0704301165015375, 0.19261433990793783, 0.07115993504339713, 0.06690354227013064, 0.035825410482870856, 0.2401467322727994, 0.11906676365641247, 0.06371662695635356, -0.2979044917429907, 0.05120427302255634, 0.05363482833661906] |
1,802.01552 | Atomic structure of intrinsic and electron-irradiation-induced defects
in MoTe2 | Studying the atomic structure of intrinsic defects in two-dimensional
transition metal dichalcogenides is difficult since they damage quickly under
the intense electron irradiation in transmission electron microscopy (TEM).
However, this can also lead to insights into the creation of defects and their
atom-scale dynamics. We first show that MoTe 2 monolayers without protection
indeed quickly degrade during scanning TEM (STEM) imaging, and discuss the
observed atomic-level dynamics, including a transformation from the 1H phase
into 1T', three-fold rotationally symmetric defects, and the migration of line
defects between two 1H grains with a 60{\deg} misorientation. We then analyze
the atomic structure of MoTe2 encapsulated between two graphene sheets to
mitigate damage, finding the as-prepared material to contain an unexpectedly
large concentration of defects. These include similar point defects (or quantum
dots, QDs) as those created in the non-encapsulated material, and two different
types of line defects (or quantum wires, QWs) that can be transformed from one
to the other under electron irradiation. Our density functional theory
simulations indicate that the QDs and QWs embedded in MoTe2 introduce new
midgap states into the semiconducting material, and may thus be used to control
its electronic and optical properties. Finally, the edge of the encapsulated
material appears amorphous, possibly due to the pressure caused by the
encapsulation.
| cond-mat.mtrl-sci | studying the atomic structure of intrinsic defects in twodimensional transition metal dichalcogenides is difficult since they damage quickly under the intense electron irradiation in transmission electron microscopy tem however this can also lead to insights into the creation of defects and their atomscale dynamics we first show that mote 2 monolayers without protection indeed quickly degrade during scanning tem stem imaging and discuss the observed atomiclevel dynamics including a transformation from the 1h phase into 1t threefold rotationally symmetric defects and the migration of line defects between two 1h grains with a 60deg misorientation we then analyze the atomic structure of mote2 encapsulated between two graphene sheets to mitigate damage finding the asprepared material to contain an unexpectedly large concentration of defects these include similar point defects or quantum dots qds as those created in the nonencapsulated material and two different types of line defects or quantum wires qws that can be transformed from one to the other under electron irradiation our density functional theory simulations indicate that the qds and qws embedded in mote2 introduce new midgap states into the semiconducting material and may thus be used to control its electronic and optical properties finally the edge of the encapsulated material appears amorphous possibly due to the pressure caused by the encapsulation | [['studying', 'the', 'atomic', 'structure', 'of', 'intrinsic', 'defects', 'in', 'twodimensional', 'transition', 'metal', 'dichalcogenides', 'is', 'difficult', 'since', 'they', 'damage', 'quickly', 'under', 'the', 'intense', 'electron', 'irradiation', 'in', 'transmission', 'electron', 'microscopy', 'tem', 'however', 'this', 'can', 'also', 'lead', 'to', 'insights', 'into', 'the', 'creation', 'of', 'defects', 'and', 'their', 'atomscale', 'dynamics', 'we', 'first', 'show', 'that', 'mote', '2', 'monolayers', 'without', 'protection', 'indeed', 'quickly', 'degrade', 'during', 'scanning', 'tem', 'stem', 'imaging', 'and', 'discuss', 'the', 'observed', 'atomiclevel', 'dynamics', 'including', 'a', 'transformation', 'from', 'the', '1h', 'phase', 'into', '1t', 'threefold', 'rotationally', 'symmetric', 'defects', 'and', 'the', 'migration', 'of', 'line', 'defects', 'between', 'two', '1h', 'grains', 'with', 'a', '60deg', 'misorientation', 'we', 'then', 'analyze', 'the', 'atomic', 'structure', 'of', 'mote2', 'encapsulated', 'between', 'two', 'graphene', 'sheets', 'to', 'mitigate', 'damage', 'finding', 'the', 'asprepared', 'material', 'to', 'contain', 'an', 'unexpectedly', 'large', 'concentration', 'of', 'defects', 'these', 'include', 'similar', 'point', 'defects', 'or', 'quantum', 'dots', 'qds', 'as', 'those', 'created', 'in', 'the', 'nonencapsulated', 'material', 'and', 'two', 'different', 'types', 'of', 'line', 'defects', 'or', 'quantum', 'wires', 'qws', 'that', 'can', 'be', 'transformed', 'from', 'one', 'to', 'the', 'other', 'under', 'electron', 'irradiation', 'our', 'density', 'functional', 'theory', 'simulations', 'indicate', 'that', 'the', 'qds', 'and', 'qws', 'embedded', 'in', 'mote2', 'introduce', 'new', 'midgap', 'states', 'into', 'the', 'semiconducting', 'material', 'and', 'may', 'thus', 'be', 'used', 'to', 'control', 'its', 'electronic', 'and', 'optical', 'properties', 'finally', 'the', 'edge', 'of', 'the', 'encapsulated', 'material', 'appears', 'amorphous', 'possibly', 'due', 'to', 'the', 'pressure', 'caused', 'by', 'the', 'encapsulation']] | [-0.09668299477512428, 0.17880959450787845, -0.05380442050316244, 0.012164886818953873, 0.04018772754243229, -0.18726493864858024, 0.0569923054943399, 0.44401209407044406, -0.3044572252552834, -0.29694024090843163, 0.035057819316966, -0.3245197582635766, -0.1584587071742425, 0.15213911717608922, 1.4561298412616264e-05, 0.025477280587497923, -0.010167681498391807, -0.12480424990781316, -0.08615132912440322, -0.1957459172672273, 0.2891804339482226, 0.04737776392530278, 0.3295726527431499, 0.08777100043704716, -0.0005843825944362672, -0.004570194845800528, 0.08233651762364756, 0.039707225828022726, -0.14543647934655204, 0.09327073546619474, 0.24104750751924348, -0.036851275965851235, 0.20724240095275914, -0.5625225368607352, -0.22899515749755459, 0.006289281105150429, 0.1540653254583198, 0.1512064423997987, -0.11261115599524213, -0.2923323896810841, 0.07351623999803139, -0.09527869400690733, -0.09813342911864635, -0.05302638294889336, -0.02972936121738153, 0.0018598322396958028, -0.18913262263497888, 0.054624035677835296, 0.040525420284677, 0.034646779977871724, -0.11281499870508437, -0.07188240973772962, -0.11210122435712233, 0.09423023811158912, 0.03605657548014022, -0.01106628949946326, 0.25418600668483565, -0.10635848118958584, -0.10063669766067689, 0.40054088622821327, 0.003995900050826598, -0.08816040189228427, 0.20065004489124433, -0.16894082639485536, -0.08047743338737375, 0.19433144345975747, 0.13207800579454068, 0.08697891500865944, -0.1278947262665117, 0.024427289314001815, 0.03438739056814847, 0.1849444036596365, 0.10521727735001786, 0.10298933419551998, 0.2598926921554365, 0.14240847283563285, 0.02578545345797995, 0.14688054358224853, -0.13494762574174474, -0.026726564260182176, -0.174752390936909, -0.2243496752152779, -0.18143646824370388, 0.12648989560799628, -0.07066498570229712, -0.21368661657754034, 0.38294462671289176, 0.10796028333267922, 0.1773047968876404, -0.09860859572627262, 0.2342806082730457, 0.06068710182266564, 0.10304917188791969, -0.017792566778890333, 0.22308421463535075, 0.13776234767679563, 0.0682882435211011, -0.24755741625001104, 0.08580261260924747, -0.02876258294093707] |
1,802.01553 | Automatic microtubule tracking in fluorescence images of cells doped
with increasing concentrations of taxol and nocodazole | The purpose of this paper is to provide an algorithm for detecting and
tracking astral MTs in a fully automated way and supply a description of their
dynamic behaviour. For the algorithm testing, a dataset of stacks (i.e.
time-lapse image sequences), acquired with a confocal microscope, has been
employed. Cells were treated with two different drugs, nocodazole and taxol, in
order to explore their effect on microtubule dynamic instability.
| q-bio.BM physics.bio-ph | the purpose of this paper is to provide an algorithm for detecting and tracking astral mts in a fully automated way and supply a description of their dynamic behaviour for the algorithm testing a dataset of stacks ie timelapse image sequences acquired with a confocal microscope has been employed cells were treated with two different drugs nocodazole and taxol in order to explore their effect on microtubule dynamic instability | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'provide', 'an', 'algorithm', 'for', 'detecting', 'and', 'tracking', 'astral', 'mts', 'in', 'a', 'fully', 'automated', 'way', 'and', 'supply', 'a', 'description', 'of', 'their', 'dynamic', 'behaviour', 'for', 'the', 'algorithm', 'testing', 'a', 'dataset', 'of', 'stacks', 'ie', 'timelapse', 'image', 'sequences', 'acquired', 'with', 'a', 'confocal', 'microscope', 'has', 'been', 'employed', 'cells', 'were', 'treated', 'with', 'two', 'different', 'drugs', 'nocodazole', 'and', 'taxol', 'in', 'order', 'to', 'explore', 'their', 'effect', 'on', 'microtubule', 'dynamic', 'instability']] | [-0.1257694644634338, 0.061600232176929504, -0.11365019482122186, 0.03534650518764358, -0.04109658799065715, -0.14096367088666953, 0.0141918379419675, 0.44043456483632326, -0.23752681037876755, -0.33789779815603704, 0.10447715284124784, -0.24689535770277657, -0.17002477836521232, 0.19067238843725884, -0.09265312807025004, 0.06977257592713132, 0.0504244112115189, 0.01023161726334365, 0.046308436862412185, -0.2222327468368937, 0.2349028124282246, 0.03650691008250065, 0.30132333512472753, -0.008896383686292478, 0.15134830125059714, 0.013026448658338803, -0.04609614603824037, 0.05797199207111536, -0.1340150518260677, 0.15630800812847584, 0.2746522285263328, 0.1267372678780435, 0.28498379897449494, -0.46819953524562363, -0.18229173019062728, 0.08931635698194013, 0.1563365362201105, 0.12894358627005098, -0.07736870140583693, -0.2737777453011778, 0.10142208608415197, -0.1375780049506027, -0.08175088110831841, -0.09627122888752424, -0.016376925468006554, 0.02772075728075031, -0.26968777689891044, 0.02797254703610259, 0.03366579001372242, 0.14926504543708527, -0.10247018052648534, -0.021014627562287974, 0.042214999968350375, 0.21428574317627969, 0.02071081361774465, 0.02044612938291667, 0.15029303722686188, -0.11719416192157522, -0.1369989357121727, 0.35877333948498263, -0.003981872018330786, -0.18902874809539164, 0.21269854399896063, -0.08288944894379444, -0.09490890765343518, 0.14062189750428147, 0.2110783156719716, 0.14998840917285314, -0.2343304569915156, -0.014463356561678024, 0.0005473046262255486, 0.16854683937409015, 0.08975966619875501, -0.026187470537158388, 0.19175385125495, 0.26015800771796527, 0.008269674781545559, 0.15832129499690115, -0.15745571973007721, -0.020721745759467867, -0.18574758939896985, -0.16968653102487544, -0.1008393463664962, -0.013296048869104946, -0.0028887866948720973, -0.19045353994485648, 0.3914850364877459, 0.12818812322802842, 0.19143458954332507, 0.07060134242398336, 0.3453551239662749, -0.013188112390172832, 0.09082739663426764, -0.0343515052638181, 0.16664342878057675, 0.06414937051629428, 0.11676305826232933, -0.2305371714687413, 0.09811397893217337, 0.07802730185144088] |
1,802.01554 | Can One Escape Red Chains? Regular Path Queries Determinacy is
Undecidable | For a given set of queries (which are expressions in some query language)
$\mathcal{Q}=\{Q_1$, $Q_2, \ldots Q_k\}$ and for another query $Q_0$ we say
that $\mathcal{Q}$ determines $Q_0$ if -- informally speaking -- for every
database $\mathbb D$, the information contained in the views
$\mathcal{Q}({\mathbb D})$ is sufficient to compute $Q_0({\mathbb D})$. Query
Determinacy Problem is the problem of deciding, for given $\mathcal{Q}$ and
$Q_0$, whether $\mathcal{Q}$ determines $Q_0$. Many versions of this problem,
for different query languages, were studied in database theory. In this paper
we solve a problem stated in [CGLV02] and show that Query Determinacy Problem
is undecidable for the Regular Path Queries -- the paradigmatic query language
of graph databases.
| cs.DB | for a given set of queries which are expressions in some query language mathcalqq_1 q_2 ldots q_k and for another query q_0 we say that mathcalq determines q_0 if informally speaking for every database mathbb d the information contained in the views mathcalqmathbb d is sufficient to compute q_0mathbb d query determinacy problem is the problem of deciding for given mathcalq and q_0 whether mathcalq determines q_0 many versions of this problem for different query languages were studied in database theory in this paper we solve a problem stated in cglv02 and show that query determinacy problem is undecidable for the regular path queries the paradigmatic query language of graph databases | [['for', 'a', 'given', 'set', 'of', 'queries', 'which', 'are', 'expressions', 'in', 'some', 'query', 'language', 'mathcalqq_1', 'q_2', 'ldots', 'q_k', 'and', 'for', 'another', 'query', 'q_0', 'we', 'say', 'that', 'mathcalq', 'determines', 'q_0', 'if', 'informally', 'speaking', 'for', 'every', 'database', 'mathbb', 'd', 'the', 'information', 'contained', 'in', 'the', 'views', 'mathcalqmathbb', 'd', 'is', 'sufficient', 'to', 'compute', 'q_0mathbb', 'd', 'query', 'determinacy', 'problem', 'is', 'the', 'problem', 'of', 'deciding', 'for', 'given', 'mathcalq', 'and', 'q_0', 'whether', 'mathcalq', 'determines', 'q_0', 'many', 'versions', 'of', 'this', 'problem', 'for', 'different', 'query', 'languages', 'were', 'studied', 'in', 'database', 'theory', 'in', 'this', 'paper', 'we', 'solve', 'a', 'problem', 'stated', 'in', 'cglv02', 'and', 'show', 'that', 'query', 'determinacy', 'problem', 'is', 'undecidable', 'for', 'the', 'regular', 'path', 'queries', 'the', 'paradigmatic', 'query', 'language', 'of', 'graph', 'databases']] | [-0.17584124112208546, 0.04590708070598474, -0.011461566206654188, 0.1156966600586505, -0.0934918125125545, -0.18829281668661646, 0.04749347655861466, 0.3650369657445009, -0.3752694508681695, -0.26961040889269766, 0.031119524676964997, -0.32305201377581666, -0.06678668827387607, 0.17797513809744958, -0.14970240871318513, 0.03991952303934981, 0.06961066794529971, 0.13873800596532723, -0.01825518133436735, -0.2851617974113281, 0.3458499226900231, -0.11120596669476342, 0.1612996858354934, 0.05319322761648369, 0.08114844338140553, 0.02686797310511961, 0.0075652719738341315, 0.046959815840064374, -0.2192888364776014, 0.0775936818498411, 0.3730330235902565, 0.32410225384282293, 0.28899721811629003, -0.3199048838521574, -0.06819564073036115, 0.168354399976562, 0.1617374665904747, 0.027559949666115077, 0.051345033691851075, -0.25412103607043346, 0.14243473034972945, -0.10554598211483271, 0.00572837570561441, -0.022504372185923986, 0.17678026580769154, -0.061858590649164935, -0.3433335961373005, -0.014643546961316908, 0.12345153479664414, 0.0678652666716112, -0.050235010644731425, -0.08552457700931916, 0.042054659464931185, 0.10279472012512593, -0.037831385559574875, 0.1377991455234156, 0.05060910428302897, -0.09544959224984739, -0.20165160825342388, 0.44523472128504954, 0.042256153277035254, -0.24379777935919938, 0.04375088347673968, -0.12080895600310113, -0.20824816409084532, 0.048600388820179634, 0.10853597106136105, 0.15225990561561453, -0.11617037313300427, 0.21006162078130594, -0.16152539006779315, 0.20607061939382995, 0.15521829761241357, 0.028946981015097763, 0.1491419598177917, 0.14374230200148844, 0.05636111479759199, 0.1541205291265484, 0.0656098789466476, -0.02386159818895437, -0.30555006656450806, -0.13371024744291962, -0.20628249091613624, 0.005972588568477443, -0.17411775681736158, -0.19651933211005396, 0.3148635408185698, 0.19879268340904405, 0.16090034689599028, 0.13347734683473525, 0.235030269957389, 0.0806252462063168, -0.03414351426450863, 0.16022114066624824, 0.02083121634792338, 0.03806048355073909, 0.06523142655862978, -0.1511794041618015, 0.13017689931870405, 0.11862216434976156] |
1,802.01555 | Large deviations of avalanches in the raise and peel model | We study the large deviation functions for two quantities characterizing the
avalanche dynamics in the Raise and Peel model: the number of tiles removed by
avalanches and the number of global avalanches extending through the whole
system. To this end, we exploit their connection to the groundstate eigenvalue
of the XXZ model with twisted boundary conditions. We evaluate the cumulants of
the two quantities asymptotically in the limit of the large system size. The
first cumulants, the means, confirm the exact formulas conjectured from
analysis of finite systems. We discuss the phase transition from critical to
non-critical behaviour in the rate function of the global avalanches
conditioned to an atypical values of the number of tiles removed by avalanches
per unit time.
| math-ph math.MP | we study the large deviation functions for two quantities characterizing the avalanche dynamics in the raise and peel model the number of tiles removed by avalanches and the number of global avalanches extending through the whole system to this end we exploit their connection to the groundstate eigenvalue of the xxz model with twisted boundary conditions we evaluate the cumulants of the two quantities asymptotically in the limit of the large system size the first cumulants the means confirm the exact formulas conjectured from analysis of finite systems we discuss the phase transition from critical to noncritical behaviour in the rate function of the global avalanches conditioned to an atypical values of the number of tiles removed by avalanches per unit time | [['we', 'study', 'the', 'large', 'deviation', 'functions', 'for', 'two', 'quantities', 'characterizing', 'the', 'avalanche', 'dynamics', 'in', 'the', 'raise', 'and', 'peel', 'model', 'the', 'number', 'of', 'tiles', 'removed', 'by', 'avalanches', 'and', 'the', 'number', 'of', 'global', 'avalanches', 'extending', 'through', 'the', 'whole', 'system', 'to', 'this', 'end', 'we', 'exploit', 'their', 'connection', 'to', 'the', 'groundstate', 'eigenvalue', 'of', 'the', 'xxz', 'model', 'with', 'twisted', 'boundary', 'conditions', 'we', 'evaluate', 'the', 'cumulants', 'of', 'the', 'two', 'quantities', 'asymptotically', 'in', 'the', 'limit', 'of', 'the', 'large', 'system', 'size', 'the', 'first', 'cumulants', 'the', 'means', 'confirm', 'the', 'exact', 'formulas', 'conjectured', 'from', 'analysis', 'of', 'finite', 'systems', 'we', 'discuss', 'the', 'phase', 'transition', 'from', 'critical', 'to', 'noncritical', 'behaviour', 'in', 'the', 'rate', 'function', 'of', 'the', 'global', 'avalanches', 'conditioned', 'to', 'an', 'atypical', 'values', 'of', 'the', 'number', 'of', 'tiles', 'removed', 'by', 'avalanches', 'per', 'unit', 'time']] | [-0.16131362024256693, 0.1639973489219584, -0.06225328143021916, 0.0628894598282431, 0.026471990597678623, -0.05334401778021797, 0.07247049114132514, 0.2861896039551643, -0.2606844582564396, -0.28656868780123407, 0.10842495188823154, -0.3023281820713863, -0.13857575173520284, 0.1551614456054312, -0.012782465956020207, 0.11009885480956148, -0.003324550698648711, 0.03591186435297742, -0.06937589071935317, -0.22735739096266325, 0.31642856883060677, 0.05303710459857477, 0.2862450893525584, 0.03299020046032355, 0.08141112948584629, -0.0003128050078378349, -0.007058016242092994, 0.022319857134163134, -0.18486472052048708, 0.07152766436262087, 0.17049261854701966, 0.07116242538618504, 0.2186963947138703, -0.4516809419957829, -0.1634082223181842, 0.15572779392632732, 0.1384411732719631, 0.10147587090852808, 0.023859631911408705, -0.25908774483498553, 0.0790691492298034, -0.16057814152331137, -0.19425827122033865, -0.035035628252891735, 0.004418336897019724, 0.08944302570975585, -0.23019547284138006, 0.07985423968677394, 0.06425719134906521, 0.06111368149534234, -0.06149326696167471, -0.08156443055009195, -0.0338517436566839, 0.18644149392675302, 0.07943419116304913, -0.03625719038365012, 0.1279941198461857, -0.17272415198332042, -0.0920045748772863, 0.3067908749427097, -0.0396148455710929, -0.18218917985920047, 0.1510900610859399, -0.235658894777756, -0.1357247488817475, 0.14272643872689394, 0.15868919993155314, 0.09127402597213866, -0.13624744918712675, 0.05094927471402086, -0.02885444555336182, 0.1749310010956356, 0.04236644137742334, -0.004748646587850984, 0.20512840841881563, 0.15603431198196333, 0.050347999360442895, 0.23168654328395352, -0.07558743639555225, -0.1221431077030472, -0.34095150295675536, -0.15362351154431425, -0.21841631330488648, 0.03635005796896904, -0.1352764563546726, -0.17563962802046634, 0.4216579276778292, 0.19156258916635005, 0.25349803936866216, 0.09315284511616423, 0.2104657609206548, 0.14543979789023517, 0.06968473697073574, 0.06549265473836759, 0.1886686127495448, 0.1369310583762794, 0.09579678041646715, -0.24323161896394535, 0.048909827078249854, 0.12569298482973312] |
1,802.01556 | Game-Theoretic Capital Asset Pricing in Continuous Time | We derive formulas for the performance of capital assets in continuous time
from an efficient market hypothesis, with no stochastic assumptions and no
assumptions about the beliefs or preferences of investors. Our efficient market
hypothesis says that a speculator with limited means cannot beat a particular
index by a substantial factor. Our results include a formula that resembles the
classical CAPM formula for the expected simple return of a security or
portfolio.
This version of the article was essentially written in December 2001 but
remains a working paper.
| q-fin.PR | we derive formulas for the performance of capital assets in continuous time from an efficient market hypothesis with no stochastic assumptions and no assumptions about the beliefs or preferences of investors our efficient market hypothesis says that a speculator with limited means cannot beat a particular index by a substantial factor our results include a formula that resembles the classical capm formula for the expected simple return of a security or portfolio this version of the article was essentially written in december 2001 but remains a working paper | [['we', 'derive', 'formulas', 'for', 'the', 'performance', 'of', 'capital', 'assets', 'in', 'continuous', 'time', 'from', 'an', 'efficient', 'market', 'hypothesis', 'with', 'no', 'stochastic', 'assumptions', 'and', 'no', 'assumptions', 'about', 'the', 'beliefs', 'or', 'preferences', 'of', 'investors', 'our', 'efficient', 'market', 'hypothesis', 'says', 'that', 'a', 'speculator', 'with', 'limited', 'means', 'can', 'not', 'beat', 'a', 'particular', 'index', 'by', 'a', 'substantial', 'factor', 'our', 'results', 'include', 'a', 'formula', 'that', 'resembles', 'the', 'classical', 'capm', 'formula', 'for', 'the', 'expected', 'simple', 'return', 'of', 'a', 'security', 'or', 'portfolio', 'this', 'version', 'of', 'the', 'article', 'was', 'essentially', 'written', 'in', 'december', '2001', 'but', 'remains', 'a', 'working', 'paper']] | [-0.09324636777733411, 0.03635330941528736, -0.15148029674964256, 0.1287417343982464, -0.09943089354260082, -0.1301763894407895, 0.13479033111610314, 0.36896495588040085, -0.22709463481654626, -0.2869530039515053, 0.16062872359670405, -0.2333062134050042, -0.15709286133413403, 0.22564196670061668, -0.17624925628871516, -0.013858062325024538, 0.08134843818738721, 0.015288735279457623, -0.0038202837203744422, -0.279745177522804, 0.2675365407969489, 0.07242096172059688, 0.275445382477025, 0.03872216166405196, 0.12427114372486982, 0.023292786797529524, -0.05171777613544732, 0.0012313724296648852, -0.12583643344072024, 0.14288550641471415, 0.24447402677739435, 0.15092253030455682, 0.36582224949503717, -0.4306560047075487, -0.14660704134848346, 0.13472670865548628, 0.03027860807703567, 0.05721185361610705, -0.01580968453140741, -0.23002040835118362, 0.033079544521784514, -0.23645093952818366, -0.1545637716497347, -0.03590685566262672, 0.02668459927453921, -0.016519292154718253, -0.3208975695711927, 0.0653022893212652, 0.13630822563736525, 0.06696341209521706, -0.04953019688523301, -0.10955468154501881, 0.012667617211222983, 0.09079427643563975, 0.10891050818177421, -0.023705567897747408, 0.11481758066337933, -0.12037860560021625, -0.20722357258514573, 0.36843508725797525, -0.08948917916630593, -0.17007085641197275, 0.12124611105602444, -0.12301029303644816, -0.13369249658700957, 0.12167497499835457, 0.1169212480341189, 0.061905547620707685, -0.18709483540752966, 0.07926215216703189, -0.12136178617522622, 0.24153954615251402, 0.08888900064434228, -0.016942817286138286, 0.16768612162984406, 0.12386362327084866, 0.09054289328384349, 0.10603882484608905, 0.005530228503466992, -0.15164681300102326, -0.28547091015583176, -0.17367566393340383, -0.17772267837066916, 0.09625922796447903, -0.11591777421146228, -0.17243679105356502, 0.3597963489906004, 0.13279660944861238, 0.10276347400327579, 0.13521719633064003, 0.2948414200309957, 0.15603619680237654, 0.00726313821008701, 0.13531657967590885, 0.20243528198576374, 0.023352170219184475, 0.1227705446568977, -0.0958617815428696, 0.19789421477805028, 0.01259173389021935] |
1,802.01557 | One-Shot Imitation from Observing Humans via Domain-Adaptive
Meta-Learning | Humans and animals are capable of learning a new behavior by observing others
perform the skill just once. We consider the problem of allowing a robot to do
the same -- learning from a raw video pixels of a human, even when there is
substantial domain shift in the perspective, environment, and embodiment
between the robot and the observed human. Prior approaches to this problem have
hand-specified how human and robot actions correspond and often relied on
explicit human pose detection systems. In this work, we present an approach for
one-shot learning from a video of a human by using human and robot
demonstration data from a variety of previous tasks to build up prior knowledge
through meta-learning. Then, combining this prior knowledge and only a single
video demonstration from a human, the robot can perform the task that the human
demonstrated. We show experiments on both a PR2 arm and a Sawyer arm,
demonstrating that after meta-learning, the robot can learn to place, push, and
pick-and-place new objects using just one video of a human performing the
manipulation.
| cs.LG cs.AI cs.CV cs.RO | humans and animals are capable of learning a new behavior by observing others perform the skill just once we consider the problem of allowing a robot to do the same learning from a raw video pixels of a human even when there is substantial domain shift in the perspective environment and embodiment between the robot and the observed human prior approaches to this problem have handspecified how human and robot actions correspond and often relied on explicit human pose detection systems in this work we present an approach for oneshot learning from a video of a human by using human and robot demonstration data from a variety of previous tasks to build up prior knowledge through metalearning then combining this prior knowledge and only a single video demonstration from a human the robot can perform the task that the human demonstrated we show experiments on both a pr2 arm and a sawyer arm demonstrating that after metalearning the robot can learn to place push and pickandplace new objects using just one video of a human performing the manipulation | [['humans', 'and', 'animals', 'are', 'capable', 'of', 'learning', 'a', 'new', 'behavior', 'by', 'observing', 'others', 'perform', 'the', 'skill', 'just', 'once', 'we', 'consider', 'the', 'problem', 'of', 'allowing', 'a', 'robot', 'to', 'do', 'the', 'same', 'learning', 'from', 'a', 'raw', 'video', 'pixels', 'of', 'a', 'human', 'even', 'when', 'there', 'is', 'substantial', 'domain', 'shift', 'in', 'the', 'perspective', 'environment', 'and', 'embodiment', 'between', 'the', 'robot', 'and', 'the', 'observed', 'human', 'prior', 'approaches', 'to', 'this', 'problem', 'have', 'handspecified', 'how', 'human', 'and', 'robot', 'actions', 'correspond', 'and', 'often', 'relied', 'on', 'explicit', 'human', 'pose', 'detection', 'systems', 'in', 'this', 'work', 'we', 'present', 'an', 'approach', 'for', 'oneshot', 'learning', 'from', 'a', 'video', 'of', 'a', 'human', 'by', 'using', 'human', 'and', 'robot', 'demonstration', 'data', 'from', 'a', 'variety', 'of', 'previous', 'tasks', 'to', 'build', 'up', 'prior', 'knowledge', 'through', 'metalearning', 'then', 'combining', 'this', 'prior', 'knowledge', 'and', 'only', 'a', 'single', 'video', 'demonstration', 'from', 'a', 'human', 'the', 'robot', 'can', 'perform', 'the', 'task', 'that', 'the', 'human', 'demonstrated', 'we', 'show', 'experiments', 'on', 'both', 'a', 'pr2', 'arm', 'and', 'a', 'sawyer', 'arm', 'demonstrating', 'that', 'after', 'metalearning', 'the', 'robot', 'can', 'learn', 'to', 'place', 'push', 'and', 'pickandplace', 'new', 'objects', 'using', 'just', 'one', 'video', 'of', 'a', 'human', 'performing', 'the', 'manipulation']] | [-0.028647421547448485, 0.03929337335950735, -0.10937450307100421, -0.0031817296814531256, -0.15762972519706703, -0.16157563792615287, 0.07743930397686775, 0.45614000914965647, -0.23011415659602585, -0.3865407346511039, 0.0611232378195161, -0.24344581460822268, -0.22816568177908997, 0.21793620263707777, -0.17342731867795863, 0.08048316304661375, 0.15793774445609604, 0.10412074298739939, -0.013885445974367317, -0.22480851713183866, 0.27766678994258415, -0.016624685839912987, 0.24532758199878163, -0.00187849862722017, 0.19205281680705036, 0.009989720956017236, -0.016530785420225503, -0.03467560387716371, -0.0623787172697912, 0.17894806982923067, 0.3220647882090061, 0.21151558821757802, 0.35835334871195806, -0.4531123634890816, -0.21982776413843994, 0.07743255977945054, 0.1253631310221755, 0.1265488508194264, -0.04063744241395428, -0.41076198784308243, 0.06574613531383207, -0.16960063337816694, -0.0012487411698968397, -0.09974587554148909, -0.01185555652962566, -0.05938973749651032, -0.2716281996799191, -0.005389373658730065, 0.07753079675011716, 0.1254260655003205, -0.0580186503768325, -0.04014046862458358, 0.059212102339008435, 0.2745630844322883, 0.037539608635160926, 0.059137106294307, 0.2102483325364268, -0.21373259472544962, -0.18895261276166064, 0.38538978765797566, -0.002337063728479174, -0.19788025232758058, 0.22046826270245815, -0.08216593497416984, -0.10639890818198942, 0.08617113013804421, 0.2146465763828512, 0.15149554688914937, -0.17237980380605994, 0.004431947047288114, -0.06131233374382985, 0.20804970580058457, 0.05720946229178732, -0.07584895038356383, 0.2000872615651138, 0.22845177760079377, 0.0598093760975947, 0.11142014909803993, -0.08256825759985857, -0.0722958620079914, -0.21971982121888528, -0.11883162366263147, -0.18436870853927007, -0.0037624355231932662, -0.062143772308327294, -0.0766939322690586, 0.36107748211756097, 0.2109442724146496, 0.23965350617549389, 0.11405972318327855, 0.36734454054911597, -0.00837959700637618, 0.09025543879080922, 0.04947144898689894, 0.19963274862733013, -0.06958207625390614, 0.1607098761909131, -0.19871908035602862, 0.09114248476433173, -0.0028340722300049105] |
1,802.01558 | Random walk on the randomly-oriented Manhattan lattice | In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is
assigned a uniform random direction. We consider the directed graph whose
vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but
only in the direction fixed by the line orientations. Random walk on this
directed graph chooses uniformly from the $d$ legal neighbours at each step. We
prove that this walk is superdiffusive in two and three dimensions. The model
is diffusive in four and more dimensions.
| math.PR math-ph math.MP | in the randomlyoriented manhattan lattice every line in mathbbzd is assigned a uniform random direction we consider the directed graph whose vertex set is mathbbzd and whose edges connect nearest neighbours but only in the direction fixed by the line orientations random walk on this directed graph chooses uniformly from the d legal neighbours at each step we prove that this walk is superdiffusive in two and three dimensions the model is diffusive in four and more dimensions | [['in', 'the', 'randomlyoriented', 'manhattan', 'lattice', 'every', 'line', 'in', 'mathbbzd', 'is', 'assigned', 'a', 'uniform', 'random', 'direction', 'we', 'consider', 'the', 'directed', 'graph', 'whose', 'vertex', 'set', 'is', 'mathbbzd', 'and', 'whose', 'edges', 'connect', 'nearest', 'neighbours', 'but', 'only', 'in', 'the', 'direction', 'fixed', 'by', 'the', 'line', 'orientations', 'random', 'walk', 'on', 'this', 'directed', 'graph', 'chooses', 'uniformly', 'from', 'the', 'd', 'legal', 'neighbours', 'at', 'each', 'step', 'we', 'prove', 'that', 'this', 'walk', 'is', 'superdiffusive', 'in', 'two', 'and', 'three', 'dimensions', 'the', 'model', 'is', 'diffusive', 'in', 'four', 'and', 'more', 'dimensions']] | [-0.14016478390206033, 0.21739580900145647, 0.004822720337706881, -0.03621828740832802, -0.0685690149742489, -0.22608211585798133, 0.07687419144591938, 0.4846013214152593, -0.27415773826531875, -0.1595633072951713, 0.06764569527988967, -0.3513806405930947, -0.11616133746559708, 0.019887585142173637, -0.019059857353568077, -0.0322972344330106, 0.050036924437452585, 0.12728020305243823, 0.07202636329039262, -0.2871219235635064, 0.2789258336624465, -0.07173908377090135, 0.2363552841811608, 0.0034717415960935447, 0.09709925369287913, 0.0952654976087312, -0.04002873668781458, 0.08333700402186085, -0.13463314212248617, 0.06159980531829672, 0.1637222287364495, 0.011274137537186153, 0.2776332050263404, -0.40311213444660193, -0.18859825148366582, 0.15783277939622983, 0.14877344996262437, 0.09015884545918268, 0.03770602534831806, -0.25316967191891027, 0.10944244825842385, -0.0790787578966373, -0.13266663338081577, 0.10344756281045146, 0.1102679759138622, 0.044957446364256054, -0.2604873953387141, -0.007848749976032056, 0.10740456928331883, 0.06832292151804535, 0.043730962194669515, -0.11816699461390574, -0.055103770161692336, 0.1477183733636943, -0.02816211375652645, 0.12292147519735572, 0.11089399470634256, -0.08012743445280461, -0.20387647795276, 0.42040257757672894, -0.008414812036789954, -0.23352735900343993, 0.1666855316441984, -0.20388453603029633, -0.1948678051420034, 0.08735240161275634, 0.15852400344103956, 0.13463236286472052, -0.16550394817470357, 0.11513034886313388, -0.11476540850857511, 0.0846149648527782, 0.06234430657842985, -0.06540378344913897, 0.1835966470460288, 0.1184136999759059, 0.21255569996980903, 0.16218455377010962, -0.07512312098585355, -0.12346739259858926, -0.28526428731110615, -0.09354583987703499, -0.2976026549959221, 0.06475354302435732, -0.23907888517659068, -0.1672625302647551, 0.43953446668978685, 0.15547203884507793, 0.27575040018806857, 0.10296931517764162, 0.2222526335181334, 0.07039444332883413, -0.0022606816715919054, 0.1811601507405822, 0.10110000521541597, 0.09264151216186105, 0.04230957326049415, -0.11998309006687635, 0.10304486808271553, 0.17502699218069515] |
1,802.01559 | The Size Seems to Matter or Where Lies the "Asymptopia"? | We discuss an apparent correlation between the onset of the rising regime for
the total cross-sections and the slowdown of the rise of the forward slopes
with energy. It is shown that even at highest energies achieved with the LHC
the proper sizes of the colliding protons comprise the bulk of the the
interaction region. This seems to witness that the "asymptopia" - a
hypothetical "truly asymptotic" regime - lies at energies no less than
$\mathcal{O}$(100 TeV). In the course of reasoning we also discuss the question
of the dependence of the effective sizes of hadrons in collision on the type of
their interaction.
| hep-ph hep-ex hep-th | we discuss an apparent correlation between the onset of the rising regime for the total crosssections and the slowdown of the rise of the forward slopes with energy it is shown that even at highest energies achieved with the lhc the proper sizes of the colliding protons comprise the bulk of the the interaction region this seems to witness that the asymptopia a hypothetical truly asymptotic regime lies at energies no less than mathcalo100 tev in the course of reasoning we also discuss the question of the dependence of the effective sizes of hadrons in collision on the type of their interaction | [['we', 'discuss', 'an', 'apparent', 'correlation', 'between', 'the', 'onset', 'of', 'the', 'rising', 'regime', 'for', 'the', 'total', 'crosssections', 'and', 'the', 'slowdown', 'of', 'the', 'rise', 'of', 'the', 'forward', 'slopes', 'with', 'energy', 'it', 'is', 'shown', 'that', 'even', 'at', 'highest', 'energies', 'achieved', 'with', 'the', 'lhc', 'the', 'proper', 'sizes', 'of', 'the', 'colliding', 'protons', 'comprise', 'the', 'bulk', 'of', 'the', 'the', 'interaction', 'region', 'this', 'seems', 'to', 'witness', 'that', 'the', 'asymptopia', 'a', 'hypothetical', 'truly', 'asymptotic', 'regime', 'lies', 'at', 'energies', 'no', 'less', 'than', 'mathcalo100', 'tev', 'in', 'the', 'course', 'of', 'reasoning', 'we', 'also', 'discuss', 'the', 'question', 'of', 'the', 'dependence', 'of', 'the', 'effective', 'sizes', 'of', 'hadrons', 'in', 'collision', 'on', 'the', 'type', 'of', 'their', 'interaction']] | [-0.10863938418504618, 0.1829243789613304, -0.09966506977456019, 0.11724304209700694, -0.0014165236395509804, -0.05511594770531006, 0.02248488050684625, 0.3447632045284206, -0.22375471677229392, -0.32718846687645303, 0.015335460022256216, -0.29650539161600903, -0.015671740448120617, 0.1846048289672563, 0.04233215299780782, -0.011666512262879633, 0.06230739390422754, 0.07559409596975528, -0.08818246177443322, -0.21207765917129376, 0.3292328305770734, 0.11767621806539669, 0.23913644398471304, 0.13423122327395842, 0.0957453320825509, 0.007873805347081347, 0.006163530028881687, -0.00949055559284912, -0.11508326479031215, 0.112804239786997, 0.2053141865854188, 0.04840165296827406, 0.24562547883639732, -0.382140858938881, -0.1499654130211817, 0.1266595594420591, 0.13367412050309427, 0.08493847041116918, -0.017487472857122637, -0.2353006596619939, 0.06940746069064035, -0.17286152971963234, -0.18519355079921546, 0.04091861224550681, 0.06038572985733695, 0.00562364881967797, -0.22553704389343587, 0.09718276626560562, 0.051062465325801394, 0.03795628479422828, -0.07208694455524285, -0.11765916282128469, -0.03269242446906134, 0.07517603472076065, 0.09545501080277723, -0.000770498393560011, 0.1082469281448307, -0.19626101352703557, -0.09497126359800699, 0.369631473769379, 0.004526906292263519, -0.0993431927818878, 0.2449178028230866, -0.20486048051594374, -0.09771650916966382, 0.19199124899893708, 0.16979883621245914, 0.0796636894217455, -0.10903982219158434, 0.06318451497902382, -0.00957261632178344, 0.16689336641837715, 0.0794914101761784, 0.0615909220045889, 0.20641593848225004, 0.19877105417168317, 0.041175769984393436, 0.11176972119046338, -0.13069983662845677, -0.07929612855043482, -0.37262040538275065, -0.13275271907960082, -0.13501854140058106, 0.025257949196897885, -0.10981385701084304, -0.10599706952509187, 0.3784263332228304, 0.14907585404009796, 0.2543514160548939, 0.053757696086084286, 0.22910716267777423, 0.13199652476217963, 0.0761065372544359, 0.10581227682768275, 0.3409442310061708, 0.10526616548133247, 0.13706768441525305, -0.2749034980558516, 0.07670716101111953, 0.005327376586958017] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.