id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.09767
|
Unifying Dark Matter and Dark Energy with non-Canonical Scalars
|
Non-canonical scalar fields with the Lagrangian ${\cal L} = X^\alpha -
V(\phi)$, possess the attractive property that the speed of sound, $c_s^{2} =
(2\,\alpha - 1)^{-1}$, can be exceedingly small for large values of $\alpha$.
This allows a non-canonical field to cluster and behave like warm/cold dark
matter on small scales. We demonstrate that simple potentials including $V =
V_0\coth^2{\phi}$ and a Starobinsky-type potential can unify dark matter and
dark energy. Cascading dark energy, in which the potential cascades to lower
values in a series of discrete steps, can also work as a unified model. In all
of these models the kinetic term $X^\alpha$ plays the role of dark matter,
while the potential term $V(\phi)$ plays the role of dark energy.
|
gr-qc astro-ph.CO hep-ph hep-th
|
noncanonical scalar fields with the lagrangian cal l xalpha vphi possess the attractive property that the speed of sound c_s2 2alpha 11 can be exceedingly small for large values of alpha this allows a noncanonical field to cluster and behave like warmcold dark matter on small scales we demonstrate that simple potentials including v v_0coth2phi and a starobinskytype potential can unify dark matter and dark energy cascading dark energy in which the potential cascades to lower values in a series of discrete steps can also work as a unified model in all of these models the kinetic term xalpha plays the role of dark matter while the potential term vphi plays the role of dark energy
|
[['noncanonical', 'scalar', 'fields', 'with', 'the', 'lagrangian', 'cal', 'l', 'xalpha', 'vphi', 'possess', 'the', 'attractive', 'property', 'that', 'the', 'speed', 'of', 'sound', 'c_s2', '2alpha', '11', 'can', 'be', 'exceedingly', 'small', 'for', 'large', 'values', 'of', 'alpha', 'this', 'allows', 'a', 'noncanonical', 'field', 'to', 'cluster', 'and', 'behave', 'like', 'warmcold', 'dark', 'matter', 'on', 'small', 'scales', 'we', 'demonstrate', 'that', 'simple', 'potentials', 'including', 'v', 'v_0coth2phi', 'and', 'a', 'starobinskytype', 'potential', 'can', 'unify', 'dark', 'matter', 'and', 'dark', 'energy', 'cascading', 'dark', 'energy', 'in', 'which', 'the', 'potential', 'cascades', 'to', 'lower', 'values', 'in', 'a', 'series', 'of', 'discrete', 'steps', 'can', 'also', 'work', 'as', 'a', 'unified', 'model', 'in', 'all', 'of', 'these', 'models', 'the', 'kinetic', 'term', 'xalpha', 'plays', 'the', 'role', 'of', 'dark', 'matter', 'while', 'the', 'potential', 'term', 'vphi', 'plays', 'the', 'role', 'of', 'dark', 'energy']]
|
[-0.1668836590955439, 0.17681292392637418, -0.10938933520456372, 0.13288800983952925, -0.0983482823950117, -0.14119521249490588, -0.05886775271400162, 0.29595213398013426, -0.23798471054710124, -0.3614246382337549, -0.02604147445552213, -0.25564710698912996, -0.09930526390570499, 0.1486526726603346, 0.04700049465198232, 0.01845595642909124, -0.020854585131873254, 0.06140041257376256, -0.004743131744148939, -0.2148392058595124, 0.30388658734483887, 0.07651773402872293, 0.17983904567182712, 0.06484891945374725, 0.11603627123100602, -0.05791500091056704, 0.025981397651459858, -0.01090495393651983, -0.15589382412056338, 0.04156846917517807, 0.16940174413906314, 0.043163485669166494, 0.2734596780501306, -0.42348641386336605, -0.2573106593310671, 0.22122851459552412, 0.17486062478805567, 0.06871153407568192, -0.07388307850544705, -0.25163792507803956, 0.05393384070763283, -0.20070215355118978, -0.14997401138889077, -0.10412939897050029, 0.054428450958600834, 0.04989326907392672, -0.291658250372047, 0.16304596141157873, 0.01517920805161576, -0.0645967302902136, -0.07752777080547632, -0.13688798787315254, -0.05184621353755179, 0.023149295491368873, 0.09793257839552572, 0.03709279647825853, 0.1751456428238231, -0.24283127042302943, -0.016429081528812, 0.42932382088316523, -0.18283661135026943, -0.18117836996427047, 0.14964060394255363, -0.06593529640534973, -0.14760656661313512, 0.10403287760386973, 0.1422343345520937, 0.07269910481434477, -0.08552493698206609, 0.20802967967718597, 0.01797672523104626, 0.15527072661029903, 0.06667862843884075, 0.07725760253227275, 0.2743742036592701, 0.12563205013436307, 0.04812189267705316, 0.058736818246340944, -0.07435139519182722, -0.12293696363011132, -0.3857300546830115, -0.17229015080501203, -0.1302825568092015, 0.034998984707762366, -0.13722612737923476, -0.1623069160455919, 0.38516111855759566, 0.09642657490001748, 0.20083633327613706, 0.044430639741577856, 0.24324778766249833, 0.12266295725459476, 0.050080301349415726, 0.039139875931584314, 0.26276868663566266, 0.11365968650611846, 0.12968643446776854, -0.19902895042753738, -0.07574488941742026, 0.021979173116952827]
|
1,803.09768
|
Dark Matter in Ultra-Diffuse Galaxies in the Virgo Cluster from their
Globular Cluster Populations
|
We present Keck/DEIMOS spectroscopy of globular clusters (GCs) around the
ultra-diffuse galaxies (UDGs) VLSB-B, VLSB-D, and VCC615 located in the central
regions of the Virgo cluster. We spectroscopically identify 4, 12, and 7 GC
satellites of these UDGs, respectively. We find that the three UDGs have
systemic velocities ($V_{sys}$) consistent with being in the Virgo cluster, and
that they span a wide range of velocity dispersions, from $\sim 16$ to $\sim
47$ km/s, and high dynamical mass-to-light ratios within the radius that
contains half the number of GCs ($ 407^{+916}_{-407}$, $21^{+15}_{-11}$,
$60^{+65}_{-38}$, respectively). VLSB-D shows possible evidence for rotation
along the stellar major axis and its $V_{sys}$ is consistent with that of the
massive galaxy M84 and the center of the Virgo cluster itself. These findings,
in addition to having a dynamically and spatially ($\sim 1$ kpc) off-centered
nucleus and being extremely elongated, suggest that VLSB-D could be tidally
perturbed. On the contrary, VLSB-B and VCC615 show no signals of tidal
deformation. Whereas the dynamics of VLSB-D suggest that it has a less massive
dark matter halo than expected for its stellar mass, VLSB-B and VCC615 are
consistent with a $\sim 10^{12}$ M$_{\odot}$ dark matter halo. Although our
samples of galaxies and GCs are small, these results suggest that UDGs may be a
diverse population, with their low surface brightnesses being the result of
very early formation, tidal disruption, or a combination of the two.
|
astro-ph.GA
|
we present keckdeimos spectroscopy of globular clusters gcs around the ultradiffuse galaxies udgs vlsbb vlsbd and vcc615 located in the central regions of the virgo cluster we spectroscopically identify 4 12 and 7 gc satellites of these udgs respectively we find that the three udgs have systemic velocities v_sys consistent with being in the virgo cluster and that they span a wide range of velocity dispersions from sim 16 to sim 47 kms and high dynamical masstolight ratios within the radius that contains half the number of gcs 407916_407 2115_11 6065_38 respectively vlsbd shows possible evidence for rotation along the stellar major axis and its v_sys is consistent with that of the massive galaxy m84 and the center of the virgo cluster itself these findings in addition to having a dynamically and spatially sim 1 kpc offcentered nucleus and being extremely elongated suggest that vlsbd could be tidally perturbed on the contrary vlsbb and vcc615 show no signals of tidal deformation whereas the dynamics of vlsbd suggest that it has a less massive dark matter halo than expected for its stellar mass vlsbb and vcc615 are consistent with a sim 1012 m_odot dark matter halo although our samples of galaxies and gcs are small these results suggest that udgs may be a diverse population with their low surface brightnesses being the result of very early formation tidal disruption or a combination of the two
|
[['we', 'present', 'keckdeimos', 'spectroscopy', 'of', 'globular', 'clusters', 'gcs', 'around', 'the', 'ultradiffuse', 'galaxies', 'udgs', 'vlsbb', 'vlsbd', 'and', 'vcc615', 'located', 'in', 'the', 'central', 'regions', 'of', 'the', 'virgo', 'cluster', 'we', 'spectroscopically', 'identify', '4', '12', 'and', '7', 'gc', 'satellites', 'of', 'these', 'udgs', 'respectively', 'we', 'find', 'that', 'the', 'three', 'udgs', 'have', 'systemic', 'velocities', 'v_sys', 'consistent', 'with', 'being', 'in', 'the', 'virgo', 'cluster', 'and', 'that', 'they', 'span', 'a', 'wide', 'range', 'of', 'velocity', 'dispersions', 'from', 'sim', '16', 'to', 'sim', '47', 'kms', 'and', 'high', 'dynamical', 'masstolight', 'ratios', 'within', 'the', 'radius', 'that', 'contains', 'half', 'the', 'number', 'of', 'gcs', '407916_407', '2115_11', '6065_38', 'respectively', 'vlsbd', 'shows', 'possible', 'evidence', 'for', 'rotation', 'along', 'the', 'stellar', 'major', 'axis', 'and', 'its', 'v_sys', 'is', 'consistent', 'with', 'that', 'of', 'the', 'massive', 'galaxy', 'm84', 'and', 'the', 'center', 'of', 'the', 'virgo', 'cluster', 'itself', 'these', 'findings', 'in', 'addition', 'to', 'having', 'a', 'dynamically', 'and', 'spatially', 'sim', '1', 'kpc', 'offcentered', 'nucleus', 'and', 'being', 'extremely', 'elongated', 'suggest', 'that', 'vlsbd', 'could', 'be', 'tidally', 'perturbed', 'on', 'the', 'contrary', 'vlsbb', 'and', 'vcc615', 'show', 'no', 'signals', 'of', 'tidal', 'deformation', 'whereas', 'the', 'dynamics', 'of', 'vlsbd', 'suggest', 'that', 'it', 'has', 'a', 'less', 'massive', 'dark', 'matter', 'halo', 'than', 'expected', 'for', 'its', 'stellar', 'mass', 'vlsbb', 'and', 'vcc615', 'are', 'consistent', 'with', 'a', 'sim', '1012', 'm_odot', 'dark', 'matter', 'halo', 'although', 'our', 'samples', 'of', 'galaxies', 'and', 'gcs', 'are', 'small', 'these', 'results', 'suggest', 'that', 'udgs', 'may', 'be', 'a', 'diverse', 'population', 'with', 'their', 'low', 'surface', 'brightnesses', 'being', 'the', 'result', 'of', 'very', 'early', 'formation', 'tidal', 'disruption', 'or', 'a', 'combination', 'of', 'the', 'two']]
|
[-0.10510774395852934, 0.13347994596510923, -0.088977667555471, 0.09244145264544673, -0.06457089293885218, -0.020659030301726194, 0.012245003203559039, 0.4220885309628594, -0.1095218010805144, -0.3776870295425546, 0.04185054561286284, -0.3006890285254942, -0.0461341715891527, 0.19623143029766102, -0.022653073625784222, -0.07116098024124416, 0.07479540714606021, -0.03592788500411968, -0.039898677493467746, -0.28115306141054525, 0.27800647078033586, 0.013857430323869699, 0.12252196356869863, -0.05474978410968334, 0.06564772866658254, -0.09605985933116504, -0.030355042094330494, -0.0032254031782987976, -0.13772253290803885, 0.04278153884204435, 0.20586212063046955, 0.11246571178019886, 0.24166230498752617, -0.34122876310217076, -0.1604767811133877, 0.06443946792953749, 0.25199578815035006, 0.052029093178150396, -0.11007790978407302, -0.31012974483731054, 0.13572650960847146, -0.21612559882036986, -0.21050448436491612, 0.08386796881803574, 0.07791676777878623, 0.04114289366256131, -0.15947652588400876, 0.23033798593640714, -0.0008454402769841173, 0.05945914362262918, -0.12710674807683311, -0.1456139394711074, -0.09377464565682302, 0.020737748928730943, 0.025167932785297564, 0.0890857233055837, 0.23526982768656468, -0.11626390942150135, 0.01006028003833414, 0.4136536982216876, -0.027729581993940544, 0.020450093924862665, 0.2666047943243958, -0.22342034658513865, -0.19261390337412088, 0.1060318248346448, 0.1337338425783497, 0.06651394140555875, -0.13685715780492663, -0.006484432040751021, -0.05262912194964222, 0.22221738449146658, 0.05454261145263193, 0.05891545685024547, 0.33703491668865987, 0.09121454558617463, 0.07461269010660677, 0.019075286705691964, -0.23628825657936497, -0.03481037741213497, -0.2049994060849807, -0.0861543620902177, -0.10412483319974791, 0.037814318887824876, -0.18784222791221616, -0.11237889044470602, 0.3006830677375988, 0.09514027914774173, 0.24312582433534166, 0.0886736219972236, 0.24383663495365546, 0.04643249461977658, 0.16794171172407862, 0.15087148841788983, 0.3115479558690157, 0.2011653153917216, 0.0022569751564526196, -0.22102148727981527, 0.02315185991737254, -0.09413861195774531]
|
1,803.09769
|
The imprints of AGN feedback within a supermassive black hole's sphere
of influence
|
We present a new 300 ks Chandra observation of M87 that limits pileup to only
a few per cent of photon events and maps the hot gas properties closer to the
nucleus than has previously been possible. Within the supermassive black hole's
gravitational sphere of influence, the hot gas is multiphase and spans
temperatures from 0.2 to 1 keV. The radiative cooling time of the lowest
temperature gas drops to only 0.1-0.5 Myr, which is comparable to its free fall
time. Whilst the temperature structure is remarkably symmetric about the
nucleus, the density gradient is steep in sectors to the N and S, with
$\rho{\propto}r^{-1.5\pm0.1}$, and significantly shallower along the jet axis
to the E, where $\rho{\propto}r^{-0.93\pm0.07}$. The density structure within
the Bondi radius is therefore consistent with steady inflows perpendicular to
the jet axis and an outflow directed E along the jet axis. By putting limits on
the radial flow speed, we rule out Bondi accretion on the scale resolved at the
Bondi radius. We show that deprojected spectra extracted within the Bondi
radius can be equivalently fit with only a single cooling flow model, where gas
cools from 1.5 keV down below 0.1 keV at a rate of 0.03 M$_{\odot}$/yr. For the
alternative multi-temperature spectral fits, the emission measures for each
temperature component are also consistent with a cooling flow model. The lowest
temperature and most rapidly cooling gas in M87 is therefore located at the
smallest radii at ~100 pc and may form a mini cooling flow. If this cooling gas
has some angular momentum, it will feed into the cold gas disk around the
nucleus, which has a radius of ~80 pc and therefore lies just inside the
observed transition in the hot gas structure.
|
astro-ph.GA astro-ph.HE
|
we present a new 300 ks chandra observation of m87 that limits pileup to only a few per cent of photon events and maps the hot gas properties closer to the nucleus than has previously been possible within the supermassive black holes gravitational sphere of influence the hot gas is multiphase and spans temperatures from 02 to 1 kev the radiative cooling time of the lowest temperature gas drops to only 0105 myr which is comparable to its free fall time whilst the temperature structure is remarkably symmetric about the nucleus the density gradient is steep in sectors to the n and s with rhoproptor15pm01 and significantly shallower along the jet axis to the e where rhoproptor093pm007 the density structure within the bondi radius is therefore consistent with steady inflows perpendicular to the jet axis and an outflow directed e along the jet axis by putting limits on the radial flow speed we rule out bondi accretion on the scale resolved at the bondi radius we show that deprojected spectra extracted within the bondi radius can be equivalently fit with only a single cooling flow model where gas cools from 15 kev down below 01 kev at a rate of 003 m_odotyr for the alternative multitemperature spectral fits the emission measures for each temperature component are also consistent with a cooling flow model the lowest temperature and most rapidly cooling gas in m87 is therefore located at the smallest radii at 100 pc and may form a mini cooling flow if this cooling gas has some angular momentum it will feed into the cold gas disk around the nucleus which has a radius of 80 pc and therefore lies just inside the observed transition in the hot gas structure
|
[['we', 'present', 'a', 'new', '300', 'ks', 'chandra', 'observation', 'of', 'm87', 'that', 'limits', 'pileup', 'to', 'only', 'a', 'few', 'per', 'cent', 'of', 'photon', 'events', 'and', 'maps', 'the', 'hot', 'gas', 'properties', 'closer', 'to', 'the', 'nucleus', 'than', 'has', 'previously', 'been', 'possible', 'within', 'the', 'supermassive', 'black', 'holes', 'gravitational', 'sphere', 'of', 'influence', 'the', 'hot', 'gas', 'is', 'multiphase', 'and', 'spans', 'temperatures', 'from', '02', 'to', '1', 'kev', 'the', 'radiative', 'cooling', 'time', 'of', 'the', 'lowest', 'temperature', 'gas', 'drops', 'to', 'only', '0105', 'myr', 'which', 'is', 'comparable', 'to', 'its', 'free', 'fall', 'time', 'whilst', 'the', 'temperature', 'structure', 'is', 'remarkably', 'symmetric', 'about', 'the', 'nucleus', 'the', 'density', 'gradient', 'is', 'steep', 'in', 'sectors', 'to', 'the', 'n', 'and', 's', 'with', 'rhoproptor15pm01', 'and', 'significantly', 'shallower', 'along', 'the', 'jet', 'axis', 'to', 'the', 'e', 'where', 'rhoproptor093pm007', 'the', 'density', 'structure', 'within', 'the', 'bondi', 'radius', 'is', 'therefore', 'consistent', 'with', 'steady', 'inflows', 'perpendicular', 'to', 'the', 'jet', 'axis', 'and', 'an', 'outflow', 'directed', 'e', 'along', 'the', 'jet', 'axis', 'by', 'putting', 'limits', 'on', 'the', 'radial', 'flow', 'speed', 'we', 'rule', 'out', 'bondi', 'accretion', 'on', 'the', 'scale', 'resolved', 'at', 'the', 'bondi', 'radius', 'we', 'show', 'that', 'deprojected', 'spectra', 'extracted', 'within', 'the', 'bondi', 'radius', 'can', 'be', 'equivalently', 'fit', 'with', 'only', 'a', 'single', 'cooling', 'flow', 'model', 'where', 'gas', 'cools', 'from', '15', 'kev', 'down', 'below', '01', 'kev', 'at', 'a', 'rate', 'of', '003', 'm_odotyr', 'for', 'the', 'alternative', 'multitemperature', 'spectral', 'fits', 'the', 'emission', 'measures', 'for', 'each', 'temperature', 'component', 'are', 'also', 'consistent', 'with', 'a', 'cooling', 'flow', 'model', 'the', 'lowest', 'temperature', 'and', 'most', 'rapidly', 'cooling', 'gas', 'in', 'm87', 'is', 'therefore', 'located', 'at', 'the', 'smallest', 'radii', 'at', '100', 'pc', 'and', 'may', 'form', 'a', 'mini', 'cooling', 'flow', 'if', 'this', 'cooling', 'gas', 'has', 'some', 'angular', 'momentum', 'it', 'will', 'feed', 'into', 'the', 'cold', 'gas', 'disk', 'around', 'the', 'nucleus', 'which', 'has', 'a', 'radius', 'of', '80', 'pc', 'and', 'therefore', 'lies', 'just', 'inside', 'the', 'observed', 'transition', 'in', 'the', 'hot', 'gas', 'structure']]
|
[-0.0533322438821586, 0.1514237882543168, -0.0787844665750913, 0.05952000341869774, -0.051696875061229754, -0.09563956557665967, 0.042051605311569595, 0.4073675835264996, -0.22617243672274898, -0.3140354558682712, 0.08030972435611271, -0.3177885041727915, 0.09923383903702662, 0.18455794705617493, 0.017841283106228876, -0.02526894207165223, -0.007481744657116472, 0.001982415220513615, -0.1015911241232755, -0.1883858289977881, 0.26083851353555776, 0.1309740502348345, 0.17549315934841772, 0.06902345181255701, 0.08551386358274815, -0.09690323733409886, 0.02644754005985445, -0.010640321494135291, -0.15945767343738107, 0.013551017288962307, 0.1706932040672905, 0.060429797102802656, 0.23838361632322264, -0.3709281645305552, -0.22963842025954756, 0.037758424687475124, 0.1989466165653219, 0.02510459005965718, -0.020184101489005863, -0.1977711504985735, 0.05670994559127695, -0.21745068234316875, -0.17687997370893427, 0.05111382871165301, 0.07771565699065591, -0.0235732720113434, -0.21079211599799522, 0.17528514405264267, 0.03619972692327152, 0.016689569806661423, -0.09882167369356049, -0.09320950266200959, -0.07377976220172508, 0.03475896866816885, 0.05548522832608929, 0.10677402418509177, 0.285632421040278, -0.09824985874661014, 0.00723191051912666, 0.400557285852938, -0.07488822667740443, -0.04127640269683732, 0.1977997890889372, -0.25520867686832277, -0.09821510589146136, 0.23850202665725911, 0.15028888469702686, 0.10228428268279452, -0.11298140545699337, 0.0014419376733307225, -0.060149079049776795, 0.23280559071248502, 0.08135243950457108, -0.004242274259583771, 0.3525378112275582, 0.13891740680837725, 0.05024388590211029, 0.0849193408931135, -0.2112586450315233, -0.08180585362926573, -0.2578567823002485, -0.09595082753653499, -0.1272943316251429, 0.08103169893962736, -0.12597895661354364, -0.08232483271191396, 0.32729236807476225, 0.09041684803849845, 0.26514376178124227, 0.036832208063726016, 0.3424161646898272, 0.09577279510211771, 0.11030680408947922, 0.2076934558965707, 0.30358099252302345, 0.18539716945133636, 0.09788959460797028, -0.24372047086823115, 0.020887302874039067, 0.014649684286192838]
|
1,803.0977
|
Gauge-Yukawa theories: Beta functions at large $N_f$
|
We consider the dynamics of gauge-Yukawa theories in the presence of a large
number of matter constituents. We first review the current status for the
renormalization group equations of gauge-fermion theories featuring also
semi-simple groups. In this regime these theories develop an interacting
ultraviolet fixed point that for the semi-simple case leads to a rich phase
diagram. The latter contains a complete asymptotically safe fixed point
repulsive in all couplings. We then add two gauged Weyl fermions belonging to
arbitrary representations of the gauge group and a complex, gauged scalar to
the original gauge-fermion theory allowing for new Yukawa interactions and
quartic scalar self-coupling. Consequently, we determine the leading $1/N_f$
Yukawa and quartic beta functions. Our work elucidates, consolidates and
extends results obtained earlier in the literature. We also acquire relevant
knowledge about the dynamics of gauge-Yukawa theories beyond perturbation
theory. Our findings are applicable to any extension of the standard model
featuring a large number of fermions such as asymptotic safety.
|
hep-ph hep-th
|
we consider the dynamics of gaugeyukawa theories in the presence of a large number of matter constituents we first review the current status for the renormalization group equations of gaugefermion theories featuring also semisimple groups in this regime these theories develop an interacting ultraviolet fixed point that for the semisimple case leads to a rich phase diagram the latter contains a complete asymptotically safe fixed point repulsive in all couplings we then add two gauged weyl fermions belonging to arbitrary representations of the gauge group and a complex gauged scalar to the original gaugefermion theory allowing for new yukawa interactions and quartic scalar selfcoupling consequently we determine the leading 1n_f yukawa and quartic beta functions our work elucidates consolidates and extends results obtained earlier in the literature we also acquire relevant knowledge about the dynamics of gaugeyukawa theories beyond perturbation theory our findings are applicable to any extension of the standard model featuring a large number of fermions such as asymptotic safety
|
[['we', 'consider', 'the', 'dynamics', 'of', 'gaugeyukawa', 'theories', 'in', 'the', 'presence', 'of', 'a', 'large', 'number', 'of', 'matter', 'constituents', 'we', 'first', 'review', 'the', 'current', 'status', 'for', 'the', 'renormalization', 'group', 'equations', 'of', 'gaugefermion', 'theories', 'featuring', 'also', 'semisimple', 'groups', 'in', 'this', 'regime', 'these', 'theories', 'develop', 'an', 'interacting', 'ultraviolet', 'fixed', 'point', 'that', 'for', 'the', 'semisimple', 'case', 'leads', 'to', 'a', 'rich', 'phase', 'diagram', 'the', 'latter', 'contains', 'a', 'complete', 'asymptotically', 'safe', 'fixed', 'point', 'repulsive', 'in', 'all', 'couplings', 'we', 'then', 'add', 'two', 'gauged', 'weyl', 'fermions', 'belonging', 'to', 'arbitrary', 'representations', 'of', 'the', 'gauge', 'group', 'and', 'a', 'complex', 'gauged', 'scalar', 'to', 'the', 'original', 'gaugefermion', 'theory', 'allowing', 'for', 'new', 'yukawa', 'interactions', 'and', 'quartic', 'scalar', 'selfcoupling', 'consequently', 'we', 'determine', 'the', 'leading', '1n_f', 'yukawa', 'and', 'quartic', 'beta', 'functions', 'our', 'work', 'elucidates', 'consolidates', 'and', 'extends', 'results', 'obtained', 'earlier', 'in', 'the', 'literature', 'we', 'also', 'acquire', 'relevant', 'knowledge', 'about', 'the', 'dynamics', 'of', 'gaugeyukawa', 'theories', 'beyond', 'perturbation', 'theory', 'our', 'findings', 'are', 'applicable', 'to', 'any', 'extension', 'of', 'the', 'standard', 'model', 'featuring', 'a', 'large', 'number', 'of', 'fermions', 'such', 'as', 'asymptotic', 'safety']]
|
[-0.16743649388261048, 0.17490514521503225, -0.07602976448726151, 0.08285586692516428, -0.10720322130500902, -0.16969060780836936, 0.029899761519814484, 0.2742142440682208, -0.18311087827106226, -0.2711237832949853, 0.035359521971348624, -0.2825955158749158, -0.1815351414282944, 0.11807455245353696, -0.005308419648546403, 0.004652406500054546, -0.02450166751463886, 0.06678593072488352, -0.0933721318602401, -0.2644471804522277, 0.3480195692671394, -0.03133629898276226, 0.21688928506854507, 0.05428609773976567, 0.05661605557426451, 0.03598799974151692, -0.018749709315827968, -0.005194838486473869, -0.12626835525225033, 0.10321425595683661, 0.23451526366162723, 0.02518499370974799, 0.1882906968024111, -0.40272500636745934, -0.21413201959458766, 0.13320112663010755, 0.16214915892586435, 0.14198266202727633, -0.04685537148781558, -0.2902808198748432, 0.05123419598187608, -0.21440547978919414, -0.20789308088363068, -0.11435542321177544, -0.03481439273534228, -0.057011988982313924, -0.28479276484246424, 0.05419819960967109, -0.0012008352708186448, 0.054455353537097254, -0.045624981366994756, -0.09824831087004256, -0.02671837136666808, 0.1146729425124732, 0.0873456754298438, 0.01061744335823244, 0.10302452715171248, -0.20325067659454094, -0.11886526071926418, 0.3937069367053976, -0.10611381712887022, -0.20584536500758044, 0.21457498268810687, -0.150755851099808, -0.1959247571318468, 0.09845145466381017, 0.1503237215284672, 0.14564922063311067, -0.12486518162912057, 0.2145642702407376, -0.05206979326558886, 0.12295204060213974, 0.02181377179092831, 0.03760032131865529, 0.23885312673555295, 0.1455380376338539, 0.03339986142380462, 0.10819430840575354, 0.03466358228678597, -0.13585655981341355, -0.41095091796905536, -0.12670626037324387, -0.08448691289501127, 0.056886446874956656, -0.1370736800078849, -0.18294312848916483, 0.40884154101396786, 0.1836191078139193, 0.15854463233744703, 0.09238160700094598, 0.20792180775193336, 0.06915173071140515, 0.08268783876009826, 0.035275180734992945, 0.24544078540516856, 0.16891195828577987, 0.042479251128374196, -0.21085253640158494, -0.09095193188706482, 0.13172356872876853]
|
1,803.09771
|
Pigeons do not jump high
|
The infinite pigeonhole principle for 2-partitions asserts the existence, for
every set $A$, of an infinite subset of $A$ or of its complement. In this
paper, we develop a new notion of forcing enabling a fine analysis of the
computability-theoretic features of the pigeonhole principle. We deduce various
consequences, such as the existence, for every set $A$, of an infinite subset
of it or its complement of non-high degree. We also prove that every
$\Delta^0_3$ set has an infinite low${}_3$ solution and give a simpler proof of
Liu's theorem that every set has an infinite subset in it or its complement of
non-PA degree.
|
math.LO
|
the infinite pigeonhole principle for 2partitions asserts the existence for every set a of an infinite subset of a or of its complement in this paper we develop a new notion of forcing enabling a fine analysis of the computabilitytheoretic features of the pigeonhole principle we deduce various consequences such as the existence for every set a of an infinite subset of it or its complement of nonhigh degree we also prove that every delta0_3 set has an infinite low_3 solution and give a simpler proof of lius theorem that every set has an infinite subset in it or its complement of nonpa degree
|
[['the', 'infinite', 'pigeonhole', 'principle', 'for', '2partitions', 'asserts', 'the', 'existence', 'for', 'every', 'set', 'a', 'of', 'an', 'infinite', 'subset', 'of', 'a', 'or', 'of', 'its', 'complement', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'notion', 'of', 'forcing', 'enabling', 'a', 'fine', 'analysis', 'of', 'the', 'computabilitytheoretic', 'features', 'of', 'the', 'pigeonhole', 'principle', 'we', 'deduce', 'various', 'consequences', 'such', 'as', 'the', 'existence', 'for', 'every', 'set', 'a', 'of', 'an', 'infinite', 'subset', 'of', 'it', 'or', 'its', 'complement', 'of', 'nonhigh', 'degree', 'we', 'also', 'prove', 'that', 'every', 'delta0_3', 'set', 'has', 'an', 'infinite', 'low_3', 'solution', 'and', 'give', 'a', 'simpler', 'proof', 'of', 'lius', 'theorem', 'that', 'every', 'set', 'has', 'an', 'infinite', 'subset', 'in', 'it', 'or', 'its', 'complement', 'of', 'nonpa', 'degree']]
|
[-0.1648195263846676, 0.04801946211350381, -0.14939235374884735, 0.018667828341217545, -0.08902286728936257, -0.08641253756174799, 0.08896646701320453, 0.27954494006157216, -0.30564396149746265, -0.2147036989468454, 0.14749646210111678, -0.266045243765163, -0.138000813135324, 0.22044467565714207, -0.07927759572181224, -0.015833289124472714, 0.07433658157761144, 0.11780046617455485, -0.006574625781008808, -0.22093410487517273, 0.3207043639780714, -0.059511763993466256, 0.18925419859910883, 0.10862763627146435, 0.18029760798015218, 0.05919721526656263, 0.00859686067918002, 0.06704645993022046, -0.14463344785816493, 0.12554510435698055, 0.21895370658228894, 0.21314087516333133, 0.3555877933481542, -0.35375566110545126, -0.16922887214136742, 0.20883009349466256, 0.0922844640352754, 0.10886544508324696, -0.03129475327620126, -0.23151200179858963, 0.1389865248583921, -0.1860532642847577, -0.23267834069262636, -0.06921100160014806, 0.059801614280826976, 0.0010640763188942825, -0.2548732133121184, -0.04978914941357919, 0.15891187942337873, 0.10721655892171335, -0.04320145266863638, -0.07843011756436807, -0.0110536046812569, 0.1058461557737192, -0.011484383577757542, 0.03367712199780168, 0.0032394638372640503, -0.05668100988547696, -0.17658035368151445, 0.35843898510873906, -0.05331729112727807, -0.22215359670912274, 0.18435306321497602, -0.09539320636171811, -0.19783284700484854, 0.1003179299128749, 0.08607147282247643, 0.1319365386878795, -0.08807475840912597, 0.15386681742724123, -0.1930703392233884, 0.1543373895560087, 0.10982295681750125, 0.0774449846974694, 0.15785843408871142, 0.16880235321229636, 0.17112162283225224, 0.1790853663725723, -0.0036838826951616915, 0.04960308223962784, -0.37851301278218186, -0.20040167836785908, -0.19195232513628088, 0.11259411468912875, -0.14373355967411655, -0.26583704933302826, 0.378244796269896, 0.12488676033600575, 0.18160111925537042, 0.09793356076657476, 0.2270947862600926, 0.10474405773756287, 0.015949591215109766, 0.08051076005120752, 0.13775600941095612, 0.15672077830318398, -0.010891131669430449, -0.12889216753589636, 0.0625795498167598, 0.14209366201118814]
|
1,803.09772
|
Wildness of the problem of classifying nilpotent Lie algebras of vector
fields in four variables
|
Let $\mathbb F$ be a field $\mathbb F $ of characteristic zero. Let
$W_{n}(\mathbb F)$ be the Lie algebra of all $\mathbb F$-derivations with the
Lie bracket $[D_1, D_2]:=D_1D_2-D_2D_1$ on the polynomial ring $\mathbb F [x_1,
\ldots , x_n]$. The problem of classifying finite dimensional subalgebras of
$W_{n}(\mathbb F)$ was solved if $ n\leq 2$ and $\mathbb F=\mathbb C$ or
$\mathbb F=\mathbb R.$ We prove that this problem is wild if $n\geq 4$, which
means that it contains the classical unsolved problem of classifying matrix
pairs up to similarity. The structure of finite dimensional subalgebras of
$W_{n}(\mathbb F)$ is interesting since each derivation in case $\mathbb
F=\mathbb R$ can be considered as a vector field with polynomial coefficients
on the manifold $\mathbb R^{n}.$
|
math.RA
|
let mathbb f be a field mathbb f of characteristic zero let w_nmathbb f be the lie algebra of all mathbb fderivations with the lie bracket d_1 d_2d_1d_2d_2d_1 on the polynomial ring mathbb f x_1 ldots x_n the problem of classifying finite dimensional subalgebras of w_nmathbb f was solved if nleq 2 and mathbb fmathbb c or mathbb fmathbb r we prove that this problem is wild if ngeq 4 which means that it contains the classical unsolved problem of classifying matrix pairs up to similarity the structure of finite dimensional subalgebras of w_nmathbb f is interesting since each derivation in case mathbb fmathbb r can be considered as a vector field with polynomial coefficients on the manifold mathbb rn
|
[['let', 'mathbb', 'f', 'be', 'a', 'field', 'mathbb', 'f', 'of', 'characteristic', 'zero', 'let', 'w_nmathbb', 'f', 'be', 'the', 'lie', 'algebra', 'of', 'all', 'mathbb', 'fderivations', 'with', 'the', 'lie', 'bracket', 'd_1', 'd_2d_1d_2d_2d_1', 'on', 'the', 'polynomial', 'ring', 'mathbb', 'f', 'x_1', 'ldots', 'x_n', 'the', 'problem', 'of', 'classifying', 'finite', 'dimensional', 'subalgebras', 'of', 'w_nmathbb', 'f', 'was', 'solved', 'if', 'nleq', '2', 'and', 'mathbb', 'fmathbb', 'c', 'or', 'mathbb', 'fmathbb', 'r', 'we', 'prove', 'that', 'this', 'problem', 'is', 'wild', 'if', 'ngeq', '4', 'which', 'means', 'that', 'it', 'contains', 'the', 'classical', 'unsolved', 'problem', 'of', 'classifying', 'matrix', 'pairs', 'up', 'to', 'similarity', 'the', 'structure', 'of', 'finite', 'dimensional', 'subalgebras', 'of', 'w_nmathbb', 'f', 'is', 'interesting', 'since', 'each', 'derivation', 'in', 'case', 'mathbb', 'fmathbb', 'r', 'can', 'be', 'considered', 'as', 'a', 'vector', 'field', 'with', 'polynomial', 'coefficients', 'on', 'the', 'manifold', 'mathbb', 'rn']]
|
[-0.23755776979176177, 0.057636832109538016, 0.003380142026028391, -0.05352766569841937, -0.06655519407921297, -0.22507545566659862, -0.11587093804146052, 0.33670779701196035, -0.3780496075070637, -0.1112307605049494, 0.09078223751147546, -0.27261107250795524, -0.09500517705021332, 0.17341404545547093, -0.09338844186326457, -0.04003298110565392, -0.012538622251822281, 0.1692006615724541, -0.1096841744818109, -0.3686487180145331, 0.33077387327044194, -0.15561596368108008, 0.14820985630119093, 0.012701190858132254, 0.11865322350650646, 0.0022133212710209824, 0.06507452387930983, -0.0181948948075395, -0.1945011262784138, 0.051097603876861915, 0.3074436805850305, 0.10650420316171406, 0.272658427953286, -0.3299577159301962, -0.15523558373610347, 0.32672070857074303, 0.25440066614014617, -0.1204717443373954, 0.012704936558601715, -0.28769682242606087, 0.13561179928513148, -0.10067267938895877, -0.16442903243320978, -0.02262470158708866, 0.17611533766368234, 0.003695143917496553, -0.3668754071029795, 0.03401708712217288, 0.1274144094579427, 0.15011974184979068, -0.039950510873696055, -0.151871661489861, -0.09372113572465161, 0.03059826058264569, -0.07853372628263877, 0.228403792908944, 0.07845902139068407, 0.007401777923297556, -0.05269568869686228, 0.4069640374647738, -0.07265706950309292, -0.2915415777824819, 0.053156222240462646, -0.23601162876791748, -0.1406044354030894, 0.09776340703622012, 0.09147354125408298, 0.1992053742031172, -0.010994857682755722, 0.339413862785431, -0.17333395356091402, 0.0809752004126371, 0.08795146834326245, -0.04438136722813597, 0.1327851874856436, 0.03270994668226626, 0.05245515965028879, 0.10725073551589434, 0.046267312122666736, 0.05015112095023111, -0.37615450316945376, -0.13970280882223682, -0.17448506150809037, 0.24593146033072055, -0.13550652857458956, -0.1291510912873861, 0.33278912501567504, 0.0587809987576339, 0.17081750221392614, 0.10748255424205434, 0.17979976168277, 0.07938691802318919, 0.035063231506945285, 0.08389237510450816, -0.021273054853397404, 0.2240226864893684, -0.0808584656392745, -0.13819285206520393, -0.04175824453754319, 0.2252261186673669]
|
1,803.09773
|
The weighted moduli spaces of sextics
|
We use the weighted moduli height as defined in \cite{sh-h} to investigate
the distribution of fine moduli points in the moduli space of genus two curves.
We show that for any genus two curve with equation $y^2=f(x)$, its weighted
moduli height $\mathfrak h (\mathfrak{p}) \leq 2^3 \sqrt{3 \cdot 5 \cdot 7} \,
\cdot H(f)$, where $H(f)$ is the minimal naive height of the curve as defined
in \cite{height}. Based on the weighted moduli height $\mathfrak h$ we create a
database of genus two curves defined over $\mathbb Q$ with small $\mathfrak h$
and show that for small such height ($\mathfrak h < 5$) about 30% of points are
fine moduli points.
|
math.AG
|
we use the weighted moduli height as defined in citeshh to investigate the distribution of fine moduli points in the moduli space of genus two curves we show that for any genus two curve with equation y2fx its weighted moduli height mathfrak h mathfrakp leq 23 sqrt3 cdot 5 cdot 7 cdot hf where hf is the minimal naive height of the curve as defined in citeheight based on the weighted moduli height mathfrak h we create a database of genus two curves defined over mathbb q with small mathfrak h and show that for small such height mathfrak h 5 about 30 of points are fine moduli points
|
[['we', 'use', 'the', 'weighted', 'moduli', 'height', 'as', 'defined', 'in', 'citeshh', 'to', 'investigate', 'the', 'distribution', 'of', 'fine', 'moduli', 'points', 'in', 'the', 'moduli', 'space', 'of', 'genus', 'two', 'curves', 'we', 'show', 'that', 'for', 'any', 'genus', 'two', 'curve', 'with', 'equation', 'y2fx', 'its', 'weighted', 'moduli', 'height', 'mathfrak', 'h', 'mathfrakp', 'leq', '23', 'sqrt3', 'cdot', '5', 'cdot', '7', 'cdot', 'hf', 'where', 'hf', 'is', 'the', 'minimal', 'naive', 'height', 'of', 'the', 'curve', 'as', 'defined', 'in', 'citeheight', 'based', 'on', 'the', 'weighted', 'moduli', 'height', 'mathfrak', 'h', 'we', 'create', 'a', 'database', 'of', 'genus', 'two', 'curves', 'defined', 'over', 'mathbb', 'q', 'with', 'small', 'mathfrak', 'h', 'and', 'show', 'that', 'for', 'small', 'such', 'height', 'mathfrak', 'h', '5', 'about', '30', 'of', 'points', 'are', 'fine', 'moduli', 'points']]
|
[-0.21058091555208525, 0.14208864442412264, -0.028529279950188002, 0.06131771031579995, -0.04384688701628594, -0.12456733249040826, 0.018055740726467606, 0.3670720737819151, -0.34181662459387746, -0.28830154793702556, 0.04265627752071264, -0.2740950978091248, -0.07984450780656015, 0.23489192223924898, -0.10492963195456384, -0.0013313627345966192, -0.0003625956216008864, 0.07770868722854235, -0.09639032374388565, -0.3350560614995867, 0.34955868883946234, -0.10390915806518397, 0.19844989445730696, 0.02013624684066973, 0.07470869689648883, 0.009356371000861731, 0.04468838828311206, -0.03786818163984055, -0.2225261756365033, 0.09539987616867662, 0.2545670398867854, 0.05408178152795011, 0.1805996843831283, -0.3680975567549467, -0.15553161271229804, 0.2585023822628449, 0.14170468162536343, -0.0958208009670271, 0.08596443805612937, -0.1612091979238196, 0.12291015664585561, -0.0671404310824158, -0.19363785790993232, -0.021113131236650536, 0.13261256658115259, 0.025840053160753204, -0.20959885441045337, -0.009995119176178334, -0.0018594180033585735, 0.16885467015520156, -0.060116348449776175, -0.22982562234990786, -0.15920704654548493, -0.00474079630433399, -0.03869647719183606, 0.14380126562248044, 0.06713838935786179, -0.100897305923575, -0.03674026063445381, 0.3700824839489482, -0.1433439973010638, -0.16054280245868124, 0.03685789839712746, -0.1803716703570474, -0.09082561478162376, 0.12625312567557964, 0.09537434232830305, 0.1996788498684416, 0.05226437469822503, 0.2314213739232613, -0.09210915886144215, 0.14949541023679982, 0.11179665402589783, -0.03448803785526864, 0.0667646048050896, 0.10889969170789852, 0.05704506927074116, 0.08028925891103937, -0.11274879149631292, 4.957919661826063e-05, -0.4039814901749264, -0.20135012122793733, -0.11334203900856392, 0.16839080847904225, -0.19810057022795408, -0.18516964428823127, 0.38264387761673535, 0.04649097595318159, 0.3191219072388572, 0.09855592384864793, 0.17174949180160728, 0.03381155509388544, 0.03310992530433931, 0.11733614618533125, 0.1165082408071748, 0.14305439871457346, -0.06237241653747265, -0.13554769655184767, -0.04705186140784454, 0.20105507813185175]
|
1,803.09774
|
C-S-H gel densification: the impact of the nanoscale on self desiccation
and sorption isotherms
|
The relationship between humidity and water content in a hydrating cement
paste is largely controlled by the nanostructure of the C-S-H gel. Current
hydration models do not describe this nanostructure, thus sorption isotherms
and self-desiccation are given as constitutive inputs instead of being
predicted from microstructural evolution. To address this limitation, this work
combines a C-S-H gel description from nanoscale simulations with evolving
capillary pore size distributions from a simple hydration model. Results show
that a progressive densification of the C-S-H gel must be considered in order
to explain the self-desiccation of low-alkali pastes. The impact of C-S-H
densification on the evolution of microstructure and sorption isotherms is then
discussed, including the effect of water-to-cement ratio, cement powder
fineness, and curing temperature. Overall, this work identifies an area where
nanoscale simulations can integrate larger-scale models of cement hydration and
poromechanics.
|
cond-mat.soft cond-mat.mes-hall
|
the relationship between humidity and water content in a hydrating cement paste is largely controlled by the nanostructure of the csh gel current hydration models do not describe this nanostructure thus sorption isotherms and selfdesiccation are given as constitutive inputs instead of being predicted from microstructural evolution to address this limitation this work combines a csh gel description from nanoscale simulations with evolving capillary pore size distributions from a simple hydration model results show that a progressive densification of the csh gel must be considered in order to explain the selfdesiccation of lowalkali pastes the impact of csh densification on the evolution of microstructure and sorption isotherms is then discussed including the effect of watertocement ratio cement powder fineness and curing temperature overall this work identifies an area where nanoscale simulations can integrate largerscale models of cement hydration and poromechanics
|
[['the', 'relationship', 'between', 'humidity', 'and', 'water', 'content', 'in', 'a', 'hydrating', 'cement', 'paste', 'is', 'largely', 'controlled', 'by', 'the', 'nanostructure', 'of', 'the', 'csh', 'gel', 'current', 'hydration', 'models', 'do', 'not', 'describe', 'this', 'nanostructure', 'thus', 'sorption', 'isotherms', 'and', 'selfdesiccation', 'are', 'given', 'as', 'constitutive', 'inputs', 'instead', 'of', 'being', 'predicted', 'from', 'microstructural', 'evolution', 'to', 'address', 'this', 'limitation', 'this', 'work', 'combines', 'a', 'csh', 'gel', 'description', 'from', 'nanoscale', 'simulations', 'with', 'evolving', 'capillary', 'pore', 'size', 'distributions', 'from', 'a', 'simple', 'hydration', 'model', 'results', 'show', 'that', 'a', 'progressive', 'densification', 'of', 'the', 'csh', 'gel', 'must', 'be', 'considered', 'in', 'order', 'to', 'explain', 'the', 'selfdesiccation', 'of', 'lowalkali', 'pastes', 'the', 'impact', 'of', 'csh', 'densification', 'on', 'the', 'evolution', 'of', 'microstructure', 'and', 'sorption', 'isotherms', 'is', 'then', 'discussed', 'including', 'the', 'effect', 'of', 'watertocement', 'ratio', 'cement', 'powder', 'fineness', 'and', 'curing', 'temperature', 'overall', 'this', 'work', 'identifies', 'an', 'area', 'where', 'nanoscale', 'simulations', 'can', 'integrate', 'largerscale', 'models', 'of', 'cement', 'hydration', 'and', 'poromechanics']]
|
[-0.034852627984309284, 0.19044454818870618, -0.09755751430770776, -0.03622031199446723, -0.022364105155732294, -0.11739517211995638, 0.026752281131861854, 0.36675061891875127, -0.28346130110146683, -0.28945338085674455, 0.04969978514195413, -0.2671793897833376, -0.18495070851700257, 0.10802411306632452, -0.07464300143960727, 0.026211318107879293, 0.024698623752622547, -0.07786343729354604, -0.01159351990544611, -0.18947282862037176, 0.2531270874803546, 0.11010401349185021, 0.32151942644722886, 0.1594313343147319, 0.07637498178009461, -0.08949001418616977, 0.014301170329444356, 0.08727214605731033, -0.21662955778935816, 0.08195972284574034, 0.2520633015812338, 0.016551282222851786, 0.20952143243779123, -0.5002008715957186, -0.2970794747603962, 0.0252553031340719, 0.10453803429760745, 0.09711584805368181, -0.01341232271392551, -0.20227037965197686, 0.045298015518644215, -0.13867133574893387, -0.10377880438047386, -0.05056379135208626, -0.018983182966382833, 0.06224817541312345, -0.1972698108454568, 0.09411050349365185, 0.05860931769924334, 0.10015593536442867, -0.15438382719969718, -0.11444082321857449, -0.05875718914461832, 0.09846092191062542, 0.06253895463921592, -0.03931876861687451, 0.2815025972243208, -0.12909877242479664, 0.004019124504776984, 0.41428975728306455, -0.015980971287120217, -0.1505821189336669, 0.1807332475955197, -0.11117804380487242, -0.08720284645330079, 0.18046113730401453, 0.14789832748700424, 0.06477256632158465, -0.21146143573832554, 0.012197192886208666, 0.026961527486080234, 0.22548397281462068, 0.11184068004486837, -0.08932325505671927, 0.2091861238098112, 0.315782628365432, -0.03584882723215124, 0.175723235728729, -0.06952568316104801, -0.060564687654008936, -0.22702452619933952, -0.21349527046465092, -0.1816334019926628, 0.02614069024254279, -0.1122622473710718, -0.2099779235967265, 0.33695939233030336, 0.11103304380374233, 0.1631407733470453, 0.050454879424324, 0.25729960745734154, -0.01727595944280471, 0.04272423895674139, 0.0041471337559666945, 0.20966907246650135, 0.13590920849254587, 0.1562222044972956, -0.28674238239394595, 0.18512806097167905, 0.03985231188737726]
|
1,803.09775
|
Development of a SEMPA system for magnetic imaging with ns time
resolution and phase-sensitive detection
|
Scanning electron microscopy with polarization analysis is a powerful
lab-based magnetic imaging technique offering parallel imaging of multiple
magnetization components and a very high spatial resolution. However, one
drawback of the technique is the long required acquisition time resulting from
the low inherent efficiency of spin detection, which has limited the
applicability of the technique to certain quasi-static measurement schemes and
materials with strong contrast. Here we demonstrate the ability to improve the
signal-to-noise ratio for particular classes of measurement involving periodic
excitation of the magnetic structure via the integration of a time-to-digital
converter to the system and a digital lock-in detection scheme. The modified
setup provides dynamic imaging capabilities using selected time windows and
finally full time-resolved imaging with a demonstrated time resolution of
better than 2 ns.
|
physics.ins-det cond-mat.mes-hall
|
scanning electron microscopy with polarization analysis is a powerful labbased magnetic imaging technique offering parallel imaging of multiple magnetization components and a very high spatial resolution however one drawback of the technique is the long required acquisition time resulting from the low inherent efficiency of spin detection which has limited the applicability of the technique to certain quasistatic measurement schemes and materials with strong contrast here we demonstrate the ability to improve the signaltonoise ratio for particular classes of measurement involving periodic excitation of the magnetic structure via the integration of a timetodigital converter to the system and a digital lockin detection scheme the modified setup provides dynamic imaging capabilities using selected time windows and finally full timeresolved imaging with a demonstrated time resolution of better than 2 ns
|
[['scanning', 'electron', 'microscopy', 'with', 'polarization', 'analysis', 'is', 'a', 'powerful', 'labbased', 'magnetic', 'imaging', 'technique', 'offering', 'parallel', 'imaging', 'of', 'multiple', 'magnetization', 'components', 'and', 'a', 'very', 'high', 'spatial', 'resolution', 'however', 'one', 'drawback', 'of', 'the', 'technique', 'is', 'the', 'long', 'required', 'acquisition', 'time', 'resulting', 'from', 'the', 'low', 'inherent', 'efficiency', 'of', 'spin', 'detection', 'which', 'has', 'limited', 'the', 'applicability', 'of', 'the', 'technique', 'to', 'certain', 'quasistatic', 'measurement', 'schemes', 'and', 'materials', 'with', 'strong', 'contrast', 'here', 'we', 'demonstrate', 'the', 'ability', 'to', 'improve', 'the', 'signaltonoise', 'ratio', 'for', 'particular', 'classes', 'of', 'measurement', 'involving', 'periodic', 'excitation', 'of', 'the', 'magnetic', 'structure', 'via', 'the', 'integration', 'of', 'a', 'timetodigital', 'converter', 'to', 'the', 'system', 'and', 'a', 'digital', 'lockin', 'detection', 'scheme', 'the', 'modified', 'setup', 'provides', 'dynamic', 'imaging', 'capabilities', 'using', 'selected', 'time', 'windows', 'and', 'finally', 'full', 'timeresolved', 'imaging', 'with', 'a', 'demonstrated', 'time', 'resolution', 'of', 'better', 'than', '2', 'ns']]
|
[-0.11631721453813389, 0.06186212254543753, -0.06079263072605281, 0.0024572957628370487, -0.07552656963965747, -0.15353739108933612, 0.04547230383632127, 0.4007507120656182, -0.27282101779367574, -0.36949293228775953, 0.11434446044840178, -0.21339094157280156, -0.08518609677824054, 0.25591483430092243, -0.008013139881352467, 0.09248173020846867, 0.06489580611395109, -0.03820719030440258, -0.08406805963609223, -0.17231009307483486, 0.22263042885239792, 0.12285068284633548, 0.35728825043612555, 0.04723921035914574, 0.17802744055556696, 0.053655044838078605, -0.031618025774757065, 0.02210796728383663, -0.07432404722090695, 0.09875681366619848, 0.24106475318666518, 0.0997446477422202, 0.2537004577606021, -0.426524000964308, -0.22302090450254983, 0.05892789944313293, 0.14752961370314277, 0.09407431700414899, -0.07896983063989138, -0.2636175785762395, 0.08359820605075174, -0.13833869493010548, -0.10721824226121224, -0.10928921136543039, -0.05292023041162842, 0.040085270118271545, -0.2796190850993496, 0.07622862127050035, 0.019943553596994904, 0.080975213885856, -0.06207523185600953, -0.0380464522285358, 0.04285007819547787, 0.10328088161109607, -0.020694418113620938, 0.02439979249304666, 0.1194582770564124, -0.13533839998340827, -0.1250103532062309, 0.3361716013141843, -0.06488882182014821, -0.1458372518622367, 0.2262906695051884, -0.17800887842308874, -0.07480574135809358, 0.20096241394346653, 0.13772580194667833, 0.15842871615562096, -0.12529986718887925, 0.027907303577991087, 0.06109697650396084, 0.24626906760498996, 0.08418073162234338, 0.11118511374779912, 0.17983140998390004, 0.26892132669427365, 0.05213012881778937, 0.13045239694012228, -0.24696235936459934, -0.013368199913322117, -0.19353823615427584, -0.16789741819190193, -0.18388289308027445, 0.043554852652551185, -0.07593450293823889, -0.1245414028305185, 0.4025729122606786, 0.17781092541097382, 0.14513547087896816, 0.007959355503616697, 0.4287925255701466, 0.1033661760418683, 0.09630270959275175, -0.042869563329993754, 0.22044020880991955, 0.15892968299192226, 0.1768215857879367, -0.26557794317076083, 0.026674413530141577, -0.027499065768738933]
|
1,803.09776
|
Scaled Prototype of a Tantalum Target Embedded in Expanded Graphite for
Antiproton Production: Design, Manufacturing and Testing under Proton Beam
Impacts
|
This study presents a further step within the ongoing R&D activities for the
redesign of the CERN's Antiproton Decelerator Production Target (AD-Target). A
first scaled target prototype, constituted of a sliced core made of ten Ta rods
-8 mm diameter, 16 mm length- embedded in a compressed expanded graphite (EG)
matrix, inserted in a 44 mm diameter Ti-6Al-4V container, has been built and
tested under proton beam impacts at the CERN's HiRadMat facility, in the so
called HRMT-42 experiment. This prototype has been designed following the
lessons learned from previous numerical and experimental works (HRMT-27
experiment) aiming at answering the open questions left in these studies.
Velocity data recorded on-line at the target periphery during the HRMT-42
experiment is presented, showing features of its dynamic response to proton
beam impacts. Furthermore, x-ray and neutron tomographies of the target
prototype after irradiation have been performed. These non-destructive
techniques show the extensive plastic deformation of the Ta core, but suggest
that the EG matrix can adapt to such deformation, which is a positive result.
The neutron tomography successfully revealed the internal state of the tantalum
core, showing the appearance of voids of several hundreds of micrometers, in
particular in the downstream rods of the core. The possible origin of such
voids is discussed while future microstructure analysis after the target
opening will try to clarify their nature.
|
physics.acc-ph
|
this study presents a further step within the ongoing rd activities for the redesign of the cerns antiproton decelerator production target adtarget a first scaled target prototype constituted of a sliced core made of ten ta rods 8 mm diameter 16 mm length embedded in a compressed expanded graphite eg matrix inserted in a 44 mm diameter ti6al4v container has been built and tested under proton beam impacts at the cerns hiradmat facility in the so called hrmt42 experiment this prototype has been designed following the lessons learned from previous numerical and experimental works hrmt27 experiment aiming at answering the open questions left in these studies velocity data recorded online at the target periphery during the hrmt42 experiment is presented showing features of its dynamic response to proton beam impacts furthermore xray and neutron tomographies of the target prototype after irradiation have been performed these nondestructive techniques show the extensive plastic deformation of the ta core but suggest that the eg matrix can adapt to such deformation which is a positive result the neutron tomography successfully revealed the internal state of the tantalum core showing the appearance of voids of several hundreds of micrometers in particular in the downstream rods of the core the possible origin of such voids is discussed while future microstructure analysis after the target opening will try to clarify their nature
|
[['this', 'study', 'presents', 'a', 'further', 'step', 'within', 'the', 'ongoing', 'rd', 'activities', 'for', 'the', 'redesign', 'of', 'the', 'cerns', 'antiproton', 'decelerator', 'production', 'target', 'adtarget', 'a', 'first', 'scaled', 'target', 'prototype', 'constituted', 'of', 'a', 'sliced', 'core', 'made', 'of', 'ten', 'ta', 'rods', '8', 'mm', 'diameter', '16', 'mm', 'length', 'embedded', 'in', 'a', 'compressed', 'expanded', 'graphite', 'eg', 'matrix', 'inserted', 'in', 'a', '44', 'mm', 'diameter', 'ti6al4v', 'container', 'has', 'been', 'built', 'and', 'tested', 'under', 'proton', 'beam', 'impacts', 'at', 'the', 'cerns', 'hiradmat', 'facility', 'in', 'the', 'so', 'called', 'hrmt42', 'experiment', 'this', 'prototype', 'has', 'been', 'designed', 'following', 'the', 'lessons', 'learned', 'from', 'previous', 'numerical', 'and', 'experimental', 'works', 'hrmt27', 'experiment', 'aiming', 'at', 'answering', 'the', 'open', 'questions', 'left', 'in', 'these', 'studies', 'velocity', 'data', 'recorded', 'online', 'at', 'the', 'target', 'periphery', 'during', 'the', 'hrmt42', 'experiment', 'is', 'presented', 'showing', 'features', 'of', 'its', 'dynamic', 'response', 'to', 'proton', 'beam', 'impacts', 'furthermore', 'xray', 'and', 'neutron', 'tomographies', 'of', 'the', 'target', 'prototype', 'after', 'irradiation', 'have', 'been', 'performed', 'these', 'nondestructive', 'techniques', 'show', 'the', 'extensive', 'plastic', 'deformation', 'of', 'the', 'ta', 'core', 'but', 'suggest', 'that', 'the', 'eg', 'matrix', 'can', 'adapt', 'to', 'such', 'deformation', 'which', 'is', 'a', 'positive', 'result', 'the', 'neutron', 'tomography', 'successfully', 'revealed', 'the', 'internal', 'state', 'of', 'the', 'tantalum', 'core', 'showing', 'the', 'appearance', 'of', 'voids', 'of', 'several', 'hundreds', 'of', 'micrometers', 'in', 'particular', 'in', 'the', 'downstream', 'rods', 'of', 'the', 'core', 'the', 'possible', 'origin', 'of', 'such', 'voids', 'is', 'discussed', 'while', 'future', 'microstructure', 'analysis', 'after', 'the', 'target', 'opening', 'will', 'try', 'to', 'clarify', 'their', 'nature']]
|
[-0.0589206027745678, 0.1593876765446729, -0.0730916843437659, 0.01378680345743507, -0.04031427738960512, -0.105949204074792, 0.018184629822048735, 0.40687430161156807, -0.24582938461383275, -0.3202290358253633, 0.11048421214916217, -0.2959579131249928, -0.06051251622405729, 0.16158448191405994, 0.0019826309795478755, 0.10266090007199921, 0.09172545327295073, 0.019044160373546858, -0.06666900514760919, -0.2197839017268439, 0.25643662299762787, 0.14738376896272148, 0.29828938043558323, 0.08096318663497207, 0.1002594469651386, -0.030906992918354505, -0.05652859672662756, 0.017692094262082517, -0.09670572902808283, 0.08798407299477792, 0.2826323089404748, 0.13352045220512807, 0.2454638446405176, -0.4904963204645598, -0.1927423524118252, 0.0402258449530111, 0.1190747776924347, 0.04764497190412572, -0.08628941184685174, -0.28965213180127725, 0.08341975911252825, -0.154519726102961, -0.17413006481457485, 0.023370034173046707, 0.038407062399475014, 0.02206271135525323, -0.20695973241941928, -0.016849250254554176, 0.03866290771908114, 0.06221958295214601, -0.06257530569459198, -0.16107374175854144, 0.030421487076789544, 0.09780874526248276, 0.02432337322649525, 0.060569945836863245, 0.20414702793397851, -0.09153515986921223, -0.0889778366097464, 0.343646134053909, 0.0008986963473294116, -0.10321391838743894, 0.16177768689554978, -0.16868504092130995, -0.11942478396974049, 0.15615289809805977, 0.1799231668675057, 0.09084608123587166, -0.15238963235043226, 0.023612627582845797, -0.029072020926651843, 0.20675990941704617, 0.11982955648542731, -0.044165583054547736, 0.21483753227346422, 0.28302891835901145, 0.0013761622760111963, 0.17073147736144215, -0.18420024522963693, -0.022757599040459233, -0.28454737733508045, -0.13186403458023538, -0.14464759505648858, 0.038751301239771406, -0.019681011345377086, -0.10054939953142533, 0.3752844730661803, 0.10060277823316632, 0.19014359161239833, -0.0362907331568564, 0.26585434960850357, -0.027826138930100257, 0.1088848589936364, 0.026522500330910963, 0.2789046242090397, 0.09564933675811184, 0.16252797566737762, -0.22041143904749844, 0.0751144873964436, -0.0007632684912869699]
|
1,803.09777
|
Skinning bounds along thick rays
|
We show that the diameter of the skinning map of an acylindrical hyperbolic
3-manifold M is bounded on thick Teichmueller geodesic rays by a constant
depending only on the thickness of the ray and the topological type of the
boundary of M.
|
math.GT
|
we show that the diameter of the skinning map of an acylindrical hyperbolic 3manifold m is bounded on thick teichmueller geodesic rays by a constant depending only on the thickness of the ray and the topological type of the boundary of m
|
[['we', 'show', 'that', 'the', 'diameter', 'of', 'the', 'skinning', 'map', 'of', 'an', 'acylindrical', 'hyperbolic', '3manifold', 'm', 'is', 'bounded', 'on', 'thick', 'teichmueller', 'geodesic', 'rays', 'by', 'a', 'constant', 'depending', 'only', 'on', 'the', 'thickness', 'of', 'the', 'ray', 'and', 'the', 'topological', 'type', 'of', 'the', 'boundary', 'of', 'm']]
|
[-0.2133394167980268, 0.16524067824086938, -0.060388127386215185, 0.0056381647480607386, -0.0979158892961485, -0.06803904100698197, -0.00871014426506701, 0.3545134511022341, -0.31772797128983904, -0.2543102027404876, 0.08774072562699162, -0.2872066954594283, -0.08569752124492966, 0.26423116914174033, -0.14834602846808376, 0.00617960627589907, 0.04702747617626474, 0.09719192309005718, -0.08066170055064417, -0.2379822562936516, 0.45356900502173675, 0.0001231959100723976, 0.18279256911150046, 0.1008037951819244, 0.16442913353620542, -0.05078618292741123, -0.022600203297943586, 0.047735598610459076, -0.24703068621654115, 0.1183349479910075, 0.12904347562497215, 0.01917906165389078, 0.12411514533838879, -0.3743275200415935, -0.23669648026337936, 0.10455323303384441, 0.09486159509313959, -0.0889394299481951, -0.035116171780308444, -0.29800808939727996, 0.12454493052237445, -0.030720109652195658, -0.17322488917436982, 0.09298851562752611, 0.06213381089314464, 0.015587162159915482, -0.13369430087151982, -0.019962337533278123, 0.1576081354703222, 0.07631356258033997, -0.06856821483233944, -0.07750376817282467, -0.09952124975444306, 0.1301212399710147, 0.042040966068660576, 0.06654847022478602, 0.12864226188200215, -0.06556646889519124, -0.022670419310175237, 0.35815155665789333, -0.13187141122207754, -0.24349918826261446, 0.1433548346339237, -0.18644866745342456, -0.07547005650676078, 0.1791418914162066, 0.14943079814492238, 0.19061833008059434, -0.03612656183984308, 0.25345246289673795, -0.12546907358392628, 0.18494300058643734, 0.12350700287857935, -0.07084406567792896, 0.15071068364860757, 0.15000817281681866, 0.19313059135207108, 0.0930936458254499, -0.09901773209484029, 0.032738584625933854, -0.37820401699060485, -0.25534588249311563, -0.2298631943939697, 0.1796127626273249, -0.20854665787988952, -0.24945353450519697, 0.3485845956241801, -0.018560560774945077, 0.20433287118517218, 0.09237612981260532, 0.23563129366153762, 0.0066631959066615395, 0.02152860755034323, 0.12554267127554686, 0.21083108539737405, 0.1534916969692512, -0.022287860845348666, -0.23149981877456108, -0.008535205669301962, 0.17644338444023605]
|
1,803.09778
|
Structural Properties of Optimal Transmission Policies for
Delay-Sensitive Energy Harvesting Wireless Sensors
|
We consider an energy harvesting sensor transmitting latency-sensitive data
over a fading channel. We aim to find the optimal transmission scheduling
policy that minimizes the packet queuing delay given the available harvested
energy. We formulate the problem as a Markov decision process (MDP) over a
state-space spanned by the transmitter's buffer, battery, and channel states,
and analyze the structural properties of the resulting optimal value function,
which quantifies the long-run performance of the optimal scheduling policy. We
show that the optimal value function (i) is non-decreasing and has increasing
differences in the queue backlog; (ii) is non-increasing and has increasing
differences in the battery state; and (iii) is submodular in the buffer and
battery states. Our numerical results confirm these properties and demonstrate
that the optimal scheduling policy outperforms a so-called greedy policy in
terms of sensor outages, buffer overflows, energy efficiency, and queuing
delay.
|
cs.NI
|
we consider an energy harvesting sensor transmitting latencysensitive data over a fading channel we aim to find the optimal transmission scheduling policy that minimizes the packet queuing delay given the available harvested energy we formulate the problem as a markov decision process mdp over a statespace spanned by the transmitters buffer battery and channel states and analyze the structural properties of the resulting optimal value function which quantifies the longrun performance of the optimal scheduling policy we show that the optimal value function i is nondecreasing and has increasing differences in the queue backlog ii is nonincreasing and has increasing differences in the battery state and iii is submodular in the buffer and battery states our numerical results confirm these properties and demonstrate that the optimal scheduling policy outperforms a socalled greedy policy in terms of sensor outages buffer overflows energy efficiency and queuing delay
|
[['we', 'consider', 'an', 'energy', 'harvesting', 'sensor', 'transmitting', 'latencysensitive', 'data', 'over', 'a', 'fading', 'channel', 'we', 'aim', 'to', 'find', 'the', 'optimal', 'transmission', 'scheduling', 'policy', 'that', 'minimizes', 'the', 'packet', 'queuing', 'delay', 'given', 'the', 'available', 'harvested', 'energy', 'we', 'formulate', 'the', 'problem', 'as', 'a', 'markov', 'decision', 'process', 'mdp', 'over', 'a', 'statespace', 'spanned', 'by', 'the', 'transmitters', 'buffer', 'battery', 'and', 'channel', 'states', 'and', 'analyze', 'the', 'structural', 'properties', 'of', 'the', 'resulting', 'optimal', 'value', 'function', 'which', 'quantifies', 'the', 'longrun', 'performance', 'of', 'the', 'optimal', 'scheduling', 'policy', 'we', 'show', 'that', 'the', 'optimal', 'value', 'function', 'i', 'is', 'nondecreasing', 'and', 'has', 'increasing', 'differences', 'in', 'the', 'queue', 'backlog', 'ii', 'is', 'nonincreasing', 'and', 'has', 'increasing', 'differences', 'in', 'the', 'battery', 'state', 'and', 'iii', 'is', 'submodular', 'in', 'the', 'buffer', 'and', 'battery', 'states', 'our', 'numerical', 'results', 'confirm', 'these', 'properties', 'and', 'demonstrate', 'that', 'the', 'optimal', 'scheduling', 'policy', 'outperforms', 'a', 'socalled', 'greedy', 'policy', 'in', 'terms', 'of', 'sensor', 'outages', 'buffer', 'overflows', 'energy', 'efficiency', 'and', 'queuing', 'delay']]
|
[-0.22142649543118373, 0.04974336929966551, -0.027954154451987866, 0.04649556161769804, -0.059122411026779946, -0.1842499664053321, 0.19507377526626504, 0.45728752002890766, -0.327039816718677, -0.2692077646995413, 0.12424007817010942, -0.28735071893396047, -0.12388209769951886, 0.11243800280278485, -0.1635746738134787, 0.12842169070680592, 0.0871400451046768, 0.05503010938811148, -0.008180128103764407, -0.24336540573918872, 0.28066287234682463, 0.12906703399815436, 0.37026556988471543, 0.05895692239804515, 0.13317880893230502, 0.028955697584576133, 0.03075541280017331, -0.03447145612846161, -0.15289035338726786, 0.021001141259832115, 0.3268985141068697, 0.21863644641406577, 0.32640303696409384, -0.4154731827177878, -0.24659162344700047, 0.11916583123584759, 0.10911750516789998, 0.030597771404728552, -0.03642502612562786, -0.21122805658599425, 0.08979930351809438, -0.2299500072037737, 0.013225452855614753, 0.03534533109772822, -0.028985617181350443, 0.08832898839408981, -0.3351840987801552, 0.00033240552814998504, -0.03169261067945125, -0.02733100477991433, -0.13913927670760914, -0.14232008181640815, -0.03532087635730618, 0.14833053892542575, 0.06810645051039595, -0.04965642002764447, 0.16315360463962986, -0.0979656286473418, -0.14841811856062248, 0.3215158627785999, -0.02992818674939717, -0.18251820904170646, 0.0796836734471385, -0.030642901181147018, -0.06519890156863578, 0.15530151399173614, 0.2333665915411608, 0.07479153601452708, -0.1661043146047099, 0.04535315252904748, -0.02510925260982637, 0.18197253162747828, 0.05674709269198878, 0.07611271449011461, 0.08340007518739279, 0.21794626802880446, 0.20009344989947717, 0.19378343808528936, -0.0797396124854427, -0.16099784119889654, -0.2535647180991183, -0.16351213743589046, -0.2257251369092485, 0.024894520375428015, -0.12422800913115899, -0.08933546866836219, 0.3750590646213948, 0.1398256928001627, 0.13146774015421497, 0.17137705556614774, 0.33119904732187117, 0.1849300974498278, -0.023439443625252823, 0.20718641188637962, 0.16235061544796517, 0.03755917647885608, 0.16663837982181073, -0.32367024927496396, 0.163567514296878, -0.03286540833751446]
|
1,803.09779
|
On the Associativity of Infinite Matrix Multiplication
|
A natural definition of the product of infinite matrices mimics the usual
formulation of multiplication of finite matrices with the caveat (in the
absence of any sense of convergence) that the intersection of the support of
each row of the first factor with the support of each column of the second
factor must be finite. Multiplication is hence not completely defined, but
restricted to a specific relation on infinite matrices. In order for the
product of three infinite matrices $A$, $B$, and $C$ to behave in an
associative manner, the middle factor, $B$, must link $A$ and $C$ in three
ways: (i) $AB$ and $BC$ must both be defined; (ii) $A(BC)$ and $(AB)C$ must
both be defined; and, finally, (iii) $A(BC)$ must equal $(AB)C$. In this
article, these conditions are studied and are characterized in various ways by
means of summability notions akin to those of formal calculus.
|
math.RA
|
a natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat in the absence of any sense of convergence that the intersection of the support of each row of the first factor with the support of each column of the second factor must be finite multiplication is hence not completely defined but restricted to a specific relation on infinite matrices in order for the product of three infinite matrices a b and c to behave in an associative manner the middle factor b must link a and c in three ways i ab and bc must both be defined ii abc and abc must both be defined and finally iii abc must equal abc in this article these conditions are studied and are characterized in various ways by means of summability notions akin to those of formal calculus
|
[['a', 'natural', 'definition', 'of', 'the', 'product', 'of', 'infinite', 'matrices', 'mimics', 'the', 'usual', 'formulation', 'of', 'multiplication', 'of', 'finite', 'matrices', 'with', 'the', 'caveat', 'in', 'the', 'absence', 'of', 'any', 'sense', 'of', 'convergence', 'that', 'the', 'intersection', 'of', 'the', 'support', 'of', 'each', 'row', 'of', 'the', 'first', 'factor', 'with', 'the', 'support', 'of', 'each', 'column', 'of', 'the', 'second', 'factor', 'must', 'be', 'finite', 'multiplication', 'is', 'hence', 'not', 'completely', 'defined', 'but', 'restricted', 'to', 'a', 'specific', 'relation', 'on', 'infinite', 'matrices', 'in', 'order', 'for', 'the', 'product', 'of', 'three', 'infinite', 'matrices', 'a', 'b', 'and', 'c', 'to', 'behave', 'in', 'an', 'associative', 'manner', 'the', 'middle', 'factor', 'b', 'must', 'link', 'a', 'and', 'c', 'in', 'three', 'ways', 'i', 'ab', 'and', 'bc', 'must', 'both', 'be', 'defined', 'ii', 'abc', 'and', 'abc', 'must', 'both', 'be', 'defined', 'and', 'finally', 'iii', 'abc', 'must', 'equal', 'abc', 'in', 'this', 'article', 'these', 'conditions', 'are', 'studied', 'and', 'are', 'characterized', 'in', 'various', 'ways', 'by', 'means', 'of', 'summability', 'notions', 'akin', 'to', 'those', 'of', 'formal', 'calculus']]
|
[-0.14761801069461572, 0.13918083149562605, -0.04472741843484392, 0.023567519238772424, -0.03916332201019081, -0.14979762920316914, 0.03787865842074294, 0.35420911204749467, -0.31432973588439256, -0.25934417732059956, 0.12638356301436401, -0.23289829494751757, -0.12863899165500156, 0.12142498808208148, -0.07134786817226307, 0.03456490234522199, 0.008952263626269996, 0.07924279986842964, -0.11819477591858674, -0.2594205500476213, 0.35111515901705903, -0.010341155084756177, 0.2154147881523681, 0.009461847775791949, 0.0651475266094093, -0.01666191150119679, -0.06512536399630434, 0.0759775904321892, -0.09514430670148884, 0.13259864354040474, 0.22690483114392673, 0.14633793039624957, 0.2612698878589514, -0.4044749798014055, -0.11662321746277755, 0.13376575143617653, 0.16914687855928237, 0.007061621399181014, 0.016223245470256015, -0.20702159654575628, 0.14084152533748262, -0.19859772153840577, -0.10684421315877321, -0.04957959651191895, 0.026720060529564885, 0.034051056825430005, -0.2951688199914438, 0.014330151786624983, 0.09892816144998211, 0.08889172453672399, -0.05293831945478765, -0.13631998873284287, -0.007706679222866188, 0.11036540778995668, 0.006877491626624219, -0.010775775362334743, 0.0749009697307908, -0.09291422685979538, -0.122223938901034, 0.40265360129745426, -0.04301140662495084, -0.24835073682982978, 0.17418135540257837, -0.15911371386460518, -0.13169645625355378, 0.06408632787359828, 0.08894534299552843, 0.09430960410689884, -0.11475396840958982, 0.13676486191862086, -0.044036883845094695, 0.10634088180204099, 0.08657724110132738, -0.005652830209205481, 0.1490116093667205, 0.05967369197389564, 0.07490731720384713, 0.11183286187588237, 0.0017338040791376418, -0.10894656490937278, -0.328233261844395, -0.22572112875373884, -0.16779042782916412, 0.07156594232602967, -0.1146074065962583, -0.2182220596618749, 0.3876991574180539, 0.07821979682518537, 0.22998614618051294, 0.03371117272842172, 0.2572360889721863, 0.14557285171404882, 0.08509105682055265, 0.06120837359324198, 0.15495700292238915, 0.1707767221645603, 0.03136504721211118, -0.13553743478798816, 0.08955113668737279, 0.07878777581248181]
|
1,803.0978
|
Quantum Entanglement in Deep Learning Architectures
|
Modern deep learning has enabled unprecedented achievements in various
domains. Nonetheless, employment of machine learning for wave function
representations is focused on more traditional architectures such as restricted
Boltzmann machines (RBMs) and fully-connected neural networks. In this letter,
we establish that contemporary deep learning architectures, in the form of deep
convolutional and recurrent networks, can efficiently represent highly
entangled quantum systems. By constructing Tensor Network equivalents of these
architectures, we identify an inherent reuse of information in the network
operation as a key trait which distinguishes them from standard Tensor Network
based representations, and which enhances their entanglement capacity. Our
results show that such architectures can support volume-law entanglement
scaling, polynomially more efficiently than presently employed RBMs. Thus,
beyond a quantification of the entanglement capacity of leading deep learning
architectures, our analysis formally motivates a shift of trending
neural-network based wave function representations closer to the
state-of-the-art in machine learning.
|
quant-ph cs.LG
|
modern deep learning has enabled unprecedented achievements in various domains nonetheless employment of machine learning for wave function representations is focused on more traditional architectures such as restricted boltzmann machines rbms and fullyconnected neural networks in this letter we establish that contemporary deep learning architectures in the form of deep convolutional and recurrent networks can efficiently represent highly entangled quantum systems by constructing tensor network equivalents of these architectures we identify an inherent reuse of information in the network operation as a key trait which distinguishes them from standard tensor network based representations and which enhances their entanglement capacity our results show that such architectures can support volumelaw entanglement scaling polynomially more efficiently than presently employed rbms thus beyond a quantification of the entanglement capacity of leading deep learning architectures our analysis formally motivates a shift of trending neuralnetwork based wave function representations closer to the stateoftheart in machine learning
|
[['modern', 'deep', 'learning', 'has', 'enabled', 'unprecedented', 'achievements', 'in', 'various', 'domains', 'nonetheless', 'employment', 'of', 'machine', 'learning', 'for', 'wave', 'function', 'representations', 'is', 'focused', 'on', 'more', 'traditional', 'architectures', 'such', 'as', 'restricted', 'boltzmann', 'machines', 'rbms', 'and', 'fullyconnected', 'neural', 'networks', 'in', 'this', 'letter', 'we', 'establish', 'that', 'contemporary', 'deep', 'learning', 'architectures', 'in', 'the', 'form', 'of', 'deep', 'convolutional', 'and', 'recurrent', 'networks', 'can', 'efficiently', 'represent', 'highly', 'entangled', 'quantum', 'systems', 'by', 'constructing', 'tensor', 'network', 'equivalents', 'of', 'these', 'architectures', 'we', 'identify', 'an', 'inherent', 'reuse', 'of', 'information', 'in', 'the', 'network', 'operation', 'as', 'a', 'key', 'trait', 'which', 'distinguishes', 'them', 'from', 'standard', 'tensor', 'network', 'based', 'representations', 'and', 'which', 'enhances', 'their', 'entanglement', 'capacity', 'our', 'results', 'show', 'that', 'such', 'architectures', 'can', 'support', 'volumelaw', 'entanglement', 'scaling', 'polynomially', 'more', 'efficiently', 'than', 'presently', 'employed', 'rbms', 'thus', 'beyond', 'a', 'quantification', 'of', 'the', 'entanglement', 'capacity', 'of', 'leading', 'deep', 'learning', 'architectures', 'our', 'analysis', 'formally', 'motivates', 'a', 'shift', 'of', 'trending', 'neuralnetwork', 'based', 'wave', 'function', 'representations', 'closer', 'to', 'the', 'stateoftheart', 'in', 'machine', 'learning']]
|
[-0.07675785479911913, 0.06126314050450067, -0.08147936426723996, 0.06917794331209734, -0.11264741226254651, -0.20837701585299026, 0.023212110814638434, 0.42061968316324055, -0.32209043864160775, -0.24825886107981204, 0.04342491719794149, -0.24527697701007128, -0.2471794358547777, 0.21236021197090546, -0.05591942656164368, 0.158018828202039, 0.11759769411602368, 0.04849092589536061, -0.09065223096249005, -0.2594796761808296, 0.3365184886924302, 0.03932251402953019, 0.40450760061542196, 0.010609802616139252, 0.10016480859582468, -0.023768251535172265, 0.016790273180231453, -0.04775292538960154, -0.044060367858522416, 0.24570023657443624, 0.33378257987322285, 0.22115495005001626, 0.364957978882206, -0.47018869218338905, -0.2873109199789663, 0.11312306413815046, 0.1950360545151246, 0.11758453713264316, 0.012756921541683066, -0.3087931388181945, 0.04058326349128038, -0.21299128748942167, 0.017282587854812542, -0.19950338465782502, -0.04036823488151034, -0.0005255328111040096, -0.223300054098169, 0.018170840322660902, 0.08084702597154925, 0.05454950029961765, -0.020074064700553815, -0.125806416105479, 0.056042190593822545, 0.12914458932665487, -0.04134593958539578, 0.060788089650838324, 0.13385360494876902, -0.24338818106955537, -0.178935471928368, 0.31332025612394016, -0.06018094422344196, -0.18982490334970256, 0.2224286543360601, -0.020208493058259287, -0.17184330593794583, 0.04880885326303542, 0.26198411744087935, 0.08172169069410301, -0.16728892321232705, 0.022215479462174698, -0.018183863822487184, 0.16766925803618504, 0.02617944313834111, 0.08804369832078617, 0.20745635156403297, 0.27713240368214126, 0.005115751574436824, 0.15509002146776765, -0.07828727843104086, -0.14025098798020433, -0.17038400461897255, -0.11865150293024877, -0.22613545638043434, 0.02823850831928818, -0.10515972765133483, -0.15265797413575152, 0.38827399620631087, 0.19718149008229374, 0.18331922594845915, 0.15631276012708745, 0.3131349444761872, 0.03619609197446456, 0.21958563524996863, 0.1521880429952095, 0.22072372258990072, 0.11483143536684413, 0.14871274436824022, -0.1503059500688687, 0.07960474224140247, 0.01884838751827677]
|
1,803.09781
|
Effective three-body interactions in Cs($6s$)-Cs($nd$) Rydberg trimers
|
Ultralong-range Rydberg trimer molecules are spectroscopically observed in an
ultracold gas of Cs($nd_{3/2}$) atoms. The atomic Rydberg state anisotropy
allows for the formation of angular trimer states, whose energies may not be
obtained from integer multiples of dimer energies. These nonadditive trimers
are predicted to coexist with Rydberg dimer lines. The existence of such
effective three-body interactions is confirmed with observation of asymmetric
line profiles and interpreted by a theoretical approach which includes
relativistic spin interactions. Simulations of the observed spectra with and
without angular trimer lines lends convincing support to the existence of
effective three-body interactions.
|
physics.atom-ph
|
ultralongrange rydberg trimer molecules are spectroscopically observed in an ultracold gas of csnd_32 atoms the atomic rydberg state anisotropy allows for the formation of angular trimer states whose energies may not be obtained from integer multiples of dimer energies these nonadditive trimers are predicted to coexist with rydberg dimer lines the existence of such effective threebody interactions is confirmed with observation of asymmetric line profiles and interpreted by a theoretical approach which includes relativistic spin interactions simulations of the observed spectra with and without angular trimer lines lends convincing support to the existence of effective threebody interactions
|
[['ultralongrange', 'rydberg', 'trimer', 'molecules', 'are', 'spectroscopically', 'observed', 'in', 'an', 'ultracold', 'gas', 'of', 'csnd_32', 'atoms', 'the', 'atomic', 'rydberg', 'state', 'anisotropy', 'allows', 'for', 'the', 'formation', 'of', 'angular', 'trimer', 'states', 'whose', 'energies', 'may', 'not', 'be', 'obtained', 'from', 'integer', 'multiples', 'of', 'dimer', 'energies', 'these', 'nonadditive', 'trimers', 'are', 'predicted', 'to', 'coexist', 'with', 'rydberg', 'dimer', 'lines', 'the', 'existence', 'of', 'such', 'effective', 'threebody', 'interactions', 'is', 'confirmed', 'with', 'observation', 'of', 'asymmetric', 'line', 'profiles', 'and', 'interpreted', 'by', 'a', 'theoretical', 'approach', 'which', 'includes', 'relativistic', 'spin', 'interactions', 'simulations', 'of', 'the', 'observed', 'spectra', 'with', 'and', 'without', 'angular', 'trimer', 'lines', 'lends', 'convincing', 'support', 'to', 'the', 'existence', 'of', 'effective', 'threebody', 'interactions']]
|
[-0.16561584387636685, 0.22792505156773282, -0.033096559718615026, 0.06821924436493039, 0.010614584976186356, -0.18905859131579442, 0.03323960070095685, 0.3956953634915408, -0.19116619517444633, -0.3147446460667804, -0.08616043881314302, -0.3006736452736429, -0.03122005895905507, 0.12898712690609196, 0.1473968848149525, 0.029003699717577547, 0.08763960855624948, -0.024979027402878273, -0.021887817082946032, -0.1879874603934392, 0.2981089465307984, 0.060160717825056054, 0.15537228675869605, 0.131016057789869, 0.03475967607422111, -0.021751079470656503, 0.08450758769079887, -0.033148921511989705, -0.17339801614677222, 0.13783977529662175, 0.2783163210357695, -0.021123663824255345, 0.13808339218424712, -0.4483592301645937, -0.1892405407076391, 0.06016599748788091, 0.2155436308918676, 0.22400894676078073, -0.03854888716402153, -0.345100430791111, -0.08056771714473143, -0.17554636835120618, -0.2087065953577015, -0.13990848654066212, 0.03752285199880134, 0.07592091497402483, -0.26612106105797767, 0.1376392721109975, 0.04888210778153734, 0.0949013630937164, -0.15378438884666443, -0.1418019951718937, -0.08420451512392901, 0.01699638469654019, -0.02634560991282342, -0.023543200200947467, 0.16638499693848038, -0.09968436262473308, -0.16232355273192903, 0.42744529469443177, -0.08214086619652032, -0.08307417466615637, 0.2348185248702066, -0.14534712949292347, -0.09361235455435235, 0.24860621008944386, 0.0832785975265627, 0.059192798881364674, -0.08009228747687303, 0.036110074988149186, -0.07746152931940742, 0.20351167495027767, 0.08487346033022429, 0.10140583166503347, 0.3208880640643959, 0.08709685210487805, -0.004485480938456021, 0.12835036349618653, -0.1322231188241858, -0.159909484461726, -0.20713491268300763, -0.0931028611309254, -0.2378429085268484, 0.03835227140871211, -0.012482374901386114, -0.14051298981454843, 0.3359759191904838, 0.027027360630503, 0.21175441603797177, -0.0317706690536094, 0.2150361276823484, 0.09175203008150372, 0.06623552229333048, 0.0018309458925311144, 0.2846783673545967, 0.1896154538965978, -0.003617629816289991, -0.3334966889257582, 0.04742072397493757, 0.030325096216984093]
|
1,803.09782
|
Variability search in M 31 using Principal Component Analysis and the
Hubble Source Catalog
|
Principal Component Analysis (PCA) is being extensively used in Astronomy but
not yet exhaustively exploited for variability search. The aim of this work is
to investigate the effectiveness of using the PCA as a method to search for
variable stars in large photometric data sets. We apply PCA to variability
indices computed for light curves of 18152 stars in three fields in M 31
extracted from the Hubble Source Catalogue. The projection of the data into the
principal components is used as a stellar variability detection and
classification tool, capable of distinguishing between RR Lyrae stars, long
period variables (LPVs) and non-variables. This projection recovered more than
90% of the known variables and revealed 38 previously unknown variable stars
(about 30% more), all LPVs except for one object of uncertain variability type.
We conclude that this methodology can indeed successfully identify candidate
variable stars.
|
astro-ph.IM astro-ph.GA astro-ph.SR
|
principal component analysis pca is being extensively used in astronomy but not yet exhaustively exploited for variability search the aim of this work is to investigate the effectiveness of using the pca as a method to search for variable stars in large photometric data sets we apply pca to variability indices computed for light curves of 18152 stars in three fields in m 31 extracted from the hubble source catalogue the projection of the data into the principal components is used as a stellar variability detection and classification tool capable of distinguishing between rr lyrae stars long period variables lpvs and nonvariables this projection recovered more than 90 of the known variables and revealed 38 previously unknown variable stars about 30 more all lpvs except for one object of uncertain variability type we conclude that this methodology can indeed successfully identify candidate variable stars
|
[['principal', 'component', 'analysis', 'pca', 'is', 'being', 'extensively', 'used', 'in', 'astronomy', 'but', 'not', 'yet', 'exhaustively', 'exploited', 'for', 'variability', 'search', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'investigate', 'the', 'effectiveness', 'of', 'using', 'the', 'pca', 'as', 'a', 'method', 'to', 'search', 'for', 'variable', 'stars', 'in', 'large', 'photometric', 'data', 'sets', 'we', 'apply', 'pca', 'to', 'variability', 'indices', 'computed', 'for', 'light', 'curves', 'of', '18152', 'stars', 'in', 'three', 'fields', 'in', 'm', '31', 'extracted', 'from', 'the', 'hubble', 'source', 'catalogue', 'the', 'projection', 'of', 'the', 'data', 'into', 'the', 'principal', 'components', 'is', 'used', 'as', 'a', 'stellar', 'variability', 'detection', 'and', 'classification', 'tool', 'capable', 'of', 'distinguishing', 'between', 'rr', 'lyrae', 'stars', 'long', 'period', 'variables', 'lpvs', 'and', 'nonvariables', 'this', 'projection', 'recovered', 'more', 'than', '90', 'of', 'the', 'known', 'variables', 'and', 'revealed', '38', 'previously', 'unknown', 'variable', 'stars', 'about', '30', 'more', 'all', 'lpvs', 'except', 'for', 'one', 'object', 'of', 'uncertain', 'variability', 'type', 'we', 'conclude', 'that', 'this', 'methodology', 'can', 'indeed', 'successfully', 'identify', 'candidate', 'variable', 'stars']]
|
[-0.05914894012096045, 0.059432678802225455, -0.11573257969718401, 0.13172556316053455, -0.12473337455177223, -0.11029442569397234, 0.08221518715934736, 0.3883500364902136, -0.2143865455971002, -0.3646674902158809, 0.1260429484707831, -0.27189770619339354, -0.08456123731965265, 0.2467287265857636, -0.07770058449188416, 0.028197602828853873, 0.07818797782350045, -0.00874851783411903, -0.0015427517457181341, -0.2891610600314774, 0.2605375602997683, -0.014029449408782738, 0.19102932179958879, -0.13628883968543756, 0.07911847109281152, -0.022286539905463587, -0.16327240756184508, -0.009739245301099507, -0.050312358728323826, 0.09544392099597498, 0.3033218414317556, 0.19348477580017978, 0.21713951470206616, -0.29691487489352847, -0.2284882616095401, 0.11829560798498431, 0.19933405186056152, 0.03551060144327112, 0.007078370996677623, -0.25561654882935375, 0.0701267116913129, -0.12448462274681021, -0.16163413542798244, -0.07462167010440693, 0.10313843942892092, 0.002763024677841605, -0.21155335341248063, 0.07773817107903648, 0.03913318643662297, 0.12741472136222765, -0.11962771798497053, -0.1536469250474568, -0.009810611781488348, 0.10954238595831749, 0.06881354950161625, 0.06828268545100113, 0.07884595944982517, -0.09556961229064509, -0.08119651140853554, 0.3948381713663156, -0.1120319267938612, -0.12078472641068738, 0.1929087869796928, -0.14445887814061, -0.22018846958367663, 0.11515673820150794, 0.17968010050212066, 0.17934631504659002, -0.24131846237094043, -0.03033244902051503, 0.0008260108126731185, 0.23706313944503118, 0.039809956104605346, 0.04217189288913058, 0.22931717570636656, 0.16026081055585112, 0.015582682049889818, 0.11812248874628278, -0.2637709873839171, -0.014655956435114978, -0.2526549625778701, -0.10256739183153202, -0.16561885095784323, 0.019847303937971624, -0.13068528624523798, -0.1404178878943716, 0.4138872802413844, 0.14702070006853216, 0.17314335012196244, 0.008501328157107964, 0.27666858657934035, 0.0454519340179053, 0.1217897357448644, 0.11848158216416523, 0.27772893625721856, 0.1918844859574928, 0.07827483291470713, -0.18329240433982463, 0.09421958531728471, 0.003217813262546604]
|
1,803.09783
|
Enhancing confidence in the detection of gravitational waves from
compact binaries using signal coherence
|
We show that gravitational-wave signals from compact binary mergers may be
better distinguished from instrumental noise transients by using Bayesian
models that look for signal coherence across a detector network. This can be
achieved even when the signal power is below the usual threshold for detection.
This method could reject the vast majority of noise transients, and therefore
increase sensitivity to weak gravitational waves. We demonstrate this using
simulated signals, as well as data for GW150914 and LVT151012. Finally, we
explore ways of incorporating our method into existing Advanced LIGO and Virgo
searches to make them significantly more powerful.
|
gr-qc astro-ph.HE physics.data-an
|
we show that gravitationalwave signals from compact binary mergers may be better distinguished from instrumental noise transients by using bayesian models that look for signal coherence across a detector network this can be achieved even when the signal power is below the usual threshold for detection this method could reject the vast majority of noise transients and therefore increase sensitivity to weak gravitational waves we demonstrate this using simulated signals as well as data for gw150914 and lvt151012 finally we explore ways of incorporating our method into existing advanced ligo and virgo searches to make them significantly more powerful
|
[['we', 'show', 'that', 'gravitationalwave', 'signals', 'from', 'compact', 'binary', 'mergers', 'may', 'be', 'better', 'distinguished', 'from', 'instrumental', 'noise', 'transients', 'by', 'using', 'bayesian', 'models', 'that', 'look', 'for', 'signal', 'coherence', 'across', 'a', 'detector', 'network', 'this', 'can', 'be', 'achieved', 'even', 'when', 'the', 'signal', 'power', 'is', 'below', 'the', 'usual', 'threshold', 'for', 'detection', 'this', 'method', 'could', 'reject', 'the', 'vast', 'majority', 'of', 'noise', 'transients', 'and', 'therefore', 'increase', 'sensitivity', 'to', 'weak', 'gravitational', 'waves', 'we', 'demonstrate', 'this', 'using', 'simulated', 'signals', 'as', 'well', 'as', 'data', 'for', 'gw150914', 'and', 'lvt151012', 'finally', 'we', 'explore', 'ways', 'of', 'incorporating', 'our', 'method', 'into', 'existing', 'advanced', 'ligo', 'and', 'virgo', 'searches', 'to', 'make', 'them', 'significantly', 'more', 'powerful']]
|
[-0.05555110489079409, 0.10177385432626863, -0.07677335448262065, 0.15135350043302156, -0.13007320015869958, -0.11591039074471954, 0.05558209355469003, 0.3839205129758803, -0.22845805010692488, -0.34445980778246216, 0.1162681247277016, -0.2906679765631755, -0.1751435080242127, 0.2924451671394924, -0.024507428423002964, 0.04154561077258691, 0.12716709798310102, -0.028152486450518623, -0.07828766236204014, -0.22333026115283972, 0.26851214272807344, 0.13335351932869113, 0.2250570779327642, -0.05456450832725474, 0.07828588605355095, 0.0005438542011137488, -0.05614894216955461, 0.012853794278473489, -0.0421052794108894, 0.02751319387438472, 0.33510996764126694, 0.23968511225298197, 0.22068341864235322, -0.42893611782729024, -0.27909005110650653, 0.15909388004755132, 0.13526483074846593, 0.1467583916747397, -0.07299654271804629, -0.39744613264720285, 0.13212662235824296, -0.2103675850620023, -0.06717203731996695, -0.08158283022166503, -0.008343688301704448, 0.05655927556176491, -0.25716983326569653, 0.1069528775741205, 0.07118859458267877, -0.05753711646780221, -0.03044424881932862, -0.09709875192258018, 0.030689191237806973, 0.07680576640760968, 0.027332074229953564, 0.049006043360515665, 0.16376031929100252, -0.140577308861821, -0.1413450749976692, 0.31801613168132425, -0.10700826389030695, -0.13897413300406752, 0.2109739806507761, -0.1604078997236987, -0.14465129465767831, 0.13521725516954455, 0.2155721223151142, 0.07871063066307794, -0.177456789140118, -0.037090350461611056, 0.08923146204853599, 0.23571775919484972, 0.0802347379539049, 0.0638425792485118, 0.29220839188142556, 0.1913700820572411, 0.08283031341911416, 0.1428443632685965, -0.19918178225840405, 0.040795039347927976, -0.23683612588016936, -0.07665745427154681, -0.1446894656354091, 0.05974777203377788, -0.08533524924544077, -0.07978946198191908, 0.3742231765569122, 0.22819161533749652, 0.144841338576034, 0.07317001198746519, 0.3547114832044551, 0.0977934618607502, 0.082195277325809, 0.03349513975865762, 0.352078347024743, 0.058603556382215836, 0.05652066677658245, -0.13594375181980808, 0.062311914170894656, -0.0625924796825557]
|
1,803.09784
|
Measurement of the Hall effect at nanoscale with three probes
|
The Hall effect and its varieties such as quantum, anomalous, and spin Hall
effects, provide indispensable tools for the characterization of electronic and
magnetic properties of materials, metrology, and spintronics. The conventional
four-probe Hall configuration is generally not amenable to measurements at
nanoscale, due to current shunting by the Hall electrodes. We demonstrate that
Hall measurements on the nanoscale can be facilitated by the three-probe Hall
configuration that avoids the shunting problem. We illustrate the efficiency of
the proposed approach with anomalous Hall effect-based measurements of
individual activation events during domain wall motion in magnetic films with
perpendicular anisotropy.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
the hall effect and its varieties such as quantum anomalous and spin hall effects provide indispensable tools for the characterization of electronic and magnetic properties of materials metrology and spintronics the conventional fourprobe hall configuration is generally not amenable to measurements at nanoscale due to current shunting by the hall electrodes we demonstrate that hall measurements on the nanoscale can be facilitated by the threeprobe hall configuration that avoids the shunting problem we illustrate the efficiency of the proposed approach with anomalous hall effectbased measurements of individual activation events during domain wall motion in magnetic films with perpendicular anisotropy
|
[['the', 'hall', 'effect', 'and', 'its', 'varieties', 'such', 'as', 'quantum', 'anomalous', 'and', 'spin', 'hall', 'effects', 'provide', 'indispensable', 'tools', 'for', 'the', 'characterization', 'of', 'electronic', 'and', 'magnetic', 'properties', 'of', 'materials', 'metrology', 'and', 'spintronics', 'the', 'conventional', 'fourprobe', 'hall', 'configuration', 'is', 'generally', 'not', 'amenable', 'to', 'measurements', 'at', 'nanoscale', 'due', 'to', 'current', 'shunting', 'by', 'the', 'hall', 'electrodes', 'we', 'demonstrate', 'that', 'hall', 'measurements', 'on', 'the', 'nanoscale', 'can', 'be', 'facilitated', 'by', 'the', 'threeprobe', 'hall', 'configuration', 'that', 'avoids', 'the', 'shunting', 'problem', 'we', 'illustrate', 'the', 'efficiency', 'of', 'the', 'proposed', 'approach', 'with', 'anomalous', 'hall', 'effectbased', 'measurements', 'of', 'individual', 'activation', 'events', 'during', 'domain', 'wall', 'motion', 'in', 'magnetic', 'films', 'with', 'perpendicular', 'anisotropy']]
|
[-0.15280772707596116, 0.20676344909648203, -0.04418894027987001, -0.042309156881540785, -0.09024393341277741, -0.1457306138116258, 0.027257064017657266, 0.3763164543565743, -0.3042702440324487, -0.3142857702677043, 0.05943025635645668, -0.2679190942827536, -0.18405853225184338, 0.2940993870724924, -0.024131931568857054, 0.07859560529813076, 0.0004096952152951639, -0.09224759957637894, -0.046202696477329094, -0.1815223638609774, 0.26813607668618156, 0.021950129702288126, 0.3512884761534669, 0.11135108566044696, 0.11575134346565726, 0.028630438008896853, 0.053233766838033894, 0.09554775677887457, -0.1247254348562244, 0.05093588759737774, 0.25544510000594417, -0.12443479325869405, 0.16904505838316922, -0.5116615181180592, -0.16635226578052556, -0.009068202474216898, 0.08458374396954872, 0.15394868463163777, -0.06407998529814031, -0.2962232444017213, 0.08240771002601832, -0.15248943325037098, -0.1008271019055261, -0.12809894907725405, 0.01981810904440603, -0.058178844662117105, -0.23328307487203606, 0.09117702375717308, 0.09255786950709488, 0.10824973601847887, -0.06452734847861931, -0.13779739806979743, -0.04432546075110381, 0.08776486254468256, 0.0015169193051109205, 0.018171953631336897, 0.25569487527506995, -0.18924531734035333, -0.26774139790700713, 0.3260606962199114, -0.013026323687399224, -0.170682392330194, 0.15772892370325875, -0.251351173216363, -0.04470746431081575, 0.11119935995951409, 0.1266562754326329, 0.07186424524561331, -0.12085448683961769, 0.0791969726418088, 0.028505775906449676, 0.09277998444705023, -0.0027264954940396913, 0.09602138115929401, 0.26773508484190217, 0.18546792477065202, 0.06543964684028558, 0.14982548622029587, -0.1716843877077977, 0.025481649161297446, -0.20913239085704696, -0.2176124090043714, -0.2314225356807286, 0.1196888472568018, -0.05382400429368076, -0.17064875412414002, 0.3668913450852341, 0.2256256175579085, 0.11227068393396175, -0.08335900416939843, 0.3381345427918191, 0.10924063951290232, 0.10605893044124301, 0.0099259576028479, 0.242077178426315, 0.2275310257991434, 0.1529772413409866, -0.3564788463135839, 0.12639612580972667, -0.0003352122362322953]
|
1,803.09785
|
Algorithm Configuration: Learning policies for the quick termination of
poor performers
|
One way to speed up the algorithm configuration task is to use short runs
instead of long runs as much as possible, but without discarding the
configurations that eventually do well on the long runs. We consider the
problem of selecting the top performing configurations of the Conditional
Markov Chain Search (CMCS), a general algorithm schema that includes, for
examples, VNS. We investigate how the structure of performance on short tests
links with those on long tests, showing that significant differences arise
between test domains. We propose a "performance envelope" method to exploit the
links; that learns when runs should be terminated, but that automatically
adapts to the domain.
|
cs.AI cs.DS
|
one way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible but without discarding the configurations that eventually do well on the long runs we consider the problem of selecting the top performing configurations of the conditional markov chain search cmcs a general algorithm schema that includes for examples vns we investigate how the structure of performance on short tests links with those on long tests showing that significant differences arise between test domains we propose a performance envelope method to exploit the links that learns when runs should be terminated but that automatically adapts to the domain
|
[['one', 'way', 'to', 'speed', 'up', 'the', 'algorithm', 'configuration', 'task', 'is', 'to', 'use', 'short', 'runs', 'instead', 'of', 'long', 'runs', 'as', 'much', 'as', 'possible', 'but', 'without', 'discarding', 'the', 'configurations', 'that', 'eventually', 'do', 'well', 'on', 'the', 'long', 'runs', 'we', 'consider', 'the', 'problem', 'of', 'selecting', 'the', 'top', 'performing', 'configurations', 'of', 'the', 'conditional', 'markov', 'chain', 'search', 'cmcs', 'a', 'general', 'algorithm', 'schema', 'that', 'includes', 'for', 'examples', 'vns', 'we', 'investigate', 'how', 'the', 'structure', 'of', 'performance', 'on', 'short', 'tests', 'links', 'with', 'those', 'on', 'long', 'tests', 'showing', 'that', 'significant', 'differences', 'arise', 'between', 'test', 'domains', 'we', 'propose', 'a', 'performance', 'envelope', 'method', 'to', 'exploit', 'the', 'links', 'that', 'learns', 'when', 'runs', 'should', 'be', 'terminated', 'but', 'that', 'automatically', 'adapts', 'to', 'the', 'domain']]
|
[-0.115988120107715, 0.07306893982437498, -0.0686145126691447, 0.09842645931121714, -0.11712795225988834, -0.15215333330726952, 0.08395020087509109, 0.45408231221617906, -0.2772702421318022, -0.33669810023675717, 0.11075242082032999, -0.22216959411295456, -0.13254633409808467, 0.21651371559576738, -0.044836920681794026, 0.025917456878366274, 0.13621496410032205, 0.023113108064910962, -0.08127462510564236, -0.2908799749352636, 0.2787848935898291, 0.07985354853161705, 0.2611747393640903, -0.015061290827878845, 0.11095240319878238, 0.018203129483506494, -0.02092818871413896, 0.01863073865208057, -0.0971337731200972, 0.05729943782052692, 0.2220340890151987, 0.18624229544619902, 0.2821752051886923, -0.4405046869069338, -0.16704896781080908, 0.11565355574626715, 0.12883994466872936, 0.15157612315763574, -0.0024937787701999514, -0.25676759178622055, 0.1199800535041087, -0.14490277439872776, -0.06803044869026187, -0.10192580059076736, -0.03374236189427042, 0.03202707060706725, -0.2602555723545791, 0.005747639716158561, 0.07937452282624131, -0.013006736342837914, 0.007729682257535671, -0.06978931403270316, 0.03554640552926159, 0.15968862348027876, 0.07952733773742418, 0.04079696322030841, 0.11785310424368727, -0.10958630262463943, -0.15449306261170348, 0.37487137064747855, -0.07015654519883864, -0.20305960117454785, 0.22920845212722454, -0.06409766686516344, -0.14996857348180145, 0.09929141319365403, 0.19424517688537957, 0.13252541980569446, -0.10808820855377109, 0.054742080044138046, -0.04766354622712376, 0.2016334317137547, 0.08138948332928463, 0.002277116789461173, 0.18557936358564628, 0.2030007876776193, 0.09183352446362991, 0.16232654176238034, -0.08979609396966567, -0.1251899240364389, -0.2802671978779889, -0.13231572073589531, -0.16747515081265651, -0.0006437965737091839, -0.05928518381738745, -0.16766053239960188, 0.39765433495471236, 0.19209413792711338, 0.2105497043374755, 0.11921100643967543, 0.289571382823067, 0.037936692730600546, 0.1005741542957108, 0.11477665987598427, 0.16736908456942903, 0.0263067879372302, 0.08642687988916087, -0.17846402962085442, 0.11107698804058067, 0.04246885107120994]
|
1,803.09786
|
Transferable Joint Attribute-Identity Deep Learning for Unsupervised
Person Re-Identification
|
Most existing person re-identification (re-id) methods require supervised
model learning from a separate large set of pairwise labelled training data for
every single camera pair. This significantly limits their scalability and
usability in real-world large scale deployments with the need for performing
re-id across many camera views. To address this scalability problem, we develop
a novel deep learning method for transferring the labelled information of an
existing dataset to a new unseen (unlabelled) target domain for person re-id
without any supervised learning in the target domain. Specifically, we
introduce an Transferable Joint Attribute-Identity Deep Learning (TJ-AIDL) for
simultaneously learning an attribute-semantic and identitydiscriminative
feature representation space transferrable to any new (unseen) target domain
for re-id tasks without the need for collecting new labelled training data from
the target domain (i.e. unsupervised learning in the target domain). Extensive
comparative evaluations validate the superiority of this new TJ-AIDL model for
unsupervised person re-id over a wide range of state-of-the-art methods on four
challenging benchmarks including VIPeR, PRID, Market-1501, and DukeMTMC-ReID.
|
cs.CV
|
most existing person reidentification reid methods require supervised model learning from a separate large set of pairwise labelled training data for every single camera pair this significantly limits their scalability and usability in realworld large scale deployments with the need for performing reid across many camera views to address this scalability problem we develop a novel deep learning method for transferring the labelled information of an existing dataset to a new unseen unlabelled target domain for person reid without any supervised learning in the target domain specifically we introduce an transferable joint attributeidentity deep learning tjaidl for simultaneously learning an attributesemantic and identitydiscriminative feature representation space transferrable to any new unseen target domain for reid tasks without the need for collecting new labelled training data from the target domain ie unsupervised learning in the target domain extensive comparative evaluations validate the superiority of this new tjaidl model for unsupervised person reid over a wide range of stateoftheart methods on four challenging benchmarks including viper prid market1501 and dukemtmcreid
|
[['most', 'existing', 'person', 'reidentification', 'reid', 'methods', 'require', 'supervised', 'model', 'learning', 'from', 'a', 'separate', 'large', 'set', 'of', 'pairwise', 'labelled', 'training', 'data', 'for', 'every', 'single', 'camera', 'pair', 'this', 'significantly', 'limits', 'their', 'scalability', 'and', 'usability', 'in', 'realworld', 'large', 'scale', 'deployments', 'with', 'the', 'need', 'for', 'performing', 'reid', 'across', 'many', 'camera', 'views', 'to', 'address', 'this', 'scalability', 'problem', 'we', 'develop', 'a', 'novel', 'deep', 'learning', 'method', 'for', 'transferring', 'the', 'labelled', 'information', 'of', 'an', 'existing', 'dataset', 'to', 'a', 'new', 'unseen', 'unlabelled', 'target', 'domain', 'for', 'person', 'reid', 'without', 'any', 'supervised', 'learning', 'in', 'the', 'target', 'domain', 'specifically', 'we', 'introduce', 'an', 'transferable', 'joint', 'attributeidentity', 'deep', 'learning', 'tjaidl', 'for', 'simultaneously', 'learning', 'an', 'attributesemantic', 'and', 'identitydiscriminative', 'feature', 'representation', 'space', 'transferrable', 'to', 'any', 'new', 'unseen', 'target', 'domain', 'for', 'reid', 'tasks', 'without', 'the', 'need', 'for', 'collecting', 'new', 'labelled', 'training', 'data', 'from', 'the', 'target', 'domain', 'ie', 'unsupervised', 'learning', 'in', 'the', 'target', 'domain', 'extensive', 'comparative', 'evaluations', 'validate', 'the', 'superiority', 'of', 'this', 'new', 'tjaidl', 'model', 'for', 'unsupervised', 'person', 'reid', 'over', 'a', 'wide', 'range', 'of', 'stateoftheart', 'methods', 'on', 'four', 'challenging', 'benchmarks', 'including', 'viper', 'prid', 'market1501', 'and', 'dukemtmcreid']]
|
[-0.006419412367045165, -0.06152200674899908, -0.023156125686971323, 0.017545185450027395, -0.17389795050293527, -0.22388442104790884, 0.03018253275758924, 0.4631487168143132, -0.2435311891654209, -0.3887839509471337, 0.02766775015093089, -0.2702090153699181, -0.09283923530848297, 0.22121790872795358, -0.1831241006001636, 0.11344059252400134, 0.21081699603494325, 0.023159897289855944, -0.07701637041383634, -0.30993341657038825, 0.34961682600821564, -0.05229890401128028, 0.3802221872918079, 0.040307117700348234, 0.17054947525222838, 0.003690918448289708, -0.03924909282469996, -0.03134304787411906, -0.03422338265691387, 0.20325085692796171, 0.3865959735564385, 0.2719901353320781, 0.35814332604362553, -0.3388067103622044, -0.23459872000770746, 0.13742086588993577, 0.15122720890284225, 0.1288933775707668, -0.06593554708221071, -0.44710389872658657, 0.06431160098444556, -0.1789171273757252, 0.06349490214270637, -0.17624054887714835, -0.021294761951898503, -0.057172224148422296, -0.3244188564366724, -0.009660995999591117, 0.06386007295430073, 0.12362405868030034, -0.08038244002992916, -0.12391884307851272, 0.10443928151140047, 0.217366319926787, 0.013732772780456608, 0.07220761731346967, 0.09821067178197651, -0.2727391817821247, -0.14658865583789152, 0.33704548053717687, -0.0466754591660974, -0.23144795583343944, 0.25115346726161525, 0.007486588025945553, -0.1727070705922309, 0.10789314546605196, 0.26103202250151913, 0.19824563031101977, -0.19411242228755557, 0.039162336050552755, -0.09643313007006434, 0.17016069463059946, 0.05461943707217468, -0.06706380574146938, 0.17498322438657216, 0.30832454196514525, 0.053575802742620714, 0.11557596094729207, -0.20097676266207606, -0.054350553176857164, -0.20071090555584137, -0.0650034219160836, -0.23682351087282863, -0.0659354029143332, -0.1370664502582777, -0.1408438310769895, 0.37839529003685146, 0.2606535247652763, 0.2255905058314921, 0.13167809589428148, 0.36112659591381535, -0.08664844487856237, 0.14087464646550546, 0.10343686442113727, 0.12999702195002716, -0.09888012279853499, 0.15288480023776346, -0.17544312542304397, 0.030846164827492157, 0.012000535551938543]
|
1,803.09787
|
An orbit model for the spectra of nilpotent Gelfand pairs
|
Let $N$ be a connected and simply connected nilpotent Lie group, and let $K$
be a subgroup of the automorphism group of $N$. We say that the pair $(K,N)$ is
a nilpotent Gelfand pair if $L^1_K(N)$ is an abelian algebra under convolution.
In this document we establish a geometric model for the Gelfand spectra of
nilpotent Gelfand pairs $(K,N)$ where the $K$-orbits in the center of $N$ have
a one-parameter cross section and satisfy a certain non-degeneracy condition.
More specifically, we show that the one-to-one correspondence between the set
$\Delta(K,N)$ of bounded $K$-spherical functions on $N$ and the set
$\mathcal{A}(K,N)$ of $K$-orbits in the dual $\mathfrak{n}^*$ of the Lie
algebra for $N$ established by Benson and Ratcliff is a homeomorphism for this
class of nilpotent Gelfand pairs. This result had previously been shown for $N$
a free group and $N$ a Heisenberg group, and was conjectured to hold for all
nilpotent Gelfand pairs.
|
math.RT
|
let n be a connected and simply connected nilpotent lie group and let k be a subgroup of the automorphism group of n we say that the pair kn is a nilpotent gelfand pair if l1_kn is an abelian algebra under convolution in this document we establish a geometric model for the gelfand spectra of nilpotent gelfand pairs kn where the korbits in the center of n have a oneparameter cross section and satisfy a certain nondegeneracy condition more specifically we show that the onetoone correspondence between the set deltakn of bounded kspherical functions on n and the set mathcalakn of korbits in the dual mathfrakn of the lie algebra for n established by benson and ratcliff is a homeomorphism for this class of nilpotent gelfand pairs this result had previously been shown for n a free group and n a heisenberg group and was conjectured to hold for all nilpotent gelfand pairs
|
[['let', 'n', 'be', 'a', 'connected', 'and', 'simply', 'connected', 'nilpotent', 'lie', 'group', 'and', 'let', 'k', 'be', 'a', 'subgroup', 'of', 'the', 'automorphism', 'group', 'of', 'n', 'we', 'say', 'that', 'the', 'pair', 'kn', 'is', 'a', 'nilpotent', 'gelfand', 'pair', 'if', 'l1_kn', 'is', 'an', 'abelian', 'algebra', 'under', 'convolution', 'in', 'this', 'document', 'we', 'establish', 'a', 'geometric', 'model', 'for', 'the', 'gelfand', 'spectra', 'of', 'nilpotent', 'gelfand', 'pairs', 'kn', 'where', 'the', 'korbits', 'in', 'the', 'center', 'of', 'n', 'have', 'a', 'oneparameter', 'cross', 'section', 'and', 'satisfy', 'a', 'certain', 'nondegeneracy', 'condition', 'more', 'specifically', 'we', 'show', 'that', 'the', 'onetoone', 'correspondence', 'between', 'the', 'set', 'deltakn', 'of', 'bounded', 'kspherical', 'functions', 'on', 'n', 'and', 'the', 'set', 'mathcalakn', 'of', 'korbits', 'in', 'the', 'dual', 'mathfrakn', 'of', 'the', 'lie', 'algebra', 'for', 'n', 'established', 'by', 'benson', 'and', 'ratcliff', 'is', 'a', 'homeomorphism', 'for', 'this', 'class', 'of', 'nilpotent', 'gelfand', 'pairs', 'this', 'result', 'had', 'previously', 'been', 'shown', 'for', 'n', 'a', 'free', 'group', 'and', 'n', 'a', 'heisenberg', 'group', 'and', 'was', 'conjectured', 'to', 'hold', 'for', 'all', 'nilpotent', 'gelfand', 'pairs']]
|
[-0.1807938110382475, 0.12028603720879999, -0.07942641139090592, 0.05780286905016528, -0.10946349828929597, -0.16305379345334622, 0.008096313757809582, 0.34563969903847586, -0.28526776283979416, -0.20487467617175037, 0.03781855177051011, -0.281392501932353, -0.08855651539676385, 0.1838871520490614, -0.10529223652494861, -0.04714422918384315, 0.045106895597164354, 0.17419933141610086, -0.0685136417645517, -0.27979387241779574, 0.3920603083224585, -0.0852714916382799, 0.2179112950654466, 0.02937454927831407, 0.10670067719954825, 0.042046376874065955, 0.02296971906877018, -0.04339476586905438, -0.11048041613179256, 0.10407970919711701, 0.30253765666672333, 0.07318527952286828, 0.21141449814131916, -0.3365071282432174, -0.12269560744159466, 0.24925190173336212, 0.18178790023192665, -0.04741219018851191, -0.04752125064906007, -0.28183080870288096, 0.1562504531901996, -0.21185420705190558, -0.13904864543629503, -0.004762914062582499, 0.14409156842157245, -0.01332971557900803, -0.2988355069125182, -0.01659333859477809, 0.12337800962172005, 0.10011012644340463, -0.02663154071212333, -0.05513671197512554, -0.08391282421579918, 0.0667663057294631, -0.06824497625598722, 0.037687119768796774, 0.0474103595244248, -0.021329412855121573, -0.11743667070516416, 0.38105949544847406, -0.02920321072605963, -0.21703948509194795, 0.09922815410771857, -0.20346885375040183, -0.18228041399917905, 0.10261484274381635, 0.06471589712167022, 0.18326087411190845, -0.07713088111347513, 0.2403914473849867, -0.2054483431348244, 0.05534883529034178, 0.10091901985027932, -0.022275361522341407, 0.10404320468274963, 0.10260507078927676, 0.07917863268263342, 0.10499830949675316, 0.061634942249314775, 0.04477890772708007, -0.37691269937705324, -0.18413951060124087, -0.1443541133676082, 0.1448158077843216, -0.09097555232789778, -0.12679232280783892, 0.3593865924372973, 0.0410998469520829, 0.2159813369087727, 0.12096785811787558, 0.14594671897442135, 0.07732185157226393, 0.07354873666903683, 0.11690123077938396, 0.10059918000652696, 0.26647388052953935, -0.10464836915165482, -0.1670376375003021, -0.06446677272204951, 0.23830795948289948]
|
1,803.09788
|
Highly entangled tensors
|
A geometric measure for the entanglement of a unit length tensor $T \in
(\mathbb{C}^n)^{\otimes k}$ is given by $- 2 \log_2 ||T||_\sigma$, where
$||.||_\sigma$ denotes the spectral norm. A simple induction gives an upper
bound of $(k-1) \log_2(n)$ for the entanglement. We show the existence of
tensors with entanglement larger than $k \log_2(n) - \log_2(k) - o(\log_2(k))$.
Friedland and Kemp have similar results in the case of symmetric tensors. Our
techniques give improvements in this case.
|
math.OC math.NA
|
a geometric measure for the entanglement of a unit length tensor t in mathbbcnotimes k is given by 2 log_2 t_sigma where _sigma denotes the spectral norm a simple induction gives an upper bound of k1 log_2n for the entanglement we show the existence of tensors with entanglement larger than k log_2n log_2k olog_2k friedland and kemp have similar results in the case of symmetric tensors our techniques give improvements in this case
|
[['a', 'geometric', 'measure', 'for', 'the', 'entanglement', 'of', 'a', 'unit', 'length', 'tensor', 't', 'in', 'mathbbcnotimes', 'k', 'is', 'given', 'by', '2', 'log_2', 't_sigma', 'where', '_sigma', 'denotes', 'the', 'spectral', 'norm', 'a', 'simple', 'induction', 'gives', 'an', 'upper', 'bound', 'of', 'k1', 'log_2n', 'for', 'the', 'entanglement', 'we', 'show', 'the', 'existence', 'of', 'tensors', 'with', 'entanglement', 'larger', 'than', 'k', 'log_2n', 'log_2k', 'olog_2k', 'friedland', 'and', 'kemp', 'have', 'similar', 'results', 'in', 'the', 'case', 'of', 'symmetric', 'tensors', 'our', 'techniques', 'give', 'improvements', 'in', 'this', 'case']]
|
[-0.17162548307290612, 0.15702484806327752, -0.04964001394344248, 0.02021342795342207, -0.0010319195587524315, -0.16222237069289097, 0.011366286560789578, 0.28198493213858455, -0.2006993016693741, -0.24323608717855272, 0.07542905608069203, -0.3144558047513581, -0.1046331982425828, 0.166801495412882, -0.043416451352337994, -0.001769251578177015, -0.002681908488739282, 0.14530819988188645, -0.09867877905101825, -0.2814965336066153, 0.2685516440671765, 0.02586681085328261, 0.21944845207164893, 0.09926087097038463, 0.06299528409403542, -0.007129268002851556, 0.02244685902648295, -0.023580535573677883, -0.22078993149463916, 0.12699754679730782, 0.23962624386250456, 0.14552125945273373, 0.2309299870652871, -0.3619580831533919, -0.14961738402618924, 0.1561066910572764, 0.09986847928181912, 0.04303026290532822, 0.00943372875917703, -0.22042700590746891, 0.13196847602375783, -0.13123398285824805, -0.08638163161877957, -0.059556082615421876, 0.11507309049678345, -0.06430192011369702, -0.320176438609552, 0.10171624068688187, 0.16473189507248914, 0.0871256770167545, -0.0359715698286891, -0.1930696811630494, 0.05329810107165637, 0.06766909159745814, -0.030589039738212403, 0.06628708833078337, 0.025854498555418104, -0.07722311187212148, -0.1441233492611597, 0.31474521392697674, -0.11544567847259815, -0.18327901488454598, 0.08606007036157987, -0.15483804838085133, -0.1246410710349058, 0.09416289145721951, 0.08499270641348428, 0.18667743688759705, -0.032862714944510825, 0.16345483195214505, -0.12200305623830193, 0.15377103281692447, 0.11981059996307725, 0.059525134860046416, 0.054643450744657054, 0.0787987828371115, 0.14479810436346774, 0.2125860070195308, -0.023781247766843688, -0.011161728865570493, -0.31620444626443917, -0.2107057489217065, -0.23540913075622585, 0.12186417657519794, -0.191215048809075, -0.10344330813839203, 0.34199593164440656, 0.06999973206418669, 0.23556976549459957, 0.13692458685060652, 0.23927372109351885, 0.10608718435752154, 0.06490112111754974, 0.1483916666281099, 0.1851267049253996, 0.20308821327408724, 0.034852725736628704, -0.20471114071713398, 0.021723791788746085, 0.12694428778356975]
|
1,803.09789
|
On Chatbots Exhibiting Goal-Directed Autonomy in Dynamic Environments
|
Conversation interfaces (CIs), or chatbots, are a popular form of intelligent
agents that engage humans in task-oriented or informal conversation. In this
position paper and demonstration, we argue that chatbots working in dynamic
environments, like with sensor data, can not only serve as a promising platform
to research issues at the intersection of learning, reasoning, representation
and execution for goal-directed autonomy; but also handle non-trivial business
applications. We explore the underlying issues in the context of Water Advisor,
a preliminary multi-modal conversation system that can access and explain water
quality data.
|
cs.AI
|
conversation interfaces cis or chatbots are a popular form of intelligent agents that engage humans in taskoriented or informal conversation in this position paper and demonstration we argue that chatbots working in dynamic environments like with sensor data can not only serve as a promising platform to research issues at the intersection of learning reasoning representation and execution for goaldirected autonomy but also handle nontrivial business applications we explore the underlying issues in the context of water advisor a preliminary multimodal conversation system that can access and explain water quality data
|
[['conversation', 'interfaces', 'cis', 'or', 'chatbots', 'are', 'a', 'popular', 'form', 'of', 'intelligent', 'agents', 'that', 'engage', 'humans', 'in', 'taskoriented', 'or', 'informal', 'conversation', 'in', 'this', 'position', 'paper', 'and', 'demonstration', 'we', 'argue', 'that', 'chatbots', 'working', 'in', 'dynamic', 'environments', 'like', 'with', 'sensor', 'data', 'can', 'not', 'only', 'serve', 'as', 'a', 'promising', 'platform', 'to', 'research', 'issues', 'at', 'the', 'intersection', 'of', 'learning', 'reasoning', 'representation', 'and', 'execution', 'for', 'goaldirected', 'autonomy', 'but', 'also', 'handle', 'nontrivial', 'business', 'applications', 'we', 'explore', 'the', 'underlying', 'issues', 'in', 'the', 'context', 'of', 'water', 'advisor', 'a', 'preliminary', 'multimodal', 'conversation', 'system', 'that', 'can', 'access', 'and', 'explain', 'water', 'quality', 'data']]
|
[-0.11516858379556132, 0.06482525566940779, -0.069813735941732, 0.10336679948434992, -0.20832798963637797, -0.21292818395502783, 0.05813935369503899, 0.456745765038899, -0.24368270850934826, -0.3386968198631491, 0.08698977724966275, -0.28531854513490185, -0.1998223298290683, 0.16154981177085295, -0.16865268577872725, 0.02962478320881888, 0.10755887215158769, 0.04668658410690234, 0.034048232288294275, -0.23668934482119078, 0.2782459654384753, 0.0253391397687105, 0.3253531937006411, 0.08216536826976054, 0.09368558391764924, 0.006209687183989765, 0.0011811070323276978, -0.03361794122259368, -0.04845117373450513, 0.16587210072020253, 0.4470047847173371, 0.22252328310079955, 0.3855371695462164, -0.47499755581656655, -0.1965104622029505, 0.05747508898295544, 0.15056515726066388, 0.0659223670794905, -0.050045267064738407, -0.35363837816639915, 0.043314326621059863, -0.2217240441017426, -0.08188451265732011, -0.1293607464971361, -0.018078386335848615, 0.006894573594883576, -0.24021401161399597, -0.05347302244562952, 0.08946097974326771, 0.13009708029842312, -0.046662352759145445, -0.051872026649876855, 0.028309440317021293, 0.2006048032819488, 0.02742263123106498, 0.020792390700879987, 0.209436820625522, -0.20655232683018587, -0.18918147211853456, 0.4056435176222534, 0.007135798236109562, -0.1777929344347545, 0.23022395987473018, -0.042347074598892705, -0.19667349756275723, 0.01691481934676131, 0.2768410840532282, 0.07187128232044915, -0.19697773028267446, -0.004773412853515206, 0.0035772445806107676, 0.18908663389815406, 0.05662896051736815, 0.01599946261782092, 0.25135100618066203, 0.2527049935658227, 0.060639001889625094, 0.06568141343010651, 0.03191833582880733, -0.10676891669876627, -0.21590037052366104, -0.17752484959846998, -0.14184784424583335, -0.016271591173570635, -0.03691773137009247, -0.12683812462325608, 0.33552269642445987, 0.2394970018866953, 0.12275471476387682, 0.03934011243157099, 0.3326039751326399, -0.0098385531979787, 0.07900793123529753, 0.10634912988478011, 0.12184241750267344, -0.0877818011443366, 0.2501177608884953, -0.13550604971964936, 0.144476217742252, -0.04077248952791586]
|
1,803.0979
|
On the first Robin eigenvalue of a class of anisotropic operators
|
The paper is devoted to the study of some properties of the first eigenvalue
of the anisotropic $p$-Laplace operator with Robin boundary condition involving
a function $\beta$ which in general is not constant. In particular we obtain
sharp lower bounds in terms of the measure of the domain and we prove a
monotonicity property of the eigenvalue with respect the set inclusion.
|
math.AP
|
the paper is devoted to the study of some properties of the first eigenvalue of the anisotropic plaplace operator with robin boundary condition involving a function beta which in general is not constant in particular we obtain sharp lower bounds in terms of the measure of the domain and we prove a monotonicity property of the eigenvalue with respect the set inclusion
|
[['the', 'paper', 'is', 'devoted', 'to', 'the', 'study', 'of', 'some', 'properties', 'of', 'the', 'first', 'eigenvalue', 'of', 'the', 'anisotropic', 'plaplace', 'operator', 'with', 'robin', 'boundary', 'condition', 'involving', 'a', 'function', 'beta', 'which', 'in', 'general', 'is', 'not', 'constant', 'in', 'particular', 'we', 'obtain', 'sharp', 'lower', 'bounds', 'in', 'terms', 'of', 'the', 'measure', 'of', 'the', 'domain', 'and', 'we', 'prove', 'a', 'monotonicity', 'property', 'of', 'the', 'eigenvalue', 'with', 'respect', 'the', 'set', 'inclusion']]
|
[-0.12862966004233325, 0.052092420012359655, -0.07372532564125234, 0.02982123262594424, -0.10166862964509957, -0.09096818596064564, -0.010747177434349131, 0.3003519844383963, -0.27200009691859445, -0.2461942846468094, 0.15588552936828964, -0.28846300507505096, -0.14676841005923286, 0.16017093815870823, -0.06362266559153795, 0.09962435153823707, 0.059427117718563925, 0.09999608518856187, -0.09792466111661445, -0.18142179174408798, 0.4266194370124609, -0.016197983806412065, 0.21717448044388044, 0.14326897206445854, 0.042393295222052166, -0.04418070262838756, -0.018068920655716813, 0.01095712202931604, -0.22894767650793638, 0.1426150954043072, 0.17093608993285847, 0.049786331038171004, 0.3086995285214676, -0.3865020374256757, -0.1417430544181937, 0.18515819224018243, 0.0868587157418651, 0.021953033213879192, -0.01819471841219873, -0.24894961747791497, 0.11052211181771371, -0.08312712898177485, -0.1978443759087954, -0.009886780798795724, -0.016898557641393235, 0.04060776534325053, -0.3368542928684263, 0.11812941681954169, 0.119595555768859, 0.02627277555274627, -0.11401857357592352, -0.1039584674816128, 0.0368808769778679, 0.08032114619779732, 0.08153928229735503, 0.0016933294227196565, 0.0021526261998881255, -0.13092280002010445, -0.0517039118323385, 0.37164205894054425, -0.10498852785977145, -0.26679110833473746, 0.11612061975193361, -0.21839828068210232, -0.13917520761700167, 0.040272301363368186, 0.15550068080905946, 0.18485085098373313, -0.1481663004435118, 0.16026779412828956, -0.06717623917258254, 0.10852442612691272, 0.08571810682394332, 0.06526119270711206, 0.04512845233623539, 0.11405369904898707, 0.1979800448452513, 0.22869560463474162, -0.010149589217748613, -0.07021477400520516, -0.37391475733790186, -0.2039405867708997, -0.19922634796990502, 0.04615290248564692, -0.12472407377842296, -0.24394794373074546, 0.41785250072397534, 0.0843538899695681, 0.21541987937469517, 0.0932154317044713, 0.22053155789692555, 0.20799049140060238, 0.00781808873721128, 0.07146599820454515, 0.21512914696312133, 0.19057805147097115, 0.08149896329268813, -0.237965946581455, 0.07781053886132976, 0.12871375420100747]
|
1,803.09791
|
A Common Framework for Natural Gradient and Taylor based Optimisation
using Manifold Theory
|
This technical report constructs a theoretical framework to relate standard
Taylor approximation based optimisation methods with Natural Gradient (NG), a
method which is Fisher efficient with probabilistic models. Such a framework
will be shown to also provide mathematical justification to combine higher
order methods with the method of NG.
|
cs.LG stat.ML
|
this technical report constructs a theoretical framework to relate standard taylor approximation based optimisation methods with natural gradient ng a method which is fisher efficient with probabilistic models such a framework will be shown to also provide mathematical justification to combine higher order methods with the method of ng
|
[['this', 'technical', 'report', 'constructs', 'a', 'theoretical', 'framework', 'to', 'relate', 'standard', 'taylor', 'approximation', 'based', 'optimisation', 'methods', 'with', 'natural', 'gradient', 'ng', 'a', 'method', 'which', 'is', 'fisher', 'efficient', 'with', 'probabilistic', 'models', 'such', 'a', 'framework', 'will', 'be', 'shown', 'to', 'also', 'provide', 'mathematical', 'justification', 'to', 'combine', 'higher', 'order', 'methods', 'with', 'the', 'method', 'of', 'ng']]
|
[0.020612111469559675, -0.011416069174907645, -0.18729728648477062, 0.08670420874366347, -0.1514352535334777, -0.1484554274748935, 0.032467895092404615, 0.36524067984950936, -0.2534262519709918, -0.33574327187878744, 0.07094309032343481, -0.17454286171503516, -0.22740377999405015, 0.19340823794125903, -0.0821138124969997, 0.08609733688740098, 0.07322776367013552, 0.017570078026679134, -0.08870499430946549, -0.2517720260752403, 0.2142340161752108, 0.08717264415582224, 0.3114486375671564, 0.0214231833435443, 0.12477996943480506, -0.08272685466942434, -0.05062928880393809, 0.04216918512722667, -0.15356474793611133, 0.2527722572451647, 0.2498321097071089, 0.16662343808126692, 0.3536866435743108, -0.4224884781074159, -0.23871475081814794, 0.06286190621250747, 0.10968432737020206, 0.16436016799796524, -0.019651624611673916, -0.2674921961235149, 0.1084755453262098, -0.17898120043077032, -0.09835425428856089, -0.21746310316102238, -0.04747484690908875, 0.006947725441078751, -0.34079906849988867, 0.06766049561449516, 0.07400453531620454, 0.047427674983533064, 0.018837276190443307, -0.165182232058474, 0.06376008894674633, 0.005741750156240804, 0.028240093823560342, 0.045505905894524586, 0.07036632864869066, -0.04590000166101571, -0.19909718236885965, 0.39298797801745183, -0.12503660330786465, -0.23211620618798295, 0.17732134743175487, -0.044877399196278075, -0.18040607981763931, 0.08960252158267766, 0.1826287423621635, 0.13053644117804206, -0.15589217195401386, 0.08015450872290804, 0.004771205995764051, 0.16312451508580422, -0.010135462051447558, -0.020208976773203026, 0.16454238544351288, 0.20992674334544917, 0.09164884025040938, 0.10088383211345621, -0.011820912560714143, -0.08786070576811932, -0.28951931197424324, -0.14217340864469202, -0.12074001055514934, 0.002843925239974443, -0.05903318967214044, -0.21478977159071921, 0.3500293555612467, 0.24162050015388095, 0.17767719909244653, 0.10204287861445349, 0.3662541171877968, 0.15501222812703677, 0.01720151506668451, 0.06967504032678445, 0.20747259789151234, 0.17261887046660543, 0.0666031967088276, -0.11798036928117579, 0.017285070828713323, 0.1458131883445443]
|
1,803.09792
|
Min-Max Tours for Task Allocation to Heterogeneous Agents
|
We consider a scenario consisting of a set of heterogeneous mobile agents
located at a depot, and a set of tasks dispersed over a geographic area. The
agents are partitioned into different types. The tasks are partitioned into
specialized tasks that can only be done by agents of a certain type, and
generic tasks that can be done by any agent. The distances between each pair of
tasks are specified, and satisfy the triangle inequality. Given this scenario,
we address the problem of allocating these tasks among the available agents
(subject to type compatibility constraints) while minimizing the maximum cost
to tour the allocation by any agent and return to the depot. This problem is
NP-hard, and we give a three phase algorithm to solve this problem that
provides 5-factor approximation, regardless of the total number of agents and
the number of agents of each type. We also show that in the special case where
there is only one agent of each type, the algorithm has an approximation factor
of 4.
|
cs.MA cs.RO cs.SY
|
we consider a scenario consisting of a set of heterogeneous mobile agents located at a depot and a set of tasks dispersed over a geographic area the agents are partitioned into different types the tasks are partitioned into specialized tasks that can only be done by agents of a certain type and generic tasks that can be done by any agent the distances between each pair of tasks are specified and satisfy the triangle inequality given this scenario we address the problem of allocating these tasks among the available agents subject to type compatibility constraints while minimizing the maximum cost to tour the allocation by any agent and return to the depot this problem is nphard and we give a three phase algorithm to solve this problem that provides 5factor approximation regardless of the total number of agents and the number of agents of each type we also show that in the special case where there is only one agent of each type the algorithm has an approximation factor of 4
|
[['we', 'consider', 'a', 'scenario', 'consisting', 'of', 'a', 'set', 'of', 'heterogeneous', 'mobile', 'agents', 'located', 'at', 'a', 'depot', 'and', 'a', 'set', 'of', 'tasks', 'dispersed', 'over', 'a', 'geographic', 'area', 'the', 'agents', 'are', 'partitioned', 'into', 'different', 'types', 'the', 'tasks', 'are', 'partitioned', 'into', 'specialized', 'tasks', 'that', 'can', 'only', 'be', 'done', 'by', 'agents', 'of', 'a', 'certain', 'type', 'and', 'generic', 'tasks', 'that', 'can', 'be', 'done', 'by', 'any', 'agent', 'the', 'distances', 'between', 'each', 'pair', 'of', 'tasks', 'are', 'specified', 'and', 'satisfy', 'the', 'triangle', 'inequality', 'given', 'this', 'scenario', 'we', 'address', 'the', 'problem', 'of', 'allocating', 'these', 'tasks', 'among', 'the', 'available', 'agents', 'subject', 'to', 'type', 'compatibility', 'constraints', 'while', 'minimizing', 'the', 'maximum', 'cost', 'to', 'tour', 'the', 'allocation', 'by', 'any', 'agent', 'and', 'return', 'to', 'the', 'depot', 'this', 'problem', 'is', 'nphard', 'and', 'we', 'give', 'a', 'three', 'phase', 'algorithm', 'to', 'solve', 'this', 'problem', 'that', 'provides', '5factor', 'approximation', 'regardless', 'of', 'the', 'total', 'number', 'of', 'agents', 'and', 'the', 'number', 'of', 'agents', 'of', 'each', 'type', 'we', 'also', 'show', 'that', 'in', 'the', 'special', 'case', 'where', 'there', 'is', 'only', 'one', 'agent', 'of', 'each', 'type', 'the', 'algorithm', 'has', 'an', 'approximation', 'factor', 'of', '4']]
|
[-0.17189909198924022, 0.06404133387918323, -0.03481609305805143, 0.018966597087873037, -0.07968146476264605, -0.1982044317156953, 0.10560474634197924, 0.38699365843854405, -0.2970025081461405, -0.3356297901995918, 0.08003605248831103, -0.2630914221476654, -0.117917763901984, 0.14793676958720692, -0.09256295790512334, 0.0012971189338713885, 0.09217461883398595, 0.08969565035008333, 0.005205821567420464, -0.3267839807592442, 0.32532994024359674, -0.04136067983584807, 0.22743424460880787, 0.014434761997750577, 0.14099434571176328, 0.02597069857532487, 0.029845348066266847, 0.0768496426041512, -0.08959336784781258, 0.1330866934327573, 0.29961027345784447, 0.2061170500538805, 0.35095129459548524, -0.433972753913087, -0.17720367590869393, 0.19059284984079353, 0.1155205012538799, 0.05350918045322246, 0.030351445133633474, -0.25498730070094633, 0.1056334893561571, -0.15208520944613743, -0.06172434241949197, 0.010497378994477913, -0.0016961074105518706, 0.05176972589037819, -0.30044777415254537, 0.0053062345707611015, 0.030160858808085323, 0.01336434887831702, -0.08141660366262145, -0.10675740056013798, 0.03591412797515445, 0.1876579354496618, 0.03408659725049373, 0.016426444144042977, 0.11340964190004503, -0.12399926596964873, -0.1411320062902044, 0.41525262234842075, 0.0401803612435127, -0.22738587553749848, 0.16720811580307782, -0.05495299491209581, -0.15397606066236383, 0.09706536216510679, 0.19936801637248958, 0.13016055029926493, -0.1668782013879322, 0.05746635833330562, -0.08780040015083025, 0.1629150150288992, 0.06857457426924478, -0.003485868249417228, 0.18657702309462953, 0.17735526770736804, 0.14737692035132033, 0.1490753055043409, -0.030799857759848236, -0.0982676531708635, -0.2876641420976204, -0.14178839415750083, -0.20221534582430167, 0.005378549143343288, -0.10933561380901237, -0.10064080580521156, 0.3801911564434276, 0.11083308180095627, 0.19302100898862323, 0.08056439910193576, 0.30560995135456326, 0.09787712054864695, 0.06396044692579274, 0.12921426177353543, 0.1574719648260404, 0.001904987295925179, 0.059367304364465835, -0.18812423769165487, 0.09369999575154746, 0.06486538015853832]
|
1,803.09793
|
Measurement of the absolute neutron beam polarization from a supermirror
polarizer and the absolute efficiency of a neutron spin rotator for the
NPDGamma experiment using a polarized $^{3}$He neutron spin-filter
|
Accurately measuring the neutron beam polarization of a high flux, large area
neutron beam is necessary for many neutron physics experiments. The Fundamental
Neutron Physics Beamline (FnPB) at the Spallation Neutron Source (SNS) is a
pulsed neutron beam that was polarized with a supermirror polarizer for the
NPDGamma experiment. The polarized neutron beam had a flux of $\sim10^9$
neutrons per second per cm$^2$ and a cross sectional area of
10$\times$12~cm$^2$. The polarization of this neutron beam and the efficiency
of a RF neutron spin rotator installed downstream on this beam were measured by
neutron transmission through a polarized $^{3}$He neutron spin-filter. The
pulsed nature of the SNS enabled us to employ an absolute measurement technique
for both quantities which does not depend on accurate knowledge of the phase
space of the neutron beam or the $^{3}$He polarization in the spin filter and
is therefore of interest for any experiments on slow neutron beams from pulsed
neutron sources which require knowledge of the absolute value of the neutron
polarization. The polarization and spin-reversal efficiency measured in this
work were done for the NPDGamma experiment, which measures the parity violating
$\gamma$-ray angular distribution asymmetry with respect to the neutron spin
direction in the capture of polarized neutrons on protons. The experimental
technique, results, systematic effects, and applications to neutron capture
targets are discussed.
|
physics.ins-det nucl-ex
|
accurately measuring the neutron beam polarization of a high flux large area neutron beam is necessary for many neutron physics experiments the fundamental neutron physics beamline fnpb at the spallation neutron source sns is a pulsed neutron beam that was polarized with a supermirror polarizer for the npdgamma experiment the polarized neutron beam had a flux of sim109 neutrons per second per cm2 and a cross sectional area of 10times12cm2 the polarization of this neutron beam and the efficiency of a rf neutron spin rotator installed downstream on this beam were measured by neutron transmission through a polarized 3he neutron spinfilter the pulsed nature of the sns enabled us to employ an absolute measurement technique for both quantities which does not depend on accurate knowledge of the phase space of the neutron beam or the 3he polarization in the spin filter and is therefore of interest for any experiments on slow neutron beams from pulsed neutron sources which require knowledge of the absolute value of the neutron polarization the polarization and spinreversal efficiency measured in this work were done for the npdgamma experiment which measures the parity violating gammaray angular distribution asymmetry with respect to the neutron spin direction in the capture of polarized neutrons on protons the experimental technique results systematic effects and applications to neutron capture targets are discussed
|
[['accurately', 'measuring', 'the', 'neutron', 'beam', 'polarization', 'of', 'a', 'high', 'flux', 'large', 'area', 'neutron', 'beam', 'is', 'necessary', 'for', 'many', 'neutron', 'physics', 'experiments', 'the', 'fundamental', 'neutron', 'physics', 'beamline', 'fnpb', 'at', 'the', 'spallation', 'neutron', 'source', 'sns', 'is', 'a', 'pulsed', 'neutron', 'beam', 'that', 'was', 'polarized', 'with', 'a', 'supermirror', 'polarizer', 'for', 'the', 'npdgamma', 'experiment', 'the', 'polarized', 'neutron', 'beam', 'had', 'a', 'flux', 'of', 'sim109', 'neutrons', 'per', 'second', 'per', 'cm2', 'and', 'a', 'cross', 'sectional', 'area', 'of', '10times12cm2', 'the', 'polarization', 'of', 'this', 'neutron', 'beam', 'and', 'the', 'efficiency', 'of', 'a', 'rf', 'neutron', 'spin', 'rotator', 'installed', 'downstream', 'on', 'this', 'beam', 'were', 'measured', 'by', 'neutron', 'transmission', 'through', 'a', 'polarized', '3he', 'neutron', 'spinfilter', 'the', 'pulsed', 'nature', 'of', 'the', 'sns', 'enabled', 'us', 'to', 'employ', 'an', 'absolute', 'measurement', 'technique', 'for', 'both', 'quantities', 'which', 'does', 'not', 'depend', 'on', 'accurate', 'knowledge', 'of', 'the', 'phase', 'space', 'of', 'the', 'neutron', 'beam', 'or', 'the', '3he', 'polarization', 'in', 'the', 'spin', 'filter', 'and', 'is', 'therefore', 'of', 'interest', 'for', 'any', 'experiments', 'on', 'slow', 'neutron', 'beams', 'from', 'pulsed', 'neutron', 'sources', 'which', 'require', 'knowledge', 'of', 'the', 'absolute', 'value', 'of', 'the', 'neutron', 'polarization', 'the', 'polarization', 'and', 'spinreversal', 'efficiency', 'measured', 'in', 'this', 'work', 'were', 'done', 'for', 'the', 'npdgamma', 'experiment', 'which', 'measures', 'the', 'parity', 'violating', 'gammaray', 'angular', 'distribution', 'asymmetry', 'with', 'respect', 'to', 'the', 'neutron', 'spin', 'direction', 'in', 'the', 'capture', 'of', 'polarized', 'neutrons', 'on', 'protons', 'the', 'experimental', 'technique', 'results', 'systematic', 'effects', 'and', 'applications', 'to', 'neutron', 'capture', 'targets', 'are', 'discussed']]
|
[-0.07317376117095012, 0.21981213437347005, -0.07908124647590077, 0.07352292117535729, -0.07804692237722603, -0.09261336792260408, 0.08179758348057724, 0.38324289945250545, -0.20965079938257325, -0.33883718463766854, 0.0066135201925962145, -0.33087805298749695, 0.0779878424861553, 0.2840278720895929, 0.034676002245396374, 0.0749419390308586, 0.06648418867685409, 0.02583555092781105, -0.09146045632607473, -0.15553831146574917, 0.3087935989849608, 0.14873673210280355, 0.32115968377752735, 0.08564575928983024, 0.14608138505030763, 0.03898917881729589, -0.02335827829400924, -0.07299730640383628, -0.07641531559655215, 0.058593590913171116, 0.26522921581583264, 0.0765817893457345, 0.08042137445987795, -0.4609448155642233, -0.21536222760226917, 0.09757659590422091, 0.06430386277815242, 0.09230983602848772, -0.0857173630756072, -0.24747492248107764, 0.02493301433278248, -0.1999338510626165, -0.1552805866665122, -0.04344814744254109, -0.004056141689546745, 0.10499307372480292, -0.24507161736043848, 0.012807943449694324, 0.03879415029024875, 0.026568682131950152, -0.06509201958860186, -0.15635385719360784, 0.033629338393538176, 0.02793563958574933, 0.05613055226064965, 0.1067833823575215, 0.1848428737012331, -0.124946161662956, -0.08288148208521307, 0.31790977056688546, -0.018434486122780733, -0.12775828105990183, 0.064483297849074, -0.27670231644191184, -0.09597555930747396, 0.1990261218394153, 0.18045616618421098, 0.1856526953760873, -0.15111899960532107, -0.02737210410784676, -0.012314490707252513, 0.2394610197907737, 0.13299267874734308, 0.02284946011125364, 0.2955070230474865, 0.2378874499932863, 0.02271918981701178, 0.08668082844127309, -0.2772877247093923, 0.019545867358101533, -0.2735448511486704, -0.11564188267372877, -0.14666647822199264, 0.0751825796335073, -0.014200527307416038, -0.077912038773965, 0.3544299232074991, 0.04177203098185022, 0.0857569092842327, -0.08887817276779308, 0.3542579574087127, 0.06548675434579226, 0.05474743775346062, 0.006682883186096495, 0.32168010266878727, 0.23195624063214795, 0.16487893024803435, -0.3159135218435867, 0.10010750748386438, -0.06429728234282017]
|
1,803.09794
|
A VLT/MUSE galaxy survey towards QSO Q1410: looking for a WHIM traced by
BLAs in inter-cluster filaments
|
Cosmological simulations predict that a significant fraction of the low-$z$
baryon budget resides in large-scale filaments in the form of a diffuse plasma
at temperatures $T \sim 10^{5} - 10^{7}$ K. However, direct observation of this
so-called warm-hot intergalactic medium (WHIM) has been elusive. In the
$\Lambda$CDM paradigm, galaxy clusters correspond to the nodes of the cosmic
web at the intersection of several large-scale filamentary threads. In previous
work, we used HST/COS data to conduct the first survey of broad HI Ly$\alpha$
absorbers (BLAs) potentially produced by WHIM in inter-cluster filaments. We
targeted a single QSO, namely Q1410, whose sight-line intersects $7$
independent inter-cluster axes at impact parameters $<3$ Mpc (co-moving), and
found a tentative excess of a factor of ${\sim}4$ with respect to the field.
Here, we further investigate the origin of these BLAs by performing a blind
galaxy survey within the Q1410 field using VLT/MUSE. We identified $77$ sources
and obtained the redshifts for $52$ of them. Out of the total sample of $7$
BLAs in inter-cluster axes, we found $3$ without any galaxy counterpart to
stringent luminosity limits ($\sim 4 \times 10^{8}$ L$_{\odot}$ ${\sim} 0.01$
L$_{*}$), providing further evidence that these BLAs may represent genuine WHIM
detections. We combined this sample with other suitable BLAs from the
literature and inferred the corresponding baryon mean density for these
filaments in the range $\Omega^{\rm fil}_{\rm bar}= 0.02-0.04$. Our rough
estimates are consistent with the predictions from numerical simulations but
still subject to large systematic uncertainties, mostly from the adopted
geometry, ionization corrections and density profile.
|
astro-ph.GA
|
cosmological simulations predict that a significant fraction of the lowz baryon budget resides in largescale filaments in the form of a diffuse plasma at temperatures t sim 105 107 k however direct observation of this socalled warmhot intergalactic medium whim has been elusive in the lambdacdm paradigm galaxy clusters correspond to the nodes of the cosmic web at the intersection of several largescale filamentary threads in previous work we used hstcos data to conduct the first survey of broad hi lyalpha absorbers blas potentially produced by whim in intercluster filaments we targeted a single qso namely q1410 whose sightline intersects 7 independent intercluster axes at impact parameters 3 mpc comoving and found a tentative excess of a factor of sim4 with respect to the field here we further investigate the origin of these blas by performing a blind galaxy survey within the q1410 field using vltmuse we identified 77 sources and obtained the redshifts for 52 of them out of the total sample of 7 blas in intercluster axes we found 3 without any galaxy counterpart to stringent luminosity limits sim 4 times 108 l_odot sim 001 l_ providing further evidence that these blas may represent genuine whim detections we combined this sample with other suitable blas from the literature and inferred the corresponding baryon mean density for these filaments in the range omegarm fil_rm bar 002004 our rough estimates are consistent with the predictions from numerical simulations but still subject to large systematic uncertainties mostly from the adopted geometry ionization corrections and density profile
|
[['cosmological', 'simulations', 'predict', 'that', 'a', 'significant', 'fraction', 'of', 'the', 'lowz', 'baryon', 'budget', 'resides', 'in', 'largescale', 'filaments', 'in', 'the', 'form', 'of', 'a', 'diffuse', 'plasma', 'at', 'temperatures', 't', 'sim', '105', '107', 'k', 'however', 'direct', 'observation', 'of', 'this', 'socalled', 'warmhot', 'intergalactic', 'medium', 'whim', 'has', 'been', 'elusive', 'in', 'the', 'lambdacdm', 'paradigm', 'galaxy', 'clusters', 'correspond', 'to', 'the', 'nodes', 'of', 'the', 'cosmic', 'web', 'at', 'the', 'intersection', 'of', 'several', 'largescale', 'filamentary', 'threads', 'in', 'previous', 'work', 'we', 'used', 'hstcos', 'data', 'to', 'conduct', 'the', 'first', 'survey', 'of', 'broad', 'hi', 'lyalpha', 'absorbers', 'blas', 'potentially', 'produced', 'by', 'whim', 'in', 'intercluster', 'filaments', 'we', 'targeted', 'a', 'single', 'qso', 'namely', 'q1410', 'whose', 'sightline', 'intersects', '7', 'independent', 'intercluster', 'axes', 'at', 'impact', 'parameters', '3', 'mpc', 'comoving', 'and', 'found', 'a', 'tentative', 'excess', 'of', 'a', 'factor', 'of', 'sim4', 'with', 'respect', 'to', 'the', 'field', 'here', 'we', 'further', 'investigate', 'the', 'origin', 'of', 'these', 'blas', 'by', 'performing', 'a', 'blind', 'galaxy', 'survey', 'within', 'the', 'q1410', 'field', 'using', 'vltmuse', 'we', 'identified', '77', 'sources', 'and', 'obtained', 'the', 'redshifts', 'for', '52', 'of', 'them', 'out', 'of', 'the', 'total', 'sample', 'of', '7', 'blas', 'in', 'intercluster', 'axes', 'we', 'found', '3', 'without', 'any', 'galaxy', 'counterpart', 'to', 'stringent', 'luminosity', 'limits', 'sim', '4', 'times', '108', 'l_odot', 'sim', '001', 'l_', 'providing', 'further', 'evidence', 'that', 'these', 'blas', 'may', 'represent', 'genuine', 'whim', 'detections', 'we', 'combined', 'this', 'sample', 'with', 'other', 'suitable', 'blas', 'from', 'the', 'literature', 'and', 'inferred', 'the', 'corresponding', 'baryon', 'mean', 'density', 'for', 'these', 'filaments', 'in', 'the', 'range', 'omegarm', 'fil_rm', 'bar', '002004', 'our', 'rough', 'estimates', 'are', 'consistent', 'with', 'the', 'predictions', 'from', 'numerical', 'simulations', 'but', 'still', 'subject', 'to', 'large', 'systematic', 'uncertainties', 'mostly', 'from', 'the', 'adopted', 'geometry', 'ionization', 'corrections', 'and', 'density', 'profile']]
|
[-0.11247311321113514, 0.07617591134533988, -0.003941682803015861, 0.052430546420278945, -0.08254328926947589, -0.034857104355025856, 0.07472628678817908, 0.4231258098826936, -0.16690770429115565, -0.36441662260779323, 0.029152611740365892, -0.32028081280868576, 0.004577309059511338, 0.15457803668895004, 0.06596037509041794, 0.013176850254355471, 0.010908487584582337, -0.08017466726850549, -0.0516834429401483, -0.2741973502201117, 0.258766283033072, 0.1005399254065687, 0.19247261139828462, -0.008865948966501044, 0.07777715976774903, -0.11865535305835129, -0.12048579352198258, 0.03301067662698823, -0.18739303585007003, 0.04138239046756459, 0.25390363232480245, 0.11916176355436388, 0.24427956213854948, -0.38586430448366815, -0.189363157162295, 0.09470195510099681, 0.21555920895041217, 0.06832122455336272, -0.048783232542937476, -0.28551128090891453, 0.11326406283548013, -0.16987538865456978, -0.1403390587693716, 0.055913248173301185, 0.01078490699393793, 0.002217305409777466, -0.19706551036945294, 0.18527412882983862, -0.040237365666331563, 0.08168398137139674, -0.057368411910757124, -0.12535539297765816, -0.02374088429450427, 0.014462579818745514, -0.006714721317476933, 0.08900151245983406, 0.22162093853047635, -0.14519317310288668, -0.039976633650930744, 0.422672452164873, -0.06670502669802526, -0.011957744741165597, 0.20166650776821096, -0.18313597751382207, -0.21211320488891078, 0.17946189790613032, 0.16550531165696503, 0.053481677925677984, -0.14819844528323128, 0.03756059805533686, -0.04101802816703206, 0.22737498626312508, 0.020558672903996288, 0.04276329300860414, 0.273680391746951, 0.08456584022265844, 0.03735594037506315, 0.06438158205844322, -0.16961348902848494, 0.0018401684937998652, -0.2820858352204105, -0.09757230083466441, -0.11962690989030451, 0.09221269263810153, -0.15347137827057084, -0.10659091262537654, 0.3101470321897299, 0.18316605696704105, 0.2532413071889933, 0.07078712290736831, 0.3123219352112048, 0.053390791362506296, 0.10588857384919677, 0.13023589167093474, 0.29445500481903314, 0.17911100406236652, 0.0644395851566168, -0.17834990643752954, 0.022673635595729425, -0.04295814178222495]
|
1,803.09795
|
DES Y1 Results: Validating cosmological parameter estimation using
simulated Dark Energy Surveys
|
We use mock galaxy survey simulations designed to resemble the Dark Energy
Survey Year 1 (DES Y1) data to validate and inform cosmological parameter
estimation. When similar analysis tools are applied to both simulations and
real survey data, they provide powerful validation tests of the DES Y1
cosmological analyses presented in companion papers. We use two suites of
galaxy simulations produced using different methods, which therefore provide
independent tests of our cosmological parameter inference. The cosmological
analysis we aim to validate is presented in DES Collaboration et al. (2017) and
uses angular two-point correlation functions of galaxy number counts and weak
lensing shear, as well as their cross-correlation, in multiple redshift bins.
While our constraints depend on the specific set of simulated realisations
available, for both suites of simulations we find that the input cosmology is
consistent with the combined constraints from multiple simulated DES Y1
realizations in the $\Omega_m-\sigma_8$ plane. For one of the suites, we are
able to show with high confidence that any biases in the inferred
$S_8=\sigma_8(\Omega_m/0.3)^{0.5}$ and $\Omega_m$ are smaller than the DES Y1
$1-\sigma$ uncertainties. For the other suite, for which we have fewer
realizations, we are unable to be this conclusive; we infer a roughly 70%
probability that systematic biases in the recovered $\Omega_m$ and $S_8$ are
sub-dominant to the DES Y1 uncertainty. As cosmological analyses of this kind
become increasingly more precise, validation of parameter inference using
survey simulations will be essential to demonstrate robustness.
|
astro-ph.CO
|
we use mock galaxy survey simulations designed to resemble the dark energy survey year 1 des y1 data to validate and inform cosmological parameter estimation when similar analysis tools are applied to both simulations and real survey data they provide powerful validation tests of the des y1 cosmological analyses presented in companion papers we use two suites of galaxy simulations produced using different methods which therefore provide independent tests of our cosmological parameter inference the cosmological analysis we aim to validate is presented in des collaboration et al 2017 and uses angular twopoint correlation functions of galaxy number counts and weak lensing shear as well as their crosscorrelation in multiple redshift bins while our constraints depend on the specific set of simulated realisations available for both suites of simulations we find that the input cosmology is consistent with the combined constraints from multiple simulated des y1 realizations in the omega_msigma_8 plane for one of the suites we are able to show with high confidence that any biases in the inferred s_8sigma_8omega_m0305 and omega_m are smaller than the des y1 1sigma uncertainties for the other suite for which we have fewer realizations we are unable to be this conclusive we infer a roughly 70 probability that systematic biases in the recovered omega_m and s_8 are subdominant to the des y1 uncertainty as cosmological analyses of this kind become increasingly more precise validation of parameter inference using survey simulations will be essential to demonstrate robustness
|
[['we', 'use', 'mock', 'galaxy', 'survey', 'simulations', 'designed', 'to', 'resemble', 'the', 'dark', 'energy', 'survey', 'year', '1', 'des', 'y1', 'data', 'to', 'validate', 'and', 'inform', 'cosmological', 'parameter', 'estimation', 'when', 'similar', 'analysis', 'tools', 'are', 'applied', 'to', 'both', 'simulations', 'and', 'real', 'survey', 'data', 'they', 'provide', 'powerful', 'validation', 'tests', 'of', 'the', 'des', 'y1', 'cosmological', 'analyses', 'presented', 'in', 'companion', 'papers', 'we', 'use', 'two', 'suites', 'of', 'galaxy', 'simulations', 'produced', 'using', 'different', 'methods', 'which', 'therefore', 'provide', 'independent', 'tests', 'of', 'our', 'cosmological', 'parameter', 'inference', 'the', 'cosmological', 'analysis', 'we', 'aim', 'to', 'validate', 'is', 'presented', 'in', 'des', 'collaboration', 'et', 'al', '2017', 'and', 'uses', 'angular', 'twopoint', 'correlation', 'functions', 'of', 'galaxy', 'number', 'counts', 'and', 'weak', 'lensing', 'shear', 'as', 'well', 'as', 'their', 'crosscorrelation', 'in', 'multiple', 'redshift', 'bins', 'while', 'our', 'constraints', 'depend', 'on', 'the', 'specific', 'set', 'of', 'simulated', 'realisations', 'available', 'for', 'both', 'suites', 'of', 'simulations', 'we', 'find', 'that', 'the', 'input', 'cosmology', 'is', 'consistent', 'with', 'the', 'combined', 'constraints', 'from', 'multiple', 'simulated', 'des', 'y1', 'realizations', 'in', 'the', 'omega_msigma_8', 'plane', 'for', 'one', 'of', 'the', 'suites', 'we', 'are', 'able', 'to', 'show', 'with', 'high', 'confidence', 'that', 'any', 'biases', 'in', 'the', 'inferred', 's_8sigma_8omega_m0305', 'and', 'omega_m', 'are', 'smaller', 'than', 'the', 'des', 'y1', '1sigma', 'uncertainties', 'for', 'the', 'other', 'suite', 'for', 'which', 'we', 'have', 'fewer', 'realizations', 'we', 'are', 'unable', 'to', 'be', 'this', 'conclusive', 'we', 'infer', 'a', 'roughly', '70', 'probability', 'that', 'systematic', 'biases', 'in', 'the', 'recovered', 'omega_m', 'and', 's_8', 'are', 'subdominant', 'to', 'the', 'des', 'y1', 'uncertainty', 'as', 'cosmological', 'analyses', 'of', 'this', 'kind', 'become', 'increasingly', 'more', 'precise', 'validation', 'of', 'parameter', 'inference', 'using', 'survey', 'simulations', 'will', 'be', 'essential', 'to', 'demonstrate', 'robustness']]
|
[-0.07592213352081897, 0.007746004004970439, -0.10951641741524304, 0.1375327066086379, -0.11872651115106034, -0.07122457589500023, -0.02513423320367809, 0.3553750320406985, -0.17427679335059645, -0.39153806730519886, 0.09369263268741664, -0.31772323544637476, -0.04937949606163566, 0.2641714797297508, -0.01777208716539312, 0.08577670205446068, 0.09482649259061422, -0.0919214146313246, -0.03223421039681041, -0.335342061274862, 0.28119854457399324, 0.1328559535216879, 0.23372111874747992, -0.08597639184406658, 0.06978468138850602, -0.030523758969574682, -0.13788772640102312, 0.026924446028895863, -0.24910056127390073, 0.04530723339806827, 0.2755328413754007, 0.18660844313790748, 0.2464213480505215, -0.3735716960427528, -0.18322317079017478, 0.14365521258986527, 0.16387580362121404, 0.12069120130709503, -0.04356579266832266, -0.2916097277785028, 0.12308449940592404, -0.18406682863469767, -0.07754573612550873, -0.0777899207381824, -0.05069696951911531, 0.07042858559106215, -0.26111625685945367, 0.16306857605203062, -0.05350794183876373, 0.06268580774738153, -0.049779824993365314, -0.1576680455449199, -0.06642033276917829, 0.10866957189611925, 0.022369263040417545, 0.0418170792866529, 0.13457867189566414, -0.10024028655799676, -0.058021754026172434, 0.39136116109617164, -0.05603551419100903, -0.15026757004478378, 0.17964571298312682, -0.1469336475966275, -0.22443086004908358, 0.04229568879404837, 0.17989712708806696, 0.044535288693044676, -0.12051762098549675, 0.04807965575442226, 0.03204621573956298, 0.2394862648442172, 0.01971032505293092, -0.01740414830010571, 0.25148641947687655, 0.10508521506851462, 0.03352030035669238, 0.04043145833602166, -0.15121967590044538, -0.04764680796584753, -0.3090537117466077, -0.0895116805187465, -0.1580752147306796, 0.027401078750729592, -0.11355999139032215, -0.1318655134186395, 0.329995560200534, 0.23083136574282698, 0.20326178427015948, 0.0950354273211642, 0.3122695801964353, 0.026497412514153672, 0.04330311379056762, 0.020827348119856343, 0.2722193581929569, 0.09092442360264057, 0.05215845175216375, -0.1512277581669344, 0.015654425721707915, -0.05425651028053835]
|
1,803.09796
|
Conditional expectations and interpolation of linear operators on
ordered ideals between $L^1(0,1)$ and $L^\infty(0,1)$
|
The monograph contains the detailed exposition of the results obtained by the
author during the last several years. In particular it contains an improvement
of the well known Calderon - Ryff interpolation theorem and description of
"verifying" operators of conditional mathematical expectations {if such an
operator leaves an order ideal in $L^1% invariant, then the ideal is an
interpolation space}.
|
math.FA
|
the monograph contains the detailed exposition of the results obtained by the author during the last several years in particular it contains an improvement of the well known calderon ryff interpolation theorem and description of verifying operators of conditional mathematical expectations if such an operator leaves an order ideal in l1 invariant then the ideal is an interpolation space
|
[['the', 'monograph', 'contains', 'the', 'detailed', 'exposition', 'of', 'the', 'results', 'obtained', 'by', 'the', 'author', 'during', 'the', 'last', 'several', 'years', 'in', 'particular', 'it', 'contains', 'an', 'improvement', 'of', 'the', 'well', 'known', 'calderon', 'ryff', 'interpolation', 'theorem', 'and', 'description', 'of', 'verifying', 'operators', 'of', 'conditional', 'mathematical', 'expectations', 'if', 'such', 'an', 'operator', 'leaves', 'an', 'order', 'ideal', 'in', 'l1', 'invariant', 'then', 'the', 'ideal', 'is', 'an', 'interpolation', 'space']]
|
[-0.08553836516361556, 0.041642073121379485, -0.07606184794085807, 0.07610322746392019, -0.07472553107775105, -0.03818879405775204, -0.03822242528007462, 0.2988724294439729, -0.2900237570645223, -0.2601489538551661, 0.1605953962245057, -0.3081541634245037, -0.13302927268347864, 0.21217980493935917, -0.1354814371784571, 0.056098394617759464, 0.08033291042525449, 0.08820953923036698, -0.11226945901931874, -0.29661676859290437, 0.34111188488996363, 0.07793791627447152, 0.2092925007294478, 0.05695388274235201, 0.11499477902041941, 0.06988224701690969, -0.10626231239113057, -0.0382846712284312, -0.1525714260943491, 0.12354728638933136, 0.23341807029370604, 0.1184133857424403, 0.27838178017529946, -0.40302479315292217, -0.14387390426970248, 0.11371264091476091, 0.09747064524683459, 0.05709463290484815, -0.034912130994880816, -0.26979350552348225, 0.03844311262143712, -0.15360370202889218, -0.17107934248633683, -0.0763008971397508, 0.048364547249893176, -0.02265551869339984, -0.27941311862929885, 0.0251143464320821, 0.18021148087954597, 0.13750048652933589, -0.07961447183685057, -0.11879540504566555, 7.936322724382425e-05, 0.10655173262709687, 0.042129904204369364, 0.07782328822088011, 0.024181245761955607, -0.09578772850940807, -0.13650179871936038, 0.34966622090673655, -0.06564401714171379, -0.15794740510494287, 0.14540528994182061, -0.11963055210974838, -0.14153531670634603, 0.09088351394467313, 0.0456426839850008, 0.11690373814831376, -0.14903421068949432, 0.15335660886946775, -0.11678910725107737, 0.13442116645004215, 0.08060346010687022, 0.033863355630430685, 0.09128886512641249, 0.1540172215639453, 0.10866814191806419, 0.1291742309935969, 0.006517428663912518, -0.08732325598147922, -0.38559955795263423, -0.21380862516977278, -0.20418259792094087, 0.04810968043025712, -0.0846077760454199, -0.18512163717492386, 0.40177397461254793, 0.10574208753151369, 0.17983935868110637, 0.01778983088874595, 0.29032549766245586, 0.1529550479146941, 0.0064879133494506625, 0.08709275159695797, 0.19487696515139322, 0.18454468523649947, 0.08299042184933506, -0.08713633793502532, 0.024133531119802903, 0.17485216487969818]
|
1,803.09797
|
Women also Snowboard: Overcoming Bias in Captioning Models
|
Most machine learning methods are known to capture and exploit biases of the
training data. While some biases are beneficial for learning, others are
harmful. Specifically, image captioning models tend to exaggerate biases
present in training data (e.g., if a word is present in 60% of training
sentences, it might be predicted in 70% of sentences at test time). This can
lead to incorrect captions in domains where unbiased captions are desired, or
required, due to over-reliance on the learned prior and image context. In this
work we investigate generation of gender-specific caption words (e.g. man,
woman) based on the person's appearance or the image context. We introduce a
new Equalizer model that ensures equal gender probability when gender evidence
is occluded in a scene and confident predictions when gender evidence is
present. The resulting model is forced to look at a person rather than use
contextual cues to make a gender-specific predictions. The losses that comprise
our model, the Appearance Confusion Loss and the Confident Loss, are general,
and can be added to any description model in order to mitigate impacts of
unwanted bias in a description dataset. Our proposed model has lower error than
prior work when describing images with people and mentioning their gender and
more closely matches the ground truth ratio of sentences including women to
sentences including men. We also show that unlike other approaches, our model
is indeed more often looking at people when predicting their gender.
|
cs.CV
|
most machine learning methods are known to capture and exploit biases of the training data while some biases are beneficial for learning others are harmful specifically image captioning models tend to exaggerate biases present in training data eg if a word is present in 60 of training sentences it might be predicted in 70 of sentences at test time this can lead to incorrect captions in domains where unbiased captions are desired or required due to overreliance on the learned prior and image context in this work we investigate generation of genderspecific caption words eg man woman based on the persons appearance or the image context we introduce a new equalizer model that ensures equal gender probability when gender evidence is occluded in a scene and confident predictions when gender evidence is present the resulting model is forced to look at a person rather than use contextual cues to make a genderspecific predictions the losses that comprise our model the appearance confusion loss and the confident loss are general and can be added to any description model in order to mitigate impacts of unwanted bias in a description dataset our proposed model has lower error than prior work when describing images with people and mentioning their gender and more closely matches the ground truth ratio of sentences including women to sentences including men we also show that unlike other approaches our model is indeed more often looking at people when predicting their gender
|
[['most', 'machine', 'learning', 'methods', 'are', 'known', 'to', 'capture', 'and', 'exploit', 'biases', 'of', 'the', 'training', 'data', 'while', 'some', 'biases', 'are', 'beneficial', 'for', 'learning', 'others', 'are', 'harmful', 'specifically', 'image', 'captioning', 'models', 'tend', 'to', 'exaggerate', 'biases', 'present', 'in', 'training', 'data', 'eg', 'if', 'a', 'word', 'is', 'present', 'in', '60', 'of', 'training', 'sentences', 'it', 'might', 'be', 'predicted', 'in', '70', 'of', 'sentences', 'at', 'test', 'time', 'this', 'can', 'lead', 'to', 'incorrect', 'captions', 'in', 'domains', 'where', 'unbiased', 'captions', 'are', 'desired', 'or', 'required', 'due', 'to', 'overreliance', 'on', 'the', 'learned', 'prior', 'and', 'image', 'context', 'in', 'this', 'work', 'we', 'investigate', 'generation', 'of', 'genderspecific', 'caption', 'words', 'eg', 'man', 'woman', 'based', 'on', 'the', 'persons', 'appearance', 'or', 'the', 'image', 'context', 'we', 'introduce', 'a', 'new', 'equalizer', 'model', 'that', 'ensures', 'equal', 'gender', 'probability', 'when', 'gender', 'evidence', 'is', 'occluded', 'in', 'a', 'scene', 'and', 'confident', 'predictions', 'when', 'gender', 'evidence', 'is', 'present', 'the', 'resulting', 'model', 'is', 'forced', 'to', 'look', 'at', 'a', 'person', 'rather', 'than', 'use', 'contextual', 'cues', 'to', 'make', 'a', 'genderspecific', 'predictions', 'the', 'losses', 'that', 'comprise', 'our', 'model', 'the', 'appearance', 'confusion', 'loss', 'and', 'the', 'confident', 'loss', 'are', 'general', 'and', 'can', 'be', 'added', 'to', 'any', 'description', 'model', 'in', 'order', 'to', 'mitigate', 'impacts', 'of', 'unwanted', 'bias', 'in', 'a', 'description', 'dataset', 'our', 'proposed', 'model', 'has', 'lower', 'error', 'than', 'prior', 'work', 'when', 'describing', 'images', 'with', 'people', 'and', 'mentioning', 'their', 'gender', 'and', 'more', 'closely', 'matches', 'the', 'ground', 'truth', 'ratio', 'of', 'sentences', 'including', 'women', 'to', 'sentences', 'including', 'men', 'we', 'also', 'show', 'that', 'unlike', 'other', 'approaches', 'our', 'model', 'is', 'indeed', 'more', 'often', 'looking', 'at', 'people', 'when', 'predicting', 'their', 'gender']]
|
[-0.015158271285755092, 0.058033952587226656, -0.05793208745449323, 0.1564958054421914, -0.14888953353535123, -0.1867508385637047, 0.0658224775741421, 0.44662157555758464, -0.2141559857596287, -0.3720413783657146, 0.05854742831038886, -0.3364460544714344, -0.1533501910739444, 0.149367616868553, -0.19351589493070243, 0.007197029260562066, 0.12794620259291273, 0.09729764304495582, -0.032846462462526656, -0.31060624506838097, 0.3049035607128109, 0.04876923832061237, 0.30570286639234046, 0.011638862090453566, 0.07735542774738441, -0.060357523657184636, -0.06011864979590439, -0.01391426348745432, -0.05091524306957686, 0.1333726808541826, 0.3173375979279593, 0.18068029225716242, 0.3332949372587166, -0.400081541948787, -0.2017386644626412, 0.11054014092274854, 0.12275787686610282, 0.16897499251671408, -0.024739234942637207, -0.3556350392285627, 0.1014553229180797, -0.15858004030430453, 0.01529407964103353, -0.10512859580969848, 0.0059727519969053474, -0.037459404173512165, -0.28531732888788813, 0.10245013902710709, 0.10365216932048707, 0.09317475346043043, -0.0557277895219877, -0.12921244239122243, -0.0008464364340689815, 0.18289921364944367, 0.09786472275638532, 0.045461737343834505, 0.13083903789457985, -0.22538467755717506, -0.11126947438070328, 0.4064544761225719, -0.028657903961972393, -0.2171604066067701, 0.19369046966767575, -0.11561743661362693, -0.10620803285367143, 0.06633955076214218, 0.21179127773277676, 0.0828831418467218, -0.14979669399709927, -0.047143847671042315, -0.04163154355372942, 0.2064511742473507, 0.1000110969089217, 0.00041781321173694764, 0.21330116538727587, 0.1790004231509036, 0.01481547486037016, 0.10722386830035069, -0.11353192773720426, -0.032905270912547184, -0.21775449414108974, -0.09853834778294657, -0.1387477571220394, -0.023877570648972758, -0.05496494358012868, -0.13093694858253002, 0.3775983173706772, 0.2661116470538708, 0.20086507556898664, 0.11041313283401254, 0.3131204319537192, 0.025562356275490986, 0.10206487381815481, 0.07619264004359198, 0.17095257587016582, -0.026373535557554215, 0.08066437550659442, -0.13153395554100628, 0.1680750480820444, 0.0005907099617361532]
|
1,803.09798
|
Force spectroscopy analysis in polymer translocation
|
This paper reports the force spectroscopy analysis of a polymer that
translocates from one side of a membrane to the other side through an extended
pore, pulled by a cantilever that moves with constant velocity against the
damping and the potential barrier generated by the reaction of the membrane
walls. The polymer is modeled as a beads-springs chain with both excluded
volume and bending contributions, and moves in a stochastic three dimensional
environment described by a Langevin dynamics at fixed temperature. The force
trajectories recorded at different velocities reveal two unexplored exponential
regimes: the force increases when the first part of the chain enters the pore,
and then decreases when the first monomer reaches the trans region. The
spectroscopy analysis of the force values permit the estimation of the free
energy barrier as well as the limit force to permit the translocation. The
stall force to maintain the polymer fixed has been also calculated
independently, and its value confirms the force spectroscopy outcomes.
|
cond-mat.soft cond-mat.stat-mech physics.bio-ph
|
this paper reports the force spectroscopy analysis of a polymer that translocates from one side of a membrane to the other side through an extended pore pulled by a cantilever that moves with constant velocity against the damping and the potential barrier generated by the reaction of the membrane walls the polymer is modeled as a beadssprings chain with both excluded volume and bending contributions and moves in a stochastic three dimensional environment described by a langevin dynamics at fixed temperature the force trajectories recorded at different velocities reveal two unexplored exponential regimes the force increases when the first part of the chain enters the pore and then decreases when the first monomer reaches the trans region the spectroscopy analysis of the force values permit the estimation of the free energy barrier as well as the limit force to permit the translocation the stall force to maintain the polymer fixed has been also calculated independently and its value confirms the force spectroscopy outcomes
|
[['this', 'paper', 'reports', 'the', 'force', 'spectroscopy', 'analysis', 'of', 'a', 'polymer', 'that', 'translocates', 'from', 'one', 'side', 'of', 'a', 'membrane', 'to', 'the', 'other', 'side', 'through', 'an', 'extended', 'pore', 'pulled', 'by', 'a', 'cantilever', 'that', 'moves', 'with', 'constant', 'velocity', 'against', 'the', 'damping', 'and', 'the', 'potential', 'barrier', 'generated', 'by', 'the', 'reaction', 'of', 'the', 'membrane', 'walls', 'the', 'polymer', 'is', 'modeled', 'as', 'a', 'beadssprings', 'chain', 'with', 'both', 'excluded', 'volume', 'and', 'bending', 'contributions', 'and', 'moves', 'in', 'a', 'stochastic', 'three', 'dimensional', 'environment', 'described', 'by', 'a', 'langevin', 'dynamics', 'at', 'fixed', 'temperature', 'the', 'force', 'trajectories', 'recorded', 'at', 'different', 'velocities', 'reveal', 'two', 'unexplored', 'exponential', 'regimes', 'the', 'force', 'increases', 'when', 'the', 'first', 'part', 'of', 'the', 'chain', 'enters', 'the', 'pore', 'and', 'then', 'decreases', 'when', 'the', 'first', 'monomer', 'reaches', 'the', 'trans', 'region', 'the', 'spectroscopy', 'analysis', 'of', 'the', 'force', 'values', 'permit', 'the', 'estimation', 'of', 'the', 'free', 'energy', 'barrier', 'as', 'well', 'as', 'the', 'limit', 'force', 'to', 'permit', 'the', 'translocation', 'the', 'stall', 'force', 'to', 'maintain', 'the', 'polymer', 'fixed', 'has', 'been', 'also', 'calculated', 'independently', 'and', 'its', 'value', 'confirms', 'the', 'force', 'spectroscopy', 'outcomes']]
|
[-0.11833872334215284, 0.1811237832982083, -0.09881769555472096, -0.02881335137544177, -0.016485785878619846, -0.1624052536898051, 0.05618309482636022, 0.3422631384505902, -0.30566673916419623, -0.27264225479778775, 0.07074365786235078, -0.28413677831858764, -0.09535620079457006, 0.16736090333591916, 0.024978574182670046, 0.01649972955011087, 0.04202830457318298, 0.04838101290896489, 0.01622442717456983, -0.1508094150564302, 0.25433587807771046, 0.09775014967301193, 0.25679936841630413, 0.1014268233521301, 0.13884605965749533, 0.025106053363911255, 0.024562601051810715, 0.07032223602176219, -0.2032761360367905, 0.0508691465947777, 0.1635740904804365, -0.027843404206286334, 0.2798910805564604, -0.44906394415891465, -0.22405664138582157, 0.04897615294271137, 0.1517945188412049, 0.14090870359314628, -0.022253387446664732, -0.27157639297024333, -0.008885225600183563, -0.14047791735401355, -0.17120911704410832, 0.001488059483192585, 0.03270027133417718, 0.0712465619277439, -0.22510165152755093, 0.09807204246865212, 0.01314195460010389, 0.05385541389581322, -0.09050493253133386, -0.10517956814326254, -0.056885983649767755, 0.1700378058619803, 0.1104805567589255, 0.04822591551163458, 0.28000672232865553, -0.12721641689387508, -0.0610132172220835, 0.35495654574629887, -0.08800059317662898, -0.17501089402279, 0.1884925865775181, -0.1418584476535519, -0.05330420799577108, 0.1931421220342824, 0.09270294008052184, 0.09856706210228838, -0.1458322248792773, 0.05836635679665006, 0.036260752737476136, 0.17889709582402843, 0.12050864308279145, -0.06368438796324219, 0.1900789225646467, 0.17217508916467153, 0.06749661346713517, 0.17080631081257763, -0.1511265479098649, -0.1272833940722508, -0.2875730609636248, -0.14971485282337568, -0.19658836106522537, 0.02001931068320747, -0.08420618996697832, -0.1590374471378271, 0.33851391493262334, 0.08289014711836326, 0.21420924941560737, 0.05667027113614259, 0.32106296725306704, 0.09479600568172625, 0.07175332285538545, 0.021477998891997332, 0.27322233576265764, 0.13868460334682217, 0.12114701055013287, -0.27583278988252313, 0.065535250387189, 0.038917683853974774]
|
1,803.09799
|
Demystifying Core Ranking in Pinterest Image Search
|
Pinterest Image Search Engine helps hundreds of millions of users discover
interesting content everyday. This motivates us to improve the image search
quality by evolving our ranking techniques. In this work, we share how we
practically design and deploy various ranking pipelines into Pinterest image
search ecosystem. Specifically, we focus on introducing our novel research and
study on three aspects: training data, user/image featurization and ranking
models. Extensive offline and online studies compared the performance of
different models and demonstrated the efficiency and effectiveness of our final
launched ranking models.
|
cs.IR
|
pinterest image search engine helps hundreds of millions of users discover interesting content everyday this motivates us to improve the image search quality by evolving our ranking techniques in this work we share how we practically design and deploy various ranking pipelines into pinterest image search ecosystem specifically we focus on introducing our novel research and study on three aspects training data userimage featurization and ranking models extensive offline and online studies compared the performance of different models and demonstrated the efficiency and effectiveness of our final launched ranking models
|
[['pinterest', 'image', 'search', 'engine', 'helps', 'hundreds', 'of', 'millions', 'of', 'users', 'discover', 'interesting', 'content', 'everyday', 'this', 'motivates', 'us', 'to', 'improve', 'the', 'image', 'search', 'quality', 'by', 'evolving', 'our', 'ranking', 'techniques', 'in', 'this', 'work', 'we', 'share', 'how', 'we', 'practically', 'design', 'and', 'deploy', 'various', 'ranking', 'pipelines', 'into', 'pinterest', 'image', 'search', 'ecosystem', 'specifically', 'we', 'focus', 'on', 'introducing', 'our', 'novel', 'research', 'and', 'study', 'on', 'three', 'aspects', 'training', 'data', 'userimage', 'featurization', 'and', 'ranking', 'models', 'extensive', 'offline', 'and', 'online', 'studies', 'compared', 'the', 'performance', 'of', 'different', 'models', 'and', 'demonstrated', 'the', 'efficiency', 'and', 'effectiveness', 'of', 'our', 'final', 'launched', 'ranking', 'models']]
|
[-0.038069162664286206, -0.03320418110933532, -0.06346325066694047, 0.0816872838251502, -0.15989731602747453, -0.1407262665753284, 0.10516751104484448, 0.4470681961981601, -0.20815339171212544, -0.43132563024298864, 0.0808713018980526, -0.33003280872709295, -0.1862681425919526, 0.20256669684627165, -0.0628413291846852, 0.07875030613347386, 0.15485051299413938, 0.005916625351561338, -0.04202842198082068, -0.36532436152187625, 0.3145434968108102, 0.10381772214274727, 0.3859590084522209, 0.04612614656536934, 0.03988295963708981, 0.0007971360170271959, -0.15065434613798775, -0.03138406805987103, -0.10783759310967132, 0.2142758067079893, 0.3238524424825423, 0.29158463441044763, 0.34020388862013484, -0.39368699943081714, -0.19131627380638644, 0.1028921360129051, 0.15070176829081658, 0.04299618893962228, -0.12602991092521068, -0.3475431284364941, 0.04696098653327548, -0.1944735092110932, 0.029253951116894068, -0.1634756311711468, -0.05177432629332114, 0.0024738771490375984, -0.24392238104443872, -0.05047274673399463, 0.041288348846137524, 0.04243803009641974, -0.049524004096322266, -0.0951967697716161, 0.03861910975512033, 0.19507593804907597, 0.06797523041036022, -0.007311800638674183, 0.18522463621194946, -0.15483976069189023, -0.18065545382108958, 0.3916502578414223, -0.028383290960212772, -0.15561311370222253, 0.25382091129575385, -0.00562281288687935, -0.1796392502702689, 0.07135648253698194, 0.35829751995088677, 0.14170834881494218, -0.18586442073325762, -0.01635018747242356, -0.030470970787861373, 0.19854149880055127, 0.03377204701000971, -0.017726973109889063, 0.19005568345140122, 0.2980593109158067, 0.0047305586402503295, 0.19238490677239856, -0.08126918763822216, -0.07346353062501784, -0.15979660614236688, -0.13705218914540462, -0.1383066477013354, -0.03549261988674322, -0.11593956011510978, -0.09307009792687852, 0.4749544155313058, 0.31517534665344804, 0.17452242043852972, 0.039602092875356085, 0.3550517558632942, -0.052364724386075326, 0.08275845942213043, 0.0731235031362916, 0.1751956072900172, -0.06370482530727396, 0.1749545760096961, -0.16334807327451456, 0.0584674577929833, 0.022724012310585278]
|
1,803.098
|
Polynomial graph invariants and the KP hierarchy
|
We prove that the generating function for the symmetric chromatic polynomial
of all connected graphs satisfies (after appropriate scaling change of
variables) the Kadomtsev--Petviashvili integrable hierarchy of mathematical
physics. Moreover, we describe a large family of polynomial graph invariants
giving the same solution of the KP. In particular, we introduce the Abel
polynomial for graphs and show this for its generating function. The key point
here is a Hopf algebra structure on the space spanned by graphs and the
behavior of the invariants on its primitive space.
|
math.CO math-ph math.AG math.AT math.MP
|
we prove that the generating function for the symmetric chromatic polynomial of all connected graphs satisfies after appropriate scaling change of variables the kadomtsevpetviashvili integrable hierarchy of mathematical physics moreover we describe a large family of polynomial graph invariants giving the same solution of the kp in particular we introduce the abel polynomial for graphs and show this for its generating function the key point here is a hopf algebra structure on the space spanned by graphs and the behavior of the invariants on its primitive space
|
[['we', 'prove', 'that', 'the', 'generating', 'function', 'for', 'the', 'symmetric', 'chromatic', 'polynomial', 'of', 'all', 'connected', 'graphs', 'satisfies', 'after', 'appropriate', 'scaling', 'change', 'of', 'variables', 'the', 'kadomtsevpetviashvili', 'integrable', 'hierarchy', 'of', 'mathematical', 'physics', 'moreover', 'we', 'describe', 'a', 'large', 'family', 'of', 'polynomial', 'graph', 'invariants', 'giving', 'the', 'same', 'solution', 'of', 'the', 'kp', 'in', 'particular', 'we', 'introduce', 'the', 'abel', 'polynomial', 'for', 'graphs', 'and', 'show', 'this', 'for', 'its', 'generating', 'function', 'the', 'key', 'point', 'here', 'is', 'a', 'hopf', 'algebra', 'structure', 'on', 'the', 'space', 'spanned', 'by', 'graphs', 'and', 'the', 'behavior', 'of', 'the', 'invariants', 'on', 'its', 'primitive', 'space']]
|
[-0.18912408660412178, 0.0779980071124503, -0.08017696198290107, 0.09319606680294563, -0.11818811913481218, -0.08836120831640973, -0.004663799621764271, 0.29204601002054226, -0.3681719781852317, -0.24476720440340624, 0.12002271899669806, -0.23413410377635183, -0.21867688466933952, 0.1751128103819558, -0.04436741186434339, 0.055295251008797563, 0.06108471825611831, 0.0683968994370394, -0.1027350596864119, -0.26156992050611694, 0.4124717070030627, -0.035235076350556026, 0.18134600631678585, 0.03409250204761823, 0.1836705487629602, 0.024407511577010155, -0.020704221644106954, -0.0035855208005724027, -0.17948937789985614, 0.09712773286362832, 0.2304906855677201, 0.14534435944963547, 0.1910977040500455, -0.3615776015467, -0.12682413723287655, 0.17803530251318267, 0.13605667770594015, 0.04785975863375626, -0.013992313579281514, -0.243565838666226, 0.08252553795946055, -0.1394781841268902, -0.16882670024977248, -0.08518087741619126, 0.07394192896612074, 0.054835043090192236, -0.2487873018059569, 0.016022447571586603, 0.0829568934498419, 0.08896524918361984, -0.018504288735339183, -0.0979513447603275, -0.043698651614416946, 0.09047898255160143, -0.06467154288889262, 0.01467099707659291, 0.034273125985958455, -0.13959114169755457, -0.12056409338510585, 0.3780115816987055, -0.02308698454550628, -0.22876619641808257, 0.09342723111916419, -0.16567222835581707, -0.21795174342462387, 0.08895759039087457, 0.12584775785283966, 0.11870981871161139, -0.06526543520158157, 0.18123117280754678, -0.12432349465744591, 0.09458316548429055, 0.08602630116591423, 0.019810176459836893, 0.13107753917574883, 0.1345125353686383, 0.09476027841112394, 0.1964054699537569, 0.014847902498133052, -0.09321224943724, -0.3425043710004324, -0.18990903382922855, -0.2057652203673925, 0.06064057115454698, -0.18302346647940523, -0.2188796105998001, 0.5075659465751258, 0.10182081163464778, 0.1614247708870419, 0.15082610595500331, 0.1751517584204845, 0.15616357407864484, 0.05211835208980516, 0.07901433851816103, 0.13857801526185426, 0.1592638157361626, 0.058960191632524646, -0.18972732599867487, 0.05521801265823687, 0.1925942717687409]
|
1,803.09801
|
On approximations for the distribution of the time of first level
crossing
|
This paper is an overview of the classical level crossing problem which is
studied extensively in the literature and is fundamental in many branches of
applied probability. We discuss a number of approximations with an emphasis on
their performance, methods of justification and technical conditions which are
required in these methods, including a new approximation called "inverse
Gaussian". It is derived by a new method, is fruitful for solving related
problems, and is valid under mild regularity conditions. We emphasize its
novelty and boons.
|
math.PR
|
this paper is an overview of the classical level crossing problem which is studied extensively in the literature and is fundamental in many branches of applied probability we discuss a number of approximations with an emphasis on their performance methods of justification and technical conditions which are required in these methods including a new approximation called inverse gaussian it is derived by a new method is fruitful for solving related problems and is valid under mild regularity conditions we emphasize its novelty and boons
|
[['this', 'paper', 'is', 'an', 'overview', 'of', 'the', 'classical', 'level', 'crossing', 'problem', 'which', 'is', 'studied', 'extensively', 'in', 'the', 'literature', 'and', 'is', 'fundamental', 'in', 'many', 'branches', 'of', 'applied', 'probability', 'we', 'discuss', 'a', 'number', 'of', 'approximations', 'with', 'an', 'emphasis', 'on', 'their', 'performance', 'methods', 'of', 'justification', 'and', 'technical', 'conditions', 'which', 'are', 'required', 'in', 'these', 'methods', 'including', 'a', 'new', 'approximation', 'called', 'inverse', 'gaussian', 'it', 'is', 'derived', 'by', 'a', 'new', 'method', 'is', 'fruitful', 'for', 'solving', 'related', 'problems', 'and', 'is', 'valid', 'under', 'mild', 'regularity', 'conditions', 'we', 'emphasize', 'its', 'novelty', 'and', 'boons']]
|
[-0.09531184398086674, 0.036007951566716656, -0.0972530087007277, 0.11050587115074362, -0.07969879993540516, -0.11461394738001995, 0.008607592311665326, 0.3766145099695009, -0.25949806399104824, -0.2705227899735412, 0.16360406483473056, -0.19654696618756615, -0.19682977586446038, 0.26593044898416623, -0.12465428389294679, 0.08560415611992288, 0.07312661074158029, 0.061809587410191096, -0.08220926096315036, -0.25769454046259127, 0.3506728856858001, 0.03014576422746282, 0.2944403894565416, 0.09983131831654919, 0.11150202679122428, -0.021979396831782825, -0.048085017881569374, 0.04197536693908364, -0.1552047201527664, 0.14926224268540875, 0.23580374465469855, 0.14732653759027192, 0.34371638160019397, -0.404824011162462, -0.19214626935490195, 0.08401738175721166, 0.10282900400392442, 0.11749726014088345, -0.06744589033418795, -0.2523316433765443, 0.10097561983099904, -0.10489039294174816, -0.14375651170533285, -0.0638468035283577, -9.642723745789873e-05, 0.03877879106944584, -0.2830496953508581, 0.04318310693467418, 0.08607437917738255, 0.07334592123796423, -0.05041301376831504, -0.16643616736653338, 0.09533408137756479, 0.09291190723608057, 0.0885285043987973, -0.0035337457494355783, 0.03260710442169423, -0.16096810452045357, -0.10768199142023742, 0.400190393137465, -0.009008193500788814, -0.23117509244166942, 0.22976575974453556, -0.055330136673053705, -0.17689084759857282, 0.0950330624536398, 0.15662718864988132, 0.15597204644659377, -0.18277222323175296, 0.15540928483648922, -0.03779118146792234, 0.09686995360506587, 0.05306434425446822, 0.027914170164570033, 0.14545413399822113, 0.21106956409941235, 0.09578934772408579, 0.1416538570760693, -0.04965629345872047, -0.11828742963991251, -0.315740251798654, -0.1399718182587839, -0.16190278552562357, -0.00621626153588295, -0.03298212044678785, -0.15564103252871567, 0.3936949901350112, 0.17041156500653667, 0.16681943214442357, 0.017262123735531806, 0.2994517083672515, 0.19005158617643705, -0.008747922865314835, 0.06165216816589236, 0.20524690418605165, 0.16427475420746906, 0.049427540664258134, -0.16466024341847163, 0.07750755206805217, 0.07198817842830736]
|
1,803.09802
|
Investigating Photoinduced Proton Coupled Electron Transfer Reaction
using Quasi Diabatic Dynamics Propagation
|
We investigate photoinduced proton-coupled electron transfer (PI-PCET)
reaction through a recently devel- oped quasi-diabatic (QD) quantum dynamics
propagation scheme. This scheme enables interfacing accurate diabatic-based
quantum dynamics approaches with adiabatic electronic structure calculations
for on-the-fly simulations. Here, we use the QD scheme to directly propagate
PI-PCET quantum dynamics with the di- abatic Partial Linearized Density Matrix
(PLDM) path-integral approach with the instantaneous adiabatic electron-proton
vibronic states. Our numerical results demonstrate the importance of treating
proton quan- tum mechanically in order to obtain accurate PI-PCET dynamics, as
well as the role of solvent fluctuation and vibrational relaxation on proton
tunneling in various reaction regimes that exhibit different kinetic iso- tope
effects. This work opens the possibility to study the challenging PI-PCET
reactions through accurate diabatic quantum dynamics approaches combined with
efficient adiabatic electronic structure calculations.
|
physics.chem-ph quant-ph
|
we investigate photoinduced protoncoupled electron transfer pipcet reaction through a recently devel oped quasidiabatic qd quantum dynamics propagation scheme this scheme enables interfacing accurate diabaticbased quantum dynamics approaches with adiabatic electronic structure calculations for onthefly simulations here we use the qd scheme to directly propagate pipcet quantum dynamics with the di abatic partial linearized density matrix pldm pathintegral approach with the instantaneous adiabatic electronproton vibronic states our numerical results demonstrate the importance of treating proton quan tum mechanically in order to obtain accurate pipcet dynamics as well as the role of solvent fluctuation and vibrational relaxation on proton tunneling in various reaction regimes that exhibit different kinetic iso tope effects this work opens the possibility to study the challenging pipcet reactions through accurate diabatic quantum dynamics approaches combined with efficient adiabatic electronic structure calculations
|
[['we', 'investigate', 'photoinduced', 'protoncoupled', 'electron', 'transfer', 'pipcet', 'reaction', 'through', 'a', 'recently', 'devel', 'oped', 'quasidiabatic', 'qd', 'quantum', 'dynamics', 'propagation', 'scheme', 'this', 'scheme', 'enables', 'interfacing', 'accurate', 'diabaticbased', 'quantum', 'dynamics', 'approaches', 'with', 'adiabatic', 'electronic', 'structure', 'calculations', 'for', 'onthefly', 'simulations', 'here', 'we', 'use', 'the', 'qd', 'scheme', 'to', 'directly', 'propagate', 'pipcet', 'quantum', 'dynamics', 'with', 'the', 'di', 'abatic', 'partial', 'linearized', 'density', 'matrix', 'pldm', 'pathintegral', 'approach', 'with', 'the', 'instantaneous', 'adiabatic', 'electronproton', 'vibronic', 'states', 'our', 'numerical', 'results', 'demonstrate', 'the', 'importance', 'of', 'treating', 'proton', 'quan', 'tum', 'mechanically', 'in', 'order', 'to', 'obtain', 'accurate', 'pipcet', 'dynamics', 'as', 'well', 'as', 'the', 'role', 'of', 'solvent', 'fluctuation', 'and', 'vibrational', 'relaxation', 'on', 'proton', 'tunneling', 'in', 'various', 'reaction', 'regimes', 'that', 'exhibit', 'different', 'kinetic', 'iso', 'tope', 'effects', 'this', 'work', 'opens', 'the', 'possibility', 'to', 'study', 'the', 'challenging', 'pipcet', 'reactions', 'through', 'accurate', 'diabatic', 'quantum', 'dynamics', 'approaches', 'combined', 'with', 'efficient', 'adiabatic', 'electronic', 'structure', 'calculations']]
|
[-0.10270976475757462, 0.1538005267582114, -0.10254229037629116, 0.06220549437619576, 0.0017338209277526898, -0.14497736146387813, 0.04966211319675274, 0.38119089847543475, -0.2572759781068078, -0.25758639747051126, -0.06426345283751178, -0.2488786576767311, -0.16176253489031683, 0.18646148846583496, 0.08311278726482256, 0.1279746135343995, 0.08984274549540273, -0.10328361056886162, -0.06580313317174318, -0.13407238754161604, 0.2524723645130342, 0.12979152349571726, 0.31208216641309927, 0.10097454935770878, 0.0963261882584034, 0.05925972472565869, 0.040934820818206805, -0.06068297712640329, -0.18766463101008302, 0.10637012440631886, 0.2872740156775707, -0.00431504730262201, 0.24396809883006482, -0.5143248634130666, -0.2538702109084239, -0.02813368836756457, 0.12443960765835294, 0.2180245572870428, -0.03561144820361568, -0.2768579496522293, -0.014133031917453714, -0.2038244812671716, -0.08926882418436986, -0.19939906679439556, -0.02909575909606329, -0.007664573845624655, -0.23669289966787663, 0.11015136853551888, -0.040459638287729555, 0.03116517539831076, -0.03689119344309085, -0.0701270297938732, -0.009883229582831545, 0.0876739436141427, -0.04259702391661421, 0.014602221954688006, 0.22993758826774094, -0.054852140231312, -0.16015334154839034, 0.36719684822089743, -0.0793089745645623, -0.17164441533951144, 0.16837184574934794, -0.10702541193313664, -0.10554135161113333, 0.14164682154395533, 0.11161051342567203, 0.13640516551183254, -0.13009681033101073, 0.08446673390580779, 0.07173472449137604, 0.14301986373241313, 0.04326532977971841, 0.08357589735268531, 0.1344441159383154, 0.1674119663692898, -0.007196884103133484, 0.09564904084915972, -0.09013689335640238, -0.2026687336020228, -0.21646754081126401, -0.14582710707735247, -0.14324742939436075, 0.12449382521762428, -0.02855400628135557, -0.13487997884812736, 0.36637010351006954, 0.15649977654472672, 0.12406299565918744, -0.03044813136203271, 0.3360935107621392, 0.10276688042424874, -0.026028652058095868, 0.05735672293160336, 0.22958362654952164, 0.19062861809718676, 0.09691363717358785, -0.37665341709648736, 0.05394660899676665, 0.05617178126527561]
|
1,803.09803
|
Generating Talking Face Landmarks from Speech
|
The presence of a corresponding talking face has been shown to significantly
improve speech intelligibility in noisy conditions and for hearing impaired
population. In this paper, we present a system that can generate landmark
points of a talking face from an acoustic speech in real time. The system uses
a long short-term memory (LSTM) network and is trained on frontal videos of 27
different speakers with automatically extracted face landmarks. After training,
it can produce talking face landmarks from the acoustic speech of unseen
speakers and utterances. The training phase contains three key steps. We first
transform landmarks of the first video frame to pin the two eye points into two
predefined locations and apply the same transformation on all of the following
video frames. We then remove the identity information by transforming the
landmarks into a mean face shape across the entire training dataset. Finally,
we train an LSTM network that takes the first- and second-order temporal
differences of the log-mel spectrogram as input to predict face landmarks in
each frame. We evaluate our system using the mean-squared error (MSE) loss of
landmarks of lips between predicted and ground-truth landmarks as well as their
first- and second-order temporal differences. We further evaluate our system by
conducting subjective tests, where the subjects try to distinguish the real and
fake videos of talking face landmarks. Both tests show promising results.
|
cs.CV
|
the presence of a corresponding talking face has been shown to significantly improve speech intelligibility in noisy conditions and for hearing impaired population in this paper we present a system that can generate landmark points of a talking face from an acoustic speech in real time the system uses a long shortterm memory lstm network and is trained on frontal videos of 27 different speakers with automatically extracted face landmarks after training it can produce talking face landmarks from the acoustic speech of unseen speakers and utterances the training phase contains three key steps we first transform landmarks of the first video frame to pin the two eye points into two predefined locations and apply the same transformation on all of the following video frames we then remove the identity information by transforming the landmarks into a mean face shape across the entire training dataset finally we train an lstm network that takes the first and secondorder temporal differences of the logmel spectrogram as input to predict face landmarks in each frame we evaluate our system using the meansquared error mse loss of landmarks of lips between predicted and groundtruth landmarks as well as their first and secondorder temporal differences we further evaluate our system by conducting subjective tests where the subjects try to distinguish the real and fake videos of talking face landmarks both tests show promising results
|
[['the', 'presence', 'of', 'a', 'corresponding', 'talking', 'face', 'has', 'been', 'shown', 'to', 'significantly', 'improve', 'speech', 'intelligibility', 'in', 'noisy', 'conditions', 'and', 'for', 'hearing', 'impaired', 'population', 'in', 'this', 'paper', 'we', 'present', 'a', 'system', 'that', 'can', 'generate', 'landmark', 'points', 'of', 'a', 'talking', 'face', 'from', 'an', 'acoustic', 'speech', 'in', 'real', 'time', 'the', 'system', 'uses', 'a', 'long', 'shortterm', 'memory', 'lstm', 'network', 'and', 'is', 'trained', 'on', 'frontal', 'videos', 'of', '27', 'different', 'speakers', 'with', 'automatically', 'extracted', 'face', 'landmarks', 'after', 'training', 'it', 'can', 'produce', 'talking', 'face', 'landmarks', 'from', 'the', 'acoustic', 'speech', 'of', 'unseen', 'speakers', 'and', 'utterances', 'the', 'training', 'phase', 'contains', 'three', 'key', 'steps', 'we', 'first', 'transform', 'landmarks', 'of', 'the', 'first', 'video', 'frame', 'to', 'pin', 'the', 'two', 'eye', 'points', 'into', 'two', 'predefined', 'locations', 'and', 'apply', 'the', 'same', 'transformation', 'on', 'all', 'of', 'the', 'following', 'video', 'frames', 'we', 'then', 'remove', 'the', 'identity', 'information', 'by', 'transforming', 'the', 'landmarks', 'into', 'a', 'mean', 'face', 'shape', 'across', 'the', 'entire', 'training', 'dataset', 'finally', 'we', 'train', 'an', 'lstm', 'network', 'that', 'takes', 'the', 'first', 'and', 'secondorder', 'temporal', 'differences', 'of', 'the', 'logmel', 'spectrogram', 'as', 'input', 'to', 'predict', 'face', 'landmarks', 'in', 'each', 'frame', 'we', 'evaluate', 'our', 'system', 'using', 'the', 'meansquared', 'error', 'mse', 'loss', 'of', 'landmarks', 'of', 'lips', 'between', 'predicted', 'and', 'groundtruth', 'landmarks', 'as', 'well', 'as', 'their', 'first', 'and', 'secondorder', 'temporal', 'differences', 'we', 'further', 'evaluate', 'our', 'system', 'by', 'conducting', 'subjective', 'tests', 'where', 'the', 'subjects', 'try', 'to', 'distinguish', 'the', 'real', 'and', 'fake', 'videos', 'of', 'talking', 'face', 'landmarks', 'both', 'tests', 'show', 'promising', 'results']]
|
[-0.045987596208184926, 0.0048558324158311655, -0.06256196688602406, 0.06088703440570407, -0.07690949714192932, -0.1627659248737171, 0.013471572305580121, 0.4565081215223631, -0.25320590546915883, -0.30900870555148596, 0.07925723548612545, -0.31216877788878716, -0.20365790429161088, 0.14241046675859126, -0.18674508798521777, 0.0786394998314282, 0.12750924439027125, 0.1160336970427891, -0.06185465660341456, -0.29277410725025893, 0.2882514152590462, -0.020921202498492195, 0.3069762354309967, -0.0184472676383852, 0.17677570572305942, -0.04012109234768442, -0.03045995902945186, -0.04946237319966526, -0.018609000291173575, 0.11311284522729312, 0.2987315531517074, 0.21591322683916309, 0.28765632622920007, -0.44283977268044084, -0.17726080609265893, 0.07317671117140997, 0.13696071092958467, 0.1287318024353234, -0.009659801413077356, -0.45581842941032746, 0.11099497570278018, -0.09468621425289969, 0.05869647791796246, -0.07757134602799622, -0.014864414617191495, -0.01139988609326304, -0.2673264209910064, 0.06010764430426191, 0.079904911991343, 0.10819461421052799, -0.08813639932543885, -0.08729131090074502, -6.909029228881197e-05, 0.28113383448206897, 0.0767929987091262, 0.03810355178457705, 0.14609682641305258, -0.16987091484058936, -0.09171477249237875, 0.39709106041220177, -0.06283335414980477, -0.2171806804307098, 0.17179167002447632, -0.08456177534291513, -0.07475217711180449, 0.1109490417194142, 0.2607737900008037, 0.10327607673576598, -0.18847164940841366, -0.07177352167129127, -0.0547588433191896, 0.22874461265644833, 0.12700069308541226, -0.026268005820487394, 0.20056254577601337, 0.19447706008175444, -0.01262226701596158, 0.15462149450592047, -0.19436997434685585, 0.005794352678964362, -0.26934095320808316, -0.12328750462226537, -0.21928853478219654, -0.0662980662825554, -0.1155210134744091, -0.13643798394284748, 0.47109039249834017, 0.2515161608724029, 0.23117849313934621, 0.12909574276860702, 0.3390456286917835, 0.01304850523313304, 0.08608826305452881, 0.030008739623033714, 0.16894295247165916, -0.040783726795287766, 0.13108413441789918, -0.16648970578500277, 0.08147646819839181, 0.06891506907477259]
|
1,803.09804
|
Algebraic generators of the skein algebra of a surface
|
Let $\Sigma$ be a surface with negative Euler characteristic, genus at least
one and at most one boundary component. We prove that the skein algebra of
$\Sigma$ over the field of rational functions can be algebraically generated by
a finite number of simple closed curves that are naturally associated to
certain generators of the mapping class group of $\Sigma$. The action of the
mapping class group on the skein algebra gives canonical relations between
these generators. From this, we conjecture a presentation for a skein algebra
of $\Sigma$.
|
math.GT
|
let sigma be a surface with negative euler characteristic genus at least one and at most one boundary component we prove that the skein algebra of sigma over the field of rational functions can be algebraically generated by a finite number of simple closed curves that are naturally associated to certain generators of the mapping class group of sigma the action of the mapping class group on the skein algebra gives canonical relations between these generators from this we conjecture a presentation for a skein algebra of sigma
|
[['let', 'sigma', 'be', 'a', 'surface', 'with', 'negative', 'euler', 'characteristic', 'genus', 'at', 'least', 'one', 'and', 'at', 'most', 'one', 'boundary', 'component', 'we', 'prove', 'that', 'the', 'skein', 'algebra', 'of', 'sigma', 'over', 'the', 'field', 'of', 'rational', 'functions', 'can', 'be', 'algebraically', 'generated', 'by', 'a', 'finite', 'number', 'of', 'simple', 'closed', 'curves', 'that', 'are', 'naturally', 'associated', 'to', 'certain', 'generators', 'of', 'the', 'mapping', 'class', 'group', 'of', 'sigma', 'the', 'action', 'of', 'the', 'mapping', 'class', 'group', 'on', 'the', 'skein', 'algebra', 'gives', 'canonical', 'relations', 'between', 'these', 'generators', 'from', 'this', 'we', 'conjecture', 'a', 'presentation', 'for', 'a', 'skein', 'algebra', 'of', 'sigma']]
|
[-0.20182738004421646, 0.11805129339865578, -0.12815104256680404, 0.03224831631550015, -0.13357705702285536, -0.15836867308032446, -0.04672956774646247, 0.324495868410767, -0.3652401341890006, -0.24963519933887504, 0.06804170200220225, -0.2597289618901083, -0.14020645705750212, 0.25158602684016595, -0.07399853038474578, -0.06358283295015678, 0.04134998716075312, 0.13128265842202713, -0.14266966687070884, -0.24163065531121736, 0.40020814205689187, -0.06393543910764327, 0.17806676819666542, -0.004097607600587336, 0.13875183489554646, -0.005024447380988436, 0.0063011750144968655, 0.041861708675490016, -0.13177900411309648, 0.1427897954232652, 0.2960848083656112, 0.060384376485175875, 0.16528556738260455, -0.37016588817773893, -0.1600378035086165, 0.1849471385939978, 0.11361391659275713, 0.0035008692648261786, -0.004335542054666968, -0.2236582397864285, 0.14070717012757747, -0.18275466702603313, -0.15654520893109625, 0.00239609059644863, 0.05959395700351293, -0.014198921250433406, -0.21082383059811863, 0.0001654843164777214, 0.04643445022785189, 0.1845229342791506, -0.027216958577892827, -0.10243700673295693, -0.1013342426370152, 0.09101730641718446, -0.017461513730020008, 0.09228048334956508, 0.0820159799398177, -0.14435588642266917, -0.09735471204410052, 0.33630608867811546, -0.07631907886190509, -0.24784468338740143, 0.13307938191891563, -0.20953692522810094, -0.1747054590801285, 0.14778808763631704, 0.10137873242439871, 0.0996181411054832, -0.05920381754086437, 0.17043495512585982, -0.14717777095475784, 0.0882499367395543, 0.05563212391941554, -0.056505589936436576, 0.20554280747786502, 0.05554173597854308, 0.047721164830198344, 0.13838841569932728, -0.005780769729674582, -0.018295944075692783, -0.43251882857558405, -0.22565540894654326, -0.11227303734895858, 0.1579097267240286, -0.14055169352567728, -0.16819068541834978, 0.4333062142303044, 0.07558965701504018, 0.16765653640984304, 0.17749506461603398, 0.17507295369763265, 0.15672958346443588, 0.1224901266713542, 0.09229483532676981, 0.054461422926661646, 0.22506957102450542, -0.11437229071452748, -0.17951553336884404, -0.024992877739185296, 0.23567323910538107]
|
1,803.09805
|
A quasar hiding behind two dusty absorbers. Quantifying the selection
bias of metal-rich, damped Lyman-alpha absorption systems
|
The cosmic chemical enrichment as measured from damped Ly$\alpha$ absorbers
(DLAs) will be underestimated if dusty and metal-rich absorbers have evaded
identification. Here we report the discovery and present the spectroscopic
observations of a quasar, KV-RQ\,1500-0031, at $z=2.520$ reddened by a likely
dusty DLA at $z=2.428$ and a strong MgII absorber at $z=1.603$. This quasar was
identified as part of the KiDS-VIKING Red Quasar (KV-RQ) survey, specifically
aimed at targeting dusty absorbers which may cause the background quasars to
escape the optical selection of e.g. the SDSS quasar survey. For the DLA we
find an HI column density of $\log N$(HI) = $21.2\pm 0.1$ and a metallicity of
[X/H] = $-0.90\pm 0.20$ derived from an empirical relation based on the
equivalent width of SiII$\lambda$1526. We observe a total visual extinction of
$A_V=0.16$ mag induced by both absorbers. We compile a sample of 17 additional
dusty ($A_V > 0.1$ mag) DLAs toward quasars (QSO-DLAs) from the literature for
which we characterize the properties of HI column density, metallicity and
dust. From this sample we also estimate a correction factor to the overall DLA
metallicity budget. We demonstrate that the dusty QSO-DLAs have high metal
column densities ($\log N$(HI) + [X/H]) and are more similar to gamma-ray burst
(GRB)-selected DLAs (GRB-DLAs) than regular QSO-DLAs. We evaluate the effect of
dust reddening in DLAs as well as illustrate how the induced color excess of
the underlying quasars can be significant (up to $\sim 1$ mag in various
optical bands), even for low to moderate extinction values ($A_V \lesssim 0.6$
mag). Finally we discuss the direct and indirect implications of a significant
dust bias in both QSO- and GRB-DLA samples. [Abridged]
|
astro-ph.GA
|
the cosmic chemical enrichment as measured from damped lyalpha absorbers dlas will be underestimated if dusty and metalrich absorbers have evaded identification here we report the discovery and present the spectroscopic observations of a quasar kvrq15000031 at z2520 reddened by a likely dusty dla at z2428 and a strong mgii absorber at z1603 this quasar was identified as part of the kidsviking red quasar kvrq survey specifically aimed at targeting dusty absorbers which may cause the background quasars to escape the optical selection of eg the sdss quasar survey for the dla we find an hi column density of log nhi 212pm 01 and a metallicity of xh 090pm 020 derived from an empirical relation based on the equivalent width of siiilambda1526 we observe a total visual extinction of a_v016 mag induced by both absorbers we compile a sample of 17 additional dusty a_v 01 mag dlas toward quasars qsodlas from the literature for which we characterize the properties of hi column density metallicity and dust from this sample we also estimate a correction factor to the overall dla metallicity budget we demonstrate that the dusty qsodlas have high metal column densities log nhi xh and are more similar to gammaray burst grbselected dlas grbdlas than regular qsodlas we evaluate the effect of dust reddening in dlas as well as illustrate how the induced color excess of the underlying quasars can be significant up to sim 1 mag in various optical bands even for low to moderate extinction values a_v lesssim 06 mag finally we discuss the direct and indirect implications of a significant dust bias in both qso and grbdla samples abridged
|
[['the', 'cosmic', 'chemical', 'enrichment', 'as', 'measured', 'from', 'damped', 'lyalpha', 'absorbers', 'dlas', 'will', 'be', 'underestimated', 'if', 'dusty', 'and', 'metalrich', 'absorbers', 'have', 'evaded', 'identification', 'here', 'we', 'report', 'the', 'discovery', 'and', 'present', 'the', 'spectroscopic', 'observations', 'of', 'a', 'quasar', 'kvrq15000031', 'at', 'z2520', 'reddened', 'by', 'a', 'likely', 'dusty', 'dla', 'at', 'z2428', 'and', 'a', 'strong', 'mgii', 'absorber', 'at', 'z1603', 'this', 'quasar', 'was', 'identified', 'as', 'part', 'of', 'the', 'kidsviking', 'red', 'quasar', 'kvrq', 'survey', 'specifically', 'aimed', 'at', 'targeting', 'dusty', 'absorbers', 'which', 'may', 'cause', 'the', 'background', 'quasars', 'to', 'escape', 'the', 'optical', 'selection', 'of', 'eg', 'the', 'sdss', 'quasar', 'survey', 'for', 'the', 'dla', 'we', 'find', 'an', 'hi', 'column', 'density', 'of', 'log', 'nhi', '212pm', '01', 'and', 'a', 'metallicity', 'of', 'xh', '090pm', '020', 'derived', 'from', 'an', 'empirical', 'relation', 'based', 'on', 'the', 'equivalent', 'width', 'of', 'siiilambda1526', 'we', 'observe', 'a', 'total', 'visual', 'extinction', 'of', 'a_v016', 'mag', 'induced', 'by', 'both', 'absorbers', 'we', 'compile', 'a', 'sample', 'of', '17', 'additional', 'dusty', 'a_v', '01', 'mag', 'dlas', 'toward', 'quasars', 'qsodlas', 'from', 'the', 'literature', 'for', 'which', 'we', 'characterize', 'the', 'properties', 'of', 'hi', 'column', 'density', 'metallicity', 'and', 'dust', 'from', 'this', 'sample', 'we', 'also', 'estimate', 'a', 'correction', 'factor', 'to', 'the', 'overall', 'dla', 'metallicity', 'budget', 'we', 'demonstrate', 'that', 'the', 'dusty', 'qsodlas', 'have', 'high', 'metal', 'column', 'densities', 'log', 'nhi', 'xh', 'and', 'are', 'more', 'similar', 'to', 'gammaray', 'burst', 'grbselected', 'dlas', 'grbdlas', 'than', 'regular', 'qsodlas', 'we', 'evaluate', 'the', 'effect', 'of', 'dust', 'reddening', 'in', 'dlas', 'as', 'well', 'as', 'illustrate', 'how', 'the', 'induced', 'color', 'excess', 'of', 'the', 'underlying', 'quasars', 'can', 'be', 'significant', 'up', 'to', 'sim', '1', 'mag', 'in', 'various', 'optical', 'bands', 'even', 'for', 'low', 'to', 'moderate', 'extinction', 'values', 'a_v', 'lesssim', '06', 'mag', 'finally', 'we', 'discuss', 'the', 'direct', 'and', 'indirect', 'implications', 'of', 'a', 'significant', 'dust', 'bias', 'in', 'both', 'qso', 'and', 'grbdla', 'samples', 'abridged']]
|
[-0.0013464972688728627, 0.09110361873227137, 0.005119505448196575, 0.08125729608033204, -0.07061682340759291, -0.08304283192627272, 0.10985161349142217, 0.4984850029338081, -0.11784270324673995, -0.3317654338595018, 0.0066769617772221845, -0.3526929857982498, -0.019924964027628653, 0.15103614875752444, -0.0510008641738304, -0.017612299831300745, -0.03620063280071712, -0.18830321735684882, -0.03060578696236436, -0.3120347809766964, 0.2598557199720504, 0.08206878019461654, 0.1541191434072559, -0.02003497732715365, 0.10761234369568246, -0.14084806947195727, -0.11939619838277686, 0.015512519986105134, -0.18578327657615892, 0.03219314413057324, 0.28105495417806897, 0.0978727434023793, 0.24456760401152214, -0.2492275033213686, -0.19431437995144218, 0.07453471127862357, 0.21803362126882794, 0.07169467649282009, -0.08335071129406987, -0.2652833422509743, 0.06199743855516163, -0.17777261371858294, -0.17510992868645292, 0.12711922871520004, 0.053228004057100924, 0.05887006555139175, -0.21020134900749293, 0.18015947827777193, -0.01307867601434788, 0.16080072400915735, -0.07494266622146276, -0.13365985521396517, -0.10699393382990065, -0.002011400918072125, -0.037383472097088706, 0.057424491166822474, 0.2130785385304886, -0.1698696055662333, 0.0412655197650651, 0.43208142449763026, -0.12099605829697674, 0.06385164910857126, 0.20286990152221648, -0.2087950678788266, -0.20891333384052763, 0.1685180953044866, 0.1908268210941592, 0.0808765893266097, -0.14683493532521544, -0.011891593313929713, -0.046851917953704886, 0.26563367276399763, 0.01187902169020952, 0.11919386778026819, 0.29420646275305806, 0.06623286420330053, 0.06540875877517294, 0.048169610043548326, -0.24051429551393497, 0.08579699133746853, -0.23151574892185206, -0.11899915611160533, -0.10032495949944516, 0.18015467512491598, -0.19522134891243317, -0.12760154146455088, 0.30445766218604065, 0.19051225521065787, 0.2819241755624425, 0.09559714166367347, 0.3117019789838144, 0.1454768380976089, 0.06590745209354934, 0.08295315064946716, 0.3227120107900843, 0.1682501149284741, 0.05259465302806347, -0.1924791380358895, 0.11558896018947773, -0.005871865051394364]
|
1,803.09806
|
A convergent adaptive spline based finite element method for the
biLaplace operator using Nitsches method
|
We establish the convergence of an adaptive spline-based finite element
method of a fourth order elliptic problem with weakly imposed Dirichlet
boundary conditions using polynomial Bsplines.
|
math.NA
|
we establish the convergence of an adaptive splinebased finite element method of a fourth order elliptic problem with weakly imposed dirichlet boundary conditions using polynomial bsplines
|
[['we', 'establish', 'the', 'convergence', 'of', 'an', 'adaptive', 'splinebased', 'finite', 'element', 'method', 'of', 'a', 'fourth', 'order', 'elliptic', 'problem', 'with', 'weakly', 'imposed', 'dirichlet', 'boundary', 'conditions', 'using', 'polynomial', 'bsplines']]
|
[-0.15480664684079015, 0.018981716224516276, -0.14930438021054634, -0.017047993408945892, -0.1637895909549955, -0.1410040794334446, -0.04782380944547745, 0.32731000061791676, -0.38552116459378827, -0.18462140512509415, 0.20434299890453425, -0.1981687330855773, -0.074501361984473, 0.1299920826792144, -0.08148047456947657, 0.21428065267033303, 0.08866156010816877, 0.0558798686386301, -0.14982470624650326, -0.33350327911858374, 0.3736070438216512, -0.04704506946011232, 0.237285528331995, 0.028206476440223362, 0.16837053033165061, -0.04228162978632519, -0.028074556245253637, -0.00559991139632005, -0.19840030215429857, 0.16986114787421405, 0.2538466554833576, -0.04490250635605592, 0.3729459915596705, -0.43659446101922256, -0.14511837595357344, 0.16132805510782278, 0.11734229575197858, 0.0007784470485953185, -0.06490055189127676, -0.24830290159353843, 0.10362916636782196, -0.1532279490851439, -0.2494223659249166, -0.06756743880955932, -0.1566367496807988, 0.08940672047454147, -0.5025267320183607, 0.10716075070488912, 0.07778612388154635, 0.16332049793205583, -0.10730983395702563, -0.10700915875629737, 0.06761376946591414, -0.02514033214762234, -0.030284542679929964, -0.040829260958931766, -0.03261875760598251, -0.04662354104220867, -0.055370829856166474, 0.3445131661227116, -0.09688862341975507, -0.35773339903411955, 0.12081818137532817, -0.09954369164860019, -0.11455034253259118, 0.11629533409499206, 0.17809244367079094, 0.23225609499674577, -0.11083530305096737, 0.16750539088836655, -0.04632965876058174, 0.15345855795133573, 0.10230097045692113, -0.11604426358826458, 0.0299563488851373, 0.1802503581230457, 0.22074518736022022, 0.17863332936898446, -0.0390260819112882, -0.07763255394708651, -0.37729925160797745, -0.11319551083187644, -0.17863796178538066, -0.06624414324044035, -0.21718330265810856, -0.311963251290413, 0.33375891294473636, 0.10909639130561398, 0.09487639754437484, 0.10130577932040279, 0.21854710012960893, 0.21882056996512872, -0.022114488797692154, 0.09031757024618295, 0.07179256729208507, 0.2191142737865448, 0.0792211456081042, -0.2828422366426541, 0.05914237371717508, 0.3130079507827759]
|
1,803.09807
|
Deep learning as a tool for neural data analysis: speech classification
and cross-frequency coupling in human sensorimotor cortex
|
A fundamental challenge in neuroscience is to understand what structure in
the world is represented in spatially distributed patterns of neural activity
from multiple single-trial measurements. This is often accomplished by learning
a simple, linear transformations between neural features and features of the
sensory stimuli or motor task. While successful in some early sensory
processing areas, linear mappings are unlikely to be ideal tools for
elucidating nonlinear, hierarchical representations of higher-order brain areas
during complex tasks, such as the production of speech by humans. Here, we
apply deep networks to predict produced speech syllables from cortical surface
electric potentials recorded from human sensorimotor cortex. We found that deep
networks had higher decoding prediction accuracy compared to baseline models,
and also exhibited greater improvements in accuracy with increasing dataset
size. We further demonstrate that deep network's confusions revealed
hierarchical latent structure in the neural data, which recapitulated the
underlying articulatory nature of speech motor control. Finally, we used deep
networks to compare task-relevant information in different neural frequency
bands, and found that the high-gamma band contains the vast majority of
information relevant for the speech prediction task, with little-to-no
additional contribution from lower-frequencies. Together, these results
demonstrate the utility of deep networks as a data analysis tool for
neuroscience.
|
cs.NE q-bio.NC
|
a fundamental challenge in neuroscience is to understand what structure in the world is represented in spatially distributed patterns of neural activity from multiple singletrial measurements this is often accomplished by learning a simple linear transformations between neural features and features of the sensory stimuli or motor task while successful in some early sensory processing areas linear mappings are unlikely to be ideal tools for elucidating nonlinear hierarchical representations of higherorder brain areas during complex tasks such as the production of speech by humans here we apply deep networks to predict produced speech syllables from cortical surface electric potentials recorded from human sensorimotor cortex we found that deep networks had higher decoding prediction accuracy compared to baseline models and also exhibited greater improvements in accuracy with increasing dataset size we further demonstrate that deep networks confusions revealed hierarchical latent structure in the neural data which recapitulated the underlying articulatory nature of speech motor control finally we used deep networks to compare taskrelevant information in different neural frequency bands and found that the highgamma band contains the vast majority of information relevant for the speech prediction task with littletono additional contribution from lowerfrequencies together these results demonstrate the utility of deep networks as a data analysis tool for neuroscience
|
[['a', 'fundamental', 'challenge', 'in', 'neuroscience', 'is', 'to', 'understand', 'what', 'structure', 'in', 'the', 'world', 'is', 'represented', 'in', 'spatially', 'distributed', 'patterns', 'of', 'neural', 'activity', 'from', 'multiple', 'singletrial', 'measurements', 'this', 'is', 'often', 'accomplished', 'by', 'learning', 'a', 'simple', 'linear', 'transformations', 'between', 'neural', 'features', 'and', 'features', 'of', 'the', 'sensory', 'stimuli', 'or', 'motor', 'task', 'while', 'successful', 'in', 'some', 'early', 'sensory', 'processing', 'areas', 'linear', 'mappings', 'are', 'unlikely', 'to', 'be', 'ideal', 'tools', 'for', 'elucidating', 'nonlinear', 'hierarchical', 'representations', 'of', 'higherorder', 'brain', 'areas', 'during', 'complex', 'tasks', 'such', 'as', 'the', 'production', 'of', 'speech', 'by', 'humans', 'here', 'we', 'apply', 'deep', 'networks', 'to', 'predict', 'produced', 'speech', 'syllables', 'from', 'cortical', 'surface', 'electric', 'potentials', 'recorded', 'from', 'human', 'sensorimotor', 'cortex', 'we', 'found', 'that', 'deep', 'networks', 'had', 'higher', 'decoding', 'prediction', 'accuracy', 'compared', 'to', 'baseline', 'models', 'and', 'also', 'exhibited', 'greater', 'improvements', 'in', 'accuracy', 'with', 'increasing', 'dataset', 'size', 'we', 'further', 'demonstrate', 'that', 'deep', 'networks', 'confusions', 'revealed', 'hierarchical', 'latent', 'structure', 'in', 'the', 'neural', 'data', 'which', 'recapitulated', 'the', 'underlying', 'articulatory', 'nature', 'of', 'speech', 'motor', 'control', 'finally', 'we', 'used', 'deep', 'networks', 'to', 'compare', 'taskrelevant', 'information', 'in', 'different', 'neural', 'frequency', 'bands', 'and', 'found', 'that', 'the', 'highgamma', 'band', 'contains', 'the', 'vast', 'majority', 'of', 'information', 'relevant', 'for', 'the', 'speech', 'prediction', 'task', 'with', 'littletono', 'additional', 'contribution', 'from', 'lowerfrequencies', 'together', 'these', 'results', 'demonstrate', 'the', 'utility', 'of', 'deep', 'networks', 'as', 'a', 'data', 'analysis', 'tool', 'for', 'neuroscience']]
|
[-0.04788426859619249, 0.05022990139699564, -0.04350133614551618, 0.08659703113084687, -0.11013981324265112, -0.1630499258160519, 0.012844803749531921, 0.4583988780682178, -0.30026822244739476, -0.3235088263667562, 0.04940364587374913, -0.2803846507238737, -0.2961903834582761, 0.2046669314093528, -0.12653990219356176, 0.07892192075487928, 0.11756077965334562, 0.06425006969962359, -0.006402416135620884, -0.22334596016084335, 0.25163575387076176, 0.045522160286388634, 0.34513829686962394, 0.0002810045624610739, 0.10862503341536357, -0.06211280242364476, -0.05133039811834162, -0.05263279999520828, -0.026341459819008563, 0.18500703421268377, 0.3922520101771181, 0.1864104638380057, 0.3054145871029474, -0.48013019618456776, -0.2884622077696061, 0.09226728598069814, 0.14037101152791656, 0.10181516480962813, -0.01670104788125893, -0.3461065340195535, 0.07212079753525609, -0.13010755814341962, 0.007704128334658661, -0.12407335374956492, 0.01343899722782454, 0.002897130905544826, -0.24847888948614058, 0.07527613127702545, 0.06660973965803359, 0.14431106234486732, -0.08041549995226632, -0.09433557659979226, -0.028454102407061102, 0.191020810653811, 0.044508124367055, 0.06386034467858195, 0.17847416016097734, -0.23672538150114836, -0.15206210129075473, 0.3265731761654938, -0.04887440169352705, -0.17229395002972533, 0.21256191745526404, -0.06686647843843965, -0.18748439253636318, 0.10770789700996689, 0.2569852725620683, 0.035993138372061265, -0.19338987381220007, -0.02872411130476464, 0.014699930879669849, 0.22206526642928467, 0.05657244705050117, 0.01256999823687697, 0.21424588542386602, 0.2614030863207895, -0.04578870483156708, 0.13390170486254735, -0.10966106123124487, -0.07002208696268859, -0.182414907789148, -0.051726503880325576, -0.17044679584107608, -0.008070984152021957, -0.10716714086732321, -0.10059391518667844, 0.40244224291195835, 0.18472605847848067, 0.20862811553552926, 0.09915751700935174, 0.2971598382070233, 0.015817749822694484, 0.13886500100362237, 0.0611707046026238, 0.19539204608282898, 0.06700822858225357, 0.14758505805503522, -0.17928495305783795, 0.10432042893931126, -0.02251984012045488]
|
1,803.09808
|
About the entropic structure of detailed balanced multi-species
cross-diffusion equations
|
This paper links at the formal level the entropy structure of a multi-species
cross-diffusion system of Shigesada-Kawasaki-Teramoto (SKT) type satisfying the
detailed balance condition with the entropy structure of a reversible
microscopic many-particle Markov process on a discretised space. The link is
established by first performing a mean-field limit to a master equation over
discretised space. Then the spatial discretisation limit is performed in a
completely rigorous way. This by itself provides a novel strategy for proving
global existence of weak solutions to a class of cross-diffusion systems.
|
math.AP
|
this paper links at the formal level the entropy structure of a multispecies crossdiffusion system of shigesadakawasakiteramoto skt type satisfying the detailed balance condition with the entropy structure of a reversible microscopic manyparticle markov process on a discretised space the link is established by first performing a meanfield limit to a master equation over discretised space then the spatial discretisation limit is performed in a completely rigorous way this by itself provides a novel strategy for proving global existence of weak solutions to a class of crossdiffusion systems
|
[['this', 'paper', 'links', 'at', 'the', 'formal', 'level', 'the', 'entropy', 'structure', 'of', 'a', 'multispecies', 'crossdiffusion', 'system', 'of', 'shigesadakawasakiteramoto', 'skt', 'type', 'satisfying', 'the', 'detailed', 'balance', 'condition', 'with', 'the', 'entropy', 'structure', 'of', 'a', 'reversible', 'microscopic', 'manyparticle', 'markov', 'process', 'on', 'a', 'discretised', 'space', 'the', 'link', 'is', 'established', 'by', 'first', 'performing', 'a', 'meanfield', 'limit', 'to', 'a', 'master', 'equation', 'over', 'discretised', 'space', 'then', 'the', 'spatial', 'discretisation', 'limit', 'is', 'performed', 'in', 'a', 'completely', 'rigorous', 'way', 'this', 'by', 'itself', 'provides', 'a', 'novel', 'strategy', 'for', 'proving', 'global', 'existence', 'of', 'weak', 'solutions', 'to', 'a', 'class', 'of', 'crossdiffusion', 'systems']]
|
[-0.17427173612999136, 0.052979106057054276, -0.12718470325291326, 0.06459095057398785, -0.06897414310581305, -0.1362295161340047, 0.09948481778238519, 0.2643546311142431, -0.30088799813000316, -0.22559195077470082, 0.08345947168180085, -0.19799464140934023, -0.12480343448061665, 0.1346652179437859, -0.029569091751578857, 0.07872130422897912, 0.08011007665614174, 0.018701483577553354, -0.0708167646503584, -0.18885595265204425, 0.382886794943426, 0.05383749097712676, 0.27236642301167274, 0.0033258244987915864, 0.1920015553001907, -0.012979460913894318, -0.002607176683589139, 0.03536825038066705, -0.16728933656122535, 0.11278349585005674, 0.20555267214711587, 0.06569560693804471, 0.3094698963528076, -0.3911577702330595, -0.27072813810346735, 0.08683833543380554, 0.12545980153266678, 0.12497581917242231, -0.023428841491377996, -0.30470219417475164, 0.058710242473435675, -0.18772561227987436, -0.19228792991700835, -0.09687190882819281, -0.015718925299800256, 0.00015940118200060996, -0.28405414723568934, 0.10050835040270943, 0.12780425121838396, 0.08954254607670009, -0.06770844146905636, -0.004031696117387831, -0.031489082338256674, 0.08684311083263972, -0.038917399038341086, -0.017275490590029884, 0.06537255441600626, -0.10415478267929178, -0.09069178757702255, 0.3485641464543402, -0.08342734395939094, -0.2934296802956272, 0.19611563535132023, -0.095333760085685, -0.18994836665859277, 0.15167250406441532, 0.11269666508517483, 0.11600599029969255, -0.23350375695074696, 0.1379339525433765, -0.06381981141484258, 0.18168696750548075, 0.016846386578188023, -0.005441237235738134, 0.15408058992629362, 0.24713403851703994, 0.13481121264736762, 0.1369414124320346, 0.006234980327876242, -0.18044542863076043, -0.3451750042255629, -0.18766671092122456, -0.14616187147542156, 0.10987168981492604, -0.07973202654829947, -0.20454523778012532, 0.36527563589201734, 0.06916650562462481, 0.13482466727410528, 0.11029941357132471, 0.27858747977932746, 0.16744361804078586, -0.03047006305000237, 0.04042117963862521, 0.15867920689263634, 0.17911341985878113, 0.15301757734348279, -0.20802556185861415, 0.06345691365211016, 0.1871094649911604]
|
1,803.09809
|
A defect action for Wilson loops
|
An effective action is proposed to compute the expectation value of Wilson
loops in $(S)U(N)$ gauge theories. The action consists of fermions localized on
the loop and an Abelian gauge field that fixes the representation. The
discussion is limited to weak coupling and Wilson loops in the fundamental
representation extended along a smooth curve, but there are no restrictions on
the matter content as long as the theory has a UV fixed point or it is
conformal. For a circular Wilson loop it is found that the expectation value
coincides at leading order with the exact result of the $1/2$ BPS Wilson loop
of ${\cal N}=4$ super Yang-Mills, which is determined by a solvable Gaussian
matrix model. This hints towards a universal connection to string theory duals
and SYK models.
|
hep-th hep-lat hep-ph
|
an effective action is proposed to compute the expectation value of wilson loops in sun gauge theories the action consists of fermions localized on the loop and an abelian gauge field that fixes the representation the discussion is limited to weak coupling and wilson loops in the fundamental representation extended along a smooth curve but there are no restrictions on the matter content as long as the theory has a uv fixed point or it is conformal for a circular wilson loop it is found that the expectation value coincides at leading order with the exact result of the 12 bps wilson loop of cal n4 super yangmills which is determined by a solvable gaussian matrix model this hints towards a universal connection to string theory duals and syk models
|
[['an', 'effective', 'action', 'is', 'proposed', 'to', 'compute', 'the', 'expectation', 'value', 'of', 'wilson', 'loops', 'in', 'sun', 'gauge', 'theories', 'the', 'action', 'consists', 'of', 'fermions', 'localized', 'on', 'the', 'loop', 'and', 'an', 'abelian', 'gauge', 'field', 'that', 'fixes', 'the', 'representation', 'the', 'discussion', 'is', 'limited', 'to', 'weak', 'coupling', 'and', 'wilson', 'loops', 'in', 'the', 'fundamental', 'representation', 'extended', 'along', 'a', 'smooth', 'curve', 'but', 'there', 'are', 'no', 'restrictions', 'on', 'the', 'matter', 'content', 'as', 'long', 'as', 'the', 'theory', 'has', 'a', 'uv', 'fixed', 'point', 'or', 'it', 'is', 'conformal', 'for', 'a', 'circular', 'wilson', 'loop', 'it', 'is', 'found', 'that', 'the', 'expectation', 'value', 'coincides', 'at', 'leading', 'order', 'with', 'the', 'exact', 'result', 'of', 'the', '12', 'bps', 'wilson', 'loop', 'of', 'cal', 'n4', 'super', 'yangmills', 'which', 'is', 'determined', 'by', 'a', 'solvable', 'gaussian', 'matrix', 'model', 'this', 'hints', 'towards', 'a', 'universal', 'connection', 'to', 'string', 'theory', 'duals', 'and', 'syk', 'models']]
|
[-0.14879965951594595, 0.20923741240112576, -0.07452580939156737, 0.09315454240959997, -0.07785883155615571, -0.16730871003192777, 0.019185265173347524, 0.36729853517160965, -0.16452144786464767, -0.24417455781681033, 0.11362885700789495, -0.27773353182352506, -0.1573175481502683, 0.1110522533659465, -0.04369564317117833, 0.03795772565958592, 0.01420029536104546, 0.13773206232760388, -0.10427290613297373, -0.22674414870920234, 0.3099832154470138, 0.039063896111642515, 0.258286396951343, 0.0781820463697211, 0.11493928083576835, -0.006654610975573842, -0.015756377147940488, 0.019868867446740088, -0.04841324234652208, 0.12731051792730935, 0.1786035980325463, 0.042664105917971866, 0.15115855027420017, -0.37927379523618865, -0.22296386952511965, 0.08353207272190888, 0.1536955614395153, 0.09339446061774372, 0.017227792729122133, -0.24519982803612947, 0.06580736661473145, -0.1411530080788697, -0.18770229894166382, -0.04859392363757182, 0.04569376414516368, -0.14892052254424645, -0.2835371167291529, 0.011628359272995463, 0.0004975089588417457, 0.06011244345402072, -0.011994527332269802, -0.07367384987166868, -0.046227440492321664, 0.10225542314672986, 0.10405288199052358, 0.12834226404083893, 0.1149689010451906, -0.22559248313773422, -0.15323313041231953, 0.37951915342217457, -0.10437415096496877, -0.17205943571775256, 0.14842916639665, -0.1407308557858834, -0.1576395571554223, 0.11886803877177254, 0.06902677911611345, 0.1316903553791165, -0.11117838998817696, 0.2282840155696389, -0.11056468123211884, 0.13347897786275448, 0.07647321067678814, -0.010254102899657133, 0.27175250741151663, 0.06695581458580609, 0.06919832931329997, 0.11916591505018564, 0.005750829715711566, -0.16598445157556294, -0.3953601485834672, -0.11870609364973811, -0.12923819723252494, 0.08068999807493618, -0.14288213596144209, -0.22448192669007067, 0.3775221406947821, 0.11786706399367317, 0.20040900923956473, 0.08281972874403716, 0.20958229014291785, 0.1748002195533795, 0.11259385770043502, 0.08674952649654677, 0.21585990904400554, 0.19266114311042026, 0.05564649036924283, -0.2629467764421581, -0.08317224673138789, 0.20197128913222023]
|
1,803.0981
|
Automation of Processor Verification Using Recurrent Neural Networks
|
When considering simulation-based verification of processors, the current
trend is to generate stimuli using pseudorandom generators (PRGs), apply them
to the processor inputs and monitor the achieved coverage of its functionality
in order to determine verification completeness. Stimuli can have different
forms, for example, they can be represented by bit vectors applied to the input
ports of the processor or by programs that are loaded directly into the program
memory. In this paper, we propose a new technique dynamically altering
constraints for PRG via recurrent neural network, which receives a coverage
feedback from the simulation of design under verification. For the
demonstration purposes we used processors provided by Codasip as their coverage
state space is reasonably big and differs for various kinds of processors.
Nevertheless, techniques presented in this paper are widely applicable. The
results of experiments show that not only the coverage closure is achieved much
sooner, but we are able to isolate a small set of stimuli with high coverage
that can be used for running regression tests.
|
cs.OH
|
when considering simulationbased verification of processors the current trend is to generate stimuli using pseudorandom generators prgs apply them to the processor inputs and monitor the achieved coverage of its functionality in order to determine verification completeness stimuli can have different forms for example they can be represented by bit vectors applied to the input ports of the processor or by programs that are loaded directly into the program memory in this paper we propose a new technique dynamically altering constraints for prg via recurrent neural network which receives a coverage feedback from the simulation of design under verification for the demonstration purposes we used processors provided by codasip as their coverage state space is reasonably big and differs for various kinds of processors nevertheless techniques presented in this paper are widely applicable the results of experiments show that not only the coverage closure is achieved much sooner but we are able to isolate a small set of stimuli with high coverage that can be used for running regression tests
|
[['when', 'considering', 'simulationbased', 'verification', 'of', 'processors', 'the', 'current', 'trend', 'is', 'to', 'generate', 'stimuli', 'using', 'pseudorandom', 'generators', 'prgs', 'apply', 'them', 'to', 'the', 'processor', 'inputs', 'and', 'monitor', 'the', 'achieved', 'coverage', 'of', 'its', 'functionality', 'in', 'order', 'to', 'determine', 'verification', 'completeness', 'stimuli', 'can', 'have', 'different', 'forms', 'for', 'example', 'they', 'can', 'be', 'represented', 'by', 'bit', 'vectors', 'applied', 'to', 'the', 'input', 'ports', 'of', 'the', 'processor', 'or', 'by', 'programs', 'that', 'are', 'loaded', 'directly', 'into', 'the', 'program', 'memory', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'technique', 'dynamically', 'altering', 'constraints', 'for', 'prg', 'via', 'recurrent', 'neural', 'network', 'which', 'receives', 'a', 'coverage', 'feedback', 'from', 'the', 'simulation', 'of', 'design', 'under', 'verification', 'for', 'the', 'demonstration', 'purposes', 'we', 'used', 'processors', 'provided', 'by', 'codasip', 'as', 'their', 'coverage', 'state', 'space', 'is', 'reasonably', 'big', 'and', 'differs', 'for', 'various', 'kinds', 'of', 'processors', 'nevertheless', 'techniques', 'presented', 'in', 'this', 'paper', 'are', 'widely', 'applicable', 'the', 'results', 'of', 'experiments', 'show', 'that', 'not', 'only', 'the', 'coverage', 'closure', 'is', 'achieved', 'much', 'sooner', 'but', 'we', 'are', 'able', 'to', 'isolate', 'a', 'small', 'set', 'of', 'stimuli', 'with', 'high', 'coverage', 'that', 'can', 'be', 'used', 'for', 'running', 'regression', 'tests']]
|
[-0.11213474254641881, 0.07215116696829009, -0.06631075902208244, 0.04993792797353383, -0.07660757362313525, -0.17618977488741863, 0.06971269597245322, 0.4191089154954052, -0.27066831939341224, -0.344394266112162, 0.1358896965669336, -0.2324655267724095, -0.12030457557019221, 0.24870174596521497, -0.09264348688970744, 0.078632461474368, 0.0855273599915493, 0.018549797663839875, -0.03151153305685974, -0.2884943489530868, 0.2620919582395423, 0.05049793703547684, 0.2775009518925627, -0.012255377227443232, 0.08350996761279698, -0.011848545087688773, -0.013914249156816648, 0.028968245143548878, -0.07740582462902885, 0.11096633428751805, 0.29962962416287225, 0.21945353950643856, 0.25599566068963187, -0.45715704550360436, -0.1897261653855972, 0.08570030794724183, 0.14242142825056772, 0.11081896765094207, -0.03985742822471323, -0.27370067198138087, 0.130801852413635, -0.18325732021245378, -0.04393424310297127, -0.1381190593999166, -0.009602371816793402, 0.05303443542739713, -0.30674166624990884, -0.03056442716225056, 0.038954169377849915, 0.04193817477496947, -0.007659372393477201, -0.08262709866018866, 0.009560101547763412, 0.17036954228736642, -0.0050478681423232925, 0.037718311817379745, 0.1452059480444302, -0.12360222335145726, -0.14022155580821738, 0.3787617242299902, -0.03467535368027717, -0.21401849381912214, 0.19378156794824763, -0.08420992990371567, -0.1426387499775407, 0.09761105544628168, 0.22519883432924284, 0.07610847309132564, -0.16344159629966404, 0.019972313885003902, 0.003803579500441015, 0.21760028450213892, 0.058130534183917316, 0.03111976234396622, 0.18699382918269633, 0.19136259165184694, 0.04092123567336101, 0.18777983991385122, -0.06465630710538967, -0.053090881928250455, -0.27176119596146314, -0.11156464141336155, -0.19296013519785107, -0.005437427245754853, -0.042558665896907794, -0.11244967814187723, 0.3906995073352119, 0.1912742523206453, 0.163187290150562, 0.10719868760549439, 0.3332062947437079, 0.11006075363702998, 0.14559532806536282, 0.08678335108182575, 0.1971387417632921, 0.06669339313744925, 0.099356295984547, -0.15822210923848487, 0.11619666790518739, -0.007467372567766931]
|
1,803.09811
|
Systematic measurements of the night sky brightness at 26 locations in
Eastern Austria
|
We present an analysis of the zenithal night sky brightness (henceforth: NSB)
measurements at 26 locations in Eastern Austria focussing on the years
2015-2016, both during clear and cloudy to overcast nights. All measurements
have been performed with 'Sky Quality Meters' (SQMs). For some of the
locations, simultaneous aerosol content measurements are available, such that
we were able to find a correlation between light pollution and air pollution at
those stations. For all locations, we examined the circalunar periodicity of
the NSB, seasonal variations as well as long-term trends in the recorded light
pollution. For several remote locations, a darkening of the night sky due to
clouds by up to 1 magnitude is recorded - indicating a very low level of light
pollution -, while for the majority of the examined locations, a brightening of
the night sky by up to a factor of 15 occurs due to clouds. We present suitable
ways to plot and analyze huge long-term NSB datasets, such as mean-NSB
histograms, circalunar, annual ('hourglass') and cumulative ('jellyfish')
plots. We show that five of the examined locations reach sufficiently low
levels of light pollution - with NSB values down to 21.8 mag$_{SQM}$/arcsec$^2$
- as to allow the establishment of dark sky reserves. Based on the 'hourglass'
plots, we find a strong circalunar periodicity of the NSB in small towns and
villages (< 5.000 inhabitants), with amplitudes of of up to 5 magnitudes. Using
the 'jellyfish' plots, on the other hand, we demonstrate that the examined city
skies brighten by up to 3 magnitudes under cloudy conditions, which strongly
dominate in those cumulative data representations. The long-term development of
the night sky brightness was evaluated based on the 2012-17 data for one of our
sites, possibly indicating a slight (~2%) decrease of the mean zenithal NSB at
the Vienna University Observatory.
|
astro-ph.IM
|
we present an analysis of the zenithal night sky brightness henceforth nsb measurements at 26 locations in eastern austria focussing on the years 20152016 both during clear and cloudy to overcast nights all measurements have been performed with sky quality meters sqms for some of the locations simultaneous aerosol content measurements are available such that we were able to find a correlation between light pollution and air pollution at those stations for all locations we examined the circalunar periodicity of the nsb seasonal variations as well as longterm trends in the recorded light pollution for several remote locations a darkening of the night sky due to clouds by up to 1 magnitude is recorded indicating a very low level of light pollution while for the majority of the examined locations a brightening of the night sky by up to a factor of 15 occurs due to clouds we present suitable ways to plot and analyze huge longterm nsb datasets such as meannsb histograms circalunar annual hourglass and cumulative jellyfish plots we show that five of the examined locations reach sufficiently low levels of light pollution with nsb values down to 218 mag_sqmarcsec2 as to allow the establishment of dark sky reserves based on the hourglass plots we find a strong circalunar periodicity of the nsb in small towns and villages 5000 inhabitants with amplitudes of of up to 5 magnitudes using the jellyfish plots on the other hand we demonstrate that the examined city skies brighten by up to 3 magnitudes under cloudy conditions which strongly dominate in those cumulative data representations the longterm development of the night sky brightness was evaluated based on the 201217 data for one of our sites possibly indicating a slight 2 decrease of the mean zenithal nsb at the vienna university observatory
|
[['we', 'present', 'an', 'analysis', 'of', 'the', 'zenithal', 'night', 'sky', 'brightness', 'henceforth', 'nsb', 'measurements', 'at', '26', 'locations', 'in', 'eastern', 'austria', 'focussing', 'on', 'the', 'years', '20152016', 'both', 'during', 'clear', 'and', 'cloudy', 'to', 'overcast', 'nights', 'all', 'measurements', 'have', 'been', 'performed', 'with', 'sky', 'quality', 'meters', 'sqms', 'for', 'some', 'of', 'the', 'locations', 'simultaneous', 'aerosol', 'content', 'measurements', 'are', 'available', 'such', 'that', 'we', 'were', 'able', 'to', 'find', 'a', 'correlation', 'between', 'light', 'pollution', 'and', 'air', 'pollution', 'at', 'those', 'stations', 'for', 'all', 'locations', 'we', 'examined', 'the', 'circalunar', 'periodicity', 'of', 'the', 'nsb', 'seasonal', 'variations', 'as', 'well', 'as', 'longterm', 'trends', 'in', 'the', 'recorded', 'light', 'pollution', 'for', 'several', 'remote', 'locations', 'a', 'darkening', 'of', 'the', 'night', 'sky', 'due', 'to', 'clouds', 'by', 'up', 'to', '1', 'magnitude', 'is', 'recorded', 'indicating', 'a', 'very', 'low', 'level', 'of', 'light', 'pollution', 'while', 'for', 'the', 'majority', 'of', 'the', 'examined', 'locations', 'a', 'brightening', 'of', 'the', 'night', 'sky', 'by', 'up', 'to', 'a', 'factor', 'of', '15', 'occurs', 'due', 'to', 'clouds', 'we', 'present', 'suitable', 'ways', 'to', 'plot', 'and', 'analyze', 'huge', 'longterm', 'nsb', 'datasets', 'such', 'as', 'meannsb', 'histograms', 'circalunar', 'annual', 'hourglass', 'and', 'cumulative', 'jellyfish', 'plots', 'we', 'show', 'that', 'five', 'of', 'the', 'examined', 'locations', 'reach', 'sufficiently', 'low', 'levels', 'of', 'light', 'pollution', 'with', 'nsb', 'values', 'down', 'to', '218', 'mag_sqmarcsec2', 'as', 'to', 'allow', 'the', 'establishment', 'of', 'dark', 'sky', 'reserves', 'based', 'on', 'the', 'hourglass', 'plots', 'we', 'find', 'a', 'strong', 'circalunar', 'periodicity', 'of', 'the', 'nsb', 'in', 'small', 'towns', 'and', 'villages', '5000', 'inhabitants', 'with', 'amplitudes', 'of', 'of', 'up', 'to', '5', 'magnitudes', 'using', 'the', 'jellyfish', 'plots', 'on', 'the', 'other', 'hand', 'we', 'demonstrate', 'that', 'the', 'examined', 'city', 'skies', 'brighten', 'by', 'up', 'to', '3', 'magnitudes', 'under', 'cloudy', 'conditions', 'which', 'strongly', 'dominate', 'in', 'those', 'cumulative', 'data', 'representations', 'the', 'longterm', 'development', 'of', 'the', 'night', 'sky', 'brightness', 'was', 'evaluated', 'based', 'on', 'the', '201217', 'data', 'for', 'one', 'of', 'our', 'sites', 'possibly', 'indicating', 'a', 'slight', '2', 'decrease', 'of', 'the', 'mean', 'zenithal', 'nsb', 'at', 'the', 'vienna', 'university', 'observatory']]
|
[-0.0880040074619968, 0.12344587278892356, -0.07338930823292734, 0.0899124713457265, -0.019776516962903425, -0.05912574477976729, 0.10203518786599759, 0.4039395169631855, -0.17806253812936168, -0.39474481875643236, 0.15129386412366796, -0.3417248102408406, -0.07098802712248839, 0.22558321887186752, -0.08644217359078293, -0.018709767857954657, 0.05386366617017917, -0.028443577898370504, -0.03944972620553705, -0.281473242837426, 0.21899558890790277, 0.082605070174936, 0.2784106378456125, 0.04053000157728093, 0.11158067820754179, -0.03810584741940319, -0.10155367095069016, -0.019588152553911345, -0.07669755176290916, 0.04299882165587159, 0.24054792711772402, 0.121919877757161, 0.2005996438029625, -0.41440118571139267, -0.19514823918045196, 0.07717407659180714, 0.09100703245604637, 0.02620456157795136, -0.027784582520866564, -0.29224419892243286, 0.05772327511363688, -0.14320284333961034, -0.14907288704125676, 0.019497915241486596, 0.055550794529325855, 0.04026513481870564, -0.21256950618998097, 0.0810517439476334, -0.04026076844329018, 0.18096954693917083, -0.07476712284480183, -0.13268558219912135, -0.050768864166457206, 0.17398547131656292, 0.04826544552909311, 0.009857324704798148, 0.13294823275803513, -0.11190674656442039, -0.042406352376683325, 0.3830029007756919, -0.1132657792937558, -0.0100520029789894, 0.16712588203734266, -0.21006450925110462, -0.12757024221040458, 0.15996758952246024, 0.215863885969943, 0.0666096744951918, -0.16020247328875437, -0.04362714610289078, -0.01205900266949037, 0.19081985917551178, 0.12536583056302136, 0.014877468144805863, 0.2502028348893431, 0.1264279011300312, 0.07411866043725782, 0.10655233007737724, -0.27994035780303983, -0.055971979914780555, -0.24256639475690364, -0.07134874546554291, -0.09087226603406708, 0.004683665012094393, -0.0812542762265071, -0.12790941102807787, 0.42844774129893315, 0.16452956765361532, 0.19191589651667085, 0.044909585810052485, 0.2943777460317801, 0.037177014719172556, 0.09648157092601035, 0.09324240206734503, 0.2396654873820709, 0.038367912667987135, 0.1574103403340937, -0.17469099547786363, 0.06815620109547446, -0.05326140400437588]
|
1,803.09812
|
Diffusive stability against nonlocalized perturbations of planar wave
trains in reaction-diffusion systems
|
Planar wave trains are traveling wave solutions whose wave profiles are
periodic in one spatial direction and constant in the transverse direction. In
this paper, we investigate the stability of planar wave trains in
reaction-diffusion systems. We establish nonlinear diffusive stability against
perturbations that are bounded along a line in $\mathbb{R}^2$ and decay
exponentially in the distance from this line. Our analysis is the first to
treat spatially nonlocalized perturbations that do not originate from a phase
modulation. We also consider perturbations that are fully localized and
establish nonlinear stability with better decay rates, suggesting a trade-off
between spatial localization of perturbations and temporal decay rate. Our
stability analysis utilizes pointwise estimates to exploit the spatial
structure of the perturbations. The nonlocalization of perturbations prevents
the use of damping estimates in the nonlinear iteration scheme; instead, we
track the perturbed solution in two different coordinate systems.
|
math.AP nlin.PS
|
planar wave trains are traveling wave solutions whose wave profiles are periodic in one spatial direction and constant in the transverse direction in this paper we investigate the stability of planar wave trains in reactiondiffusion systems we establish nonlinear diffusive stability against perturbations that are bounded along a line in mathbbr2 and decay exponentially in the distance from this line our analysis is the first to treat spatially nonlocalized perturbations that do not originate from a phase modulation we also consider perturbations that are fully localized and establish nonlinear stability with better decay rates suggesting a tradeoff between spatial localization of perturbations and temporal decay rate our stability analysis utilizes pointwise estimates to exploit the spatial structure of the perturbations the nonlocalization of perturbations prevents the use of damping estimates in the nonlinear iteration scheme instead we track the perturbed solution in two different coordinate systems
|
[['planar', 'wave', 'trains', 'are', 'traveling', 'wave', 'solutions', 'whose', 'wave', 'profiles', 'are', 'periodic', 'in', 'one', 'spatial', 'direction', 'and', 'constant', 'in', 'the', 'transverse', 'direction', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'stability', 'of', 'planar', 'wave', 'trains', 'in', 'reactiondiffusion', 'systems', 'we', 'establish', 'nonlinear', 'diffusive', 'stability', 'against', 'perturbations', 'that', 'are', 'bounded', 'along', 'a', 'line', 'in', 'mathbbr2', 'and', 'decay', 'exponentially', 'in', 'the', 'distance', 'from', 'this', 'line', 'our', 'analysis', 'is', 'the', 'first', 'to', 'treat', 'spatially', 'nonlocalized', 'perturbations', 'that', 'do', 'not', 'originate', 'from', 'a', 'phase', 'modulation', 'we', 'also', 'consider', 'perturbations', 'that', 'are', 'fully', 'localized', 'and', 'establish', 'nonlinear', 'stability', 'with', 'better', 'decay', 'rates', 'suggesting', 'a', 'tradeoff', 'between', 'spatial', 'localization', 'of', 'perturbations', 'and', 'temporal', 'decay', 'rate', 'our', 'stability', 'analysis', 'utilizes', 'pointwise', 'estimates', 'to', 'exploit', 'the', 'spatial', 'structure', 'of', 'the', 'perturbations', 'the', 'nonlocalization', 'of', 'perturbations', 'prevents', 'the', 'use', 'of', 'damping', 'estimates', 'in', 'the', 'nonlinear', 'iteration', 'scheme', 'instead', 'we', 'track', 'the', 'perturbed', 'solution', 'in', 'two', 'different', 'coordinate', 'systems']]
|
[-0.2026523391091048, 0.11385427116837403, -0.06233665127983342, 0.06627323902738344, -0.05531643812659465, -0.11258418033575665, -0.030931579012883036, 0.3774127300114256, -0.29912607138976455, -0.20498430884558044, 0.1308611771701803, -0.2791914796673578, -0.16334716594229415, 0.15204349157084673, 0.0006985473956861725, 0.08033762437774647, 0.0518609789289432, 0.008478990421081856, -0.0674234285890061, -0.15551395708223015, 0.34921604450728283, 0.008298164763015835, 0.2947331197202614, -0.02041645348709944, 0.04482755651825095, -0.01958239380244727, -0.023522791988535286, 0.0006644983507999002, -0.13720533110065608, 0.08407274446903078, 0.19091627106556114, 0.07766283648359679, 0.27597146198210903, -0.4594738982770949, -0.2514107841360447, 0.08828701288120387, 0.1917221000328762, 0.1712816980514318, -0.05206596302123715, -0.30153023972246185, 0.0831485079164451, -0.08849308645346342, -0.17943423688539292, -0.058048839795671096, -0.0060402886919702775, 0.11437969068495862, -0.2687669064174247, 0.1430145385529613, 0.07980383846235832, -0.008485543414031805, -0.11451905262847878, 0.006516619062382881, -0.03803375725991616, 0.09844201233888632, 0.07492537620518841, 0.002332508570374283, 0.0816437271009008, -0.0779763125776224, -0.08448111773659922, 0.3240627621632222, -0.13866249594138935, -0.26408758023849443, 0.19015252290370122, -0.16813698835505095, -0.08765993669488761, 0.16388214610465993, 0.24598673378673147, 0.1310472209261705, -0.11855957648327753, 0.05486169785471658, 0.012032916849520542, 0.214175219838954, 0.12302822396733275, 0.06551378540222673, 0.15962112936739847, 0.13357874083217897, 0.1292698391448477, 0.131039785811668, -0.09925120150469473, -0.11879490061714122, -0.2991772318794711, -0.08317118037606858, -0.12532068787091602, 0.010045414707286137, -0.08434279912672873, -0.19225305817026186, 0.4404673796930868, 0.14396021054572847, 0.21308203733666506, 0.0809232024571616, 0.2718146501766033, 0.13236994774253044, -0.004486153072881678, 0.10883145461700959, 0.29574120561560385, 0.13859893510768778, 0.1252714409811856, -0.2437968752984825, 0.04295143299761598, 0.07009971726792211]
|
1,803.09813
|
A tunable coupling scheme for implementing high-fidelity two-qubit gates
|
The prospect of computational hardware with quantum advantage relies
critically on the quality of quantum gate operations. Imperfect two-qubit gates
is a major bottleneck for achieving scalable quantum information processors.
Here, we propose a generalizable and extensible scheme for a two-qubit coupler
switch that controls the qubit-qubit coupling by modulating the coupler
frequency. Two-qubit gate operations can be implemented by operating the
coupler in the dispersive regime, which is non-invasive to the qubit states. We
investigate the performance of the scheme by simulating a universal two-qubit
gate on a superconducting quantum circuit, and find that errors from known
parasitic effects are strongly suppressed. The scheme is compatible with
existing high-coherence hardware, thereby promising a higher gate fidelity with
current technologies.
|
quant-ph
|
the prospect of computational hardware with quantum advantage relies critically on the quality of quantum gate operations imperfect twoqubit gates is a major bottleneck for achieving scalable quantum information processors here we propose a generalizable and extensible scheme for a twoqubit coupler switch that controls the qubitqubit coupling by modulating the coupler frequency twoqubit gate operations can be implemented by operating the coupler in the dispersive regime which is noninvasive to the qubit states we investigate the performance of the scheme by simulating a universal twoqubit gate on a superconducting quantum circuit and find that errors from known parasitic effects are strongly suppressed the scheme is compatible with existing highcoherence hardware thereby promising a higher gate fidelity with current technologies
|
[['the', 'prospect', 'of', 'computational', 'hardware', 'with', 'quantum', 'advantage', 'relies', 'critically', 'on', 'the', 'quality', 'of', 'quantum', 'gate', 'operations', 'imperfect', 'twoqubit', 'gates', 'is', 'a', 'major', 'bottleneck', 'for', 'achieving', 'scalable', 'quantum', 'information', 'processors', 'here', 'we', 'propose', 'a', 'generalizable', 'and', 'extensible', 'scheme', 'for', 'a', 'twoqubit', 'coupler', 'switch', 'that', 'controls', 'the', 'qubitqubit', 'coupling', 'by', 'modulating', 'the', 'coupler', 'frequency', 'twoqubit', 'gate', 'operations', 'can', 'be', 'implemented', 'by', 'operating', 'the', 'coupler', 'in', 'the', 'dispersive', 'regime', 'which', 'is', 'noninvasive', 'to', 'the', 'qubit', 'states', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'scheme', 'by', 'simulating', 'a', 'universal', 'twoqubit', 'gate', 'on', 'a', 'superconducting', 'quantum', 'circuit', 'and', 'find', 'that', 'errors', 'from', 'known', 'parasitic', 'effects', 'are', 'strongly', 'suppressed', 'the', 'scheme', 'is', 'compatible', 'with', 'existing', 'highcoherence', 'hardware', 'thereby', 'promising', 'a', 'higher', 'gate', 'fidelity', 'with', 'current', 'technologies']]
|
[-0.23402338036491224, 0.17588890249996136, 0.010864218695011611, -0.029883610227746733, -0.005464987829327583, -0.33180638612248003, 0.10998606305996267, 0.420551403829207, -0.20609171432442963, -0.2822338801032553, 0.043289688796115416, -0.18380670733361815, -0.1382779827346288, 0.3333085766217361, -0.08018886230808372, 0.1287950244091917, 0.07612356851265455, -0.053720880129064126, -0.08880711313419548, -0.2538441735513819, 0.2572585446978337, 0.05809261888110389, 0.35102124196710066, 0.040272663060265286, 0.12464588691364042, -0.02714888707268983, 0.08713807358096043, -0.06104759302882788, -0.0502647222418697, 0.11424088604544522, 0.28188210201915354, 0.08187861131348957, 0.26479907997030144, -0.4715434115928171, -0.16493270971501867, 0.025361289467158106, 0.08360098061190607, 0.1985990924789803, -0.04944842056720518, -0.33726550414382167, 0.021707060482973852, -0.20049238281014065, -0.039794401347171514, -0.1329281030416799, -0.028546188632026313, -0.03232972980864967, -0.27330219171320397, 0.027018088412781558, 0.051155208932080615, 0.002473193465266377, 0.0912622451588201, -0.00015833574968079727, 0.0478800931169341, 0.07283978081929186, -0.16314342330636766, 0.021138601209774302, 0.25178299515537217, -0.10762336379266343, -0.21447507325016582, 0.3030570161373665, -0.023120146033276494, -0.19195621368320037, 0.11512595182284713, -0.07069990747453024, -0.03341480165254325, 0.0639022137504071, 0.12046410944700862, 0.03250912055373192, -0.15179739408098006, 0.09926075877641173, 0.09522298160009086, 0.2509705761137108, 0.03070748153841123, 0.16095409498860438, 0.18040307001792827, 0.19506853603913138, 0.13136728078243323, 0.20886747672435982, -0.05132473783645158, -0.09349786585274462, -0.28947466176080827, -0.17302598679283013, -0.23508927511672179, 0.07040467181747469, -0.07026717245632123, -0.13652531542538782, 0.4333059185390994, 0.14652424032392447, 0.08819161617235902, 0.0194387772983949, 0.41100319353863596, 0.11263853297568857, 0.1415918742539361, 0.08716642526754488, 0.23588503292606522, 0.1589388153962015, 0.046081992168910804, -0.3309989463479724, 0.09425953744988268, -0.03918562593947475]
|
1,803.09814
|
Crowd-based Multi-Predicate Screening of Papers in Literature Reviews
|
Systematic literature reviews (SLRs) are one of the most common and useful
form of scientific research and publication. Tens of thousands of SLRs are
published each year, and this rate is growing across all fields of science.
Performing an accurate, complete and unbiased SLR is however a difficult and
expensive endeavor. This is true in general for all phases of a literature
review, and in particular for the paper screening phase, where authors lter a
set of potentially in-scope papers based on a number of exclusion criteria. To
address the problem, in recent years the research community has began to
explore the use of the crowd to allow for a faster, accurate, cheaper and
unbiased screening of papers. Initial results show that crowdsourcing can be
effective, even for relatively complex reviews. In this paper we derive and
analyze a set of strategies for crowd-based screening, and show that an
adaptive strategy, that continuously re-assesses the statistical properties of
the problem to minimize the number of votes needed to take decisions for each
paper, significantly outperforms a number of non-adaptive approaches in terms
of cost and accuracy. We validate both applicability and results of the
approach through a set of crowdsourcing experiments, and discuss properties of
the problem and algorithms that we believe to be generally of interest for
classification problems where items are classified via a series of successive
tests (as it often happens in medicine).
|
cs.HC cs.DL cs.SI
|
systematic literature reviews slrs are one of the most common and useful form of scientific research and publication tens of thousands of slrs are published each year and this rate is growing across all fields of science performing an accurate complete and unbiased slr is however a difficult and expensive endeavor this is true in general for all phases of a literature review and in particular for the paper screening phase where authors lter a set of potentially inscope papers based on a number of exclusion criteria to address the problem in recent years the research community has began to explore the use of the crowd to allow for a faster accurate cheaper and unbiased screening of papers initial results show that crowdsourcing can be effective even for relatively complex reviews in this paper we derive and analyze a set of strategies for crowdbased screening and show that an adaptive strategy that continuously reassesses the statistical properties of the problem to minimize the number of votes needed to take decisions for each paper significantly outperforms a number of nonadaptive approaches in terms of cost and accuracy we validate both applicability and results of the approach through a set of crowdsourcing experiments and discuss properties of the problem and algorithms that we believe to be generally of interest for classification problems where items are classified via a series of successive tests as it often happens in medicine
|
[['systematic', 'literature', 'reviews', 'slrs', 'are', 'one', 'of', 'the', 'most', 'common', 'and', 'useful', 'form', 'of', 'scientific', 'research', 'and', 'publication', 'tens', 'of', 'thousands', 'of', 'slrs', 'are', 'published', 'each', 'year', 'and', 'this', 'rate', 'is', 'growing', 'across', 'all', 'fields', 'of', 'science', 'performing', 'an', 'accurate', 'complete', 'and', 'unbiased', 'slr', 'is', 'however', 'a', 'difficult', 'and', 'expensive', 'endeavor', 'this', 'is', 'true', 'in', 'general', 'for', 'all', 'phases', 'of', 'a', 'literature', 'review', 'and', 'in', 'particular', 'for', 'the', 'paper', 'screening', 'phase', 'where', 'authors', 'lter', 'a', 'set', 'of', 'potentially', 'inscope', 'papers', 'based', 'on', 'a', 'number', 'of', 'exclusion', 'criteria', 'to', 'address', 'the', 'problem', 'in', 'recent', 'years', 'the', 'research', 'community', 'has', 'began', 'to', 'explore', 'the', 'use', 'of', 'the', 'crowd', 'to', 'allow', 'for', 'a', 'faster', 'accurate', 'cheaper', 'and', 'unbiased', 'screening', 'of', 'papers', 'initial', 'results', 'show', 'that', 'crowdsourcing', 'can', 'be', 'effective', 'even', 'for', 'relatively', 'complex', 'reviews', 'in', 'this', 'paper', 'we', 'derive', 'and', 'analyze', 'a', 'set', 'of', 'strategies', 'for', 'crowdbased', 'screening', 'and', 'show', 'that', 'an', 'adaptive', 'strategy', 'that', 'continuously', 'reassesses', 'the', 'statistical', 'properties', 'of', 'the', 'problem', 'to', 'minimize', 'the', 'number', 'of', 'votes', 'needed', 'to', 'take', 'decisions', 'for', 'each', 'paper', 'significantly', 'outperforms', 'a', 'number', 'of', 'nonadaptive', 'approaches', 'in', 'terms', 'of', 'cost', 'and', 'accuracy', 'we', 'validate', 'both', 'applicability', 'and', 'results', 'of', 'the', 'approach', 'through', 'a', 'set', 'of', 'crowdsourcing', 'experiments', 'and', 'discuss', 'properties', 'of', 'the', 'problem', 'and', 'algorithms', 'that', 'we', 'believe', 'to', 'be', 'generally', 'of', 'interest', 'for', 'classification', 'problems', 'where', 'items', 'are', 'classified', 'via', 'a', 'series', 'of', 'successive', 'tests', 'as', 'it', 'often', 'happens', 'in', 'medicine']]
|
[-0.06669380594480862, 0.0532883779137108, -0.038449922531962076, 0.04920674810146398, -0.09452402372547286, -0.09109519161482124, 0.08403496048859063, 0.37661068267969194, -0.2223685175314189, -0.33092384804436503, 0.13506663055357304, -0.2713141222732102, -0.16080266807941682, 0.24737363484727734, -0.09940819378466682, 0.054722455035439356, 0.09813025596432705, 0.03446436342981426, -0.04601467819116574, -0.32265972615556515, 0.29685739287759794, 0.04710518826354057, 0.28579189545138084, 0.046880431110633815, 0.07005587765312893, -0.0026347296718666527, -0.08391739497768712, 0.05963488059475067, -0.11613860322085724, 0.16259637820643394, 0.30610707577050444, 0.1963099390327772, 0.3702595679525365, -0.4246638889166903, -0.1818164455100022, 0.11382602181761188, 0.15111795202928022, 0.126169914674965, -0.043930648621345096, -0.2354408313579699, 0.0981787393523499, -0.1830209128162328, -0.07768395709745744, -0.09819993224698416, 0.04149311202122493, 0.023317424867282364, -0.293569063197108, 0.055245814706629856, 0.019712054020318975, 0.06541083031433059, -0.032759954759038666, -0.13677970093248928, 0.07125802179699407, 0.16403185256974812, 0.08635090873873931, 0.011893453523566194, 0.10062269379008323, -0.15420189513428573, -0.13703014490769264, 0.4113237875176871, -0.009520575777934666, -0.15238689781226059, 0.205338859997016, -0.09578945969950972, -0.1669073885083793, 0.09653280019324194, 0.21703881752538554, 0.14952664448225753, -0.17619713963792125, 0.03471678142767756, -0.0373422603281413, 0.14887549511474021, 0.03366921622197124, 0.04081286966944351, 0.18419231403361452, 0.19450436141242847, 0.0679245138887633, 0.11376096271424296, -0.041717739567715434, -0.06878710341976678, -0.2512761448926114, -0.17020488018058538, -0.16805624339947517, 0.003508275559053142, -0.035330192954712944, -0.1471514263923498, 0.4138080043876742, 0.2171003107293608, 0.17912389265294087, 0.04460225312641148, 0.29420028505648704, 0.03988909877538235, 0.037037099705017645, 0.04914261669098855, 0.21364658412701906, 0.05696131760957948, 0.08370643527583874, -0.14708615150500803, 0.08232083483252357, 0.01789375657136453]
|
1,803.09815
|
Maximality in finite-valued Lukasiewicz logics defined by order filters
|
In this paper we consider the logics $L_n^i$ obtained from the (n+1)-valued
Lukasiewicz logics $L_{n+1}$ by taking the order filter generated by i/n as the
set of designated elements. In particular, the conditions of maximality and
strong maximality among them are analysed. We present a very general theorem
which provides sufficient conditions for maximality between logics. As a
consequence of this theorem it is shown that $L_n^i$ is maximal w.r.t. CPL
whenever n is prime. Concerning strong maximality between the logics $L_n^i$
(that is, maximality w.r.t. rules instead of axioms), we provide algebraic
arguments in order to show that the logics $L_n^i$ are not strongly maximal
w.r.t. CPL, even for n prime. Indeed, in such case, we show there is just one
extension between $L_n^i$ and CPL obtained by adding to $L_n^i$ a kind of
graded explosion rule. Finally, using these results, we show that the logics
$L_n^i$ with n prime and i/n < 1/2 are ideal paraconsistent logics.
|
math.LO
|
in this paper we consider the logics l_ni obtained from the n1valued lukasiewicz logics l_n1 by taking the order filter generated by in as the set of designated elements in particular the conditions of maximality and strong maximality among them are analysed we present a very general theorem which provides sufficient conditions for maximality between logics as a consequence of this theorem it is shown that l_ni is maximal wrt cpl whenever n is prime concerning strong maximality between the logics l_ni that is maximality wrt rules instead of axioms we provide algebraic arguments in order to show that the logics l_ni are not strongly maximal wrt cpl even for n prime indeed in such case we show there is just one extension between l_ni and cpl obtained by adding to l_ni a kind of graded explosion rule finally using these results we show that the logics l_ni with n prime and in 12 are ideal paraconsistent logics
|
[['in', 'this', 'paper', 'we', 'consider', 'the', 'logics', 'l_ni', 'obtained', 'from', 'the', 'n1valued', 'lukasiewicz', 'logics', 'l_n1', 'by', 'taking', 'the', 'order', 'filter', 'generated', 'by', 'in', 'as', 'the', 'set', 'of', 'designated', 'elements', 'in', 'particular', 'the', 'conditions', 'of', 'maximality', 'and', 'strong', 'maximality', 'among', 'them', 'are', 'analysed', 'we', 'present', 'a', 'very', 'general', 'theorem', 'which', 'provides', 'sufficient', 'conditions', 'for', 'maximality', 'between', 'logics', 'as', 'a', 'consequence', 'of', 'this', 'theorem', 'it', 'is', 'shown', 'that', 'l_ni', 'is', 'maximal', 'wrt', 'cpl', 'whenever', 'n', 'is', 'prime', 'concerning', 'strong', 'maximality', 'between', 'the', 'logics', 'l_ni', 'that', 'is', 'maximality', 'wrt', 'rules', 'instead', 'of', 'axioms', 'we', 'provide', 'algebraic', 'arguments', 'in', 'order', 'to', 'show', 'that', 'the', 'logics', 'l_ni', 'are', 'not', 'strongly', 'maximal', 'wrt', 'cpl', 'even', 'for', 'n', 'prime', 'indeed', 'in', 'such', 'case', 'we', 'show', 'there', 'is', 'just', 'one', 'extension', 'between', 'l_ni', 'and', 'cpl', 'obtained', 'by', 'adding', 'to', 'l_ni', 'a', 'kind', 'of', 'graded', 'explosion', 'rule', 'finally', 'using', 'these', 'results', 'we', 'show', 'that', 'the', 'logics', 'l_ni', 'with', 'n', 'prime', 'and', 'in', '12', 'are', 'ideal', 'paraconsistent', 'logics']]
|
[-0.12059365186318637, 0.075505196385062, -0.0924153593074106, 0.11710086406453195, -0.1046084788144578, -0.15877707025236626, 0.049064511282198554, 0.3651528169247734, -0.3031176683917359, -0.2542976347576308, 0.08351668947570827, -0.27042596971121013, -0.09888163422340457, 0.20396167874524865, -0.11266133606233457, 0.010864238889852561, 0.03406509343251775, 0.06094562740207361, -0.0430898126885236, -0.24598128865679278, 0.35485763244383933, -0.037605851682350984, 0.20176763671061285, 0.05501235547899917, 0.09647116612914149, 0.03412582306486048, 0.003125788725004826, 0.07688997215532427, -0.14413229986539705, 0.08809253781491631, 0.30795365443918854, 0.2110423355398676, 0.24368939562877523, -0.35808863352300435, -0.11285824292704841, 0.1692428248462892, 0.072377440481317, 0.024354607045880366, -2.582791508941711e-05, -0.2506072667377258, 0.14691836194391658, -0.1827663010446048, -0.11336208930050459, -0.11933277747181209, 0.03072237926741614, 0.06295432368753172, -0.28028423635913885, 0.01055101146096293, 0.1989847200486479, 0.12541400627056254, -0.026593670411450977, -0.1105939968153127, -0.025619948349150393, 0.020809421127166928, 0.02247392135168296, -0.04252180652221358, -0.010476287922975195, -0.088350728201338, -0.15387191269487802, 0.38005053699959684, -0.05626713874406488, -0.1812525411752418, 0.13809664489604132, -0.1539395737161129, -0.16362384236358765, 0.04057096358450554, 0.0093975874383144, 0.10619713110507384, -0.09749514020720049, 0.13407461224985898, -0.1317913989666142, 0.1499197153563175, 0.14704667906795593, 0.07971201176184843, 0.15725083129857725, 0.1335486216615013, 0.06477212932114076, 0.15343136068793084, 0.05243878092898993, -0.06237599422751419, -0.37329114045169726, -0.12731668305630453, -0.09662820615133719, 0.03799634061533076, -0.09557395227611894, -0.11729462806756544, 0.3121712447558176, 0.16578787998178432, 0.13790085589932424, 0.1389351288642133, 0.2405294777377497, 0.10630195049019722, 0.07847139706151395, 0.05322488592760755, 0.2150684346421327, 0.1645083154766832, 0.05138772751405081, -0.12577594130129047, 0.07125860636263992, 0.10026222096956512]
|
1,803.09816
|
Spectral feature mapping with mimic loss for robust speech recognition
|
For the task of speech enhancement, local learning objectives are agnostic to
phonetic structures helpful for speech recognition. We propose to add a global
criterion to ensure de-noised speech is useful for downstream tasks like ASR.
We first train a spectral classifier on clean speech to predict senone labels.
Then, the spectral classifier is joined with our speech enhancer as a noisy
speech recognizer. This model is taught to imitate the output of the spectral
classifier alone on clean speech. This \textit{mimic loss} is combined with the
traditional local criterion to train the speech enhancer to produce de-noised
speech. Feeding the de-noised speech to an off-the-shelf Kaldi training recipe
for the CHiME-2 corpus shows significant improvements in WER.
|
cs.SD cs.CL eess.AS
|
for the task of speech enhancement local learning objectives are agnostic to phonetic structures helpful for speech recognition we propose to add a global criterion to ensure denoised speech is useful for downstream tasks like asr we first train a spectral classifier on clean speech to predict senone labels then the spectral classifier is joined with our speech enhancer as a noisy speech recognizer this model is taught to imitate the output of the spectral classifier alone on clean speech this textitmimic loss is combined with the traditional local criterion to train the speech enhancer to produce denoised speech feeding the denoised speech to an offtheshelf kaldi training recipe for the chime2 corpus shows significant improvements in wer
|
[['for', 'the', 'task', 'of', 'speech', 'enhancement', 'local', 'learning', 'objectives', 'are', 'agnostic', 'to', 'phonetic', 'structures', 'helpful', 'for', 'speech', 'recognition', 'we', 'propose', 'to', 'add', 'a', 'global', 'criterion', 'to', 'ensure', 'denoised', 'speech', 'is', 'useful', 'for', 'downstream', 'tasks', 'like', 'asr', 'we', 'first', 'train', 'a', 'spectral', 'classifier', 'on', 'clean', 'speech', 'to', 'predict', 'senone', 'labels', 'then', 'the', 'spectral', 'classifier', 'is', 'joined', 'with', 'our', 'speech', 'enhancer', 'as', 'a', 'noisy', 'speech', 'recognizer', 'this', 'model', 'is', 'taught', 'to', 'imitate', 'the', 'output', 'of', 'the', 'spectral', 'classifier', 'alone', 'on', 'clean', 'speech', 'this', 'textitmimic', 'loss', 'is', 'combined', 'with', 'the', 'traditional', 'local', 'criterion', 'to', 'train', 'the', 'speech', 'enhancer', 'to', 'produce', 'denoised', 'speech', 'feeding', 'the', 'denoised', 'speech', 'to', 'an', 'offtheshelf', 'kaldi', 'training', 'recipe', 'for', 'the', 'chime2', 'corpus', 'shows', 'significant', 'improvements', 'in', 'wer']]
|
[0.022511945762430673, -0.03122748465742414, -0.07087939017821618, 0.10157811920487739, -0.171194432560226, -0.24493010613890687, 0.021197180633015674, 0.49565488565913884, -0.2770393990494054, -0.28512123881554197, 0.011178399330799886, -0.29413694104757804, -0.1636969003192117, 0.22157264576137473, -0.21250175147172834, 0.09134405569960202, 0.18486444535665214, 0.14546881154067173, -0.032244562765519166, -0.2845237690409453, 0.23207633377952053, 0.046649097111718406, 0.38278792787279037, -0.02194233552616989, 0.09851044125376764, -0.061199198719836645, -0.029518093705550637, -0.16455618135534741, 0.008676768266515613, 0.17281092488629557, 0.4085346142408149, 0.24531690184436417, 0.3144313974530789, -0.3386869712066355, -0.18170938757047506, 0.11545095372752383, 0.12285313100537992, 0.1611088165001751, -0.016090936651694233, -0.42890001282673973, 0.13069172715366786, -0.1428191318128515, 0.1297088871842475, -0.12233701363157738, -0.0431722373027226, -0.051854337798431516, -0.3501301913136809, 0.0643725642514945, 0.1736009909373965, 0.1271635257600855, -0.06472149814663712, -0.07693531513635615, 0.013358885576900351, 0.20896663200832774, 0.04737890127480255, 0.10537927880770816, 0.16359559349527036, -0.19017270755359966, -0.08633567189299983, 0.36467431461566996, -0.14995921028081471, -0.22673657819516316, 0.21000262412467394, 0.034599501450931464, -0.12175031319854716, 0.10376921613251083, 0.3045691992637926, 0.027112719331916165, -0.20604219502801524, -0.08446086068027492, 0.00466214699253183, 0.2949140818934117, 0.08286831747531763, -0.04500233384395211, 0.16967762039235695, 0.25869515571935936, -0.007074437766528592, 0.22299123381200278, -0.15429627302163962, 0.07415080505346976, -0.20076087875901882, -0.07639504041309983, -0.2185887814166249, -0.03191069287954476, -0.06895425347290163, -0.18853105178327653, 0.4117817158714451, 0.22877589066448653, 0.1870912243130392, 0.16684715516849197, 0.36065858186640104, 0.05083447129160551, 0.11720085262465452, 0.020070195012898504, 0.19141415699589837, -0.017129963287955213, 0.1349001479343158, -0.18478686439981362, 0.09959218434282932, 0.07172013110288515]
|
1,803.09817
|
Self-force as a probe of global structure
|
We calculate the self-force on an electric charge and electric dipole held at
rest in a closed universe that results from joining two copies of Minkowski
spacetime at a common boundary. Spacetime is strictly flat on each side of the
boundary, but there is curvature at the surface layer required to join the two
Minkowski spacetimes. We find that the self-force on the charge is always
directed away from the surface layer. This is analogous to the case of an
electric charge held at rest inside a spherical shell of matter, for which the
self-force is also directed away from the shell. For the dipole, the direction
of the self-force is a function of the dipole's position and orientation. Both
self-forces become infinite when the charge or dipole is made to approach the
surface layer. This study reveals that a self-force can arise even when the
Riemann tensor vanishes at the position of the charge or dipole; in such cases
the self-force is a manifestation of the global curvature of spacetime.
|
gr-qc
|
we calculate the selfforce on an electric charge and electric dipole held at rest in a closed universe that results from joining two copies of minkowski spacetime at a common boundary spacetime is strictly flat on each side of the boundary but there is curvature at the surface layer required to join the two minkowski spacetimes we find that the selfforce on the charge is always directed away from the surface layer this is analogous to the case of an electric charge held at rest inside a spherical shell of matter for which the selfforce is also directed away from the shell for the dipole the direction of the selfforce is a function of the dipoles position and orientation both selfforces become infinite when the charge or dipole is made to approach the surface layer this study reveals that a selfforce can arise even when the riemann tensor vanishes at the position of the charge or dipole in such cases the selfforce is a manifestation of the global curvature of spacetime
|
[['we', 'calculate', 'the', 'selfforce', 'on', 'an', 'electric', 'charge', 'and', 'electric', 'dipole', 'held', 'at', 'rest', 'in', 'a', 'closed', 'universe', 'that', 'results', 'from', 'joining', 'two', 'copies', 'of', 'minkowski', 'spacetime', 'at', 'a', 'common', 'boundary', 'spacetime', 'is', 'strictly', 'flat', 'on', 'each', 'side', 'of', 'the', 'boundary', 'but', 'there', 'is', 'curvature', 'at', 'the', 'surface', 'layer', 'required', 'to', 'join', 'the', 'two', 'minkowski', 'spacetimes', 'we', 'find', 'that', 'the', 'selfforce', 'on', 'the', 'charge', 'is', 'always', 'directed', 'away', 'from', 'the', 'surface', 'layer', 'this', 'is', 'analogous', 'to', 'the', 'case', 'of', 'an', 'electric', 'charge', 'held', 'at', 'rest', 'inside', 'a', 'spherical', 'shell', 'of', 'matter', 'for', 'which', 'the', 'selfforce', 'is', 'also', 'directed', 'away', 'from', 'the', 'shell', 'for', 'the', 'dipole', 'the', 'direction', 'of', 'the', 'selfforce', 'is', 'a', 'function', 'of', 'the', 'dipoles', 'position', 'and', 'orientation', 'both', 'selfforces', 'become', 'infinite', 'when', 'the', 'charge', 'or', 'dipole', 'is', 'made', 'to', 'approach', 'the', 'surface', 'layer', 'this', 'study', 'reveals', 'that', 'a', 'selfforce', 'can', 'arise', 'even', 'when', 'the', 'riemann', 'tensor', 'vanishes', 'at', 'the', 'position', 'of', 'the', 'charge', 'or', 'dipole', 'in', 'such', 'cases', 'the', 'selfforce', 'is', 'a', 'manifestation', 'of', 'the', 'global', 'curvature', 'of', 'spacetime']]
|
[-0.1740205899433761, 0.14340551007877386, -0.08521189350819988, 0.02202037317890739, -0.06074274904285258, -0.09612582826834412, -0.016039274959710605, 0.35144330739800694, -0.22150222017914492, -0.22922574197369688, 0.04816893861582775, -0.3178615382823505, -0.08598750244488405, 0.14234841794418227, -0.015713287000367362, -0.045703463817331175, -0.008843713028803032, 0.11963745613231144, -0.06443491958119847, -0.1600266150988595, 0.3567051753532468, 0.0352239202577294, 0.2534664993484815, 0.11192753882697451, 0.08501832668631397, 0.010599633006172048, 0.022244469826354793, 0.058942763618954265, -0.08494559489390562, 0.0703754425920241, 0.17632206314793455, 0.02242759796273377, 0.205406179054564, -0.4690235279805479, -0.17770487067905086, 0.06909901355202609, 0.10865675221736494, 0.17294922103895669, -0.047804857773041866, -0.26554866023879087, 0.05651128038829356, -0.12194604812222615, -0.1651632664752416, 0.022819865376508812, 0.0626969304690083, -0.035391438781006035, -0.24105479724552722, 0.06171487002039181, 0.07948505765437121, 0.009898439932707153, -0.1015818767312217, -0.11606913393537639, -0.07777940745912057, 0.11622375296598997, 0.11769138701390802, 0.10537544168036278, 0.1952967073234637, -0.1211941106017197, -0.049992827777560166, 0.3753957005315705, -0.047084911563706026, -0.2562613236276727, 0.1370860893083246, -0.2088658632873966, -0.05974739317765884, 0.14710212995744806, 0.1495964683385359, 0.17059365301719753, -0.11177141257314616, 0.13306947847779252, -0.008757519134053449, 0.14856870048706644, 0.1256141468708278, -0.02942537356505704, 0.3220781668563161, 0.08180927139657893, 0.1182363913768946, 0.12870156811141784, -0.10774166588923398, -0.09385557338011272, -0.383827974927225, -0.166012918228033, -0.22178125165658866, 0.05959809830205308, -0.10934748434667933, -0.22872772014930323, 0.37386482252537856, 0.09654137071995446, 0.14611428756878184, 0.00403787441924759, 0.329255557417521, 0.09905348184425929, 0.06974769817469151, 0.1300768324702281, 0.30258754297290325, 0.11428321950949119, 0.08857075585466292, -0.2213546460458998, -0.0005740518817863269, 0.1001912737210766]
|
1,803.09818
|
The effective field theory approach of teleparallel gravity, $f(T)$
gravity and beyond
|
We develop the effective field theory approach to torsional modified
gravities, a formalism that allows for the systematic investigation of the
background and perturbation levels separately. Starting from the usual
effective field theory approach to curvature-based gravity, we suitably
generalize it at the background level by including terms of the contracted
torsion tensor, and at the perturbation level by including pure torsion
perturbative terms and mixed perturbative terms of torsion and curvature.
Having constructed the effective field theory action of general torsional
modified gravity, amongst others we focus on $f(T)$ gravity and we perform a
cosmological application. We investigate the scalar perturbations up to second
order, and we derive the expressions of the Newtonian constant and the post
Newtonian parameter $\gamma$. Finally, we apply this procedure to two specific
and viable $f(T)$ models, namely the power-law and the exponential ones,
introducing a new parameter that quantifies the deviation from general
relativity and depends on the model parameters. Since this parameter can be
expressed in terms of the scalar perturbation mode, a precise measurement of
its evolution could be used as an alternative way to impose constraints on
$f(T)$ gravity and break possible degeneracies between different $f(T)$ models.
|
gr-qc astro-ph.CO hep-ph hep-th
|
we develop the effective field theory approach to torsional modified gravities a formalism that allows for the systematic investigation of the background and perturbation levels separately starting from the usual effective field theory approach to curvaturebased gravity we suitably generalize it at the background level by including terms of the contracted torsion tensor and at the perturbation level by including pure torsion perturbative terms and mixed perturbative terms of torsion and curvature having constructed the effective field theory action of general torsional modified gravity amongst others we focus on ft gravity and we perform a cosmological application we investigate the scalar perturbations up to second order and we derive the expressions of the newtonian constant and the post newtonian parameter gamma finally we apply this procedure to two specific and viable ft models namely the powerlaw and the exponential ones introducing a new parameter that quantifies the deviation from general relativity and depends on the model parameters since this parameter can be expressed in terms of the scalar perturbation mode a precise measurement of its evolution could be used as an alternative way to impose constraints on ft gravity and break possible degeneracies between different ft models
|
[['we', 'develop', 'the', 'effective', 'field', 'theory', 'approach', 'to', 'torsional', 'modified', 'gravities', 'a', 'formalism', 'that', 'allows', 'for', 'the', 'systematic', 'investigation', 'of', 'the', 'background', 'and', 'perturbation', 'levels', 'separately', 'starting', 'from', 'the', 'usual', 'effective', 'field', 'theory', 'approach', 'to', 'curvaturebased', 'gravity', 'we', 'suitably', 'generalize', 'it', 'at', 'the', 'background', 'level', 'by', 'including', 'terms', 'of', 'the', 'contracted', 'torsion', 'tensor', 'and', 'at', 'the', 'perturbation', 'level', 'by', 'including', 'pure', 'torsion', 'perturbative', 'terms', 'and', 'mixed', 'perturbative', 'terms', 'of', 'torsion', 'and', 'curvature', 'having', 'constructed', 'the', 'effective', 'field', 'theory', 'action', 'of', 'general', 'torsional', 'modified', 'gravity', 'amongst', 'others', 'we', 'focus', 'on', 'ft', 'gravity', 'and', 'we', 'perform', 'a', 'cosmological', 'application', 'we', 'investigate', 'the', 'scalar', 'perturbations', 'up', 'to', 'second', 'order', 'and', 'we', 'derive', 'the', 'expressions', 'of', 'the', 'newtonian', 'constant', 'and', 'the', 'post', 'newtonian', 'parameter', 'gamma', 'finally', 'we', 'apply', 'this', 'procedure', 'to', 'two', 'specific', 'and', 'viable', 'ft', 'models', 'namely', 'the', 'powerlaw', 'and', 'the', 'exponential', 'ones', 'introducing', 'a', 'new', 'parameter', 'that', 'quantifies', 'the', 'deviation', 'from', 'general', 'relativity', 'and', 'depends', 'on', 'the', 'model', 'parameters', 'since', 'this', 'parameter', 'can', 'be', 'expressed', 'in', 'terms', 'of', 'the', 'scalar', 'perturbation', 'mode', 'a', 'precise', 'measurement', 'of', 'its', 'evolution', 'could', 'be', 'used', 'as', 'an', 'alternative', 'way', 'to', 'impose', 'constraints', 'on', 'ft', 'gravity', 'and', 'break', 'possible', 'degeneracies', 'between', 'different', 'ft', 'models']]
|
[-0.11239523066061213, 0.11868520051326312, -0.12873936772138486, 0.09539202720678511, -0.1102857376120247, -0.14383001081163282, 0.0055254678564562185, 0.2746168271600633, -0.2406646544078299, -0.33366027981903273, 0.049560013869517305, -0.21890440940282835, -0.15696494595672425, 0.15232625346084783, -0.03648556977259893, 0.023646166226365676, -0.021721166128949806, 0.07633666634124699, -0.10135531989972196, -0.2035116318762208, 0.3627016389361928, 0.08172912431200068, 0.23310702947100748, 0.01142102304661675, 0.10669514053704472, -0.01750536369358374, -0.03442771802419976, 0.06667887395588198, -0.19819977058626317, 0.10586862392997756, 0.17314011643833196, 0.08322085705136663, 0.20715102445580028, -0.4379562545227369, -0.2474618658788625, 0.08341858047887986, 0.08870582895585086, 0.1542608145716586, 0.004965338024528234, -0.2662421071140786, 0.0471328339033623, -0.19699588533831278, -0.1392583295816395, -0.12790085803386447, -0.01800664360717714, -0.05586677064958411, -0.27169277657740537, 0.11259001805130889, 0.014199114033507968, 0.0006617418710697267, -0.06484079702614291, -0.09110692064195096, 0.012300042835002774, 0.10410858604224957, 0.11044160938327706, 0.03886022559883603, 0.13057945177743807, -0.13181311078015054, -0.06344419520532683, 0.3995042550117534, -0.1822831842449711, -0.23710374019066166, 0.14999070077623963, -0.12463396286998454, -0.14832813034382492, 0.030082037814226248, 0.148290029632372, 0.15269976414191694, -0.1377970496367493, 0.1673253433330358, 0.07084067043645052, 0.12778474368760126, 0.10733496649947187, 0.016249041170529492, 0.2305240990407292, 0.07592998538757226, 0.019155033847534565, 0.10859657202015258, -0.052296698101096536, -0.1002998889939798, -0.38191056365932, -0.12604666548073223, -0.10297656688661325, 0.04346378687485523, -0.15290713094821645, -0.15896036697085947, 0.4249876172608001, 0.13517814138226109, 0.11913956687129741, 0.0866192306819145, 0.27034639927374227, 0.15195265888097, 0.04839633391616951, 0.028539256828115853, 0.2998899789952536, 0.1575481782308047, 0.046823156208064654, -0.23032488344342986, -0.039663564153772014, 0.06498730291144421]
|
1,803.09819
|
OH as an Alternate Tracer for Molecular Gas: Excitation Temperatures of
the OH 18-cm Main Lines in W5
|
We present excitation temperatures $T_{ex}$ for the OH 18-cm main lines at
1665 and 1667 MHz measured directly in front of the W5 star-forming region,
using observations from the Green Bank Telescope and the Very Large Array. We
find unequivocally that $T_{ex}$ at 1665 MHz is greater than $T_{ex}$ at 1667
MHz. Our method exploits variations in the continuum emission from W5, and the
fact that the continuum brightness temperatures $T_C$ in this nebula are close
to the excitation temperatures of the OH lines in the foreground gas. The
result is that an OH line can appear in emission in one location and in
absorption in a neighboring location, and the value of $T_C$ where the profiles
switch from emission to absorption indicates $T_{ex}$. Absolute measurements of
$T_{ex}$ for the main lines were subject to greater uncertainty because of
unknown effects of geometry of the OH features. We also employed the
traditional "expected profile" method for comparison with our "continuum
background" method, and found that the continuum background method provided
more precise results, and was the one to definitively show the $T_{ex}$
difference. Our best estimate values are: $T^{65}_{ex} = 6.0 \pm 0.5$ K,
$T^{67}_{ex} = 5.1 \pm 0.2$ K, and $T^{65}_{ex} - T^{67}_{ex} = 0.9 \pm 0.5$ K.
The $T_{ex}$ values we have measured for the ISM in front of W5 are similar to
those found in the quiescent ISM, indicating that proximity to massive
star-forming regions does not generally result in widespread anomalous
excitation of OH emission.
|
astro-ph.GA
|
we present excitation temperatures t_ex for the oh 18cm main lines at 1665 and 1667 mhz measured directly in front of the w5 starforming region using observations from the green bank telescope and the very large array we find unequivocally that t_ex at 1665 mhz is greater than t_ex at 1667 mhz our method exploits variations in the continuum emission from w5 and the fact that the continuum brightness temperatures t_c in this nebula are close to the excitation temperatures of the oh lines in the foreground gas the result is that an oh line can appear in emission in one location and in absorption in a neighboring location and the value of t_c where the profiles switch from emission to absorption indicates t_ex absolute measurements of t_ex for the main lines were subject to greater uncertainty because of unknown effects of geometry of the oh features we also employed the traditional expected profile method for comparison with our continuum background method and found that the continuum background method provided more precise results and was the one to definitively show the t_ex difference our best estimate values are t65_ex 60 pm 05 k t67_ex 51 pm 02 k and t65_ex t67_ex 09 pm 05 k the t_ex values we have measured for the ism in front of w5 are similar to those found in the quiescent ism indicating that proximity to massive starforming regions does not generally result in widespread anomalous excitation of oh emission
|
[['we', 'present', 'excitation', 'temperatures', 't_ex', 'for', 'the', 'oh', '18cm', 'main', 'lines', 'at', '1665', 'and', '1667', 'mhz', 'measured', 'directly', 'in', 'front', 'of', 'the', 'w5', 'starforming', 'region', 'using', 'observations', 'from', 'the', 'green', 'bank', 'telescope', 'and', 'the', 'very', 'large', 'array', 'we', 'find', 'unequivocally', 'that', 't_ex', 'at', '1665', 'mhz', 'is', 'greater', 'than', 't_ex', 'at', '1667', 'mhz', 'our', 'method', 'exploits', 'variations', 'in', 'the', 'continuum', 'emission', 'from', 'w5', 'and', 'the', 'fact', 'that', 'the', 'continuum', 'brightness', 'temperatures', 't_c', 'in', 'this', 'nebula', 'are', 'close', 'to', 'the', 'excitation', 'temperatures', 'of', 'the', 'oh', 'lines', 'in', 'the', 'foreground', 'gas', 'the', 'result', 'is', 'that', 'an', 'oh', 'line', 'can', 'appear', 'in', 'emission', 'in', 'one', 'location', 'and', 'in', 'absorption', 'in', 'a', 'neighboring', 'location', 'and', 'the', 'value', 'of', 't_c', 'where', 'the', 'profiles', 'switch', 'from', 'emission', 'to', 'absorption', 'indicates', 't_ex', 'absolute', 'measurements', 'of', 't_ex', 'for', 'the', 'main', 'lines', 'were', 'subject', 'to', 'greater', 'uncertainty', 'because', 'of', 'unknown', 'effects', 'of', 'geometry', 'of', 'the', 'oh', 'features', 'we', 'also', 'employed', 'the', 'traditional', 'expected', 'profile', 'method', 'for', 'comparison', 'with', 'our', 'continuum', 'background', 'method', 'and', 'found', 'that', 'the', 'continuum', 'background', 'method', 'provided', 'more', 'precise', 'results', 'and', 'was', 'the', 'one', 'to', 'definitively', 'show', 'the', 't_ex', 'difference', 'our', 'best', 'estimate', 'values', 'are', 't65_ex', '60', 'pm', '05', 'k', 't67_ex', '51', 'pm', '02', 'k', 'and', 't65_ex', 't67_ex', '09', 'pm', '05', 'k', 'the', 't_ex', 'values', 'we', 'have', 'measured', 'for', 'the', 'ism', 'in', 'front', 'of', 'w5', 'are', 'similar', 'to', 'those', 'found', 'in', 'the', 'quiescent', 'ism', 'indicating', 'that', 'proximity', 'to', 'massive', 'starforming', 'regions', 'does', 'not', 'generally', 'result', 'in', 'widespread', 'anomalous', 'excitation', 'of', 'oh', 'emission']]
|
[-0.06107095034993002, 0.08312499969363207, -0.024601858433846123, 0.03304417661914826, -0.010628404474481013, -0.08957872890647021, 0.07598528329619203, 0.46482386896038946, -0.14984194587537425, -0.3430155332652365, 0.038367094244533585, -0.2977326968105131, -0.02088789520828687, 0.17233173107086872, 0.008937623516895086, -0.05479838818597175, -0.011815244866210457, -0.06617536865966007, -0.023362271388204327, -0.1618132945169459, 0.2509007998548943, 0.07146156385842387, 0.24388305179357406, 0.06689741565745431, 0.022104265504271272, -0.14052867215668735, -0.022680189381295592, -0.043186455285389176, -0.13379271355865419, 0.0744028875982984, 0.2884943927984822, 0.05658137195268298, 0.18303069465936653, -0.31559444002080633, -0.18810724496215397, 0.059672001940565364, 0.14335774419118197, 0.08853579055579743, 0.019275937125720063, -0.2863872440230426, 0.07617459413972277, -0.10183871154773873, -0.1882434520963193, 0.07778195125660453, 0.04581831972195895, 0.0026664324988769483, -0.2521807829331591, 0.14086741477425435, -0.0031828261284868684, 0.11633698181036659, -0.0969294935775944, -0.19273985404602378, -0.06692637839495626, 0.07204586642318989, -0.006414244734465736, 0.09918411701716699, 0.1839513909999142, -0.07903940278430048, -0.02364281752133255, 0.3735453358607915, -0.14456982198356086, 0.0008543887421009575, 0.23017524568657718, -0.26895456501916515, -0.17878209498249134, 0.29305146770509294, 0.09147871168054006, 0.10126078764509981, -0.12007197309324047, -0.02965318556407397, -0.014116297766790412, 0.2430887220048682, 0.0811082989390924, 0.05644702241578259, 0.23484205529171032, 0.03532586242381437, 0.04340410350505031, 0.10564065898292316, -0.23611208392477195, -0.026755540979508295, -0.2580309635824311, -0.10361905584181369, -0.13144982904215108, 0.059037932541660475, -0.09322050855764578, -0.06068822429360845, 0.3278651994834673, 0.16534432291373982, 0.22342834477138965, 0.02965163267546051, 0.3030110476963624, 0.11195877065285036, 0.08429437053594661, 0.12811142015869872, 0.3227618392634194, 0.18474218347573584, 0.11937104454611841, -0.247606342379197, 0.05699949802254052, -0.021907265738611154]
|
1,803.0982
|
A disciplined approach to neural network hyper-parameters: Part 1 --
learning rate, batch size, momentum, and weight decay
|
Although deep learning has produced dazzling successes for applications of
image, speech, and video processing in the past few years, most trainings are
with suboptimal hyper-parameters, requiring unnecessarily long training times.
Setting the hyper-parameters remains a black art that requires years of
experience to acquire. This report proposes several efficient ways to set the
hyper-parameters that significantly reduce training time and improves
performance. Specifically, this report shows how to examine the training
validation/test loss function for subtle clues of underfitting and overfitting
and suggests guidelines for moving toward the optimal balance point. Then it
discusses how to increase/decrease the learning rate/momentum to speed up
training. Our experiments show that it is crucial to balance every manner of
regularization for each dataset and architecture. Weight decay is used as a
sample regularizer to show how its optimal value is tightly coupled with the
learning rates and momentums. Files to help replicate the results reported here
are available.
|
cs.LG cs.CV cs.NE stat.ML
|
although deep learning has produced dazzling successes for applications of image speech and video processing in the past few years most trainings are with suboptimal hyperparameters requiring unnecessarily long training times setting the hyperparameters remains a black art that requires years of experience to acquire this report proposes several efficient ways to set the hyperparameters that significantly reduce training time and improves performance specifically this report shows how to examine the training validationtest loss function for subtle clues of underfitting and overfitting and suggests guidelines for moving toward the optimal balance point then it discusses how to increasedecrease the learning ratemomentum to speed up training our experiments show that it is crucial to balance every manner of regularization for each dataset and architecture weight decay is used as a sample regularizer to show how its optimal value is tightly coupled with the learning rates and momentums files to help replicate the results reported here are available
|
[['although', 'deep', 'learning', 'has', 'produced', 'dazzling', 'successes', 'for', 'applications', 'of', 'image', 'speech', 'and', 'video', 'processing', 'in', 'the', 'past', 'few', 'years', 'most', 'trainings', 'are', 'with', 'suboptimal', 'hyperparameters', 'requiring', 'unnecessarily', 'long', 'training', 'times', 'setting', 'the', 'hyperparameters', 'remains', 'a', 'black', 'art', 'that', 'requires', 'years', 'of', 'experience', 'to', 'acquire', 'this', 'report', 'proposes', 'several', 'efficient', 'ways', 'to', 'set', 'the', 'hyperparameters', 'that', 'significantly', 'reduce', 'training', 'time', 'and', 'improves', 'performance', 'specifically', 'this', 'report', 'shows', 'how', 'to', 'examine', 'the', 'training', 'validationtest', 'loss', 'function', 'for', 'subtle', 'clues', 'of', 'underfitting', 'and', 'overfitting', 'and', 'suggests', 'guidelines', 'for', 'moving', 'toward', 'the', 'optimal', 'balance', 'point', 'then', 'it', 'discusses', 'how', 'to', 'increasedecrease', 'the', 'learning', 'ratemomentum', 'to', 'speed', 'up', 'training', 'our', 'experiments', 'show', 'that', 'it', 'is', 'crucial', 'to', 'balance', 'every', 'manner', 'of', 'regularization', 'for', 'each', 'dataset', 'and', 'architecture', 'weight', 'decay', 'is', 'used', 'as', 'a', 'sample', 'regularizer', 'to', 'show', 'how', 'its', 'optimal', 'value', 'is', 'tightly', 'coupled', 'with', 'the', 'learning', 'rates', 'and', 'momentums', 'files', 'to', 'help', 'replicate', 'the', 'results', 'reported', 'here', 'are', 'available']]
|
[-0.048021413105223995, 0.046854787013665834, -0.061994787332807465, 0.054151930641413173, -0.14106070870751297, -0.1797432508621994, 0.07348207145526418, 0.45983088756125273, -0.2688926812661993, -0.36514276721365085, 0.09068164669276614, -0.2548626665594419, -0.1589282416532953, 0.20474153677267687, -0.14406079841572067, 0.0888478402777835, 0.17082620374503085, 0.019591842348651065, -0.07035923240307186, -0.35271578461125297, 0.2863894439084673, 0.09056481189081633, 0.32167674490559073, 0.030678836178252254, 0.12713742514999657, -0.04888484826577561, -0.012852788894692763, -0.06455124992054778, -0.08150469307562257, 0.14647456163135297, 0.31680698438801547, 0.21725083770254602, 0.3578594324432991, -0.41111127602411, -0.21159658264731626, 0.10936939407309348, 0.17020596545371044, 0.11141022508842992, -0.07146995540030977, -0.24693193498321556, 0.08651530070460171, -0.13453420933166688, -0.03172376293495491, -0.16424249130899884, 0.020832992852691943, -0.008688609455954042, -0.29892826767664027, 0.0531597260193742, 0.04976486444039355, 0.029788037858806647, -0.023530590865011147, -0.1321000996357217, 0.0322722173821296, 0.15590505923035664, 0.11915274441254313, 0.08111603894004864, 0.15938803523608072, -0.16773426064665053, -0.10666802313931698, 0.3489300446500155, -0.02415656391531229, -0.1737593260061528, 0.20033363731844084, -0.06176186167459645, -0.1105201783251356, 0.10977557064154995, 0.21711990001381604, 0.08598421350448066, -0.16847624189474367, 0.002042422000796522, 0.0209612513698831, 0.20908536149174514, 0.057678506535390243, 0.02599440865799204, 0.15907682483719493, 0.24455953853706794, 0.0625224644665957, 0.15389583083988445, -0.10084494121082417, -0.06995639908686885, -0.2294279178816148, -0.11604066069733787, -0.16610099387191865, 0.01403976172169477, -0.07349388419847797, -0.11861262327156864, 0.37912984284294116, 0.2495850773116985, 0.23594113168391315, 0.10060033978071886, 0.3142604448578574, 0.04400410318935015, 0.10964533027908584, 0.12217388590858258, 0.2396211748120266, 0.005541357603347437, 0.13949550426710253, -0.20054008016308358, 0.10684426257318012, -0.006609840037916521]
|
1,803.09821
|
On valuation independence and defectless extensions of valued fields
|
In this article we further develop the theory of valuation independence and
study its relation with classical notions in valuation theory such as immediate
and defectless extensions. We use this general theory to settle two open
questions regarding vector space defectless extensions of valued fields.
Additionally, we provide a characterization of such extensions within various
classes of valued fields, extending results of Fran\c{c}oise Delon.
|
math.AC math.LO
|
in this article we further develop the theory of valuation independence and study its relation with classical notions in valuation theory such as immediate and defectless extensions we use this general theory to settle two open questions regarding vector space defectless extensions of valued fields additionally we provide a characterization of such extensions within various classes of valued fields extending results of franccoise delon
|
[['in', 'this', 'article', 'we', 'further', 'develop', 'the', 'theory', 'of', 'valuation', 'independence', 'and', 'study', 'its', 'relation', 'with', 'classical', 'notions', 'in', 'valuation', 'theory', 'such', 'as', 'immediate', 'and', 'defectless', 'extensions', 'we', 'use', 'this', 'general', 'theory', 'to', 'settle', 'two', 'open', 'questions', 'regarding', 'vector', 'space', 'defectless', 'extensions', 'of', 'valued', 'fields', 'additionally', 'we', 'provide', 'a', 'characterization', 'of', 'such', 'extensions', 'within', 'various', 'classes', 'of', 'valued', 'fields', 'extending', 'results', 'of', 'franccoise', 'delon']]
|
[-0.10374956708844929, 0.06325185268614737, -0.07490209073552655, 0.10037542780166463, -0.11517520234107025, -0.07581435683523378, 0.04225327559314402, 0.3455984072375392, -0.3165702794397634, -0.2440865859389305, 0.11499842271644858, -0.22143306046546923, -0.1944689252820339, 0.20048218247081553, -0.09652179797800879, -0.01855849661025411, -0.04896076614524992, 0.05780171703164732, -0.08409696598611181, -0.2940058402776245, 0.34579232136260657, -0.029973777454523814, 0.18815626624217702, 0.09947733498281902, 0.06825686327462631, 0.09905430690444533, -0.07132032504748731, 0.08543517532165251, -0.2066108219266411, 0.19074415214478024, 0.29530163464092074, 0.17440649802752195, 0.3184345070095289, -0.4115905562445285, -0.21946993328276135, 0.14796443405516801, 0.0620338691256216, 0.06277487759611436, -0.05495920382617485, -0.24875202865177204, 0.09635979171088409, -0.18529002267187314, -0.18767073490316905, -0.12185521865825331, 0.0014752786410676818, 0.02809084219015425, -0.24191337109853825, -0.008496651085951025, 0.11238539658324231, 0.15785353620433146, -0.12970302481802978, -0.07163044412450362, 0.07961548509127978, 0.05373836710073408, 0.06455320422907197, 0.020881963247019384, 0.0758902269179031, -0.12280022242801293, -0.22568783801167258, 0.35084488204429076, -0.0690173130955488, -0.21390192201065403, 0.1992331234856494, -0.13726567626295108, -0.1714134421790876, -0.024143448269497308, 0.15864623058587313, 0.12473545309215311, -0.07573670998866124, 0.1916769770591239, -0.1410067905450151, 0.04917353806122842, 0.08686150227939445, 0.1121273623042119, 0.16776131303419198, 0.0890671561605164, 0.053756901750429756, 0.17256583384652105, 0.02928135779109739, -0.13112777410932477, -0.3668306746653148, -0.20690411796547575, -0.039015391723267616, 0.08019251252953259, -0.05048256527054094, -0.19341699215805247, 0.4298880972071654, 0.20482438522121232, 0.16240639468684556, 0.10313321536199914, 0.23967555248075062, 0.07086289145739838, -0.0016101226432337647, 0.02326726895712671, 0.12571798043236845, 0.27526543931000763, 0.015951827870652316, -0.08207873308232852, -0.038805074938055545, 0.04412788176347339]
|
1,803.09822
|
The X_CO conversion factor from galactic multiphase ISM simulations
|
CO(J=1-0) line emission is a widely used observational tracer of molecular
gas, rendering essential the X_CO factor, which is applied to convert CO
luminosity to H_2 mass. We use numerical simulations to study how X_CO depends
on numerical resolution, non-steady-state chemistry, physical environment, and
observational beam size. Our study employs 3D magnetohydrodynamics (MHD)
simulations of galactic disks with solar neighborhood conditions, where star
formation and the three-phase interstellar medium (ISM) are self-consistently
regulated by gravity and stellar feedback. Synthetic CO maps are obtained by
post-processing the MHD simulations with chemistry and radiation transfer. We
find that CO is only an approximate tracer of H_2. On parsec scales, W_CO is
more fundamentally a measure of mass-weighted volume density, rather than H_2
column density. Nevertheless, $\langle X_\mathrm{CO}
\rangle=0.7-1.0\times10^{20}~\mathrm{cm^{-2}K^{-1}km^{-1}s}$ consistent with
observations, insensitive to the evolutionary ISM state or radiation field
strength if steady-state chemistry is assumed. Due to non-steady-state
chemistry, younger molecular clouds have slightly lower X_CO and flatter
profiles of X_CO versus extinction than older ones. The CO-dark H_2 fraction is
26-79 %, anti-correlated with the average extinction. As the observational beam
size increases from 1 pc to 100 pc, X_CO increases by a factor of ~ 2. Under
solar neighborhood conditions, X_CO in molecular clouds is converged at a
numerical resolution of 2 pc. However, the total CO abundance and luminosity
are not converged even at the numerical resolution of 1 pc. Our simulations
successfully reproduce the observed variations of X_CO on parsec scales, as
well as the dependence of X_CO on extinction and the CO excitation temperature.
|
astro-ph.GA
|
coj10 line emission is a widely used observational tracer of molecular gas rendering essential the x_co factor which is applied to convert co luminosity to h_2 mass we use numerical simulations to study how x_co depends on numerical resolution nonsteadystate chemistry physical environment and observational beam size our study employs 3d magnetohydrodynamics mhd simulations of galactic disks with solar neighborhood conditions where star formation and the threephase interstellar medium ism are selfconsistently regulated by gravity and stellar feedback synthetic co maps are obtained by postprocessing the mhd simulations with chemistry and radiation transfer we find that co is only an approximate tracer of h_2 on parsec scales w_co is more fundamentally a measure of massweighted volume density rather than h_2 column density nevertheless langle x_mathrmco rangle0710times1020mathrmcm2k1km1s consistent with observations insensitive to the evolutionary ism state or radiation field strength if steadystate chemistry is assumed due to nonsteadystate chemistry younger molecular clouds have slightly lower x_co and flatter profiles of x_co versus extinction than older ones the codark h_2 fraction is 2679 anticorrelated with the average extinction as the observational beam size increases from 1 pc to 100 pc x_co increases by a factor of 2 under solar neighborhood conditions x_co in molecular clouds is converged at a numerical resolution of 2 pc however the total co abundance and luminosity are not converged even at the numerical resolution of 1 pc our simulations successfully reproduce the observed variations of x_co on parsec scales as well as the dependence of x_co on extinction and the co excitation temperature
|
[['coj10', 'line', 'emission', 'is', 'a', 'widely', 'used', 'observational', 'tracer', 'of', 'molecular', 'gas', 'rendering', 'essential', 'the', 'x_co', 'factor', 'which', 'is', 'applied', 'to', 'convert', 'co', 'luminosity', 'to', 'h_2', 'mass', 'we', 'use', 'numerical', 'simulations', 'to', 'study', 'how', 'x_co', 'depends', 'on', 'numerical', 'resolution', 'nonsteadystate', 'chemistry', 'physical', 'environment', 'and', 'observational', 'beam', 'size', 'our', 'study', 'employs', '3d', 'magnetohydrodynamics', 'mhd', 'simulations', 'of', 'galactic', 'disks', 'with', 'solar', 'neighborhood', 'conditions', 'where', 'star', 'formation', 'and', 'the', 'threephase', 'interstellar', 'medium', 'ism', 'are', 'selfconsistently', 'regulated', 'by', 'gravity', 'and', 'stellar', 'feedback', 'synthetic', 'co', 'maps', 'are', 'obtained', 'by', 'postprocessing', 'the', 'mhd', 'simulations', 'with', 'chemistry', 'and', 'radiation', 'transfer', 'we', 'find', 'that', 'co', 'is', 'only', 'an', 'approximate', 'tracer', 'of', 'h_2', 'on', 'parsec', 'scales', 'w_co', 'is', 'more', 'fundamentally', 'a', 'measure', 'of', 'massweighted', 'volume', 'density', 'rather', 'than', 'h_2', 'column', 'density', 'nevertheless', 'langle', 'x_mathrmco', 'rangle0710times1020mathrmcm2k1km1s', 'consistent', 'with', 'observations', 'insensitive', 'to', 'the', 'evolutionary', 'ism', 'state', 'or', 'radiation', 'field', 'strength', 'if', 'steadystate', 'chemistry', 'is', 'assumed', 'due', 'to', 'nonsteadystate', 'chemistry', 'younger', 'molecular', 'clouds', 'have', 'slightly', 'lower', 'x_co', 'and', 'flatter', 'profiles', 'of', 'x_co', 'versus', 'extinction', 'than', 'older', 'ones', 'the', 'codark', 'h_2', 'fraction', 'is', '2679', 'anticorrelated', 'with', 'the', 'average', 'extinction', 'as', 'the', 'observational', 'beam', 'size', 'increases', 'from', '1', 'pc', 'to', '100', 'pc', 'x_co', 'increases', 'by', 'a', 'factor', 'of', '2', 'under', 'solar', 'neighborhood', 'conditions', 'x_co', 'in', 'molecular', 'clouds', 'is', 'converged', 'at', 'a', 'numerical', 'resolution', 'of', '2', 'pc', 'however', 'the', 'total', 'co', 'abundance', 'and', 'luminosity', 'are', 'not', 'converged', 'even', 'at', 'the', 'numerical', 'resolution', 'of', '1', 'pc', 'our', 'simulations', 'successfully', 'reproduce', 'the', 'observed', 'variations', 'of', 'x_co', 'on', 'parsec', 'scales', 'as', 'well', 'as', 'the', 'dependence', 'of', 'x_co', 'on', 'extinction', 'and', 'the', 'co', 'excitation', 'temperature']]
|
[-0.023699036851597088, 0.10696588379931185, -0.017662215963182713, 0.08529510870235402, -0.005949698808223834, -0.059857663786841236, 0.013458238460911298, 0.4623818481304193, -0.19752079679119022, -0.3713337204974925, 0.022728474647369927, -0.24676855133750694, 0.013808359613860894, 0.16659573581264808, 0.028319468511923736, -0.012202052619002701, 0.03287413748618024, -0.1271426633962986, -0.039277265431808504, -0.20365882443913844, 0.29924757851346623, 0.14860235704587618, 0.16570146309590084, 0.03731064597883707, 0.04398743300528446, -0.2005297254417607, -0.051657006651597476, 0.0008223485684743806, -0.19140832900247842, 0.040492382482165405, 0.201933837890544, 0.11740479286826352, 0.19428474859890377, -0.43098773604825785, -0.25949623364690144, 0.030902210419644187, 0.2032586398733257, 0.038049568585488254, -0.041189464673562354, -0.19041908904449947, 0.04104479428071514, -0.14998027302919273, -0.16101782344670032, 0.04797876378283891, 0.06993259279022412, 0.04611187165344587, -0.27254235516431125, 0.1728338906394222, -0.06544136710597474, 0.11215024798180864, -0.08944724230353422, -0.14350771761440448, -0.12190810319592094, 0.04485600070361593, -0.021947313107001657, 0.10435296406991515, 0.31779687123726535, -0.13719386239296835, 0.031044393417097835, 0.4484688373348812, -0.08541356764971683, -0.0845882135366086, 0.2564139258164338, -0.21543649773034285, -0.12562222937982448, 0.20007809513642383, 0.12034304266456854, 0.09737475349875203, -0.09751355743473727, 0.008236883882950373, -0.05340604174821435, 0.28917235420950554, 0.054560635745959735, 0.026058791722483904, 0.23965969417182537, 0.12354671214836035, 0.07379544464817911, 0.05715750079310274, -0.20166287600640723, -0.11226136221093946, -0.20018014140434476, -0.10555078162123328, -0.14184879739455908, 0.13935028992483084, -0.1752790987410278, -0.09344309662641744, 0.2758358441746017, 0.15978632962861256, 0.2158109944414075, 0.06285844337546705, 0.36633705237342906, 0.11811875038331175, 0.06828514362911771, 0.14138699709640248, 0.24658323973674962, 0.19954623112900424, 0.09257115781161816, -0.2903404609629656, 0.12014050209129104, -0.003141094890897983]
|
1,803.09823
|
The Impact of the Object-Oriented Software Evolution on Software
Metrics: The Iris Approach
|
The Object-Oriented (OO) software system evolves over the time to meet the
new requirements. Based on the initial release of software, the continuous
modification of software code leads to software evolution. Software needs to
evolve over the time to meet the new user's requirements. Software companies
often develop variant software of the original one depends on customers' needs.
The main hypothesis of this paper states that the software when it evolves over
the time, its code continues to grow, change and become more complex. This
paper proposes an automatic approach (Iris) to examine the proposed hypothesis.
Originality of this approach is the exploiting of the software variants to
study the impact of software evolution on the software metrics. This paper
presents the results of experiments conducted on three releases of drawing
shapes software, sixteen releases of rhino software, eight releases of mobile
media software and ten releases of ArgoUML software. Based on the extracted
software metrics, It has been found that Iris hypothesis is supported by the
computed metrics.
|
cs.SE
|
the objectoriented oo software system evolves over the time to meet the new requirements based on the initial release of software the continuous modification of software code leads to software evolution software needs to evolve over the time to meet the new users requirements software companies often develop variant software of the original one depends on customers needs the main hypothesis of this paper states that the software when it evolves over the time its code continues to grow change and become more complex this paper proposes an automatic approach iris to examine the proposed hypothesis originality of this approach is the exploiting of the software variants to study the impact of software evolution on the software metrics this paper presents the results of experiments conducted on three releases of drawing shapes software sixteen releases of rhino software eight releases of mobile media software and ten releases of argouml software based on the extracted software metrics it has been found that iris hypothesis is supported by the computed metrics
|
[['the', 'objectoriented', 'oo', 'software', 'system', 'evolves', 'over', 'the', 'time', 'to', 'meet', 'the', 'new', 'requirements', 'based', 'on', 'the', 'initial', 'release', 'of', 'software', 'the', 'continuous', 'modification', 'of', 'software', 'code', 'leads', 'to', 'software', 'evolution', 'software', 'needs', 'to', 'evolve', 'over', 'the', 'time', 'to', 'meet', 'the', 'new', 'users', 'requirements', 'software', 'companies', 'often', 'develop', 'variant', 'software', 'of', 'the', 'original', 'one', 'depends', 'on', 'customers', 'needs', 'the', 'main', 'hypothesis', 'of', 'this', 'paper', 'states', 'that', 'the', 'software', 'when', 'it', 'evolves', 'over', 'the', 'time', 'its', 'code', 'continues', 'to', 'grow', 'change', 'and', 'become', 'more', 'complex', 'this', 'paper', 'proposes', 'an', 'automatic', 'approach', 'iris', 'to', 'examine', 'the', 'proposed', 'hypothesis', 'originality', 'of', 'this', 'approach', 'is', 'the', 'exploiting', 'of', 'the', 'software', 'variants', 'to', 'study', 'the', 'impact', 'of', 'software', 'evolution', 'on', 'the', 'software', 'metrics', 'this', 'paper', 'presents', 'the', 'results', 'of', 'experiments', 'conducted', 'on', 'three', 'releases', 'of', 'drawing', 'shapes', 'software', 'sixteen', 'releases', 'of', 'rhino', 'software', 'eight', 'releases', 'of', 'mobile', 'media', 'software', 'and', 'ten', 'releases', 'of', 'argouml', 'software', 'based', 'on', 'the', 'extracted', 'software', 'metrics', 'it', 'has', 'been', 'found', 'that', 'iris', 'hypothesis', 'is', 'supported', 'by', 'the', 'computed', 'metrics']]
|
[-0.13166503757557144, 0.004493855506163007, -0.09230939131867628, 0.018401178402460312, -0.08343358948782441, -0.13687988529480727, -0.0085194026053484, 0.3967051487748644, -0.2324592891548361, -0.3508842703165664, 0.12033619892151494, -0.2612427300551817, -0.11607396214579542, 0.23062306707669494, -0.08320795074992236, 0.08224143337914332, 0.12766464288523866, 0.0024422367652212934, -0.058665762487743495, -0.3336594883141862, 0.3405124884697476, 0.10801278173901319, 0.3390009153282292, 0.0493125600291283, 0.04083351324689353, -0.0263639114023785, -0.10601100283453152, -0.04381668375953311, -0.12771852655168914, 0.149042892600673, 0.25829935051401015, 0.28639465706960654, 0.3453211515720579, -0.4080042614368722, -0.1631729998159807, 0.025348709627342897, 0.13865001144308953, 0.04256173154516589, 0.009759129805561748, -0.2829671004936764, 0.07899911238235377, -0.21903205860871822, -0.12262180619706799, -0.018377120720244767, -0.022237134238128505, 0.008643920687193583, -0.18308181562904446, -0.06975978603891451, 0.02355087327859586, 0.09224807800880323, -0.061537297975432705, -0.06424595528612069, -0.03055599194166938, 0.1820228788864846, 0.10065187156544111, 0.04222571419779256, 0.14966080896972148, -0.04928765227842156, -0.11352767801283681, 0.38977363196733805, -0.01482407767685973, -0.14589292151019131, 0.20123008420480237, -0.03522366983261669, -0.19696226026973732, 0.1157655611050792, 0.23306842136108094, 0.04449170895774538, -0.20782638347191096, 0.07490206411360607, 0.07305382770330955, 0.23387110548875562, 0.02238604177892696, -0.04304381484897541, 0.1865843288223481, 0.20950998961779987, 0.028802956293691836, 0.1604930276087197, -0.032973333942382374, -0.0910088712754216, -0.2478178933157497, -0.1913035530402946, -0.13804868133211995, 0.006749443676588791, -0.026386936674541738, -0.23032965012160794, 0.4457670748732718, 0.18683141558652833, 0.07207263767763618, 0.059016796289056185, 0.34021210939889507, 0.031850824711866496, 0.12584102980707984, 0.11721217097614758, 0.16349699230132891, -0.016782099972867098, 0.1784339195229612, -0.17961419285607658, 0.12564344455798468, 0.010745864687903253]
|
1,803.09824
|
Low-Shot Learning for the Semantic Segmentation of Remote Sensing
Imagery
|
Recent advances in computer vision using deep learning with RGB imagery
(e.g., object recognition and detection) have been made possible thanks to the
development of large annotated RGB image datasets. In contrast, multispectral
image (MSI) and hyperspectral image (HSI) datasets contain far fewer labeled
images, in part due to the wide variety of sensors used. These annotations are
especially limited for semantic segmentation, or pixel-wise classification, of
remote sensing imagery because it is labor intensive to generate image
annotations. Low-shot learning algorithms can make effective inferences despite
smaller amounts of annotated data. In this paper, we study low-shot learning
using self-taught feature learning for semantic segmentation. We introduce 1)
an improved self-taught feature learning framework for HSI and MSI data and 2)
a semi-supervised classification algorithm. When these are combined, they
achieve state-of-the-art performance on remote sensing datasets that have
little annotated training data available. These low-shot learning frameworks
will reduce the manual image annotation burden and improve semantic
segmentation performance for remote sensing imagery.
|
cs.CV cs.LG
|
recent advances in computer vision using deep learning with rgb imagery eg object recognition and detection have been made possible thanks to the development of large annotated rgb image datasets in contrast multispectral image msi and hyperspectral image hsi datasets contain far fewer labeled images in part due to the wide variety of sensors used these annotations are especially limited for semantic segmentation or pixelwise classification of remote sensing imagery because it is labor intensive to generate image annotations lowshot learning algorithms can make effective inferences despite smaller amounts of annotated data in this paper we study lowshot learning using selftaught feature learning for semantic segmentation we introduce 1 an improved selftaught feature learning framework for hsi and msi data and 2 a semisupervised classification algorithm when these are combined they achieve stateoftheart performance on remote sensing datasets that have little annotated training data available these lowshot learning frameworks will reduce the manual image annotation burden and improve semantic segmentation performance for remote sensing imagery
|
[['recent', 'advances', 'in', 'computer', 'vision', 'using', 'deep', 'learning', 'with', 'rgb', 'imagery', 'eg', 'object', 'recognition', 'and', 'detection', 'have', 'been', 'made', 'possible', 'thanks', 'to', 'the', 'development', 'of', 'large', 'annotated', 'rgb', 'image', 'datasets', 'in', 'contrast', 'multispectral', 'image', 'msi', 'and', 'hyperspectral', 'image', 'hsi', 'datasets', 'contain', 'far', 'fewer', 'labeled', 'images', 'in', 'part', 'due', 'to', 'the', 'wide', 'variety', 'of', 'sensors', 'used', 'these', 'annotations', 'are', 'especially', 'limited', 'for', 'semantic', 'segmentation', 'or', 'pixelwise', 'classification', 'of', 'remote', 'sensing', 'imagery', 'because', 'it', 'is', 'labor', 'intensive', 'to', 'generate', 'image', 'annotations', 'lowshot', 'learning', 'algorithms', 'can', 'make', 'effective', 'inferences', 'despite', 'smaller', 'amounts', 'of', 'annotated', 'data', 'in', 'this', 'paper', 'we', 'study', 'lowshot', 'learning', 'using', 'selftaught', 'feature', 'learning', 'for', 'semantic', 'segmentation', 'we', 'introduce', '1', 'an', 'improved', 'selftaught', 'feature', 'learning', 'framework', 'for', 'hsi', 'and', 'msi', 'data', 'and', '2', 'a', 'semisupervised', 'classification', 'algorithm', 'when', 'these', 'are', 'combined', 'they', 'achieve', 'stateoftheart', 'performance', 'on', 'remote', 'sensing', 'datasets', 'that', 'have', 'little', 'annotated', 'training', 'data', 'available', 'these', 'lowshot', 'learning', 'frameworks', 'will', 'reduce', 'the', 'manual', 'image', 'annotation', 'burden', 'and', 'improve', 'semantic', 'segmentation', 'performance', 'for', 'remote', 'sensing', 'imagery']]
|
[0.03375322727176051, -0.03663524342057027, -0.021355902084685636, 0.062143881766436, -0.15563492232679643, -0.1862128151665357, -0.012803747871128673, 0.5406494028866291, -0.22764303892794432, -0.4359754839291175, 0.1323113191139066, -0.293458163726962, -0.14275193595553212, 0.19964436003514988, -0.2887707174981408, 0.12243175691868545, 0.2773362152955749, 0.053059305583663056, -0.04119909410541313, -0.30188849592778944, 0.25173829473188203, 0.0016138941880357875, 0.40714009876334756, 0.007442706645551053, 0.12424707381393421, -0.0461815495029882, -0.1011421017983759, -0.048747786728552345, -0.016808275462376926, 0.2587517450083837, 0.4620755432427607, 0.26918910000840146, 0.3269109990927532, -0.42992345325959225, -0.2501725061309778, 0.10988554697145116, 0.18525255178692257, 0.09629388284317401, -0.11372151784669382, -0.4265126759764936, 0.06260426118546589, -0.1501649130707268, 0.1361772974824293, -0.21769976740928762, -0.002003564746965739, -0.0973462420984905, -0.277879845540773, 0.036434439918781265, 0.03304663310603549, 0.1788716704090775, -0.07843599434885563, -0.12372519226152111, 0.052757269090436626, 0.22349440975372228, 0.004028407567547578, 0.08725451456284095, 0.17448642249995222, -0.3020647497505486, -0.10930308931450726, 0.33167538829147813, -0.0022003938316960225, -0.18114862823576638, 0.2595591010412935, 0.02729792185127735, -0.2017372006606875, 0.13575711240145294, 0.2508472457870305, 0.12935428747371064, -0.15607066168493916, 0.02569660276675484, -0.01887195333838463, 0.20093580529545294, 0.08757285509597171, 0.003137953742760036, 0.15435238728356182, 0.3043171944308349, 2.028928173593048e-05, 0.12615736756248006, -0.2527828787975578, 0.0387344934898217, -0.11521741597362879, -0.08942801285443376, -0.25082708659271397, -0.07396665708034891, -0.12000920455999828, -0.14438707281299162, 0.3088599000182567, 0.3023690371181477, 0.19014929184323234, 0.06535559946417131, 0.41947516747044794, -0.06488428771157156, 0.200132317349992, 0.04601091898018212, 0.17075140812420145, -0.03058618849891266, 0.18903952019402023, -0.11374170910531768, 0.03977305906979988, 0.04319488772924877]
|
1,803.09825
|
Proton-driven patterning of bulk transition metal dichalcogenides
|
At the few-atom-thick limit, transition metal dichalcogenides (TMDs) exhibit
a host of attractive electronic optical, and structural properties. The
possibility to pattern these properties has a great impact on applied and
fundamental research. Here, we demonstrate spatial control over the light
emission, lattice deformation, and hydrogen storage in bulk TMDs. By low-energy
proton irradiation, we create uniquely favorable conditions for the production
and accumulation of molecular hydrogen just one or few monolayers beneath the
crystal basal plane of bulk WS2, WSe2, WTe2, MoSe2, and MoS2 samples. H2
therein produced coalesces to form bubbles, which lead to the localized
swelling of one X-M-X plane prevalently. This results eventually in the
creation of atomically thin domes filled with molecular hydrogen at 10 atm. The
domes emit light strongly well above room temperature and can store H2
indefinitely. They can be produced with the desired density, well-ordered
positions, and size tunable from the nanometer to the micrometer scale, thus
providing a template for the manageable and durable mechanical and electronic
structuring of two-dimensional materials.
|
cond-mat.mtrl-sci
|
at the fewatomthick limit transition metal dichalcogenides tmds exhibit a host of attractive electronic optical and structural properties the possibility to pattern these properties has a great impact on applied and fundamental research here we demonstrate spatial control over the light emission lattice deformation and hydrogen storage in bulk tmds by lowenergy proton irradiation we create uniquely favorable conditions for the production and accumulation of molecular hydrogen just one or few monolayers beneath the crystal basal plane of bulk ws2 wse2 wte2 mose2 and mos2 samples h2 therein produced coalesces to form bubbles which lead to the localized swelling of one xmx plane prevalently this results eventually in the creation of atomically thin domes filled with molecular hydrogen at 10 atm the domes emit light strongly well above room temperature and can store h2 indefinitely they can be produced with the desired density wellordered positions and size tunable from the nanometer to the micrometer scale thus providing a template for the manageable and durable mechanical and electronic structuring of twodimensional materials
|
[['at', 'the', 'fewatomthick', 'limit', 'transition', 'metal', 'dichalcogenides', 'tmds', 'exhibit', 'a', 'host', 'of', 'attractive', 'electronic', 'optical', 'and', 'structural', 'properties', 'the', 'possibility', 'to', 'pattern', 'these', 'properties', 'has', 'a', 'great', 'impact', 'on', 'applied', 'and', 'fundamental', 'research', 'here', 'we', 'demonstrate', 'spatial', 'control', 'over', 'the', 'light', 'emission', 'lattice', 'deformation', 'and', 'hydrogen', 'storage', 'in', 'bulk', 'tmds', 'by', 'lowenergy', 'proton', 'irradiation', 'we', 'create', 'uniquely', 'favorable', 'conditions', 'for', 'the', 'production', 'and', 'accumulation', 'of', 'molecular', 'hydrogen', 'just', 'one', 'or', 'few', 'monolayers', 'beneath', 'the', 'crystal', 'basal', 'plane', 'of', 'bulk', 'ws2', 'wse2', 'wte2', 'mose2', 'and', 'mos2', 'samples', 'h2', 'therein', 'produced', 'coalesces', 'to', 'form', 'bubbles', 'which', 'lead', 'to', 'the', 'localized', 'swelling', 'of', 'one', 'xmx', 'plane', 'prevalently', 'this', 'results', 'eventually', 'in', 'the', 'creation', 'of', 'atomically', 'thin', 'domes', 'filled', 'with', 'molecular', 'hydrogen', 'at', '10', 'atm', 'the', 'domes', 'emit', 'light', 'strongly', 'well', 'above', 'room', 'temperature', 'and', 'can', 'store', 'h2', 'indefinitely', 'they', 'can', 'be', 'produced', 'with', 'the', 'desired', 'density', 'wellordered', 'positions', 'and', 'size', 'tunable', 'from', 'the', 'nanometer', 'to', 'the', 'micrometer', 'scale', 'thus', 'providing', 'a', 'template', 'for', 'the', 'manageable', 'and', 'durable', 'mechanical', 'and', 'electronic', 'structuring', 'of', 'twodimensional', 'materials']]
|
[-0.07572390890676188, 0.20858207684530713, -0.019962743406786637, -0.011256439738002989, -0.019050308786716093, -0.14499400154488873, 0.11000056756687734, 0.457450060634052, -0.2922805381062276, -0.29067141332129454, 0.023855675768572837, -0.31768859431202356, -0.08788922235287507, 0.16564881622325628, 0.05603755211786312, 0.0396693726279088, -0.020327500101891074, -0.11129507429021246, -0.05902336023761617, -0.19316332752521917, 0.2368742471711491, 0.06111674635561512, 0.32670808415038183, 0.11645715769161197, 0.04421964137513629, -0.05218197498650304, 0.09702610393390333, -0.015010371943935752, -0.1610057639909963, 0.12273901731857811, 0.25014987616964124, -0.06450392486157772, 0.19896278706214884, -0.48755879350663983, -0.21861158987397658, 0.02223975643488195, 0.14033324164064492, 0.14017555632094358, -0.10093348216238048, -0.2505461848607999, 0.06075796437833239, -0.11092759247951428, -0.15594204210895388, -0.0579484987688963, 0.0011878718402894104, 0.02141134896151283, -0.18574818744827473, 0.05400016505189021, 0.011975962915868662, 0.057977773006731535, -0.08448186035761061, -0.10230798004605972, -0.14523948359385352, 0.06978721802040716, -0.0007232608355800895, 0.031210199732552558, 0.27976220942321506, -0.1382644271135659, -0.036166995676124795, 0.42462249990990936, -0.04122342525652665, -0.07247194295256015, 0.21312507830067154, -0.20664359252516398, -0.07525236904347206, 0.22065385782488567, 0.15641849363900667, 0.09466413434540086, -0.1262545847084017, 0.02586863036644097, -0.0004273467950577683, 0.2025608726681265, 0.15772397455704562, 0.12189297070487073, 0.31095197806956576, 0.21255438119063483, 0.015555730997413562, 0.1347269266111064, -0.10358521707068362, -0.008777105669929262, -0.19769436313277658, -0.1981710380025427, -0.1720695970538894, 0.0971753278569154, -0.07946369958457687, -0.21218381980981896, 0.3863122181241017, 0.08388470270643558, 0.17697051473454956, -0.07547473891788875, 0.24577140923904475, 0.03597316857536926, 0.11445559977745527, 0.022893854688086055, 0.25584523664951764, 0.1252126883742783, 0.10864427089494283, -0.20158590548671781, 0.09045537964660016, -0.030482501394854967]
|
1,803.09826
|
Assortative Exchange Processes
|
In exchange processes clusters composed of elementary building blocks,
monomers, undergo binary exchange in which a monomer is transferred from one
cluster to another. In assortative exchange only clusters with comparable
masses participate in exchange events. We study maximally assortative exchange
processes in which only clusters of equal masses can exchange monomers. A
mean-field framework based on rate equations is appropriate for spatially
homogeneous systems in sufficiently high spatial dimension. For
diffusion-controlled exchange processes, the mean-field approach is erroneous
when the spatial dimension is smaller than critical; we analyze such systems
using scaling and heuristic arguments. Apart from infinite-cluster systems we
explore the fate of finite systems and study maximally assortative exchange
processes driven by a localized input.
|
cond-mat.stat-mech cond-mat.soft
|
in exchange processes clusters composed of elementary building blocks monomers undergo binary exchange in which a monomer is transferred from one cluster to another in assortative exchange only clusters with comparable masses participate in exchange events we study maximally assortative exchange processes in which only clusters of equal masses can exchange monomers a meanfield framework based on rate equations is appropriate for spatially homogeneous systems in sufficiently high spatial dimension for diffusioncontrolled exchange processes the meanfield approach is erroneous when the spatial dimension is smaller than critical we analyze such systems using scaling and heuristic arguments apart from infinitecluster systems we explore the fate of finite systems and study maximally assortative exchange processes driven by a localized input
|
[['in', 'exchange', 'processes', 'clusters', 'composed', 'of', 'elementary', 'building', 'blocks', 'monomers', 'undergo', 'binary', 'exchange', 'in', 'which', 'a', 'monomer', 'is', 'transferred', 'from', 'one', 'cluster', 'to', 'another', 'in', 'assortative', 'exchange', 'only', 'clusters', 'with', 'comparable', 'masses', 'participate', 'in', 'exchange', 'events', 'we', 'study', 'maximally', 'assortative', 'exchange', 'processes', 'in', 'which', 'only', 'clusters', 'of', 'equal', 'masses', 'can', 'exchange', 'monomers', 'a', 'meanfield', 'framework', 'based', 'on', 'rate', 'equations', 'is', 'appropriate', 'for', 'spatially', 'homogeneous', 'systems', 'in', 'sufficiently', 'high', 'spatial', 'dimension', 'for', 'diffusioncontrolled', 'exchange', 'processes', 'the', 'meanfield', 'approach', 'is', 'erroneous', 'when', 'the', 'spatial', 'dimension', 'is', 'smaller', 'than', 'critical', 'we', 'analyze', 'such', 'systems', 'using', 'scaling', 'and', 'heuristic', 'arguments', 'apart', 'from', 'infinitecluster', 'systems', 'we', 'explore', 'the', 'fate', 'of', 'finite', 'systems', 'and', 'study', 'maximally', 'assortative', 'exchange', 'processes', 'driven', 'by', 'a', 'localized', 'input']]
|
[-0.16493437801866587, 0.22870493604470107, -0.03840739320237505, 0.13219392283077716, 0.004094683689507261, -0.18145127399130015, 0.10134133657882527, 0.3537729965933299, -0.2599790785737904, -0.25787709825435434, 0.03337640712882187, -0.3226947189995356, -0.1320090519853323, 0.11770001198244044, 0.06224581145413094, -0.052008796340225545, 0.06019450190587569, 0.018539060191330264, 0.004744664256824023, -0.2388216059623381, 0.3360743972046648, 0.012862003005851629, 0.2647221360229335, 0.008690655057839418, 0.08578251058756674, 0.05667567810722453, 0.002731259415020882, -0.005597138812398475, -0.10794764413336544, 0.10115491597611315, 0.2161223876449848, 0.026338797581571517, 0.22947079191868336, -0.4303247932723518, -0.2024860277651588, 0.10631762325006017, 0.20595313060113182, 0.1517942709852231, -0.022483774736105324, -0.2520971830482437, 0.07633898193233694, -0.21447807791942763, -0.12955709192724266, -0.05280034320815703, 0.02099132984819905, 0.053104333158459624, -0.30626293260335796, 0.16338926856011404, 0.027524880682102452, 0.05325948204687339, -0.05199653378014958, -0.09647451807997363, -0.04667100502904189, 0.1375048725199353, 0.007867121759218052, -0.020435723298529194, 0.17020827604820793, -0.10763242285130388, -0.11729784080190427, 0.36062381267389754, -0.02654993539082648, -0.20572765078000976, 0.2687171881217352, -0.1333299936663549, -0.13300455847392018, 0.12457201442527348, 0.22230749568602037, 0.12251982853897864, -0.21354549187958197, 0.06567271674837191, 0.02795164634363126, 0.2378029756216427, 0.040331043934417984, 0.024401699694986376, 0.21303753484577193, 0.16968634008564118, 0.05885270226083822, 0.13581553965775392, 0.014288386702932164, -0.2185918134873954, -0.196169114971565, -0.07970398599360833, -0.18638068941121888, 0.07012204099762237, -0.14044589467195723, -0.1354206402478266, 0.29497262518221545, 0.12135028473290978, 0.19160183776817205, -0.0021929279092099455, 0.23961167640478934, 0.08739251596063881, 0.10552181121182896, 0.0777166315859531, 0.18820252041805977, 0.1551871017801528, 0.05988463188395283, -0.17042672219370508, 0.09629791568554306, 0.0831766604994408]
|
1,803.09827
|
Vibrational properties of metastable polymorph structures by machine
learning
|
Despite vibrational properties being critical for the ab initio prediction of
the finite temperature stability and transport properties of solids, their
inclusion in ab initio materials repositories has been hindered by expensive
computational requirements. Here we tackle the challenge, by showing that a
good estimation of force constants and vibrational properties can be quickly
achieved from the knowledge of atomic equilibrium positions using machine
learning. A random-forest algorithm trained on only 121 metastable structures
of KZnF$_3$ reaches a maximum absolute error of 0.17 eV/$\textrm\AA^2$ for the
interatomic force constants, and it is much less expensive than training the
complete force field for such compound. The predicted force constants are then
used to estimate phonon spectral features, heat capacities, vibrational
entropies, and vibrational free energies, which compare well with the ab initio
ones. The approach can be used for the rapid estimation of stability at finite
temperatures.
|
cond-mat.mtrl-sci
|
despite vibrational properties being critical for the ab initio prediction of the finite temperature stability and transport properties of solids their inclusion in ab initio materials repositories has been hindered by expensive computational requirements here we tackle the challenge by showing that a good estimation of force constants and vibrational properties can be quickly achieved from the knowledge of atomic equilibrium positions using machine learning a randomforest algorithm trained on only 121 metastable structures of kznf_3 reaches a maximum absolute error of 017 evtextrmaa2 for the interatomic force constants and it is much less expensive than training the complete force field for such compound the predicted force constants are then used to estimate phonon spectral features heat capacities vibrational entropies and vibrational free energies which compare well with the ab initio ones the approach can be used for the rapid estimation of stability at finite temperatures
|
[['despite', 'vibrational', 'properties', 'being', 'critical', 'for', 'the', 'ab', 'initio', 'prediction', 'of', 'the', 'finite', 'temperature', 'stability', 'and', 'transport', 'properties', 'of', 'solids', 'their', 'inclusion', 'in', 'ab', 'initio', 'materials', 'repositories', 'has', 'been', 'hindered', 'by', 'expensive', 'computational', 'requirements', 'here', 'we', 'tackle', 'the', 'challenge', 'by', 'showing', 'that', 'a', 'good', 'estimation', 'of', 'force', 'constants', 'and', 'vibrational', 'properties', 'can', 'be', 'quickly', 'achieved', 'from', 'the', 'knowledge', 'of', 'atomic', 'equilibrium', 'positions', 'using', 'machine', 'learning', 'a', 'randomforest', 'algorithm', 'trained', 'on', 'only', '121', 'metastable', 'structures', 'of', 'kznf_3', 'reaches', 'a', 'maximum', 'absolute', 'error', 'of', '017', 'evtextrmaa2', 'for', 'the', 'interatomic', 'force', 'constants', 'and', 'it', 'is', 'much', 'less', 'expensive', 'than', 'training', 'the', 'complete', 'force', 'field', 'for', 'such', 'compound', 'the', 'predicted', 'force', 'constants', 'are', 'then', 'used', 'to', 'estimate', 'phonon', 'spectral', 'features', 'heat', 'capacities', 'vibrational', 'entropies', 'and', 'vibrational', 'free', 'energies', 'which', 'compare', 'well', 'with', 'the', 'ab', 'initio', 'ones', 'the', 'approach', 'can', 'be', 'used', 'for', 'the', 'rapid', 'estimation', 'of', 'stability', 'at', 'finite', 'temperatures']]
|
[-0.057583097898815244, 0.1381026147072488, -0.09540717035512596, 0.044618677685826294, -0.037746369463598564, -0.1385139258119226, 0.10227799585037348, 0.4397181194120397, -0.2860111010150932, -0.3039151622279961, 0.051158815362820555, -0.2954150510356865, -0.08657488693562401, 0.19903267901908192, 0.003264827931868947, 0.12612806033252533, 0.08390888705778504, 0.03961422573249567, -0.08436721395668832, -0.2037594229687885, 0.2267171470124999, 0.07135017953826012, 0.27652624939865844, 0.0841025921723081, 0.06263122127792384, -0.047454234070351556, 0.05198756097969534, 0.03544272423540759, -0.19514464919267185, 0.14824206074505733, 0.26779754476835177, 0.03227075321774464, 0.2870411365422317, -0.43731485527759006, -0.2255269815796055, 0.06666237050699743, 0.12814505905246026, 0.14822972143641286, -0.0024973924777845647, -0.2371374385709512, 0.05810504236837409, -0.12347081189444806, -0.08749615200536533, -0.18827071208377472, 0.03488831885058769, 0.04219716789601888, -0.2533993109892536, 0.10947104465190528, -0.020245912733015656, 0.13740919355121958, -0.1336268847323178, -0.18726896820913275, -0.022281155887564335, 0.11244959667156865, 0.02616317430349429, 0.03253301855390115, 0.1970846008367112, -0.13989380185699296, -0.08164213247558412, 0.43625428368492675, -0.060902621194953904, -0.14029675852766055, 0.18127775085546696, -0.08278809930844647, -0.10566492207969229, 0.18827793753330802, 0.10681957359580944, 0.12439164765399052, -0.16430457893875428, 0.06578195689588837, 0.07227043569986967, 0.19111410649768207, 0.06289414946352029, 0.04292570461661348, 0.16321383755954835, 0.17355368360747686, 0.021111719174465787, 0.1034316576470802, -0.08912331114050984, -0.07125558366209993, -0.20454170412590933, -0.1317291367558937, -0.27080807510194266, 0.058106133202575926, -0.08633788722242268, -0.16563433670429126, 0.3575710014297834, 0.1415336319154853, 0.12858463619260066, 0.04513716276738301, 0.2973006458519699, 0.08877995925851995, 0.0683201406678159, 0.07812347490431017, 0.2905192569790718, 0.14955338873227852, 0.04141862835644537, -0.2743820110481465, 0.0938126281738126, 0.03939888469499743]
|
1,803.09828
|
On Unfoldings of Stretched Polyhedra
|
We give a short proof of a result obtained by Mohammad Ghomi concerning
existence of nets of a convex polyhedron after a suitable linear
transformation.
|
math.MG
|
we give a short proof of a result obtained by mohammad ghomi concerning existence of nets of a convex polyhedron after a suitable linear transformation
|
[['we', 'give', 'a', 'short', 'proof', 'of', 'a', 'result', 'obtained', 'by', 'mohammad', 'ghomi', 'concerning', 'existence', 'of', 'nets', 'of', 'a', 'convex', 'polyhedron', 'after', 'a', 'suitable', 'linear', 'transformation']]
|
[-0.1791576147824526, 0.03560880666598678, -0.1514477925747633, 0.04775515865534544, -0.08214771509170532, -0.15421919345855714, 0.10539219351485371, 0.2765258065611124, -0.27790647119283673, -0.19428416810929774, 0.15133254384621977, -0.18828127145767212, -0.16332991525530816, 0.22557593271136284, -0.13396353714168072, 0.05217155173420906, 0.11383378088474273, -0.03149174984544516, -0.13614711195230483, -0.24889936327934264, 0.2952413558959961, -0.05805916845798492, 0.12650613345205783, 0.08975861012935639, 0.19034766472876072, 0.12330243822187185, -0.016503420174121857, 0.04770630173385143, -0.1859569089114666, 0.146247456073761, 0.24770444765686989, 0.1638814851641655, 0.30153304457664487, -0.3988268396258354, -0.11765646668151021, 0.0770449393056333, 0.01755054058507085, 0.1075152425467968, -0.11588749773800373, -0.2834636465460062, 0.07484692443162203, -0.10135160490870476, -0.20211754074320198, -0.06635526530444621, 0.035252765975892546, 0.06365637687966227, -0.2668680015997961, 0.037018094761733664, 0.25979395806789396, 0.1215381095930934, -0.065518748909235, -0.06739053221361246, 0.030092820152640344, -0.03532462477684021, 0.01751323640346527, 0.08024819581769407, 0.02046178940683603, -0.02615685371682048, -0.13231032505631446, 0.32985532969236375, -0.07115158520638942, -0.1667406792577822, 0.12615790470503271, -0.039453644622117284, -0.12507636602036654, 0.1602858783537522, 0.1089968927949667, 0.17148612599819898, -0.15331654950976373, 0.12255725465714931, -0.15241631953045726, 0.08237503249198198, 0.14276834417134524, -0.013576789107173682, 0.15366259074769914, 0.15321610687300563, 0.11334772385656834, 0.22628327161073686, 0.07472219809889794, -0.008415279313921928, -0.3994355461001396, -0.13752456489950418, -0.18926749730599113, 0.14189376592636108, -0.09701475534588098, -0.1940515534579754, 0.38383347816765306, -0.03241733146831393, 0.2488104421272874, 0.20447369184345007, 0.18412801675498486, 0.06938479527831078, 0.03077713241800666, -0.010190157024189829, 0.16351951174438, 0.1915375375840813, 0.06991559702903033, -0.10416577618569135, 0.039317985009402034, 0.2468997985124588]
|
1,803.09829
|
Fragmentation model of a rapidly expanding ring with arbitrary
cross-section
|
In the paper (Goloveshkin and Myagkov 2014) we proposed a two-dimensional
energy-based model of fragmentation of rapidly expanding cylinder under plane
strain conditions. The model allowed one to estimate the average fragment
length and the number of fragments produced by ductile fracture of the
cylinder. In present note we show that the proposed approach can be used to
estimate the number of fragments in a problem of fragmentation of a rapidly
expanding ring with arbitrary cross-section.
|
physics.class-ph
|
in the paper goloveshkin and myagkov 2014 we proposed a twodimensional energybased model of fragmentation of rapidly expanding cylinder under plane strain conditions the model allowed one to estimate the average fragment length and the number of fragments produced by ductile fracture of the cylinder in present note we show that the proposed approach can be used to estimate the number of fragments in a problem of fragmentation of a rapidly expanding ring with arbitrary crosssection
|
[['in', 'the', 'paper', 'goloveshkin', 'and', 'myagkov', '2014', 'we', 'proposed', 'a', 'twodimensional', 'energybased', 'model', 'of', 'fragmentation', 'of', 'rapidly', 'expanding', 'cylinder', 'under', 'plane', 'strain', 'conditions', 'the', 'model', 'allowed', 'one', 'to', 'estimate', 'the', 'average', 'fragment', 'length', 'and', 'the', 'number', 'of', 'fragments', 'produced', 'by', 'ductile', 'fracture', 'of', 'the', 'cylinder', 'in', 'present', 'note', 'we', 'show', 'that', 'the', 'proposed', 'approach', 'can', 'be', 'used', 'to', 'estimate', 'the', 'number', 'of', 'fragments', 'in', 'a', 'problem', 'of', 'fragmentation', 'of', 'a', 'rapidly', 'expanding', 'ring', 'with', 'arbitrary', 'crosssection']]
|
[-0.10024291772798107, 0.13862330275210175, -0.11268137511167978, 0.013560362179084, -0.004400273426310034, -0.055952963406673155, 0.004051051830960992, 0.3551768398768193, -0.2641525794626088, -0.26912145950906985, 0.05603786829915653, -0.2192905800970825, -0.09889609733048978, 0.1603540085897957, -0.01589418770241979, 0.11036912455047304, 0.07428410313268369, 0.024150579563669256, -0.017388969656658936, -0.23929541556375428, 0.3182401545597492, 0.05808282020577305, 0.25408780532008085, 0.06802861546905636, 0.061312442160891115, 0.01082119350069882, 0.014322784880327212, 0.0947723925315045, -0.18699254862056822, 0.14450593694031388, 0.17954454223650532, 0.12320247439768266, 0.23507364056501034, -0.45834002231021187, -0.19598484332547397, 0.08634185463794179, 0.14932086277199355, 0.10640169310617903, -0.01830208731966244, -0.23618572902538487, 0.09773716364508948, -0.2378684709200988, -0.1712687578354333, 0.015975426964310778, 0.06043407969126428, 0.05619262000294151, -0.2828055046549117, 0.07547014355156068, 0.09264957907096785, 0.010396381059812533, -0.07393466818423287, -0.0655900093387007, -0.03093058819807059, 0.04824725097372524, 0.09893644306292707, 0.050535715430521884, 0.15210521949857875, -0.10857036322153904, -0.023585964673878374, 0.3773029429485669, -0.055531094731712666, -0.19477482245781938, 0.1493863403117536, -0.15813783491014605, -0.08876150724402554, 0.18614623161989288, 0.23124195988340354, 0.15047368859224072, -0.11655262740630959, 0.03597277027674372, -0.06775138583789403, 0.17832902806332787, 0.11293891702803809, -0.04689301295533172, 0.1938066327491322, 0.19327907756323348, 0.009695084709312289, 0.23454676572126462, -0.12449918936535313, -0.07625032881608333, -0.299325413297157, -0.14837976752755208, -0.13932441674783272, 0.0075216304016853305, -0.07050606916694764, -0.1727576306895227, 0.3952484382568179, 0.1726379006333347, 0.235037425960842, 0.07184695784707328, 0.25752456607045354, 0.07225763487528909, 0.07050595864515148, 0.08665532284617625, 0.21136780677212252, 0.12712209220390414, 0.06649339939090046, -0.19349486421088916, 0.06493711029179394, 0.0752418270410114]
|
1,803.0983
|
Cox Regression Model Under Dependent Truncation
|
Truncation is a statistical phenomenon that occurs in many time to event
studies. For example, autopsy-confirmed studies of neurodegenerative diseases
are subject to an inherent left and right truncation, also known as double
truncation. When the goal is to study the effect of risk factors on survival,
the standard Cox regression model cannot be used when the data is subject to
truncation. Existing methods which adjust for both left and right truncation in
the Cox regression model require independence between the survival times and
truncation times, which may not be a reasonable assumption in practice. We
propose an expectation-maximization algorithm to relax the independence
assumption in the Cox regression model under left, right, or double truncation,
to an assumption of conditional independence. The resulting regression
coefficient estimators are consistent and asymptotically normal. We demonstrate
through extensive simulations that the proposed estimators have little bias
and, in most practical situations, have a lower mean-squared error compared to
existing estimators. We implement our approach to assess the effect of
occupation on survival in subjects with autopsy-confirmed Alzheimer's disease.
|
stat.ME
|
truncation is a statistical phenomenon that occurs in many time to event studies for example autopsyconfirmed studies of neurodegenerative diseases are subject to an inherent left and right truncation also known as double truncation when the goal is to study the effect of risk factors on survival the standard cox regression model cannot be used when the data is subject to truncation existing methods which adjust for both left and right truncation in the cox regression model require independence between the survival times and truncation times which may not be a reasonable assumption in practice we propose an expectationmaximization algorithm to relax the independence assumption in the cox regression model under left right or double truncation to an assumption of conditional independence the resulting regression coefficient estimators are consistent and asymptotically normal we demonstrate through extensive simulations that the proposed estimators have little bias and in most practical situations have a lower meansquared error compared to existing estimators we implement our approach to assess the effect of occupation on survival in subjects with autopsyconfirmed alzheimers disease
|
[['truncation', 'is', 'a', 'statistical', 'phenomenon', 'that', 'occurs', 'in', 'many', 'time', 'to', 'event', 'studies', 'for', 'example', 'autopsyconfirmed', 'studies', 'of', 'neurodegenerative', 'diseases', 'are', 'subject', 'to', 'an', 'inherent', 'left', 'and', 'right', 'truncation', 'also', 'known', 'as', 'double', 'truncation', 'when', 'the', 'goal', 'is', 'to', 'study', 'the', 'effect', 'of', 'risk', 'factors', 'on', 'survival', 'the', 'standard', 'cox', 'regression', 'model', 'can', 'not', 'be', 'used', 'when', 'the', 'data', 'is', 'subject', 'to', 'truncation', 'existing', 'methods', 'which', 'adjust', 'for', 'both', 'left', 'and', 'right', 'truncation', 'in', 'the', 'cox', 'regression', 'model', 'require', 'independence', 'between', 'the', 'survival', 'times', 'and', 'truncation', 'times', 'which', 'may', 'not', 'be', 'a', 'reasonable', 'assumption', 'in', 'practice', 'we', 'propose', 'an', 'expectationmaximization', 'algorithm', 'to', 'relax', 'the', 'independence', 'assumption', 'in', 'the', 'cox', 'regression', 'model', 'under', 'left', 'right', 'or', 'double', 'truncation', 'to', 'an', 'assumption', 'of', 'conditional', 'independence', 'the', 'resulting', 'regression', 'coefficient', 'estimators', 'are', 'consistent', 'and', 'asymptotically', 'normal', 'we', 'demonstrate', 'through', 'extensive', 'simulations', 'that', 'the', 'proposed', 'estimators', 'have', 'little', 'bias', 'and', 'in', 'most', 'practical', 'situations', 'have', 'a', 'lower', 'meansquared', 'error', 'compared', 'to', 'existing', 'estimators', 'we', 'implement', 'our', 'approach', 'to', 'assess', 'the', 'effect', 'of', 'occupation', 'on', 'survival', 'in', 'subjects', 'with', 'autopsyconfirmed', 'alzheimers', 'disease']]
|
[-0.026318403611491833, 0.01671888974320609, -0.09461405363199966, 0.12110140778856086, -0.06411919610574841, -0.16539108242573483, 0.042638205829675174, 0.42126492866447995, -0.25407913487205014, -0.24907580427825451, 0.15604989930854313, -0.2705524521374277, -0.15536394296080938, 0.16777589516581168, -0.15556638282856772, 0.06362768095319292, 0.03730672927041139, 0.04737944164779037, -0.043175791228256585, -0.31639306380280424, 0.24430342716164888, 0.09795148827883947, 0.2993553004999246, 0.0023083601901972934, 0.07626757581917835, 0.0016389470733702183, -0.0287952661487673, -0.018162907351340567, -0.12651476358504235, 0.050264191143214704, 0.25042371202260255, 0.1447162215039134, 0.35541307619639806, -0.4294864095374942, -0.20212892409946237, 0.15250216970020639, 0.15524417463490472, 0.07080301505164244, 0.012158077892714314, -0.25800022134291273, 0.07630473348179034, -0.18992729796894958, -0.08365737802215985, -0.0808073597827128, -0.0137150581260877, -0.015189966523487653, -0.3733280315835561, 0.1480179464509378, 0.04647999052224415, 0.06276020699646324, -0.01989139047185225, -0.12703734142173614, 0.0164953333871173, 0.07048813809341352, 0.158378757503815, -0.007263091636289443, 0.1398658079738795, -0.143260043071849, -0.11668946824967862, 0.3107686489554388, -0.026911564251141887, -0.26212685406499076, 0.20096608985215425, -0.1460327741556934, -0.12067625527935369, 0.08273010790348052, 0.17953783204246845, 0.09749129581132106, -0.16526689766390648, 0.062377252204543245, -0.03780076116323471, 0.13940098948377583, 0.03039892205702407, -0.022653045847213695, 0.12210914824157953, 0.18911044548531727, 0.05326861555787868, 0.06637009120812373, -0.12405276744227324, -0.09148307187216623, -0.2954683613351413, -0.07977757391270383, -0.1364389246436102, 0.01732709434590236, -0.10898443433547592, -0.21226941339605088, 0.35293279124157767, 0.2252864659837048, 0.19908287929104906, 0.0862775252240577, 0.30242117796093226, 0.11376590689976833, 0.07419700904084103, 0.045286266413916434, 0.17463378557935358, 0.12202705114497803, -0.06142692726371544, -0.21833715108722182, 0.1772100248613528, 0.023358655301022477]
|
1,803.09831
|
Multiphysics Lattice Discrete Particle Modeling (M-LDPM) for the
Simulation of Shale Fracture Permeability
|
A three-dimensional Multiphysics Lattice Discrete Particle Model (M-LDPM)
framework is formulated to investigate the fracture permeability behavior of
shale. The framework features a dual lattice system mimicking the mesostructure
of the material and simulates coupled mechanical and flow behavior. The
mechanical lattice model simulates the granular internal structure of shale and
describes heterogeneous deformation by means of discrete compatibility and
equilibrium equations. The network of flow lattice elements constitutes a dual
graph of the mechanical lattice system. A discrete formulation of mass balance
for the flow elements is formulated to model fluid flow along cracks. The
overall computational framework is implemented with a mixed explicit-implicit
integration scheme and a staggered coupling method that makes use of the dual
lattice topology enabling the seamless two-way coupling of the mechanical and
flow behaviors. The proposed model is used for the computational analysis of
shale fracture permeability behavior by simulating triaxial direct shear tests
on Marcellus shale specimens under various confining pressures. The simulated
mechanical response is calibrated against the experimental data, and the
predicted permeability values are also compared with the experimental
measurements. Furthermore, the paper presents the scaling analysis of both the
mechanical response and permeability measurements based on simulations
performed on geometrically similar specimens with increasing size. The
simulated stress-strain curves show a significant size effect in the post-peak
due to the presence of localized fractures. The scaling analysis of
permeability measurements enables prediction of permeability for large
specimens by extrapolating the numerical results of small ones.
|
physics.geo-ph cond-mat.mtrl-sci
|
a threedimensional multiphysics lattice discrete particle model mldpm framework is formulated to investigate the fracture permeability behavior of shale the framework features a dual lattice system mimicking the mesostructure of the material and simulates coupled mechanical and flow behavior the mechanical lattice model simulates the granular internal structure of shale and describes heterogeneous deformation by means of discrete compatibility and equilibrium equations the network of flow lattice elements constitutes a dual graph of the mechanical lattice system a discrete formulation of mass balance for the flow elements is formulated to model fluid flow along cracks the overall computational framework is implemented with a mixed explicitimplicit integration scheme and a staggered coupling method that makes use of the dual lattice topology enabling the seamless twoway coupling of the mechanical and flow behaviors the proposed model is used for the computational analysis of shale fracture permeability behavior by simulating triaxial direct shear tests on marcellus shale specimens under various confining pressures the simulated mechanical response is calibrated against the experimental data and the predicted permeability values are also compared with the experimental measurements furthermore the paper presents the scaling analysis of both the mechanical response and permeability measurements based on simulations performed on geometrically similar specimens with increasing size the simulated stressstrain curves show a significant size effect in the postpeak due to the presence of localized fractures the scaling analysis of permeability measurements enables prediction of permeability for large specimens by extrapolating the numerical results of small ones
|
[['a', 'threedimensional', 'multiphysics', 'lattice', 'discrete', 'particle', 'model', 'mldpm', 'framework', 'is', 'formulated', 'to', 'investigate', 'the', 'fracture', 'permeability', 'behavior', 'of', 'shale', 'the', 'framework', 'features', 'a', 'dual', 'lattice', 'system', 'mimicking', 'the', 'mesostructure', 'of', 'the', 'material', 'and', 'simulates', 'coupled', 'mechanical', 'and', 'flow', 'behavior', 'the', 'mechanical', 'lattice', 'model', 'simulates', 'the', 'granular', 'internal', 'structure', 'of', 'shale', 'and', 'describes', 'heterogeneous', 'deformation', 'by', 'means', 'of', 'discrete', 'compatibility', 'and', 'equilibrium', 'equations', 'the', 'network', 'of', 'flow', 'lattice', 'elements', 'constitutes', 'a', 'dual', 'graph', 'of', 'the', 'mechanical', 'lattice', 'system', 'a', 'discrete', 'formulation', 'of', 'mass', 'balance', 'for', 'the', 'flow', 'elements', 'is', 'formulated', 'to', 'model', 'fluid', 'flow', 'along', 'cracks', 'the', 'overall', 'computational', 'framework', 'is', 'implemented', 'with', 'a', 'mixed', 'explicitimplicit', 'integration', 'scheme', 'and', 'a', 'staggered', 'coupling', 'method', 'that', 'makes', 'use', 'of', 'the', 'dual', 'lattice', 'topology', 'enabling', 'the', 'seamless', 'twoway', 'coupling', 'of', 'the', 'mechanical', 'and', 'flow', 'behaviors', 'the', 'proposed', 'model', 'is', 'used', 'for', 'the', 'computational', 'analysis', 'of', 'shale', 'fracture', 'permeability', 'behavior', 'by', 'simulating', 'triaxial', 'direct', 'shear', 'tests', 'on', 'marcellus', 'shale', 'specimens', 'under', 'various', 'confining', 'pressures', 'the', 'simulated', 'mechanical', 'response', 'is', 'calibrated', 'against', 'the', 'experimental', 'data', 'and', 'the', 'predicted', 'permeability', 'values', 'are', 'also', 'compared', 'with', 'the', 'experimental', 'measurements', 'furthermore', 'the', 'paper', 'presents', 'the', 'scaling', 'analysis', 'of', 'both', 'the', 'mechanical', 'response', 'and', 'permeability', 'measurements', 'based', 'on', 'simulations', 'performed', 'on', 'geometrically', 'similar', 'specimens', 'with', 'increasing', 'size', 'the', 'simulated', 'stressstrain', 'curves', 'show', 'a', 'significant', 'size', 'effect', 'in', 'the', 'postpeak', 'due', 'to', 'the', 'presence', 'of', 'localized', 'fractures', 'the', 'scaling', 'analysis', 'of', 'permeability', 'measurements', 'enables', 'prediction', 'of', 'permeability', 'for', 'large', 'specimens', 'by', 'extrapolating', 'the', 'numerical', 'results', 'of', 'small', 'ones']]
|
[-0.11846936325226982, 0.13430778434825683, -0.096757739249473, -0.03571409016527705, -0.05143885884426413, -0.11367708999035138, 0.006706567478320766, 0.3544997127113364, -0.26167757731362634, -0.2846152229174002, 0.0821565997884306, -0.2632232314104411, -0.16092006876644474, 0.17745038440566493, -0.014193453720952497, 0.13678679419110001, 0.07789634376985771, -0.04162304521712467, -0.02885530354387441, -0.15780759676337353, 0.2519249684296594, 0.063585045243939, 0.3845988688649746, 0.05868904592305596, 0.10792962289429497, -0.007021892780335847, -0.01672501669537912, 0.10938557960439428, -0.1537617683313691, 0.09630649274298392, 0.18668703428976904, 0.00905593080783066, 0.21002291382112487, -0.4689280470924043, -0.26256309426389635, 0.021847002013260876, 0.06482290961529787, 0.0951647256724385, -0.031640685204609595, -0.2332608373551743, 0.04976260479694853, -0.13647842740950486, -0.13537866906906532, -0.1002311716594438, -0.023812110504567077, 0.009893062930176512, -0.28856568104266644, 0.10717706355099221, 0.0042834895572102655, 0.12157831912551727, -0.13033633620281349, -0.07633197474969187, -0.039558351990611605, 0.11041602240241231, 0.03927729347468982, -0.0381154620308217, 0.19541777250815062, -0.14540140187230322, -0.06314935176103277, 0.46960866668572027, -0.031301179354891136, -0.2129221695888886, 0.19235655517086417, -0.09211995485816075, -0.04295284393985521, 0.15017270829672433, 0.21402352827987292, 0.06118243805140378, -0.14543537762795947, 0.04150724056843153, -0.04224986446324766, 0.1738581245734803, 0.019090548814539383, -0.05952602583721916, 0.1652362878790231, 0.25316068871236386, -0.027227240519946426, 0.18205299777711356, -0.0740476288265791, -0.11476659281458516, -0.2803319604344272, -0.14823182180857028, -0.18521501703899565, 0.01997767354889841, -0.16982379201002235, -0.2034314523363009, 0.38188652534040374, 0.11758061510707607, 0.15687739284003033, 0.052533480266199736, 0.28724469066355224, 0.05592640161152732, 0.06495092714269744, 0.04820819322788346, 0.23372237611210875, 0.190335874164636, 0.11981888105184203, -0.31780138704168603, 0.08231771583157796, 0.07344929616883154]
|
1,803.09832
|
Heat Kernel analysis of Syntactic Structures
|
We consider two different data sets of syntactic parameters and we discuss
how to detect relations between parameters through a heat kernel method
developed by Belkin-Niyogi, which produces low dimensional representations of
the data, based on Laplace eigenfunctions, that preserve neighborhood
information. We analyze the different connectivity and clustering structures
that arise in the two datasets, and the regions of maximal variance in the
two-parameter space of the Belkin-Niyogi construction, which identify
preferable choices of independent variables. We compute clustering coefficients
and their variance.
|
cs.CL
|
we consider two different data sets of syntactic parameters and we discuss how to detect relations between parameters through a heat kernel method developed by belkinniyogi which produces low dimensional representations of the data based on laplace eigenfunctions that preserve neighborhood information we analyze the different connectivity and clustering structures that arise in the two datasets and the regions of maximal variance in the twoparameter space of the belkinniyogi construction which identify preferable choices of independent variables we compute clustering coefficients and their variance
|
[['we', 'consider', 'two', 'different', 'data', 'sets', 'of', 'syntactic', 'parameters', 'and', 'we', 'discuss', 'how', 'to', 'detect', 'relations', 'between', 'parameters', 'through', 'a', 'heat', 'kernel', 'method', 'developed', 'by', 'belkinniyogi', 'which', 'produces', 'low', 'dimensional', 'representations', 'of', 'the', 'data', 'based', 'on', 'laplace', 'eigenfunctions', 'that', 'preserve', 'neighborhood', 'information', 'we', 'analyze', 'the', 'different', 'connectivity', 'and', 'clustering', 'structures', 'that', 'arise', 'in', 'the', 'two', 'datasets', 'and', 'the', 'regions', 'of', 'maximal', 'variance', 'in', 'the', 'twoparameter', 'space', 'of', 'the', 'belkinniyogi', 'construction', 'which', 'identify', 'preferable', 'choices', 'of', 'independent', 'variables', 'we', 'compute', 'clustering', 'coefficients', 'and', 'their', 'variance']]
|
[-0.10718153258991461, 0.07819440529579524, -0.08304778994174629, 0.10902341146294664, -0.08822890591137565, -0.0843359173059736, 0.05759607980641105, 0.3789231846699627, -0.29857361071356914, -0.2940999481134208, 0.10690027386483895, -0.2764444808225806, -0.1631325920277116, 0.18878495313863203, -0.04478338740130023, 0.0066552618859199485, 0.0587515830085045, 0.025059946471961532, -0.11036385623056715, -0.232721622383063, 0.397400927162025, 0.016556754770756858, 0.316955104470253, -0.024123389256845523, 0.1468840399018784, -0.011071781940167634, -0.09876179333106137, 0.014851181818635158, -0.1719022450761702, 0.16278778588989887, 0.2564828495790319, 0.1668208338207212, 0.2264724413767775, -0.4122354545880382, -0.19547615539553723, 0.1549138266752224, 0.11766095577580173, 0.046623519285498245, 0.004311505130140066, -0.2507855629139557, 0.05458168977610313, -0.1184233408534854, -0.07272187718644557, -0.16260673014784982, -0.007824634031460779, 0.043248805311145035, -0.26176083019775587, 0.09540448970411246, 0.041097944150905966, 0.027811367325939057, -0.06022346034509743, -0.1244849774861572, -0.031074476519190684, 0.14440694953905556, 0.04993355449533272, -0.0772915089619346, 0.11051813171177012, -0.1096246667507441, -0.119726084888254, 0.31974934270923455, -0.05449600562896216, -0.25256979935688945, 0.20176665748685327, -0.13273665076689567, -0.1667833805038798, 0.04848871630525625, 0.2130995752380752, 0.09527220788536729, -0.16099937241978762, 0.07474738898404544, -0.02733189156051816, 0.1399937531777385, 0.07923281560765534, 0.04943530827124671, 0.12647656190050086, 0.10712162274640144, 0.05479164996820434, 0.16173140450505677, -0.12699037565702073, -0.08625376007587808, -0.27427848537520666, -0.11674158639457678, -0.18593177317198728, -0.049874282777082266, -0.1921810825652068, -0.19790527561861204, 0.4328162142745696, 0.21318495717884905, 0.28353382170586505, 0.04627558766444009, 0.2583671103617767, 0.09975320424475684, 0.07042447923080677, 0.0962263451102644, 0.1377018012742444, 0.10477479998442549, 0.019922275113214444, -0.21670939215095486, 0.03370823258556789, 0.08279051176249617]
|
1,803.09833
|
Characteristic classes via 4-dimensional gauge theory
|
We construct characteristic classes of 4-manifold bundles using
$SO(3)$-Yang-Mills theory and Seiberg-Witten theory for families.
|
math.GT math.DG
|
we construct characteristic classes of 4manifold bundles using so3yangmills theory and seibergwitten theory for families
|
[['we', 'construct', 'characteristic', 'classes', 'of', '4manifold', 'bundles', 'using', 'so3yangmills', 'theory', 'and', 'seibergwitten', 'theory', 'for', 'families']]
|
[-0.2116907919490976, 0.05305975434021093, -0.16600735259375402, 0.13082252283181464, -0.05488131567835808, -0.2212561278470925, -0.08098237850104592, 0.3561629642333303, -0.31120843599949566, -0.2935829684138298, 0.026705874096868292, -0.2530671272959028, -0.28001137104417595, 0.23119383385138853, -0.15243764274886676, -0.012551875518901008, -0.012332018464803696, 0.02341123969693269, -0.17431911313906312, -0.2508658693571176, 0.538101753020393, -0.18566019384057394, 0.19613410931612765, 0.04608609314475741, 0.15611041909349815, -0.022518332515444075, 0.046361517693315236, 0.04006038572905319, -0.21359736954660288, 0.21558124838130815, 0.3412832068778308, 0.06130575428583792, -0.005268528791410583, -0.3915902977543218, -0.2555991841613182, 0.19260656454467348, 0.0709936408592122, 0.05643710746828999, -0.011625767885042089, -0.2616965851879546, 0.11238393081086022, -0.14805956929922104, -0.24192605460328714, -0.22870840398328646, 0.028085982027862753, -0.01847642021519797, -0.1781910370503153, -0.061083498277834485, -0.03342337493917772, 0.19667925466118114, -0.11753834025668246, -0.05931607234690871, -0.046988015196153095, 0.07337534899956413, 0.04212141635694674, 0.028066030869792615, 0.10444112058861979, -0.05562508053013256, -0.20315385769520486, 0.2344462669321469, -0.15577049553394318, -0.2516911734959909, 0.04465832228639296, -0.012289944903126784, -0.3033939693123102, 0.16947214411837713, 0.10268615505525044, 0.28382873189236435, 0.020589518826454878, 0.18751309785043954, -0.1221283030297075, 0.10674824299556869, 0.14053566321464522, -0.02286049916542002, 0.23139726663274424, 0.05686582611607654, -0.055730428147528856, 0.09342943371406623, 0.0142128413343536, -0.1401295145707471, -0.4124755731650761, -0.2301094707633768, 0.026287052647343705, 0.2454427068920008, -0.09979453283657287, -0.22411681926210544, 0.4504982991410153, -0.011125670479876655, 0.13540988941011683, 0.26540854859298896, 0.11391875201037951, 0.05210893787443638, 0.02859282081148454, 0.03731092484667897, 0.10056861170700618, 0.354288660255926, -0.0915700335587774, 0.004412429141146796, -0.2010955518053379, 0.3819249430338719]
|
1,803.09834
|
Shake genus and slice genus
|
An important difference between high dimensional smooth manifolds and smooth
4-manifolds that in a 4-manifold it is not always possible to represent every
middle dimensional homology class with a smoothly embedded sphere. This is true
even among the simplest 4-manifolds: $X_0(K)$ obtained by attaching an
$0$-framed 2-handle to the 4-ball along a knot $K$ in $S^3$. The $0$-shake
genus of $K$ records the minimal genus among all smooth embedded surfaces
representing a generator of the second homology of $X_0(K)$ and is clearly
bounded above by the slice genus of $K$. We prove that slice genus is not an
invariant of $X_0(K)$, and thereby provide infinitely many examples of knots
with $0$-shake genus strictly less than slice genus. This resolves Problem 1.41
of [Kir97]. As corollaries we show that Rasmussen's $s$ invariant is not a
$0$-trace invariant and we give examples, via the satellite operation, of
bijective maps on the smooth concordance group which fix the identity but do
not preserve slice genus. These corollaries resolve some questions from
[4MKC16].
|
math.GT
|
an important difference between high dimensional smooth manifolds and smooth 4manifolds that in a 4manifold it is not always possible to represent every middle dimensional homology class with a smoothly embedded sphere this is true even among the simplest 4manifolds x_0k obtained by attaching an 0framed 2handle to the 4ball along a knot k in s3 the 0shake genus of k records the minimal genus among all smooth embedded surfaces representing a generator of the second homology of x_0k and is clearly bounded above by the slice genus of k we prove that slice genus is not an invariant of x_0k and thereby provide infinitely many examples of knots with 0shake genus strictly less than slice genus this resolves problem 141 of kir97 as corollaries we show that rasmussens s invariant is not a 0trace invariant and we give examples via the satellite operation of bijective maps on the smooth concordance group which fix the identity but do not preserve slice genus these corollaries resolve some questions from 4mkc16
|
[['an', 'important', 'difference', 'between', 'high', 'dimensional', 'smooth', 'manifolds', 'and', 'smooth', '4manifolds', 'that', 'in', 'a', '4manifold', 'it', 'is', 'not', 'always', 'possible', 'to', 'represent', 'every', 'middle', 'dimensional', 'homology', 'class', 'with', 'a', 'smoothly', 'embedded', 'sphere', 'this', 'is', 'true', 'even', 'among', 'the', 'simplest', '4manifolds', 'x_0k', 'obtained', 'by', 'attaching', 'an', '0framed', '2handle', 'to', 'the', '4ball', 'along', 'a', 'knot', 'k', 'in', 's3', 'the', '0shake', 'genus', 'of', 'k', 'records', 'the', 'minimal', 'genus', 'among', 'all', 'smooth', 'embedded', 'surfaces', 'representing', 'a', 'generator', 'of', 'the', 'second', 'homology', 'of', 'x_0k', 'and', 'is', 'clearly', 'bounded', 'above', 'by', 'the', 'slice', 'genus', 'of', 'k', 'we', 'prove', 'that', 'slice', 'genus', 'is', 'not', 'an', 'invariant', 'of', 'x_0k', 'and', 'thereby', 'provide', 'infinitely', 'many', 'examples', 'of', 'knots', 'with', '0shake', 'genus', 'strictly', 'less', 'than', 'slice', 'genus', 'this', 'resolves', 'problem', '141', 'of', 'kir97', 'as', 'corollaries', 'we', 'show', 'that', 'rasmussens', 's', 'invariant', 'is', 'not', 'a', '0trace', 'invariant', 'and', 'we', 'give', 'examples', 'via', 'the', 'satellite', 'operation', 'of', 'bijective', 'maps', 'on', 'the', 'smooth', 'concordance', 'group', 'which', 'fix', 'the', 'identity', 'but', 'do', 'not', 'preserve', 'slice', 'genus', 'these', 'corollaries', 'resolve', 'some', 'questions', 'from', '4mkc16']]
|
[-0.1937325661146385, 0.10551883194534913, -0.08831595147522278, 0.08767201220658775, -0.08424705194859171, -0.20103983970706812, -0.019529993804690643, 0.3632888374597687, -0.27323814015835524, -0.2875089306406767, 0.09973041621788618, -0.26690932960215824, -0.1433765790846019, 0.2248324433668427, -0.17223098433116474, -0.028561389497312975, 0.0575469099518181, 0.07343509910976745, -0.09383284548298927, -0.29066923249818677, 0.3802205499861928, -0.08384829624668212, 0.1398851831221998, 0.09703144174158933, 0.12272112415991275, -0.05306698015402913, 0.010811536267108048, 0.017575599413073385, -0.188858447801867, 0.10698022378302818, 0.3072385656512735, 0.044996639030581584, 0.14252474499271667, -0.35521155204367966, -0.19722322884285037, 0.18621021599287213, 0.1388872118010354, -0.008269491676291653, -0.014708303286783755, -0.24746806844956723, 0.12349926535859256, -0.09083542774195771, -0.1813763825570693, -0.06534330235339746, 0.03016702481545508, -0.046658726284246756, -0.14223156862959535, 0.0024060727677768074, 0.1138924369644598, 0.10125899547711015, 0.006628652006466256, -0.09076711613999074, -0.10378192428286266, 0.13957450455279055, 0.04340886766601534, 0.14114538066829724, 0.06404152740997891, -0.10340326068846085, -0.1111088673000684, 0.31630934839956015, -0.0577271378151855, -0.2472286043598889, 0.1612276708691785, -0.14349234711900577, -0.1867060424130219, 0.207467230025634, 0.03086958941723029, 0.17620101306834315, -0.0399225395831966, 0.1565839892171929, -0.12080934714716692, 0.16646683733371725, 0.13758077629047996, -0.061870810258796954, 0.1748977649889617, 0.04209679858590734, 0.142392873068702, 0.15733579909414927, -0.01746172095923853, -0.036636268133395745, -0.3467249875517944, -0.24135146049238426, -0.14674057218551928, 0.15028170027513427, -0.11839393826996829, -0.19683518139252731, 0.4055441524047988, 0.010697788827497154, 0.2111948028442461, 0.169617314903621, 0.2824599489749196, 0.0010286351597127337, 0.07063229659751775, 0.13210072441598827, 0.08356651799919516, 0.16216003552853434, -0.04779378132030637, -0.061740658828232674, -0.013169555893975747, 0.16372148669631634]
|
1,803.09835
|
Locality-Sensitive Hashing for Earthquake Detection: A Case Study of
Scaling Data-Driven Science
|
In this work, we report on a novel application of Locality Sensitive Hashing
(LSH) to seismic data at scale. Based on the high waveform similarity between
reoccurring earthquakes, our application identifies potential earthquakes by
searching for similar time series segments via LSH. However, a straightforward
implementation of this LSH-enabled application has difficulty scaling beyond 3
months of continuous time series data measured at a single seismic station. As
a case study of a data-driven science workflow, we illustrate how domain
knowledge can be incorporated into the workload to improve both the efficiency
and result quality. We describe several end-to-end optimizations of the
analysis pipeline from pre-processing to post-processing, which allow the
application to scale to time series data measured at multiple seismic stations.
Our optimizations enable an over 100$\times$ speedup in the end-to-end analysis
pipeline. This improved scalability enabled seismologists to perform seismic
analysis on more than ten years of continuous time series data from over ten
seismic stations, and has directly enabled the discovery of 597 new earthquakes
near the Diablo Canyon nuclear power plant in California and 6123 new
earthquakes in New Zealand.
|
cs.DB
|
in this work we report on a novel application of locality sensitive hashing lsh to seismic data at scale based on the high waveform similarity between reoccurring earthquakes our application identifies potential earthquakes by searching for similar time series segments via lsh however a straightforward implementation of this lshenabled application has difficulty scaling beyond 3 months of continuous time series data measured at a single seismic station as a case study of a datadriven science workflow we illustrate how domain knowledge can be incorporated into the workload to improve both the efficiency and result quality we describe several endtoend optimizations of the analysis pipeline from preprocessing to postprocessing which allow the application to scale to time series data measured at multiple seismic stations our optimizations enable an over 100times speedup in the endtoend analysis pipeline this improved scalability enabled seismologists to perform seismic analysis on more than ten years of continuous time series data from over ten seismic stations and has directly enabled the discovery of 597 new earthquakes near the diablo canyon nuclear power plant in california and 6123 new earthquakes in new zealand
|
[['in', 'this', 'work', 'we', 'report', 'on', 'a', 'novel', 'application', 'of', 'locality', 'sensitive', 'hashing', 'lsh', 'to', 'seismic', 'data', 'at', 'scale', 'based', 'on', 'the', 'high', 'waveform', 'similarity', 'between', 'reoccurring', 'earthquakes', 'our', 'application', 'identifies', 'potential', 'earthquakes', 'by', 'searching', 'for', 'similar', 'time', 'series', 'segments', 'via', 'lsh', 'however', 'a', 'straightforward', 'implementation', 'of', 'this', 'lshenabled', 'application', 'has', 'difficulty', 'scaling', 'beyond', '3', 'months', 'of', 'continuous', 'time', 'series', 'data', 'measured', 'at', 'a', 'single', 'seismic', 'station', 'as', 'a', 'case', 'study', 'of', 'a', 'datadriven', 'science', 'workflow', 'we', 'illustrate', 'how', 'domain', 'knowledge', 'can', 'be', 'incorporated', 'into', 'the', 'workload', 'to', 'improve', 'both', 'the', 'efficiency', 'and', 'result', 'quality', 'we', 'describe', 'several', 'endtoend', 'optimizations', 'of', 'the', 'analysis', 'pipeline', 'from', 'preprocessing', 'to', 'postprocessing', 'which', 'allow', 'the', 'application', 'to', 'scale', 'to', 'time', 'series', 'data', 'measured', 'at', 'multiple', 'seismic', 'stations', 'our', 'optimizations', 'enable', 'an', 'over', '100times', 'speedup', 'in', 'the', 'endtoend', 'analysis', 'pipeline', 'this', 'improved', 'scalability', 'enabled', 'seismologists', 'to', 'perform', 'seismic', 'analysis', 'on', 'more', 'than', 'ten', 'years', 'of', 'continuous', 'time', 'series', 'data', 'from', 'over', 'ten', 'seismic', 'stations', 'and', 'has', 'directly', 'enabled', 'the', 'discovery', 'of', '597', 'new', 'earthquakes', 'near', 'the', 'diablo', 'canyon', 'nuclear', 'power', 'plant', 'in', 'california', 'and', '6123', 'new', 'earthquakes', 'in', 'new', 'zealand']]
|
[-0.08610573299216422, 0.006300989649836814, -0.10409206496564356, 0.0426255678408143, -0.09024768598031639, -0.07742231352448138, 0.10829060267188835, 0.36297736282312804, -0.23661292321684826, -0.3690475076945916, 0.13174474876007583, -0.2642906261251761, -0.13155964483084576, 0.280305281510485, -0.07362176026696342, 0.10484699231109333, 0.09897896279250093, -0.006685823747949278, -0.06380039584044306, -0.24793269948860824, 0.22723650378098742, 0.10461263080913817, 0.3307757604907933, 0.0030601964722759005, 0.06595434856606149, -0.009912727466820042, -0.09897406074177738, -0.05107785023677626, -0.07148832444081216, 0.12588416327355947, 0.3071290896791975, 0.19394918633599464, 0.28797272018467385, -0.46416987994777376, -0.22568875782273182, 0.0769429125510095, 0.12725304215357644, 0.058385957863889226, -0.019662375655168377, -0.3036239597758105, 0.05683645402091489, -0.1985590590362544, -0.06265369342904681, -0.12303816262044806, 0.007609423730888816, 0.0017243836996211706, -0.27497226070063036, 0.041834996565362145, 0.0013800509906338294, 0.1290812681535961, -0.035843629566850804, -0.07648160187222186, 0.05010968128275228, 0.14795238810179176, 0.05022241159111943, 0.044561565699707206, 0.13525583362970195, -0.04634449266207715, -0.11789623479221444, 0.36125625071975864, -0.08181066226884989, -0.10347720877842499, 0.17805836908010347, -0.11436674319451949, -0.19836078264083856, 0.12767730333430113, 0.27817119314981614, 0.06881469803419514, -0.18288390384796152, -0.0006974084551517388, 0.04178869334441391, 0.19200581255689508, 0.1101998648751919, 0.0018953002106316917, 0.1741778798806066, 0.2749465321982025, 0.08966130958844608, 0.1408519542630052, -0.1683530410856029, -0.04441415259227808, -0.24368154381489626, -0.12222160076146152, -0.19509231913045985, -0.009830875969822697, -0.11663007250927514, -0.11534037682370288, 0.43182965940439594, 0.19519748042790536, 0.16941034860267748, 0.07113467372096363, 0.3254879369385174, 0.007221846144692209, 0.12003426389422654, 0.08583302886474653, 0.18249787697619427, 0.0172522223918429, 0.19039025585818528, -0.17107950612811035, 0.05396327996229539, 0.01374528885951337]
|
1,803.09836
|
Kauffman cellular automata on quasicrystal topology
|
In this paper we perform numerical simulations to study Kauffman cellular
automata (KCA) on quasiperiod lattices. In particular, we investigate phase
transition, magnetic entropy and propagation speed of the damage on these
lattices. Both the critical threshold parameter $p_{c}$ and the critical
exponents are estimated with good precision. In order to investigate the
increase of statistical fluctuations and the onset of chaos in the critical
region of the model, we have also defined a magnetic entropy to these systems.
It is seen that the magnetic entropy behaves in a different way when one passes
from the frozen regime ($p<p_{c}$) to the chaotic regime ($p>p_{c}$). For a
further analysis, the robustness of the propagation of failures is checked by
introducing a quenched site dilution probability $q$ on the lattices. It is
seen that the damage spreading is quite sensitive when a small fraction of the
lattice sites are disconnected. A finite-size scaling analysis is employed to
estimate the critical exponents. From these numerical estimates, we claim that
on both pure ($q=0$) and diluted ($q=0.05$) quasiperiodic lattices, the KCA
model belongs to the same universality class than on square lattices.
Furthermore, with the aim of comparing the dynamical behavior between periodic
and quasiperiodic systems, the propagation speed of the damage is also
calculated for the square lattice assuming the same conditions. It is found
that on square lattices the propagation speed of the damage obeys a power law
as $v\sim (p-p_{c})^{\alpha}$, whereas on quasiperiod lattices it follows a
logarithmic law as $v \sim \ln(p-p_{c})^\alpha$.
|
nlin.CG cond-mat.stat-mech
|
in this paper we perform numerical simulations to study kauffman cellular automata kca on quasiperiod lattices in particular we investigate phase transition magnetic entropy and propagation speed of the damage on these lattices both the critical threshold parameter p_c and the critical exponents are estimated with good precision in order to investigate the increase of statistical fluctuations and the onset of chaos in the critical region of the model we have also defined a magnetic entropy to these systems it is seen that the magnetic entropy behaves in a different way when one passes from the frozen regime pp_c to the chaotic regime pp_c for a further analysis the robustness of the propagation of failures is checked by introducing a quenched site dilution probability q on the lattices it is seen that the damage spreading is quite sensitive when a small fraction of the lattice sites are disconnected a finitesize scaling analysis is employed to estimate the critical exponents from these numerical estimates we claim that on both pure q0 and diluted q005 quasiperiodic lattices the kca model belongs to the same universality class than on square lattices furthermore with the aim of comparing the dynamical behavior between periodic and quasiperiodic systems the propagation speed of the damage is also calculated for the square lattice assuming the same conditions it is found that on square lattices the propagation speed of the damage obeys a power law as vsim pp_calpha whereas on quasiperiod lattices it follows a logarithmic law as v sim lnpp_calpha
|
[['in', 'this', 'paper', 'we', 'perform', 'numerical', 'simulations', 'to', 'study', 'kauffman', 'cellular', 'automata', 'kca', 'on', 'quasiperiod', 'lattices', 'in', 'particular', 'we', 'investigate', 'phase', 'transition', 'magnetic', 'entropy', 'and', 'propagation', 'speed', 'of', 'the', 'damage', 'on', 'these', 'lattices', 'both', 'the', 'critical', 'threshold', 'parameter', 'p_c', 'and', 'the', 'critical', 'exponents', 'are', 'estimated', 'with', 'good', 'precision', 'in', 'order', 'to', 'investigate', 'the', 'increase', 'of', 'statistical', 'fluctuations', 'and', 'the', 'onset', 'of', 'chaos', 'in', 'the', 'critical', 'region', 'of', 'the', 'model', 'we', 'have', 'also', 'defined', 'a', 'magnetic', 'entropy', 'to', 'these', 'systems', 'it', 'is', 'seen', 'that', 'the', 'magnetic', 'entropy', 'behaves', 'in', 'a', 'different', 'way', 'when', 'one', 'passes', 'from', 'the', 'frozen', 'regime', 'pp_c', 'to', 'the', 'chaotic', 'regime', 'pp_c', 'for', 'a', 'further', 'analysis', 'the', 'robustness', 'of', 'the', 'propagation', 'of', 'failures', 'is', 'checked', 'by', 'introducing', 'a', 'quenched', 'site', 'dilution', 'probability', 'q', 'on', 'the', 'lattices', 'it', 'is', 'seen', 'that', 'the', 'damage', 'spreading', 'is', 'quite', 'sensitive', 'when', 'a', 'small', 'fraction', 'of', 'the', 'lattice', 'sites', 'are', 'disconnected', 'a', 'finitesize', 'scaling', 'analysis', 'is', 'employed', 'to', 'estimate', 'the', 'critical', 'exponents', 'from', 'these', 'numerical', 'estimates', 'we', 'claim', 'that', 'on', 'both', 'pure', 'q0', 'and', 'diluted', 'q005', 'quasiperiodic', 'lattices', 'the', 'kca', 'model', 'belongs', 'to', 'the', 'same', 'universality', 'class', 'than', 'on', 'square', 'lattices', 'furthermore', 'with', 'the', 'aim', 'of', 'comparing', 'the', 'dynamical', 'behavior', 'between', 'periodic', 'and', 'quasiperiodic', 'systems', 'the', 'propagation', 'speed', 'of', 'the', 'damage', 'is', 'also', 'calculated', 'for', 'the', 'square', 'lattice', 'assuming', 'the', 'same', 'conditions', 'it', 'is', 'found', 'that', 'on', 'square', 'lattices', 'the', 'propagation', 'speed', 'of', 'the', 'damage', 'obeys', 'a', 'power', 'law', 'as', 'vsim', 'pp_calpha', 'whereas', 'on', 'quasiperiod', 'lattices', 'it', 'follows', 'a', 'logarithmic', 'law', 'as', 'v', 'sim', 'lnpp_calpha']]
|
[-0.15934085908035436, 0.18851880560887146, -0.05853515510946647, 0.07704538950251498, 0.005905563260492192, -0.1348740240230775, 0.09137669433084555, 0.35359642883280223, -0.2593026757689126, -0.2223531090089655, 0.11627525486375569, -0.30821678625142956, -0.15315553505487, 0.19417582058448749, 0.009611359512107072, 0.07138409252731077, 0.009929158564948713, 0.06311163341862161, -0.05853548928502438, -0.23545909220031108, 0.28053051632750464, 0.06904719275586965, 0.30332917701658685, 0.04980462190253757, 0.029472734846444016, -0.02381290836693592, 0.04854814864528631, 0.05194763235194257, -0.1833722873215225, 0.045276160844184184, 0.15413695068265046, 0.028676378823083687, 0.22547756935129443, -0.367725521056767, -0.24564499777543497, 0.1165143052540555, 0.13373884609638598, 0.10038988719166941, -0.0006406709116305707, -0.2437801602068376, 0.10006324683566649, -0.1487763791184229, -0.18098235321062875, -0.049390356235924256, 0.03375881822428191, 0.05431000229595865, -0.25876865793677817, 0.10844939931395864, 0.07791422638258089, 0.09027023239334275, -0.03820330953042221, -0.06512379270219001, -0.026059963800486207, 0.11420517655096044, 0.03680237270676602, 0.04750218758842044, 0.11877043854938932, -0.13032754051899276, -0.09661462058567528, 0.39746536418466444, -0.04318408515842222, -0.142102212031946, 0.19922335996352375, -0.19639025326377813, -0.1064396755354681, 0.13598706842078473, 0.17405564782497693, 0.05238579922706594, -0.08080037756428875, 0.057339159827670044, -0.0265160748121669, 0.19450783208045308, 0.05756805912707465, 0.0030339368316064396, 0.17838181961836466, 0.16983672615653092, 0.05440391085566915, 0.17260264415652996, -0.09333198965736571, -0.1345607486504867, -0.290346901798359, -0.10806410740986166, -0.20982639990414093, 0.06666995297105661, -0.1230226237020978, -0.17991942865025984, 0.37207465048460475, 0.16910828019765367, 0.19268236065051522, 0.06424386764551143, 0.21436689012725071, 0.1457205806194008, 0.04720852217715548, 0.0771594075962946, 0.2354445751077574, 0.1356319999242815, 0.10050983623887626, -0.24137598747971006, 0.06204992923212339, 0.07951713138319323]
|
1,803.09837
|
Analyte-localization device for point-of-use processing of
sub-millimetre areas on surfaces
|
We present a portable, simple-to-operate, point-of-use analyte surface
localization device. We take advantage of a set of hydrodynamic design features
and components that achieve passive analyte localization by means of a single
vacuum input. The vacuum source can be supplied by mechanical or
battery-operated vacuum sources that are portable and allow point-of-use
operation in the absence of electricity. We discuss the governing hydrodynamic
principle and design parameters in detail. In a case study, we demonstrate the
applicability of our technology to successfully localize a solution of
rhodamine on a polydimethylsiloxane (PDMS) substrate and produce
sub-millimetre-sized spots via application of a mild vacuum pressure of less
than 10 kPa. In addition, we demonstrate local staining of breast cancer cell
blocks and on human breast cancer tissue sections.
|
physics.ins-det q-bio.TO
|
we present a portable simpletooperate pointofuse analyte surface localization device we take advantage of a set of hydrodynamic design features and components that achieve passive analyte localization by means of a single vacuum input the vacuum source can be supplied by mechanical or batteryoperated vacuum sources that are portable and allow pointofuse operation in the absence of electricity we discuss the governing hydrodynamic principle and design parameters in detail in a case study we demonstrate the applicability of our technology to successfully localize a solution of rhodamine on a polydimethylsiloxane pdms substrate and produce submillimetresized spots via application of a mild vacuum pressure of less than 10 kpa in addition we demonstrate local staining of breast cancer cell blocks and on human breast cancer tissue sections
|
[['we', 'present', 'a', 'portable', 'simpletooperate', 'pointofuse', 'analyte', 'surface', 'localization', 'device', 'we', 'take', 'advantage', 'of', 'a', 'set', 'of', 'hydrodynamic', 'design', 'features', 'and', 'components', 'that', 'achieve', 'passive', 'analyte', 'localization', 'by', 'means', 'of', 'a', 'single', 'vacuum', 'input', 'the', 'vacuum', 'source', 'can', 'be', 'supplied', 'by', 'mechanical', 'or', 'batteryoperated', 'vacuum', 'sources', 'that', 'are', 'portable', 'and', 'allow', 'pointofuse', 'operation', 'in', 'the', 'absence', 'of', 'electricity', 'we', 'discuss', 'the', 'governing', 'hydrodynamic', 'principle', 'and', 'design', 'parameters', 'in', 'detail', 'in', 'a', 'case', 'study', 'we', 'demonstrate', 'the', 'applicability', 'of', 'our', 'technology', 'to', 'successfully', 'localize', 'a', 'solution', 'of', 'rhodamine', 'on', 'a', 'polydimethylsiloxane', 'pdms', 'substrate', 'and', 'produce', 'submillimetresized', 'spots', 'via', 'application', 'of', 'a', 'mild', 'vacuum', 'pressure', 'of', 'less', 'than', '10', 'kpa', 'in', 'addition', 'we', 'demonstrate', 'local', 'staining', 'of', 'breast', 'cancer', 'cell', 'blocks', 'and', 'on', 'human', 'breast', 'cancer', 'tissue', 'sections']]
|
[-0.09004450744818783, 0.08950174554634178, -0.040722549667642, -0.007081621867274085, -0.02123529021628201, -0.14740223198332975, 0.04394658702808703, 0.3997392489409615, -0.19184692682427984, -0.28546279915439476, 0.09495177515406883, -0.2516840842924261, -0.16766971091537045, 0.2318135077836022, -0.10128706560710506, 0.03526347602206853, 0.07454577432720051, -0.02467244321521702, 0.019284789503041293, -0.201276863654775, 0.2615176529939016, 0.03831454035976241, 0.33616273668444446, 0.07139950998938613, 0.14218424359757093, -0.035805944541108706, 0.02136933572229839, 0.014300498341570699, -0.09541054929086973, 0.1336677927982002, 0.27141420711526615, 0.10535700701462526, 0.2715210452480542, -0.5066103897237729, -0.23400973765209557, 0.06605279142686707, 0.10420908520163427, 0.12265230885015861, -0.08589620388773901, -0.2643681023656691, 0.11434343162897764, -0.17622037439967594, -0.11730413779526228, -0.08620634549597819, -0.042602518828766, 0.012069364298029893, -0.2594179721481557, 0.057095412870929126, -0.008239743224675617, 0.081486425809412, -0.10098749581318829, -0.07668262557126582, -0.006168254211755289, 0.13479952916555527, 0.003438530178109725, -0.026801748886599294, 0.28493857049127863, -0.15013461571652442, -0.06367883360907135, 0.36090244644231373, -0.053220190326218504, -0.18980847877795778, 0.18503249035547337, -0.1126845541720902, -0.025529030518936773, 0.1602039025653334, 0.19513176929115528, 0.12042961243235867, -0.19060836281747587, 0.024965640361657396, 0.024983832146972418, 0.22765100099927477, 0.12917551128081076, 0.009467551405842026, 0.19314803222134228, 0.2294961775412723, 0.013892868003700466, 0.17967681145150452, -0.15011373639947945, 0.02128252403570279, -0.2874125649264428, -0.21753578145064473, -0.14323566631473142, 0.057747334887784336, -0.08345661926561602, -0.16818815256391967, 0.39858870693827947, 0.13755811945415072, 0.13994254944789705, 0.01944570798115174, 0.30889276188287523, -0.005039777302426368, 0.09567752663767146, -0.022472119274278803, 0.2389245460132858, 0.07438493093040081, 0.10459864572922309, -0.24185462884469738, 0.048289542135241774, 0.02278823782304948]
|
1,803.09838
|
The exp-normal distribution is infinitely divisible
|
Let $Z$ be a standard normal random variable (r.v.). It is shown that the
distribution of the r.v. $\ln|Z|$ is infinitely divisible; equivalently, the
standard normal distribution considered as the distribution on the
multiplicative group over $\mathbb{R}\setminus\{0\}$ is infinitely divisible.
|
math.PR
|
let z be a standard normal random variable rv it is shown that the distribution of the rv lnz is infinitely divisible equivalently the standard normal distribution considered as the distribution on the multiplicative group over mathbbrsetminus0 is infinitely divisible
|
[['let', 'z', 'be', 'a', 'standard', 'normal', 'random', 'variable', 'rv', 'it', 'is', 'shown', 'that', 'the', 'distribution', 'of', 'the', 'rv', 'lnz', 'is', 'infinitely', 'divisible', 'equivalently', 'the', 'standard', 'normal', 'distribution', 'considered', 'as', 'the', 'distribution', 'on', 'the', 'multiplicative', 'group', 'over', 'mathbbrsetminus0', 'is', 'infinitely', 'divisible']]
|
[-0.10461836205258106, 0.21023257735830087, -0.15362359917698762, 0.0660703884742151, -0.059714354670200594, -0.1584881954253293, -0.010328604003939873, 0.3637774028839209, -0.3301444330658668, -0.17612336891201827, 0.06742409539695543, -0.2801090859067746, -0.05739640310788766, 0.1863571726358854, -0.09896020230670007, 0.025195900828410417, -0.023900996583203476, 0.08649602092993565, 0.0006027204545740134, -0.3231597571896437, 0.27118163684812874, -0.061526648150995754, 0.2312107005228217, -0.11168292108982897, 0.12222603899546158, 0.028022565103571814, -0.07692078286065505, -0.017746283224998757, -0.046138329247276906, 0.018967376950268563, 0.21336638115537473, 0.02569775075580065, 0.27473631840294754, -0.2440865000960632, -0.24007374960451555, 0.2653044700288238, 0.17030419502407312, -0.11522207413919461, 0.0101235892999774, -0.24176057757666478, 0.16808090885528004, -0.20477232198493603, -0.1939463205396747, -0.015284066542218894, 0.10207719052843271, 0.10251270554577693, -0.35556105266396815, 0.07960609267823972, 0.11037953642125313, 0.10042563945246048, 0.034581392812423215, -0.18436554826509494, -0.039808051636776864, 0.06512887469039132, 0.06380417625992917, 0.06582862493367149, 0.0989462842923016, -0.07395465390231365, -0.06367215877160048, 0.3763286513395799, -0.13303403033373448, -0.2583070562627071, 0.1224143473097147, -0.21853944308196122, -0.0929354809415646, 0.13943292468022078, 0.1119607329273071, 0.09883010373092614, -0.12523776058776256, 0.2089218678048406, -0.15776539531846842, 0.17342614224896982, 0.06611387338489294, -0.06327059954548112, 0.15971054065112883, 0.06695191645457481, 0.11767596639215182, 0.05981258892466147, -0.0999491254094606, -0.09168156198202035, -0.33548989366644466, -0.14458778213996154, -0.22734466538979456, 0.1922774019006353, -0.13607496961664695, -0.22806386960273345, 0.3455444587728916, 0.04879064929599945, 0.1634941118506667, 0.1193212537238231, 0.23729314196568269, 0.19556068432911372, 0.05910872541463528, 0.10385729968309021, 0.06654250968056612, 0.20701747010342586, -0.070213996211234, -0.10860404112519553, 0.17902571711545953, 0.017196223115882814]
|
1,803.09839
|
Long range fading free phase-sensitive reflectometry based on
multi-frequency NLFM pulse
|
A long range phase-sensitive optical time domain reflectometer (phi-OTDR)
with a multi-frequency non-linear frequency modulation (NLFM) optical pulse is
proposed in this Letter. To boost the pulse energy while suppressing the
optical nonlinear effects, the distortion of the amplified pulse is rectified,
and a three-tone pulse is used. Combining with the NLFM technic which provides
42.7 dB side lobe suppression ration (SLSR), these two approaches guarantee
that a sensing distance of 80 km is achieved in the experiment with 2.5 m
spatial resolution, 49.6 dB dynamic range, and 45 dB phase signal-to-noise
ratio (SNR). To the best of our knowledge, this is the first time that a
phase-demodulated phi-OTDR over such a long sensing range has been reported
with un-pumped sensing fiber.
|
physics.ins-det
|
a long range phasesensitive optical time domain reflectometer phiotdr with a multifrequency nonlinear frequency modulation nlfm optical pulse is proposed in this letter to boost the pulse energy while suppressing the optical nonlinear effects the distortion of the amplified pulse is rectified and a threetone pulse is used combining with the nlfm technic which provides 427 db side lobe suppression ration slsr these two approaches guarantee that a sensing distance of 80 km is achieved in the experiment with 25 m spatial resolution 496 db dynamic range and 45 db phase signaltonoise ratio snr to the best of our knowledge this is the first time that a phasedemodulated phiotdr over such a long sensing range has been reported with unpumped sensing fiber
|
[['a', 'long', 'range', 'phasesensitive', 'optical', 'time', 'domain', 'reflectometer', 'phiotdr', 'with', 'a', 'multifrequency', 'nonlinear', 'frequency', 'modulation', 'nlfm', 'optical', 'pulse', 'is', 'proposed', 'in', 'this', 'letter', 'to', 'boost', 'the', 'pulse', 'energy', 'while', 'suppressing', 'the', 'optical', 'nonlinear', 'effects', 'the', 'distortion', 'of', 'the', 'amplified', 'pulse', 'is', 'rectified', 'and', 'a', 'threetone', 'pulse', 'is', 'used', 'combining', 'with', 'the', 'nlfm', 'technic', 'which', 'provides', '427', 'db', 'side', 'lobe', 'suppression', 'ration', 'slsr', 'these', 'two', 'approaches', 'guarantee', 'that', 'a', 'sensing', 'distance', 'of', '80', 'km', 'is', 'achieved', 'in', 'the', 'experiment', 'with', '25', 'm', 'spatial', 'resolution', '496', 'db', 'dynamic', 'range', 'and', '45', 'db', 'phase', 'signaltonoise', 'ratio', 'snr', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'that', 'a', 'phasedemodulated', 'phiotdr', 'over', 'such', 'a', 'long', 'sensing', 'range', 'has', 'been', 'reported', 'with', 'unpumped', 'sensing', 'fiber']]
|
[-0.15051284087239764, 0.0922019385965541, -0.04439995393234616, -0.03714337118920715, -0.0568089748150669, -0.13991093205598493, 0.05195638003545658, 0.4737457211672639, -0.24913399160529176, -0.31816911133937537, 0.1152548787581812, -0.22020550134281316, -0.09213165717665106, 0.2231045031658141, -0.0478366925381124, 0.06780992491791646, 0.040319873959136505, -0.014224530329617362, -0.05630075624406648, -0.16872898446163162, 0.16067735470132902, 0.12762448146628838, 0.3214766011107713, 0.029168193057800332, 0.17116159513049448, -0.004171213024528697, -0.004603553800067554, -0.042349415773545236, -0.08740355462129325, 0.05390076347781966, 0.2759100989438593, 0.053675907826982436, 0.2553813079682489, -0.3283732369086162, -0.2853512121131644, 0.08550614492269233, 0.13573694764442432, 0.08871909258984184, -0.03279649757411486, -0.28015044194180516, 0.09870803885472318, -0.1690401102260997, -0.06799122602290784, 0.031763027670240265, 0.011528508109040558, 0.040418710015849985, -0.2901229674384619, 0.08554476455125647, 0.04726434149391328, 0.05585310201277025, -0.046557761299967144, -0.10387902042518059, 0.06495215956626149, 0.061357760631168885, -0.038660069215499485, 0.09851382092650358, 0.12556833098060452, -0.08684991550981067, -0.08326733887661249, 0.34514349489860857, -0.11506031395401806, -0.08048751984218445, 0.13722380473239656, -0.16242304415403244, 0.015570674123591744, 0.2233885787970697, 0.14015687723488857, 0.07087935003607224, -0.11686405949973656, -0.005886524753683868, 0.022471557937872907, 0.30735555194939174, 0.18068442409858107, 0.12725577296223492, 0.15725940363869692, 0.22803058682378227, 0.0464708125917241, 0.11180408274134, -0.2290878014425592, -0.002782075712457299, -0.2025895002608498, -0.05811602948233485, -0.1645456057265013, 0.06101170443192435, -0.106426624495604, -0.06010108653766413, 0.42450581381563096, 0.11670213669422083, 0.16407222889053324, 0.04350740008618838, 0.36695601960721735, 0.1369623820928003, 0.06885066547935519, 0.03650400477539127, 0.3179431375853407, 0.1613184277007046, 0.17484484192876457, -0.23137610614066945, -0.01861439930992977, -0.040703361652170617]
|
1,803.0984
|
Empirical Analysis of Foundational Distinctions in Linked Open Data
|
The Web and its Semantic extension (i.e. Linked Open Data) contain open
global-scale knowledge and make it available to potentially intelligent
machines that want to benefit from it. Nevertheless, most of Linked Open Data
lack ontological distinctions and have sparse axiomatisation. For example,
distinctions such as whether an entity is inherently a class or an individual,
or whether it is a physical object or not, are hardly expressed in the data,
although they have been largely studied and formalised by foundational
ontologies (e.g. DOLCE, SUMO). These distinctions belong to common sense too,
which is relevant for many artificial intelligence tasks such as natural
language understanding, scene recognition, and the like. There is a gap between
foundational ontologies, that often formalise or are inspired by pre-existing
philosophical theories and are developed with a top-down approach, and Linked
Open Data that mostly derive from existing databases or crowd-based effort
(e.g. DBpedia, Wikidata). We investigate whether machines can learn
foundational distinctions over Linked Open Data entities, and if they match
common sense. We want to answer questions such as "does the DBpedia entity for
dog refer to a class or to an instance?". We report on a set of experiments
based on machine learning and crowdsourcing that show promising results.
|
cs.AI cs.CL
|
the web and its semantic extension ie linked open data contain open globalscale knowledge and make it available to potentially intelligent machines that want to benefit from it nevertheless most of linked open data lack ontological distinctions and have sparse axiomatisation for example distinctions such as whether an entity is inherently a class or an individual or whether it is a physical object or not are hardly expressed in the data although they have been largely studied and formalised by foundational ontologies eg dolce sumo these distinctions belong to common sense too which is relevant for many artificial intelligence tasks such as natural language understanding scene recognition and the like there is a gap between foundational ontologies that often formalise or are inspired by preexisting philosophical theories and are developed with a topdown approach and linked open data that mostly derive from existing databases or crowdbased effort eg dbpedia wikidata we investigate whether machines can learn foundational distinctions over linked open data entities and if they match common sense we want to answer questions such as does the dbpedia entity for dog refer to a class or to an instance we report on a set of experiments based on machine learning and crowdsourcing that show promising results
|
[['the', 'web', 'and', 'its', 'semantic', 'extension', 'ie', 'linked', 'open', 'data', 'contain', 'open', 'globalscale', 'knowledge', 'and', 'make', 'it', 'available', 'to', 'potentially', 'intelligent', 'machines', 'that', 'want', 'to', 'benefit', 'from', 'it', 'nevertheless', 'most', 'of', 'linked', 'open', 'data', 'lack', 'ontological', 'distinctions', 'and', 'have', 'sparse', 'axiomatisation', 'for', 'example', 'distinctions', 'such', 'as', 'whether', 'an', 'entity', 'is', 'inherently', 'a', 'class', 'or', 'an', 'individual', 'or', 'whether', 'it', 'is', 'a', 'physical', 'object', 'or', 'not', 'are', 'hardly', 'expressed', 'in', 'the', 'data', 'although', 'they', 'have', 'been', 'largely', 'studied', 'and', 'formalised', 'by', 'foundational', 'ontologies', 'eg', 'dolce', 'sumo', 'these', 'distinctions', 'belong', 'to', 'common', 'sense', 'too', 'which', 'is', 'relevant', 'for', 'many', 'artificial', 'intelligence', 'tasks', 'such', 'as', 'natural', 'language', 'understanding', 'scene', 'recognition', 'and', 'the', 'like', 'there', 'is', 'a', 'gap', 'between', 'foundational', 'ontologies', 'that', 'often', 'formalise', 'or', 'are', 'inspired', 'by', 'preexisting', 'philosophical', 'theories', 'and', 'are', 'developed', 'with', 'a', 'topdown', 'approach', 'and', 'linked', 'open', 'data', 'that', 'mostly', 'derive', 'from', 'existing', 'databases', 'or', 'crowdbased', 'effort', 'eg', 'dbpedia', 'wikidata', 'we', 'investigate', 'whether', 'machines', 'can', 'learn', 'foundational', 'distinctions', 'over', 'linked', 'open', 'data', 'entities', 'and', 'if', 'they', 'match', 'common', 'sense', 'we', 'want', 'to', 'answer', 'questions', 'such', 'as', 'does', 'the', 'dbpedia', 'entity', 'for', 'dog', 'refer', 'to', 'a', 'class', 'or', 'to', 'an', 'instance', 'we', 'report', 'on', 'a', 'set', 'of', 'experiments', 'based', 'on', 'machine', 'learning', 'and', 'crowdsourcing', 'that', 'show', 'promising', 'results']]
|
[-0.039777231439813106, 0.05166842010802115, -0.05330357509035311, 0.1298694647457743, -0.18678588256383863, -0.18226643841362733, 0.06510021345766379, 0.4261114535232385, -0.30613484253132817, -0.3704329439515365, 0.1367250023064415, -0.30095657469999443, -0.15130187337768178, 0.19101692364857067, -0.12880134057525797, 0.034815218914041504, 0.10440806316094842, 0.08762813044558977, 0.026527717346235533, -0.23869190883827238, 0.35661528389316033, -0.004826417874436879, 0.2982869669941258, 0.060967220535618816, 0.08056925118288952, -0.04701544786128553, -0.07646967258848754, 0.029211338989072196, -0.062491614190025864, 0.16906781695279235, 0.38798750766917417, 0.27558830920224425, 0.30965040245763775, -0.44446564734360017, -0.19550479621657932, 0.09332197816403592, 0.14801319432149615, 0.07578314349206011, -0.03392140757503969, -0.3225376222750559, 0.07742241199200316, -0.153236730289668, -0.03667828400848784, -0.13729196322343992, 0.05196547731847147, -0.023703331688749673, -0.19185422815254255, -0.0030063996327690024, 0.11344355439029383, 0.110077090366802, -0.03512782450587655, -0.09244473375380602, 0.03220371335884331, 0.180059884213685, 0.02982253554195276, 0.0671656891334676, 0.13347420303807886, -0.1747459760160694, -0.19226001794135045, 0.4241258487834231, 0.01760595515685309, -0.21843451645747186, 0.2788133326758167, -0.01741075639023585, -0.18394178163557165, 0.010636481724157569, 0.1499915644099063, 0.06944513035564714, -0.17236882369461412, 0.04868675189307589, -0.08387458619351189, 0.2082184008339528, 0.08181791827824993, 0.05159742576137617, 0.26906790366567274, 0.17526514800197945, -0.010895349114856588, 0.06348016694219612, 0.0031556639969933797, -0.0921323183318825, -0.21625627094996724, -0.1318089070905378, -0.1659159300767857, 0.048062679158809934, -0.009315472411636853, -0.2027273106033456, 0.28202646726445446, 0.2326462003942309, 0.17378194065053681, 0.009614784293583086, 0.27091505530555754, -0.0025748360529063937, 0.12494963883075881, 0.11339818756939654, 0.14293050688999628, 0.019676588995355196, 0.1151834034472299, -0.09517775245341539, 0.13109280988529037, 0.003283620246231628]
|
1,803.09841
|
Angular inflation in multi-field ${\alpha}$-attractors
|
We explore the dynamics of multi-field models of inflation in which the
field-space metric is a hyperbolic manifold of constant curvature. Such models
are known as $\alpha$-attractors and their single-field regimes have been
extensively studied in the context of inflation and supergravity. We find a
variety of multi-field inflationary trajectories in different regions of
parameter space, which is spanned by the mass parameters and the hyperbolic
curvature. Amongst these is a novel dynamical attractor along the boundary of
the Poincare disc which we dub "angular inflation". We calculate the evolution
of adiabatic and isocurvature fluctuations during this regime and show that,
while isocurvature modes decay during this phase, the duration of the angular
inflation period can shift the single-field predictions of $\alpha$-attractors.
For highly curved field-space manifolds, this can lead to predictions that lie
outside the current observational bounds.
|
hep-th astro-ph.CO
|
we explore the dynamics of multifield models of inflation in which the fieldspace metric is a hyperbolic manifold of constant curvature such models are known as alphaattractors and their singlefield regimes have been extensively studied in the context of inflation and supergravity we find a variety of multifield inflationary trajectories in different regions of parameter space which is spanned by the mass parameters and the hyperbolic curvature amongst these is a novel dynamical attractor along the boundary of the poincare disc which we dub angular inflation we calculate the evolution of adiabatic and isocurvature fluctuations during this regime and show that while isocurvature modes decay during this phase the duration of the angular inflation period can shift the singlefield predictions of alphaattractors for highly curved fieldspace manifolds this can lead to predictions that lie outside the current observational bounds
|
[['we', 'explore', 'the', 'dynamics', 'of', 'multifield', 'models', 'of', 'inflation', 'in', 'which', 'the', 'fieldspace', 'metric', 'is', 'a', 'hyperbolic', 'manifold', 'of', 'constant', 'curvature', 'such', 'models', 'are', 'known', 'as', 'alphaattractors', 'and', 'their', 'singlefield', 'regimes', 'have', 'been', 'extensively', 'studied', 'in', 'the', 'context', 'of', 'inflation', 'and', 'supergravity', 'we', 'find', 'a', 'variety', 'of', 'multifield', 'inflationary', 'trajectories', 'in', 'different', 'regions', 'of', 'parameter', 'space', 'which', 'is', 'spanned', 'by', 'the', 'mass', 'parameters', 'and', 'the', 'hyperbolic', 'curvature', 'amongst', 'these', 'is', 'a', 'novel', 'dynamical', 'attractor', 'along', 'the', 'boundary', 'of', 'the', 'poincare', 'disc', 'which', 'we', 'dub', 'angular', 'inflation', 'we', 'calculate', 'the', 'evolution', 'of', 'adiabatic', 'and', 'isocurvature', 'fluctuations', 'during', 'this', 'regime', 'and', 'show', 'that', 'while', 'isocurvature', 'modes', 'decay', 'during', 'this', 'phase', 'the', 'duration', 'of', 'the', 'angular', 'inflation', 'period', 'can', 'shift', 'the', 'singlefield', 'predictions', 'of', 'alphaattractors', 'for', 'highly', 'curved', 'fieldspace', 'manifolds', 'this', 'can', 'lead', 'to', 'predictions', 'that', 'lie', 'outside', 'the', 'current', 'observational', 'bounds']]
|
[-0.18021836020588447, 0.21853892522421833, -0.12285147798951153, 0.11921731406645246, -0.10394616264233486, -0.11418456899876565, -0.05714386537094875, 0.32627871575959616, -0.22412802345997138, -0.2731063278968171, 0.09016359042922344, -0.1967454459183186, -0.15887322249360009, 0.1738582795817512, -0.06830079859899853, 0.0508831889174289, 0.041982301396967694, 0.011096518580540478, -0.05169816103700227, -0.2466478165667906, 0.36785722939337756, 0.060541382076205325, 0.21156780660636523, -0.01232602171559664, 0.07077499162137722, -0.11318721918040793, 0.005988621714704154, -0.002594718445141016, -0.21239128246580555, 0.0705482672176344, 0.18133468712034523, 0.11392202264991114, 0.21002605667659383, -0.3954888525010227, -0.2878691445518513, 0.18518218492650218, 0.1548237440631919, 0.13341901082086557, -0.014714758179867438, -0.282925496289922, 0.009935521381645858, -0.14426689037781798, -0.11265405161279461, -0.11010069310289922, 0.028904564876323768, -0.053525399172547936, -0.2637066625966523, 0.11593821696206766, 0.021698881244486226, -0.009173638864065246, -0.06581136027163417, -0.023573438271799748, -0.10103787877596915, 0.03414508503721022, 0.1274902366935912, 0.008648003418025354, 0.1536749581498154, -0.13732955697756394, -0.08477562360746933, 0.37152501963507784, -0.13797783365443, -0.16412130988491097, 0.11555710509620445, -0.17157053194015467, -0.16729912570536995, 0.07837209635139476, 0.1495488480792093, 0.12830287590287895, -0.08980755728381358, 0.18283797432492627, 0.05830616046584097, 0.10356206960495387, 0.09504684143559002, 0.042031081286996015, 0.3087693228781652, 0.11961189763312288, 0.03891414892985385, 0.11031770496796682, -0.057043898065085356, -0.1546776242513987, -0.36624487734687844, -0.09171331000494228, -0.12810360374290952, 0.053844468068438685, -0.1778244705825312, -0.19951536747536508, 0.4698738728301506, 0.11067035175833127, 0.23239174245843303, 0.09291667581566027, 0.2612467023322908, 0.08370597145634054, 0.022818188030266858, 0.07425551825678713, 0.3546475382662452, 0.11465886480798074, 0.10856927439014313, -0.22419620560910955, -0.02212780591422062, 0.047743527262250514]
|
1,803.09842
|
Entanglement spectrum of mixed states
|
Entanglement plays an important role in our ability to understand, simulate,
and harness quantum many-body phenomena. In this work, we investigate the
entanglement spectrum for open one-dimensional systems, and propose a natural
quantifier for how much a 1D quantum state is entangled while being subject to
decoherence. We demonstrate our method using a simple case of single-particle
evolution and find that the open system entanglement spectrum is composed of
generalized concurrence values, as well as quantifiers of the state's purity.
Our proposed entanglement spectrum can be directly obtained using a correct
scaling of a matrix product state decomposition of the system's density matrix.
Our method thus offers new observables that are easily acquired in the study of
interacting 1D systems, and sheds light on the approximations employed in
matrix product state simulations of open system dynamics.
|
quant-ph cond-mat.mes-hall
|
entanglement plays an important role in our ability to understand simulate and harness quantum manybody phenomena in this work we investigate the entanglement spectrum for open onedimensional systems and propose a natural quantifier for how much a 1d quantum state is entangled while being subject to decoherence we demonstrate our method using a simple case of singleparticle evolution and find that the open system entanglement spectrum is composed of generalized concurrence values as well as quantifiers of the states purity our proposed entanglement spectrum can be directly obtained using a correct scaling of a matrix product state decomposition of the systems density matrix our method thus offers new observables that are easily acquired in the study of interacting 1d systems and sheds light on the approximations employed in matrix product state simulations of open system dynamics
|
[['entanglement', 'plays', 'an', 'important', 'role', 'in', 'our', 'ability', 'to', 'understand', 'simulate', 'and', 'harness', 'quantum', 'manybody', 'phenomena', 'in', 'this', 'work', 'we', 'investigate', 'the', 'entanglement', 'spectrum', 'for', 'open', 'onedimensional', 'systems', 'and', 'propose', 'a', 'natural', 'quantifier', 'for', 'how', 'much', 'a', '1d', 'quantum', 'state', 'is', 'entangled', 'while', 'being', 'subject', 'to', 'decoherence', 'we', 'demonstrate', 'our', 'method', 'using', 'a', 'simple', 'case', 'of', 'singleparticle', 'evolution', 'and', 'find', 'that', 'the', 'open', 'system', 'entanglement', 'spectrum', 'is', 'composed', 'of', 'generalized', 'concurrence', 'values', 'as', 'well', 'as', 'quantifiers', 'of', 'the', 'states', 'purity', 'our', 'proposed', 'entanglement', 'spectrum', 'can', 'be', 'directly', 'obtained', 'using', 'a', 'correct', 'scaling', 'of', 'a', 'matrix', 'product', 'state', 'decomposition', 'of', 'the', 'systems', 'density', 'matrix', 'our', 'method', 'thus', 'offers', 'new', 'observables', 'that', 'are', 'easily', 'acquired', 'in', 'the', 'study', 'of', 'interacting', '1d', 'systems', 'and', 'sheds', 'light', 'on', 'the', 'approximations', 'employed', 'in', 'matrix', 'product', 'state', 'simulations', 'of', 'open', 'system', 'dynamics']]
|
[-0.10365899311556645, 0.13684477466460307, -0.12551880618625813, 0.06957035732322016, 0.02573120770873228, -0.15633265952826203, 0.023887701479800266, 0.3304659732590046, -0.25837945272831025, -0.2669540439143448, 0.07619440488804899, -0.2693037349689642, -0.15960190324660609, 0.21457765784169383, -0.011382296359549989, 0.1073280256062871, 0.1023738955572138, 0.024243292530574015, -0.058943052646046615, -0.20942451939096346, 0.34319019037545384, 0.052191797740627356, 0.29204507355633025, 0.074926573312362, 0.07342226540341097, 0.01835204557488289, 0.033381371888561474, 0.0035440864979618173, -0.09299693083074304, 0.12684185428652733, 0.2495225875506602, 0.13604064781205072, 0.22989935615538237, -0.41269723813542547, -0.25578627603895526, 0.08225796396821833, 0.16710669907864512, 0.15557406208416283, -0.037424452658502985, -0.3089505740944707, -0.008597441987470067, -0.2001358695235788, -0.1569312026258558, -0.15540091092664035, 0.005077448901240988, -0.049130255691553056, -0.24563436256379217, 0.10781088342157412, 0.03454838191100862, 0.024553184281103313, -0.02452839373076773, -0.05658342453021118, 0.027519541804555476, 0.15055534316557254, -0.07429173911634065, -0.013170799721539131, 0.13233939769184766, -0.10887897916665465, -0.13285064706167973, 0.37961623857400434, -0.06442857429261922, -0.21237809530815438, 0.19419890144833035, -0.1070030502810636, -0.11348210993010606, 0.05281336583635386, 0.16236099828144207, 0.11015846258412827, -0.1408860533950193, 0.07447326021536034, -0.05102735232674818, 0.20595571290173478, -0.007009241247193559, 0.12786518633776509, 0.2093567140006652, 0.15950461471391678, 0.042094498229048705, 0.22628911792708095, -0.017789522471824002, -0.1526310184426085, -0.24896093392196825, -0.20600460111574434, -0.23242701906436944, 0.08752394365386434, -0.03636287691658842, -0.1504929535628488, 0.44653884294744145, 0.1716549395419219, 0.17264365560806574, 0.020739954766159988, 0.2728715487618876, 0.1274750217271503, 0.03919232762692606, 0.053940066266531014, 0.21124751019113533, 0.17507838918861715, 0.06919011812629726, -0.2817141509080744, 0.04666903601644341, 0.03852752266581828]
|
1,803.09843
|
Diffractive optics approach towards subwavelength pixels
|
Pixel size in cameras and other refractive imaging devices is typically
limited by the free-space diffraction. However, a vast majority of
semiconductor-based detectors are based on materials with substantially high
refractive index. We demonstrate that diffractive optics can be used to take
advantage of this high refractive index to reduce effective pixel size of the
sensors below free-space diffraction limit. At the same time, diffractive
systems encode both amplitude and phase information about the incoming beam
into multiple pixels, offering the platform for noise-tolerant imaging with
dynamical refocusing. We explore the opportunities opened by high index
diffractive optics to reduce sensor size and increase signal-to-noise ratio of
imaging structures.
|
physics.optics
|
pixel size in cameras and other refractive imaging devices is typically limited by the freespace diffraction however a vast majority of semiconductorbased detectors are based on materials with substantially high refractive index we demonstrate that diffractive optics can be used to take advantage of this high refractive index to reduce effective pixel size of the sensors below freespace diffraction limit at the same time diffractive systems encode both amplitude and phase information about the incoming beam into multiple pixels offering the platform for noisetolerant imaging with dynamical refocusing we explore the opportunities opened by high index diffractive optics to reduce sensor size and increase signaltonoise ratio of imaging structures
|
[['pixel', 'size', 'in', 'cameras', 'and', 'other', 'refractive', 'imaging', 'devices', 'is', 'typically', 'limited', 'by', 'the', 'freespace', 'diffraction', 'however', 'a', 'vast', 'majority', 'of', 'semiconductorbased', 'detectors', 'are', 'based', 'on', 'materials', 'with', 'substantially', 'high', 'refractive', 'index', 'we', 'demonstrate', 'that', 'diffractive', 'optics', 'can', 'be', 'used', 'to', 'take', 'advantage', 'of', 'this', 'high', 'refractive', 'index', 'to', 'reduce', 'effective', 'pixel', 'size', 'of', 'the', 'sensors', 'below', 'freespace', 'diffraction', 'limit', 'at', 'the', 'same', 'time', 'diffractive', 'systems', 'encode', 'both', 'amplitude', 'and', 'phase', 'information', 'about', 'the', 'incoming', 'beam', 'into', 'multiple', 'pixels', 'offering', 'the', 'platform', 'for', 'noisetolerant', 'imaging', 'with', 'dynamical', 'refocusing', 'we', 'explore', 'the', 'opportunities', 'opened', 'by', 'high', 'index', 'diffractive', 'optics', 'to', 'reduce', 'sensor', 'size', 'and', 'increase', 'signaltonoise', 'ratio', 'of', 'imaging', 'structures']]
|
[-0.09428960083206313, 0.18432524633687844, -0.06806026250038535, 0.001327443359539323, -0.07256625424814198, -0.15840116523552275, 0.016718062298765424, 0.46180050990569893, -0.25844963096560686, -0.39959199796644373, 0.08627663893569602, -0.309955984313434, -0.1098221858425083, 0.22150954676988543, -0.0956834431165197, 0.13234964744059727, 0.03599514760538389, -0.05848823097286695, -0.025646176268218444, -0.17229718646171308, 0.23472530424270197, 0.09047284800080804, 0.34553941332418986, 0.043214445057914615, 0.1288745739377625, 0.1098456875882496, -0.03480672202748033, 0.0033362292248858222, -0.052567118087074816, 0.12282985139108442, 0.30833156974217213, 0.06129215652157271, 0.2106948439715379, -0.4392776562738309, -0.2602396777942093, 0.06113251266625086, 0.15461149614372657, 0.0420000813815982, -0.08283765050326261, -0.2686178240895169, 0.07371472455390277, -0.11193432573041101, -0.13542752396601035, -0.0340027927651728, -0.02074456542149323, 0.02501752603811921, -0.24411239416056543, -0.011401371194376533, -0.05805422020397884, 0.0412803328331184, -0.03576451739674934, -0.10692581179799564, 0.03238292208898368, 0.11048879440224499, -0.06571360614466899, -0.023184940548946893, 0.17468560276416326, -0.19046503239430898, -0.08561020464115186, 0.3637245972768976, 0.0017658352563566198, -0.12430127344410354, 0.14829064587797594, -0.2245626888844535, -0.03229900946789378, 0.23449355788281137, 0.23563324640357627, 0.06370258512436797, -0.10142067566924139, 0.02255542752698252, 0.08107671728614, 0.2977774740632521, 0.13933007222591737, 0.1816405887307531, 0.21614423778694158, 0.23732182742822744, 0.05735289332149294, 0.12389998898228391, -0.19143159843451524, 0.012249945107539859, -0.1997840961728698, -0.15974879980411963, -0.20757758764682527, 0.02010180144955259, -0.164590907009311, -0.12924325592183603, 0.3202958069912611, 0.2035788151333023, 0.1521905070521074, -0.008076035163425114, 0.39733143654703207, 0.10855827303688734, 0.17613105816817884, -0.01946996069949018, 0.28851629292951264, 0.11901810528377259, 0.17438761561835578, -0.18151930816163983, 0.012062101744525476, -0.019170539581789336]
|
1,803.09844
|
A Conversational Interface to Improve Medication Adherence: Towards AI
Support in Patient's Treatment
|
Medication adherence is of utmost importance for many chronic conditions,
regardless of the disease type. Engaging patients in self-tracking their
medication is a big challenge. One way to potentially reduce this burden is to
use reminders to promote wellness throughout all stages of life and improve
medication adherence. Chatbots have proven effectiveness in triggering users to
engage in certain activity, such as medication adherence. In this paper, we
discuss "Roborto", a chatbot to create an engaging interactive and intelligent
environment for patients and assist in positive lifestyle modification. We
introduce a way for healthcare providers to track patients adherence and
intervene whenever necessary. We describe the health, technical and behavioural
approaches to the problem of medication non-adherence and propose a diagnostic
and decision support tool. The proposed study will be implemented and validated
through a pilot experiment with users to measure the efficacy of the proposed
approach.
|
cs.CY cs.AI
|
medication adherence is of utmost importance for many chronic conditions regardless of the disease type engaging patients in selftracking their medication is a big challenge one way to potentially reduce this burden is to use reminders to promote wellness throughout all stages of life and improve medication adherence chatbots have proven effectiveness in triggering users to engage in certain activity such as medication adherence in this paper we discuss roborto a chatbot to create an engaging interactive and intelligent environment for patients and assist in positive lifestyle modification we introduce a way for healthcare providers to track patients adherence and intervene whenever necessary we describe the health technical and behavioural approaches to the problem of medication nonadherence and propose a diagnostic and decision support tool the proposed study will be implemented and validated through a pilot experiment with users to measure the efficacy of the proposed approach
|
[['medication', 'adherence', 'is', 'of', 'utmost', 'importance', 'for', 'many', 'chronic', 'conditions', 'regardless', 'of', 'the', 'disease', 'type', 'engaging', 'patients', 'in', 'selftracking', 'their', 'medication', 'is', 'a', 'big', 'challenge', 'one', 'way', 'to', 'potentially', 'reduce', 'this', 'burden', 'is', 'to', 'use', 'reminders', 'to', 'promote', 'wellness', 'throughout', 'all', 'stages', 'of', 'life', 'and', 'improve', 'medication', 'adherence', 'chatbots', 'have', 'proven', 'effectiveness', 'in', 'triggering', 'users', 'to', 'engage', 'in', 'certain', 'activity', 'such', 'as', 'medication', 'adherence', 'in', 'this', 'paper', 'we', 'discuss', 'roborto', 'a', 'chatbot', 'to', 'create', 'an', 'engaging', 'interactive', 'and', 'intelligent', 'environment', 'for', 'patients', 'and', 'assist', 'in', 'positive', 'lifestyle', 'modification', 'we', 'introduce', 'a', 'way', 'for', 'healthcare', 'providers', 'to', 'track', 'patients', 'adherence', 'and', 'intervene', 'whenever', 'necessary', 'we', 'describe', 'the', 'health', 'technical', 'and', 'behavioural', 'approaches', 'to', 'the', 'problem', 'of', 'medication', 'nonadherence', 'and', 'propose', 'a', 'diagnostic', 'and', 'decision', 'support', 'tool', 'the', 'proposed', 'study', 'will', 'be', 'implemented', 'and', 'validated', 'through', 'a', 'pilot', 'experiment', 'with', 'users', 'to', 'measure', 'the', 'efficacy', 'of', 'the', 'proposed', 'approach']]
|
[-0.04384453879623061, 0.047740196334839995, -0.06449626245749604, 0.09429885959890608, -0.15019203363822084, -0.16742996268982246, 0.11049999983595327, 0.3878947782955349, -0.19897281415345888, -0.3021586346121071, 0.13811674056022927, -0.2645677441654548, -0.2079556008086425, 0.18428212758759674, -0.21565453693181377, 0.02935131148224671, 0.08792481073441481, 0.05736265397209623, 0.05266216067873956, -0.32295831382650986, 0.2841780551546572, 0.0720580809092634, 0.3414496506105037, 0.0967646299172448, 0.053071071600305456, 0.03616415963457157, -0.05510621897442496, -0.04071667657731331, -0.0849486742238833, 0.12710411111865677, 0.41912990055774174, 0.27096166914609604, 0.4253344369592936, -0.4505206398302705, -0.19793132992225304, 0.11355516632057229, 0.11679251310224198, 0.06501875718105074, -0.08311433417480184, -0.32160939623231755, 0.13361208766462818, -0.2439973854319486, -0.13365249284574993, -0.1190702562756224, -0.02888141592569037, -0.02674287146002003, -0.31072054168668717, 0.011961520423041019, -0.037211756528138296, 0.1291791600978946, -0.09802121046710478, -0.04501945656813579, 0.019091604577300893, 0.2775815997738391, 0.0844342630541539, 0.015521194196580462, 0.17850227849494207, -0.15140344360077831, -0.13901494040906634, 0.37344010121329396, 0.06416796725753644, -0.17036762215796705, 0.22402022107287425, -0.05158308522826801, -0.1253255623367245, 0.04284368821400639, 0.2620554842614594, 0.05535086967714437, -0.2159881195889097, -0.056535314534526086, 0.08905850379322719, 0.1440683039916322, 0.06385817420541322, -0.030281318098064256, 0.17366229677062534, 0.2324678925159451, 0.0601740367626867, 0.08461477384146635, -0.008220332106958106, -0.006876566906599966, -0.2084154206812892, -0.2351873300105257, -0.061456539896986614, 0.023464922343296227, -0.032322037961072456, -0.15122471495901477, 0.388015213607466, 0.24494984108725026, 0.08495871232797021, 0.04034258958035187, 0.2946795018019844, 0.00570684481230373, 0.07258120081738301, 0.009014309773043003, 0.12733402850476336, 0.010189584360102331, 0.1697111606712721, -0.2523995976646316, 0.18898843431507226, -0.006940378131319399]
|
1,803.09845
|
Neural Baby Talk
|
We introduce a novel framework for image captioning that can produce natural
language explicitly grounded in entities that object detectors find in the
image. Our approach reconciles classical slot filling approaches (that are
generally better grounded in images) with modern neural captioning approaches
(that are generally more natural sounding and accurate). Our approach first
generates a sentence `template' with slot locations explicitly tied to specific
image regions. These slots are then filled in by visual concepts identified in
the regions by object detectors. The entire architecture (sentence template
generation and slot filling with object detectors) is end-to-end
differentiable. We verify the effectiveness of our proposed model on different
image captioning tasks. On standard image captioning and novel object
captioning, our model reaches state-of-the-art on both COCO and Flickr30k
datasets. We also demonstrate that our model has unique advantages when the
train and test distributions of scene compositions -- and hence language priors
of associated captions -- are different. Code has been made available at:
https://github.com/jiasenlu/NeuralBabyTalk
|
cs.CV cs.CL
|
we introduce a novel framework for image captioning that can produce natural language explicitly grounded in entities that object detectors find in the image our approach reconciles classical slot filling approaches that are generally better grounded in images with modern neural captioning approaches that are generally more natural sounding and accurate our approach first generates a sentence template with slot locations explicitly tied to specific image regions these slots are then filled in by visual concepts identified in the regions by object detectors the entire architecture sentence template generation and slot filling with object detectors is endtoend differentiable we verify the effectiveness of our proposed model on different image captioning tasks on standard image captioning and novel object captioning our model reaches stateoftheart on both coco and flickr30k datasets we also demonstrate that our model has unique advantages when the train and test distributions of scene compositions and hence language priors of associated captions are different code has been made available at httpsgithubcomjiasenluneuralbabytalk
|
[['we', 'introduce', 'a', 'novel', 'framework', 'for', 'image', 'captioning', 'that', 'can', 'produce', 'natural', 'language', 'explicitly', 'grounded', 'in', 'entities', 'that', 'object', 'detectors', 'find', 'in', 'the', 'image', 'our', 'approach', 'reconciles', 'classical', 'slot', 'filling', 'approaches', 'that', 'are', 'generally', 'better', 'grounded', 'in', 'images', 'with', 'modern', 'neural', 'captioning', 'approaches', 'that', 'are', 'generally', 'more', 'natural', 'sounding', 'and', 'accurate', 'our', 'approach', 'first', 'generates', 'a', 'sentence', 'template', 'with', 'slot', 'locations', 'explicitly', 'tied', 'to', 'specific', 'image', 'regions', 'these', 'slots', 'are', 'then', 'filled', 'in', 'by', 'visual', 'concepts', 'identified', 'in', 'the', 'regions', 'by', 'object', 'detectors', 'the', 'entire', 'architecture', 'sentence', 'template', 'generation', 'and', 'slot', 'filling', 'with', 'object', 'detectors', 'is', 'endtoend', 'differentiable', 'we', 'verify', 'the', 'effectiveness', 'of', 'our', 'proposed', 'model', 'on', 'different', 'image', 'captioning', 'tasks', 'on', 'standard', 'image', 'captioning', 'and', 'novel', 'object', 'captioning', 'our', 'model', 'reaches', 'stateoftheart', 'on', 'both', 'coco', 'and', 'flickr30k', 'datasets', 'we', 'also', 'demonstrate', 'that', 'our', 'model', 'has', 'unique', 'advantages', 'when', 'the', 'train', 'and', 'test', 'distributions', 'of', 'scene', 'compositions', 'and', 'hence', 'language', 'priors', 'of', 'associated', 'captions', 'are', 'different', 'code', 'has', 'been', 'made', 'available', 'at', 'httpsgithubcomjiasenluneuralbabytalk']]
|
[-0.007709103811066598, -0.008223093229771397, -0.05132447416106538, 0.07647283972071392, -0.11599537763273182, -0.18974285553220982, -0.020151020633487927, 0.5364946776334151, -0.21385268422912945, -0.34489683579814473, 0.02520308982154044, -0.2941403552943001, -0.17127691798291547, 0.19438778161341438, -0.15745374724631095, 0.07384407601353747, 0.16731652850572618, 0.036168992392902756, -0.06911241496799235, -0.287942054542069, 0.3124459582125124, 0.015631812641880027, 0.359757993220823, 0.010689992354147963, 0.1688895956575396, -0.10217925014095036, -0.029955596609880435, -0.04390451226406443, -0.051136638671362755, 0.16303987242137713, 0.3388662123405892, 0.21364381069455435, 0.25164535403665567, -0.41220539014349566, -0.2432689201431694, -0.005997026143710555, 0.1292389735613984, 0.059756804846265256, -0.05884037605520226, -0.37980507172350947, 0.12506618057550103, -0.1765125925637592, 0.0993825915703596, -0.12462593374175975, 0.007219995105391897, -0.03736443895297585, -0.2528444464924964, 0.030320604437966487, 0.10009094192014065, 0.022723524152864643, -0.08003869947092032, -0.10115408684906009, 0.021649108999868695, 0.18095566809732885, 0.0044006854087332795, 0.0884635711726905, 0.14982109813035444, -0.20113485023942718, -0.16292858101286706, 0.38746140575335347, -0.08157421733873586, -0.24912742436231103, 0.21983104091379102, -0.0682189614471784, -0.1287480199272618, 0.08751621109398978, 0.19450902052074212, 0.14872709377151397, -0.14433846872684009, 0.012071946757287937, -0.091118245549431, 0.23571316180405794, 0.08720309597750504, -0.015190500170308636, 0.27326213582821285, 0.27284651348097133, -0.01067597401201909, 0.16011258850307464, -0.14093120559154618, -0.06444547459178454, -0.23331841478055274, -0.10524217462528966, -0.18398256621174056, -0.09786888666416484, -0.08457715904723169, -0.1313194086096813, 0.41487574182956677, 0.2778237793853479, 0.19177600778179404, 0.10622494709160593, 0.38189390670784096, -0.009211434154156135, 0.12876590865342247, 0.059435997954512265, 0.15760250639653317, -0.07012727681007007, 0.08168238660976014, -0.12032710600652974, 0.056196951821883334, 0.07207960493713157]
|
1,803.09846
|
SUSY Confinement
|
In response to the present status that searching for SUSY particles has been
unsuccessful, we propose a bold scenario that SUSY particles are confined
inside hadrons with a required condition of $P_R=1$ in analog to the color
confinement for quarks. The scenario seems to be able to reconcile the
beautiful SUSY theory and non-observation at present experiments. On other
aspects, some loopholes in the proposal emerge and require to be answered in
the future research.
|
hep-ph
|
in response to the present status that searching for susy particles has been unsuccessful we propose a bold scenario that susy particles are confined inside hadrons with a required condition of p_r1 in analog to the color confinement for quarks the scenario seems to be able to reconcile the beautiful susy theory and nonobservation at present experiments on other aspects some loopholes in the proposal emerge and require to be answered in the future research
|
[['in', 'response', 'to', 'the', 'present', 'status', 'that', 'searching', 'for', 'susy', 'particles', 'has', 'been', 'unsuccessful', 'we', 'propose', 'a', 'bold', 'scenario', 'that', 'susy', 'particles', 'are', 'confined', 'inside', 'hadrons', 'with', 'a', 'required', 'condition', 'of', 'p_r1', 'in', 'analog', 'to', 'the', 'color', 'confinement', 'for', 'quarks', 'the', 'scenario', 'seems', 'to', 'be', 'able', 'to', 'reconcile', 'the', 'beautiful', 'susy', 'theory', 'and', 'nonobservation', 'at', 'present', 'experiments', 'on', 'other', 'aspects', 'some', 'loopholes', 'in', 'the', 'proposal', 'emerge', 'and', 'require', 'to', 'be', 'answered', 'in', 'the', 'future', 'research']]
|
[-0.06542390394334992, 0.21490563239902258, -0.11562905323381226, 0.11900688496728738, -0.09164123453199863, -0.1981829658523202, 0.021288164008098343, 0.3801864985345552, -0.16765056390315294, -0.31033197515333694, 0.07310178556013852, -0.2756534791489442, -0.09799073711658518, 0.12677424871673187, -0.09310030008355777, 0.038929017235835396, 0.045823968406766655, 0.012864216640591621, -0.019343830263242125, -0.23841117377082507, 0.23972720711802442, 0.058285600406428176, 0.20724529994030794, 0.12175983364383379, 0.030091655608266592, -0.029525500846405824, 0.0036595714216430984, -0.023684837321440378, -0.11357896293261244, 0.08796170689165592, 0.26711810355385146, 0.14684889233671128, 0.17980333852892122, -0.48366917063792547, -0.21233830643196902, 0.15464919585734604, 0.15336675268597902, 0.10807926343133052, -0.11503818453134348, -0.28680579488476116, 0.1034847615309991, -0.1316736774146557, -0.15447681141396363, -0.08821204762905836, -0.006414823705951373, -0.10312682192772626, -0.27789060773948826, 0.048428060794249175, -0.011120369549219807, 0.003094206688304742, -0.007286574207246304, -0.10010911243657271, 0.04494780246789257, 0.05916488174969951, 0.12522411423424878, 0.0364977515488863, 0.13718304599945744, -0.17789821367167558, -0.18797188594937325, 0.4229433682560921, -0.020152768529951574, -0.20680731046013534, 0.21978139404207467, -0.17008782187476754, -0.19870414648205043, 0.09552933898443977, 0.17379314001649618, 0.07117009604970614, -0.13768260369698207, 0.10964606497281541, -0.04963750974585612, 0.1283660103070239, 0.059684023053074874, 0.06436545144766569, 0.31396961559851966, 0.19464284444848695, 0.01714368644170463, 0.08279423451439168, -0.05953402108435209, -0.07446731174985567, -0.36578112612167996, -0.129936201920112, -0.14465020661552747, 0.019352035199602446, 0.037114609827985985, -0.07359587178876002, 0.3633056334902843, 0.19696032150338094, 0.2180574828448395, 0.006218894294773539, 0.2511068101134151, 0.02787862703204155, 0.10558065588896473, 0.036608318256524705, 0.2972857917802564, 0.07773546919226647, 0.15494748337815206, -0.1849109351138274, 0.030108691919595004, 0.06178355105842153]
|
1,803.09847
|
Revealing evolution of nonthermal electrons in solar flares using 3D
modeling
|
Understanding nonthermal particle generation, transport, and escape in solar
flares requires detailed quantification of the particle evolution in the
realistic 3D domain where the flare takes place. Rather surprisingly, apart of
standard flare scenario and integral characteristics of the nonthermal
electrons, not much is known about actual evolution of nonthermal electrons in
the 3D spatial domain. This paper attempts to begin to remedy this situation by
creating sets of evolving 3D models, the synthesized emission from which
matches the evolving observed emission. Here we investigate two contrasting
flares: a dense, "coronal-thick-target" flare SOL2002-04-12T17:42, that
contained a single flare loop observed in both microwave and X-ray, and a more
complex flare, SOL2015-06-22T17:50, that contained at least four distinct
flaring loops needed to consistently reproduce the microwave and X-ray
emission. Our analysis reveals differing evolution pattern of the nonthermal
electrons in the dense and tenuous loops; however, both of which imply the
central role of resonant wave-particle interaction with turbulence. These
results offer new constraints for theory and models of the particle
acceleration and transport in solar flares.
|
astro-ph.SR
|
understanding nonthermal particle generation transport and escape in solar flares requires detailed quantification of the particle evolution in the realistic 3d domain where the flare takes place rather surprisingly apart of standard flare scenario and integral characteristics of the nonthermal electrons not much is known about actual evolution of nonthermal electrons in the 3d spatial domain this paper attempts to begin to remedy this situation by creating sets of evolving 3d models the synthesized emission from which matches the evolving observed emission here we investigate two contrasting flares a dense coronalthicktarget flare sol20020412t1742 that contained a single flare loop observed in both microwave and xray and a more complex flare sol20150622t1750 that contained at least four distinct flaring loops needed to consistently reproduce the microwave and xray emission our analysis reveals differing evolution pattern of the nonthermal electrons in the dense and tenuous loops however both of which imply the central role of resonant waveparticle interaction with turbulence these results offer new constraints for theory and models of the particle acceleration and transport in solar flares
|
[['understanding', 'nonthermal', 'particle', 'generation', 'transport', 'and', 'escape', 'in', 'solar', 'flares', 'requires', 'detailed', 'quantification', 'of', 'the', 'particle', 'evolution', 'in', 'the', 'realistic', '3d', 'domain', 'where', 'the', 'flare', 'takes', 'place', 'rather', 'surprisingly', 'apart', 'of', 'standard', 'flare', 'scenario', 'and', 'integral', 'characteristics', 'of', 'the', 'nonthermal', 'electrons', 'not', 'much', 'is', 'known', 'about', 'actual', 'evolution', 'of', 'nonthermal', 'electrons', 'in', 'the', '3d', 'spatial', 'domain', 'this', 'paper', 'attempts', 'to', 'begin', 'to', 'remedy', 'this', 'situation', 'by', 'creating', 'sets', 'of', 'evolving', '3d', 'models', 'the', 'synthesized', 'emission', 'from', 'which', 'matches', 'the', 'evolving', 'observed', 'emission', 'here', 'we', 'investigate', 'two', 'contrasting', 'flares', 'a', 'dense', 'coronalthicktarget', 'flare', 'sol20020412t1742', 'that', 'contained', 'a', 'single', 'flare', 'loop', 'observed', 'in', 'both', 'microwave', 'and', 'xray', 'and', 'a', 'more', 'complex', 'flare', 'sol20150622t1750', 'that', 'contained', 'at', 'least', 'four', 'distinct', 'flaring', 'loops', 'needed', 'to', 'consistently', 'reproduce', 'the', 'microwave', 'and', 'xray', 'emission', 'our', 'analysis', 'reveals', 'differing', 'evolution', 'pattern', 'of', 'the', 'nonthermal', 'electrons', 'in', 'the', 'dense', 'and', 'tenuous', 'loops', 'however', 'both', 'of', 'which', 'imply', 'the', 'central', 'role', 'of', 'resonant', 'waveparticle', 'interaction', 'with', 'turbulence', 'these', 'results', 'offer', 'new', 'constraints', 'for', 'theory', 'and', 'models', 'of', 'the', 'particle', 'acceleration', 'and', 'transport', 'in', 'solar', 'flares']]
|
[-0.06720905283377156, 0.19418494536331452, -0.0371631879407934, 0.145294420872317, -0.0624164160599426, -0.09651419747556221, 0.011982512792217077, 0.399846984956392, -0.20991380388896935, -0.36790702232251193, 0.01361229132613264, -0.2741671900609454, -0.07673720184652534, 0.21772509927907152, 0.004160372010093031, 0.003261664079171148, 0.09421375538141741, -0.058523406619152236, -0.022469341192351427, -0.15995307216108534, 0.2864722857101029, 0.08858164840760087, 0.21801665010512133, 0.03903446454188727, 0.07800914633836102, -0.07149386314158408, -0.0453503391963855, -0.0012642950670136881, -0.08238191658005486, 0.11242645763256452, 0.16329799837795675, 0.10952739209687672, 0.20145891534670585, -0.5031749058644034, -0.31976488159398814, 0.049616611365503445, 0.22083339301836974, 0.015842389782373876, -0.05531064201204572, -0.2286936831095315, 0.006762699759699878, -0.1232563497315597, -0.11286858887535471, 0.034719289802660834, 0.01427277686569646, -0.019878019143375055, -0.24828627629937722, 0.10378092907724439, 0.07420534188280453, 0.05126859741406569, -0.09663607856538685, -0.001072248438577776, -0.029845046464924436, 0.12270411224282116, 0.06613309916534132, 0.030739002920299595, 0.17448774853020077, -0.12914697278689355, -0.12667961398710234, 0.40920619909164385, -0.02248840177205601, -0.04085360297925146, 0.2291340216472099, -0.26456249304212676, -0.18262008135476165, 0.19622254475542059, 0.14238933125521577, 0.07663968070867778, -0.14680703476440118, 0.009334917026814181, -0.019264374159793287, 0.1461936192280166, 0.04437184937545933, 0.05133394780165026, 0.28085289280215614, 0.1608855218029005, -0.007100511470142041, 0.1425251391934328, -0.16723755504828314, -0.09342873959150703, -0.29650096628125866, -0.10623197424268577, -0.13675468567909532, 0.06837031299544759, -0.08279232626762026, -0.2070530052808237, 0.43527323250911826, 0.16382297046073427, 0.19681213370314396, -0.018793087196940114, 0.3129776545902553, 0.0945301938060445, 0.019563976126168503, 0.1266881406974758, 0.2593818759933286, 0.13274114110205604, 0.1551017614183786, -0.24354803413179613, 0.05617192202662199, 0.006189599980444061]
|
1,803.09848
|
Epileptic Seizure Detection: A Deep Learning Approach
|
Epilepsy is the second most common brain disorder after migraine. Automatic
detection of epileptic seizures can considerably improve the patients' quality
of life. Current Electroencephalogram (EEG)-based seizure detection systems
encounter many challenges in real-life situations. The EEGs are non-stationary
signals and seizure patterns vary across patients and recording sessions.
Moreover, EEG data are prone to numerous noise types that negatively affect the
detection accuracy of epileptic seizures. To address these challenges, we
introduce the use of a deep learning-based approach that automatically learns
the discriminative EEG features of epileptic seizures. Specifically, to reveal
the correlation between successive data samples, the time-series EEG data are
first segmented into a sequence of non-overlapping epochs. Second, Long
Short-Term Memory (LSTM) network is used to learn the high-level
representations of the normal and the seizure EEG patterns. Third, these
representations are fed into Softmax function for training and classification.
The results on a well-known benchmark clinical dataset demonstrate the
superiority of the proposed approach over the existing state-of-the-art
methods. Furthermore, our approach is shown to be robust in noisy and real-life
conditions. Compared to current methods that are quite sensitive to noise, the
proposed method maintains its high detection performance in the presence of
common EEG artifacts (muscle activities and eye-blinking) as well as white
noise.
|
eess.SP
|
epilepsy is the second most common brain disorder after migraine automatic detection of epileptic seizures can considerably improve the patients quality of life current electroencephalogram eegbased seizure detection systems encounter many challenges in reallife situations the eegs are nonstationary signals and seizure patterns vary across patients and recording sessions moreover eeg data are prone to numerous noise types that negatively affect the detection accuracy of epileptic seizures to address these challenges we introduce the use of a deep learningbased approach that automatically learns the discriminative eeg features of epileptic seizures specifically to reveal the correlation between successive data samples the timeseries eeg data are first segmented into a sequence of nonoverlapping epochs second long shortterm memory lstm network is used to learn the highlevel representations of the normal and the seizure eeg patterns third these representations are fed into softmax function for training and classification the results on a wellknown benchmark clinical dataset demonstrate the superiority of the proposed approach over the existing stateoftheart methods furthermore our approach is shown to be robust in noisy and reallife conditions compared to current methods that are quite sensitive to noise the proposed method maintains its high detection performance in the presence of common eeg artifacts muscle activities and eyeblinking as well as white noise
|
[['epilepsy', 'is', 'the', 'second', 'most', 'common', 'brain', 'disorder', 'after', 'migraine', 'automatic', 'detection', 'of', 'epileptic', 'seizures', 'can', 'considerably', 'improve', 'the', 'patients', 'quality', 'of', 'life', 'current', 'electroencephalogram', 'eegbased', 'seizure', 'detection', 'systems', 'encounter', 'many', 'challenges', 'in', 'reallife', 'situations', 'the', 'eegs', 'are', 'nonstationary', 'signals', 'and', 'seizure', 'patterns', 'vary', 'across', 'patients', 'and', 'recording', 'sessions', 'moreover', 'eeg', 'data', 'are', 'prone', 'to', 'numerous', 'noise', 'types', 'that', 'negatively', 'affect', 'the', 'detection', 'accuracy', 'of', 'epileptic', 'seizures', 'to', 'address', 'these', 'challenges', 'we', 'introduce', 'the', 'use', 'of', 'a', 'deep', 'learningbased', 'approach', 'that', 'automatically', 'learns', 'the', 'discriminative', 'eeg', 'features', 'of', 'epileptic', 'seizures', 'specifically', 'to', 'reveal', 'the', 'correlation', 'between', 'successive', 'data', 'samples', 'the', 'timeseries', 'eeg', 'data', 'are', 'first', 'segmented', 'into', 'a', 'sequence', 'of', 'nonoverlapping', 'epochs', 'second', 'long', 'shortterm', 'memory', 'lstm', 'network', 'is', 'used', 'to', 'learn', 'the', 'highlevel', 'representations', 'of', 'the', 'normal', 'and', 'the', 'seizure', 'eeg', 'patterns', 'third', 'these', 'representations', 'are', 'fed', 'into', 'softmax', 'function', 'for', 'training', 'and', 'classification', 'the', 'results', 'on', 'a', 'wellknown', 'benchmark', 'clinical', 'dataset', 'demonstrate', 'the', 'superiority', 'of', 'the', 'proposed', 'approach', 'over', 'the', 'existing', 'stateoftheart', 'methods', 'furthermore', 'our', 'approach', 'is', 'shown', 'to', 'be', 'robust', 'in', 'noisy', 'and', 'reallife', 'conditions', 'compared', 'to', 'current', 'methods', 'that', 'are', 'quite', 'sensitive', 'to', 'noise', 'the', 'proposed', 'method', 'maintains', 'its', 'high', 'detection', 'performance', 'in', 'the', 'presence', 'of', 'common', 'eeg', 'artifacts', 'muscle', 'activities', 'and', 'eyeblinking', 'as', 'well', 'as', 'white', 'noise']]
|
[-0.06882477114976489, 0.023894769084674992, -0.05264031329249331, 0.10204364768974043, -0.09324825037916559, -0.17481537978604156, 0.016831115502666437, 0.443292239355802, -0.24603398048312333, -0.28018869718378586, 0.11385891400112876, -0.306346640337856, -0.25304641401535777, 0.2264559521891159, -0.18058392745420723, 0.0675003173250929, 0.1674467374720031, 0.07210952039771792, -0.03465633226019321, -0.28439510807367935, 0.2464908030365137, 0.015346902293424378, 0.39503608573390664, -0.014118072258875231, 0.0814351858746893, -0.05943100596338792, -0.05874445820490847, -0.06204603111672321, 0.03157680312489112, 0.11281056694339363, 0.384109594919587, 0.20709172285706648, 0.3350606538719972, -0.44947660262784306, -0.27051498028361853, 0.08622403497772538, 0.11623950267566438, 0.073289137578543, 0.00595261676858601, -0.4266337540598129, 0.12844103667885065, -0.119011026451843, 0.032089603121418786, -0.1286422597905533, -0.021864402898640004, 0.011328468485823218, -0.29819095842507315, 0.15190321613127314, 0.03935146527771206, 0.09264977249747389, -0.08475458121832179, -0.07457813736239603, 0.03538369596551418, 0.22241087163192272, 0.08665690423518788, 0.018562690280202142, 0.19058080970895594, -0.15746088460623725, -0.15723286023751157, 0.30072349785055025, -0.002922918041289415, -0.15207456065317668, 0.226935654919801, -0.06466451591706641, -0.13715535076994026, 0.14210208153949594, 0.2449641725760094, 0.07525816405376524, -0.19308411689114952, -0.09586070967291235, 0.05940823256969452, 0.1840307708282709, 0.0678569197782122, -0.013216232817251025, 0.16182205724015938, 0.26994713733658054, -0.04227507982665524, 0.13078050146083664, -0.21534798742724442, -0.001028464260326593, -0.20065578865024639, -0.06406067229270877, -0.15936575956062748, -0.041314334028459784, -0.10459720447040624, -0.1654981387757014, 0.4814713757819022, 0.24719735128444814, 0.15524379822715484, 0.08297696498094702, 0.34738518933783163, 0.009212403206752156, 0.10060917997715187, 0.039021522948904985, 0.14696076157709304, 0.02816755658362658, 0.13192918063262213, -0.22587963086492513, 0.13959704914002874, -0.02441356673354573]
|
1,803.09849
|
Adaptive nonparametric estimation for compound Poisson processes robust
to the discrete-observation scheme
|
A compound Poisson process whose jump measure and intensity are unknown is
observed at finitely many equispaced times. We construct a purely data-driven
estimator of the L\'evy density $\nu$ through the spectral approach using
general Calderon--Zygmund integral operators, which include convolution and
projection kernels. Assuming minimal tail assumptions, it is shown to estimate
$\nu$ at the minimax rate of estimation over Besov balls under the losses
$L^p(\mathbb{R})$, $p\in[1,\infty]$, and robustly to the observation regime
(high- and low-frequency). To achieve adaptation in a minimax sense, we use
Lepski\u{i}'s method as it is particularly well-suited for our generality.
Thus, novel exponential-concentration inequalities are proved including one for
the uniform fluctuations of the empirical characteristic function. These are of
independent interest, as are the proof-strategies employed to deal with general
Calderon--Zygmund operators, to depart from the ubiquitous quadratic structure
and to show robustness without polynomial-tail conditions. Part of the
motivation for such generality is a new insight we include here too that,
furthermore, allows us to unify the main two approaches to construct estimators
used in related literature.
|
math.ST stat.TH
|
a compound poisson process whose jump measure and intensity are unknown is observed at finitely many equispaced times we construct a purely datadriven estimator of the levy density nu through the spectral approach using general calderonzygmund integral operators which include convolution and projection kernels assuming minimal tail assumptions it is shown to estimate nu at the minimax rate of estimation over besov balls under the losses lpmathbbr pin1infty and robustly to the observation regime high and lowfrequency to achieve adaptation in a minimax sense we use lepskiuis method as it is particularly wellsuited for our generality thus novel exponentialconcentration inequalities are proved including one for the uniform fluctuations of the empirical characteristic function these are of independent interest as are the proofstrategies employed to deal with general calderonzygmund operators to depart from the ubiquitous quadratic structure and to show robustness without polynomialtail conditions part of the motivation for such generality is a new insight we include here too that furthermore allows us to unify the main two approaches to construct estimators used in related literature
|
[['a', 'compound', 'poisson', 'process', 'whose', 'jump', 'measure', 'and', 'intensity', 'are', 'unknown', 'is', 'observed', 'at', 'finitely', 'many', 'equispaced', 'times', 'we', 'construct', 'a', 'purely', 'datadriven', 'estimator', 'of', 'the', 'levy', 'density', 'nu', 'through', 'the', 'spectral', 'approach', 'using', 'general', 'calderonzygmund', 'integral', 'operators', 'which', 'include', 'convolution', 'and', 'projection', 'kernels', 'assuming', 'minimal', 'tail', 'assumptions', 'it', 'is', 'shown', 'to', 'estimate', 'nu', 'at', 'the', 'minimax', 'rate', 'of', 'estimation', 'over', 'besov', 'balls', 'under', 'the', 'losses', 'lpmathbbr', 'pin1infty', 'and', 'robustly', 'to', 'the', 'observation', 'regime', 'high', 'and', 'lowfrequency', 'to', 'achieve', 'adaptation', 'in', 'a', 'minimax', 'sense', 'we', 'use', 'lepskiuis', 'method', 'as', 'it', 'is', 'particularly', 'wellsuited', 'for', 'our', 'generality', 'thus', 'novel', 'exponentialconcentration', 'inequalities', 'are', 'proved', 'including', 'one', 'for', 'the', 'uniform', 'fluctuations', 'of', 'the', 'empirical', 'characteristic', 'function', 'these', 'are', 'of', 'independent', 'interest', 'as', 'are', 'the', 'proofstrategies', 'employed', 'to', 'deal', 'with', 'general', 'calderonzygmund', 'operators', 'to', 'depart', 'from', 'the', 'ubiquitous', 'quadratic', 'structure', 'and', 'to', 'show', 'robustness', 'without', 'polynomialtail', 'conditions', 'part', 'of', 'the', 'motivation', 'for', 'such', 'generality', 'is', 'a', 'new', 'insight', 'we', 'include', 'here', 'too', 'that', 'furthermore', 'allows', 'us', 'to', 'unify', 'the', 'main', 'two', 'approaches', 'to', 'construct', 'estimators', 'used', 'in', 'related', 'literature']]
|
[-0.02690200303879986, 0.06297047600171894, -0.09646530263125896, 0.12260582843597861, -0.09482413090558516, -0.1403590229922655, 0.021137384412543335, 0.3865806422828103, -0.29572536166190927, -0.2364660824406674, 0.14007614090989687, -0.24676094881583302, -0.15129250365790056, 0.23604014057295714, -0.11465620563763101, 0.09299745115557718, 0.02531033423484156, 0.016503746703005674, -0.06577728714927356, -0.23546686146628895, 0.34569648713110374, 0.03013563869324954, 0.27566034634112874, 0.024326982220011215, 0.10970826575849804, -0.008432831786769, -0.05777172973564668, -0.019317931142956976, -0.15663412916331929, 0.12766876318954934, 0.2752679663244635, 0.07488527780561946, 0.30517209007687957, -0.3670410996967415, -0.2138844307250621, 0.15276450924956572, 0.12114332960809619, 0.03816122109851969, -0.010426074397145655, -0.2629462337823944, 0.10452635195827907, -0.13870159049017344, -0.1485798125895971, -0.13436521721557218, -0.004598613884926322, 0.03975389594598864, -0.37806523218104204, 0.08398709948615808, 0.08992153883786404, 0.012893562728664374, -0.07017698789005881, -0.1293154089093448, 0.049764110790483915, 0.10137806263648802, 0.06322502293634195, 0.017342812569583196, 0.12014000058413772, -0.06437353135974348, -0.09183875876900942, 0.3181540954351556, -0.0826473438129243, -0.2328741230745936, 0.2070375889844713, -0.17359407899672524, -0.14377312367368075, 0.1326890342912435, 0.15948767406179717, 0.11503327390375107, -0.15350590288953594, 0.11183451889838468, -0.012666457333351479, 0.09474921881831223, 0.06458683457900906, 0.06920905430373676, 0.12745562020950674, 0.12145236538374546, 0.13895016969338178, 0.137899726000206, -0.07382452220258395, -0.0942147276514041, -0.3233972916608317, -0.1230528434300768, -0.2077899181736056, 0.047333950651346636, -0.09912845101001555, -0.16478810490470527, 0.3654275595575397, 0.16982321412308, 0.18891707884844894, 0.12294780019036228, 0.2464411465331302, 0.14280994375554942, 0.06462656136953451, 0.07884793304593156, 0.17941447834440707, 0.165955952168524, 0.07507428855768661, -0.15015156358638396, 0.07565266467570954, 0.06305588719200844]
|
1,803.0985
|
Weakly nonlinear analysis for car-following model with consideration of
cooperation and time delays
|
In traffic systems, cooperative driving has attracted the researchers
attentions. A lot of works attempt to understand the effects of cooperative
driving behavior and/or time delays on traffic flow dynamics for specific
traffic flow model. This paper is a new attempt to investigate analyses of
linear stability and weak nonlinear for the general car-following model with
consideration of cooperation and time delays. We derive linear stability
condition and study that how the combinations of cooperation and time delays
affect the stability of traffic flow. Burgers equation and Korteweg de Vries
(KdV) equation for car-following model considering cooperation and time delays
are derived. Their solitary wave solutions and constraint conditions are
concluded. We investigate the property of cooperative optimal velocity(OV)
model which estimates the combinations of cooperation and time delays about the
evolution of traffic waves using both analytic and numerical methods. The
results indicate that delays and cooperation are model-dependent, and
cooperative behavior could inhibit the stabilization of traffic flow. Moreover,
delays of sensing to relative motion are easy to trigger the traffic waves;
delays of sensing to host vehicle are beneficial to relieve the instability
effect a certain extent.
|
nlin.PS nlin.AO
|
in traffic systems cooperative driving has attracted the researchers attentions a lot of works attempt to understand the effects of cooperative driving behavior andor time delays on traffic flow dynamics for specific traffic flow model this paper is a new attempt to investigate analyses of linear stability and weak nonlinear for the general carfollowing model with consideration of cooperation and time delays we derive linear stability condition and study that how the combinations of cooperation and time delays affect the stability of traffic flow burgers equation and korteweg de vries kdv equation for carfollowing model considering cooperation and time delays are derived their solitary wave solutions and constraint conditions are concluded we investigate the property of cooperative optimal velocityov model which estimates the combinations of cooperation and time delays about the evolution of traffic waves using both analytic and numerical methods the results indicate that delays and cooperation are modeldependent and cooperative behavior could inhibit the stabilization of traffic flow moreover delays of sensing to relative motion are easy to trigger the traffic waves delays of sensing to host vehicle are beneficial to relieve the instability effect a certain extent
|
[['in', 'traffic', 'systems', 'cooperative', 'driving', 'has', 'attracted', 'the', 'researchers', 'attentions', 'a', 'lot', 'of', 'works', 'attempt', 'to', 'understand', 'the', 'effects', 'of', 'cooperative', 'driving', 'behavior', 'andor', 'time', 'delays', 'on', 'traffic', 'flow', 'dynamics', 'for', 'specific', 'traffic', 'flow', 'model', 'this', 'paper', 'is', 'a', 'new', 'attempt', 'to', 'investigate', 'analyses', 'of', 'linear', 'stability', 'and', 'weak', 'nonlinear', 'for', 'the', 'general', 'carfollowing', 'model', 'with', 'consideration', 'of', 'cooperation', 'and', 'time', 'delays', 'we', 'derive', 'linear', 'stability', 'condition', 'and', 'study', 'that', 'how', 'the', 'combinations', 'of', 'cooperation', 'and', 'time', 'delays', 'affect', 'the', 'stability', 'of', 'traffic', 'flow', 'burgers', 'equation', 'and', 'korteweg', 'de', 'vries', 'kdv', 'equation', 'for', 'carfollowing', 'model', 'considering', 'cooperation', 'and', 'time', 'delays', 'are', 'derived', 'their', 'solitary', 'wave', 'solutions', 'and', 'constraint', 'conditions', 'are', 'concluded', 'we', 'investigate', 'the', 'property', 'of', 'cooperative', 'optimal', 'velocityov', 'model', 'which', 'estimates', 'the', 'combinations', 'of', 'cooperation', 'and', 'time', 'delays', 'about', 'the', 'evolution', 'of', 'traffic', 'waves', 'using', 'both', 'analytic', 'and', 'numerical', 'methods', 'the', 'results', 'indicate', 'that', 'delays', 'and', 'cooperation', 'are', 'modeldependent', 'and', 'cooperative', 'behavior', 'could', 'inhibit', 'the', 'stabilization', 'of', 'traffic', 'flow', 'moreover', 'delays', 'of', 'sensing', 'to', 'relative', 'motion', 'are', 'easy', 'to', 'trigger', 'the', 'traffic', 'waves', 'delays', 'of', 'sensing', 'to', 'host', 'vehicle', 'are', 'beneficial', 'to', 'relieve', 'the', 'instability', 'effect', 'a', 'certain', 'extent']]
|
[-0.23870853513538365, 0.08526040019378775, -0.08230935528421054, 0.07127351157253894, -0.1059824511366921, -0.18227988728149622, 0.05160842795558175, 0.3687323099248624, -0.2972071661783885, -0.2743462275211064, 0.14187795065636574, -0.24732529686713992, -0.18122926760691577, 0.14572445090451136, -0.07774623090440713, 0.09141138930947929, 0.07087036787726911, -0.0036770333215673133, 0.0047175138917746684, -0.22482445004036422, 0.3066454038551205, 0.06649634920130854, 0.32245686069554674, 0.05821248301102844, 0.09448561657013164, -0.02803355614253118, -0.04663199388358013, 0.0040067121997554465, -0.14480495822399414, 0.049523740996995934, 0.2563935920125534, 0.11282437523117378, 0.2801444441863587, -0.4885094318854273, -0.3253058467119459, 0.10369818796842266, 0.13608372681306075, 0.14318061601456808, -0.030356115011729932, -0.3250198048766131, 0.06877249655703073, -0.1670945956218968, -0.12949691779132952, -0.03905443213978615, 0.014479899355185726, 0.11524430623834844, -0.2795484969084442, 0.09962123145704113, 0.025457426162367926, 0.028199248567775444, -0.12349025893059594, -0.011686020944065479, -0.047546624733263224, 0.16129218054955047, 0.10852266503276214, -0.0730838403142693, 0.10311325647370526, -0.13802732574438095, -0.09744446386910222, 0.4180324632260535, -0.03196531497730465, -0.2024262796806556, 0.2027993440571384, -0.08144457300228101, -0.09885863223600955, 0.1318240038996375, 0.28619273424040154, 0.08060762054833864, -0.14879328256137866, -0.010715921467019827, 0.004731515094852839, 0.1613607253650174, 0.07529022499534582, 0.04674149364160334, 0.13495758615148368, 0.19357988994233508, 0.11754875133927695, 0.07191635785185825, -0.04002263078530117, -0.17074192733696056, -0.22073449663049172, -0.08656123470239065, -0.0629091759227098, 0.009879633975470876, -0.09147138085387826, -0.07597011295221155, 0.39169553100875526, 0.16598397925893082, 0.12932735236568582, 0.11219876966372665, 0.2965727999298858, 0.1352328002728798, -0.009207831282986613, 0.06525267277987151, 0.23293024357642347, 0.1079834698910071, 0.21038780272962948, -0.3175831547366682, 0.10548476536053593, 0.046760180859121855]
|
1,803.09851
|
Attributes as Operators: Factorizing Unseen Attribute-Object
Compositions
|
We present a new approach to modeling visual attributes. Prior work casts
attributes in a similar role as objects, learning a latent representation where
properties (e.g., sliced) are recognized by classifiers much in the way objects
(e.g., apple) are. However, this common approach fails to separate the
attributes observed during training from the objects with which they are
composed, making it ineffectual when encountering new attribute-object
compositions. Instead, we propose to model attributes as operators. Our
approach learns a semantic embedding that explicitly factors out attributes
from their accompanying objects, and also benefits from novel regularizers
expressing attribute operators' effects (e.g., blunt should undo the effects of
sharp). Not only does our approach align conceptually with the linguistic role
of attributes as modifiers, but it also generalizes to recognize unseen
compositions of objects and attributes. We validate our approach on two
challenging datasets and demonstrate significant improvements over the
state-of-the-art. In addition, we show that not only can our model recognize
unseen compositions robustly in an open-world setting, it can also generalize
to compositions where objects themselves were unseen during training.
|
cs.CV
|
we present a new approach to modeling visual attributes prior work casts attributes in a similar role as objects learning a latent representation where properties eg sliced are recognized by classifiers much in the way objects eg apple are however this common approach fails to separate the attributes observed during training from the objects with which they are composed making it ineffectual when encountering new attributeobject compositions instead we propose to model attributes as operators our approach learns a semantic embedding that explicitly factors out attributes from their accompanying objects and also benefits from novel regularizers expressing attribute operators effects eg blunt should undo the effects of sharp not only does our approach align conceptually with the linguistic role of attributes as modifiers but it also generalizes to recognize unseen compositions of objects and attributes we validate our approach on two challenging datasets and demonstrate significant improvements over the stateoftheart in addition we show that not only can our model recognize unseen compositions robustly in an openworld setting it can also generalize to compositions where objects themselves were unseen during training
|
[['we', 'present', 'a', 'new', 'approach', 'to', 'modeling', 'visual', 'attributes', 'prior', 'work', 'casts', 'attributes', 'in', 'a', 'similar', 'role', 'as', 'objects', 'learning', 'a', 'latent', 'representation', 'where', 'properties', 'eg', 'sliced', 'are', 'recognized', 'by', 'classifiers', 'much', 'in', 'the', 'way', 'objects', 'eg', 'apple', 'are', 'however', 'this', 'common', 'approach', 'fails', 'to', 'separate', 'the', 'attributes', 'observed', 'during', 'training', 'from', 'the', 'objects', 'with', 'which', 'they', 'are', 'composed', 'making', 'it', 'ineffectual', 'when', 'encountering', 'new', 'attributeobject', 'compositions', 'instead', 'we', 'propose', 'to', 'model', 'attributes', 'as', 'operators', 'our', 'approach', 'learns', 'a', 'semantic', 'embedding', 'that', 'explicitly', 'factors', 'out', 'attributes', 'from', 'their', 'accompanying', 'objects', 'and', 'also', 'benefits', 'from', 'novel', 'regularizers', 'expressing', 'attribute', 'operators', 'effects', 'eg', 'blunt', 'should', 'undo', 'the', 'effects', 'of', 'sharp', 'not', 'only', 'does', 'our', 'approach', 'align', 'conceptually', 'with', 'the', 'linguistic', 'role', 'of', 'attributes', 'as', 'modifiers', 'but', 'it', 'also', 'generalizes', 'to', 'recognize', 'unseen', 'compositions', 'of', 'objects', 'and', 'attributes', 'we', 'validate', 'our', 'approach', 'on', 'two', 'challenging', 'datasets', 'and', 'demonstrate', 'significant', 'improvements', 'over', 'the', 'stateoftheart', 'in', 'addition', 'we', 'show', 'that', 'not', 'only', 'can', 'our', 'model', 'recognize', 'unseen', 'compositions', 'robustly', 'in', 'an', 'openworld', 'setting', 'it', 'can', 'also', 'generalize', 'to', 'compositions', 'where', 'objects', 'themselves', 'were', 'unseen', 'during', 'training']]
|
[-0.007802655228361901, 0.061579864133980464, -0.10148016549905556, 0.09375636255717837, -0.17412382704981913, -0.1486753522263219, 0.06135642990832114, 0.4521639951608247, -0.2797776627561284, -0.3815022234597968, 0.03845952927755813, -0.2889032034876032, -0.21728500672486714, 0.1744369838076333, -0.17118415586236452, 0.008747230759925312, 0.08946516855568108, 0.04639130918464313, -0.08271635401114408, -0.269311114307493, 0.3244227839963666, 0.004038823313183255, 0.2645189962298092, 0.003722684614412073, 0.09925685208808217, -0.03741515714662253, -0.029657413845416158, 0.023790086725623244, -0.013952180906603138, 0.14466259893120473, 0.3182249308227458, 0.17913573551146936, 0.2629478247784492, -0.39850641933994163, -0.2632368026003759, 0.08649956888208786, 0.1401361244634447, 0.10442138850024398, -0.011246493430937537, -0.3528197118184633, 0.07443158837979556, -0.1763101400471189, -0.02073860217610167, -0.16919381223690128, 0.002229970471105642, -0.013783296943357629, -0.26171312055860957, 0.044213711784525205, 0.1311134522444465, 0.042684866733745566, -0.10208935505425971, -0.12956635606242345, -0.007713636709377169, 0.19395609185465015, 0.053412605634528314, -0.016195900017111044, 0.13541067894030775, -0.17178491551118594, -0.12486556089230968, 0.3970078373250241, -0.02031537373744262, -0.22191272096760156, 0.26350819537959375, -0.07098486293883373, -0.15705068848199313, 0.07310097481951945, 0.21564081272938185, 0.17447254548638336, -0.17251845994978793, -0.012395299379649158, -0.07105621616356075, 0.18131707661733446, 0.06133532548168053, 0.028651200560852887, 0.22487370980800025, 0.15913192766278775, -0.003867550941908525, 0.1646836974913539, -0.09095779440960744, -0.04415789694887483, -0.23887192020192743, -0.11270179760694089, -0.14224407746353082, -0.034283786096138, -0.07952634776245557, -0.14638818671099013, 0.35260178500579464, 0.274101967869016, 0.2685656727369254, 0.06118850011779513, 0.31448864546707933, -0.000823406071221042, 0.16566316256325486, 0.06371661611418757, 0.16459553721878264, -0.014826898794207307, 0.09106707131658266, -0.12375948779517784, 0.1593403352980709, 0.03643158951854275]
|
1,803.09852
|
Index Estimate of Self-Shrinkers in $\mathbb{R}^3$ with Asymptotically
Conical Ends
|
We construct Gaussian Harmonic forms of finite Gaussian weighted $L^2$-norm
on non-compact surfaces that detect each asymptotically conical end. As an
application we prove an extension of the index estimates of self-shrinkers in
$[11]$ under the existence of such ends. We show that the Morse index of a
self-shrinker is greater or equal to $\frac{2g+r-1}{3}$, where $r$ is the
number of asymptotically conical ends.
|
math.DG
|
we construct gaussian harmonic forms of finite gaussian weighted l2norm on noncompact surfaces that detect each asymptotically conical end as an application we prove an extension of the index estimates of selfshrinkers in 11 under the existence of such ends we show that the morse index of a selfshrinker is greater or equal to frac2gr13 where r is the number of asymptotically conical ends
|
[['we', 'construct', 'gaussian', 'harmonic', 'forms', 'of', 'finite', 'gaussian', 'weighted', 'l2norm', 'on', 'noncompact', 'surfaces', 'that', 'detect', 'each', 'asymptotically', 'conical', 'end', 'as', 'an', 'application', 'we', 'prove', 'an', 'extension', 'of', 'the', 'index', 'estimates', 'of', 'selfshrinkers', 'in', '11', 'under', 'the', 'existence', 'of', 'such', 'ends', 'we', 'show', 'that', 'the', 'morse', 'index', 'of', 'a', 'selfshrinker', 'is', 'greater', 'or', 'equal', 'to', 'frac2gr13', 'where', 'r', 'is', 'the', 'number', 'of', 'asymptotically', 'conical', 'ends']]
|
[-0.1711476456105066, 0.12069464598769425, -0.11124433219314568, 0.08061747866800971, -0.03126450492778704, -0.15238340946269177, -0.03247533768178925, 0.3963767056841226, -0.19869754430911843, -0.18482433365924017, 0.14471108167587468, -0.29948043710892164, -0.1539361112758458, 0.17058138340519416, -0.14283834967303963, -0.0032203690045409733, 0.0012522654105273504, 0.1350372041250387, -0.07432597665308369, -0.25461969684277264, 0.3543366083490943, -0.032119515980224285, 0.23600877163606504, 0.06431383324975502, 0.07456475485944086, 0.00015356804203567288, 0.012766465256434111, 0.025009429614458765, -0.2005402231157022, 0.13645601423368567, 0.19341548348939608, 0.05119852657385525, 0.2927513849877176, -0.371413501083023, -0.21410157670459104, 0.21338427877229166, 0.13547318733282507, 0.01223088728655721, -0.04722550812007357, -0.2082989282669529, 0.1492460315071401, -0.12458829683739514, -0.2754713133982723, -0.004489535439966453, -0.011009039830357309, 0.037806311651827795, -0.26039620414967574, 0.03921041401132705, 0.10614645160320732, 0.06817091964480895, -0.09349469574434417, -0.08265052177011967, -0.07033677584683848, 0.0823832592771699, 0.04924025646750889, 0.011442346705330743, 0.05819950603865205, -0.05478633623865862, -0.11029027451184534, 0.29879228297680144, -0.1669544738140844, -0.27698859439364504, 0.12930110465764763, -0.12939017929048055, -0.08887126175538888, 0.11512972155792846, 0.1573562878110106, 0.1625579312621128, -0.029734774817904784, 0.13199703324408757, -0.05160055336143289, 0.15954298568919065, 0.16183401283527177, -0.03414670114834157, 0.14016968390667842, 0.09383620422274347, 0.21836872032976576, 0.22336406633257866, -0.08106913178464369, -0.08093264873420435, -0.40683121642186526, -0.22051995490781134, -0.2212155775595752, 0.14825953037611075, -0.16036766689891616, -0.2762452501744505, 0.3621001040178632, 0.024122018544446854, 0.19468367812297646, 0.1293521374020548, 0.23671575281251636, 0.08531385556506436, -0.02344039509752913, 0.14431216453926432, 0.16958124977019098, 0.17065529642064894, -0.051914568007406264, -0.10715474995474021, -0.07117364496465713, 0.1333953000398146]
|
1,803.09853
|
Generative Design in Minecraft (GDMC), Settlement Generation Competition
|
This paper introduces the settlement generation competition for Minecraft,
the first part of the Generative Design in Minecraft challenge. The settlement
generation competition is about creating Artificial Intelligence (AI) agents
that can produce functional, aesthetically appealing and believable settlements
adapted to a given Minecraft map - ideally at a level that can compete with
human created designs. The aim of the competition is to advance procedural
content generation for games, especially in overcoming the challenges of
adaptive and holistic PCG. The paper introduces the technical details of the
challenge, but mostly focuses on what challenges this competition provides and
why they are scientifically relevant.
|
cs.AI cs.CY
|
this paper introduces the settlement generation competition for minecraft the first part of the generative design in minecraft challenge the settlement generation competition is about creating artificial intelligence ai agents that can produce functional aesthetically appealing and believable settlements adapted to a given minecraft map ideally at a level that can compete with human created designs the aim of the competition is to advance procedural content generation for games especially in overcoming the challenges of adaptive and holistic pcg the paper introduces the technical details of the challenge but mostly focuses on what challenges this competition provides and why they are scientifically relevant
|
[['this', 'paper', 'introduces', 'the', 'settlement', 'generation', 'competition', 'for', 'minecraft', 'the', 'first', 'part', 'of', 'the', 'generative', 'design', 'in', 'minecraft', 'challenge', 'the', 'settlement', 'generation', 'competition', 'is', 'about', 'creating', 'artificial', 'intelligence', 'ai', 'agents', 'that', 'can', 'produce', 'functional', 'aesthetically', 'appealing', 'and', 'believable', 'settlements', 'adapted', 'to', 'a', 'given', 'minecraft', 'map', 'ideally', 'at', 'a', 'level', 'that', 'can', 'compete', 'with', 'human', 'created', 'designs', 'the', 'aim', 'of', 'the', 'competition', 'is', 'to', 'advance', 'procedural', 'content', 'generation', 'for', 'games', 'especially', 'in', 'overcoming', 'the', 'challenges', 'of', 'adaptive', 'and', 'holistic', 'pcg', 'the', 'paper', 'introduces', 'the', 'technical', 'details', 'of', 'the', 'challenge', 'but', 'mostly', 'focuses', 'on', 'what', 'challenges', 'this', 'competition', 'provides', 'and', 'why', 'they', 'are', 'scientifically', 'relevant']]
|
[-0.10619462760463719, 0.0955499745453301, -0.059057771449782026, 0.09670021375912485, -0.1575191409792751, -0.14005888119798823, 0.023122653430689453, 0.35317845241103357, -0.2759360113334887, -0.3612806041119168, 0.09297932843560154, -0.2655875587528481, -0.23053506965685672, 0.14399364197319284, -0.1813871546024547, 0.0049809166863198995, 0.0763951174064892, -0.037640253916039194, 0.06395577469917503, -0.2631728510254795, 0.3264045838845297, 0.07127401431190591, 0.3310664517090665, 0.07148751723625273, 0.12025209484413917, -0.04004605901111098, -0.0467799680727959, -0.0285847267877419, -0.065596716992305, 0.23131517854686465, 0.3594307990979801, 0.19764473683933176, 0.3972742226951331, -0.46004946616442094, -0.15787673654324078, 0.05645406509306535, 0.11772522875514713, 0.10562591664312244, -0.09880163444282976, -0.2805637796725897, 0.049662860287850705, -0.15986239623947485, -0.07473627742390077, -0.0832282478570174, -0.01642977285822763, -0.01958311171455031, -0.2566103380969138, -0.01591119458627643, 0.08759979568241001, 0.07935260191053442, -0.03561411581219183, -0.12387742002684514, 0.03737132030186578, 0.21792602051022344, 0.011537781360477787, 0.031851918840367185, 0.11275316660746805, -0.20682376379472683, -0.14289436542691247, 0.4525406015946448, -0.0006126560150980226, -0.17562350927336703, 0.21493131570174423, -0.055662991872364745, -0.15503269479637152, 0.028042538706394074, 0.19528906465987267, 0.06692167986365198, -0.16645924406560156, 0.022426454005062182, 0.03861868714696719, 0.17089325679665052, 0.03924506350343559, -0.02924008247017571, 0.2625463127601639, 0.27923088482789044, 0.092731065311225, 0.11308204781182689, -0.031908768314555414, -0.1503695542200749, -0.24422394762774116, -0.12190599293330485, -0.14720676694002038, -0.01553902388844205, -0.000634395679740407, -0.1359235169416863, 0.39540775475607626, 0.24863693651571436, 0.10935422115353416, 0.030537947270910717, 0.3389367980755938, 0.031740390574412636, 0.05692982193968684, 0.02889034120384061, 0.17630472247945417, -0.043595377681324786, 0.18751096552762303, -0.17082477231211599, 0.18277797580344005, 0.012434300182170226]
|
1,803.09854
|
An Efficient and Accurate Hybrid Method for Simulating Non-Linear
Neutrino Structure
|
We present an efficient and accurate method for simulating massive neutrinos
in cosmological structure formation simulations, together with an easy to use
public implementation. Our method builds on our earlier implementation of the
linear response approximation (LRA) for neutrinos, coupled with an N-body code
for cold dark matter particles. The LRA's good behaviour at early times and in
the linear regime is preserved, while better following the non-linear
clustering of neutrinos on small scales. Massive neutrinos are split into
initially "fast" and "slow" components. The fast component is followed
analytically with the LRA all the way to redshift zero. The slow component is
evolved with the LRA only down to a switch-on redshift $z_\nu = 1$, below which
it is followed with the particle method, in order to fully account for its
non-linear evolution. The slow neutrino particles are initialized at $z = 99$
in order to have accurate positions and velocities at the switch-on time, but
are not used to compute the potential until $z \leq 1$, thus avoiding the worst
effect of particle shot noise. We show that our hybrid method matches (and for
small neutrino masses, exceeds) the accuracy of neutrino particle simulations
with substantially lower particle load requirements.
|
astro-ph.CO
|
we present an efficient and accurate method for simulating massive neutrinos in cosmological structure formation simulations together with an easy to use public implementation our method builds on our earlier implementation of the linear response approximation lra for neutrinos coupled with an nbody code for cold dark matter particles the lras good behaviour at early times and in the linear regime is preserved while better following the nonlinear clustering of neutrinos on small scales massive neutrinos are split into initially fast and slow components the fast component is followed analytically with the lra all the way to redshift zero the slow component is evolved with the lra only down to a switchon redshift z_nu 1 below which it is followed with the particle method in order to fully account for its nonlinear evolution the slow neutrino particles are initialized at z 99 in order to have accurate positions and velocities at the switchon time but are not used to compute the potential until z leq 1 thus avoiding the worst effect of particle shot noise we show that our hybrid method matches and for small neutrino masses exceeds the accuracy of neutrino particle simulations with substantially lower particle load requirements
|
[['we', 'present', 'an', 'efficient', 'and', 'accurate', 'method', 'for', 'simulating', 'massive', 'neutrinos', 'in', 'cosmological', 'structure', 'formation', 'simulations', 'together', 'with', 'an', 'easy', 'to', 'use', 'public', 'implementation', 'our', 'method', 'builds', 'on', 'our', 'earlier', 'implementation', 'of', 'the', 'linear', 'response', 'approximation', 'lra', 'for', 'neutrinos', 'coupled', 'with', 'an', 'nbody', 'code', 'for', 'cold', 'dark', 'matter', 'particles', 'the', 'lras', 'good', 'behaviour', 'at', 'early', 'times', 'and', 'in', 'the', 'linear', 'regime', 'is', 'preserved', 'while', 'better', 'following', 'the', 'nonlinear', 'clustering', 'of', 'neutrinos', 'on', 'small', 'scales', 'massive', 'neutrinos', 'are', 'split', 'into', 'initially', 'fast', 'and', 'slow', 'components', 'the', 'fast', 'component', 'is', 'followed', 'analytically', 'with', 'the', 'lra', 'all', 'the', 'way', 'to', 'redshift', 'zero', 'the', 'slow', 'component', 'is', 'evolved', 'with', 'the', 'lra', 'only', 'down', 'to', 'a', 'switchon', 'redshift', 'z_nu', '1', 'below', 'which', 'it', 'is', 'followed', 'with', 'the', 'particle', 'method', 'in', 'order', 'to', 'fully', 'account', 'for', 'its', 'nonlinear', 'evolution', 'the', 'slow', 'neutrino', 'particles', 'are', 'initialized', 'at', 'z', '99', 'in', 'order', 'to', 'have', 'accurate', 'positions', 'and', 'velocities', 'at', 'the', 'switchon', 'time', 'but', 'are', 'not', 'used', 'to', 'compute', 'the', 'potential', 'until', 'z', 'leq', '1', 'thus', 'avoiding', 'the', 'worst', 'effect', 'of', 'particle', 'shot', 'noise', 'we', 'show', 'that', 'our', 'hybrid', 'method', 'matches', 'and', 'for', 'small', 'neutrino', 'masses', 'exceeds', 'the', 'accuracy', 'of', 'neutrino', 'particle', 'simulations', 'with', 'substantially', 'lower', 'particle', 'load', 'requirements']]
|
[-0.0781843539082911, 0.17708284283602552, -0.06166628463426605, 0.07998311054616351, -0.052101303262170405, -0.14441859616898, 0.013556742602959275, 0.3925389512674883, -0.22291134003084154, -0.3316310653323308, 0.07089366367436015, -0.2674205771688139, -0.03290512634674087, 0.1956520571024157, 0.03939689786173403, 0.03388709228456719, 0.07861885288963094, -0.0007479479644098319, -0.04847367048016167, -0.29123829076823315, 0.24552292210049928, 0.1328388932812959, 0.22608301459928043, -0.014460217290907167, 0.13514632698148488, -0.03446403556969017, -0.041478307072538884, -0.03421471508219838, -0.09602078018844623, 0.013973834509961307, 0.1918167855963111, 0.09325104133691639, 0.24097705129301175, -0.42874245745129885, -0.18760393523727545, 0.09713416863465682, 0.1792563758837059, 0.1432260420738021, -0.06886263311142102, -0.2527267208928242, 0.10812987400917336, -0.16665783112752253, -0.1590901581570506, -0.06060150105739012, 0.0013037292822264135, 0.008476828055281658, -0.2879900333847036, 0.13270083620445802, 0.014056480575818568, -0.029962908367160708, -0.0204770920885494, -0.11302710871212185, 0.009194335226202383, 0.08773948542424477, 0.06062701710330657, 0.03255326251732185, 0.12887300387083087, -0.134131105261622, -0.03269439099589363, 0.39630137117928826, -0.09371611757727806, -0.1513716083986219, 0.2116759720398113, -0.14650210407795383, -0.11721271632821299, 0.18422951358603312, 0.18155225165537558, 0.10210604884196073, -0.12123889557580697, 0.054488690689613574, 0.02912812824550201, 0.19824825707997662, 0.020802474988158792, 0.004063121859799139, 0.22753784978529437, 0.2068592395586893, 0.08407211019857641, 0.03284541718719993, -0.10599531813291833, -0.07127861281274818, -0.2724921966146212, -0.1104685603910184, -0.15556147583120036, 0.021985838123437133, -0.09963072921811544, -0.12552013904321938, 0.3931419620476663, 0.15309977455297485, 0.18963487395783887, 0.10682766740734223, 0.34976964063942434, 0.11353185884829145, 0.046625304222106936, 0.12296552568790503, 0.261201816261746, 0.11748562284046785, 0.0864952399150934, -0.247218090610113, 0.018720073429867624, 0.046017626527464016]
|
1,803.09855
|
Tunable topological Nernst effect in 2D transition metal dichalcogenides
|
Two dimensional semiconducting transition metal dichalcogenides (TMDs)
exhibit an intrinsic Ising spin orbit coupling (SOC) along with a valley
contrasting Berry curvature, which can generate a purely anomalous spin and
valley Nernst signal driven by a thermal gradient. We show that a small
Bychkov-Rashba coupling, which is present in gated TMDs, can enhance the valley
Nernst signal by at least 1-2 orders of magnitude. We find that the Nernst
signal in these materials is dominated by the anomalous geometrical
contribution, and the conventional contribution is much weaker. Importantly,
the Nernst signal is also highly tunable by external gating. Although the total
Nernst signal vanishes due to time reversal (TR) symmetry, a small magnetic
coupling lifts the valley degeneracy and generates an amplified Nernst
response. Additionally, we also discuss the Nernst response of bilayer TMDs,
and show a similar enhancement and modulation of the Nernst signal due to
Rashba SOC. Our predictions are highly pertinent to ongoing experimental
studies in TMDs. The generated large anomalous Nernst signal can directly probe
the presence of a large Berry curvature in these materials, and may serve as a
promising tunable platform for caloritronics applications.
|
cond-mat.mes-hall
|
two dimensional semiconducting transition metal dichalcogenides tmds exhibit an intrinsic ising spin orbit coupling soc along with a valley contrasting berry curvature which can generate a purely anomalous spin and valley nernst signal driven by a thermal gradient we show that a small bychkovrashba coupling which is present in gated tmds can enhance the valley nernst signal by at least 12 orders of magnitude we find that the nernst signal in these materials is dominated by the anomalous geometrical contribution and the conventional contribution is much weaker importantly the nernst signal is also highly tunable by external gating although the total nernst signal vanishes due to time reversal tr symmetry a small magnetic coupling lifts the valley degeneracy and generates an amplified nernst response additionally we also discuss the nernst response of bilayer tmds and show a similar enhancement and modulation of the nernst signal due to rashba soc our predictions are highly pertinent to ongoing experimental studies in tmds the generated large anomalous nernst signal can directly probe the presence of a large berry curvature in these materials and may serve as a promising tunable platform for caloritronics applications
|
[['two', 'dimensional', 'semiconducting', 'transition', 'metal', 'dichalcogenides', 'tmds', 'exhibit', 'an', 'intrinsic', 'ising', 'spin', 'orbit', 'coupling', 'soc', 'along', 'with', 'a', 'valley', 'contrasting', 'berry', 'curvature', 'which', 'can', 'generate', 'a', 'purely', 'anomalous', 'spin', 'and', 'valley', 'nernst', 'signal', 'driven', 'by', 'a', 'thermal', 'gradient', 'we', 'show', 'that', 'a', 'small', 'bychkovrashba', 'coupling', 'which', 'is', 'present', 'in', 'gated', 'tmds', 'can', 'enhance', 'the', 'valley', 'nernst', 'signal', 'by', 'at', 'least', '12', 'orders', 'of', 'magnitude', 'we', 'find', 'that', 'the', 'nernst', 'signal', 'in', 'these', 'materials', 'is', 'dominated', 'by', 'the', 'anomalous', 'geometrical', 'contribution', 'and', 'the', 'conventional', 'contribution', 'is', 'much', 'weaker', 'importantly', 'the', 'nernst', 'signal', 'is', 'also', 'highly', 'tunable', 'by', 'external', 'gating', 'although', 'the', 'total', 'nernst', 'signal', 'vanishes', 'due', 'to', 'time', 'reversal', 'tr', 'symmetry', 'a', 'small', 'magnetic', 'coupling', 'lifts', 'the', 'valley', 'degeneracy', 'and', 'generates', 'an', 'amplified', 'nernst', 'response', 'additionally', 'we', 'also', 'discuss', 'the', 'nernst', 'response', 'of', 'bilayer', 'tmds', 'and', 'show', 'a', 'similar', 'enhancement', 'and', 'modulation', 'of', 'the', 'nernst', 'signal', 'due', 'to', 'rashba', 'soc', 'our', 'predictions', 'are', 'highly', 'pertinent', 'to', 'ongoing', 'experimental', 'studies', 'in', 'tmds', 'the', 'generated', 'large', 'anomalous', 'nernst', 'signal', 'can', 'directly', 'probe', 'the', 'presence', 'of', 'a', 'large', 'berry', 'curvature', 'in', 'these', 'materials', 'and', 'may', 'serve', 'as', 'a', 'promising', 'tunable', 'platform', 'for', 'caloritronics', 'applications']]
|
[-0.22279699181549642, 0.2132597504442521, -0.022953297920819175, 0.044705149350920695, -0.11355041330680252, -0.16214214174665117, 0.04285370521124845, 0.38192454451008845, -0.2906829645391554, -0.259465721612306, 0.013122227699740937, -0.3236920083627889, -0.22540680098371874, 0.20947075692054473, 0.01629400173398225, -0.024863226655380505, -0.07961267992167881, -0.10710508079807225, -0.08075997212068423, -0.16936837951591435, 0.24949333335420018, 0.011435847719641108, 0.3578901788195301, 0.10833197001147231, 0.059686497059699736, -0.02189298196646728, 0.05578099997640636, 0.03189915703658603, -0.06558159235780629, 0.030865436275244542, 0.24970472280156653, -0.16348473208061862, 0.15904001036756918, -0.3933045240094591, -0.1890454807661866, 0.040808029777958596, 0.11376461179338787, 0.1844920680453805, -0.127294317382927, -0.2951850910622038, 0.04580780974662814, -0.16889839109560278, -0.07677066458364655, -0.13365582493746556, 0.023934400135553195, -0.06707888424096285, -0.2710538476999653, 0.11642128653475084, 0.0825005933323777, 0.03501496467843505, -0.028708002805758855, -0.15130083476450587, -0.09700533693876902, 0.037105591924812054, 0.08595518528140689, 0.07367251279861911, 0.182778086134012, -0.17045940447397268, -0.16505425978991153, 0.3329356925365956, -0.1315361619779938, -0.13629888274314764, 0.14901538013578638, -0.2160588691648292, -0.06235938392162911, 0.15685893754523836, 0.1801456352009585, 0.06815798366687408, -0.13735243799900146, 0.0670491333811936, 0.013946112442614608, 0.16599332264158875, 0.01091818446783643, 0.11901142605531373, 0.3132663322955762, 0.15821321455296128, 0.07140239433042313, 0.15606666363187527, -0.1471761745805117, 0.00950294880588588, -0.24475234180051636, -0.15990039441538484, -0.25830961896204635, 0.1530267362752439, -0.10072464153467751, -0.154245443981582, 0.43922870248114987, 0.19916581812369832, 0.1807263798386741, -0.0633052060123239, 0.2950488957159809, 0.15726601576469348, 0.12011666682205702, 0.02395186671546023, 0.31322044146394257, 0.17382596443946424, 0.1391429557520161, -0.2952968466071118, 0.0950178086365524, -0.03229896556831112]
|
1,803.09856
|
Fermi/LAT observations of Lobe-dominant Radio Galaxy 3C 207 and Possible
Radiation Region of the Gamma-Rays
|
3C 207 is a lobe-dominant radio galaxy with one sided jet and the bright
knots in kpc-Mpc scale were resolved in the radio, optical and X-ray bands. It
was confirmed as a gamma-ray emitter with Fermi/LAT, but it is uncertain
whether the gamma-ray emission region is the core or knots due to the low
spatial resolution of Fermi/LAT. We present an analysis of its Fermi/LAT data
in the past 9 years. Different from the radio and optical emission from the
core, it is found that the gamma-ray emission is steady without detection of
flux variation over 2 sigma confidence level. This likely implies that the
gamma-ray emission is from its knots. We collect the radio, optical, and X-ray
data of knot-A, the closest knot from the core at 1 arcsec, and compile its
spectral energy distribution (SED). Although the single-zone
synchrotron+SSC+IC/CMB model by assuming knot-A at rest can reproduce the SED
in the radio-optical-X-ray band, the predicted gamma-ray flux is lower than the
LAT observations and the derived magnetic field strength deviates the
equipartition condition with 3 orders of magnitude. Assuming that knot-A is
relativistically moving, its SED from radio to gamma-ray bands would be well
represented with the single-zone synchrotron+SSC+IC/CMB model under the
equipartition condition. These results likely suggest that the gamma-ray
emission may be from knot-A via the IC/CMB process and the knot should have
relativistical motion. The jet power derived from our model parameters is also
roughly consistent with the kinetic power estimated with the radio data.
|
astro-ph.HE
|
3c 207 is a lobedominant radio galaxy with one sided jet and the bright knots in kpcmpc scale were resolved in the radio optical and xray bands it was confirmed as a gammaray emitter with fermilat but it is uncertain whether the gammaray emission region is the core or knots due to the low spatial resolution of fermilat we present an analysis of its fermilat data in the past 9 years different from the radio and optical emission from the core it is found that the gammaray emission is steady without detection of flux variation over 2 sigma confidence level this likely implies that the gammaray emission is from its knots we collect the radio optical and xray data of knota the closest knot from the core at 1 arcsec and compile its spectral energy distribution sed although the singlezone synchrotronssciccmb model by assuming knota at rest can reproduce the sed in the radioopticalxray band the predicted gammaray flux is lower than the lat observations and the derived magnetic field strength deviates the equipartition condition with 3 orders of magnitude assuming that knota is relativistically moving its sed from radio to gammaray bands would be well represented with the singlezone synchrotronssciccmb model under the equipartition condition these results likely suggest that the gammaray emission may be from knota via the iccmb process and the knot should have relativistical motion the jet power derived from our model parameters is also roughly consistent with the kinetic power estimated with the radio data
|
[['3c', '207', 'is', 'a', 'lobedominant', 'radio', 'galaxy', 'with', 'one', 'sided', 'jet', 'and', 'the', 'bright', 'knots', 'in', 'kpcmpc', 'scale', 'were', 'resolved', 'in', 'the', 'radio', 'optical', 'and', 'xray', 'bands', 'it', 'was', 'confirmed', 'as', 'a', 'gammaray', 'emitter', 'with', 'fermilat', 'but', 'it', 'is', 'uncertain', 'whether', 'the', 'gammaray', 'emission', 'region', 'is', 'the', 'core', 'or', 'knots', 'due', 'to', 'the', 'low', 'spatial', 'resolution', 'of', 'fermilat', 'we', 'present', 'an', 'analysis', 'of', 'its', 'fermilat', 'data', 'in', 'the', 'past', '9', 'years', 'different', 'from', 'the', 'radio', 'and', 'optical', 'emission', 'from', 'the', 'core', 'it', 'is', 'found', 'that', 'the', 'gammaray', 'emission', 'is', 'steady', 'without', 'detection', 'of', 'flux', 'variation', 'over', '2', 'sigma', 'confidence', 'level', 'this', 'likely', 'implies', 'that', 'the', 'gammaray', 'emission', 'is', 'from', 'its', 'knots', 'we', 'collect', 'the', 'radio', 'optical', 'and', 'xray', 'data', 'of', 'knota', 'the', 'closest', 'knot', 'from', 'the', 'core', 'at', '1', 'arcsec', 'and', 'compile', 'its', 'spectral', 'energy', 'distribution', 'sed', 'although', 'the', 'singlezone', 'synchrotronssciccmb', 'model', 'by', 'assuming', 'knota', 'at', 'rest', 'can', 'reproduce', 'the', 'sed', 'in', 'the', 'radioopticalxray', 'band', 'the', 'predicted', 'gammaray', 'flux', 'is', 'lower', 'than', 'the', 'lat', 'observations', 'and', 'the', 'derived', 'magnetic', 'field', 'strength', 'deviates', 'the', 'equipartition', 'condition', 'with', '3', 'orders', 'of', 'magnitude', 'assuming', 'that', 'knota', 'is', 'relativistically', 'moving', 'its', 'sed', 'from', 'radio', 'to', 'gammaray', 'bands', 'would', 'be', 'well', 'represented', 'with', 'the', 'singlezone', 'synchrotronssciccmb', 'model', 'under', 'the', 'equipartition', 'condition', 'these', 'results', 'likely', 'suggest', 'that', 'the', 'gammaray', 'emission', 'may', 'be', 'from', 'knota', 'via', 'the', 'iccmb', 'process', 'and', 'the', 'knot', 'should', 'have', 'relativistical', 'motion', 'the', 'jet', 'power', 'derived', 'from', 'our', 'model', 'parameters', 'is', 'also', 'roughly', 'consistent', 'with', 'the', 'kinetic', 'power', 'estimated', 'with', 'the', 'radio', 'data']]
|
[-0.04644164767701224, 0.10644783475016276, -0.07953920063744413, 0.1270908188703177, -0.10904582847019552, -0.1038273455171914, 0.02776566670951528, 0.47931650956350613, -0.21621308578519013, -0.3651829665655467, 0.06829260414791846, -0.2919888346024403, 0.009766386762327406, 0.21213067878663305, 0.0076813934023285705, -0.03876955105380791, 0.057876070957570296, -0.051310281142425855, -0.009726099806224428, -0.16295328158393077, 0.284764352883023, 0.14576085591385882, 0.22566692087405582, 0.03478072159892261, 0.0693722280150287, -0.0898778596779377, -0.05546663085195592, -0.03973784718314201, -0.06262110430821569, 0.07428011245366822, 0.19438582117010544, 0.10258397864645377, 0.13209943653546213, -0.3486877467665004, -0.2628814572860237, 0.09079400333765197, 0.1484842039985446, -0.012192873867243771, 0.025451549079588128, -0.30209515069808235, 0.06265173078021527, -0.2031131352759837, -0.15906106480170132, 0.09821941063794254, 0.0235299500300761, 0.046209841027734726, -0.18503353151216406, 0.1167672238381517, -0.009945834761606605, 0.05547315402456173, -0.13500868284987755, -0.0625523171440615, -0.05931193172568228, 0.06245050354902368, 0.08088682194056304, 0.0857694413371212, 0.1503709480620739, -0.13203961988229576, -0.1141416186190445, 0.4049690170194651, -0.03593158503343414, -0.017471666994875644, 0.1853402396645094, -0.2175064531620592, -0.18082640158406238, 0.23914935218162714, 0.0771176447633775, 0.05811672151747455, -0.13485283968682454, 0.023147462855251242, -0.04999871089831146, 0.23685600400364737, 0.02182899169033257, 0.028401904988419206, 0.27857564951527897, 0.11315217818421258, 0.036937014969270224, 0.14225804886394522, -0.29097321514055374, 0.017008424191394957, -0.2960646558870993, -0.0503954674037764, -0.19595011922992706, 0.1237382233399345, -0.09862062579539758, -0.08207391564378409, 0.4052234735506458, 0.08555964728281644, 0.18333600893166158, 0.07281675752312915, 0.3317935197799641, 0.14307849622725288, 0.08523718209722958, 0.17917384812986947, 0.3572041836124277, 0.12064118232441748, 0.09766560397442142, -0.16534671780172494, 0.05795821986952418, -0.022775576275780918]
|
1,803.09857
|
Direct photon production at low transverse momentum in proton-proton
collisions at $\sqrt{s}$ = 2.76 and 8 TeV
|
Measurements of inclusive and direct photon production at mid-rapidity in pp
collisions at $\sqrt{s}=2.76$ and 8 TeV are presented by the ALICE experiment
at the LHC. The results are reported in transverse momentum ranges of
$0.4<p_{T}<10$ GeV/$c$ and $0.3<p_{T}<16$ GeV/$c$, respectively. Photons are
detected with the electromagnetic calorimeter~(EMCal) and via reconstruction of
e$^+$e$^-$ pairs from conversions in the ALICE detector material using the
central tracking system. For the final measurement of the inclusive photon
spectra the results are combined in the overlapping $p_{T}$ interval of both
methods. Direct photon spectra, or their upper limits at 90% C.L. are extracted
using the direct photon excess ratio $R_{\gamma}$, which quantifies the ratio
of inclusive photons over decay photons generated with a decay-photon
simulation. An additional hybrid method, combining photons reconstructed from
conversions with those identified in the EMCal, is used for the combination of
the direct photon excess ratio $R_{\gamma}$, as well as the extraction of
direct photon spectra or their upper limits. While no significant signal of
direct photons is seen over the full $p_{T}$ range, $R_{\gamma}$ for $p_{T}>7$
GeV/$c$ is at least one $\sigma$ above unity and consistent with expectations
from next-to-leading order pQCD calculations.
|
nucl-ex hep-ex
|
measurements of inclusive and direct photon production at midrapidity in pp collisions at sqrts276 and 8 tev are presented by the alice experiment at the lhc the results are reported in transverse momentum ranges of 04p_t10 gevc and 03p_t16 gevc respectively photons are detected with the electromagnetic calorimeteremcal and via reconstruction of ee pairs from conversions in the alice detector material using the central tracking system for the final measurement of the inclusive photon spectra the results are combined in the overlapping p_t interval of both methods direct photon spectra or their upper limits at 90 cl are extracted using the direct photon excess ratio r_gamma which quantifies the ratio of inclusive photons over decay photons generated with a decayphoton simulation an additional hybrid method combining photons reconstructed from conversions with those identified in the emcal is used for the combination of the direct photon excess ratio r_gamma as well as the extraction of direct photon spectra or their upper limits while no significant signal of direct photons is seen over the full p_t range r_gamma for p_t7 gevc is at least one sigma above unity and consistent with expectations from nexttoleading order pqcd calculations
|
[['measurements', 'of', 'inclusive', 'and', 'direct', 'photon', 'production', 'at', 'midrapidity', 'in', 'pp', 'collisions', 'at', 'sqrts276', 'and', '8', 'tev', 'are', 'presented', 'by', 'the', 'alice', 'experiment', 'at', 'the', 'lhc', 'the', 'results', 'are', 'reported', 'in', 'transverse', 'momentum', 'ranges', 'of', '04p_t10', 'gevc', 'and', '03p_t16', 'gevc', 'respectively', 'photons', 'are', 'detected', 'with', 'the', 'electromagnetic', 'calorimeteremcal', 'and', 'via', 'reconstruction', 'of', 'ee', 'pairs', 'from', 'conversions', 'in', 'the', 'alice', 'detector', 'material', 'using', 'the', 'central', 'tracking', 'system', 'for', 'the', 'final', 'measurement', 'of', 'the', 'inclusive', 'photon', 'spectra', 'the', 'results', 'are', 'combined', 'in', 'the', 'overlapping', 'p_t', 'interval', 'of', 'both', 'methods', 'direct', 'photon', 'spectra', 'or', 'their', 'upper', 'limits', 'at', '90', 'cl', 'are', 'extracted', 'using', 'the', 'direct', 'photon', 'excess', 'ratio', 'r_gamma', 'which', 'quantifies', 'the', 'ratio', 'of', 'inclusive', 'photons', 'over', 'decay', 'photons', 'generated', 'with', 'a', 'decayphoton', 'simulation', 'an', 'additional', 'hybrid', 'method', 'combining', 'photons', 'reconstructed', 'from', 'conversions', 'with', 'those', 'identified', 'in', 'the', 'emcal', 'is', 'used', 'for', 'the', 'combination', 'of', 'the', 'direct', 'photon', 'excess', 'ratio', 'r_gamma', 'as', 'well', 'as', 'the', 'extraction', 'of', 'direct', 'photon', 'spectra', 'or', 'their', 'upper', 'limits', 'while', 'no', 'significant', 'signal', 'of', 'direct', 'photons', 'is', 'seen', 'over', 'the', 'full', 'p_t', 'range', 'r_gamma', 'for', 'p_t7', 'gevc', 'is', 'at', 'least', 'one', 'sigma', 'above', 'unity', 'and', 'consistent', 'with', 'expectations', 'from', 'nexttoleading', 'order', 'pqcd', 'calculations']]
|
[-0.05131002211802345, 0.19768691815896952, -0.08102508204204864, 0.07708851825461208, 0.03487263784106625, -0.09640055841913349, 0.013442002442714415, 0.37437234366386146, -0.1925343687891176, -0.3600108602133236, -0.021147606467313475, -0.4132961926246552, 0.12202458799277481, 0.22340569357743095, 0.08472263059627853, 0.09410005207479882, 0.13572359157137964, 0.005013415926920348, -0.04190128340422617, -0.15130775116482062, 0.24298353167005668, 0.13470630633865335, 0.23622249846199625, 0.11344120396488028, 0.11892854524531254, 0.08123044377333778, -0.0994256706819502, -0.037011907551143516, -0.11458374206957064, 0.060271233898177005, 0.27451584948177793, 0.06111451825739718, 0.10241169576337071, -0.3137009973980879, -0.10527304738367858, 0.13430941707797742, 0.16141410855159752, 0.03558440050661662, -0.06063118652489625, -0.2833972812826304, 0.12947439446457124, -0.219152127020061, -0.04039909962417656, 0.0193010659251166, -0.04446339909918606, 0.0003329956802956172, -0.2982952826337791, 0.1488223339185903, -0.022775407757389506, 0.06553914870474775, 0.006432382752628703, -0.17719295194654383, -0.07329346433796577, 0.04321123089543299, 0.06357410192354827, 0.053886419390083144, 0.18397250006428773, -0.15754434743859363, -0.20892463443482195, 0.34291688917743923, -0.04835132736602406, -0.1260629729637386, 0.181209987779393, -0.2411118758131603, -0.08160285884759536, 0.25090649987717994, 0.20293552906522036, 0.09434130836008607, -0.15215295600998952, 0.049024828660338624, -0.00366043096812638, 0.20763484028682702, 0.09149094491853918, 0.11397218403014306, 0.18095632276350732, 0.15063169645635704, -0.014104742136489797, 0.07612107584779886, -0.15165462756750026, -0.02479048669583311, -0.4126628248351871, -0.12107668210703292, -0.13737646818810487, 0.04757388410109439, -0.08621590102725589, -0.01116982332283729, 0.33317701275411404, 0.07075227312988748, 0.2858593505758204, 0.02312630974307754, 0.36243954180788834, 0.152581506843164, 0.060489302914050455, 0.05324133454429868, 0.36043875675256315, 0.16090033676499796, 0.15576768985116168, -0.17365219599757295, 0.012884874123119516, 0.00697565431289963]
|
1,803.09858
|
Unconditional convergence of a fast two-level linearized algorithm for
semilinear subdiffusion equations
|
A fast two-level linearized scheme with unequal time-steps is constructed and
analyzed for an initial-boundary-value problem of semilinear subdiffusion
equations. The two-level fast L1 formula of the Caputo derivative is derived
based on the sum-of-exponentials technique. The resulting fast algorithm is
computationally efficient in long-time simulations because it significantly
reduces the computational cost $O(MN^2)$ and storage $O(MN)$ for the standard
L1 formula to $O(MN\log N)$ and $O(M\log N)$, respectively, for $M$ grid points
in space and $N$ levels in time. The nonuniform time mesh would be graded to
handle the typical singularity of the solution near the time $t=0$, and Newton
linearization is used to approximate the nonlinearity term. Our analysis relies
on three tools: a new discrete fractional Gr\"{o}nwall inequality, a global
consistency analysis and a discrete $H^2$ energy method. A sharp error estimate
reflecting the regularity of solution is established without any restriction on
the relative diameters of the temporal and spatial mesh sizes. Numerical
examples are provided to demonstrate the effectiveness of our approach and the
sharpness of error analysis.
|
math.NA
|
a fast twolevel linearized scheme with unequal timesteps is constructed and analyzed for an initialboundaryvalue problem of semilinear subdiffusion equations the twolevel fast l1 formula of the caputo derivative is derived based on the sumofexponentials technique the resulting fast algorithm is computationally efficient in longtime simulations because it significantly reduces the computational cost omn2 and storage omn for the standard l1 formula to omnlog n and omlog n respectively for m grid points in space and n levels in time the nonuniform time mesh would be graded to handle the typical singularity of the solution near the time t0 and newton linearization is used to approximate the nonlinearity term our analysis relies on three tools a new discrete fractional gronwall inequality a global consistency analysis and a discrete h2 energy method a sharp error estimate reflecting the regularity of solution is established without any restriction on the relative diameters of the temporal and spatial mesh sizes numerical examples are provided to demonstrate the effectiveness of our approach and the sharpness of error analysis
|
[['a', 'fast', 'twolevel', 'linearized', 'scheme', 'with', 'unequal', 'timesteps', 'is', 'constructed', 'and', 'analyzed', 'for', 'an', 'initialboundaryvalue', 'problem', 'of', 'semilinear', 'subdiffusion', 'equations', 'the', 'twolevel', 'fast', 'l1', 'formula', 'of', 'the', 'caputo', 'derivative', 'is', 'derived', 'based', 'on', 'the', 'sumofexponentials', 'technique', 'the', 'resulting', 'fast', 'algorithm', 'is', 'computationally', 'efficient', 'in', 'longtime', 'simulations', 'because', 'it', 'significantly', 'reduces', 'the', 'computational', 'cost', 'omn2', 'and', 'storage', 'omn', 'for', 'the', 'standard', 'l1', 'formula', 'to', 'omnlog', 'n', 'and', 'omlog', 'n', 'respectively', 'for', 'm', 'grid', 'points', 'in', 'space', 'and', 'n', 'levels', 'in', 'time', 'the', 'nonuniform', 'time', 'mesh', 'would', 'be', 'graded', 'to', 'handle', 'the', 'typical', 'singularity', 'of', 'the', 'solution', 'near', 'the', 'time', 't0', 'and', 'newton', 'linearization', 'is', 'used', 'to', 'approximate', 'the', 'nonlinearity', 'term', 'our', 'analysis', 'relies', 'on', 'three', 'tools', 'a', 'new', 'discrete', 'fractional', 'gronwall', 'inequality', 'a', 'global', 'consistency', 'analysis', 'and', 'a', 'discrete', 'h2', 'energy', 'method', 'a', 'sharp', 'error', 'estimate', 'reflecting', 'the', 'regularity', 'of', 'solution', 'is', 'established', 'without', 'any', 'restriction', 'on', 'the', 'relative', 'diameters', 'of', 'the', 'temporal', 'and', 'spatial', 'mesh', 'sizes', 'numerical', 'examples', 'are', 'provided', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'and', 'the', 'sharpness', 'of', 'error', 'analysis']]
|
[-0.12730190776842995, 0.013464047033235437, -0.07097299186569353, 0.08497283629052922, -0.06453552053476862, -0.1656390718195178, 0.043530725039584786, 0.34279373879248354, -0.2859784011013074, -0.29740389221148683, 0.1449839350413477, -0.24352917018631806, -0.10245360687914751, 0.2053696914993878, -0.07807227260987624, 0.10431862524690408, 0.0803352192547603, 0.011027372151484034, -0.07851885919791587, -0.2519641203033291, 0.26112520272003736, 0.05158922900688011, 0.268265067368229, 0.02169419110704192, 0.12358216577441017, -0.03197926501178242, -0.05358996181856475, -0.006703028399019497, -0.13117720853575005, 0.11326350563547623, 0.20229132150197562, 0.08693333740031206, 0.3070321847722365, -0.43639388103361076, -0.17415398962235865, 0.09367239721673891, 0.13864101742722654, 0.09305228978244728, -0.019760290313528238, -0.28411131378026366, 0.1015994016180687, -0.09779920174358035, -0.16237534818944732, -0.08244833920953117, 0.028858830955826996, 0.04982736309172015, -0.3271870299187257, 0.10252350264036487, 0.0691395432305488, 0.024933682944399516, -0.07311493196293195, -0.09490287066921807, 0.009164168039132232, 0.06161755323208158, 0.023718562125190662, 0.00908883036628387, 0.058208402480413285, -0.05403584981003421, -0.08527499874596177, 0.34027889942093564, -0.06662730056512563, -0.2614916990500353, 0.1559755160457137, -0.10014522023165243, -0.09201800131987285, 0.16857000405690017, 0.15461761457912862, 0.1752507362159432, -0.09871877250234688, 0.14116502970435543, -0.009188518714095126, 0.20722290321194023, 0.0811428377388659, 0.01578883786483552, 0.03939577796889437, 0.1708830640896229, 0.14047520227105803, 0.11446126220637469, -0.09745768234325503, -0.1287583713729279, -0.3155205020105003, -0.1738581561787603, -0.23444094156544937, 0.02206110762905954, -0.19701168018815812, -0.16263770388514664, 0.3531374037993163, 0.12153793906798381, 0.14892809023014728, 0.12503840818710496, 0.31970212304550144, 0.18118774082183278, 0.020814624520804667, 0.10867313482540235, 0.14662525207854032, 0.11015297219997024, 0.12205960142097808, -0.2813287057777237, 0.03801912920565662, 0.18101804764575266]
|
1,803.09859
|
WebSeg: Learning Semantic Segmentation from Web Searches
|
In this paper, we improve semantic segmentation by automatically learning
from Flickr images associated with a particular keyword, without relying on any
explicit user annotations, thus substantially alleviating the dependence on
accurate annotations when compared to previous weakly supervised methods.
To solve such a challenging problem, we leverage several low-level cues (such
as saliency, edges, etc.) to help generate a proxy ground truth. Due to the
diversity of web-crawled images, we anticipate a large amount of 'label noise'
in which other objects might be present. We design an online noise filtering
scheme which is able to deal with this label noise, especially in cluttered
images. We use this filtering strategy as an auxiliary module to help assist
the segmentation network in learning cleaner proxy annotations. Extensive
experiments on the popular PASCAL VOC 2012 semantic segmentation benchmark show
surprising good results in both our WebSeg (mIoU = 57.0%) and weakly supervised
(mIoU = 63.3%) settings.
|
cs.CV
|
in this paper we improve semantic segmentation by automatically learning from flickr images associated with a particular keyword without relying on any explicit user annotations thus substantially alleviating the dependence on accurate annotations when compared to previous weakly supervised methods to solve such a challenging problem we leverage several lowlevel cues such as saliency edges etc to help generate a proxy ground truth due to the diversity of webcrawled images we anticipate a large amount of label noise in which other objects might be present we design an online noise filtering scheme which is able to deal with this label noise especially in cluttered images we use this filtering strategy as an auxiliary module to help assist the segmentation network in learning cleaner proxy annotations extensive experiments on the popular pascal voc 2012 semantic segmentation benchmark show surprising good results in both our webseg miou 570 and weakly supervised miou 633 settings
|
[['in', 'this', 'paper', 'we', 'improve', 'semantic', 'segmentation', 'by', 'automatically', 'learning', 'from', 'flickr', 'images', 'associated', 'with', 'a', 'particular', 'keyword', 'without', 'relying', 'on', 'any', 'explicit', 'user', 'annotations', 'thus', 'substantially', 'alleviating', 'the', 'dependence', 'on', 'accurate', 'annotations', 'when', 'compared', 'to', 'previous', 'weakly', 'supervised', 'methods', 'to', 'solve', 'such', 'a', 'challenging', 'problem', 'we', 'leverage', 'several', 'lowlevel', 'cues', 'such', 'as', 'saliency', 'edges', 'etc', 'to', 'help', 'generate', 'a', 'proxy', 'ground', 'truth', 'due', 'to', 'the', 'diversity', 'of', 'webcrawled', 'images', 'we', 'anticipate', 'a', 'large', 'amount', 'of', 'label', 'noise', 'in', 'which', 'other', 'objects', 'might', 'be', 'present', 'we', 'design', 'an', 'online', 'noise', 'filtering', 'scheme', 'which', 'is', 'able', 'to', 'deal', 'with', 'this', 'label', 'noise', 'especially', 'in', 'cluttered', 'images', 'we', 'use', 'this', 'filtering', 'strategy', 'as', 'an', 'auxiliary', 'module', 'to', 'help', 'assist', 'the', 'segmentation', 'network', 'in', 'learning', 'cleaner', 'proxy', 'annotations', 'extensive', 'experiments', 'on', 'the', 'popular', 'pascal', 'voc', '2012', 'semantic', 'segmentation', 'benchmark', 'show', 'surprising', 'good', 'results', 'in', 'both', 'our', 'webseg', 'miou', '570', 'and', 'weakly', 'supervised', 'miou', '633', 'settings']]
|
[0.0024451567014272244, -0.02169647642749744, -0.030906807367199574, 0.10330001246770042, -0.16686976577204635, -0.163973114804815, 0.06341679193178154, 0.48827659452815125, -0.2370737230417547, -0.39842535970448856, 0.07115179600906466, -0.3037750292446045, -0.17227697481489154, 0.18260862362503216, -0.2209525772536926, 0.06381295704967435, 0.20180300746069887, 0.06346340521025959, -0.03250407047002323, -0.28514783107058844, 0.2779319945858508, 0.06362702804216683, 0.3400115133664071, 0.039362296144422514, 0.12551907010203758, -0.02570071926846212, -0.07009537539148815, 0.006363583937601883, -0.05378754456398009, 0.16072059582706097, 0.3632014436116874, 0.16897646157033988, 0.30973587228318317, -0.3883681239695936, -0.20641750776955228, 0.08984087764390356, 0.12923502844345097, 0.12216026020862335, -0.050949404010740384, -0.4289827161462398, 0.08265826426946021, -0.16616931470536583, 0.05468024387211687, -0.15907391981030536, -0.05031655125384719, -0.03409047560521173, -0.312392148880029, 0.03646844100756016, 0.059910706916688296, 0.07751138360757652, -0.054390765547703036, -0.09681693153819748, 0.04146093878716181, 0.1888601919692025, 0.005985563063519137, 0.07655187718730593, 0.13862564176974806, -0.2513737126114001, -0.14702032205790577, 0.35408363721968716, -0.07560821361099647, -0.24161367897339017, 0.24393614015807183, -0.004069368829889014, -0.1664792766288811, 0.13423979406966674, 0.2238749823477489, 0.14572815641464776, -0.14645070167127705, -0.0219118257738582, -0.07822975020436261, 0.23686321851926923, 0.0736448764153417, -0.012524268820817083, 0.15179275287259741, 0.23171337294879535, 0.0640062896032904, 0.15470323429885474, -0.1595575021636142, 0.015065746410789943, -0.19178831800417542, -0.1053294045024741, -0.18509112172667555, -0.02261249264640524, -0.11596280477302294, -0.16453397340011716, 0.3513758924554535, 0.3158719972769008, 0.2383545145734725, 0.08052837622462963, 0.3682868148520934, -0.008212967320123304, 0.09383358558931308, 0.0717969818915, 0.13485531183807734, -0.019441377502613214, 0.14486573034872777, -0.15866680211998177, 0.07189731585287445, 0.05307463223472336]
|
1,803.0986
|
Three Birds One Stone: A General Architecture for Salient Object
Segmentation, Edge Detection and Skeleton Extraction
|
In this paper, we aim at solving pixel-wise binary problems, including
salient object segmentation, skeleton extraction, and edge detection, by
introducing a unified architecture. Previous works have proposed tailored
methods for solving each of the three tasks independently. Here, we show that
these tasks share some similarities that can be exploited for developing a
unified framework. In particular, we introduce a horizontal cascade, each
component of which is densely connected to the outputs of previous component.
Stringing these components together allows us to effectively exploit features
across different levels hierarchically to effectively address the multiple
pixel-wise binary regression tasks. To assess the performance of our proposed
network on these tasks, we carry out exhaustive evaluations on multiple
representative datasets. Although these tasks are inherently very different, we
show that our unified approach performs very well on all of them and works far
better than current single-purpose state-of-the-art methods. All the code in
this paper will be publicly available.
|
cs.CV
|
in this paper we aim at solving pixelwise binary problems including salient object segmentation skeleton extraction and edge detection by introducing a unified architecture previous works have proposed tailored methods for solving each of the three tasks independently here we show that these tasks share some similarities that can be exploited for developing a unified framework in particular we introduce a horizontal cascade each component of which is densely connected to the outputs of previous component stringing these components together allows us to effectively exploit features across different levels hierarchically to effectively address the multiple pixelwise binary regression tasks to assess the performance of our proposed network on these tasks we carry out exhaustive evaluations on multiple representative datasets although these tasks are inherently very different we show that our unified approach performs very well on all of them and works far better than current singlepurpose stateoftheart methods all the code in this paper will be publicly available
|
[['in', 'this', 'paper', 'we', 'aim', 'at', 'solving', 'pixelwise', 'binary', 'problems', 'including', 'salient', 'object', 'segmentation', 'skeleton', 'extraction', 'and', 'edge', 'detection', 'by', 'introducing', 'a', 'unified', 'architecture', 'previous', 'works', 'have', 'proposed', 'tailored', 'methods', 'for', 'solving', 'each', 'of', 'the', 'three', 'tasks', 'independently', 'here', 'we', 'show', 'that', 'these', 'tasks', 'share', 'some', 'similarities', 'that', 'can', 'be', 'exploited', 'for', 'developing', 'a', 'unified', 'framework', 'in', 'particular', 'we', 'introduce', 'a', 'horizontal', 'cascade', 'each', 'component', 'of', 'which', 'is', 'densely', 'connected', 'to', 'the', 'outputs', 'of', 'previous', 'component', 'stringing', 'these', 'components', 'together', 'allows', 'us', 'to', 'effectively', 'exploit', 'features', 'across', 'different', 'levels', 'hierarchically', 'to', 'effectively', 'address', 'the', 'multiple', 'pixelwise', 'binary', 'regression', 'tasks', 'to', 'assess', 'the', 'performance', 'of', 'our', 'proposed', 'network', 'on', 'these', 'tasks', 'we', 'carry', 'out', 'exhaustive', 'evaluations', 'on', 'multiple', 'representative', 'datasets', 'although', 'these', 'tasks', 'are', 'inherently', 'very', 'different', 'we', 'show', 'that', 'our', 'unified', 'approach', 'performs', 'very', 'well', 'on', 'all', 'of', 'them', 'and', 'works', 'far', 'better', 'than', 'current', 'singlepurpose', 'stateoftheart', 'methods', 'all', 'the', 'code', 'in', 'this', 'paper', 'will', 'be', 'publicly', 'available']]
|
[-0.068951437540818, 0.007880794272509026, -0.07513921799527222, 0.043346827667017904, -0.10894653553296399, -0.16450787904743058, 0.022948692501168932, 0.4692759131069613, -0.2520124273687082, -0.3364488197714562, 0.08215676315049228, -0.256328548341669, -0.18076798207232658, 0.20928903715095565, -0.1002895725151241, 0.0854047343806847, 0.16169683873959922, 0.004558429646576884, -0.05893985685506317, -0.29859926634029, 0.32621438983333756, 0.03415063632168819, 0.30868891167124335, 0.021209337751534354, 0.11193077422124392, -0.03929054283071309, -0.06850536480174647, 0.03767184453198165, -0.05987969275391358, 0.1853816578418158, 0.3418870040604585, 0.1670996523845375, 0.2922125515068256, -0.42365265391248313, -0.2611148695143152, 0.0755479683557266, 0.1784217410538157, 0.09902711839076571, 0.0032201993766924532, -0.2843757499601763, 0.12079743302686588, -0.1656079961081283, 0.012239599489913428, -0.15306848466773576, -0.053476134344605325, -0.0027633231005018363, -0.2574224559372126, 0.0299555498729401, 0.06687613702718098, 0.015476673132669228, -0.04754460335722417, -0.14657748114064195, 0.05540506331444588, 0.20307685698300035, 0.004330882221265825, 0.023962904601888376, 0.12258728704992918, -0.12881011709783086, -0.14542134115295602, 0.3449498508449738, -0.036868452759554665, -0.22658337777645526, 0.26896477353765, -0.03716926514230008, -0.22598002423956706, 0.07709685517062398, 0.21147450191687933, 0.1667214901970487, -0.1697881397926779, -0.016897103580487068, -0.0639842636529592, 0.1647103446759755, 0.02964318676334452, -0.0012320395075727866, 0.22649619872298657, 0.21014472204437362, 0.024479839901756305, 0.14955045628402666, -0.10974700461879308, -0.07379171677977082, -0.2297583675384816, -0.09695992128970692, -0.15318493399609917, -0.05871043673162408, -0.06560500249501665, -0.1202191855711273, 0.44605904047471717, 0.26056429985144375, 0.22597260188526486, 0.08499450727400541, 0.36612236113110674, 0.02998599387805532, 0.1236588278891448, 0.10068255076125925, 0.17784549247070444, 0.00489106068617511, 0.07625521403513377, -0.16373294215543266, 0.04201788702519917, 0.04499512011645055]
|
1,803.09861
|
A Classification Model for Sensing Human Trust in Machines Using EEG and
GSR
|
Today, intelligent machines \emph{interact and collaborate} with humans in a
way that demands a greater level of trust between human and machine. A first
step towards building intelligent machines that are capable of building and
maintaining trust with humans is the design of a sensor that will enable
machines to estimate human trust level in real-time. In this paper, two
approaches for developing classifier-based empirical trust sensor models are
presented that specifically use electroencephalography (EEG) and galvanic skin
response (GSR) measurements. Human subject data collected from 45 participants
is used for feature extraction, feature selection, classifier training, and
model validation. The first approach considers a general set of
psychophysiological features across all participants as the input variables and
trains a classifier-based model for each participant, resulting in a trust
sensor model based on the general feature set (i.e., a "general trust sensor
model"). The second approach considers a customized feature set for each
individual and trains a classifier-based model using that feature set,
resulting in improved mean accuracy but at the expense of an increase in
training time. This work represents the first use of real-time
psychophysiological measurements for the development of a human trust sensor.
Implications of the work, in the context of trust management algorithm design
for intelligent machines, are also discussed.
|
cs.HC
|
today intelligent machines emphinteract and collaborate with humans in a way that demands a greater level of trust between human and machine a first step towards building intelligent machines that are capable of building and maintaining trust with humans is the design of a sensor that will enable machines to estimate human trust level in realtime in this paper two approaches for developing classifierbased empirical trust sensor models are presented that specifically use electroencephalography eeg and galvanic skin response gsr measurements human subject data collected from 45 participants is used for feature extraction feature selection classifier training and model validation the first approach considers a general set of psychophysiological features across all participants as the input variables and trains a classifierbased model for each participant resulting in a trust sensor model based on the general feature set ie a general trust sensor model the second approach considers a customized feature set for each individual and trains a classifierbased model using that feature set resulting in improved mean accuracy but at the expense of an increase in training time this work represents the first use of realtime psychophysiological measurements for the development of a human trust sensor implications of the work in the context of trust management algorithm design for intelligent machines are also discussed
|
[['today', 'intelligent', 'machines', 'emphinteract', 'and', 'collaborate', 'with', 'humans', 'in', 'a', 'way', 'that', 'demands', 'a', 'greater', 'level', 'of', 'trust', 'between', 'human', 'and', 'machine', 'a', 'first', 'step', 'towards', 'building', 'intelligent', 'machines', 'that', 'are', 'capable', 'of', 'building', 'and', 'maintaining', 'trust', 'with', 'humans', 'is', 'the', 'design', 'of', 'a', 'sensor', 'that', 'will', 'enable', 'machines', 'to', 'estimate', 'human', 'trust', 'level', 'in', 'realtime', 'in', 'this', 'paper', 'two', 'approaches', 'for', 'developing', 'classifierbased', 'empirical', 'trust', 'sensor', 'models', 'are', 'presented', 'that', 'specifically', 'use', 'electroencephalography', 'eeg', 'and', 'galvanic', 'skin', 'response', 'gsr', 'measurements', 'human', 'subject', 'data', 'collected', 'from', '45', 'participants', 'is', 'used', 'for', 'feature', 'extraction', 'feature', 'selection', 'classifier', 'training', 'and', 'model', 'validation', 'the', 'first', 'approach', 'considers', 'a', 'general', 'set', 'of', 'psychophysiological', 'features', 'across', 'all', 'participants', 'as', 'the', 'input', 'variables', 'and', 'trains', 'a', 'classifierbased', 'model', 'for', 'each', 'participant', 'resulting', 'in', 'a', 'trust', 'sensor', 'model', 'based', 'on', 'the', 'general', 'feature', 'set', 'ie', 'a', 'general', 'trust', 'sensor', 'model', 'the', 'second', 'approach', 'considers', 'a', 'customized', 'feature', 'set', 'for', 'each', 'individual', 'and', 'trains', 'a', 'classifierbased', 'model', 'using', 'that', 'feature', 'set', 'resulting', 'in', 'improved', 'mean', 'accuracy', 'but', 'at', 'the', 'expense', 'of', 'an', 'increase', 'in', 'training', 'time', 'this', 'work', 'represents', 'the', 'first', 'use', 'of', 'realtime', 'psychophysiological', 'measurements', 'for', 'the', 'development', 'of', 'a', 'human', 'trust', 'sensor', 'implications', 'of', 'the', 'work', 'in', 'the', 'context', 'of', 'trust', 'management', 'algorithm', 'design', 'for', 'intelligent', 'machines', 'are', 'also', 'discussed']]
|
[-0.07646195102863433, 0.04311096474607289, -0.05976092926676914, 0.026198378720368856, -0.1134393113346097, -0.1945913760756698, 0.07785123755702827, 0.3998227529358906, -0.2213724749119069, -0.32317552142754685, 0.06238834351189697, -0.2918857329004737, -0.18526689415090355, 0.18606937039410423, -0.11178477727089514, 0.10013813843312258, 0.10552622895237461, 0.09375030995114868, 0.03347531019080378, -0.25094326676040046, 0.2938370085955366, 0.059800541712662005, 0.3526612566171887, 0.011029575581382524, 0.1353363705008671, 0.024849278339678902, -0.043334389096694376, -0.003220394983922652, -0.023243176036804286, 0.2121576800548358, 0.3591729353305572, 0.20937713732977917, 0.3875992290124717, -0.42520715731760145, -0.1917366842092168, 0.09006958417900501, 0.11414334008977377, 0.08016317630702621, -0.029361697780667967, -0.30564371009352903, 0.08869048966173555, -0.19797388133453533, -0.06060243609684909, -0.08275728447838894, -0.00629703514933796, -0.0014266385106553494, -0.31311070241313865, 0.019709855937721434, 0.03194774518843233, 0.11932377756831232, -0.09087534777070243, -0.08318195624786381, 0.02237127346813049, 0.18752572807688878, -0.008552762555142104, 0.018217930016315546, 0.18604330226621577, -0.17578436245927542, -0.16331656101026393, 0.358526576179224, 0.007503113372714866, -0.19813349983816694, 0.1602193035323068, -0.01885474496848986, -0.16532209743291987, 0.05992823619692818, 0.27346600276448635, 0.06461250004817692, -0.21418374741423718, -0.02474571052832669, 0.000897209177519514, 0.1947262057020141, 0.018990925075967266, -0.021793711183105153, 0.1838749841056729, 0.2852240952558186, 0.05718283104259923, 0.09513715716262519, -0.09682667460576784, -0.06099188021064994, -0.27279204457228734, -0.1400906925041561, -0.17125357517659962, -0.04931118322466391, -0.09010662379115218, -0.11667110901675734, 0.38686877622011123, 0.24823592494552335, 0.20194085472057893, 0.11037088720061808, 0.3666178703399926, 0.03968470598360034, 0.10223772320371698, 0.08823415597227398, 0.20060144405715832, -0.01254109212332908, 0.15905566609621993, -0.16008523669754626, 0.14056266921554897, 0.027926039526746237]
|
1,803.09862
|
A Decision Tree Approach to Predicting Recidivism in Domestic Violence
|
Domestic violence (DV) is a global social and public health issue that is
highly gendered. Being able to accurately predict DV recidivism, i.e.,
re-offending of a previously convicted offender, can speed up and improve risk
assessment procedures for police and front-line agencies, better protect
victims of DV, and potentially prevent future re-occurrences of DV. Previous
work in DV recidivism has employed different classification techniques,
including decision tree (DT) induction and logistic regression, where the main
focus was on achieving high prediction accuracy. As a result, even the diagrams
of trained DTs were often too difficult to interpret due to their size and
complexity, making decision-making challenging. Given there is often a
trade-off between model accuracy and interpretability, in this work our aim is
to employ DT induction to obtain both interpretable trees as well as high
prediction accuracy. Specifically, we implement and evaluate different
approaches to deal with class imbalance as well as feature selection. Compared
to previous work in DV recidivism prediction that employed logistic regression,
our approach can achieve comparable area under the ROC curve results by using
only 3 of 11 available features and generating understandable decision trees
that contain only 4 leaf nodes.
|
cs.LG stat.ML
|
domestic violence dv is a global social and public health issue that is highly gendered being able to accurately predict dv recidivism ie reoffending of a previously convicted offender can speed up and improve risk assessment procedures for police and frontline agencies better protect victims of dv and potentially prevent future reoccurrences of dv previous work in dv recidivism has employed different classification techniques including decision tree dt induction and logistic regression where the main focus was on achieving high prediction accuracy as a result even the diagrams of trained dts were often too difficult to interpret due to their size and complexity making decisionmaking challenging given there is often a tradeoff between model accuracy and interpretability in this work our aim is to employ dt induction to obtain both interpretable trees as well as high prediction accuracy specifically we implement and evaluate different approaches to deal with class imbalance as well as feature selection compared to previous work in dv recidivism prediction that employed logistic regression our approach can achieve comparable area under the roc curve results by using only 3 of 11 available features and generating understandable decision trees that contain only 4 leaf nodes
|
[['domestic', 'violence', 'dv', 'is', 'a', 'global', 'social', 'and', 'public', 'health', 'issue', 'that', 'is', 'highly', 'gendered', 'being', 'able', 'to', 'accurately', 'predict', 'dv', 'recidivism', 'ie', 'reoffending', 'of', 'a', 'previously', 'convicted', 'offender', 'can', 'speed', 'up', 'and', 'improve', 'risk', 'assessment', 'procedures', 'for', 'police', 'and', 'frontline', 'agencies', 'better', 'protect', 'victims', 'of', 'dv', 'and', 'potentially', 'prevent', 'future', 'reoccurrences', 'of', 'dv', 'previous', 'work', 'in', 'dv', 'recidivism', 'has', 'employed', 'different', 'classification', 'techniques', 'including', 'decision', 'tree', 'dt', 'induction', 'and', 'logistic', 'regression', 'where', 'the', 'main', 'focus', 'was', 'on', 'achieving', 'high', 'prediction', 'accuracy', 'as', 'a', 'result', 'even', 'the', 'diagrams', 'of', 'trained', 'dts', 'were', 'often', 'too', 'difficult', 'to', 'interpret', 'due', 'to', 'their', 'size', 'and', 'complexity', 'making', 'decisionmaking', 'challenging', 'given', 'there', 'is', 'often', 'a', 'tradeoff', 'between', 'model', 'accuracy', 'and', 'interpretability', 'in', 'this', 'work', 'our', 'aim', 'is', 'to', 'employ', 'dt', 'induction', 'to', 'obtain', 'both', 'interpretable', 'trees', 'as', 'well', 'as', 'high', 'prediction', 'accuracy', 'specifically', 'we', 'implement', 'and', 'evaluate', 'different', 'approaches', 'to', 'deal', 'with', 'class', 'imbalance', 'as', 'well', 'as', 'feature', 'selection', 'compared', 'to', 'previous', 'work', 'in', 'dv', 'recidivism', 'prediction', 'that', 'employed', 'logistic', 'regression', 'our', 'approach', 'can', 'achieve', 'comparable', 'area', 'under', 'the', 'roc', 'curve', 'results', 'by', 'using', 'only', '3', 'of', '11', 'available', 'features', 'and', 'generating', 'understandable', 'decision', 'trees', 'that', 'contain', 'only', '4', 'leaf', 'nodes']]
|
[-0.021524726112301534, 0.015441409971278448, -0.05231718025886668, 0.1248431507181615, -0.13491678497730158, -0.2180708729638121, 0.09424899310972064, 0.4090557217741242, -0.2346802894336482, -0.3499368155709444, 0.1376173593933718, -0.29484386801337586, -0.1682953164459039, 0.20531156064512637, -0.17426491691313015, 0.09826395156769416, 0.08016789174244668, 0.06299224650391784, 0.006048008957161353, -0.3102122409251304, 0.25619406894637414, 0.06532767948646767, 0.33923245700350846, 0.042989959292866003, 0.08625040014381878, -0.006192523290892728, -0.05356119850154918, 0.034775363952399066, -0.08008928611372353, 0.12520527867600323, 0.3411917916081177, 0.17319430548291748, 0.32709578399379285, -0.35447528747728285, -0.22870958211640707, 0.1297412688223024, 0.1319618421415679, 0.06895807831583975, 0.029573090955352363, -0.27086120755650483, 0.08866450787038327, -0.20204783822782935, -0.06342649211008579, -0.1407426223803598, -0.002237265719435154, -0.0002620576071935013, -0.2735426301566454, 0.0776073325652247, 0.022589522627636027, 0.0824709905980107, -0.008969720663765493, -0.1369123333450168, -0.054901906267668193, 0.19047965472802902, 0.058643984373730536, 0.09930326733499384, 0.11925673196241499, -0.17303682717293925, -0.15809991787223576, 0.3870776539596801, -0.04450819293777339, -0.19036328525115281, 0.23952317843213677, -0.06117676538057052, -0.14192673774579398, 0.07181625461731202, 0.23449253516797072, 0.06993193925143434, -0.16058211170184689, -0.024658057344659496, 0.019290119459709296, 0.1750832668081738, 0.0952828705095901, -0.04545139578433755, 0.1133342183344305, 0.21977696769023075, 0.047301256601722574, 0.09488437631501792, -0.09811366469724676, -0.044656869580443855, -0.17607456040210448, -0.12072772934483603, -0.11405259135823984, -2.5321835747514014e-05, -0.07462211444620222, -0.13347428512568466, 0.3420079388978103, 0.2249014989258005, 0.1983378400194805, 0.10184685583823384, 0.3114580509037926, 0.03591961354220238, 0.072189016163779, 0.07873597875810587, 0.18708473036053758, 0.042810703369263466, 0.09115639231525935, -0.16643670818780382, 0.16934752031229436, 0.014794574053928209]
|
1,803.09863
|
The hard potential relativistic Boltzmann equation in the whole space
|
We study the Cauchy problem for the relativistic Boltzmann equation near
relativistic Maxwellians in the whole space. The purpose of this article is to
handle hard potentials, and for initial data with finite $L^\infty$ norm, to
construct global in time mild solutions. We also prove the optimal time decay
rates of the solutions.
|
math.AP
|
we study the cauchy problem for the relativistic boltzmann equation near relativistic maxwellians in the whole space the purpose of this article is to handle hard potentials and for initial data with finite linfty norm to construct global in time mild solutions we also prove the optimal time decay rates of the solutions
|
[['we', 'study', 'the', 'cauchy', 'problem', 'for', 'the', 'relativistic', 'boltzmann', 'equation', 'near', 'relativistic', 'maxwellians', 'in', 'the', 'whole', 'space', 'the', 'purpose', 'of', 'this', 'article', 'is', 'to', 'handle', 'hard', 'potentials', 'and', 'for', 'initial', 'data', 'with', 'finite', 'linfty', 'norm', 'to', 'construct', 'global', 'in', 'time', 'mild', 'solutions', 'we', 'also', 'prove', 'the', 'optimal', 'time', 'decay', 'rates', 'of', 'the', 'solutions']]
|
[-0.10312514913813123, 0.0618908513372518, -0.10737573966561852, 0.1471696193066408, -0.05270476744703527, -0.10705571526766948, -0.011954303532135937, 0.3383765236105559, -0.34120328415114926, -0.19766487479912784, 0.14394978094705432, -0.26074632028785516, -0.034212576682275196, 0.15412748402933468, -0.041925347023555694, 0.14199488880639932, 0.1111746017803561, 0.0453824811913776, -0.11386943273773452, -0.23507125879514892, 0.3902144955717168, 0.040934641898240684, 0.2414564215314557, 0.0513542613172728, 0.10641440529736497, -0.006376729153518407, 0.005207341937523968, -0.012985508406275601, -0.21319011782893454, 0.06951387175402762, 0.2493531102103726, 0.09186849776075555, 0.2949011263982305, -0.4556608601069113, -0.17990898370813085, 0.1895984670428454, 0.12111028340065254, 0.150641940270533, -0.054515010224795844, -0.25066218102122395, 0.11332957582759126, -0.10571544134181063, -0.2515015503180758, -0.07919986893967637, 0.03933162263260698, 0.06173602529836573, -0.3041558784590858, 0.13301334007728827, 0.0329601351031155, -0.03334477658049678, -0.23780906648498099, -0.03164069609329948, 0.05841310301198149, 0.04859491079202238, 0.12070554113103393, 0.028259824711021106, 0.007725593194646656, -0.11717222755300408, -0.04586000194035049, 0.36443179807151266, -0.08833571985574826, -0.25814537015163674, 0.13477126515980037, -0.18700321872261758, -0.12859697871894207, 0.13103278981135139, 0.22465356732806507, 0.17852141188000734, -0.1837788355835485, 0.16216826052207253, -0.05720111666212104, 0.13963686242559045, 0.06142806015768141, 0.013342738735548853, 0.06441592459373598, 0.13422911933992268, 0.11796618704596218, 0.15336962269162233, -0.0682100300371805, -0.12654280096714227, -0.3553319455669174, -0.1575038463079353, -0.15574615404782993, 0.06841985120894914, -0.09713176171320605, -0.18544750998042664, 0.37273819736679487, 0.13512265358893377, 0.16020444302626377, 0.11617001433382337, 0.23412391395782525, 0.16035716631010455, -0.01621629940873047, 0.14443218436549013, 0.2177061083526702, 0.09948066354922529, 0.17671339769127234, -0.24798596563380002, -0.00411163855625211, 0.14154433630371713]
|
1,803.09864
|
Constraints on the Density and Internal Strength of 1I/'Oumuamua
|
1I/'Oumuamua was discovered by the Panoramic Survey Telescope and Rapid
Response System (Pan-STARRS 1) on 19 October 2017. Unlike all previously
discovered minor planets this object was determined to have eccentricity $e >
1.0$, suggesting an interstellar origin. Since this discovery and within the
limited window of opportunity, several photometric and spectroscopic studies of
the object have been made. Using the measured light curve amplitudes and
rotation periods we find that, under the assumption of a triaxial ellipsoid, a
density range $1500 < \rho < 2800$ kg m$^{-3}$ matches the observations and no
significant cohesive strength is required. We also determine that an aspect
ratio of $6\pm 1:1$ is most likely after accounting for phase-angle effects and
considering the potential effect of surface properties. This elongation is
still remarkable but less than some other estimates.
|
astro-ph.EP
|
1ioumuamua was discovered by the panoramic survey telescope and rapid response system panstarrs 1 on 19 october 2017 unlike all previously discovered minor planets this object was determined to have eccentricity e 10 suggesting an interstellar origin since this discovery and within the limited window of opportunity several photometric and spectroscopic studies of the object have been made using the measured light curve amplitudes and rotation periods we find that under the assumption of a triaxial ellipsoid a density range 1500 rho 2800 kg m3 matches the observations and no significant cohesive strength is required we also determine that an aspect ratio of 6pm 11 is most likely after accounting for phaseangle effects and considering the potential effect of surface properties this elongation is still remarkable but less than some other estimates
|
[['1ioumuamua', 'was', 'discovered', 'by', 'the', 'panoramic', 'survey', 'telescope', 'and', 'rapid', 'response', 'system', 'panstarrs', '1', 'on', '19', 'october', '2017', 'unlike', 'all', 'previously', 'discovered', 'minor', 'planets', 'this', 'object', 'was', 'determined', 'to', 'have', 'eccentricity', 'e', '10', 'suggesting', 'an', 'interstellar', 'origin', 'since', 'this', 'discovery', 'and', 'within', 'the', 'limited', 'window', 'of', 'opportunity', 'several', 'photometric', 'and', 'spectroscopic', 'studies', 'of', 'the', 'object', 'have', 'been', 'made', 'using', 'the', 'measured', 'light', 'curve', 'amplitudes', 'and', 'rotation', 'periods', 'we', 'find', 'that', 'under', 'the', 'assumption', 'of', 'a', 'triaxial', 'ellipsoid', 'a', 'density', 'range', '1500', 'rho', '2800', 'kg', 'm3', 'matches', 'the', 'observations', 'and', 'no', 'significant', 'cohesive', 'strength', 'is', 'required', 'we', 'also', 'determine', 'that', 'an', 'aspect', 'ratio', 'of', '6pm', '11', 'is', 'most', 'likely', 'after', 'accounting', 'for', 'phaseangle', 'effects', 'and', 'considering', 'the', 'potential', 'effect', 'of', 'surface', 'properties', 'this', 'elongation', 'is', 'still', 'remarkable', 'but', 'less', 'than', 'some', 'other', 'estimates']]
|
[-0.12195113257180448, 0.12243149239260344, -0.08807966628845668, 0.033457689123072974, -0.08869199372588121, -0.0836738256532981, 0.04208333456578354, 0.39275629891816416, -0.158852404114882, -0.3950163788924163, 0.11148943460923902, -0.2955492260770177, -0.12366656799250367, 0.22171789432071487, -0.05723222207708397, 0.021014781764913067, 0.08506244276368032, -0.020842263938957883, -0.04794469929236749, -0.2765156567435373, 0.2142168042041841, 0.0836372390141619, 0.19246120041476167, 0.020050176381835517, 0.07264111262956055, -0.018660357995858332, -0.06796152620209438, -0.0017451050084535823, -0.1656564902555009, 0.04867538301649885, 0.17057343486830537, 0.11089432290684657, 0.22720603805359904, -0.3552244572801459, -0.21186038897598558, 0.09490099276246672, 0.1314000362445685, 0.04062302419333719, -0.04558531147389052, -0.2629866871072657, 0.08958742632460075, -0.18190630817094422, -0.18003602902701293, 0.01784659884376169, 0.14780607242419413, -0.005830832866415607, -0.19564374663803558, 0.07710189221468296, 0.031423518494138436, 0.14948322565054917, -0.13400633142781304, -0.16431304990141088, -0.01590333956868783, 0.09043205557673266, 0.05267331085809873, 0.08745198447087948, 0.13792078240040803, -0.12335536119732723, -0.011361554691878458, 0.39612717160806904, -0.057691782059092395, -0.03426983638972601, 0.19853352623370787, -0.19787050232954437, -0.15279564267786389, 0.18136769458104743, 0.12868633504099722, 0.10595075834090963, -0.17914319629287065, 0.031920233781089664, -0.021149055162540564, 0.23406826124780558, 0.08739857701231923, 0.027681181682661798, 0.25514457140569435, 0.1399742499351939, 0.034813971502113746, 0.06684096189432735, -0.23236442672857788, -0.016452199130347282, -0.22515329108996826, -0.10574128616876392, -0.13153810056533213, 0.043183352925222025, -0.07186955935608377, -0.08187519191326856, 0.35641698272207356, 0.11176969369196078, 0.21289382875671214, 0.013115631695131235, 0.24055626395045582, 0.060275763502542046, 0.10624655580613762, 0.08155019305272479, 0.3560033521985822, 0.12756842546426042, 0.07327841998741144, -0.17956078256071178, 0.10850822635234869, -0.034532369938185155]
|
1,803.09865
|
Epitaxial growth of highly strained antimonene on Ag (111)
|
The synthesis of antimonene, which is a promising group-V 2D material for
both fundamental studies and technological applications, remains highly
challenging. Thus far, it has been synthesized only by exfoliation or growth on
a few substrates. In this study, we show that thin layers of antimonene can be
grown on Ag (111) by molecular beam epitaxy. High-resolution scanning tunneling
microscopy combined with theoretical calculations revealed that the
submonolayer Sb deposited on a Ag (111) surface forms a layer of AgSb2 surface
alloy upon annealing. Further deposition of Sb on the AgSb2 surface alloy
causes an epitaxial layer of Sb to form, which is identified as antimonene with
a buckled honeycomb structure. More interestingly, the lattice constant of the
epitaxial antimonene (5 {\AA}) is much larger than that of freestanding
antimonene, indicating a high tensile strain of more than 20%. This kind of
large strain is expected to make the antimonene a highly promising candidate
for room-temperature quantum spin Hall material.
|
cond-mat.mtrl-sci
|
the synthesis of antimonene which is a promising groupv 2d material for both fundamental studies and technological applications remains highly challenging thus far it has been synthesized only by exfoliation or growth on a few substrates in this study we show that thin layers of antimonene can be grown on ag 111 by molecular beam epitaxy highresolution scanning tunneling microscopy combined with theoretical calculations revealed that the submonolayer sb deposited on a ag 111 surface forms a layer of agsb2 surface alloy upon annealing further deposition of sb on the agsb2 surface alloy causes an epitaxial layer of sb to form which is identified as antimonene with a buckled honeycomb structure more interestingly the lattice constant of the epitaxial antimonene 5 aa is much larger than that of freestanding antimonene indicating a high tensile strain of more than 20 this kind of large strain is expected to make the antimonene a highly promising candidate for roomtemperature quantum spin hall material
|
[['the', 'synthesis', 'of', 'antimonene', 'which', 'is', 'a', 'promising', 'groupv', '2d', 'material', 'for', 'both', 'fundamental', 'studies', 'and', 'technological', 'applications', 'remains', 'highly', 'challenging', 'thus', 'far', 'it', 'has', 'been', 'synthesized', 'only', 'by', 'exfoliation', 'or', 'growth', 'on', 'a', 'few', 'substrates', 'in', 'this', 'study', 'we', 'show', 'that', 'thin', 'layers', 'of', 'antimonene', 'can', 'be', 'grown', 'on', 'ag', '111', 'by', 'molecular', 'beam', 'epitaxy', 'highresolution', 'scanning', 'tunneling', 'microscopy', 'combined', 'with', 'theoretical', 'calculations', 'revealed', 'that', 'the', 'submonolayer', 'sb', 'deposited', 'on', 'a', 'ag', '111', 'surface', 'forms', 'a', 'layer', 'of', 'agsb2', 'surface', 'alloy', 'upon', 'annealing', 'further', 'deposition', 'of', 'sb', 'on', 'the', 'agsb2', 'surface', 'alloy', 'causes', 'an', 'epitaxial', 'layer', 'of', 'sb', 'to', 'form', 'which', 'is', 'identified', 'as', 'antimonene', 'with', 'a', 'buckled', 'honeycomb', 'structure', 'more', 'interestingly', 'the', 'lattice', 'constant', 'of', 'the', 'epitaxial', 'antimonene', '5', 'aa', 'is', 'much', 'larger', 'than', 'that', 'of', 'freestanding', 'antimonene', 'indicating', 'a', 'high', 'tensile', 'strain', 'of', 'more', 'than', '20', 'this', 'kind', 'of', 'large', 'strain', 'is', 'expected', 'to', 'make', 'the', 'antimonene', 'a', 'highly', 'promising', 'candidate', 'for', 'roomtemperature', 'quantum', 'spin', 'hall', 'material']]
|
[-0.10045206317931556, 0.16213700105519038, -0.04433007605220604, -0.057048758410088295, -0.021259775821449636, -0.1982940159873636, 0.08116511037813418, 0.4591587063815162, -0.2704645346590801, -0.3060286385066147, 0.03706911471421842, -0.28230984998230313, -0.15098522220667498, 0.24116600504369015, 0.027824472199795367, 0.04997066787924453, 0.0196728589635083, -0.15626859752596886, -0.1339758678554569, -0.24137653635160503, 0.22427222921359766, 0.11154806277864979, 0.3484349113040238, 0.07938216921366469, 0.00587566665379637, -0.027749325157602943, 0.16046727248366655, 0.03206454530429048, -0.18909777717327197, 0.1119562165378416, 0.2102888791005516, -0.12819684955329763, 0.23085911374515558, -0.4933184201628724, -0.2583481615211791, -0.07417005289322402, 0.11696739904759333, 0.14421454056525673, -0.16237891877907817, -0.2077352375888466, 0.1485365401368435, -0.1124688863232614, -0.04739759918420187, -0.05221615772424679, 0.00510934057728022, -0.060436925980118045, -0.20385904994548618, 0.051454923876054305, 0.027582553406894396, 0.1070901493882577, -0.0914136961609408, -0.1763047021577913, -0.16783994587751316, -0.01718180451713078, 0.016798993643326095, 0.08860960585224337, 0.23542604390664404, -0.10413413909499687, -0.06402936504926839, 0.4192250760838012, -0.02601605435907752, -0.08232438456874247, 0.20679274492284072, -0.16335239254904887, -0.0988599015193508, 0.17335312696220942, 0.12116523892353466, 0.15381551937854412, -0.13940857057319658, 0.040155504051746234, -0.02266125284323964, 0.24587860732940556, 0.10925149549199623, 0.0365981267694431, 0.2216959957510846, 0.2778558375879745, 0.048434095906647795, 0.14017423999693268, -0.13861880570803356, 0.03386401082536418, -0.127955553375326, -0.25962504444797113, -0.23599646078670233, 0.15150125566140538, -0.08750112657573389, -0.22521760292893536, 0.3644239989012079, 0.09067426161262902, 0.1576735508581034, -0.0890897221839692, 0.21145146103175003, 0.036461921897274735, 0.12574519227329595, -0.04096227929974564, 0.26243328071446925, 0.16417419362247368, 0.07772026256272418, -0.18388651964944328, 0.1389555803226024, -0.05479624432134383]
|
1,803.09866
|
Accelerating Empowerment Computation with UCT Tree Search
|
Models of intrinsic motivation present an important means to produce sensible
behaviour in the absence of extrinsic rewards. Applications in video games are
varied, and range from intrinsically motivated general game-playing agents to
non-player characters such as companions and enemies. The information-theoretic
quantity of Empowerment is a particularly promising candidate motivation to
produce believable, generic and robust behaviour. However, while it can be used
in the absence of external reward functions that would need to be crafted and
learned, empowerment is computationally expensive. In this paper, we propose a
modified UCT tree search method to mitigate empowerment's computational
complexity in discrete and deterministic scenarios. We demonstrate how to
modify a Monte-Carlo Search Tree with UCT to realise empowerment maximisation,
and discuss three additional modifications that facilitate better sampling. We
evaluate the approach both quantitatively, by analysing how close our approach
gets to the baseline of exhaustive empowerment computation with varying amounts
of computational resources, and qualitatively, by analysing the resulting
behaviour in a Minecraft-like scenario.
|
cs.AI cs.IT cs.PF math.IT
|
models of intrinsic motivation present an important means to produce sensible behaviour in the absence of extrinsic rewards applications in video games are varied and range from intrinsically motivated general gameplaying agents to nonplayer characters such as companions and enemies the informationtheoretic quantity of empowerment is a particularly promising candidate motivation to produce believable generic and robust behaviour however while it can be used in the absence of external reward functions that would need to be crafted and learned empowerment is computationally expensive in this paper we propose a modified uct tree search method to mitigate empowerments computational complexity in discrete and deterministic scenarios we demonstrate how to modify a montecarlo search tree with uct to realise empowerment maximisation and discuss three additional modifications that facilitate better sampling we evaluate the approach both quantitatively by analysing how close our approach gets to the baseline of exhaustive empowerment computation with varying amounts of computational resources and qualitatively by analysing the resulting behaviour in a minecraftlike scenario
|
[['models', 'of', 'intrinsic', 'motivation', 'present', 'an', 'important', 'means', 'to', 'produce', 'sensible', 'behaviour', 'in', 'the', 'absence', 'of', 'extrinsic', 'rewards', 'applications', 'in', 'video', 'games', 'are', 'varied', 'and', 'range', 'from', 'intrinsically', 'motivated', 'general', 'gameplaying', 'agents', 'to', 'nonplayer', 'characters', 'such', 'as', 'companions', 'and', 'enemies', 'the', 'informationtheoretic', 'quantity', 'of', 'empowerment', 'is', 'a', 'particularly', 'promising', 'candidate', 'motivation', 'to', 'produce', 'believable', 'generic', 'and', 'robust', 'behaviour', 'however', 'while', 'it', 'can', 'be', 'used', 'in', 'the', 'absence', 'of', 'external', 'reward', 'functions', 'that', 'would', 'need', 'to', 'be', 'crafted', 'and', 'learned', 'empowerment', 'is', 'computationally', 'expensive', 'in', 'this', 'paper', 'we', 'propose', 'a', 'modified', 'uct', 'tree', 'search', 'method', 'to', 'mitigate', 'empowerments', 'computational', 'complexity', 'in', 'discrete', 'and', 'deterministic', 'scenarios', 'we', 'demonstrate', 'how', 'to', 'modify', 'a', 'montecarlo', 'search', 'tree', 'with', 'uct', 'to', 'realise', 'empowerment', 'maximisation', 'and', 'discuss', 'three', 'additional', 'modifications', 'that', 'facilitate', 'better', 'sampling', 'we', 'evaluate', 'the', 'approach', 'both', 'quantitatively', 'by', 'analysing', 'how', 'close', 'our', 'approach', 'gets', 'to', 'the', 'baseline', 'of', 'exhaustive', 'empowerment', 'computation', 'with', 'varying', 'amounts', 'of', 'computational', 'resources', 'and', 'qualitatively', 'by', 'analysing', 'the', 'resulting', 'behaviour', 'in', 'a', 'minecraftlike', 'scenario']]
|
[-0.06430521958019796, 0.06914029242949378, -0.09161911334876725, 0.1324444955969772, -0.13990195400647223, -0.1685165869974834, 0.07552108687042984, 0.42120695990036056, -0.28012569469222626, -0.3678774215578119, 0.08420200228685387, -0.2278058252545885, -0.20343081106894587, 0.1885153261938938, -0.1326254358730476, 0.040568035160208495, 0.07747244309816807, -0.0039096861917731224, -0.018453326941884916, -0.2653739402653432, 0.29346862519902683, 0.09936533045835017, 0.27184244325567336, 0.022602558084563608, 0.07065166419577654, -0.003728576898689102, -0.02958096836642162, 0.026747080457091125, -0.07943668457055593, 0.13683239560848548, 0.31994943885073124, 0.18016467467978872, 0.3037322666638879, -0.4049764946560187, -0.18795798194274718, 0.15232778049754037, 0.14438557726519605, 0.12258819834774852, -0.056849132040929784, -0.30198141866066475, 0.08224854276793994, -0.19735771323914178, -0.09192980367881731, -0.16163840928212084, -0.019533466907686616, -0.01576633663295248, -0.28020684239475996, 0.022376710434724216, 0.03284860861721946, 0.028125671069909094, -0.03511388284765595, -0.09810016637430898, 0.029344822818619068, 0.15344292793902883, 0.07137389759750225, 0.03384245095054613, 0.13732336485826988, -0.17198283364241937, -0.1633310112816516, 0.38909201893064144, -0.06690936886271222, -0.22097980792411356, 0.2321880842734734, -0.05581526290282516, -0.14313554486111263, 0.09904505497278886, 0.2069882291763381, 0.11311776140430496, -0.1607921416928386, 0.037659614758660295, 0.0250198932913092, 0.15745128844036188, 0.015623251239032103, 0.04980398979547942, 0.1812978587141889, 0.19255295786520957, 0.05617743138326732, 0.1845096439948774, -0.016404827454618742, -0.11419249824398237, -0.2354863998465857, -0.13350778647292794, -0.16617130236757313, 0.03189343259065623, -0.07153205028344074, -0.12540395186208417, 0.35576357174539036, 0.25415886830727064, 0.17167520501930839, 0.09163533548818775, 0.32616045841364405, 0.07248962195333025, 0.052507054409229315, 0.05954216564634095, 0.18654042475305474, 0.01216727569470742, 0.09063607742409993, -0.21202337249336434, 0.13051472614702134, 0.0018344808218463615]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.